Geometry.Net - Pure_And_Applied_Math: Cellular Automata


Home - Pure_And_Applied_Math - Cellular Automata

e99.com Bookstore

Images

Newsgroups

121-140 of 159 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | Next 20

Cellular Automata: more books (100)

The Neighbourhood Rules: Land-use Interactions, Urban Dynamics and Cellular Automata Modelling (Netherlands Geographical Studies, 334) by M.J. Hagoort, 2006

Cellular automata for traffic flow modeling by Saifallah Benjaafar, 1997

Workshop on Computational Physics and Cellular Automata: Ouro Preto, Brazil, August 8-11, 1989 by Workshop on Computational Physics and Cellular Automata, David P. Landau, et all 1990-09

The cellular automata paradigm for the parallel solution of heat transfer problems (TR) by Bruce B Lowekamp, 1994

A cellular automata model for use with real freeway data for traffic prediction by Daniel J Dailey, 2002

Automated discovery of self-replicating structures in cellular space automata models (Computer science technical report series) by Jason D Lohn, 1996

Reliable computation with cellular automata (BUCS tech report) by PeÌter GaÌcs, 1985

Hardware implementation of cellular automata via the Cellular Neural Network Universal Machine (Memorandum) by Kenneth R Crounse, 1995

Computation in Cellular Automata: A Selected Review by Mitchell, Melanie, 1996

Parcella '94: Proceedings of the Vi. International Workshop on Parallel Processing by Cellular Automata and Arrays Held in Potsdam, September, 21-23 (Mathematical Research , Vol 81) by International Workshop on Parallel Processing by Cellular Automata And, Vesselin Jossifov, et all 1994-10

Parcella '88: Proceedings of the IV. International Workshop on Parallel Processing by Cellular Automata and Arrays, held in Berlin (GDR), October 17-21, 1988 (Mathematische Forschung)

Self-replicating structures in a cellular automata space (Computer science technical report series) by Hui-Hsien Chou, 1996

Algebraic properties of the block transformation on cellular automata (SFI working papers) by Cristopher Moore, 1995

Majority-vote cellular automata, ising dynamics, and P-completeness (SFI working papers) by Cristopher Moore, 1996

lists with details

Discrete, Amorphous Physical Models - Cellular Automata, Physics, Models Of Comp
Minimal discrete models. cellular automatalike animations without grids or synchronization; by Erik Rauch.
http://swiss.csail.mit.edu/~rauch/dapm/

