SIGEVOlution Volume 4, Issue 1

The new issue of SIGEVOlution is now available for you to download from:
http://www.sigevolution.org

The issue features:

Computational Intelligence Marketing by Arthur Kordon

Pyevolve: a Python Open-Source Framework for Genetic Algorithms by Christian S. Perone

Calls & calendar

The newsletter is intended to be viewed electronically.
Pier Luca Lanzi (EIC)

The new issue of SIGEVOlution is now available for you to download from:

http://www.sigevolution.org

The issue features:

  • Computational Intelligence Marketing by Arthur Kordon
  • Pyevolve: a Python Open-Source Framework for Genetic Algorithms by Christian S. Perone
  • Calls & calendar

The newsletter is intended to be viewed electronically.

Pier Luca Lanzi (EIC)

SIGEVOlution Volume 4, Issue 1

The new issue of SIGEVOlution is now available for you to download from:
http://www.sigevolution.org

The issue features:

Computational Intelligence Marketing by Arthur Kordon

Pyevolve: a Python Open-Source Framework for Genetic Algorithms by Christian S. Perone

Calls & calendar

The newsletter is intended to be viewed electronically.
Pier Luca Lanzi (EIC)
Related Posts

The new issue of SIGEVOlution is now available for you to download from:

http://www.sigevolution.org

The issue features:

  • Computational Intelligence Marketing by Arthur Kordon
  • Pyevolve: a Python Open-Source Framework for Genetic Algorithms by Christian S. Perone
  • Calls & calendar

The newsletter is intended to be viewed electronically.

Pier Luca Lanzi (EIC)

GPEM 10(4) now available online

The fourth issue of volume 10 of Genetic Programming and Evolvable Machines is now available online. This is the first part of the two-part Special Issue on Parallel and Distributed Evolutionary Algorithms, and it contains the following articles:Introd…

The fourth issue of volume 10 of Genetic Programming and Evolvable Machines is now available online. This is the first part of the two-part Special Issue on Parallel and Distributed Evolutionary Algorithms, and it contains the following articles:

Introduction: special issue on parallel and distributed evolutionary algorithms, part I
by Marco Tomassini & Leonardo Vanneschi
Distributed differential evolution with explorative–exploitative population families
by Matthieu Weber, Ferrante Neri & Ville Tirronen
A grid-enabled asynchronous metamodel-assisted evolutionary algorithm for aerodynamic optimization
by V. G. Asouti, I. C. Kampolis & K. C. Giannakoglou
Hybrid of genetic algorithm and local search to solve MAX-SAT problem using nVidia CUDA framework
by Asim Munawar, Mohamed Wahib, Masaharu Munetomo & Kiyoshi Akama
Parallel evolution using multi-chromosome cartesian genetic programming
by James Alfred Walker, Katharina Völk, Stephen L. Smith & Julian Francis Miller
Genetic programming on graphics processing units
by Denis Robilliard, Virginie Marion-Poty & Cyril Fonlupt
Book Review: Natalio Krasnogor, Steve Gustafson, David A. Pelta, and Jose L. Verdegay (eds): Systems self-assembly: multidisciplinary snapshots
by Navneet Bhalla

The effects of time-varying rewards on the evolution of cooperation

Abstract  Understanding how cooperative behavior emerges within a population of autonomous individuals has been the focus of a great
deal of research in biology, economics and more recently in the multi-agent systems domain. However, there a…

Abstract  Understanding how cooperative behavior emerges within a population of autonomous individuals has been the focus of a great
deal of research in biology, economics and more recently in the multi-agent systems domain. However, there are still many
open questions. In this paper, we address some of these questions by investigating the effects of time-varying, non-symmetric
rewards on the evolution of cooperation in the spatial Prisoner’s dilemma game. The rationale behind this approach is based
on the notion that the associated payoffs from pursuing certain strategies do vary among members of real-world populations.
In our model, agents with limited cognitive capacity play the game with their local neighbours. In addition to its game playing
strategy, each agent has additional attributes that can be used to control the number of rounds of the game the agent actually
participates in, as well as the magnitude of any rewards that it receives. Numerical simulations show that dynamic updates
to payoff values induce a change in equilibrium cooperation levels. This suggests that heterogeneous payoff values and social
diversity within a cost-benefit context are important factors in the promotion of cooperation in the spatial Prisoner’s dilemma
game.

  • Content Type Journal Article
  • DOI 10.1007/s12065-009-0032-1
  • Authors
    • Golriz Rezaei, The University of Melbourne Department of Computer Science and Software Engineering Melbourne VIC Australia
    • Michael Kirley, The University of Melbourne Department of Computer Science and Software Engineering Melbourne VIC Australia

Binary to modified trinary number system conversion and vice-versa for optical super computing

Abstract  With the demand of the super fast processing and handling of huge volume of data the scientific workers in the field of computer
and optics felt the importance of optical computation with multivalued logic. One of the most importan…

Abstract  

