1. Cellular Automata Back to Bioinformatics. Enhanced by Neuroinformation. Cellular Automata (102 References) Zhu, H., B. Yin, et al. (2003). Simulation application of wholeheart http://lansbury.bwh.harvard.edu/cellular_automata.htm

Home About Us eMedicine Search Drug Development ... Useful Links Back to Bioinformatics Enhanced by Neuroinformation Cellular Automata (102 References) Zhu, H., B. Yin, et al. (2003). "[Simulation application of whole-heart electophysiological model]." Sheng Wu Yi Xue Gong Cheng Xue Za Zhi We invented an efficiently approach to building whole-heart electrophysiological model with cellular automata style massive parallel computing. In this paper, we introduce the simulation facilities of a model we built and the potential application of such model. The first use is to solve the forward problem of electrocardiogram. Simulating arrhythmia ECG and accurately interpreting the significance of various irregular waveforms will be the key goal. Investigating the dynamic property of cardioelectrical activity at cellular and channel levels is the second application, aiming at revealing the mechanism of the generation and sustentation of arrhythmia. Third, the model can be used to research the impacts of artificial interventions on cardioelectrical activity. Electrical defibrillation and pace-making as well as the use of channel block agents are all cases. Matsukidaira, J. and K. Nishinari (2003). "Euler-lagrange correspondence of cellular automaton for traffic-flow models."

2. Open Directory - Computers Artificial Life Cellular Automata Jan 2, 2007 Capow98 Cellular Automata and Electric Power - A Windows application that can simulate and analyze various one-dimensional and http://205.188.95.207/Computers/Artificial_Life/Cellular_Automata/

about dmoz dmoz blog suggest URL update listing ... help the entire directory only in Artificial_Life/Cellular_Automata Description Top Computers Artificial Life Cellular Automata Conway's Game of Life Processors See also: Computers: Computer Science: Theoretical: Automata Theory Algorithms based on CA Rule110 - Tiles - Papers and other documents by Abdiel Caceres Gonzalez related with computability in normal evolutions of cellular automata, in particular with evolution rule 110, some studies about entropy and tiling with software for mac os X. Ant for DOS 1.1 - An open source implementation of Langton's ant in Q-Basic. Supports older monitors; by Robin Upton. CAGE - A generic and extensible cellular automaton simulation engine written in Python. Cafun Capow98 - Cellular Automata and Electric Power - A Windows application that can simulate and analyze various one-dimensional and two-dimensional cellular automata, part of the Cellular Automata and Electric Power project lead by Dr. Rudy Rucker. Cellular Automata Generator - An interactive cellular automata generator with C++ source code available for downloading; by Kevin McDermott.

3. Cellular Automata - Wikibooks, Collection Of Open-content Textbooks This book aims to become a graduate to postgraduate level schoolbook on cellular automata. For those looking for a short informal introduction, see the Wikipedia page Cellular http://en.wikibooks.org/wiki/Cellular_Automata

Cellular Automata From Wikibooks, the open-content textbooks collection Jump to: navigation search This book aims to become a graduate to postgraduate level schoolbook on cellular automata. For those looking for a short informal introduction, see the Wikipedia page Cellular automaton edit Table of Contents Wikibook Development Stages Sparse text Developing text Maturing text Developed text Comprehensive text: Introduction Glossary Formalization Mathematical Model ... Pattern Forward processing Stephen Wolfram Classification Reverse processing Counting Preimages Listing Preimages Preimages Decision Problems Boundary Conditions ... Global Dynamics Statistical Analysis Information content Information Dynamics Information and Reversibility Self Replication and Evolution Applications of Cellular Automata Artificial Life Partial Differential Equations Fluid Dynamics (Lattice-Gas Cellular Automata) Excitable media (reaction-diffusion PDE) Image Processing (morphological operators) Examples Examples on rule 110 Examples of Plankton and Fish Dynamics References ... edit Notes for contributors There is a sandbox for experimenting.

4. Cellular Automata | Ask.com Encyclopedia A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and http://www.ask.com/wiki/Cellular_automata?qsrc=3044

5. Geosimulation :: Innovative Geospatial Research Background material on the following topics is available on this site Geosimulation; Spatial complexity; Cellular automata; Agentbased models; Land-use and transport models http://www.geosimulation.org/geosim/cellular_automata.htm

