Complexes

TEDxDF talk: Semáforos auto-organizantes

2012-01-18T16:24:00.000+01:00

Last November I had the honor of participating in TEDxDF with a talk on self-organizing traffic lights. You can watch the video (in Spanish) at:

Mejorar el transporte público de la Ciudad de México es una idea que a todos se nos ocurre, pero pocos hacemos algo al respecto. Este no es el caso de Carlos, un apasionado del estudio científico de la complejidad: ¿Cómo podemos diseñar componentes de un sistema para que, por medio de sus interacciones, realicen una función deseada a nivel del sistema? Con su ponencia Carlos responderá esta pregunta y expondrá ideas aplicables al DF para mejorar diversos medios de transporte, afectando positivamente la calidad de vida de la población.

"New" Paper: Facing Complexity: Prediction vs. Adaptation

2011-12-19T17:09:00.000+01:00

One of the presuppositions of science since the times of Galileo, Newton, Laplace, and Descartes has been the predictability of the world. This idea has strongly influenced scientific and technological models. However, in recent decades, chaos and complexity have shown that not every phenomenon is predictable, even if it is deterministic. If a problem space is predictable, in theory we can find a solution via optimization. Nevertheless, if a problem space is not predictable, or it changes too fast, very probably optimization will offer obsolete solutions. This occurs often when the immediate solution affects the problem itself. An alternative is found in adaptation. An adaptive system will be able to find by itself new solutions for unforeseen situations.

Gershenson, C. (In Press). Facing Complexity: Prediction vs. Adaptation. To be published in Martorell, X. & Massip, A. (Eds.) Complexity and Language.
Full paper at http://arxiv.org/abs/1112.3843
Versión en español en http://arxiv.org/abs/0905.4908

New Draft: Living in Living Cities

2011-11-17T15:45:00.001+01:00

This paper presents and overview of current and potential applications of living technology to urban problems. Living technology can be described as technology that exhibits the core features of living systems. These features can be useful to solve dynamic problems. In particular, urban problems concerning mobility, logistics, telecommunications, governance, safety, sustainability, and society and culture are presented, while solutions involving living technology are reviewed. Finally, the usefulness of describing cities as living systems is discussed.

Gershenson, C. (2011). Living in Living Cities. C3 Report 2011.09. http://arxiv.org/abs/1111.3659

New Draft: Are Minds Computable?

2011-10-14T16:55:00.000+02:00

This essay explores the limits of Turing machines concerning the modeling of minds and suggests alternatives to go beyond those limits.

Gershenson, C. (2011). Are Minds Computable? C3 Tech. Report 2011.08. http://arxiv.org/abs/1110.3002

The Laws of Information

2011-09-07T17:16:00.000+02:00

1. Law of Information Transformation. Information will potentially be transformed by interacting with other information.
2. Law of Information Propagation. Information propagates as fast as possible.
3. Law of Requisite Complexity. More complex information will require more complex agents to perceive, act on, and propagate it.
4. Law of Information Criticality. Transforming and propagating information will tend to a critical balance be- tween its stability and its variability.
5. Law of Information Organization. Information produces constraints that regulate information production.
6. Law of Information Self-organization. Information tends to its preferred, most probable state.
7. Law of Information Potentiality. An agent can give different potential meanings to information.
8. Law of Information Perception. The meaning of information is unique for an agent perceiving it in unique, always changing open contexts.

More at: http://arxiv.org/abs/0704.0304

Video Talk: Self-Organization Leads to Supraoptimal Performance in Public Transportation Systems

2011-08-12T16:11:00.001+02:00

UPDATE: Video also on youtube.
You can find here the video (32 min) of a talk I gave at the last Lakeside Research Days in Klagenfurt, Austria. I speak about the results presented in this paper:

Gershenson C (2011) Self-Organization Leads to Supraoptimal Performance in Public Transportation Systems. PLoS ONE 6(6): e21469. http://dx.doi.org/10.1371/journal.pone.0021469

The main idea is that self-organization can regulate public transportation systems in such a way that passengers wait less than the theoretical optimum. Of course, this means that the theory was wrong. Well, more precisely, theory made misguided assumptions.

I thank Christian Bettstetter and Wifried Elmenreich for organizing the Research Days and Chrisitan Philipp for making the video.

Tip: The video is high quality, so it takes some time to download, even if one chooses right click -> Switch to low quality. Cultivate patience...

Robocup

2011-07-10T22:02:00.000+02:00

Today was the last day of competitions for my first RoboCup. Already on its 15th year, one of its goals is to have by 2050 human-size robots playing against the soccer world champions and winning. I thought that was far fetched, but after seeing some robots in action, it doesn't seem that impossible anymore.

There are several different leagues, playing in simulations, wheeled and humanoid robots of different sizes. The simulated leagues can have complex strategies and make nice moves. Wheeled robots can move very fast and are very good at kicking. Team Water from China defeated TechUnited Eindhoven from The Netherlands in the final in an exciting 6-5. Those bots play good! At the human-robot match, Water tied 5-5 against an allowing group of team leaders. Humans could have easily won if they wished, but it was more of a friendly game...

The humanoid robots are a bit slower, but still there is action packed excitement in some matches. The Nao robots are a bit slow, but they can certainly kick the ball.

