Cellular-automata method for phase unwrapping
International Nuclear Information System (INIS)
Ghiglia, D.C.; Mastin, G.A.; Romero, L.A.
1987-01-01
Research into two-dimensional phase unwrapping has uncovered interesting and troublesome inconsistencies that cause path-dependent results. Cellular automata, which are simple, discrete mathematical systems, offered promise of computation in nondirectional, parallel manner. A cellular automaton was discovered that can unwrap consistent phase data in n dimensions in a path-independent manner and can automatically accommodate noise-induced (pointlike) inconsistencies and arbitrary boundary conditions (region partitioning). For data with regional (nonpointlike) inconsistencies, no phase-unwrapping algorithm will converge, including the cellular-automata approach. However, the automata method permits more simple visualization of the regional inconsistencies. Examples of its behavior on one- and two-dimensional data are presented
Linearizable cellular automata
International Nuclear Information System (INIS)
Nobe, Atsushi; Yura, Fumitaka
2007-01-01
The initial value problem for a class of reversible elementary cellular automata with periodic boundaries is reduced to an initial-boundary value problem for a class of linear systems on a finite commutative ring Z 2 . Moreover, a family of such linearizable cellular automata is given
Wavefront cellular learning automata.
Moradabadi, Behnaz; Meybodi, Mohammad Reza
2018-02-01
This paper proposes a new cellular learning automaton, called a wavefront cellular learning automaton (WCLA). The proposed WCLA has a set of learning automata mapped to a connected structure and uses this structure to propagate the state changes of the learning automata over the structure using waves. In the WCLA, after one learning automaton chooses its action, if this chosen action is different from the previous action, it can send a wave to its neighbors and activate them. Each neighbor receiving the wave is activated and must choose a new action. This structure for the WCLA is necessary in many dynamic areas such as social networks, computer networks, grid computing, and web mining. In this paper, we introduce the WCLA framework as an optimization tool with diffusion capability, study its behavior over time using ordinary differential equation solutions, and present its accuracy using expediency analysis. To show the superiority of the proposed WCLA, we compare the proposed method with some other types of cellular learning automata using two benchmark problems.
Wavefront cellular learning automata
Moradabadi, Behnaz; Meybodi, Mohammad Reza
2018-02-01
This paper proposes a new cellular learning automaton, called a wavefront cellular learning automaton (WCLA). The proposed WCLA has a set of learning automata mapped to a connected structure and uses this structure to propagate the state changes of the learning automata over the structure using waves. In the WCLA, after one learning automaton chooses its action, if this chosen action is different from the previous action, it can send a wave to its neighbors and activate them. Each neighbor receiving the wave is activated and must choose a new action. This structure for the WCLA is necessary in many dynamic areas such as social networks, computer networks, grid computing, and web mining. In this paper, we introduce the WCLA framework as an optimization tool with diffusion capability, study its behavior over time using ordinary differential equation solutions, and present its accuracy using expediency analysis. To show the superiority of the proposed WCLA, we compare the proposed method with some other types of cellular learning automata using two benchmark problems.
International Nuclear Information System (INIS)
Quasthoff, U.
1985-07-01
Cellular automata by definition consist of a finite or infinite number of cells, say of unit length, with each cell having the same transition function. These cells are usually considered as the smallest elements and so the space filled with these cells becomes discrete. Nevertheless, large pictures created by such cellular automata look very fractal. So we try to replace each cell by a couple of smaller cells, which have the same transition functions as the large ones. There are automata where this replacement does not destroy the macroscopic structure. In these cases this nesting process can be iterated. The paper contains large classes of automata with the above properties. In the case of one dimensional automata with two states and next neighbour interaction and a nesting function of the same type a complete classification is given. (author)
Magnetohydrodynamics cellular automata
International Nuclear Information System (INIS)
Hatori, Tadatsugu.
1990-02-01
There has been a renewal of interest in cellular automata, partly because they give an architecture for a special purpose computer with parallel processing optimized to solve a particular problem. The lattice gas cellular automata are briefly surveyed, which are recently developed to solve partial differential equations such as hydrodynamics or magnetohydrodynamics. A new model is given in the present paper to implement the magnetic Lorentz force in a more deterministic and local procedure than the previous one. (author)
Magnetohydrodynamic cellular automata
Energy Technology Data Exchange (ETDEWEB)
Hatori, Tadatsugu [National Inst. for Fusion Science, Nagoya (Japan)
1990-03-01
There has been a renewal of interest in cellular automata, partly because they give an architecture for a special purpose computer with parallel processing optimized to solve a particular problem. The lattice gas cellular automata are briefly surveyed, which are recently developed to solve partial differential equations such as hydrodynamics or magnetohydrodynamics. A new model is given in the present paper to implement the magnetic Lorentz force in a more deterministic and local procedure than the previous one. (author).
Magnetohydrodynamic cellular automata
International Nuclear Information System (INIS)
Hatori, Tadatsugu
1990-01-01
There has been a renewal of interest in cellular automata, partly because they give an architecture for a special purpose computer with parallel processing optimized to solve a particular problem. The lattice gas cellular automata are briefly surveyed, which are recently developed to solve partial differential equations such as hydrodynamics or magnetohydrodynamics. A new model is given in the present paper to implement the magnetic Lorentz force in a more deterministic and local procedure than the previous one. (author)
Probabilistic cellular automata.
Agapie, Alexandru; Andreica, Anca; Giuclea, Marius
2014-09-01
Cellular automata are binary lattices used for modeling complex dynamical systems. The automaton evolves iteratively from one configuration to another, using some local transition rule based on the number of ones in the neighborhood of each cell. With respect to the number of cells allowed to change per iteration, we speak of either synchronous or asynchronous automata. If randomness is involved to some degree in the transition rule, we speak of probabilistic automata, otherwise they are called deterministic. With either type of cellular automaton we are dealing with, the main theoretical challenge stays the same: starting from an arbitrary initial configuration, predict (with highest accuracy) the end configuration. If the automaton is deterministic, the outcome simplifies to one of two configurations, all zeros or all ones. If the automaton is probabilistic, the whole process is modeled by a finite homogeneous Markov chain, and the outcome is the corresponding stationary distribution. Based on our previous results for the asynchronous case-connecting the probability of a configuration in the stationary distribution to its number of zero-one borders-the article offers both numerical and theoretical insight into the long-term behavior of synchronous cellular automata.
Predictability in cellular automata.
Agapie, Alexandru; Andreica, Anca; Chira, Camelia; Giuclea, Marius
2014-01-01
Modelled as finite homogeneous Markov chains, probabilistic cellular automata with local transition probabilities in (0, 1) always posses a stationary distribution. This result alone is not very helpful when it comes to predicting the final configuration; one needs also a formula connecting the probabilities in the stationary distribution to some intrinsic feature of the lattice configuration. Previous results on the asynchronous cellular automata have showed that such feature really exists. It is the number of zero-one borders within the automaton's binary configuration. An exponential formula in the number of zero-one borders has been proved for the 1-D, 2-D and 3-D asynchronous automata with neighborhood three, five and seven, respectively. We perform computer experiments on a synchronous cellular automaton to check whether the empirical distribution obeys also that theoretical formula. The numerical results indicate a perfect fit for neighbourhood three and five, which opens the way for a rigorous proof of the formula in this new, synchronous case.
Cellular automata analysis and applications
Hadeler, Karl-Peter
2017-01-01
This book focuses on a coherent representation of the main approaches to analyze the dynamics of cellular automata. Cellular automata are an inevitable tool in mathematical modeling. In contrast to classical modeling approaches as partial differential equations, cellular automata are straightforward to simulate but hard to analyze. In this book we present a review of approaches and theories that allow the reader to understand the behavior of cellular automata beyond simulations. The first part consists of an introduction of cellular automata on Cayley graphs, and their characterization via the fundamental Cutis-Hedlund-Lyndon theorems in the context of different topological concepts (Cantor, Besicovitch and Weyl topology). The second part focuses on classification results: What classification follows from topological concepts (Hurley classification), Lyapunov stability (Gilman classification), and the theory of formal languages and grammars (Kůrka classification). These classifications suggest to cluster cel...
Universal map for cellular automata
International Nuclear Information System (INIS)
García-Morales, V.
2012-01-01
A universal map is derived for all deterministic 1D cellular automata (CAs) containing no freely adjustable parameters and valid for any alphabet size and any neighborhood range (including non-symmetrical neighborhoods). The map can be extended to an arbitrary number of dimensions and topologies and to arbitrary order in time. Specific CA maps for the famous Conway's Game of Life and Wolfram's 256 elementary CAs are given. An induction method for CAs, based in the universal map, allows mathematical expressions for the orbits of a wide variety of elementary CAs to be systematically derived. -- Highlights: ► A universal map is derived for all deterministic 1D cellular automata (CA). ► The map is generalized to 2D for Von Neumann, Moore and hexagonal neighborhoods. ► A map for all Wolfram's 256 elementary CAs is derived. ► A map for Conway's “Game of Life” is obtained.
A new optimization method based on cellular automata for VVER-1000 nuclear reactor loading pattern
International Nuclear Information System (INIS)
Fadaei, Amir Hosein; Setayeshi, Saeed
2009-01-01
This paper presents a new and innovative optimization technique, which uses cellular automata for solving multi-objective optimization problems. Due to its ability in simulating the local information while taking neighboring effects into account, the cellular automata technique is a powerful tool for optimization. The fuel-loading pattern in nuclear reactor cores is a major optimization problem. Due to the immensity of the search space in fuel management optimization problems, finding the optimum solution requires a huge amount of calculations in the classical method. The cellular automata models, based on local information, can reduce the computations significantly. In this study, reducing the power peaking factor, while increasing the initial excess reactivity inside the reactor core of VVER-1000, which are two apparently contradictory objectives, are considered as the objective functions. The result is an optimum configuration, which is in agreement with the pattern proposed by the designer. In order to gain confidence in the reliability of this method, the aforementioned problem was also solved using neural network and simulated annealing, and the results and procedures were compared.
Statistical mechanics of cellular automata
International Nuclear Information System (INIS)
Wolfram, S.
1983-01-01
Cellular automata are used as simple mathematical models to investigate self-organization in statistical mechanics. A detailed analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors. With simple initial configurations, the cellular automata either tend to homogeneous states, or generate self-similar patterns with fractal dimensions approx. =1.59 or approx. =1.69. With ''random'' initial configurations, the irreversible character of the cellular automaton evolution leads to several self-organization phenomena. Statistical properties of the structures generated are found to lie in two universality classes, independent of the details of the initial state or the cellular automaton rules. More complicated cellular automata are briefly considered, and connections with dynamical systems theory and the formal theory of computation are discussed
Global properties of cellular automata
International Nuclear Information System (INIS)
Jen, E.
1986-01-01
Cellular automata are discrete mathematical systems that generate diverse, often complicated, behavior using simple deterministic rules. Analysis of the local structure of these rules makes possible a description of the global properties of the associated automata. A class of cellular automata that generate infinitely many aperoidic temporal sequences is defined,a s is the set of rules for which inverses exist. Necessary and sufficient conditions are derived characterizing the classes of ''nearest-neighbor'' rules for which arbitrary finite initial conditions (i) evolve to a homogeneous state; (ii) generate at least one constant temporal sequence
Directory of Open Access Journals (Sweden)
Mondry Adrian
2004-08-01
Full Text Available Abstract Background Many arrhythmias are triggered by abnormal electrical activity at the ionic channel and cell level, and then evolve spatio-temporally within the heart. To understand arrhythmias better and to diagnose them more precisely by their ECG waveforms, a whole-heart model is required to explore the association between the massively parallel activities at the channel/cell level and the integrative electrophysiological phenomena at organ level. Methods We have developed a method to build large-scale electrophysiological models by using extended cellular automata, and to run such models on a cluster of shared memory machines. We describe here the method, including the extension of a language-based cellular automaton to implement quantitative computing, the building of a whole-heart model with Visible Human Project data, the parallelization of the model on a cluster of shared memory computers with OpenMP and MPI hybrid programming, and a simulation algorithm that links cellular activity with the ECG. Results We demonstrate that electrical activities at channel, cell, and organ levels can be traced and captured conveniently in our extended cellular automaton system. Examples of some ECG waveforms simulated with a 2-D slice are given to support the ECG simulation algorithm. A performance evaluation of the 3-D model on a four-node cluster is also given. Conclusions Quantitative multicellular modeling with extended cellular automata is a highly efficient and widely applicable method to weave experimental data at different levels into computational models. This process can be used to investigate complex and collective biological activities that can be described neither by their governing differentiation equations nor by discrete parallel computation. Transparent cluster computing is a convenient and effective method to make time-consuming simulation feasible. Arrhythmias, as a typical case, can be effectively simulated with the methods
Recursive definition of global cellular-automata mappings
International Nuclear Information System (INIS)
Feldberg, R.; Knudsen, C.; Rasmussen, S.
1994-01-01
A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set of fixed points of cellular automata on an infinite lattice
Cellular automata and statistical mechanical models
International Nuclear Information System (INIS)
Rujan, P.
1987-01-01
The authors elaborate on the analogy between the transfer matrix of usual lattice models and the master equation describing the time development of cellular automata. Transient and stationary properties of probabilistic automata are linked to surface and bulk properties, respectively, of restricted statistical mechanical systems. It is demonstrated that methods of statistical physics can be successfully used to describe the dynamic and the stationary behavior of such automata. Some exact results are derived, including duality transformations, exact mappings, disorder, and linear solutions. Many examples are worked out in detail to demonstrate how to use statistical physics in order to construct cellular automata with desired properties. This approach is considered to be a first step toward the design of fully parallel, probabilistic systems whose computational abilities rely on the cooperative behavior of their components
Cellular Automata and the Humanities.
Gallo, Ernest
1994-01-01
The use of cellular automata to analyze several pre-Socratic hypotheses about the evolution of the physical world is discussed. These hypotheses combine characteristics of both rigorous and metaphoric language. Since the computer demands explicit instructions for each step in the evolution of the automaton, such models can reveal conceptual…
Simulating physics with cellular automata
Energy Technology Data Exchange (ETDEWEB)
Vichniac, G Y
1984-01-01
Cellular automata are dynamical systems where space, time, and variables are discrete. They are shown on two-dimensional examples to be capable of non-numerical simulations of physics. They are useful for faithful parallel processing of lattice models. At another level, they exhibit behaviours and illustrate concepts that are unmistakably physical, such as non-ergodicity and order parameters, frustration, relaxation to chaos through period doublings, a conspicuous arrow of time in reversible microscopic dynamics, causality and light-cone, and non-separability. In general, they constitute exactly computable models for complex phenomena and large-scale correlations that result from very simple short-range interactions. The author studies their space, time, and intrinsic symmetries and the corresponding conservation laws, with an emphasis on the conservation of information obeyed by reversible cellular automata. 60 references.
Cellular automata with voting rule
International Nuclear Information System (INIS)
Makowiec, D.
1996-01-01
The chosen local interaction - the voting (majority) rule applied to the square lattice is known to cause the non ergodic cellular automata behaviour. Presented computer simulation results verify two cases of non ergodicity. The first one is implicated by the noise introduced to the local interactions and the second one follows properties of the initial lattice configuration selected at random. For the simplified voting rule - non symmetric voting, the critical behaviour has been explained rigorously. (author)
Recursive definition of global cellular-automata mappings
DEFF Research Database (Denmark)
Feldberg, Rasmus; Knudsen, Carsten; Rasmussen, Steen
1994-01-01
A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping...... as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set...
Outer-totalistic cellular automata on graphs
International Nuclear Information System (INIS)
Marr, Carsten; Huett, Marc-Thorsten
2009-01-01
We present an intuitive formalism for implementing cellular automata on arbitrary topologies. By that means, we identify a symmetry operation in the class of elementary cellular automata. Moreover, we determine the subset of topologically sensitive elementary cellular automata and find that the overall number of complex patterns decreases under increasing neighborhood size in regular graphs. As exemplary applications, we apply the formalism to complex networks and compare the potential of scale-free graphs and metabolic networks to generate complex dynamics
Symmetry analysis of cellular automata
International Nuclear Information System (INIS)
García-Morales, V.
2013-01-01
By means of B-calculus [V. García-Morales, Phys. Lett. A 376 (2012) 2645] a universal map for deterministic cellular automata (CAs) has been derived. The latter is shown here to be invariant upon certain transformations (global complementation, reflection and shift). When constructing CA rules in terms of rules of lower range a new symmetry, “invariance under construction” is uncovered. Modular arithmetic is also reformulated within B-calculus and a new symmetry of certain totalistic CA rules, which calculate the Pascal simplices modulo an integer number p, is then also uncovered.
On two integrable cellular automata
Energy Technology Data Exchange (ETDEWEB)
Bobenko, A [Technische Univ. Berlin (Germany). Fachbereich Mathematik; Bordemann, M [Freiburg Univ. (Germany). Fachbereich Physik; Gunn, C [Technische Univ. Berlin (Germany). Fachbereich Mathematik; Pinkall, U [Technische Univ. Berlin (Germany). Fachbereich Mathematik
1993-11-01
We describe two simple cellular automata (CA) models which exhibit the essential attributes of soliton systems. The first one is an invertible, 2-state, 1-dimensional CA or, in other words, a nonlinear Z[sub 2]-valued dynamical system with discrete space and time. Against a vacuum state of 0, the system exhibits light cone particles in both spatial directions, which interact in a soliton-like fashion. A complete solution of this system is obtained. We also consider another CA, which is described by the Hirota equation over a finite field, and present a Lax representation for it. (orig.)
Cellular automata a parallel model
Mazoyer, J
1999-01-01
Cellular automata can be viewed both as computational models and modelling systems of real processes. This volume emphasises the first aspect. In articles written by leading researchers, sophisticated massive parallel algorithms (firing squad, life, Fischer's primes recognition) are treated. Their computational power and the specific complexity classes they determine are surveyed, while some recent results in relation to chaos from a new dynamic systems point of view are also presented. Audience: This book will be of interest to specialists of theoretical computer science and the parallelism challenge.
Minimal entropy approximation for cellular automata
International Nuclear Information System (INIS)
Fukś, Henryk
2014-01-01
We present a method for the construction of approximate orbits of measures under the action of cellular automata which is complementary to the local structure theory. The local structure theory is based on the idea of Bayesian extension, that is, construction of a probability measure consistent with given block probabilities and maximizing entropy. If instead of maximizing entropy one minimizes it, one can develop another method for the construction of approximate orbits, at the heart of which is the iteration of finite-dimensional maps, called minimal entropy maps. We present numerical evidence that the minimal entropy approximation sometimes outperforms the local structure theory in characterizing the properties of cellular automata. The density response curve for elementary CA rule 26 is used to illustrate this claim. (paper)
On Elementary and Algebraic Cellular Automata
Gulak, Yuriy
In this paper we study elementary cellular automata from an algebraic viewpoint. The goal is to relate the emergent complex behavior observed in such systems with the properties of corresponding algebraic structures. We introduce algebraic cellular automata as a natural generalization of elementary ones and discuss their applications as generic models of complex systems.
Simulation of Corrosion Process for Structure with the Cellular Automata Method
Chen, M. C.; Wen, Q. Q.
2017-06-01
In this paper, from the mesoscopic point of view, under the assumption of metal corrosion damage evolution being a diffusive process, the cellular automata (CA) method was proposed to simulate numerically the uniform corrosion damage evolution of outer steel tube of concrete filled steel tubular columns subjected to corrosive environment, and the effects of corrosive agent concentration, dissolution probability and elapsed etching time on the corrosion damage evolution were also investigated. It was shown that corrosion damage increases nonlinearly with increasing elapsed etching time, and the longer the etching time, the more serious the corrosion damage; different concentration of corrosive agents had different impacts on the corrosion damage degree of the outer steel tube, but the difference between the impacts was very small; the heavier the concentration, the more serious the influence. The greater the dissolution probability, the more serious the corrosion damage of the outer steel tube, but with the increase of dissolution probability, the difference between its impacts on the corrosion damage became smaller and smaller. To validate present method, corrosion damage measurements for concrete filled square steel tubular columns (CFSSTCs) sealed at both their ends and immersed fully in a simulating acid rain solution were conducted, and Faraday’s law was used to predict their theoretical values. Meanwhile, the proposed CA mode was applied for the simulation of corrosion damage evolution of the CFSSTCs. It was shown by the comparisons of results from the three methods aforementioned that they were in good agreement, implying that the proposed method used for the simulation of corrosion damage evolution of concrete filled steel tubular columns is feasible and effective. It will open a new approach to study and evaluate further the corrosion damage, loading capacity and lifetime prediction of concrete filled steel tubular structures.
How to detect integrability in cellular automata
International Nuclear Information System (INIS)
Joshi, N; Lafortune, S
2005-01-01
Ultra-discrete equations are generalized cellular automata in the sense that the dependent (and independent) variables take only integer values. We present a new method for identifying integrable ultra-discrete equations which is the equivalent of the singularity confinement property for difference equations and the Painleve property for differential equations. Using this criterion, we find integrable ultra-discrete equations which include the ultra-discrete Painleve equations. (letter to the editor)
Magnetohydrodynamic cellular automata
Montgomery, David; Doolen, Gary D.
1987-01-01
A generalization of the hexagonal lattice gas model of Frisch, Hasslacher and Pomeau is shown to lead to two-dimensional magnetohydrodynamics. The method relies on the ideal point-wise conservation law for vector potential.
Computational Modeling of Proteins based on Cellular Automata: A Method of HP Folding Approximation.
Madain, Alia; Abu Dalhoum, Abdel Latif; Sleit, Azzam
2018-06-01
The design of a protein folding approximation algorithm is not straightforward even when a simplified model is used. The folding problem is a combinatorial problem, where approximation and heuristic algorithms are usually used to find near optimal folds of proteins primary structures. Approximation algorithms provide guarantees on the distance to the optimal solution. The folding approximation approach proposed here depends on two-dimensional cellular automata to fold proteins presented in a well-studied simplified model called the hydrophobic-hydrophilic model. Cellular automata are discrete computational models that rely on local rules to produce some overall global behavior. One-third and one-fourth approximation algorithms choose a subset of the hydrophobic amino acids to form H-H contacts. Those algorithms start with finding a point to fold the protein sequence into two sides where one side ignores H's at even positions and the other side ignores H's at odd positions. In addition, blocks or groups of amino acids fold the same way according to a predefined normal form. We intend to improve approximation algorithms by considering all hydrophobic amino acids and folding based on the local neighborhood instead of using normal forms. The CA does not assume a fixed folding point. The proposed approach guarantees one half approximation minus the H-H endpoints. This lower bound guaranteed applies to short sequences only. This is proved as the core and the folds of the protein will have two identical sides for all short sequences.
Directory of Open Access Journals (Sweden)
Bilan Stepan
2017-01-01
Full Text Available To date, there are many tasks that are aimed at studying the dynamic changes in physical processes. These tasks do not give advance known result. The solution of such problems is based on the construction of a dynamic model of the object. Successful structural and functional implementation of the object model can give a positive result in time. This approach uses the task of constructing artificial biological objects. To solve such problems, pseudo-random number generators are used, which also find wide application for information protection tasks. Such generators should have good statistical properties and give a long repetition period of the generated pseudo-random bit sequence. This work is aimed at improving these characteristics. The paper considers the method of forming pseudo-random sequences of numbers on the basis of aperiodic cellular automata with two active cells. A pseudo-random number generator is proposed that generates three bit sequences. The first two bit sequences are formed by the corresponding two active cells in the cellular automaton. The third bit sequence is the result of executing the XOR function over the bits of the first two sequences and it has better characteristics compared to them. The use of cellular automata with two active cells allowed to improve the statistical properties of the formed bit sequence, as well as its repetition period. This is proved by using graphical tests for generators built based on cellular automata using the neighborhoods of von Neumann and Moore. The tests showed high efficiency of the generator based on an asynchronous cellular automaton with the neighborhood of Moore. The proposed pseudo-random number generators have good statistical properties, which makes it possible to use them in information security systems, as well as for simulation tasks of various dynamic processes.
Simulation of earthquakes with cellular automata
Directory of Open Access Journals (Sweden)
P. G. Akishin
1998-01-01
Full Text Available The relation between cellular automata (CA models of earthquakes and the Burridge–Knopoff (BK model is studied. It is shown that the CA proposed by P. Bak and C. Tang,although they have rather realistic power spectra, do not correspond to the BK model. We present a modification of the CA which establishes the correspondence with the BK model.An analytical method of studying the evolution of the BK-like CA is proposed. By this method a functional quadratic in stress release, which can be regarded as an analog of the event energy, is constructed. The distribution of seismic events with respect to this “energy” shows rather realistic behavior, even in two dimensions. Special attention is paid to two-dimensional automata; the physical restrictions on compression and shear stiffnesses are imposed.
Cellular automata in cytoskeletal lattices
Energy Technology Data Exchange (ETDEWEB)
Smith, S A; Watt, R C; Hameroff, S R
1984-01-01
Cellular automata (CA) activities could mediate biological regulation and information processing via nonlinear electrodynamic effects in cytoskeletal lattice arrays. Frohlich coherent oscillations and other nonlinear mechanisms may effect discrete 10/sup -10/ to 10/sup -11/ s interval events which result in dynamic patterns in biolattices such as cylindrical protein polymers: microtubules (MT). Structural geometry and electrostatic forces of MT subunit dipole oscillations suggest neighbor rules among the hexagonally packed protein subunits. Computer simulations using these suggested rules and MT structural geometry demonstrate CA activities including dynamical and stable self-organizing patterns, oscillators, and traveling gliders. CA activities in MT and other cytoskeletal lattices may have important biological regulatory functions. 23 references, 6 figures, 1 table.
Crash energy management on the base of Movable cellular automata method
Psakhie, Serguei; Dmitriev, Andrei; Shilko, Evgueni; Tatarintsev, Evgueni; Korostelev, Serguei
2001-06-01
One of the main problems of materials science is increasing of structure's viability under dynamic loading. In general, a solution is the management of transformation of the energy of loading to the energy of destroying of the least important parts and details of the structure. It has to be noted that similar problem also exists in materials science, since a majority of modern materials are heterogeneous and have a complex internal structure. To optimize this structure for working under dynamic loading it is necessary to take into account the redistribution of elastic energy including phase transformation, generation and accumulation of micro-damages, etc. As far as real experiments on destroying the complex objects are sufficiently expensive and getting of detailed information is often associates with essential difficulties, the methods of computer modeling are used in solving the similar problems. As a rule, these are the methods of continuum mechanics. Although essential achievements have been obtained on the basis of these methods the continuum approach has several limitations, connected first of all with the possibility of description of generation of damages, formation and development of cracks and mass mixing effects. These problems may be solved on the basis of the Movable Cellular Automata (MCA) method, which has been successfully used for modeling fracture of the different material and structures In the paper behavior and peculiarities of failure of complex structures and materials under dynamic loading are studied on the basis of computer modeling. The results shown that sometimes even small changes of the internal structure leads to the significant increasing of the viability of the complex structures and materials. It is due to the elastic energy flux change over during the dynamical loading. This effect may be explained by the fact that elastic energy fluxes define the current stress concentration. Namely, because the area of inclusions are subjected
Algorithmic crystal chemistry: A cellular automata approach
International Nuclear Information System (INIS)
Krivovichev, S. V.
2012-01-01
Atomic-molecular mechanisms of crystal growth can be modeled based on crystallochemical information using cellular automata (a particular case of finite deterministic automata). In particular, the formation of heteropolyhedral layered complexes in uranyl selenates can be modeled applying a one-dimensional three-colored cellular automaton. The use of the theory of calculations (in particular, the theory of automata) in crystallography allows one to interpret crystal growth as a computational process (the realization of an algorithm or program with a finite number of steps).
Chaotic behavior in the disorder cellular automata
International Nuclear Information System (INIS)
Ko, J.-Y.; Hung, Y.-C.; Ho, M.-C.; Jiang, I-M.
2008-01-01
Disordered cellular automata (DCA) represent an intermediate class between elementary cellular automata and the Kauffman network. Recently, Rule 126 of DCA has been explicated: the system can be accurately described by a discrete probability function. However, a means of extending to other rules has not been developed. In this investigation, a density map of the dynamical behavior of DCA is formulated based on Rule 22 and other totalistic rules. The numerical results reveal excellent agreement between the model and original automata. Furthermore, the inhomogeneous situation is also discussed
Complex Automata: Multi-scale Modeling with Coupled Cellular Automata
Hoekstra, A.G.; Caiazzo, A.; Lorenz, E.; Falcone, J.-L.; Chopard, B.; Hoekstra, A.G.; Kroc, J.; Sloot, P.M.A.
2010-01-01
Cellular Automata (CA) are generally acknowledged to be a powerful way to describe and model natural phenomena [1-3]. There are even tempting claims that nature itself is one big (quantum) information processing system, e.g. [4], and that CA may actually be nature’s way to do this processing [5-7].
Energy Technology Data Exchange (ETDEWEB)
Majta, Janusz; Madej, Łukasz; Svyetlichnyy, Dmytro S.; Perzyński, Konrad; Kwiecień, Marcin, E-mail: mkwiecie@agh.edu.pl; Muszka, Krzysztof
2016-08-01
The potential of discrete cellular automata technique to predict the grain refinement in wires produced using combined metal forming process is presented and discussed within the paper. The developed combined metal forming process can be treated as one of the Severe Plastic Deformation (SPD) techniques that consists of three different modes of deformation: asymmetric drawing with bending, namely accumulated angular drawing (AAD), wire drawing (WD) and wire flattening (WF). To accurately replicate complex stress state both at macro and micro scales during subsequent deformations two stage modeling approach was used. First, the Finite Element Method (FEM), implemented in commercial ABAQUS software, was applied to simulate entire combined forming process at the macro scale level. Then, based on FEM results, the Cellular Automata (CA) method was applied for simulation of grain refinement at the microstructure level. Data transferred between FEM and CA methods included set of files with strain tensor components obtained from selected integration points in the macro scale model. As a result of CA simulation, detailed information on microstructure evolution during severe plastic deformation conditions was obtained, namely: changes of shape and sizes of modeled representative volume with imposed microstructure, changes of the number of grains, subgrains and dislocation cells, development of grain boundaries angle distribution as well as changes in the pole figures. To evaluate CA model predictive capabilities, results of computer simulation were compared with scanning electron microscopy and electron back scattered diffraction images (SEM/EBSD) studies of samples after AAD+WD+WF process.
Zeno's paradox in quantum cellular automata
International Nuclear Information System (INIS)
Groessing, G.; Zeilinger, A.
1991-01-01
The effect of Zeno's paradox in quantum theory is demonstrated with the aid of quantum mechanical cellular automata. It is shown that the degree of non-unitarity of the cellular automaton evolution and the frequency of consecutive measurements of cellular automaton states are operationally indistinguishable. (orig.)
Zeno's paradox in quantum cellular automata
Energy Technology Data Exchange (ETDEWEB)
Groessing, G [Atominst. der Oesterreichischen Universitaeten, Vienna (Austria); Zeilinger, A [Inst. fuer Experimentalphysik, Univ. Innsbruck (Austria)
1991-07-01
The effect of Zeno's paradox in quantum theory is demonstrated with the aid of quantum mechanical cellular automata. It is shown that the degree of non-unitarity of the cellular automaton evolution and the frequency of consecutive measurements of cellular automaton states are operationally indistinguishable. (orig.).
Directory of Open Access Journals (Sweden)
P. G. Klyucharev
2017-01-01
Full Text Available A number of previous author’s papers proposed methods for constructing various cryptographic algorithms, including block ciphers and cryptographic hash functions, based on generalized cellular automata. This one is aimed at studying a possibility to use the algebraic cryptanalysis methods related to the construction of Gröbner bases for the generalized cellular automata to be applied in cryptography, i.e. this paper studies the possibility for using algebraic cryptanalysis methods to solve the problems of inversion of a generalized cellular automaton and recovering the key of such an automaton.If the cryptographic algorithm is represented as a system of polynomial equations over a certain finite field, then its breach is reduced to solving this system with respect to the key. Although the problem of solving a system of polynomial equations in a finite field is NP-difficult in the general case, the solution of a particular system can have low computational cost.Cryptanalysis based on the construction of a system of polynomial equations that links plain text, cipher-text and key, and its solution by algebraic methods, is usually called algebraic cryptanalysis. Among the main methods to solve systems of polynomial equations are those to construct Gröbner bases.Cryptanalysis of ciphers and hash functions based on generalized cellular automata can be reduced to various problems. We will consider two such problems: the problem of inversion of a generalized cellular automaton, which, in case we know the values of the cells after k iterations, enables us to find the initial values. And the task of recovering the key, which is to find the initial values of the remaining cells, using the cell values after k steps and the initial values of a part of the cells.A computational experiment was carried out to solve the two problems above stated in order to determine the maximum size of a generalized cellular automaton for which the solution of these
Quantum features of natural cellular automata
International Nuclear Information System (INIS)
Elze, Hans-Thomas
2016-01-01
Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schrödinger equation. This includes corresponding conservation laws. The class of “natural” Hamiltonian cellular automata is based exclusively on integer-valued variables and couplings and their dynamics derives from an Action Principle. They can be mapped reversibly to continuum models by applying Sampling Theory. Thus, “deformed” quantum mechanical models with a finite discreteness scale l are obtained, which for l → 0 reproduce familiar continuum results. We have recently demonstrated that such automata can form “multipartite” systems consistently with the tensor product structures of nonrelativistic many-body quantum mechanics, while interacting and maintaining the linear evolution. Consequently, the Superposition Principle fully applies for such primitive discrete deterministic automata and their composites and can produce the essential quantum effects of interference and entanglement. (paper)
A cryptosystem based on elementary cellular automata
Abdo, A. A.; Lian, Shiguo; Ismail, I. A.; Amin, M.; Diab, H.
2013-01-01
Based on elementary cellular automata, a new image encryption algorithm is proposed in this paper. In this algorithm, a special kind of periodic boundary cellular automata with unity attractors is used. From the viewpoint of security, the number of cellular automata attractor states are changed with respect to the encrypted image, and different key streams are used to encrypt different plain images. The cellular neural network with chaotic properties is used as the generator of a pseudo-random key stream. Theoretical analysis and experimental results have both confirmed that the proposed algorithm possesses high security level and good performances against differential and statistical attacks. The comparison with other existing schemes is given, which shows the superiority of the proposal scheme.
Cyclic cellular automata in 3D
International Nuclear Information System (INIS)
Reiter, Clifford A.
2011-01-01
Highlights: → We explore the self-organization of cyclic cellular automata in 3D. → Von Neumann, Moore and two types of intermediate neighborhoods are investigated. → Random neighborhoods self organize through phases into complex nested structures. → Demons are seen to have many alternatives in 3D. - Abstract: Cyclic cellular automata in two dimensions have long been intriguing because they self organize into spirals and that behavior can be analyzed. The form for the patterns that develop is highly dependent upon the form of the neighborhood. We extend this work to three dimensional cyclic cellular automata and observe self organization dependent upon the neighborhood type. This includes neighborhood types intermediate between Von Neumann and Moore neighborhoods. We also observe that the patterns include nested shells with the appropriate forms but that the nesting is far more complex than the spirals that occur in two dimensions.
Cellular Automata Simulation for Wealth Distribution
Lo, Shih-Ching
2009-08-01
Wealth distribution of a country is a complicate system. A model, which is based on the Epstein & Axtell's "Sugars cape" model, is presented in Netlogo. The model considers the income, age, working opportunity and salary as control variables. There are still other variables should be considered while an artificial society is established. In this study, a more complicate cellular automata model for wealth distribution model is proposed. The effects of social welfare, tax, economical investment and inheritance are considered and simulated. According to the cellular automata simulation for wealth distribution, we will have a deep insight of financial policy of the government.
Surface Dynamic Process Simulation with the Use of Cellular Automata
International Nuclear Information System (INIS)
Adamska-Szatko, M.; Bala, J.
2010-01-01
Cellular automata are known for many applications, especially for physical and biological simulations. Universal cellular automata can be used for modelling complex natural phenomena. The paper presents simulation of surface dynamic process. Simulation uses 2-dimensional cellular automata algorithm. Modelling and visualisation were created by in-house developed software with standard OpenGL graphic library. (authors)
Lattice gas cellular automata and lattice Boltzmann models an introduction
Wolf-Gladrow, Dieter A
2000-01-01
Lattice-gas cellular automata (LGCA) and lattice Boltzmann models (LBM) are relatively new and promising methods for the numerical solution of nonlinear partial differential equations. The book provides an introduction for graduate students and researchers. Working knowledge of calculus is required and experience in PDEs and fluid dynamics is recommended. Some peculiarities of cellular automata are outlined in Chapter 2. The properties of various LGCA and special coding techniques are discussed in Chapter 3. Concepts from statistical mechanics (Chapter 4) provide the necessary theoretical background for LGCA and LBM. The properties of lattice Boltzmann models and a method for their construction are presented in Chapter 5.
A cellular automata model for ant trails
Indian Academy of Sciences (India)
In this study, the unidirectional ant traffic flow with U-turn in an ant trail was investigated using one-dimensional cellular automata model. It is known that ants communicate with each other by dropping a chemical, called pheromone, on the substrate. Apart from the studies in the literature, it was considered in the model that ...
Cellular automata machines as physics emulators
International Nuclear Information System (INIS)
Toffoli, T.
1988-01-01
Can one design a computer optimized to be a physics emulator rather than a software interpreter? Cellular automata are discrete dynamical systems whose behavior is completely specified in terms of a local relation, much as is the case for a large class of continuous dynamical systems defined by partial differential equations. 31 refs, 3 figs
Fuzzy cellular automata models in immunology
International Nuclear Information System (INIS)
Ahmed, E.
1996-01-01
The self-nonself character of antigens is considered to be fuzzy. The Chowdhury et al. cellular automata model is generalized accordingly. New steady states are found. The first corresponds to a below-normal help and suppression and is proposed to be related to autoimmune diseases. The second corresponds to a below-normal B-cell level
Completely reproducible description of digital sound data with cellular automata
International Nuclear Information System (INIS)
Wada, Masato; Kuroiwa, Jousuke; Nara, Shigetoshi
2002-01-01
A novel method of compressive and completely reproducible description of digital sound data by means of rule dynamics of CA (cellular automata) is proposed. The digital data of spoken words and music recorded with the standard format of a compact disk are reproduced completely by this method with use of only two rules in a one-dimensional CA without loss of information
Additive Cellular Automata and Volume Growth
Directory of Open Access Journals (Sweden)
Thomas B. Ward
2000-08-01
Full Text Available Abstract: A class of dynamical systems associated to rings of S-integers in rational function fields is described. General results about these systems give a rather complete description of the well-known dynamics in one-dimensional additive cellular automata with prime alphabet, including simple formulÃƒÂ¦ for the topological entropy and the number of periodic configurations. For these systems the periodic points are uniformly distributed along some subsequence with respect to the maximal measure, and in particular are dense. Periodic points may be constructed arbitrarily close to a given configuration, and rationality of the dynamical zeta function is characterized. Throughout the emphasis is to place this particular family of cellular automata into the wider context of S-integer dynamical systems, and to show how the arithmetic of rational function fields determines their behaviour. Using a covering space the dynamics of additive cellular automata are related to a form of hyperbolicity in completions of rational function fields. This expresses the topological entropy of the automata directly in terms of volume growth in the covering space.
Two Phase Flow Simulation Using Cellular Automata
International Nuclear Information System (INIS)
Marcel, C.P.
2002-01-01
The classical mathematical treatment of two-phase flows is based on the average of the conservation equations for each phase.In this work, a complementary approach to the modeling of these systems based on statistical population balances of aut omata sets is presented.Automata are entities defined by mathematical states that change following iterative rules representing interactions with the neighborhood.A model of automata for two-phase flow simulation is presented.This model consists of fie lds of virtual spheres that change their volumes and move around a certain environment.The model is more general than the classical cellular automata in two respects: the grid of cellular automata is dismissed in favor of a trajectory generator, and the rules of interaction involve parameters representing the actual physical interactions between phases.Automata simulation was used to study unsolved two-phase flow problems involving high heat flux rates. One system described in this work consists of a vertical channel with saturated water at normal pressure heated from the lower surface.The heater causes water to boil and starts the bubble production.We used cellular automata to describe two-phase flows and the interaction with the heater.General rule s for such cellular automata representing bubbles moving in stagnant liquid were used, with special attention to correct modeling of different mechanisms of heat transfer.The results of the model were compared to previous experiments and correlations finding good agreement.One of the most important findings is the confirmation of Kutateladze's idea about a close relation between the start of critical heat flux and a change in the flow's topology.This was analyzed using a control volume located in the upper surface of the heater.A strong decrease in the interfacial surface just before the CHF start was encountered.The automata describe quite well some characteristic parameters such as the shape of the local void fraction in the
Zhao, Y.; Qin, R. S.; Chen, D. F.
2013-08-01
A three-dimensional (3D) cellular automata (CA) model has been developed for the simulation of microstructure evolution in alloy solidification. The governing rule for the CA model is associated with the phase transition driving force which is obtained via a thermodynamic database. This determines the migration rate of the non-equilibrium solid-liquid (SL) interface and is calculated according to the local temperature and chemical composition. The curvature of the interface and the anisotropic property of the surface energy are taken into consideration. A 3D finite element (FE) method is applied for the calculation of transient heat and mass transfer. Numerical calculations for the solidification of Fe-1.5 wt% C alloy have been performed. The morphological evolution of dendrites, carbon segregation and temperature distribution in both isothermal and non-isothermal conditions are studied. The parameters affecting the growth of equiaxed and columnar dendrites are discussed. The calculated results are verified using the analytical model and previous experiments. The method provides a sophisticated approach to the solidification of multi-phase and multi-component systems.
Designing beauty the art of cellular automata
Martínez, Genaro
2016-01-01
This fascinating, colourful book offers in-depth insights and first-hand working experiences in the production of art works, using simple computational models with rich morphological behaviour, at the edge of mathematics, computer science, physics and biology. It organically combines ground breaking scientific discoveries in the theory of computation and complex systems with artistic representations of the research results. In this appealing book mathematicians, computer scientists, physicists, and engineers brought together marvelous and esoteric patterns generated by cellular automata, which are arrays of simple machines with complex behavior. Configurations produced by cellular automata uncover mechanics of dynamic patterns formation, their propagation and interaction in natural systems: heart pacemaker, bacterial membrane proteins, chemical rectors, water permeation in soil, compressed gas, cell division, population dynamics, reaction-diffusion media and self-organisation. The book inspires artists to tak...
Cellular automata in photonic cavity arrays.
Li, Jing; Liew, T C H
2016-10-31
We propose theoretically a photonic Turing machine based on cellular automata in arrays of nonlinear cavities coupled with artificial gauge fields. The state of the system is recorded making use of the bistability of driven cavities, in which losses are fully compensated by an external continuous drive. The sequential update of the automaton layers is achieved automatically, by the local switching of bistable states, without requiring any additional synchronization or temporal control.
Cellular-automata supercomputers for fluid-dynamics modeling
International Nuclear Information System (INIS)
Margolus, N.; Toffoli, T.; Vichniac, G.
1986-01-01
We report recent developments in the modeling of fluid dynamics, and give experimental results (including dynamical exponents) obtained using cellular automata machines. Because of their locality and uniformity, cellular automata lend themselves to an extremely efficient physical realization; with a suitable architecture, an amount of hardware resources comparable to that of a home computer can achieve (in the simulation of cellular automata) the performance of a conventional supercomputer
Probabilistic cellular automata: Some statistical mechanical considerations
International Nuclear Information System (INIS)
Lebowitz, J.L.; Maes, C.; Speer, E.R.
1990-01-01
Spin systems evolving in continuous or discrete time under the action of stochastic dynamics are used to model phenomena as diverse as the structure of alloys and the functioning of neural networks. While in some cases the dynamics are secondary, designed to produce a specific stationary measure whose properties one is interested in studying, there are other cases in which the only available information is the dynamical rule. Prime examples of the former are computer simulations, via Glauber dynamics, of equilibrium Gibbs measures with a specified interaction potential. Examples of the latter include various types of majority rule dynamics used as models for pattern recognition and for error-tolerant computations. The present note discusses ways in which techniques found useful in equilibrium statistical mechanics can be applied to a particular class of models of the latter types. These are cellular automata with noise: systems in which the spins are updated stochastically at integer times, simultaneously at all sites of some regular lattice. These models were first investigated in detail in the Soviet literature of the late sixties and early seventies. They are now generally referred to as Stochastic or Probabilistic Cellular Automata (PCA), and may be considered to include deterministic automata (CA) as special limits. 16 refs., 3 figs
Stochastic properties of disturbed Elementary Cellular Automata
International Nuclear Information System (INIS)
Posiewnik, M.
2005-01-01
Cellular automata are class of simple mathematical systems that generate diverse, often complicated behaviour. Evolution of such a system is given by set of local and deterministic rules. However, in spite of simplicity of 'interactions' it's global behaviour can't be, in general, simply predicted or even can not be predicted in time shorter that time of it's strict evolution. We get as, a systems well known 1-dimensional, Wolfram class automata, and connect it into the reservoir consists of some random source (noise). In our experiment we are interested in: a) numeric verification of ergodicity for such a coupled system. b) finding it's probability distribution and evolution. c) finding some analogous for 'real' quantities and behaviour. d) using the dynamical systems and Markov chains theory to describe the system, and to make any predictions of it's behaviour. (author)
Multi-scale modeling with cellular automata: The complex automata approach
Hoekstra, A.G.; Falcone, J.-L.; Caiazzo, A.; Chopard, B.
2008-01-01
Cellular Automata are commonly used to describe complex natural phenomena. In many cases it is required to capture the multi-scale nature of these phenomena. A single Cellular Automata model may not be able to efficiently simulate a wide range of spatial and temporal scales. It is our goal to
Game of Life Cellular Automata
Adamatzky, Andrew
2010-01-01
In the late 1960s, British mathematician John Conway invented a virtual mathematical machine that operates on a two-dimensional array of square cell. Each cell takes two states, live and dead. The cells' states are updated simultaneously and in discrete time. A dead cell comes to life if it has exactly three live neighbours. A live cell remains alive if two or three of its neighbours are alive, otherwise the cell dies. Conway's Game of Life became the most programmed solitary game and the most known cellular automaton. The book brings together results of forty years of study into computational
Soliton cellular automata associated with crystal bases
International Nuclear Information System (INIS)
Hatayama, Goro; Kuniba, Atsuo; Takagi, Taichiro
2000-01-01
We introduce a class of cellular automata associated with crystals of irreducible finite dimensional representations of quantum affine algebras U' q (g-circumflex n ). They have solitons labeled by crystals of the smaller algebra U' q (g-circumflex n-1 ). We prove stable propagation of one soliton for g-circumflex n =A (2) 2n-1 ,A (2) 2n ,B (1) n ,C (1) n ,D (1) n and D (2) n+1 . For g-circumflex n =C (1) n , we also prove that the scattering matrices of two solitons coincide with the combinatorial R matrices of U' q (C (1) n-1 )-crystals
Basic Ideas to Approach Metastability in Probabilistic Cellular Automata
Cirillo, Emilio N. M.; Nardi, Francesca R.; Spitoni, Cristian
2016-01-01
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete time Markov chains on lattice with finite single--cell
Nonsynchronous updating in the multiverse of cellular automata
Reia, Sandro M.; Kinouchi, Osame
2015-04-01
In this paper we study updating effects on cellular automata rule space. We consider a subset of 6144 order-3 automata from the space of 262144 bidimensional outer-totalistic rules. We compare synchronous to asynchronous and sequential updatings. Focusing on two automata, we discuss how update changes destroy typical structures of these rules. Besides, we show that the first-order phase transition in the multiverse of synchronous cellular automata, revealed with the use of a recently introduced control parameter, seems to be robust not only to changes in update schema but also to different initial densities.
Nonsynchronous updating in the multiverse of cellular automata.
Reia, Sandro M; Kinouchi, Osame
2015-04-01
In this paper we study updating effects on cellular automata rule space. We consider a subset of 6144 order-3 automata from the space of 262144 bidimensional outer-totalistic rules. We compare synchronous to asynchronous and sequential updatings. Focusing on two automata, we discuss how update changes destroy typical structures of these rules. Besides, we show that the first-order phase transition in the multiverse of synchronous cellular automata, revealed with the use of a recently introduced control parameter, seems to be robust not only to changes in update schema but also to different initial densities.
A Cellular Automata-Based Simulation Tool for Real Fire Accident Prevention
Directory of Open Access Journals (Sweden)
Jacek M. Czerniak
2018-01-01
Full Text Available Many serious real-life problems could be simulated using cellular automata theory. There were a lot of fires in public places which kill many people. Proposed method, called Cellular Automata Evaluation (CAEva in short, is using cellular automata theory and could be used for checking buildings conditions for fire accident. The tests performed on real accident showed that an appropriately configured program allows obtaining a realistic simulation of human evacuation. The authors analyze some real accidents and proved that CAEva method appears as a very promising solution, especially in the cases of building renovations or temporary unavailability of escape routes.
A generalized cellular automata approach to modeling first order ...
Indian Academy of Sciences (India)
system, consisting of space, time and state, structured with simple local rules without ... Sensitivity analysis of a stochastic cellular automata model. 413 ..... Baetens J M and De Baets B 2011 Design and parameterization of a stochastic cellular.
Cellular automata in image processing and geometry
Adamatzky, Andrew; Sun, Xianfang
2014-01-01
The book presents findings, views and ideas on what exact problems of image processing, pattern recognition and generation can be efficiently solved by cellular automata architectures. This volume provides a convenient collection in this area, in which publications are otherwise widely scattered throughout the literature. The topics covered include image compression and resizing; skeletonization, erosion and dilation; convex hull computation, edge detection and segmentation; forgery detection and content based retrieval; and pattern generation. The book advances the theory of image processing, pattern recognition and generation as well as the design of efficient algorithms and hardware for parallel image processing and analysis. It is aimed at computer scientists, software programmers, electronic engineers, mathematicians and physicists, and at everyone who studies or develops cellular automaton algorithms and tools for image processing and analysis, or develops novel architectures and implementations of mass...
Study of spatially extended dynamical systems using probabilistic cellular automata
International Nuclear Information System (INIS)
Vanag, Vladimir K
1999-01-01
Spatially extended dynamical systems are ubiquitous and include such things as insect and animal populations; complex chemical, technological, and geochemical processes; humanity itself, and much more. It is clearly desirable to have a certain universal tool with which the highly complex behaviour of nonlinear dynamical systems can be analyzed and modelled. For this purpose, cellular automata seem to be good candidates. In the present review, emphasis is placed on the possibilities that various types of probabilistic cellular automata (PCA), such as DSMC (direct simulation Monte Carlo) and LGCA (lattice-gas cellular automata), offer. The methods are primarily designed for modelling spatially extended dynamical systems with inner fluctuations accounted for. For the Willamowskii-Roessler and Oregonator models, PCA applications to the following problems are illustrated: the effect of fluctuations on the dynamics of nonlinear systems; Turing structure formation; the effect of hydrodynamic modes on the behaviour of nonlinear chemical systems (stirring effects); bifurcation changes in the dynamical regimes of complex systems with restricted geometry or low spatial dimension; and the description of chemical systems in microemulsions. (reviews of topical problems)
A Deterministic Approach to the Synchronization of Cellular Automata
Garcia, J.; Garcia, P.
2011-01-01
In this work we introduce a deterministic scheme of synchronization of linear and nonlinear cellular automata (CA) with complex behavior, connected through a master-slave coupling. By using a definition of Boolean derivative, we use the linear approximation of the automata to determine a function of coupling that promotes synchronization without perturbing all the sites of the slave system.
Computing by Temporal Order: Asynchronous Cellular Automata
Directory of Open Access Journals (Sweden)
Michael Vielhaber
2012-08-01
Full Text Available Our concern is the behaviour of the elementary cellular automata with state set 0,1 over the cell set Z/nZ (one-dimensional finite wrap-around case, under all possible update rules (asynchronicity. Over the torus Z/nZ (n<= 11,we will see that the ECA with Wolfram rule 57 maps any v in F_2^n to any w in F_2^n, varying the update rule. We furthermore show that all even (element of the alternating group bijective functions on the set F_2^n = 0,...,2^n-1, can be computed by ECA57, by iterating it a sufficient number of times with varying update rules, at least for n <= 10. We characterize the non-bijective functions computable by asynchronous rules.
Particles and Patterns in Cellular Automata
International Nuclear Information System (INIS)
Jen, E.; Das, R.; Beasley, C.E.
1999-01-01
This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). Our objective has been to develop tools for studying particle interactions in a class of dynamical systems characterized by discreteness, determinism, local interaction, and an inherently parallel form of evolution. These systems can be described by cellular automata (CA) and the behavior we studied has improved our understanding of the nature of patterns generated by CAs, their ability to perform global computations, and their relationship to continuous dynamical systems. We have also developed a rule-table mathematics that enables one to custom-design CA rule tables to generate patterns of specified types, or to perform specified computational tasks
Simulating Complex Systems by Cellular Automata
Kroc, Jiri; Hoekstra, Alfons G
2010-01-01
Deeply rooted in fundamental research in Mathematics and Computer Science, Cellular Automata (CA) are recognized as an intuitive modeling paradigm for Complex Systems. Already very basic CA, with extremely simple micro dynamics such as the Game of Life, show an almost endless display of complex emergent behavior. Conversely, CA can also be designed to produce a desired emergent behavior, using either theoretical methodologies or evolutionary techniques. Meanwhile, beyond the original realm of applications - Physics, Computer Science, and Mathematics – CA have also become work horses in very different disciplines such as epidemiology, immunology, sociology, and finance. In this context of fast and impressive progress, spurred further by the enormous attraction these topics have on students, this book emerges as a welcome overview of the field for its practitioners, as well as a good starting point for detailed study on the graduate and post-graduate level. The book contains three parts, two major parts on th...
Extended Cellular Automata Models of Particles and Space-Time
Beedle, Michael
2005-04-01
Models of particles and space-time are explored through simulations and theoretical models that use Extended Cellular Automata models. The expanded Cellular Automata Models consist go beyond simple scalar binary cell-fields, into discrete multi-level group representations like S0(2), SU(2), SU(3), SPIN(3,1). The propagation and evolution of these expanded cellular automatas are then compared to quantum field theories based on the "harmonic paradigm" i.e. built by an infinite number of harmonic oscillators, and with gravitational models.
A cellular automata model of bone formation.
Van Scoy, Gabrielle K; George, Estee L; Opoku Asantewaa, Flora; Kerns, Lucy; Saunders, Marnie M; Prieto-Langarica, Alicia
2017-04-01
Bone remodeling is an elegantly orchestrated process by which osteocytes, osteoblasts and osteoclasts function as a syncytium to maintain or modify bone. On the microscopic level, bone consists of cells that create, destroy and monitor the bone matrix. These cells interact in a coordinated manner to maintain a tightly regulated homeostasis. It is this regulation that is responsible for the observed increase in bone gain in the dominant arm of a tennis player and the observed increase in bone loss associated with spaceflight and osteoporosis. The manner in which these cells interact to bring about a change in bone quality and quantity has yet to be fully elucidated. But efforts to understand the multicellular complexity can ultimately lead to eradication of metabolic bone diseases such as osteoporosis and improved implant longevity. Experimentally validated mathematical models that simulate functional activity and offer eventual predictive capabilities offer tremendous potential in understanding multicellular bone remodeling. Here we undertake the initial challenge to develop a mathematical model of bone formation validated with in vitro data obtained from osteoblastic bone cells induced to mineralize and quantified at 26 days of culture. A cellular automata model was constructed to simulate the in vitro characterization. Permutation tests were performed to compare the distribution of the mineralization in the cultures and the distribution of the mineralization in the mathematical models. The results of the permutation test show the distribution of mineralization from the characterization and mathematical model come from the same probability distribution, therefore validating the cellular automata model. Copyright © 2017 Elsevier Inc. All rights reserved.
A generalized cellular automata approach to modeling first order ...
Indian Academy of Sciences (India)
... inhibitors deforming the allosteric site or inhibitors changing the structure of active ... Cell-based models with discrete state variables, such as Cellular Automata ... capture the essential features of a discrete real system, consisting of space, ...
Optimal Design of Gravitational Sewer Networks with General Cellular Automata
Directory of Open Access Journals (Sweden)
Mohammad Hadi Afshar
2014-05-01
Full Text Available In this paper, a Cellular Automata method is applied for the optimal design of sewer networks. The solution of sewer network optimization problems requires the determination of pipe diameters and average pipe cover depths, minimizing the total cost of the sewer network subject to operational constraints. In this paper, the network nodes and upstream and downstream pipe cover depths are considered as CA cells and cell states, respectively, and the links around each cell are taken into account as neighborhood. The proposed method is a general and flexible method for the optimization of sewer networks as it can be used to optimally design both gravity and pumped network due to the use of pipe nodal cover depths as the decision variables. The proposed method is tested against two gravitational sewer networks and the comparison of results with other methods such as Genetic algorithm, Cellular Automata, Ant Colony Optimization Algorithm and Particle Swarm Optimization show the efficiency and effectiveness of the proposed method.
Random networks of Boolean cellular automata
Energy Technology Data Exchange (ETDEWEB)
Miranda, Enrique [Comision Nacional de Energia Atomica, San Carlos de Bariloche (Argentina). Centro Atomico Bariloche
1990-01-01
Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author).
Random networks of Boolean cellular automata
International Nuclear Information System (INIS)
Miranda, Enrique
1990-01-01
Some recent results about random networks of Boolean automata -the Kauffman model- are reviewed. The structure of configuration space is explored. Ultrametricity between cycles is analyzed and the effects of noise in the dynamics are studied. (Author)
Cellular Automata Ideas in Digital Circuits and Switching Theory.
Siwak, Pawel P.
1985-01-01
Presents two examples which illustrate the usefulness of ideas from cellular automata. First, Lee's algorithm is recalled and its cellular nature shown. Then a problem from digraphs, which has arisen from analyzing predecessing configurations in the famous Conway's "game of life," is considered. (Author/JN)
Lempel-Ziv complexity analysis of one dimensional cellular automata.
Estevez-Rams, E; Lora-Serrano, R; Nunes, C A J; Aragón-Fernández, B
2015-12-01
Lempel-Ziv complexity measure has been used to estimate the entropy density of a string. It is defined as the number of factors in a production factorization of a string. In this contribution, we show that its use can be extended, by using the normalized information distance, to study the spatiotemporal evolution of random initial configurations under cellular automata rules. In particular, the transfer information from time consecutive configurations is studied, as well as the sensitivity to perturbed initial conditions. The behavior of the cellular automata rules can be grouped in different classes, but no single grouping captures the whole nature of the involved rules. The analysis carried out is particularly appropriate for studying the computational processing capabilities of cellular automata rules.
International Nuclear Information System (INIS)
Wolnik, Barbara; Dembowski, Marcin; Bołt, Witold; Baetens, Jan M; De Baets, Bernard
2017-01-01
The focus of this paper is on the density classification problem in the context of affine continuous cellular automata. Although such cellular automata cannot solve this problem in the classical sense, most density-conserving affine continuous cellular automata with a unit neighborhood radius are valid solutions of a slightly relaxed version of this problem. This result follows from a detailed study of the dynamics of the density-conserving affine continuous cellular automata that we introduce. (paper)
Design of Efficient Mirror Adder in Quantum- Dot Cellular Automata
Mishra, Prashant Kumar; Chattopadhyay, Manju K.
2018-03-01
Lower power consumption is an essential demand for portable multimedia system using digital signal processing algorithms and architectures. Quantum dot cellular automata (QCA) is a rising nano technology for the development of high performance ultra-dense low power digital circuits. QCA based several efficient binary and decimal arithmetic circuits are implemented, however important improvements are still possible. This paper demonstrate Mirror Adder circuit design in QCA. We present comparative study of mirror adder cells designed using conventional CMOS technique and mirror adder cells designed using quantum-dot cellular automata. QCA based mirror adders are better in terms of area by order of three.
Symmetry pattern transition in cellular automata with complex behavior
International Nuclear Information System (INIS)
Sanchez, Juan R.; Lopez-Ruiz, Ricardo
2008-01-01
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is shown that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex symmetrical patterns by stochastically coupling a proportion p of pairs of sites located at equal distance from the center of the lattice. A nontrivial critical value of p must be surpassed in order to obtain symmetrical patterns during the evolution. This strategy is able to classify the cellular automata rules - with complex behavior - between those that support time-dependent symmetric patterns and those which do not support such kind of patterns
Some applications and prospects of cellular automata in traffic problems
Goldengorin, Boris; Makarenko, Alexander; Smelyanec, Natalia; Yacoubi, SE; Chopard, B; Bandini, S
2006-01-01
In this paper we deal with mathematical modeling of participants' movement based on cellular automata (CA). We describe some improvements of CA models of pedestrian motion taking into account the real geometrical constraints induced by a specific restricted space. Also some presumable optimization
Fractal dimension at the phase transition of inhomogeneous cellular automata
International Nuclear Information System (INIS)
da Silva, L.R.
1988-01-01
For random binary mixtures of cellular automata in the square lattice, calculations are made of the fractal dimensions associated with the damage spreading and the propagation time of damage at the transition to chaos. Two rules are mixed and universalities of these quantities are sought with respect to change of the rules
Perturbations of dynamics of homogeneous two-dimensional cellular automata
Energy Technology Data Exchange (ETDEWEB)
Makowiec, D [Gdansk Univ. (Poland)
1993-04-01
The probabilistic approach provides a useful tool for understanding the nature of dynamics of cellular automata. It allows not only clarification of different results of the evolution but also gives explanation to the physical meaning of the rules. (author). 11 refs, 4 figs.
Cellular Automata in Topology Optimization of Continuum Structures ...
African Journals Online (AJOL)
In this paper, an optimization algorithm based on cellular automata (CA) is developed for topology optimization of continuum structures with shear and flexural behavior. The design domain is divided into small triangle elements and each cell is considered as a finite element. The stress analysis is performed by the Constant ...
Factorization, reduction and embedding in integrable cellular automata
International Nuclear Information System (INIS)
Kuniba, Atsuo; Takagi, Taichiro; Takenouchi, Akira
2004-01-01
Factorized dynamics in soliton cellular automata with quantum group symmetry is identified with a motion of particles and anti-particles exhibiting pair creation and annihilation. An embedding scheme is presented showing that the D (1) n -automaton contains, as certain subsectors, the box-ball systems and all the other automata associated with the crystal bases of non-exceptional affine Lie algebras. The results extend the earlier ones to higher representations by a certain reduction and to a wider class of boundary conditions
Energy Technology Data Exchange (ETDEWEB)
Marcel, C P [Instituto Balseiro, Universidad Nacional de Cuyo, Centro Atomico Bariloche (Argentina)
2002-07-01
The classical mathematical treatment of two-phase flows is based on the average of the conservation equations for each phase.In this work, a complementary approach to the modeling of these systems based on statistical population balances of aut omata sets is presented.Automata are entities defined by mathematical states that change following iterative rules representing interactions with the neighborhood.A model of automata for two-phase flow simulation is presented.This model consists of fie lds of virtual spheres that change their volumes and move around a certain environment.The model is more general than the classical cellular automata in two respects: the grid of cellular automata is dismissed in favor of a trajectory generator, and the rules of interaction involve parameters representing the actual physical interactions between phases.Automata simulation was used to study unsolved two-phase flow problems involving high heat flux rates. One system described in this work consists of a vertical channel with saturated water at normal pressure heated from the lower surface.The heater causes water to boil and starts the bubble production.We used cellular automata to describe two-phase flows and the interaction with the heater.General rule s for such cellular automata representing bubbles moving in stagnant liquid were used, with special attention to correct modeling of different mechanisms of heat transfer.The results of the model were compared to previous experiments and correlations finding good agreement.One of the most important findings is the confirmation of Kutateladze's idea about a close relation between the start of critical heat flux and a change in the flow's topology.This was analyzed using a control volume located in the upper surface of the heater.A strong decrease in the interfacial surface just before the CHF start was encountered.The automata describe quite well some characteristic parameters such as the shape of the local void fraction in the
Linear reversible second-order cellular automata and their first-order matrix equivalents
Macfarlane, A. J.
2004-11-01
Linear or one-dimensional reversible second-order cellular automata, exemplified by three cases named as RCA1-3, are introduced. Displays of their evolution in discrete time steps, &{\\in}Z_2;) as for RCA1-3. MCA1-3 are tractable because it has been possible to generalize to them the heavy duty methods already well-developed for ordinary first-order cellular automata like those of Wolfram's Rules 90 and 150. While the automata MCA1-3 are thought to be of genuine interest in their own right, with untapped further mathematical potential, their treatment has been applied here to expediting derivation of a large body of general and explicit results for N(t) for RCA1-3. Amongst explicit results obtained are formulas also for each of RCA1-3 for the total weight of the configurations of the first &2^M; times, M =0, 1, 2,\\ldots.
Neural networks and cellular automata in experimental high energy physics
Energy Technology Data Exchange (ETDEWEB)
Denby, B
1988-06-01
Within the past few years, two novel computing techniques, cellular automata and neural networks, have shown considerable promise in the solution of problems of a very high degree of complexity, such as turbulent fluid flow, image processing, and pattern recognition. Many of the problems faced in experimental high energy physics are also of this nature. Track reconstruction in wire chambers and cluster finding in cellular calorimeters, for instance, involve pattern recognition and high combinatorial complexity since many combinations of hits or cells must be considered in order to arrive at the final tracks or clusters. Here we examine in what way connective network methods can be applied to some of the problems of experimental high energy physics. It is found that such problems as track and cluster finding adapt naturally to these approaches. When large scale hard-wired connective networks become available, it will be possible to realize solutions to such problems in a fraction of the time required by traditional methods. For certain types of problems, faster solutions are already possible using model networks implemented on vector or other massively parallel machines. It should also be possible, using existing technology, to build simplified networks that will allow detailed reconstructed event information to be used in fast trigger decisions.
Neural networks and cellular automata in experimental high energy physics
International Nuclear Information System (INIS)
Denby, B.
1987-11-01
Within the past few years, two novel computing techniques, cellular automata and neural networks, have shown considerable promise in the solution of problems of a very high degree of complexity, such as turbulent fluid flow, image processing, and pattern recognition. Many of the problems faced in experimental high energy physics are also of this nature. Track reconstruction in wire chambers and cluster finding in cellular calorimeters, for instance, involve pattern recognition and high combinatorial complexity since many combinations of hits or cells must be considered in order to arrive at the final tracks or clusters. Here we examine in what way connective network methods can be applied to some of the problems of experimental high physics. It is found that such problems as track and cluster finding adapt naturally to these approaches. When large scale hardwired connective networks become available, it will be possible to realize solutions to such problems in a fraction of the time required by traditional methods. For certain types of problems, faster solutions are already possible using model networks implemented on vector or other massively parallel machines. It should also be possible, using existing technology, to build simplified networks that will allow detailed reconstructed event information to be used in fast trigger decisions
Neural networks and cellular automata in experimental high energy physics
International Nuclear Information System (INIS)
Denby, B.
1988-01-01
Within the past few years, two novel computing techniques, cellular automata and neural networks, have shown considerable promise in the solution of problems of a very high degree of complexity, such as turbulent fluid flow, image processing, and pattern recognition. Many of the problems faced in experimental high energy physics are also of this nature. Track reconstruction in wire chambers and cluster finding in cellular calorimeters, for instance, involve pattern recognition and high combinatorial complexity since many combinations of hits or cells must be considered in order to arrive at the final tracks or clusters. Here we examine in what way connective network methods can be applied to some of the problems of experimental high energy physics. It is found that such problems as track and cluster finding adapt naturally to these approaches. When large scale hard-wired connective networks become available, it will be possible to realize solutions to such problems in a fraction of the time required by traditional methods. For certain types of problems, faster solutions are already possible using model networks implemented on vector or other massively parallel machines. It should also be possible, using existing technology, to build simplified networks that will allow detailed reconstructed event information to be used in fast trigger decisions. (orig.)
International Nuclear Information System (INIS)
Barati, Ramin
2014-01-01
Highlights: • An innovative optimization technique for multi-objective optimization is presented. • The technique utilizes combination of CA and quasi-simulated annealing. • Mass and deformation of fuel plate are considered as objective functions. • Computational burden is significantly reduced compared to classic tools. - Abstract: This paper presents a new and innovative optimization technique utilizing combination of cellular automata (CA) and quasi-simulated annealing (QSA) as solver concerning conceptual design optimization which is indeed a multi-objective optimization problem. Integrating CA and QSA into a unified optimizer tool has a great potential for solving multi-objective optimization problems. Simulating neighborhood effects while taking local information into account from CA and accepting transitions based on decreasing of objective function and Boltzmann distribution from QSA as transition rule make this tool effective in multi-objective optimization. Optimization of fuel plate safety design while taking into account major goals of conceptual design such as improving reliability and life-time – which are the most significant elements during shutdown – is a major multi-objective optimization problem. Due to hugeness of search space in fuel plate optimization problem, finding optimum solution in classical methods requires a huge amount of calculation and CPU time. The CA models, utilizing local information, require considerably less computation. In this study, minimizing both mass and deformation of fuel plate of a multipurpose research reactor (MPRR) are considered as objective functions. Results, speed, and qualification of proposed method are comparable with those of genetic algorithm and neural network methods applied to this problem before
Station Model for Rail Transit System Using Cellular Automata
International Nuclear Information System (INIS)
Xun Jing; Ning Bin; Li Keping
2009-01-01
In this paper, we propose a new cellular automata model to simulate the railway traffic at station. Based on NaSch model, the proposed station model is composed of the main track and the siding track. Two different schemes for trains passing through station are considered. One is the scheme of 'pass by the main track, start and stop by the siding track'. The other is the scheme of 'two tracks play the same role'. We simulate the train movement using the proposed model and analyze the traffic flow at station. The simulation results demonstrate that the proposed cellular automata model can be successfully used for the simulations of railway traffic. Some characteristic behaviors of railway traffic flow can be reproduced. Moreover, the simulation values of the minimum headway are close to the theoretical values. This result demonstrates the dependability and availability of the proposed model. (general)
Universality of two-dimensional critical cellular automata
Bollobás, Béla; Duminil-Copin, Hugo; Morris, Robert; Smith, Paul
2014-01-01
We study the class of monotone, two-state, deterministic cellular automata, in which sites are activated (or `infected') by certain configurations of nearby infected sites. These models have close connections to statistical physics, and several specific examples have been extensively studied in recent years by both mathematicians and physicists. This general setting was first studied only recently, however, by Bollob\\'as, Smith and Uzzell, who showed that the family of all such `bootstrap per...
A Markov Process Inspired Cellular Automata Model of Road Traffic
Wang, Fa; Li, Li; Hu, Jianming; Ji, Yan; Yao, Danya; Zhang, Yi; Jin, Xuexiang; Su, Yuelong; Wei, Zheng
2008-01-01
To provide a more accurate description of the driving behaviors in vehicle queues, a namely Markov-Gap cellular automata model is proposed in this paper. It views the variation of the gap between two consequent vehicles as a Markov process whose stationary distribution corresponds to the observed distribution of practical gaps. The multiformity of this Markov process provides the model enough flexibility to describe various driving behaviors. Two examples are given to show how to specialize i...
Multidimensional cellular automata and generalization of Fekete's lemma
Directory of Open Access Journals (Sweden)
Silvio Capobianco
2008-08-01
Full Text Available Fekete's lemma is a well known combinatorial result on number sequences: we extend it to functions defined on $d$-tuples of integers. As an application of the new variant, we show that nonsurjective $d$-dimensional cellular automata are characterized by loss of arbitrarily much information on finite supports, at a growth rate greater than that of the support's boundary determined by the automaton's neighbourhood index.
Dualities for multi-state probabilistic cellular automata
International Nuclear Information System (INIS)
López, F Javier; Sanz, Gerardo; Sobottka, Marcelo
2008-01-01
In this paper a new form of duality for probabilistic cellular automata (PCA) is introduced. Using this duality, an ergodicity result for processes having a dual is proved. Also, conditions on the probabilities defining the evolution of the processes for the existence of a dual are provided. The results are applied to wide classes of PCA which include multi-opinion voter models, competition models and the Domany–Kinzel model
Fire and Heat Spreading Model Based on Cellular Automata Theory
Samartsev, A. A.; Rezchikov, A. F.; Kushnikov, V. A.; Ivashchenko, V. A.; Bogomolov, A. S.; Filimonyuk, L. Yu; Dolinina, O. N.; Kushnikov, O. V.; Shulga, T. E.; Tverdokhlebov, V. A.; Fominykh, D. S.
2018-05-01
The distinctive feature of the proposed fire and heat spreading model in premises is the reduction of the computational complexity due to the use of the theory of cellular automata with probability rules of behavior. The possibilities and prospects of using this model in practice are noted. The proposed model has a simple mechanism of integration with agent-based evacuation models. The joint use of these models could improve floor plans and reduce the time of evacuation from premises during fires.
The adaptive cruise control vehicles in the cellular automata model
International Nuclear Information System (INIS)
Jiang Rui; Wu Qingsong
2006-01-01
This Letter presented a cellular automata model where the adaptive cruise control vehicles are modelled. In this model, the constant time headway policy is adopted. The fundamental diagram is presented. The simulation results are in good agreement with the analytical ones. The mixture of ACC vehicles with manually driven vehicles is investigated. It is shown that with the introduction of ACC vehicles, the jam can be suppressed
Mammogram segmentation using maximal cell strength updation in cellular automata.
Anitha, J; Peter, J Dinesh
2015-08-01
Breast cancer is the most frequently diagnosed type of cancer among women. Mammogram is one of the most effective tools for early detection of the breast cancer. Various computer-aided systems have been introduced to detect the breast cancer from mammogram images. In a computer-aided diagnosis system, detection and segmentation of breast masses from the background tissues is an important issue. In this paper, an automatic segmentation method is proposed to identify and segment the suspicious mass regions of mammogram using a modified transition rule named maximal cell strength updation in cellular automata (CA). In coarse-level segmentation, the proposed method performs an adaptive global thresholding based on the histogram peak analysis to obtain the rough region of interest. An automatic seed point selection is proposed using gray-level co-occurrence matrix-based sum average feature in the coarse segmented image. Finally, the method utilizes CA with the identified initial seed point and the modified transition rule to segment the mass region. The proposed approach is evaluated over the dataset of 70 mammograms with mass from mini-MIAS database. Experimental results show that the proposed approach yields promising results to segment the mass region in the mammograms with the sensitivity of 92.25% and accuracy of 93.48%.
Cellular automata rule characterization and classification using texture descriptors
Machicao, Jeaneth; Ribas, Lucas C.; Scabini, Leonardo F. S.; Bruno, Odermir M.
2018-05-01
The cellular automata (CA) spatio-temporal patterns have attracted the attention from many researchers since it can provide emergent behavior resulting from the dynamics of each individual cell. In this manuscript, we propose an approach of texture image analysis to characterize and classify CA rules. The proposed method converts the CA spatio-temporal patterns into a gray-scale image. The gray-scale is obtained by creating a binary number based on the 8-connected neighborhood of each dot of the CA spatio-temporal pattern. We demonstrate that this technique enhances the CA rule characterization and allow to use different texture image analysis algorithms. Thus, various texture descriptors were evaluated in a supervised training approach aiming to characterize the CA's global evolution. Our results show the efficiency of the proposed method for the classification of the elementary CA (ECAs), reaching a maximum of 99.57% of accuracy rate according to the Li-Packard scheme (6 classes) and 94.36% for the classification of the 88 rules scheme. Moreover, within the image analysis context, we found a better performance of the method by means of a transformation of the binary states to a gray-scale.
Surjective cellular automata with zero entropy are almost one-to-one
International Nuclear Information System (INIS)
Moothathu, T.K.S.
2011-01-01
Highlights: → We use information about maps with zero entropy from Ergodic Theory. → Surjective cellular automata with zero entropy are almost one-to-one. → Surjective, additive cellular automata with zero entropy are injective. - Abstract: We show that any one-dimensional surjective cellular automata whose entropy is zero with respect to the uniform Bernoulli measure must be almost one-to-one.
A full computation-relevant topological dynamics classification of elementary cellular automata.
Schüle, Martin; Stoop, Ruedi
2012-12-01
Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and chaoticity. The "complex" ECA emerge to be sensitive, but not chaotic and not eventually weakly periodic. Based on this classification, we conjecture that elementary cellular automata capable of carrying out complex computations, such as needed for Turing-universality, are at the "edge of chaos."
Reliable self-replicating machines in asynchronous cellular automata.
Lee, Jia; Adachi, Susumu; Peper, Ferdinand
2007-01-01
We propose a self-replicating machine that is embedded in a two-dimensional asynchronous cellular automaton with von Neumann neighborhood. The machine dynamically encodes its shape into description signals, and despite the randomness of cell updating, it is able to successfully construct copies of itself according to the description signals. Self-replication on asynchronously updated cellular automata may find application in nanocomputers, where reconfigurability is an essential property, since it allows avoidance of defective parts and simplifies programming of such computers.
Computing aggregate properties of preimages for 2D cellular automata.
Beer, Randall D
2017-11-01
Computing properties of the set of precursors of a given configuration is a common problem underlying many important questions about cellular automata. Unfortunately, such computations quickly become intractable in dimension greater than one. This paper presents an algorithm-incremental aggregation-that can compute aggregate properties of the set of precursors exponentially faster than naïve approaches. The incremental aggregation algorithm is demonstrated on two problems from the two-dimensional binary Game of Life cellular automaton: precursor count distributions and higher-order mean field theory coefficients. In both cases, incremental aggregation allows us to obtain new results that were previously beyond reach.
Connection machine: a computer architecture based on cellular automata
Energy Technology Data Exchange (ETDEWEB)
Hillis, W D
1984-01-01
This paper describes the connection machine, a programmable computer based on cellular automata. The essential idea behind the connection machine is that a regular locally-connected cellular array can be made to behave as if the processing cells are connected into any desired topology. When the topology of the machine is chosen to match the topology of the application program, the result is a fast, powerful computing engine. The connection machine was originally designed to implement knowledge retrieval operations in artificial intelligence programs, but the hardware and the programming techniques are apparently applicable to a much larger class of problems. A machine with 100000 processing cells is currently being constructed. 27 references.
Simulasi Tumbukan Partikel Gas Ideal Dengan Model Cellular Automata Dua Dimensi
Abdul Basid, Annisa Mujriati
2010-01-01
Telah dilakukan simulasi tumbukan partikel gas ideal dengan menggunakan model cellular automata dua dimensi untuk memvisualisasikan tumbukan partikel gas ideal. Tumbukan partikel disimulasikan dengan menggunakan model cellular automata dua dimensi. Di dalam cellular automata, pergerakan partikel diatur dengan suatu aturan yaitu aturan delapan tetangga yang merupakan aturan acak. Hasil program simulasi tumbukan partikel gas ideal dengan model cellular automata dua dimensi mengguna...
A survey on the modeling and applications of cellular automata theory
Gong, Yimin
2017-09-01
The Cellular Automata Theory is a discrete model which is now widely used in scientific researches and simulations. The model is comprised of some cells which changes according to a specific rule over time. This paper provides a survey of the Modeling and Applications of Cellular Automata Theory, which focus on the program realization of Cellular Automata Theory and the application of Cellular Automata in each field, such as road traffic, land use, and cutting machines. Each application is further explained, and several related main models are briefly introduced. This research aims to help decision-makers formulate appropriate development plans.
Cellular Automata Rules and Linear Numbers
Nayak, Birendra Kumar; Sahoo, Sudhakar; Biswal, Sagarika
2012-01-01
In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers associated with linear CA rules are defined as linear numbers and the properties of these linear numbers are studied.
Cellular-automata-based learning network for pattern recognition
Tzionas, Panagiotis G.; Tsalides, Phillippos G.; Thanailakis, Adonios
1991-11-01
Most classification techniques either adopt an approach based directly on the statistical characteristics of the pattern classes involved, or they transform the patterns in a feature space and try to separate the point clusters in this space. An alternative approach based on memory networks has been presented, its novelty being that it can be implemented in parallel and it utilizes direct features of the patterns rather than statistical characteristics. This study presents a new approach for pattern classification using pseudo 2-D binary cellular automata (CA). This approach resembles the memory network classifier in the sense that it is based on an adaptive knowledge based formed during a training phase, and also in the fact that both methods utilize pattern features that are directly available. The main advantage of this approach is that the sensitivity of the pattern classifier can be controlled. The proposed pattern classifier has been designed using 1.5 micrometers design rules for an N-well CMOS process. Layout has been achieved using SOLO 1400. Binary pseudo 2-D hybrid additive CA (HACA) is described in the second section of this paper. The third section describes the operation of the pattern classifier and the fourth section presents some possible applications. The VLSI implementation of the pattern classifier is presented in the fifth section and, finally, the sixth section draws conclusions from the results obtained.
Effect of asynchronous updating on the stability of cellular automata
International Nuclear Information System (INIS)
Baetens, J.M.; Van der Weeën, P.; De Baets, B.
2012-01-01
Highlights: ► An upper bound on the Lyapunov exponent of asynchronously updated CA is established. ► The employed update method has repercussions on the stability of CAs. ► A decision on the employed update method should be taken with care. ► Substantial discrepancies arise between synchronously and asynchronously updated CA. ► Discrepancies between different asynchronous update schemes are less pronounced. - Abstract: Although cellular automata (CAs) were conceptualized as utter discrete mathematical models in which the states of all their spatial entities are updated simultaneously at every consecutive time step, i.e. synchronously, various CA-based models that rely on so-called asynchronous update methods have been constructed in order to overcome the limitations that are tied up with the classical way of evolving CAs. So far, only a few researchers have addressed the consequences of this way of updating on the evolved spatio-temporal patterns, and the reachable stationary states. In this paper, we exploit Lyapunov exponents to determine to what extent the stability of the rules within a family of totalistic CAs is affected by the underlying update method. For that purpose, we derive an upper bound on the maximum Lyapunov exponent of asynchronously iterated CAs, and show its validity, after which we present a comparative study between the Lyapunov exponents obtained for five different update methods, namely one synchronous method and four well-established asynchronous methods. It is found that the stability of CAs is seriously affected if one of the latter methods is employed, whereas the discrepancies arising between the different asynchronous methods are far less pronounced and, finally, we discuss the repercussions of our findings on the development of CA-based models.
Modeling evolution and immune system by cellular automata
International Nuclear Information System (INIS)
Bezzi, M.
2001-01-01
In this review the behavior of two different biological systems is investigated using cellular automata. Starting from this spatially extended approach it is also tried, in some cases, to reduce the complexity of the system introducing mean-field approximation, and solving (or trying to solve) these simplified systems. It is discussed the biological meaning of the results, the comparison with experimental data (if available) and the different features between spatially extended and mean-field versions. The biological systems considered in this review are the following: Darwinian evolution in simple ecosystems and immune system response. In the first section the main features of molecular evolution are introduced, giving a short survey of genetics for physicists and discussing some models for prebiotic systems and simple ecosystems. It is also introduced a cellular automaton model for studying a set of evolving individuals in a general fitness landscape, considering also the effects of co-evolution. In particular the process of species formation (speciation) is described in sect. 5. The second part deals with immune system modeling. The biological features of immune response are discussed, as well as it is introduced the concept of shape space and of idiotypic network. More detailed reviews which deal with immune system models (mainly focused on idiotypic network models) can be found. Other themes here discussed: the applications of CA to immune system modeling, two complex cellular automata for humoral and cellular immune response. Finally, it is discussed the biological data and the general conclusions are drawn in the last section
Intractable problems in reversible cellular automata
International Nuclear Information System (INIS)
Vatan, F.
1988-01-01
The billiard ball model, a classical mechanical system in which all parameters are real variables, can perform all digital computations. An eight-state, 11-neighbor reversible cellular automaton (an entirely discrete system in which all parameters are integer variables) can simulate this model. One of the natural problems for this system is to determine the shape of a container so that they initial specific distribution of gas molecules eventually leads to a predetermined distribution. This problem if PSPACE-complete. Related intractable and decidable problems are discussed as well
Leamy, Michael J.; Springer, Adam C.
In this research we report parallel implementation of a Cellular Automata-based simulation tool for computing elastodynamic response on complex, two-dimensional domains. Elastodynamic simulation using Cellular Automata (CA) has recently been presented as an alternative, inherently object-oriented technique for accurately and efficiently computing linear and nonlinear wave propagation in arbitrarily-shaped geometries. The local, autonomous nature of the method should lead to straight-forward and efficient parallelization. We address this notion on symmetric multiprocessor (SMP) hardware using a Java-based object-oriented CA code implementing triangular state machines (i.e., automata) and the MPI bindings written in Java (MPJ Express). We use MPJ Express to reconfigure our existing CA code to distribute a domain's automata to cores present on a dual quad-core shared-memory system (eight total processors). We note that this message passing parallelization strategy is directly applicable to computer clustered computing, which will be the focus of follow-on research. Results on the shared memory platform indicate nearly-ideal, linear speed-up. We conclude that the CA-based elastodynamic simulator is easily configured to run in parallel, and yields excellent speed-up on SMP hardware.
Cellular automata codebooks applied to compact image compression
Directory of Open Access Journals (Sweden)
Radu DOGARU
2006-12-01
Full Text Available Emergent computation in semi-totalistic cellular automata (CA is used to generate a set of basis (or codebook. Such codebooks are convenient for simple and circuit efficient compression schemes based on binary vector quantization, applied to the bitplanes of any monochrome or color image. Encryption is also naturally included using these codebooks. Natural images would require less than 0.5 bits per pixel (bpp while the quality of the reconstructed images is comparable with traditional compression schemes. The proposed scheme is attractive for low power, sensor integrated applications.
A Cellular Automata Model of Infection Control on Medical Implants
Prieto-Langarica, Alicia; Kojouharov, Hristo; Chen-Charpentier, Benito; Tang, Liping
2011-01-01
S. epidermidis infections on medically implanted devices are a common problem in modern medicine due to the abundance of the bacteria. Once inside the body, S. epidermidis gather in communities called biofilms and can become extremely hard to eradicate, causing the patient serious complications. We simulate the complex S. epidermidis-Neutrophils interactions in order to determine the optimum conditions for the immune system to be able to contain the infection and avoid implant rejection. Our cellular automata model can also be used as a tool for determining the optimal amount of antibiotics for combating biofilm formation on medical implants. PMID:23543851
Two Novel Quantum-Dot Cellular Automata Full Adders
Directory of Open Access Journals (Sweden)
Mahdie Qanbari
2013-01-01
Full Text Available Quantum-dot cellular automata (QCA is an efficient technology to create computing devices. QCA is a suitable candidate for the next generation of digital systems. Full adders are the main member of computational systems because other operations can be implemented by adders. In this paper, two QCA full adders are introduced. The first one is implemented in one layer, and the second one is implemented in three layers. Five-input majority gate is used in both of them. These full adders are better than pervious designs in terms of area, delay, and complexity.
Network reliability assessment using a cellular automata approach
International Nuclear Information System (INIS)
Rocco S, Claudio M.; Moreno, Jose Ali
2002-01-01
Two cellular automata (CA) models that evaluate the s-t connectedness and shortest path in a network are presented. CA based algorithms enhance the performance of classical algorithms, since they allow a more reliable and straightforward parallel implementation resulting in a dynamic network evaluation, where changes in the connectivity and/or link costs can readily be incorporated avoiding recalculation from scratch. The paper also demonstrates how these algorithms can be applied for network reliability evaluation (based on Monte-Carlo approach) and for finding s-t path with maximal reliability
An authenticated image encryption scheme based on chaotic maps and memory cellular automata
Bakhshandeh, Atieh; Eslami, Ziba
2013-06-01
This paper introduces a new image encryption scheme based on chaotic maps, cellular automata and permutation-diffusion architecture. In the permutation phase, a piecewise linear chaotic map is utilized to confuse the plain-image and in the diffusion phase, we employ the Logistic map as well as a reversible memory cellular automata to obtain an efficient and secure cryptosystem. The proposed method admits advantages such as highly secure diffusion mechanism, computational efficiency and ease of implementation. A novel property of the proposed scheme is its authentication ability which can detect whether the image is tampered during the transmission or not. This is particularly important in applications where image data or part of it contains highly sensitive information. Results of various analyses manifest high security of this new method and its capability for practical image encryption.
Application of lattice-gas cellular automata to the Brownian motion of solids in suspension
International Nuclear Information System (INIS)
Ladd, A.J.C.; Colvin, M.E.; Frenkel, D.
1988-01-01
An adaptation of lattice-gas cellular automata to the simulation of solid-fluid suspensions is described. The method incorporates both dissipative hydrodynamic forces and thermal fluctuations. At low solid densities, theoretical results for the drag force on a single disk and the viscosity of a suspension of disks are reproduced. The zero--shear-rate viscosity has been obtained over a range of packing fractions and results indicate that simulations of three-dimensional suspensions are feasible
Cell Based GIS as Cellular Automata for Disaster Spreading Predictions and Required Data Systems
Directory of Open Access Journals (Sweden)
Kohei Arai
2013-03-01
Full Text Available A method for prediction and simulation based on the Cell Based Geographic Information System(GIS as Cellular Automata (CA is proposed together with required data systems, in particular metasearch engine usage in an unified way. It is confirmed that the proposed cell based GIS as CA has flexible usage of the attribute information that is attached to the cell in concert with location information and does work for disaster spreading simulation and prediction.
Hellouin de Menibus, Benjamin; Sablik, Mathieu
2017-06-01
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial configuration at random according to some initial shift-ergodic measure, and use the limit measure to describe the asymptotic behaviour of the automata. We first take a qualitative approach, i.e. we obtain information on the limit measure(s). We prove that only particles moving in one particular direction can persist asymptotically. This provides some previously unknown information on the limit measures of various deterministic and probabilistic cellular automata: 3 and 4-cyclic cellular automata [introduced by Fisch (J Theor Probab 3(2):311-338, 1990; Phys D 45(1-3):19-25, 1990)], one-sided captive cellular automata [introduced by Theyssier (Captive Cellular Automata, 2004)], the majority-traffic cellular automaton, a self stabilisation process towards a discrete line [introduced by Regnault and Rémila (in: Mathematical Foundations of Computer Science 2015—40th International Symposium, MFCS 2015, Milan, Italy, Proceedings, Part I, 2015)]. In a second time we restrict our study to a subclass, the gliders cellular automata. For this class we show quantitative results, consisting in the asymptotic law of some parameters: the entry times [generalising K ůrka et al. (in: Proceedings of AUTOMATA, 2011)], the density of particles and the rate of convergence to the limit measure.
Simulation of root forms using cellular automata model
International Nuclear Information System (INIS)
Winarno, Nanang; Prima, Eka Cahya; Afifah, Ratih Mega Ayu
2016-01-01
This research aims to produce a simulation program for root forms using cellular automata model. Stephen Wolfram in his book entitled “A New Kind of Science” discusses the formation rules based on the statistical analysis. In accordance with Stephen Wolfram’s investigation, the research will develop a basic idea of computer program using Delphi 7 programming language. To best of our knowledge, there is no previous research developing a simulation describing root forms using the cellular automata model compared to the natural root form with the presence of stone addition as the disturbance. The result shows that (1) the simulation used four rules comparing results of the program towards the natural photographs and each rule had shown different root forms; (2) the stone disturbances prevent the root growth and the multiplication of root forms had been successfully modeled. Therefore, this research had added some stones, which have size of 120 cells placed randomly in the soil. Like in nature, stones cannot be penetrated by plant roots. The result showed that it is very likely to further develop the program of simulating root forms by 50 variations
Simulation of root forms using cellular automata model
Energy Technology Data Exchange (ETDEWEB)
Winarno, Nanang, E-mail: nanang-winarno@upi.edu; Prima, Eka Cahya [International Program on Science Education, Universitas Pendidikan Indonesia, Jl. Dr. Setiabudi no 229, Bandung40154 (Indonesia); Afifah, Ratih Mega Ayu [Department of Physics Education, Post Graduate School, Universitas Pendidikan Indonesia, Jl. Dr. Setiabudi no 229, Bandung40154 (Indonesia)
2016-02-08
This research aims to produce a simulation program for root forms using cellular automata model. Stephen Wolfram in his book entitled “A New Kind of Science” discusses the formation rules based on the statistical analysis. In accordance with Stephen Wolfram’s investigation, the research will develop a basic idea of computer program using Delphi 7 programming language. To best of our knowledge, there is no previous research developing a simulation describing root forms using the cellular automata model compared to the natural root form with the presence of stone addition as the disturbance. The result shows that (1) the simulation used four rules comparing results of the program towards the natural photographs and each rule had shown different root forms; (2) the stone disturbances prevent the root growth and the multiplication of root forms had been successfully modeled. Therefore, this research had added some stones, which have size of 120 cells placed randomly in the soil. Like in nature, stones cannot be penetrated by plant roots. The result showed that it is very likely to further develop the program of simulating root forms by 50 variations.
A stochastic parameterization for deep convection using cellular automata
Bengtsson, L.; Steinheimer, M.; Bechtold, P.; Geleyn, J.
2012-12-01
Cumulus parameterizations used in most operational weather and climate models today are based on the mass-flux concept which took form in the early 1970's. In such schemes it is assumed that a unique relationship exists between the ensemble-average of the sub-grid convection, and the instantaneous state of the atmosphere in a vertical grid box column. However, such a relationship is unlikely to be described by a simple deterministic function (Palmer, 2011). Thus, because of the statistical nature of the parameterization challenge, it has been recognized by the community that it is important to introduce stochastic elements to the parameterizations (for instance: Plant and Craig, 2008, Khouider et al. 2010, Frenkel et al. 2011, Bentsson et al. 2011, but the list is far from exhaustive). There are undoubtedly many ways in which stochastisity can enter new developments. In this study we use a two-way interacting cellular automata (CA), as its intrinsic nature possesses many qualities interesting for deep convection parameterization. In the one-dimensional entraining plume approach, there is no parameterization of horizontal transport of heat, moisture or momentum due to cumulus convection. In reality, mass transport due to gravity waves that propagate in the horizontal can trigger new convection, important for the organization of deep convection (Huang, 1988). The self-organizational characteristics of the CA allows for lateral communication between adjacent NWP model grid-boxes, and temporal memory. Thus the CA scheme used in this study contain three interesting components for representation of cumulus convection, which are not present in the traditional one-dimensional bulk entraining plume method: horizontal communication, memory and stochastisity. The scheme is implemented in the high resolution regional NWP model ALARO, and simulations show enhanced organization of convective activity along squall-lines. Probabilistic evaluation demonstrate an enhanced spread in
Crisci, G. M.; Avolio, M. V.; D'Ambrosio, D.; di Gregorio, S.; Lupiano, G. V.; Rongo, R.; Spataro, W.; Benhcke, B.; Neri, M.
2009-04-01
Forecasting the time, character and impact of future eruptions is difficult at volcanoes with complex eruptive behaviour, such as Mount Etna, where eruptions occur from the summit and on the flanks, affecting areas distant from each other. Modern efforts for hazard evaluation and contingency planning in volcanic areas draw heavily on hazard maps and numerical simulations. The computational model here applied belongs to the SCIARA family of lava flow simulation models. In the specific case this is the SCIARA-fv release, which is considered to give the most accurate and efficient performance, given the extent (567 km2) of the study area and the great number of simulations to be carried out. The model is based on the Cellular Automata computational paradigm and, specifically, on the Macroscopic Cellular Automata approach for the modelling of spatially extended dynamic systems2. This work addresses the problem of compiling high-detailed susceptibility maps with an elaborate approach in the numerical simulation of Etnean lava flows, based on the results of 39,300 simulations of flows erupted from a grid of 393 hypothetical vents in the eastern sector of Etna. This sector was chosen because it is densely populated and frequently affected by flank eruptions. Besides the definition of general susceptibility maps, the availability of a large number of lava flows of different eruption types, magnitudes and locations simulated for this study allows the instantaneous extraction of various scenarios on demand. For instance, in a Civil Defence oriented application, it is possible to identify all source areas of lava flows capable of affecting a given area of interest, such as a town or a major infrastructure. Indeed, this application is rapidly accomplished by querying the simulation database, by selecting the lava flows that affect the area of interest and by circumscribing their sources. Eventually, a specific category of simulation is dedicated to the assessment of protective
Simulations of living cell origins using a cellular automata model.
Ishida, Takeshi
2014-04-01
Understanding the generalized mechanisms of cell self-assembly is fundamental for applications in various fields, such as mass producing molecular machines in nanotechnology. Thus, the details of real cellular reaction networks and the necessary conditions for self-organized cells must be elucidated. We constructed a 2-dimensional cellular automata model to investigate the emergence of biological cell formation, which incorporated a looped membrane and a membrane-bound information system (akin to a genetic code and gene expression system). In particular, with an artificial reaction system coupled with a thermal system, the simultaneous formation of a looped membrane and an inner reaction process resulted in a more stable structure. These double structures inspired the primitive biological cell formation process from chemical evolution stage. With a model to simulate cellular self-organization in a 2-dimensional cellular automata model, 3 phenomena could be realized: (1) an inner reaction system developed as an information carrier precursor (akin to DNA); (2) a cell border emerged (akin to a cell membrane); and (3) these cell structures could divide into 2. This double-structured cell was considered to be a primary biological cell. The outer loop evolved toward a lipid bilayer membrane, and inner polymeric particles evolved toward precursor information carriers (evolved toward DNA). This model did not completely clarify all the necessary and sufficient conditions for biological cell self-organization. Further, our virtual cells remained unstable and fragile. However, the "garbage bag model" of Dyson proposed that the first living cells were deficient; thus, it would be reasonable that the earliest cells were more unstable and fragile than the simplest current unicellular organisms.
Excellent approach to modeling urban expansion by fuzzy cellular automata: agent base model
Khajavigodellou, Yousef; Alesheikh, Ali A.; Mohammed, Abdulrazak A. S.; Chapi, Kamran
2014-09-01
Recently, the interaction between humans and their environment is the one of important challenges in the world. Landuse/ cover change (LUCC) is a complex process that includes actors and factors at different social and spatial levels. The complexity and dynamics of urban systems make the applicable practice of urban modeling very difficult. With the increased computational power and the greater availability of spatial data, micro-simulation such as the agent based and cellular automata simulation methods, has been developed by geographers, planners, and scholars, and it has shown great potential for representing and simulating the complexity of the dynamic processes involved in urban growth and land use change. This paper presents Fuzzy Cellular Automata in Geospatial Information System and remote Sensing to simulated and predicted urban expansion pattern. These FCA-based dynamic spatial urban models provide an improved ability to forecast and assess future urban growth and to create planning scenarios, allowing us to explore the potential impacts of simulations that correspond to urban planning and management policies. A fuzzy inference guided cellular automata approach. Semantic or linguistic knowledge on Land use change is expressed as fuzzy rules, based on which fuzzy inference is applied to determine the urban development potential for each pixel. The model integrates an ABM (agent-based model) and FCA (Fuzzy Cellular Automata) to investigate a complex decision-making process and future urban dynamic processes. Based on this model rapid development and green land protection under the influences of the behaviors and decision modes of regional authority agents, real estate developer agents, resident agents and non- resident agents and their interactions have been applied to predict the future development patterns of the Erbil metropolitan region.
Definition and evolution of quantum cellular automata with two qubits per cell
International Nuclear Information System (INIS)
Karafyllidis, Ioannis G.
2004-01-01
Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures can simulate the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical systems and processes. It is however known that except for the trivial case, unitary evolution of one-dimensional homogeneous quantum cellular automata with one qubit per cell is not possible. Quantum cellular automata that comprise two qubits per cell are defined and their evolution is studied using a quantum computer simulator. The evolution is unitary and its linearity manifests itself as a periodic structure in the probability distribution patterns
From equilibrium spin models to probabilistic cellular automata
International Nuclear Information System (INIS)
Georges, A.; Le Doussal, P.
1989-01-01
The general equivalence between D-dimensional probabilistic cellular automata (PCA) and (D + 1)-dimensional equilibrium spin models satisfying a disorder condition is first described in a pedagogical way and then used to analyze the phase diagrams, the critical behavior, and the universality classes of some automato. Diagrammatic representations of time-dependent correlation functions PCA are introduced. Two important classes of PCA are singled out for which these correlation functions simplify: (1) Quasi-Hamiltonian automata, which have a current-carrying steady state, and for which some correlation functions are those of a D-dimensional static model PCA satisfying the detailed balance condition appear as a particular case of these rules for which the current vanishes. (2) Linear (and more generally affine) PCA for which the diagrammatics reduces to a random walk problem closely related to (D + 1)-dimensional directed SAWs: both problems display a critical behavior with mean-field exponents in any dimension. The correlation length and effective velocity of propagation of excitations can be calculated for affine PCA, as is shown on an explicit D = 1 example. The authors conclude with some remarks on nonlinear PCA, for which the diagrammatics is related to reaction-diffusion processes, and which belong in some cases to the universality class of Reggeon field theory
Genetic Algorithm Calibration of Probabilistic Cellular Automata for Modeling Mining Permit Activity
Louis, S.J.; Raines, G.L.
2003-01-01
We use a genetic algorithm to calibrate a spatially and temporally resolved cellular automata to model mining activity on public land in Idaho and western Montana. The genetic algorithm searches through a space of transition rule parameters of a two dimensional cellular automata model to find rule parameters that fit observed mining activity data. Previous work by one of the authors in calibrating the cellular automaton took weeks - the genetic algorithm takes a day and produces rules leading to about the same (or better) fit to observed data. These preliminary results indicate that genetic algorithms are a viable tool in calibrating cellular automata for this application. Experience gained during the calibration of this cellular automata suggests that mineral resource information is a critical factor in the quality of the results. With automated calibration, further refinements of how the mineral-resource information is provided to the cellular automaton will probably improve our model.
Reversible Flip-Flops in Quantum-Dot Cellular Automata
Rad, Samaneh Kazemi; Heikalabad, Saeed Rasouli
2017-09-01
Quantum-dot cellular automata is a new technology to design the efficient combinational and sequential circuits at the nano-scale. This technology has many desirable advantages compared to the CMOS technology such as low power consumption, less occupation area and low latency. These features make it suitable for use in flip-flop design. In this paper, with knowing the characteristics of reversible logic, we design new structures for flip-flops. The operations of these structures are evaluated with QCADesigner Version 2.0.3 simulator. In addition, we calculate the power dissipation of these structures by QCAPro tool. The results illustrated that proposed structures are efficient compared to the previous ones.
Universal shift register implementation using quantum dot cellular automata
Directory of Open Access Journals (Sweden)
Tamoghna Purkayastha
2018-06-01
Full Text Available Quantum-dot Cellular Automata (QCA demands to be a promising alternative of CMOS in ultra large scale circuit integration. Arithmetic and logic unit designs using QCA are of high research interest. A layout of four and eight bit universal shift register (USR has been proposed. Initially QCA layouts of D flip-flop with clear and 4 to 1 multiplexer are designed, which are extended to design 4 and 8-bit parallel in parallel out (PIPO shift register. Finally the PIPO is utilized to design 4-bit and 8-bit USR. By the comparative analysis it is observed that the proposed D Flip-flop achieved 40% clock delay improvement, whereas the modified layout of 4 to 1 multiplexer achieved 30% cell count reduction and 17% clock delay reduction from the previous works. This results in 31% reduction in cell count, 45% reduction in area and 55% reduction in clock cycle delay in 8 bit USR layout.
Integration of Neural Networks and Cellular Automata for Urban Planning
Institute of Scientific and Technical Information of China (English)
Anthony Gar-on Yeh; LI Xia
2004-01-01
This paper presents a new type of cellular automata (CA) model for the simulation of alternative land development using neural networks for urban planning. CA models can be regarded as a planning tool because they can generate alternative urban growth. Alternative development patterns can be formed by using different sets of parameter values in CA simulation. A critical issue is how to define parameter values for realistic and idealized simulation. This paper demonstrates that neural networks can simplify CA models but generate more plausible results. The simulation is based on a simple three-layer network with an output neuron to generate conversion probability. No transition rules are required for the simulation. Parameter values are automatically obtained from the training of network by using satellite remote sensing data. Original training data can be assessed and modified according to planning objectives. Alternative urban patterns can be easily formulated by using the modified training data sets rather than changing the model.
An Asynchronous Cellular Automata-Based Adaptive Illumination Facility
Bandini, Stefania; Bonomi, Andrea; Vizzari, Giuseppe; Acconci, Vito
The term Ambient Intelligence refers to electronic environments that are sensitive and responsive to the presence of people; in the described scenario the environment itself is endowed with a set of sensors (to perceive humans or other physical entities such as dogs, bicycles, etc.), interacting with a set of actuators (lights) that choose their actions (i.e. state of illumination) in an attempt improve the overall experience of these users. The model for the interaction and action of sensors and actuators is an asynchronous Cellular Automata (CA) with memory, supporting a self-organization of the system as a response to the presence and movements of people inside it. The paper will introduce the model, as well as an ad hoc user interface for the specification of the relevant parameters of the CA transition rule that determines the overall system behaviour.
Jahn-Teller effect in molecular electronics: quantum cellular automata
Tsukerblat, B.; Palii, A.; Clemente-Juan, J. M.; Coronado, E.
2017-05-01
The article summarizes the main results of application of the theory of the Jahn-Teller (JT) and pseudo JT effects to the description of molecular quantum dot cellular automata (QCA), a new paradigm of quantum computing. The following issues are discussed: 1) QCA as a new paradigm of quantum computing, principles and advantages; 2) molecular implementation of QCA; 3) role of the JT effect in charge trapping, encoding of binary information in the quantum cell and non-linear cell-cell response; 4) spin-switching in molecular QCA based on mixed-valence cell; 5) intervalence optical absorption in tetrameric molecular mixed-valence cell through the symmetry assisted approach to the multimode/multilevel JT and pseudo JT problems.
Deterministic one-way simulation of two-way, real-time cellular automata and its related problems
Energy Technology Data Exchange (ETDEWEB)
Umeo, H; Morita, K; Sugata, K
1982-06-13
The authors show that for any deterministic two-way, real-time cellular automaton, m, there exists a deterministic one-way cellular automation which can simulate m in twice real-time. Moreover the authors present a new type of deterministic one-way cellular automata, called circular cellular automata, which are computationally equivalent to deterministic two-way cellular automata. 7 references.
Cellular Automata-Based Parallel Random Number Generators Using FPGAs
Directory of Open Access Journals (Sweden)
David H. K. Hoe
2012-01-01
Full Text Available Cellular computing represents a new paradigm for implementing high-speed massively parallel machines. Cellular automata (CA, which consist of an array of locally connected processing elements, are a basic form of a cellular-based architecture. The use of field programmable gate arrays (FPGAs for implementing CA accelerators has shown promising results. This paper investigates the design of CA-based pseudo-random number generators (PRNGs using an FPGA platform. To improve the quality of the random numbers that are generated, the basic CA structure is enhanced in two ways. First, the addition of a superrule to each CA cell is considered. The resulting self-programmable CA (SPCA uses the superrule to determine when to make a dynamic rule change in each CA cell. The superrule takes its inputs from neighboring cells and can be considered itself a second CA working in parallel with the main CA. When implemented on an FPGA, the use of lookup tables in each logic cell removes any restrictions on how the super-rules should be defined. Second, a hybrid configuration is formed by combining a CA with a linear feedback shift register (LFSR. This is advantageous for FPGA designs due to the compactness of the LFSR implementations. A standard software package for statistically evaluating the quality of random number sequences known as Diehard is used to validate the results. Both the SPCA and the hybrid CA/LFSR were found to pass all the Diehard tests.
Directory of Open Access Journals (Sweden)
Adel Akbarimajd
2012-02-01
Full Text Available A path planning method for mobile robots based on two dimensional cellular automata is proposed. The method can be applied for environments with both concave and convex obstacles. It is also appropriate for multi-robot problems as well as dynamic environments. In order to develop the planning method, environment of the robot is decomposed to a rectangular grid and the automata is defined with four states including Robot cell, Free cell, Goal cell and Obstacle cell. Evolution rules of automata are proposed in order to direct the robot toward its goal. CA based path planner method is afterwards modified by a colony technique to be applicable for concave obstacles. Then a layered architecture is proposed to autonomously implement the planning algorithm. The architecture employs an abstraction approach which makes the complexity manageable. An important feature of the architecture is internal artifacts that have some beliefs about the world. Most actions of the robot are planned and performed with respect to these artifacts.
Linear reversible second-order cellular automata and their first-order matrix equivalents
International Nuclear Information System (INIS)
Macfarlane, A J
2004-01-01
Linear or one-dimensional reversible second-order cellular automata, exemplified by three cases named as RCA1-3, are introduced. Displays of their evolution in discrete time steps, t=0, 1, 2, ..., from their simplest initial states and on the basis of updating rules in modulo 2 arithmetic, are presented. In these, shaded and unshaded squares denote cells whose cell variables are equal to one and zero respectively. This paper is devoted to finding general formulas for, and explicit numerical evaluations of, the weights N(t) of the states or configurations of RCA1-3, i.e. the total number of shaded cells in tth line of their displays. This is achieved by means of the replacement of RCA1-3 by the equivalent linear first-order matrix automata MCA1-3, for which the cell variables are 2x2 matrices, instead of just numbers (element of Z 2 ) as for RCA1-3. MCA1-3 are tractable because it has been possible to generalize to them the heavy duty methods already well-developed for ordinary first-order cellular automata like those of Wolfram's Rules 90 and 150. While the automata MCA1-3 are thought to be of genuine interest in their own right, with untapped further mathematical potential, their treatment has been applied here to expediting derivation of a large body of general and explicit results for N(t) for RCA1-3. Amongst explicit results obtained are formulas also for each of RCA1-3 for the total weight of the configurations of the first 2 M times, M=0, 1, 2, ..
Modeling chemical systems using cellular automata a textbook and laboratory manual
Kier, Lemont B; Cheng, Chao-Kun
2005-01-01
There are few publications on Cellular Automata and certainly no direct competition Insight into a new modeling paradigm Novel approach to the use of in silico modeling to replace or supplement costly labs.
Decentralized indirect methods for learning automata games.
Tilak, Omkar; Martin, Ryan; Mukhopadhyay, Snehasis
2011-10-01
We discuss the application of indirect learning methods in zero-sum and identical payoff learning automata games. We propose a novel decentralized version of the well-known pursuit learning algorithm. Such a decentralized algorithm has significant computational advantages over its centralized counterpart. The theoretical study of such a decentralized algorithm requires the analysis to be carried out in a nonstationary environment. We use a novel bootstrapping argument to prove the convergence of the algorithm. To our knowledge, this is the first time that such analysis has been carried out for zero-sum and identical payoff games. Extensive simulation studies are reported, which demonstrate the proposed algorithm's fast and accurate convergence in a variety of game scenarios. We also introduce the framework of partial communication in the context of identical payoff games of learning automata. In such games, the automata may not communicate with each other or may communicate selectively. This comprehensive framework has the capability to model both centralized and decentralized games discussed in this paper.
Cellular Automata as a learning process in Architecture and Urban design
DEFF Research Database (Denmark)
Jensen, Mads Brath; Foged, Isak Worre
2014-01-01
. An architectural methodological response to this situation is presented through the development of a conceptual computational design system that allows these dynamics to unfold and to be observed for architectural design decision taking. Reflecting on the development and implementation of a cellular automata based...... design approach on a master level urban design studio this paper will discuss the strategies for dealing with complexity at an urban scale as well as the pedagogical considerations behind applying computational tools and methods to a urban design education....
Design of arithmetic circuits in quantum dot cellular automata nanotechnology
Sridharan, K
2015-01-01
This research monograph focuses on the design of arithmetic circuits in Quantum Dot Cellular Automata (QCA). Using the fact that the 3-input majority gate is a primitive in QCA, the book sets out to discover hitherto unknown properties of majority logic in the context of arithmetic circuit designs. The pursuit for efficient adders in QCA takes two forms. One involves application of the new results in majority logic to existing adders. The second involves development of a custom adder for QCA technology. A QCA adder named as hybrid adder is proposed and it is shown that it outperforms existing multi-bit adders with respect to area and delay. The work is extended to the design of a low-complexity multiplier for signed numbers in QCA. Furthermore the book explores two aspects unique to QCA technology, namely thermal robustness and the role of interconnects. In addition, the book introduces the reader to QCA layout design and simulation using QCADesigner. Features & Benefits: This research-based book: · �...
Cellular automata model for traffic flow with safe driving conditions
International Nuclear Information System (INIS)
Lárraga María Elena; Alvarez-Icaza Luis
2014-01-01
In this paper, a recently introduced cellular automata (CA) model is used for a statistical analysis of the inner microscopic structure of synchronized traffic flow. The analysis focuses on the formation and dissolution of clusters or platoons of vehicles, as the mechanism that causes the presence of this synchronized traffic state with a high flow. This platoon formation is one of the most interesting phenomena observed in traffic flows and plays an important role both in manual and automated highway systems (AHS). Simulation results, obtained from a single-lane system under periodic boundary conditions indicate that in the density region where the synchronized state is observed, most vehicles travel together in platoons with approximately the same speed and small spatial distances. The examination of velocity variations and individual vehicle gaps shows that the flow corresponding to the synchronized state is stable, safe and highly correlated. Moreover, results indicate that the observed platoon formation in real traffic is reproduced in simulations by the relation between vehicle headway and velocity that is embedded in the dynamics definition of the CA model. (general)
Cellular Automata for Modeling the field-scale erosion
International Nuclear Information System (INIS)
Diaz Suarez, Jorge; Bagarotti Marin, Angel; Ruiz Perez, Maria Elena
2008-01-01
Full text: The Cellular Automaton (CA) is a system used discrete dynamic modeling of many physical systems. Their fundamental properties are the interaction at the local level, homogeneity and parallelism. It has been used as a secondary for the simulation of large systems where the use of equations in partial derivatives is complex and costly from the computational point of view. On the other hand, the high complexity of spatial interaction in the processes involved in the erosion-transport-deposition of sediments at field level, considerably limiting the use of base models physics. The objective of this study is to model the main processes involved in erosion water supply of soils through the use of the CAMELot system, based on an extension of the original paradigm of the CA. The CAMELot system has been used in the simulation of systems of large spatial extent, where the laws of local interaction between automata have a deep physical sense. This system guarantees both the input of the necessary specifications and simulation in parallel, as the visualization and the general management of the system. They are exposed to each of the submodels used in it and the overall dynamics of the system is analyzed. (author)
Using Cellular Automata for Parking Recommendations in Smart Environments
Horng, Gwo-Jiun
2014-01-01
In this work, we propose an innovative adaptive recommendation mechanism for smart parking. The cognitive RF module will transmit the vehicle location information and the parking space requirements to the parking congestion computing center (PCCC) when the driver must find a parking space. Moreover, for the parking spaces, we use a cellular automata (CA) model mechanism that can adjust to full and not full parking lot situations. Here, the PCCC can compute the nearest parking lot, the parking lot status and the current or opposite driving direction with the vehicle location information. By considering the driving direction, we can determine when the vehicles must turn around and thus reduce road congestion and speed up finding a parking space. The recommendation will be sent to the drivers through a wireless communication cognitive radio (CR) model after the computation and analysis by the PCCC. The current study evaluates the performance of this approach by conducting computer simulations. The simulation results show the strengths of the proposed smart parking mechanism in terms of avoiding increased congestion and decreasing the time to find a parking space. PMID:25153671
Dengue fever spreading based on probabilistic cellular automata with two lattices
Pereira, F. M. M.; Schimit, P. H. T.
2018-06-01
Modeling and simulation of mosquito-borne diseases have gained attention due to a growing incidence in tropical countries in the past few years. Here, we study the dengue spreading in a population modeled by cellular automata, where there are two lattices to model the human-mosquitointeraction: one lattice for human individuals, and one lattice for mosquitoes in order to enable different dynamics in populations. The disease considered is the dengue fever with one, two or three different serotypes coexisting in population. Although many regions exhibit the incidence of only one serotype, here we set a complete framework to also study the occurrence of two and three serotypes at the same time in a population. Furthermore, the flexibility of the model allows its use to other mosquito-borne diseases, like chikungunya, yellow fever and malaria. An approximation of the cellular automata is proposed in terms of ordinary differential equations; the spreading of mosquitoes is studied and the influence of some model parameters are analyzed with numerical simulations. Finally, a method to combat dengue spreading is simulated based on a reduction of mosquito birth and mosquito bites in population.
A novel image encryption algorithm using chaos and reversible cellular automata
Wang, Xingyuan; Luan, Dapeng
2013-11-01
In this paper, a novel image encryption scheme is proposed based on reversible cellular automata (RCA) combining chaos. In this algorithm, an intertwining logistic map with complex behavior and periodic boundary reversible cellular automata are used. We split each pixel of image into units of 4 bits, then adopt pseudorandom key stream generated by the intertwining logistic map to permute these units in confusion stage. And in diffusion stage, two-dimensional reversible cellular automata which are discrete dynamical systems are applied to iterate many rounds to achieve diffusion on bit-level, in which we only consider the higher 4 bits in a pixel because the higher 4 bits carry almost the information of an image. Theoretical analysis and experimental results demonstrate the proposed algorithm achieves a high security level and processes good performance against common attacks like differential attack and statistical attack. This algorithm belongs to the class of symmetric systems.
Directory of Open Access Journals (Sweden)
Marc-Thorsten Hütt
2012-06-01
Full Text Available Cellular automata (CA are a remarkably efficient tool for exploring general properties of complex systems and spatiotemporal patterns arising from local rules. Totalistic cellular automata, where the update rules depend only on the density of neighboring states, are at the same time a versatile tool for exploring dynamical processes on graphs. Here we briefly review our previous results on cellular automata on graphs, emphasizing some systematic relationships between network architecture and dynamics identified in this way. We then extend the investigation towards graphs obtained in a simulated-evolution procedure, starting from Erdő s–Rényi (ER graphs and selecting for low entropies of the CA dynamics. Our key result is a strong association of low Shannon entropies with a broadening of the graph’s degree distribution.
Generic framework for mining cellular automata models on protein-folding simulations.
Diaz, N; Tischer, I
2016-05-13
Cellular automata model identification is an important way of building simplified simulation models. In this study, we describe a generic architectural framework to ease the development process of new metaheuristic-based algorithms for cellular automata model identification in protein-folding trajectories. Our framework was developed by a methodology based on design patterns that allow an improved experience for new algorithms development. The usefulness of the proposed framework is demonstrated by the implementation of four algorithms, able to obtain extremely precise cellular automata models of the protein-folding process with a protein contact map representation. Dynamic rules obtained by the proposed approach are discussed, and future use for the new tool is outlined.
Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks
Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez
2016-11-01
Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability.
Evolution of probability measures by cellular automata on algebraic topological Markov chains
Directory of Open Access Journals (Sweden)
ALEJANDRO MAASS
2003-01-01
Full Text Available In this paper we review some recent results on the evolution of probability measures under cellular automata acting on a fullshift. In particular we discuss the crucial role of the attractiveness of maximal measures. We enlarge the context of the results of a previous study of topological Markov chains that are Abelian groups; the shift map is an automorphism of this group. This is carried out by studying the dynamics of Markov measures by a particular additive cellular automata. Many of these topics were within the focus of Francisco Varela's mathematical interests.
A comparative analysis of electronic and molecular quantum dot cellular automata
International Nuclear Information System (INIS)
Umamahesvari, H.; Ajitha, D.
2015-01-01
This paper presents a comparative analysis of electronic quantum-dot cellular automata (EQCA) and Magnetic quantum dot Cellular Automata (MQCA). QCA is a computing paradigm that encodes and processes information by the position of individual electrons. To enhance the high dense and ultra-low power devices, various researches have been actively carried out to find an alternative way to continue and follow Moore’s law, so called “beyond CMOS technology”. There have been several proposals for physically implementing QCA, EQCA and MQCA are the two important QCAs reported so far. This paper provides a comparative study on these two QCAs
The Study Of Properties Of The Word Of Mouth Marketing Using Cellular Automata
Directory of Open Access Journals (Sweden)
Kowalska-Styczeń Agnieszka
2014-02-01
Full Text Available This article presents the possibility of using cellular automata, to study the properties of word of mouth (w-o-m marketing. Cellular automata allow to analyze the dynamics of changes in views and attitudes in social groups based on local interactions between people in small groups of friends, family members etc. The proposed paper shows the possibility of modelling the dynamics of word of mouth mechanism, if the basic assumptions of this process are: different size groups where this phenomenon occurs, and varied access to information. On the competing firms market, the dependence of the w-o-m mechanism dynamics on the model parameters is shown
Is there a sharp phase transition for deterministic cellular automata?
International Nuclear Information System (INIS)
Wootters, W.K.
1990-01-01
Previous work has suggested that there is a kind of phase transition between deterministic automata exhibiting periodic behavior and those exhibiting chaotic behavior. However, unlike the usual phase transitions of physics, this transition takes place over a range of values of the parameter rather than at a specific value. The present paper asks whether the transition can be made sharp, either by taking the limit of an infinitely large rule table, or by changing the parameter in terms of which the space of automata is explored. We find strong evidence that, for the class of automata we consider, the transition does become sharp in the limit of an infinite number of symbols, the size of the neighborhood being held fixed. Our work also suggests an alternative parameter in terms of which it is likely that the transition will become fairly sharp even if one does not increase the number of symbols. In the course of our analysis, we find that mean field theory, which is our main tool, gives surprisingly good predictions of the statistical properties of the class of automata we consider. 18 refs., 6 figs
Using cellular automata to simulate forest fire propagation in Portugal
Freire, Joana; daCamara, Carlos
2017-04-01
Wildfires in the Mediterranean region have severe damaging effects mainly due to large fire events [1, 2]. When restricting to Portugal, wildfires have burned over 1:4 million ha in the last decade. Considering the increasing tendency in the extent and severity of wildfires [1, 2], the availability of modeling tools of fire episodes is of crucial importance. Two main types of mathematical models are generally available, namely deterministic and stochastic models. Deterministic models attempt a description of fires, fuel and atmosphere as multiphase continua prescribing mass, momentum and energy conservation, which typically leads to systems of coupled PDEs to be solved numerically on a grid. Simpler descriptions, such as FARSITE, neglect the interaction with atmosphere and propagate the fire front using wave techniques. One of the most important stochastic models are Cellular Automata (CA), in which space is discretized into cells, and physical quantities take on a finite set of values at each cell. The cells evolve in discrete time according to a set of transition rules, and the states of the neighboring cells. In the present work, we implement and then improve a simple and fast CA model designed to operationally simulate wildfires in Portugal. The reference CA model chosen [3] has the advantage of having been applied successfully in other Mediterranean ecosystems, namely to historical fires in Greece. The model is defined on a square grid with propagation to 8 nearest and next-nearest neighbors, where each cell is characterized by 4 possible discrete states, corresponding to burning, not-yet burned, fuel-free and completely burned cells, with 4 possible rules of evolution which take into account fuel properties, meteorological conditions, and topography. As a CA model, it offers the possibility to run a very high number of simulations in order to verify and apply the model, and is easily modified by implementing additional variables and different rules for the
Energy Technology Data Exchange (ETDEWEB)
Tsutahara, M; Tomiyama, A; Kimura, T; Murata, H [Kobe University, Kobe (Japan). Faculty of Engineering
1993-08-25
In order to analyze the field of flow containing a moving boundary by the method of cellular automaton, the method of giving the boundary conditions in the case where a wall is moving at a constant velocity in the normal direction was examined. This method is used to simulate the movement of continuous fluid by statistically treating the movement of many discrete particles which repeat translation and collision. The collision law of particles at grid points is formulated so as to conserve mass(number of particles) and momentum for the purpose of satisfying the governing equation of flow. The object is the flow in the case where a flat plate moves in the normal direction inside the fluid enclosed by rectangular walls and the plate was assumed that it is first in a standing condition, then starts to move from left to right at a speed of V and stops in front of the right wall. Three boundary conditions, surrounding wall, plate in the standing condition and moving plate, were considered. Flow rates were calculated concerning the translation and collision and each divided mean-field-approximation region(space having a magnitude of capable of averaging operation of particles). Effectiveness of proposed boundary conditions was confirmed by a visualization experiment. 3 refs., 14 figs.
Energy Technology Data Exchange (ETDEWEB)
Seck Tuoh Mora, J. C. [Instituto Politecnico Nacional, Mexico, D. F. (Mexico)
2001-06-01
We present a review of reversible one dimensional cellular automata and their representation by block permutations. We analyze in detail the behavior of such block permutations to get their characterization. [Spanish] En el siguiente escrito se da una revision a la representacion y comportamiento de automatas celulares unidimensionales reversibles por medio de permutaciones en bloque. Hacemos un analisis detallado del comportamiento de dichas permutaciones para obtener su caracterizacion.
Investigation of phase diagrams for cylindrical Ising nanotube using cellular automata
Astaraki, M.; Ghaemi, M.; Afzali, K.
2018-05-01
Recent developments in the field of applied nanoscience and nanotechnology have heightened the need for categorizing various characteristics of nanostructures. In this regard, this paper establishes a novel method to investigate magnetic properties (phase diagram and spontaneous magnetization) of a cylindrical Ising nanotube. Using a two-layer Ising model and the core-shell concept, the interactions within nanotube has been modelled. In the model, both ferromagnetic and antiferromagnetic cases have been considered. Furthermore, the effect of nanotube's length on the critical temperature is investigated. The model has been simulated using cellular automata approach and phase diagrams were constructed for different values of inter- and intra-layer couplings. For the antiferromagnetic case, the possibility of existence of compensation point is observed.
A cellular automata intraurban model with prices and income-differentiated actors
Furtado, B.A.; Ettema, D.F.; Ruiz, R.M.; Hurkens, J.; Delden, H. van
2012-01-01
This paper presents an intraurban cellular automata model that is an extension to White and Engelen’s pioneering model. The paper’s main contribution is to distinguish between agglomerative eff ects, determined by the attraction of the neighbourhood, and disagglomerative eff ects, driven by land
Simulating Urban Growth Using a Random Forest-Cellular Automata (RF-CA Model
Directory of Open Access Journals (Sweden)
Courage Kamusoko
2015-04-01
Full Text Available Sustainable urban planning and management require reliable land change models, which can be used to improve decision making. The objective of this study was to test a random forest-cellular automata (RF-CA model, which combines random forest (RF and cellular automata (CA models. The Kappa simulation (KSimulation, figure of merit, and components of agreement and disagreement statistics were used to validate the RF-CA model. Furthermore, the RF-CA model was compared with support vector machine cellular automata (SVM-CA and logistic regression cellular automata (LR-CA models. Results show that the RF-CA model outperformed the SVM-CA and LR-CA models. The RF-CA model had a Kappa simulation (KSimulation accuracy of 0.51 (with a figure of merit statistic of 47%, while SVM-CA and LR-CA models had a KSimulation accuracy of 0.39 and −0.22 (with figure of merit statistics of 39% and 6%, respectively. Generally, the RF-CA model was relatively accurate at allocating “non-built-up to built-up” changes as reflected by the correct “non-built-up to built-up” components of agreement of 15%. The performance of the RF-CA model was attributed to the relatively accurate RF transition potential maps. Therefore, this study highlights the potential of the RF-CA model for simulating urban growth.
Using cellular automata for parallel simulation of laser dynamics with dynamic load balancing
Guisado, J.L.; Fernández de Vega, F.; Jiménez Morales, F.; Iskra, K.A.; Sloot, P.M.A.
2008-01-01
We present an analysis of the feasibility of executing a parallel bioinspired model of laser dynamics, based on cellular automata (CA), on the usual target platform of this kind of applications: a heterogeneous non-dedicated cluster. As this model employs a synchronous CA, using the single program,
A cellular automata approach to chemical reactions : 1 reaction controlled systems
Korte, de A.C.J.; Brouwers, H.J.H.
2013-01-01
A direct link between the chemical reaction controlled (shrinking core) model and cellular automata, to study the dissolution of particles, is derived in this paper. Previous research on first and second order reactions is based on the concentration of the reactant. The present paper describes the
Boundary Induced Phase Transition in Cellular Automata Models of Pedestrian Flow
Czech Academy of Sciences Publication Activity Database
Bukáček, M.; Hrabák, Pavel
2016-01-01
Roč. 11, č. 4 (2016), s. 327-338 ISSN 1557-5969 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Adaptive time-span * Cellular automata model * Floor-field * Pedestrian flow * Phase transition * Principle of bonds Subject RIV: BD - Theory of Information Impact factor: 0.696, year: 2016
Modeling cell adhesion and proliferation: a cellular-automata based approach.
Vivas, J; Garzón-Alvarado, D; Cerrolaza, M
Cell adhesion is a process that involves the interaction between the cell membrane and another surface, either a cell or a substrate. Unlike experimental tests, computer models can simulate processes and study the result of experiments in a shorter time and lower costs. One of the tools used to simulate biological processes is the cellular automata, which is a dynamic system that is discrete both in space and time. This work describes a computer model based on cellular automata for the adhesion process and cell proliferation to predict the behavior of a cell population in suspension and adhered to a substrate. The values of the simulated system were obtained through experimental tests on fibroblast monolayer cultures. The results allow us to estimate the cells settling time in culture as well as the adhesion and proliferation time. The change in the cells morphology as the adhesion over the contact surface progress was also observed. The formation of the initial link between cell and the substrate of the adhesion was observed after 100 min where the cell on the substrate retains its spherical morphology during the simulation. The cellular automata model developed is, however, a simplified representation of the steps in the adhesion process and the subsequent proliferation. A combined framework of experimental and computational simulation based on cellular automata was proposed to represent the fibroblast adhesion on substrates and changes in a macro-scale observed in the cell during the adhesion process. The approach showed to be simple and efficient.
A Cellular Automata-based Model for Simulating Restitution Property in a Single Heart Cell.
Sabzpoushan, Seyed Hojjat; Pourhasanzade, Fateme
2011-01-01
Ventricular fibrillation is the cause of the most sudden mortalities. Restitution is one of the specific properties of ventricular cell. The recent findings have clearly proved the correlation between the slope of restitution curve with ventricular fibrillation. This; therefore, mandates the modeling of cellular restitution to gain high importance. A cellular automaton is a powerful tool for simulating complex phenomena in a simple language. A cellular automaton is a lattice of cells where the behavior of each cell is determined by the behavior of its neighboring cells as well as the automata rule. In this paper, a simple model is depicted for the simulation of the property of restitution in a single cardiac cell using cellular automata. At first, two state variables; action potential and recovery are introduced in the automata model. In second, automata rule is determined and then recovery variable is defined in such a way so that the restitution is developed. In order to evaluate the proposed model, the generated restitution curve in our study is compared with the restitution curves from the experimental findings of valid sources. Our findings indicate that the presented model is not only capable of simulating restitution in cardiac cell, but also possesses the capability of regulating the restitution curve.
Energy dissipation dataset for reversible logic gates in quantum dot-cellular automata.
Bahar, Ali Newaz; Rahman, Mohammad Maksudur; Nahid, Nur Mohammad; Hassan, Md Kamrul
2017-02-01
This paper presents an energy dissipation dataset of different reversible logic gates in quantum-dot cellular automata. The proposed circuits have been designed and verified using QCADesigner simulator. Besides, the energy dissipation has been calculated under three different tunneling energy level at temperature T =2 K. For estimating the energy dissipation of proposed gates; QCAPro tool has been employed.
Cellular Automata Models Applied to the Study of Landslide Dynamics
Liucci, Luisa; Melelli, Laura; Suteanu, Cristian
2015-04-01
Landslides are caused by complex processes controlled by the interaction of numerous factors. Increasing efforts are being made to understand the spatial and temporal evolution of this phenomenon, and the use of remote sensing data is making significant contributions in improving forecast. This paper studies landslides seen as complex dynamic systems, in order to investigate their potential Self Organized Critical (SOC) behavior, and in particular, scale-invariant aspects of processes governing the spatial development of landslides and their temporal evolution, as well as the mechanisms involved in driving the system and keeping it in a critical state. For this purpose, we build Cellular Automata Models, which have been shown to be capable of reproducing the complexity of real world features using a small number of variables and simple rules, thus allowing for the reduction of the number of input parameters commonly used in the study of processes governing landslide evolution, such as those linked to the geomechanical properties of soils. This type of models has already been successfully applied in studying the dynamics of other natural hazards, such as earthquakes and forest fires. The basic structure of the model is composed of three modules: (i) An initialization module, which defines the topographic surface at time zero as a grid of square cells, each described by an altitude value; the surface is acquired from real Digital Elevation Models (DEMs). (ii) A transition function, which defines the rules used by the model to update the state of the system at each iteration. The rules use a stability criterion based on the slope angle and introduce a variable describing the weakening of the material over time, caused for example by rainfall. The weakening brings some sites of the system out of equilibrium thus causing the triggering of landslides, which propagate within the system through local interactions between neighboring cells. By using different rates of
Cellular automata and integrodifferential equation models for cell renewal in mosaic tissues
Bloomfield, J. M.; Sherratt, J. A.; Painter, K. J.; Landini, G.
2010-01-01
Mosaic tissues are composed of two or more genetically distinct cell types. They occur naturally, and are also a useful experimental method for exploring tissue growth and maintenance. By marking the different cell types, one can study the patterns formed by proliferation, renewal and migration. Here, we present mathematical modelling suggesting that small changes in the type of interaction that cells have with their local cellular environment can lead to very different outcomes for the composition of mosaics. In cell renewal, proliferation of each cell type may depend linearly or nonlinearly on the local proportion of cells of that type, and these two possibilities produce very different patterns. We study two variations of a cellular automaton model based on simple rules for renewal. We then propose an integrodifferential equation model, and again consider two different forms of cellular interaction. The results of the continuous and cellular automata models are qualitatively the same, and we observe that changes in local environment interaction affect the dynamics for both. Furthermore, we demonstrate that the models reproduce some of the patterns seen in actual mosaic tissues. In particular, our results suggest that the differing patterns seen in organ parenchymas may be driven purely by the process of cell replacement under different interaction scenarios. PMID:20375040
Kihara, Takanori; Kashitani, Kosuke; Miyake, Jun
2017-07-14
Cell proliferation is a key characteristic of eukaryotic cells. During cell proliferation, cells interact with each other. In this study, we developed a cellular automata model to estimate cell-cell interactions using experimentally obtained images of cultured cells. We used four types of cells; HeLa cells, human osteosarcoma (HOS) cells, rat mesenchymal stem cells (MSCs), and rat smooth muscle A7r5 cells. These cells were cultured and stained daily. The obtained cell images were binarized and clipped into squares containing about 10 4 cells. These cells showed characteristic cell proliferation patterns. The growth curves of these cells were generated from the cell proliferation images and we determined the doubling time of these cells from the growth curves. We developed a simple cellular automata system with an easily accessible graphical user interface. This system has five variable parameters, namely, initial cell number, doubling time, motility, cell-cell adhesion, and cell-cell contact inhibition (of proliferation). Within these parameters, we obtained initial cell numbers and doubling times experimentally. We set the motility at a constant value because the effect of the parameter for our simulation was restricted. Therefore, we simulated cell proliferation behavior with cell-cell adhesion and cell-cell contact inhibition as variables. By comparing growth curves and proliferation cell images, we succeeded in determining the cell-cell interaction properties of each cell. Simulated HeLa and HOS cells exhibited low cell-cell adhesion and weak cell-cell contact inhibition. Simulated MSCs exhibited high cell-cell adhesion and positive cell-cell contact inhibition. Simulated A7r5 cells exhibited low cell-cell adhesion and strong cell-cell contact inhibition. These simulated results correlated with the experimental growth curves and proliferation images. Our simulation approach is an easy method for evaluating the cell-cell interaction properties of cells.
Application of neural networks and cellular automata to calorimetric problems
Energy Technology Data Exchange (ETDEWEB)
Brenton, V; Fonvieille, H; Guicheney, C; Jousset, J; Roblin, Y; Tamin, F; Grenier, P
1994-09-01
Computing techniques based on parallel processing have been used to treat the information from the electromagnetic calorimeters in SLAC experiments E142/E143. Cluster finding and separation of overlapping showers are performed by a cellular automaton, pion and electron identification is done by using a multilayered neural network. Both applications are presented and their resulting performances are shown to be improved compared to more standard approaches. (author). 9 refs.; Submitted to Nuclear Instruments and Methods (NL).
Directory of Open Access Journals (Sweden)
Krzysztof Małecki
2017-12-01
Full Text Available A complex system is a set of mutually interacting elements for which it is possible to construct a mathematical model. This article focuses on the cellular automata theory and the graph theory in order to compare various types of cellular automata and to analyse applications of graph structures together with cellular automata. It proposes a graph cellular automaton with a variable configuration of cells and relation-based neighbourhoods (r–GCA. The developed mechanism enables modelling of phenomena found in complex systems (e.g., transport networks, urban logistics, social networks taking into account the interaction between the existing objects. As an implementation example, modelling of moving vehicles has been made and r–GCA was compared to the other cellular automata models simulating the road traffic and used in the computer simulation process.
Evolution of Cellular Automata toward a LIFE-Like Rule Guided by 1/ƒ Noise
Ninagawa, Shigeru
There is evidence in favor of a relationship between the presence of 1/ƒ noise and computational universality in cellular automata. To confirm the relationship, we search for two-dimensional cellular automata with a 1/ƒ power spectrum by means of genetic algorithms. The power spectrum is calculated from the evolution of the state of the cell, starting from a random initial configuration. The fitness is estimated by the power spectrum with consideration of the spectral similarity to the 1/ƒ spectrum. The result shows that the rule with the highest fitness over the most runs exhibits a 1/ƒ type spectrum and its transition function and behavior are quite similar to those of the Game of Life, which is known to be a computationally universal cellular automaton. These results support the relationship between the presence of 1/ƒ noise and computational universality.
The linearity of quantum mechanics from the perspective of Hamiltonian cellular automata
International Nuclear Information System (INIS)
Enrico Fermi, Università di Pisa, Largo Pontecorvo 3, I-56127 Pisa (Italy))" data-affiliation=" (Dipartimento di Fisica Enrico Fermi, Università di Pisa, Largo Pontecorvo 3, I-56127 Pisa (Italy))" >Elze, Hans-Thomas
2014-01-01
We discuss the action principle and resulting Hamiltonian equations of motion for a class of integer-valued cellular automata introduced recently [1]. Employing sampling theory, these deterministic finite-difference equations are mapped reversibly on continuum equations describing a set of bandwidth limited harmonic oscillators. They represent the Schrödinger equation. However, modifications reflecting the bandwidth limit are incorporated, i.e., the presence of a time (or length) scale. When this discreteness scale is taken to zero, the usual results are obtained. Thus, the linearity of quantum mechanics can be traced to the postulated action principle of such cellular automata and its conservation laws to discrete ones. The cellular automaton conservation laws are in one-to-one correspondence with those of the related quantum mechanical model, while admissible symmetries are not.
FPGA Implementation of one-dimensional and two-dimensional cellular automata
International Nuclear Information System (INIS)
D'Antone, I.
1999-01-01
This report describes the hardware implementation of one-dimensional and two-dimensional cellular automata (CAs). After a general introduction to the cellular automata, we consider a one-dimensional CA used to implement pseudo-random techniques in built-in self test for VLSI. Due to the increase in digital ASIC complexity, testing is becoming one of the major costs in the VLSI production. The high electronics complexity, used in particle physics experiments, demands higher reliability than in the past time. General criterions are given to evaluate the feasibility of the circuit used for testing and some quantitative parameters are underlined to optimize the architecture of the cellular automaton. Furthermore, we propose a two-dimensional CA that performs a peak finding algorithm in a matrix of cells mapping a sub-region of a calorimeter. As in a two-dimensional filtering process, the peaks of the energy clusters are found in one evolution step. This CA belongs to Wolfram class II cellular automata. Some quantitative parameters are given to optimize the architecture of the cellular automaton implemented in a commercial field programmable gate array (FPGA)
Car Deceleration Considering Its Own Velocity in Cellular Automata Model
International Nuclear Information System (INIS)
Li Keping
2006-01-01
In this paper, we propose a new cellular automaton model, which is based on NaSch traffic model. In our method, when a car has a larger velocity, if the gap between the car and its leading car is not enough large, it will decrease. The aim is that the following car has a buffer space to decrease its velocity at the next time, and then avoid to decelerate too high. The simulation results show that using our model, the car deceleration is realistic, and is closer to the field measure than that of NaSch model.
Kavianpour, Hamidreza; Vasighi, Mahdi
2017-02-01
Nowadays, having knowledge about cellular attributes of proteins has an important role in pharmacy, medical science and molecular biology. These attributes are closely correlated with the function and three-dimensional structure of proteins. Knowledge of protein structural class is used by various methods for better understanding the protein functionality and folding patterns. Computational methods and intelligence systems can have an important role in performing structural classification of proteins. Most of protein sequences are saved in databanks as characters and strings and a numerical representation is essential for applying machine learning methods. In this work, a binary representation of protein sequences is introduced based on reduced amino acids alphabets according to surrounding hydrophobicity index. Many important features which are hidden in these long binary sequences can be clearly displayed through their cellular automata images. The extracted features from these images are used to build a classification model by support vector machine. Comparing to previous studies on the several benchmark datasets, the promising classification rates obtained by tenfold cross-validation imply that the current approach can help in revealing some inherent features deeply hidden in protein sequences and improve the quality of predicting protein structural class.
A Local Land Use Competition Cellular Automata Model and Its Application
Directory of Open Access Journals (Sweden)
Jun Yang
2016-06-01
Full Text Available Cellular automaton (CA is an important method in land use and cover change studies, however, the majority of research focuses on the discovery of macroscopic factors affecting LUCC, which results in ignoring the local effects within the neighborhoods. This paper introduces a Local Land Use Competition Cellular Automata (LLUC-CA model, based on local land use competition, land suitability evaluation, demand analysis of the different land use types, and multi-target land use competition allocation algorithm to simulate land use change at a micro level. The model is applied to simulate land use changes at Jinshitan National Tourist Holiday Resort from 1988 to 2012. The results show that the simulation accuracies were 64.46%, 77.21%, 85.30% and 99.14% for the agricultural land, construction land, forestland and water, respectively. In addition, comparing the simulation results of the LLUC-CA and CA-Markov model with the real land use data, their overall spatial accuracies were found to be 88.74% and 86.82%, respectively. In conclusion, the results from this study indicated that the model was an acceptable method for the simulation of large-scale land use changes, and the approach used here is applicable to analyzing the land use change driven forces and assist in decision-making.
International Nuclear Information System (INIS)
Akishina, E.P.; Kostenko, B.F.; Ivanov, V.V.
2003-01-01
A new method of research in spatial structures that result from uranium dioxide burning in nuclear reactors of modern atomic plants is suggested. The method is based on the presentation of images of the mentioned structures in the form of the working field of a cellular automaton (CA). First, it has allowed one to extract some important quantitative characteristics of the structures directly from the micrographs of the uranium fuel surface. Secondly, the CA has been found out to allow one to formulate easily the dynamics of the evolution of the studied structures in terms of such micrograph elements as spots, spots' boundaries, cracks, etc. Relation has been found between the dynamics and some exactly solvable models of the theory of cellular automata, in particular, the Ising model and the vote model. This investigation gives a detailed description of some CA algorithms which allow one to perform the fuel surface image processing and to model its evolution caused by burnup or chemical etching. (author)
Mohammad Sayemuzzaman; Manoj K. Jha
2014-01-01
State wide variant topographic features in North Carolina attract the hydro-climatologist. There is none modeling study found that predict future Land Cover Land Use (LCLU) change for whole North Carolina. In this study, satellite-derived land cover maps of year 1992, 2001 and 2006 of North Carolina were integrated within the framework of the Markov-Cellular Automata (Markov-CA) model which combines the Markov chain and Cellular Automata (CA) techniques. A Multi-Criteria Evaluation (MCE) was ...
Glider-based computing in reaction-diffusion hexagonal cellular automata
International Nuclear Information System (INIS)
Adamatzky, Andrew; Wuensche, Andrew; De Lacy Costello, Benjamin
2006-01-01
A three-state hexagonal cellular automaton, discovered in [Wuensche A. Glider dynamics in 3-value hexagonal cellular automata: the beehive rule. Int J Unconvention Comput, in press], presents a conceptual discrete model of a reaction-diffusion system with inhibitor and activator reagents. The automaton model of reaction-diffusion exhibits mobile localized patterns (gliders) in its space-time dynamics. We show how to implement the basic computational operations with these mobile localizations, and thus demonstrate collision-based logical universality of the hexagonal reaction-diffusion cellular automaton
Naqvi, Syed Rameez; Akram, Tallha; Iqbal, Saba; Haider, Sajjad Ali; Kamran, Muhammad; Muhammad, Nazeer
2018-02-01
Considering the lack of optimization support for Quantum-dot Cellular Automata, we propose a dynamically reconfigurable logic cell capable of implementing various logic operations by means of artificial neural networks. The cell can be reconfigured to any 2-input combinational logic gate by altering the strength of connections, called weights and biases. We demonstrate how these cells may appositely be organized to perform multi-bit arithmetic and logic operations. The proposed work is important in that it gives a standard implementation of an 8-bit arithmetic and logic unit for quantum-dot cellular automata with minimal area and latency overhead. We also compare the proposed design with a few existing arithmetic and logic units, and show that it is more area efficient than any equivalent available in literature. Furthermore, the design is adaptable to 16, 32, and 64 bit architectures.
Opinion evolution based on cellular automata rules in small world networks
Shi, Xiao-Ming; Shi, Lun; Zhang, Jie-Fang
2010-03-01
In this paper, we apply cellular automata rules, which can be given by a truth table, to human memory. We design each memory as a tracking survey mode that keeps the most recent three opinions. Each cellular automata rule, as a personal mechanism, gives the final ruling in one time period based on the data stored in one's memory. The key focus of the paper is to research the evolution of people's attitudes to the same question. Based on a great deal of empirical observations from computer simulations, all the rules can be classified into 20 groups. We highlight the fact that the phenomenon shown by some rules belonging to the same group will be altered within several steps by other rules in different groups. It is truly amazing that, compared with the last hundreds of presidential voting in America, the eras of important events in America's history coincide with the simulation results obtained by our model.
Solving the Ternary Quantum-Dot Cellular Automata Logic Gate Problem by Means of Adiabatic Switching
Pecar, Primoz; Mraz, Miha; Zimic, Nikolaj; Janez, Miha; Lebar Bajec, Iztok
2008-06-01
Quantum-dot cellular automata (QCA) are one of the most promising alternative platforms of the future. Recent years have witnessed the development of basic logic structures as well as more complex processing structures, however most in the realm of binary logic. On the grounds that future platforms should not disregard the advantages of multi-valued logic, Lebar Bajec et al. were the first to show that quantum-dot cellular automata can be used for the implementation of ternary logic as well. In their study the ternary AND and OR logic functions proved to be the most troublesome primitive to implement. This research presents a revised solution that is based on adiabatic switching.
Uniform and localized corrosion modelling by means of probabilistic cellular automata
International Nuclear Information System (INIS)
Perez-Brokate, Cristian
2016-01-01
Numerical modelling is complementary tool for corrosion prediction. The objective of this work is to develop a corrosion model by means of a probabilistic cellular automata approach at a mesoscopic scale. In this work, we study the morphological evolution and kinetics of corrosion. This model couples electrochemical oxidation and reduction reactions. Regarding kinetics, cellular automata models are able to describe current as a function of the applied potential for a redox reaction on an inert electrode. The inclusion of probabilities allows the description of the stochastic nature of anodic and cathodic reactions. Corrosion morphology has been studied in different context: generalised corrosion, pitting corrosion and corrosion in an occluded environment. a general tendency of two regimes is found. a first regime of uniform corrosion where the anodic and cathodic reactions occur homogeneously over the surface. a second regime of localized corrosion when there is a spatial separation of anodic and cathodic zones, with an increase of anodic reaction rate. (author) [fr
Coulomb coupling and the role of symmetries in quantum-dot arrays for cellular automata
International Nuclear Information System (INIS)
Ramirez, F.; Cota, E.; Ulloa, S. E.
2000-01-01
Using a group-theoretical analysis of the symmetries of a quantum dot array, we investigate the role of defects on the energetics of the system and the resulting charge configurations (or polarization of the cell). We find that for the typical four- or five-element geometries proposed, even small asymmetries introduced by defects in the system, or variations in the local electrostatic environment, can give rise to large effects on the polarization of the ground state and the corresponding low-energy excitations. These shifts are likely to produce important effects in the operation of the cellular automata proposed using these quantum dots. In particular, we find that the sensitivity to polarization changes induced by a driver cell decreases dramatically, and the polarization values are no longer fully defined. These effects would both force the use of stronger driving fields, and may also complicate the dynamical behavior of the cellular automata. (c) 2000 The American Physical Society
Directory of Open Access Journals (Sweden)
Xiaomeng Li
2012-01-01
Full Text Available The operational efficiency and safety of pedestrian flows at intersections is an important aspect of urban traffic. Particularly, conflicts between pedestrians and vehicles in crosswalk are one of the most influential factors for intersection safety. This paper presents a cellular automata model that simulates pedestrian and vehicle crossing behaviors at signalized intersections. Through the simulation, we investigate the effects of different pedestrian signal timing and crosswalk widths on the crosswalk capacity, the number of traffic conflicts between pedestrians and vehicles, and pedestrian delay due to the conflicts. The simulation results indicate that the cellular automata is an effective simulation platform for investigating complex pedestrian-related traffic phenomenon at signalized intersections.
Three-dimensional cellular automata as a model of a seismic fault
International Nuclear Information System (INIS)
Gálvez, G; Muñoz, A
2017-01-01
The Earth's crust is broken into a series of plates, whose borders are the seismic fault lines and it is where most of the earthquakes occur. This plating system can in principle be described by a set of nonlinear coupled equations describing the motion of the plates, its stresses, strains and other characteristics. Such a system of equations is very difficult to solve, and nonlinear parts leads to a chaotic behavior, which is not predictable. In 1989, Bak and Tang presented an earthquake model based on the sand pile cellular automata. The model though simple, provides similar results to those observed in actual earthquakes. In this work the cellular automata in three dimensions is proposed as a best model to approximate a seismic fault. It is noted that the three-dimensional model reproduces similar properties to those observed in real seismicity, especially, the Gutenberg-Richter law. (paper)
Design of Improved Arithmetic Logic Unit in Quantum-Dot Cellular Automata
Heikalabad, Saeed Rasouli; Gadim, Mahya Rahimpour
2018-06-01
The quantum-dot cellular automata (QCA) can be replaced to overcome the limitation of CMOS technology. An arithmetic logic unit (ALU) is a basic structure of any computer devices. In this paper, design of improved single-bit arithmetic logic unit in quantum dot cellular automata is presented. The proposed structure for ALU has AND, OR, XOR and ADD operations. A unique 2:1 multiplexer, an ultra-efficient two-input XOR and a low complexity full adder are used in the proposed structure. Also, an extended design of this structure is provided for two-bit ALU in this paper. The proposed structure of ALU is simulated by QCADesigner and simulation result is evaluated. Evaluation results show that the proposed design has best performance in terms of area, complexity and delay compared to the previous designs.
Simulations of fluid flow through porous media based on cellular automata and non-linear dynamics
Energy Technology Data Exchange (ETDEWEB)
Paulson, K V
1992-05-15
A study is being carried out to apply cellular automata and non-linear dynamics in the construction of efficient and accurate computer simulations of multiphase fluid flow through porous media, with the objective of application to reservoir modelling for hydrocarbon recovery. An algorithm based on Boolean operations has been developed which transforms a PC clone into a highly efficient vector processor capable of cellular automata simulation of single fluid flow through two-dimensional rock matrix models of varying porosities. Macroscopic flow patterns have been established through spatial and temporal averaging with no floating point operations. Permeabilities of the different models have been calculated. Hardware allows the algorithm to function on dual processors on a PC platform using a video recording and editing facility. Very encouraging results have been obtained. 4 figs.
New efficient five-input majority gate for quantum-dot cellular automata
International Nuclear Information System (INIS)
Farazkish, Razieh; Navi, Keivan
2012-01-01
A novel fault-tolerant five-input majority gate for quantum-dot cellular automata is presented. Quantum-dot cellular automata (QCA) is an emerging technology which is considered to be presented in future computers. Two principle logic elements in QCA are “majority gate” and “inverter.” In this paper, we propose a new approach to the design of fault-tolerant five-input majority gate by considering two-dimensional arrays of QCA cells. We analyze fault tolerance properties of such block five-input majority gate in terms of misalignment, missing, and dislocation cells. Some physical proofs are used for verifying five-input majority gate circuit layout and functionality. Our results clearly demonstrate that the redundant version of the block five-input majority gate is more robust than the standard style for this gate.
Stair evacuation simulation based on cellular automata considering evacuees’ walk preferences
International Nuclear Information System (INIS)
Ding Ning; Luh, Peter B.; Zhang Hui; Chen Tao
2015-01-01
As a physical model, the cellular automata (CA) model is widely used in many areas, such as stair evacuation. However, existing CA models do not consider evacuees’ walk preferences nor psychological status, and the structure of the basic model is unapplicable for the stair structure. This paper is to improve the stair evacuation simulation by addressing these issues, and a new cellular automata model is established. Several evacuees’ walk preference and how evacuee’s psychology influences their behaviors are introduced into this model. Evacuees’ speeds will be influenced by these features. To validate this simulation, two fire drills held in two high-rise buildings are video-recorded. It is found that the simulation results are similar to the fire drill results. The structure of this model is simple, and it is easy to further develop and utilize in different buildings with various kinds of occupants. (paper)
Parallel Genetic Algorithms for calibrating Cellular Automata models: Application to lava flows
International Nuclear Information System (INIS)
D'Ambrosio, D.; Spataro, W.; Di Gregorio, S.; Calabria Univ., Cosenza; Crisci, G.M.; Rongo, R.; Calabria Univ., Cosenza
2005-01-01
Cellular Automata are highly nonlinear dynamical systems which are suitable far simulating natural phenomena whose behaviour may be specified in terms of local interactions. The Cellular Automata model SCIARA, developed far the simulation of lava flows, demonstrated to be able to reproduce the behaviour of Etnean events. However, in order to apply the model far the prediction of future scenarios, a thorough calibrating phase is required. This work presents the application of Genetic Algorithms, general-purpose search algorithms inspired to natural selection and genetics, far the parameters optimisation of the model SCIARA. Difficulties due to the elevated computational time suggested the adoption a Master-Slave Parallel Genetic Algorithm far the calibration of the model with respect to the 2001 Mt. Etna eruption. Results demonstrated the usefulness of the approach, both in terms of computing time and quality of performed simulations
Simulation of a plane wavefront propagating in cardiac tissue using a cellular automata model
International Nuclear Information System (INIS)
Barbosa, Carlos R Hall
2003-01-01
We present a detailed description of a cellular automata model for the propagation of action potential in a planar cardiac tissue, which is very fast and easy to use. The model incorporates anisotropy in the electrical conductivity and a spatial variation of the refractory time. The transmembrane potential distribution is directly derived from the cell states, and the intracellular and extracellular potential distributions are calculated for the particular case of a plane wavefront. Once the potential distributions are known, the associated current densities are calculated by Ohm's law, and the magnetic field is determined at a plane parallel to the cardiac tissue by applying the law of Biot and Savart. The results obtained for propagation speed and for magnetic field amplitude with the cellular automata model are compared with values predicted by the bidomain formulation, for various angles between wavefront propagation and fibre direction, characterizing excellent agreement between the models
A cellular automata model of traffic flow with variable probability of randomization
International Nuclear Information System (INIS)
Zheng Wei-Fan; Zhang Ji-Ye
2015-01-01
Research on the stochastic behavior of traffic flow is important to understand the intrinsic evolution rules of a traffic system. By introducing an interactional potential of vehicles into the randomization step, an improved cellular automata traffic flow model with variable probability of randomization is proposed in this paper. In the proposed model, the driver is affected by the interactional potential of vehicles before him, and his decision-making process is related to the interactional potential. Compared with the traditional cellular automata model, the modeling is more suitable for the driver’s random decision-making process based on the vehicle and traffic situations in front of him in actual traffic. From the improved model, the fundamental diagram (flow–density relationship) is obtained, and the detailed high-density traffic phenomenon is reproduced through numerical simulation. (paper)
Cellular automata models for diffusion of information and highway traffic flow
Fuks, Henryk
In the first part of this work we study a family of deterministic models for highway traffic flow which generalize cellular automaton rule 184. This family is parameterized by the speed limit m and another parameter k that represents degree of 'anticipatory driving'. We compare two driving strategies with identical maximum throughput: 'conservative' driving with high speed limit and 'anticipatory' driving with low speed limit. Those two strategies are evaluated in terms of accident probability. We also discuss fundamental diagrams of generalized traffic rules and examine limitations of maximum achievable throughput. Possible modifications of the model are considered. For rule 184, we present exact calculations of the order parameter in a transition from the moving phase to the jammed phase using the method of preimage counting, and use this result to construct a solution to the density classification problem. In the second part we propose a probabilistic cellular automaton model for the spread of innovations, rumors, news, etc., in a social system. We start from simple deterministic models, for which exact expressions for the density of adopters are derived. For a more realistic model, based on probabilistic cellular automata, we study the influence of a range of interaction R on the shape of the adoption curve. When the probability of adoption is proportional to the local density of adopters, and individuals can drop the innovation with some probability p, the system exhibits a second order phase transition. Critical line separating regions of parameter space in which asymptotic density of adopters is positive from the region where it is equal to zero converges toward the mean-field line when the range of the interaction increases. In a region between R=1 critical line and the mean-field line asymptotic density of adopters depends on R, becoming zero if R is too small (smaller than some critical value). This result demonstrates the importance of connectivity in
Energy dissipation dataset for reversible logic gates in quantum dot-cellular automata
Directory of Open Access Journals (Sweden)
Ali Newaz Bahar
2017-02-01
Full Text Available This paper presents an energy dissipation dataset of different reversible logic gates in quantum-dot cellular automata. The proposed circuits have been designed and verified using QCADesigner simulator. Besides, the energy dissipation has been calculated under three different tunneling energy level at temperature T=2 K. For estimating the energy dissipation of proposed gates; QCAPro tool has been employed.
a Predator-Prey Model Based on the Fully Parallel Cellular Automata
He, Mingfeng; Ruan, Hongbo; Yu, Changliang
We presented a predator-prey lattice model containing moveable wolves and sheep, which are characterized by Penna double bit strings. Sexual reproduction and child-care strategies are considered. To implement this model in an efficient way, we build a fully parallel Cellular Automata based on a new definition of the neighborhood. We show the roles played by the initial densities of the populations, the mutation rate and the linear size of the lattice in the evolution of this model.
Quasi-adiabatic Switching for Metal-Island Quantum-dot Cellular Automata
Toth, Geza; Lent, Craig S.
2000-01-01
Recent experiments have demonstrated a working cell suitable for implementing the Quantum-dot Cellular Automata (QCA) paradigm. These experiments have been performed using metal island clusters. The most promising approach to QCA operation involves quasi-adiabatically switching the cells. This has been analyzed extensively in gated semiconductor cells. Here we present a metal island cell structure that makes quasi-adiabatic switching possible. We show how this permits quasi-adiabatic clocking...
Prisoner's Dilemma in One-Dimensional Cellular Automata: Visualization of Evolutionary Patterns
Pereira, Marcelo Alves; Martinez, Alexandre Souto; Espindola, Aquino Lauri
2007-01-01
The spatial Prisoner's Dilemma is a prototype model to show the emergence of cooperation in very competitive environments. It considers players, at site of lattices, that can either cooperate or defect when playing the Prisoner's Dilemma with other z players. This model presents a rich phase diagram. Here we consider players in cells of one-dimensional cellular automata. Each player interacts with other z players. This geometry allows us to vary, in a simple manner, the number of neighbors ra...
Some Properties of topological pressure on cellular automata
Directory of Open Access Journals (Sweden)
Chih-Hung Chang
2014-09-01
Full Text Available This paper investigates the ergodicity and the power rule of the topological pressure of a cellular automaton. If a cellular automaton is either leftmost or rightmost premutive (due to the terminology given by Hedlund [Math.~Syst.~Theor.~3, 320-375, 1969], then it is ergodic with respect to the uniform Bernoulli measure. More than that, the relation of topological pressure between the original cellular automaton and its power rule is expressed in a closed form. As an application, the topological pressure of a linear cellular automaton can be computed explicitly.
An energy and cost efficient majority-based RAM cell in quantum-dot cellular automata
Directory of Open Access Journals (Sweden)
Milad Bagherian Khosroshahy
Full Text Available Nanotechnologies, notably quantum-dot cellular automata, have achieved major attentions for their prominent features as compared to the conventional CMOS circuitry. Quantum-dot cellular automata, particularly owning to its considerable reduction in size, high switching speed and ultra-low energy consumption, is considered as a potential alternative for the CMOS technology. As the memory unit is one of the most essential components in a digital system, designing a well-optimized QCA random access memory (RAM cell is an important area of research. In this paper, a new five-input majority gate is presented which is suitable for implementing efficient single-layer QCA circuits. In addition, a new RAM cell with set and reset capabilities is designed based on the proposed majority gate, which has an efficient and low-energy structure. The functionality, performance and energy consumption of the proposed designs are evaluated based on the QCADesigner and QCAPro tools. According to the simulation results, the proposed RAM design leads to on average 38% lower total energy dissipation, 25% smaller area, 20% lower cell count, 28% lower delay and 60% lower QCA cost as compared to its previous counterparts. Keywords: Quantum-dot cellular automata (QCA, Majority gate, Random access memory (RAM, Energy efficiency
On the derivation of approximations to cellular automata models and the assumption of independence.
Davies, K J; Green, J E F; Bean, N G; Binder, B J; Ross, J V
2014-07-01
Cellular automata are discrete agent-based models, generally used in cell-based applications. There is much interest in obtaining continuum models that describe the mean behaviour of the agents in these models. Previously, continuum models have been derived for agents undergoing motility and proliferation processes, however, these models only hold under restricted conditions. In order to narrow down the reason for these restrictions, we explore three possible sources of error in deriving the model. These sources are the choice of limiting arguments, the use of a discrete-time model as opposed to a continuous-time model and the assumption of independence between the state of sites. We present a rigorous analysis in order to gain a greater understanding of the significance of these three issues. By finding a limiting regime that accurately approximates the conservation equation for the cellular automata, we are able to conclude that the inaccuracy between our approximation and the cellular automata is completely based on the assumption of independence. Copyright © 2014 Elsevier Inc. All rights reserved.
Vaca-González, J J; Gutiérrez, M L; Guevara, J M; Garzón-Alvarado, D A
2017-01-01
Articular cartilage is characterized by low cell density of only one cell type, chondrocytes, and has limited self-healing properties. When articular cartilage is affected by traumatic injuries, a therapeutic strategy such as autologous chondrocyte implantation is usually proposed for its treatment. This approach requires in vitro chondrocyte expansion to yield high cell number for cell transplantation. To improve the efficiency of this procedure, it is necessary to assess cell dynamics such as migration, proliferation and cell death during culture. Computational models such as cellular automata can be used to simulate cell dynamics in order to enhance the result of cell culture procedures. This methodology has been implemented for several cell types; however, an experimental validation is required for each one. For this reason, in this research a cellular automata model, based on random-walk theory, was devised in order to predict articular chondrocyte behavior in monolayer culture during cell expansion. Results demonstrated that the cellular automata model corresponded to cell dynamics and computed-accurate quantitative results. Moreover, it was possible to observe that cell dynamics depend on weighted probabilities derived from experimental data and cell behavior varies according to the cell culture period. Thus, depending on whether cells were just seeded or proliferated exponentially, culture time probabilities differed in percentages in the CA model. Furthermore, in the experimental assessment a decreased chondrocyte proliferation was observed along with increased passage number. This approach is expected to having other uses as in enhancing articular cartilage therapies based on tissue engineering and regenerative medicine.
Effects of Initial Symmetry on the Global Symmetry of One-Dimensional Legal Cellular Automata
Directory of Open Access Journals (Sweden)
Ikuko Tanaka
2015-09-01
Full Text Available To examine the development of pattern formation from the viewpoint of symmetry, we applied a two-dimensional discrete Walsh analysis to a one-dimensional cellular automata model under two types of regular initial conditions. The amount of symmetropy of cellular automata (CA models under regular and random initial conditions corresponds to three Wolfram’s classes of CAs, identified as Classes II, III, and IV. Regular initial conditions occur in two groups. One group that makes a broken, regular pattern formation has four types of symmetry, whereas the other group that makes a higher hierarchy pattern formation has only two types. Additionally, both final pattern formations show an increased amount of symmetropy as time passes. Moreover, the final pattern formations are affected by iterations of base rules of CA models of chaos dynamical systems. The growth design formations limit possibilities: the ratio of developing final pattern formations under a regular initial condition decreases in the order of Classes III, II, and IV. This might be related to the difference in degree in reference to surrounding conditions. These findings suggest that calculations of symmetries of the structures of one-dimensional cellular automata models are useful for revealing rules of pattern generation for animal bodies.
Synchronization, TIGoRS, and Information Flow in Complex Systems: Dispositional Cellular Automata.
Sulis, William H
2016-04-01
Synchronization has a long history in physics where it refers to the phase matching of two identical oscillators. This notion has been extensively studied in physics as well as in biology, where it has been applied to such widely varying phenomena as the flashing of fireflies and firing of neurons in the brain. Human behavior, however, may be recurrent but it is not oscillatory even though many physiological systems do exhibit oscillatory tendencies. Moreover, much of human behaviour is collaborative and cooperative, where the individual behaviours may be distinct yet contemporaneous (if not simultaneous) and taken collectively express some functionality. In the context of behaviour, the important aspect is the repeated co-occurrence in time of behaviours that facilitate the propagation of information or of functionality, regardless of whether or not these behaviours are similar or identical. An example of this weaker notion of synchronization is transient induced global response synchronization (TIGoRS). Previous work has shown that TIGoRS is a ubiquitous phenomenon among complex systems, enabling them to stably parse environmental transients into salient units to which they stably respond. This leads to the notion of Sulis machines, which emergently generate a primitive linguistic structure through their dynamics. This article reviews the notion of TIGoRS and its expression in several complex systems models including tempered neural networks, driven cellular automata and cocktail party automata. The emergent linguistics of Sulis machines are discussed. A new class of complex systems model, the dispositional cellular automaton is introduced. A new metric for TIGoRS, the excess synchronization, is introduced and applied to the study of TIGoRS in dispositional cellular automata. It is shown that these automata exhibit a nonlinear synchronization response to certain perturbing transients.
López, Leonardo; Burguerner, Germán; Giovanini, Leonardo
2014-04-12
The spread of an infectious disease is determined by biological and social factors. Models based on cellular automata are adequate to describe such natural systems consisting of a massive collection of simple interacting objects. They characterize the time evolution of the global system as the emergent behaviour resulting from the interaction of the objects, whose behaviour is defined through a set of simple rules that encode the individual behaviour and the transmission dynamic. An epidemic is characterized trough an individual-based-model built upon cellular automata. In the proposed model, each individual of the population is represented by a cell of the automata. This way of modeling an epidemic situation allows to individually define the characteristic of each individual, establish different scenarios and implement control strategies. A cellular automata model to study the time evolution of a heterogeneous populations through the various stages of disease was proposed, allowing the inclusion of individual heterogeneity, geographical characteristics and social factors that determine the dynamic of the desease. Different assumptions made to built the classical model were evaluated, leading to following results: i) for low contact rate (like in quarantine process or low density population areas) the number of infective individuals is lower than other areas where the contact rate is higher, and ii) for different initial spacial distributions of infected individuals different epidemic dynamics are obtained due to its influence on the transition rate and the reproductive ratio of disease. The contact rate and spatial distributions have a central role in the spread of a disease. For low density populations the spread is very low and the number of infected individuals is lower than in highly populated areas. The spacial distribution of the population and the disease focus as well as the geographical characteristic of the area play a central role in the dynamics of the
Iovine, G.; D'Ambrosio, D.
2003-04-01
Cellular Automata models do represent a valid method for the simulation of complex phenomena, when these latter can be described in "a-centric" terms - i.e. through local interactions within a discrete time-space. In particular, flow-type landslides (such as debris flows) can be viewed as a-centric dynamical system. SCIDDICA S4b, the last release of a family of two-dimensional hexagonal Cellular Automata models, has recently been developed for simulating debris flows characterised by strong inertial effects. It has been derived by progressively enriching an initial simplified CA model, originally derived for simulating very simple cases of slow-moving flow-type landslides. In S4b, by applying an empirical strategy, the inertial characters of the flowing mass have been translated into CA terms. In the transition function of the model, the distribution of landslide debris among the cells is computed by considering the momentum of the debris which move among the cells of the neighbourhood, and privileging the flow direction. By properly setting the value of one of the global parameters of the model (the "inertial factor"), the mechanism of distribution of the landslide debris among the cells can be influenced in order to emphasise the inertial effects, according to the energy of the flowing mass. Moreover, the high complexity of both the model and of the phenomena to be simulated (e.g. debris flows characterised by severe erosion along their path, and by strong inertial effects) suggested to employ an automated technique of evaluation, for the determination of the best set of global parameters. Accordingly, the calibration of the model has been performed through Genetic Algorithms, by considering several real cases of study: these latter have been selected among the population of landslides triggered in Campania (Southern Italy) in May 1998 and December 1999. Obtained results are satisfying: errors computed by comparing the simulations with the map of the real
Molecular device computer: point of departure for large scale cellular automata
Energy Technology Data Exchange (ETDEWEB)
Carter, F L
1984-01-01
Switching is possible at the molecular size level because of the conformational changes that occur. Three of the most promising switching mechanisms include electron tunnelling in short periodic arrays, soliton switching and soliton valving. Assuming a 3-d architecture and molecular dimensions, memory and switching elements with densities of 10/sup 15/ to 10 /sup 18/ elements per cc are possible. The active elements are connected together conceptionally with molecular wires like polysulfur nitride (sn)/sub x/ and polyacetylene (ch)/sub x/. Simple cellular automata involving soliton propagation in conjugated systems would include soliton valves and cyclic configurations of valves. In the latter, soliton propagation becomes isomorphous with group operations giving rise to possible non-binary finite-state machines. The development of a molecular electron device (MED) synthetic capability in combination with the above devices would suggest that large 3-d arrays of parallel processors will be possible with automata, biological, and crystallographic implications. 41 references.
Directory of Open Access Journals (Sweden)
Xian-sheng Li
2013-01-01
Full Text Available With the rapid development of urban transport and the sharp increase in vehicle population, traffic accidents form one of the most important causes of urban traffic congestion other than the imbalance between traffic supply and demand. Traffic congestion causes severe problems, such as environment contamination and energy dissipation. Therefore, it would be useful to analyze the congestion propagation characteristics after traffic accidents. Numerical analysis and computer simulation were two of the typical methods used at present to study the traffic congestion propagation properties. The latter was more widespread as it is more consistent with the actual traffic flow and more visual than the former. In this paper, an improved cellular automata (CA model was presented to analyze traffic congestion propagation properties and to evaluate control strategies. In order to apply them to urban traffic flow simulation, the CA models have been improved and expanded on. Computer simulations were built for congestion not only extending to the upstream intersection, but also the upstream intersection and the entire road network, respectively. Congestion propagation characteristics after road traffic accidents were obtained, and controls of different severities and durations were analyzed. The results provide the theoretical foundation and practical means for the control of congestion.
Jahanishakib, Fatemeh; Mirkarimi, Seyed Hamed; Salmanmahiny, Abdolrassoul; Poodat, Fatemeh
2018-05-08
Efficient land use management requires awareness of past changes, present actions, and plans for future developments. Part of these requirements is achieved using scenarios that describe a future situation and the course of changes. This research aims to link scenario results with spatially explicit and quantitative forecasting of land use development. To develop land use scenarios, SMIC PROB-EXPERT and MORPHOL methods were used. It revealed eight scenarios as the most probable. To apply the scenarios, we considered population growth rate and used a cellular automata-Markov chain (CA-MC) model to implement the quantified changes described by each scenario. For each scenario, a set of landscape metrics was used to assess the ecological integrity of land use classes in terms of fragmentation and structural connectivity. The approach enabled us to develop spatial scenarios of land use change and detect their differences for choosing the most integrated landscape pattern in terms of landscape metrics. Finally, the comparison between paired forecasted scenarios based on landscape metrics indicates that scenarios 1-1, 2-2, 3-2, and 4-1 have a more suitable integrity. The proposed methodology for developing spatial scenarios helps executive managers to create scenarios with many repetitions and customize spatial patterns in real world applications and policies.
Role of correlation in the operation of quantum-dot cellular automata
International Nuclear Information System (INIS)
Toth, Geza; Lent, Craig S.
2001-01-01
Quantum-dot cellular automata (QCA) may offer a viable alternative of traditional transistor-based technology at the nanoscale. When modeling a QCA circuit, the number of degrees of freedom necessary to describe the quantum mechanical state increases exponentially making modeling even modest size cell arrays difficult. The intercellular Hartree approximation largely reduces the number of state variables and still gives good results especially when the system remains near ground state. This suggests that a large part of the correlation degrees of freedom are not essential from the point of view of the dynamics. In certain cases, however, such as, for example, the majority gate with unequal input legs, the Hartree approximation gives qualitatively wrong results. An intermediate model is constructed between the Hartree approximation and the exact model, based on the coherence vector formalism. By including correlation effects to a desired degree, it improves the results of the Hartree method and gives the approximate dynamics of the correlation terms. It also models the majority gate correctly. Beside QCA cell arrays, our findings are valid for Ising spin chains in transverse magnetic field, and can be straightforwardly generalized for coupled two-level systems with a more complicated Hamiltonian. [copyright] 2001 American Institute of Physics
A solution to the biodiversity paradox by logical deterministic cellular automata.
Kalmykov, Lev V; Kalmykov, Vyacheslav L
2015-06-01
The paradox of biological diversity is the key problem of theoretical ecology. The paradox consists in the contradiction between the competitive exclusion principle and the observed biodiversity. The principle is important as the basis for ecological theory. On a relatively simple model we show a mechanism of indefinite coexistence of complete competitors which violates the known formulations of the competitive exclusion principle. This mechanism is based on timely recovery of limiting resources and their spatio-temporal allocation between competitors. Because of limitations of the black-box modeling there was a problem to formulate the exclusion principle correctly. Our white-box multiscale model of two-species competition is based on logical deterministic individual-based cellular automata. This approach provides an automatic deductive inference on the basis of a system of axioms, and gives a direct insight into mechanisms of the studied system. It is one of the most promising methods of artificial intelligence. We reformulate and generalize the competitive exclusion principle and explain why this formulation provides a solution of the biodiversity paradox. In addition, we propose a principle of competitive coexistence.
Electrical substation service-area estimation using Cellular Automata: An initial report
Energy Technology Data Exchange (ETDEWEB)
Fenwick, J.W.; Dowell, L.J.
1998-07-01
The service areas for electric power substations can be estimated using a Cellular Automata (CA) model. The CA model is a discrete, iterative process whereby substations acquire service area by claiming neighboring cells. The service area expands from a substation until a neighboring substation service area is met or the substation`s total capacity or other constraints are reached. The CA-model output is dependent on the rule set that defines cell interactions. The rule set is based on a hierarchy of quantitative metrics that represent real-world factors such as land use and population density. Together, the metrics determine the rate of cell acquisition and the upper bound for service area size. Assessing the CA-model accuracy requires comparisons to actual service areas. These actual service areas can be extracted from distribution maps. Quantitative assessment of the CA-model accuracy can be accomplished by a number of methods. Some are as simple as finding the percentage of cells predicted correctly, while others assess a penalty based on the distance from an incorrectly predicted cell to its correct service area. This is an initial report of a work in progress.
Application of neural networks and cellular automata to calorimetric problems
International Nuclear Information System (INIS)
Brenton, V.; Fonvieille, H.; Guicheney, C.; Jousset, J.; Roblin, Y.; Tamin, F.; Grenier, P.
1994-09-01
Computing techniques based on parallel processing have been used to treat the information from the electromagnetic calorimeters in SLAC experiments E142/E143. Cluster finding and separation of overlapping showers are performed by a cellular automaton, pion and electron identification is done by using a multilayered neural network. Both applications are presented and their resulting performances are shown to be improved compared to more standard approaches. (author)
Localizations in cellular automata with mutualistic excitation rules
International Nuclear Information System (INIS)
Adamatzky, Andrew
2009-01-01
Every cell of two-dimensional cellular automaton with eight-cell neighborhood takes three states: resting, excited and refractory, and updates excited to refractory and refractory to resting states unconditionally. A resting cell excites depending on number of excited and refractory neighbors. We made exhaustive study of spatio-temporal excitation dynamics for all rules of this type and selected several classes of rules. The classes supporting self-localizations are studied in details. We uncover basic types of mobile (gliders) and stationary localizations, and characterize their morphology and dynamics.
A cellular automata model of Ebola virus dynamics
Burkhead, Emily; Hawkins, Jane
2015-11-01
We construct a stochastic cellular automaton (SCA) model for the spread of the Ebola virus (EBOV). We make substantial modifications to an existing SCA model used for HIV, introduced by others and studied by the authors. We give a rigorous analysis of the similarities between models due to the spread of virus and the typical immune response to it, and the differences which reflect the drastically different timing of the course of EBOV. We demonstrate output from the model and compare it with clinical data.
The Development of Design Tools for Fault Tolerant Quantum Dot Cellular Automata Based Logic
Armstrong, Curtis D.; Humphreys, William M.
2003-01-01
We are developing software to explore the fault tolerance of quantum dot cellular automata gate architectures in the presence of manufacturing variations and device defects. The Topology Optimization Methodology using Applied Statistics (TOMAS) framework extends the capabilities of the A Quantum Interconnected Network Array Simulator (AQUINAS) by adding front-end and back-end software and creating an environment that integrates all of these components. The front-end tools establish all simulation parameters, configure the simulation system, automate the Monte Carlo generation of simulation files, and execute the simulation of these files. The back-end tools perform automated data parsing, statistical analysis and report generation.
The Design of Fault Tolerant Quantum Dot Cellular Automata Based Logic
Armstrong, C. Duane; Humphreys, William M.; Fijany, Amir
2002-01-01
As transistor geometries are reduced, quantum effects begin to dominate device performance. At some point, transistors cease to have the properties that make them useful computational components. New computing elements must be developed in order to keep pace with Moore s Law. Quantum dot cellular automata (QCA) represent an alternative paradigm to transistor-based logic. QCA architectures that are robust to manufacturing tolerances and defects must be developed. We are developing software that allows the exploration of fault tolerant QCA gate architectures by automating the specification, simulation, analysis and documentation processes.
Six-Correction Logic (SCL Gates in Quantum-dot Cellular Automata (QCA
Directory of Open Access Journals (Sweden)
Md. Anisur Rahman
2015-11-01
Full Text Available Quantum Dot Cellular Automata (QCA is a promising nanotechnology in Quantum electronics for its ultra low power consumption, faster speed and small size features. It has significant advantages over the Complementary Metal–Oxide–Semiconductor (CMOS technology. This paper present, a novel QCA representation of Six-Correction Logic (SCL gate based on QCA logic gates: the Maj3, Maj AND gate and Maj OR. In order to design and verify the functionality of the proposed layout, QCADesigner a familiar QCA simulator has been employed. The simulation results confirm correctness of the claims and its usefulness in designing a digital circuits.
Evolutionary Cellular Automata for Image Segmentation and Noise Filtering Using Genetic Algorithms
Directory of Open Access Journals (Sweden)
Sihem SLATNIA
2011-01-01
Full Text Available We use an evolutionary process to seek a specialized set of rules among a wide range of rules to be used by Cellular Automata (CA for a range of tasks,extracting edges in a given gray or colour image, noise filtering applied to black-white image. This is the best set of local rules determine the future state of CA in an asynchronous way. The Genetic Algorithm (GA is applied to search the best CA rules that can realize the best edge detection and noise filtering.
Evolutionary Cellular Automata for Image Segmentation and Noise Filtering Using Genetic Algorithms
Directory of Open Access Journals (Sweden)
Okba Kazar
2011-01-01
Full Text Available We use an evolutionary process to seek a specialized set of rules among a wide range of rules to be used by Cellular Automata (CA for a range of tasks, extracting edges in a given gray or colour image, noise filtering applied to black-white image. This is the best set of local rules determine the future state of CA in an asynchronous way. The Genetic Algorithm (GA is applied to search the best CA rules that can realize the best edge detection and noise filtering.
A study for bank effect on ship traffic in narrow water channels using cellular automata
Sun, Zhuo; Cong, Shuang; Pan, Junnan; Zheng, Jianfeng
2017-12-01
In narrow water channels, bank might affect nearby ships due to hydrodynamic forces (bank effect). To avoid accidents, different sailing rules (i.e., lane-changing, speed control) are required. In this paper, a two-lane cellular automata model is proposed to evaluate such phenomena. Numerical experiments show that ships will form a “slow-moving chunk” in the bank area, which will significantly block the flux. As further study demonstrated to alleviate bank effect, ship speed and bank length should be controlled.
Stochastic modeling for dynamics of HIV-1 infection using cellular automata: A review.
Precharattana, Monamorn
2016-02-01
Recently, the description of immune response by discrete models has emerged to play an important role to study the problems in the area of human immunodeficiency virus type 1 (HIV-1) infection, leading to AIDS. As infection of target immune cells by HIV-1 mainly takes place in the lymphoid tissue, cellular automata (CA) models thus represent a significant step in understanding when the infected population is dispersed. Motivated by these, the studies of the dynamics of HIV-1 infection using CA in memory have been presented to recognize how CA have been developed for HIV-1 dynamics, which issues have been studied already and which issues still are objectives in future studies.
Directory of Open Access Journals (Sweden)
P. G. Klyucharev
2014-01-01
Full Text Available In the paper the author considers hardware implementation of the GRACE-H family general cellular automata based cryptographic hash functions. VHDL is used as a language and Altera FPGA as a platform for hardware implementation. Performance and effectiveness of the FPGA implementations of GRACE-H hash functions were compared with Keccak (SHA-3, SHA-256, BLAKE, Groestl, JH, Skein hash functions. According to the performed tests, performance of the hardware implementation of GRACE-H family hash functions significantly (up to 12 times exceeded performance of the hardware implementation of previously known hash functions, and effectiveness of that hardware implementation was also better (up to 4 times.
Nakajima, Kohei; Haruna, Taichi
2011-09-01
In this paper, we propose a new class of cellular automata based on the modification of its state space. It is introduced to model a computation which is exposed to an environment. We formalized the computation as extension and projection processes of its state space and resulting misidentifications of the state. This is motivated to embed the role of an environment into the system itself, which naturally induces self-organized internal perturbations rather than the usual external perturbations. Implementing this structure into the elementary cellular automata, we characterized its effect by means of input entropy and power spectral analysis. As a result, the cellular automata with this structure showed robust class IV behavior and a 1/f power spectrum in a wide range of rule space comparative to the notion of the edge of chaos. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.
Simulating Flaring Events via an Intelligent Cellular Automata Mechanism
Dimitropoulou, M.; Vlahos, L.; Isliker, H.; Georgoulis, M.
2010-07-01
We simulate flaring events through a Cellular Automaton (CA) model, in which, for the first time, we use observed vector magnetograms as initial conditions. After non-linear force free extrapolation of the magnetic field from the vector magnetograms, we identify magnetic discontinuities, using two alternative criteria: (1) the average magnetic field gradient, or (2) the normalized magnetic field curl (i.e. the current). Magnetic discontinuities are identified at the grid-sites where the magnetic field gradient or curl exceeds a specified threshold. We then relax the magnetic discontinuities according to the rules of Lu and Hamilton (1991) or Lu et al. (1993), i.e. we redistribute the magnetic field locally so that the discontinuities disappear. In order to simulate the flaring events, we consider several alternative scenarios with regard to: (1) The threshold above which magnetic discontinuities are identified (applying low, high, and height-dependent threshold values); (2) The driving process that occasionally causes new discontinuities (at randomly chosen grid sites, magnetic field increments are added that are perpendicular (or may-be also parallel) to the existing magnetic field). We address the question whether the coronal active region magnetic fields can indeed be considered to be in the state of self-organized criticality (SOC).
Cellular automata model for use with real freeway data
2002-01-01
The exponential rate of increase in freeway traffic is expanding the need for accurate and : realistic methods to model and predict traffic flow. Traffic modeling and simulation facilitates an : examination of both microscopic and macroscopic views o...
Simulating carbon sequestration using cellular automata and land use assessment for Karaj, Iran
Khatibi, Ali; Pourebrahim, Sharareh; Mokhtar, Mazlin Bin
2018-06-01
Carbon sequestration has been proposed as a means of slowing the atmospheric and marine accumulation of greenhouse gases. This study used observed and simulated land use/cover changes to investigate and predict carbon sequestration rates in the city of Karaj. Karaj, a metropolis of Iran, has undergone rapid population expansion and associated changes in recent years, and these changes make it suitable for use as a case study for rapidly expanding urban areas. In particular, high quality agricultural space, green space and gardens have rapidly transformed into industrial, residential and urban service areas. Five classes of land use/cover (residential, agricultural, rangeland, forest and barren areas) were considered in the study; vegetation and soil samples were taken from 20 randomly selected locations. The level of carbon sequestration was determined for the vegetation samples by calculating the amount of organic carbon present using the dry plant weight method, and for soil samples by using the method of Walkley and Black. For each area class, average values of carbon sequestration in vegetation and soil samples were calculated to give a carbon sequestration index. A cellular automata approach was used to simulate changes in the classes. Finally, the carbon sequestration indices were combined with simulation results to calculate changes in carbon sequestration for each class. It is predicted that, in the 15 year period from 2014 to 2029, much agricultural land will be transformed into residential land, resulting in a severe reduction in the level of carbon sequestration. Results from this study indicate that expansion of forest areas in urban counties would be an effective means of increasing the levels of carbon sequestration. Finally, future opportunities to include carbon sequestration into the simulation of land use/cover changes are outlined.
Deliberative Self-Organizing Traffic Lights with Elementary Cellular Automata
Directory of Open Access Journals (Sweden)
Jorge L. Zapotecatl
2017-01-01
Full Text Available Self-organizing traffic lights have shown considerable improvements compared to traditional methods in computer simulations. Self-organizing methods, however, use sophisticated sensors, increasing their cost and limiting their deployment. We propose a novel approach using simple sensors to achieve self-organizing traffic light coordination. The proposed approach involves placing a computer and a presence sensor at the beginning of each block; each such sensor detects a single vehicle. Each computer builds a virtual environment simulating vehicle movement to predict arrivals and departures at the downstream intersection. At each intersection, a computer receives information across a data network from the computers of the neighboring blocks and runs a self-organizing method to control traffic lights. Our simulations showed a superior performance for our approach compared with a traditional method (a green wave and a similar performance (close to optimal compared with a self-organizing method using sophisticated sensors but at a lower cost. Moreover, the developed sensing approach exhibited greater robustness against sensor failures.
Ma, Xiao; Zheng, Wei-Fan; Jiang, Bao-Shan; Zhang, Ji-Ye
2016-10-01
With the development of traffic systems, some issues such as traffic jams become more and more serious. Efficient traffic flow theory is needed to guide the overall controlling, organizing and management of traffic systems. On the basis of the cellular automata model and the traffic flow model with look-ahead potential, a new cellular automata traffic flow model with negative exponential weighted look-ahead potential is presented in this paper. By introducing the negative exponential weighting coefficient into the look-ahead potential and endowing the potential of vehicles closer to the driver with a greater coefficient, the modeling process is more suitable for the driver’s random decision-making process which is based on the traffic environment that the driver is facing. The fundamental diagrams for different weighting parameters are obtained by using numerical simulations which show that the negative exponential weighting coefficient has an obvious effect on high density traffic flux. The complex high density non-linear traffic behavior is also reproduced by numerical simulations. Project supported by the National Natural Science Foundation of China (Grant Nos. 11572264, 11172247, 11402214, and 61373009).
An improved multi-value cellular automata model for heterogeneous bicycle traffic flow
Energy Technology Data Exchange (ETDEWEB)
Jin, Sheng [College of Civil Engineering and Architecture, Zhejiang University, Hangzhou, 310058 China (China); Qu, Xiaobo [Griffith School of Engineering, Griffith University, Gold Coast, 4222 Australia (Australia); Xu, Cheng [Department of Transportation Management Engineering, Zhejiang Police College, Hangzhou, 310053 China (China); College of Transportation, Jilin University, Changchun, 130022 China (China); Ma, Dongfang, E-mail: mdf2004@zju.edu.cn [Ocean College, Zhejiang University, Hangzhou, 310058 China (China); Wang, Dianhai [College of Civil Engineering and Architecture, Zhejiang University, Hangzhou, 310058 China (China)
2015-10-16
This letter develops an improved multi-value cellular automata model for heterogeneous bicycle traffic flow taking the higher maximum speed of electric bicycles into consideration. The update rules of both regular and electric bicycles are improved, with maximum speeds of two and three cells per second respectively. Numerical simulation results for deterministic and stochastic cases are obtained. The fundamental diagrams and multiple states effects under different model parameters are analyzed and discussed. Field observations were made to calibrate the slowdown probabilities. The results imply that the improved extended Burgers cellular automata (IEBCA) model is more consistent with the field observations than previous models and greatly enhances the realism of the bicycle traffic model. - Highlights: • We proposed an improved multi-value CA model with higher maximum speed. • Update rules are introduced for heterogeneous bicycle traffic with maximum speed 2 and 3 cells/s. • Simulation results of the proposed model are consistent with field bicycle data. • Slowdown probabilities of both regular and electric bicycles are calibrated.
Image Encryption Scheme Based on Balanced Two-Dimensional Cellular Automata
Directory of Open Access Journals (Sweden)
Xiaoyan Zhang
2013-01-01
Full Text Available Cellular automata (CA are simple models of computation which exhibit fascinatingly complex behavior. Due to the universality of CA model, it has been widely applied in traditional cryptography and image processing. The aim of this paper is to present a new image encryption scheme based on balanced two-dimensional cellular automata. In this scheme, a random image with the same size of the plain image to be encrypted is first generated by a pseudo-random number generator with a seed. Then, the random image is evoluted alternately with two balanced two-dimensional CA rules. At last, the cipher image is obtained by operating bitwise XOR on the final evolution image and the plain image. This proposed scheme possesses some advantages such as very large key space, high randomness, complex cryptographic structure, and pretty fast encryption/decryption speed. Simulation results obtained from some classical images at the USC-SIPI database demonstrate the strong performance of the proposed image encryption scheme.
An energy and cost efficient majority-based RAM cell in quantum-dot cellular automata
Khosroshahy, Milad Bagherian; Moaiyeri, Mohammad Hossein; Navi, Keivan; Bagherzadeh, Nader
Nanotechnologies, notably quantum-dot cellular automata, have achieved major attentions for their prominent features as compared to the conventional CMOS circuitry. Quantum-dot cellular automata, particularly owning to its considerable reduction in size, high switching speed and ultra-low energy consumption, is considered as a potential alternative for the CMOS technology. As the memory unit is one of the most essential components in a digital system, designing a well-optimized QCA random access memory (RAM) cell is an important area of research. In this paper, a new five-input majority gate is presented which is suitable for implementing efficient single-layer QCA circuits. In addition, a new RAM cell with set and reset capabilities is designed based on the proposed majority gate, which has an efficient and low-energy structure. The functionality, performance and energy consumption of the proposed designs are evaluated based on the QCADesigner and QCAPro tools. According to the simulation results, the proposed RAM design leads to on average 38% lower total energy dissipation, 25% smaller area, 20% lower cell count, 28% lower delay and 60% lower QCA cost as compared to its previous counterparts.
Cellular automata model for traffic flow at intersections in internet of vehicles
Zhao, Han-Tao; Liu, Xin-Ru; Chen, Xiao-Xu; Lu, Jian-Cheng
2018-03-01
Considering the effect of the front vehicle's speed, the influence of the brake light and the conflict of the traffic flow, we established a cellular automata model called CE-NS for traffic flow at the intersection in the non-vehicle networking environment. According to the information interaction of Internet of Vehicles (IoV), introducing parameters describing the congestion and the accurate speed of the front vehicle into the CE-NS model, we improved the rules of acceleration, deceleration and conflict, and finally established a cellular automata model for traffic flow at intersections of IoV. The relationship between traffic parameters such as vehicle speed, flow and average travel time is obtained by numerical simulation of two models. Based on this, we compared the traffic situation of the non-vehicle networking environment with conditions of IoV environment, and analyzed the influence of the different degree of IoV on the traffic flow. The results show that the traffic speed is increased, the travel time is reduced, the flux of intersections is increased and the traffic flow is more smoothly under IoV environment. After the vehicle which achieves IoV reaches a certain proportion, the operation effect of the traffic flow begins to improve obviously.
Decentralized Cooperation Strategies in Two-Dimensional Traffic of Cellular Automata
International Nuclear Information System (INIS)
Fang Jun; Qin Zheng; Xu Zhaohui; Chen Xiqun; Leng Biao; Jiang Zineng
2012-01-01
We study the two-dimensional traffic of cellular automata using computer simulation. We propose two type of decentralized cooperation strategies, which are called stepping aside (CS-SA) and choosing alternative routes (CS-CAR) respectively. We introduce them into an existing two-dimensional cellular automata (CA) model. CS-SA is designed to prohibit a kind of ping-pong jump when two objects standing together try to move in opposite directions. CS-CAR is designed to change the solution of conflict in parallel update. CS-CAR encourages the objects involved in parallel conflicts choose their alternative routes instead of waiting. We also combine the two cooperation strategies (CS-SA-CAR) to test their combined effects. It is found that the system keeps on a partial jam phase with nonzero velocity and flow until the density reaches one. The ratios of the ping-pong jump and the waiting objects involved in conflict are decreased obviously, especially at the free phase. And the average flow is improved by the three cooperation strategies. Although the average travel time is lengthened a bit by CS-CAR, it is shorten by CS-SA and CS-SA-CAR. In addition, we discuss the advantage and applicability of decentralized cooperation modeling.
An improved multi-value cellular automata model for heterogeneous bicycle traffic flow
International Nuclear Information System (INIS)
Jin, Sheng; Qu, Xiaobo; Xu, Cheng; Ma, Dongfang; Wang, Dianhai
2015-01-01
This letter develops an improved multi-value cellular automata model for heterogeneous bicycle traffic flow taking the higher maximum speed of electric bicycles into consideration. The update rules of both regular and electric bicycles are improved, with maximum speeds of two and three cells per second respectively. Numerical simulation results for deterministic and stochastic cases are obtained. The fundamental diagrams and multiple states effects under different model parameters are analyzed and discussed. Field observations were made to calibrate the slowdown probabilities. The results imply that the improved extended Burgers cellular automata (IEBCA) model is more consistent with the field observations than previous models and greatly enhances the realism of the bicycle traffic model. - Highlights: • We proposed an improved multi-value CA model with higher maximum speed. • Update rules are introduced for heterogeneous bicycle traffic with maximum speed 2 and 3 cells/s. • Simulation results of the proposed model are consistent with field bicycle data. • Slowdown probabilities of both regular and electric bicycles are calibrated
Exact quantification of the complexity of spacewise pattern growth in cellular automata
International Nuclear Information System (INIS)
Freire, Joana G; Gallas, Jason A C; Brison, Owen J
2009-01-01
We analyze the two possible ways of simulating complex systems with cellular automata: by using the familiar timewise updating or by using the complementary spacewise updating. Both updating algorithms operate on identical sets of initial conditions defining the state of the automaton. While timewise growth generally probes just vanishingly small sets of initial conditions producing statistical samples of the asymptotic attractors, spacewise growth operates with much restricted sets which allow one to simulate them all, exhaustively. Our main result is the derivation of an exact analytical formula to quantify precisely one of the two sources of algorithmic complexity of spacewise detection of the complete set of attractors for elementary 1D cellular automata with generic non-periodic architectures of any arbitrary size. The formula gives the total number of initial conditions that need to be investigated to locate rigorously all possible patterns for any given rule. As simple applications, we illustrate how this knowledge may be used (i) to uncover missing patterns in previous classifications in the literature and (ii) to obtain surprisingly novel patterns that are totally unreachable with the time-honored technique of artificially imposing spatially periodic boundary conditions.
From QCA (Quantum Cellular Automata) to Organocatalytic Reactions with Stabilized Carbenium Ions.
Gualandi, Andrea; Mengozzi, Luca; Manoni, Elisabetta; Giorgio Cozzi, Pier
2016-06-01
What do quantum cellular automata (QCA), "on water" reactions, and SN 1-type organocatalytic transformations have in common? The link between these distant arguments is the practical access to useful intermediates and key products through the use of stabilized carbenium ions. Over 10 years, starting with a carbenium ion bearing a ferrocenyl group, to the 1,3-benzodithiolylium carbenium ion, our group has exploited the use of these intermediates in useful and practical synthetic transformations. In particular, we have applied the use of carbenium ions to stereoselective organocatalytic alkylation reactions, showing a possible solution for the "holy grail of organocatalysis". Examples of the use of these quite stabilized intermediates are now also considered in organometallic chemistry. On the other hand, the stable carbenium ions are also applied to tailored molecules adapted to quantum cellular automata, a new possible paradigm for computation. Carbenium ions are not a problem, they can be a/the solution! © 2016 The Chemical Society of Japan & Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
Mujiono, Indra, T. L.; Harmantyo, D.; Rukmana, I. P.; Nadia, Z.
2017-07-01
The purpose of this study was to simulate land use change in 1996-2016 and its prediction in 2035 as well as its potential to deforestation. Both of these purposes were obtained through modeling analysis using Markov Chain Cellular Automata. This modeling method was considered important for understanding the causes and impacts. Based on the analysis, the land use change between 1996 to 2007 has caused forest loss (the region and non-region) covering an area of 62,012 ha. While in the period of 2007 to 2016, the change has lead to the east side of the slope grade of 0-15 percent and an altitude between 500-1000 meters above sea level. In this period, plantation area has increased by 50,822 ha, while the forest area has reduced from 80,038 ha. In a period of 20 years, North Bengkulu Regency has lost the forest area of 80,038 ha. The amount of intervention against forest suggested the potential for deforestation in this area. Simulation of land use change in 2035 did not indicate significant deforestation due to the limited land on physical factors such as slope and elevation. However, it should be noted that, in 2035, the area of conservation forest was reduced by 16,793 ha (29 %), while the areas of protected and production forest were reduced by 4,933 ha (19 %) and 2,114 ha (3 %), respectively. Land use change is a serious threat of deforestation, especially in forest areas in North Bengkulu Regency, where any decline in forest area means the addition of plantation area.
Dynamic Simulation of 1D Cellular Automata in the Active aTAM.
Jonoska, Nataša; Karpenko, Daria; Seki, Shinnosuke
2015-07-01
The Active aTAM is a tile based model for self-assembly where tiles are able to transfer signals and change identities according to the signals received. We extend Active aTAM to include deactivation signals and thereby allow detachment of tiles. We show that the model allows a dynamic simulation of cellular automata with assemblies that do not record the entire computational history but only the current updates of the states, and thus provide a way for (a) algorithmic dynamical structural changes in the assembly and (b) reusable space in self-assembly. The simulation is such that at a given location the sequence of tiles that attach and detach corresponds precisely to the sequence of states the synchronous cellular automaton generates at that location.
Vafaee Sharbaf, Fatemeh; Mosafer, Sara; Moattar, Mohammad Hossein
2016-06-01
This paper proposes an approach for gene selection in microarray data. The proposed approach consists of a primary filter approach using Fisher criterion which reduces the initial genes and hence the search space and time complexity. Then, a wrapper approach which is based on cellular learning automata (CLA) optimized with ant colony method (ACO) is used to find the set of features which improve the classification accuracy. CLA is applied due to its capability to learn and model complicated relationships. The selected features from the last phase are evaluated using ROC curve and the most effective while smallest feature subset is determined. The classifiers which are evaluated in the proposed framework are K-nearest neighbor; support vector machine and naïve Bayes. The proposed approach is evaluated on 4 microarray datasets. The evaluations confirm that the proposed approach can find the smallest subset of genes while approaching the maximum accuracy. Copyright © 2016 Elsevier Inc. All rights reserved.
Azari, M; Tayyebi, A; Helbich, M; Ahadnejad Reveshty, M
2016-01-01
Urbanization processes challenge the growth of orchards areas in many cities in Iran. In Maragheh orchards are crucial ecological, economical, and tourist sources. To explore orchards threatened by urban expansion, this study aims, first, to develop a new model by coupling cellular automata and
Garijo, N; Manzano, R; Osta, R; Perez, M A
2012-12-07
Cell migration and proliferation has been modelled in the literature as a process similar to diffusion. However, using diffusion models to simulate the proliferation and migration of cells tends to create a homogeneous distribution in the cell density that does not correlate to empirical observations. In fact, the mechanism of cell dispersal is not diffusion. Cells disperse by crawling or proliferation, or are transported in a moving ﬂuid. The use of cellular automata, particle models or cell-based models can overcome this limitation. This paper presents a stochastic cellular automata model to simulate the proliferation, migration and differentiation of cells. These processes are considered as completely stochastic as well as discrete. The model developed was applied to predict the behaviour of in vitro cell cultures performed with adult muscle satellite cells. Moreover, non homogeneous distribution of cells has been observed inside the culture well and, using the above mentioned stochastic cellular automata model, we have been able to predict this heterogeneous cell distribution and compute accurate quantitative results. Differentiation was also incorporated into the computational simulation. The results predicted the myotube formation that typically occurs with adult muscle satellite cells. In conclusion, we have shown how a stochastic cellular automata model can be implemented and is capable of reproducing the in vitro behaviour of adult muscle satellite cells. Copyright © 2012 Elsevier Ltd. All rights reserved.
Khan, Muhammad Sadiq Ali; Yousuf, Sidrah
2016-03-01
Cardiac Electrical Activity is commonly distributed into three dimensions of Cardiac Tissue (Myocardium) and evolves with duration of time. The indicator of heart diseases can occur randomly at any time of a day. Heart rate, conduction and each electrical activity during cardiac cycle should be monitor non-invasively for the assessment of "Action Potential" (regular) and "Arrhythmia" (irregular) rhythms. Many heart diseases can easily be examined through Automata model like Cellular Automata concepts. This paper deals with the different states of cardiac rhythms using cellular automata with the comparison of neural network also provides fast and highly effective stimulation for the contraction of cardiac muscles on the Atria in the result of genesis of electrical spark or wave. The specific formulated model named as "States of automaton Proposed Model for CEA (Cardiac Electrical Activity)" by using Cellular Automata Methodology is commonly shows the three states of cardiac tissues conduction phenomena (i) Resting (Relax and Excitable state), (ii) ARP (Excited but Absolutely refractory Phase i.e. Excited but not able to excite neighboring cells) (iii) RRP (Excited but Relatively Refractory Phase i.e. Excited and able to excite neighboring cells). The result indicates most efficient modeling with few burden of computation and it is Action Potential during the pumping of blood in cardiac cycle.
International Nuclear Information System (INIS)
De Menezes, Marcio Argollo; Brigatti, Edgardo; Schwämmle, Veit
2013-01-01
Microbiological systems evolve to fulfil their tasks with maximal efficiency. The immune system is a remarkable example, where the distinction between self and non-self is made by means of molecular interaction between self-proteins and antigens, triggering affinity-dependent systemic actions. Specificity of this binding and the infinitude of potential antigenic patterns call for novel mechanisms to generate antibody diversity. Inspired by this problem, we develop a genetic algorithm where agents evolve their strings in the presence of random antigenic strings and reproduce with affinity-dependent rates. We ask what is the best strategy to generate diversity if agents can rearrange their strings a finite number of times. We find that endowing each agent with an inheritable cellular automaton rule for performing rearrangements makes the system more efficient in pattern-matching than if transformations are totally random. In the former implementation, the population evolves to a stationary state where agents with different automata rules coexist. (paper)
Cellular automata-based artificial life system of horizontal gene transfer
Directory of Open Access Journals (Sweden)
Ji-xin Liu
2016-02-01
Full Text Available Mutation and natural selection is the core of Darwin's idea about evolution. Many algorithms and models are based on this idea. However, in the evolution of prokaryotes, more and more researches have indicated that horizontal gene transfer (HGT would be much more important and universal than the authors had imagined. Owing to this mechanism, the prokaryotes not only become adaptable in nearly any environment on Earth, but also form a global genetic bank and a super communication network with all the genes of the prokaryotic world. Under this background, they present a novel cellular automata model general gene transfer to simulate and study the vertical gene transfer and HGT in the prokaryotes. At the same time, they use Schrodinger's life theory to formulate some evaluation indices and to discuss the intelligence and cognition of prokaryotes which is derived from HGT.
Defect-tolerance analysis of fundamental quantum-dot cellular automata devices
Directory of Open Access Journals (Sweden)
Yongqiang Zhang
2015-04-01
Full Text Available Quantum-dot cellular automata (QCA is a burgeoning technology at the nano-scale range, with the potential for lower power consumption, smaller size and faster speed than conventional complementary metal–oxide semiconductor-based technology. Because of its ultra-density integration and its inherent physical properties, fault-tolerance is an important property to consider in the research and manufacture of QCA. In this paper, one type of defect, in which displacement and misalignment occur coinstantaneously, is investigated in detail on rudimentary QCA devices (majority voter (MV, inverter, wire with QCADesigner. Another MV with rotated cells is also proposed, and it is more robust than the original one. Simulation results present the defect-tolerance of these devices, that is, the maximum precise region the defective cell can be moved moreover, with correct logical function. These conclusions have a meaningful guiding significance for QCA physical implementation and fault-tolerance research.
An Optimized Three-Level Design of Decoder Based on Nanoscale Quantum-Dot Cellular Automata
Seyedi, Saeid; Navimipour, Nima Jafari
2018-03-01
Quantum-dot Cellular Automata (QCA) has been potentially considered as a supersede to Complementary Metal-Oxide-Semiconductor (CMOS) because of its inherent advantages. Many QCA-based logic circuits with smaller feature size, improved operating frequency, and lower power consumption than CMOS have been offered. This technology works based on electron relations inside quantum-dots. Due to the importance of designing an optimized decoder in any digital circuit, in this paper, we design, implement and simulate a new 2-to-4 decoder based on QCA with low delay, area, and complexity. The logic functionality of the 2-to-4 decoder is verified using the QCADesigner tool. The results have shown that the proposed QCA-based decoder has high performance in terms of a number of cells, covered area, and time delay. Due to the lower clock pulse frequency, the proposed 2-to-4 decoder is helpful for building QCA-based sequential digital circuits with high performance.
High-performance full adder architecture in quantum-dot cellular automata
Directory of Open Access Journals (Sweden)
Hamid Rashidi
2017-06-01
Full Text Available Quantum-dot cellular automata (QCA is a new and promising computation paradigm, which can be a viable replacement for the complementary metal–oxide–semiconductor technology at nano-scale level. This technology provides a possible solution for improving the computation in various computational applications. Two QCA full adder architectures are presented and evaluated: a new and efficient 1-bit QCA full adder architecture and a 4-bit QCA ripple carry adder (RCA architecture. The proposed architectures are simulated using QCADesigner tool version 2.0.1. These architectures are implemented with the coplanar crossover approach. The simulation results show that the proposed 1-bit QCA full adder and 4-bit QCA RCA architectures utilise 33 and 175 QCA cells, respectively. Our simulation results show that the proposed architectures outperform most results so far in the literature.
Design of Efficient Full Adder in Quantum-Dot Cellular Automata
Directory of Open Access Journals (Sweden)
Bibhash Sen
2013-01-01
Full Text Available Further downscaling of CMOS technology becomes challenging as it faces limitation of feature size reduction. Quantum-dot cellular automata (QCA, a potential alternative to CMOS, promises efficient digital design at nanoscale. Investigations on the reduction of QCA primitives (majority gates and inverters for various adders are limited, and very few designs exist for reference. As a result, design of adders under QCA framework is gaining its importance in recent research. This work targets developing multi-layered full adder architecture in QCA framework based on five-input majority gate proposed here. A minimum clock zone (2 clock with high compaction (0.01 μm2 for a full adder around QCA is achieved. Further, the usefulness of such design is established with the synthesis of high-level logic. Experimental results illustrate the significant improvements in design level in terms of circuit area, cell count, and clock compared to that of conventional design approaches.
Novel Design for Quantum Dots Cellular Automata to Obtain Fault-Tolerant Majority Gate
International Nuclear Information System (INIS)
Razieh Farazkish, R.; Sayedsalehi, S.; Navi, K.
2012-01-01
Quantum-dot Cellular Automata (QCA) is one of the most attractive technologies for computing at nano scale. The principle element in QCA is majority gate. In this paper, fault-tolerance properties of the majority gate is analyzed. This component is suitable for designing fault-tolerant QCA circuits. We analyze fault-tolerance properties of three-input majority gate in terms of misalignment, missing, and dislocation cells. In order to verify the functionality of the proposed component some physical proofs using kink energy (the difference in electrostatic energy between the two polarization states) and computer simulations using QCA Designer tool are provided. Our results clearly demonstrate that the redundant version of the majority gate is more robust than the standard style for this gate.
Adabi, Sepideh; Adabi, Sahar; Rezaee, Ali
According to the traditional definition of Wireless Sensor Networks (WSNs), static sensors have limited the feasibility of WSNs in some kind of approaches, so the mobility was introduced in WSN. Mobile nodes in a WSN come equipped with battery and from the point of deployment, this battery reserve becomes a valuable resource since it cannot be replenished. Hence, maximizing the network lifetime by minimizing the energy is an important challenge in Mobile WSN. Energy conservation can be accomplished by different approaches. In this paper, we presented an energy conservation solution based on Cellular Automata. The main objective of this solution is based on dynamically adjusting the transmission range and switching between operational states of the sensor nodes.
Modelling land-use effects of future urbanization using cellular automata
DEFF Research Database (Denmark)
Fuglsang, Morten; Münier, B.; Hansen, H.S.
2013-01-01
project PASHMINA (Paradigm Shift modelling and innovative approaches), three storylines of future transportation paradigm shifts towards 2040 are created. These storylines are translated into spatial planning strategies and modelled using the cellular automata model LUCIA. For the modelling, an Eastern......The modelling of land use change is a way to analyse future scenarios by modelling different pathways. Application of spatial data of different scales coupled with socio-economic data makes it possible to explore and test the understanding of land use change relations. In the EU-FP7 research...... Danish case area was selected, comprising of the Copenhagen metropolitan area and its hinterland. The different scenarios are described using a range of different descriptive GIS datasets. These include mapping of accessibility based on public and private transportation, urban density and structure...
Modeling of the competition life cycle using the software complex of cellular automata PyCAlab
Berg, D. B.; Beklemishev, K. A.; Medvedev, A. N.; Medvedeva, M. A.
2015-11-01
The aim of the work is to develop a numerical model of the life cycle of competition on the basis of software complex cellular automata PyCAlab. The model is based on the general patterns of growth of various systems in resource-limited settings. At examples it is shown that the period of transition from an unlimited growth of the market agents to the stage of competitive growth takes quite a long time and may be characterized as monotonic. During this period two main strategies of competitive selection coexist: 1) capture of maximum market space with any reasonable costs; 2) saving by reducing costs. The obtained results allow concluding that the competitive strategies of companies must combine two mentioned types of behavior, and this issue needs to be given adequate attention in the academic literature on management. The created numerical model may be used for market research when developing of the strategies for promotion of new goods and services.
Cellular automata approach to investigation of high burn-up structures in nuclear reactor fuel
International Nuclear Information System (INIS)
Akishina, E.P.; Ivanov, V.V.; Kostenko, B.F.
2005-01-01
Micrographs of uranium dioxide (UO 2 ) corresponding to exposure times in reactor during 323, 953, 971, 1266 and 1642 full power days were investigated. The micrographs were converted into digital files isomorphous to cellular automata (CA) checkerboards. Such a representation of the fuel structure provides efficient tools for its dynamics simulation in terms of primary 'entities' imprinted in the micrographs. Besides, it also ensures a possibility of very effective micrograph processing by CA means. Interconnection between the description of fuel burn-up development and some exactly soluble models is ascertained. Evidences for existence of self-organization in the fuel at high burn-ups were established. The fractal dimension of microstructures is found to be an important characteristic describing the degree of radiation destructions
Explicit implementation of quantum circuits on a quantum-cellular-automata-like architecture
International Nuclear Information System (INIS)
Kawano, Y.; Yamashita, S.; Kitagawa, M.
2005-01-01
We present an efficient strategy to translate a normal quantum algorithm into a sequence of operations on the quantum-cellular-automata-like architecture (QCALA) originally proposed by Lloyd. The QCALA assumes arrays of weakly coupled quantum systems where an interaction exists only between neighboring qubits and can only perform the same quantum operation onto all the qubits. The sequence obtained by the strategy proposed by Lloyd needs at most 12n operations, where n is the number of qubits for the original circuit. The sequence obtained by our strategy needs at most 6n operations. We also clarified the relations between the upper bound of the number of translated operations and the period of the QCALA and between the upper bound of the number of qubits and the period of the QCALA
A federation of simulations based on cellular automata in cyber-physical systems
Directory of Open Access Journals (Sweden)
Hoang Van Tran
2016-02-01
Full Text Available In cyber-physical system (CPS, cooperation between a variety of computational and physical elements usually poses difficulties to current modelling and simulation tools. Although much research has proposed to address those challenges, most solutions do not completely cover uncertain interactions in CPS. In this paper, we present a new approach to federate simulations for CPS. A federation is a combination of, and coordination between simulations upon a standard of communication. In addition, a mixed simulation is defined as several parallel simulations federated in a common time progress. Such simulations run on the models of physical systems, which are built based on cellular automata theory. The experimental results are performed on a federation of three simulations of forest fire spread, river pollution diffusion and wireless sensor network. The obtained results can be utilized to observe and predict the behaviours of physical systems in their interactions.
Directory of Open Access Journals (Sweden)
Klaus Kramer
2017-03-01
Full Text Available We propose a Cellular Automata (CA model in which three ubiquitous and relevant processes in nature are present, namely, spatial competition, distinction between dynamically stronger and weaker agents and the existence of an inner resistance to changes in the actual state S n (=−1,0,+1 of each CA lattice cell n (which we call inertia. Considering ensembles of initial lattices, we study the average properties of the CA final stationary configuration structures resulting from the system time evolution. Assuming the inertia a (proper control parameter, we identify qualitative changes in the CA spatial patterns resembling usual phase transitions. Interestingly, some of the observed features may be associated with continuous transitions (critical phenomena. However, certain quantities seem to present jumps, typical of discontinuous transitions. We argue that these apparent contradictory findings can be attributed to the inertia parameter’s discrete character. Along the work, we also briefly discuss a few potential applications for the present CA formulation.
An Innovative Cellular Automata Technique for Mapping Cracking Pattern of Airport Pavement
Directory of Open Access Journals (Sweden)
Yin Fucheng
2017-01-01
Full Text Available In this study, an innovative cellular automata (CA technique was proposed for mapping cracking pattern of the airport pavement. The CA technique was developed to establish a numerical model describing the effect of boundary condition of pavement on zones (CA cells within the pavement. A state function was used to describe the state values in the cells within the CA lattice. The correction coefficient principle is used as the criterion of zone similarity and the corresponding technique is proposed to find similar zones within and between pavements. Three pavement models, HRS, MRS and LRS, tested in FAA, USA, are set as the base pavements to map the cracking patterns of pavements with different sizes from the base pavements. The mapped cracking patterns of unseen pavements are empirically verified by referring to the relative experimental models.
Advanced spatial metrics analysis in cellular automata land use and cover change modeling
International Nuclear Information System (INIS)
Zamyatin, Alexander; Cabral, Pedro
2011-01-01
This paper proposes an approach for a more effective definition of cellular automata transition rules for landscape change modeling using an advanced spatial metrics analysis. This approach considers a four-stage methodology based on: (i) the search for the appropriate spatial metrics with minimal correlations; (ii) the selection of the appropriate neighborhood size; (iii) the selection of the appropriate technique for spatial metrics application; and (iv) the analysis of the contribution level of each spatial metric for joint use. The case study uses an initial set of 7 spatial metrics of which 4 are selected for modeling. Results show a better model performance when compared to modeling without any spatial metrics or with the initial set of 7 metrics.
Temperature Effects on Olive Fruit Fly Infestation in the FlySim Cellular Automata Model
Bruno, Vincenzo; Baldacchini, Valerio; di Gregorio, Salvatore
FlySim is a Cellular Automata model developed for simulating infestation of olive fruit flies (Bactrocera Oleae) on olive (Olea europaea) groves. The flies move into the groves looking for mature olives where eggs are spawn. This serious agricultural problem is mainly tackled by using chemical agents at the first signs of the infestation, but organic productions with no or few chemicals are strongly requested by the market. Oil made with infested olives is poor in quality, nor olives are suitable for selling in stores. The FlySim model simulates the diffusion of flies looking for mature olives and the growing of flies due to atmospheric conditions. Foreseeing an infestation is the best way to prevent it and to reduce the need of chemicals in agriculture. In this work we investigated the effects of temperature on olive fruit flies and resulting infestation during late spring and summer.
Cellular Automata Modelling of Photo-Induced Oxidation Processes in Molecularly Doped Polymers
Directory of Open Access Journals (Sweden)
David M. Goldie
2016-11-01
Full Text Available The possibility of employing cellular automata (CA to model photo-induced oxidation processes in molecularly doped polymers is explored. It is demonstrated that the oxidation dynamics generated using CA models exhibit stretched-exponential behavior. This dynamical characteristic is in general agreement with an alternative analysis conducted using standard rate equations provided the molecular doping levels are sufficiently low to prohibit the presence of safe-sites which are impenetrable to dissolved oxygen. The CA models therefore offer the advantage of exploring the effect of dopant agglomeration which is difficult to assess from standard rate equation solutions. The influence of UV-induced bleaching or darkening upon the resulting oxidation dynamics may also be easily incorporated into the CA models and these optical effects are investigated for various photo-oxidation product scenarios. Output from the CA models is evaluated for experimental photo-oxidation data obtained from a series of hydrazone-doped polymers.
Cellular Automata Models of Traffic Behavior in Presence of Speed Breaking Structures
International Nuclear Information System (INIS)
Ramachandran, Parthasarathy
2009-01-01
In this article, we study traffic flow in the presence of speed breaking structures. The speed breakers are typically used to reduce the local speed of vehicles near certain institutions such as schools and hospitals. Through a cellular automata model we study the impact of such structures on global traffic characteristics. The simulation results indicate that the presence of speed breakers could reduce the global flow under moderate global densities. However, under low and high global density traffic regime the presence of speed breakers does not have an impact on the global flow. Further the speed limit enforced by the speed breaker creates a phase distinction. For a given global density and slowdown probability, as the speed limit enforced by the speed breaker increases, the traffic moves from the reduced flow phase to maximum flow phase. This underlines the importance of proper design of these structures to avoid undesired flow restrictions. (general)
Design of a fault-tolerant reversible control unit in molecular quantum-dot cellular automata
Bahadori, Golnaz; Houshmand, Monireh; Zomorodi-Moghadam, Mariam
Quantum-dot cellular automata (QCA) is a promising emerging nanotechnology that has been attracting considerable attention due to its small feature size, ultra-low power consuming, and high clock frequency. Therefore, there have been many efforts to design computational units based on this technology. Despite these advantages of the QCA-based nanotechnologies, their implementation is susceptible to a high error rate. On the other hand, using the reversible computing leads to zero bit erasures and no energy dissipation. As the reversible computation does not lose information, the fault detection happens with a high probability. In this paper, first we propose a fault-tolerant control unit using reversible gates which improves on the previous design. The proposed design is then synthesized to the QCA technology and is simulated by the QCADesigner tool. Evaluation results indicate the performance of the proposed approach.
Novel Design for Quantum Dots Cellular Automata to Obtain Fault-Tolerant Majority Gate
Directory of Open Access Journals (Sweden)
Razieh Farazkish
2012-01-01
Full Text Available Quantum-dot Cellular Automata (QCA is one of the most attractive technologies for computing at nanoscale. The principle element in QCA is majority gate. In this paper, fault-tolerance properties of the majority gate is analyzed. This component is suitable for designing fault-tolerant QCA circuits. We analyze fault-tolerance properties of three-input majority gate in terms of misalignment, missing, and dislocation cells. In order to verify the functionality of the proposed component some physical proofs using kink energy (the difference in electrostatic energy between the two polarization states and computer simulations using QCA Designer tool are provided. Our results clearly demonstrate that the redundant version of the majority gate is more robust than the standard style for this gate.
Cellular-automata model of the dwarf shrubs populations and communities dynamics
Directory of Open Access Journals (Sweden)
A. S. Komarov
2015-06-01
Full Text Available The probabilistic cellular-automata model of development and long-time dynamics of dwarf shrub populations and communities is developed. It is based on the concept of discrete description of the plant ontogenesis and joint model approaches in terms of probabilistic cellular automata and L-systems by Lindenmayer. Short representation of the basic model allows evaluation of the approach and software implementation. The main variables of the model are a number of partial bushes in clones or area projective cover. The model allows us to investigate the conditions of self-maintenance and sustainability population under different environmental conditions (inaccessibility of the territory for settlement, mosaic moisture conditions of soil and wealth. The model provides a forecast of the total biomass dynamics shrubs and their fractions (stems, leaves, roots, fine roots, fruits on the basis of the data obtained in the discrete description of ontogenesis and further information on the productivity of the plant fractions. The inclusion of the joint dynamics of biomass of shrubs and soil in EFIMOD models cycle of carbon and nitrogen to evaluate the role of shrubs in these circulations, especially at high impact, such as forest fires and clear cutting, allow forecasting of the dynamics of populations and ecosystem functions of shrubs (regulation of biogeochemical cycles maintaining biodiversity, participation in the creation of non-wood products with changing climatic conditions and strong damaging effects (logging, fires; and application of the models developed to investigate the stability and productivity of shrubs and their participation in the cycle of carbon and nitrogen in different climatic and edaphic conditions.
International Nuclear Information System (INIS)
Takesue, Shinji
1989-01-01
This is the first part of a series devoted to the study of thermodynamic behavior of large dynamical systems with the use of a family of full-discrete and conservative models named elementary reversible cellular automata (ERCAs). In this paper, basic properties such as conservation laws and phase space structure are investigated in preparation for the later studies. ERCAs are a family of one-dimensional reversible cellular automata having two Boolean variables on each site. Reflection and Boolean conjugation symmetries divide them into 88 equivalence classes. For each rule, additive conserved quantities written in a certain form are regarded as a kind of energy, if they exist. By the aid of the discreteness of the variables, every ERCA satisfies the Liouville theorem or the preservation of phase space volume. Thus, if an energy exists in the above sense, statistical mechanics of the model can formally be constructed. If a locally defined quantity is conserved, however, it prevents the realization of statistical mechanics. The existence of such a quantity is examined for each class and a number of rules which have at least one energy but no local conservation laws are selected as hopeful candidates for the realization of thermodynamic behavior. In addition, the phase space structure of ERCAs is analyzed by enumerating cycles exactly in the phase space for systems of comparatively small sizes. As a result, it is revealed that a finite ERCA is not ergodic, that is, a large number of orbits coexist on an energy surface. It is argued that this fact does not necessarily mean the failure of thermodynamic behavior on the basis of an analogy with the ergodic nature of infinite systems
Social interactions of eating behaviour among high school students: a cellular automata approach
2012-01-01
Background Overweight and obesity in children and adolescents is a global epidemic posing problems for both developed and developing nations. The prevalence is particularly alarming in developed nations, such as the United States, where approximately one in three school-aged adolescents (ages 12-19) are overweight or obese. Evidence suggests that weight gain in school-aged adolescents is related to energy imbalance exacerbated by the negative aspects of the school food environment, such as presence of unhealthy food choices. While a well-established connection exists between the food environment, presently there is a lack of studies investigating the impact of the social environment and associated interactions of school-age adolescents. This paper uses a mathematical modelling approach to explore how social interactions among high school adolescents can affect their eating behaviour and food choice. Methods In this paper we use a Cellular Automata (CA) modelling approach to explore how social interactions among school-age adolescents can affect eating behaviour, and food choice. Our CA model integrates social influences and transition rules to simulate the way individuals would interact in a social community (e.g., school cafeteria). To replicate these social interactions, we chose the Moore neighbourhood which allows all neighbours (eights cells in a two-dimensional square lattice) to influence the central cell. Our assumption is that individuals belong to any of four states; Bring Healthy, Bring Unhealthy, Purchase Healthy, and Purchase Unhealthy, and will influence each other according to parameter settings and transition rules. Simulations were run to explore how the different states interact under varying parameter settings. Results This study, through simulations, illustrates that students will change their eating behaviour from unhealthy to healthy as a result of positive social and environmental influences. In general, there is one common characteristic of
Ramírez-López, A.; Romero-Romo, M. A.; Muñoz-Negron, D.; López-Ramírez, S.; Escarela-Pérez, R.; Duran-Valencia, C.
2012-10-01
Computational models are developed to create grain structures using mathematical algorithms based on the chaos theory such as cellular automaton, geometrical models, fractals, and stochastic methods. Because of the chaotic nature of grain structures, some of the most popular routines are based on the Monte Carlo method, statistical distributions, and random walk methods, which can be easily programmed and included in nested loops. Nevertheless, grain structures are not well defined as the results of computational errors and numerical inconsistencies on mathematical methods. Due to the finite definition of numbers or the numerical restrictions during the simulation of solidification, damaged images appear on the screen. These images must be repaired to obtain a good measurement of grain geometrical properties. Some mathematical algorithms were developed to repair, measure, and characterize grain structures obtained from cellular automata in the present work. An appropriate measurement of grain size and the corrected identification of interfaces and length are very important topics in materials science because they are the representation and validation of mathematical models with real samples. As a result, the developed algorithms are tested and proved to be appropriate and efficient to eliminate the errors and characterize the grain structures.
Baradaran, Samaneh; Maleknasr, Niaz; Setayeshi, Saeed; Akbari, Mohammad Esmaeil
2014-01-01
Alpha particle irradiation from radon progeny is one of the major natural sources of effective dose in the public population. Oncogenic transformation is a biological effectiveness of radon progeny alpha particle hits. The biological effects which has caused by exposure to radon, were the main result of a complex series of physical, chemical, biological and physiological interactions. The cellular and molecular mechanisms for radon-induced carcinogenesis have not been clear yet. Various biological models, including cultured cells and animals, have been found useful for studying the carcinogenesis effects of radon progeny alpha particles. In this paper, sugars cape cellular automata have been presented for computational study of complex biological effect of radon progeny alpha particles in lung bronchial airways. The model has included mechanism of DNA damage, which has been induced alpha particles hits, and then formation of transformation in the lung cells. Biomarkers were an objective measure or evaluation of normal or abnormal biological processes. In the model, the metabolism rate of infected cell has been induced alpha particles traversals, as a biomarker, has been followed to reach oncogenic transformation. The model results have successfully validated in comparison with "in vitro oncogenic transformation data" for C3H 10T1/2 cells. This model has provided an opportunity to study the cellular and molecular changes, at the various stages in radiation carcinogenesis, involving human cells. It has become well known that simulation could be used to investigate complex biomedical systems, in situations where traditional methodologies were difficult or too costly to employ.
Solution of Dendritic Growth in Steel by the Novel Point Automata Method
International Nuclear Information System (INIS)
Lorbiecka, A Z; Šarler, B
2012-01-01
The aim of this paper is the simulation of dendritic growth in steel in two dimensions by a coupled deterministic continuum mechanics heat and species transfer model and a stochastic localized phase change kinetics model taking into account the undercooling, curvature, kinetic, and thermodynamic anisotropy. The stochastic model receives temperature and concentration information from the deterministic model and the deterministic heat, and species diffusion equations receive the solid fraction information from the stochastic model. The heat and species transfer models are solved on a regular grid by the standard explicit Finite Difference Method (FDM). The phase-change kinetics model is solved by a novel Point Automata (PA) approach. The PA method was developed [1] in order to circumvent the mesh anisotropy problem, associated with the classical Cellular Automata (CA) method. The PA approach is established on randomly distributed points and neighbourhood configuration, similar as appears in meshless methods. A comparison of the PA and CA methods is shown. It is demonstrated that the results with the new PA method are not sensitive to the crystallographic orientations of the dendrite.
Acedo, L.; Villanueva-Oller, J.; Moraño, J. A.; Villanueva, R.-J.
2013-01-01
The Berkeley Open Infrastructure for Network Computing (BOINC) has become the standard open source solution for grid computing in the Internet. Volunteers use their computers to complete an small part of the task assigned by a dedicated server. We have developed a BOINC project called Neurona@Home whose objective is to simulate a cellular automata random network with, at least, one million neurons. We consider a cellular automata version of the integrate-and-fire model in which excitatory and inhibitory nodes can activate or deactivate neighbor nodes according to a set of probabilistic rules. Our aim is to determine the phase diagram of the model and its behaviour and to compare it with the electroencephalographic signals measured in real brains.
International Nuclear Information System (INIS)
Okumura, Takazumi; Matsukidaira, Junta; Takahashi, Daisuke
2013-01-01
We study one-dimensional neighborhood-five conservative cellular automata (CA), referred to as particle cellular automata five (particle CA5). We show that evolution equations for particle CA5s that belong to certain types can be obtained in the form of max–min-plus expressions from a fundamental diagram. The obtained equations are transformed into other max–min-plus expressions by ultradiscrete Cole–Hopf transformations, which enable us to analyze the asymptotic behaviors of general solutions. The equations in the Lagrange representation, which describe particle motion, are also presented, which can also be obtained from a fundamental diagram. Finally, we discuss the generalization to a one-dimensional conservative neighborhood-n CA, i.e., particle CAn. (paper)
Moustafa, Ahmed; Younes, Ahmed; Hassan, Yasser F
2015-01-01
Quantum-dot cellular automata (QCA) are nanoscale digital logic constructs that use electrons in arrays of quantum dots to carry out binary operations. In this paper, a basic building block for QCA will be proposed. The proposed basic building block can be customized to implement classical gates, such as XOR and XNOR gates, and reversible gates, such as CNOT and Toffoli gates, with less cell count and/or better latency than other proposed designs.
Gary Achtemeier
2012-01-01
A cellular automata fire model represents âelementsâ of fire by autonomous agents. A few simple algebraic expressions substituted for complex physical and meteorological processes and solved iteratively yield simulations for âsuper-diffusiveâ fire spread and coupled surface-layer (2-m) fireâatmosphere processes. Pressure anomalies, which are integrals of the thermal...
DEFF Research Database (Denmark)
Skiadas, Ioannis V.; Ahring, Birgitte Kiær
2002-01-01
characteristics and lead to different reactor behaviour. A dynamic mathematical model has been developed for the anaerobic digestion of a glucose based synthetic wastewater in UASB reactors. Cellular automata (CA) theory has been applied to simulate the granule development process. The model takes...... into consideration that granule diameter and granule microbial composition are functions of the reactor operational parameters and is capable of predicting the UASB performance and the layer structure of the granules....
Directory of Open Access Journals (Sweden)
Thomas Staubitz
2017-06-01
Full Text Available Programming tasks are an important part of teaching computer programming as they foster students to develop essential programming skills and techniques through practice. The design of educational problems plays a crucial role in the extent to which the experiential knowledge is imparted to the learner both in terms of quality and quantity. Badly designed tasks have been known to put-off students from practicing programming. Hence, there is a need for carefully designed problems. Cellular Automata programming lends itself as a very suitable candidate among problems designed for programming practice. In this paper, we describe how various types of problems can be designed using concepts from Cellular Automata and discuss the features which make them good practice problems with regard to instructional pedagogy. We also present a case study on a Cellular Automata programming exercise used in a MOOC on Test Driven Development using JUnit, and discuss the automated evaluation of code submissions and the feedback about the reception of this exercise by participants in this course. Finally, we suggest two ideas to facilitate an easier approach of creating such programming exercises.
Liu, Yan; Cheng, H D; Huang, Jianhua; Zhang, Yingtao; Tang, Xianglong
2012-10-01
In this paper, a novel lesion segmentation within breast ultrasound (BUS) image based on the cellular automata principle is proposed. Its energy transition function is formulated based on global image information difference and local image information difference using different energy transfer strategies. First, an energy decrease strategy is used for modeling the spatial relation information of pixels. For modeling global image information difference, a seed information comparison function is developed using an energy preserve strategy. Then, a texture information comparison function is proposed for considering local image difference in different regions, which is helpful for handling blurry boundaries. Moreover, two neighborhood systems (von Neumann and Moore neighborhood systems) are integrated as the evolution environment, and a similarity-based criterion is used for suppressing noise and reducing computation complexity. The proposed method was applied to 205 clinical BUS images for studying its characteristic and functionality, and several overlapping area error metrics and statistical evaluation methods are utilized for evaluating its performance. The experimental results demonstrate that the proposed method can handle BUS images with blurry boundaries and low contrast well and can segment breast lesions accurately and effectively.
Designing Nanoscale Counter Using Reversible Gate Based on Quantum-Dot Cellular Automata
Moharrami, Elham; Navimipour, Nima Jafari
2018-04-01
Some new technologies such as Quantum-dot Cellular Automata (QCA) is suggested to solve the physical limits of the Complementary Metal-Oxide Semiconductor (CMOS) technology. The QCA as one of the novel technologies at nanoscale has potential applications in future computers. This technology has some advantages such as minimal size, high speed, low latency, and low power consumption. As a result, it is used for creating all varieties of memory. Counter circuits as one of the important circuits in the digital systems are composed of some latches, which are connected to each other in series and actually they count input pulses in the circuit. On the other hand, the reversible computations are very important because of their ability in reducing energy in nanometer circuits. Improving the energy efficiency, increasing the speed of nanometer circuits, increasing the portability of system, making smaller components of the circuit in a nuclear size and reducing the power consumption are considered as the usage of reversible logic. Therefore, this paper aims to design a two-bit reversible counter that is optimized on the basis of QCA using an improved reversible gate. The proposed reversible structure of 2-bit counter can be increased to 3-bit, 4-bit and more. The advantages of the proposed design have been shown using QCADesigner in terms of the delay in comparison with previous circuits.
Bennett clocking of quantum-dot cellular automata and the limits to binary logic scaling
International Nuclear Information System (INIS)
Lent, Craig S; Liu Mo; Lu Yuhui
2006-01-01
We examine power dissipation in different clocking schemes for molecular quantum-dot cellular automata (QCA) circuits. 'Landauer clocking' involves the adiabatic transition of a molecular cell from the null state to an active state carrying data. Cell layout creates devices which allow data in cells to interact and thereby perform useful computation. We perform direct solutions of the equation of motion for the system in contact with the thermal environment and see that Landauer's Principle applies: one must dissipate an energy of at least k B T per bit only when the information is erased. The ideas of Bennett can be applied to keep copies of the bit information by echoing inputs to outputs, thus embedding any logically irreversible circuit in a logically reversible circuit, at the cost of added circuit complexity. A promising alternative which we term 'Bennett clocking' requires only altering the timing of the clocking signals so that bit information is simply held in place by the clock until a computational block is complete, then erased in the reverse order of computation. This approach results in ultralow power dissipation without additional circuit complexity. These results offer a concrete example in which to consider recent claims regarding the fundamental limits of binary logic scaling
Cellular automata model for urban road traffic flow considering pedestrian crossing street
Zhao, Han-Tao; Yang, Shuo; Chen, Xiao-Xu
2016-11-01
In order to analyze the effect of pedestrians' crossing street on vehicle flows, we investigated traffic characteristics of vehicles and pedestrians. Based on that, rules of lane changing, acceleration, deceleration, randomization and update are modified. Then we established two urban two-lane cellular automata models of traffic flow, one of which is about sections with non-signalized crosswalk and the other is on uncontrolled sections with pedestrians crossing street at random. MATLAB is used for numerical simulation of the different traffic conditions; meanwhile space-time diagram and relational graphs of traffic flow parameters are generated and then comparatively analyzed. Simulation results indicate that when vehicle density is lower than around 25 vehs/(km lane), pedestrians have modest impact on traffic flow, whereas when vehicle density is higher than about 60 vehs/(km lane), traffic speed and volume will decrease significantly especially on sections with non-signal-controlled crosswalk. The results illustrate that the proposed models reconstruct the traffic flow's characteristic with the situation where there are pedestrians crossing and can provide some practical reference for urban traffic management.
Small universal cellular automata in hyperbolic spaces a collection of jewels
Margenstern, Maurice
2013-01-01
Hyperbolic geometry is an essential part of theoretical astrophysics and cosmology. Besides specialists of these domains, many specialists of new domains start to show a growing interest both to hyperbolic geometry and to cellular automata. This is especially the case in biology and computer science. This book gives the reader a deep and efficient introduction to an algorithmic approach to hyperbolic geometry. It focuses the attention on the possibilities to obtain in this frame the power of computing everything a computer can compute, that is to say: universality. The minimal ways to get universality are invistigated in a large family of tilings of the hyperbolic plane. In several cases the best results are obtained.In all cases, the results are close to the theoretical best values. This gives rise to fantastic illustrations: the results are jewels in all meanings of the word. ------------------------ Maurice MARGENSTERN is professor emeritus at the University of Lorraine, he is a member of LI...
Modeling Mixed Bicycle Traffic Flow: A Comparative Study on the Cellular Automata Approach
Directory of Open Access Journals (Sweden)
Dan Zhou
2015-01-01
Full Text Available Simulation, as a powerful tool for evaluating transportation systems, has been widely used in transportation planning, management, and operations. Most of the simulation models are focused on motorized vehicles, and the modeling of nonmotorized vehicles is ignored. The cellular automata (CA model is a very important simulation approach and is widely used for motorized vehicle traffic. The Nagel-Schreckenberg (NS CA model and the multivalue CA (M-CA model are two categories of CA model that have been used in previous studies on bicycle traffic flow. This paper improves on these two CA models and also compares their characteristics. It introduces a two-lane NS CA model and M-CA model for both regular bicycles (RBs and electric bicycles (EBs. In the research for this paper, many cases, featuring different values for the slowing down probability, lane-changing probability, and proportion of EBs, were simulated, while the fundamental diagrams and capacities of the proposed models were analyzed and compared between the two models. Field data were collected for the evaluation of the two models. The results show that the M-CA model exhibits more stable performance than the two-lane NS model and provides results that are closer to real bicycle traffic.
Modelling land use/cover changes with markov-cellular automata in Komering Watershed, South Sumatera
Kusratmoko, E.; Albertus, S. D. Y.; Supriatna
2017-01-01
This research has a purpose to study and develop a model that can representing and simulating spatial distribution pattern of land use change in Komering watershed. The Komering watershed is one of nine sub Musi river basin and is located in the southern part of Sumatra island that has an area of 8060,62 km2. Land use change simulations, achieved through Markov-cellular automata (CA) methodologies. Slope, elevation, distance from road, distance from river, distance from capital sub-district, distance from settlement area area were driving factors that used in this research. Land use prediction result in 2030 also shows decrease of forest acreage up to -3.37%, agricultural land decreased up to -2.13%, and open land decreased up to -0.13%. On the other hand settlement area increased up to 0.07%, and plantation land increased up to 5.56%. Based on the predictive result, land use unconformity percentage to RTRW in Komering watershed is 18.62 % and land use conformity is 58.27%. Based on the results of the scenario, where forest in protected areas and agriculture land are maintained, shows increase the land use conformity amounted to 60.41 % and reduce unconformity that occur in Komering watershed to 17.23 %.
Phase transitions and hysteresis in a cellular automata-based model of opinion formation
International Nuclear Information System (INIS)
Kacperski, K.; Holyst, J.A.
1996-01-01
A particular case of a cellular automata-based model of two-state opinion formation in social groups with a strong leader is studied. We consider a 2D Euclidian geometry of open-quotes social spaceclose quotes and mutual interactions ∝ 1/r n . The model shows an interesting dynamics which can be analytically calculated. There are two stable states of the system: a cluster around the leader and unification. Unstable clusters may also appear. A variation in parameters such as the leader's strength or the open-quotes social temperatureclose quotes can change the size of a cluster or, when they reach some critical values, make the system jump into another state. For a certain range of parameters the system exhibits bistability and hysteresis phenomena. We obtained explicit formulas for the cluster size, critical values, make the system jump into another state. For a certain range of parameters the system exhibits bistability and hysteresis phenomena. We obtained explicit formulas for the cluster size, critical leader's strength, and critical open-quotes social temperature.close quotes These analytical results are verified by computer simulations
Alonso, J.; Fernández, A.; Fort, H.
2006-06-01
We propose an extension of the evolutionary Prisoner's Dilemma cellular automata, introduced by Nowak and May (1992 Nature 359 826), in which the pressure of the environment is taken into account. This is implemented by requiring that individuals need to collect a minimum score Umin, representing indispensable resources (nutrients, energy, money, etc) to prosper in this environment. So the agents, instead of evolving just by adopting the behaviour of the most successful neighbour (who got Umsn), also take into account if Umsn is above or below the threshold Umin. If Umsn
Tambunan, L.; Salamah, H.; Asriana, N.
2017-03-01
This study aims to determine the influence of architectural design on the risk of fire spread in densely urban settlement area. Cellular Automata (CA) is used to analyse the fire spread pattern, speed, and the extent of damage. Four cells represent buildings, streets, and fields characteristic in the simulated area, as well as their flammability level and fire spread capabilities. Two fire scenarios are used to model the spread of fire: (1) fire origin in a building with concrete and wood material majority, and (2) fire origin in building with wood material majority. Building shape, building distance, road width, and total area of wall openings are considered constant, while wind is ignored. The result shows that fire spread faster in the building area with wood majority than with concrete majority. Significant amount of combustible building material, absence of distance between buildings, narrow streets and limited fields are factors which influence fire spread speed and pattern as well as extent of damage when fire occurs in the densely urban settlement area.
Jiang, Hang; Ma, Yongjian; Jiang, Lin; Chen, Guozhou; Wang, Dongwei
2018-05-01
At signalized intersection areas, bicycle traffic presents a dispersion feature which may influence the movements of vehicles during peak period. The primary objective of this study is to simulate the dispersion effect in through-movement bicycle traffic at intersection areas and evaluate its influence on through-movement traffic. A cellular automata (CA) model is developed and validated to simulate the operations of through-movement bicycle traffic departing from two types of intersection approaches. Simulation results show that bicycles benefit from the dispersion effect when they depart from the approach with an exclusive right-turn vehicle lane. But when bicycles travel from the approach with a shared right-turn and through vehicle lane, the dispersion effect will result in friction interference and block interference on through-movement vehicles. Bicycle interferences reduce the vehicle speed and increase the delay of through-movement vehicles. The policy implications in regard to the dispersion effect from two types of approaches are discussed to improve the performance of through-movement traffic operations at signalized intersections.
[A Cellular Automata Model for a Community Comprising Two Plant Species of Different Growth Forms].
Frolov, P V; Zubkova, E V; Komarov, A S
2015-01-01
A cellular automata computer model for the interactions between two plant species of different growth forms--the lime hairgrass Deschampsia caespitosa (L.) P. Beauv., a sod cereal, and the moneywort Lysimachia nummularia L., a ground creeping perennial herb--is considered. Computer experiments on the self-maintenance of the populations of each species against the background of a gradual increase in the share of randomly eliminated individuals, coexistence of the populations of two species, and the effect of the phytogenous field have been conducted. As has been shown, all the studied factors determine the number of individuals and self-sustainability of the simulated populations by the degree of their impact. The limits of action have been determined for individual factors; within these limits, the specific features in plant reproduction and dispersal provide sustainable coexistence of the simulated populations. It has been demonstrated that the constructed model allows for studying the long-term developmental dynamics of the plants belonging to the selected growth forms.
Modeling and Simulation of Polarization in Internet Group Opinions Based on Cellular Automata
Directory of Open Access Journals (Sweden)
Yaofeng Zhang
2015-01-01
Full Text Available Hot events on Internet always attract many people who usually form one or several opinion camps through discussion. For the problem of polarization in Internet group opinions, we propose a new model based on Cellular Automata by considering neighbors, opinion leaders, and external influences. Simulation results show the following: (1 It is easy to form the polarization for both continuous opinions and discrete opinions when we only consider neighbors influence, and continuous opinions are more effective in speeding the polarization of group. (2 Coevolution mechanism takes more time to make the system stable, and the global coupling mechanism leads the system to consensus. (3 Opinion leaders play an important role in the development of consensus in Internet group opinions. However, both taking the opinion leaders as zealots and taking some randomly selected individuals as zealots are not conductive to the consensus. (4 Double opinion leaders with consistent opinions will accelerate the formation of group consensus, but the opposite opinions will lead to group polarization. (5 Only small external influences can change the evolutionary direction of Internet group opinions.
Molecular quantum cellular automata cell design trade-offs: latching vs. power dissipation.
Rahimi, Ehsan; Reimers, Jeffrey R
2018-06-20
The use of molecules to enact quantum cellular automata (QCA) cells has been proposed as a new way for performing electronic logic operations at sub-nm dimensions. A key question that arises concerns whether chemical or physical processes are to be exploited. The use of chemical reactions allows the state of a switch element to be latched in molecular form, making the output of a cell independent of its inputs, but costs energy to do the reaction. Alternatively, if purely electronic polarization is manipulated then no internal latching occurs, but no power is dissipated provided the fields from the inputs change slowly compared to the molecular response times. How these scenarios pan out is discussed by considering calculated properties of the 1,4-diallylbutane cation, a species often used as a paradigm for molecular electronic switching. Utilized are results from different calculation approaches that depict the ion either as a charge-localized mixed-valence compound functioning as a bistable switch, or else as an extremely polarizable molecule with a delocalized electronic structure. Practical schemes for using molecular cells in QCA and other devices emerge.
Dittrich, Peter
2018-02-01
The organic code concept and its operationalization by molecular codes have been introduced to study the semiotic nature of living systems. This contribution develops further the idea that the semantic capacity of a physical medium can be measured by assessing its ability to implement a code as a contingent mapping. For demonstration and evaluation, the approach is applied to a formal medium: elementary cellular automata (ECA). The semantic capacity is measured by counting the number of ways codes can be implemented. Additionally, a link to information theory is established by taking multivariate mutual information for quantifying contingency. It is shown how ECAs differ in their semantic capacities, how this is related to various ECA classifications, and how this depends on how a meaning is defined. Interestingly, if the meaning should persist for a certain while, the highest semantic capacity is found in CAs with apparently simple behavior, i.e., the fixed-point and two-cycle class. Synergy as a predictor for a CA's ability to implement codes can only be used if context implementing codes are common. For large context spaces with sparse coding contexts synergy is a weak predictor. Concluding, the approach presented here can distinguish CA-like systems with respect to their ability to implement contingent mappings. Applying this to physical systems appears straight forward and might lead to a novel physical property indicating how suitable a physical medium is to implement a semiotic system. Copyright © 2017 Elsevier B.V. All rights reserved.
Safety impacts of red light cameras at signalized intersections based on cellular automata models.
Chai, C; Wong, Y D; Lum, K M
2015-01-01
This study applies a simulation technique to evaluate the hypothesis that red light cameras (RLCs) exert important effects on accident risks. Conflict occurrences are generated by simulation and compared at intersections with and without RLCs to assess the impact of RLCs on several conflict types under various traffic conditions. Conflict occurrences are generated through simulating vehicular interactions based on an improved cellular automata (CA) model. The CA model is calibrated and validated against field observations at approaches with and without RLCs. Simulation experiments are conducted for RLC and non-RLC intersections with different geometric layouts and traffic demands to generate conflict occurrences that are analyzed to evaluate the hypothesis that RLCs exert important effects on road safety. The comparison of simulated conflict occurrences show favorable safety impacts of RLCs on crossing conflicts and unfavorable impacts for rear-end conflicts during red/amber phases. Corroborative results are found from broad analysis of accident occurrence. RLCs are found to have a mixed effect on accident risk at signalized intersections: crossing collisions are reduced, whereas rear-end collisions may increase. The specially developed CA model is found to be a feasible safety assessment tool.
Li, Xia; Lao, Chunhua; Liu, Yilun; Liu, Xiaoping; Chen, Yimin; Li, Shaoying; Ai, Bing; He, Zijian
2013-11-30
Ecological security has become a major issue under fast urbanization in China. As the first two cities in this country, Shenzhen and Dongguan issued the ordinance of Eco-designated Line of Control (ELC) to "wire" ecologically important areas for strict protection in 2005 and 2009 respectively. Early warning systems (EWS) are a useful tool for assisting the implementation ELC. In this study, a multi-model approach is proposed for the early warning of illegal development by integrating cellular automata (CA) and artificial neural networks (ANN). The objective is to prevent the ecological risks or catastrophe caused by such development at an early stage. The integrated model is calibrated by using the empirical information from both remote sensing and handheld GPS (global positioning systems). The MAR indicator which is the ratio of missing alarms to all the warnings is proposed for better assessment of the model performance. It is found that the fast urban development has caused significant threats to natural-area protection in the study area. The integration of CA, ANN and GPS provides a powerful tool for describing and predicting illegal development which is in highly non-linear and fragmented forms. The comparison shows that this multi-model approach has much better performances than the single-model approach for the early warning. Compared with the single models of CA and ANN, this integrated multi-model can improve the value of MAR by 65.48% and 5.17% respectively. Copyright © 2013 Elsevier Ltd. All rights reserved.
A cellular automata based FPGA realization of a new metaheuristic bat-inspired algorithm
Progias, Pavlos; Amanatiadis, Angelos A.; Spataro, William; Trunfio, Giuseppe A.; Sirakoulis, Georgios Ch.
2016-10-01
Optimization algorithms are often inspired by processes occuring in nature, such as animal behavioral patterns. The main concern with implementing such algorithms in software is the large amounts of processing power they require. In contrast to software code, that can only perform calculations in a serial manner, an implementation in hardware, exploiting the inherent parallelism of single-purpose processors, can prove to be much more efficient both in speed and energy consumption. Furthermore, the use of Cellular Automata (CA) in such an implementation would be efficient both as a model for natural processes, as well as a computational paradigm implemented well on hardware. In this paper, we propose a VHDL implementation of a metaheuristic algorithm inspired by the echolocation behavior of bats. More specifically, the CA model is inspired by the metaheuristic algorithm proposed earlier in the literature, which could be considered at least as efficient than other existing optimization algorithms. The function of the FPGA implementation of our algorithm is explained in full detail and results of our simulations are also demonstrated.
Assessment of freeway work zone safety with improved cellular automata model
Directory of Open Access Journals (Sweden)
Guohua Liang
2014-08-01
Full Text Available To accurately assess the safety of freeway work zones, this paper investigates the safety of vehicle lane change maneuvers with improved cellular automata model. Taking the traffic conflict and standard deviation of operating speed as the evaluation indexes, the study evaluates the freeway work zone safety. With improved deceleration probability in car-following raies and the addition of lanechanging rules under critical state, the lane-changing behavior under critical state is defined as a conflict count. Through 72 schemes of simulation runs, the possible states of the traffic flow are carefully studied. The results show that under the condition of constant saturation traffic conflict count and vehicle speed standard deviation reach their maximums when the mixed rate of heave vehicles is 40%. Meanwhile, in the case of constant heavy vehicles mix, traffic conflict count and vehicle speed standard deviation reach maximum values when saturation rate is 0. 75. Integrating ail simulation results, it is known the traffic safety in freeway work zones is classified into four levels : safe, relatively safe, relatively dangerous, and dangerous.
Directory of Open Access Journals (Sweden)
Kiran Sree Pokkuluri
2014-01-01
Full Text Available Protein coding and promoter region predictions are very important challenges of bioinformatics (Attwood and Teresa, 2000. The identification of these regions plays a crucial role in understanding the genes. Many novel computational and mathematical methods are introduced as well as existing methods that are getting refined for predicting both of the regions separately; still there is a scope for improvement. We propose a classifier that is built with MACA (multiple attractor cellular automata and MCC (modified clonal classifier to predict both regions with a single classifier. The proposed classifier is trained and tested with Fickett and Tung (1992 datasets for protein coding region prediction for DNA sequences of lengths 54, 108, and 162. This classifier is trained and tested with MMCRI datasets for protein coding region prediction for DNA sequences of lengths 252 and 354. The proposed classifier is trained and tested with promoter sequences from DBTSS (Yamashita et al., 2006 dataset and nonpromoters from EID (Saxonov et al., 2000 and UTRdb (Pesole et al., 2002 datasets. The proposed model can predict both regions with an average accuracy of 90.5% for promoter and 89.6% for protein coding region predictions. The specificity and sensitivity values of promoter and protein coding region predictions are 0.89 and 0.92, respectively.
Sasamal, Trailokya Nath; Singh, Ashutosh Kumar; Ghanekar, Umesh
2018-04-01
Nanotechnologies, remarkably Quantum-dot Cellular Automata (QCA), offer an attractive perspective for future computing technologies. In this paper, QCA is investigated as an implementation method for designing area and power efficient reversible logic gates. The proposed designs achieve superior performance by incorporating a compact 2-input XOR gate. The proposed design for Feynman, Toffoli, and Fredkin gates demonstrates 28.12, 24.4, and 7% reduction in cell count and utilizes 46, 24.4, and 7.6% less area, respectively over previous best designs. Regarding the cell count (area cover) that of the proposed Peres gate and Double Feynman gate are 44.32% (21.5%) and 12% (25%), respectively less than the most compact previous designs. Further, the delay of Fredkin and Toffoli gates is 0.75 clock cycles, which is equal to the delay of the previous best designs. While the Feynman and Double Feynman gates achieve a delay of 0.5 clock cycles, equal to the least delay previous one. Energy analysis confirms that the average energy dissipation of the developed Feynman, Toffoli, and Fredkin gates is 30.80, 18.08, and 4.3% (for 1.0 E k energy level), respectively less compared to best reported designs. This emphasizes the beneficial role of using proposed reversible gates to design complex and power efficient QCA circuits. The QCADesigner tool is used to validate the layout of the proposed designs, and the QCAPro tool is used to evaluate the energy dissipation.
An Automata Based Intrusion Detection Method for Internet of Things
Directory of Open Access Journals (Sweden)
Yulong Fu
2017-01-01
Full Text Available Internet of Things (IoT transforms network communication to Machine-to-Machine (M2M basis and provides open access and new services to citizens and companies. It extends the border of Internet and will be developed as one part of the future 5G networks. However, as the resources of IoT’s front devices are constrained, many security mechanisms are hard to be implemented to protect the IoT networks. Intrusion detection system (IDS is an efficient technique that can be used to detect the attackers when cryptography is broken, and it can be used to enforce the security of IoT networks. In this article, we analyzed the intrusion detection requirements of IoT networks and then proposed a uniform intrusion detection method for the vast heterogeneous IoT networks based on an automata model. The proposed method can detect and report the possible IoT attacks with three types: jam-attack, false-attack, and reply-attack automatically. We also design an experiment to verify the proposed IDS method and examine the attack of RADIUS application.
A metric for characterizing the bistability of molecular quantum-dot cellular automata
International Nuclear Information System (INIS)
Lu Yuhui; Lent, Craig S
2008-01-01
Much of molecular electronics involves trying to use molecules as (a) wires, (b) diodes or (c) field-effect transistors. In each case the criterion for determining good performance is well known: for wires it is conductance, for diodes it is conductance asymmetry, while for transistors it is high transconductance. Candidate molecules can be screened in terms of these criteria by calculating molecular conductivity in forward and reverse directions, and in the presence of a gating field. Hence so much theoretical work has focused on understanding molecular conductance. In contrast a molecule used as a quantum-dot cellular automata (QCA) cell conducts no current at all. The keys to QCA functionality are (a) charge localization, (b) bistable charge switching within the cell and (c) electric field coupling between one molecular cell and its neighbor. The combination of these effects can be examined using the cell-cell response function which relates the polarization of one cell to the induced polarization of a neighboring cell. The response function can be obtained by calculating the molecular electronic structure with ab initio quantum chemistry techniques. We present an analysis of molecular QCA performance that can be applied to any candidate molecule. From the full quantum chemistry, all-electron ab initio calculations we extract parameters for a reduced-state model which reproduces the cell-cell response function very well. Techniques from electron transfer theory are used to derive analytical models of the response function and can be employed on molecules too large for full ab initio treatment. A metric is derived which characterizes molecular QCA performance the way transconductance characterizes transistor performance. This metric can be assessed from absorption measurements of the electron transfer band or quantum chemistry calculations of appropriate sophistication
SPATIAL DEFORESTATION MODELILNG USING CELLULAR AUTOMATA (CASE STUDY: CENTRAL ZAGROS FORESTS
Directory of Open Access Journals (Sweden)
M. Naghdizadegan
2013-09-01
Full Text Available Forests have been highly exploited in recent decades in Iran and deforestation is going to be the major environmental concern due to its role in destruction of natural ecosystem and soil cover. Therefore, finding the effective parameters in deforestation and simulation of this process can help the management and preservation of forests. It helps predicting areas of deforestation in near future which is a useful tool for making socioeconomic disciplines in order to prevent deforestation in the area. Recently, GIS technologies are widely employed to support public policies in order to preserve ecosystems from undesirable human activities. The aim of this study is modelling the distribution of forest destruction in part of Central Zagros Mountains and predicting its process in future. In this paper we developed a Cellular Automata (CA model for deforestation process due to its high performance in spatial modelling, land cover change prediction and its compatibility with GIS. This model is going to determine areas with deforestation risk in the future. Land cover maps were explored using high spatial resolution satellite imageries and the forest land cover was extracted. In order to investigate the deforestation modelling, major elements of forest destruction relating to human activity and also physiographic parameters was explored and the suitability map was produced. Then the suitability map in combination with neighbourhood parameter was used to develop the CA model. Moreover, neighbourhood, suitability and stochastic disturbance term were calibrated in order to improve the simulation results. Regarding this, several neighbourhood configurations and different temporal intervals were tested. The accuracy of model was evaluated using satellite image. The results showed that the developed CA model in this research has proper performance in simulation of deforestation process. This model also predicted the areas with high potential for future
Guzmán, H. A.; Lárraga, M. E.; Alvarez-Icaza, L.; Carvajal, J.
2018-02-01
In this paper, a reliable cellular automata model oriented to faithfully reproduce deceleration and acceleration according to realistic reactions of drivers, when vehicles with different deceleration capabilities are considered is presented. The model focuses on describing complex traffic phenomena by coding in its rules the basic mechanisms of drivers behavior, vehicles capabilities and kinetics, while preserving simplicity. In particular, vehiclés kinetics is based on uniform accelerated motion, rather than in impulsive accelerated motion as in most existing CA models. Thus, the proposed model calculates in an analytic way three safe preserving distances to determine the best action a follower vehicle can take under a worst case scenario. Besides, the prediction analysis guarantees that under the proper assumptions, collision between vehicles may not happen at any future time. Simulations results indicate that all interactions of heterogeneous vehicles (i.e., car-truck, truck-car, car-car and truck-truck) are properly reproduced by the model. In addition, the model overcomes one of the major limitations of CA models for traffic modeling: the inability to perform smooth approach to slower or stopped vehicles. Moreover, the model is also capable of reproducing most empirical findings including the backward speed of the downstream front of the traffic jam, and different congested traffic patterns induced by a system with open boundary conditions with an on-ramp. Like most CA models, integer values are used to make the model run faster, which makes the proposed model suitable for real time traffic simulation of large networks.
Heckerling, P S; Gerber, B S; Weiner, S J
2006-01-01
Medical residents engage in formal and informal education interactions with fellow residents during the working day, and can choose whether to spend time and effort on such interactions. Time and effort spent on such interactions can bring learning and personal satisfaction to residents, but may also delay completion of clinical work. Using hypothetical cases, we assessed the values and strategies of internal medicine residents at one hospital for both cooperative and non-cooperative education interactions with fellow residents. We then used these data and cellular automata models of two-person games to simulate repeated interactions between residents, and to determine which strategies resulted in greatest accrued value. We conducted sensitivity analyses on several model parameters, to test the robustness of dominant strategies to model assumptions. Twenty-nine of the 57 residents (50.9%) valued cooperation more than non-cooperation no matter what the other resident did during the current interaction. Similarly, thirty-six residents (63.2%) endorsed an unconditional always-cooperate strategy no matter what the other resident had done during their previous interaction. In simulations, an always-cooperate strategy accrued more value (776.42 value units) than an aggregate of strategies containing non-cooperation components (675.0 value units, p = 0.052). Only when the probability of strategy errors reached 50%, or when values were re-ordered to match those of a Prisoner's Dilemma, did non-cooperation-based strategies accrue the most value. Cooperation-based values and strategies were most frequent among our residents, and dominated in simulations of repeated education interactions between them.
International Nuclear Information System (INIS)
Tosic, P.T.
2011-01-01
We study certain types of Cellular Automata (CA) viewed as an abstraction of large-scale Multi-Agent Systems (MAS). We argue that the classical CA model needs to be modified in several important respects, in order to become a relevant and sufficiently general model for the large-scale MAS, and so that thus generalized model can capture many important MAS properties at the level of agent ensembles and their long-term collective behavior patterns. We specifically focus on the issue of inter-agent communication in CA, and propose sequential cellular automata (SCA) as the first step, and genuinely Asynchronous Cellular Automata (ACA) as the ultimate deterministic CA-based abstract models for large-scale MAS made of simple reactive agents. We first formulate deterministic and nondeterministic versions of sequential CA, and then summarize some interesting configuration space properties (i.e., possible behaviors) of a restricted class of sequential CA. In particular, we compare and contrast those properties of sequential CA with the corresponding properties of the classical (that is, parallel and perfectly synchronous) CA with the same restricted class of update rules. We analytically demonstrate failure of the studied sequential CA models to simulate all possible behaviors of perfectly synchronous parallel CA, even for a very restricted class of non-linear totalistic node update rules. The lesson learned is that the interleaving semantics of concurrency, when applied to sequential CA, is not refined enough to adequately capture the perfect synchrony of parallel CA updates. Last but not least, we outline what would be an appropriate CA-like abstraction for large-scale distributed computing insofar as the inter-agent communication model is concerned, and in that context we propose genuinely asynchronous CA. (author)
Singh, V. K.; Jha, A. K.; Gupta, K.; Srivastav, S. K.
2017-12-01
Recent studies indicate that there is a significant improvement in the urban land use dynamics through modeling at finer spatial resolutions. Geo-computational models such as cellular automata and agent based model have given evident proof regarding the quantification of the urban growth pattern with urban boundary. In recent studies, socio- economic factors such as demography, education rate, household density, parcel price of the current year, distance to road, school, hospital, commercial centers and police station are considered to the major factors influencing the Land Use Land Cover (LULC) pattern of the city. These factors have unidirectional approach to land use pattern which makes it difficult to analyze the spatial aspects of model results both quantitatively and qualitatively. In this study, cellular automata model is combined with generic model known as Agent Based Model to evaluate the impact of socio economic factors on land use pattern. For this purpose, Dehradun an Indian city is selected as a case study. Socio economic factors were collected from field survey, Census of India, Directorate of economic census, Uttarakhand, India. A 3X3 simulating window is used to consider the impact on LULC. Cellular automata model results are examined for the identification of hot spot areas within the urban area and agent based model will be using logistic based regression approach where it will identify the correlation between each factor on LULC and classify the available area into low density, medium density, high density residential or commercial area. In the modeling phase, transition rule, neighborhood effect, cell change factors are used to improve the representation of built-up classes. Significant improvement is observed in the built-up classes from 84 % to 89 %. However after incorporating agent based model with cellular automata model the accuracy improved from 89 % to 94 % in 3 classes of urban i.e. low density, medium density and commercial classes
Directory of Open Access Journals (Sweden)
Paulo Rangel Rios
2006-06-01
Full Text Available The effect of non-random nuclei location and the efficiency of microstructural descriptors in assessing such a situation are studied. Cellular automata simulation of recrystallization in two dimensions is carried out to simulate microstrutural evolution for nuclei distribution ranging from a periodic arrangement to clusters of nuclei. The simulation results are compared in detail with microstrutural descriptors normally used to follow transformation evolution. It is shown that the contiguity is particularly relevant to detect microstructural deviations from randomness. This work focuses on recrystallization but its results are applicable to any nucleation and growth transformation.
Directory of Open Access Journals (Sweden)
Fereydoun Naghibi
2016-12-01
Full Text Available This paper presents an advanced method in urban growth modeling to discover transition rules of cellular automata (CA using the artificial bee colony (ABC optimization algorithm. Also, comparisons between the simulation results of CA models optimized by the ABC algorithm and the particle swarm optimization algorithms (PSO as intelligent approaches were performed to evaluate the potential of the proposed methods. According to previous studies, swarm intelligence algorithms for solving optimization problems such as discovering transition rules of CA in land use change/urban growth modeling can produce reasonable results. Modeling of urban growth as a dynamic process is not straightforward because of the existence of nonlinearity and heterogeneity among effective involved variables which can cause a number of challenges for traditional CA. ABC algorithm, the new powerful swarm based optimization algorithms, can be used to capture optimized transition rules of CA. This paper has proposed a methodology based on remote sensing data for modeling urban growth with CA calibrated by the ABC algorithm. The performance of ABC-CA, PSO-CA, and CA-logistic models in land use change detection is tested for the city of Urmia, Iran, between 2004 and 2014. Validations of the models based on statistical measures such as overall accuracy, figure of merit, and total operating characteristic were made. We showed that the overall accuracy of the ABC-CA model was 89%, which was 1.5% and 6.2% higher than those of the PSO-CA and CA-logistic model, respectively. Moreover, the allocation disagreement (simulation error of the simulation results for the ABC-CA, PSO-CA, and CA-logistic models are 11%, 12.5%, and 17.2%, respectively. Finally, for all evaluation indices including running time, convergence capability, flexibility, statistical measurements, and the produced spatial patterns, the ABC-CA model performance showed relative improvement and therefore its superiority was
Wu, Yina; Abdel-Aty, Mohamed; Ding, Yaoxian; Jia, Bin; Shi, Qi; Yan, Xuedong
2018-07-01
The Type II dilemma zone describes the road segment to a signalized intersection where drivers have difficulties to decide either stop or go at the onset of yellow signal. Such phenomenon can result in an increased crash risk at signalized intersections. Different types of warning systems have been proposed to help drivers make decisions. Although the warning systems help to improve drivers' behavior, they also have several disadvantages such as increasing rear-end crashes or red-light running (RLR) violations. In this study, a new warning system called pavement marking with auxiliary countermeasure (PMAIC) is proposed to reduce the dilemma zone and enhance the traffic safety at signalized intersections. The proposed warning system integrates the pavement marking and flashing yellow system which can provide drivers with better suggestions about stop/go decisions based on their arriving time and speed. In order to evaluate the performance of the proposed warning system, this paper presents a cellular automata (CA) simulation study. The CA simulations are conducted for four different scenarios in total, including the typical intersection without warning system, the intersection with flashing green countermeasure, the intersection with pavement marking, and the intersection with the PMAIC warning system. Before the specific CA simulation analysis, a logistic regression model is calibrated based on field video data to predict drivers' general stop/go decisions. Also, the rules of vehicle movements in the CA models under the influence by different warning systems are proposed. The proxy indicators of rear-end crash and potential RLR violations were estimated and used to evaluate safety levels for the different scenarios. The simulation results showed that the PMAIC countermeasure consistently offered best performance to reduce rear-end crash and RLR violation. Meanwhile, the results indicate that the flashing-green countermeasure could not effectively reduce either rear
Energy Technology Data Exchange (ETDEWEB)
Meireles, Sincler P. de; Santos, Adriano M.; Grynberg, Suely Epsztein, E-mail: spm@cdtn.b, E-mail: amsantos@cdtn.b, E-mail: seg@cdtn.b [Centro de Desenvolvimento da Tecnologia Nuclear (CDTN/CNEN-MG), Belo Horizonte, MG (Brazil); Nunes, Maria Eugenia S., E-mail: mariaeugenia@iceb.ufop.b [Universidade Federal de Ouro Preto (UFOP), MG (Brazil)
2011-07-01
During recent years, there has been a shift from an approach focused entirely on DNA as the main target of ionizing radiation to a vision that considers complex signaling pathways in cells and among cells within tissues. Several newly recognized responses were classified as the so-called non-target responses in which the biological effects are not directly related to the amount of energy deposited in the DNA of cells that were traversed by radiation. In 1992 the bystander effect was described referring to a series of responses such as death, chromosomal instability or other abnormalities that occur in non-irradiated cells that came into contact with irradiated cells or medium from irradiated cells. In this work, we have developed a mathematical model via cellular automata, to quantify cell death induced by the bystander effect. The model is based on experiments with irradiated cells conditioned medium which suggests that irradiated cells secrete molecules in the medium that are capable of damaging other cells. The computational model consists of two-dimensional cellular automata which is able to simulate the transmission of bystander signals via extrinsic route and via Gap junctions. The model has been validated by experimental results in the literature. The time evolution of the effect and the dose-response curves were obtained in good accordance to them. Simulations were conducted for different values of bystander and irradiated cell densities with constant dose. From this work, we have obtained a relationship between cell density and effect. (author)
International Nuclear Information System (INIS)
Meireles, Sincler P. de; Santos, Adriano M.; Grynberg, Suely Epsztein; Nunes, Maria Eugenia S.
2011-01-01
During recent years, there has been a shift from an approach focused entirely on DNA as the main target of ionizing radiation to a vision that considers complex signaling pathways in cells and among cells within tissues. Several newly recognized responses were classified as the so-called non-target responses in which the biological effects are not directly related to the amount of energy deposited in the DNA of cells that were traversed by radiation. In 1992 the bystander effect was described referring to a series of responses such as death, chromosomal instability or other abnormalities that occur in non-irradiated cells that came into contact with irradiated cells or medium from irradiated cells. In this work, we have developed a mathematical model via cellular automata, to quantify cell death induced by the bystander effect. The model is based on experiments with irradiated cells conditioned medium which suggests that irradiated cells secrete molecules in the medium that are capable of damaging other cells. The computational model consists of two-dimensional cellular automata which is able to simulate the transmission of bystander signals via extrinsic route and via Gap junctions. The model has been validated by experimental results in the literature. The time evolution of the effect and the dose-response curves were obtained in good accordance to them. Simulations were conducted for different values of bystander and irradiated cell densities with constant dose. From this work, we have obtained a relationship between cell density and effect. (author)
International Nuclear Information System (INIS)
Mora, Juan Carlos Seck Tuoh; Hernandez, Manuel Gonzalez; Vergara, Sergio V Chapa
2003-01-01
Reversible cellular automata are invertible discrete dynamical systems which have been widely studied both for analysing interesting theoretical questions and for obtaining relevant practical applications, for instance, simulating invertible natural systems or implementing data coding devices. An important problem in the theory of reversible automata is to know how the local behaviour which is not invertible is able to yield a reversible global one. In this sense, symbolic dynamics plays an important role for obtaining an adequate representation of a reversible cellular automaton. In this paper we prove the equivalence between a reversible automaton where the ancestors only differ at one side (technically with one of the two Welch indices equal to 1) and a full shift. We represent any reversible automaton by a de Bruijn diagram, and we characterize the way in which the diagram produces an evolution formed by undefined repetitions of two states. By means of amalgamations, we prove that there is always a way of transforming a de Bruijn diagram into the full shift. Finally, we provide an example illustrating the previous results
Energy Technology Data Exchange (ETDEWEB)
Mora, Juan Carlos Seck Tuoh [Centro de Investigacion Avanzada en Ingenieria Industrial, Universidad Autonoma del Estado de Hidalgo, Carr Pachuca-Tulancingo Km 4.5, 42020 Pachuca (Mexico); Hernandez, Manuel Gonzalez [Centro de Investigacion Avanzada en Ingenieria Industrial, Universidad Autonoma del Estado de Hidalgo, Carr Pachuca-Tulancingo Km 4.5, 42020 Pachuca (Mexico); Vergara, Sergio V Chapa [Depto de Ingenieria Electrica, Seccion Computacion, Centro de Investigacion y de Estudios Avanzados, Instituto Politecnico Nacional, Av IPN 2508, Col San Pedro Zacatenco, 07300 DF (Mexico)
2003-07-25
Reversible cellular automata are invertible discrete dynamical systems which have been widely studied both for analysing interesting theoretical questions and for obtaining relevant practical applications, for instance, simulating invertible natural systems or implementing data coding devices. An important problem in the theory of reversible automata is to know how the local behaviour which is not invertible is able to yield a reversible global one. In this sense, symbolic dynamics plays an important role for obtaining an adequate representation of a reversible cellular automaton. In this paper we prove the equivalence between a reversible automaton where the ancestors only differ at one side (technically with one of the two Welch indices equal to 1) and a full shift. We represent any reversible automaton by a de Bruijn diagram, and we characterize the way in which the diagram produces an evolution formed by undefined repetitions of two states. By means of amalgamations, we prove that there is always a way of transforming a de Bruijn diagram into the full shift. Finally, we provide an example illustrating the previous results.
Yang, Qing-Sheng; Qiao, Ji-Gang; Ai, Bin
2013-09-01
Taking the Dongguan City with rapid urbanization as a case, and selecting landscape ecological security level as evaluation criterion, the urbanization cellular number of 1 km x 1 km ecological security cells was obtained, and imbedded into the transition rules of cellular automata (CA) as the restraint term to control urban development, establish ecological security urban CA, and simulate ecological security urban development pattern. The results showed the integrated landscape ecological security index of the City decreased from 0.497 in 1998 to 0.395 in 2005, indicating that the ecological security at landscape scale was decreased. The CA-simulated integrated ecological security index of the City in 2005 was increased from the measured 0.395 to 0.479, showing that the simulated urban landscape ecological pressure from human became lesser, ecological security became better, and integrated landscape ecological security became higher. CA could be used as an effective tool in researching urban ecological security.
Pérez-Molina, Eduardo; Sliuzas, R.V.; Flacke, J.; Jetten, V.G.
2017-01-01
Urban growth may intensify local flooding problems. Understanding the spatially explicit flood consequences of possible future land cover patterns contributes to inform policy for mitigating these impacts. A cellular automata model has been coupled with the openLISEM integrated flood modeling tool
Molina, Mario Martínez; Moreno-Armendáriz, Marco A; Carlos Seck Tuoh Mora, Juan
2013-11-07
A two-dimensional lattice model based on Cellular Automata theory and swarm intelligence is used to study the spatial and population dynamics of a theoretical ecosystem. It is found that the social interactions among predators provoke the formation of clusters, and that by increasing the mobility of predators the model enters into an oscillatory behavior. © 2013 Elsevier Ltd. All rights reserved.
Hoef, M.A. van der; Frenkel, D.
1990-01-01
We report simulations of the velocity autocorrelation function (VACF) of a tagged particle in two- and three-dimensional lattice-gas cellular automata, using a new technique that is about a million times more efficient than the conventional techniques. The simulations clearly show the algebraic
DEFF Research Database (Denmark)
Srba, Jiri
2006-01-01
We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds...... for a number of studied preorders and equivalences like simulation, completed simulation, ready simulation, 2-nested simulation preorders/equivalences and bisimulation equivalence. Our main results are that all the mentioned equivalences and preorders are EXPTIME-complete on visibly pushdown automata, PSPACE......-complete on visibly one-counter automata and P-complete on visibly BPA. Our PSPACE lower bound for visibly one-counter automata improves also the previously known DP-hardness results for ordinary one-counter automata and one-counter nets. Finally, we study regularity checking problems for visibly pushdown automata...
Energy Technology Data Exchange (ETDEWEB)
Naji Asfestani, Mazaher; Rasouli Heikalabad, Saeed, E-mail: s.rasouli@iaut.ac.ir
2017-05-01
Quantum-dot cellular automata (QCA) is the advent of technology and suitable replacement for semiconductor transistor technology. In this paper, a unique structure for the 2:1 multiplexer is presented in QCA. The structure of this component is simple, ultra-efficient and very useful to implement the various logical functions. The proposed structure does not follow any Boolean function. It takes advantage of the inherent characteristics of quantum technology to produce the desired output. Based on these principles, we design the new and efficient structures for the 4:1 multiplexer and 8:1 multiplexer in the QCA technology. These structures are designed with QCADesigner simulator and simulation results are examined. Investigation results indicate the amazing performance of proposed structure compared to existing structures in terms of area, complexity, power consumption and latency.
Rohrbach, F; Vesztergombi, G
1997-01-01
In the near future, the computer performance will be completely determined by how long it takes to access memory. There are bottle-necks in memory latency and memory-to processor interface bandwidth. The IRAM initiative could be the answer by putting Processor-In-Memory (PIM). Starting from the massively parallel processing concept, one reached a similar conclusion. The MPPC (Massively Parallel Processing Collaboration) project and the 8K processor ASTRA machine (Associative String Test bench for Research \\& Applications) developed at CERN \\cite{kuala} can be regarded as a forerunner of the IRAM concept. The computing power of the ASTRA machine, regarded as an IRAM with 64 one-bit processors on a 64$\\times$64 bit-matrix memory chip machine, has been demonstrated by running statistical physics algorithms: one-dimensional stochastic cellular automata, as a simple model for dynamical phase transitions. As a relevant result for physics, the damage spreading of this model has been investigated.
Mendonça, J. R. G.
2018-04-01
We propose and investigate a one-parameter probabilistic mixture of one-dimensional elementary cellular automata under the guise of a model for the dynamics of a single-species unstructured population with nonoverlapping generations in which individuals have smaller probability of reproducing and surviving in a crowded neighbourhood but also suffer from isolation and dispersal. Remarkably, the first-order mean field approximation to the dynamics of the model yields a cubic map containing terms representing both logistic and weak Allee effects. The model has a single absorbing state devoid of individuals, but depending on the reproduction and survival probabilities can achieve a stable population. We determine the critical probability separating these two phases and find that the phase transition between them is in the directed percolation universality class of critical behaviour.
A novel multiplexer-based structure for random access memory cell in quantum-dot cellular automata
Naji Asfestani, Mazaher; Rasouli Heikalabad, Saeed
2017-09-01
Quantum-dot cellular automata (QCA) is a new technology in scale of nano and perfect replacement for CMOS circuits in the future. Memory is one of the basic components in any digital system, so designing the random access memory (RAM) with high speed and optimal in QCA is important. In this paper, by employing the structure of multiplexer, a novel RAM cell architecture is proposed. The proposed architecture is implemented without the coplanar crossover approach. The proposed architecture is simulated using the QCADesigner version 2.0.3 and QCAPro. The simulation results demonstrate that the proposed QCA RAM architecture has the best performance in terms of delay, circuit complexity, area, cell count and energy consumption in comparison with other QCA RAM architectures.
International Nuclear Information System (INIS)
He Yizhu; Ding Hanlin; Liu Liufa; Shin, Keesam
2006-01-01
The morphology, topology and kinetics of normal grain growth in two-dimension were studied by computer simulation using a cellular automata (Canada) model based on the lowest energy principle. The thermodynamic energy that follows Maxwell-Boltzmann statistics has been introduced into this model for the calculation of energy change. The transition that can reduce the system energy to the lowest level is chosen to occur when there is more than one possible transition direction. The simulation results show that the kinetics of normal grain growth follows the Burke equation with the growth exponent m = 2. The analysis of topology further indicates that normal grain growth can be simulated fairly well by the present CA model. The vanishing of grains with different number of sides is discussed in the simulation
Bahar, Ali Newaz; Waheed, Sajjad
2016-01-01
The fundamental logical element of a quantum-dot cellular automata (QCA) circuit is majority voter gate (MV). The efficiency of a QCA circuit is depends on the efficiency of the MV. This paper presents an efficient single layer five-input majority voter gate (MV5). The structure of proposed MV5 is very simple and easy to implement in any logical circuit. This proposed MV5 reduce number of cells and use conventional QCA cells. However, using MV5 a multilayer 1-bit full-adder (FA) is designed. The functional accuracy of the proposed MV5 and FA are confirmed by QCADesigner a well-known QCA layout design and verification tools. Furthermore, the power dissipation of proposed circuits are estimated, which shows that those circuits dissipate extremely small amount of energy and suitable for reversible computing. The simulation outcomes demonstrate the superiority of the proposed circuit.
Monteagudo, Ángel; Santos, José
2015-01-01
Cancer can be viewed as an emergent behavior in terms of complex system theory and artificial life, Cellular Automata (CA) being the tool most used for studying and characterizing the emergent behavior. Different approaches with CA models were used to model cancer growth. The use of the abstract model of acquired cancer hallmarks permits the direct modeling at cellular level, where a cellular automaton defines the mitotic and apoptotic behavior of cells, and allows for an analysis of different dynamics of the cellular system depending on the presence of the different hallmarks. A CA model based on the presence of hallmarks in the cells, which includes a simulation of the behavior of Cancer Stem Cells (CSC) and their implications for the resultant growth behavior of the multicellular system, was employed. This modeling of cancer growth, in the avascular phase, was employed to analyze the effect of cancer treatments in a cancer stem cell context. The model clearly explains why, after treatment against non-stem cancer cells, the regrowth capability of CSCs generates a faster regrowth of tumor behavior, and also shows that a continuous low-intensity treatment does not favor CSC proliferation and differentiation, thereby allowing an unproblematic control of future tumor regrowth. The analysis performed indicates that, contrary to the current attempts at CSC control, trying to make CSC proliferation more difficult is an important point to consider, especially in the immediate period after a standard treatment for controlling non-stem cancer cell proliferation.
Directory of Open Access Journals (Sweden)
Ángel Monteagudo
Full Text Available Cancer can be viewed as an emergent behavior in terms of complex system theory and artificial life, Cellular Automata (CA being the tool most used for studying and characterizing the emergent behavior. Different approaches with CA models were used to model cancer growth. The use of the abstract model of acquired cancer hallmarks permits the direct modeling at cellular level, where a cellular automaton defines the mitotic and apoptotic behavior of cells, and allows for an analysis of different dynamics of the cellular system depending on the presence of the different hallmarks. A CA model based on the presence of hallmarks in the cells, which includes a simulation of the behavior of Cancer Stem Cells (CSC and their implications for the resultant growth behavior of the multicellular system, was employed. This modeling of cancer growth, in the avascular phase, was employed to analyze the effect of cancer treatments in a cancer stem cell context. The model clearly explains why, after treatment against non-stem cancer cells, the regrowth capability of CSCs generates a faster regrowth of tumor behavior, and also shows that a continuous low-intensity treatment does not favor CSC proliferation and differentiation, thereby allowing an unproblematic control of future tumor regrowth. The analysis performed indicates that, contrary to the current attempts at CSC control, trying to make CSC proliferation more difficult is an important point to consider, especially in the immediate period after a standard treatment for controlling non-stem cancer cell proliferation.
Sipahi, Rifat; Zupanc, Günther K H
2018-05-14
Neural stem and progenitor cells isolated from the central nervous system form, under specific culture conditions, clonal cell clusters known as neurospheres. The neurosphere assay has proven to be a powerful in vitro system to study the behavior of such cells and the development of their progeny. However, the theory of neurosphere growth has remained poorly understood. To overcome this limitation, we have, in the present paper, developed a cellular automata model, with which we examined the effects of proliferative potential, contact inhibition, cell death, and clearance of dead cells on growth rate, final size, and composition of neurospheres. Simulations based on this model indicated that the proliferative potential of the founder cell and its progenitors has a major influence on neurosphere size. On the other hand, contact inhibition of proliferation limits the final size, and reduces the growth rate, of neurospheres. The effect of this inhibition is particularly dramatic when a stem cell becomes encapsulated by differentiated or other non-proliferating cells, thereby suppressing any further mitotic division - despite the existing proliferative potential of the stem cell. Conversely, clearance of dead cells through phagocytosis is predicted to accelerate growth by reducing contact inhibition. A surprising prediction derived from our model is that cell death, while resulting in a decrease in growth rate and final size of neurospheres, increases the degree of differentiation of neurosphere cells. It is likely that the cellular automata model developed as part of the present investigation is applicable to the study of tissue growth in a wide range of systems. Copyright © 2018 Elsevier Ltd. All rights reserved.
Conway's Game of Life is a near-critical metastable state in the multiverse of cellular automata.
Reia, Sandro M; Kinouchi, Osame
2014-05-01
Conway's cellular automaton Game of Life has been conjectured to be a critical (or quasicritical) dynamical system. This criticality is generally seen as a continuous order-disorder transition in cellular automata (CA) rule space. Life's mean-field return map predicts an absorbing vacuum phase (ρ = 0) and an active phase density, with ρ = 0.37, which contrasts with Life's absorbing states in a square lattice, which have a stationary density of ρ(2D) ≈ 0.03. Here, we study and classify mean-field maps for 6144 outer-totalistic CA and compare them with the corresponding behavior found in the square lattice. We show that the single-site mean-field approach gives qualitative (and even quantitative) predictions for most of them. The transition region in rule space seems to correspond to a nonequilibrium discontinuous absorbing phase transition instead of a continuous order-disorder one. We claim that Life is a quasicritical nucleation process where vacuum phase domains invade the alive phase. Therefore, Life is not at the "border of chaos," but thrives on the "border of extinction."
A novel time series link prediction method: Learning automata approach
Moradabadi, Behnaz; Meybodi, Mohammad Reza
2017-09-01
Link prediction is a main social network challenge that uses the network structure to predict future links. The common link prediction approaches to predict hidden links use a static graph representation where a snapshot of the network is analyzed to find hidden or future links. For example, similarity metric based link predictions are a common traditional approach that calculates the similarity metric for each non-connected link and sort the links based on their similarity metrics and label the links with higher similarity scores as the future links. Because people activities in social networks are dynamic and uncertainty, and the structure of the networks changes over time, using deterministic graphs for modeling and analysis of the social network may not be appropriate. In the time-series link prediction problem, the time series link occurrences are used to predict the future links In this paper, we propose a new time series link prediction based on learning automata. In the proposed algorithm for each link that must be predicted there is one learning automaton and each learning automaton tries to predict the existence or non-existence of the corresponding link. To predict the link occurrence in time T, there is a chain consists of stages 1 through T - 1 and the learning automaton passes from these stages to learn the existence or non-existence of the corresponding link. Our preliminary link prediction experiments with co-authorship and email networks have provided satisfactory results when time series link occurrences are considered.
Directory of Open Access Journals (Sweden)
Burbelko A.A.
2012-12-01
Full Text Available The mathematical model of the globular eutectic solidification in 2D was designed. Proposed model is based on the Cellular Automaton Finite Differences (CA-FD calculation method. Model has been used for studies of the primary austenite and of globular eutectic grains growth during the ductile iron solidification in the thin wall casting. Model takes into account, among other things, non-uniform temperature distribution in the casting wall cross-section, kinetics of the austenite and graphite grains nucleation, and non-equilibrium nature of the interphase boundary migration. Calculation of eutectic saturation influence (Sc = 0.9 - 1.1 on microstructure (austenite and graphite fraction, density of austenite and graphite grains and temperature curves in 2 mm wall ductile iron casting has been done.
Two-material optimization of plate armour for blast mitigation using hybrid cellular automata
Goetz, J.; Tan, H.; Renaud, J.; Tovar, A.
2012-08-01
With the increased use of improvised explosive devices in regions at war, the threat to military and civilian life has risen. Cabin penetration and gross acceleration are the primary threats in an explosive event. Cabin penetration crushes occupants, damaging the lower body. Acceleration causes death at high magnitudes. This investigation develops a process of designing armour that simultaneously mitigates cabin penetration and acceleration. The hybrid cellular automaton (HCA) method of topology optimization has proven efficient and robust in problems involving large, plastic deformations such as crash impact. Here HCA is extended to the design of armour under blast loading. The ability to distribute two metallic phases, as opposed to one material and void, is also added. The blast wave energy transforms on impact into internal energy (IE) inside the solid medium. Maximum attenuation occurs with maximized IE. The resulting structures show HCA's potential for designing blast mitigating armour structures.
Experiments with automata compression
Daciuk, J.; Yu, S; Daley, M; Eramian, M G
2001-01-01
Several compression methods of finite-state automata are presented and evaluated. Most compression methods used here are already described in the literature. However, their impact on the size of automata has not been described yet. We fill that gap, presenting results of experiments carried out on
An Urban Cellular Automata Model for Simulating Dynamic States on a Local Scale
Directory of Open Access Journals (Sweden)
Jenni Partanen
2016-12-01
Full Text Available In complex systems, flexibility and adaptability to changes are crucial to the systems’ dynamic stability and evolution. Such resilience requires that the system is able to respond to disturbances by self-organizing, which implies a certain level of entropy within the system. Dynamic states (static, cyclical/periodic, complex, and chaotic reflect this generative capacity, and correlate with the level of entropy. For planning complex cities, we need to develop methods to guide such autonomous progress in an optimal manner. A classical apparatus, cellular automaton (CA, provides such a tool. Applications of CA help us to study temporal dynamics in self-organizing urban systems. By exploring the dynamic states of the model’s dynamics resulting from different border conditions it is possible to discover favorable set(s of rules conductive to the self-organizing dynamics and enable the system’s recovery at the time of crises. Level of entropy is a relevant measurement for evaluation of these dynamic states. The 2-D urban cellular automaton model studied here is based on the microeconomic principle that similar urban activities are attracted to each other, especially in certain self-organizing areas, and that the local dynamics of these enclaves affect the dynamics of the urban region by channeling flows of information, goods and people. The results of the modeling experiment indicate that the border conditions have a major impact on the model’s dynamics generating various dynamic states of the system. Most importantly, it seemed that the model could simulate a favorable, complex dynamic state with medium entropy level which may refer to the continuous self-organization of the system. The model provides a tool for exploring and understanding the effects of boundary conditions in the planning process as various scenarios are tested: resulting dynamics of the system can be explored with such “planning rules” prior to decisions, helping to
Dakua, Sarada Prasad; Abinahed, Julien; Al-Ansari, Abdulla
2015-04-01
Liver segmentation continues to remain a major challenge, largely due to its intense complexity with surrounding anatomical structures (stomach, kidney, and heart), high noise level and lack of contrast in pathological computed tomography (CT) data. We present an approach to reconstructing the liver surface in low contrast CT. The main contributions are: (1) a stochastic resonance-based methodology in discrete cosine transform domain is developed to enhance the contrast of pathological liver images, (2) a new formulation is proposed to prevent the object boundary, resulting from the cellular automata method, from leaking into the surrounding areas of similar intensity, and (3) a level-set method is suggested to generate intermediate segmentation contours from two segmented slices distantly located in a subject sequence. We have tested the algorithm on real datasets obtained from two sources, Hamad General Hospital and medical image computing and computer-assisted interventions grand challenge workshop. Various parameters in the algorithm, such as [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text], play imperative roles, thus their values are precisely selected. Both qualitative and quantitative evaluation performed on liver data show promising segmentation accuracy when compared with ground truth data reflecting the potential of the proposed method.
Liu, Yaolin; Kong, Xuesong; Liu, Yanfang; Chen, Yiyun
2013-01-01
Rapid urbanization in China has triggered the conversion of land from rural to urban use, particularly the conversion of rural settlements to town land. This conversion is the result of the joint effects of the geographic environment and agents involving the government, investors, and farmers. To understand the dynamic interaction dominated by agents and to predict the future landscape of town expansion, a small town land-planning model is proposed based on the integration of multi-agent systems (MAS) and cellular automata (CA). The MAS-CA model links the decision-making behaviors of agents with the neighbor effect of CA. The interaction rules are projected by analyzing the preference conflicts among agents. To better illustrate the effects of the geographic environment, neighborhood, and agent behavior, a comparative analysis between the CA and MAS-CA models in three different towns is presented, revealing interesting patterns in terms of quantity, spatial characteristics, and the coordinating process. The simulation of rural settlements conversion to town land through modeling agent decision and human-environment interaction is very useful for understanding the mechanisms of rural-urban land-use change in developing countries. This process can assist town planners in formulating appropriate development plans.
Liu, Yaolin; Kong, Xuesong; Liu, Yanfang; Chen, Yiyun
2013-01-01
Rapid urbanization in China has triggered the conversion of land from rural to urban use, particularly the conversion of rural settlements to town land. This conversion is the result of the joint effects of the geographic environment and agents involving the government, investors, and farmers. To understand the dynamic interaction dominated by agents and to predict the future landscape of town expansion, a small town land-planning model is proposed based on the integration of multi-agent systems (MAS) and cellular automata (CA). The MAS-CA model links the decision-making behaviors of agents with the neighbor effect of CA. The interaction rules are projected by analyzing the preference conflicts among agents. To better illustrate the effects of the geographic environment, neighborhood, and agent behavior, a comparative analysis between the CA and MAS-CA models in three different towns is presented, revealing interesting patterns in terms of quantity, spatial characteristics, and the coordinating process. The simulation of rural settlements conversion to town land through modeling agent decision and human-environment interaction is very useful for understanding the mechanisms of rural-urban land-use change in developing countries. This process can assist town planners in formulating appropriate development plans. PMID:24244472
Directory of Open Access Journals (Sweden)
Arafan Traore
2018-04-01
Full Text Available In this study, land-cover change in the capital Conakry of Guinea was simulated using the integrated Cellular Automata and Markov model (CA-Markov in the Geographic Information System (GIS and Remote Sensing (RS. Historical land-cover change information was derived from 1986, 2000 and 2016 Landsat data. Using the land-cover change maps of 1986 and 2000, the land-cover change map for 2016 was simulated based on the Markov model in IDRISSI software (Clark University, Worcester, MA, USA. The simulated result was compared with the 2016 land-cover map for validation using the Relative Operating Characteristic (ROC. The ROC result showed a very strong agreement between the two maps. From this result, the land-cover change map for 2025 was simulated using CA-Markov model. The result has indicated that the proportion of the urban area was 49% in 2016, and it is expected to increase to 52% by 2025, while vegetation will decrease from 35% in 2016 to 32% in 2025. This study suggests that the rapid land-cover change has been led by both rapid population growth and extreme poverty in rural areas, which will result in migration into Conakry. The results of this study will provide bases for assessing the sustainability and the management of the urban area and for taking actions to mitigate the degradation of the urban environment.
Directory of Open Access Journals (Sweden)
Yuanyuan Yang
2015-05-01
Full Text Available Decadal to centennial land use and land cover change has been consistently singled out as a key element and an important driver of global environmental change, playing an essential role in balancing energy use. Understanding long-term human-environment interactions requires historical reconstruction of past land use and land cover changes. Most of the existing historical reconstructions have insufficient spatial and thematic detail and do not consider various land change types. In this context, this paper explored the possibility of using a cellular automata-Markov model in 90 m × 90 m spatial resolution to reconstruct historical land use in the 1930s in Zhenlai County, China. Then the three-map comparison methodology was employed to assess the predictive accuracy of the transition modeling. The model could produce backward projections by analyzing land use changes in recent decades, assuming that the present land use pattern is dynamically dependent on the historical one. The reconstruction results indicated that in the 1930s most of the study area was occupied by grasslands, followed by wetlands and arable land, while other land categories occupied relatively small areas. Analysis of the three-map comparison illustrated that the major differences among the three maps have less to do with the simulation model and more to do with the inconsistencies among the land categories during the study period. Different information provided by topographic maps and remote sensing images must be recognized.
Jokar Arsanjani, Taghi; Javidan, Reza; Nazemosadat, Mohamad Jafar; Jokar Arsanjani, Jamal; Vaz, Eric
2015-05-01
Recent developments of geospatial technologies and models have provided environmentalists and naturalists with a wide variety of facilities and approaches for improved monitoring and management of environmental resources. Rich temporal remote sensing datasets, e.g., Landsat imagery as well as geospatial modeling techniques, facilitate the process of monitoring and modeling environmental phenomena. The main objective of this paper is to monitor the spatiotemporal patterns of fluctuations of a dynamic lake in the south of Iran - Bakhtegan Lake - which has been influenced by extreme climate change conditions. To do so, a temporal coverage of 12 Landsat images from 1973 to 2013, was used to delineate the boundaries of the lake over time and analyze the occurred changes. Next, a cellular automata (CA) approach was adopted for simulating two main processes: 'lake expansion' and 'lake shrinkage'. The CA model was then calibrated based on a statistical comparison of the simulated and actual images of one timestamp. Application of Kappa index analysis measures the performance of the model at a value of 83 percent. The calibrated CA model was then applied and the future status of the lake (by 2017) was modeled; this suggested a further 45 percent shrinkage in addition to its recent 42 percent shrinkage. In conclusion, the socio-ecological impacts and consequences of the lake's fluctuations are discussed in detail and some complementary recommendations are proposed.
Change of Land Use/Cover in Tianjin City Based on the Markov and Cellular Automata Models
Directory of Open Access Journals (Sweden)
Ruci Wang
2017-05-01
Full Text Available In recent years, urban areas have been expanding rapidly in the world, especially in developing countries. With this rapid urban growth, several environmental and social problems have appeared. Better understanding of land use and land cover (LULC change will facilitate urban planning and constrain these potential problems. As one of the four municipalities in China, Tianjin has experienced rapid urbanization and such trend is expected to continue. Relying on remote sensing (RS and geographical information system (GIS tools, this study investigates LULC change in Tianjin city. First, we used RS to generate classification maps for 1995, 2005, and 2015. Then, simulation models were applied to evaluate the LULC changes. Analysis of the 1995, 2005, and 2015 LULC maps shows that more than 10% of the cropland areas were transformed into built-up areas. Finally, by employing the Markov model and cellular automata (CA model, the LULC in 2025 and 2035 were simulated and forecasted. Our analysis contributes to the understanding of the development process in the Tianjin area, which will facilitate future planning, as well as constraining the potential negative consequences brought by future LULC changes.
A novel power-efficient high-speed clock management unit using quantum-dot cellular automata
International Nuclear Information System (INIS)
Abutaleb, M. M.
2017-01-01
Quantum-dot cellular automata (QCA) is one of the most attractive alternatives for complementary metal-oxide semiconductor technology. The QCA widely supports a new paradigm in the field of nanotechnology that has the potential for high density, low power, and high speed. The clock manager is an essential building block in the new microwave and radio frequency integrated circuits. This paper describes a novel QCA-based clock management unit (CMU) that provides innovative clocking capabilities. The proposed CMU is achieved by utilizing edge-triggered D-type flip-flops (D-FFs) in the design of frequency synthesizer and phase splitter. Edge-triggered D-FF structures proposed in this paper have the successful QCA implementation and simulation with the least complexity and power dissipation as compared to earlier structures. The frequency synthesizer is used to generate new clock frequencies from the reference clock frequency based on a combination of power-of-two frequency dividers. The phase splitter is integrated with the frequency synthesizer to generate four clock signals that are 90"o out of phase with each other. This paper demonstrates that the proposed QCA CMU structure has a superior performance. Furthermore, the proposed CMU is straightforwardly scalable due to the use of modular component architecture.
Christie, John A; Forrest, Ryan P; Corcelli, Steven A; Wasio, Natalie A; Quardokus, Rebecca C; Brown, Ryan; Kandel, S Alex; Lu, Yuhui; Lent, Craig S; Henderson, Kenneth W
2015-12-14
The preparation of 7-Fc(+) -8-Fc-7,8-nido-[C2 B9 H10 ](-) (Fc(+) FcC2 B9 (-) ) demonstrates the successful incorporation of a carborane cage as an internal counteranion bridging between ferrocene and ferrocenium units. This neutral mixed-valence Fe(II) /Fe(III) complex overcomes the proximal electronic bias imposed by external counterions, a practical limitation in the use of molecular switches. A combination of UV/Vis-NIR spectroscopic and TD-DFT computational studies indicate that electron transfer within Fc(+) FcC2 B9 (-) is achieved through a bridge-mediated mechanism. This electronic framework therefore provides the possibility of an all-neutral null state, a key requirement for the implementation of quantum-dot cellular automata (QCA) molecular computing. The adhesion, ordering, and characterization of Fc(+) FcC2 B9 (-) on Au(111) has been observed by scanning tunneling microscopy. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Gangadari, Bhoopal Rao; Ahamed, Shaik Rafi
2016-12-01
In this paper, we presented a novel approach of low energy consumption architecture of S-Box used in Advanced Encryption Standard (AES) algorithm using programmable second order reversible cellular automata (RCA 2 ). The architecture entails a low power implementation with minimal delay overhead and the performance of proposed RCA 2 based S-Box in terms of security is evaluated using the cryptographic properties such as nonlinearity, correlation immunity bias, strict avalanche criteria, entropy and also found that the proposed architecture is secure enough for cryptographic applications. Moreover, the proposed AES algorithm architecture simulation studies show that energy consumption of 68.726 nJ, power dissipation of 3.856 mW for 0.18- μm at 13.69 MHz and energy consumption of 29.408 nJ, power dissipation of 1.65 mW for 0.13- μm at 13.69 MHz. The proposed AES algorithm with RCA 2 based S-Box shows a reduction power consumption by 50 % and energy consumption by 5 % compared to best classical S-Box and composite field arithmetic based AES algorithm. Apart from that, it is also shown that RCA 2 based S-Boxes are dynamic in nature, invertible, low power dissipation compared to that of LUT based S-Box and hence suitable for Wireless Body Area Network (WBAN) applications.
Chai, C; Wong, Y D
2014-02-01
At intersection, vehicles coming from different directions conflict with each other. Improper geometric design and signal settings at signalized intersection will increase occurrence of conflicts between road users and results in a reduction of the safety level. This study established a cellular automata (CA) model to simulate vehicular interactions involving right-turn vehicles (as similar to left-turn vehicles in US). Through various simulation scenarios for four case cross-intersections, the relationships between conflict occurrences involving right-turn vehicles with traffic volume and right-turn movement control strategies are analyzed. Impacts of traffic volume, permissive right-turn compared to red-amber-green (RAG) arrow, shared straight-through and right-turn lane as well as signal setting are estimated from simulation results. The simulation model is found to be able to provide reasonable assessment of conflicts through comparison of existed simulation approach and observed accidents. Through the proposed approach, prediction models for occurrences and severity of vehicle conflicts can be developed for various geometric layouts and traffic control strategies. Copyright © 2013 Elsevier Ltd. All rights reserved.
Phase change cellular automata modeling of GeTe, GaSb and SnSe stacked chalcogenide films
Mihai, C.; Velea, A.
2018-06-01
Data storage needs are increasing at a rapid pace across all economic sectors, so the need for new memory technologies with adequate capabilities is also high. Phase change memories (PCMs) are a leading contender in the emerging race for non-volatile memories due to their fast operation speed, high scalability, good reliability and low power consumption. However, in order to meet the present and future storage demands, PCM technologies must further increase the storage density. Here, we employ a probabilistic cellular automata approach to explore the multi-step threshold switching from the reset (off) to the set (on) state in chalcogenide stacked structures. Simulations have shown that in order to obtain multi-step switching with high contrast among different resistance states, the stacked structure needs to contain materials with a large difference among their crystallization temperatures and careful tuning of strata thicknesses. The crystallization dynamics can be controlled through the external energy pulses applied to the system, in such a way that a balance between nucleation and growth in phase change behavior can be achieved, optimized for PCMs.
Directory of Open Access Journals (Sweden)
Jun Yang
2013-01-01
Full Text Available Spatiotemporal simulation of tourist town growth is important for research on land use/cover change under the influence of urbanization. Many scholars have shown great interest in the unique pattern of driving urban development with tourism development. Based on the cellular automata (CA model, we simulated and predicted the spatiotemporal growth of Sanpo town in Hebei Province, using the tourism urbanization growth model. Results showed that (1 average annual growth rate of the entire region was 1.5 Ha2 per year from 2005 to 2010, 4 Ha2 per year from 2010 to 2015, and 2.5 Ha2 per year from 2015 to 2020; (2 urban growth rate increased yearly, with regional differences, and had a high degree of correlation with the Euclidean distance of town center, traffic route, attractions, and other factors; (3 Gougezhuang, an important village center in the west of the town, demonstrated traffic advantages and increased growth rate since 2010; (4 Magezhuang village has the largest population in the region, so economic advantages have driven the development of rural urbanization. It showed that CA had high reliability in simulating the spatiotemporal evolution of tourist town, which assists the study of spatiotemporal growth under urbanization and rational protection of tourism resources.
A novel power-efficient high-speed clock management unit using quantum-dot cellular automata
Energy Technology Data Exchange (ETDEWEB)
Abutaleb, M. M., E-mail: mustafa-abotaleb@h-eng.helwan.edu.eg [Helwan University, Department of Electronics, Communications and Computer Engineering (Egypt)
2017-04-15
Quantum-dot cellular automata (QCA) is one of the most attractive alternatives for complementary metal-oxide semiconductor technology. The QCA widely supports a new paradigm in the field of nanotechnology that has the potential for high density, low power, and high speed. The clock manager is an essential building block in the new microwave and radio frequency integrated circuits. This paper describes a novel QCA-based clock management unit (CMU) that provides innovative clocking capabilities. The proposed CMU is achieved by utilizing edge-triggered D-type flip-flops (D-FFs) in the design of frequency synthesizer and phase splitter. Edge-triggered D-FF structures proposed in this paper have the successful QCA implementation and simulation with the least complexity and power dissipation as compared to earlier structures. The frequency synthesizer is used to generate new clock frequencies from the reference clock frequency based on a combination of power-of-two frequency dividers. The phase splitter is integrated with the frequency synthesizer to generate four clock signals that are 90{sup o} out of phase with each other. This paper demonstrates that the proposed QCA CMU structure has a superior performance. Furthermore, the proposed CMU is straightforwardly scalable due to the use of modular component architecture.
Directory of Open Access Journals (Sweden)
Chudech Losiri
2016-07-01
Full Text Available Urban expansion is considered as one of the most important problems in several developing countries. Bangkok Metropolitan Region (BMR is the urbanized and agglomerated area of Bangkok Metropolis (BM and its vicinity, which confronts the expansion problem from the center of the city. Landsat images of 1988, 1993, 1998, 2003, 2008, and 2011 were used to detect the land use and land cover (LULC changes. The demographic and economic data together with corresponding maps were used to determine the driving factors for land conversions. This study applied Cellular Automata-Markov Chain (CA-MC and Multi-Layer Perceptron-Markov Chain (MLP-MC to model LULC and urban expansions. The performance of the CA-MC and MLP-MC yielded more than 90% overall accuracy to predict the LULC, especially the MLP-MC method. Further, the annual population and economic growth rates were considered to produce the land demand for the LULC in 2014 and 2035 using the statistical extrapolation and system dynamics (SD. It was evident that the simulated map in 2014 resulting from the SD yielded the highest accuracy. Therefore, this study applied the SD method to generate the land demand for simulating LULC in 2035. The outcome showed that urban occupied the land around a half of the BMR.
Number-conserving cellular automata with a von Neumann neighborhood of range one
International Nuclear Information System (INIS)
Wolnik, Barbara; Dzedzej, Adam; Baetens, Jan M; De Baets, Bernard
2017-01-01
We present necessary and sufficient conditions for a cellular automaton with a von Neumann neighborhood of range one to be number-conserving. The conditions are formulated for any dimension and for any set of states containing zero. The use of the geometric structure of the von Neumann neighborhood allows for computationally tractable conditions even in higher dimensions. (paper)
Gao, Yuan; Zhang, Chuanrong; He, Qingsong; Liu, Yaolin
2017-06-15
Ecological security is an important research topic, especially urban ecological security. As highly populated eco-systems, cities always have more fragile ecological environments. However, most of the research on urban ecological security in literature has focused on evaluating current or past status of the ecological environment. Very little literature has carried out simulation or prediction of future ecological security. In addition, there is even less literature exploring the urban ecological environment at a fine scale. To fill-in the literature gap, in this study we simulated and predicted urban ecological security at a fine scale (district level) using an improved Cellular Automata (CA) approach. First we used the pressure-state-response (PSR) method based on grid-scale data to evaluate urban ecological security. Then, based on the evaluation results, we imported the geographically weighted regression (GWR) concept into the CA model to simulate and predict urban ecological security. We applied the improved CA approach in a case study-simulating and predicting urban ecological security for the city of Wuhan in Central China. By comparing the simulated ecological security values from 2010 using the improved CA model to the actual ecological security values of 2010, we got a relatively high value of the kappa coefficient, which indicates that this CA model can simulate or predict well future development of ecological security in Wuhan. Based on the prediction results for 2020, we made some policy recommendations for each district in Wuhan.
Nurhidayati, E.; Buchori, I.; Mussadun; Fariz, T. R.
2017-07-01
Pontianak waterfront city as water-based urban has the potential of water resources, socio-economic, cultural, tourism and riverine settlements. Settlements areas in the eastern district of Pontianak waterfront city is located in the triangle of Kapuas river and Landak river. This study uses quantitative-GIS methods that integrates binary logistic regression and Cellular Automata-Markov models. The data used in this study such as satellite imagery Quickbird 2003, Ikonos 2008 and elevation contour interval 1 meter. This study aims to discover the settlement land use changes in 2003-2014 and to predict the settlements areas in 2020. This study results the accuracy in predicting of changes in settlements areas shows overall accuracy (79.74%) and the highest kappa index (0.55). The prediction results show that settlement areas (481.98 Ha) in 2020 and the increasingly of settlement areas (6.80 Ha/year) in 2014-2020. The development of settlement areas in 2020 shows the highest land expansion in Parit Mayor Village. The results of regression coefficient value (0) of flooding variable, so flooding did not influence to the development of settlement areas in the eastern district of Pontianak because the building’s adaptation of rumah panggung’s settlements was very good which have adjusted to the height of tidal flood.
Gao, Yuan; Zhang, Chuanrong; He, Qingsong; Liu, Yaolin
2017-01-01
Ecological security is an important research topic, especially urban ecological security. As highly populated eco-systems, cities always have more fragile ecological environments. However, most of the research on urban ecological security in literature has focused on evaluating current or past status of the ecological environment. Very little literature has carried out simulation or prediction of future ecological security. In addition, there is even less literature exploring the urban ecological environment at a fine scale. To fill-in the literature gap, in this study we simulated and predicted urban ecological security at a fine scale (district level) using an improved Cellular Automata (CA) approach. First we used the pressure-state-response (PSR) method based on grid-scale data to evaluate urban ecological security. Then, based on the evaluation results, we imported the geographically weighted regression (GWR) concept into the CA model to simulate and predict urban ecological security. We applied the improved CA approach in a case study—simulating and predicting urban ecological security for the city of Wuhan in Central China. By comparing the simulated ecological security values from 2010 using the improved CA model to the actual ecological security values of 2010, we got a relatively high value of the kappa coefficient, which indicates that this CA model can simulate or predict well future development of ecological security in Wuhan. Based on the prediction results for 2020, we made some policy recommendations for each district in Wuhan. PMID:28617348
International Nuclear Information System (INIS)
Saucedo Mora, Luis; Mostafavi, Mahmoud; Marrow, T. James; Khoshkhou, Danial; Connolly, Brian; Reinhard, Christina; Atwood, Robert; Zhao, Shuang
2015-01-01
Cellular automata integrated with finite elements (CAFE) have been used to develop a method to account for the effect of microstructure on quasi-brittle damage development. The microstructure is simulated explicitly by subdividing a finite element into smaller cells. A heterogeneous structure is created from key cells (seeds) using defined characteristics; the influence of the initial finite element mesh is effectively removed during the development of the microstructure. Graded microstructures, textures, particle anisotropy and multiple phases can be readily simulated, such as those in composites and porous materials. A mesh-free framework has been developed to compute the damage development through the microstructure, using cellular automata. With this method, we can study the development of discontinuous cracking and damage coalescence, and its sensitivity to microstructure. Experiments have been carried out to observe the three-dimensional development of damage, using high-resolution synchrotron X-ray computed tomography and digital volume correlation to observe Hertzian indentation of a SiC-SiC fibre composite, quantifying damage by measurement of the displacement fields within the material. The results demonstrate the applicability of the modelling strategy to damage development, and show how model input data may be obtained from small specimen tests, which could be performed at elevated temperatures with irradiated materials. (authors)
International Nuclear Information System (INIS)
Ohmori, Shousuke; Yamazaki, Yoshihiro
2016-01-01
Ultradiscrete equations are derived from a set of reaction–diffusion partial differential equations, and cellular automaton rules are obtained on the basis of the ultradiscrete equations. Some rules reproduce the dynamical properties of the original reaction–diffusion equations, namely, bistability and pulse annihilation. Furthermore, other rules bring about soliton-like preservation and periodic pulse generation with a pacemaker, which are not obtained from the original reaction–diffusion equations. (author)
Directory of Open Access Journals (Sweden)
Somsak Panyakeow
2010-10-01
Full Text Available Laterally close-packed quantum dots (QDs called quantum dot molecules (QDMs are grown by modified molecular beam epitaxy (MBE. Quantum dots could be aligned and cross hatched. Quantum rings (QRs created from quantum dot transformation during thin or partial capping are used as templates for the formations of bi-quantum dot molecules (Bi-QDMs and quantum dot rings (QDRs. Preferable quantum dot nanostructure for quantum computation based on quantum dot cellular automata (QCA is laterally close-packed quantum dot molecules having four quantum dots at the corners of square configuration. These four quantum dot sets are called quadra-quantum dots (QQDs. Aligned quadra-quantum dots with two electron confinements work like a wire for digital information transmission by Coulomb repulsion force, which is fast and consumes little power. Combination of quadra-quantum dots in line and their cross-over works as logic gates and memory bits. Molecular Beam Epitaxial growth technique called 'Droplet Epitaxy' has been developed for several quantum nanostructures such as quantum rings and quantum dot rings. Quantum rings are prepared by using 20 ML In-Ga (15:85 droplets deposited on a GaAs substrate at 390'C with a droplet growth rate of 1ML/s. Arsenic flux (7'8'10-6Torr is then exposed for InGaAs crystallization at 200'C for 5 min. During droplet epitaxy at a high droplet thickness and high temperature, out-diffusion from the centre of droplets occurs under anisotropic strain. This leads to quantum ring structures having non-uniform ring stripes and deep square-shaped nanoholes. Using these peculiar quantum rings as templates, four quantum dots situated at the corners of a square shape are regrown. Two of these four quantum dots are aligned either or, which are preferable crystallographic directions of quantum dot alignment in general.
Henry, Jackson; Blair, Enrique P.
2018-02-01
Mixed-valence molecules provide an implementation for a high-speed, energy-efficient paradigm for classical computing known as quantum-dot cellular automata (QCA). The primitive device in QCA is a cell, a structure with multiple quantum dots and a few mobile charges. A single mixed-valence molecule can function as a cell, with redox centers providing quantum dots. The charge configuration of a molecule encodes binary information, and device switching occurs via intramolecular electron transfer between dots. Arrays of molecular cells adsorbed onto a substrate form QCA logic. Individual cells in the array are coupled locally via the electrostatic electric field. This device networking enables general-purpose computing. Here, a quantum model of a two-dot molecule is built in which the two-state electronic system is coupled to the dominant nuclear vibrational mode via a reorganization energy. This model is used to explore the effects of the electronic inter-dot tunneling (coupling) matrix element and the reorganization energy on device switching. A semi-classical reduction of the model also is made to investigate the competition between field-driven device switching and the electron-vibrational self-trapping. A strong electron-vibrational coupling (high reorganization energy) gives rise to self-trapping, which inhibits the molecule's ability to switch. Nonetheless, there remains an expansive area in the tunneling-reorganization phase space where molecules can support adequate tunneling. Thus, the relationship between the tunneling matrix element and the reorganization energy affords significant leeway in the design of molecules viable for QCA applications.
Mukhopadhyay, Anirban; Mondal, Parimal; Barik, Jyotiskona; Chowdhury, S M; Ghosh, Tuhin; Hazra, Sugata
2015-06-01
The composition and assemblage of mangroves in the Bangladesh Sundarbans are changing systematically in response to several environmental factors. In order to understand the impact of the changing environmental conditions on the mangrove forest, species composition maps for the years 1985, 1995 and 2005 were studied. In the present study, 1985 and 1995 species zonation maps were considered as base data and the cellular automata-Markov chain model was run to predict the species zonation for the year 2005. The model output was validated against the actual dataset for 2005 and calibrated. Finally, using the model, mangrove species zonation maps for the years 2025, 2055 and 2105 have been prepared. The model was run with the assumption that the continuation of the current tempo and mode of drivers of environmental factors (temperature, rainfall, salinity change) of the last two decades will remain the same in the next few decades. Present findings show that the area distribution of the following species assemblages like Goran (Ceriops), Sundari (Heritiera), Passur (Xylocarpus), and Baen (Avicennia) would decrease in the descending order, whereas the area distribution of Gewa (Excoecaria), Keora (Sonneratia) and Kankra (Bruguiera) dominated assemblages would increase. The spatial distribution of projected mangrove species assemblages shows that more salt tolerant species will dominate in the future; which may be used as a proxy to predict the increase of salinity and its spatial variation in Sundarbans. Considering the present rate of loss of forest land, 17% of the total mangrove cover is predicted to be lost by the year 2105 with a significant loss of fresh water loving mangroves and related ecosystem services. This paper describes a unique approach to assess future changes in species composition and future forest zonation in mangroves under the 'business as usual' scenario of climate change.
International Nuclear Information System (INIS)
Sarkar, Chinmoy; Abbasi, S.A.
2006-01-01
The strategies to prevent accidents from occurring in a process industry, or to minimize the harm if an accident does take place, always revolve around forecasting the likely accidents and their impacts. Based on the likely frequency and severity of the accidents, resources are committed towards preventing the accidents. Nearly all techniques of ranking hazardous units, be it the hazard and operability studies, fault tree analysis, hazard indice, etc. - qualitative as well as quantitative - depend essentially on the assessment of the likely frequency and the likely harm accidents in different units may cause. This fact makes it exceedingly important that the forecasting the accidents and their likely impact is done as accurately as possible. In the present study we introduce a new approach to accident forecasting based on the discrete modeling paradigm of cellular automata. In this treatment an accident is modeled as a self-evolving phenomena, the impact of which is strongly influenced by the size, nature, and position of the environmental components which lie in the vicinity of the accident site. The outward propagation of the mass, energy and momentum from the accident epicenter is modeled as a fast diffusion process occurring in discrete space-time coordinates. The quantum of energy and material that would flow into each discrete space element (cell) due to the accidental release is evaluated and the degree of vulnerability posed to the receptors if present in the cell is measured at the end of each time element. This approach is able to effectively take into account the modifications in the flux of energy and material which occur as a result of the heterogeneous environment prevailing between the accident epicenter and the receptor. Consequently, more realistic accident scenarios are generated than possible with the prevailing techniques. The efficacy of the approach has been illustrated with case studies
An improved cellular automata model for train operation simulation with dynamic acceleration
Li, Wen-Jun; Nie, Lei
2018-03-01
Urban rail transit plays an important role in the urban public traffic because of its advantages of fast speed, large transport capacity, high safety, reliability and low pollution. This study proposes an improved cellular automaton (CA) model by considering the dynamic characteristic of the train acceleration to analyze the energy consumption and train running time. Constructing an effective model for calculating energy consumption to aid train operation improvement is the basis for studying and analyzing energy-saving measures for urban rail transit system operation.
Directory of Open Access Journals (Sweden)
Nicolai Lang, Hans Peter Büchler
2018-01-01
Full Text Available Active quantum error correction on topological codes is one of the most promising routes to long-term qubit storage. In view of future applications, the scalability of the used decoding algorithms in physical implementations is crucial. In this work, we focus on the one-dimensional Majorana chain and construct a strictly local decoder based on a self-dual cellular automaton. We study numerically and analytically its performance and exploit these results to contrive a scalable decoder with exponentially growing decoherence times in the presence of noise. Our results pave the way for scalable and modular designs of actively corrected one-dimensional topological quantum memories.
Effect of Water Flows on Ship Traffic in Narrow Water Channels Based on Cellular Automata
Directory of Open Access Journals (Sweden)
Hu Hongtao
2017-11-01
Full Text Available In narrow water channels, ship traffic may be affected by water flows and ship interactions. Studying their effects can help maritime authorities to establish appropriate management strategies. In this study, a two-lane cellular automation model is proposed. Further, the behavior of ship traffic is analyzed by setting different water flow velocities and considering ship interactions. Numerical experiment results show that the ship traffic density-flux relation is significantly different from the results obtained by classical models. Furthermore, due to ship interactions, the ship lane-change rate is influenced by the water flow to a certain degree.
Phase transitions enable computational universality in neuristor-based cellular automata
International Nuclear Information System (INIS)
Pickett, Matthew D; Stanley Williams, R
2013-01-01
We recently demonstrated that Mott memristors, two-terminal devices that exhibit threshold switching via an insulator to conductor phase transition, can serve as the active components necessary to build a neuristor, a biomimetic threshold spiking device. Here we extend those results to demonstrate, in simulation, neuristor-based circuits capable of performing general Boolean logic operations. We additionally show that these components can be used to construct a one-dimensional cellular automaton, rule 137, previously proven to be universal. This proof-of-principle shows that localized phase transitions can perform spiking computation, which is of particular interest for neuromorphic hardware. (paper)
Train flow chaos analysis based on an improved cellular automata model
International Nuclear Information System (INIS)
Meng, Xuelei; Xiang, Wanli; Jia, Limin; Xu, Jie
2015-01-01
To control the chaos in the railway traffic flow and offer valuable information for the dispatchers of the railway system, an improved cellular model is presented to detect and analyze the chaos in the traffic flow. We first introduce the working mechanism of moving block system, analyzing the train flow movement characteristics. Then we improve the cellular model on the evolution rules to adjust the train flow movement. We give the train operation steps from three cases: the trains running on a railway section, a train will arrive in a station and a train will departure from a station. We simulate 4 trains to run on a high speed section fixed with moving block system and record the distances between the neighbor trains and draw the Poincare section to analyze the chaos in the train operation. It is concluded that there is not only chaos but order in the train operation system with moving blocking system and they can interconvert to each other. The findings have the potential value in train dispatching system construction and offer supporting information for the daily dispatching work.
Hu, X.; Li, X.; Lu, L.
2017-12-01
Land use/cover change (LUCC) is an important subject in the research of global environmental change and sustainable development, while spatial simulation on land use/cover change is one of the key content of LUCC and is also difficult due to the complexity of the system. The cellular automata (CA) model had an irreplaceable role in simulating of land use/cover change process due to the powerful spatial computing power. However, the majority of current CA land use/cover models were binary-state model that could not provide more general information about the overall spatial pattern of land use/cover change. Here, a multi-state logistic-regression-based Markov cellular automata (MLRMCA) model and a multi-state artificial-neural-network-based Markov cellular automata (MANNMCA) model were developed and were used to simulate complex land use/cover evolutionary process in an arid region oasis city constrained by water resource and environmental policy change, the Zhangye city during the period of 1990-2010. The results indicated that the MANNMCA model was superior to MLRMCA model in simulated accuracy. These indicated that by combining the artificial neural network with CA could more effectively capture the complex relationships between the land use/cover change and a set of spatial variables. Although the MLRMCA model were also some advantages, the MANNMCA model was more appropriate for simulating complex land use/cover dynamics. The two proposed models were effective and reliable, and could reflect the spatial evolution of regional land use/cover changes. These have also potential implications for the impact assessment of water resources, ecological restoration, and the sustainable urban development in arid areas.
McCoy, Sophie J; Allesina, Stefano; Pfister, Catherine A
2016-03-16
Historical ecological datasets from a coastal marine community of crustose coralline algae (CCA) enabled the documentation of ecological changes in this community over 30 years in the Northeast Pacific. Data on competitive interactions obtained from field surveys showed concordance between the 1980s and 2013, yet also revealed a reduction in how strongly species interact. Here, we extend these empirical findings with a cellular automaton model to forecast ecological dynamics. Our model suggests the emergence of a new dominant competitor in a global change scenario, with a reduced role of herbivory pressure, or trophic control, in regulating competition among CCA. Ocean acidification, due to its energetic demands, may now instead play this role in mediating competitive interactions and thereby promote species diversity within this guild. © 2016 The Author(s).
Invariant strings and pattern-recognizing properties of one-dimensional cellular automata
International Nuclear Information System (INIS)
Jen, E.
1986-01-01
A cellular automaton is a discrete dynamical system whose evolution is governed by a deterministic rule involving local interactions. It is shown that given an arbitrary string of values and an arbitry neighborhood size (representing the range of interaction), a simple procedure can be used to find the fules of that neighborhood size under which the string is unvarian. The set of nearestneighbor rules for which invariant strings exist is completely specified, as is the set of strings invariant under each such rule. For any automaton rule, an associated ''filtering'' rule is defined for which the only attractors are spatial sequences consisting of concatenations of invariant strings. A result is provided defining the rule of minimum neighborhood size for which an arbitrrily chosen string is the unique invariant string. The applications of filtering rules to pttern recognition problems are discussed
Vergara-Blanco, J. E.; Leboeuf-Pasquier, J.; Benavides-Solorio, J. D. D.
2017-12-01
A simulation software that reproduces rainfall infiltration and runoff for a storm event in a particular forest area is presented. A cellular automaton is utilized to represent space and time. On the time scale, the simulation is composed by a sequence of discrete time steps. On the space scale, the simulation is composed of forest surface cells. The software takes into consideration rain intensity and length, individual forest cell soil absorption capacity evolution, and surface angle of inclination. The software is developed with the C++ programming language. The simulation is executed on a 100 ha area within La Primavera Forest in Jalisco, Mexico. Real soil texture for unburned terrain and high severity wildfire affected terrain is employed to recreate the specific infiltration profile. Historical rainfall data of a 92 minute event is used. The Horton infiltration equation is utilized for infiltration capacity calculation. A Digital Elevation Model (DEM) is employed to reproduce the surface topography. The DEM is displayed with a 3D mesh graph where individual surface cells can be observed. The plot colouring renders water content development at the cell level throughout the storm event. The simulation shows that the cumulative infiltration and runoff which take place at the surface cell level depend on the specific storm intensity, fluctuation and length, overall terrain topography, cell slope, and soil texture. Rainfall cumulative infiltration for unburned and high severity wildfire terrain are compared: unburned terrain exhibits a significantly higher amount of rainfall infiltration.It is concluded that a cellular automaton can be utilized with a C++ program to reproduce rainfall infiltration and runoff under diverse soil texture, topographic and rainfall conditions in a forest setting. This simulation is geared for an optimization program to pinpoint the locations of a series of forest land remediation efforts to support reforestation or to minimize runoff.
Cellular Automata Based Modeling for Evaluating Different Bus Stop Designs in China
Directory of Open Access Journals (Sweden)
Haoyang Ding
2015-01-01
Full Text Available A cellular automaton model is proposed to simulate mixed traffic flow composed of motor vehicles and bicycles near bus stops. Three typical types of bus stops which are common in China are considered in the model, including two types of curbside bus stops and one type of bus bay stops. Passenger transport capacity of three types of bus stops, which is applied to evaluate the bus stop design, is calculated based on the corresponding traffic flow rate. According to the simulation results, the flow rates of both motor vehicles and bicycles exhibit phase transition from free flow to the saturation one at the critical point. The results also show that the larger the interaction between motor vehicle and bicycle flow is near curbside bus stops, the more the value of saturated flows drops. Curbside bus stops are more suitable when the conflicts between two flows are small and the inflow rate of motor vehicles is low. On the contrary, bus bay stops should be applied due to their ability to reduce traffic conflicts. Findings of this study can provide useful suggestions on bus stop selection considering different inflow rate of motor vehicles and bicycles simultaneously.
Spatial patterns and scale freedom in Prisoner's Dilemma cellular automata with Pavlovian strategies
Fort, H.; Viola, S.
2005-01-01
A cellular automaton in which cells represent agents playing the Prisoner's Dilemma (PD) game following the simple 'win—stay, lose—shift' strategy is studied. Individuals with binary behaviour, such that they can either cooperate (C) or defect (D), play repeatedly with their neighbours (Von Neumann's and Moore's neighbourhoods). Their utilities in each round of the game are given by a rescaled pay-off matrix described by a single parameter τ, which measures the ratio of temptation to defect to reward for cooperation. Depending on the region of the parameter space τ, the system self-organizes—after a transient—into dynamical equilibrium states characterized by different definite fractions of C agents \\bar {c}_\\infty (two states for the von Neumann neighbourhood and four for the Moore neighbourhood). For some ranges of τ the cluster size distributions, the power spectra P(f) and the perimeter-area curves follow power law scalings. Percolation below threshold is also found for D agent clusters. We also analyse the asynchronous dynamics version of this model and compare results.
Pasculli, Antonio; Audisio, Chiara; Sciarra, Nicola
2017-12-01
In the alpine contest, the estimation of the rainfall (inflow) and the discharge (outflow) data are very important in order to, at least, analyse historical time series at catchment scale; determine the hydrological maximum and minimum estimate flood and drought frequency. Hydrological researches become a precious source of information for various human activities, in particular for land use management and planning. Many rainfall- runoff models have been proposed to reflect steady, gradually-varied flow condition inside a catchment. In these last years, the application of Reduced Complexity Models (RCM) has been representing an excellent alternative resource for evaluating the hydrological response of catchments, within a period of time up to decades. Hence, this paper is aimed at the discussion of the application of the research code CAESAR, based on cellular automaton (CA) approach, in order to evaluate the water and the sediment outputs from an alpine catchment (Soana, Italy), selected as test case. The comparison between the predicted numerical results, developed through parametric analysis, and the available measured data are discussed. Finally, the analysis of a numerical estimate of the sediment budget over ten years is presented. The necessity of a fast, but reliable numerical support when the measured data are not so easily accessible, as in Alpine catchments, is highlighted.
Directory of Open Access Journals (Sweden)
Yangzexi Liu
2017-01-01
Full Text Available The technology of autonomous vehicles is expected to revolutionize the operation of road transport systems. The penetration rate of autonomous vehicles will be low at the early stage of their deployment. It is a challenge to explore the effects of autonomous vehicles and their penetration on heterogeneous traffic flow dynamics. This paper aims to investigate this issue. An improved cellular automaton was employed as the modeling platform for our study. In particular, two sets of rules for lane changing were designed to address mild and aggressive lane changing behavior. With extensive simulation studies, we obtained some promising results. First, the introduction of autonomous vehicles to road traffic could considerably improve traffic flow, particularly the road capacity and free-flow speed. And the level of improvement increases with the penetration rate. Second, the lane-changing frequency between neighboring lanes evolves with traffic density along a fundamental-diagram-like curve. Third, the impacts of autonomous vehicles on the collective traffic flow characteristics are mainly related to their smart maneuvers in lane changing and car following, and it seems that the car-following impact is more pronounced.
Traffic dynamics around weaving section influenced by accident: Cellular automata approach
Kong, Lin-Peng; Li, Xin-Gang; Lam, William H. K.
2015-07-01
The weaving section, as a typical bottleneck, is one source of vehicle conflicts and an accident-prone area. Traffic accident will block lanes and the road capacity will be reduced. Several models have been established to study the dynamics around traffic bottlenecks. However, little attention has been paid to study the complex traffic dynamics influenced by the combined effects of bottleneck and accident. This paper presents a cellular automaton model to characterize accident-induced traffic behavior around the weaving section. Some effective control measures are proposed and verified for traffic management under accident condition. The total flux as a function of inflow rates, the phase diagrams, the spatial-temporal diagrams, and the density and velocity profiles are presented to analyze the impact of accident. It was shown that the proposed control measures for weaving traffic can improve the capacity of weaving section under both normal and accident conditions; the accidents occurring on median lane in the weaving section are more inclined to cause traffic jam and reduce road capacity; the capacity of weaving section will be greatly reduced when the accident happens downstream the weaving section.
Finite automata over algebraic structures: models and some methods of analysis
Directory of Open Access Journals (Sweden)
Volodymyr V. Skobelev
2015-10-01
Full Text Available In this paper some results of research in two new trends of finite automata theory are presented. For understanding the value and the aim of these researches some short retrospective analysis of development of finite automata theory is given. The first trend deals with families of finite automata defined via recurrence relations on algebraic structures over finite rings. The problem of design of some algorithm that simulates with some accuracy any element of given family of automata is investigated. Some general scheme for design of families of hash functions defined by outputless automata is elaborated. Computational security of these families of hash functions is analyzed. Automata defined on varieties with some algebra are presented and their homomorphisms are characterized. Special case of these automata, namely automata on elliptic curves, are investigated in detail. The second trend deals with quantum automata. Languages accepted by some basic models of quantum automata under supposition that unitary operators associated with input alphabet commute each with the others are characterized.
Directory of Open Access Journals (Sweden)
Jinyao Lin
2018-04-01
Full Text Available The emergence of Light Rail Transit systems (LRTs could exert considerable impacts on sustainable urban development. It is crucial to predict the potential land use changes since LRTs are being increasingly built throughout the world. While various land use and land cover change (LUCC models have been developed during the past two decades, the basic assumption for LUCC prediction is the continuation of present trends in land use development. It is therefore unreasonable to predict potential urban land use changes associated with LRTs simply based on earlier trends because the impacts of LRT investment may vary greatly over time. To tackle this challenge, our study aims to share the experiences from previous lines with newly planned lines. Dongguan, whose government decided to build LRTs around 2008, was selected as the study area. First, we assessed the impacts of this city’s first LRT (Line R2 on three urban land use types (i.e., industrial development, commercial and residential development, and rural development at different periods. The results indicate that Line R2 exerted a negative impact on industrial development and rural development, but a positive impact on commercial and residential development during the planning stage of this line. Second, such spatial impacts (the consequent land use changes during this stage were simulated by using artificial neural network cellular automata. More importantly, we further predicted the potential impacts of Line R1, which is assumed to be a newly planned line, based on the above calibrated model and a traditional method respectively. The comparisons between them demonstrate the effectiveness of our method, which can easily take advantage of the experiences from other LRTs. The proposed method is expected to provide technical support for sustainable urban and transportation planning.
Naghibi, Fereydoun; Delavar, Mahmoud Reza; Pijanowski, Bryan
2016-12-14
Cellular Automata (CA) is one of the most common techniques used to simulate the urbanization process. CA-based urban models use transition rules to deliver spatial patterns of urban growth and urban dynamics over time. Determining the optimum transition rules of the CA is a critical step because of the heterogeneity and nonlinearities existing among urban growth driving forces. Recently, new CA models integrated with optimization methods based on swarm intelligence algorithms were proposed to overcome this drawback. The Artificial Bee Colony (ABC) algorithm is an advanced meta-heuristic swarm intelligence-based algorithm. Here, we propose a novel CA-based urban change model that uses the ABC algorithm to extract optimum transition rules. We applied the proposed ABC-CA model to simulate future urban growth in Urmia (Iran) with multi-temporal Landsat images from 1997, 2006 and 2015. Validation of the simulation results was made through statistical methods such as overall accuracy, the figure of merit and total operating characteristics (TOC). Additionally, we calibrated the CA model by ant colony optimization (ACO) to assess the performance of our proposed model versus similar swarm intelligence algorithm methods. We showed that the overall accuracy and the figure of merit of the ABC-CA model are 90.1% and 51.7%, which are 2.9% and 8.8% higher than those of the ACO-CA model, respectively. Moreover, the allocation disagreement of the simulation results for the ABC-CA model is 9.9%, which is 2.9% less than that of the ACO-CA model. Finally, the ABC-CA model also outperforms the ACO-CA model with fewer quantity and allocation errors and slightly more hits.
Mizas, Ch; Sirakoulis, G Ch; Mardiris, V; Karafyllidis, I; Glykos, N; Sandaltzopoulos, R
2008-04-01
Change of DNA sequence that fuels evolution is, to a certain extent, a deterministic process because mutagenesis does not occur in an absolutely random manner. So far, it has not been possible to decipher the rules that govern DNA sequence evolution due to the extreme complexity of the entire process. In our attempt to approach this issue we focus solely on the mechanisms of mutagenesis and deliberately disregard the role of natural selection. Hence, in this analysis, evolution refers to the accumulation of genetic alterations that originate from mutations and are transmitted through generations without being subjected to natural selection. We have developed a software tool that allows modelling of a DNA sequence as a one-dimensional cellular automaton (CA) with four states per cell which correspond to the four DNA bases, i.e. A, C, T and G. The four states are represented by numbers of the quaternary number system. Moreover, we have developed genetic algorithms (GAs) in order to determine the rules of CA evolution that simulate the DNA evolution process. Linear evolution rules were considered and square matrices were used to represent them. If DNA sequences of different evolution steps are available, our approach allows the determination of the underlying evolution rule(s). Conversely, once the evolution rules are deciphered, our tool may reconstruct the DNA sequence in any previous evolution step for which the exact sequence information was unknown. The developed tool may be used to test various parameters that could influence evolution. We describe a paradigm relying on the assumption that mutagenesis is governed by a near-neighbour-dependent mechanism. Based on the satisfactory performance of our system in the deliberately simplified example, we propose that our approach could offer a starting point for future attempts to understand the mechanisms that govern evolution. The developed software is open-source and has a user-friendly graphical input interface.
Probabilistic Reversible Automata and Quantum Automata
Golovkins, Marats; Kravtsev, Maksim
2002-01-01
To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.
Fan, Linjun; Tang, Jun; Ling, Yunxiang; Li, Benxian
2014-01-01
This paper is concerned with the dynamic evolution analysis and quantitative measurement of primary factors that cause service inconsistency in service-oriented distributed simulation applications (SODSA). Traditional methods are mostly qualitative and empirical, and they do not consider the dynamic disturbances among factors in service's evolution behaviors such as producing, publishing, calling, and maintenance. Moreover, SODSA are rapidly evolving in terms of large-scale, reusable, compositional, pervasive, and flexible features, which presents difficulties in the usage of traditional analysis methods. To resolve these problems, a novel dynamic evolution model extended hierarchical service-finite state automata (EHS-FSA) is constructed based on finite state automata (FSA), which formally depict overall changing processes of service consistency states. And also the service consistency evolution algorithms (SCEAs) based on EHS-FSA are developed to quantitatively assess these impact factors. Experimental results show that the bad reusability (17.93% on average) is the biggest influential factor, the noncomposition of atomic services (13.12%) is the second biggest one, and the service version's confusion (1.2%) is the smallest one. Compared with previous qualitative analysis, SCEAs present good effectiveness and feasibility. This research can guide the engineers of service consistency technologies toward obtaining a higher level of consistency in SODSA.
Directory of Open Access Journals (Sweden)
Linjun Fan
2014-01-01
Full Text Available This paper is concerned with the dynamic evolution analysis and quantitative measurement of primary factors that cause service inconsistency in service-oriented distributed simulation applications (SODSA. Traditional methods are mostly qualitative and empirical, and they do not consider the dynamic disturbances among factors in service’s evolution behaviors such as producing, publishing, calling, and maintenance. Moreover, SODSA are rapidly evolving in terms of large-scale, reusable, compositional, pervasive, and flexible features, which presents difficulties in the usage of traditional analysis methods. To resolve these problems, a novel dynamic evolution model extended hierarchical service-finite state automata (EHS-FSA is constructed based on finite state automata (FSA, which formally depict overall changing processes of service consistency states. And also the service consistency evolution algorithms (SCEAs based on EHS-FSA are developed to quantitatively assess these impact factors. Experimental results show that the bad reusability (17.93% on average is the biggest influential factor, the noncomposition of atomic services (13.12% is the second biggest one, and the service version’s confusion (1.2% is the smallest one. Compared with previous qualitative analysis, SCEAs present good effectiveness and feasibility. This research can guide the engineers of service consistency technologies toward obtaining a higher level of consistency in SODSA.
Eibinger, Manuel; Zahel, Thomas; Ganner, Thomas; Plank, Harald; Nidetzky, Bernd
2016-01-01
Enzymatic hydrolysis of cellulose involves the spatiotemporally correlated action of distinct polysaccharide chain cleaving activities confined to the surface of an insoluble substrate. Because cellulases differ in preference for attacking crystalline compared to amorphous cellulose, the spatial distribution of structural order across the cellulose surface imposes additional constraints on the dynamic interplay between the enzymes. Reconstruction of total system behavior from single-molecule activity parameters is a longstanding key goal in the field. We have developed a stochastic, cellular automata-based modeling approach to describe degradation of cellulosic material by a cellulase system at single-molecule resolution. Substrate morphology was modeled to represent the amorphous and crystalline phases as well as the different spatial orientations of the polysaccharide chains. The enzyme system model consisted of an internally chain-cleaving endoglucanase (EG) as well as two processively acting, reducing and non-reducing chain end-cleaving cellobiohydrolases (CBHs). Substrate preference (amorphous: EG, CBH II; crystalline: CBH I) and characteristic frequencies for chain cleavage, processive movement, and dissociation were assigned from biochemical data. Once adsorbed, enzymes were allowed to reach surface-exposed substrate sites through "random-walk" lateral diffusion or processive motion. Simulations revealed that slow dissociation of processive enzymes at obstacles obstructing further movement resulted in local jamming of the cellulases, with consequent delay in the degradation of the surface area affected. Exploiting validation against evidence from atomic force microscopy imaging as a unique opportunity opened up by the modeling approach, we show that spatiotemporal characteristics of cellulose surface degradation by the system of synergizing cellulases were reproduced quantitatively at the nanometer resolution of the experimental data. This in turn gave
Fijany, Amir; Toomarian, Benny N.
2000-01-01
There has been significant improvement in the performance of VLSI devices, in terms of size, power consumption, and speed, in recent years and this trend may also continue for some near future. However, it is a well known fact that there are major obstacles, i.e., physical limitation of feature size reduction and ever increasing cost of foundry, that would prevent the long term continuation of this trend. This has motivated the exploration of some fundamentally new technologies that are not dependent on the conventional feature size approach. Such technologies are expected to enable scaling to continue to the ultimate level, i.e., molecular and atomistic size. Quantum computing, quantum dot-based computing, DNA based computing, biologically inspired computing, etc., are examples of such new technologies. In particular, quantum-dots based computing by using Quantum-dot Cellular Automata (QCA) has recently been intensely investigated as a promising new technology capable of offering significant improvement over conventional VLSI in terms of reduction of feature size (and hence increase in integration level), reduction of power consumption, and increase of switching speed. Quantum dot-based computing and memory in general and QCA specifically, are intriguing to NASA due to their high packing density (10(exp 11) - 10(exp 12) per square cm ) and low power consumption (no transfer of current) and potentially higher radiation tolerant. Under Revolutionary Computing Technology (RTC) Program at the NASA/JPL Center for Integrated Space Microelectronics (CISM), we have been investigating the potential applications of QCA for the space program. To this end, exploiting the intrinsic features of QCA, we have designed novel QCA-based circuits for co-planner (i.e., single layer) and compact implementation of a class of data permutation matrices, a class of interconnection networks, and a bit-serial processor. Building upon these circuits, we have developed novel algorithms and QCA
International Nuclear Information System (INIS)
Cirillo, Emilio N.M.; Louis, Pierre-Yves; Ruszel, Wioletta M.; Spitoni, Cristian
2014-01-01
Cellular Automata are discrete-time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata (PCA), are discrete time Markov chains on lattice with finite single-cell states whose distinguishing feature is the parallel character of the updating rule. We study the ground states of the Hamiltonian and the low-temperature phase diagram of the related Gibbs measure naturally associated with a class of reversible PCA, called the cross PCA. In such a model the updating rule of a cell depends indeed only on the status of the five cells forming a cross centered at the original cell itself. In particular, it depends on the value of the center spin (self-interaction). The goal of the paper is that of investigating the role played by the self-interaction parameter in connection with the ground states of the Hamiltonian and the low-temperature phase diagram of the Gibbs measure associated with this particular PCA
Iris segmentation using an edge detector based on fuzzy sets theory and cellular learning automata.
Ghanizadeh, Afshin; Abarghouei, Amir Atapour; Sinaie, Saman; Saad, Puteh; Shamsuddin, Siti Mariyam
2011-07-01
Iris-based biometric systems identify individuals based on the characteristics of their iris, since they are proven to remain unique for a long time. An iris recognition system includes four phases, the most important of which is preprocessing in which the iris segmentation is performed. The accuracy of an iris biometric system critically depends on the segmentation system. In this paper, an iris segmentation system using edge detection techniques and Hough transforms is presented. The newly proposed edge detection system enhances the performance of the segmentation in a way that it performs much more efficiently than the other conventional iris segmentation methods.
QM Automata: A New Class of Restricted Quantum Membrane Automata.
Giannakis, Konstantinos; Singh, Alexandros; Kastampolidou, Kalliopi; Papalitsas, Christos; Andronikos, Theodore
2017-01-01
The term "Unconventional Computing" describes the use of non-standard methods and models in computing. It is a recently established field, with many interesting and promising results. In this work we combine notions from quantum computing with aspects of membrane computing to define what we call QM automata. Specifically, we introduce a variant of quantum membrane automata that operate in accordance with the principles of quantum computing. We explore the functionality and capabilities of the QM automata through indicative examples. Finally we suggest future directions for research on QM automata.
Tanase, Mihai; Waliszewski, Przemyslaw
2015-12-01
We propose a novel approach for the quantitative evaluation of aggressiveness in prostate carcinomas. The spatial distribution of cancer cell nuclei was characterized by the global spatial fractal dimensions D0, D1, and D2. Two hundred eighteen prostate carcinomas were stratified into the classes of equivalence using results of ROC analysis. A simulation of the cellular automata mix defined a theoretical frame for a specific geometric representation of the cell nuclei distribution called a local structure correlation diagram (LSCD). The LSCD and dispersion Hd were computed for each carcinoma. Data mining generated some quantitative criteria describing tumor aggressiveness. Alterations in tumor architecture along progression were associated with some changes in both shape and the quantitative characteristics of the LSCD consistent with those in the automata mix model. Low-grade prostate carcinomas with low complexity and very low biological aggressiveness are defined by the condition D0 1.764 and Hd < 38. The novel homogeneity measure Hd identifies carcinomas with very low aggressiveness within the class of complexity C1 or carcinomas with very high aggressiveness in the class C7. © 2015 Wiley Periodicals, Inc.
Mendonça, J Ricardo G; Gevorgyan, Yeva
2017-05-01
We investigate one-dimensional elementary probabilistic cellular automata (PCA) whose dynamics in first-order mean-field approximation yields discrete logisticlike growth models for a single-species unstructured population with nonoverlapping generations. Beginning with a general six-parameter model, we find constraints on the transition probabilities of the PCA that guarantee that the ensuing approximations make sense in terms of population dynamics and classify the valid combinations thereof. Several possible models display a negative cubic term that can be interpreted as a weak Allee factor. We also investigate the conditions under which a one-parameter PCA derived from the more general six-parameter model can generate valid population growth dynamics. Numerical simulations illustrate the behavior of some of the PCA found.
Scattering rules in soliton cellular automata associated with Uq(D(1)n)-crystal Bn,1
International Nuclear Information System (INIS)
Mohamad, Mahathir bin
2012-01-01
By means of the crystal theory, we study a class of automata associated with U q (D (1) n )-crystal B n,1 . They have a commuting family of time evolutions, and solitons of length l are labeled by U q (A (1) n−1 )-crystal B 2,l A . The scattering rule of two solitons of lengths l 1 and l 2 (l 1 > l 2 ) including the phase shift is identified with the combinatorial R-matrix for the U q (A (1) n −1 )-crystal B 2,l 2 A ⊗B 2,l 1 A . (paper)
Iovine, G.; D'Ambrosio, D.; Di Gregorio, S.
2005-03-01
In modelling complex a-centric phenomena which evolve through local interactions within a discrete time-space, cellular automata (CA) represent a valid alternative to standard solution methods based on differential equations. Flow-type phenomena (such as lava flows, pyroclastic flows, earth flows, and debris flows) can be viewed as a-centric dynamical systems, and they can therefore be properly investigated in CA terms. SCIDDICA S 4a is the last release of a two-dimensional hexagonal CA model for simulating debris flows characterised by strong inertial effects. S 4a has been obtained by progressively enriching an initial simplified model, originally derived for simulating very simple cases of slow-moving flow-type landslides. Using an empirical strategy, in S 4a, the inertial character of the flowing mass is translated into CA terms by means of local rules. In particular, in the transition function of the model, the distribution of landslide debris among the cells is obtained through a double cycle of computation. In the first phase, the inertial character of the landslide debris is taken into account by considering indicators of momentum. In the second phase, any remaining debris in the central cell is distributed among the adjacent cells, according to the principle of maximum possible equilibrium. The complexities of the model and of the phenomena to be simulated suggested the need for an automated technique of evaluation for the determination of the best set of global parameters. Accordingly, the model is calibrated using a genetic algorithm and by considering the May 1998 Curti-Sarno (Southern Italy) debris flow. The boundaries of the area affected by the debris flow are simulated well with the model. Errors computed by comparing the simulations with the mapped areal extent of the actual landslide are smaller than those previously obtained without genetic algorithms. As the experiments have been realised in a sequential computing environment, they could be
F.C. Gruau; J.T. Tromp (John)
1999-01-01
textabstractWe consider the problem of establishing gravity in cellular automata. In particular, when cellular automata states can be partitioned into empty, particle, and wall types, with the latter enclosing rectangular areas, we desire rules that will make the particles fall down and pile up on
Beyond Language Equivalence on Visibly Pushdown Automata
DEFF Research Database (Denmark)
Srba, Jiri
2009-01-01
We study (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied...... preorders and equivalences like simulation, completed simulation, ready simulation, 2-nested simulation preorders/equivalences and bisimulation equivalence. Our main results are that all the mentioned equivalences and preorders are EXPTIME-complete on visibly pushdown automata, PSPACE-complete on visibly...... one-counter automata and P-complete on visibly BPA. Our PSPACE lower bound for visibly one-counter automata improves also the previously known DP-hardness results for ordinary one-counter automata and one-counter nets. Finally, we study regularity checking problems for visibly pushdown automata...
International Nuclear Information System (INIS)
Dmitrievskij, S.G.; Gornushkin, Yu.A.; Ososkov, G.A.
2005-01-01
A neural-network (NN) approach for neutrino interaction vertex reconstruction in the OPERA experiment with the help of the Target Tracker (TT) detector is described. A feed-forward NN with the standard back propagation option is used. The energy functional minimization of the network is performed by the method of conjugate gradients. Data preprocessing by means of cellular automaton algorithm is performed. The Hough transform is applied for muon track determination and the robust fitting method is used for shower axis reconstruction. A comparison of the proposed approach with earlier studies, based on the use of the neural network package SNNS, shows their similar performance. The further development of the approach is underway
Machineni, Lakshmi; Rajapantul, Anil; Nandamuri, Vandana; Pawar, Parag D
2017-03-01
The resistance of bacterial biofilms to antibiotic treatment has been attributed to the emergence of structurally heterogeneous microenvironments containing metabolically inactive cell populations. In this study, we use a three-dimensional individual-based cellular automata model to investigate the influence of nutrient availability and quorum sensing on microbial heterogeneity in growing biofilms. Mature biofilms exhibited at least three structurally distinct strata: a high-volume, homogeneous region sandwiched between two compact sections of high heterogeneity. Cell death occurred preferentially in layers in close proximity to the substratum, resulting in increased heterogeneity in this section of the biofilm; the thickness and heterogeneity of this lowermost layer increased with time, ultimately leading to sloughing. The model predicted the formation of metabolically dormant cellular microniches embedded within faster-growing cell clusters. Biofilms utilizing quorum sensing were more heterogeneous compared to their non-quorum sensing counterparts, and resisted sloughing, featuring a cell-devoid layer of EPS atop the substratum upon which the remainder of the biofilm developed. Overall, our study provides a computational framework to analyze metabolic diversity and heterogeneity of biofilm-associated microorganisms and may pave the way toward gaining further insights into the biophysical mechanisms of antibiotic resistance.
Automata and automata mappings of semigroups
Plotkin, Boris; Plotkin, Tatjana
2015-01-01
The paper is devoted to two types of algebraic models of automata. The usual (first type) model leads to the developed decomposition theory (Krohn-Rhodes theory). We introduce another type of automata model and study how these automata are related to cascade connections of automata of the first type. The introduced automata play a significant role in group theory and, hopefully, in the theory of formal languages.
Tsukerblat, Boris; Palii, Andrew; Clemente-Juan, Juan Modesto; Coronado, Eugenio
2015-10-07
Our interest in this article is prompted by the vibronic problem of charge polarized states in the four-dot molecular quantum cellular automata (mQCA), a paradigm for nanoelectronics, in which binary information is encoded in charge configuration of the mQCA cell. Here, we report the evaluation of the electronic levels and adiabatic potentials of mixed-valence (MV) tetra-ruthenium (2Ru(ii) + 2Ru(iii)) derivatives (assembled as two coupled Creutz-Taube complexes) for which molecular implementations of quantum cellular automata (QCA) was proposed. The cell based on this molecule includes two holes shared among four spinless sites and correspondingly we employ the model which takes into account the two relevant electron transfer processes (through the side and through the diagonal of the square) as well as the difference in Coulomb energies for different instant positions of localization of the hole pair. The combined Jahn-Teller (JT) and pseudo JT vibronic coupling is treated within the conventional Piepho-Krauzs-Schatz model adapted to a bi-electronic MV species with the square-planar topology. The adiabatic potentials are evaluated for the low lying Coulomb levels in which the antipodal sites are occupied, the case just actual for utilization in mQCA. The conditions for the vibronic self-trapping in spin-singlet and spin-triplet states are revealed in terms of the two actual transfer pathways parameters and the strength of the vibronic coupling. Spin related effects in degrees of the localization which are found for spin-singlet and spin-triplet states are discussed. The polarization of the cell is evaluated and we demonstrate how the partial delocalization caused by the joint action of the vibronic coupling and electron transfer processes influences polarization of a four-dot cell. The results obtained within the adiabatic approach are compared with those based on the numerical solution of the dynamic vibronic problem. Finally, the Coulomb interaction between
Rafi Ahamed, Shaik
2016-01-01
In biomedical, data security is the most expensive resource for wireless body area network applications. Cryptographic algorithms are used in order to protect the information against unauthorised access. Advanced encryption standard (AES) cryptographic algorithm plays a vital role in telemedicine applications. The authors propose a novel approach for design of substitution bytes (S-Box) using second-order reversible one-dimensional cellular automata (RCA2) as a replacement to the classical look-up-table (LUT) based S-Box used in AES algorithm. The performance of proposed RCA2 based S-Box and conventional LUT based S-Box is evaluated in terms of security using the cryptographic properties such as the nonlinearity, correlation immunity bias, strict avalanche criteria and entropy. Moreover, it is also shown that RCA2 based S-Boxes are dynamic in nature, invertible and provide high level of security. Further, it is also found that the RCA2 based S-Box have comparatively better performance than that of conventional LUT based S-Box. PMID:27733924
International Nuclear Information System (INIS)
Kumar, Rohit; Ghosh, Bahniman; Gupta, Shoubhik
2015-01-01
This paper proposes a novel design paradigm for circuits designed in quantum dot cellular automata (QCA) technology. Previously reported QCA circuits in the literature have generally been designed in a single layer which is the main logical block in which the inverter and majority gate are on the base layer, except for the parts where multilayer wire crossing was used. In this paper the concept of multilayer wire crossing has been extended to design logic gates in multilayers. Using a 5-input majority gate in a multilayer, a 1-bit and 2-bit adder have been designed in the proposed multilayer gate design paradigm. A comparison has been made with some adders reported previously in the literature and it has been shown that circuits designed in the proposed design paradigm are much more efficient in terms of area, the requirement of QCA cells in the design and the input–output delay of the circuit. Over all, the availability of one additional spatial dimension makes the design process much more flexible and there is scope for the customizability of logic gate designs to make the circuit compact. (paper)
Directory of Open Access Journals (Sweden)
Ken Tokunaga
2010-08-01
Full Text Available Dynamic behavior of signal transmission through metal complexes [L5M-BL-ML5]5+ (M=Fe, Ru, Os, BL=pyrazine (py, 4,4’-bipyridine (bpy, L=NH3, which are simplified models of the molecular quantum-dot cellular automata (molecular QCA, is discussed from the viewpoint of one-electron theory, density functional theory. It is found that for py complexes, the signal transmission time (tst is Fe(0.6 fs < Os(0.7 fs < Ru(1.1 fs and the signal amplitude (A is Fe(0.05 e < Os(0.06 e < Ru(0.10 e. For bpy complexes, tst and A are Fe(1.4 fs < Os(1.7 fs < Ru(2.5 fs and Os(0.11 e < Ru(0.12 e
Qiu, Menglong; Wang, Qi; Li, Fangbai; Chen, Junjian; Yang, Guoyi; Liu, Liming
2016-01-01
A customized logistic-based cellular automata (CA) model was developed to simulate changes in heavy metal contamination (HMC) in farmland soils of Dongguan, a manufacturing center in Southern China, and to discover the relationship between HMC and related explanatory variables (continuous and categorical). The model was calibrated through the simulation and validation of HMC in 2012. Thereafter, the model was implemented for the scenario simulation of development alternatives for HMC in 2022. The HMC in 2002 and 2012 was determined through soil tests and cokriging. Continuous variables were divided into two groups by odds ratios. Positive variables (odds ratios >1) included the Nemerow synthetic pollution index in 2002, linear drainage density, distance from the city center, distance from the railway, slope, and secondary industrial output per unit of land. Negative variables (odds ratios <1) included elevation, distance from the road, distance from the key polluting enterprises, distance from the town center, soil pH, and distance from bodies of water. Categorical variables, including soil type, parent material type, organic content grade, and land use type, also significantly influenced HMC according to Wald statistics. The relative operating characteristic and kappa coefficients were 0.91 and 0.64, respectively, which proved the validity and accuracy of the model. The scenario simulation shows that the government should not only implement stricter environmental regulation but also strengthen the remediation of the current polluted area to effectively mitigate HMC.
Chai, Chen; Wong, Yiik Diew; Wang, Xuesong
2017-07-01
This paper proposes a simulation-based approach to estimate safety impact of driver cognitive failures and driving errors. Fuzzy Logic, which involves linguistic terms and uncertainty, is incorporated with Cellular Automata model to simulate decision-making process of right-turn filtering movement at signalized intersections. Simulation experiments are conducted to estimate the relationships between cognitive failures and driving errors with safety performance. Simulation results show Different types of cognitive failures are found to have varied relationship with driving errors and safety performance. For right-turn filtering movement, cognitive failures are more likely to result in driving errors with denser conflicting traffic stream. Moreover, different driving errors are found to have different safety impacts. The study serves to provide a novel approach to linguistically assess cognitions and replicate decision-making procedures of the individual driver. Compare to crash analysis, the proposed FCA model allows quantitative estimation of particular cognitive failures, and the impact of cognitions on driving errors and safety performance. Copyright © 2017 Elsevier Ltd. All rights reserved.
Gangadari, Bhoopal Rao; Rafi Ahamed, Shaik
2016-09-01
In biomedical, data security is the most expensive resource for wireless body area network applications. Cryptographic algorithms are used in order to protect the information against unauthorised access. Advanced encryption standard (AES) cryptographic algorithm plays a vital role in telemedicine applications. The authors propose a novel approach for design of substitution bytes (S-Box) using second-order reversible one-dimensional cellular automata (RCA 2 ) as a replacement to the classical look-up-table (LUT) based S-Box used in AES algorithm. The performance of proposed RCA 2 based S-Box and conventional LUT based S-Box is evaluated in terms of security using the cryptographic properties such as the nonlinearity, correlation immunity bias, strict avalanche criteria and entropy. Moreover, it is also shown that RCA 2 based S-Boxes are dynamic in nature, invertible and provide high level of security. Further, it is also found that the RCA 2 based S-Box have comparatively better performance than that of conventional LUT based S-Box.
Interface Input/Output Automata
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand; Nyman, Ulrik; Wasowski, Andrzej
2006-01-01
Building on the theory of interface automata by de Alfaro and Henzinger we design an interface language for Lynch’s I/O, a popular formalism used in the development of distributed asynchronous systems, not addressed by previous interface research. We introduce an explicit separation of assumptions...... a method for solving systems of relativized behavioral inequalities as used in our setup and draw a formal correspondence between our work and interface automata....
Reaction-Diffusion Automata Phenomenology, Localisations, Computation
Adamatzky, Andrew
2013-01-01
Reaction-diffusion and excitable media are amongst most intriguing substrates. Despite apparent simplicity of the physical processes involved the media exhibit a wide range of amazing patterns: from target and spiral waves to travelling localisations and stationary breathing patterns. These media are at the heart of most natural processes, including morphogenesis of living beings, geological formations, nervous and muscular activity, and socio-economic developments. This book explores a minimalist paradigm of studying reaction-diffusion and excitable media using locally-connected networks of finite-state machines: cellular automata and automata on proximity graphs. Cellular automata are marvellous objects per se because they show us how to generate and manage complexity using very simple rules of dynamical transitions. When combined with the reaction-diffusion paradigm the cellular automata become an essential user-friendly tool for modelling natural systems and designing future and emergent computing arch...
NEVEN, Frank
2002-01-01
We survey some recent developments in the broad area of automata and logic which are motivated by the advent of XML. In particular, we consider unranked tree automata, tree-walking automata, and automata over infinite alphabets. We focus on their connection with logic and on questions imposed by XML.
Complementation of coalgebra automata
Kissig, C.; Venema, Y.
2009-01-01
Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This coalgebraic perspective on automata lays foundation to a universal theory of automata operating on infinite models of computation.
Directory of Open Access Journals (Sweden)
Bhagawat Rimal
2017-09-01
Full Text Available Spatial–temporal analysis of land-use/land-cover (LULC change as well as the monitoring and modeling of urban expansion are essential for the planning and management of urban environments. Such environments reflect the economic conditions and quality of life of the individual country. Urbanization is generally influenced by national laws, plans and policies and by power, politics and poor governance in many less-developed countries. Remote sensing tools play a vital role in monitoring LULC change and measuring the rate of urbanization at both the local and global levels. The current study evaluated the LULC changes and urban expansion of Jhapa district of Nepal. The spatial–temporal dynamics of LULC were identified using six time-series atmospherically-corrected surface reflectance Landsat images from 1989 to 2016. A hybrid cellular automata Markov chain (CA–Markov model was used to simulate future urbanization by 2026 and 2036. The analysis shows that the urban area has increased markedly and is expected to continue to grow rapidly in the future, whereas the area for agriculture has decreased. Meanwhile, forest and shrub areas have remained almost constant. Seasonal rainfall and flooding routinely cause predictable transformation of sand, water bodies and cultivated land from one type to another. The results suggest that the use of Landsat time-series archive images and the CA–Markov model are the best options for long-term spatiotemporal analysis and achieving an acceptable level of prediction accuracy. Furthermore, understanding the relationship between the spatiotemporal dynamics of urbanization and LULC change and simulating future landscape change is essential, as they are closely interlinked. These scientific findings of past, present and future land-cover scenarios of the study area will assist planners/decision-makers to formulate sustainable urban development and environmental protection plans and will remain a scientific asset
Learning automata an introduction
Narendra, Kumpati S
2012-01-01
This self-contained introductory text on the behavior of learning automata focuses on how a sequential decision-maker with a finite number of choices responds in a random environment. Topics include fixed structure automata, variable structure stochastic automata, convergence, 0 and S models, nonstationary environments, interconnected automata and games, and applications of learning automata. A must for all students of stochastic algorithms, this treatment is the work of two well-known scientists and is suitable for a one-semester graduate course in automata theory and stochastic algorithms.
Clemente-Juan, Juan Modesto; Palii, Andrew; Coronado, Eugenio; Tsukerblat, Boris
2016-08-09
In this article, we focus on the electron-vibrational problem of the tetrameric mixed-valence (MV) complexes proposed for implementation as four-dot molecular quantum cellular automata (mQCA).1 Although the adiabatic approximation explored in ref 2 is an appropriate tool for the qualitative analysis of the basic characteristics of mQCA, like vibronic trapping of the electrons encoding binary information and cell-cell response, it loses its accuracy providing moderate vibronic coupling and fails in the description of the discrete pattern of the vibronic levels. Therefore, a precise solution of the quantum-mechanical vibronic problem is of primary importance for the evaluation of the shapes of the electron transfer optical absorption bands and quantitative analysis of the main parameters of tetrameric quantum cells. Here, we go beyond the Born-Oppenheimer paradigm and present a solution of the quantum-mechanical pseudo Jahn-Teller (JT) vibronic problem in bielectronic MV species (exemplified by the tetra-ruthenium complexes) based on the recently developed symmetry-assisted approach.3,4 The mathematical approach to the vibronic eigenproblem takes into consideration the point symmetry basis, and therefore, the total matrix of the JT Hamiltonian is blocked to the maximum extent. The submatrices correspond to the irreducible representations (irreps) of the point group. With this tool, we also extend the theory of the mQCA cell beyond the limit of prevailing Coulomb repulsion in the electronic pair (adopted in ref 2), and therefore, the general pseudo-JT problems for spin-singlet ((1)B1g, 2(1)A1g, (1)B2g, (1)Eu) ⊗ (b1g + eu) and spin-triplet states ((3)A2g, (3)B1g, 2(3)Eu) ⊗ (b1g + eu) in a square-planar bielectronic system are solved. The obtained symmetry-adapted electron-vibrational functions are employed for the calculation of the profiles (shape functions) of the charge transfer absorption bands in the tetrameric MV complexes and for the discussion of the
Directory of Open Access Journals (Sweden)
G. Iovine
2003-01-01
Full Text Available On 15–16 December 1999, heavy rainfall severely stroke Campania region (southern Italy, triggering numerous debris flows on the slopes of the San Martino Valle Caudina-Cervinara area. Soil slips originated within the weathered volcaniclastic mantle of soil cover overlying the carbonate skeleton of the massif. Debris slides turned into fast flowing mixtures of matrix and large blocks, downslope eroding the soil cover and increasing their original volume. At the base of the slopes, debris flows impacted on the urban areas, causing victims and severe destruction (Vittori et al., 2000. Starting from a recent study on landslide risk conditions in Campania, carried out by the Regional Authority (PAI –Hydrogeological setting plan, in press, an evaluation of the debris-flow susceptibility has been performed for selected areas of the above mentioned villages. According to that study, such zones would be in fact characterised by the highest risk levels within the administrative boundaries of the same villages ("HR-zones". Our susceptibility analysis has been performed by applying SCIDDICA S3–hex – a hexagonal Cellular Automata model (von Neumann, 1966, specifically developed for simulating the spatial evolution of debris flows (Iovine et al., 2002. In order to apply the model to a given study area, detailed topographic data and a map of the erodable soil cover overlying the bedrock of the massif must be provided (as input matrices; moreover, extent and location of landslide source must also be given. Real landslides, selected among those triggered on winter 1999, have first been utilised for calibrating SCIDDICA S3–hex and for defining "optimal" values for parameters. Calibration has been carried out with a GIS tool, by quantitatively comparing simulations with actual cases: optimal values correspond to best simulations. Through geological evaluations, source locations of new phenomena have then been hypothesised within the HR-zones. Initial
DEFF Research Database (Denmark)
Bahr, Patrick
2012-01-01
Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular...
Directory of Open Access Journals (Sweden)
Zongsheng Zheng
2015-01-01
Full Text Available Environmental factors play an important role in the range expansion of Spartina alterniflora in estuarine salt marshes. CA models focusing on neighbor effect often failed to account for the influence of environmental factors. This paper proposed a CCA model that enhanced CA model by integrating constrain factors of tidal elevation, vegetation density, vegetation classification, and tidal channels in Chongming Dongtan wetland, China. Meanwhile, a positive feedback loop between vegetation and sedimentation was also considered in CCA model through altering the tidal accretion rate in different vegetation communities. After being validated and calibrated, the CCA model is more accurate than the CA model only taking account of neighbor effect. By overlaying remote sensing classification and the simulation results, the average accuracy increases to 80.75% comparing with the previous CA model. Through the scenarios simulation, the future of Spartina alterniflora expansion was analyzed. CCA model provides a new technical idea and method for salt marsh species expansion and control strategies research.
Performance of Сellular Automata-based Stream Ciphers in GPU Implementation
Directory of Open Access Journals (Sweden)
P. G. Klyucharev
2016-01-01
Full Text Available Earlier the author had developed methods to build high-performance generalized cellular automata-based symmetric ciphers, which allow obtaining the encryption algorithms that show extremely high performance in hardware implementation. However, their implementation based on the conventional microprocessors lacks high performance. The mere fact is quite common - it shows a scope of applications for these ciphers. Nevertheless, the use of graphic processors enables achieving an appropriate performance for a software implementation.The article is extension of a series of the articles, which study various aspects to construct and implement cryptographic algorithms based on the generalized cellular automata. The article is aimed at studying the capabilities to implement the GPU-based cryptographic algorithms under consideration.Representing a key generator, the implemented encryption algorithm comprises 2k generalized cellular automata. The cellular automata graphs are Ramanujan’s ones. The cells of produced k gamma streams alternate, thereby allowing the GPU capabilities to be better used.To implement was used OpenCL, as the most universal and platform-independent API. The software written in C ++ was designed so that the user could set various parameters, including the encryption key, the graph structure, the local communication function, various constants, etc. To test were used a variety of graphics processors (NVIDIA GTX 650; NVIDIA GTX 770; AMD R9 280X.Depending on operating conditions, and GPU used, a performance range is from 0.47 to 6.61 Gb / s, which is comparable to the performance of the countertypes.Thus, the article has demonstrated that using the GPU makes it is possible to provide efficient software implementation of stream ciphers based on the generalized cellular automata.This work was supported by the RFBR, the project №16-07-00542.
Efficient automata constructions and approximate automata
Watson, B.W.; Kourie, D.G.; Ngassam, E.K.; Strauss, T.; Cleophas, L.G.W.A.
2008-01-01
In this paper, we present data structures and algorithms for efficiently constructing approximate automata. An approximate automaton for a regular language L is one which accepts at least L. Such automata can be used in a variety of practical applications, including network security pattern
Efficient automata constructions and approximate automata
Watson, B.W.; Kourie, D.G.; Ngassam, E.K.; Strauss, T.; Cleophas, L.G.W.A.; Holub, J.; Zdárek, J.
2006-01-01
In this paper, we present data structures and algorithms for efficiently constructing approximate automata. An approximate automaton for a regular language L is one which accepts at least L. Such automata can be used in a variety of practical applications, including network security pattern
Mitochondrial fusion through membrane automata.
Giannakis, Konstantinos; Andronikos, Theodore
2015-01-01
Studies have shown that malfunctions in mitochondrial processes can be blamed for diseases. However, the mechanism behind these operations is yet not sufficiently clear. In this work we present a novel approach to describe a biomolecular model for mitochondrial fusion using notions from the membrane computing. We use a case study defined in BioAmbient calculus and we show how to translate it in terms of a P automata variant. We combine brane calculi with (mem)brane automata to produce a new scheme capable of describing simple, realistic models. We propose the further use of similar methods and the test of other biomolecular models with the same behaviour.
Iterons, fractals and computations of automata
Siwak, Paweł
1999-03-01
Processing of strings by some automata, when viewed on space-time (ST) diagrams, reveals characteristic soliton-like coherent periodic objects. They are inherently associated with iterations of automata mappings thus we call them the iterons. In the paper we present two classes of one-dimensional iterons: particles and filtrons. The particles are typical for parallel (cellular) processing, while filtrons, introduced in (32) are specific for serial processing of strings. In general, the images of iterated automata mappings exhibit not only coherent entities but also the fractals, and quasi-periodic and chaotic dynamics. We show typical images of such computations: fractals, multiplication by a number, and addition of binary numbers defined by a Turing machine. Then, the particles are presented as iterons generated by cellular automata in three computations: B/U code conversion (13, 29), majority classification (9), and in discrete version of the FPU (Fermi-Pasta-Ulam) dynamics (7, 23). We disclose particles by a technique of combinational recoding of ST diagrams (as opposed to sequential recoding). Subsequently, we recall the recursive filters based on FCA (filter cellular automata) window operators, and considered by Park (26), Ablowitz (1), Fokas (11), Fuchssteiner (12), Bruschi (5) and Jiang (20). We present the automata equivalents to these filters (33). Some of them belong to the class of filter automata introduced in (30). We also define and illustrate some properties of filtrons. Contrary to particles, the filtrons interact nonlocally in the sense that distant symbols may influence one another. Thus their interactions are very unusual. Some examples have been given in (32). Here we show new examples of filtron phenomena: multifiltron solitonic collisions, attracting and repelling filtrons, trapped bouncing filtrons (which behave like a resonance cavity) and quasi filtrons.
Geometrical automata for two phase flow simulation
International Nuclear Information System (INIS)
Herrero, V.; Guido-Lavalle, G.; Clausse, A.
1996-01-01
An automaton is an entity defined by a mathematical state which changes following iterative rules representing the interaction with the neighborhood. A model of automata for two-phase flow simulation consisting in a field of disks which are allowed to change their radii and move in a plane is presented. The model is more general than the classical cellular automata in two respects: (1) the grid of cellular automata is dismissed in favor of a trajectory generator; and (2) the rules of interaction involve parameters intended to represent some of the most relevant variables governing the actual physical interactions between phases. Computational experiments show that the algorithm captures the essential physics underlying two-phase flow problems such as bubbly-slug pattern transition and void fraction development along tubes. A comparison with experimental data of void fraction profiles is presented, showing excellent agreement. (orig.)
Overview of cellular automaton models for corrosion
International Nuclear Information System (INIS)
Perez-Brokate, Cristian Felipe; De Lamare, Jacques; Dung di Caprio; Feron, Damien; Chausse, Annie
2014-01-01
A review of corrosion process modeling using cellular automata methods is presented. This relatively new and growing approach takes into account the stochastic nature of the phenomena and uses physico-chemical rules to make predictions at a mesoscopic scale. Milestone models are analyzed and perspectives are established. (authors)
An Interface Theory for Input/Output Automata
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand; Nyman, Ulrik; Wasowski, Andrzej
Building on the theory of interface automata by de~Alfaro and Henzinger we design an interface language for Lynch's Input/Output Automata, a popular formalism used in the development of distributed asynchronous systems, not addressed by previous interface research. We introduce an explicit....... We also present a method for solving systems of relativized behavioral inequalities as used in our setup and draw a formal correspondence between our work and interface automata. Proofs are provided in an appendix....
Observability of Automata Networks: Fixed and Switching Cases.
Li, Rui; Hong, Yiguang; Wang, Xingyuan
2018-04-01
Automata networks are a class of fully discrete dynamical systems, which have received considerable interest in various different areas. This brief addresses the observability of automata networks and switched automata networks in a unified framework, and proposes simple necessary and sufficient conditions for observability. The results are achieved by employing methods from symbolic computation, and are suited for implementation using computer algebra systems. Several examples are presented to demonstrate the application of the results.
Continuity controlled Hybrid Automata
Bergstra, J.A.; Middelburg, C.A.
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation
Continuity Controlled Hybrid Automata
Bergstra, J.A.; Middelburg, C.A.
2004-01-01
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation of
Continuity controlled hybrid automata
Bergstra, J.A.; Middelburg, C.A.
2004-01-01
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation of
Continuity controlled hybrid automata
Bergstra, J.A.; Middelburg, C.A.
2006-01-01
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation of
Adamatzky, Andrew
2015-01-01
The book gives a comprehensive overview of the state-of-the-art research and engineering in theory and application of Lattice Automata in design and control of autonomous Robots. Automata and robots share the same notional meaning. Automata (originated from the latinization of the Greek word “αυτόματον”) as self-operating autonomous machines invented from ancient years can be easily considered the first steps of robotic-like efforts. Automata are mathematical models of Robots and also they are integral parts of robotic control systems. A Lattice Automaton is a regular array or a collective of finite state machines, or automata. The Automata update their states by the same rules depending on states of their immediate neighbours. In the context of this book, Lattice Automata are used in developing modular reconfigurable robotic systems, path planning and map exploration for robots, as robot controllers, synchronisation of robot collectives, robot vision, parallel robotic actuators. All chapters are...
DEFF Research Database (Denmark)
Schwartzbach, Michael Ignatieff; Meineche Smidt, Erik
A hierarchical type system for imperative programming languages gives rise to various computational problems, such as type equivalence, type ordering, etc. We present a particular class of finite automata which are shown to be isomorphic to type equations. All the relevant type concepts turn out...... to have well-known automata analogues, such as language equality, language inclusion, etc. This provides optimal or best known algorithms for the type system, by a process of translating type equations to automata, solving the analogous problem, and translating the result back to type equations. Apart...
International Nuclear Information System (INIS)
Tochio, Daisuke; Abe, Yutaka; Matsukuma, Yosuke
2008-01-01
It is pointed out that a vapor film on a premixed high-temperature droplet surface is needed to be collapsed to trigger vapor explosion. Thus, it is important to clarify the micromechanism of vapor film collapse behavior for the occurrence of vapor explosion. In a previous study, it is suggested experimentally that vapor film collapse behavior is dominated by phase change phenomena rather than by the surrounding fluid motion. In the present study, vapor film collapse behavior is investigated to clarify the dominant factor of vapor film collapse behavior with lattice gas automata of three-dimensional immiscible lattice gas model (3-D ILG model). First, in order to represent the boiling and phase change phenomena, the thermal model of a heat wall model and a phase change model is newly constructed. Next, the numerical simulation of vapor film collapse behavior is performed with and without the phase change effect. As a result, the computational result with the phase change effect is observed to be almost same as the experimental result. It can be considered that vapor film collapse behavior is dominated by phase change phenomena. (author)
Salehi, Leila; Azmi, Reza
2014-07-01
Breast cancer continues to be a significant public health problem in the world. Early detection is the key for improving breast cancer prognosis. In this way, magnetic resonance imaging (MRI) is emerging as a powerful tool for the detection of breast cancer. Breast MRI presently has two major challenges. First, its specificity is relatively poor, and it detects many false positives (FPs). Second, the method involves acquiring several high-resolution image volumes before, during, and after the injection of a contrast agent. The large volume of data makes the task of interpretation by the radiologist both complex and time-consuming. These challenges have led to the development of the computer-aided detection systems to improve the efficiency and accuracy of the interpretation process. Detection of suspicious regions of interests (ROIs) is a critical preprocessing step in dynamic contrast-enhanced (DCE)-MRI data evaluation. In this regard, this paper introduces a new automatic method to detect the suspicious ROIs for breast DCE-MRI based on region growing. The results indicate that the proposed method is thoroughly able to identify suspicious regions (accuracy of 75.39 ± 3.37 on PIDER breast MRI dataset). Furthermore, the FP per image in this method is averagely 7.92, which shows considerable improvement comparing to other methods like ROI hunter.
Algebraic and structural automata theory
Mikolajczak, B
1991-01-01
Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development.The result of over ten years of research, this book presents work in the following areas of Automata Theory: automata morphisms, time-varying automata, automata realizations and relationships between automata and semigroups.Aimed at those working in discrete mathematics and computer science, parts of the book are suitable for use in graduate courses in computer science, electronics, telecommunications, and control engineering. It is assumed that the reader is familiar with the basic concepts of algebra and graph theory.
Havelund, Klaus
2014-01-01
We present a form of automaton, referred to as data automata, suited for monitoring sequences of data-carrying events, for example emitted by an executing software system. This form of automata allows states to be parameterized with data, forming named records, which are stored in an efficiently indexed data structure, a form of database. This very explicit approach differs from other automaton-based monitoring approaches. Data automata are also characterized by allowing transition conditions to refer to other parameterized states, and by allowing transitions sequences. The presented automaton concept is inspired by rule-based systems, especially the Rete algorithm, which is one of the well-established algorithms for executing rule-based systems. We present an optimized external DSL for data automata, as well as a comparable unoptimized internal DSL (API) in the Scala programming language, in order to compare the two solutions. An evaluation compares these two solutions to several other monitoring systems.
Indian Academy of Sciences (India)
M. Senthilkumar (Newgen Imaging) 1461 1996 Oct 15 13:05:22
automata are expressive enough to model the timed behaviour of asynchronous .... F,G ⊆ Q are, respectively, the finitary and infinitary acceptance state sets. ...... 19th Foundations of Software Technology and Theoretical Computer Science ...
Confluence reduction for Markov automata
Timmer, Mark; Katoen, Joost P.; van de Pol, Jaco; Stoelinga, Mariëlle Ida Antoinette
2016-01-01
Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. As expected, the state space explosion threatens the analysability of these models. We therefore introduce confluence reduction for Markov automata, a powerful reduction
Learning automata theory and applications
Najim, K
1994-01-01
Learning systems have made a significant impact on all areas of engineering problems. They are attractive methods for solving many problems which are too complex, highly non-linear, uncertain, incomplete or non-stationary, and have subtle and interactive exchanges with the environment where they operate. The main aim of the book is to give a systematic treatment of learning automata and to produce a guide to a wide variety of ideas and methods that can be used in learning systems, including enough theoretical material to enable the user of the relevant techniques and concepts to understand why
DEFF Research Database (Denmark)
Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum
2004-01-01
This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European...... projects VHS [22] and AMETIST [17] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [20,5] specialized for cost-optimal reachability for the extended model of priced timed automata....
An improved cellular automaton method to model multispecies biofilms.
Tang, Youneng; Valocchi, Albert J
2013-10-01
Biomass-spreading rules used in previous cellular automaton methods to simulate multispecies biofilm introduced extensive mixing between different biomass species or resulted in spatially discontinuous biomass concentration and distribution; this caused results based on the cellular automaton methods to deviate from experimental results and those from the more computationally intensive continuous method. To overcome the problems, we propose new biomass-spreading rules in this work: Excess biomass spreads by pushing a line of grid cells that are on the shortest path from the source grid cell to the destination grid cell, and the fractions of different biomass species in the grid cells on the path change due to the spreading. To evaluate the new rules, three two-dimensional simulation examples are used to compare the biomass distribution computed using the continuous method and three cellular automaton methods, one based on the new rules and the other two based on rules presented in two previous studies. The relationship between the biomass species is syntrophic in one example and competitive in the other two examples. Simulation results generated using the cellular automaton method based on the new rules agree much better with the continuous method than do results using the other two cellular automaton methods. The new biomass-spreading rules are no more complex to implement than the existing rules. Copyright © 2013 Elsevier Ltd. All rights reserved.
Canalization and control in automata networks: body segmentation in Drosophila melanogaster.
Directory of Open Access Journals (Sweden)
Manuel Marques-Pita
Full Text Available We present schema redescription as a methodology to characterize canalization in automata networks used to model biochemical regulation and signalling. In our formulation, canalization becomes synonymous with redundancy present in the logic of automata. This results in straightforward measures to quantify canalization in an automaton (micro-level, which is in turn integrated into a highly scalable framework to characterize the collective dynamics of large-scale automata networks (macro-level. This way, our approach provides a method to link micro- to macro-level dynamics--a crux of complexity. Several new results ensue from this methodology: uncovering of dynamical modularity (modules in the dynamics rather than in the structure of networks, identification of minimal conditions and critical nodes to control the convergence to attractors, simulation of dynamical behaviour from incomplete information about initial conditions, and measures of macro-level canalization and robustness to perturbations. We exemplify our methodology with a well-known model of the intra- and inter cellular genetic regulation of body segmentation in Drosophila melanogaster. We use this model to show that our analysis does not contradict any previous findings. But we also obtain new knowledge about its behaviour: a better understanding of the size of its wild-type attractor basin (larger than previously thought, the identification of novel minimal conditions and critical nodes that control wild-type behaviour, and the resilience of these to stochastic interventions. Our methodology is applicable to any complex network that can be modelled using automata, but we focus on biochemical regulation and signalling, towards a better understanding of the (decentralized control that orchestrates cellular activity--with the ultimate goal of explaining how do cells and tissues 'compute'.
Canalization and control in automata networks: body segmentation in Drosophila melanogaster.
Marques-Pita, Manuel; Rocha, Luis M
2013-01-01
We present schema redescription as a methodology to characterize canalization in automata networks used to model biochemical regulation and signalling. In our formulation, canalization becomes synonymous with redundancy present in the logic of automata. This results in straightforward measures to quantify canalization in an automaton (micro-level), which is in turn integrated into a highly scalable framework to characterize the collective dynamics of large-scale automata networks (macro-level). This way, our approach provides a method to link micro- to macro-level dynamics--a crux of complexity. Several new results ensue from this methodology: uncovering of dynamical modularity (modules in the dynamics rather than in the structure of networks), identification of minimal conditions and critical nodes to control the convergence to attractors, simulation of dynamical behaviour from incomplete information about initial conditions, and measures of macro-level canalization and robustness to perturbations. We exemplify our methodology with a well-known model of the intra- and inter cellular genetic regulation of body segmentation in Drosophila melanogaster. We use this model to show that our analysis does not contradict any previous findings. But we also obtain new knowledge about its behaviour: a better understanding of the size of its wild-type attractor basin (larger than previously thought), the identification of novel minimal conditions and critical nodes that control wild-type behaviour, and the resilience of these to stochastic interventions. Our methodology is applicable to any complex network that can be modelled using automata, but we focus on biochemical regulation and signalling, towards a better understanding of the (decentralized) control that orchestrates cellular activity--with the ultimate goal of explaining how do cells and tissues 'compute'.
Learn with SAT to Minimize Büchi Automata
Directory of Open Access Journals (Sweden)
Stephan Barth
2012-10-01
Full Text Available We describe a minimization procedure for nondeterministic Büchi automata (NBA. For an automaton A another automaton A_min with the minimal number of states is learned with the help of a SAT-solver. This is done by successively computing automata A' that approximate A in the sense that they accept a given finite set of positive examples and reject a given finite set of negative examples. In the course of the procedure these example sets are successively increased. Thus, our method can be seen as an instance of a generic learning algorithm based on a "minimally adequate teacher'' in the sense of Angluin. We use a SAT solver to find an NBA for given sets of positive and negative examples. We use complementation via construction of deterministic parity automata to check candidates computed in this manner for equivalence with A. Failure of equivalence yields new positive or negative examples. Our method proved successful on complete samplings of small automata and of quite some examples of bigger automata. We successfully ran the minimization on over ten thousand automata with mostly up to ten states, including the complements of all possible automata with two states and alphabet size three and discuss results and runtimes; single examples had over 100 states.
Automata, universality, computation tribute to Maurice Margenstern
2015-01-01
This book is an intellectually stimulating excursion into mathematical machines and structures capable for a universal computation. World top experts in computer science and mathematics overview exciting and intriguing topics of logical theory of monoids, geometry of Gauss word, philosophy of mathematics in computer science, asynchronous and parallel P-systems, decidability in cellular automata, splicing systems, reversible Turing machines, information flows in two-way finite automata, prime generators in automaton arrays, Grossone and Turing machines, automaton models of atomic lattices. The book is full of visually attractive examples of mathematical machines, open problems and challenges for future research. Those interested in the advancement of a theory of computation, philosophy of mathematics, future and emergent computing paradigms, architectures and implementations will find the book vital for their research and development.
Simulation of electrochemical processes in cardiac tissue based on cellular automaton
International Nuclear Information System (INIS)
Avdeev, S A; Bogatov, N M
2014-01-01
A new class of cellular automata using special accumulative function for nonuniformity distribution is presented. Usage of this automata type for simulation of excitable media applied to electrochemical processes in human cardiac tissue is shown
Virtual Stationary Automata for Mobile Networks
National Research Council Canada - National Science Library
Dolev, Shlomi; Gilbert, Seth; Lahiani, Limor; Lynch, Nancy; Nolte, Tina
2005-01-01
We define a programming abstraction for mobile networks called the Virtual Stationary Automata programming layer, consisting of real mobile clients, virtual timed I/O automata called virtual stationary automata (VSAs...
Havelund, Klaus
2014-01-01
The field of runtime verification has during the last decade seen a multitude of systems for monitoring event sequences (traces) emitted by a running system. The objective is to ensure correctness of a system by checking its execution traces against formal specifications representing requirements. A special challenge is data parameterized events, where monitors have to keep track of the combination of control states as well as data constraints, relating events and the data they carry across time points. This poses a challenge wrt. efficiency of monitors, as well as expressiveness of logics. Data automata is a form of automata where states are parameterized with data, supporting monitoring of data parameterized events. We describe the full details of a very simple API in the Scala programming language, an internal DSL (Domain-Specific Language), implementing data automata. The small implementation suggests a design pattern. Data automata allow transition conditions to refer to other states than the source state, and allow target states of transitions to be inlined, offering a temporal logic flavored notation. An embedding of a logic in a high-level language like Scala in addition allows monitors to be programmed using all of Scala's language constructs, offering the full flexibility of a programming language. The framework is demonstrated on an XML processing scenario previously addressed in related work.
International Nuclear Information System (INIS)
Kato, Yasuyoshi
1999-01-01
Since most of complex phenomena comprise of various elementary processes e.g., fluid flow, heat conduction, phase transition, chemical reaction, structural deformation, and these processes interact each other nonlinearly, the complex phenomena cannot be easily clarified by such the conventional topdown approaches as describe phenomena by using differential equations. In contrast to the topdown approaches where the differential equations are located at the top of the analysis procedures, these are bottomup approaches where phenomena are reproduced by local interaction of particles on cells. Cellular automata are one of the typical bottomup approaches. The basic principle, computer simulation results, and massively parallel processors for the cellular automata are reviewed and perspectives of the bottomup approach are discussed on clarification of the complex phenomena in nuclear plants. The computer simulations mainly deal with fluid flows and phase interfacial phenomena. (author)
Precharattana, Monamorn; Nokkeaw, Arthorn; Triampo, Wannapong; Triampo, Darapond; Lenbury, Yongwimon
2011-07-01
Acquired Immunodeficiency Syndrome (AIDS) is responsible for millions of deaths worldwide. To date, many drug treatment regimens have been applied to AIDS patients but none has resulted in a successful cure. This is mainly due to the fact that free HIV particles are frequently in mutation, and infected CD4(+) T cells normally reside in the lymphoid tissue where they cannot (so far) be eradicated. We present a stochastic cellular automaton (CA) model to computationally study what could be an alternative treatment, namely Leukapheresis (LCAP), to remove HIV infected leukocytes in the lymphoid tissue. We base our investigations on Monte Carlo computer simulations. Our major objective is to investigate how the number of infected CD4(+) T cells changes in response to LCAP during the short-time (weeks) and long-time (years) scales of HIV/AIDS progression in an infected individual. To achieve our goal, we analyze the time evolution of the CD4(+) T cell population in the lymphoid tissue (i.e., the lymph node) for HIV dynamics in treatment situations with various starting times and frequencies and under a no treatment condition. Our findings suggest that the effectiveness of the treatment depends mainly on the treatment starting time and the frequency of the LCAP. Other factors (e.g., the removal proportion, the treatment duration, and the state of removed cells) that likely influence disease progression are subjects for further investigation. Copyright © 2011 Elsevier Ltd. All rights reserved.
Distribution functions of probabilistic automata
Vatan, F.
2001-01-01
Each probabilistic automaton M over an alphabet A defines a probability measure Prob sub(M) on the set of all finite and infinite words over A. We can identify a k letter alphabet A with the set {0, 1,..., k-1}, and, hence, we can consider every finite or infinite word w over A as a radix k expansion of a real number X(w) in the interval [0, 1]. This makes X(w) a random variable and the distribution function of M is defined as usual: F(x) := Prob sub(M) { w: X(w) automata in detail. Automata with continuous distribution functions are characterized. By a new, and much more easier method, it is shown that the distribution function F(x) is an analytic function if it is a polynomial. Finally, answering a question posed by D. Knuth and A. Yao, we show that a polynomial distribution function F(x) on [0, 1] can be generated by a prob abilistic automaton iff all the roots of F'(x) = 0 in this interval, if any, are rational numbers. For this, we define two dynamical systems on the set of polynomial distributions and study attracting fixed points of random composition of these two systems.
Molecular automata assembly: principles and simulation of bacterial membrane construction.
Lahoz-Beltra, R
1997-01-01
The motivation to understand the basic rules and principles governing molecular self-assembly may be relevant to explain in the context of molecular biology the self-organization and biological functions exhibited within cells. This paper presents a molecular automata model to simulate molecular self-assembly introducing the concept of molecular programming to simulate the biological function or operation performed by an assembled molecular state machine. The method is illustrated modelling Escherichia coli membrane construction including the assembly and operation of ATP synthase as well as the assembly of the bacterial flagellar motor. Flagellar motor operation was simulated using a different approach based on state machine definition used in virtual reality systems. The proposed methodology provides a modelling framework for simulation of biological functions performed by cellular components and other biological systems suitable to be modelled as molecular state machines.
The Determining Finite Automata Process
Directory of Open Access Journals (Sweden)
M. S. Vinogradova
2017-01-01
Full Text Available The theory of formal languages widely uses finite state automata both in implementation of automata-based approach to programming, and in synthesis of logical control algorithms.To ensure unambiguous operation of the algorithms, the synthesized finite state automata must be deterministic. Within the approach to the synthesis of the mobile robot controls, for example, based on the theory of formal languages, there are problems concerning the construction of various finite automata, but such finite automata, as a rule, will not be deterministic. The algorithm of determinization can be applied to the finite automata, as specified, in various ways. The basic ideas of the algorithm of determinization can be most simply explained using the representations of a finite automaton in the form of a weighted directed graph.The paper deals with finite automata represented as weighted directed graphs, and discusses in detail the procedure for determining the finite automata represented in this way. Gives a detailed description of the algorithm for determining finite automata. A large number of examples illustrate a capability of the determinization algorithm.
Modeling biological pathway dynamics with timed automata.
Schivo, Stefano; Scholma, Jetse; Wanders, Brend; Urquidi Camacho, Ricardo A; van der Vet, Paul E; Karperien, Marcel; Langerak, Rom; van de Pol, Jaco; Post, Janine N
2014-05-01
Living cells are constantly subjected to a plethora of environmental stimuli that require integration into an appropriate cellular response. This integration takes place through signal transduction events that form tightly interconnected networks. The understanding of these networks requires capturing their dynamics through computational support and models. ANIMO (analysis of Networks with Interactive Modeling) is a tool that enables the construction and exploration of executable models of biological networks, helping to derive hypotheses and to plan wet-lab experiments. The tool is based on the formalism of Timed Automata, which can be analyzed via the UPPAAL model checker. Thanks to Timed Automata, we can provide a formal semantics for the domain-specific language used to represent signaling networks. This enforces precision and uniformity in the definition of signaling pathways, contributing to the integration of isolated signaling events into complex network models. We propose an approach to discretization of reaction kinetics that allows us to efficiently use UPPAAL as the computational engine to explore the dynamic behavior of the network of interest. A user-friendly interface hides the use of Timed Automata from the user, while keeping the expressive power intact. Abstraction to single-parameter kinetics speeds up construction of models that remain faithful enough to provide meaningful insight. The resulting dynamic behavior of the network components is displayed graphically, allowing for an intuitive and interactive modeling experience.
Multi-Robot Motion Planning: A Timed Automata Approach
Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh
2004-01-01
This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar grid. The automata formalism merely presents a high-level model of environment, robots and control, but allows composition and formal symbolic reasoning about coordinated solutions. Composition is achi...
Compositions of (max, +) automata
Czech Academy of Sciences Publication Activity Database
Lahaye, S.; Komenda, Jan; Boimond, J.-L.
2015-01-01
Roč. 25, 1-2 (2015), s. 323-344 ISSN 0924-6703 R&D Projects: GA ČR(CZ) GAP103/11/0517 Institutional support: RVO:67985840 Keywords : (max,+) automata * synchronous product * asynchronous product Subject RIV: BA - General Mathematics Impact factor: 1.268, year: 2015 http://link.springer.com/article/10.1007/s10626-014-0186-6
A compositional Translation of Stochastic Automata into Timed Automata
d' Argenio, P.R.
We present a translation from stochastic automata [17, 16] into timed automata with deadlines [37, 13]. The translation preserves traces when the stochastic characteristics, namely the probability measures, are abstracted from the original stochastic automaton. Moreover, we show that the translation
In vivo cellular imaging using fluorescent proteins - Methods and Protocols
Directory of Open Access Journals (Sweden)
M. Monti
2012-12-01
Full Text Available The discovery and genetic engineering of fluorescent proteins has revolutionized cell biology. What was previously invisible to the cell often can be made visible with the use of fluorescent proteins. With this words, Robert M. Hoffman introduces In vivo Cellular Imaging Using Fluorescent proteins, the eighteen chapters book dedicated to the description of how fluorescence proteins have changed the way to analyze cellular processes in vivo. Modern researches aim to study new and less invasive methods able to follow the behavior of different cell types in different biological contexts: for example, how cancer cells migrate or how they respond to different therapies. Also, in vivo systems can help researchers to better understand animal embryonic development so as how fluorescence proteins may be used to monitor different processes in living organisms at the molecular and cellular level.
Learning and Model-checking Networks of I/O Automata
DEFF Research Database (Denmark)
Mao, Hua; Jaeger, Manfred
2012-01-01
We introduce a new statistical relational learning (SRL) approach in which models for structured data, especially network data, are constructed as networks of communicating nite probabilistic automata. Leveraging existing automata learning methods from the area of grammatical inference, we can...... learn generic models for network entities in the form of automata templates. As is characteristic for SRL techniques, the abstraction level aorded by learning generic templates enables one to apply the learned model to new domains. A main benet of learning models based on nite automata lies in the fact...
Peculiarities of hardware implementation of generalized cellular tetra automaton
Аноприенко, Александр Яковлевич; Федоров, Евгений Евгениевич; Иваница, Сергей Васильевич; Альрабаба, Хамза
2015-01-01
Cellular automata are widely used in many fields of knowledge for the study of variety of complex real processes: computer engineering and computer science, cryptography, mathematics, physics, chemistry, ecology, biology, medicine, epidemiology, geology, architecture, sociology, theory of neural networks. Thus, cellular automata (CA) and tetra automata are gaining relevance taking into account the hardware and software solutions.Also it is marked a trend towards an increase in the number of p...
Complex systems modeling by cellular automata
Kroc, J.; Sloot, P.M.A.; Rabuñal Dopico, J.R.; Dorado de la Calle, J.; Pazos Sierra, A.
2009-01-01
In recent years, the notion of complex systems proved to be a very useful concept to define, describe, and study various natural phenomena observed in a vast number of scientific disciplines. Examples of scientific disciplines that highly benefit from this concept range from physics, mathematics,
Cellular automata simulations on a FPGA cluster
Murtaza, S.; Hoekstra, A.G.; Sloot, P.M.A.
2011-01-01
The emergence of multicore architectures and the chip industry’s plan to roll out hundreds of cores per die sometime in the near future might have triggered the evolution of von Neumann architectures towards a parallel processing paradigm. The capability to have hundreds of cores per die is
A cellular automata model for ant trails
Indian Academy of Sciences (India)
In this study, the unidirectional ant traffic flow with U-turn in an ant trail was inves- tigated using ... the literature, it was considered in the model that (i) ant colony consists of two kinds of ants, good- ... ponents without a central controller [8].
A brief review of cellular automata packages
Energy Technology Data Exchange (ETDEWEB)
Hiebeler, D [Los Alamos National Lab., NM (United States)
1990-01-01
A very frequently asked question is [open quotes]what CA simulation packages are available [close quotes] Of course, the answer depends largely on what features you are looking for, and how much you are willing to pay. I would like to briefly mention here a few of the simulation packages that I have encountered. This is by no means a complete list, and I apologize to those authors whose packages I failed to mention. Please feel free to contact me about omissions, so that future versions of this article will be more complete.
Weighted Watson-Crick automata
Energy Technology Data Exchange (ETDEWEB)
Tamrin, Mohd Izzuddin Mohd [Department of Information System, Kulliyyah of Information and Communication Technology, International Islamic University Malaysia, 50728 Gombak, Selangor (Malaysia); Turaev, Sherzod; Sembok, Tengku Mohd Tengku [Department of Computer Science, Kulliyyah of Information and Communication Technology, International Islamic University Malaysia, 50728 Gombak, Selangor (Malaysia)
2014-07-10
There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power.
Weighted Watson-Crick automata
International Nuclear Information System (INIS)
Tamrin, Mohd Izzuddin Mohd; Turaev, Sherzod; Sembok, Tengku Mohd Tengku
2014-01-01
There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power
Multipebble Simulations for Alternating Automata
Clemente, Lorenzo; Mayr, Richard
We study generalized simulation relations for alternating Büchi automata (ABA), as well as alternating finite automata. Having multiple pebbles allows the Duplicator to "hedge her bets" and delay decisions in the simulation game, thus yielding a coarser simulation relation. We define (k 1,k 2)-simulations, with k 1/k 2 pebbles on the left/right, respectively. This generalizes previous work on ordinary simulation (i.e., (1,1)-simulation) for nondeterministic Büchi automata (NBA)[4] in and ABA in [5], and (1,k)-simulation for NBA in [3].
Height-Deterministic Pushdown Automata
DEFF Research Database (Denmark)
Nowotka, Dirk; Srba, Jiri
2007-01-01
We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on the input are a priori fixed. Different subclasses of height-deterministic pushdown automata, strictly containing the class...... of regular languages and still closed under boolean language operations, are considered. Several of such language classes have been described in the literature. Here, we suggest a natural and intuitive model that subsumes all the formalisms proposed so far by employing height-deterministic pushdown automata...
Energy Games in Multiweighted Automata
DEFF Research Database (Denmark)
Fahrenberg, U.; Juhl, L.; Larsen, Kim Guldstrand
2011-01-01
Energy games have recently attracted a lot of attention. These are games played on finite weighted automata and concern the existence of infinite runs subject to boundary constraints on the accumulated weight, allowing e.g only for behaviours where a resource is always available (nonnegative...... accumulated weight), yet does not exceed a given maximum capacity. We extend energy games to a multiweighted and parameterized setting, allowing us to model systems with multiple quantitative aspects. We present reductions between Petri nets and multiweighted automata and among different types...... of multiweighted automata and identify new complexity and (un)decidability results for both one- and two-player games. We also investigate the tractability of an extension of multiweighted energy games in the setting of timed automata....
Confluence reduction for Markov automata
Timmer, Mark; van de Pol, Jan Cornelis; Stoelinga, Mariëlle Ida Antoinette
Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosion threatens the analysability of the models
Confluence Reduction for Markov Automata
Timmer, Mark; van de Pol, Jan Cornelis; Stoelinga, Mariëlle Ida Antoinette; Braberman, Victor; Fribourg, Laurent
Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosion threatens the analysability of the models
Deterministic Automata for Unordered Trees
Directory of Open Access Journals (Sweden)
Adrien Boiret
2014-08-01
Full Text Available Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which makes it difficult to distinguish subclasses of automata for which problems such as inclusion, equivalence, and minimization can be solved efficiently. In this paper, we propose and investigate different notions of "horizontal determinism", starting from automata for unranked trees in which the horizontal evaluation is performed by finite state automata. We show that a restriction to confluent horizontal evaluation leads to polynomial-time emptiness and universality, but still suffers from coNP-completeness of the emptiness of binary intersections. Finally, efficient algorithms can be obtained by imposing an order of horizontal evaluation globally for all automata in the class. Depending on the choice of the order, we obtain different classes of automata, each of which has the same expressiveness as CMso.
What will be eventually true of polymomial hybrid automata
DEFF Research Database (Denmark)
Fränzle, Martin
2001-01-01
Hybrid automata have been introduced in both control engineering and computer science as a formal model for the dynamics of hybrid discrete-continuous systems. While computability issues concerning safety properties have been extensively studied, liveness properties have remained largely uninvest......Hybrid automata have been introduced in both control engineering and computer science as a formal model for the dynamics of hybrid discrete-continuous systems. While computability issues concerning safety properties have been extensively studied, liveness properties have remained largely...... uninvestigated. In this article, we investigate decidability of state recurrence and of progress properties. First, we show that state recurrence and progress are in general undecidable for polynomial hybrid automata. Then, we demonstrate that they are closely related for hybrid automata subject to a simple...... model of noise, even though these automata are infinite-state systems. Based on this, we augment a semi-decision procedure for recurrence with a semi-decision method for length-boundedness of paths in such a way that we obtain an automatic verification method for progress properties of linear...
Energy Technology Data Exchange (ETDEWEB)
Priese, L
1983-07-01
The author presents a precise notion of a realization (or simulation) of one concurrent system by another, and studies the relations of modular concurrent systems and non-persistent (i.e. With conflicts) concurrent systems in an automata theoretical style. He introduces a conception of realization that obeys three requirements: it allows for proper hierarchies in certain classes of concurrent systems; it allows for normal-form theorems, and the standard constructions of the literature remain realizations in formal concept; and it clarifies some counterintuitive examples. Further, although this realization conception is developed to translate the computational aspects of concurrent systems, it also gives a formal tool for the handling of synchronization problems. 38 references.
Borowik, Bohdan; Lahno, Valery; Petrov, Oleksandr
2013-01-01
This book serves a dual purpose: firstly to combine the treatment of circuits and digital electronics, and secondly, to establish a strong connection with the contemporary world of digital systems. The need for this approach arises from the observation that introducing digital electronics through a course in traditional circuit analysis is fast becoming obsolete. Our world has gone digital. Automata theory helps with the design of digital circuits such as parts of computers, telephone systems and control systems. A complete perspective is emphasized, because even the most elegant computer architecture will not function without adequate supporting circuits. The focus is on explaining the real-world implementation of complete digital systems. In doing so, the reader is prepared to immediately begin design and implementation work. This work serves as a bridge to take readers from the theoretical world to the everyday design world where solutions must be complete to be successful.
Cellular reflectarray antenna and method of making same
Romanofsky, Robert R (Inventor)
2011-01-01
A method of manufacturing a cellular reflectarray antenna arranged in an m by n matrix of radiating elements for communication with a satellite includes steps of determining a delay .phi.m,n for each of said m by n matrix of elements of said cellular reflectarray antenna using sub-steps of: determining the longitude and latitude of operation, determining elevation and azimuth angles of the reflectarray with respect to the satellite and converting theta.sub.0 (.theta..sub.0) and phi.sub.0 (.phi..sub.0), determining .DELTA..beta..sub.m,n, the pointing vector correction, for a given inter-element spacing and wavelength, determining .DELTA..phi..sub.m,n, the spherical wave front correction factor, for a given radius from the central element and/or from measured data from the feed horn; and, determining a delay .phi.m,n for each of said m by n matrix of elements as a function of .DELTA..beta..sub.m,n and .DELTA..phi..sub.m,n.
Multi-Robot Motion Planning: A Timed Automata Approach
DEFF Research Database (Denmark)
Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh
2004-01-01
This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar...... grid. The automata formalism merely presents a high-level model of environment, robots and control, but allows composition and formal symbolic reasoning about coordinated solutions. Composition is achieved through synchronization, and the verification software UPPAAL is used for a symbolic verification...... then subsequently be used as a high-level motion plan for the robots. This paper reports on the timed automata framework, results of two verification experiments, promise of the approach, and gives a perspective for future research....
Multi-Robot Motion Planning: A Timed Automata Approach
DEFF Research Database (Denmark)
Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh
This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar...... grid. The automata formalism merely presents a high-level model of environment, robots and control, but allows composition and formal symbolic reasoning about coordinated solutions. Composition is achieved through synchronization, and the verification software UPPAAL is used for a symbolic verification...... then subsequently be used as a high-level motion plan for the robots. This paper reports on the timed automata framework, results of two verification experiments, promise of the approach, and gives a perspective for future research....
Automata theory and its applications
Khoussainov, Bakhadyr
2001-01-01
The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's ...
Authorship attribution based on Life-Like Network Automata
Machicao, Jeaneth; Corrêa, Edilson A.; Miranda, Gisele H. B.; Amancio, Diego R.
2018-01-01
The authorship attribution is a problem of considerable practical and technical interest. Several methods have been designed to infer the authorship of disputed documents in multiple contexts. While traditional statistical methods based solely on word counts and related measurements have provided a simple, yet effective solution in particular cases; they are prone to manipulation. Recently, texts have been successfully modeled as networks, where words are represented by nodes linked according to textual similarity measurements. Such models are useful to identify informative topological patterns for the authorship recognition task. However, there is no consensus on which measurements should be used. Thus, we proposed a novel method to characterize text networks, by considering both topological and dynamical aspects of networks. Using concepts and methods from cellular automata theory, we devised a strategy to grasp informative spatio-temporal patterns from this model. Our experiments revealed an outperformance over structural analysis relying only on topological measurements, such as clustering coefficient, betweenness and shortest paths. The optimized results obtained here pave the way for a better characterization of textual networks. PMID:29566100
Authorship attribution based on Life-Like Network Automata.
Machicao, Jeaneth; Corrêa, Edilson A; Miranda, Gisele H B; Amancio, Diego R; Bruno, Odemir M
2018-01-01
The authorship attribution is a problem of considerable practical and technical interest. Several methods have been designed to infer the authorship of disputed documents in multiple contexts. While traditional statistical methods based solely on word counts and related measurements have provided a simple, yet effective solution in particular cases; they are prone to manipulation. Recently, texts have been successfully modeled as networks, where words are represented by nodes linked according to textual similarity measurements. Such models are useful to identify informative topological patterns for the authorship recognition task. However, there is no consensus on which measurements should be used. Thus, we proposed a novel method to characterize text networks, by considering both topological and dynamical aspects of networks. Using concepts and methods from cellular automata theory, we devised a strategy to grasp informative spatio-temporal patterns from this model. Our experiments revealed an outperformance over structural analysis relying only on topological measurements, such as clustering coefficient, betweenness and shortest paths. The optimized results obtained here pave the way for a better characterization of textual networks.
Authorship attribution based on Life-Like Network Automata.
Directory of Open Access Journals (Sweden)
Jeaneth Machicao
Full Text Available The authorship attribution is a problem of considerable practical and technical interest. Several methods have been designed to infer the authorship of disputed documents in multiple contexts. While traditional statistical methods based solely on word counts and related measurements have provided a simple, yet effective solution in particular cases; they are prone to manipulation. Recently, texts have been successfully modeled as networks, where words are represented by nodes linked according to textual similarity measurements. Such models are useful to identify informative topological patterns for the authorship recognition task. However, there is no consensus on which measurements should be used. Thus, we proposed a novel method to characterize text networks, by considering both topological and dynamical aspects of networks. Using concepts and methods from cellular automata theory, we devised a strategy to grasp informative spatio-temporal patterns from this model. Our experiments revealed an outperformance over structural analysis relying only on topological measurements, such as clustering coefficient, betweenness and shortest paths. The optimized results obtained here pave the way for a better characterization of textual networks.
Verification of Continuous Dynamical Systems by Timed Automata
DEFF Research Database (Denmark)
Sloth, Christoffer; Wisniewski, Rafael
2011-01-01
This paper presents a method for abstracting continuous dynamical systems by timed automata. The abstraction is based on partitioning the state space of a dynamical system using positive invariant sets, which form cells that represent locations of a timed automaton. The abstraction is intended......, which is generated utilizing sub-level sets of Lyapunov functions, as they are positive invariant sets. It is shown that this partition generates sound and complete abstractions. Furthermore, the complete abstractions can be composed of multiple timed automata, allowing parallelization...
Daciuk, J; Champarnaud, JM; Maurel, D
2003-01-01
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state automata (recognizers) from sets of words. Incremental, semi-incremental, and non-incremental methods have been implemented and evaluated.
Multiscale modeling of porous ceramics using movable cellular automaton method
Smolin, Alexey Yu.; Smolin, Igor Yu.; Smolina, Irina Yu.
2017-10-01
The paper presents a multiscale model for porous ceramics based on movable cellular automaton method, which is a particle method in novel computational mechanics of solid. The initial scale of the proposed approach corresponds to the characteristic size of the smallest pores in the ceramics. At this scale, we model uniaxial compression of several representative samples with an explicit account of pores of the same size but with the unique position in space. As a result, we get the average values of Young's modulus and strength, as well as the parameters of the Weibull distribution of these properties at the current scale level. These data allow us to describe the material behavior at the next scale level were only the larger pores are considered explicitly, while the influence of small pores is included via effective properties determined earliar. If the pore size distribution function of the material has N maxima we need to perform computations for N-1 levels in order to get the properties step by step from the lowest scale up to the macroscale. The proposed approach was applied to modeling zirconia ceramics with bimodal pore size distribution. The obtained results show correct behavior of the model sample at the macroscale.
Subsequence Automata with Default Transitions
DEFF Research Database (Denmark)
Bille, Philip; Gørtz, Inge Li; Skjoldjensen, Frederik Rye
2016-01-01
of states and transitions) of the subsequence automaton is O(nσ) and that this bound is asymptotically optimal. In this paper, we consider subsequence automata with default transitions, that is, special transitions to be taken only if none of the regular transitions match the current character, and which do...... not consume the current character. We show that with default transitions, much smaller subsequence automata are possible, and provide a full trade-off between the size of the automaton and the delay, i.e., the maximum number of consecutive default transitions followed before consuming a character......(nσ) and delay O(1), thus matching the bound for the standard subsequence automaton construction. The key component of our result is a novel hierarchical automata construction of independent interest....
Subsequence automata with default transitions
DEFF Research Database (Denmark)
Bille, Philip; Gørtz, Inge Li; Skjoldjensen, Frederik Rye
2017-01-01
of states and transitions) of the subsequence automaton is O(nσ) and that this bound is asymptotically optimal. In this paper, we consider subsequence automata with default transitions, that is, special transitions to be taken only if none of the regular transitions match the current character, and which do...... not consume the current character. We show that with default transitions, much smaller subsequence automata are possible, and provide a full trade-off between the size of the automaton and the delay, i.e., the maximum number of consecutive default transitions followed before consuming a character......(1), thus matching the bound for the standard subsequence automaton construction. Finally, we generalize the result to multiple strings. The key component of our result is a novel hierarchical automata construction of independent interest....
Quantification of cellular viability for the MTT method
International Nuclear Information System (INIS)
Altanes, M.
2001-01-01
In the last years, the scientists have been given to the task of finding new biomaterials whose biocompatibility with the human body allow them to substitute parts of the organism, as the bones and the junctures and also that they are little rejected. In the following work it was evaluated and quantified by the method of the MTT, a colorimetric, quick, simple and economic technical, the possible citohepatic effect of a watery extract of a biomaterials of polymeric origin (acrilamide and metacrilic acid) obtained for technical of gamma irradiation, consistent in culture medium 199 and veal serum, in cells Vero. In order to compare the answer of the analysis material, they were used the controls negative (polyethylene of high molecular weight), and positive (Sulphate of Streptomycin), just as they indicate it the established norms, being achieved the waited result of each one of them. In the observation made to the optic microscope, after 24 and 48 hours of contact between the cells and the extract of the analysis material, they were not perceived indicative of damage or cellular lysis, or morphologic changes in the structure of cells that it indicated us the possible cytotoxic effect of this biomaterials, therefore the qualitative analysis was not enough for the determination of the cytotoxic effect of the analysis sample
Car-following Behavior Model Learning Using Timed Automata
Zhang, Yihuan; Lin, Q.; Wang, Jun; Verwer, S.E.; Dochain, D.; Henrion, D.; Peaucelle, D.
Learning driving behavior is fundamental for autonomous vehicles to “understand” traffic situations. This paper proposes a novel method for learning a behavioral model of car-following using automata learning algorithms. The model is interpretable for car-following behavior analysis. Frequent common
Relating timed and register automata
Directory of Open Access Journals (Sweden)
Diego Figueira
2010-11-01
Full Text Available Timed automata and register automata are well-known models of computation over timed and data words respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can store data values for later comparison. Although these two models behave in appearance differently, several decision problems have the same (undecidability and complexity results for both models. As a prominent example, emptiness is decidable for alternating automata with one clock or register, both with non-primitive recursive complexity. This is not by chance. This work confirms that there is indeed a tight relationship between the two models. We show that a run of a timed automaton can be simulated by a register automaton, and conversely that a run of a register automaton can be simulated by a timed automaton. Our results allow to transfer complexity and decidability results back and forth between these two kinds of models. We justify the usefulness of these reductions by obtaining new results on register automata.
Algebraic Systems and Pushdown Automata
Petre, Ion; Salomaa, Arto
We concentrate in this chapter on the core aspects of algebraic series, pushdown automata, and their relation to formal languages. We choose to follow here a presentation of their theory based on the concept of properness. We introduce in Sect. 2 some auxiliary notions and results needed throughout the chapter, in particular the notions of discrete convergence in semirings and C-cycle free infinite matrices. In Sect. 3 we introduce the algebraic power series in terms of algebraic systems of equations. We focus on interconnections with context-free grammars and on normal forms. We then conclude the section with a presentation of the theorems of Shamir and Chomsky-Schützenberger. We discuss in Sect. 4 the algebraic and the regulated rational transductions, as well as some representation results related to them. Section 5 is dedicated to pushdown automata and focuses on the interconnections with classical (non-weighted) pushdown automata and on the interconnections with algebraic systems. We then conclude the chapter with a brief discussion of some of the other topics related to algebraic systems and pushdown automata.
Cluster Statistics of BTW Automata
International Nuclear Information System (INIS)
Ajanta Bhowal Acharyya
2011-01-01
The cluster statistics of BTW automata in the SOC states are obtained by extensive computer simulation. Various moments of the clusters are calculated and few results are compared with earlier available numerical estimates and exact results. Reasonably good agreement is observed. An extended statistical analysis has been made. (author)
On path hypercompositions in graphs and automata
Directory of Open Access Journals (Sweden)
Massouros Christos G.
2016-01-01
Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.
Comprehensive bidding strategies with genetic programming/finite state automata
International Nuclear Information System (INIS)
Richter, C.W. Jr.; Sheble, G.B.; Ashlock, D.
1999-01-01
This research is an extension of the authors' previous work in double auctions aimed at developing bidding strategies for electric utilities which trade electricity competitively. The improvements detailed in this paper come from using data structures which combine genetic programming and finite state automata termed GP-Automata. The strategies developed by the method described here are adaptive--reacting to inputs--whereas the previously developed strategies were only suitable in the particular scenario for which they had been designed. The strategies encoded in the GP-Automata are tested in an auction simulator. The simulator pits them against other distribution companies (distcos) and generation companies (gencos), buying and selling power via double auctions implemented in regional commodity exchanges. The GP-Automata are evolved with a genetic algorithm so that they possess certain characteristics. In addition to designing successful bidding strategies (whose usage would result in higher profits) the resulting strategies can also be designed to imitate certain types of trading behaviors. The resulting strategies can be implemented directly in on-line trading, or can be used as realistic competitors in an off-line trading simulator
Multi-head Watson-Crick automata
Chatterjee, Kingshuk; Ray, Kumar Sankar
2015-01-01
Inspired by multi-head finite automata and Watson-Crick automata in this paper, we introduce new structure namely multi-head Watson-Crick automata where we replace the single tape of multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to Watson-Crick complementarity relation. We establish the superiority of our model over multi-head finite automata and also show that both the deterministic and non-determinis...
On Nonlinear Prices in Timed Automata
Directory of Open Access Journals (Sweden)
Devendra Bhave
2016-12-01
Full Text Available Priced timed automata provide a natural model for quantitative analysis of real-time systems and have been successfully applied in various scheduling and planning problems. The optimal reachability problem for linearly-priced timed automata is known to be PSPACE-complete. In this paper we investigate priced timed automata with more general prices and show that in the most general setting the optimal reachability problem is undecidable. We adapt and implement the construction of Audemard, Cimatti, Kornilowicz, and Sebastiani for non-linear priced timed automata using state-of-the-art theorem prover Z3 and present some preliminary results.
Construction of fuzzy automata by fuzzy experiments
International Nuclear Information System (INIS)
Mironov, A.
1994-01-01
The solving the problem of canonical realization of partial reaction morphisms (PRM) for automata in toposes and fuzzy automata is addressed. This problem extends the optimal construction problem for finite deterministic automata by experiments. In the present paper the conception of canonical realization of PRM for automata in toposes is introduced and the sufficient conditions for the existence of canonical realizations for PRM in toposes are presented. As a consequence of this result the existence of canonical realizations for PRM in the category of fuzzy sets over arbitrary complete chain is proven
Construction of fuzzy automata by fuzzy experiments
Energy Technology Data Exchange (ETDEWEB)
Mironov, A [Moscow Univ. (Russian Federation). Dept. of Mathematics and Computer Science
1994-12-31
The solving the problem of canonical realization of partial reaction morphisms (PRM) for automata in toposes and fuzzy automata is addressed. This problem extends the optimal construction problem for finite deterministic automata by experiments. In the present paper the conception of canonical realization of PRM for automata in toposes is introduced and the sufficient conditions for the existence of canonical realizations for PRM in toposes are presented. As a consequence of this result the existence of canonical realizations for PRM in the category of fuzzy sets over arbitrary complete chain is proven.
Linear Parametric Model Checking of Timed Automata
DEFF Research Database (Denmark)
Hune, Tohmas Seidelin; Romijn, Judi; Stoelinga, Mariëlle
2001-01-01
We present an extension of the model checker Uppaal capable of synthesize linear parameter constraints for the correctness of parametric timed automata. The symbolic representation of the (parametric) state-space is shown to be correct. A second contribution of this paper is the identication...... of a subclass of parametric timed automata (L/U automata), for which the emptiness problem is decidable, contrary to the full class where it is know to be undecidable. Also we present a number of lemmas enabling the verication eort to be reduced for L/U automata in some cases. We illustrate our approach...
Dynamical phase transitions in spin models and automata
International Nuclear Information System (INIS)
Derrida, B.
1989-01-01
Some of the models and methods developed in the study of the dynamics of spin models and automata are described. Special attention is given to the distance method which consists of comparing the time evolution of two configurations. The method is used to obtain the phase boundary between a frozen and a chaotic phase in the case of deterministic models. For stochastic systems the method is used to obtain dynamical phase transitions
International Nuclear Information System (INIS)
Lino, A.T.; Takahashi, E.K.; Leite, J.R.; Ferraz, A.C.
1988-01-01
The band structure of metallic sodium is calculated, using for the first time the self-consistent field variational cellular method. In order to implement the self-consistency in the variational cellular theory, the crystal electronic charge density was calculated within the muffin-tin approximation. The comparison between our results and those derived from other calculations leads to the conclusion that the proposed self-consistent version of the variational cellular method is fast and accurate. (author) [pt