9,060 research outputs found
Brief Notes and History Computing in Mexico during 50 years
The history of computing in Mexico can not be thought without the name of
Prof. Harold V. McIntosh (1929-2015). For almost 50 years, in Mexico he
contributed to the development of computer science with wide international
recognition. Approximately in 1964, McIntosh began working in the Physics
Department of the Advanced Studies Center (CIEA) of the National Polytechnic
Institute (IPN), now called CINVESTAV. In 1965, at the National Center of
Calculus (CeNaC), he was a founding member of the Master in Computing, first in
Latin America. With the support of Mario Baez Camargo and Enrique Melrose,
McIntosh continues his research of Martin-Baltimore Computer Center and
University of Florida at IBM 709.Comment: 13 pages, 1 figur
Leveraging Evolutionary Search to Discover Self-Adaptive and Self-Organizing Cellular Automata
Building self-adaptive and self-organizing (SASO) systems is a challenging
problem, in part because SASO principles are not yet well understood and few
platforms exist for exploring them. Cellular automata (CA) are a well-studied
approach to exploring the principles underlying self-organization. A CA
comprises a lattice of cells whose states change over time based on a discrete
update function. One challenge to developing CA is that the relationship of an
update function, which describes the local behavior of each cell, to the global
behavior of the entire CA is often unclear. As a result, many researchers have
used stochastic search techniques, such as evolutionary algorithms, to
automatically discover update functions that produce a desired global behavior.
However, these update functions are typically defined in a way that does not
provide for self-adaptation. Here we describe an approach to discovering CA
update functions that are both self-adaptive and self-organizing. Specifically,
we use a novel evolutionary algorithm-based approach to discover finite state
machines (FSMs) that implement update functions for CA. We show how this
approach is able to evolve FSM-based update functions that perform well on the
density classification task for 1-, 2-, and 3-dimensional CA. Moreover, we show
that these FSMs are self-adaptive, self-organizing, and highly scalable, often
performing well on CA that are orders of magnitude larger than those used to
evaluate performance during the evolutionary search. These results demonstrate
that CA are a viable platform for studying the integration of self-adaptation
and self-organization, and strengthen the case for using evolutionary
algorithms as a component of SASO systems.Comment: 10 pages, 17 figure
Programming and simulating chemical reaction networks on a surface
Models of well-mixed chemical reaction networks (CRNs) have provided a solid foundation for the study of programmable molecular systems, but the importance of spatial organization in such systems has increasingly been recognized. In this paper, we explore an alternative chemical computing model introduced by Qian & Winfree in 2014, the surface CRN, which uses molecules attached to a surface such that each molecule only interacts with its immediate neighbours. Expanding on the constructions in that work, we first demonstrate that surface CRNs can emulate asynchronous and synchronous deterministic cellular automata and implement continuously active Boolean logic circuits. We introduce three new techniques for enforcing synchronization within local regions, each with a different trade-off in spatial and chemical complexity. We also demonstrate that surface CRNs can manufacture complex spatial patterns from simple initial conditions and implement interesting swarm robotic behaviours using simple local rules. Throughout all example constructions of surface CRNs, we highlight the trade-off between the ability to precisely place molecules and the ability to precisely control molecular interactions. Finally, we provide a Python simulator for surface CRNs with an easy-to-use web interface, so that readers may follow along with our examples or create their own s
Coevolving Cellular Automata with Memory for Chemical Computing: Boolean Logic Gates in the B-Z Reaction
We propose that the behaviour of non-linear media can be controlled
automatically through coevolutionary systems. By extension, forms of
unconventional computing, i.e., massively parallel non-linear computers, can be
realised by such an approach. In this study a light-sensitive sub-excitable
Belousov-Zhabotinsky reaction is controlled using various heterogeneous
cellular automata. A checkerboard image comprising of varying light intensity
cells is projected onto the surface of a catalyst-loaded gel resulting in rich
spatio-temporal chemical wave behaviour. The coevolved cellular automata are
shown to be able to control chemical activity through dynamic control of the
light intensity. The approach is demonstrated through the creation of a number
of simple Boolean logic gates
Evolution in Materio: Exploiting the Physics of Materials for Computation
We describe several techniques for using bulk matter for special purpose
computation. In each case it is necessary to use an evolutionary algorithm to
program the substrate on which the computation is to take place. In addition,
the computation comes about as a result of nearest neighbour interactions at
the nano- micro- and meso-scale. In our first example we describe evolving a
saw-tooth oscillator in a CMOS substrate. In the second example we demonstrate
the evolution of a tone discriminator by exploiting the physics of liquid
crystals. In the third example we outline using a simulated magnetic quantum
dot array and an evolutionary algorithm to develop a pattern matching circuit.
Another example we describe exploits the micro-scale physics of charge density
waves in crystal lattices. We show that vastly different resistance values can
be achieved and controlled in local regions to essentially construct a
programmable array of coupled micro-scale quasiperiodic oscillators. Lastly we
show an example where evolutionary algorithms could be used to control density
modulations, and therefore refractive index modulations, in a fluid for optical
computing
Self-Organization in Traffic Lights: Evolution of Signal Control with Advances in Sensors and Communications
Traffic signals are ubiquitous devices that first appeared in 1868. Recent
advances in information and communications technology (ICT) have led to
unprecedented improvements in such areas as mobile handheld devices (i.e.,
smartphones), the electric power industry (i.e., smart grids), transportation
infrastructure, and vehicle area networks. Given the trend towards
interconnectivity, it is only a matter of time before vehicles communicate with
one another and with infrastructure. In fact, several pilots of such
vehicle-to-vehicle and vehicle-to-infrastructure (e.g. traffic lights and
parking spaces) communication systems are already operational. This survey of
autonomous and self-organized traffic signaling control has been undertaken
with these potential developments in mind. Our research results indicate that,
while many sophisticated techniques have attempted to improve the scheduling of
traffic signal control, either real-time sensing of traffic patterns or a
priori knowledge of traffic flow is required to optimize traffic. Once this is
achieved, communication between traffic signals will serve to vastly improve
overall traffic efficiency
A General Overview of Formal Languages for Individual-Based Modelling of Ecosystems
Various formal languages have been proposed in the literature for the
individual-based modelling of ecological systems. These languages differ in
their treatment of time and space. Each modelling language offers a distinct
view and techniques for analyzing systems. Most of the languages are based on
process calculi or P systems. In this article, we present a general overview of
the existing modelling languages based on process calculi. We also discuss,
briefly, other approaches such as P systems, cellular automata and Petri nets.
Finally, we show advantages and disadvantages of these modelling languages and
we propose some future research directions.Comment: arXiv admin note: text overlap with arXiv:1610.08171 by other author
Towards a stable definition of Kolmogorov-Chaitin complexity
Although information content is invariant up to an additive constant, the
range of possible additive constants applicable to programming languages is so
large that in practice it plays a major role in the actual evaluation of K(s),
the Kolmogorov-Chaitin complexity of a string s. Some attempts have been made
to arrive at a framework stable enough for a concrete definition of K,
independent of any constant under a programming language, by appealing to the
"naturalness" of the language in question. The aim of this paper is to present
an approach to overcome the problem by looking at a set of models of
computation converging in output probability distribution such that that
"naturalness" can be inferred, thereby providing a framework for a stable
definition of K under the set of convergent models of computation.Comment: 15 pages, 4 figures, 2 tables. V2 minor typo corrections. Paper web
page on Experimental Algorithmic Information Theory:
http://http://www.mathrix.org/experimentalAIT
AIS-INMACA: A Novel Integrated MACA Based Clonal Classifier for Protein Coding and Promoter Region Prediction
Most of the problems in bioinformatics are now the challenges in computing.
This paper aims at building a classifier based on Multiple Attractor Cellular
Automata (MACA) which uses fuzzy logic. It is strengthened with an artificial
Immune System Technique (AIS), Clonal algorithm for identifying a protein
coding and promoter region in a given DNA sequence. The proposed classifier is
named as AIS-INMACA introduces a novel concept to combine CA with artificial
immune system to produce a better classifier which can address major problems
in bioinformatics. This will be the first integrated algorithm which can
predict both promoter and protein coding regions. To obtain good fitness rules
the basic concept of Clonal selection algorithm was used. The proposed
classifier can handle DNA sequences of lengths 54,108,162,252,354. This
classifier gives the exact boundaries of both protein and promoter regions with
an average accuracy of 89.6%. This classifier was tested with 97,000 data
components which were taken from Fickett & Toung, MPromDb, and other sequences
from a renowned medical university. This proposed classifier can handle huge
data sets and can find protein and promoter regions even in mixed and
overlapped DNA sequences. This work also aims at identifying the logicality
between the major problems in bioinformatics and tries to obtaining a common
frame work for addressing major problems in bioinformatics like protein
structure prediction, RNA structure prediction, predicting the splicing pattern
of any primary transcript and analysis of information content in DNA, RNA,
protein sequences and structure. This work will attract more researchers
towards application of CA as a potential pattern classifier to many important
problems in bioinformaticsComment: 7 Page
Descriptive complexity for minimal time of cellular automata
Descriptive complexity may be useful to design programs in a natural
declarative way. This is important for parallel computation models such as
cellular automata, because designing parallel programs is considered difficult.
Our paper establishes logical characterizations of the three classical
complexity classes that model minimal time, called real-time, of
one-dimensional cellular automata according to their canonical variants. Our
logics are natural restrictions of the existential second-order Horn logic.
They correspond to the three ways of deciding a language on a square grid
circuit of side n according to the three canonical placements of an input word
of length n on the grid. Our key tool is a normalization method that transforms
a formula into an equivalent formula that literally mimics a grid circuit
- …