Perhaps the most interesting league is the @Home, where our group Golem competed for the first time. We weren't one of the best teams, but we gained lots of experience. The idea of the @Home league is to exhibit robot capabilities in domestic environments. We are still far away from fully autonomous general purpose robots at home, but small steps are being made.

Next year RoboCup will be held in Mexico City. See you there.

New Paper: Self-Organization Leads to Supraoptimal Performance in Public Transportation Systems

2011-07-01T00:25:00.000+02:00

Gershenson C (2011) Self-Organization Leads to Supraoptimal Performance in Public Transportation Systems. PLoS ONE 6(6): e21469. http://dx.doi.org/10.1371/journal.pone.0021469

Abstract:
The performance of public transportation systems affects a large part of the population. Current theory assumes that passengers are served optimally when vehicles arrive at stations with regular intervals. In this paper, it is shown that self-organization can improve the performance of public transportation systems beyond the theoretical optimum by responding adaptively to local conditions. This is possible because of a “slower-is-faster” effect, where passengers wait more time at stations but total travel times are reduced. The proposed self-organizing method uses “antipheromones” to regulate headways, which are inspired by the stigmergy (communication via environment) of some ant colonies.

Epidemiology and social networks

2011-06-10T23:23:00.000+02:00

Excerpt: By definition, noncommunicable diseases cannot be transmitted. However, there is recent evidence of the op- posite, involving a change of scientific paradigm. We have a notion that cardiovascular diseases, cancer and diabetes are noncontagious. Actually, there are no physical mechanisms that help spread these diseases. Nevertheless, risk factors of several noncommunicable diseases—such as obesity, al- coholism and smoking—are spread across populations.

Epidemiology and social networks, Carlos Gershenson, Cir Cir 2011;79:199-200

Full Text:

In English: [pdf] [html]

En Español: [pdf] [html]

Postdoctoral Fellowships at UNAM

2011-05-24T18:07:00.000+02:00

//Please forward to whom may be interested.

The National Autonomous University of Mexico (UNAM) has an open call for postdoctoral fellowships.

Candidates should have obtained a PhD degree within the last three years and be under 36 years, both to the date of the beginning of the fellowship. In previous years, there has been a 50% acceptance rate. Candidates are evaluated mainly by their number of papers published in ISI-indexed journals.

The area of interests of candidates should fall within complex systems, artificial life, information, evolution, cognition, robotics, and/or philosophy.

Interested candidates should send CV and a tentative project (1 paragraph) to cgg-at-unam.mx
Projects can be inspired from: http://turing.iimas.unam.mx/~cgg/projects.html

