One-dimensional Cellular Automata Research Articles

A New Binning Method for Metagenomics by One-Dimensional Cellular Automata.

More and more developed and inexpensive next-generation sequencing (NGS) technologies allow us to extract vast sequence data from a sample containing multiple species. Characterizing the taxonomic diversity for the planet-size data plays an important role in the metagenomic studies, while a crucial step for doing the study is the binning process to group sequence reads from similar species or taxonomic classes. The metagenomic binning remains a challenge work because of not only the various read noises but also the tremendous data volume. In this work, we propose an unsupervised binning method for NGS reads based on the one-dimensional cellular automaton (1D-CA). Our binning method facilities to reduce the memory usage because 1D-CA costs only linear space. Experiments on synthetic dataset exhibit that our method is helpful to identify species of lower abundance compared to the proposed tool.

One-dimensional cellular automaton model of traffic flow considering dynamic headway

Based on the NaSch cellular automaton traffic model, a modified single lane traffic model is proposed by considering the dynamic headway of successive vehicles, in which the complex characteristic and driving behavior difference between drivers are taken into account. The relationship between the flow rate and the traffic density is obtained by the numerical simulation, and it shows a two-dimensional region in the flow density plane. The three traffic phases, i.e., free flow, synchronized flow, and wide moving jams, are exhibited. It indicates that the synchronized flow and traffic jams can appear even if there is no traffic bottleneck. Besides, the high speed car-following phenomenon is indicated when the traffic is in the synchronized flow. The rate of the high speed car-following is in good agreement with the measured result.

Self-Organizing Construction Method of Offshore Structures by Cellular Automata Model

We propose a new algorithm to build self-organizing and self-repairing marine structures on the ocean floor, where humans and remotely operated robots cannot operate. The proposed algorithm is based on the one-dimensional cellular automata model and uses simple transition rules to produce various complex patterns. This cellular automata model can produce various complex patterns like sea shells with simple transition rules. The model can simulate the marine structure construction process with distributed cooperation control instead of central control. Like living organism is constructed with module called cell, we assume that the self-organized structure consists of unified modules (structural units). The units pile up at the bottom of the sea and a structure with the appropriate shape eventually emerges. Using the attribute of emerging patterns in the one-dimensional cellular automata model, we construct specific structures based on the local interaction of transition rules without using complex algorithms. Furthermore, the model requires smaller communication data among the units because it only relies on communication between adjacent structural units. With the proposed algorithm, in the future, it will be possible to use self-assembling structural modules without complex built-in computers.

A Reversible Steganography Scheme of Secret Image Sharing Based on Cellular Automata and Least Significant Bits Construction

Secret image sharing schemes have been extensively studied by far. However, there are just a few schemes that can restore both the secret image and the cover image losslessly. These schemes have one or more defects in the following aspects: (1) high computation cost; (2) overflow issue existing when modulus operation is used to restore the cover image and the secret image; (3) part of the cover image being severely modified and the stego images having worse visual quality. In this paper, we combine the methods of least significant bits construction (LSBC) and dynamic embedding with one-dimensional cellular automata to propose a new lossless scheme which solves the above issues and can resist differential attack and support parallel computing. Experimental results also show that this scheme has the merit of big embedding capacity.

A New Public Key Encryption Scheme based on Layered Cellular Automata

Cellular automata (CA) based cryptosystem has been studied for almost three decades, yet most of previously reported researches focus on the symmetric key encryption schemes. Up to now, few CA based public key encryption scheme has been proposed. To fill the gap, in this paper, we propose a new public key encryption scheme based on layered cellular automata (LCA). Specifically, in the proposed scheme, based on the T-shaped neighborhood structure, we combine four one-dimensional reversible CAs (set as the private key) to form the transition rules of a two-dimension CA, where the two-dimension CA is set as the corresponding public key. Based on the hardness assumption of the Decisional Dependent CA problem in LCA, we formally prove the proposed scheme is indistinguishably secure against the chosen-plaintext attack (IND-CPA). In addition, we also use a numeric example to demonstrate its feasibility. Finally, analysis of key space and time efficiency are also carried out along with RSA-1024, and the simulation results demonstrate that our proposed scheme is more efficient.

Dynamic shading of a building envelope based on rotating polarized film system controlled by one-dimensional cellular automata in regular tessellations (triangular, square and hexagonal)

The original prototype of the cellular automaton (CA) shading system (CASS) for building facades was based on rectangular array of cells and used liquid crystal technology. This paper introduces polarized film shading system (PFSS) – an alternative approach based on opto-mechanical modules whose opacity is a function of the rotation of polarized film elements. PFSS in regular tessellations: triangular, square and hexagonal are discussed. Simulations for each type of tessellation are presented and visualized. Visual attractiveness of emergent CA patterns manifested by “particles” and “solitons” is discussed.

Complete Characterization of Structure of Rule 54

