lecture 9 - Indiana University Bloomington...luis rocha 2015 biologically-inspired computing lecture...

transcript

rocha@indiana.eduhttp://informatics.indiana.edu/rocha/i-bic

biologicallyInspired

computing

INDIANAUNIVERSITY

Informatics luis rocha 2015

biologically-inspired computinglecture 9

computing

INDIANAUNIVERSITY

course outlook

Assignments: 35% Students will complete 4/5 assignments based

on algorithms presented in class Lab meets in I1 (West) 109 on Lab

Wednesdays Lab 0 : January 14th (completed)

Introduction to Python (No Assignment) Lab 1 : January 28th

Measuring Information (Assignment 1) Graded

Lab 2 : February 11th

L-Systems (Assignment 2) Due February 25th

Lab 3: March 11th

Cellular Automata and Boolean Networks (Assignment 3)

Sections I485/H400

computing

INDIANAUNIVERSITY

Readings until now

Class Book Nunes de Castro, Leandro [2006]. Fundamentals of Natural

Computing: Basic Concepts, Algorithms, and Applications. Chapman & Hall. Chapter 2, all sections Chapter 7, sections 7.3 – Cellular Automata Chapter 8, sections 8.1, 8.2, 8.3.10

Lecture notes Chapter 1: What is Life? Chapter 2: The logical Mechanisms of Life Chapter 3: Formalizing and Modeling the World Chapter 4: Self-Organization and Emergent

Complex Behavior posted online @ http://informatics.indiana.edu/rocha/i-

bic Optional

Flake’s [1998], The Computational Beauty of Life. MIT Press. Chapters 10, 11, 14 – Dynamics, Attractors and chaos

computing

INDIANAUNIVERSITY

The logistic map

Demographic model introduced by Pierre François Verhulst in 1838

Continuous state-determined system Memory of the previous state only

