Lectures on Cellular Automata Continued Modified and upgraded slides of Martijn Schut Vrij Universiteit Amsterdam Lubomir Ivanov Department.

Slides:



Advertisements
Similar presentations
Jochen Triesch, UC San Diego, 1 Pattern Formation Goal: See how globally ordered spatial structures can arise from local.
Advertisements

Games as Emergent Systems first schema on “rules”.
1 Stefano Redaelli LIntAr - Department of Computer Science - Unversity of Milano-Bicocca Space and Cellular Automata.
The Dynamic Geometry of Geographical Vector Agents Yasser Hammam, Antoni Moore, Peter Whigham and Claire Freeman* Spatial Information Research Centre,
Central question for the sciences of complexity. How do large networks with.
Cellular Automata, Part 2. What is the relationship between the dynamics of cellular automata and their ability to compute?
Cellular Automata (Reading: Chapter 10, Complexity: A Guided Tour)
CELLULAR AUTOMATON Presented by Rajini Singh.
Introductory Lecture on
Cellular Automata MATH 800 Fall “Cellular Automata” 588,000 results in 94,600 results in 61,500 results in 2.
Simulation Models as a Research Method Professor Alexander Settles.
Joanne Turner 15 Nov 2005 Introduction to Cellular Automata.
Lectures on Cellular Automata Continued Modified and upgraded slides of Martijn Schut Vrij Universiteit Amsterdam Lubomir Ivanov Department.
Cellular Automata Orit Moskovich
Introduction At the heart of the growth of a multi-cellular organism is the process of cellular division… … aka (in computing) self-replication.
A New Kind of Science in a Nutshell David Sehnal QIPL at FI MU.
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
1 DT8114 – PhD Seminar in Computer Science Stefano Nichele Department of Computer and Information Science 2011, May 16th Stefano Nichele, 2011.
CITS4403 Computational Modelling Fractals. A fractal is a mathematical set that typically displays self-similar patterns. Fractals may be exactly the.
Discovery of Cellular Automata Rules Using Cases Ken-ichi Maeda Chiaki Sakama Wakayama University Discovery Science 2003, Oct.17.
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
1 Evolutionary Growth of Genomes for the Development and Replication of Multi-Cellular Organisms with Indirect Encodings Stefano Nichele and Gunnar Tufte.
Evolutionary Algorithms BIOL/CMSC 361: Emergence Lecture 4/03/08.
Multiscale Modelling Mateusz Sitko
Indiana GIS Conference, March 7-8, URBAN GROWTH MODELING USING MULTI-TEMPORAL IMAGES AND CELLULAR AUTOMATA – A CASE STUDY OF INDIANAPOLIS SHARAF.
Governor’s School for the Sciences Mathematics Day 13.
Chaos and Self-Organization in Spatiotemporal Models of Ecology J. C. Sprott Department of Physics University of Wisconsin - Madison Presented at the Eighth.
1 GECCO 2011 Graduate Student Workshop ”Discrete Dynamics of Cellular Machines: Specification and Interpretation” Stefano Nichele 2011, July 12th Stefano.
Trajectories and attractor basins as a behavioral description and evaluation criteria for artificial EvoDevo systems Stefano Nichele – October 14, 2009.
Course material – G. Tempesti Course material will generally be available the day before the lecture Includes.
MA354 Mathematical Modeling T H 2:45 pm– 4:00 pm Dr. Audi Byrne.
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
1 Computer Science Graduate Student Conference 2011 ”On the Edge of Chaos and Possible Correlations Between Behavior and Cellular Regulative Properties”
Introduction to Self-Organization
CELLULAR AUTOMATA A Presentation By CSC. OUTLINE History One Dimension CA Two Dimension CA Totalistic CA & Conway’s Game of Life Classification of CA.
REVERSIBLE CELLULAR AUTOMATA WITHOUT MEMORY Theofanis Raptis Computational Applications Group Division of Applied Technologies NCSR Demokritos, Ag. Paraskevi,
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
The Game of Life Erik Amelia Amy. What is the “Game of Life?” The “Game of Life” (often referred to as Life) is not your typical game. There are no actual.
Cellular Automata. John von Neumann 1903 – 1957 “a Hungarian-American mathematician and polymath who made major contributions to a vast number of fields,
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving Machine Learning: Social and Emergent Luger: Artificial.
The Science of Complexity J. C. Sprott Department of Physics University of Wisconsin - Madison Presented to the First National Conference on Complexity.
Geosimulation Geosimulation models are developed to represent phenomena that occur in urban systems in highly realistic manner In particular, Cellular.
Unifying Dynamical Systems and Complex Networks Theories ~ A Proposal of “Generative Network Automata (GNA)” ~ Unifying Dynamical Systems and Complex Networks.
Agent Based Modeling (ABM) in Complex Systems George Kampis ETSU, 2007 Spring Semester.
09/20/04 Introducing Proteins into Genetic Algorithms – CSIMTA'04 Introducing “Proteins” into Genetic Algorithms Virginie LEFORT, Carole KNIBBE, Guillaume.
Cellular Automata Introduction  Cellular Automata originally devised in the late 1940s by Stan Ulam (a mathematician) and John von Neumann.  Originally.
MA354 An Introduction to Math Models (more or less corresponding to 1.0 in your book)
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
Cellular Automata BIOL/CMSC 361: Emergence 2/12/08.
Introduction to Models Lecture 8 February 22, 2005.
제 4 주. Cellular Automata A Brief history of Cellular Automata P. Sarkar, ACM Computing Surveys, vol. 32, no. 1, pp. 80~107, 2000 학습목표 계산도구로서의 Cellular.
Introduction to Enviromental Modelling Lecture 1 – Basic Concepts Gilberto Câmara Tiago Carneiro Ana Paula Aguiar Sérgio Costa Pedro Andrade Neto.
Chia Y. Han ECECS Department University of Cincinnati Kai Liao College of DAAP University of Cincinnati Collective Pavilions A Generative Architectural.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Elements of a Discrete Model Evaluation.
What is Evolution? How do things Evolve?. Ok, we have created the Earth Earth about 4.0 Ga. We now want to follow its evolution from past to present But.
Predicting permit activity with cellular automata calibrated with genetic algorithms Sushil J. LouisGary Raines Department of Computer Science US Geological.
Computational Mechanics of ECAs, and Machine Metrics.
Janine Bolliger Swiss Federal Research Institute WSL/FNP,
Why use landscape models?  Models allow us to generate and test hypotheses on systems Collect data, construct model based on assumptions, observe behavior.
MA354 Math Modeling Introduction. Outline A. Three Course Objectives 1. Model literacy: understanding a typical model description 2. Model Analysis 3.
Modelagem Dinâmica com TerraME Aula 5 – Building simple models with TerraME Tiago Garcia de Senna Carneiro (UFOP) Gilberto Câmara (INPE)
Lattice Boltzmann Modeling
Spatio-Temporal Information for Society Münster, 2014
Hiroki Sayama NECSI Summer School 2008 Week 3: Methods for the Study of Complex Systems Cellular Automata Hiroki Sayama
Illustrations of Simple Cellular Automata
Alexei Fedorov January, 2011
Spatio-temporal information in society: cellular automata
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Cellular Automata Hiroki Sayama
Cellular Automata (CA) Overview
Complexity as Fitness for Evolved Cellular Automata Update Rules
Presentation transcript:

