Extractions: Five Cellular Automata Review Software for exploring five cellular automata: q-state Life (a generalization of Conway's Game of Life), the Belousov-Zhabotinsky Reaction, Togetherness, Viral Replication and Diffusion-Limited Aggregation. The documentation provides a complete description of the algorithms used.
Cellular Automata Over A Graph? Is anybody aware of a project that has created a cellular automatalike system, In contrast, a cellular automata-style system would view the rules as http://www.kimbly.com/blog/000414.html
Extractions: About Kim Is anybody aware of a project that has created a cellular automata-like system, but where the grid is replaced by a directed graph? In other words, each node has a state plus a list of neighboring nodes, and a rule for computing the next state as a function of those two things. Many relaxation-based graph layout algorithms are based on a data structure like this, but the rules are usually hand-crafted. In contrast, a cellular automata-style system would view the rules as being configurable. I've been thinking about using evolutionary algorithms to play around with source code. One of the most natural ways of doing this, to my mind, is to use a system like the one I just described. The directed graph would be the program AST, enriched with edges representing function references, variable references, and type references. My main open question right now is how to represent the node state and transition rules (these two things being intimately related). The state needs to be simple so that it is easily manipulable by the transition rules, yet it also needs to be sophisticated so that it can encode interesting information. I'm currently thinking of having a fixed number of state variables per node, but allowing each state variable to hold a set of values. That way you can get rich information (any number of values), with a simple interface (insert, remove, and query-membership). The state transition algorithm might be different for each node type. The instruction set would include SIMD instructions for working with all the edges of a given type, or all the values in a set, at once.
JCASim: Cellular Automata Simulation System The simulation package JCASim is used to simulate cellular automata. CAComb.With the package CAComb, cellular automata can be coupled, and simulated on http://www.jweimar.de/jcasim/
Extractions: Overview Examples Documentation Download Ads The program system JCASim is a general-purpose system for simulating cellular automata in Java. It includes a stand-alone application and an applet for web presentations. The cellular automata can be specified in Java, in CDL, or using an interactive dialogue. The system supports many different lattice geometries (1-D, 2-D square, hexagonal, triangular, 3-D), neighborhoods, boundary conditions, and can display the cells using colors, text, or icons. Contact: http://www.jweimar.de/ The simulation package JCASim is used to simulate cellular automata. With the package CAComb, cellular automata can be coupled, and simulated on several machines in parallel. With the package CAAnalysis, cellular automata are automatically analyzed. Mean-field and similar approximations are automatically calculated. Overview Examples Documentation Download Ads An example of moving objects, in this case simple fish swimming in schools. Another example for moving objects, in this case persons trying to leave a ship.
Extractions: Celluar Automata were invented by the mathematician Stanislaw Ulam and were used by J. von Neumann, followed by A.W. Burks and E.F. Codd, to solve problem of the non-trivial self-reproduction in a logical system. They are of interest to physicists as a models of simple local physics, to biologists as settings for models in theoretical biology, and to computer scientists as a setting for massive parallel processing in future computers and for other applications. On a regular lattice (repeated structure of points have the same kind of neighborhood) one puts a finite-state machine at each point. The input to the machine is the states of all machines in its neighborhood. The behaviour is to change its state based in a determined way, as a function of the states of its neighbors and its own state. The states of all machines in the lattice are updated synchronously (simultaneously). For this cellular automaton, one takes a neighborhood consisting of the nearest 8 cells to a cell on a two-dimensional grid of cells. The transition function for the local automaton is as follows: With these simple rules on an infinite 2D grid, it is possible to construct a machine capable of universal computation, that is, of emulating the computing power of any Turing machine or existing digital computer.
Cellular Automata Bibliography (1984) cellular automata Proceedings of an Interdisciplinary Workshop Hegselmann, Rainer (1994) cellular automata as a Tool to Model Social Dynamics , http://users.ox.ac.uk/~econec/cellaut.html
Extractions: Cellular Automata Bibliography Adamatzky, Andrew (1994) Identification of Cellular Automata (London: Taylor and Francis). [*0] * Albin, Peter S. (1975) The Analysis of Complex Socioeconomic Systems (Lexington, MA: D. C. Heath and Company/Lexington Books). [@28.50] [*0] Albin, Peter S. with Foley, Duncan K. (ed.) (1998) Barriers and Bounds to Rationality: Essays on Economic Complexity and Dynamics in Interactive Systems , (Princeton, NJ: Princeton University Press). Andre, David, Bennett III, Forrest H, and Koza, John R. (1996a) 'Evolution of Intricate Long Distance Communication Signals in Cellular Automata Using Genetic Programming', in Artificial Life V: Proceedings of the Fifth International Workshop on the Synthesis and Simulation of Living Systems (Cambridge, MA: The M. I. T. Press). [Uses GP to evolve CA rules for the majority classification task using ADFs. The evolved rule has a greater accuracy than the original benchmark Gacs-Kurdyumov-Levin (GKL) rule, all other known human-written rules and all other rules produced by known previous automated approaches. It is also qualitatively different from rules developed up until now.] Andre, David, Bennett III, Forrest H, and Koza, John R. (1996b) 'Discovery by Genetic Programming of a Cellular Automata Rule that is Better than Any Known Rule for the Majority Classification Problem', in Koza, John R., Goldberg, David E., Fogel, David B. and Riolo, Rick L. (eds.)
IFIP Cellular Automata Workshop 96 IFIP cellular automata Workshop 96 are inviting everyone interested in cellularautomata to a workshop taking place in Rauischholzhausen (Germany) from http://www.informatik.uni-giessen.de/cellular-automata-96/
Extractions: March 25 - 27, 1996 Under the head of the IFIP working group 14.5 we are inviting everyone interested in cellular automata to a workshop taking place in Rauischholzhausen (Germany) from March 25, 1996 to March 27, 1996 For further information you can also contact the organizers or send a mail via the World Wide Web.
Cellular Automata cellular automata (CA) are simple spatial processing models with their originsin the early architecture of digital computers designed in the 1940 and 1950s http://www.casa.ucl.ac.uk/research/c_a.htm
Extractions: Cellular Automata Cellular automata (CA) are simple spatial processing models with their origins in the early architecture of digital computers designed in the 1940 and 1950s. CA have close associations with complexity theory and have been employed in the exploration of a diverse range of urban phenomena, generally to investigate ideas about how real urban systems operate, but from a controlled experimental environment within computer software. Urban applications of CA range from traffic simulation and regional-scale urbanization to land-use dynamics, polycentricity, historical urbanization, and urban development.
Global Reversibility Of Cellular Automata Consider the onedimensional Boolean cellular automata defined such that the (This are discussed in more detail in cellular automata) One of the most http://www.mathpages.com/home/kmath439/kmath439.htm
Extractions: Global Reversibility of Cellular Automata Consider the one-dimensional Boolean cellular automata defined such that the new value of each cell is a fixed function of the current value of the cell and its two nearest neighbors. There are eight possible 3-bit strings, and the function ("rule") assigns the successor value for each of these strings. (This are discussed in more detail in Cellular Automata ) One of the most interesting of the 256 possible "rules" is the one based on the mapping indicated below: Since the binary number 00011110 equals decimal 30, this is commonly called "Rule 30". The result of applying this local rule iteratively to a 200-bit string (loop) beginning with a random set of initial values is shown below. In this figure the initial string is the bottom row, and the successor rows progress in the upward direction. The light colored cells are logical "0", and the dark cells are logical "1". In the previous article we discussed the prospects for reversing this type of cellular automata, i.e., given the values of all the cells at one instant, to find the predecessors. We noted that, of the 256 possible rules (or the 88 equivalence classes), only a few are directly invertible. Most rules cannot be locally inverted, because (in general) more than one predecessor string leads to the same successor string. Thus, in a sense, information is lost by the application of the rule. This is very clear in cases (such as Rule 37) where many strings cannot possibly be produced by the application of the rule to any predecessor string. Such rules represent contractions. (See
One Dimensional Cellular Automata This page lets you explore the cellular automata that are prominent in A New Kindof Science by Stephen Wolfram. The output consists of several rows of http://www.hostsrv.com/webmaa/app1/MSP/webm1010/onedca.msp
Extractions: The output consists of several rows of cells. The first row is the initial condition and successive rows are determined by the previous row and the rule that is selected. We assume periodic boundary conditions, which means that the first and last cell of each row are connected. Initial conditions: Ken Levasseur
Theoretical Biology/Bioinformatics Utrecht Formal models in ecology, spatial pattern formation, (molecular) evolution, immunology, and ethology. Formalisms range from mathematical models, cellular automata, genetic algorithms, to discreteevent individual-oriented simulation models. Bioinformatic approach typically involves spatial, multi-leveled models with many interacting entities whose behavior is determined by local information. http://www-binf.bio.uu.nl/
Extractions: Theoretical Biology / Bioinformatics Group Welcome to this public WWW server of the department of Theoretical Biology at the Utrecht University Faculty of Biology , the Netherlands. Our Theoretical Biology group performs fundamental research in Biology by means of formal models. Examples of the Biological areas that we cover are ecology, spatial pattern formation, (molecular) evolution, immunology, and ethology. Our formalisms range from mathematical models, cellular automata, genetic algorithms, to discrete-event individual-oriented simulation models. We have coined the term Bioinformatics for the study of informatic processes in biotic systems. Our Bioinformatic approach typically involves spatial, multi-leveled models with many interacting entities whose behavior is determined by local information. Overview of research Feel free to request reprints of any of our publications by an Email to one of the authors or to address listed below. Papers sorted by the year of publication: Publications
Artificial Life And Other Experiments A weboriented artificial-life site Alife, genetic-algorithm and cellular-automata experiments written in cross-platform web languages (Java, tcl/tk), with free source code. http://www.aridolan.com
Extractions: Home Page Email Site Map Home 1. The Alife I am fascinated by these three ideas about Evolution Artificial Life , and Computers Contains various experiments in web site design and navigation, Photo Manipulation, Bioinformatics, ASP, ASP.NET, XML, VML and Alife 2. The Dolls I used plastic dolls as words, and made them say what I wanted: "When I use a word," Humpty Dumpty said in rather a scornful tone, "it means just what I choose it to mean- neither more nor less." "The question is," said Alice, "whether you CAN make words mean so many different things."
LIFE - Discontinued Services Page This service has been discontinued. We apologise for any inconvenience. Services thathave been moved are listed at the bottom of this page. http://life.csu.edu.au/discontinued.html
Java CA Applet This page has been moved to my new site at www.softrise.co.uk Please email meif you cannot find the page you are looking for. http://ourworld.compuserve.com/homepages/cdosborn/
Capow This page has been moved to. http//www.cs.sjsu.edu/faculty/rucker/capow/ http://www.mathcs.sjsu.edu/capow/
Institut Für Wissenschaftliches Rechnen Institut für Wissenschaftliches Rechnen. Startseite Institut Mitarbeiter Wegbeschreibung Wiki Portal Lehre Übersicht Dieses Semester http://www.wire.tu-bs.de/
141-159 of 159 Back | 1
| 2
| 3
| 4
| 5
| 6
| 7
| 8
