5,164 research outputs found
Gathering an even number of robots in an odd ring without global multiplicity detection
We propose a gathering protocol for an even number of robots in a ring-shaped
network that allows symmetric but not periodic configurations as initial
configurations, yet uses only local weak multiplicity detection. Robots are
assumed to be anonymous and oblivious, and the execution model is the non-
atomic CORDA model with asynchronous fair scheduling. In our scheme, the number
of robots k must be greater than 8, the number of nodes n on a network must be
odd and greater than k+3. The running time of our protocol is O(n2)
asynchronous rounds.Comment: arXiv admin note: text overlap with arXiv:1104.566
Chiral structures of lander molecules on Cu(100)
Supramolecular assemblies of lander molecules (CH) on Cu(100)
are investigated with low-temperature scanning tunneling microscopy. The
energetically most favourable conformation of the adsorbed molecule is found to
exist in two mirror symmetric enantiomers or conformers. At low coverage, the
molecules align in enantiomerically pure chains along the chiral directions
and . The arrangement is proposed to be
mainly governed by intermolecular van-der-Waals interaction. At higher
coverages, the molecular chains arrange into chiral domains, for which a
structural model is presented.Comment: to appear in Nanotechnology vol. 15 (2004
Rendezvous of Two Robots with Constant Memory
We study the impact that persistent memory has on the classical rendezvous
problem of two mobile computational entities, called robots, in the plane. It
is well known that, without additional assumptions, rendezvous is impossible if
the entities are oblivious (i.e., have no persistent memory) even if the system
is semi-synchronous (SSynch). It has been recently shown that rendezvous is
possible even if the system is asynchronous (ASynch) if each robot is endowed
with O(1) bits of persistent memory, can transmit O(1) bits in each cycle, and
can remember (i.e., can persistently store) the last received transmission.
This setting is overly powerful.
In this paper we weaken that setting in two different ways: (1) by
maintaining the O(1) bits of persistent memory but removing the communication
capabilities; and (2) by maintaining the O(1) transmission capability and the
ability to remember the last received transmission, but removing the ability of
an agent to remember its previous activities. We call the former setting
finite-state (FState) and the latter finite-communication (FComm). Note that,
even though its use is very different, in both settings, the amount of
persistent memory of a robot is constant.
We investigate the rendezvous problem in these two weaker settings. We model
both settings as a system of robots endowed with visible lights: in FState, a
robot can only see its own light, while in FComm a robot can only see the other
robot's light. We prove, among other things, that finite-state robots can
rendezvous in SSynch, and that finite-communication robots are able to
rendezvous even in ASynch. All proofs are constructive: in each setting, we
present a protocol that allows the two robots to rendezvous in finite time.Comment: 18 pages, 3 figure
Correlation between Tc and Lattice Parameters of Novel Superconducting NaxCoO2 yH2O
We synthesized the five batches of the samples of the novel P3 type
superconductor, Na(HO)CoOHO, by the
soft chemical process starting from -NaCoO. The chemical and
structural properties varied rather widely from batch to batch, with a result
that varied from 4.6 K to 3.2 K. The magnetic susceptibility above
shows upturn at low temperature as in the case of the P2 phase. The
seems to be well correlated to the lattice parameters.Comment: 2 pages, 2 figures, and 1 table, to be published in J. Phys. Soc.
Jpn. 73 (9) with possible minor revision
On local boundary CFT and non-local CFT on the boundary
The holographic relation between local boundary conformal quantum field
theories (BCFT) and their non-local boundary restrictions is reviewed, and
non-vacuum BCFT's, whose existence was conjectured previously, are constructed.Comment: 16 pages. Contribution to "Rigorous Quantum Field Theory", Symposium
in honour of J. Bros, Paris, July 2004. Based on joint work math-ph/0405067
with R. Long
Design requirements and development of an airborne descent path definition algorithm for time navigation
The design requirements for a 4D path definition algorithm are described. These requirements were developed for the NASA ATOPS as an extension of the Local Flow Management/Profile Descent algorithm. They specify the processing flow, functional and data architectures, and system input requirements, and recommended the addition of a broad path revision (reinitialization) function capability. The document also summarizes algorithm design enhancements and the implementation status of the algorithm on an in-house PDP-11/70 computer. Finally, the requirements for the pilot-computer interfaces, the lateral path processor, and guidance and steering function are described
Gauge Group and Topology Change
The purpose of this study is to examine the effect of topology change in the
initial universe. In this study, the concept of -cobordism is introduced to
argue about the topology change of the manifold on which a transformation group
acts. This -manifold has a fiber bundle structure if the group action is
free and is related to the spacetime in Kaluza-Klein theory or
Einstein-Yang-Mills system. Our results revealed that fundamental processes of
compactification in -manifolds. In these processes, the initial high
symmetry and multidimensional universe changes to present universe by the
mechanism which lowers the dimensions and symmetries.Comment: 8 page
- …