With the demand of the super fast processing and handling of huge volume of data the scientific workers in the field of computer
and optics felt the importance of optical computation with multivalued logic. One of the most important number system suitable
for optical computation with multivalued logic is the modified trinary number (MTN) system because of its carry and borrow-free
operations. At this juncture to avail the advantages of both the Binary and MTN system the conversion from one system to another
is most important. In this paper we have communicated the conversion from Binary to MTN and vice-versa including the mixed
MTN with details of optoelectronic circuit implementation.

  • Content Type Journal Article
  • DOI 10.1007/s11047-009-9166-4
  • Authors
    • Amal K. Ghosh, Department of Applied Electronics and Instrumentation Engineering, Netaji Subhash Engineering College, Techno City, Garia, Kolkata, 700 152 India
    • Amitabha Basuray, Department of Applied Optics and Photonics, University of Calcutta, 92, A.P.C.Road, Kolkata, 700 009 India

Design e Sviluppo di Videogiochi: UBISOFT al Politecnico di Milano 5 Novembre ore 13:00

Giovedi’ 5 Novembre 2009 alle ore 1300, presso l’Educafe’, Chiostro Edificio Nord, il producer di Ubisoft, una delle industrie leader nel settore dei videogiochi, terra’ una presentazione intitolata:
“Opportunità di lavoro in Ubisoft: dai forma all’industria dell’intrattenimento di oggi e domani”
L’incontro della durata di 45 minuti circa vertera’ sui seguenti
argomenti:

Presentazione Ubisoft e Studios di Milano

Il processo […]

Giovedi’ 5 Novembre 2009 alle ore 1300, presso l’Educafe’, Chiostro Edificio Nord, il producer di Ubisoft, una delle industrie leader nel settore dei videogiochi, terra’ una presentazione intitolata:

“Opportunità di lavoro in Ubisoft: dai forma all’industria dell’intrattenimento di oggi e domani”

L’incontro della durata di 45 minuti circa vertera’ sui seguenti
argomenti:

  • Presentazione Ubisoft e Studios di Milano
  • Il processo di produzione di Ubisoft
  • Principali figure professionali
  • Posizioni aperte in Ubisoft

Luogo

Educafe – Chiostro Edificio Nord
Politecnico di Milano, Piazza Leonardo da Vinci, 32

Organizzazione

Pier Luca Lanzi – lanzi@elet.polimi.it
Daniele Loiacono – loiacono@elet.polimi.it
Luigi Cardamone – cardamone@elet.polimi.it
Dipartimento di Elettronica e Informazione

Hybrid Petri net based modeling for biological pathway simulation

Abstract  Hybrid Petri net (HPN) is an extension of the Petri net formalism, which enables us to handle continuous information in addition
to discrete information. Firstly, this paper demonstrates how biological pathways can be modeled by th…

Abstract  

Hybrid Petri net (HPN) is an extension of the Petri net formalism, which enables us to handle continuous information in addition
to discrete information. Firstly, this paper demonstrates how biological pathways can be modeled by the integration of discrete
and continuous elements, with an example of the λ phage genetic switch system including induction and retroregulation mechanisms.
Although HPN allows intuitive modeling of biological pathways, some fundamental biological processes such as complex formation
cannot be represented with HPN. Thus, this paper next provides the formal definition of hybrid functional Petri net with extension
(HFPNe), which has high potential for modeling various kinds of biological processes. Cell Illustrator is a software tool
developed on the basis of the definition of HFPNe. Hypothesis creation by Cell Illustrator is demonstrated with the example
of the cyanobacterial circadian gene clock system. Finally, our ongoing tasks, which include the development of a computational
platform for systems biology, are presented.

  • Content Type Journal Article
  • Pages 1099-1120
  • DOI 10.1007/s11047-009-9164-6
  • Authors
    • Hiroshi Matsuno, Graduate School of Science and Engineering, Yamaguchi University, 1677-1, Yoshida, Yamaguchi 753-8512, Japan
    • Masao Nagasaki, Human Genome Center, Institute of Medical Science, University of Tokyo, 4-6-1 Shirokanedai, Minato-ku, Tokyo, 108-8639 Japan
    • Satoru Miyano, Human Genome Center, Institute of Medical Science, University of Tokyo, 4-6-1 Shirokanedai, Minato-ku, Tokyo, 108-8639 Japan

Numerical simplification for bloat control and analysis of building blocks in genetic programming

Abstract  In tree-based genetic programming, there is a tendency for the size of the programs to increase from generation to generation,
a phenomenon known as bloat. It is standard practice to place some form of control on program size eithe…

