Peter Barmettler, Ana Maria Rey, Eugene Demler, Mikhail D. Lukin, Immanuel Bloch, and Vladimir Gritsev Department of Physics, University of Fribourg, CH-1700 Fribourg, Switzerland Institute of Theoretical Atomic, Molecular and Optical Physics, Harvard University, Cambridge, Massachusetts 02138, USA Department of Physics, Harvard University, Cambridge, Massachusetts 02138, USA Institut für Physi...

We present a reinterpretation and extension of the reciprocal theorem for swimmers, extending its application from the motion of a single swimmer in an unbounded domain to the general setting, giving results for both swimmer interactions and general hydrodynamics. We illustrate the method for a squirmer near a planar surface, recovering standard literature results and extending them to a genera...

Bovet, Crescenzi, and Silvestri ( 1992, 1995), and independently Vereshchagin ( 1994), showed that many complexity classes in the polynomial time setting are leaf language classes, i.e. classes which are determined by two disjoint languages. They gave many examples but they did not characterize the set of leaf language classes. This will be done in &his paper. It will be shown that the set of l...

a The Author 2010. Published by Oxford University Press on behalf of the Johns Hopkins Bloomberg School of Public Health. This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.5), which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the or...

O. Tsyplyatyev,1 A. J. Schofield,2 Y. Jin,3 M. Moreno,3 W. K. Tan,3 A. S. Anirban,3 C. J. B. Ford,3 J. P. Griffiths,3 I. Farrer,3 G. A. C. Jones,3 and D. A. Ritchie3 1Institut für Theoretische Physik, Universität Frankfurt, Max-von-Laue Strasse 1, 60438 Frankfurt, Germany 2School of Physics and Astronomy, University of Birmingham, Birmingham, B15 2TT, United Kingdom 3Cavendish Laboratory, Unive...

Even though tree-based reliable multicast protocols are known to be most scalable for one-to-many sessions, there is still an open question whether these protocols are also scalable for many-to-many sessions. We analyze and compare two promising multicast protocols-the receiver-initiated protocol with NACK suppression and the tree-based protocol-using a new spatial loss model. The proposed mode...

Multiplayer perceptrons or feed-forward networks are generally trained to represent functions or many-to-one (m-o) mappings. This creates a problem if the training data exhibits the property of many-to-many or almost many-many valued-ness because the model, which generated the data, was many-to-many. Therefore in this paper a modified feed-forward network and training algorithm is considered to...

An overlooked problem in Learning From Demonstration is the ambiguity that arises, for instance, when the robot is equipped with more sensors than necessary for a certain task. Simply trying to repeat all aspects of a demonstration is seldom what the human teacher wants, and without additional information, it is hard for the robot to know which features are relevant and which should be ignored....

DEFINITION As stated in the entry “Publish/Subscribe over Streams”, publish/subscribe (pub/sub) is a many-to-many communication model that directs the flow of messages from senders to receivers based on receivers’ data interests. In this model, publishers (i.e., senders) generate messages without knowing their receivers; subscribers (who are potential receivers) express their data interests, an...

Weblogs have recently emerged as a popular means of sharing information on the Web. While they effectively foster the networking of participants on a one-to-one basis, so far they have been lacking the capacity of allowing the establishment of many-to-many communication relationships. This paper describes recent work on facilitating group-forming processes and the sharing of content among weblo...