The dynamics of rule 54 one-dimensional two-state cellular automaton (CA) are a discrete analog of a space-time dynamics of excitations in nonlinear active medium with mutual inhibition. A cell switches its state 0 to state 1 if one of its two neighbors is in state 1 (propagation of a perturbation) and a cell remains in state 1 only if its two neighbors are in state 0. A lateral inhibition is because a 1-state neighbor causes a 1-state cell to switch to state 0. The rule produces a rich spectrum of space-time dynamics, including gliders and glider guns just from four primitive gliders. We construct a catalogue of gliders and describe them by tiles. We calculate a subset of regular expressions $\Psi_{R54}$ to encode gliders. The regular expressions are derived from de Bruijn diagrams, tile-based representation of gliders, and cycle diagrams sometimes. We construct an abstract machine that recognizes regular expressions of gliders in rule 54 and validate $\Psi_{R54}$. We also propose a way to code initial configurations of gliders to depict any type of collision between the gliders and explore self-organization of gliders, formation of larger tiles, and soliton-like interactions of gliders and computable devices.

Path-integral solution of the one-dimensional Dirac quantum cellular automaton

Quantum cellular automata have been recently considered as a fundamental approach to quantum field theory, resorting to a precise automaton, linear in the field, for the Dirac equation in one dimension. In such linear case a quantum automaton is isomorphic to a quantum walk, and a convenient formulation can be given in terms of transition matrices, leading to a new kind of discrete path integral that we solve analytically in terms of Jacobi polynomials versus the arbitrary mass parameter.

Critical bottleneck size for jamless particle flows in two dimensions.

We propose a simple microscopic model for arching phenomena at bottlenecks. The dynamics of particles in front of a bottleneck is described by a one-dimensional stochastic cellular automaton on a semicircular geometry. The model reproduces oscillation phenomena due to the formation and collapsing of arches. It predicts the existence of a critical bottleneck size for continuous particle flows. The dependence of the jamming probability on the system size is approximated by the Gompertz function. The analytical results are in good agreement with simulations.

Urban signalised intersections: Impact of vehicle heterogeneity and driver type on cross-traffic manoeuvres

This paper presents a model for heterogeneous traffic at simple X and T-intersections of a single lane and two lane urban roads. Traffic at the intersections is controlled by a set of lights, operated to one of several fixed-time schemes. The heterogeneous traffic consists of both short (e.g. cars) and long (buses/trucks or equivalent) vehicles and is modelled, using a one-dimensional two-component cellular automaton. For intersections, we consider the implications for both homogeneous and heterogeneous traffic flows, based on a minimum space rule. For longer vehicles, this implies occupation of multiple road cells. The distributions of traffic mix and driver type are shown to have significant effect on intersection performance and patterns of flow. Example findings are presented and simple validation of the model basis is given, using available, but limited, local Dublin field data.

Transfer matrix analysis of one-dimensional majority cellular automata with thermal noise

Thermal noise in a cellular automaton (CA) refers to a random perturbation in its function which eventually leads the automaton to an equilibrium state controlled by a temperature parameter. We study the one-dimensional majority-3 CA under this model of noise. Without noise, each cell in the automaton decides its next state by majority voting among itself and its left and right neighbour cells. Transfer matrix analysis shows that the automaton always reaches a state in which every cell is in one of its two states with probability 1/2 and thus cannot remember even one bit of information. Numerical experiments, however, support the possibility of reliable computation for a long but finite time.

VELOCITY CORRELATIONS IN THE NAGEL–SCHRECKENBERG MODEL

The correlation between the velocity of two successive vehicles as a function of time headway is studied in the one-dimensional cellular automata (CA) NaSch model within parallel dynamic update. It is found that a strong correlation occurs in short time headway. The behavior of the correlation velocity as a function of the car density in different traffic states is also investigated. Moreover, our study is also extended to a more complicated situation where the two vehicles are separated by a number n of other vehicles. It is shown that the velocity correlation coefficient depends strongly on the number n of vehicles in between and on their positions.

A non-qubit quantum adder as one-dimensional cellular automaton

A complete quantum addition machine is presented and compared with methods employing unitary transformations first. A quantum half-adder circuit shown earlier can be implemented into each cell of a 1D cellular automaton. An electric Aharonov–Bohm effect version of the quantum circuit is used to illustrate this implementation. Whatever a quantum Turing machine can achieve is realized in the cellular automata architecture we propose here. The coherence requirement is limited to one cell area. The magnetic flux needed is 0.1Φ0, corresponding to 0.414mT for a ring area of 1 square micron or an electric potential of 0.414mV at 1ps with an energy dissipation of 0.041eV per iteration.

One-Dimensional Cellular Automata with Reflective Boundary Conditions and Radius Three

A family of one-dimensional nite linear cellular automata with re ective boundary condition over the eld Zp is de ned. The generalizations are the radius and the eld that states take values. Here, we establish a connection between reversibility of cellular automata and the rule matrix of the cellular automata with radius three. Also, we prove that the reverse CA of this family again falls into this family.

