Results 1 - 10 of 95,444

Organizing a Global Coordinate System from Local Information on an Amorphous Computer

by Radhika Nagpal , 1999
"... This paper demonstrates that it is possible to generate a reasonably accurate coordinate system on randomly distributed processors, using only local information and local communication. By coordinate system we imply that each element assigns itself a logical coordinate that maps to its global phy ..."
Abstract - Cited by 339 (7 self) - Add to MetaCart
This paper demonstrates that it is possible to generate a reasonably accurate coordinate system on randomly distributed processors, using only local information and local communication. By coordinate system we imply that each element assigns itself a logical coordinate that maps to its global

Organizing a Global Coordinate System from

by Local Information On, Radhika Nagpal, Howard Shrobe, Jonathan Bachrach , 2003
"... We demonstrate that it is possible to achieve accurate localization and tracking of a target in a randomly placed wireless sensor network composed of inexpensive components of limited accuracy. The crucial enabler for this is a reasonably accurate local coordinate system aligned with the global ..."
Abstract - Add to MetaCart
We demonstrate that it is possible to achieve accurate localization and tracking of a target in a randomly placed wireless sensor network composed of inexpensive components of limited accuracy. The crucial enabler for this is a reasonably accurate local coordinate system aligned with the global

Predicting Internet Network Distance with Coordinates-Based Approaches

by T. S. Eugene Ng, Hui Zhang - In INFOCOM , 2001
"... In this paper, we propose to use coordinates-based mechanisms in a peer-to-peer architecture to predict Internet network distance (i.e. round-trip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is bas ..."
Abstract - Cited by 631 (6 self) - Add to MetaCart
is based on relative coordinates that are simply the distances from a host to some special network nodes. We propose the second mechanism, called Global Network Positioning (GNP), which is based on absolute coordinates computed from modeling the Internet as a geometric space. Since end hosts maintain

Awareness and Coordination in Shared Workspaces

by Paul Dourish, Victoria Bellotti - Proc. of the Conf. on Computer Supported Cooperative Work (CSCW´92 , 1992
"... Awareness of individual and group activities is critical to successful collaboration and is commonly supported in CSCW systems by active, information generation mecha-nisms separate from the shared workspace. These mechanisms pena~ise information providers, presuppose rel-evance to the recipient, an ..."
Abstract - Cited by 811 (14 self) - Add to MetaCart
Awareness of individual and group activities is critical to successful collaboration and is commonly supported in CSCW systems by active, information generation mecha-nisms separate from the shared workspace. These mechanisms pena~ise information providers, presuppose rel-evance to the recipient

Vivaldi: A Decentralized Network Coordinate System

by Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris - In SIGCOMM , 2004
"... Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a simp ..."
Abstract - Cited by 602 (4 self) - Add to MetaCart
simple, light-weight algorithm that assigns synthetic coordinates to hosts such that the distance between the coordinates of two hosts accurately predicts the communication latency between the hosts.

Next century challenges: Scalable coordination in sensor networks

by Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar , 1999
"... Networked sensors-those that coordinate amongst them-selves to achieve a larger sensing task-will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present uniq ..."
Abstract - Cited by 1116 (37 self) - Add to MetaCart
simple local node behavior achieves a desired global objective) may be necessary for sensor net-work coordination. In this paper, we describe localized algorithms, and then discuss directed diffusion, a simple com-unication model for describing localized algorithms.

Distributed Snapshots: Determining Global States of Distributed Systems

by K. Mani Chandy, LESLIE LAMPORT - ACM TRANSACTIONS ON COMPUTER SYSTEMS , 1985
"... This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to s ..."
Abstract - Cited by 1208 (6 self) - Add to MetaCart
This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps

Virtual time and global states of distributed systems.

by Friedemann Mattern - Proc. Workshop on Parallel and Distributed Algorithms, , 1989
"... Abstract A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized \ r eal world" and helps to solve problems like getting a c ..."
Abstract - Cited by 744 (5 self) - Add to MetaCart
Abstract A distributed system can be characterized by the fact that the global state is distributed and that a common time base does not exist. However, the notion of time is an important concept in every day life of our decentralized \ r eal world" and helps to solve problems like getting a

Cortical surface-based analysis II: Inflation, flattening, and a surface-based coordinate system

by Bruce Fischl, Martin I. Sereno, Anders M. Dale - NEUROIMAGE , 1999
"... The surface of the human cerebral cortex is a highly folded sheet with the majority of its surface area buried within folds. As such, it is a difficult domain for computational as well as visualization purposes. We have therefore designed a set of procedures for modifying the representation of the c ..."
Abstract - Cited by 738 (57 self) - Add to MetaCart
of the cortical surface to (i) inflate it so that activity buried inside sulci may be visualized, (ii) cut and flatten an entire hemisphere, and (iii) transform a hemisphere into a simple parameterizable surface such as a sphere for the purpose of establishing a surface-based coordinate system.

Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules

by A. Jadbabaie, J. Lin, A. S. Morse , 2002
"... In a recent Physical Review Letters paper, Vicsek et. al. propose a simple but compelling discrete-time model of n autonomous agents fi.e., points or particlesg all moving in the plane with the same speed but with dierent headings. Each agent's heading is updated using a local rule based on ..."
Abstract - Cited by 1290 (62 self) - Add to MetaCart
coordination and despite the fact that each agent's set of nearest neighbors change with time as the system evolves. This paper provides a theoretical explanation for this observed behavior. In addition, convergence results are derived for several other similarly inspired models.
Results 1 - 10 of 95,444