Extractions: Discrete, Amorphous Physical Models Erik Rauch How minimal can a discrete model be? Discrete models of physical phenomena are an attractive alternative to continuous models such as partial differential equations. In discrete models, such as cellular automata, space is treated as having finitely many locations per unit volume and time is discrete, whereas continuous models (e.g. Schroedinger's equation, and most field theories) specify detail down to infinitesimal spatial and time scales. But all existing discrete models depend critically on a regular (crystalline) lattice, as well as the global synchronization of all sites. We should ask, on the grounds of minimalism, whether the global synchronization and regular lattice are inherent in any discrete formulation. Is it possible to do without these conditions and still have a useful physical model? Or are they somehow fundamental?
Bookmarks On Cellular Automata
It is a very good starting point for research into cellular automata. It includes topics such as artificial life, cellular automata, chaos, criticality,
http://www.rpi.edu/~brings/ca.bkmrks.html
David Ingalls Bell's Homepage
Articles on Conway's Game of Life and related cellular automata, free Unix software, archives of Life and other CA patterns.
http://www.canb.auug.org.au/~dbell/

Extractions: I am a computer programmer of much experience with an interest in science and mathematics. I was born and educated in the United States, but I now live in Canberra, Australia. My hobbies include Astronomy, Linux, and Conway's Game of Life. I am appreciative of the large amount of free software (with sources) that many others have written, and am happy that I have my own software to offer in return. This page has links to the best bits of it, mostly for UNIX and Linux. My EMail address is: dbell@canb.auug.org.au. fileselection 1.0 - Java application to manipulate lists of files. BrowserWatcher 1.0 - Java application to watch HTTP connections made by your browser. calc - an arbitrary precision programmable calculator with a C-like syntax. dblife 7.3 - a Life program running under X11 and UNIX with many editing features. - allows specified users to run certain commands as root. lifesrc 3.8 - a program that finds oscillators. hashlife 1.5
Computer Simulation Of Societies: Cellular Automata
Frequently Asked Questions About cellular automata A guide to cellular automata A tutorial on cellular automata By David G. Green, Environmental and
http://alife.ccp14.ac.uk/cress/research/simsoc/ca.html
Jason's Life Page
Patterns and resources for Conway's Game of Life and related cellular automata by Jason Summers.
http://home.mieweb.com/jason/life/

Extractions: Conway's Game of Life is a silly non-game where you have a grid of cells that can be either ON or OFF, and their states evolve according to simple rules. This site is primarily concerned with collecting interesting Game of Life patterns. For an introduction to Life, you should probably look somewhere else, such as this page Pattern collections (below) Links News from other web sites Jul 24: Life "Natural History" blog by Nick Gotts. Jul 18: First release of Golly , an industrial-strength pattern viewer by Tom Rokicki and Andrew Trevorrow. May 5: Several new patterns from Dean Hickerson: "Ruler" and "Jagged lines". Apr 19: New faster version of Tom Rokicki's Hashlife released. Mar 24: Stable Minsky Register Machine by Paul Chapman. Mar 8: Native Mac OS X version of Tom Rokicki's Hashlife, by Andrew Trevorrow.
Java Applets Collection
cellular automata HOME PAGE
http://www.cse.sc.edu/~bays/CAhomePage
LifeLab
Andrew Trevorrow's Macintosh application for exploring John Conway's Game of Life and other 2D cellular automata.
http://www.trevorrow.com/lifelab/index.html

Extractions: Life-related links LifeLab is a Mac application for exploring John Conway's Game of Life and other cellular automata. CAs were first studied in the mid-1950s by Stanislaw Ulam and John von Neumann. The subject became much more widely known in 1970 when Life was described by Martin Gardner in his Scientific American column. Life is played on an arbitrary-sized grid of square cells. Each cell has two states: "dead" or "alive". The state of every cell changes from one "generation" to the next according to the states of its 8 nearest neighbors: a dead cell becomes alive (a "birth") if it has exactly 3 live neighbors; a live cell dies out if it has less than 2 or more than 3 live neighbors. The "game" of Life simply involves starting off with a pattern of live cells and watching it evolve. Even though the rules for Life are completely deterministic, it is impossible to predict whether an arbitrary starting pattern will die out, or start oscillating, or fill the grid. Life and other CAs provide a powerful demonstration of how a very simple system can generate extremely complicated behavior. LifeLab is a Carbonized app that runs natively on OS X. It also runs on OS 8.6/9.x if CarbonLib 1.3 or later is installed.
Cellular Automata Machines - The MIT Press
Recently, cellular automata machines with the size, speed, and flexibility forgeneral experimentation at a moderate cost have become available to the
http://mitpress.mit.edu/book-home.tcl?isbn=0262200600
General Purpose Cellular Automata Programming | Lambda The Ultimate
In this thesis, a new cellular automata simulation environment, jTrend, is introduced.jTrend was developed on the Java platform for cellular automata
http://lambda-the-ultimate.org/node/view/840

Extractions: Home In this thesis , a new cellular automata simulation environment, jTrend , is introduced. jTrend was developed on the Java platform for cellular automata exploratory research. With a built-in high-level programming language and an easy-to-use graphical user interface, jTrend has become one of the most powerful cellular automata simulators, and can be used for most one- and two-dimensional cellular automata simulations. My queries about DSLs for cellular automata didn't get many responses, so perhaps this master thesis would be of interest. The language design isn't very radical, and the language is quite easy to grasp. The integration between the language and the simulation environment is a bit unusal (e.g., the cells neighborhood isn't defined in the code). By Ehud Lamm DSL login or register other blogs Flat list - collapsed Flat list - expanded Threaded list - collapsed Threaded list - expanded Date - newest first Date - oldest first 10 comments per page 30 comments per page 50 comments per page 70 comments per page 90 comments per page 150 comments per page 200 comments per page Select your preferred way to display the comments and click 'Save settings' to activate your changes.
Cellular Automata
automata.pasm Parrot assembly program to implement a cellular automata ofthe form described in Stephen Wolfram s book A New Kind of Science ,
http://www.andywardley.com/computers/parrot/automata.html

Extractions: This is my first real Parrot program which implements a simple, deterministic cellular automata of the form described in Stephen Wolfram's book "A New Kind of Science", Wolfram Media Inc., 2002, ISBN 1-57955-008-8, http://www.wolframscience.com/ Contents Parrot Assembly Source Code Program Output Rule 45 Rule 57 ... Rule 225 Parrot Assembly Source Code # # # automata.pasm # # Parrot assembly program to implement a cellular automata of the form # described in Stephen Wolfram's book "A New Kind of Science", Wolfram # Media Inc., 2002, ISBN 1-57955-008-8, http:://www.wolframscience.com/ # # Written by Andy Wardley Program Output The output of running the program with various rules is shown below. Rule 45 Rule 57 Rule 75 Rule 86 Rule 105 Rule 109 Rule 110 Rule 129 Rule 131 Rule 150 Rule 154 Rule 182 Rule 225
Cellular Automata And Geosimulation
cellular automata have their origins in the specification of the first digital If you are interested in learning more about cellular automata their
http://www.geosimulation.org/geosim/cellular_automata.htm

Extractions: Cellular automata have their origins in the specification of the first digital computers. They are simple information processing mechanisms. CA are ideal for simulating static entities in spatial models and processes that operate by diffusion. They are ideal for encoding spatial structures into simulation models. Scroll down for more details, or use the drop-down menu to navigate to other theme pages. Home CASA Sprawlsim My resume My publications My research projects Spatial complexity Cellular automata Multi-agent systems CA and MAS Web links Land-use + transport sims 3D visualization Email me @ ... An overview of cellular automata :: Overview of cellular automata models Cities as cellular automata Challenges in cellular automata research Cellular models of urban systems Links to cellular automata Web resources C ellular automata have their foundations in the specification of digital computers. They were pioneered by Alan Turing, John von Neumann, and Stanislaw Ulam, initially as computing media. Later, they have been adopted by other fields outside of computing and put to a wide variety of applications. They have been used in the simulation of urban phenomena with a recent flourish of activity. If you are interested in learning more about cellular automata: their origins and their use in urban geosimulation, you can check out a working paper, entitled, '
Moshe Sipper, A Brief Introduction To Cellular Automata
http://www.cs.bgu.ac.il/~sipper/ca.html
Minding The Planet: Cellular Automata
In essence, mobile cellular automata. The book summarizes work that dates back This rule is similar to cellular automata rules such as the famous Life
http://novaspivack.typepad.com/nova_spivacks_weblog/cellular_automata/

Extractions: About In a very interesting new finding, researchers have discovered the people's brains contain individual neurons, or small groups of neurons, that seem exist only to recognize particular people or concepts . This would imply that there is one neuron, or at least a small group of neurons, in our brains for every unique thing that we know. However, that raises certain questions for example, if this is true, then the brain should be a lot larger since there wouldn't be room to represent everything a typical adult knows with unique neurons in that amount of space. On the other hand, perhaps the memories are not stored on the neuronal level at all, but instead are stored and computed on the sub-neuronal tubulin "quantum computing" level, which is the subject of much research these days. For more on that check out this book on research into
TUTORIAL NOTES - Cellular Automata
A cellular automaton is an array of identically programmed automata, cellular automata models of landscapes consist of fixed arrays in which each cell
http://parallel.hpc.unsw.edu.au/complex/tutorials/tutorial1.html

Extractions: Environmental and Information Sciences Charles Sturt University The increasing prominence of computers has led to a new way of looking at the world. This view sees nature as a form of computation. That is, we treat objects as simple computers, each obeying its own set of laws. The "cellular automaton" extends this analogy to provide a way of viewing whole populations of interacting "cells", each of which is itself a computer (automaton). By building appropriate rules into a cellular automaton, we can simulate many kinds of complex behaviour, ranging from the motion of fluids governed by the Navier-Stokes equations to outbreaks of starfish on a coral reef. A cellular automaton is an array of identically programmed automata, or "cells", which interact with one another. The arrays usually form either a 1-dimensional string of cells, a 2-D grid, or a 3-D solid. Most often the cells are arranged as a simple rectangular grid, but other arrangements, such as a honeycomb, are sometimes used. The essential features of a cellular automaton ("CA" for short) are: its STATE is a variable that takes a different separate for each cell. The state can be either a number or a property. For instance if each cell represents part of a landscape, then the state might represent (say) the number of animals at each location or the type of forest cover growing there.
``Computation And Formal Language Theory May In General Be
``Computation Theory of cellular automata (1984). My interest in cellularautomata (CA) is an offshoot of my general interest in the problem of how
http://www.imsc.res.in/~sitabhra/research/ca/ca_res.html

Extractions: My interest in cellular automata (CA) is an offshoot of my general interest in the problem of how complexity arises in different (natural or artificial) physical systems. In particular, cellular automata provides an ideal model system in which to study the connection between dynamics and computation - invloving inputs from nonlinear dynamical systems theory, non-equilibrium statistical mechanics and the theory of computation. At present, I am involved in the study of the complexity of computational problems in one-dimensional cellular automata - and trying to see how that relates to the dynamical complexity seen in the time evolution of CAs. One of the main problems in studying dynamical ``complexity'' is that there is no well-defined, unambigous way to quantify it. In CAs, several measures, such as information entropy, mutual information, etc. have been used - but they are all ad hoc . Computer scientists, on the other hand, have had a well-accepted definition for complexity for a long time. They look at how the computational resources required to solve a problem scales with the size of the problem input, measured in bits. On this basis, computational problems have been divided into various classes. For our purpose, we may consider only 3 classes : P, NP and NP-complete.
NKS 2003
The mechanism within the method of cellular automata is able to generate Experiments in Architectural Form Generation Using cellular automata
http://www.iit.edu/~krawczyk/nks2003/

Extractions: Illinois Institute of Technology, College of Architecture, Chicago, IL. Panel A-1 Image Series Panel B-1 B-2 Interactive display As the cells pass from one generation to another they are normally subjected to the same survival/birth rule based on the same neighborhood count. This experiment explores the concept that at each generation a mutation is applied by randomly selecting a new rule and neighborhood count. Architecturally, the concept explores a method to break any evolving pattern so the forms are further unpredictable and offer an even wider range of configurations without introducing a natural style The boundary is set to unlimited throughout with the random selection using all thirty-seven rules and all four neighborhood types. In this series the life span is set to six generations and the space module is represented as a cube. The initial configuration consists of eight cells in a square arrangement having the center cell empty. The cells are represented as rectangular volumes. Panel C-1 C-2 As the cells pass from one generation to another they are normally subjected to the same survival/birth rule based on the same neighborhood count. This experiment explores the concept that at each generation a mutation is applied by randomly selecting a new rule and neighborhood count. Architecturally, the concept explores a method to break any evolving pattern so the forms are further unpredictable and offer an even wider range of configurations without introducing a natural style The boundary is set to unlimited throughout with the random selection using all thirty-seven rules and all four neighborhood types. In this series the life span is set to seven generations and the space module is represented as a cylinder. The initial configuration consists of eight cells in a square arrangement having the center cell empty. The cells are represented as cylindrical volumes.
Levitated | Cellular Automata Worm | Flash MX Open Source
Natural continuous form through cellular automata. Levitated Source is DailyComputational Nutrition providing essential generative, mathematical,
http://www.levitated.net/daily/levCAWorm.html
Cellular Automata
cellular automata are the simplest models of spatially distributed processes . You can have linear cellular automata,like the one shown in the applet,
http://www.ba.infn.it/~zito/automa.html

Extractions: Cellular Automata A spatial process is normally described by a set of PDE(Partial Differential Equations) with time,space and state space continuous.In a Cellular Automaton time is discrete like in a map, space is discrete (the cells of a cellular automaton) and also state space is discrete(each cell can have only a finite number of states). So it is the simplest dynamical system that describes systems evolving in space.
NKS-SJSU: Reversible Cellular Automata
Wolfram represented reversible cellular automata in which the new state of a cell is In the strict sense, those reversible cellular automata are time
http://sjsu.rudyrucker.com/~kwanghyung.paek/paper/

Extractions: Reversible Cellular Automata By Kwanghyun Paek Home Links Applets Papers ... Team Research Paper Click here for Presentation Slide Introduction Entropy and the Second Law Reversible Cellular Automata Second-order Technique Partitioning Technique Rule 37R Discussion References A cellular automaton is reversible (also called invertible or microscopically reversible), if its global map is invertible, i.e., for every possible state of the cellular automaton the global map specifies one and only one successor. If a cellular automaton is invertible, it therefore is deterministic in both directions of time. The rule that makes a cellular automaton go backward is called the inverse rule opposite to the direct rule that runs the cellular automaton forward direction of time. In general, the inverse rule is different from the direct rule except for trivial cases shown in the following figure. The technique used here generating reversible cellular automata can be applied to all one-dimensional cellular automata; however, no general procedure is known to determine whether a certain rule has an inverse rule. Some techniques for constructing invertible cellular automata were presented by Toffoli and Margolus [4].
CELLULAR AUTOMATA
cellular automata A Discrete Universe by Andrew Ilachinski (Center for Naval Analyses cellular automata are a class of spatially and temporally discrete
http://www.worldscibooks.com/chaos/4702.html

Extractions: Cellular automata are a class of spatially and temporally discrete mathematical systems characterized by local interaction and synchronous dynamical evolution. Introduced by the mathematician John von Neumann in the 1950s as simple models of biological self-reproduction, they are prototypical models for complex systems and processes consisting of a large number of simple, homogeneous, locally interacting components. Cellular automata have been the focus of great attention over the years because of their ability to generate a rich spectrum of very complex patterns of behavior out of sets of relatively simple underlying rules. Moreover, they appear to capture many essential features of complex self-organizing cooperative behavior observed in real systems. This book provides a summary of the basic properties of cellular automata, and explores in depth many important cellular-automata-related research areas, including artificial life, chaos, emergence, fractals, nonlinear dynamics, and self-organization. It also presents a broad review of the speculative proposition that cellular automata may eventually prove to be theoretical harbingers of a fundamentally new information-based, discrete physics. Designed to be accessible at the junior/senior undergraduate level and above, the book will be of interest to all students, researchers, and professionals wanting to learn about order, chaos, and the emergence of complexity. It contains an extensive bibliography and provides a listing of cellular automata resources available on the World Wide Web.

121-140 of 159 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | Next 20