Chaotic Behavior of One-Dimensional Cellular Automata Rule 24

Wolfram divided the 256 elementary cellular automata rules informally into four classes using dynamical concepts like periodicity, stability, and chaos. Rule 24, which is Bernoulliστ-shift rule and is member of Wolfram’s class II, is said to be simple as periodic before. Therefore, it is worthwhile studying dynamical behaviors of four rules, whether they possess chaotic attractors or not. In this paper, the complex dynamical behaviors of rule 24 of one-dimensional cellular automata are investigated from the viewpoint of symbolic dynamics. We find that rule 24 is chaotic in the sense of both Li-Yorke and Devaney on its attractor. Furthermore, we prove that four rules of global equivalenceε52of cellular automata are topologically conjugate. Then, we use diagrams to explain the attractor of rule 24, where characteristic function is used to describe the fact that all points fall into Bernoulli-shift map after two iterations under rule 24.

Design and Simulation of Improved One-Dimensional Cellular Automaton Model

By analyzing the condition of safe deceleration, a new CA traffic model emphasizing high safety was simulated. In order to describe the impact of the safety deceleration on the model, using computer to design and implement safety deceleration CA model simulation program. Computer numerical simulations have been carried out. The flow-density diagrams indicate the increase of flow and the stability of the entire system, and show the presence of meta-stable state near the critical density. With the increase of safety deceleration probability, the traffic flow is higher than that with the former model in the situations of both mid density and mid-low density.

Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling

A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov chain. A classical cellular automaton is a particular case of PCA. For a one-dimensional cellular automaton, we prove that ergodicity is equivalent to nilpotency, and is therefore undecidable. We then propose an efficient perfect sampling algorithm for the invariant measure of an ergodic PCA. Our algorithm does not assume any monotonicity property of the local rule. It is based on a bounding process which is shown to also be a PCA. Last, we focus on the PCA majority, whose asymptotic behavior is unknown, and perform numerical experiments using the perfect sampling procedure.

Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling

A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov chain. A classical cellular automaton is a particular case of PCA. For a one-dimensional cellular automaton, we prove that ergodicity is equivalent to nilpotency, and is therefore undecidable. We then propose an efficient perfect sampling algorithm for the invariant measure of an ergodic PCA. Our algorithm does not assume any monotonicity property of the local rule. It is based on a bounding process which is shown to also be a PCA. Last, we focus on the PCA majority, whose asymptotic behavior is unknown, and perform numerical experiments using the perfect sampling procedure.

Modelagem da distribuição de diâmetros utilizando autômatos celulares e redes neurais artificiais

Esse estudo apresenta um modelo de distribuição diamétrica baseado em um modelo de Autômatos Celulares (AC) unidimensionais e redes neurais artificiais (RNA). Cada célula do AC proposto representa uma classe de dap, sendo o estado futuro previsto em função do estado atual dessa célula, do estado de suas quatro células vizinhas e de sua idade atual e futura. Como regra de evolução, utilizou-se uma RNA. A exatidão foi avaliada empregando: o procedimento estatístico proposto por Leite e Oliveira (2002); a relação entre frequência observada e estimada; e o realismo biológico do modelo construído. Dentre as redes treinadas, foram selecionadas as dez que representavam a evolução da distribuição diamétrica com maior exatidão. Dentre essas dez RNA, sete apresentaram valores estimados estatisticamente iguais aos observados (p>0,01). O enfoque de modelagem proposto permite estimar distribuições diamétricas futuras com exatidão.

Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues

In this paper we study the dynamics of D-dimensional cellular automata (CA) by considering them as one-dimensional (1D) CA along some direction (slicing constructions). These constructions allow to give the D-dimensional version of important notions as 1D closing property and lift well-known one-dimensional results to the D-dimensional settings. Indeed, like in one-dimensional case, closing D-dimensional CA have jointly dense periodic orbits and biclosing D-dimensional CA are open. By the slicing constructions, we further prove that for the class of closing D-dimensional CA, surjectivity implies surjectivity on spatially periodic configurations (old standing open problem). We also deal with the decidability problem of the D-dimensional closing. By extending the Kariʼs construction from [31] based on tilings, we prove that the two-dimensional, and then D-dimensional, closing property is undecidable. In such a way, we add one further item to the class of dimension sensitive properties, i.e., properties that are decidable in dimension 1 and are undecidable in higher dimensions. It is well-known that there are not positively expansive CA in dimension 2 and higher. As a meaningful replacement, we introduce the notion of quasi-expansivity for D-dimensional CA which shares many global properties (in the D-dimensional settings) with the 1D positive expansivity. We also prove that for quasi-expansive D-dimensional CA the topological entropy (which is an uncomputable property for general CA) has infinite value. In a similar way as quasi-expansivity, the notions of quasi-sensitivity and quasi-almost equicontinuity are introduced and studied.