Postdoctoral fellowships are between one and three years (renewing each year).
Spanish is not a requisite.
Accepted candidates would be working at the Computer Science Department of the IIMAS (http://turing.iimas.unam.mx ), and/or at the Center for Complexity Sciences (http://c3.fisica.unam.mx/ ), both at UNAM's main campus.
To know more about UNAM, please visit http://turing.iimas.unam.mx/~cgg/unam.html

Call is available at http://dgapa.unam.mx/becas/posdoctorales/becas_posdoc_conv_2011.pdf [in Spanish].
Application Deadlines:
June 2nd (to start in September 1st 2011)
September 29th (tentative, to start March 1st, 2012)

New draft: The Implications of Interactions for Science and Philosophy

2011-05-18T14:43:00.000+02:00

Gershenson, C. (2011). The Implications of Interactions for Science and Philosophy. C3 Report 2011.04.

Abstract: Reductionism has dominated science and philosophy for centuries. Complexity has recently shown that interactions---which reductionism neglects---are relevant for understanding phenomena. When interactions are considered, reductionism becomes limited in several aspects. In this paper, I argue that interactions imply non-reductionism, non-materialism, non-predictability, non-Platonism, and non-nihilism. As alternatives to each of these, holism, informism, adaptation, contextuality, and meaningfulness are put forward, respectively. A worldview that includes interactions not only describes better our world, but can help to solve many open scientific, philosophical, and social problems caused by implications of reductionism.

Full text: http://arxiv.org/abs/1105.2827

New draft: Polyethism in a colony of artificial ants

2011-04-19T04:26:00.001+02:00

Marriott, Chris & Carlos Gershenson. Polyethism in a colony of artificial ants. C3 Report 2011.03.

Abstract: We explore self-organizing strategies for role assignment in a foraging task carried out by a colony of artificial agents. Our strategies are inspired by various mechanisms of division of labor (polyethism) observed in eusocial insects like ants, termites, or bees. Specifically we instantiate models of caste polyethism and age or temporal polyethism to evaluate the benefits to foraging in a dynamic environment. Our experiment is directly related to the exploration/exploitation trade of in machine learning.

Full text: http://arxiv.org/abs/1104.3152

New draft: Self-organizing traffic lights at multiple-street intersections

2011-04-15T17:08:00.000+02:00

Gershenson, C. & D. A. Rosenblueth (2011). Self-organizing traffic lights at multiple-street intersections. C3 Report 2011.02

Summary: Traffic light coordination is a complex problem. In this paper, we extend previous work on an abstract model of city traffic to allow for multiple street intersections. We test a self-organizing method in our model, showing that it is close to theoretical optima and superior to a traditional method of traffic light coordination.

Abstract: The elementary cellular automaton following rule 184 can mimic particles flowing in one direction at a constant speed. This automaton can therefore model highway traffic. In a recent paper, we have incorporated intersections regulated by traffic lights to this model using exclusively elementary cellular automata. In such a paper, however, we only explored a rectangular grid. We now extend our model to more complex scenarios employing an hexagonal grid. This extension shows first that our model can readily incorporate multiple-way intersections and hence simulate complex scenarios. In addition, the current extension allows us to study and evaluate the behavior of two different kinds of traffic light controller for a grid of six-way streets allowing for either two or three street intersections: a traffic light that tries to adapt to the amount of traffic (which results in self-organizing traffic lights) and a system of synchronized traffic lights with coordinated rigid periods (sometimes called the "green wave" method). We observe a tradeoff between system capacity and topological complexity. The green wave method is unable to cope with the complexity of a higher-capacity scenario, while the self-organizing method is scalable, adapting to the complexity of a scenario and exploiting its maximum capacity. Additionally, in this paper we propose a benchmark, independent of methods and models, to measure the performance of a traffic light controller comparing it against a theoretical optimum.

Full paper at: http://arxiv.org/abs/1104.2829

CfP: ECAL 2011

2011-02-23T20:17:00.000+01:00

CALL FOR PAPERS: ECAL 2011

<< Back to the origins of Alife >>

ECAL 2011, European Conference on Artificial Life,
an international conference on the simulation and synthesis of living systems

8-12 August 2011, Paris, France
www.ecal11.org

=====================

Artificial Life is an interdisciplinary undertaking that investigates the fundamental properties of living systems through the simulation and synthesis of biological entities and processes. It also attempts to design and build artificial systems that display properties of organisms, or societies of organisms, out of abiotic or virtual parts.

ECAL, the European Conference on Artificial Life, is a biennial event that alternates with the US-based Alife conference series.

---------------------

Welcome to ECAL 2011! Back then, in the early 1990's, the first two ECAL conferences in Paris and Brussels were mainly centered on theoretical biology and the physics of complex systems. Today, we feel that Alife can look back on these origins and take more inspiration from new developments at the intersection between computer science and theoretical biology — thus it is our wish to refocus the conference on *complex biological systems*. Closing a loop, this ECAL will mark the 20th anniversary of the 1st ECAL and will be framed as a tribute to the late Francisco Varela, co-organizer in 1991 with two of this year's committee members (Paul Bourgine, CREA, and Hugues Bersini, IRIDIA). We look forward to seeing you in Paris.

** You are invited to submit papers (full and abstract) to this exciting event! **

KEYNOTE SPEAKERS
---------------------
* Eric Wieschaus, Princeton University, 1995 Nobel Prize in Physiology
* Jacques Demongeot, Université Joseph Fourier, Grenoble
* David Harel, Weizmann Institute of Science
* James D. Murray, Universities of Washington and Oxford
* Jordan Pollack, Brandeis University
* Ricard Solé, Universitat Pompeu Fabra, Barcelona

IMPORTANT DATES
---------------------
o Workshop proposal submission: February 21, 2011
o Workshop proposal notification: February 28, 2011
o PAPER & ABSTRACT SUBMISSION: April 6, 2011
o Paper & abstract notification: May 20, 2011
o Camera-ready versions: June 10, 2011
o Late registration: June 10, 2011
o End of registration: July 31, 2011
o Conference: August 8-12, 2011

THEMES
---------------------
"A new body of disciplines": Over the past two decades, biological knowledge has grown at an unprecedented rate, giving rise to new disciplines such as systems biology —- testimony of the striking progress of modeling and quantitative methods across the field. During the same period, highly speculative ideas have matured, and entire conferences and journals are now devoted to them. Synthesizing artificial cells, simulating large-scale biological networks, storing and making intelligent use of an exponentially growing amount of data (e.g., microarrays), exploiting biological substrates for computation and control, and deploying bio-inspired engineering are all cutting-edge topics today.

"Life itself": ECAL 2011 will leverage the remarkable development of biological modeling and extend the topics of Artificial Life to the fundamental properties of living organisms: their multiscale pattern-forming morphodynamics, their autopoiesis, robustness, capacity to self-repair, cognitive capacities, and co-adaptation at all levels, including ecological ones. ECAL 2011 will bring together a large interdisciplinary community of biologists, computer scientists, physicists, and mathematicians. It will invite them to reflect on how traditional boundaries between disciplines have become blurred, and to revisit in depth what constitutes “life”.

Papers are welcome in all areas of Artificial Life, including, but not limited to:

- (Chemical) Self-Assembly & Complexity
- Artificial Chemistries
- Biological & Chemical Information Processing and Production
- Biosemiotics
- Complex Networks
- Emergent Engineering
- Evolutionary & Learning Dynamics
- Minimal (Bottom up) Synthetic Cells
- Minimal Cognition & Physical Intelligence
- Mixed Living (Technology) Systems
- Modular Robotics
- Morphogenesis, Generative & Developmental Systems
- Multilevel Ecologies
- Organizations & Collective Intelligence
- Origins of Life
- Philosophy of Artificial Life & Living Technology
- Protocellular Energetics & Metabolic Networks
- Robotic Energy Autonomy
- Robotic Self-Assembly
- Socio-Technical Systems
- Swarm Intelligence
- Systems Biology
- Theoretical & Computational Frameworks
- Top-Down Artificial Cells

Authors are encouraged to explain how their work sheds light on the fundamental properties of living systems and makes progress on the important open questions identified during previous meetings.

PAPER/ABSTRACT FORMAT
---------------------
Detailed information concerning the formatting guidelines, templates, online submission process, and proceedings can be found at http://www.ecal11.org/submission

There are two options for submission: either *full paper* or *abstract*. Note that the format is exactly the same for both options. The only difference resides in the number of pages and type of contents:

1. Full papers have an *8-page* maximum length and should report on new, unpublished work

2. Abstracts are limited to a *2-page* length and should discuss work previously published in a journal. It is therefore essential that a reference to the previous article is clearly cited in the abstract.

All submissions will be subject to peer review, and all accepted submissions will be allocated either an oral presentation slot or a poster slot with no distinction being made between the two submission options (full paper or abstract).

PUBLICATION
---------------------
Every accepted full-paper and abstract, which was submitted to the main conference (not the satellite workshops), will be published by MIT Press in a single online open-access proceedings volume.

The top 10 accepted publications will have the opportunity to publish a revised and expanded version of their conference paper in the Artificial Life journal.

LOCATION
---------------------
The conference will be held at the Cité Internationale Universitaire de Paris (CIUP), located on a wooded park at the southern edge of the French capital. See more information at http://www.ecal11.org/venue

Registration information will be posted soon at http://www.ecal11.org/registration

ORGANIZATION
---------------------
* René Doursat (chair)
Complex Systems Institute/CREA, Ecole Polytechnique & CNRS, Paris

* Hugues Bersini
IRIDIA, Université Libre de Bruxelles

* Paul Bourgine
Complex Systems Institute/CREA, Ecole Polytechnique & CNRS, Paris

* Mario Giacobini (program chair)
Molecular Biotechnology Center, University of Torino

* Tom Lenaerts (program chair)
Department of Computer Science, Université Libre de Bruxelles

* Marco Dorigo
IRIDIA, Université Libre de Bruxelles

PROGRAM COMMITTEE
---------------------
* Hussein Abbass * Bart De Boer * Daniel Lobo * Hiroki Sayama
* Andy Adamatzky * Ralf Der * Fernando Lobo * Matthias Scheutz
* Chris Adami * Gianni Di Caro * Robert Lowe * Thomas Schmickl
* Andreas Albrecht * Cecilia Di Chio * Penousal Machado * Marc Schoenauer
* Fernando Almeida E Costa * Ezequiel A. Di Paolo * Steven Maere * Luis Seabra Lopes
* Lee Altenberg * Peter Dittrich * Davide Marocco * Roberto Serra
* Paul Andrews * Marco Dorigo * John Mccaskill * Cosma Shalizi
* Takaya Arita * Alan Dorin * Chris Mcewan * Linda Smith
* Wolfgang Banzhaf * Rene Doursat * Barry Mcmullin * Ricard Sole
* Xabier E. Barandiaran * Marc Ebner * Jose Mendes * Antoine Spicher
* Andrea Baronchelli * Arantza Etxeberria * Olivier Michel * Peter Stadler
* Zoltan Barta * Nazim Fates * Martin Middendorf * Susan Stepney
* Jacob Beal * Christoph Flamm * Eduardo Miranda * Charles Taylor
* Mark Bedau * Luca Gambardella * Colin Molter * Tim Taylor
* Randall Beer * Carlos Gershenson * Luís Moniz Pereira * Gianluca Tempesti
* Tony Belpaeme * Mario Giacobini * Sara Montagna * Christof Teuscher
* Peter Bentley * Takashi Gomi * Jason Moore * Jon Timmis
* Hugues Bersini * Roderich Gross * Federico Moran * Peter Todd
* Luc Berthouze * Thilo Gross * Chrystopher L. Nehaniv * Marco Tomassini
* Mauro Birattari * Pauline C Haddow * Jason Noble * Arne Traulsen
* Joris Bleys * Emma Hart * Stefano Nolfi * Elio Tuci
* Josh Bongard * Inman Harvey * Ann Nowe * Gunnar Tufte
* Paul Bourgine * Paulien Hogeweg * Charles Ofria * Ali Emre Turgut
* Seth Bullock * Phil Husbands * Alexandra Penn * Karl Tuyls
* Stefano Cagnoni * Fumiya Iida * Andrew Philippides * Jon Umerez
* Alexandre Campo * Yaochu Jin * Raphaël Plasson * Sven Van Segbroeck
* Philippe Capdepuy * Colin Johnson * Daniel Polani * Patricia A. Vargas
* Ciro Cattuto * Istvan Karsai * Vitorino Ramos * Mirko Viroli
* Anders Christensen * Jozef Kelemen * Charles Richter * Paul Vogt
* Dominique Chu * Serge Kernbach * Marylyn Ritchie * Richard Watson
* Netta Cohen * Daeeun Kim * Luis M. Rocha * Alan Winfield
* Luis Correia * Kalevi Kull * Miguel Rocha * Rachel Wood
* Ernesto Costa * Renaud Lambiotte * Pierre Rouze * Andrew Wuensche
* Tamás Czárán * Doron Lancet * Kepa Ruiz-Mirazo * Larry Yaeger
* Christian Darabos * Tom Lenaerts * Erol Sahin * Klauspeter Zauner
* Joachim De Beule * Pedro U. Lima * Francisco C. Santos * Tom Ziemke

CONTACT
---------------------
For further information about the conference program and travel arrangements, please see the website, http://www.ecal11.org. For questions about the submission, reviewing process and other issues, email to: contact@ecal11.org.

IWSOS'2011 Proceedings Online

2011-02-22T18:14:00.001+01:00

The Proceedings of IWSOS'2011 (starts tomorrow) are available in Google Books and in Springer.

Self-Organizing Systems: 5th International Workshop, IWSOS 2011, Karlsruhe, Germany, February 23-24. 2011. Proceedings. Edited by Christian Bettstetter and Carlos Gershenson, LNCS 6557, Springer, 2011.

New Draft: Modular Random Boolean Networks

2011-01-11T15:56:00.000+01:00

Poblanno-Balp, Rodrigo & Gershenson, Carlos (2011). Modular Random Boolean Networks. C3 Report 2011.01.

Abstract: Random Boolean networks (RBNs) have been a popular model of genetic regulatory networks for more than four decades. However, most RBN studies have been made with regular topologies, while real regulatory networks have been found to be modular. In this work, we extend classical RBNs to define modular RBNs. Statistical experiments and analytical results show that modularity has a strong effect on the properties of RBNs. In particular, modular RBNs are closer to criticality than regular RBNs.

Full text: http://arxiv.org/abs/1101.1893

Why facebook stopped working for me

2010-12-24T00:13:00.001+01:00

Facebook offers great functionalities, it is easy, fun, extensible... However, it seems that like many things which are positive for many people (e.g. automobiles), they get overused with unintended consequences (e.g. traffic jams).

OK, so I have 400+ friends on facebook. The problem is that I could spare like 5 minutes every other day to check the news feed. With so many people in my feed, I get what was posted 2 hours ago at most. Sure, there are ways of blocking applications, creating filters (e.g. with Better FB), but this does not work for me. There are just too many posts I am not interested about, but I am interested in few things that most people post about. It is difficult to categorize. Where is artificial intelligence when it is needed? I believe that algorithms similar to anti-spam filters would be immensely useful on social networks. For example, I am interested about the English postings of my Iranian friends, but I cannot make much of their Farsi posts... For users, it would be as easy as to add an "Unlike" button.

In Twitter I have a similar problem, but it is easier to unfollow people. Still, e.g. my friend @mauropm tweets about a hundred times a day. I can be interested in a couple of those, but I am unable to follow him because of the rest of his activity.

As feeds are becoming more and more widespread, it is becoming more and more necessary to develop AI algorithms to sort through the "relevant" stuff...
(read a big business opportunity)

Deadline Extended, Final CfP: Special Issue on Complex Networks, Artificial Life

2010-12-13T18:36:00.003+01:00

Call for Papers

Special Issue on Complex Networks

Artificial Life Journal

Motivation

As a result of the quality of the Complex Networks track at the ALife XII conference last August in Odense, Denmark and the interest of the attendants; we announce a call for papers for a special issue on this theme for the Artificial Life Journal.

Many complex systems are amenable to be described as networks. These include genetic regulatory, structural or functional cortical networks, ecological systems, metabolism of biological species, author collaborations, interaction of autonomous systems in the Internet, etc. A recent trend suggests to study common global topological features of such networks, e.g. network diameter, clustering coefficients, assortativity, modularity, community structure, etc.

Various network growth models have also been proposed and studied to emulate the features of the real-world networks, e.g. the preferential attachment model, which explains scale-free power law degree distributions observed in many real-world networks.

Another direction is to investigate network motifs and subgraphs in order to understand and analyse the local structure and function of networks. The presence of a certain motif in a network may mean that that motif plays an important role in the overall functionality of the network. Thus, functionality of specific motifs, including their information processing and control functions, is a challenging topic relevant in Artificial Life studies, such as genetic regulatory networks, cell signaling networks, and protein interaction networks.

In addition, propagation and processing of information within networks may be analysed as (Shannon) information dynamics. Such analysis requires to consider not only networks' topology, but also the time-series dynamics at individual nodes. Specific topics of interest include phase transitions of network properties between ordered and chaotic regimes, where information transfer is often maximised, and other nonlinear phenomena related to criticality in networks.

Goal

The intention of the special issue is to bring together research from both Artificial Life and Complex Networks communities, in order to facilitate cross-fertilization, increase exposure of both communities to relevant research and foster new collaborations.

Submission

Contributions to the Session should be prepared and submitted according to the Artificial Life journal guidelines, available at http://www.mitpressjournals.org/page/sub/artl. Authors should also include a cover letter describing briefly the relevance of their article to the specific topic of this call. Every submission will be subject to full peer review.

Articles should NOT be submitted to the journal editor, but should be uploaded through the special issue website (http://turing.iimas.unam.mx/~review ).

Papers will be judged by members of the Review Committee on their relevance to the call for papers, originality, clarity of the presentation, and overall quality.

Important Dates

Extended paper submission: January 7th, 2011

Paper notification: February 28th, 2011

Camera-ready papers due: March 31st, 2011

Review Committee

Chris Adami
Lee Altenberg
Alain Barrat
Randall Beer
Hugues Bersini
Johan Bollen
Markus Brede
Mikhail Burtsev
Alan Dorin
Nic Geard
Carlos Gershenson
Mario Giacobini
Juan Luis Jiménez Laredo
Joseph Lizier
Michael Mayer
Juan Julián Merelo Guervós
Oliver Obst
Charles Ofria
Mikhail Prokopenko
Tom Ray
Hiroki Sayama
Hideaki Suzuki
Vito Trianni
Elio Tuci
Rosalind Wang
Borys Wrobel
Larry Yaeger

Guest Editors

Dr. Mikhail Prokopenko

CSIRO, Australia

http://www.prokopenko.net/

Dr. Carlos Gershenson

IIMAS, UNAM, Mexico

http://turing.iimas.unam.mx/~cgg/

Paper Published: The sigma profile: A formal tool to study organization and its evolution at multiple scales, Complexity

2010-12-10T14:52:00.002+01:00

Gershenson, C. (2010). The sigma profile: A formal tool to study organization and its evolution at multiple scales. Complexity, first published online: 10 NOV 2010. DOI: 10.1002/cplx.20350

Abstract
The σ profile is presented as a tool to analyze the organization of systems at different scales, and how this organization changes in time. Describing structures at different scales as goal-oriented agents, one can define σ ∈ [0,1] (satisfaction) as the degree to which the goals of each agent at each scale have been met. σ reflects the organization degree at that scale. The σ profile of a system shows the satisfaction at different scales, with the possibility to study their dependencies and evolution. It can also be used to extend game theoretic models. The description of a general tendency on the evolution of complexity and cooperation naturally follows from the σ profile. Experiments on a virtual ecosystem are used as illustration.

Full text
http://dx.doi.org/10.1002/cplx.20350
(send me an email if you do not have access and want a copy)

Science catching up science fiction

2010-12-10T14:46:00.000+01:00

The science: mice are born with genetic material of two males (fresh news).
http://blogs.nature.com/news/thegreatbeyond/2010/12/look_dads_no_mum.html

The science fiction: dreams of a teenager (~12 years ago).
http://turing.iimas.unam.mx/~cgg/jlagunez/npm1.htm [in Spanish...]

CfP: Artificial Life, Robotics, Evolvable Hardware Track @ GECCO 2011

2010-11-09T17:31:00.000+01:00

Call for Papers
Artificial Life, Robotics, Evolvable Hardware Track @ GECCO 2011
Genetic and Evolutionary Computation Conference
July 12-16, Dublin, Ireland
http://www.sigevo.org/gecco-2011/

This track promotes evolutionary computation and bio-inspired heuristics as instruments able to face engineering problems and scientific questions in different areas that include (but are not limited to): artificial life, robotics, and evolvable hardware.

Artificial life studies artificial systems (software, hardware, or chemical) with properties similar to those of living systems. There are two main complementary goals: to better understand living systems and to use this understanding to build artificial systems with properties of living systems, such as adaptability, evolvability, active perception, communication, organization.

Evolutionary computation techniques can be particularly useful for a large branch of robotics. The evolution of controllers, morphologies, sensors, and communication protocols is being used to build systems to provide robust, adaptive and scalable solutions to different problems in robotics.

Finally, the term “evolvable hardware” has been used in the past to denote both the design of electronic devices able to evolve themselves, and the generic exploitation of evolutionary techniques for creating hardware. While the first task sounds ambitious, the second is routinely applied by industries. The track will show both real and potential applications.

Important Dates:
* Submission deadline: January 26, 2011
* Notification of paper acceptance: March 23, 2011
* Camera-ready submission: April 8, 2011
* GECCO-2010 Conference: July 12-16, 2011

Submission guidelines:
http://www.sigevo.org/gecco-2011/papers.html

Track chairs:
Carlos Gershenson http://turing.iimas.unam.mx/~cgg/
Giovanni Squillero http://www.cad.polito.it/~squillero/

CfP: Eighth International Conference on Complex Systems (ICCS 2011)

2010-11-08T17:45:00.000+01:00

Call for Papers & Workshop Proposals

Eighth International Conference on Complex Systems (ICCS 2011)

June 26 - July 1, 2011
Boston Marriott, Quincy, MA, USA

http://necsi.edu/events/iccs2011/

* - * - * - * - * - * - * - * - *

Host: New England Complex Systems Institute (http://necsi.edu/)

This is the eighth in a series of conferences with two major aims:
first, to investigate those properties or characteristics that appear
to be common to the very different complex systems now under
study; and second, to encourage cross fertilization among the
many disciplines involved.

- - - - - - - - - -
ICCS TOPICS: UNIFYING THEMES IN COMPLEX SYSTEMS

Sessions will be structured around both themes and systems.
The themes are:

EMERGENCE: The relationship of component to collective
behavior; the relationship of internal structure to external
influence; multiscale structure and dynamics; self-similarity and
fractals.

COMPLEXITY & INFORMATION: Defining complexity;
characterizing the information necessary to describe complex
systems; structuring, storing, accessing, distributing, visualizing
and analyzing information describing complex systems; the
dynamics of information and its computational characterization.

DYNAMICS & SELF-ORGANIZATION: Time series analysis and
prediction; chaos; temporal correlations; the time scale of
dynamic processes; spatio-temporal patterns; dynamic scaling;
pattern formation; evolution, development and adaptation;
interaction between internal dynamics and external inputs;
programmability of self-organization.

NETWORKS: Complex network topologies; small-world and
scale-free networks; connectivity and centrality; motifs, cliques
and communities; dynamical networks; adaptive networks;
network modeling and analysis; modularity, degeneracy,
redundancy, and substructure; visualization of networks.

METHODOLOGY: Computer simulation; agent-based modeling;
data-driven research methods; analytical methods; nonlinear
statistics; soft computing; methods and tools for complex systems
education.

The system categories are:

PHYSICAL & CHEMICAL SYSTEMS: Non-equilibrium processes;
hydrodynamics; glasses; non-linear chemical dynamics; complex
fluids; molecular self-organization; information and computation
in quantum and classical physical systems; spatio-temporal
patterns in physical systems from subatomic to astrophysical.

BIO-MOLECULAR & CELLULAR SYSTEMS: Systems biology;
protein and DNA folding; bio-molecular informatics; membranes;
cellular response and communication; genetic regulation; gene
cytoplasm interactions; development; cellular differentiation;
primitive multicellular organisms; the immune system; origins of life.

PHYSIOLOGICAL & PSYCHOLOGICAL SYSTEMS: Nervous
system; sensorimotor systems; computational models of neural
and cognitive function; perception, cognition and action;
psychological dysfunction; pattern recognition; learning and
development; human machine interaction; autonomous mental
development; neurocognitive networks.

ORGANISMS & POPULATIONS: Population biology; ecosystems;
ecology; ecological networks; speciation; evolution.

HUMAN SOCIAL & ECONOMIC SYSTEMS: Social networks;
corporate and social structures and dynamics; organizational
behavior and management; markets; urban development; the
global economy; military systems; global conflict; interactions
between human and natural systems.

ENGINEERED SYSTEMS: Design and manufacturing; nano-
technology; bioengineering; modified and hybrid biological
organisms; computer based interactive systems; multi-agent
systems; artificial life; artificial intelligence; robots;
communication networks; the Internet; traffic systems; distributed
control; self organizing artifacts; complex systems engineering;
biologically inspired engineering; sensor networks.

- - - - - - - - - -
ABSTRACT SUBMISSION AND PROCEEDINGS PUBLICATION:

For presentation at the conference, authors should submit an
abstract through the conference website. All the accepted
abstracts will be published in the online proceedings on the
conference website. Authors of accepted abstracts may submit
full papers for inclusion in the online proceedings. Full paper
submission is optional.

NOTE TO AUTHORS: If you plan to submit an abstract/paper to
the conference, please follow the link on the conference website
to the pre-submission page AS SOON AS POSSIBLE. You can
update your submission's title, abstract, authors and paper at any
time until the submission deadline. This pre-submission process
will help the organizers estimate the number of incoming
submissions and develop the conference program and other
logistics efficiently.

- - - - - - - - - -
WORKSHOPS:

There will be several time slots available during the conference
for organizing workshops on specific topics. All the accepted
abstracts/papers for the workshop will be included in the
conference proceedings as well.

If you are interested in organizing a workshop, email the
following information to sayama@binghamton.edu by December
20, 2010:

* Name(s) and contact information of the workshop organizer(s)
* Title of the workshop
* A short description of the workshop: (aim, scope, target audience,
format and expected outcome)
* A list of confirmed and prospective speakers

- - - - - - - - - -
IMPORTANT DATES AND DEADLINES:

Workshop proposal: December 20, 2010
Abstract submission: February 28, 2011
Notification to authors: April 1, 2011
Early registration: April 15, 2011
Camera-ready abstract
& full paper submission: April 30, 2011
(full paper submission is optional)
Conference: June 26 - July 1, 2011

Register at http://necsi.edu/events/iccs2011/
Space is limited, so register early.

- - - - - - - - - -
LOCATION AND ACCOMMODATIONS:

The conference will be held at the Boston Marriott Quincy in
Quincy, Massachusetts, 8 miles south of downtown Boston.
Reservations can be made directly with Marriott reservations at
(866) 449-7387 or (617) 472-1000, or online at:
www.quincymarriott.com.

A block of rooms has been reserved at a conference discount
rate of $159 + tax per night (single or double). Internet access is
included. These rooms are available on a first-come, first-served
basis. To receive the discount rate identify yourself as a member
of ICCS 2011. The group code for making reservations online is
"NECNECA". These rates are available until Friday, May 27,
2011. Cancellations may be made up to 48 hours in advance
without penalty.

- - - - - - - - - -
ORGANIZATION:

Executive Committee:

Founding Chair: Yaneer Bar-Yam (New England Complex Systems
Institute, USA)
General Chair: Ali A. Minai (University of Cincinnati, USA)
General Co-Chair: Dan Braha (University of Massachusetts at
Dartmouth, USA)
Program Chair: Hiroki Sayama (Binghamton University, SUNY,
USA)

Program Committee:
Albert-László Barabási (Northeastern University, USA)
Ginestra Bianconi (Nothestern University, USA)
Philippe Binder (University of Hawaii, USA)
Eric Bonabeau (Icosystem Corporation, USA)
Josh Bongard (University of Vermont, USA)
Seth Bullock (University of Southampton, UK)
Guido Caldarelli (INFM, Rome, ITALY)
Iain Couzin (Princeton University, USA)
Marcus de Aguiar (IFGW - UNICAMP, Brazil)
Fred Discenzo (Rockwell Automation, USA)
René Doursat (Complex Systems Institute, Paris, France)
Margaret J. Eppstein (University of Vermont, USA)
Carlos Gershenson (Univ. Nacional Autonoma de Mexico, Mexico)
Robert Ghanea (British Telecom, UK)
Thilo Gross (Max Planck Institute for the Physics of Complex Systems,
Germany)
Helen Harte (Community Health Plan, USA)
Alfred Hubler (University of Illinois at Urbana-Champaign, USA)
Mark Klein (Massachusetts Institute of Technology, USA)
Juergen Kluever (University of Duisburg Essen, Germany)
May Lim (University of the Philippines, Philippines)
Czeslaw Mesjasz (Karakow University of Economics, Poland)
Lilianne R Mujica-Parodi (Stony Brook University, SUNY, USA)
Chrystopher Nehaniv (University of Hertfordshire, UK)
Lael Parrott (Université de Montréal, Canada)
Daniel Polani (University of Hertfordshire, UK)
Christina Stoica (University of Duisburg Essen, Germany)
Bill Sulis (McMaster University, Canada)
Irina Trofimova (McMaster University, Canada)
Len Troncale (California State University Pomona, USA)
Jonathan Vos Post (Computer Futures, USA)
Richard Watson (University of Southampton, UK)
Janet Wiles (University of Queensland, Australia)
Ian Wilkinson (University of New South Wales, Australia)
David Wolpert (NASA Ames Research Center, USA)

More PC members TBA

- - - - - - - - - -
FOR MORE INFORMATION:

Check the conference website:
http://necsi.edu/events/iccs2011/

Contact us at iccs@necsi.edu

Paper updated: The World as Evolving Information

2010-10-14T18:12:00.001+02:00

The proceedings of ICCS2007 will be published soon, I believe that as a volume in the Springer "Understanding Complex Systems" series. With this excuse, I updated this paper with three more laws of information, two new classifications, and further discussions. Any feedback is more than welcome.

Gershenson, C. (In Press). The World as Evolving Information. To be published in Proceedings of ICCS 2007.

Abstract: This paper discusses the benefits of describing the world as information, especially in the study of the evolution of life and cognition. Traditional studies encounter problems because it is difficult to describe life and cognition in terms of matter and energy, since their laws are valid only at the physical scale. However, if matter and energy, as well as life and cognition, are described in terms of information, evolution can be described consistently as information becoming more complex.
The paper presents eight tentative laws of information, valid at multiple scales, which are generalizations of Darwinian, cybernetic, thermodynamic, psychological, philosophical, and complexity principles. These are further used to discuss the notions of life, cognition and their evolution.

Full paper: http://arxiv.org/abs/0704.0304

CfP: Special Issue on Complex Networks, Artificial Life

2010-09-22T17:52:00.000+02:00

Call for Papers

Special Issue on Complex Networks

Artificial Life Journal

Motivation

Goal

Submission

Articles should NOT be submitted to the journal editor, but should be uploaded through the special issue website (TBA).

Papers will be judged by members of the Program Committee on their relevance to the call for papers, originality, clarity of the presentation, and overall quality.

Important Dates

Paper submission: December 15th, 2010

Paper notification: February 28th, 2011

Camera-ready papers due: March 31st, 2011

Program Committee

TBA

Guest Editors

Dr. Mikhail Prokopenko

CSIRO, Australia

http://www.prokopenko.net/

Dr. Carlos Gershenson

IIMAS, UNAM, Mexico

http://turing.iimas.unam.mx/~cgg/

Determinism != Predictability

2010-09-20T16:55:00.001+02:00

Many people assumed that if a system is deterministic, it should be predictable. Chaos and complexity each show different situations where this fails to hold.

In deterministic chaos, even when you know precisely the "laws" of a system, its extreme sensitivity to initial conditions (formally described with positive Lyapunov exponents) implies that sooner or later, very similar initial states will tend to very different states, since trajectories diverge exponentially. OK, some people may argue that if we had infinite precision, then we could predict precisely the future, so it is just a practical nuisance that in theory should work (I have no idea how, but anyway... people are stubborn (not me! I am just self-confident!)).

But you cannot get away with lack of predictability that is inherent of complexity. Within a complex system, yes even with deterministic rules, interactions between components generate novel information that determines the future of the system. This information is not included in the initial nor boundary conditions. Since you do not know how the system will interact, the only way to know the future state of a system is by "running it". Of course, a posteriori you can make predictions. This is known as "computational irreducibility": you know the "laws" of a system, but you need to compute the trajectory of an initial state before you can know what will be a future state. This is also related to the halting problem. Just an example: ECA rule 110 is very simple to describe. However, you cannot deduce a priori all the different dynamic structures (aka gliders) that emerge from the interactions. Moreover, you cannot infer from the rules of the ECA the result of the glider interactions. You need to compute them and see. Even more, there is no chance you could prove from the rules of the ECA that it is capable of universal computation. Same arguments apply for the Game of Life.