Lectures on Cellular Automata Continued Modified and upgraded slides of Martijn Schut Vrij Universiteit Amsterdam Lubomir Ivanov Department of Computer Science Iona College and anonymous from Internet

Morphogenetic modeling Dynamical Systems and Cellular Automata

matter heat matter heat matter energy matter energy entropy dissipator Organisms are dissipative processes in space and time

Dynamical system Time Space Energy Model animals as dynamical systems Tissues Groups

Which space? - which geometry? parameter space a b geometric space x y state space morphometric space Q=S/A S A ? time velocity 

Which space? - which geometry? ? parameter space genotype environment state space phylogeny/ontogeny morphometric space morphology geometric space ontogeny/phenotype GA evolution environment Dynamics of species in environments.

discrete time steps T=0,1,2,3,… discrete cells at X,Y,Z=0,1,2,3,... discretize cell states S=0,1,2,3,... Discretization has many aspects t t+1 t+2 We can mix discrete and continuous values in some models

Cellular Automaton t t+1 update rules neighbours In standard CA the values of cells are discretized

Reduce dimensions: D=1, i.e. array of cells Reduce # of cell states: binary, i.e. 0 or 1 Simplify interactions: nearest neighbours Simplify update rules: deterministic, static A simple Cellular Automaton

Effects of simplification CA modelMorphogenesis Spatial discretization~ level of detail (organism, cell,molecule) Temporaldiscretization~ level of detail (cellcycle, reactionrate) Reduction of dimension  profound effects (2D“GameofLife”) Binarizationcomputationalconvenience (01  A,10  T, 00  G,11  C) nearest-neighbour interactions ~ spatialrestrictions simple update rules; simultaneity, ubiquity ~ non-linearity  profound effects

  Wolfram's 1D binary CA cell array binary states 5 nearest neighbours „sum-of-states“ update rule: cell array binary states 5 nearest neighbours „sum-of-states“ update rule: Wolfram, S., Physica 10D (1984), 1-35 Observe importance of symmetry of logic function Number of “alive” neighbors

  Wolfram‘s 32 „Symmetry-based“ CA rules in 5-neighborhood S  { 0,1 }   { 1,2,3,4,5 } S  2 5 =32 different rules Number of “alive” neighbors

