Category: Uncategorized

BGSA: binary gravitational search algorithm

Abstract  Gravitational search algorithm is one of the new optimization algorithms that is based on the law of gravity and mass interactions.
In this algorithm, the searcher agents are a collection of masses, and their interactions are based…

Abstract  

Gravitational search algorithm is one of the new optimization algorithms that is based on the law of gravity and mass interactions.
In this algorithm, the searcher agents are a collection of masses, and their interactions are based on the Newtonian laws
of gravity and motion. In this article, a binary version of the algorithm is introduced. To evaluate the performances of the
proposed algorithm, several experiments are performed. The experimental results confirm the efficiency of the BGSA in solving
various nonlinear benchmark functions.

  • Content Type Journal Article
  • DOI 10.1007/s11047-009-9175-3
  • Authors
    • Esmat Rashedi, Department of Electrical Engineering, Shahid Bahonar University of Kerman, P.O. Box 76169-133, Kerman, Iran
    • Hossein Nezamabadi-pour, Department of Electrical Engineering, Shahid Bahonar University of Kerman, P.O. Box 76169-133, Kerman, Iran
    • Saeid Saryazdi, Department of Electrical Engineering, Shahid Bahonar University of Kerman, P.O. Box 76169-133, Kerman, Iran

Discrete and continuous optimization based on multi-swarm coevolution

Abstract  This paper presents a novel Multi-swarm Particle Swarm Optimizer called PS2O, which is inspired by the coevolution of symbiotic species in natural ecosystems. The main idea of PS2O is to extend the single population PSO to the inter…

Abstract  

This paper presents a novel Multi-swarm Particle Swarm Optimizer called PS2O, which is inspired by the coevolution of symbiotic species in natural ecosystems. The main idea of PS2O is to extend the single population PSO to the interacting multi-swarms model by constructing hierarchical interaction topology
and enhanced dynamical update equations. With the hierarchical interaction topology, a suitable diversity in the whole population
can be maintained. At the same time, the enhanced dynamical update rule significantly speeds up the multi-swarm to converge
to the global optimum. The PS2O algorithm, which is conceptually simple and easy to implement, has considerable potential for solving complex optimization
problems. With a set of 17 mathematical benchmark functions (including both continuous and discrete cases), PS2O is proved to have significantly better performance than four other successful variants of PSO.

  • Content Type Journal Article
  • DOI 10.1007/s11047-009-9174-4
  • Authors
    • Hanning Chen, Key Laboratory of Industrial Informatics, Shenyang Institute of Automation, Chinese Academy of Sciences, Faculty Office III, Nanta Street 114#, Dongling District, 110016 Shenyang, China
    • Yunlong Zhu, Key Laboratory of Industrial Informatics, Shenyang Institute of Automation, Chinese Academy of Sciences, Faculty Office III, Nanta Street 114#, Dongling District, 110016 Shenyang, China
    • Kunyuan Hu, Key Laboratory of Industrial Informatics, Shenyang Institute of Automation, Chinese Academy of Sciences, Faculty Office III, Nanta Street 114#, Dongling District, 110016 Shenyang, China

Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent)

Abstract  Optical architectures that use exponential space for solving instances of the (non-necessarily-binary) permanent are presented.
This is the first work to specifically focus on such hard on average problems. Two architectures are su…

Abstract  

Optical architectures that use exponential space for solving instances of the (non-necessarily-binary) permanent are presented.
This is the first work to specifically focus on such hard on average problems. Two architectures are suggested the first is
based on programmable masks, and the second on preprepared fixed number of masks.

  • Content Type Journal Article
  • DOI 10.1007/s11047-009-9168-2
  • Authors
    • Amir Anter, Department of Computer Science, Ben-Gurion University of the Negev, Beer Sheva, Israel
    • Shlomi Dolev, Department of Computer Science, Ben-Gurion University of the Negev, Beer Sheva, Israel

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)

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

A synthetic genetic circuit whose signal-response curve is temperature-tunable from band-detection to sigmoidal behaviour

Abstract  Programming new cellular functions by using synthetic gene circuits is a key goal in synthetic biology, and an important element
of this process is the ability to couple to the information processing systems of the host cell using …

Abstract  Programming new cellular functions by using synthetic gene circuits is a key goal in synthetic biology, and an important element
of this process is the ability to couple to the information processing systems of the host cell using synthetic systems with
various signal-response characteristics. Here, we present a synthetic gene system in Escherichia coli whose signal-response curve may be tuned from band detection (strongest response within a band of input concentrations) to
a switch-like sigmoidal response, simply by altering the temperature. This change from a band-detection response to a sigmoidal
response has not previously been implemented. The system allows investigation of a range of signal-response behaviours with
minimal effort: a single system, once inserted into the cells, provides a range of response curves without any genetic alterations
or replacement with other systems. By altering its output, the system may couple to other synthetic or natural genetic circuits,
and thus serve as a useful modular component. A mathematical model has also been developed which captures the essential qualitative
behaviours of the circuit.

  • Content Type Journal Article
  • DOI 10.1007/s11047-009-9167-3
  • Authors
    • Sangram Bagh, University of Toronto Mississauga Department of Chemical and Physical Sciences, Institute for Optical Sciences 3359 Mississauga Rd. N Mississauga ON L5L 1C6 Canada
    • David R. McMillen, University of Toronto Mississauga Department of Chemical and Physical Sciences, Institute for Optical Sciences 3359 Mississauga Rd. N Mississauga ON L5L 1C6 Canada

