Michael J. Fox

Learn More
— Existing work on programmable self-assembly has focused on deterministic performance guarantees—stability of desirable states. In particular, for any acyclic target graph a binary rule set can be synthesized such that the target graph is the uniquely stable assembly. If the number of agents is finite, communication and consensus algorithms are necessary(More)
We analyze a novel model of the co-evolution of linguistic community structure and language. Intuitively, agents want to communicate well with others in their linguistic community, and similarly , linguistic communities consist of those agents that can communicate effectively amongst themselves. Absent the effects of comunity structure, the model suffers(More)
In distributed self-assembly, a multitude of nodes, or agents, seek to form copies of a given target graph. The target graph is identified as the vertices of a labeled graph. Agents encounter each other in spontaneous pairwise interactions and decide whether or not to form or sever edges based on their two labels and a fixed set of local interaction rules(More)
We study an atomic signaling game under stochastic evolutionary dynamics. There are a finite number of players who repeatedly update from a finite number of available languages/signaling strategies. Players imitate the most fit agents with high probability or mutate with low probability. We analyze the long-run distribution of states and show that, for(More)
The SLD detector consists of five major subsystems, each with associated front-end electronics and an integrated FASTBUS control and data acquisition system. This paper highlights the choices among electronic technologies that have been developed for the SLD detector electronics. The common control, calibration, and data acquisition architectures are(More)