Simulating synchronized traffic flow and wide moving jam based on the brake light rule

A new cellular automaton (CA) model based on brake light rules is proposed, which considers the influence of deterministic deceleration on randomization probability and deceleration extent. To describe the synchronized flow phase of Kerner’s three-phase theory in accordance with empirical data, we have changed some rules of vehicle motion with the aim to improve speed and acceleration vehicle behavior in synchronized flow simulated with earlier cellular automaton models with brake lights. The fundamental diagrams and spatial–temporal diagrams are analyzed, as well as the complexity of the traffic evolution, the emergence process of wide moving jam. Simulation results show that our new model can reproduce the three traffic phases: free flow, synchronized flow and wide moving jam. In addition, our new model can well describe the complexity of traffic evolution: (1) with initial homogeneous distribution and large densities, the traffic will evolve into multiple steady states, in which the numbers of wide moving jams are not invariable. (2) With initial homogeneous distribution and the middle range of density, the wide moving jam will emerge stochastically. (3) With initial mega-jam distribution and the density close to a point with the low value, the initial mega-jam will disappear stochastically. (4) For the cases with multiple wide moving jams, the process is analyzed involving the generation of narrow moving jam due to “pinch effect”, which leads to wide moving jam emergence.     

The Automaton Realization of Iterated Wreath Products of Cyclic Groups

We study profinite groups which are infinitely iterated wreath products W _∞ = …?C _{n 2} ?C _{n 1} of finite cyclic groups via combinatorial language of transducers. Namely, we provide a naturally defined automaton realization of the group W _∞ by an automaton over a changing alphabet. Our construction gives a characterization of these profinite groups as automaton groups, i.e. as groups generated by a single automaton.     

Forest fire modelling using cellular automata: application to the watershed Oued Laou (Morocco)

ABSTRACT

In this work, we consider the problem of modelling the phenomenon of forest fires using the cellular automata approach. The proposed model takes into account the main parameters that affect this phenomenon like nature and density of vegetation, humidity, wind, and altitude. We developed a decision-aided tool with JAVA which allows to analyse and format several hybrid collected data (satellite images, Digital Terrain Model) relatively to each studied area. The generated scenarios of forest fire spread in the study area will be considered as a guide for strategies in control and prevention of forest fires. As an application, we consider the watershed Oued Laou (Morocco).     

An evolutionary framework for cultural change: Selectionism versus communal exchange

Dawkins? replicator-based conception of evolution has led to widespread mis-application of selectionism across the social sciences because it does not address the paradox that necessitated the theory of natural selection in the first place: how do organisms accumulate change when traits acquired over their lifetime are obliterated? This is addressed by von Neumann?s concept of a self-replicating automaton (SRA). A SRA consists of a self-assembly code that is used in two distinct ways: (1) actively deciphered during development to construct a self-similar replicant, and (2) passively copied to the replicant to ensure that it can reproduce. Information that is acquired over a lifetime is not transmitted to offspring, whereas information that is inherited during copying is transmitted. In cultural evolution there is no mechanism for discarding acquired change. Acquired change can accumulate orders of magnitude faster than, and quickly overwhelm, inherited change due to differential replication of variants in response to selection. This prohibits a selectionist but not an evolutionary framework for culture and the creative processes that fuel it. The importance non-Darwinian processes in biological evolution is increasingly recognized. Recent work on the origin of life suggests that early life evolved through a non-Darwinian process referred to as communal exchange that does not involve a self-assembly code, and that natural selection emerged from this more haphazard, ancestral evolutionary process. It is proposed that communal exchange provides an evolutionary framework for culture that enables specification of cognitive features necessary for a (real or artificial) societies to evolve culture. This is supported by a computational model of cultural evolution and a conceptual network based program for documenting material cultural history, and it is consistent with high levels of human cooperation.     

Inference of gene regulatory networks with multi-objective cellular genetic algorithm