Abstract  In tree-based genetic programming, there is a tendency for the size of the programs to increase from generation to generation,
a phenomenon known as bloat. It is standard practice to place some form of control on program size either by limiting the
number of nodes or the depth of the program trees, or by adding a component to the fitness function that rewards smaller programs
(parsimony pressure). Others have proposed directly simplifying individual programs using algebraic methods. In this paper,
we add node-based numerical simplification as a tree pruning criterion to control program size. We investigate the effect
of on-line program simplification, both algebraic and numerical, on program size and resource usage. We also investigate the
distribution of building blocks within a genetic programming population and how this is changed by using simplification. We
show that simplification results in reductions in expected program size, memory use and computation time. We also show that
numerical simplification performs at least as well as algebraic simplification, and in some cases will outperform algebraic
simplification. We further show that although the two on-line simplification methods destroy some existing building blocks,
they effectively generate new more diverse building blocks during evolution, which compensates for the negative effect of
disruption of building blocks.

  • Content Type Journal Article
  • DOI 10.1007/s12065-009-0029-9
  • Authors
    • David Kinzett, Victoria University of Wellington School of Engineering and Computer Science PO Box 600 Wellington New Zealand
    • Mark Johnston, Victoria University of Wellington School of Mathematics, Statistics and Operations Research PO Box 600 Wellington New Zealand
    • Mengjie Zhang, Victoria University of Wellington School of Engineering and Computer Science PO Box 600 Wellington New Zealand

Improving the performance of evolutionary algorithms in grid-based puzzles resolution

Abstract  This paper proposes several modifications to existing hybrid evolutionary algorithms in grid-based puzzles, using a-priori
probabilities of 0/1 occurrence in binary encodings. This calculation of a-priori probabilities of bits is p…

Abstract  This paper proposes several modifications to existing hybrid evolutionary algorithms in grid-based puzzles, using a-priori
probabilities of 0/1 occurrence in binary encodings. This calculation of a-priori probabilities of bits is possible in grid-based
problems (puzzles in this case) due to their special structure, with the solution confined into a grid. The work is focused
in two different grid-based puzzles, the Japanese puzzles and the Light-up puzzle, each one having special characteristics
in terms of constraints, which must be taken into account for the probabilities of bit calculation. For these puzzles, we
show the process of a-priori probabilities calculation, and we modify the initialization of the EAs to improve their performance.
We also include novel mutation operators based on a-priori probabilities, which makes more effective the evolutionary search
of the algorithms in the tackled puzzles. The performance of the algorithms with these new initialization and novel mutation
operators is compared with the performance without them. We show that the new initialization and operators based on a-priori
probabilities of bits make the evolutionary search more effective and also improve the scalability of the algorithms.

  • Content Type Journal Article
  • DOI 10.1007/s12065-009-0030-3
  • Authors
    • E. G. Ortiz-García, Universidad de Alcalá, Escuela Politécnica Superior Department of Signal Theory and Communications Alcalá de Henares 28871 Madrid Spain
    • S. Salcedo-Sanz, Universidad de Alcalá, Escuela Politécnica Superior Department of Signal Theory and Communications Alcalá de Henares 28871 Madrid Spain
    • Á. M. Pérez-Bellido, Universidad de Alcalá, Escuela Politécnica Superior Department of Signal Theory and Communications Alcalá de Henares 28871 Madrid Spain
    • L. Carro-Calvo, Universidad de Alcalá, Escuela Politécnica Superior Department of Signal Theory and Communications Alcalá de Henares 28871 Madrid Spain
    • A. Portilla-Figueras, Universidad de Alcalá, Escuela Politécnica Superior Department of Signal Theory and Communications Alcalá de Henares 28871 Madrid Spain
    • X. Yao, The University of Birmingham The Centre for Research in Computational Intelligence and Applications (CERCIA), School of Computer Science Birmingham UK

Boundedness analysis for open Chemical Reaction Networks with mass-action kinetics

Abstract  This paper describes the working principles of an algorithm for boundedness analysis of open Chemical Reaction Networks endowed
with mass-action kinetics. Such models can be thought of both as a special class of compartmental syste…

Abstract  

This paper describes the working principles of an algorithm for boundedness analysis of open Chemical Reaction Networks endowed
with mass-action kinetics. Such models can be thought of both as a special class of compartmental systems or a particular
type of continuous Petri Nets, in which the firing rates of transitions are not constant or preassigned, but expressed as
a function of the continuous marking of the network (function which in chemistry is referred to as the “kinetics”). The algorithm
can be applied to a broad class of such open networks, and returns, as an outcome, a classification of the possible dynamical
behaviors that are compatible with the network structure, by classifying each variable either as bounded, converging to 0
or diverging to ∞. This can be viewed as a qualitative study of Input–Output Stability for chemical networks, or more precisely,
as a classification of its possible I–O instability patterns. Our goal is to analyze the system irrespectively of values of
kinetic parameters. More precisely, we attempt to analyze it simultaneously for all possible values. Remarkably, tests on
non-trivial examples (one of which is discussed in this paper) showed that, as the kinetic constants of the network are varied,
all the compatible behaviors could be observed in simulations. Finally, we discuss and illustrate how the results relate to
previous works on the qualitative dynamics of closed reaction networks.

  • Content Type Journal Article
  • Pages 751-774
  • DOI 10.1007/s11047-009-9163-7
  • Authors
    • David Angeli, Dipartimento di Sistemi e Informatica, University of Florence, Florence, Italy