Observations X=0: population extinct X=1: Overpopulation, leads to extinction

)1(1 ttt xrxx −=+

quadratic equation

Reproduction rate

Population size

]4,0[]1,0[

∈∈

positive feedback negative

feedback

computing

INDIANAUNIVERSITY

logistic mapplot

)1(1 ttt xrxx −=+

]4,0[]1,0[

∈∈

)1()( xrxxf −=xxf =)(

rxx 110 −=∨=

Fixed-point attractors

xxf =)(

⇒>′⇒<′

−=′unstable1)(stable1)(

),21()(xf

xfxrxf

( ) 01)1()1( =+−⇔=−⇔ xrxxxrx

computing

INDIANAUNIVERSITY

logistic mapr ≤ 1

rxx 110 −=∨=

⇒>′⇒<′

),21()(xf

xfxrxf

⇒>⇒<

=−=′⇒=unstable1stable1

,|)21(|)(0r

rrxrxfx

computing

INDIANAUNIVERSITY

logistic map1 ≤ r ≤ 3

rxx 110 −=∨=

⇒>′⇒<′

),21()(xf

xfxrxf

rxfx =′⇒= )(0 |2|)(11 rxfr

x −=′⇒−=

computing

INDIANAUNIVERSITY

logistic map3 ≤ r ≤ 4 (r ≤ 3.44)

rxx 110 −=∨=

xxff =))((

Limit cycle

⇒>′⇒<′

),21()(xf

xfxrxf

|2|)(11 rxfr

x −=′⇒−=

rxfx =′⇒= )(0

computing

INDIANAUNIVERSITY

logistic map3 ≤ r ≤ 4 (3.44 ≤ r ≤ 3.54)

rxx 110 −=∨=

Limit cycle

xxffff =))))((((

computing

INDIANAUNIVERSITY

logistic mapr = 4

rxx 110 −=∨=

ChaoticDeterministic

Sensitiveergodic

computing

INDIANAUNIVERSITY

logistic mapmovie

computing

INDIANAUNIVERSITY

logistic mapbifurcation map

r11−

Period doubling

computing

INDIANAUNIVERSITY

logistic mapbifurcation map

r11−

Period doubling

ChaoticDeterministic (not random)Sensitiveergodic

computing

INDIANAUNIVERSITY

logistic mapbifurcation map: cycle of 3

r11−

Period doubling

xxfff =)))(((

computing

INDIANAUNIVERSITY

Natural design principles

self-similar structures Trees, plants, clouds, mountains

morphogenesis Mechanism

Iteration, recursion Unpredictability

From limited knowledge or inherent in nature? Mechanism

Chaos (sensitivity to initial conditions, ergodicity) Collective behavior, emergence, and self-organization

Complex behavior from collectives of many simple units or agents cellular automata, ant colonies, development, morphogenesis, brains,

immune systems, economic markets Mechanism

Parallelism, multiplicity, redundancy, attractor beghavior, emergent computation

Adaptation Evolution, learning, social evolution Mechanism

Reproduction, transmission, variation, selection, Turing’s tape Network causality (complexity)

Behavior derived from many inseparable sources Environment, embodiment, epigenetics, culture

Mechanism Modularity, connectivity, stigmergy

exploring similarities across nature

computing

INDIANAUNIVERSITY

discrete dynamical systemsexamples

xx-1 x+1

Cellular Automata

NK Boolean Network (N=13, K=3)

RBNLAB (Carlos Gershenson):http://student.vub.ac.be/~cgershen/rbn/RBN.html

computing

INDIANAUNIVERSITY

NK-networksStuart Kauffman

NK Boolean Network (N=13, K=3)

#nodes (Boolean variables)

# of inputs per node

2K → possible input combinations for an automaton node

→ possible Boolean functions of k inputsK22x1 x20011

x1 x20011

x1 ∧ x2

Self-organization: solely dependent on its own rules

p: bias, or proportion of “1’s” (or “0’s”) in output

p = 0.25

computing

INDIANAUNIVERSITY

simple Boolean networkSmall NK-network

or orp q p ˅ q0011

p q p ˄ q0011

n1 n2 n3 n1 n2 n3

0 0 0 0 0 0 0 01 0 0 1 0 1 0 22 0 1 0 0 0 1 13 0 1 1 1 1 1 74 1 0 0 0 1 1 35 1 0 1 0 1 1 36 1 1 0 0 1 1 37 1 1 1 1 1 1 7

State space

computing

INDIANAUNIVERSITY

simple Boolean networkExample: attractors

n1 n2 n3 n1 n2 n3

0 0 0 0 0 0 0 0

1 0 0 1 0 1 0 2

2 0 1 0 0 0 1 1

3 0 1 1 1 1 1 7

4 1 0 0 0 1 1 3

5 1 0 1 0 1 1 3

6 1 1 0 0 1 1 3

7 1 1 1 1 1 1 7

0: 000

1: 001 2: 010 3: 011 7: 111

6: 110

5: 101

4: 100

computing

INDIANAUNIVERSITY

simple Boolean networkstate-space (State-transition Graph)

0: 000

1: 001 2: 010

3: 011 7: 111

6: 110

5: 101

4: 100

In discrete dynamical systems there must always exist at least one cycle, because there is only a finite number of states, eventually the system must repeat a previous state.

computing

INDIANAUNIVERSITY

SimpleNetSmall Boolean network

computing

INDIANAUNIVERSITY

State-transition graph (basins of attraction)dynamical landscape of SimpleNet

There are 28=256 possible states but only a small set of attractors

computing

INDIANAUNIVERSITY

SimpleNet: dynamical landscape (basins of attraction)Small Boolean network

computing

INDIANAUNIVERSITY

discrete dynamical systemsexamples

NK Boolean Network (N=13, K=3)DDLab (Andy wuensche): http://www.ddlab.com/

computing

INDIANAUNIVERSITY

computing

INDIANAUNIVERSITY

attractor behavior

The 213=8192 states in state space are organized into 15 basins attractor periods ranging between 1 and 7. The number of states in each basin is: 68, 984, 784, 1300,

264, 76,316, 120, 64, 120, 256, 2724,604, 84, 428.

self-organization

computing

INDIANAUNIVERSITY

Next lectures

Class Book Nunes de Castro, Leandro [2006]. Fundamentals of Natural

Computing: Basic Concepts, Algorithms, and Applications. Chapman & Hall. Chapter 2, all sections Chapter 7, sections 7.3 – Cellular Automata Chapter 8, sections 8.1, 8.2, 8.3.10

Lecture notes Chapter 1: What is Life? Chapter 2: The logical Mechanisms of Life Chapter 3: Formalizing and Modeling the World Chapter 4: Self-Organization and Emergent Complex

Behavior posted online @ http://informatics.indiana.edu/rocha/i-bic

Papers and other materials Optional

Flake’s [1998], The Computational Beauty of Life. MIT Press. Chapters 10, 11, 14 – Dynamics, Attractors and chaos

readings

lecture 9 - Indiana University Bloomington...luis rocha 2015 biologically-inspired computing lecture...

Documents