Reverse engineering of biochemical networks remains an important open challenge in computational systems biology. The goal of model inference is to, based on time-series gene expression data, obtain the sparse topological structure and parameters that quantitatively understand and reproduce the dynamics of biological systems. In this paper, we propose a multi-objective approach for the inference of S-System structures for Gene Regulatory Networks (GRNs) based on Pareto dominance and Pareto optimality theoretical concepts instead of the conventional single-objective evaluation of Mean Squared Error (MSE). Our motivation is that, using a multi-objective formulation for the GRN, it is possible to optimize the sparse topology of a given GRN as well as the kinetic order and rate constant parameters in a decoupled S-System, yet avoiding the use of additional penalty weights. A flexible and robust Multi-Objective Cellular Evolutionary Algorithm is adapted to perform the tasks of parameter learning and network topology inference for the proposed approach. The resulting software, called MONET, is evaluated on real-based academic and synthetic time-series of gene expression taken from the DREAM3 challenge and the IRMA in vivo datasets. The ability to reproduce biological behavior and robustness to noise is assessed and compared. The results obtained are competitive and indicate that the proposed approach offers advantages over previously used methods. In addition, MONET is able to provide experts with a set of trade-off solutions involving GRNs with different typologies and MSEs.     

A New Class of Cellular Automata with a Discontinuous Glass Transition

We introduce a new class of two-dimensional cellular automata with a bootstrap percolation-like dynamics. Each site can be either empty or occupied by a single particle and the dynamics follows a deterministic updating rule at discrete times which allows only emptying sites. We prove that the threshold density ρ _c for convergence to a completely empty configuration is non trivial, 0<ρ _c <1, contrary to standard bootstrap percolation. Furthermore we prove that in the subcritical regime, ρ<ρ _c , emptying always occurs exponentially fast and that ρ _c coincides with the critical density for two-dimensional oriented site percolation on ℤ². This is known to occur also for some cellular automata with oriented rules for which the transition is continuous in the value of the asymptotic density and the crossover length determining finite size effects diverges as a power law when the critical density is approached from below. Instead for our model we prove that the transition is discontinuous and at the same time the crossover length diverges faster than any power law. The proofs of the discontinuity and the lower bound on the crossover length use a conjecture on the critical behaviour for oriented percolation. The latter is supported by several numerical simulations and by analytical (though non rigorous) works through renormalization techniques. Finally, we will discuss why, due to the peculiar mixed critical/first order character of this transition, the model is particularly relevant to study glassy and jamming transitions. Indeed, we will show that it leads to a dynamical glass transition for a Kinetically Constrained Spin Model. Most of the results that we present are the rigorous proofs of physical arguments developed in a joint work with D.S. Fisher.     

Kaleidoscope of life: A 24-neighbourhood outer-totalistic cellular automaton

One of the challenges of cellular automaton research is finding models with a low complexity and at the same time a rich dynamics. A measure of low complexity is the number of states in the model and the number of transition rules to switch between those states. In this paper, we propose a 2-dimensional 2-state cellular automaton that-though governed by a single simple transition rule-has a sufficiently rich dynamics to be computationally universal. According to the transition rule, a cell’s state is determined by the sum of the states of the cells at orthogonal or diagonal distances one or two from the cell (distance-2 Moore neighbourhood), but not by the previous state of the cell itself. Notwithstanding its simplicity, this model is able to generate a great variety of patterns, including several types of stable configurations, oscillators and patterns that move over cellular space (gliders). We prove the computational universality of the model by constructing a universal set of logic gates (NOT and AND) from these patterns. A key element in this proof is the shifting of phases and positions of signals such that they meet the input requirements of the logic gates. Similarities of the model with classical spin systems are also discussed.     

含重叠路段交通系统中信息反馈策略的比较研究

智能交通系统可以实时反馈路况信息、诱导出行,进而缓解交通拥堵.在时间反馈和平均速度反馈两种信息服务策略下,考虑重叠路段的影响,利用元胞自动机模型对人们的路径选择行为进行了模拟.结果表明,在含有重叠路段的网络中,相对时间反馈策略而言,平均速度反馈策略可以更有效地降低人们的出行时间,其优势在重叠部分长度占路径长度的比例很小和较大时十分明显,且随路径长度的增加而上升.在提高路网的利用效率方面,平均速度反馈策略的优势随路径长度的增加而逐渐下降,随重叠部分长度的增加而先降后升. 关键词： 交通流 元胞自动机 智能交通系统 信息反馈策略