Code for rule 6 (00110) 0 S (i,T+1)  neighbours Number of “alive” neighbors

Rule codes rule 0 rule 1 rule 2 rule 3 rule 4 rule 5 rule 32 Number of “alive” neighbors

Temporal evolution initial configuration (t=0) e.g. random 0/1 t=1 t=2 t=3 rule n

Temporal evolution t=0 t=10

Rule 6: t=100 t=0

Rule 10: t=100 t=0

CA: a metaphor for morphogenesis static binary pattern translated into state transition rule rule iteration in configuration space genotype translation, epigenetic rules morphogenesis of the phenotype   1   0   1   0  

CA: a model for morphogenesis update rule iterative application of the update rule CA state pattern state space genotype epigenetic interpretation of the genotype, morphogenesis phenotype morphospace

CA rule mutations swap genotypephenotypedevelopment negate How genotype mutations can change phenotypes?

CA rule mutations negate swap rule

Predictability? pattern at t+  t pattern at t explicit simulation:  iterations of rule n ? hypothetical "simple algorithm" ? How to predict a next element in sequence? Tough!

Sum of natural numbers 1… N algorithm 1: 1+2+…+N algorithm2: N(N+1)/2 (Gaussian formula) Sum of natural numbers 1… N algorithm 1: 1+2+…+N algorithm2: N(N+1)/2 (Gaussian formula) Predictability Nth prime number algorithm 1: trial and error algorithm2: ? no general formula Nth prime number algorithm 1: trial and error algorithm2: ? no general formula easyVery tough!

CA: no effective pattern prediction pattern at t+  t pattern at t behaviour may be determined only by explicit simulation

CA: deterministic, unpredictable, irreversible Simple rules generate complex spatio- temporal behavior For non-trivial rules, the spatio-temporal behaviour is computable but not predictable The behavior of the system is irreversible Similarity of rules does not imply similarity of patterns Simple rules generate complex spatio- temporal behavior For non-trivial rules, the spatio-temporal behaviour is computable but not predictable The behavior of the system is irreversible Similarity of rules does not imply similarity of patterns

Aspects of CA morphogenesis complex relationship between „genotype“ and „phenotype effects of „genes“ are not localizable in specific phenes (pleiotropy) epistasisphenes cannot be traced back to specific single genes (epistasis) phenetic effects of "mutations" are not predictable

Meinhardt, H. (1995). The Algorithmic Beauty of Sea Shells. Berlin: Springer

Patterns and morphology Pattern: a spatially and/or temporally ordered distribution of a physical or chemical parameter Pattern formation Form (Size and Shape) Morphogenesis: The spatiotemporal processes by which an organism changes is size (growth) and shape (development)

Where is the phene? Typification? Comparative measures? –length –density –fractal dimension Spatio-temporal development? phenotype A phenotype B