Exact limiting solutions for certain deterministic traffic rules

We analyze the steady-state flow as a function of the initial density for a class of deterministic cellular automata rules (``traffic rules'') with periodic boundary conditions [H. Fuks and N. Boccara, Int. J. Mod. Phys. C 9, 1 (1998)]. We are able to predict from simple considerations the observed, unexpected cutoff of the average flow at unity. We also present an efficient algorithm for determining the exact final flow from a given finite initial state. We analyze the behavior of this algorithm in the infinite limit to obtain for R_m,k an exact polynomial equation maximally of 2(m+k)th degree in the flow and density.Comment: 25 pages, 8 figure

Storm: Using P2P to Make the Desktop Part of the Web

We present Storm, a storage system which unifies the desktop and the public network, making Web links between desktop documents more practical. Storm assigns each document a permanent unique URI when it is created. Using peer-to-peer technology, we can locate documents even though our URIs do not include location information. Links continue to work unchanged when documents are emailed or published on the network. We have extended KDE to understand Storm URIs. Other systems such as GNU Emacs are able to use Storm through an HTTP gateway

Fillets: Cues for Connections in Focus+Context Views of Graph-like Diagrams

We apply fillets --- smoothing of sharp angles at the joints --- between the connections and nodes of graph-like diagrams. In situations where the graph layout is constrained, e.g. Focus+Context views or views where the coordinates of the nodes are informative, fillets can clarify the relationships considerably without altering the layout. A visua