Home Background Book Research ... ASU School of Geographical Sciences , torrens at geosimulation dot com Background material on the following topics is available on this site: Geosimulation Spatial complexity Cellular automata Agent-based models ... 3D visualization and geovisualization Cellular 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, ' How cellular models of urban sytems work ', penned by yours truly. Cellular automata consist of several key components: cells arranged evenly on a tessellated grid-space, cell states, neighborhoods, transition rules, and time. The cell space on which a cellular automaton operates might be considered equivalent in an urban sense to an environment, a landscape, or a territory. The cell space in a cellular automaton is assumed to be both regular in structure, i.e., it resembles a checkered grid like a chess table (although it does not have to be regular), and infinite in extent (infinity is generally achieved by describing the cell space as a torus: its edges 'wrap around' on themselves; again, the cell space does not

6. Cellular Automata Method For Generating Random Cave-Like Levels - RogueBasin Apr 29, 2010 It is an old and fairly well documented trick to use cellular automata to generate cavelike structures. The basic idea is to fill the map http://roguebasin.roguelikedevelopment.org/index.php?title=Cellular_Automata_Met

7. Cellular Automata Laboratory An extendable DOS/Windows application for exploring cellular automata, accompanied by a thorough user guide; by Rudy Rucker and John Walker. http://www.fourmilab.ch/cellab/

by Rudy Rucker and John Walker Introduction (from the User Guide Cellular automata are self-generating computer graphics movies. The most important near-term application of cellular automata will be to commercial computer graphics; in five years you won't be able to watch television for an hour without seeing some kind of CA. Three other key applications of cellular automata will be to simulation of biological systems (artificial life), to simulation of physical phenomena (heat-flow and turbulence), and to the design of massively parallel computers. Most of the programs in the Rudy Rucker Cellular Automata Lab (CelLab) are two-dimensional cellular automata. In these programs the computer screen is divided up into "cells" which are colored rectangles or dots. Each cell is repeatedly "updated" by changing its old color to a new color. The net effect of the individual updates is that you see an ever-evolving sequence of screens. A graphics program of this nature is specifically called a cellular automaton when it is 1) parallel, 2) local, and 3) homogeneous. Parallelism means that the individual cell updates are performed independently of each other. That is, we think of all of the updates being done at once.

8. Cellular Automata Reversible Cellular Automata, neighbourhoods, billiard ball machines, Java applets. By Tim Tyler. http://cell-auto.com/

var image_directory = "lib/tree/images/"; Cellular automata Reversible cellular automata Introduction to reversible automata On reversible logic Designing reversible automata Billiard ball machines ... Cellular Automata Automata whose inverses have large neighbourhoods Automata whose inverses have unboundedly large neighbourhoods Invertable honeycomb automata ... automata Public key cryptography using cellular automata Public key cryptography using cellular automata Public key cryptography using cellular automata - bibliography Implementing automata in hardware Cellular automata hardware Hardware for cellular automata Crystalline computation Miscellaneous Composite automata Wolfram's numbering scheme for his "elementary" automata Isomorphic automata Neighbouring domains Cellular Automata FAQ Finite Nature Java applets Reaction-diffusion cellular automata ] - in [ Texture Garden Fractal Drainage ] - patterns caused by erosion and drainage Diffusion-limited aggregation ] - fractal growth Self-reproducing cellular automata HAL ] - self-reproducing universal cellular automaton HexHAL ] - hexagonal version of [ HAL Revoworms ] - reversible self-reproducing worms Crystal 1D ] - self-reproducing cellular automaton Crystal 2D ] - self-reproducing cellular automaton Physics Interference ] - interference patterns in a cellular automaton Fredkin CA ] - a 3D cellular automaton Solitons ] - omnidirectional gliders Reversible diffusion ] - reversible diffusion and lattice gasses Water simulation cellular automata ] - in [ Texture Garden Membrane models

9. Modern Cellular Automata - Live Color Cellular Automata Java powered plethora of live color cellular automata with traditional, fractal, pattern, and unique hexagonal cellular automata. Free software. http://www.collidoscope.com/modernca/

10. Cellular Automata And The Edge Of Chaos David J. Eck s Javaillustrated introduction to 1-dimensional cellular automata. http://math.hws.edu/xJava/CA/

New in June 2004: A new version of EdgeOfChaos is available that can use file and save images (when run as an application). The new version requires Java 1.4 or higher. See Page 7 of this site for more information. Cellular Automata And the Edge of Chaos A computer follows rules. At each moment, the rules determine exactly what the computer will do next. We say that a computer is an example of an automaton . Other, simpler examples of automata also exist. ( Automata is the plural of automaton .) These more abstract rule-following devices can be easier to study computers, and they can be interesting to study in their own right. One type of automaton that has received a lot of attention is cellular automata . For one thing, they make pretty pictures. For another, they are related to exciting new ideas such as artificial life and the edge of chaos. Here is a fairly simple example: An applet showing a cellular automaton would appear here in browsers that support Java. If you would like to learn more about cellualr automata, here are some pages of information and Java applets that you can look at. (The most interesting things here are the applet on page 6, and the newer version of the same applet on page 7, which can make some awfully nice pictures, such as this one (117 kilobytes).)

11. Cellular Automaton - Wikipedia, The Free Encyclopedia A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in computability theory, mathematics, physics, complexity science, http://en.wikipedia.org/wiki/Cellular_automaton

Cellular automaton From Wikipedia, the free encyclopedia Jump to: navigation search Gosper's Glider Gun creating " gliders " in the cellular automaton Conway's Game of Life A cellular automaton (pl. cellular automata , abbrev. CA ) is a discrete model studied in computability theory mathematics physics complexity science ... theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states , such as "On" and "Off" (in contrast to a coupled map lattice ). The grid can be in any finite number of dimensions. For each cell, a set of cells called its neighborhood (usually including the cell itself) is defined relative to the specified cell. For example, the neighborhood of a cell might be defined as the set of cells a distance of 2 or less from the cell. An initial state (time t =0) is selected by assigning a state for each cell. A new generation is created (advancing t by 1), according to some fixed rule (generally, a mathematical function) that determines the new state of each cell in terms of the current state of the cell and the states of the cells in its neighborhood. For example, the rule might be that the cell is "On" in the next generation if exactly two of the cells in the neighborhood are "On" in the current generation, otherwise the cell is "Off" in the next generation. Typically, the rule for updating the state of cells is the same for each cell and does not change over time, and is applied to the whole grid simultaneously, though exceptions are known.

12. Cellular Automaton -- From Wolfram MathWorld Oct 11, 2010 Cellular automata come in a variety of shapes and varieties. One of the most fundamental properties of a cellular automaton is the type of http://mathworld.wolfram.com/CellularAutomaton.html

13. Cellular Automata A Java applet demonstrating cellular automata models of cardiac dynamics; by Gil Bub. http://www.cnd.mcgill.ca/bios/bub/CAs.html

14. Historical Notes: History Of Cellular Automata Historical notes from Stephen Wolfram's 'A New Kind of Science' http://www.wolframscience.com/reference/notes/876b

SOME HISTORICAL NOTES From: Stephen Wolfram, A New Kind of Science Notes for Chapter 2: The Crucial Experiment Section: Why These Discoveries Were Not Made Before Page History of cellular automata. Despite their very simple construction, nothing like general cellular automata appear to have been considered before about the 1950s. Yet in the 1950s - inspired in various ways by the advent of electronic computers - several different kinds of systems equivalent to cellular automata were independently introduced. A variety of precursors can be identified. Operations on sequences of digits had been used since antiquity in doing arithmetic. Finite difference approximations to differential equations began to emerge in the early 1900s and were fairly well known by the 1930s. And Turing machines invented in 1936 were based on thinking about arbitrary operations on sequences of discrete elements. (Notions in physics like the Ising model do not appear to have had a direct influence.) The best-known way in which cellular automata were introduced (and which eventually led to their name) was through work by John von Neumann in trying to develop an abstract model of self-reproduction in biology - a topic which had emerged from investigations in cybernetics. Around 1947 - perhaps based on chemical engineering - von Neumann began by thinking about models based on 3D factories described by partial differential equations. Soon he changed to thinking about robotics and imagined perhaps implementing an example using a toy construction set. By analogy to electronic circuit layouts he realized however that 2D should be enough. And following a 1951 suggestion from

15. Cellular Automata An interactive cellular automata generator with C++ source code available for downloading; by Kevin McDermott. http://kidojo.com/~yebb/cellauto/

Main Generate Cellular Automata Play and Download Sudoku The Cellular Automaton The source code to my Cellular Automaton image generator can be found here . It is C++ source code that outputs a raw pgm image file to stdout. It should compile under most C++ compilers, although it has only been tested with the g++ compiler on Linux. I am releasing it under the GNU Public License (GPL), so do with it as is appropriate under that license. The cellular automaton consists of a line of cells, each colored either black or white. At every step there is then a definite rule that determines the color of a given cell from the color of that cell and its immediate left and right neighbors on the step before. -Stephen Wolfram (A New Kind of Science, 2004) Cellular automata are extreamly simple computational systems that create interesting images which show some even more interesting behaviours. Essentially, these images show the product of thousands of simple computations based on rules that should be followed regarding a pixel's imediate neighbours. These cellular automata images are a bunch of black and white pixels that are built from the top down, where each scanline is based on the colour of the pixels on the scanline above it. More specifically, the pixels imediately above it, above it and to the left, and above it and to the right. So each pixel's colour is determined by three other pixels.

16. Introduction To Cellular Automata May 6, 2006 (game of life, brian s brain ) available in PDF, illustrated with a program ( CAV) and an applet which show the capability of a conway CA http://www.rennard.org/alife/english/acgb.html

Introduction to Cellular Automata Cellular Automata Viewer CAV is a cellular automata manager. Version 2.0 Small but complete, it will allow you to explore Conway's universe (the famous Game of Life) as well as more complex and sophisticated universes (Brian's Brain, Swirl...). Version 2.0 implements some 1D cellular automata. Logicell LogiCell is an applet which demonstrates the capability of a Conway Cellular Automaton to manage boolean operators. It is illustrated with some automatism applications (binary adder, two-way switch...). H ome Cellular Automata Biomorphs ... Links Last Update 6 May, 2006 audit et mesure d'audience visiteurs internet par

17. CELLULAR AUTOMATA A Discrete Universe  By Andrew Ilachinski Alexandria, VA 842 pages Publication date September 2001 World Scientific Publishing, Singapore ISBN 98102-4623-4 (hardcover) ISBN 981-238-183-X (paperback) http://ilachinski.com/ca_book.htm

CELLULAR AUTOMATA A Discrete Universe Alexandria, VA 842 pages Publication date: September 2001 World Scientific Publishing, Singapore ISBN 981-02-4623-4 (hardcover) ISBN 981-238-183-X (paperback) 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 consists of 12 largely self-contained chapters. The last chapter 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 an annotated listing of cellular automata resources available on the World Wide Web.

18. Cellular Automata The chessboard is the world; the pieces are the phenomena of the universe; the rules of the game are what we call the laws of Nature. -T. H. Huxley http://www.cscs.umich.edu/~crshalizi/notebooks/cellular-automata.html

19. Tutorials On Self-Organisation, Complexity And Artificial Life Links given to Introductions and Tutorials in complex systems, selforganisation, self-organised systems, artificial life, attractors, cellular automata, fractals, genetic http://www.calresco.org/tutorial.htm

FAQs, Introductions and Tutorials (For more general introductions on these subjects see our Themes page) Artificial Intelligence Artificial Life Autopoiesis Cellular Automata ... Systems Thinking Frequently Asked Questions (FAQs) Artificial Intelligence - comp.ai newsgroup (7 part Text FAQ) Artificial Life - comp.ai.alife newsgroup (Original FAQ) Cellular Automata - comp.theory.cell-automata newsgroup (Original FAQ) Evolutionary Computation - comp.ai.genetic newsgroup Fractals - sci.fractals newsgroup Fuzzy Systems - comp.ai.fuzzy newsgroup Genetic Programming - comp.ai.genetic newsgroup Neural Nets - comp.ai.neural-nets newsgroup Non-Linear Systems - sci.nonlinear newsgroup Robotics - comp.robotics newsgroup Self-Organizing Systems - comp.theory.self-org-sys newsgroup (listed in order of difficulty or detail per subject category) For more general introductions see Themes and for more specialised treatments see Online Papers Artificial Intelligence Artificial Intelligence for the Beginner - incl NNs and GAs by Mark Lambourne An Introduction to AI - essays on most areas by Generation 5 An Introduction to the Science of Artificial Intelligence - by Thinkquest Introduction to Artificial Intelligence - course notes (some Postscript) by Michael Gasser The Pattern Recognition Basic of AI - introductory Book by Donald Tveter Artificial Life Introduction to CNS/Ph175: Artificial Life - by Chris Adami Artificial Life - introduction by Anders Kaplan Artificial Life an Interactive Essay - by Stewart Dean An Introduction to Artificial Life - paper by Moshe Sipper

20. Stephen Wolfram: Articles On Cellular Automata Technical articles by one of the leading CA researchers, concerning both 1D and 2D Cellular Automata. http://www.stephenwolfram.com/publications/articles/ca/

Publications by Stephen Wolfram Articles Stephen Wolfram: Articles on Cellular Automata Cellular Automata as Simple Self-Organizing Systems Statistical Mechanics of Cellular Automata Cellular Automata ... Cellular Automaton Supercomputing Note: Since 1987 Stephen Wolfram's intellectual efforts have primarily been described in his books on Mathematica and A New Kind of Science rather than academic articles. Contact

Page 1     1-20 of 132    1  | 2  | 3  | 4  | 5  | 6  | 7  | Next 20