10,981 research outputs found
Cellular Automata Models of Road Traffic
In this paper, we give an elaborate and understandable review of traffic
cellular automata (TCA) models, which are a class of computationally efficient
microscopic traffic flow models. TCA models arise from the physics discipline
of statistical mechanics, having the goal of reproducing the correct
macroscopic behaviour based on a minimal description of microscopic
interactions. After giving an overview of cellular automata (CA) models, their
background and physical setup, we introduce the mathematical notations, show
how to perform measurements on a TCA model's lattice of cells, as well as how
to convert these quantities into real-world units and vice versa. The majority
of this paper then relays an extensive account of the behavioural aspects of
several TCA models encountered in literature. Already, several reviews of TCA
models exist, but none of them consider all the models exclusively from the
behavioural point of view. In this respect, our overview fills this void, as it
focusses on the behaviour of the TCA models, by means of time-space and
phase-space diagrams, and histograms showing the distributions of vehicles'
speeds, space, and time gaps. In the report, we subsequently give a concise
overview of TCA models that are employed in a multi-lane setting, and some of
the TCA models used to describe city traffic as a two-dimensional grid of
cells, or as a road network with explicitly modelled intersections. The final
part of the paper illustrates some of the more common analytical approximations
to single-cell TCA models.Comment: Accepted for publication in "Physics Reports". A version of this
paper with high-quality images can be found at: http://phdsven.dyns.cx (go to
"Papers written"
A guided tour of asynchronous cellular automata
Research on asynchronous cellular automata has received a great amount of
attention these last years and has turned to a thriving field. We survey the
recent research that has been carried out on this topic and present a wide
state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat
COMPUTER SIMULATION AND COMPUTABILITY OF BIOLOGICAL SYSTEMS
The ability to simulate a biological organism by employing a computer is related to the
ability of the computer to calculate the behavior of such a dynamical system, or the "computability" of the system.* However, the two questions of computability and simulation are not equivalent. Since the question of computability can be given a precise answer in terms of recursive functions, automata theory and dynamical systems, it will be appropriate to consider it first. The more elusive question of adequate simulation of biological systems by a computer will be then addressed and a possible connection between the two answers given will be considered. A conjecture is formulated that suggests the possibility of employing an algebraic-topological, "quantum" computer (Baianu, 1971b)
for analogous and symbolic simulations of biological systems that may include chaotic processes that are not, in genral, either recursively or digitally computable. Depending on the biological network being modelled, such as the Human Genome/Cell Interactome or a trillion-cell Cognitive Neural Network system, the appropriate logical structure for such simulations might be either the Quantum MV-Logic (QMV) discussed in recent publications (Chiara, 2004, and references cited therein)or Lukasiewicz Logic Algebras that were shown to be isomorphic to MV-logic algebras (Georgescu et al, 2001)
Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching
Automata play important roles in wide area of computing and the growth of
multicores calls for their efficient parallel implementation. Though it is
known in theory that we can perform the computation of a finite automaton in
parallel by simulating transitions, its implementation has a large overhead due
to the simulation. In this paper we propose a new automaton called simultaneous
finite automaton (SFA) for efficient parallel computation of an automaton. The
key idea is to extend an automaton so that it involves the simulation of
transitions. Since an SFA itself has a good property of parallelism, we can
develop easily a parallel implementation without overheads. We have implemented
a regular expression matcher based on SFA, and it has achieved over 10-times
speedups on an environment with dual hexa-core CPUs in a typical case.Comment: This paper has been accepted at the following conference: 2013
International Conference on Parallel Processing (ICPP- 2013), October 1-4,
2013 Ecole Normale Suprieure de Lyon, Lyon, Franc
- …