Amorphous Computing: Related Sites
Last update: 7/25/02
Amorphous Computing Related
Models of Morphogenesis and Development Biology
Ants, Artificial Life, and Complex Systems
MEMS devices, Sensor Nets, etc
Pister's group at Berkeley. Smart Dust, Macromotes and finally the
now commercially avialble Berkeley
motes; also more recently micromechanical robots and flying
insects. Also, see a very nice Master's thesis by James McLurkin
titled "Algorithms for Distributed Sensor Networks".
Matter Group at Xerox PARC (Andy Berlin, et al). Active columns
with sensors/actuators to adapt to stress, airvalve arrays to
programmably route paper.
- Chih-Ming Ho's Research Group
at UCLA, airplane wing with sensors and actuators to control
surface shear stress and reduce drag.
- Other MEMs resources:
UCLA EE Low Power Wireless Integrated Microsensors (WINS), MEMs Clearinghouse
- NEST (Network Embedded Systems) Project, by DARPA. MIT AI Lab and Space
Lab(Shrobe, Williams, Bachrach, etc). Many other groups at
different universities exploring ideas and paradigms for programming
smart dust, and using the Berkeley motes.
- Deborah Estrin's
Group at UCLA, algorithms for wireless sensor networks.
Self-Reconfigurable Modular Robotics
Swarms and Distributed Mobile Robots
- Pervasive Computing and Ad-Hoc Networking: Hari BalaKrishnan's
group at MIT, Hyphos by Robert Poor (PhD Thesis 2001, MIT Media
Lab), with routing by climbing gradients.
- Packet Radio Networking: Alot of relevant old work from the 70s
(e.g. Silvester and Kleinrock, why six is a magic number).
- Nancy Lynch
Distributed Computing at MIT
Baruch's Research page Several interesting areas like distributed
memeory management, routing, topology aggregation. Several papers on
clustering (group formation).
- Some interesting people who have worked on graph algorithms -
symmetry breaking, coloring, network flow, etc.
Serge Plotkin ,
Andrew V. Goldberg
Searching the HBP Bibliographies Bibliographies of alot of
distributed algorithms work. Can search for various
papers. Unfortunately you still have to go to the library to get the
paper. Many of the people involved do not have very good web pages.
Self-Stabilization Stabilization of some distributed system from
an illegal state (due to faults or message loss) to a legal state in a
finite number of steps. Origins in a Djikstra paper (1974). Deals with
the design of fault tolerant algorithms and has been applied to
problems like token ring, mutual exclusion, synchronisation and
Back to Amorphous HomePage