On the regularity of circular splicing languages: a survey and new developments

Abstract  
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with
linear splicing. In this paper we focus on the relationship between regular circular lan…

Abstract  

Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with
linear splicing. In this paper we focus on the relationship between regular circular languages and languages generated by finite circular splicing systems. We survey the known results towards a characterization of the intersection between these two classes and provide new contributions
on the open problem of finding this characterization. First, we exhibit a non-regular circular language generated by a circular simple system thus disproving a known result in this area. Then we give new results related to a restrictive class of circular splicing
systems, the marked systems. Precisely, we review in a graph theoretical setting the recently obtained characterization of marked systems generating
regular circular languages. In particular, we define a slight variant of marked systems, that is the g-marked systems, and we introduce the graph associated with a g-marked system. We show that a g-marked system generates a regular circular
language if and only if its associated graph is a cograph. Furthermore, we prove that the class of g-marked systems generating regular circular languages is closed under a complement
operation applied to systems. We also prove that marked systems with self-splicing generate only regular circular languages.

  • Content Type Journal Article
  • DOI 10.1007/s11047-009-9155-7
  • Authors
    • Paola Bonizzoni, Università degli Studi di Milano-Bicocca Dipartimento di Informatica Sistemistica e Comunicazione Viale Sarca 336 20126 Milano Italy
    • Clelia De Felice, Università di Salerno Dipartimento di Informatica ed Applicazioni 84084 Fisciano SA Italy
    • Gabriele Fici, Università di Salerno Dipartimento di Informatica ed Applicazioni 84084 Fisciano SA Italy
    • Rosalba Zizza, Università di Salerno Dipartimento di Informatica ed Applicazioni 84084 Fisciano SA Italy

Transducer generated arrays of robotic nano-arms

Abstract  We consider sets of two-dimensional arrays, called here transducer generated languages, obtained by iterative applications
of transducers (finite state automata with output). Each transducer generates a set of blocks of symbols suc…

Abstract  

We consider sets of two-dimensional arrays, called here transducer generated languages, obtained by iterative applications
of transducers (finite state automata with output). Each transducer generates a set of blocks of symbols such that the bottom
row of a block is an input string accepted by the transducer and, by iterative application of the transducer, each row of
the block is an output of the transducer on the preceding row. We show how these arrays can be implemented through molecular
assembly of triple crossover DNA molecules. Such assembly could serve as a scaffold for arranging molecular robotic arms capable
of simultaneous movements. We observe that transducer generated languages define a class of languages which is a proper subclass
of recognizable picture languages, but it contains the class of all factorial local two-dimensional languages. By taking the
average growth rate of the number of blocks in the language as a measure of its complexity, we further observe that arrays
with high complexity patterns can be generated in this way.

  • Content Type Journal Article
  • DOI 10.1007/s11047-009-9157-5
  • Authors
    • Egor Dolzhenko, University of South Florida Department of Mathematics and Statistics Tampa FL 33620 USA
    • Nataša Jonoska, University of South Florida Department of Mathematics and Statistics Tampa FL 33620 USA
    • Nadrian C. Seeman, New York University Chemistry Department New York NY 10003 USA

Trace monoids with idempotent generators and measure-only quantum automata

Abstract  In this paper, we analyze a model of 1-way quantum automaton where only measurements are allowed (
MON
-1qfa). The automaton works on a compatibility alphabet

(S, E)
of observables and its probabilistic behavior is a formal ser…

Abstract  

In this paper, we analyze a model of 1-way quantum automaton where only measurements are allowed (
MON
-1qfa). The automaton works on a compatibility alphabet

(S, E)

of observables and its probabilistic behavior is a formal series on the free partially commutative monoid

FI(S, E)

with idempotent generators. We prove some properties of this class of formal series and we apply the results to analyze the
class

LMO(S, E)

of languages recognized by
MON
-1qfa’s with isolated cut point. In particular, we prove that

LMO(S, E)

is a boolean algebra of recognizable languages with finite variation, and that

LMO(S, E)

is properly contained in the recognizable languages, with the exception of the trivial case of complete commutativity.

  • Content Type Journal Article
  • DOI 10.1007/s11047-009-9154-8
  • Authors
    • Alberto Bertoni, Università degli Studi di Milano Dipartimento di Scienze dell’Informazione via Comelico 39 20135 Milano Italy
    • Carlo Mereghetti, Università degli Studi di Milano Dipartimento di Scienze dell’Informazione via Comelico 39 20135 Milano Italy
    • Beatrice Palano, Università degli Studi di Milano Dipartimento di Scienze dell’Informazione via Comelico 39 20135 Milano Italy

Deterministic and stochastic P systems for modelling cellular processes

Abstract  This paper presents two approaches based on metabolic and stochastic P systems, together with their associated analysis methods,
for modelling biological systems and illustrates their use through two case studies.

Content Type…

Abstract  

This paper presents two approaches based on metabolic and stochastic P systems, together with their associated analysis methods,
for modelling biological systems and illustrates their use through two case studies.

  • Content Type Journal Article
  • DOI 10.1007/s11047-009-9158-4
  • Authors
    • Marian Gheorghe, The University of Sheffield Department of Computer Science Regent Court, Portobello Street Sheffield S1 4DP UK
    • Vincenzo Manca, The University of Verona Department of Computer Science Strada Le Grazie 15 37134 Verona Italy
    • Francisco J. Romero-Campero, The University of Nottingham School of Computer Science Jubilee Campus Nottingham NG8 1BB UK