WorldWideScience

Sample records for cellular automata modeling

  1. Cellular automata a parallel model

    CERN Document Server

    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.

  2. Cellular automata modelling of SEIRS

    Institute of Scientific and Technical Information of China (English)

    Liu Quan-Xing; Jin Zhen

    2005-01-01

    In this paper the SEIRS epidemic spread is analysed, and a two-dimensional probability cellular automata model for SEIRS is presented. Each cellular automation cell represents a part of the population that may be found in one of five states of individuals: susceptible, exposed (or latency), infected, immunized (or recovered) and death. Here studied are the effects of two cases on the epidemic spread. i.e. the effects of non-segregation and segregation on the latency and the infected of population. The conclusion is reached that the epidemic will persist in the case of non-segregation but it will decrease in the case of segregation. The proposed model can serve as a basis for the development of algorithms to simulate real epidemics based on real data. Last we find the density series of the exposed and the infected will fluctuate near a positive equilibrium point, when the constant for the immunized is less than its corresponding constant τ0. Our theoretical results are verified by numerical simulations.

  3. Cellular automata modeling of pedestrian's crossing dynamics

    Institute of Scientific and Technical Information of China (English)

    张晋; 王慧; 李平

    2004-01-01

    Cellular automata modeling techniques and the characteristics of mixed traffic flow were used to derive the 2-dimensional model presented here for simulation of pedestrian's crossing dynamics.A conception of "stop point" is introduced to deal with traffic obstacles and resolve conflicts among pedestrians or between pedestrians and the other vehicles on the crosswalk.The model can be easily extended,is very efficient for simulation of pedestrian's crossing dynamics,can be integrated into traffic simulation software,and has been proved feasible by simulation experiments.

  4. Cellular automata models for synchronized traffic flow

    CERN Document Server

    Jiang Rui

    2003-01-01

    This paper presents a new cellular automata model for describing synchronized traffic flow. The fundamental diagrams, the spacetime plots and the 1 min average data have been analysed in detail. It is shown that the model can describe the outflow from the jams, the light synchronized flow as well as heavy synchronized flow with average speed greater than approximately 24 km h sup - sup 1. As for the synchronized flow with speed lower than 24 km h sup - sup 1 , it is unstable and will evolve into the coexistence of jams, free flow and light synchronized flow. This is consistent with the empirical findings (Kerner B S 1998 Phys. Rev. Lett. 81 3797).

  5. Cellular automata modelling of hantarvirus infection

    Energy Technology Data Exchange (ETDEWEB)

    Abdul Karim, Mohamad Faisal [School of Distance Education, Universiti Sains Malaysia, Minden 11800, Penang (Malaysia)], E-mail: faisal@usm.my; Md Ismail, Ahmad Izani [School of Mathematical Sciences, Universiti Sains Malaysia, Minden 11800, Penang (Malaysia)], E-mail: izani@cs.usm.my; Ching, Hoe Bee [School of Mathematical Sciences, Universiti Sains Malaysia, Minden 11800, Penang (Malaysia)], E-mail: Bee_Ching_Janice_Hoe@dell.com

    2009-09-15

    Hantaviruses are a group of viruses which have been identified as being responsible for the outbreak of diseases such as the hantavirus pulmonary syndrome. In an effort to understand the characteristics and dynamics of hantavirus infection, mathematical models based on differential equations have been developed and widely studied. However, such models neglect the local characteristics of the spreading process and do not include variable susceptibility of individuals. In this paper, we develop an alternative approach based on cellular automata to analyze and study the spatiotemporal patterns of hantavirus infection.

  6. Infinite Time Cellular Automata: A Real Computation Model

    CERN Document Server

    Givors, Fabien; Ollinger, Nicolas

    2010-01-01

    We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and infinite inputs; thus inheriting many of its properties. We then show how to simulate the canonical real computation model, BSS machines, with infinite time cellular automata in exactly \\omega steps.

  7. A cellular automata model for ant trails

    Indian Academy of Sciences (India)

    Sibel Gokce; Ozhan Kayacan

    2013-05-01

    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 (i) ant colony consists of two kinds of ants, goodand poor-smelling ants, (ii) ants might make U-turn for some special reasons. For some values of densities of good- and poor-smelling ants, the flux and mean velocity of the colony were studied as a function of density and evaporation rate of pheromone.

  8. Cellular Automata Models for Diffusion of Innovations

    CERN Document Server

    Fuks, H; Fuks, Henryk; Boccara, Nino

    1997-01-01

    We propose a probabilistic cellular automata model for the spread of innovations, rumors, news, etc. in a social system. The local rule used in the model is outertotalistic, and the range of interaction can vary. When the range R of the rule increases, the takeover time for innovation increases and converges toward its mean-field value, which is almost inversely proportional to R when R is large. Exact solutions for R=1 and $R=\\infty$ (mean-field) are presented, as well as simulation results for other values of R. The average local density is found to converge to a certain stationary value, which allows us to obtain a semi-phenomenological solution valid in the vicinity of the fixed point n=1 (for large t).

  9. Cellular automata

    CERN Document Server

    Codd, E F

    1968-01-01

    Cellular Automata presents the fundamental principles of homogeneous cellular systems. This book discusses the possibility of biochemical computers with self-reproducing capability.Organized into eight chapters, this book begins with an overview of some theorems dealing with conditions under which universal computation and construction can be exhibited in cellular spaces. This text then presents a design for a machine embedded in a cellular space or a machine that can compute all computable functions and construct a replica of itself in any accessible and sufficiently large region of t

  10. Modeling diffusion of innovations with probabilistic cellular automata

    CERN Document Server

    Boccara, N; Boccara, Nino; Fuks, Henryk

    1997-01-01

    We present a family of one-dimensional cellular automata modeling the diffusion of an innovation in a population. Starting from simple deterministic rules, we construct models parameterized by the interaction range and exhibiting a second-order phase transition. We show that the number of individuals who eventually keep adopting the innovation strongly depends on connectivity between individuals.

  11. A cellular automata evacuation model considering friction and repulsion

    Institute of Scientific and Technical Information of China (English)

    SONG Weiguo; YU Yanfei; FAN Weicheng; Zhang Heping

    2005-01-01

    There exist interactions among pedestrians and between pedestrian and environment in evacuation. These interactions include attraction, repulsion and friction that play key roles in human evacuation behaviors, speed and efficiency. Most former evacuation models focus on the attraction force, while repulsion and friction are not well modeled. As a kind of multi-particle self-driven model, the social force model introduced in recent years can represent those three forces but with low simulation efficiency because it is a continuous model with complex rules. Discrete models such as the cellular automata model and the lattice gas model have simple rules and high simulation efficiency, but are not quite suitable for interactions' simulation. In this paper, a new cellular automata model based on traditional models is introduced in which repulsion and friction are modeled quantitatively. It is indicated that the model can simulate some basic behaviors, e.g.arching and the "faster-is-slower" phenomenon, in evacuation as multi-particle self-driven models, but with high efficiency as the normal cellular automata model and the lattice gas model.

  12. Station Model for Rail Transit System Using Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    XUN Jing; NING Bin; LI Ke-Ping

    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.

  13. A cellular automata model with probability infection and spatial dispersion

    Institute of Scientific and Technical Information of China (English)

    Jin Zhen; Liu Quan-Xing; Mainul Haque

    2007-01-01

    In this article, we have proposed an epidemic model based on the probability cellular automata theory. The essential mathematical features are analysed with the help of stability theory. We have given an alternative modelling approach for the spatiotemporal system which is more realistic from the practical point of view. A discrete and spatiotemporal approach is shown by using cellular automata theory. It is interesting to note that both the size of the endemic equilibrium and the density of the individuals increase with the increase of the neighbourhood size and infection rate, but the infections decrease with the increase of the recovery rate. The stability of the system around the positive interior equilibrium has been shown by using a suitable Lyapunov function. Finally, experimental data simulation for SARS disease in China in 2003 and a brief discussion are given.

  14. Cellular Automata Model for Elastic Solid Material

    Institute of Scientific and Technical Information of China (English)

    DONG Yin-Feng; ZHANG Guang-Cai; XU Ai-Guo; GAN Yan-Biao

    2013-01-01

    The Cellular Automaton (CA) modeling and simulation of solid dynamics is a long-standing difficult problem.In this paper we present a new two-dimensional CA model for solid dynamics.In this model the solid body is represented by a set of white and black particles alternatively positioned in the x-and y-directions.The force acting on each particle is represented by the linear summation of relative displacements of the nearest-neighboring particles.The key technique in this new model is the construction of eight coefficient matrices.Theoretical and numerical analyses show that the present model can be mathematically described by a conservative system.So,it works for elastic material.In the continuum limit the CA model recovers the well-known Navier equation.The coefficient matrices are related to the shear module and Poisson ratio of the material body.Compared with previous CA model for solid body,this model realizes the natural coupling of deformations in the x-and y-directions.Consequently,the wave phenomena related to the Poisson ratio effects are successfully recovered.This work advances significantly the CA modeling and simulation in the field of computational solid dynamics.

  15. Modeling evolution and immune system by cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Bezzi, M. [Scuola Internazionale Superiore di Studi Avanzati, Trieste (Italy); Istituto Nazionale di Fisica della Materia, Florence (Italy)

    2001-07-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.

  16. Microbial Growth Modeling and Simulation Based on Cellular Automata

    Directory of Open Access Journals (Sweden)

    Hong Men

    2013-07-01

    Full Text Available In order to simulate the micro-evolutionary process of the microbial growth, [Methods] in this study, we adopt two-dimensional cellular automata as its growth space. Based on evolutionary mechanism of microbial and cell-cell interactions, we adopt Moore neighborhood and make the transition rules. Finally, we construct the microbial growth model. [Results] It can describe the relationships among the cell growth, division and death. And also can effectively reflect spatial inhibition effect and substrate limitation effect. [Conclusions] The simulation results show that CA model is not only consistent with the classic microbial kinetic model, but also be able to simulate the microbial growth and evolution.

  17. Modeling self-organizing traffic lights with elementary cellular automata

    CERN Document Server

    Gershenson, Carlos

    2009-01-01

    There have been several highway traffic models proposed based on cellular automata. The simplest one is elementary cellular automaton rule 184. We extend this model to city traffic with cellular automata coupled at intersections using only rules 184, 252, and 136. The simplicity of the model offers a clear understanding of the main properties of city traffic and its phase transitions. We use the proposed model to compare two methods for coordinating traffic lights: a green-wave method that tries to optimize phases according to expected flows and a self-organizing method that adapts to the current traffic conditions. The self-organizing method delivers considerable improvements over the green-wave method. For low densities, the self-organizing method promotes the formation and coordination of platoons that flow freely in four directions, i.e. with a maximum velocity and no stops. For medium densities, the method allows a constant usage of the intersections, exploiting their maximum flux capacity. For high dens...

  18. 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.

  19. Modelling Nonlinear Sequence Generators in terms of Linear Cellular Automata

    CERN Document Server

    Fúster-Sabater, Amparo; 10.1016/j.apm.2005.08.013

    2010-01-01

    In this work, a wide family of LFSR-based sequence generators, the so-called Clock-Controlled Shrinking Generators (CCSGs), has been analyzed and identified with a subset of linear Cellular Automata (CA). In fact, a pair of linear models describing the behavior of the CCSGs can be derived. The algorithm that converts a given CCSG into a CA-based linear model is very simple and can be applied to CCSGs in a range of practical interest. The linearity of these cellular models can be advantageously used in two different ways: (a) for the analysis and/or cryptanalysis of the CCSGs and (b) for the reconstruction of the output sequence obtained from this kind of generators.

  20. Reversible quantum cellular automata

    CERN Document Server

    Schumacher, B

    2004-01-01

    We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions this allows us to give an explicit characterization of all local rules generating such automata. The same local rules also generate the global time step for automata with periodic boundary conditions. Our main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitary operations in a generalized Margolus partitioning scheme. This implies that, in contrast to the classical case, the inverse of a nearest neighbor quantum cellular automaton is again a nearest neighbor automaton. We present several construction methods for quantum cellular automata, based on unitaries commuting with their translates, on the quantization of (arbitrary) reversible classical cellular automata, on quantum c...

  1. Occupant evacuation model based on cellular automata in fire

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    By applying the rules set in traffic flow and pedestrian flow models, a basic cellular automata model is presented to simulate occupant evacuation in fire. Some extended models are introduced to study the special phenomena of evacuation from the fire room. The key of the models is the introduction of the danger grade which makes the route choice convenient and reasonable. Fire not only influences the emotional and behavioral characteristics of an individual but also affects his physical constitution, which reduces his maximal possible velocity. The models consider these influence factors by applying a set of simple but effective rules. It is needed to emphasize that all rules are established according to the essential phenomenon in fire evacuation, that is, all the occupants would try to move to the safest place as fast as possible. Some simulation examples are also presented to validate the applicability of the models.

  2. Modeling and simulation for train control system using cellular automata

    Institute of Scientific and Technical Information of China (English)

    LI; KePing; GAO; ZiYou; YANG; LiXing

    2007-01-01

    Train control system plays a key role in railway traffic. Its function is to manage and control the train movement on railway networks. In our previous works, based on the cellular automata (CA) model, we proposed several models and algorithms for simulating the train movement under different control system conditions. However, these models are only suitable for some simple traffic conditions. Some basic factors, which are important for train movement, are not considered. In this paper, we extend these models and algorithms and give a unified formula. Using the proposed method, we analyze and discuss the space-time diagram of railway traffic flow and the trajectories of the train movement. The numerical simulation and analytical results demonstrate that the unified CA model is an effective tool for simulating the train control system.

  3. Robustness of a Cellular Automata Model for the HIV Infection

    CERN Document Server

    Figueirêdo, P H; Santos, R M Zorzenon dos

    2008-01-01

    An investigation was conducted to study the robustness of the results obtained from the cellular automata model which describes the spread of the HIV infection within lymphoid tissues [R. M. Zorzenon dos Santos and S. Coutinho, Phys. Rev. Lett. 87, 168102 (2001)]. The analysis focussed on the dynamic behavior of the model when defined in lattices with different symmetries and dimensionalities. The results illustrated that the three-phase dynamics of the planar models suffered minor changes in relation to lattice symmetry variations and, while differences were observed regarding dimensionality changes, qualitative behavior was preserved. A further investigation was conducted into primary infection and sensitiveness of the latency period to variations of the model's stochastic parameters over wide ranging values. The variables characterizing primary infection and the latency period exhibited power-law behavior when the stochastic parameters varied over a few orders of magnitude. The power-law exponents were app...

  4. Critical Behavior in a Cellular Automata Animal Disease Transmission Model

    CERN Document Server

    Morley, P D; Chang, Julius

    2003-01-01

    Using a cellular automata model, we simulate the British Government Policy (BGP) in the 2001 foot and mouth epidemic in Great Britain. When clinical symptoms of the disease appeared on a farm, there is mandatory slaughter (culling) of all livestock on an infected premise (IP). Those farms that neighbor an IP (contiguous premise, CP), are also culled, aka nearest neighbor interaction. Farms where the disease may be prevalent from animal, human, vehicle or airborne transmission (dangerous contact, DC), are additionally culled, aka next-to-nearest neighbor iteractions and lightning factor. The resulting mathematical model possesses a phase transition, whereupon if the physical disease transmission kernel exceeds a critical value, catastrophic loss of animals ensues. The non-local disease transport probability can be as low as .01% per day and the disease can still be in the high mortality phase. We show that the fundamental equation for sustainable disease transport is the criticality equation for neutron fissio...

  5. Genetic Algorithm Calibration of Probabilistic Cellular Automata for Modeling Mining Permit Activity

    Science.gov (United States)

    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.

  6. Simple Cellular Automata-Based Linear Models for the Shrinking Generator

    CERN Document Server

    Fúster-Sabater, Amparo

    2010-01-01

    Structural properties of two well-known families of keystream generators, Shrinking Generators and Cellular Automata, have been analyzed. Emphasis is on the equivalence of the binary sequences obtained from both kinds of generators. In fact, Shrinking Generators (SG) can be identified with a subset of linear Cellular Automata (mainly rule 90, rule 150 or a hybrid combination of both rules). The linearity of these cellular models can be advantageously used in the cryptanalysis of those keystream generators.

  7. A cellular automata model of epidemics of a heterogeneous susceptibility

    Institute of Scientific and Technical Information of China (English)

    Jin Zhen; Liu Quan-Xing

    2006-01-01

    In this paper we present a model with spatial heterogeneity based on cellular automata (CA). In the model we consider the relevant heterogeneity of host (susceptible) mixing and the natural birth rate. We divide the susceptible population into three groups according to the immunity of each individual based on the classical susceptible-infectedremoved (SIR) epidemic models, and consider the spread of an infectious disease transmitted by direct contact among humans and vectors that have not an incubation period to become infectious. We test the local stability and instability of the disease-free equilibrium by the spectrum radii of Jacobian. The simulation shows that the structure of the nearest neighbour size of the cell (or the degree of the scale-free networks) plays a very important role in the spread properties of infectious disease. The positive equilibrium of the infections versus the neighbour size follows the third power law if an endemic equilibrium point exists. Finally, we analyse the feature of the infection waves for the homogeneity and heterogeneous cases respectively.

  8. Stochastic cellular automata model for stock market dynamics

    Science.gov (United States)

    Bartolozzi, M.; Thomas, A. W.

    2004-04-01

    In the present work we introduce a stochastic cellular automata model in order to simulate the dynamics of the stock market. A direct percolation method is used to create a hierarchy of clusters of active traders on a two-dimensional grid. Active traders are characterized by the decision to buy, σi (t)=+1 , or sell, σi (t)=-1 , a stock at a certain discrete time step. The remaining cells are inactive, σi (t)=0 . The trading dynamics is then determined by the stochastic interaction between traders belonging to the same cluster. Extreme, intermittent events, such as crashes or bubbles, are triggered by a phase transition in the state of the bigger clusters present on the grid, where almost all the active traders come to share the same spin orientation. Most of the stylized aspects of the financial market time series, including multifractal proprieties, are reproduced by the model. A direct comparison is made with the daily closures of the S&P500 index.

  9. Generic framework for mining cellular automata models on protein-folding simulations.

    Science.gov (United States)

    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.

  10. Cellular Automata Models Applied to the Study of Landslide Dynamics

    Science.gov (United States)

    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

  11. A study of a main-road cellular automata traffic flow model

    Institute of Scientific and Technical Information of China (English)

    黄乒花; 孔令江; 刘慕仁

    2002-01-01

    A main-road cellular automata traffic flow model on two dimensions is presented based on the Biham-Middleton-Levine traffic model. Its evolution equations are given and the self-organization and organization cooperation phenomenain this model are also studied by using computer simulation.

  12. A cellular automata intraurban model with prices and income-differentiated actors

    NARCIS (Netherlands)

    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 pri

  13. Cellular automata: structures

    OpenAIRE

    Ollinger, Nicolas

    2002-01-01

    Jury : François Blanchard (Rapporteur), Marianne Delorme (Directeur), Jarkko Kari (Président), Jacques Mazoyer (Directeur), Dominique Perrin, Géraud Sénizergues (Rapporteur); Cellular automata provide a uniform framework to study an important problem of "complex systems" theory: how and why do system with a easily understandable -- local -- microscopic behavior can generate a more complicated -- global -- macroscopic behavior? Since its introduction in the 40s, a lot of work has been done to ...

  14. Failover in cellular automata

    CERN Document Server

    Kumar, Shailesh

    2010-01-01

    A cellular automata (CA) configuration is constructed that exhibits emergent failover. The configuration is based on standard Game of Life rules. Gliders and glider-guns form the core messaging structure in the configuration. The blinker is represented as the basic computational unit, and it is shown how it can be recreated in case of a failure. Stateless failover using primary-backup mechanism is demonstrated. The details of the CA components used in the configuration and its working are described, and a simulation of the complete configuration is also presented.

  15. Reactive Programming of Cellular Automata

    OpenAIRE

    Boussinot, Frédéric

    2004-01-01

    Implementation of cellular automata using reactive programming gives a way to code cell behaviors in an abstract and modular way. Multiprocessing also becomes possible. The paper describes the implementation of cellular automata with the reactive programming language LOFT, a thread-based extension of C. Self replicating loops considered in artificial life are coded to show the interest of the approach.

  16. Excellent approach to modeling urban expansion by fuzzy cellular automata: agent base model

    Science.gov (United States)

    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.

  17. A cellular automata model for simulating fed-batch penicillin fermentation process

    Institute of Scientific and Technical Information of China (English)

    Yu Naigong; Ruan Xiaogang

    2006-01-01

    A cellular automata model to simulate penicillin fed-batch fermentation process(CAPFM)was established in this study,based on a morphologically structured dynamic penicillin production model,that is in turn based on the growth mechanism of penicillin producing microorganisms and the characteristics of penicillin fed-batch fermentation.CAPFM uses the three-dimensional cellular automata as a growth space,and a Moore-type neighborhood as the cellular neighborhood.The transition roles of CAPFM are designed based on mechanical and structural kinetic models of penicillin batch-fed fermentation processes.Every cell of CAPFM represents a single or specific number of penicillin producing microorganisms,and has various state.The simulation experimental results show that CAPFM replicates the evolutionary behavior of penicillin batch-fed fermentation processes described by the structured penicillin production kinetic model accordingly.

  18. A cellular automata model of Ebola virus dynamics

    Science.gov (United States)

    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.

  19. Public Evacuation Process Modeling and Simulatiaon Based on Cellular Automata

    Directory of Open Access Journals (Sweden)

    Zhikun Wang

    2013-11-01

    Full Text Available Considering attraction of the nearest exit, repulsive force of the fire, barrier and its display style, effect of fire exit location on escape time in fire hazard, a mathematical model of evacuation process model was build based on cellular automatic theory. The program was developed by JavaScript. The influencing factors of evacuation were obtained through the simulation model by inputting crew size, creating initial positions of crew and fire seat stochastically. The experimental results show that the evacuation simulation model with authenticity and validity, which has guiding significance for people evacuation and public escape system design.  

  20. A cellular automata traffic flow model considering the heterogeneity of acceleration and delay probability

    Science.gov (United States)

    Li, Qi-Lang; Wong, S. C.; Min, Jie; Tian, Shuo; Wang, Bing-Hong

    2016-08-01

    This study examines the cellular automata traffic flow model, which considers the heterogeneity of vehicle acceleration and the delay probability of vehicles. Computer simulations are used to identify three typical phases in the model: free-flow, synchronized flow, and wide moving traffic jam. In the synchronized flow region of the fundamental diagram, the low and high velocity vehicles compete with each other and play an important role in the evolution of the system. The analysis shows that there are two types of bistable phases. However, in the original Nagel and Schreckenberg cellular automata traffic model, there are only two kinds of traffic conditions, namely, free-flow and traffic jams. The synchronized flow phase and bistable phase have not been found.

  1. Benchmark study between FIDAP and a cellular automata code

    Science.gov (United States)

    Akau, R. L.; Stockman, H. W.

    A fluid flow benchmark exercise was conducted to compare results between a cellular automata code and FIDAP. Cellular automata codes are free from gridding constraints, and are generally used to model slow (Reynolds number approximately 1) flows around complex solid obstacles. However, the accuracy of cellular automata codes at higher Reynolds numbers, where inertial terms are significant, is not well-documented. In order to validate the cellular automata code, two fluids problems were investigated. For both problems, flow was assumed to be laminar, two-dimensional, isothermal, incompressible and periodic. Results showed that the cellular automata code simulated the overall behavior of the flow field.

  2. Cellular automata modelling of phase-change memories

    Institute of Scientific and Technical Information of China (English)

    Wanhua Yu; David Wright

    2008-01-01

    A novel approach to modelling phase-transition processes in phase change materials used for optical and electrical data storage applications is presented. The model is based on a cellular automaton (CA) approach to predict crystallization behaviour that is linked to thermal and electrical simulations to enable the study of the data writing and erasing processes. The CA approach is shown to be able to predict the evolution of the microstructure during the rapid heating and cooling cycles pertinent to data storage technology, and maps crystallization behaviour on the nanoscale. A simple example based on possible future nonvolatile phase-change random access solid-state memory is presented.

  3. Quantum features of natural cellular automata

    Science.gov (United States)

    Elze, Hans-Thomas

    2016-03-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.

  4. Quantum features of natural cellular automata

    CERN Document Server

    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 Schroedinger 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\\rightarrow 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...

  5. Free fall and cellular automata

    Directory of Open Access Journals (Sweden)

    Pablo Arrighi

    2016-03-01

    Full Text Available Three reasonable hypotheses lead to the thesis that physical phenomena can be described and simulated with cellular automata. In this work, we attempt to describe the motion of a particle upon which a constant force is applied, with a cellular automaton, in Newtonian physics, in Special Relativity, and in General Relativity. The results are very different for these three theories.

  6. About Strongly Universal Cellular Automata

    Directory of Open Access Journals (Sweden)

    Maurice Margenstern

    2013-09-01

    Full Text Available In this paper, we construct a strongly universal cellular automaton on the line with 11 states and the standard neighbourhood. We embed this construction into several tilings of the hyperbolic plane and of the hyperbolic 3D space giving rise to strongly universal cellular automata with 10 states.

  7. A generalized cellular automata approach to modeling first order enzyme kinetics

    Indian Academy of Sciences (India)

    Abhishek Dutta; Saurajyoti Kar; Advait Apte; Ingmar Nopens; Denis Constales

    2015-04-01

    Biochemical processes occur through intermediate steps which are associated with the formation of reaction complexes. These enzyme-catalyzed biochemical reactions are inhibited in a number of ways such as inhibitors competing for the binding site directly, inhibitors deforming the allosteric site or inhibitors changing the structure of active substrate. Using an in silico approach, the concentration of various reaction agents can be monitored at every single time step, which are otherwise difficult to analyze experimentally. Cell-based models with discrete state variables, such as Cellular Automata (CA) provide an understanding of the organizational principles of interacting cellular systems to link the individual cell (microscopic) dynamics wit a particular collective (macroscopic) phenomenon. In this study, a CA model representing a first order enzyme kinetics with inhibitor activity is formulated. The framework of enzyme reaction rules described in this study is probabilistic. An extended von Neumann neighborhood with periodic boundary condition is implemented on a two-dimensional (2D) lattice framework. The effect of lattice-size variation is studied followed by a sensitivity analysis of the model output to the probabilistic parameters which represent various kinetic reaction constants in the enzyme kinetic model. This provides a deeper insight into the sensitivity of the CA model to these parameters. It is observed that cellular automata can capture the essential features of a discrete real system, consisting of space, time and state, structured with simple local rules without making complex implementations but resulting in complex but explainable patterns.

  8. A cellular automata traffic flow modeling of desired speed variability

    Institute of Scientific and Technical Information of China (English)

    K.Bentaleb; K.Jetto; H.Ez-Zahraouy; A.Benyoussef

    2013-01-01

    The satisfaction rate of desired velocity in the case of a mixture of fast and slow vehicles is studied by using a cellular automaton method.It is found that at low density the satisfaction rate depends on the maximal velocity.However,the behavior of the satisfaction rate as a function of the coefficient of variance is independent of the maximal velocity.This is in good agreement with empirical results obtained by Lipshtat [Phys.Rev.E 79 066110 (2009)].Furthermore,our numerical result demonstrates that at low density the satisfaction rate takes higher values,whereas the coefficient of variance is close to zero.The coefficient of variance increases with increasing density,while the satisfaction rate decreases to zero.Moreover,we have also shown that,at low density the coefficient variance depends strongly on the probability of overtaking.

  9. A novel chaotic based image encryption using a hybrid model of deoxyribonucleic acid and cellular automata

    Science.gov (United States)

    Enayatifar, Rasul; Sadaei, Hossein Javedani; Abdullah, Abdul Hanan; Lee, Malrey; Isnin, Ismail Fauzi

    2015-08-01

    Currently, there are many studies have conducted on developing security of the digital image in order to protect such data while they are sending on the internet. This work aims to propose a new approach based on a hybrid model of the Tinkerbell chaotic map, deoxyribonucleic acid (DNA) and cellular automata (CA). DNA rules, DNA sequence XOR operator and CA rules are used simultaneously to encrypt the plain-image pixels. To determine rule number in DNA sequence and also CA, a 2-dimension Tinkerbell chaotic map is employed. Experimental results and computer simulations, both confirm that the proposed scheme not only demonstrates outstanding encryption, but also resists various typical attacks.

  10. Modeling Mixed Traffic Flow at Crosswalks in Micro-Simulations Using Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    DUAN Houli; ZHANG Yi

    2007-01-01

    The cellular automata (CA) micro-simulation model was used to describe the behavior of the mixed traffic flows at crosswalks where the pedestrians compete with the vehicles to cross the roadway. The focus of this paper is the behavior of pedestrians and the influence of pedestrians' behavior on the vehicle flow, pedestrian flows, and the vehicle waiting time. The proportion of pedestrians who do not obey traffic laws, the group effect, and expected waiting time of pedestrians, regarded as the most important pedestrian characteristics, are taken into consideration in the analysis. Simulation results show the ability of the microsimulation to capture the most important features of mixed traffic flow.

  11. 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.

  12. A new cellular automata model of traffic flow with negative exponential weighted look-ahead potential

    Science.gov (United States)

    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).

  13. Classifying cellular automata using grossone

    Science.gov (United States)

    D'Alotto, Louis

    2016-10-01

    This paper proposes an application of the Infinite Unit Axiom and grossone, introduced by Yaroslav Sergeyev (see [7] - [12]), to the development and classification of one and two-dimensional cellular automata. By the application of grossone, new and more precise nonarchimedean metrics on the space of definition for one and two-dimensional cellular automata are established. These new metrics allow us to do computations with infinitesimals. Hence configurations in the domain space of cellular automata can be infinitesimally close (but not equal). That is, they can agree at infinitely many places. Using the new metrics, open disks are defined and the number of points in each disk computed. The forward dynamics of a cellular automaton map are also studied by defined sets. It is also shown that using the Infinite Unit Axiom, the number of configurations that follow a given configuration, under the forward iterations of cellular automaton maps, can now be computed and hence a classification scheme developed based on this computation.

  14. 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.

  15. Numerical study on photoresist etching processes based on a cellular automata model

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    For the three-dimensional (3-D) numerical study of photoresist etching processes, the 2-D dynamic cellular automata (CA) model has been successfully extended to a 3-D dynamic CA model. Only the boundary cells will be processed in the 3-D dy-namic CA model and the structure of “if-else” description in the simulation pro-gram is avoided to speed up the simulation. The 3-D dynamic CA model has found to be stable, fast and accurate for the numerical study of photoresist etching processes. The exposure simulation, post-exposure bake (PEB) simulation and etching simulation are integrated together to further investigate the performances of the CA model. Simulation results have been compared with the available ex-perimental results and the simulations show good agreement with the available experiments.

  16. Numerical study on photoresist etching processes based on a cellular automata model

    Institute of Scientific and Technical Information of China (English)

    ZHOU ZaiFa; HUANG QingAn; LI WeiHua; LU Wei

    2007-01-01

    For the three-dimensional (3-D) numerical study of photoresist etching processes, the 2-D dynamic cellular automata (CA) model has been successfully extended to a 3-D dynamic CA model. Only the boundary cells will be processed in the 3-D dynamic CA model and the structure of "if-else" description in the simulation program is avoided to speed up the simulation. The 3-D dynamic CA model has found to be stable, fast and accurate for the numerical study of photoresist etching processes. The exposure simulation, post-exposure bake (PEB) simulation and etching simulation are integrated together to further investigate the performances of the CA model. Simulation results have been compared with the available experimental results and the simulations show good agreement with the available experiments.

  17. Identification of Nonstationary Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    AndrewI.Adamatzky

    1992-01-01

    The principal feature of nonstationary cellular automata(NCA) is that a local transitiol rule of each cell is changed at each time step depending on neighborhood configuration at previous time step.The identification problem for NCA is extraction of local transition rules and the establishment of mechanism for changing these rules using sequence of NCA configurations.We present serial and parallel algorithms for identification of NCA.

  18. Empirical results for pedestrian dynamics and their implications for cellular automata models

    CERN Document Server

    Schadschneider, Andreas

    2010-01-01

    A large number of models for pedestrian dynamics have been developed over the years. However, so far not much attention has been paid to their quantitative validation. Usually the focus is on the reproduction of empirically observed collective phenomena, as lane formation in counterflow. This can give an indication for the realism of the model, but practical applications, e.g. in safety analysis, require quantitative predictions. We discuss the current experimental situation, especially for the fundamental diagram which is the most important quantity needed for calibration. In addition we consider the implications for the modelling based on cellular automata. As specific example the floor field model is introduced. Apart from the properties of its fundamental diagram we discuss the implications of an egress experiment for the relevance of conflicts and friction effects.

  19. Multipartite cellular automata and the superposition principle

    Science.gov (United States)

    Elze, Hans-Thomas

    2016-05-01

    Cellular automata (CA) can show well known features of quantum mechanics (QM), such as a linear updating rule that resembles a discretized form of the Schrödinger equation together with its conservation laws. Surprisingly, a whole class of “natural” Hamiltonian CA, which are based entirely on integer-valued variables and couplings and derived from an action principle, can be mapped reversibly to continuum models with the help of sampling theory. This results in “deformed” quantum mechanical models with a finite discreteness scale l, which for l→0 reproduce the familiar continuum limit. Presently, we show, in particular, how such automata can form “multipartite” systems consistently with the tensor product structures of non-relativistic many-body QM, while maintaining the linearity of dynamics. Consequently, the superposition principle is fully operative already on the level of these primordial discrete deterministic automata, including the essential quantum effects of interference and entanglement.

  20. An algebraic study of unitary one dimensional quantum cellular automata

    CERN Document Server

    Arrighi, P

    2005-01-01

    We provide algebraic characterizations of unitary one dimensional quantum cellular automata. We do so both by algebraizing existing decision procedures, and by adding constraints into the model which do not change the quantum cellular automata's computational power. The configurations we consider have finite but unbounded size.

  1. A Two-Lane Cellular Automata Model with Influence of Next-Nearest Neighbor Vehicle

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    In this paper, we propose a new two-lane cellular automata model in which the influence of the next-nearest neighbor vehicle is considered. The attributes of the traffic system composed of fast-lane and slow-lane are investigated by the new traffic model. The simulation results show that the proposed two-lane traffic model can reproduce some traffic phenomena observed in real traffic, and that maximum flux and critical density are close to the field measurements.Moreover, the initial density distribution of the fast-lane and slow-lane has much influence on the traffic flow states.With the ratio between the densities of slow lane and fast lane increasing the lane changing frequency increases, but maximum flux decreases. Finally, the influence of the sensitivity coefficients is discussed.

  2. Modeling of the competition life cycle using the software complex of cellular automata PyCAlab

    Science.gov (United States)

    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.

  3. Directed Ligand Passage Over the Surface of Diffusion-Controlled Enzymes: A Cellular Automata Model

    CERN Document Server

    Ghaemi, M; Sarbolouki, M N; Ghaemi, Mehrdad; Rezaei-Ghaleh, Nasrollah; Sarbolouki, Mohammad-Nabi

    2004-01-01

    The rate-limiting step of some enzymatic reactions is a physical step, i.e. diffusion. The efficiency of such reactions can be improved through an increase in the arrival rate of the substrate molecules, e.g. by a directed passage of substrate (ligand) to active site after its random encounter with the enzyme surface. Herein, we introduce a cellular automata model simulating the ligand passage over the protein surface to its destined active site. The system is simulated using the lattice gas automata with probabilistic transition rules. Different distributions of amino acids over the protein surface are examined. For each distribution, the hydration pattern is achieved and the mean number of iteration steps needed for the ligand to arrive at the active site calculated. Comparison of results indicates that the rate at which ligand arrives at the active site is clearly affected by the distribution of amino acids outside the active side. Such a process can facilitate the ligand diffusion towards the active site ...

  4. Modeling and Simulation for Urban Rail Traffic Problem Based on Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    许琰; 曹成铉; 李明华; 罗金龙

    2012-01-01

    Based on the Nagel-Schreckenberg model, we propose a new cellular automata model to simulate the urban rail traffic flow under moving block system and present a new minimum instantaneous distance formula under pure moving block. We also analyze the characteristics of the urban rail traffic flow under the influence of train density, station dwell times, the length of train, and the train velocity. Train delays can be decreased effectively through flexible departure intervals according to the preceding train type before its departure. The results demonstrate that a suitable adjustment of the current train velocity based on the following train velocity can greatly shorten the minimum departure intervals and then increase the capacity of rail transit.

  5. THE RELATIONSHIPS OF THREE ELEMENTARY CELLULAR AUTOMATA

    Institute of Scientific and Technical Information of China (English)

    Zhisong JIANG

    2006-01-01

    Limit language complexity of cellular automata which is first posed by S. Wolfram has become a new branch of cellular automata. In this paper, we obtain two interesting relationships between elementary cellular automata of rules 126, 146(182) and 18, and prove that if the limit language of rule 18 is not regular, nor are the limit languages of rules 126 and 146(182).

  6. Asymptotic Behavior of Excitable Cellular Automata

    CERN Document Server

    Durrett, R; Durrett, Richard; Griffeath, David

    1993-01-01

    Abstract: We study two families of excitable cellular automata known as the Greenberg-Hastings Model (GHM) and the Cyclic Cellular Automaton (CCA). Each family consists of local deterministic oscillating lattice dynamics, with parallel discrete-time updating, parametrized by the range of interaction, the "shape" of its neighbor set, threshold value for contact updating, and number of possible states per site. GHM and CCA are mathematically tractable prototypes for the spatially distributed periodic wave activity of so-called excitable media observed in diverse disciplines of experimental science. Earlier work by Fisch, Gravner, and Griffeath studied the ergodic behavior of these excitable cellular automata on Z^2, and identified two distinct (but closely-related) elaborate phase portraits as the parameters vary. In particular, they noted the emergence of asymptotic phase diagrams (and Euclidean dynamics) in a well-defined threshold-range scaling limit. In this study we present several rigorous results and som...

  7. Modeling the shrub encroachment in the Northern Chihuahuan desert Grasslands using a Cellular Automata model

    Science.gov (United States)

    Caracciolo, Domenico; Istanbulluoglu, Erkan; Noto, Leonardo V.

    2014-05-01

    Arid grasslands of southwestern North America have changed dramatically over the last 150 years as a result of the shrub encroachment, i.e. the increase in density and biomass of indigenous shrubby plants in grasslands. Numerous studies have documented the expansion of shrublands in the southwestern America Grasslands; in particular the encroachment of shrubs in american deserts has strongly occurred in the Chihuahuan deserts from 1860. The Sevilleta National Wildlife Refuge (SNWR), located in the northern Chihuahuan desert shows a dramatic encroachment front of creosote bush (i.e., shrub) into native desert grassland. This encroachment has been here simulated using an Ecohydrological Cellular Automata Model, CATGraSS. CATGraSS is a spatially distributed model driven by spatially explicit irradiance and runs on a fine-resolution gridded domain. In the model, each cell can hold a single plant type or can represent bare soil. Plant competition is modeled by keeping track of mortality and establishment of plants, both calculated probabilistically based on soil moisture stress. For this study, the model is improved with a stochastic fire and a grazing function, and its plant establishment algorithm is modified. CATGraSS is implemented in a small area (7.3 km2) in SNWR, characterized by two vegetation types: grass savanna and creosote bush. The causes that have been considered for the encroachment in this case study are: the fire return period increase, the grazing increase, the seed dispersal caused by animals, the role of wind direction and the shrub-grass inhibition effect. The model is able to reproduce the encroachment occurred in the SNWR basin, simulating an increasing of the shrub from 2% in 1860 to 42% (i.e., current shrub percentage) in 2010 highlighting as more influent factors the reduced fire frequency and the increased grazing intensity. For the future management and encroachment control, the reduction of the fire return period and the grazing removal

  8. Astrobiological Complexity with Probabilistic Cellular Automata

    CERN Document Server

    Vukotić, B

    2012-01-01

    Search for extraterrestrial life and intelligence constitutes one of the major endeavors in science, but has yet been quantitatively modeled only rarely and in a cursory and superficial fashion. We argue that probabilistic cellular automata (PCA) represent the best quantitative framework for modeling astrobiological history of the Milky Way and its Galactic Habitable Zone. The relevant astrobiological parameters are to be modeled as the elements of the input probability matrix for the PCA kernel. With the underlying simplicity of the cellular automata constructs, this approach enables a quick analysis of large and ambiguous input parameters' space. We perform a simple clustering analysis of typical astrobiological histories and discuss the relevant boundary conditions of practical importance for planning and guiding actual empirical astrobiological and SETI projects. In addition to showing how the present framework is adaptable to more complex situations and updated observational databases from current and ne...

  9. 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.

  10. Designing beauty the art of cellular automata

    CERN Document Server

    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...

  11. A Vector-based Cellular Automata Model for Simulating Urban Land Use Change

    Institute of Scientific and Technical Information of China (English)

    LU Yi; CAO Min; ZHANG Lei

    2015-01-01

    Cellular Automata (CA) is widely used for the simulation of land use changes.This study applied a vector-based CA model to simulate land use change in order to minimize or eliminate the scale sensitivity in traditional raster-based CA model.The cells of vector-based CA model are presented according to the shapes and attributes of geographic entities,and the transition rules of vector-based CA model are improved by taking spatial variables of the study area into consideration.The vector-based CA model is applied to simulate land use changes in downtown of Qidong City,Jiangsu Province,China and its validation is confirmed by the methods of visual assessment and spatial accuracy.The simulation result of vector-based CA model reveals that nearly 75% of newly increased urban cells are located in the northwest and southwest parts of the study area from 2002 to 2007,which is in consistent with real land use map.In addition,the simulation results of the vector-based and raster-based CA models are compared to real land use data and their spatial accuracies are found to be 84.0% and 81.9%,respectively.In conclusion,results from this study indicate that the vector-based CA model is a practical and applicable method for the simulation of urbanization processes.

  12. 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.

  13. A Multitarget Land Use Change Simulation Model Based on Cellular Automata and Its Application

    Directory of Open Access Journals (Sweden)

    Jun Yang

    2014-01-01

    Full Text Available Based on the analysis of the existing land use change simulation model, combined with macroland use change driving factors and microlocal land use competition, and through the application of Python language integrated technical approaches such as CA, GIS, AHP, and Markov, a multitarget land use change simulation model based on cellular automata(CA is established. This model was applied to conduct scenario simulation of land use/cover change of the Jinzhou New District, based on 1:10000 map scale land use, planning, topography, statistics, and other data collected in the year of 1988, 2003, and 2012. The simulation results indicate the following: (1 this model can simulate the mutual transformation of multiple land use types in a relatively satisfactory way; it takes land use system as a whole and simultaneously takes the land use demand in the macrolevel and the land use suitability in the local scale into account; and (2 the simulation accuracy of the model reaches 72%, presenting higher creditability. The model is capable of providing auxiliary decision-making support for coastal regions with the analysis of the land use change driving mechanism, prediction of land use change tendencies, and establishment of land resource sustainable utilization policies.

  14. Integrating the system dynamic and cellular automata models to predict land use and land cover change

    Science.gov (United States)

    Xu, Xiaoming; Du, Ziqiang; Zhang, Hong

    2016-10-01

    Land use and land cover change (LULCC) is a widely researched topic in related studies. A number of models have been established to simulate LULCC patterns. However, the integration of the system dynamic (SD) and the cellular automata (CA) model have been rarely employed in LULCC simulations, although it allows for combining the advantages of each approach and therefore improving the simulation accuracy. In this study, we integrated an SD model and a CA model to predict LULCC under three future development scenarios in Northern Shanxi province of China, a typical agro-pastoral transitional zone. The results indicated that our integrated approach represented the impacts of natural and socioeconomic factors on LULCC well, and could accurately simulate the magnitude and spatial pattern of LULCC. The modeling scenarios illustrated that different development pathways would lead to various LULCC patterns. This study demonstrated the advantages of the integration approach for simulating LULCC and suggests that LULCC is affected to a large degree by natural and socioeconomic factors.

  15. A cellular automata-based model of Earth's magnetosphere in relation with Dst index

    Science.gov (United States)

    Banerjee, Adrija; Bej, Amaresh; Chatterjee, T. N.

    2015-05-01

    The disturbance storm time (Dst) index, a measure of the strength of a geomagnetic storm, is difficult to predict by some conventional methods due to its abstract structural complexity and stochastic nature though a timely geomagnetic storm warning could save society from huge economic losses and hours of related hazards. Self-organized criticality and the concept of many-body interactive nonlinear system can be considered an explanation for the fundamental mechanism of the nonstationary geomagnetic disturbances controlled by the perturbed interplanetary conditions. The present paper approaches this natural phenomena by a sandpile-like cellular automata-based model of magnetosphere, taking the real-time solar wind and both the direction and magnitude of the BZ component of the real-time interplanetary magnetic field as the system-controlling input parameters. Moreover, three new parameters had been introduced in the model which modify the functional relationships between the variables and regulate the dynamical behavior of the model to closely approximate the actual geomagnetic fluctuations. The statistical similarities between the dynamics of the model and that of the actual Dst index series during the entire 22nd solar cycle signifies the acceptability of the model.

  16. A new model for anaerobic processes of up-flow anaerobic sludge blanket reactors based on cellular automata

    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....

  17. Simulation of Evacuation Characteristics Using a 2-Dimensional Cellular Automata Model for Pedestrian Dynamics

    Directory of Open Access Journals (Sweden)

    Liqiang Ji

    2013-01-01

    Full Text Available In public places, the high pedestrian density is one of the direct causes leading to crowding and trample disaster, so it is very necessary to investigate the collective and evacuation characteristics for pedestrian movement. In the occupants’ evacuation process, the people-people interaction and the people-environment interaction are sufficiently considered in this paper, which have been divided into the exit attraction, the repulsion force between people, the friction between people, the repulsion force between human and barrier, and the attraction of surrounding people. Through analyzing the existing models, a new occupant evacuation cellular automata (CA model based on the social force model is presented, which overcomes the shortage of the high density crowd simulation and combines the advantages that CA has sample rules and faster calculating speed. The simulating result shows a great applicability for evacuation under the high density crowd condition, and the segregation phenomena have also been found in the bidirectional pedestrian flow. Besides these, setting isolated belt near the exit or entrance of underpass not only remarkably decreases the density and the risk of tramper disaster but also increases the evacuation efficiency, so it provides a new idea for infrastructure design about the exits and entrances.

  18. Quasi-classical modeling of molecular quantum-dot cellular automata multidriver gates

    Science.gov (United States)

    Rahimi, Ehsan; Nejad, Shahram Mohammad

    2012-05-01

    Molecular quantum-dot cellular automata (mQCA) has received considerable attention in nanoscience. Unlike the current-based molecular switches, where the digital data is represented by the on/off states of the switches, in mQCA devices, binary information is encoded in charge configuration within molecular redox centers. The mQCA paradigm allows high device density and ultra-low power consumption. Digital mQCA gates are the building blocks of circuits in this paradigm. Design and analysis of these gates require quantum chemical calculations, which are demanding in computer time and memory. Therefore, developing simple models to probe mQCA gates is of paramount importance. We derive a semi-classical model to study the steady-state output polarization of mQCA multidriver gates, directly from the two-state approximation in electron transfer theory. The accuracy and validity of this model are analyzed using full quantum chemistry calculations. A complete set of logic gates, including inverters and minority voters, are implemented to provide an appropriate test bench in the two-dot mQCA regime. We also briefly discuss how the QCADesigner tool could find its application in simulation of mQCA devices.

  19. Intrinsic Simulations between Stochastic Cellular Automata

    Directory of Open Access Journals (Sweden)

    Pablo Arrighi

    2012-08-01

    Full Text Available The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner. Armed with this formalism, we extend the notion of intrinsic simulation between deterministic cellular automata, to the non-deterministic and stochastic settings. We then provide explicit tools to prove or disprove the existence of such a simulation between two stochastic cellular automata, even though the intrinsic simulation relation is shown to be undecidable in dimension two and higher. The key result behind this is the caracterization of equality of stochastic global maps by the existence of a coupling between the random sources. We then prove that there is a universal non-deterministic cellular automaton, but no universal stochastic cellular automaton. Yet we provide stochastic cellular automata achieving optimal partial universality.

  20. Discrete geodesics and cellular automata

    CERN Document Server

    Arrighi, Pablo

    2015-01-01

    This paper proposes a dynamical notion of discrete geodesics, understood as straightest trajectories in discretized curved spacetime. The notion is generic, as it is formulated in terms of a general deviation function, but readily specializes to metric spaces such as discretized pseudo-riemannian manifolds. It is effective: an algorithm for computing these geodesics naturally follows, which allows numerical validation---as shown by computing the perihelion shift of a Mercury-like planet. It is consistent, in the continuum limit, with the standard notion of timelike geodesics in a pseudo-riemannian manifold. Whether the algorithm fits within the framework of cellular automata is discussed at length. KEYWORDS: Discrete connection, parallel transport, general relativity, Regge calculus.

  1. Cellular automata model for urban road traffic flow considering pedestrian crossing street

    Science.gov (United States)

    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.

  2. Should big cities grow? Scenario-based cellular automata urban growth modeling and policy applications

    Directory of Open Access Journals (Sweden)

    ChengHe Guan

    2016-12-01

    Full Text Available The formation of ‘Urban Networks’ has become a wide-spread phenomenon around the world. In the study of metropolitan regions, there are competing or diverging views about management and control of environmental and land-use factors as well as about scales and arrangements of settlements. Especially in China, these matters alongside of regulatory aspects, infrastructure applications, and resource allocations, are important because of population concentrations and the overlapping of urban areas with other land resources. On the other hand, the increasing sophistication of models operating on iterative computational power and widely-available spatial information and analytical techniques make it possible to simulate and investigate the spatial distribution of urban territories at a regional scale. This research applies a scenario-based Cellular Automata model to a case study of the Changjiang Delta Region, which produces useful and predictive scenario-based projections within the region, using quantitative methods and baseline conditions that address issues of regional urban development. The contribution of the research includes the improvement of computer simulation of urban growth, the application of urban form and other indices to evaluate complex urban conditions, and a heightened understanding of the performance of an urban network in the Changjiang Delta Region composed of big, medium, and small-sized cities and towns.

  3. 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.

  4. Cellular automata in Xenakis's music. Theory and Practice

    OpenAIRE

    Solomos, Makis

    2005-01-01

    International audience; Cellular automata are developed since some decades, belonging to the field of abstract automata. In the beginning of the 1980s, they were popularized in relationship with the study of dynamic systems and chaos theories. They were also applied for modelling the evolution of natural systems (for instance biological ones), especially in relationship with the idea of auto-organization. From the end of the 1980s since nowadays, several composers begin to use cellular automa...

  5. Densities and entropies in cellular automata

    CERN Document Server

    Guillon, Pierre

    2012-01-01

    Following work by Hochman and Meyerovitch on multidimensional SFT, we give computability-theoretic characterizations of the real numbers that can appear as the topological entropies of one-dimensional and two-dimensional cellular automata.

  6. Simulation of estrogen transport and behavior in laboratory soil columns using a cellular automata model

    Science.gov (United States)

    Chen, Qingcai; Shi, Jianghong; Liu, Xiaowei; Wu, Wei; Liu, Bo; Zhang, Hui

    2013-03-01

    A cellular automata model (CA model) was used to simulate the soil column leaching process of estrogens during the processes of migration and transformation. The results of the simulated leaching experiment showed that the first-order degradation rates of 17α-ethynylestradiol (EE2), 17β-estradiol (E2) and estrone (E1) were 0.131 h- 1 for E2, 0.099 h- 1 for E1 and 0.064 h- 1 for EE2 in the EE2 and E2 leaching process, and the first-order sorption rates were 5.94 h- 1 for E2, 5.63 h- 1 for EE2, 3.125 h- 1 for E1. Their sorption rates were positively correlated with the n-octanol/water partition coefficients. When the diffusion rate was low, its impact on the simulation results was insignificant. The increase in sorption and degradation rates caused the decrease in the total estrogens that leached. In addition, increasing the sorption rate could delay the emerging time of the maximum concentration of estrogen that leached, whereas increasing the degradation rate could shorten the emerging time of the maximum concentration of estrogen that leached. The comparison made between the experimental data and the simulation results of the CA model and the HYDRUS-1D software showed that the establishment of one-component and multi-component CA models could simulate EE2 and E2 soil column leaching processes, and the CA models achieve an intuitive, dynamic, and visual simulation.

  7. On the Behavior Characteristics of Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    CHEN Jin-cai; ZHANG Jiang-ling; FENG Dan

    2005-01-01

    In this paper, the inherent relationships between the running regulations and behavior characteristics of cellular automata are presented; an imprecise taxonomy of such systems is put forward; the three extreme cases of stable systems are discussed; and the illogicalness of evolutional strategies of cellular automata is analyzed. The result is suitable for the emulation and prediction of behavior of discrete dynamics systems; especially it can be taken as an important analysis means of dynamic performance of complex networks.

  8. Simulating debris flows through a hexagonal cellular automata model: SCIDDICA S3–hex

    Directory of Open Access Journals (Sweden)

    D. D’Ambrosio

    2003-01-01

    Full Text Available Cellular Automata (CA represent a formal frame for dynamical systems, which evolve on the base of local interactions. Some types of landslide, such as debris flows, match well this requirement. The latest hexagonal release (S3–hex of the deterministic model SCIDDICA, specifically developed for simulating debris flows, is described. For CA simulation purposes, landslides can be viewed as a dynamical system, subdivided into elementary parts, whose state evolves exclusively as a consequence of local interactions within a spatial and temporal discretum. Space is the world of the CA, here constituted by hexagonal cells. The attributes of each cell ("substates" describe physical characteristics. For computational reasons, the natural phenomenon is "decomposed" into a number of elementary processes, whose proper composition makes up the "transition function" of the CA. By simultaneously applying this function to all the cells, the evolution of the phenomenon can be simulated in terms of modifications of the substates. SCIDDICA S3–hex exhibits a great flexibility in modelling debris flows. With respect to the previous releases of the model, the mechanism of progressive erosion of the soil cover has been added to the transition function. Considered substates are: altitude; thickness and energy of landslide debris; depth of erodable soil cover; debris outflows. Considered elementary processes are: mobilisation triggering and effect (T1, debris outflows (I1, update of landslide debris thickness and energy (I2, and energy loss (T2.  Simulations of real debris flows, occurred in Campania (Southern Italy in May 1998 (Sarno and December 1999 (San Martino V.C. and Cervinara, have been performed for model calibration purposes; some examples of analysis are briefly described. Possible applications of the method are: risk mapping, also based on a statistical approach; evaluating the effects of mitigation actions (e.g. stream deviations, topographic

  9. Phase transitions in cellular automata models of spatial susceptible-infected-resistant-susceptible epidemics

    Institute of Scientific and Technical Information of China (English)

    Zheng Zhi-Zhen; Wang Ai-Ling

    2009-01-01

    Spatially explicit models have become widely used in today's mathematical ecology and epidemiology to study the persistence of populations. For simplicity, population dynamics is often analysed by using ordinary differential equations (ODEs) or partial differential equations (PDEs) in the one-dimensional (1D) space. An important question is to predict species extinction or persistence rate by mean of computer simulation based on the spatial model. Recently, it has been reported that stable turbulent and regular waves are persistent based on the spatial susceptible-infected-resistant-susceptible (SIRS) model by using the cellular automata (CA) method in the two-dimensional (2D) space [Proc. Natl. Acad. Sci. USA 101, 18246 (2004)]. In this paper, we address other important issues relevant to phase transitions of epidemic persistence. We are interested in assessing the significance of the risk of extinction in 1D space. Our results show that the 2D space can considerably increase the possibility of persistence of spread of epidemics when the degree distribution of the individuals is uniform, I.e. The pattern of 2D spatial persistence corresponding to extinction in a 1D system with the same parameters. The trade-offs of extinction and persistence between the infection period and infection rate are observed in the 1D case. Moreover, near the trade-off (phase transition) line, an independent estimation of the dynamic exponent can be performed, and it is in excellent agreement with the result obtained by using the conjectured relationship of directed percolation. We find that the introduction of a short-range diffusion and a long-range diffusion among the neighbourhoods can enhance the persistence and global disease spread in the space.

  10. Scalable asynchronous execution of cellular automata

    Science.gov (United States)

    Folino, Gianluigi; Giordano, Andrea; Mastroianni, Carlo

    2016-10-01

    The performance and scalability of cellular automata, when executed on parallel/distributed machines, are limited by the necessity of synchronizing all the nodes at each time step, i.e., a node can execute only after the execution of the previous step at all the other nodes. However, these synchronization requirements can be relaxed: a node can execute one step after synchronizing only with the adjacent nodes. In this fashion, different nodes can execute different time steps. This can be a notable advantageous in many novel and increasingly popular applications of cellular automata, such as smart city applications, simulation of natural phenomena, etc., in which the execution times can be different and variable, due to the heterogeneity of machines and/or data and/or executed functions. Indeed, a longer execution time at a node does not slow down the execution at all the other nodes but only at the neighboring nodes. This is particularly advantageous when the nodes that act as bottlenecks vary during the application execution. The goal of the paper is to analyze the benefits that can be achieved with the described asynchronous implementation of cellular automata, when compared to the classical all-to-all synchronization pattern. The performance and scalability have been evaluated through a Petri net model, as this model is very useful to represent the synchronization barrier among nodes. We examined the usual case in which the territory is partitioned into a number of regions, and the computation associated with a region is assigned to a computing node. We considered both the cases of mono-dimensional and two-dimensional partitioning. The results show that the advantage obtained through the asynchronous execution, when compared to the all-to-all synchronous approach is notable, and it can be as large as 90% in terms of speedup.

  11. Simulating Debris Flows Through A Hexagonal Cellular Automata Model: Sciddica (release S3a).

    Science.gov (United States)

    Iovine, G.; di Gregorio, S.; D'Ambrosio, D.; Lupiano, V.; Rongo, R.; Spataro, W.

    Cellular Automata (CA) are a powerful tool for modelling natural and artificial sys- tems that can be described in terms of local interactions among their constituent parts. Some types of landslides, such as debris flows, match well this requirement. The general frame and the latest, hexagonal release (S3a) of the deterministic, CA-based model SCIDDICA - specifically developed for simulating debris flows - are described. For simulation purposes, landslides can be viewed as a dynamical system, subdivided into elementary parts, whose state evolves exclusively as a consequence of local in- teractions within a spatial and temporal discretum. Space is the world of the CA, constituted by hexagonal cells. The attributes of each cell (namely "substates") de- scribe their average, physical characteristics. For computational reasons, the natural phenomenon to be simulated is "decomposed" into a number of elementary processes (local interactions), whose proper composition makes up the "transition function" of the CA. By simultaneously applying this function to all the cells, the evolution of the phenomenon can be simulated in terms of modifications of the substates. SCIDDICA- S3a exhibited great flexibility in modelling debris flows. With respect to its previous releases, the mechanism of progressive erosion of the detrital cover has been added to the transition function. Considered substates are: altitude, landslide debris amount and energy, depth and type of detrital cover, water content of the debris, debris out- flows and inflows. Considered elementary processes are: outflows and inflows, energy variation, detrital cover mobilisation, water loss, debris solidification. Simulations of real debris flows, occurred in Campania (Southern Italy) on May 1998 (Sarno) and on December 1999 (San Martino V.C. and Cervinara), are presented. The validation of the model required the best assessment of values to be assigned to empirical param- eters. After that, the application of the

  12. SELF-ORGANIZED CRITICALITY AND CELLULAR AUTOMATA

    Energy Technology Data Exchange (ETDEWEB)

    CREUTZ,M.

    2007-01-01

    Cellular automata provide a fascinating class of dynamical systems based on very simple rules of evolution yet capable of displaying highly complex behavior. These include simplified models for many phenomena seen in nature. Among other things, they provide insight into self-organized criticality, wherein dissipative systems naturally drive themselves to a critical state with important phenomena occurring over a wide range of length and the scales. This article begins with an overview of self-organized criticality. This is followed by a discussion of a few examples of simple cellular automaton systems, some of which may exhibit critical behavior. Finally, some of the fascinating exact mathematical properties of the Bak-Tang-Wiesenfeld sand-pile model [1] are discussed.

  13. Developing land use scenario dynamics model by the integration of system dynamics model and cellular automata model

    Institute of Scientific and Technical Information of China (English)

    HE; Chunyang; SHI; Peijun; CHEN; Jin; Li; Xiaobing; PAN; Ya

    2005-01-01

    Modeling land use scenario changes and its potential impacts on the structure and function of the ecosystem in the typical regions are helpful to understanding the interactive mechanism between land use system and ecological system. A Land Use Scenario Dynamics (LUSD) model by the integration of System Dynamics (SD) model and Cellular Automata (CA) model is developed with land use scenario changes in northern China in the next 20 years simulated in this paper. The basic idea of LUSD model is to simulate the land use scenario demands by using SD model at first, then allocate the land use scenario patterns at the local scale with the considerations of land use suitability, inheritance ability and neighborhood effect by using CA model to satisfy the balance between land use scenario demands and supply. The application of LUSD model in northern China suggests that the model has the ability to reflect the complex behavior of land use system at different scales to some extent and is a useful tool for assessing the potential impacts of land use system on ecological system. In addition, the simulated results also indicate that obvious land use changes will take place in the farming-pastoral zone of northern China in the next 20 years with cultivated land and urban land being the most active land use types.

  14. Modeling of Solidification Microstructures Based on Fully Coupling of Macro-transport Phenomena with Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    This paper has attempted to simulate the microstructure formation based on fully coupling of temperature field, concentration field and velocity field with micro-kinetics. The authors presented a new way, wlich is the combination of FDM and cellular automata (CAFD) to visualize the microstructure formation of the thin complex superalloy turbine blades cast by the vacuum investment process. The distribution, orientation and mechanism of the heterogeneous nucleation, the growth kinetics of dendrites and the columnar to equiaxed transition (CET) are considered. Capitalizing on these simulating schemes, the comprehensive influence of key process variables on the scale and uniformity of grains has been investigated quantitatively. The simulated grain size and morphology agree well with the experimental results.

  15. Infrared image enhancement using Cellular Automata

    Science.gov (United States)

    Qi, Wei; Han, Jing; Zhang, Yi; Bai, Lian-fa

    2016-05-01

    Image enhancement is a crucial technique for infrared images. The clear image details are important for improving the quality of infrared images in computer vision. In this paper, we propose a new enhancement method based on two priors via Cellular Automata. First, we directly learn the gradient distribution prior from the images via Cellular Automata. Second, considering the importance of image details, we propose a new gradient distribution error to encode the structure information via Cellular Automata. Finally, an iterative method is applied to remap the original image based on two priors, further improving the quality of enhanced image. Our method is simple in implementation, easy to understand, extensible to accommodate other vision tasks, and produces more accurate results. Experiments show that the proposed method performs better than other methods using qualitative and quantitative measures.

  16. Cell damage from radiation-induced bystander effects for different cell densities simulated by a mathematical model via cellular automata

    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)

  17. Simulating Complex Systems by Cellular Automata

    CERN Document Server

    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...

  18. Partitioned quantum cellular automata are intrinsically universal

    CERN Document Server

    Arrighi, Pablo

    2010-01-01

    There have been several non-axiomatic approaches taken to define Quantum Cellular Automata (QCA). Partitioned QCA (PQCA) are the most canonical of these non-axiomatic definitions. In this work we show that any QCA can be put into the form of a PQCA. Our construction reconciles all the non-axiomatic definitions of QCA, showing that they can all simulate one another, and hence that they are all equivalent to the axiomatic definition. This is achieved by defining generalised n-dimensional intrinsic simulation, which brings the computer science based concepts of simulation and universality closer to theoretical physics. The result is not only an important simplification of the QCA model, it also plays a key role in the identification of a minimal n-dimensional intrinsically universal QCA.

  19. An extended cost potential field cellular automata model considering behavior variation of pedestrian flow

    Science.gov (United States)

    Guo, Fang; Li, Xingli; Kuang, Hua; Bai, Yang; Zhou, Huaguo

    2016-11-01

    The original cost potential field cellular automata describing normal pedestrian evacuation is extended to study more general evacuation scenarios. Based on the cost potential field function, through considering the psychological characteristics of crowd under emergencies, the quantitative formula of behavior variation is introduced to reflect behavioral changes caused by psychology tension. The numerical simulations are performed to investigate the effects of the magnitude of behavior variation, the different pedestrian proportions with different behavior variation and other factors on the evacuation efficiency and process in a room. The spatiotemporal dynamic characteristic during the evacuation process is also discussed. The results show that compared with the normal evacuation, the behavior variation under an emergency does not necessarily lead to the decrease of the evacuation efficiency. At low density, the increase of the behavior variation can improve the evacuation efficiency, while at high density, the evacuation efficiency drops significantly with the increasing amplitude of the behavior variation. In addition, the larger proportion of pedestrian affected by the behavior variation will prolong the evacuation time.

  20. On the spatial dynamics and oscillatory behavior of a predator-prey model based on cellular automata and local particle swarm optimization.

    Science.gov (United States)

    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.

  1. Treatment Analysis in a Cancer Stem Cell Context Using a Tumor Growth Model Based on Cellular Automata.

    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.

  2. Some applications and prospects of cellular automata in traffic problems

    NARCIS (Netherlands)

    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 p

  3. A model for Intelligent Random Access Memory architecture (IRAM) cellular automata algorithms on the Associative String Processing machine (ASTRA)

    CERN Document Server

    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.

  4. Evaluation of Spatiotemporal Dynamics of Simulated Land Use/Cover in China Using a Probabilistic Cellular Automata-Markov Model

    Institute of Scientific and Technical Information of China (English)

    CHEN Xu; YU Shi-Xiao; ZHANG Ya-Ping

    2013-01-01

    Using the fuzzy rule-based classification method,normalized difference vegetation index (NDVI) images acquired from 1982 to 1998 were classified into seventeen phases.Based on these classification images,a probabilistic cellular automata-Markov Chain model was developed and used to simulate a land cover scenario of China for the year 2014.Spatiotemporal dynamics of land use/cover in China from 1982 to 2014 were then analyzed and evaluated.The results showed that the change trends of land cover type from 1998 to 2014 would be contrary to those from 1982 to 1998.In particular,forestland and grassland areas decreased by 1.56% and 1.46%,respectively,from 1982 to 1998,and should increase by 1.5% and 2.3% from 1998 to 2014,respectively.

  5. 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...

  6. The simulation and prediction of spatio-temporal urban growth trends using cellular automata models: A review

    Science.gov (United States)

    Aburas, Maher Milad; Ho, Yuek Ming; Ramli, Mohammad Firuz; Ash'aari, Zulfa Hanan

    2016-10-01

    In recent years, several types of simulation and prediction models have been used within a GIS environment to determine a realistic future for urban growth patterns. These models include quantitative and spatio-temporal techniques that are implemented to monitor urban growth. The results derived through these techniques are used to create future policies that take into account sustainable development and the demands of future generations. The aim of this paper is to provide a basis for a literature review of urban Cellular Automata (CA) models to find the most suitable approach for a realistic simulation of land use changes. The general characteristics of simulation models of urban growth and urban CA models are described, and the different techniques used in the design of these models are classified. The strengths and weaknesses of the various models are identified based on the analysis and discussion of the characteristics of these models. The results of the review confirm that the CA model is one of the strongest models for simulating urban growth patterns owing to its structure, simplicity, and possibility of evolution. Limitations of the CA model, namely weaknesses in the quantitative aspect, and the inability to include the driving forces of urban growth in the simulation process, may be minimized by integrating it with other quantitative models, such as via the Analytic Hierarchy Process (AHP), Markov Chain and frequency ratio models. Realistic simulation can be achieved when socioeconomic factors and spatial and temporal dimensions are integrated in the simulation process.

  7. Some Properties of Fractals Generated by Linear Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    倪天佳

    2003-01-01

    Fractals and cellular automata are both significant areas of research in nonlinear analysis. This paper studies a class of fractals generated by cellular automata. The patterns produced by cellular automata give a special sequence of sets in Euclidean space. The corresponding limit set is shown to be a fractal and the dimension is independent of the choice of the finite initial seed. As opposed to previous works, the fractals here do not depend on the time parameter.

  8. Game of Life Cellular Automata

    CERN Document Server

    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

  9. Steganography by using Logistic Map Function and Cellular Automata

    Directory of Open Access Journals (Sweden)

    Mehdi Alirezanejad

    2012-12-01

    Full Text Available A tradeoff between the hiding capacity of a cover image and the quality of a stego-image in steganographic schemes is inevitable. In this study a hybrid model of cellular automata and chaotic function is proposed for steganography. In this method, N-bits mask is used for choosing a pixel position in main image which is suitable for hiding one bit of secret data. This mask is generated in each stage by cellular automat and logistic map function. Using cellular automata and logistic map function cause more security and safety in proposed method. Studying the obtained results of the performed experiments, high resistance of the proposed method against brute-force and statistical invasions is obviously illustrated.

  10. An improved Cellular Automata model to simulate the behavior of high density crowd and validation by experimental data

    Science.gov (United States)

    Feliciani, Claudio; Nishinari, Katsuhiro

    2016-06-01

    In this article we present an improved version of the Cellular Automata floor field model making use of a sub-mesh system to increase the maximum density allowed during simulation and reproduce phenomena observed in dense crowds. In order to calibrate the model's parameters and to validate it we used data obtained from an empirical observation of bidirectional pedestrian flow. A good agreement was found between numerical simulation and experimental data and, in particular, the double outflow peak observed during the formation of deadlocks could be reproduced in numerical simulations, thus allowing the analysis of deadlock formation and dissolution. Finally, we used the developed high density model to compute the flow-ratio dependent fundamental diagram of bidirectional flow, demonstrating the instability of balanced flow and predicting the bidirectional flow behavior at very high densities. The model we presented here can be used to prevent dense crowd accidents in the future and to investigate the dynamics of the accidents which already occurred in the past. Additionally, fields such as granular and active matter physics may benefit from the developed framework to study different collective phenomena.

  11. Using a Cellular Automata-Markov Model to Reconstruct Spatial Land-Use Patterns in Zhenlai County, Northeast China

    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.

  12. Cellular non-deterministic automata and partial differential equations

    Science.gov (United States)

    Kohler, D.; Müller, J.; Wever, U.

    2015-09-01

    We define cellular non-deterministic automata (CNDA) in the spirit of non-deterministic automata theory. They are different from the well-known stochastic automata. We propose the concept of deterministic superautomata to analyze the dynamical behavior of a CNDA and show especially that a CNDA can be embedded in a deterministic cellular automaton. As an application we discuss a connection between certain partial differential equations and CNDA.

  13. An overview of quantum computation models: quantum automata

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Quantum automata,as theoretical models of quantum computers,include quantum finite automata (QFA),quantum sequential machines (QSM),quantum pushdown automata (QPDA),quantum Turing machines (QTM),quantum cellular automata (QCA),and the others,for example,automata theory based on quantum logic (orthomodular lattice-valued automata).In this paper,we try to outline a basic progress in the research on these models,focusing on QFA,QSM,QPDA,QTM,and orthomodular lattice-valued automata.Also,other models closely relative to them are mentioned.In particular,based on the existing results in the literature,we finally address a number of problems to be studied in future.

  14. Spatiotemporal Simulation of Tourist Town Growth Based on the Cellular Automata Model: The Case of Sanpo Town in Hebei Province

    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.

  15. THE COMPLEXITY OF LIMIT LANGUAGES OF CELLULAR AUTOMATA: AN EXAMPLE

    Institute of Scientific and Technical Information of China (English)

    XIE Huimin

    2001-01-01

    The limit languages of cellular automata are defined and theircomplexity are discussed. New tools, which include skew evolution, skew periodic string, trace string, some algebraic calculation method, and restricted membership problem, are developed through a discussion focusing on the limit language of an elementary cellular automata of rule 94.It is proved that this language is non-regular.

  16. Using Cellular Automata for Parking Recommendations in Smart Environments

    OpenAIRE

    Gwo-Jiun Horng

    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...

  17. DISCRETE ROTATIONS AND CELLULAR AUTOMATA

    OpenAIRE

    Nouvel, Bertrand

    2006-01-01

    In a discrete space, such as the set of integer-coordinate points, the modelization of isotropy may lead to noticeable theoretical difficulties. At this time, we do not know any gerometric theory on $\\ZZ^n$ that would be suitable to describe the isotropy the same way it is perceived by Euclidean geometry. With respect to this problematic, our aim is to describe some algorithms that would give to the discrete rotations some properties that would be similar to the properties of the Euclidean ro...

  18. Analysis and simulation of land use spatial pattern in Harbin prefecture based on trajectories and cellular automata-Markov modelling

    Science.gov (United States)

    Gong, Wenfeng; Yuan, Li; Fan, Wenyi; Stott, Philip

    2015-02-01

    There have been rapid population and accelerating urban growth with associated changes in land use and soil degradation in northeast China, an important grain-producing region. The development of integrated use of remote sensing, geographic information systems, and combined cellular automata- Markov models has provided new means of assessing changes in land use and land cover, and has enabled projection of trajectories into the future. We applied such techniques to the prefecture-level city of Harbin, the tenth largest city in China. We found that there had been significant losses of the land uses termed "cropland", "grassland", "wetland", and "floodplain" in favour of "built-up land" and lesser transformations from "floodplain" to "forestland" and "water body" over the 18-year period. However, the transition was not a simple process but a complex network of changes, interchanges, and multiple transitions. In the absence of effective land use policies, projection of past trajectories into a balance state in the future would result in the decline of cropland from 65.6% to 46.9% and the increase of built-up area from 7.7% to 23.0% relative to the total area of the prefecture in 1989. It also led to the virtual elimination of land use types such as unused wetland and floodplain.

  19. Nonsynchronous updating in the multiverse of cellular automata

    Science.gov (United States)

    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.

  20. Construction of living cellular automata using the Physarum plasmodium

    Science.gov (United States)

    Shirakawa, Tomohiro; Sato, Hiroshi; Ishiguro, Shinji

    2015-04-01

    The plasmodium of Physarum polycephalum is a unicellular and multinuclear giant amoeba that has an amorphous cell body. To clearly observe how the plasmodium makes decisions in its motile and exploratory behaviours, we developed a new experimental system to pseudo-discretize the motility of the organism. In our experimental space that has agar surfaces arranged in a two-dimensional lattice, the continuous and omnidirectional movement of the plasmodium was limited to the stepwise one, and the direction of the locomotion was also limited to four neighbours. In such an experimental system, a cellular automata-like system was constructed using the living cell. We further analysed the exploratory behaviours of the plasmodium by duplicating the experimental results in the simulation models of cellular automata. As a result, it was revealed that the behaviours of the plasmodium are not reproduced by only local state transition rules; and for the reproduction, a kind of historical rule setting is needed.

  1. 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

  2. Cellular automata in image processing and geometry

    CERN Document Server

    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...

  3. Changes in mangrove species assemblages and future prediction of the Bangladesh Sundarbans using Markov chain model and cellular automata.

    Science.gov (United States)

    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.

  4. Evolving Transport Networks With Cellular Automata Models Inspired by Slime Mould.

    Science.gov (United States)

    Tsompanas, Michail-Antisthenis I; Sirakoulis, Georgios Ch; Adamatzky, Andrew I

    2015-09-01

    Man-made transport networks and their design are closely related to the shortest path problem and considered amongst the most debated problems of computational intelligence. Apart from using conventional or bio-inspired computer algorithms, many researchers tried to solve this kind of problem using biological computing substrates, gas-discharge solvers, prototypes of a mobile droplet, and hot ice computers. In this aspect, another example of biological computer is the plasmodium of acellular slime mould Physarum polycephalum (P. polycephalum), which is a large single cell visible by an unaided eye and has been proven as a reliable living substrate for implementing biological computing devices for computational geometry, graph-theoretical problems, and optimization and imitation of transport networks. Although P. polycephalum is easy to experiment with, computing devices built with the living slime mould are extremely slow; it takes slime mould days to execute a computation. Consequently, mapping key computing mechanisms of the slime mould onto silicon would allow us to produce efficient bio-inspired computing devices to tackle with hard to solve computational intelligence problems like the aforementioned. Toward this direction, a cellular automaton (CA)-based, Physarum-inspired, network designing model is proposed. This novel CA-based model is inspired by the propagating strategy, the formation of tubular networks, and the computing abilities of the plasmodium of P. polycephalum. The results delivered by the CA model demonstrate a good match with several previously published results of experimental laboratory studies on imitation of man-made transport networks with P. polycephalum. Consequently, the proposed CA model can be used as a virtual, easy-to-access, and biomimicking laboratory emulator that will economize large time periods needed for biological experiments while producing networks almost identical to the tubular networks of the real-slime mould.

  5. Knowledge discovery for geographical cellular automata

    Institute of Scientific and Technical Information of China (English)

    LI Xia; Anthony Gar-On Yeh

    2005-01-01

    This paper proposes a new method for geographical simulation by applying data mining techniques to cellular automata. CA has strong capabilities in simulating complex systems. The core of CA is how to define transition rules. There are no good methods for defining these transition rules. They are usually defined by using heuristic methods and thus subject to uncertainties. Mathematical equations are used to represent transition rules implicitly and have limitations in capturing complex relationships. This paper demonstrates that the explicit transition rules of CA can be automatically reconstructed through the rule induction procedure of data mining. The proposed method can reduce the influences of individual knowledge and preferences in defining transition rules and generate more reliable simulation results. It can efficiently discover knowledge from a vast volume of spatial data.

  6. Particles and Patterns in Cellular Automata

    Energy Technology Data Exchange (ETDEWEB)

    Jen, E.; Das, R.; Beasley, C.E.

    1999-06-03

    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.

  7. 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.

  8. Mechanisms of shrub encroachment into Northern Chihuahuan Desert grasslands and impacts of climate change investigated using a cellular automata model

    Science.gov (United States)

    Caracciolo, Domenico; Istanbulluoglu, Erkan; Noto, Leonardo Valerio; Collins, Scott L.

    2016-05-01

    Arid and semiarid grasslands of southwestern North America have changed dramatically over the last 150 years as a result of woody plant encroachment. Overgrazing, reduced fire frequency, and climate change are known drivers of woody plant encroachment into grasslands. In this study, relatively simple algorithms for encroachment factors (i.e., grazing, grassland fires, and seed dispersal by grazers) are proposed and implemented in the ecohydrological Cellular-Automata Tree Grass Shrub Simulator (CATGraSS). CATGraSS is used in a 7.3 km2 rectangular domain located in central New Mexico along a zone of grassland to shrubland transition, where shrub encroachment is currently active. CATGraSS is calibrated and used to investigate the relative contributions of grazing, fire frequency, seed dispersal by herbivores and climate change on shrub abundance over a 150-year period of historical shrub encroachment. The impact of future climate change is examined using a model output that realistically represents current vegetation cover as initial condition, in a series of stochastic CATGraSS future climate simulations. Model simulations are found to be highly sensitive to the initial distribution of shrub cover. Encroachment factors more actively lead to shrub propagation within the domain when the model starts with randomly distributed individual shrubs. However, when shrubs are naturally evolved into clusters, the model response to encroachment factors is muted unless the effect of seed dispersal by herbivores is amplified. The relative contribution of different drivers on modeled shrub encroachment varied based on the initial shrub cover condition used in the model. When historical weather data is used, CATGraSS predicted loss of shrub and grass cover during the 1950 s drought. While future climate change is found to amplify shrub encroachment (∼13% more shrub cover by 2100), grazing remains the dominant factor promoting shrub encroachment. When we modeled future climate

  9. Stylized Facts Generated Through Cellular Automata Models. Case of Study: The Game of Life

    CERN Document Server

    Coronel-Brizio, H F; Rodriguez-Achach, M E; Stevens-Ramirez, G A

    2007-01-01

    In the present work, a geometrical method to generate a two dimensional random walk by means of a bidimensional Cellular Automaton is presented. We illustrate it by means of Conway's Game of Life with periodical borders, with a large lattice of 3000 x 3000 cells. The obtained random walk is of character anomalous, and its projection to a one dimensional random walk is analyzed, showing that it presents some statistical properties similar to the so-called stylized facts observed in financial time series. We consider that the procedure presented here is important not only because of its simplicity, but also because it could help us to understand and shed light on the stylized facts formation mechanism.

  10. 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

    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...

  11. Analytical investigation of the boundary-triggered phase transition dynamics in a cellular automata model with a slow-to-start rule

    Institute of Scientific and Technical Information of China (English)

    Jia Ning; Ma Shou-Feng; Zhong Shi-Quan

    2012-01-01

    Previous studies suggest that there are three different jam phases in the cellular automata automaton model with a slow-to-start rule under open boundaries.In the present paper,the dynamics of each free-flow-jam phase transition is studied.By analysing the microscopic behaviour of the traffic flow,we obtain analytical results on the phase transition dynamics.Our results can describe the detailed time evolution of the system during phase transition,while they provide good approximation for the numerical simulation data.These findings can perfectly explain the microscopic mechanism and details of the boundary-triggered phase transition dynamics.

  12. Long-range correlations of density fluctuations in the Kerner-Klenov-Wolf cellular automata three-phase traffic flow model.

    Science.gov (United States)

    Wu, J J; Sun, H J; Gao, Z Y

    2008-09-01

    Detrended fluctuation analysis (DFA) is a useful tool to measure the long-range power-law correlations in 1f noise. In this paper, we investigate the power-law dynamics behavior of the density fluctuation time series generated by the famous Kerner-Klenov-Wolf cellular automata model in road traffic. Then the complexities of spatiotemporal, average speed, and the average density have been analyzed in detail. By introducing the DFA method, our main observation is that the free flow and wide moving jam phases correspond to the long-range anticorrelations. On the contrary, at the synchronized flow phase, the long-range correlated property is observed.

  13. A New Model for Multi-Objective PMU Placement Considering Actual Worth of Uncertainties Using Cellular Learning Automata

    Directory of Open Access Journals (Sweden)

    Seyed Mahdi Mazhari

    2012-06-01

    Full Text Available Phasor measurement units (PMUS are crucial elements of wide-area state estimation system in Smart Grids, as they maintain a high quality observability on electrical quantities of power system. This paper proposes a new approach for multi-objective PMU placement considering actual worth of contingency conditions. Moreover, a new fitness function is introduced to simultaneously find the minimum number of PMUs as well as to maximize the measurement redundancies. In addition, a cellular learning automata based algoritm is employed for optimization process. The developed method is applied to IEEE test systems and obtained results are reported in several scenarios. Detailed numerical results and comparisons presented in the paper show that the proposed approach could noticeably improve the quality of problem solutions under uncertainties and can be used as an effective tool for multi-objective PMU placement within an actual large-scale transmission network.

  14. Ancient Jing De Zhen Dong He River Basin Kiln and Farmland Land-use Change Based on Cellular Automata and Cultural Algorithm Model

    Directory of Open Access Journals (Sweden)

    Liu Tao

    2013-09-01

    Full Text Available The aim of this study is to understand how farmland has transformed kiln in ancient Jing De Zhen Dong He River Basin; we created ancient virtual maps of study area and conducted a series of spatial analyses of the land-use pattern from the Yuan Dynasty to the Ming Dynasty. The results of the spatial analysis show that kiln can evolve from farmland, shrub, idle land etc. To simulate land-use change we developed a novel cellular automata model. Model parameters and neighborhood rules were obtained with the cellular automata model melt modified cultural algorithm. Virtual land-use maps from the Yuan Dynasty to the Ming Dynasty were used to implement the model with a time step of one year. Model performance was evaluated using Moran’s I index estimation for selected landscape pattern indices. The optimized parameter set using Particle Swarm Optimization poorly simulated land-use change as compared to the optimized parameter set using Cultural Algorithm. In summary, our results proved that the model is also effective and feasible in simulating farmland and kiln land-use evolution in ancient times when Geographic Information and System information were lacking.

  15. Accelerating cellular automata simulations using AVX and CUDA

    CERN Document Server

    Szkoda, Sebastian; Tykierko, Mateusz

    2012-01-01

    We investigated various methods of parallelization of the Frish-Hasslacher-Pomeau (FHP) cellular automata algorithm for modeling fluid flow. These methods include SSE, AVX, and POSIX Threads for central processing units (CPUs) and CUDA for graphics processing units (GPUs). We present implementation details of the FHP algorithm based on AVX/SSE and CUDA technologies. We found that (a) using AVX or SSE is necessary to fully utilize the potential of modern CPUs; (b) CPUs and GPUs are comparable in terms of computational and economic efficiency only if the CPU code uses AVX or SSE instructions; (c) AVX does not offer any substantial improvement relative to SSE.

  16. Cellular Automata with network incubation in information technology diffusion

    Science.gov (United States)

    Guseo, Renato; Guidolin, Mariangela

    2010-06-01

    Innovation diffusion of network goods determines direct network externalities that depress sales for long periods and delay full benefits. We model this effect through a multiplicative dynamic market potential driven by a latent individual threshold embedded in a special Cellular Automata representation. The corresponding mean field approximation of its aggregate version is a Riccati equation with a closed form solution. This allows the detection of a change-point time separating an incubation period from a subsequent take-off due to a collective threshold (critical mass). Weighted nonlinear least squares are the main inferential methodology. An application is analysed with reference to USA fax machine diffusion.

  17. On the topological sensitivity of cellular automata

    Science.gov (United States)

    Baetens, Jan M.; De Baets, Bernard

    2011-06-01

    Ever since the conceptualization of cellular automata (CA), much attention has been paid to the dynamical properties of these discrete dynamical systems, and, more in particular, to their sensitivity to the initial condition from which they are evolved. Yet, the sensitivity of CA to the topology upon which they are based has received only minor attention, such that a clear insight in this dependence is still lacking and, furthermore, a quantification of this so-called topological sensitivity has not yet been proposed. The lack of attention for this issue is rather surprising since CA are spatially explicit, which means that their dynamics is directly affected by their topology. To overcome these shortcomings, we propose topological Lyapunov exponents that measure the divergence of two close trajectories in phase space originating from a topological perturbation, and we relate them to a measure grasping the sensitivity of CA to their topology that relies on the concept of topological derivatives, which is introduced in this paper. The validity of the proposed methodology is illustrated for the 256 elementary CA and for a family of two-state irregular totalistic CA.

  18. Schema Redescription in Cellular Automata: Revisiting Emergence in Complex Systems

    CERN Document Server

    Marques-Pita, Manuel

    2011-01-01

    We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of individual input variables, and another to capture permutability in sets of input variables: fully characterizing the canalization present in Boolean functions. Two-symbol schemata explain aspects of the behaviour of automata networks that the characterization of their emergent patterns does not capture. We use our method to compare two well-known cellular automata for the density classification task: the human engineered CA GKL, and another obtained via genetic programming. We show that despite having very different collective behaviour, these rules are very similar. Indeed, GKL is a special case of GP. Therefore, we demonstrate that it is more feasible to compare cellular automata via schema redescriptions of their rules, than by looking at their emergent behaviour, leading us to question the tendency in complexity research to pay much m...

  19. Coupling of Markov chains and cellular automata spatial models to predict land cover changes (case study: upper Ci Leungsi catchment area)

    Science.gov (United States)

    Marko, K.; Zulkarnain, F.; Kusratmoko, E.

    2016-11-01

    Land cover changes particular in urban catchment area has been rapidly occur. Land cover changes occur as a result of increasing demand for built-up area. Various kinds of environmental and hydrological problems e.g. floods and urban heat island can happen if the changes are uncontrolled. This study aims to predict land cover changes using coupling of Markov chains and cellular automata. One of the most rapid land cover changes is occurs at upper Ci Leungsi catchment area that located near Bekasi City and Jakarta Metropolitan Area. Markov chains has a good ability to predict the probability of change statistically while cellular automata believed as a powerful method in reading the spatial patterns of change. Temporal land cover data was obtained by remote sensing satellite imageries. In addition, this study also used multi-criteria analysis to determine which driving factor that could stimulate the changes such as proximity, elevation, and slope. Coupling of these two methods could give better prediction model rather than just using it separately. The prediction model was validated using existing 2015 land cover data and shown a satisfactory kappa coefficient. The most significant increasing land cover is built-up area from 24% to 53%.

  20. 基于复合元胞自动机的分布式计算模型%A distributed computing model based on compound cellular automata

    Institute of Scientific and Technical Information of China (English)

    朱晓敏; 耿建东; 陈东华; 张润彤

    2012-01-01

    针对目前的分布式计算网络仍然缺乏较高的自治管理和自主认知能力,只能提供独立状态的服务,经常出现多点故障而造成分布式网络运作成本增加、延时加剧甚至网络崩溃等问题,将元胞自动机的相关概念及模型引入到分布式网络计算中,通过修正元胞自动机的原有机制,提出了复合元胞自动机模型,并建立了基于复合元胞自动机的分布式计算模型来提高分布式网络中认知自主管理能力,从而降低分布式计算成本和提高工作效率.通过模拟程序和GridSim软件包验证和展示了复合元胞自动机应用于分布式计算领域的可行性及优越性.%The concept of cellular automation and its model were introduced into distributed computation to solve current distributed computing networks' problems of high operating cost, serious time delay, and even debacle due to the multi-point failure caused by lack of high self-management and self-awareness and only providing independent services. By amending the original cellular automaton mechanism, a compound cellular automata model was proposed, and the distributed computing model based on compound cellular automata was established to enhance distributed networks' efficiency and reduce the operating cost. The comprehensive simulations and comparisons via GridSim verified the feasibility and efficiency of the proposed compound cellular automata model in the field of distributed computing.

  1. Mosquito population dynamics from cellular automata-based simulation

    Science.gov (United States)

    Syafarina, Inna; Sadikin, Rifki; Nuraini, Nuning

    2016-02-01

    In this paper we present an innovative model for simulating mosquito-vector population dynamics. The simulation consist of two stages: demography and dispersal dynamics. For demography simulation, we follow the existing model for modeling a mosquito life cycles. Moreover, we use cellular automata-based model for simulating dispersal of the vector. In simulation, each individual vector is able to move to other grid based on a random walk. Our model is also capable to represent immunity factor for each grid. We simulate the model to evaluate its correctness. Based on the simulations, we can conclude that our model is correct. However, our model need to be improved to find a realistic parameters to match real data.

  2. 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.

  3. 元胞自动机理论在金融市场建模中的应用%Application of Cellular Automata in Financial Market Modeling

    Institute of Scientific and Technical Information of China (English)

    李捷

    2013-01-01

    本文建立基于元胞自动机的金融市场演化模型,其中将市场交易者分为基础资产价值导向和技术分析导向两类,并通过模拟不同交易者的市场行为来建立演化模型,从而生成市场价格时间序列。文章对模型产出进行分析,发现价格序列表现出随机波动、尖峰厚尾和波动聚集等经典金融理论无法解释的金融市场特性,这些特性和实际金融市场有很高的相似度。因此论文得出结论:元胞自动机是探索金融复杂性的强有力工具。%Cellular automata modeling in financial market is introduced in this paper. The financial market model divides the traders in the market into two types: fundamental trader and charted trader. The behaviors of these two kind traders are simulated by the cells and rules in the cellular automata model. The price of the financial assets is the key output of the model, which is produced by the evolution of the cells’ inter-reacting. The price data series generated from the model fit the features of actual market well.

  4. Considering Forces in Cellular Automata Model for Crowd Evacuation%考虑作用力的人群疏散元胞自动机模型研究

    Institute of Scientific and Technical Information of China (English)

    张维; 郑小平; 程礼盛

    2013-01-01

      疏散者之间以及疏散者和环境之间的相互作用力,对拥挤状态下的人群疏散动力学具有重要影响。在对现有相关模型进行深入分析总结的基础上,提出了将可重叠多格子元胞结合修正地板场来考虑作用力效应的改进元胞自动机模型。对不同出口宽度和人群密度条件下的人群疏散动力学进行了对比研究。结果表明,在人群疏散的元胞自动机模型中加入人群拥挤受力作用机制,具有必要性;改进模型能更好地模拟人群疏散过程。%  The forces between evacuees and environment have an critical influence on the evacuation dynamics of crowds. Based on the analysis of current related models, an improved cellular automata model is proposed, which takes into account those forces by adopting both overlappable multi-grid cell and modified floor field. Comparative study of crowd dynamics against exit width and crowd density is carried out for the improved model and the traditional. The results reveal the necessity and rationality of involving crowding forces into the cellular automata model for evacuation simulations. This work is helpful to those researches of crowd dynamics by simulations.

  5. Cellular automata simulation of medication-induced autoimmune diseases

    Science.gov (United States)

    Stauffer, Dietrich; Proykova, Ana

    2004-01-01

    We implement the cellular automata model proposed by Stauffer and Weisbuch in 1992 to describe the response of the immune system to antigens in the presence of medications. The model contains two thresholds, θ1 and θ2, suggested by de Boer, Segel, and Perelson to present the minimum field needed to stimulate the proliferation of the receptors and to suppress it, respectively. The influence of the drug is mimicked by increasing the second threshold, thus enhancing the immune response. If this increase is too strong, the immune response is triggered in the whole immune repertoire, causing it to attack the own body. This effect is seen in our simulations to depend both on the ratio of the thresholds and on their absolute values.

  6. Using Shared Memory As A Cache In High Performance Cellular Automata Water Flow Simulations

    Directory of Open Access Journals (Sweden)

    Paweł Topa

    2013-01-01

    Full Text Available Graphics processors (GPU -- Graphic Processor Units recently have gained a lot of interest as an efficient platform for general-purpose computation. Cellular Automata approach which is inherently parallel gives the opportunity to implement high performance simulations. This paper presents how shared memory in GPU can be used to improve performance for Cellular Automata models. In our previous works, we proposed algorithms for Cellular Automata model that use only a GPU global memory. Using a profiling tool, we found bottlenecks in our approach. We introduce modifications that takes an advantage of fast shared memory. The modified algorithm is presented in details, and the results of profiling and performance test are demonstrated. Our unique achievement is comparing the efficiency of the same algorithm working with a global and shared memory.

  7. Spontaneous-braking and lane-changing effect on traffic congestion using cellular automata model applied to the two-lane traffic

    Directory of Open Access Journals (Sweden)

    Kohei Arai

    2012-08-01

    Full Text Available In the real traffic situations, vehicle would make a braking as the response to avoid collision with another vehicle or avoid some obstacle like potholes, snow, or pedestrian that crosses the road unexpectedly. However, in some cases the spontaneous-braking may occur even though there are no obstacles in front of the vehicle. In some country, the reckless driving behaviors such as sudden-stop by public-buses, motorcycle which changing lane too quickly, or tailgating make the probability of braking getting increase. The new aspect of this paper is the simulation of braking behavior of the driver and presents the new Cellular Automata model for describing this characteristic. Moreover, this paper also examines the impact of lane-changing maneuvers to reduce the number of traffic congestion that caused by spontaneous-braking behavior of the vehicles.

  8. 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

  9. Modeling Multiple-Core Updraft Plume Rise for an Aerial Ignition Prescribed Burn by Coupling Daysmoke with a Cellular Automata Fire Model

    Directory of Open Access Journals (Sweden)

    Yongqiang Liu

    2012-07-01

    Full Text Available Smoke plume rise is critically dependent on plume updraft structure. Smoke plumes from landscape burns (forest and agricultural burns are typically structured into “sub-plumes” or multiple-core updrafts with the number of updraft cores depending on characteristics of the landscape, fire, fuels, and weather. The number of updraft cores determines the efficiency of vertical transport of heat and particulate matter and therefore plume rise. Daysmoke, an empirical-stochastic plume rise model designed for simulating wildland fire plumes, requires updraft core number as an input. In this study, updraft core number was gained via a cellular automata fire model applied to an aerial ignition prescribed burn conducted at Eglin AFB on 6 February 2011. Typically four updraft cores were simulated in agreement with a photo-image of the plume showing three/four distinct sub-plumes. Other Daysmoke input variables were calculated including maximum initial updraft core diameter, updraft core vertical velocity, and relative emissions production. Daysmoke simulated a vertical tower that mushroomed 1,000 m above the mixing height. Plume rise was validated by ceilometer. Simulations with two temperature profiles found 89–93 percent of the PM2.5 released during the flaming phase was transported into the free atmosphere above the mixing layer. The minimal ground-level smoke concentrations were verified by a small network of particulate samplers. Implications of these results for inclusion of wildland fire smoke in air quality models are discussed.

  10. Quantum state transfer through noisy quantum cellular automata

    Science.gov (United States)

    Avalle, Michele; Genoni, Marco G.; Serafini, Alessio

    2015-05-01

    We model the transport of an unknown quantum state on one dimensional qubit lattices by means of a quantum cellular automata (QCA) evolution. We do this by first introducing a class of discrete noisy dynamics, in the first excitation sector, in which a wide group of classical stochastic dynamics is embedded within the more general formalism of quantum operations. We then extend the Hilbert space of the system to accommodate a global vacuum state, thus allowing for the transport of initial on-site coherences besides excitations, and determine the dynamical constraints that define the class of noisy QCA in this subspace. We then study the transport performance through numerical simulations, showing that for some instances of the dynamics perfect quantum state transfer is attainable. Our approach provides one with a natural description of both unitary and open quantum evolutions, where the homogeneity and locality of interactions allow one to take into account several forms of quantum noise in a plausible scenario.

  11. Simple cellular automata to mimic foraging ants submitted to abduction

    CERN Document Server

    Tejera, F

    2015-01-01

    Many species of ants forage by building up two files: an outbound one moving from the nest to the foraging area, and a nestbound one, returning from it to the nest. Those files are eventually submitted to different threats. If the danger is concentrated at one point of the file, one might expect that ants returning to the nest will pass danger information to their nestmates moving in the opposite direction towards the danger area. In this paper, we construct simple cellular automata models for foraging ants submitted to localized abduction, were danger information is transmitted using different protocols, including the possibility of no transmission. The parameters we have used in the simulations have been estimated from actual experiments under natural conditions. So, it would be easy to test our information-transmission hypothese in real experiments. Preliminary experimental results published elsewhere suggest that the behavior of foraging ants of the species Atta insularis is best described using the hypot...

  12. Return of the Quantum Cellular Automata: Episode VI

    Science.gov (United States)

    Carr, Lincoln D.; Hillberry, Logan E.; Rall, Patrick; Halpern, Nicole Yunger; Bao, Ning; Montangero, Simone

    2016-05-01

    There are now over 150 quantum simulators or analog quantum computers worldwide. Although exploring quantum phase transitions, many-body localization, and the generalized Gibbs ensemble are exciting and worthwhile endeavors, there are totally untapped directions we have not yet pursued. One of these is quantum cellular automata. In the past a principal goal of quantum cellular automata was to reproduce continuum single particle quantum physics such as the Schrodinger or Dirac equation from simple rule sets. Now that we begin to really understand entanglement and many-body quantum physics at a deeper level, quantum cellular automata present new possibilities. We explore several time evolution schemes on simple spin chains leading to high degrees of quantum complexity and nontrivial quantum dynamics. We explain how the 256 known classical elementary cellular automata reduce to just a few exciting quantum cases. Our analysis tools include mutual information based complex networks as well as more familiar quantifiers like sound speed and diffusion rate. Funded by NSF and AFOSR.

  13. Completely reproducible description of digital sound data with cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Wada, Masato; Kuroiwa, Jousuke; Nara, Shigetoshi

    2002-12-30

    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.

  14. Boolean linear differential operators on elementary cellular automata

    Science.gov (United States)

    Martín Del Rey, Ángel

    2014-12-01

    In this paper, the notion of boolean linear differential operator (BLDO) on elementary cellular automata (ECA) is introduced and some of their more important properties are studied. Special attention is paid to those differential operators whose coefficients are the ECA with rule numbers 90 and 150.

  15. Modeling Urban Expansion in Bangkok Metropolitan Region Using Demographic–Economic Data through Cellular Automata-Markov Chain and Multi-Layer Perceptron-Markov Chain Models

    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.

  16. Quantum cellular automata and free quantum field theory

    Science.gov (United States)

    D'Ariano, Giacomo Mauro; Perinotti, Paolo

    2017-02-01

    In a series of recent papers [1-4] it has been shown how free quantum field theory can be derived without using mechanical primitives (including space-time, special relativity, quantization rules, etc.), but only considering the easiest quantum algorithm encompassing a countable set of quantum systems whose network of interactions satisfies the simple principles of unitarity, homogeneity, locality, and isotropy. This has opened the route to extending the axiomatic information-theoretic derivation of the quantum theory of abstract systems [5, 6] to include quantum field theory. The inherent discrete nature of the informational axiomatization leads to an extension of quantum field theory to a quantum cellular automata theory, where the usual field theory is recovered in a regime where the discrete structure of the automata cannot be probed. A simple heuristic argument sets the scale of discreteness to the Planck scale, and the customary physical regime where discreteness is not visible is the relativistic one of small wavevectors. In this paper we provide a thorough derivation from principles that in the most general case the graph of the quantum cellular automaton is the Cayley graph of a finitely presented group, and showing how for the case corresponding to Euclidean emergent space (where the group resorts to an Abelian one) the automata leads to Weyl, Dirac and Maxwell field dynamics in the relativistic limit. We conclude with some perspectives towards the more general scenario of non-linear automata for interacting quantum field theory.

  17. Modelling and analysis of Markov reward automata

    NARCIS (Netherlands)

    Guck, Dennis; Timmer, Mark; Hatefi, Hassan; Ruijters, Enno; Stoelinga, Mariëlle

    2014-01-01

    Costs and rewards are important ingredients for many types of systems, modelling critical aspects like energy consumption, task completion, repair costs, and memory usage. This paper introduces Markov reward automata, an extension of Markov automata that allows the modelling of systems incorporating

  18. 元胞自动机可逆性研究%Research on Reversibility of Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    刘栋

    2011-01-01

    Cellular automata is an important theoretical tool of modeling complex adaptive system. As a necessary condition of simulating physics reversible space, reversibility is an important attribute of cellular automata. This paper introduces basic concept, reversibility and computability about cellular automata, and describes how one-dimensional reversible cellular automata are computationally universal.%元胞自动机是对复杂适应系统建模的重要理论工具.可逆性是元胞自动机的一个重要属性,是模拟物理可逆空间的必要条件.本文介绍元胞自动机的基本概念、可逆性和可计算性,并介绍一维可逆元胞自动机可计算的证明思路.

  19. Simulation of changes in heavy metal contamination in farmland soils of a typical manufacturing center through logistic-based cellular automata modeling.

    Science.gov (United States)

    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 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.

  20. Nanosensor Data Processor in Quantum-Dot Cellular Automata

    OpenAIRE

    Fenghui Yao; Mohamed Saleh Zein-Sabatto; Guifeng Shao; Mohammad Bodruzzaman; Mohan Malkani

    2014-01-01

    Quantum-dot cellular automata (QCA) is an attractive nanotechnology with the potential alterative to CMOS technology. QCA provides an interesting paradigm for faster speed, smaller size, and lower power consumption in comparison to transistor-based technology, in both communication and computation. This paper describes the design of a 4-bit multifunction nanosensor data processor (NSDP). The functions of NSDP contain (i) sending the preprocessed raw data to high-level processor, (ii) counting...

  1. Using cellular automata for parking recommendations in smart environments.

    Directory of Open Access Journals (Sweden)

    Gwo-Jiun Horng

    Full Text Available 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.

  2. Using cellular automata for parking recommendations in smart environments.

    Science.gov (United States)

    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.

  3. Generalized Cayley Graphs and Cellular Automata over them

    CERN Document Server

    Arrighi, Pablo; Nesme, Vincent

    2012-01-01

    Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their equality; to name all vertices relative to a point; the fact that they have a well-defined notion of translation, and that they can be endowed with a compact metric. We propose a notion of graph associated to a language, which conserves or generalizes these features. Whereas Cayley graphs are regular; associated graphs are arbitrary, although of a bounded degree. Moreover, it is well-known that cellular automata can be characterized as the set of translation-invariant continuous functions for a distance on the set of configurations that makes it a compact metric space; this point of view makes it easy to extend their definition from grids to Cayley graphs. Similarly, we extend their definition to these arbitrary, bounded degree, time-varying graphs. KEYWORDS: Causal Graph Dynamics, Curtis-Hedlund-Lynden, Dynamical networks, Boolean networks, Generative networks automata, Graph Autom...

  4. Markov chains-cellular automata modeling and multicriteria analysis of land cover change in the Lower Nhecolândia subregion of the Brazilian Pantanal wetland

    Science.gov (United States)

    Bacani, Vitor Matheus; Sakamoto, Arnaldo Yoso; Quénol, Hervé; Vannier, Clémence; Corgne, Samuel

    2016-01-01

    The dynamics of land use/land cover change in the Lower Nhecolândia wetland are marked by deforestation for pasture expansion, resulting in a real threat to the ecological stability. The aim of our work was to analyze the spatial distribution of land cover changes in the Lower Nhecolândia from 1985 to 2013 and to predict changes in trends for 2040. The mapping of land cover changes was developed using Landsat satellite images of 1985, 1999, 2007, and 2013, based on geographic object-based image analysis approach. This study uses integrated Markov chains and cellular automata modeling and multicriteria evaluation techniques to produce transition probability maps and describe the trajectory analysis methodology to construct a continuity of spatial and temporal changes for the wetland. The results of the multitemporal change detection classification show that, from 1985 to 2013, the forest woodland decreased by 6.89% and the grassland class increased by 18.29%. On the other hand, all water bodies showed a reducing trend, while the bare soil class increased compared to 1985, but did not present a regular trend of increase or decrease. From the present day, the trend for the future is a reduction of almost 6.4% by 2040. We found that deforestation actions will be concentrated in the areas with the highest concentration of saline lakes, constituting a serious threat to the natural functioning of this environmental system.

  5. Refining cellular automata with routing constraints

    OpenAIRE

    Millo, Jean-Vivien; De Simone, Robert

    2012-01-01

    A cellular automaton (CA) is an infinite array of cells, each containing the same automaton. The dynamics of a CA is distributed over the cells where each computes its next state as a function of the previous states of its neighborhood. Thus, the transmission of such states between neighbors is considered as feasible directly, in no time. When considering the implementation of a cellular automaton on a many-cores System-on-Chip (SoC), this state transmission is no longer abstract and instanta...

  6. Modeling the effect of microscopic driving behaviors on Kerner's time-delayed traffic breakdown at traffic signal using cellular automata

    Science.gov (United States)

    Wang, Yang; Chen, Yan-Yan

    2016-12-01

    The signalized traffic is considerably complex due to the fact that various driving behaviors have emerged to respond to traffic signals. However, the existing cellular automaton models take the signal-vehicle interactions into account inadequately, resulting in a potential risk that vehicular traffic flow dynamics may not be completely explored. To remedy this defect, this paper proposes a more realistic cellular automaton model by incorporating a number of the driving behaviors typically observed when the vehicles are approaching a traffic light. In particular, the anticipatory behavior proposed in this paper is realized with a perception factor designed by considering the vehicle speed implicitly and the gap to its preceding vehicle explicitly. Numerical simulations have been performed based on a signal controlled road which is partitioned into three sections according to the different reactions of drivers. The effects of microscopic driving behaviors on Kerner's time-delayed traffic breakdown at signal (Kerner 2011, 2013) have been investigated with the assistance of spatiotemporal pattern and trajectory analysis. Furthermore, the contributions of the driving behaviors on the traffic breakdown have been statistically examined. Finally, with the activation of the anticipatory behavior, the influences of the other driving behaviors on the formation of platoon have been investigated in terms of the number of platoons, the averaged platoon size, and the averaged flow rate.

  7. Modeling the shrub and juniper encroachment in the western north America grasslands with a Cellular Automata model

    Science.gov (United States)

    Caracciolo, D.; Istanbulluoglu, E.; Noto, L. V.

    2013-12-01

    Arid and semiarid grasslands of western North America have experienced dramatic changes over the last 150 years as a result of woody plant encroachment (WPE). WPE is characterized as increase in density, cover and biomass of indigenous tree or shrubby plants in grasslands. In this study we examine the environmental factors that trigger and further the progress of WPE at two semiarid sites using the CATGraSS ecohydrologic plant coexistence model. CATGraSS is a spatially distributed model driven by spatially explicit irradiance and runs on a fine-resolution gridded domain. In CATGraSS each cell can hold a single plant type or can remain empty. Plant competition is modeled by keeping track of mortality and establishment of plants, both calculated probabilistically based on soil moisture stress. For this study CATGraSS is improved with a stochastic fire and a grazing function, and its plant establishment algorithm is modified. Using CATGraSS shrub encroachment is studied in the Sevilleta National Wildlife Refuge (SNWR), New Mexico, located in the northern Chihuahuan desert. The area shows a dramatic encroachment front of Larrea tridentata (shrub) into native desert grassland. The model is implemented in a small area (7.3 km2) in SNWR. The second study site is a small catchment (11.8 km2) located within the Ochoco National Forest, Crook County, OR, where Juniper encroachment has been observed since the mid 1800s. The outcome of the changes in observed climate, fire frequency, and grazing intensity are investigated through numerical modeling scenarios. While in the Ochoco National Forest basin, the Western Juniper encroaches all the study area and the shrub disappears. In the SNWR basin, the model is able to reproduce the encroachment, simulating an increasing of the shrub from 2% in 1860 to 42% in 2010 (actual shrub percentage) highlighting as more influent factors the reduced fire frequency and the increased grazing intensity.

  8. Modeling mechanical restriction differences between car and heavy truck in two-lane cellular automata traffic flow model

    Science.gov (United States)

    Li, Xin; Li, Xingang; Xiao, Yao; Jia, Bin

    2016-06-01

    Real traffic is heterogeneous with car and truck. Due to mechanical restrictions, the car and the truck have different limited deceleration capabilities, which are important factors in safety driving. This paper extends the single lane safety driving (SD) model with limited deceleration capability to two-lane SD model, in which car-truck heterogeneous traffic is considered. A car has a larger limited deceleration capability while a heavy truck has a smaller limited deceleration capability as a result of loaded goods. Then the safety driving conditions are different as the types of the following and the leading vehicles vary. In order to eliminate the well-known plug in heterogeneous two-lane traffic, it is assumed that heavy truck has active deceleration behavior when the heavy truck perceives the forming plug. The lane-changing decisions are also determined by the safety driving conditions. The fundamental diagram, spatiotemporal diagram, and lane-changing frequency were investigated to show the effect of mechanical restriction on heterogeneous traffic flow. It was shown that there would be still three traffic phases in heterogeneous traffic condition; the active deceleration of the heavy truck could well eliminate the plug; the lane-changing frequency was low in synchronized flow; the flow and velocity would decrease as the proportion of heavy truck grows or the limited deceleration capability of heavy truck drops; and the flow could be improved with lane control measures.

  9. Modeling land use and land cover changes in a vulnerable coastal region using artificial neural networks and cellular automata.

    Science.gov (United States)

    Qiang, Yi; Lam, Nina S N

    2015-03-01

    As one of the most vulnerable coasts in the continental USA, the Lower Mississippi River Basin (LMRB) region has endured numerous hazards over the past decades. The sustainability of this region has drawn great attention from the international, national, and local communities, wanting to understand how the region as a system develops under intense interplay between the natural and human factors. A major problem in this deltaic region is significant land loss over the years due to a combination of natural and human factors. The main scientific and management questions are what factors contribute to the land use land cover (LULC) changes in this region, can we model the changes, and how would the LULC look like in the future given the current factors? This study analyzed the LULC changes of the region between 1996 and 2006 by utilizing an artificial neural network (ANN) to derive the LULC change rules from 15 human and natural variables. The rules were then used to simulate future scenarios in a cellular automation model. A stochastic element was added in the model to represent factors that were not included in the current model. The analysis was conducted for two sub-regions in the study area for comparison. The results show that the derived ANN models could simulate the LULC changes with a high degree of accuracy (above 92 % on average). A total loss of 263 km(2) in wetlands from 2006 to 2016 was projected, whereas the trend of forest loss will cease. These scenarios provide useful information to decision makers for better planning and management of the region.

  10. 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.

  11. A Novel Architecture for Quantum-Dot Cellular Automata Multiplexer

    Directory of Open Access Journals (Sweden)

    Arman Roohi

    2011-11-01

    Full Text Available Quantum-dot Cellular Automata (QCA technology is attractive due to its low power consumption, fast speed and small dimension; therefore it is a promising alternative to CMOS technology. Additionally, multiplexer is a useful part in many important circuits. In this paper we propose a novel design of 2:1 MUX in QCA. Moreover, a 4:1 multiplexer, an XOR gate and a latch are proposed based on our 2:1 multiplexer design. The simulation results have been verified using the QCADesigner.

  12. Two Novel Quantum-Dot Cellular Automata Full Adders

    OpenAIRE

    Mahdie Qanbari; Reza Sabbaghi-Nadooshan

    2013-01-01

    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 bett...

  13. Noisy Quantum Cellular Automata for Quantum versus Classical Excitation Transfer

    Science.gov (United States)

    Avalle, Michele; Serafini, Alessio

    2014-05-01

    We introduce a class of noisy quantum cellular automata on a qubit lattice that includes all classical Markov chains, as well as maps where quantum coherence between sites is allowed to build up over time. We apply such a construction to the problem of excitation transfer through 1D lattices, and compare the performance of classical and quantum dynamics with equal local transition probabilities. Our discrete approach has the merits of stripping down the complications of the open system dynamics, of clearly isolating coherent effects, and of allowing for an exact treatment of conditional dynamics, all while capturing a rich variety of dynamical behaviors.

  14. Chaotic Encryption Method Based on Life-Like Cellular Automata

    CERN Document Server

    Machicao, Marina Jeaneth; Bruno, Odemir M

    2011-01-01

    We propose a chaotic encryption method based on Cellular Automata(CA), specifically on the family called the "Life-Like" type. Thus, the encryption process lying on the pseudo-random numbers generated (PRNG) by each CA's evolution, which transforms the password as the initial conditions to encrypt messages. Moreover, is explored the dynamical behavior of CA to reach a "good" quality as PRNG based on measures to quantify "how chaotic a dynamical system is", through the combination of the entropy, Lyapunov exponent, and Hamming distance. Finally, we present the detailed security analysis based on experimental tests: DIEHARD and ENT suites, as well as Fouriers Power Spectrum, used as a security criteria.

  15. Nanosensor Data Processor in Quantum-Dot Cellular Automata

    Directory of Open Access Journals (Sweden)

    Fenghui Yao

    2014-01-01

    Full Text Available Quantum-dot cellular automata (QCA is an attractive nanotechnology with the potential alterative to CMOS technology. QCA provides an interesting paradigm for faster speed, smaller size, and lower power consumption in comparison to transistor-based technology, in both communication and computation. This paper describes the design of a 4-bit multifunction nanosensor data processor (NSDP. The functions of NSDP contain (i sending the preprocessed raw data to high-level processor, (ii counting the number of the active majority gates, and (iii generating the approximate sigmoid function. The whole system is designed and simulated with several different input data.

  16. A new phenomenon of quantum-dot cellular automata

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    Ifan external point charge and the movable charges of an isolated quantum-dot cellular automata (QCA) cell have the same polarity, the point charge greatly affects the polarization (P) of the cell only when it is in a narrow band with periodically changing width. The center of the band is on a radius R circle. The ratio of R to the electric charge (q) is a constant determined by the parameters of the cell. A QCA cell can be used as charge detector based on the above phenomenon.

  17. Synergistic cellular automata model for dissemination of Internet public opinion%因特网舆情传播的协同元胞自动机模型

    Institute of Scientific and Technical Information of China (English)

    方薇; 何留进; 宋良图

    2012-01-01

    现有的因特网舆情传播研究或者从话题文本增长一消亡过程的数学统计或智能学习出发,或者采用元胞自动机或隐马尔可夫模型(HMM)分析主题倾向度的演化过程.但这些研究均缺乏有关舆情主体属性对因特网舆情传播影响的分析.基于因特网舆情空间的系统协同性,首先计算元胞状态协同转移概率,同时将整体协同转移概率与中心元胞之九邻居局域状态概率比较,确定中心元胞状态是否转换.经过若干次时间序列的迭代计算,获得舆情整体传播趋向“+”或“-”的程度(磁化率).通过观察磁化率一时间变化曲线,能清楚地了解舆情传播的演化.在此基础上,提出一个扩展的协同元胞自动机模型及算法.仿真结果表明环境适应度参变量表达了网络舆情主体从众心理,其变化影响磁化率向多数人意见靠拢;而偏好参变量使网络舆情整体快速向“偏好”方向传播.该模型比较接近现实社会网络的舆情传播方式.%As for the present research on the dissemination of Internet Public Opinion ( IPO), some research use mathematic statistics or intelligent learning to analyze the growing or descending process of a topic related text, and some use cellular automata or Hidden Markov Model ( HMM) to find the tendency propagation of the subject of IPO. However, all of them lack the analyses of the impacts of the subject attributes in IPO on its tendency propagation. Based on the systematic synergy of IPO space, the synergistic transition probability between states on whole cells space of discussed IPO was computed firstly, and then it was compared with a local state probability in 9 neighbors of a central cell to decide whether the state of central cell should be converted. After several iterative operations, the degree (magnetisability) which expressed the tendency propagation upon to " + " or " - " was obtained. Through observing the magnetisability

  18. Debris-flow Susceptibility Assessment Through Cellular Automata Modelling: The Cases of Study of S. Martino V.c. and Cervinara (campania, Southern Italy)

    Science.gov (United States)

    Iovine, G.; di Gregorio, S.; D'Ambrosio, D.; Lupiano, V.; Merenda, L.; Nardi, G.

    On winter 1999, heavy rainfall severely stroke Campania region, triggering numerous debris flows on the slopes of the San Martino Valle Caudina-Cervinara area. Soil slips originated on the slopes, within the weathered volcaniclastic mantle of detrital cover overlying the carbonate skeleton of the massif. Debris slides soon turned into fast flow- ing mixtures of matrix and large blocks, downslope eroding the detrital mantle and increasing its original volume. At the base of the slopes, flows impacted on the urban areas, causing victims and severe destruction. Starting from a recent study on landslide risk conditions in Campania, carried out by the local Basin Authority, an evaluation of debris-flow susceptibility has been performed for n.8 selected areas ("red zones") of the above mentioned villages. According to that study, such red zones would be char- acterised by the highest risk levels (within the administrative boundaries of the same villages). Our susceptibility analysis has been performed by applying SCIDDICA-S3 - a Cellular Automata model, specifically developed, after the Sarno 1998 disaster, for simulating the spatial evolution of debris flows. Detailed topographic data and a map of the detrital coverage had to be given to the model, as input matrixes. A digi- tal "world" of hexagonal cells was adopted; type and amount of detrital mantle were collected through detailed field surveying. Real cases, selected among the landslides triggered on winter 1999, have been utilised for validating SCIDDICA and defining the best values for parameters: the validation has been carried out in a GIS environ- ment, by quantitatively comparing simulations with actual cases. Through geological evaluations, source locations of new phenomena have then been hypothesised within the red-zones. Initial volume for these new cases has been estimated by considering the actual statistics of the 1999 disaster. Finally, by merging the results of simulations, a deterministic

  19. A stochastic parameterization for deep convection using cellular automata

    Science.gov (United States)

    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

  20. Crowd evacuation model for large sports venues based on multi-Agent and Cellular Automata technology%Agent-CA的体育场馆人群疏散模型

    Institute of Scientific and Technical Information of China (English)

    曹爱春; 杨晓艇; 侯旭东

    2013-01-01

    A crowd evacuation model for large sports venues based on multi-agent and cellular automata technology according to the behavior characteristics and rules of evacuation is proposed. The cell in the cellular space occupied by virtual individuals is taken as an independent agent, and cellular and state are encapsulated and extended to the autonomy agent, and then individual differences are realized through the design of evacuation behavior strategy as the evolution rules to reflect the individual character, physical strength, mental effect on evacuation behavior. The evacuation simulation are carried out in sports venues. The results show that the proposed model fully considers the factors. Case evacuation is closer to the reality of large sports venues shortening the time of evacuation.%根据体育场馆人群疏散的特点与规律,提出一种基于多智能体和元胞自动机相融合的大型体育场馆人群疏散模型(Agent-CA)。将元胞空间中被虚拟人个体占据的元胞视为一个独立的智能体,将元胞及其状态进行封装,扩展为具有自主性的智能体,通过设计各种人群疏散行为策略做为演化规则,实现个体的差异性以体现个人个性、体力、心理等对疏散行为的影响,对体育场馆的人群疏散进行仿真实验。结果表明,Agent-CA综合了多智能体和元胞自动机的优点,充分考虑了个体内在因素,更接近现实大型体育场馆的人群疏散情形,缩短了疏散时间。

  1. Emergence of linguistic-like structures in one-dimensional cellular automata

    Science.gov (United States)

    Bertacchini, Francesca; Bilotta, Eleonora; Caldarola, Fabio; Pantano, Pietro; Bustamante, Leonardo Renteria

    2016-10-01

    In this paper we give a summary of some empirical investigations which show high analogies between Cellular Automata and linguistic structures. In particular we show as coupling regular domains of Cellular Automata we find complex emerging structures similar to combination of words, phonemes and morphemes in natural languages.

  2. Visualization of Gene Mutation Complicated Pattern of Hepatitis B Virus Based on Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    SHAO Shi-huang; XIAO Xuan; DING Yong-sheng; HUANG Zhen-de

    2005-01-01

    Hepatitis B virus shows instantaneous and high rate mutations in biological experiments, some sorts of which affect the efficiency of virus replication greatly through enhancing or depressing the viral replication, while others have no influence at all. Taking advantage of prominent features of cellular automata, we simulate the effect of hepatitis B virus gene mutation on its replication efficiency. The computer simulation results demonstrate the feasibility of our novel model by comparing with the results of biological experiments.

  3. A Snaking and Interweaving Bicycle Flow Model Based on Cellular Automata%基于元胞自动机的自行车流蛇行、穿插模型

    Institute of Scientific and Technical Information of China (English)

    邓建华

    2011-01-01

    通过重新定义元胞尺寸、状态值及元胞邻域,建立了自行车元胞自动机基本模型,并在基本模型中引入随机偏移概率来表达自行车不遵循车道行驶的特性.通过模型模拟运行,并对获得的自行车流参数进行分析,结果表明引入随机偏移概率能很好地描述自行车不遵循车道随机蛇行、穿插的特性.%Through the re-definition of cellular size, cellular state value and the neighborhood, The paper establishs a bicycle basic cellular automata model and introduc the stochastic offset probability in bicycle’s base cellular automata model innovatively to express the property of riding not following with one lane.Through models simulation, the paper analyzs the result of the bicycle flow-parameters of simulated models and shows that the stochastic offset probability is corresponding sufficiently to describe the bicycle’s snaking and interweaving property.

  4. Exploring Quantum Dot Cellular Automata Based Reversible Circuit

    Directory of Open Access Journals (Sweden)

    Saroj Kumar Chandra

    2012-03-01

    Full Text Available Quantum-dot Cellular Automata (QCA is a new technology for development of logic circuits based on nanotechnology, and it is an one of the alternative for designing high performance computing over existing CMOS technology. The basic logic in QCA does not use voltage level for logic representation rather it represent binary state by polarization of electrons on the Quantum Cell which is basic building block of QCA. Extensive work is going on QCA for circuit design due to low power consumption and regularity in the circuit.. Clocking is used in QCA circuit to synchronize and control the information flow and to provide the power to run the circuit. Reversible logic design is a well-known paradigm in digital computation, and if circuit developed is reversible then it consumes very low power. Here, in this paper we are presenting a Reversible Universal Gate (RUG based on Quantum-dot Cellular Automata (QCA. The RUG implemented by QCA Designer tool and also its behavior is simulated by it.

  5. Exploring Quantum Dot Cellular Automata Based Reversible Circuit

    Directory of Open Access Journals (Sweden)

    Saroj Kumar Chandra

    2012-03-01

    Full Text Available Quantum-dot Cellular Automata (QCA is a new technology for development of logic circuits based on nanotechnology, and it is an one of the alternative for designing high performance computing over existing CMOS technology. The basic logic in QCA does not use voltage level for logic representation rather it represent binary state by polarization of electrons on the Quantum Cell which is basic building block of QCA. Extensive work is going on QCA for circuit design due to low power consumption and regularity in the circuit.. Clocking is used in QCA circuit to synchronize and control the information flow and to provide the power to run the circuit. Reversible logic design is a well-known paradigm in digital computation, and if circuit developed is reversible then it consumes very low power . Here, in this paper we are presenting a Reversible Universal Gate (RUG based on Quantum-dot Cellular Automata (QCA. The RUG implemented by QCA Designer tool and also its behavior is simulated by it.

  6. Simulating three-dimensional hydrodynamics on a cellular-automata machine

    CERN Document Server

    Adler, C; Margolus, N H; Rothman, D H; Adler, Christopher; Boghosian, Bruce M; Margolus, Norman; Rothman, Daniel H

    1995-01-01

    We demonstrate how three-dimensional fluid flow simulations can be carried out on the Cellular Automata Machine 8 (CAM-8), a special-purpose computer for cellular-automata computations. The principal algorithmic innovation is the use of a lattice-gas model with a 16-bit collision operator that is specially adapted to the machine architecture. It is shown how the collision rules can be optimized to obtain a low viscosity of the fluid. Predictions of the viscosity based on a Boltzmann approximation agree well with measurements of the viscosity made on CAM-8. Several test simulations of flows in simple geometries -- channels, pipes, and a cubic array of spheres -- are carried out. Measurements of average flux in these geometries compare well with theoretical predictions.

  7. Using Cellular Automata to Investigate Pedestrian Conflicts with Vehicles in Crosswalk at Signalized Intersection

    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.

  8. Scale Sensitive Analysis of Cellular Automata Model%元胞自动机模型的尺度敏感性分析

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    以深圳市龙华镇为案例区,构建了土地利用/覆被变化的元胞自动机模型,从时间和空间两个方面定量研究了LUCC模型的尺度效应。通过改变模型输入数据的空间分辨率和模型模拟的时间长度,探讨了尺度对土地利用变化模型的影响。分别采用龙华镇1990年30,60,90,120,150,180,210和240 m空间分辨率的土地利用数据作为元胞自动机模型的输入,模拟研究区1995年和2000年的土地利用变化状况以诠释CA模型内在的尺度依赖特征,并依据模型的点对点模拟精度、Kappa系数、实际变化元胞的模拟精度3个指标评价了该%The authors present an analysis of how scale issues affect a cellular automata model of land use change developed for a research area in Longhua Town,Shenzhen City.The scale dependence of the model is explored by varying the resolution of the input data in 1990 used to calibrate the model and changing the length of model simulating time.To explore the impact of these scale relationships the model is run with input datasets constructed at the following spatial resolutions: 30,60,90,120,150,180,210 and 240 m for simulating land use in 1995 and 2000.Three kinds of indicator,i.e.point by point accuracy,Kappa and real change accuracy are used to assess the scale sensitivity of the model.The results show that 1) the more fine the cell sizes are,the higher the accuracy of the simulation results;2) path dependence of the isolated cells is an important source of the spatial scale sensitivity of CA model;3) the specific geographical process in different periods of time is an important source of the temporal sensitivity scale of CA model.The results have great significance for the scale selection of CA model.

  9. Applying genetic algorithms in a parallel computing environment for optimising parameters of complex cellular automata models: the case of SCIDDICA S3hex

    Science.gov (United States)

    D'Ambrosio, D.; Iovine, G.

    2003-04-01

    Cellular Automata (CA) offer a valid alternative to the classic approach, based on partial differential equation, in order to simulate complex phenomena, when these latter can be described in terms of local interactions among their constituent parts. SCIDDICA S3hex is a two-dimensional hexagonal CA model developed for simulating debris flows: it has recently been applied to several real cases of landslides occurred in Campania (Southern Italy). The release S3hex has been derived by progressively improving an initial simplified CA model, originally derived for simulating simple cases of flow-type landslides. The model requires information related to topography, thickness of erodable regolith overlying the bedrock, and location and extension of landslide sources. Performances depend on a set of global parameters which are utilised in the transition function of the model: their value affect the elementary processes of the transition function and thus the overall results. A fine calibration is therefore an essential phase, in order to evaluate the reliability of the model for successive applications to debris-flow susceptibility zonation. The complexity of both the model and the phenomena to be simulated suggested to employ an automated technique of evaluation, for the determination of the best set of global parameters. Genetic Algorithms (GA) are a powerful optimization tool inspired to natural selection. In the last decades, in spite of their intrinsic simplicity, they have largely been successfully applied on a wide number of highly complex problems. The calibration of the model could therefore be performed through such technique of optimisation, by considering several real cases of study. Owing to the large number of simulations generally needed for performing GA experiments on complex phenomena, which imply long lasting tests on sequential computational architectures, the adoption of a parallel computational environment seemed appropriate: the original source code

  10. Modelling and analysis of Markov reward automata (extended version)

    NARCIS (Netherlands)

    Guck, Dennis; Timmer, Mark; Hatefi, Hassan; Ruijters, Enno; Stoelinga, Mariëlle

    2014-01-01

    Costs and rewards are important ingredients for cyberphysical systems, modelling critical aspects like energy consumption, task completion, repair costs, and memory usage. This paper introduces Markov reward automata, an extension of Markov automata that allows the modelling of systems incorporating

  11. Evolutionary Computational Method of Facial Expression Analysis for Content-based Video Retrieval using 2-Dimensional Cellular Automata

    CERN Document Server

    Geetha, P

    2010-01-01

    In this paper, Deterministic Cellular Automata (DCA) based video shot classification and retrieval is proposed. The deterministic 2D Cellular automata model captures the human facial expressions, both spontaneous and posed. The determinism stems from the fact that the facial muscle actions are standardized by the encodings of Facial Action Coding System (FACS) and Action Units (AUs). Based on these encodings, we generate the set of evolutionary update rules of the DCA for each facial expression. We consider a Person-Independent Facial Expression Space (PIFES) to analyze the facial expressions based on Partitioned 2D-Cellular Automata which capture the dynamics of facial expressions and classify the shots based on it. Target video shot is retrieved by comparing the similar expression is obtained for the query frame's face with respect to the key faces expressions in the database video. Consecutive key face expressions in the database that are highly similar to the query frame's face, then the key faces are use...

  12. Power System Self-organized Criticality Simulation Model Based on Cellular Automata%基于元胞自动机的电力系统自组织临界特性仿真模型

    Institute of Scientific and Technical Information of China (English)

    于群; 曹娜; 郭剑波

    2011-01-01

    将元胞自动机理论应用到电力系统大停电机理研究中,提出并建立了用元胞自动机来模拟电网故障演化的电网故障元胞自动机模型,定义了电网故障元胞自动机模型中元胞、元胞空间、规则和邻居等的构成方法。利用电网故障元胞自动机模型,仿真研究了电网故障的传播演化过程,并对电网故障的自组织临界性(SOC)进行了验证。%By applying the theory of cellular automata in the evolutionary mechanism of the power system blackout,a model for simulating power failure with cellular automata is presented.The model defines the composing method of cells,cellular space,rules,neighbors,etc.The spread and evolution of power failure is investigated using proposed model and the self-organized criticality(SOC) of the power grid failure is verified. This work is supported by State Administration of Work Safety Project(No.10-052) and State Grid Corporation of China.

  13. Debris-flow susceptibility assessment through cellular automata modeling: an example from 15–16 December 1999 disaster at Cervinara and San Martino Valle Caudina (Campania, southern Italy

    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

  14. Debris-flow susceptibility assessment through cellular automata modeling: an example from 15Â 16 December 1999 disaster at Cervinara and San Martino Valle Caudina (Campania, southern Italy)

    Science.gov (United States)

    Iovine, G.; di Gregorio, S.; Lupiano, V.

    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 volume for these new cases

  15. Synchronization, TIGoRS, and Information Flow in Complex Systems: Dispositional Cellular Automata.

    Science.gov (United States)

    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.

  16. Simulating the Range Expansion of Spartina alterniflora in Ecological Engineering through Constrained Cellular Automata Model and GIS

    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.

  17. Cellular Automata Model Based on Safety Distance%基于安全距离的元胞自动机交通流模型研究

    Institute of Scientific and Technical Information of China (English)

    邱小平; 于丹; 孙若晓; 杨达

    2015-01-01

    With the traffic congestion increasing significantly, traffic safety level declines and traffic accident rate increases gradually. To improve driving safety, the length of the cellular cells is fined, and the Gipps’safe distance rule is introduced to improve the NaSch model, further, a new cellular automata traffic flow model is proposed. The Gipps’safe distance rule is widely proved to have good performance in describing the vehicle driving behavior. In addition, we use the field data to calibrate and evaluate the proposed model. The numerical simulation analysis is carried out to analyze the model. Model evaluation results show that the performance of the new model is better than NaSch model. The simulation results show that the improved model can describe the traffic flow characteristics well and can reproduce free flow, synchronized flow, congestion and other traffic phenomenon in the real traffic flow. Furthermore, the study also found that the drivers’overestimation of the maximum deceleration of vehicle ahead will lead to decreased road capacity. However, the drivers’overestimation of their own vehicle maximum deceleration will increase the capacity of the road, but is likely to cause unsafe driving behaviors and increase accident rate.%随着交通拥堵状况日益显著,整体交通安全性下降,交通事故率逐渐增大。基于提高驾驶安全性考虑,细化元胞长度,引入被广泛证明在描述车辆驾驶行为方面具有很高精度的Gipps安全距离规则,对NaSch模型进行改进,提出一个新的基于安全距离的元胞自动机交通流模型。采用实测数据对模型进行标定和评估,进一步对模型进行数值模拟分析。模型评估结果显示,新建立的模型相对NaSch模型精度更高。数值模拟结果表明,改进模型能够很好地表现交通流特性,再现实际交通中的自由流、同步流及拥堵流等交通现象。此外,还发现驾驶员对前车最大

  18. Applying causality principles to the axiomatization of probabilistic cellular automata

    CERN Document Server

    Arrighi, Pablo; Nesme, Vincent; Thierry, Eric

    2011-01-01

    Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global evolution G is required to be shift-invariant (it acts the same everywhere) and causal (information cannot be transmitted faster than some fixed number of cells per time step). At least in the classical, reversible and quantum cases, these two top-down axiomatic conditions are sufficient to entail more bottom-up, operational descriptions of G. We investigate whether the same is true in the probabilistic case. Keywords: Characterization, noise, Markov process, stochastic Einstein locality, screening-off, common cause principle, non-signalling, Multi-party non-local box.

  19. The Toothpick Sequence and Other Sequences from Cellular Automata

    CERN Document Server

    Applegate, David; Sloane, N J A

    2010-01-01

    A two-dimensional arrangement of toothpicks is constructed by the following iterative procedure. At stage 1, place a single toothpick of length 1 on a square grid, aligned with the y-axis. At each subsequent stage, for every exposed toothpick end, place an orthogonal toothpick centered at that end. The resulting structure has a fractal-like appearance. We will analyze the toothpick sequence, which gives the total number of toothpicks after n steps. We also study several related sequences that arise from enumerating active cells in cellular automata. Some unusual recurrences appear: a typical example is that instead of the Fibonacci recurrence, which we may write as a(2+i) = a(i) + a(i+1), we set n = 2^k+i (0 = 0} (1+x^{2^k-1}+2x^{2^k}) and variations thereof.

  20. Evolving cellular automata to perform computations. Final technical report

    Energy Technology Data Exchange (ETDEWEB)

    Crutchfield, J.P.; Mitchell, M.

    1998-04-01

    The overall goals of the project are to determine the usefulness of genetic algorithms (GAs) in designing spatially extended parallel systems to perform computational tasks and to develop theoretical frameworks both for understanding the computation in the systems evolved by the GA and for understanding the evolutionary process which successful systems are designed. In the original proposal the authors scheduled the first year of the project to be devoted to experimental grounding. During the first year they developed the simulation and graphics software necessary for doing experiments and analysis on one dimensional cellular automata (CAs), and they performed extensive experiments and analysis concerning two computational tasks--density classification and synchronization. Details of these experiments and results, and a list of resulting publications, were given in the 1994--1995 report. The authors scheduled the second year to be devoted to theoretical development. (A third year, to be funded by the National Science Foundation, will be devoted to applications.) Accordingly, most of the effort during the second year was spent on theory, both of GAs and of the CAs that they evolve. A central notion is that of the computational strategy of a CA, which they formalize in terms of domains, particles, and particle interactions. This formalization builds on the computational mechanics framework developed by Crutchfield and Hanson for understanding intrinsic computation in spatially extended dynamical systems. They have made significant progress in the following areas: (1) statistical dynamics of GAs; (2) formalizing particle based computation in cellular automata; and (3) computation in two-dimensional CAs.

  1. Efficient Modelling and Generation of Markov Automata

    NARCIS (Netherlands)

    Timmer, Mark; Katoen, Joost-Pieter; Pol, van de Jaco; Stoelinga, Mariëlle; Koutny, M.; Ulidowski, I.

    2012-01-01

    This paper introduces a framework for the efficient modelling and generation of Markov automata. It consists of (1) the data-rich process-algebraic language MAPA, allowing concise modelling of systems with nondeterminism, probability and Markovian timing; (2) a restricted form of the language, the M

  2. Integrating cellular automata, artificial neural network and fuzzy set theory to simulate threatened orchards: Application to Maragheh, Iran

    NARCIS (Netherlands)

    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 arti

  3. A Quantum Cellular Automata architecture with nearest neighbor interactions using one quantum gate type

    CERN Document Server

    Ntalaperas, D

    2016-01-01

    We propose an architecture based on Quantum cellular Automata which allows the use of only one type of quantum gates per computational step in order to perform nearest neighbor interactions. The model is built in partial steps, each one of them analyzed using nearest neighbor interactions, starting with single qubit operations and continuing with two qubit ones. The effectiveness of the model is tested and valuated by developing a quantum circuit implementing the Quantum Fourier Transform. The important outcome of this validation was that the operations are performed in a local and controlled manner thus reducing the error rate of each computational step.

  4. Electrical Treeing Propagation in Nanocomposites and the Role of Nanofillers: Simulationwith the Aid of Cellular Automata

    Science.gov (United States)

    Pitsa, Despoina; Vardakis, George; Danikas, Michael G.; Kozako, Masahiro

    2010-03-01

    In this paper the propagation of electrical treeing in nanodielectrics using the DIMET (Dielectric Inhomogeneity Model for Electrical Treeing) is studied. The DIMET is a model which simulates the growth of electrical treeing based on theory of Cellular Automata. Epoxy/glass nanocomposites are used as samples between a needle-plane electrode arrangement. The diameter of nanofillers is 100 nm. The electric treeing, which starts from the needle electrode, is examined. The treeing growth seems to be stopped by the nanofillers. The latter act as elementary barriers to the treeing propagation.

  5. Simple and Flexible Self-Reproducing Structures in Asynchronous Cellular Automata and Their Dynamics

    Science.gov (United States)

    Huang, Xin; Lee, Jia; Yang, Rui-Long; Zhu, Qing-Sheng

    2013-03-01

    Self-reproduction on asynchronous cellular automata (ACAs) has attracted wide attention due to the evident artifacts induced by synchronous updating. Asynchronous updating, which allows cells to undergo transitions independently at random times, might be more compatible with the natural processes occurring at micro-scale, but the dark side of the coin is the increment in the complexity of an ACA in order to accomplish stable self-reproduction. This paper proposes a novel model of self-timed cellular automata (STCAs), a special type of ACAs, where unsheathed loops are able to duplicate themselves reliably in parallel. The removal of sheath cannot only allow various loops with more flexible and compact structures to replicate themselves, but also reduce the number of cell states of the STCA as compared to the previous model adopting sheathed loops [Y. Takada, T. Isokawa, F. Peper and N. Matsui, Physica D227, 26 (2007)]. The lack of sheath, on the other hand, often tends to cause much more complicated interactions among loops, when all of them struggle independently to stretch out their constructing arms at the same time. In particular, such intense collisions may even cause the emergence of a mess of twisted constructing arms in the cellular space. By using a simple and natural method, our self-reproducing loops (SRLs) are able to retract their arms successively, thereby disentangling from the mess successfully.

  6. Design of arithmetic circuits in quantum dot cellular automata nanotechnology

    CERN Document Server

    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: ·  �...

  7. Text Extraction and Enhancement of Binary Images Using Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    G. Sahoo; Tapas Kumar; B.L. Rains; C.M. Bhatia

    2009-01-01

    Text characters embedded in images represent a rich source of information for content-based indexing and retrieval applications. However, these text characters are difficult to be detected and recognized due to their various sizes, grayscale values, and complex backgrounds. Existing methods cannot handle well those texts with different contrast or embedded in a complex image background. In this paper, a set of sequential algorithms for text extraction and enhancement of image using cellular automata are proposed. The image enhancement includes gray level, contrast manipulation, edge detection, and filtering. First, it applies edge detection and uses a threshold to filter out for low-contrast text and simplify complex background of high-contrast text from binary image. The proposed algorithm is simple and easy to use and requires only a sample texture binary image as an input. It generates textures with perceived quality, better than those proposed by earlier published techniques. The performance of our method is demonstrated by presenting experimental results for a set of text based binary images. The quality of thresholding is assessed using the precision and recall analysis of the resultant text in the binary image.

  8. Decomposing Complex, Macroscopic Phenomena Through A Set of Local Nonlinear Rules In A Cellular Automata Environment.

    Science.gov (United States)

    Avolio, M. V.; Crisci, G. M.; D'Ambrosio, D.; di Gregorio, S.; Iovine, G.; Rongo, R.; Spataro, W.

    Cellular Automata (CA) are able to capture the peculiar characteristics of systems, whose global evolution can be exclusively described on the basis of local interactions among their constituent parts ("a-centrism"). Such systems match the paradigm of parallelism with the a-centrism one. In modelling complex phenomena by means of classical CA, elementary automata characterised by few states and simple transition function have usually been involved. On the other hand, many complex macroscopic phenomena (even though characterised by properties of parallelism and a-centrism) can be very difficult to be modelled through classical CA, because of their hetero- geneous characteristics, which require a very large number of states. For such cases, which perfectly fit the general definition of CA, more complex transition rules (differ- ing from typical transition functions) would be, in fact, needed. Aiming at modelling these latter phenomena, an empirical method has been developed, based on the decom- position of the phenomenon into "elementary" components, whose behaviour can be described through local rules. Furthermore, criteria and conditions have been defined, in order to translate the local rules into a transition function, as needed for perform- ing cellular automata simulations. Applications of CA models to real cases of study have recently been attempted: landslides (earth flows, rock avalanches, debris flows), lava flows, soil erosion, soil contamination and bioremediation, forest fires have all been analysed through CA simulations, and encouraging results have been obtained. In the present paper, examples of application of the method for hazard evaluation are described, with particular reference to the Sarno 1998 debris flows and the Etna 2001 lava flows.

  9. Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology

    Directory of Open Access Journals (Sweden)

    Ville Salo

    2012-08-01

    Full Text Available We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also, reversible automata form a closed set, while surjective ones are dense. The second topology, which is induced by a metric, is studied in more detail. Continuity of composition (under certain restrictions and inversion, as well as closedness of the set of surjective automata, are proved, and some counterexamples are given. We then generalize this space, in the sense that every shift-invariant measure on the configuration space induces a pseudometric on cellular automata, and study the properties of these spaces. We also characterize the pseudometric spaces using the Besicovitch distance, and show a connection to the first (pathological space.

  10. Decentralized Cooperation Strategies in Two-Dimensional Traffic of Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    方峻; 覃征; 陈喜群; 冷彪; 徐朝晖; 江子能

    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.

  11. Decentralized Cooperation Strategies in Two-Dimensional Traffic of Cellular Automata

    Science.gov (United States)

    Fang, Jun; Qin, Zheng; Chen, Xi-Qun; Leng, Biao; Xu, Zhao-Hui; Jiang, Zi-Neng

    2012-12-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.

  12. A simple block representation of reversible cellular automata with time-symmetry

    CERN Document Server

    Arrighi, Pablo

    2012-01-01

    Reversible Cellular Automata (RCA) are a physics-like model of computation consisting of an array of identical cells, evolving in discrete time steps by iterating a global evolution G. Further, G is required to be shift-invariant (it acts the same everywhere), causal (information cannot be transmitted faster than some fixed number of cells per time step), and reversible (it has an inverse which verifies the same requirements). An important, though only recently studied special case is that of Time-symmetric Cellular Automata (TSCA), for which G and its inverse are related via a local operation. In this note we revisit the question of the Block representation of RCA, i.e. we provide a very simple proof of the existence of a reversible circuit description implementing G. This operational, bottom-up description of G turns out to be time-symmetric, suggesting interesting connections with TSCA. Indeed we prove, using a similar technique, that a wide class of them admit an Exact block representation (EBR), i.e. one...

  13. Cellular Automata on Graphs: Topological Properties of ER Graphs Evolved towards Low-Entropy Dynamics

    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.

  14. CCABC: Cyclic Cellular Automata Based Clustering For Energy Conservation in Sensor Networks

    CERN Document Server

    Banerjee, Indrajit; Rahaman, Hafizur

    2011-01-01

    Sensor network has been recognized as the most significant technology for next century. Despites of its potential application, wireless sensor network encounters resource restriction such as low power, reduced bandwidth and specially limited power sources. This work proposes an efficient technique for the conservation of energy in a wireless sensor network (WSN) by forming an effective cluster of the network nodes distributed over a wide range of geographical area. The clustering scheme is developed around a specified class of cellular automata (CA) referred to as the modified cyclic cellular automata (mCCA). It sets a number of nodes in stand-by mode at an instance of time without compromising the area of network coverage and thereby conserves the battery power. The proposed scheme also determines an effective cluster size where the inter-cluster and intra-cluster communication cost is minimum. The simulation results establish that the cyclic cellular automata based clustering for energy conservation in sens...

  15. A novel image encryption algorithm using chaos and reversible cellular automata

    Science.gov (United States)

    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.

  16. Cellular automata approach for the dynamics of HIV infection under antiretroviral therapies: The role of the virus diffusion

    Science.gov (United States)

    González, Ramón E. R.; de Figueirêdo, Pedro Hugo; Coutinho, Sérgio

    2013-10-01

    We study a cellular automata model to test the timing of antiretroviral therapy strategies for the dynamics of infection with human immunodeficiency virus (HIV). We focus on the role of virus diffusion when its population is included in previous cellular automata model that describes the dynamics of the lymphocytes cells population during infection. This inclusion allows us to consider the spread of infection by the virus-cell interaction, beyond that which occurs by cell-cell contagion. The results show an acceleration of the infectious process in the absence of treatment, but show better efficiency in reducing the risk of the onset of AIDS when combined antiretroviral therapies are used even with drugs of low effectiveness. Comparison of results with clinical data supports the conclusions of this study.

  17. Exploring Spatio-temporal Dynamics of Cellular Automata for Pattern Recognition in Networks

    Science.gov (United States)

    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.

  18. Free Quantum Field Theory from Quantum Cellular Automata

    Science.gov (United States)

    Bisio, Alessandro; D'Ariano, Giacomo Mauro; Perinotti, Paolo; Tosini, Alessandro

    2015-10-01

    After leading to a new axiomatic derivation of quantum theory (see D'Ariano et al. in Found Phys, 2015), the new informational paradigm is entering the domain of quantum field theory, suggesting a quantum automata framework that can be regarded as an extension of quantum field theory to including an hypothetical Planck scale, and with the usual quantum field theory recovered in the relativistic limit of small wave-vectors. Being derived from simple principles (linearity, unitarity, locality, homogeneity, isotropy, and minimality of dimension), the automata theory is quantum ab-initio, and does not assume Lorentz covariance and mechanical notions. Being discrete it can describe localized states and measurements (unmanageable by quantum field theory), solving all the issues plaguing field theory originated from the continuum. These features make the theory an ideal framework for quantum gravity, with relativistic covariance and space-time emergent solely from the interactions, and not assumed a priori. The paper presents a synthetic derivation of the automata theory, showing how the principles lead to a description in terms of a quantum automaton over a Cayley graph of a group. Restricting to Abelian groups we show how the automata recover the Weyl, Dirac and Maxwell dynamics in the relativistic limit. We conclude with some new routes about the more general scenario of non-Abelian Cayley graphs. The phenomenology arising from the automata theory in the ultra-relativistic domain and the analysis of corresponding distorted Lorentz covariance is reviewed in Bisio et al. (Found Phys 2015, in this same issue).

  19. A Characterization of Cellular Automata Generated by Idempotents on the Full Shift

    CERN Document Server

    Salo, Ville

    2012-01-01

    In this article, we discuss the family of cellular automata generated by so-called idempotent cellular automata (CA G such that G^2 = G) on the full shift. We prove a characterization of products of idempotent CA, and show examples of CA which are not easy to directly decompose into a product of idempotents, but which are trivially seen to satisfy the conditions of the characterization. Our proof uses ideas similar to those used in the well-known Embedding Theorem and Lower Entropy Factor Theorem in symbolic dynamics. We also consider some natural decidability questions for the class of products of idempotent CA.

  20. Integration of principal components analysis and cellular automata for spatial decisionmaking and urban simulation

    Institute of Scientific and Technical Information of China (English)

    LI; Xia(黎夏); YEH; Gar-On(叶嘉安)

    2002-01-01

    This paper discusses the issues about the correlation of spatial variables during spatial decisionmaking using multicriteria evaluation (MCE) and cellular automata (CA). The correlation of spatial variables can cause the malfunction of MCE. In urban simulation, spatial factors often exhibit a high degree of correlation which is considered as an undesirable property for MCE. This study uses principal components analysis (PCA) to remove data redundancy among a large set of spatial variables and determine 'ideal points' for land development. PCA is integrated with cellular automata and geographical information systems (GIS) for the simulation of idealized urban forms for planning purposes.

  1. A Novel Approach for Attacks Mitigation in Mobile Ad Hoc Networks Using Cellular Automatas

    Directory of Open Access Journals (Sweden)

    Himadri Nath Saha

    2012-04-01

    Full Text Available Many security schemes for mobile ad-hoc network(MANET have been proposed so far but none of them has been successful in combating the different types of attacks that a mobile ad-hoc network often faces. This paper is providing one way of mitigating attacks in mobile ad-hoc networks by authenticating the node who tries to access this network .This scheme has been applied by using cellular automata (CA. Our simulation results show how cellular automata(CA is implemented for user authentication and secure transmission in MANET.

  2. Performance of 1D quantum cellular automata in the presence of error

    Science.gov (United States)

    McNally, Douglas M.; Clemens, James P.

    2016-09-01

    This work expands a previous block-partitioned quantum cellular automata (BQCA) model proposed by Brennen and Williams [Phys. Rev. A. 68, 042311 (2003)] to incorporate physically realistic error models. These include timing errors in the form of over- and under-rotations of quantum states during computational gate sequences, stochastic phase and bit flip errors, as well as undesired two-bit interactions occurring during single-bit gate portions of an update sequence. A compensation method to counteract the undesired pairwise interactions is proposed and investigated. Each of these error models is implemented using Monte Carlo simulations for stochastic errors and modifications to the prescribed gate sequences to account for coherent over-rotations. The impact of these various errors on the function of a QCA gate sequence is evaluated using the fidelity of the final state calculated for four quantum information processing protocols of interest: state transfer, state swap, GHZ state generation, and entangled pair generation.

  3. Traffic Cellular Automata Simulation of a Congested Round-About in Mauritius

    Science.gov (United States)

    Fowdur, S. C.; Rughooputh, S. D. D. V.

    In this paper a Traffic Cellular Automata (TCA) simulation of a highly congested round-about in Mauritius is performed. The simulations are performed using a multi-cell model that includes anticipation and probability randomization. The simulation model is first calibrated to match actual traffic count statistics taken at the round-about. The topology of the round-about is then modified and the TCA model is used to predict the impact on the congestion level of different changes made. The simulation results enable the assessment of the impact on the traffic density and travel time of the different modifications made. It has been found that the construction of a flyover bridge at the round-about will be the most convenient solution to alleviate congestion and improve the flux significantly.

  4. Model Checking Timed Automata with Priorities using DBM Subtraction

    DEFF Research Database (Denmark)

    David, Alexandre; Larsen, Kim Guldstrand; Pettersson, Paul;

    2006-01-01

    In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic model-checking of timed automata with priorities. The subtraction is one of the few operations on DBMs that result in...

  5. Simulation of abrasive water jet cutting process: Part 2. Cellular automata approach

    Science.gov (United States)

    Orbanic, Henri; Junkar, Mihael

    2004-11-01

    A new two-dimensional cellular automata (CA) model for the simulation of the abrasive water jet (AWJ) cutting process is presented. The CA calculates the shape of the cutting front, which can be used as an estimation of the surface quality. The cutting front is formed based on material removal rules and AWJ propagation rules. The material removal rule calculates when a particular part of the material will be removed with regard to the energy of AWJ. The AWJ propagation rule calculates the distribution of AWJ energy through CA by using a weighted average. The modelling with CA also provides a visual narrative of the moving of the cutting front, which is hard to observe in real process. The algorithm is fast and has been successfully tested in comparison to cutting fronts obtained with cutting experiments of aluminium alloy.

  6. 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.

  7. 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.

  8. Modeling the role of climate change on small-scale vegetation patterns in a Mediterranean basin using a Cellular Automata model

    Science.gov (United States)

    Caracciolo, Domenico; Fatichi, Simone; Istanbulluoglu, Erkan; Valerio Noto, Leonardo

    2013-04-01

    Predicting vegetation response in regions of ecotone transition under a changing climate is a among grand challenges in ecohydrology. In a small basin (1.3 sq km) in Sicily, Italy, where north-facing slopes are characterized by Quercus (tree), and south-facing slopes by Opuntia ficus-indaca (evergreen perennial species drought tolerant) and grasses we use an ecohydrological Cellular-Automaton model (CATGraSS) of vegetation coexistence driven by rainfall and solar radiation with downscaled future climate to examine the role of climate change on vegetation patterns. In the model, each cell can hold a single plant type or can be bare soil. Plant competition is modeled explicitly by keeping track of mortality and establishment of plants, both calculated probabilistically based on soil moisture stress. Topographic influence on incoming shortwave radiation is treated explicitly, which leads to spatial variations in potential evapotranspiration and resulting soil moisture and plant distribution. The influence of the soil thickness on the vegetation distribution is also introduced. The model is calibrated first using a representation of the current climate as a forcing and comparing the vegetation obtained from the model with the actual vegetation through statistical techniques.. The calibrated model is then forced with future climate scenarios generated using a stochastic downscaling technique based on the weather generator, AWE-GEN. This methodology allows for the downscaling of an ensemble of climate model outputs deriving the frequency distribution functions of factors of change for several statistics of temperature and precipitation from outputs of General Circulation Models. The stochastic downscaling is carried out using simulations of twelve General Circulation Models adopted in the IPCC 4AR, A1B emission scenario, for the future periods of 2046-2065 and 2081-2100. A high sensitivity of the vegetation distribution to variation of rainfall and temperature has been

  9. Research in dynamic evolution of software architectures based on cellular automata model%软件体系结构动态演化的元胞自动机模型研究

    Institute of Scientific and Technical Information of China (English)

    刘晓斌; 杨贯中; 欧阳柳波; 李勇军

    2015-01-01

    目前软件体系结构动态演化的元胞自动机模型存在描述单一、元胞间关系不明确、没有详细阐述动态演化过程应用约束条件的缺点。针对这些不足进行相关的研究,重新定义了软件体系结构动态演化的扩展元胞自动机模型,基于扩展元胞自动机模型结合演化应用约束条件,分析了软件体系结构的动态演化过程,运用元胞间控制约束条件和行为相关约束条件来正确地指导SA动态演化。提出了动点稳态转移的概念,对演化程度和一致性进行定义分析,此方法比以往的元胞自动机模型更能准确指导SA动态演化,促进SA动态演化的进一步研究。通过案例验证了该方法的应用价值和可行性,可以更全面地应用于软件体系结构的动态演化。%There are some defects in dynamic evolution of software architecture based on cellular automata model in recent research, including that specification is not detailed and relationship between cellular is not clear, that it can’t describe the constraints in process of dynamic evolution. In regard to these deficiencies, this paper refines the extend-cellular automata model of dynamic evolution of software architecture, which is based on the combination of evolutionary constraints applied to analyze the dynamic evolution of software architecture process, and SA dynamic evolution is correctly guided by applying both inter-cell behavior related constraints and control constraints. Besides, it puts forward the concept of steady-state transfer of moving-point for charactering the degree and consistency of evolution and can more exactly guide SA dynamic evolution than ever on cellular automata model, which advances the further study on dynamic evolution of software archi-tecture. The case study shows that the proposed method is valuable and feasible, which can be more fully applied to the dynamic evolution of software architecture.

  10. A Scheme for Reconstructing Free-form Surface from Shading with Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    XU Bin; TANG Linxin; SHI Hanmin

    2006-01-01

    The reconstruction of free-form surface is a fundamental problem in digital manufacture. This article presents a novel solution to reconstructing free-form surface from an intensity image under the Lambertian reflection model,that is a method called shape from shading (SFS). Our approach is based on the two-dimensional cellular automata (CA), and fully uses the local information of both image and the reconstructed surface. After several iterations, the free-form surface corresponding to the input image is obtained. The encouraging results on both synthetic and real-world images are provided in this paper, and the performance of our algorithm is analyzed on synthetic images using mean and standard deviation of depth (Z) errors.

  11. Quantum complexity: Quantum mutual information, complex networks, and emergent phenomena in quantum cellular automata

    Science.gov (United States)

    Vargas, David L.

    Emerging quantum simulator technologies provide a new challenge to quantum many body theory. Quantifying the emergent order in and predicting the dynamics of such complex quantum systems requires a new approach. We develop such an approach based on complex network analysis of quantum mutual information. First, we establish the usefulness of quantum mutual information complex networks by reproducing the phase diagrams of transverse Ising and Bose-Hubbard models. By quantifying the complexity of quantum cellular automata we then demonstrate the applicability of complex network theory to non-equilibrium quantum dynamics. We conclude with a study of student collaboration networks, correlating a student's role in a collaboration network with their grades. This work thus initiates a quantitative theory of quantum complexity and provides a new tool for physics education research. (Abstract shortened by ProQuest.).

  12. Color image encryption based on hybrid hyper-chaotic system and cellular automata

    Science.gov (United States)

    Yaghouti Niyat, Abolfazl; Moattar, Mohammad Hossein; Niazi Torshiz, Masood

    2017-03-01

    This paper proposes an image encryption scheme based on Cellular Automata (CA). CA is a self-organizing structure with a set of cells in which each cell is updated by certain rules that are dependent on a limited number of neighboring cells. The major disadvantages of cellular automata in cryptography include limited number of reversal rules and inability to produce long sequences of states by these rules. In this paper, a non-uniform cellular automata framework is proposed to solve this problem. This proposed scheme consists of confusion and diffusion steps. In confusion step, the positions of the original image pixels are replaced by chaos mapping. Key image is created using non-uniform cellular automata and then the hyper-chaotic mapping is used to select random numbers from the image key for encryption. The main contribution of the paper is the application of hyper chaotic functions and non-uniform CA for robust key image generation. Security analysis and experimental results show that the proposed method has a very large key space and is resistive against noise and attacks. The correlation between adjacent pixels in the encrypted image is reduced and the amount of entropy is equal to 7.9991 which is very close to 8 which is ideal.

  13. 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...

  14. Asymptotic Nilpotency Implies Nilpotency in Cellular Automata on the d-Dimensional Full Shift

    CERN Document Server

    Salo, Ville

    2012-01-01

    We prove a conjecture in [3] by showing that cellular automata that eventually fix all cells to a fixed symbol 0 are nilpotent on S^{\\Z^d} for all d. We also briefly discuss nilpotency on other subshifts, and show that weak nilpotency implies nilpotency in all subshifts and all dimensions, since we do not know a published reference for this.

  15. Applications of the Cellular Automata Paradigm in Structural Analysis and Design

    NARCIS (Netherlands)

    Abdalla, M.M.

    2004-01-01

    Recent is een techniek ontstaan voor de aanpak van gecombineerde automatische analyse en ontwerp van een- of meerdimensionale elastische systemen in een omgeving van meervoudig parallel rekenen. De aanpak is gebaseerd op het paradigma van âcellular automata (CA)â. De implementatie van deze techniek

  16. Floating point based Cellular Automata simulations using a dual FPGA-enabled system

    NARCIS (Netherlands)

    Murtaza, S.; Hoekstra, A.G.; Sloot, P.M.A.; Kindratenko, V.

    2008-01-01

    With the recent emergence of multicore architectures, the age of multicore computing might have already dawned upon us. This shift might have triggered the evolution of von Neumann architecture towards a parallel processing paradigm. Cellular Automata- inherently decentralized spatially extended sys

  17. Modelling Cow Behaviour Using Stochastic Automata

    DEFF Research Database (Denmark)

    Jónsson, Ragnar Ingi

    of which describe the cows' activity in the two regarded behavioural scenarios, non-lame and lame. Using the experimental measurement data the different behavioural relations for the two regarded behavioural scenarios are assessed. The three models comprise activity within last hour, activity within last......This report covers an initial study on the modelling of cow behaviour using stochastic automata with the aim of detecting lameness. Lameness in cows is a serious problem that needs to be dealt with because it results in less profitable production units and in reduced quality of life...... for the affected livestock. By featuring training data consisting of measurements of cow activity, three different models are obtained, namely an autonomous stochastic automaton, a stochastic automaton with coinciding state and output and an autonomous stochastic automaton with coinciding state and output, all...

  18. Characterization of the Evolution of Nonlinear Uniform Cellular Automata in the Light of Deviant States

    Directory of Open Access Journals (Sweden)

    Pabitra Pal Choudhury

    2011-01-01

    Full Text Available Dynamics of a nonlinear cellular automaton (CA is, in general asymmetric, irregular, and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable, primarily due to the presence of a matrix handle. In this paper, we present a novel technique of studying the properties of the State Transition Diagram of a nonlinear uniform one-dimensional cellular automaton in terms of its deviation from a suggested linear model. We have considered mainly elementary cellular automata with neighborhood of size three, and, in order to facilitate our analysis, we have classified the Boolean functions of three variables on the basis of number and position(s of bit mismatch with linear rules. The concept of deviant and nondeviant states is introduced, and hence an algorithm is proposed for deducing the State Transition Diagram of a nonlinear CA rule from that of its nearest linear rule. A parameter called the proportion of deviant states is introduced, and its dependence on the length of the CA is studied for a particular class of nonlinear rules.

  19. A cellular automata model of pedestrian evacuation in rooms with squared rhombus cells%菱形网格的行人疏散元胞自动机模型

    Institute of Scientific and Technical Information of China (English)

    永贵; 黄海军; 许岩

    2013-01-01

    The modified floor field cellular automata model is used to simulate the pedestrian evacuation in rooms which are discretized into squared rhombus cells. This discretization can effectively stop pedestrians to move against walls or obstacles. The pedestrian transition probabilities from one cell to neighbor cells are computed by considering various factors influencing evacuation. Simulation results show that the pedestrian distribution nearby exit is basically the same as that indicated by the experimental snapshot, the evacuation time increases almost linearly with exit width, and the flow rate from exit is close to the one observed from experiment.%利用改进的层次域元胞自动机模型,研究了正菱形网格空间中的行人疏散问题.这类网格可以避免行人贴近房间墙壁或障碍物,转移概率考虑了各种逃生受阻因素.数值仿真显示,出口处的行人分布与实验快照展示的行人分布基本相同,疏散时间和出口宽度呈线性关系,行人流率接近实验结果.

  20. A Heterogeneous Cellular Automata Model with Age Structure for HIV Transmission%具有年龄结构的异质元胞自动机HIV传播模型

    Institute of Scientific and Technical Information of China (English)

    王仲君; 张莉丽

    2014-01-01

    年龄结构影响群体发病率,将群体年龄分为5个阶段,建立扩展的异质元胞自动机模型,研究艾滋病在高发区及普通地区的传播行为。模型中,元胞具有不同的年龄,传染强度依状态改变,结合邻域内个体间致病性接触行为建立邻域元胞影响力函数,改进状态更新规则。仿真结果发现,个体的致病性接触行为、人群密度、元胞影响半径对艾滋病的传播速度及群体感染率具有一定影响,而个体年龄结构则在一定程度上影响群体感染分布情况。%According to statistics , age structure has an effect on the incidence of AIDS .The group can be divided into five categories with different incubations based on different ages .An expanded heterogeneous cellular automata model was built and then HIV transmission in area of high and average infection rate were respectively simulated .In this model , the cellular has dif-ferent ages;the intensity of infection changes with cell state .The influence function of neighborhood considering of the pathogenic contact behavior between neighborhoods was built to improve the rule of status updates .The simulation shows that pathogenic con-tact behavior , crowd density , and radius of influence have certain influences on the spread of HIV transmission; and the age structure has a certain influence on the outbreak of AIDS .

  1. A new small-world network created by Cellular Automata

    Science.gov (United States)

    Ruan, Yuhong; Li, Anwei

    2016-08-01

    In this paper, we generate small-world networks by the Cellular Automaton based on starting with one-dimensional regular networks. Besides the common properties of small-world networks with small average shortest path length and large clustering coefficient, the small-world networks generated in this way have other properties: (i) The edges which are cut in the regular network can be controlled that whether the edges are reconnected or not, and (ii) the number of the edges of the small-world network model equals the number of the edges of the original regular network. In other words, the average degree of the small-world network model equals to the average degree of the original regular network.

  2. A Novel Design of Half Subtractor using Reversible Feynman Gate in Quantum Dot cellular Automata

    Directory of Open Access Journals (Sweden)

    Rubina Akter

    2014-12-01

    Full Text Available Quantum Dot cellular Automata (QCA is an emerging, promising alternative to CMOS technology that performs its task by encoding binary information on electronic charge configuration of a cell. All circuit based on QCA has an advantages of high speed, high parallel processing, high integrityand low power consumption. Reversible logic gates are the leading part in Quantum Dot cellular Automata. Reversible logic gates have an extensive feature that does not lose information. In this paper, we present a novel architecture of half subtractor gate design by reversible Feynman gate. This circuit is designedbased on QCA logic gates such as QCA majority voter gate, majority AND gate, majority OR gate and inverter gate. This circuit will provide an effective working efficiency on computational units of the digital circuit system.

  3. Combining cellular automata and Monte Carlo algorithm to simulate three-dimensional grain growth

    Institute of Scientific and Technical Information of China (English)

    WANG Wei; CHEN Ju-hua; GUO Pei-quan; ZHAO Ping

    2006-01-01

    A 3-D simulation of grain growth was conducted by utilizing cellular automata (CA) and Monte Carlo (MC) algorithm. In the simulating procedure, the three-dimensional space is divided into a large number of 2-D isometric planes. Then, each of the planes is divided into identical square cells. Finally, the cellular automata and Monte Carlo algorithm are combined together to simulate the grain growth. Through an evolutionary simulation, the recrystallized microstructure, the grain growth rate and the grain size distribution are acceptably predicted. The simulation routine can be used to simulate the real physical-metallurgy processes and to predict quantitative dynamic information of the evolution of microstructure. Further more, the method is also useful for optimization of materials properties by controlling the microstructure evolution.

  4. An authenticated image encryption scheme based on chaotic maps and memory cellular automata

    Science.gov (United States)

    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.

  5. Pseudorandom Sequences in Spread-Spectrum Communications Generated by Cellular Automata

    Directory of Open Access Journals (Sweden)

    F.C. Ordaz-Salazar

    2012-10-01

    Full Text Available Dynamical systems methods have been recently used in spread-spectrum digital communication systems. Theexpansion of the spectrum using a pseudorandom sequence with a higher frequency than the information signal is thekey feature for its robustness against the signal traveling interference through the channel. In this work, we propose togenerate pseudorandom sequences by employing cellular automata and we check these sequences have thenecessary properties which are required in modern communication systems. The computed sequences obtained bythe cellular automata are tested in a quadrature phase shift keying (QPSK spread-spectrum communication system.The efficiency of the system is analyzed by computing the bit error rate under different signal to noise ratio conditions.These results are compared with systems that employ Golden code and other typical pseudorandom sequences.

  6. Stability of Cellular Automata Trajectories Revisited: Branching Walks and Lyapunov Profiles

    Science.gov (United States)

    Baetens, Jan M.; Gravner, Janko

    2016-10-01

    We study non-equilibrium defect accumulation dynamics on a cellular automaton trajectory: a branching walk process in which a defect creates a successor on any neighborhood site whose update it affects. On an infinite lattice, defects accumulate at different exponential rates in different directions, giving rise to the Lyapunov profile. This profile quantifies instability of a cellular automaton evolution and is connected to the theory of large deviations. We rigorously and empirically study Lyapunov profiles generated from random initial states. We also introduce explicit and computationally feasible variational methods to compute the Lyapunov profiles for periodic configurations, thus developing an analog of Floquet theory for cellular automata.

  7. 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.

  8. 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.

  9. Predicting the impacts of climate change on plant dynamics and tree-grass-shrub competition using a Cellular Automata model in a Mediterranean catchment in Sicily, Italy

    Science.gov (United States)

    Noto, L. V.; Caracciolo, D.; Fatichi, S.; Istanbulluoglu, E.

    2013-12-01

    Understanding and predicting vegetation change along ecosystem boundaries is among paramount challenges in ecohydrology. In this study, Cellular-Automaton Tree Grass Shrub Simulator (CATGraSS) is implemented in a small upland catchment in Sicily, IT, where north-facing slopes are characterized by quercus (trees), and south-facing slopes exhibit plant coexistence, composed of Opuntia ficus-indaca (shrub) and grasses, to examine the control of solar radiation on plant development and predict potential trajectories of vegetation change under the stress of global warming. CATGraSS is driven by stochastic rainfall and variable solar radiation on topography, represented by a fine-scale gridded domain where vegetation type at each cell is represented individually. In the model, each cell can hold a single plant type or remain empty. Plant competition is modeled explicitly by keeping track of mortality and establishment of plants, both calculated probabilistically based on soil moisture stress. Spatially explicit treatment of solar radiation, and a lower limit to soil moisture storage imposed by bedrock depth lead to spatial organization in evapotranspiration, soil moisture, runoff, and plant type. CATGraSS is first calibrated at the field site driven by stochastic climate that represent the current climate at the study site. Calibrated model results are examined against Google-Earth images. Implications of future climate change are examined using the advanced weather generator (AWE-GEN). AWE-GEN characterizes the statistical characteristics of selected climate variables and their change over time based on a multi-model ensemble of outputs from General Circulation Models (GCMs). Stochastic downscaling is carried out using simulations of twelve GCMs adopted in the IPCC 4AR, A1B emission scenario for the future scenarios 2046-2065 and 2081-2100. Future vegetation changed is predicted to bring a dramatic reorganization of the plant composition based mainly on the topography

  10. 基于Fisher判别和元胞自动机模型的微电网格局计算方法%An Approach to Calculate Micro-Grid's Configuration Based on Fisher Discriminant and Cellular Automata Model

    Institute of Scientific and Technical Information of China (English)

    王砚帛; 谭永东; 文菓; 杨佳

    2012-01-01

    Based on Fisher discriminant and cellular automata model an approach to calculate the configuration of micro-grid is proposed. The cell space of micro-grid is established and Fisher discriminant is utilized to obtain the macroscopic evolution rules for cell space of micro-grid. According to the diversity of micro-grid user's electricity demands and decision-making uncertainty of power transaction a local evolution rule considering neighbors' relationship is drafted, and a concept of role transition's probability is also proposed. Using Matlab, a model to simulate the time-space dynamic evolution process of micro-grid configuration is built. The availability and effectiveness of the proposed method in the calculation of micro-grid's configuration and in the simulation of time-space dynamic evolution process of micro-grid configuration are verified by simulation results.%基于Fisher判别方法和元胞自动机模型提出了一种微电网格局计算方法.建立了微电网元胞空间,运用Fisher判别方法获取微电网元胞空间的宏观演化规则,并根据微电网用户角色的多样化和电力交易决策的不确定性,制定了考虑领域关系的局部演化规则,提出了角色转化概率的概念.在Matlab环境下建立了仿真算例模拟微电网格局的时空动态演化过程.仿真结果验证了该方法对于微电网格局计算以及模拟微电网格局时空动态演化过程的可行性和有效性.

  11. Applying Cellular Automata for Simulating and Assessing Urban Growth Scenario Based in Nairobi, Kenya

    Directory of Open Access Journals (Sweden)

    Kenneth Mubea

    2014-01-01

    Full Text Available This research explores urban growth based scenarios for the city of Nairobi using a cellular automata urban growth model (UGM. African cities have experienced rapid urbanization over the last decade due to increased population growth and high economic activities. We used multi-temporal Landsat imageries for 1976, 1986, 2000 and 2010 to investigate urban land-use changes in Nairobi. Our UGM used data from urban land-use of 1986 and 2010, road data, slope data and exclusion layer. Monte-Carlo technique was used for model calibration and Multi Resolution Validation (MRV technique for validation. Simulation of urban land-use was done up to the year 2030 when Kenya plans to attain Vision 2030. Three scenarios were explored in the urban modelling process; unmanaged growth with no restriction on environmental areas, managed growth with moderate protection, and a managed growth with maximum protection on forest, agricultural areas, and urban green. Thus alternative scenario development using UGM is useful for planning purposes so as to ensure sustainable development is achieved. UGM provides quantitative, visual, spatial and temporal information which aid policy and decision makers can make informed decisions.

  12. Dynamics of the HIV infection under antiretroviral therapy: A cellular automata approach

    Science.gov (United States)

    González, Ramón E. R.; Coutinho, Sérgio; Zorzenon dos Santos, Rita Maria; de Figueirêdo, Pedro Hugo

    2013-10-01

    The dynamics of human immunodeficiency virus infection under antiretroviral therapy is investigated using a cellular automata model where the effectiveness of each drug is self-adjusted by the concentration of CD4+ T infected cells present at each time step. The effectiveness of the drugs and the infected cell concentration at the beginning of treatment are the control parameters of the cell population’s dynamics during therapy. The model allows describing processes of mono and combined therapies. The dynamics that emerges from this model when considering combined antiretroviral therapies reproduces with fair qualitative agreement the phases and different time scales of the process. As observed in clinical data, the results reproduce the significant decrease in the population of infected cells and a concomitant increase of the population of healthy cells in a short timescale (weeks) after the initiation of treatment. Over long time scales, early treatment with potent drugs may lead to undetectable levels of infection. For late treatment or treatments starting with a low density of CD4+ T healthy cells it was observed that the treatment may lead to a steady state in which the T cell counts are above the threshold associated with the onset of AIDS. The results obtained are validated through comparison to available clinical trial data.

  13. Traffic Accident Propagation Properties and Control Measures for Urban Links Based on Cellular Automata

    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.

  14. Defining high-detail hazard maps by a cellular automata approach: application to Mount Etna (Italy

    Directory of Open Access Journals (Sweden)

    William Spataro

    2011-12-01

    Full Text Available The individuation of areas that are more likely to be affected by new events in volcanic regions is of fundamental relevance for the mitigation of the possible consequences, both in terms of loss of human life and material properties. Here, we describe a methodology for defining flexible high-detail lava-hazard maps and a technique for the validation of the results obtained. The methodology relies on: (i an accurate analysis of the past behavior of the volcano; (ii a new version of the SCIARA model for lava-flow simulation (based on the macroscopic cellular automata paradigm; and (iii high-performance parallel computing for increasing computational efficiency. The new release of the SCIARA model introduces a Bingham-like rheology as part of the minimization algorithm of the differences for the determination of outflows from a generic cell, and an improved approach to lava cooling. The method is here applied to Mount Etna, the most active volcano in Europe, and applications to land-use planning and hazard mitigation are presented.

  15. A cellular automata based FPGA realization of a new metaheuristic bat-inspired algorithm

    Science.gov (United States)

    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.

  16. Analysis of information gain and Kolmogorov complexity for structural evaluation of cellular automata configurations

    Science.gov (United States)

    Javaheri Javid, Mohammad Ali; Blackwell, Tim; Zimmer, Robert; Majid al-Rifaie, Mohammad

    2016-04-01

    Shannon entropy fails to discriminate structurally different patterns in two-dimensional images. We have adapted information gain measure and Kolmogorov complexity to overcome the shortcomings of entropy as a measure of image structure. The measures are customised to robustly quantify the complexity of images resulting from multi-state cellular automata (CA). Experiments with a two-dimensional multi-state cellular automaton demonstrate that these measures are able to predict some of the structural characteristics, symmetry and orientation of CA generated patterns.

  17. Modelling Social-Technical Attacks with Timed Automata

    DEFF Research Database (Denmark)

    David, Nicolas; David, Alexandre; Hansen, Rene Rydhof

    2015-01-01

    in our model and perform analysis and simulation of both model and attack, revealing details about the specific interaction between attacker and victim. Using timed automata also allows for intuitive modelling of systems, in which quantities like time and cost can be easily added and analysed.......Attacks on a system often exploit vulnerabilities that arise from human behaviour or other human activity. Attacks of this type, so-called socio-technical attacks, cover everything from social engineering to insider attacks, and they can have a devastating impact on an unprepared organisation....... In this paper we develop an approach towards modelling socio-technical systems in general and socio-technical attacks in particular, using timed automata and illustrate its application by a complex case study. Thanks to automated model checking and automata theory, we can automatically generate possible attacks...

  18. Prisoner's Dilemma cellular automata revisited: evolution of cooperation under environmental pressure

    CERN Document Server

    Alonso, J; Fort, H; Alonso, Julia; Fernandez, Ariel; Fort, Hugo

    2005-01-01

    We propose an extension of the evolutionary Prisoner's Dilemma cellular automata introduced by Nowak and May \\cite{nm92}, in which the pressure of the environment is taken into account. This is implemented by requiring that an individual needs to collect a score $U$ above a threshold $U_{min}$, representing vital resources (nutrients, energy, etc.). Thus agents, instead of evolving just by adopting the strategy of the most successful neighbour (who got $U^{msn}$), also take into account if $U^{msn}$ is above or below $U_{min}$. Three different model variants are considered: (1) If $U^{msn}

  19. Nanopatterned graphene quantum dots as building blocks for quantum cellular automata

    Science.gov (United States)

    Wang, Z. F.; Liu, Feng

    2011-10-01

    Quantum cellular automata (QCA) is an innovative approach that incorporates quantum entities in classical computation processes. Binary information is encoded in different charge states of the QCA cells and transmitted by the inter-cell Coulomb interaction. Despite the promise of QCA, however, it remains a challenge to identify suitable building blocks for the construction of QCA. Graphene has recently attracted considerable attention owing to its remarkable electronic properties. The planar structure makes it feasible to pattern the whole device architecture in one sheet, compatible with the existing electronics technology. Here, we demonstrate theoretically a new QCA architecture built upon nanopatterned graphene quantum dots (GQDs). Using the tight-binding model, we determine the phenomenological cell parameters and cell-cell response functions of the GQD-QCA to characterize its performance. Furthermore, a GQD-QCA architecture is designed to demonstrate the functionalities of a fundamental majority gate. Our results show great potential in manufacturing high-density ultrafast QCA devices from a single nanopatterned graphene sheet.

  20. Analysis of Architectural Building Design Influences on Fire Spread in Densely Urban Settlement using Cellular Automata

    Science.gov (United States)

    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.

  1. 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

  2. Cellular Automata Model Considering Demand Space to Simulate Bidirectional Pedestrian Flow%基于需求空间的双向行人流元胞自动机模型研究

    Institute of Scientific and Technical Information of China (English)

    冒玉婷; 邓建华

    2015-01-01

    An improved cellular automata model considering demand space is proposed to simulate bidirectional pedestrian flow based on NS model . New model incorporates a social distance to describe territorial effects between pedestrians and to avoid the conflicts in advance . In order to display the attraction between synthetic pedestrians , this model also considered the vision field that allows a pedestrian to collect information from cells in front of him/her and also to get the weighted demand parameter .Through Matlab simulation ,the velocity‐density diagram is obtained .Comparing the result with social model and Weidmann diagram ,we can see that new model can avoid the conflicts in advance effectively and the overall average speed has increased . Besides ,the presented model can reproduce Weidmann within the range of 0~5 p/m2 .%在NS模型的基础上提出考虑需求空间的双向行人交通流仿真模型。新模型采用需求空间来描述行人之间一定区域内的相互影响,提前避免冲突的发生。为更好地描述同向行人之间的吸引力,模型还考虑视野邻域以收集行人视野范围内的交通信息从而得到加权社会参数值。通过M atlab对改进的模型进行仿真,将仿真实验所得的流密图与Weidmann基本图和社会力模型比较,结果表明:新模型有效地提前避免冲突,行人流整体速度有所提高;行人密度在0~5 p/m2区间变化时能够再现Weidmann基本图。

  3. Exploring the Possibilities of a Cellular Automata in Minecraft

    OpenAIRE

    Saunders, Stephen

    2014-01-01

    Complex systems are not always generated by complex individuals. Simple, cell-like individuals can produce sophisticated outcomes. Structures implementing this nature area called cellular automation. In this paper, we discuss the difficulties associated with the creation of one such automation in a pre-existing environment, in this case the game MineCraft. A subsequent study of the behavior of this automation is presented, using an objective information measure called set complexity.

  4. Intrinsically universal n-dimensional quantum cellular automata

    CERN Document Server

    Arrighi, Pablo

    2009-01-01

    We describe an n-dimensional quantum cellular automaton (QCA) capable of simulating all others, in that the initial configuration and the forward evolution of any n-dimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA. The encoding is linear and hence does not carry any of the cost of the computation. Part of our proof consists of showing that any QCA can be presented in the more canonical, operational form of a Partitioned QCA, thereby showing an equivalence between many definitions of QCA that are present in the literature.

  5. Research on Cellular Automata Model of Hypergraph Partitioning Problem and Its Algorithm%超图划分问题的元胞自动机模型及算法研究

    Institute of Scientific and Technical Information of China (English)

    冷明; 孙凌宇; 边计年; 马昱春; 朱平

    2012-01-01

    对超图划分问题运用元胞自动机理论进行分析建模,提出一种元胞自动机模型以及基于该模型的赋权超图划分优化算法.在该模型中,元胞对应于赋权超图中的结点,邻接元胞对应于邻接超边所包含的结点,元胞的状态对应于所在的划分子集.引入二维辅助数组存储每条超边在划分子集中的结点个数,给出快速的元胞收益值和划分割切值的计算方法,从而避免遍历超边中的结点.实验结果表明,与赋权图划分算法和迁移方法相比,该算法可以取得更优的划分,且时间复杂度和空间复杂度较低.%The Cellular Automata(CA) model for the problem by applying the CA theory and a min-cut partitioning algorithm based on the model for bisecting weighted hypergraph are proposed. In the model, the vertex of hypergraph can be considered as the cell, the vertices of adjacent hypergraph are denoted by the CA-neighborhoods and each cell's state represents the partitioning which the corresponded vertex belongs to. Furthermore, the two-dimensional auxiliary array is designed for counting the vertices of each hypergraph in different partitions. The rapid method of calculating the cell's gain and the cut's size are proposed to avoid traversing each vertex of hypergraph. Experimental results show that the algorithm not only can find the better partitioning of weighted hypergraph than the move-based method and graph parti-tioning algorithm, but also can reduce the time complexity and the space complexity.

  6. Efficient Modelling and Generation of Markov Automata (extended version)

    NARCIS (Netherlands)

    Timmer, Mark; Katoen, Joost-Pieter; Pol, van de Jaco; Stoelinga, Mariëlle

    2012-01-01

    This paper introduces a framework for the efficient modelling and generation of Markov automata. It consists of (1) the data-rich process-algebraic language MAPA, allowing concise modelling of systems with nondeterminism, probability and Markovian timing; (2) a restricted form of the language, the M

  7. Designing quantum-dot cellular automata circuits using a robust one layer crossover scheme

    Directory of Open Access Journals (Sweden)

    Sara Hashemi

    2014-04-01

    Full Text Available Quantum-dot cellular automata (QCA is a novel nanotechnology which is considered as a solution to the scaling problems in complementary metal oxide semiconductor technology. In this Letter, a robust one layer crossover scheme is introduced. It uses only 90° QCA cells and works based on a proper clock assignment. The application of this new scheme is shown in designing a sample QCA circuit. Simulation results demonstrate that using this new scheme, significant improvements in terms of area and complexity can be achieved.

  8. Hologram authentication based on a secure watermarking algorithm using cellular automata.

    Science.gov (United States)

    Hwang, Wen-Jyi; Chan, Hao-Tang; Cheng, Chau-Jern

    2014-09-20

    A secure watermarking algorithm for hologram authentication is presented in this paper. The algorithm exploits the noise-like feature of holograms to randomly embed a watermark in the domain of the discrete cosine transform with marginal degradation in transparency. The pseudo random number (PRN) generators based on a cellular automata algorithm with asymmetrical and nonlocal connections are used for the random hiding. Each client has its own unique PRN generators for enhancing the watermark security. In the proposed algorithm, watermarks are also randomly generated to eliminate the requirements of prestoring watermarks in the clients and servers. An authentication scheme is then proposed for the algorithm with random watermark generation and hiding.

  9. Sub-classes and evolution stability of Wolfram's classesin the total-rule cellular automata

    Institute of Scientific and Technical Information of China (English)

    YAN Guangwu; TIAN Feng; DONG Yinfeng

    2004-01-01

    In this paper, we propose a concept of sub-classes and its evolution stability for the Wolfram's classes. Firstly, we obtain the sub-classes of the Wolfram's class IV, gene-piece of these sub-classes and their existing circumstance. Secondly, we introduce a new concept, the evolution stability, for the Wolfram's classes and sub-classes of Wolfram's class IV. Lastly, we find that Wolfram's classes I, II, and III have the evolution stability, but sub-classes of the Wolfram's class IV have not the evolution stability for the total rule cellular automata.

  10. The FPGA realization of the general cellular automata based cryptographic hash functions: Performance and effectiveness

    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.

  11. Nanocrystallization kinetics under instantaneous growth approximation: Experiments and cellular automata simulations

    Energy Technology Data Exchange (ETDEWEB)

    Blazquez, J.S.; Millan, M.; Conde, C.F.; Conde, A. [Departamento de Fisica de la Materia Condensada, Universidad de Sevilla-ICMSE, P.O. Box 1065, 41080 Sevilla (Spain)

    2010-05-15

    Nanocrystallization kinetics is analyzed in the frame of instantaneous growth approximation, which implies that the time required for a crystallite to reach its final size is negligible with respect to the time required for the nanocrystallization process. This approach strongly simplifies the kinetic analysis and allows us to obtain the nucleation rate from both isothermal and non-isothermal nanocrystallization processes. Moreover, as no constraining mechanism is considered but the absence of growth, the results could be discussed in the frame of Johnson-Mehl-Avrami-Kolmogorov theory with a growth index equal to zero. Cellular automata simulations are in agreement with the observed kinetics and microstructure. (Abstract Copyright [2010], Wiley Periodicals, Inc.)

  12. Simulation of the Crashing of Sandwich Structures under Impact Loads by Movable Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    HUANG De-wu; HUANG Hai; SONG Yi; A I Dmitriev; E V Shilko; S G Psakhie

    2005-01-01

    Movable cellular automata (MCA) method is applied in the analysis of dynamic characters of ceramic armor composite structures under impact loading. As a new approach, MCA is different from the traditional numerical methods such as the finite element method and boundary element method. Based on the theory of particle mechanics, MCA is applied as a powerful tool in solving specific structural analysis of materials loss and penetrating damages. In this paper the method is used to study responses of multi-layered ceramic plates as a base of armor structures under impact loading, thus assisting further investigations in the crashing process and to improve ceramic armor structures.

  13. Inhomogeneous Poisson point process nucleation: comparison of analytical solution with cellular automata simulation

    Directory of Open Access Journals (Sweden)

    Paulo Rangel Rios

    2009-06-01

    Full Text Available Microstructural evolution in three dimensions of nucleation and growth transformations is simulated by means of cellular automata (CA. In the simulation, nuclei are located in space according to a heterogeneous Poisson point processes. The simulation is compared with exact analytical solution recently obtained by Rios and Villa supposing that the intensity is a harmonic function of the spatial coordinate. The simulated data gives very good agreement with the analytical solution provided that the correct shape factor for the growing CA grains is used. This good agreement is auspicious because the analytical expressions were derived and thus are exact only if the shape of the growing regions is spherical.

  14. Uncertainty analysis and data-assimilation of remote sensing data for the calibration of cellular automata based land-use models

    NARCIS (Netherlands)

    Kwast, J. van der; Voorde, T. van de; Jong, K. de; Uljee, I.; Karssenberg, D.J.; Canters, F.; Engelen, G.; Poelmans, L.

    2012-01-01

    A correct historic calibration of land-use models is important, because they are more and more used by decision makers. Existing calibration methods, however, do not sufficiently take into account uncertainties in input parameters. For that reason, uncertainties that propagate through simulations of

  15. Cellular automata model of urban traffic emergency evacuation and rescue%城市交通疏散救援的元胞自动机模型

    Institute of Scientific and Technical Information of China (English)

    杨兆升; 高学英; 孙迪

    2011-01-01

    The effects of vehicle delay on the emergency evacuation and rescue decision-making of all traffic flow conflicts within cities were analyzed. An intersection control parameter was introduced into the exciting simulation model of emergency evacuation and rescue, and the model was based on cell transmission model. A simulation model of emergency evacuation and rescue was built under intersection emergency control. In the improved model, the weighted travel time of emergency evacuation and rescue in planning horizon was minimized, and contraflow strategy was introduced. Simulation result shows that because giving way to high-priority traffic flows G3 and G4, the average travel times of low-priority traffic flows G1 and G2 increase by 10.0 s and 11.1 s respectively, which accords with the actual circumstance of urban emergency evacuation and rescue. After the implementation of contraflow strategy, the travel times of beneficial traffic flows G2 and G4 decrease by 6.5 s and 6.0 s respectively. So the model and contraflow strategy are feasible. 6 tabs, 3 figs, 16 refs.%分析了城市内部各向车流冲突造成的车辆延误对疏散与救援决策的影响,将交叉口控制参数引入到现有的基于元胞传输模型的应急疏散救援仿真模型中,建立灾时交叉口紧急控制下的应急疏散救援仿真模型.改进后的模型以规划周期内疏散与救援加权行程时间最小为目标,并引入反流策略.仿真结果表明:由于低优先级的车流G1和G2让行高优先级车流G3和G4而产生延误,其平均行程时间分别增加了10.0、11.1 s,符合城市内部疏散与救援的实际情况;反流策略实施后,受益的车流G2和G4行程时间分别下降了6.5、6.0 s.可见,提出的模型及反流策略有效.

  16. Improved glowworm swarm optimization based on cellular automata and its application in Wiener model identification%元胞萤火虫算法在Wiener模型辨识中的应用

    Institute of Scientific and Technical Information of China (English)

    李远梅; 张宏立

    2016-01-01

    Basic glowworm swarm optimization possesses slow convergence speed,poor local search ability and easiness to fall in local peak.To overcome these problems,an adaptive step algorithm integrating the mechanism of cellular automata was pro-posed,namely applying the evolutionary rule and domain rule to glowworm swarm optimization.Neighborhood was selected via domain model and ierative refinement was proceeded by means of evolutionary rule coalesced with game of life and survival of the fittest within the domain structure.Typical test functions were simulated and tested,the results of which reveal the proposed al-gorithm has better global searching ability,convergence speed and precision.Because Wiener model of the nonlinear system pos-sesses nonlinear drag casing to identify difficultly,the improved cellular glowworm swarm optimization was put forward for model parameter identification.Parameter identification problem was converted to function optimization problem and solved using cel-lular glowworm swarm optimization.It is verified to be effective and feasible in identification problem with numerical simulation.%基本萤火虫算法存在陷入局部最优、后期收敛慢等固有缺点,为此将元胞自动机机理融入自适应步长萤火虫算法,即将邻域规则和演化规则融合在萤火虫算法中。通过其邻域模型选择邻域集合,在其邻域结构内通过一种融合生命游戏与优胜劣汰的演化规则进行迭代寻优。对4种典型的测试函数进行实验,实验结果表明,该算法能跳出局部最优,有较强的收敛速度和精度,可应用于非线性系统中 Wiener 模型的参数辨识。因 Wiener 模型含有非线性部分,导致不易辨识,采用改进的元胞萤火虫算法将该参数辨识问题转变为优化函数问题,利用元胞萤火虫算法进行函数寻优。数值仿真验证了改进算法能够有效地进行非线性系统参数辨识。

  17. Parameters Characteristics Analysis of Ship Traffic Flow with Cellular Automata Model on AIS-based%基于 AIS 的元胞自动机模型的船舶交通流特征参数分析

    Institute of Scientific and Technical Information of China (English)

    冯宏祥; 孔凡邨; 肖英杰; 杨小军

    2014-01-01

    针对海上交通工程学中的密度-速度(流量)关系图“线性假设”的不严密性,利用基于 AIS的元胞自动机船舶交通流模型模拟再现船舶交通流,然后统计出船舶交通流密度-速度(流量)基本关系图,并给出其三相交通流理论的解释;模拟研究发现,船舶交通流包含自由流、同步流和拥挤流三种相态,相态之间的转换也包含自由流与同步流、同步流与堵塞流两种形式;船舶密度-速度之间并非简单的线性关系,船舶密度-流量之间也不是二次抛物线关系,而是不明确的多值关系。模拟方法和结论有助于解释一些复杂的水上交通现象。%Against the non-stringency of linear hypothsis in ship traffic density-velocity equations in marine traffic engineering ,and as per the ship cellular automata model on AIS-based ,simlation is car-ried ot to reproduce ship traffic flow of waterway in micro level .The simulation results are refined and new ship traffic density-velocity (flux ) non-linear equations are presented ;T he three-phase traffic the-ory explication is given .the simulation results show that ship traffic contains free flow ,synchronized flow and congestion flow ;and phase changes contain free 1 synchronized and synchronized 1 jam .The sim-ulation method and conclusions could help to explain some complex phenomena of marine traffic .

  18. Modelling and simulating in-stent restenosis with complex automata

    NARCIS (Netherlands)

    Hoekstra, A.G.; Lawford, P.; Hose, R.

    2010-01-01

    In-stent restenosis, the maladaptive response of a blood vessel to injury caused by the deployment of a stent, is a multiscale system involving a large number of biological and physical processes. We describe a Complex Automata Model for in-stent restenosis, coupling bulk flow, drug diffusion, and s

  19. Review of soil erosion modeling using Cellular Automata in different spatial scales%不同空间尺度下的土壤侵蚀元胞自动机建模评述

    Institute of Scientific and Technical Information of China (English)

    刘星飞; 原立峰; 吴淑芳; 霍云云

    2012-01-01

    土壤侵蚀系统是一个典型的非线性动力系统,系统内部的侵蚀发育演化过程十分复杂,为了对该过程进行精确的模拟和预测,需要发展有效的技术和方法.元胞自动机( cellular automata,CA)是一种具有时空特征的离散动力学模型,采用“自下而上”的构模方式,对于模拟和分析具有空间特征的土壤侵蚀系统具有先天优势.由于空间尺度变化所引起的土壤侵蚀因子对侵蚀产沙过程的影响不同,CA模型在坡面尺度下主要针对细沟侵蚀和土壤颗粒的变化,在小流域尺度下涉及到更多的元胞状态和更加完整的侵蚀过程,在大区域尺度下重点研究气候和地貌之间的相互作用.不同空间尺度建立的CA模型没有确定的转换规则,模型通用性较低,今后需要在三维可视化、智能化等方面深入研究CA模型在土壤侵蚀领域的应用.%Soil erosion system is a typical nonlinear dynamic system, in the inner of which the erosion development and evolution is very complex and require effective technology and method to simulate and predict the process accurately. And the cellular automatic is a kind of discrete dynamics model with temporal and spatial features, which uses the method of bottom up and can be suitable to application in the time space evolution of soil erosion, for its inherent advantages in simulation and analysis the soil erosion system with spatial features. Then in the study of time-space evolution of soil erosion, the variation of spatial scales can cause that the erosion factors have different effects on the process of soil erosion. Therefore in the construction of CA model, in slope scale the main research is rill erosion and the change of soil particles, in small watershed scale the CA model includes more cell states and more complete erosion process, in region scale the CA focuses on interaction of the climate and topography.Because of no unified conversion rule in different scales, the

  20. Application of cellular automata approach for cloud simulation and rendering

    Energy Technology Data Exchange (ETDEWEB)

    Christopher Immanuel, W. [Department of Physics, Vel Tech High Tech Dr. Rangarajan Dr. Sakunthala Engineering College, Tamil Nadu, Chennai 600 062 (India); Paul Mary Deborrah, S. [Research Department of Physics, The American College, Tamil Nadu, Madurai 625 002 (India); Samuel Selvaraj, R. [Research Department of Physics, Presidency College, Tamil Nadu, Chennai 600 005 (India)

    2014-03-15

    Current techniques for creating clouds in games and other real time applications produce static, homogenous clouds. These clouds, while viable for real time applications, do not exhibit an organic feel that clouds in nature exhibit. These clouds, when viewed over a time period, were able to deform their initial shape and move in a more organic and dynamic way. With cloud shape technology we should be able in the future to extend to create even more cloud shapes in real time with more forces. Clouds are an essential part of any computer model of a landscape or an animation of an outdoor scene. A realistic animation of clouds is also important for creating scenes for flight simulators, movies, games, and other. Our goal was to create a realistic animation of clouds.

  1. Usage Automata

    Science.gov (United States)

    Bartoletti, Massimo

    Usage automata are an extension of finite stata automata, with some additional features (e.g. parameters and guards) that improve their expressivity. Usage automata are expressive enough to model security requirements of real-world applications; at the same time, they are simple enough to be statically amenable, e.g. they can be model-checked against abstractions of program usages. We study here some foundational aspects of usage automata. In particular, we discuss about their expressive power, and about their effective use in run-time mechanisms for enforcing usage policies.

  2. Design and Analysis of Adders using Nanotechnology Based Quantum dot Cellular Automata

    Directory of Open Access Journals (Sweden)

    S. K. Lakshmi

    2011-01-01

    Full Text Available Problem statement: The area and complexity are the major issues in circuit design. Here, we propose different types of adder designs based on Quantum dot Cellular Automata (QCA that reduces number of QCA cells and area compare to previous designs. The quantum dot cellular automata is a novel computing paradigm in nanotechnology that can implement digital circuits with faster speed, smaller size and low power consumption. By taking the advantages of QCA we are able to design interesting computational architectures. The QCA cell is a basic building block of nanotechnology that can be used to make gates, wires and memories. The basic logic circuits used in this technology are the inverter and the Majority Gate (MG, using this other logical circuits can be designed. Approach: In this paper, the adders such as half, full and serial bit were designed and analyzed. These structures were designed with minimum number of cells by using cell minimization techniques. The techniques are (1 using two cells inverter and (2 suitable arrangement of cells without overlapping of neighboring cells. The proposed method can be used to minimize area and complexity. Results: These circuits were designed by majority gate and implemented by QCA cells. Then, they simulated using QCA Designer. The simulated results were verified according to the truth table. Conclusion: The performance analyses of those circuits are compared according to complexity, area and number of clock cycles and are also compared with previous designs.

  3. Complex systems modeling by cellular automata

    NARCIS (Netherlands)

    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, an

  4. A Novel Seven Input Majority Gate in Quantum-dot Cellular Automata

    Directory of Open Access Journals (Sweden)

    Keivan Navi

    2012-01-01

    Full Text Available A Quantum Cellular Automaton (QCA is a nanotechnology which is an attractive alternative for transistor based technologies in the near future. A new seven input majority gate in quantum dot cellular automata is proposed in this paper. The basic elements in QCA are majority and inverter gates, therefore using a majority gate with more inputs in QCA circuit will cause reduction in cell count, latency and complexity. Furthermore, by using the proposed seven input majority gate we can design four inputs AND gate and OR gate in only two clock phases. By applying these kinds of gates QCA circuits could be simplified and optimized. In order to prove the functionality of the proposed device, QCADesigner tool and some physical proofs are utilized.

  5. An autonomous DNA model for finite state automata.

    Science.gov (United States)

    Martinez-Perez, Israel M; Zimmermann, Karl-Heinz; Ignatova, Zoya

    2009-01-01

    In this paper we introduce an autonomous DNA model for finite state automata. This model called sticker automaton model is based on the hybridisation of single stranded DNA molecules (stickers) encoding transition rules and input data. The computation is carried out in an autonomous manner by one enzyme which allows us to determine whether a resulting double-stranded DNA molecule belongs to the automaton's language or not.

  6. 信号交叉口人车交互运行元胞自动机模型构建%Construction of cellular automata model of alternate operation between pedestrians and vehicles at signal intersection

    Institute of Scientific and Technical Information of China (English)

    梁国华; 邓亚娟; 韩海; 马荣国; 卢杨

    2015-01-01

    为了确定过街设施的形式,分析了十字信号交叉口行人步行速度及机动车排队净空间距、转向车头时距等交通运行特性,通过对人车冲突行为调查与分析,构建了行人过街可插间隙选择概率模型。以人车交互运行特性为理论基础,建立了双向6车道行人正向前进、避让、侧向前进和机动车停车线前慢启动跟驰、停车线后转向跟驰、目标车道选择规则,引入了人行横道处行人和机动车冲突判定选择规则,将行人过街规则和机动车通行规则进行了叠加,构建信号交叉口人车交互运行元胞自动机模型。以主主相交的双向6车道十字信号交叉口为例,分析了采用行人过街专用信号相位和立体过街设施形式的适用性。结果表明:当交通量不小于4500 pcu·h-1、右转车比例不小于70%、信号周期不小于90 s、左转相位绿信比不小于50%、行人流量不小于2700人·( h·m)-1时,应采用立体过街设施形式。%To determine the form of crossing facilities,The traffic characteristics of pedestrians’ walking speed and vehicles’ queuing spacing, headway of steering were analyzed in signalized intersection. The probabilistic model of acceptable gap choice for pedestrians crossing the intersection was constructed by survey and analysis of conflicting operations between pedestrians and vehicles. On the theoretical foundation of characteristics from alternate operations between pedestrians and vehicles, rules concerning pedestrians walking forward, avoidance, lateral walking forward, vehicles stop⁃to⁃slow following, steering following, and target lanes selection in bidirectional six lanes were established;selective rules concerning conflicts identification between pedestrians and vehicles at pedestrian crossroads were introduced. Therefore, the cellular automata model of alternate operations between pedestrians and vehicles at signal

  7. Simulation of effect of fault structure heterogeneity on seismicity using cellular automata model%断层结构非均匀性对地震活动性影响的细胞自动机模拟

    Institute of Scientific and Technical Information of China (English)

    李锰; 杨峰

    2011-01-01

    A 2-D cellular automata fault model with 81×81 cells was constructed to test its seismicity performance. In a series of tests 4 kinds of fault strength heterogeneity and 6 different strength geometrical distributions were taken. With the model simulation we analyzed how the fault structure heterogeneity affects macroscopic fault failure behavior and generated seismic sequence type. The results show that with increasing degree of heterogeneity the macroscopic deformation and fracture process present from brittle to plastic behavior, and produce 3 different types of seismic sequence, I.e. , main shock type, foreshock-main shock-aftershock type and swarm type. In the same time, with increasing fault strength heterogeneity the fracture size distribution more regularly follows the G-R relation. Besides, temporarily the events occur in a certain random process, that is, small events appear randomly, medium size events occur in clusters and large ones emerge quasi-periodically. The event clustering and quasi-periodic occurrences become less significant with the fault heterogeneity increasing. It is also found that the randomness of structural geometric variation may affect characteristics of seismic sequences, but the difference in randomness becomes weaker as degree of heterogeneity increases.%基于断层强度分布的非均匀性,构建了由81×81个细胞单元组成的4种不同匀质度及其各自6种不同随机构型共计24个非均匀二维单断层模型样本,并通过设计的细胞自动机模拟程序,在保持其它模拟参数不变的条件下对它们进行了模拟试验.研究结果表明,随着断层结构非匀质度的增加,其宏观变形破坏行为由相对脆性向塑性变化;地震序列类型依次表现出主震型、前震-主震-余震型和震群型;震级分布表现出非均匀性依次减小;地震发生在时间上表现为一种确定性的随机过程,即小震随机、中强地震丛集和大震准周期的特点.此

  8. A Compact Self-organizing Cellular Automata-based Genetic Algorithm

    CERN Document Server

    Barmpoutis, Vasileios

    2007-01-01

    A Genetic Algorithm (GA) is proposed in which each member of the population can change schemata only with its neighbors according to a rule. The rule methodology and the neighborhood structure employ elements from the Cellular Automata (CA) strategies. Each member of the GA population is assigned to a cell and crossover takes place only between adjacent cells, according to the predefined rule. Although combinations of CA and GA approaches have appeared previously, here we rely on the inherent self-organizing features of CA, rather than on parallelism. This conceptual shift directs us toward the evolution of compact populations containing only a handful of members. We find that the resulting algorithm can search the design space more efficiently than traditional GA strategies due to its ability to exploit mutations within this compact self-organizing population. Consequently, premature convergence is avoided and the final results often are more accurate. In order to reinforce the superior mutation capability, ...

  9. 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.

  10. Design of efficient full adder in quantum-dot cellular automata.

    Science.gov (United States)

    Sen, Bibhash; Rajoria, Ayush; Sikdar, Biplab K

    2013-01-01

    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 μ m(2)) 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.

  11. 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.

  12. Non-probabilistic cellular automata-enhanced stereo vision simultaneous localization and mapping

    Science.gov (United States)

    Nalpantidis, Lazaros; Sirakoulis, Georgios Ch; Gasteratos, Antonios

    2011-11-01

    In this paper, a visual non-probabilistic simultaneous localization and mapping (SLAM) algorithm suitable for area measurement applications is proposed. The algorithm uses stereo vision images as its only input and processes them calculating the depth of the scenery, detecting occupied areas and progressively building a map of the environment. The stereo vision-based SLAM algorithm embodies a stereo correspondence algorithm that is tolerant to illumination differentiations, the robust scale- and rotation-invariant feature detection and matching speeded-up robust features method, a computationally effective v-disparity image calculation scheme, a novel map-merging module, as well as a sophisticated cellular automata-based enhancement stage. A moving robot equipped with a stereo camera has been used to gather image sequences and the system has autonomously mapped and measured two different indoor areas.

  13. A parallel block-based encryption schema for digital images using reversible cellular automata

    Directory of Open Access Journals (Sweden)

    Faraoun Kamel Mohamed

    2014-06-01

    Full Text Available We propose a novel images encryption schema based on reversible one-dimensional cellular automata. Contrasting to the sequential operating mode of several existing approaches, the proposed one is fully parallelizable since the encryption/decryption tasks can be executed using multiple processes running independently for the same single image. The parallelization is made possible by defining a new RCA-based construction of an extended pseudorandom permutation that takes a nonce as a supplementary parameter. The defined PRP exploit the chaotic behavior and the high initial condition's sensitivity of the RCAs to ensure perfect cryptographic security properties. Results of various experiments and analysis show that high security and execution performances can be achieved using the approach, and furthermore, it provides the ability to perform a selective area decryption since any part of the ciphered-image can be deciphered independently from others, which is very useful for real time applications.

  14. Universality of One-Dimensional Reversible and Number-Conserving Cellular Automata

    Directory of Open Access Journals (Sweden)

    Kenichi Morita

    2012-08-01

    Full Text Available We study one-dimensional reversible and number-conserving cellular automata (RNCCA that have both properties of reversibility and number-conservation. In the case of 2-neighbor RNCCA, García-Ramos proved that every RNCCA shows trivial behavior in the sense that all the signals in the RNCCA do not interact each other. However, if we increase the neighborhood size, we can find many complex RNCCAs. Here, we show that for any one-dimensional 2-neighbor reversible partitioned CA (RPCA with s states, we can construct a 4-neighbor RNCCA with 4s states that simulates the former. Since it is known that there is a computationally universal 24-state 2-neighbor RPCA, we obtain a universal 96-state 4-neighbor RNCCA.

  15. A testable parity conservative gate in quantum-dot cellular automata

    Science.gov (United States)

    Karkaj, Ehsan Taher; Heikalabad, Saeed Rasouli

    2017-01-01

    There are important challenges in current VLSI technology such as feature size. New technologies are emerging to overcome these challenges. One of these technologies is quantum-dot cellular automata (QCA) but it also has some disadvantages. One of the very important challenges in QCA is the occurrence of faults due to its very small area. There are different ways to overcome this challenge, one of which is the testable logic gate. There are two types of testable gate; reversible gate, and conservative gate. We propose a new testable parity conservative gate in this paper. This gate is simulated with QCADesigner and compared with previous structures. Power dissipation of proposed gate investigated using QCAPro simulator as an accurate power estimator tool.

  16. Encryption Based on the Permutation of Cellular Automata%细胞自动机置换群加密技术研究

    Institute of Scientific and Technical Information of China (English)

    张传武; 彭启琮; 朱甫臣

    2003-01-01

    With the development of the information technology ,information security ,as well as the implementation ofthe encryption system becomes more and more complexity,and therefore new methods are explored to simplify com-plexity of the implementation. Cellular automata has the characters of simplicity of basic components ,locality of cellu-lar automata interactions ,massive parallelism of information processing ,and exhibits complex global properties, whichmakes it suitable for the application in cryptography. This paper presents a new method of encryption,the key of thenew method consists of the permutation cellular automata, the vectors inputted, and the number of the itera-tion. Evidently,it has larger kev space than other methods with only the cellular automata itself as the key.

  17. Modelling discrete longitudinal data using acyclic probabilistic finite automata

    DEFF Research Database (Denmark)

    Anantharama Ankinakatte, Smitha; Edwards, David

    2015-01-01

    Acyclic probabilistic finite automata (APFA) constitute a rich family of models for discrete longitudinal data. An APFA may be represented as a directed multigraph, and embodies a set of context-specific conditional independence relations that may be read off the graph. A model selection algorithm...... to minimize a penalized likelihood criterion such as AIC or BIC is described. This algorithm is compared to one implemented in Beagle, a widely used program for processing genomic data, both in terms of rate of convergence to the true model as the sample size increases, and a goodness-of-fit measure assessed...

  18. Simulating the conversion of rural settlements to town land based on multi-agent systems and cellular automata.

    Science.gov (United States)

    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.

  19. 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 le...

  20. 基于最大发展潜力值的元胞自动机城市扩张模型%Cellular Automata Urban Expansion Model Based on the Max imum Potential Value of Cell Transformation

    Institute of Scientific and Technical Information of China (English)

    张梦珂; 刘艳芳; 何青松

    2016-01-01

    The potential of land cover change could be estimated on the basis of urbanization level and land development evaluation. Based on the potential value, a new method of simulating urban expansion that is different from the traditional Cellular Automata is proposed.According to development potentiality in every search process, the method described in this article only transforms cells with a maximum potential value that are suitable for neighborhood requirements into urban cells.Compared with traditional methods, trans-formation threshold is not required with this new strategy.Each of the two methods is applied to simulating urban expansion of the main urban area of Wuhan from 2003 to 2013 separately, and it is demonstrated that the precision of the new ameliorated method is signifi-cantly improved compared to the traditional methodology.%在城镇化发展水平及土地开发评价的基础上,评价待扩张区域土地转变潜力分值,基于最大转变潜力分值,提出一种有别于传统元胞自动机模拟城市扩张的新方法。该方法与传统元胞自动机模拟城市扩张相比在迭代方式上存在不同,它克服了传统元胞自动机因阈值设置不同而导致结果不确定的难题。分别将该方法与传统元胞自动机模型应用于武汉主城区,模拟了其2003年到2013年的城市扩张情况,最后,将模拟结果与实际土地利用现状图进行对比发现改进后的新方法在模拟精度上大大提高。

  1. Micro-simulation of vehicle conflicts involving right-turn vehicles at signalized intersections based on cellular automata.

    Science.gov (United States)

    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.

  2. Small universal cellular automata in hyperbolic spaces a collection of jewels

    CERN Document Server

    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...

  3. Cellular automata segmentation of the boundary between the compacta of vertebral bodies and surrounding structures

    Science.gov (United States)

    Egger, Jan; Nimsky, Christopher

    2016-03-01

    Due to the aging population, spinal diseases get more and more common nowadays; e.g., lifetime risk of osteoporotic fracture is 40% for white women and 13% for white men in the United States. Thus the numbers of surgical spinal procedures are also increasing with the aging population and precise diagnosis plays a vital role in reducing complication and recurrence of symptoms. Spinal imaging of vertebral column is a tedious process subjected to interpretation errors. In this contribution, we aim to reduce time and error for vertebral interpretation by applying and studying the GrowCut - algorithm for boundary segmentation between vertebral body compacta and surrounding structures. GrowCut is a competitive region growing algorithm using cellular automata. For our study, vertebral T2-weighted Magnetic Resonance Imaging (MRI) scans were first manually outlined by neurosurgeons. Then, the vertebral bodies were segmented in the medical images by a GrowCut-trained physician using the semi-automated GrowCut-algorithm. Afterwards, results of both segmentation processes were compared using the Dice Similarity Coefficient (DSC) and the Hausdorff Distance (HD) which yielded to a DSC of 82.99+/-5.03% and a HD of 18.91+/-7.2 voxel, respectively. In addition, the times have been measured during the manual and the GrowCut segmentations, showing that a GrowCutsegmentation - with an average time of less than six minutes (5.77+/-0.73) - is significantly shorter than a pure manual outlining.

  4. Genetic algorithms for determining the parameters of cellular automata in urban simulation

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    This paper demonstrates that cellular automata (CA) can be a useful tool for analyzing the process of many geographical phenomena. There are many studies on using CA to simulate the evolution of cites. Urban dynamics is determined by many spatial variables. The contribution of each spatial variable to the simulation is quantified by its parameter or weight. Calibration procedures are usually required for obtaining a suitable set of parameters so that the realistic urban forms can be simulated. Each parameter has a unique role in controlling urban morphology in the simulation. In this paper, these parameters for urban simulation are determined by using empirical data. Genetic algorithms are used to search for the optimal combination of these parameters. There are spatial variations for urban dynamics in a large region. Distinct sets of parameters can be used to represent the unique features of urban dynamics for various subregions. A further experiment is to evaluate each set of parameters based on the theories of compact cities. It is considered that the better set of parameters can be identified according to the utility function in terms of compact development. This set of parameters can be cloned to other regions to improve overall urban morphology. The original parameters can be also modified to produce more compact urban forms for planning purposes. This approach can provide a useful exploratory tool for testing various planning scenarios for urban development.

  5. Image encryption and compression based on kronecker compressed sensing and elementary cellular automata scrambling

    Science.gov (United States)

    Chen, Tinghuan; Zhang, Meng; Wu, Jianhui; Yuen, Chau; Tong, You

    2016-10-01

    Because of simple encryption and compression procedure in single step, compressed sensing (CS) is utilized to encrypt and compress an image. Difference of sparsity levels among blocks of the sparsely transformed image degrades compression performance. In this paper, motivated by this difference of sparsity levels, we propose an encryption and compression approach combining Kronecker CS (KCS) with elementary cellular automata (ECA). In the first stage of encryption, ECA is adopted to scramble the sparsely transformed image in order to uniformize sparsity levels. A simple approximate evaluation method is introduced to test the sparsity uniformity. Due to low computational complexity and storage, in the second stage of encryption, KCS is adopted to encrypt and compress the scrambled and sparsely transformed image, where the measurement matrix with a small size is constructed from the piece-wise linear chaotic map. Theoretical analysis and experimental results show that our proposed scrambling method based on ECA has great performance in terms of scrambling and uniformity of sparsity levels. And the proposed encryption and compression method can achieve better secrecy, compression performance and flexibility.

  6. Learning automata an introduction

    CERN Document Server

    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.

  7. Cellular automata-based tunnel fire simulation%基于元胞自动机的井巷火灾仿真

    Institute of Scientific and Technical Information of China (English)

    李翠平; 胡磊; 侯定勇; 张佳

    2013-01-01

    提出了一种基于元胞自动机的井巷火灾可视化仿真方法。在矿井巷道可视化的基础上,通过对火灾元胞进行表征,综合考虑可燃物类型与投放密度、井巷通风、井巷坡度等因素对井巷火源引燃效果的影响及双扩散作用、井巷通风、浮力作用和节流作用等因素对火灾烟气蔓延效果的影响,采用概率函数进行元胞自动机建模,构建了表达元胞温度的井巷火源燃烧模型和表达元胞浓度的井巷火灾烟气蔓延模型。基于火源元胞燃烧演化规则和烟气元胞蔓延演化规则,通过可视化手段展示了井巷火灾火源燃烧和有害气体浓度的时空发展变化。同时以矿山实际数据进行检验,说明了基于元胞自动机的井巷火灾仿真的可行性与有效性。%This article introduces a mine fire visualization simulation method based on cellular automata. On the basis of mine tunnel visualization, a tunnel fire combustion model for expressing cellular temperature and a tunnel fire smoke spread model for expressing cellular concentration were built by fire cell characterization. In these models the influence of fuel type and input density, ventilation and roadway slope on mine fire ignition and the effect of double diffusion, ventilation, buoyancy and throttling on fire smoke spread were taken into account, and a probability function was used for cellular automata modelling. Then according to the fire cellular combustion evolution rules and smoke cellular spreading evolution rules, the spatial changes of tunnel fire burning and harmful gas concentration were demonstrated through visualization means. Actual data from a mine proves the feasibility and effectiveness of tunnel fire simulation based on cellular automata.

  8. Cellular automata approach for investigation of low power light effects on the dynamics of plant-inhabiting

    Energy Technology Data Exchange (ETDEWEB)

    Bandini, S. (Milan Univ. (Italy). Dip. di Scienza dell' Informazione); Casati, R.; Milani, M. (Milan Univ. (Italy). Dip. di Fisica)

    1998-10-01

    The prey-predator competition is a typical problem exhibited by the dynamics of phytophagous and predaceous mite population. Biological parameters of Tetranychus urticae Koch (Acari: Tetranychidae) and Amblyseius californicus McGregor (Acari: Phytoseiidae) are set up in order to establish the fundamental aspects to be embodied into a simulation model. The paper introduces the Lotka-Volterra differential equations as the classical approach to the problem and present the Cellular-Automata (CA) approach as an alternative one. It reports preliminary results which account for a number of interesting features such as: 1) oscillations in time of the population, 2) a link between the populations' initial conditions and the obtained solution, 3) the appearance of spatial structures, and 4) the effect on the population dynamics of parameters which may be linked to photoperiodic and circadian features. Furthermore, it is shown that several sophisticated features affecting populations evolution, such as the egg opening time, the sexual maturation time, the limited lifetime, the limited survival capability of predators in fasting condition and juvenile mortality can be easily included in a CA-based model.

  9. Cellular Automata-based Chloride Ion Diffusion Simulation of Concrete Bridges under Multi-factor Coupling Actions

    Institute of Scientific and Technical Information of China (English)

    ZHU Jinsong; HE Likun

    2012-01-01

    Abstract In order to accurately simulate the diffusion of chloride ion in the existing concrete bridge and acquire the precise chloride ion concentration at given time,a cellular automata (CA)-based model is proposed.The process of chloride ion diffusion is analyzed by the CA-based method and a nonlinear solution of the Fick's second law is obtained.Considering the impact of various factors such as stress states,temporal and spatial variability of diffusion parameters and water-cement ratio on the process of chloride ion diffusion,the model of chloride ion diffusion under multi-factor coupling actions is presented.A chloride ion penetrating experiment reported in the literature is used to prove the effectiveness and reasonability of the present method,and a T-type beam is taken as an illustrative example to analyze the process of chloride ion diffusion in practical application.The results indicate that CA-based method can simulate the diffusion of chloride ion in the concrete structures with acceptable precision.

  10. Reaction-Diffusion Automata Phenomenology, Localisations, Computation

    CERN Document Server

    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...

  11. Simulation of the Relation between Magnitude and Stress Drop Using Heterogeneous Cellular Automata Model%利用非均匀细胞自动机模拟震级与应力降关系

    Institute of Scientific and Technical Information of China (English)

    李锰; 杨峰; 胡伟华

    2011-01-01

    为解释实际观测资料震源破裂过程与自相似(分形)模型的不一致性,本文基于观测结果,构建了由81×81个细胞单元组成二维非均匀断层模型,并通过设计的细胞自动机模拟程序进行了模拟试验.研究结果表明:断层结构非均匀性是影响孕震过程特征的重要因素,而且地震强度分布并非简单的自相似.随着断层非匀质性增加,破裂过程出现由相对的脆性破坏向塑性破坏特征变化的趋势.利用细胞自动机不仅能较好地解释震级-频度关系中的大、小震级段低头现象,而且也可解释大震级事件具有相对恒定的应力降,得到了与实际观测研究相一致的结果.%In the paper, three kinds of heterogeneous faults with 81 ×81 cells are set up using celluar automata models and simulated for explaining the inconsistency between the observations and fractal-based model. The results show that the G-R relations behave not in simple self-similarity but multi-fractal, and with the increasing of heterogeneity the fracture process tends to turn from brittle to plastic behaviors. At the same time, using the models can explain not only the curvature at smaller and larger magnitudes in G-R relation but also the relatively constant stress drop for larger magnitude earthquake events.Fault structural heterogeneity plays a important role in earthquake preparation process.The results from computer simulation are consistent with observations from detailed seismicity studies.

  12. Automata network models of galaxy evolution

    Science.gov (United States)

    Chappell, David; Scalo, John

    1993-01-01

    Two ideas appear frequently in theories of star formation and galaxy evolution: (1) star formation is nonlocally excitatory, stimulating star formation in neighboring regions by propagation of a dense fragmenting shell or the compression of preexisting clouds; and (2) star formation is nonlocally inhibitory, making H2 regions and explosions which can create low-density and/or high temperature regions and increase the macroscopic velocity dispersion of the cloudy gas. Since it is not possible, given the present state of hydrodynamic modeling, to estimate whether one of these effects greatly dominates the other, it is of interest to investigate the predicted spatial pattern of star formation and its temporal behavior in simple models which incorporate both effects in a controlled manner. The present work presents preliminary results of such a study which is based on lattice galaxy models with various types of nonlocal inhibitory and excitatory couplings of the local SFR to the gas density, temperature, and velocity field meant to model a number of theoretical suggestions.

  13. Automata-Based CSL Model Checking

    DEFF Research Database (Denmark)

    Zhang, Lijun; Jansen, David N.; Nielson, Flemming;

    2011-01-01

    For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996. The presented decision procedure, however, has exponential complexity. In this paper, we...

  14. Understanding the Future of Change Agency in Sustainability Through Cellular Automata Scenarios: The Role of Timing †

    Directory of Open Access Journals (Sweden)

    Ricardo Sosa

    2011-03-01

    Full Text Available One of the main interdisciplinary challenges today is to understand and change the dominant social perceptions and values that support and perpetuate unsustainable practices. Social computational simulations have been conceived in recent years to understand emergent results from complex systems. These dynamic social models are of interest to sustainability researchers because they provide a means to implement hypotheses and explore scenarios that could help extend our understanding of the future role of change agency in society. Change agents are individuals who directly or indirectly enable sustainable behaviors or inhibit practices that damage the environment and large social groups. Evidence-based strategies, guidelines and methods are necessary in order to manage creative change agency more effectively. This paper presents work with computational simulations, known as cellular automata, in order to explore the role of timing in triggering social change through uncoordinated, autonomous individual action. The paper identifies a number of issues related to creative change agency and proposes associated guidelines for practitioners. As a means of early validation, these findings are portrayed against empirical studies in the literature.

  15. A simplified cellular automation model for city traffic

    Energy Technology Data Exchange (ETDEWEB)

    Simon, P.M.; Nagel, K. [Los Alamos National Lab., NM (United States)]|[Santa Fe Inst., NM (United States)

    1997-12-31

    The authors systematically investigate the effect of blockage sites in a cellular automata model for traffic flow. Different scheduling schemes for the blockage sites are considered. None of them returns a linear relationship between the fraction of green time and the throughput. The authors use this information for a fast implementation of traffic in Dallas.

  16. An enhanced high-speed multi-digit BCD adder using quantum-dot cellular automata

    Science.gov (United States)

    Ajitha, D.; Ramanaiah, K. V.; Sumalatha, V.

    2017-02-01

    The advent of development of high-performance, low-power digital circuits is achieved by a suitable emerging nanodevice called quantum-dot cellular automata (QCA). Even though many efficient arithmetic circuits were designed using QCA, there is still a challenge to implement high-speed circuits in an optimized manner. Among these circuits, one of the essential structures is a parallel multi-digit decimal adder unit with significant speed which is very attractive for future environments. To achieve high speed, a new correction logic formulation method is proposed for single and multi-digit BCD adder. The proposed enhanced single-digit BCD adder (ESDBA) is 26% faster than the carry flow adder (CFA)-based BCD adder. The multi-digit operations are also performed using the proposed ESDBA, which is cascaded innovatively. The enhanced multi-digit BCD adder (EMDBA) performs two 4-digit and two 8-digit BCD addition 50% faster than the CFA-based BCD adder with the nominal overhead of the area. The EMDBA performs two 4-digit BCD addition 24% faster with 23% decrease in the area, similarly for 8-digit operation the EMDBA achieves 36% increase in speed with 21% less area compared to the existing carry look ahead (CLA)-based BCD adder design. The proposed multi-digit adder produces significantly less delay of (N –1) + 3.5 clock cycles compared to the N* One digit BCD adder delay required by the conventional BCD adder method. It is observed that as per our knowledge this is the first innovative proposal for multi-digit BCD addition using QCA.

  17. Behavioral Modeling Based on Probabilistic Finite Automata: An Empirical Study.

    Science.gov (United States)

    Tîrnăucă, Cristina; Montaña, José L; Ontañón, Santiago; González, Avelino J; Pardo, Luis M

    2016-06-24

    Imagine an agent that performs tasks according to different strategies. The goal of Behavioral Recognition (BR) is to identify which of the available strategies is the one being used by the agent, by simply observing the agent's actions and the environmental conditions during a certain period of time. The goal of Behavioral Cloning (BC) is more ambitious. In this last case, the learner must be able to build a model of the behavior of the agent. In both settings, the only assumption is that the learner has access to a training set that contains instances of observed behavioral traces for each available strategy. This paper studies a machine learning approach based on Probabilistic Finite Automata (PFAs), capable of achieving both the recognition and cloning tasks. We evaluate the performance of PFAs in the context of a simulated learning environment (in this case, a virtual Roomba vacuum cleaner robot), and compare it with a collection of other machine learning approaches.

  18. Computer Models and Automata Theory in Biology and Medicine

    CERN Document Server

    Baianu, I C

    2004-01-01

    The applications of computers to biological and biomedical problem solving goes back to the very beginnings of computer science, automata theory [1], and mathematical biology [2]. With the advent of more versatile and powerful computers, biological and biomedical applications of computers have proliferated so rapidly that it would be virtually impossible to compile a comprehensive review of all developments in this field. Limitations of computer simulations in biology have also come under close scrutiny, and claims have been made that biological systems have limited information processing power [3]. Such general conjectures do not, however, deter biologists and biomedical researchers from developing new computer applications in biology and medicine. Microprocessors are being widely employed in biological laboratories both for automatic data acquisition/processing and modeling; one particular area, which is of great biomedical interest, involves fast digital image processing and is already established for rout...

  19. Microstructural descriptors and cellular automata simulation of the effects of non-random nuclei location on recrystallization in two dimensions

    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.

  20. Simulation of primary static recrystallization with cellular operator model

    OpenAIRE

    Mukhopadhyay, Prantik

    2005-01-01

    1. Based on the modified cellular automata approach of Reher [60] a cellular operator model has been developed that is capable of accounting for spatial and temporal inhomogeneity on a finer scale. For this a scalable subgrid automaton is introduced that allows for a high spatial resolution on demand and still high computational efficiency. The scalable subgrid permits to track the minute changes of growth front during recrystallization owing to local variations of boundary mobility and net d...

  1. Product interval automata

    Indian Academy of Sciences (India)

    Deepak D’Souza; P S Thiagarajan

    2002-04-01

    We identify a subclass of timed automata called product interval automata and develop its theory. These automata consist of a network of timed agents with the key restriction being that there is just one clock for each agent and the way the clocks are read and reset is determined by the distribution of shared actions across the agents. We show that the resulting automata admit a clean theory in both logical and language theoretic terms. We also show that product interval automata are expressive enough to model the timed behaviour of asynchronous digital circuits.

  2. Analytic approach to stochastic cellular automata: exponential and inverse power distributions out of Random Domino Automaton

    CERN Document Server

    Bialecki, Mariusz

    2010-01-01

    Inspired by extremely simplified view of the earthquakes we propose the stochastic domino cellular automaton model exhibiting avalanches. From elementary combinatorial arguments we derive a set of nonlinear equations describing the automaton. Exact relations between the average parameters of the model are presented. Depending on imposed triggering, the model reproduces both exponential and inverse power statistics of clusters.

  3. Reversible one-dimensional cellular automata with one of the two Welch indices equal to 1 and full shifts

    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.

  4. Cellular Automata Simulations of Thermal and Electrical Transport Properties of Thin-Film Polymer/CNTs Nanocomposites

    Science.gov (United States)

    Casey, Alex; Iannacchione, Germano; Georgiev, Georgi; Cebe, Peggy

    2014-03-01

    A computational algorithm has been developed to simulate the transport properties of oriented and un-oriented thin film nanocomposites of isotactic Polypropylene (iPP) and carbon nanotubes (CNT) with increasing CNT concentration. Our goal is to be able to design materials with optimal properties using simulations. We use cellular automata approach in Matlab simulation environment. The percolation threshold is reproduced in the simulations, matching experimental data. Upon percolation, the thermal transport in the films increases sharply, more so for the electrical than for the thermal conductivity, due to the larger difference in the electric conductivities of the CNTs and the polymer. To verify the simulation, the thin-film samples were sheared in the melt at 200 C at 1 Hz in a Linkan microscope shearing hot stage. The thermal and electrical conductivity measurements were performed on the same cell arrangement with the transport perpendicular to the thin-film plane using a DC method. The thermal and electrical conductivity are higher for the un-sheared as compared to the sheared samples with stronger temperature dependence for the latter as compared to the former. Our cellular automata simulations provide information about the microstructure-macroscopic property relation in the thin film nanocomposites and can be extended to simulations of other important materials.

  5. Secure Key Exchange for Cloud Environment Using Cellular Automata with Triple-DES and Error-Detection

    Directory of Open Access Journals (Sweden)

    Govinda.K

    2013-04-01

    Full Text Available The information housed on the cloud is often seen as valuable to individuals with malicious intent. There is a lot of personal information and potentially secure data that people store on theircomputers, and this information is now being transferred to the cloud. This makes it critical for you to understand the security measures that your cloud provider has in place, and it is equally important to take personal precautions to secure your data. In the world of cloud computing, security is the big issue because of open system architecture. The data transferred through cloud should be secure and there is a possible to attack the data in middle. In this paper, we deal with key exchange between cloud user’s using cellular automata. It is hard to trace the key by man-in-the-middle-attack because of Strong encryption algorithm (Triple-DES with CA (Cellular Automata Rules. Besides CRC (Cyclic Redundancy Check is done to ensure data integrity at the user’s end.

  6. A STUDY ON CELLULAR AUTOMATA BASED ON RELATIONAL DATABASES AND SPATIO-TEMPORAL SIMULATIONS OF CULTURE DIFFUSION

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    This paper presents a development of the extended Cellular Automata (CA), based on relational databases(RDB), to model dynamic interactions among spatial objects. The integration of Geographical Information System (GIS)and CA has the great advantage of simulating geographical processes. But standard CA has some restrictions in cellularshape and neighbourhood and neighbour rules, which restrict the CA's ability to simulate complex, real world environ-ments. This paper discusses a cell's spatial relation based on the spatial object's geometrical and non-geometrical characteris-tics, and extends the cell' s neighbour definition, and considers that the cell' s neighbour lies in the forms of not only spa-tial adjacency but also attribute correlation. This paper then puts forward that spatial relations between two different cellscan be divided into three types, including spatial adjacency, neighbourhood and complicated separation. Based on tradition-al ideas, it is impossible to settle CA's restrictions completely. RDB-based CA is an academic experiment, in whichsome fields are designed to describe the essential information needed to define and select a cell's neighbour. The cultureinnovation diffusion system has multiple forms of space diffusion and inherited characteristics that the RDB-based CA iscapable of simulating more effectively. Finally this paper details a successful case study on the diffusion of fashion weartrends. Compared to the original CA, the RDB-based CA is a more natural and efficient representation of human knowl-edge over space, and is an effective tool in simulating complex systems that have multiple forms of spatial diffusion.

  7. Parallel Cellular Automata-based simulation of laser dynamics using dynamic load balancing

    NARCIS (Netherlands)

    Guisado, J.L.; Fernández de Vega, F.; Jiménez Morales, F.; Iskra, K.A.; Sloot, P.M.A.; Garnica, Ó.

    2008-01-01

    In order to analyze the feasibility of executing a parallel bioinspired model of laser dynamics on a heterogeneous non-dedicated cluster, we evaluate its performance including artificial load to simulate other tasks or jobs submitted by other users. As the model is based on a synchronous cellular au

  8. [Simulation of urban ecological security pattern based on cellular automata: a case of Dongguan City, Guangdong Province of South China].

    Science.gov (United States)

    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.

  9. Long-time tails of the velocity autocorrelation function in 2D and 3D lattice gas cellular automata: a test of mode-coupling theory

    NARCIS (Netherlands)

    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 t-D/

  10. A Novel Fast and Secure Mutual Remote User Authentication Protocol with Session Key Agreement Using Second Order Cellular Automata

    Directory of Open Access Journals (Sweden)

    Sofiane Baghor

    2016-06-01

    Full Text Available In this paper, we propose a novel remote user authentication protocol with session key agreement, using the mechanism of one-dimensional second order cellular automata. The scheme use simple and elementary operations to handle the problem of mutual authentication between two communicating parties, and enable the sharing of a common secure session key. Security of the proposed scheme is shown to be high, while it resist most common attacks on authentications schemes. Besides, runtime performances of the authentication protocol are very competitive, and outperform those of existing similar schemes. The proposed schemes ensure the three authentication requirements, namely the mutuality, the authenticity and the key agreement using only elementary and parallelizable operations, without requiring any addition cryptographic functions

  11. UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata

    DEFF Research Database (Denmark)

    Bulychev, Petr; David, Alexandre; Larsen, Kim Guldstrand

    2012-01-01

    This paper offers a survey of U PPAAL - SMC, a major extension of the real-time verification tool U PPAAL. U PPAAL - SMC allows for the efficient analysis of performance properties of networks of priced timed automata under a natural stochastic semantics. In particular, U PPAAL - SMC relies on a ...

  12. Oestrus Detection in Dairy Cows using Automata Modelling and Diagnosis Techniques

    DEFF Research Database (Denmark)

    Jónsson, Ragnar Ingi; Caponetti, Fabio; Blanke, Mogens

    2009-01-01

    This paper addresses detection of oestrus in dairy cows using automata-based modelling and diagnosis. Measuring lying/standing behaviour of the cows by a sensor attached to the cows hindleg, lying/standing behaviour is modelled as a stochastic automaton. The paper introduces a cow's lying-balance...

  13. Two-lane traffic rules for cellular automata: A systematic approach

    Energy Technology Data Exchange (ETDEWEB)

    Nagel, K. [Los Alamos National Lab., NM (United States)]|[Forschungszentrum Juelich (Germany). Hoechsteleistungsrechenzentrum HLRZ; Wolf, D.E. [Forschungszentrum Juelich (Germany). Hoechstleistungsrechenzentrum HLRZ]|[Gerhard-Mercator-Univ., Duisburg (Germany). Theoretische Physik; Wagner, P. [Univ. zu Koeln (Germany). Zentrum Fuer Paralleles Rechnen]|[Deutsche Forschungsanstalt fuer Luft- und Raumfahrt, Koeln (Germany); Simon, P. [Los Alamos National Lab., NM (United States)

    1997-11-05

    Microscopic modeling of multi-lane traffic is usually done by applying heuristic lane changing rules, and often with unsatisfying results. Recently, a cellular automation model for two-lane traffic was able to overcome some of these problems and to produce a correct density inversion at densities somewhat below the maximum flow density. In this paper, the authors summarize different approaches to lane changing and their results, and propose a general scheme, according to which realistic lane changing rules can be developed. They test this scheme by applying it to several different lane changing rules, which, in spite of their differences, generate similar and realistic results. The authors thus conclude that, for producing realistic results, the logical structure of the lane changing rules, as proposed here, is at least as important as the microscopic details of the rules.

  14. Computational connectionism within neurons: A model of cytoskeletal automata subserving neural networks

    Science.gov (United States)

    Rasmussen, Steen; Karampurwala, Hasnain; Vaidyanath, Rajesh; Jensen, Klaus S.; Hameroff, Stuart

    1990-06-01

    “Neural network” models of brain function assume neurons and their synaptic connections to be the fundamental units of information processing, somewhat like switches within computers. However, neurons and synapses are extremely complex and resemble entire computers rather than switches. The interiors of the neurons (and other eucaryotic cells) are now known to contain highly ordered parallel networks of filamentous protein polymers collectively termed the cytoskeleton. Originally assumed to provide merely structural “bone-like” support, cytoskeletal structures such as microtubules are now recognized to organize cell interiors dynamically. The cytoskeleton is the internal communication network for the eucaryotic cell, both by means of simple transport and by means of coordinating extremely complicated events like cell division, growth and differentiation. The cytoskeleton may therefore be viewed as the cell's “nervous system”. Consequently the neuronal cytoskeleton may be involved in molecular level information processing which subserves higher, collective neuronal functions ultimately relating to cognition. Numerous models of information processing within the cytoskeleton (in particular, microtubules) have been proposed. We have utilized cellular automata as a means to model and demonstrate the potential for information processing in cytoskeletal microtubules. In this paper, we extend previous work and simulate associative learning in a cytoskeletal network as well as assembly and disassembly of microtubules. We also discuss possible relevance and implications of cytoskeletal information processing to cognition.

  15. Evaluation of dynamic behavior forecasting parameters in the process of transition rule induction of unidimensional cellular automata.

    Science.gov (United States)

    Weinert, Wagner Rodrigo; Lopes, Heitor Silvério

    2010-01-01

    The simulation of the dynamics of a cellular systems based on cellular automata (CA) can be computationally expensive. This is particularly true when such simulation is part of a procedure of rule induction to find suitable transition rules for the CA. Several efforts have been described in the literature to make this problem more treatable. This work presents a study about the efficiency of dynamic behavior forecasting parameters (DBFPs) used for the induction of transition rules of CA for a specific problem: the classification by the majority rule. A total of 8 DBFPs were analyzed for the 31 best-performing rules found in the literature. Some of these DBFPs were highly correlated each other, meaning they yield the same information. Also, most rules presented values of the DBFPs very close each other. An evolutionary algorithm, based on gene expression programming, was developed for finding transition rules according a given preestablished behavior. The simulation of the dynamic behavior of the CA is not used to evaluate candidate transition rules. Instead, the average values for the DBFPs were used as reference. Experiments were done using the DBFPs separately and together. In both cases, the best induced transition rules were not acceptable solutions for the desired behavior of the CA. We conclude that, although the DBFPs represent interesting aspects of the dynamic behavior of CAs, the transition rule induction process still requires the simulation of the dynamics and cannot rely only on the DBFPs.

  16. Conway's game of life is a near-critical metastable state in the multiverse of cellular automata

    Science.gov (United States)

    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."

  17. SURJECTIVE MULTIBAND LINEAR CELLULAR AUTOMATA AND SMITH'S NORMAL FORM // AUTÓMATAS CELULARES SOBREYECTIVOS MULTIBANDA Y LA FORMA NORMAL DE SMITH

    Directory of Open Access Journals (Sweden)

    Ignacia Arcaya

    2010-06-01

    Full Text Available In this paper the Smith normal form of certain matrices is used to provide another char acterization for the surjectivity of one-dimensional linear cellular automata with multiple local rules over the ring ZN of integers modulo N = 2.. We reached this goal through an adaptation of a well known result of G. A. Hedlund which characterize the surjectivity of general one-dimensional cellular automata. // RESUMEN: En este artículo es empleada la forma normal de Smith de ciertas matrices para ofrecer otra caracterización de la sobreyectividad de autómatas celulares lineales unidimensionales con múltiples reglas local sobre el anillo ZN de los enteros módulo N = 2. El objetivo es logrado mediante la adaptación de un conocido resultado de G. A. Hedlund que caracteriza la sobreyectividad de autómatas celulares unidimensionales en general.

  18. Predicting the impact of lava flows at Mount Etna by an innovative method based on Cellular Automata: Applications regarding land-use and civil defence planning

    Science.gov (United States)

    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

  19. 基于GPU的元胞自动机熔岩流动模拟%Lava flow simulation in cellular automata based on GPU

    Institute of Scientific and Technical Information of China (English)

    高超; 孟宪海; 李吉刚; 杨钦

    2015-01-01

    为解决基于元胞自动机进行熔岩流动模拟的计算效率问题,提出一种应用在元胞自动机上的GPU并行计算方法。将元胞自动机中每一个方形网格映射到GPU的一个逻辑计算单元上,通过并行计算,提高模拟的效率,解决传统串行计算方法的不足,使模拟达到实时性。模拟结果表明,在元胞自动机的物理模型理论基础上,用GPU并行计算进行加速,在模拟效果和时间效率上均取得了良好的效果。%To solve the computing efficiency problem of lava flow simulation based on cellular automata ,a GPU parallel compu‐ting method applied to cellular automata was proposed .Each square mesh in cellular automata was mapped to each core in the GPU .Through GPU parallel computing ,the efficiency of real‐time simulation was improved ,which solved the deficiency of tra‐ditional serial computing .The result demonstrates that lava flow simulation in cellular automata ,with the combination of the GPU parallel computing ,can achieve a high computing efficiency and a better simulation performance .

  20. Traffic dynamics around weaving section influenced by accident: Cellular automata approach

    Science.gov (United States)

    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.

  1. Mixed-valence molecular four-dot unit for quantum cellular automata: Vibronic self-trapping and cell-cell response

    Energy Technology Data Exchange (ETDEWEB)

    Tsukerblat, Boris, E-mail: tsuker@bgu.ac.il, E-mail: andrew.palii@uv.es [Ben-Gurion University of the Negev, Beer-Sheva (Israel); Palii, Andrew, E-mail: tsuker@bgu.ac.il, E-mail: andrew.palii@uv.es [Institute of Applied Physics, Academy of Sciences of Moldova, Kishinev (Moldova, Republic of); Clemente-Juan, Juan Modesto; Coronado, Eugenio [Instituto de Ciencia Molecular (ICMol), Universidad de Valencia, Paterna (Spain)

    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

  2. Quantum-dot cellular automata based reversible low power parity generator and parity checker design for nanocommunication

    Institute of Scientific and Technical Information of China (English)

    Jadav Chandra DAS; Debashis DE

    2016-01-01

    Quantum-dot cellular automata (QCA) is an emerging area of research in reversible computing. It can be used to design nanoscale circuits. In nanocommunication, the detection and correction of errors in a received message is a major factor. Besides, device density and power dissipation are the key issues in the nanocommunication architecture. For the first time, QCA-based designs of the reversible low-power odd parity generator and odd parity checker using the Feynman gate have been achieved in this study. Using the proposed parity generator and parity checker circuit, a nanocommunication architecture is pro-posed. The detection of errors in the received message during transmission is also explored. The proposed QCA Feynman gate outshines the existing ones in terms of area, cell count, and delay. The quantum costs of the proposed conventional reversible circuits and their QCA layouts are calculated and compared, which establishes that the proposed QCA circuits have very low quantum cost compared to conventional designs. The energy dissipation by the layouts is estimated, which ensures the possibility of QCA nano-device serving as an alternative platform for the implementation of reversible circuits. The stability of the proposed circuits under thermal randomness is analyzed, showing the operational efficiency of the circuits. The simulation results of the proposed design are tested with theoretical values, showing the accuracy of the circuits. The proposed circuits can be used to design more complex low-power nanoscale lossless nanocommunication architecture such as nano-transmitters and nano-receivers.

  3. Mean field dynamics of graphs I: Evolution of probabilistic cellular automata for random and small-world graphs

    CERN Document Server

    Waldorp, Lourens J

    2016-01-01

    It was recently shown how graphs can be used to provide descriptions of psychopathologies, where symptoms of, say, depression, affect each other and certain configurations determine whether someone could fall into a sudden depression. To analyse changes over time and characterise possible future behaviour is rather difficult for large graphs. We describe the dynamics of networks using one-dimensional discrete time dynamical systems theory obtained from a mean field approach to (elementary) probabilistic cellular automata (PCA). Often the mean field approach is used on a regular graph (a grid or torus) where each node has the same number of edges and the same probability of becoming active. We show that we can use variations of the mean field of the grid to describe the dynamics of the PCA on a random and small-world graph. Bifurcation diagrams for the mean field of the grid, random, and small-world graphs indicate possible phase transitions for certain parameter settings. Extensive simulations indicate for di...

  4. The Intrinsic Cause-Effect Power of Discrete Dynamical Systems—From Elementary Cellular Automata to Adapting Animats

    Directory of Open Access Journals (Sweden)

    Larissa Albantakis

    2015-07-01

    Full Text Available Current approaches to characterize the complexity of dynamical systems usually rely on state-space trajectories. In this article instead we focus on causal structure, treating discrete dynamical systems as directed causal graphs—systems of elements implementing local update functions. This allows us to characterize the system’s intrinsic cause-effect structure by applying the mathematical and conceptual tools developed within the framework of integrated information theory (IIT. In particular, we assess the number of irreducible mechanisms (concepts and the total amount of integrated conceptual information Φ specified by a system. We analyze: (i elementary cellular automata (ECA; and (ii small, adaptive logic-gate networks (“animats”, similar to ECA in structure but evolving by interacting with an environment. We show that, in general, an integrated cause-effect structure with many concepts and high Φ is likely to have high dynamical complexity. Importantly, while a dynamical analysis describes what is “happening” in a system from the extrinsic perspective of an observer, the analysis of its cause-effect structure reveals what a system “is” from its own intrinsic perspective, exposing its dynamical and evolutionary potential under many different scenarios.

  5. COMBINING FUZZY AND CELLULAR LEARNING AUTOMATA METHODS FOR CLUSTERING WIRELESS SENSOR NETWORK TO INCREASE LIFE OF THE NETWORK

    Directory of Open Access Journals (Sweden)

    Javad Aramideh

    2014-11-01

    Full Text Available Wireless sensor networks have attracted attention of researchers considering their abundant applications. One of the important issues in this network is limitation of energy consumption which is directly related to life of the network. One of the main works which have been done recently to confront with this problem is clustering. In this paper, an attempt has been made to present clustering method which performs clustering in two stages. In the first stage, it specifies candidate nodes for being head cluster with fuzzy method and in the next stage, the node of the head cluster is determined among the candidate nodes with cellular learning automata. Advantage of the clustering method is that clustering has been done based on three main parameters of the number of neighbors, energy level of nodes and distance between each node and sink node which results in selection of the best nodes as a candidate head of cluster nodes. Connectivity of network is also evaluated in the second part of head cluster determination. Therefore, more energy will be stored by determining suitable head clusters and creating balanced clusters in the network and consequently, life of the network increases.

  6. Simple Rules, Complex Behaviors-Symbolic Dynamics of Elementary Cellular Automata%细胞自动机:简单的规则,复杂的行为

    Institute of Scientific and Technical Information of China (English)

    陈芳跃; 金伟锋

    2015-01-01

    Cellular automata (CA) are mathematical models with discrete time , space and states.Symbolic dynamics is a critical approach and technique for nonlinear dynamical analysis .This work conducts the literature review of investigations of symbolic dynamics of elementary cellular automata and their applications . Based on the extensive statistics properties and exhaustive simulations of elementary cellular automata (ECA), this paper proposes an effective method to unveil symbolic dynamics of Bernoulli-shift rules under the viewpoint of symbolic dynamics in the space of bi-infinite symbolic sequences .These results uncovers the chaotic and complex symbolic dynamics of simple ECA rules , enrich the symbolic dynamics of ECA , and promote the theory and technology of dynamical system , especially symbolic dynamics .%细胞自动机是一种时间、空间与状态都离散的数学模型。回顾了初等细胞自动机模型的应用及其符号动力学刻画的相关文献,在大量统计性质和计算机模拟基础上,着重分析具有鲁棒Bernoulli移位特征的细胞自动机规则的一些符号动力学性质,揭示了细胞自动机的简单规则中蕴含着复杂、混沌的非线性动力学特性。这些结果丰富了细胞自动机的理论基础,也将促进符号动力系统的理论和应用的研究。

  7. Metal Dependence of Signal Transmission through MolecularQuantum-Dot Cellular Automata (QCA: A Theoretical Studyon Fe, Ru, and Os Mixed-Valence Complexes

    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

  8. A cellular automata algorithm of finding critical path%求解关键路径的元胞自动机算法

    Institute of Scientific and Technical Information of China (English)

    钱鑫; 吴晓军; 张甜甜; 易宇

    2009-01-01

    A new algorithm is put forward according to the characteristics of parallel calculation and local space-time of cellular automata model. In the algorithm, the critical path will develop with the evolvement of cells by selecting cells and setting corresponding rules. The experimental results indicate that this algorithm can he used to solve the critical path searching problem in multi-source-point and multi-collecting-point AOE network, eliminate the linear procedure of traditional algorithm based on topological sort and reverse topological scan, and also unify the algorithms of shortest path searching and critical path searching problems.%利用元胞自动机的离散空间与并行计算特性,通过对元胞的抽象和局部规则的设计,借助于元胞状态的动态演化,解决了AOE网络(Activity on edge network)中多源点多汇点关键路径的求解,消除了基于拓扑排序和逆拓扑扫描的传统算法的线性化过程,并从算法上实现了AOE网最短路径与关键路径求解的统一.

  9. Cellular Automata for Spatiotemporal Pattern Formation from Reaction-Diffusion Partial Differential Equations

    Science.gov (United States)

    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.

  10. Quadra-Quantum Dots and Related Patterns of Quantum Dot Molecules: Basic Nanostructures for Quantum Dot Cellular Automata Application

    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.

  11. Modeling of metal foaming with lattice Boltzmann automata

    Energy Technology Data Exchange (ETDEWEB)

    Koerner, C.; Thies, M.; Singer, R.F. [WTM Institute, Department of Materials Science, University of Erlangen, Martensstrasse 5, D-91058 Erlangen (Germany)

    2002-10-01

    The formation and decay of foams produced by gas bubble expansion in a molten metal is numerically simulated with the Lattice Boltzmann Method (LBM) which belongs to the cellular automaton techniques. The present state of the two dimensional model allows the investigation of the foam evolution process comprising bubble expansion, bubble coalescence, drainage, and eventually foam collapse. Examples demonstrate the influence of the surface tension, viscosity and gravity on the foaming process and the resulting cell structure. In addition, the potential of the LBM to solve problems with complex boundary conditions is illustrated by means of a foam developing within the constraints of a mould as well as a foaming droplet exposed to gravity. (Abstract Copyright [2002], Wiley Periodicals, Inc.)

  12. Robots and lattice automata

    CERN Document Server

    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...

  13. A formal approach for change impact analysis of long term composed services using Probabilistic Cellular Automata

    Directory of Open Access Journals (Sweden)

    M. Thirumaran

    2016-04-01

    Full Text Available Incorporating changes into the logics of composed services dynamically and successfully is a challenge for sustaining a business’ image and profit in the society, especially when the change is expected to be made immediately at low cost. In this paper, we address this challenge by proposing a change impact analysis framework for long term composed services (LCS which: (i enables the business people to implement the changes by themselves through their analysts, (ii reduces cost and time by eliminating the dependence on IT developers once the application services are developed and delivered, (iii ensures effective incorporation of the changes made by using standard methodologies for evaluation – finite state automaton for verifying the runtime compatibilities and change evaluation and probabilistic cellular automaton for impact analysis and prediction. Through the evaluated probability measures and effective incident matching, the knowledge gained by the analyst over his service logics and the efficiency of incorporating changes are increased.

  14. Two-material optimization of plate armour for blast mitigation using hybrid cellular automata

    Science.gov (United States)

    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.

  15. The MIRELA framework: modeling and analyzing mixed reality applications using timed automata

    Directory of Open Access Journals (Sweden)

    Bachir Djafri

    2009-04-01

    Full Text Available Mixed Reality (MR aims to link virtual entities with the real world and has many applications such as military and medical ones. In many MR systems and more precisely in augmented scenes, one needs the application to render the virtual part accurately at the right time. To achieve this, such systems acquire data related to the real world from a set of sensors before rendering virtual entities. A suitable system architecture should minimize the delays to keep the overall system delay (also called end-to-end latency within the requirements for real-time performance. In this context, we propose a compositional modeling framework for MR software architectures in order to specify, simulate and validate formally the time constraints of such systems. Our approach is first based on a functional decomposition of such systems into generic components. The obtained elements as well as their typical interactions give rise to generic representations in terms of timed automata. A whole system is then obtained as a composition of such defined components.To write specifications, a textual language named MIRELA (MIxed REality LAnguage is proposed along with the corresponding compilation tools. The generated output contains timed automata in UPPAAL format for simulation and verification of time constraints. These automata may also be used to generate source code skeletons for an implementation on a MR platform.The approach is illustrated first on a small example. A realistic case study is also developed. It is modeled by several timed automata synchronizing through channels and including a large number of time constraints. Both systems have been simulated in UPPAAL and checked against the required behavioral properties.

  16. Traffic Flow by Cellular Automata: the Effect of Maximal Car Velocity

    CERN Document Server

    Makowiecki, D S; Makowiec, Danuta; Miklaszewski, Wieslaw

    2005-01-01

    Effects of large value assigned to the maximal car velocity on the fundamental diagrams in the Nagel-Schreckenberg model are studied by extended simulations. The function relating the flow in the congested traffic phase with the car density and deceleration probability is found numerically. Properties of the region of critical changes, so-called jamming transition parameters, are described in details. The basic model, modified by the assumption that for each car an individual velocity limit is assigned, is investigated in the aim to find the best supplementary rule allowing the jammed traffic to move with velocity larger than the slowest driving vehicle.

  17. Highly Parallel Computing Architectures by using Arrays of Quantum-dot Cellular Automata (QCA): Opportunities, Challenges, and Recent Results

    Science.gov (United States)

    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

  18. Self-organized criticality in solar flares: a cellular automata approach

    Directory of Open Access Journals (Sweden)

    L. F. Morales

    2010-07-01

    Full Text Available We give an overview of a novel lattice-based avalanche model that reproduces well a number of observed statistical properties of solar flares. The anisotropic lattice is defined as a network of vertically-connected nodes subjected to horizontal random displacements mimicking the kinks introduced by random motions of the photospheric footpoints of magnetic fieldlines forming a coronal loop. We focus here on asymmetrical driving displacements, which under our geometrical interpretation of the lattice correspond to a net direction of twist of the magnetic fieldlines about the loop axis. We show that a net vertical electrical current density does build up in our lattice, as one would expect from systematic twisting of a loop-like magnetic structure, and that the presence of this net current has a profound impact on avalanche dynamics. The presence of an additional energy reservoir tends to increase the mean energy released by avalanches, and yield a probability distribution of released energy in better agreement with observational inferences than in its absence. Symmetrical driving displacements are in better conceptual agreement with a random shuffling of photospheric footpoint, and yield a power-law distribution of energy release with exponent larger than 2, as required in Parker's nanoflare model of coronal heating. On the other hand, moderate asymmetrical driving generate energy distribution exponents that are similar to those obtained from SOHO EUV observations.

  19. A verification strategy for web services composition using enhanced stacked automata model.

    Science.gov (United States)

    Nagamouttou, Danapaquiame; Egambaram, Ilavarasan; Krishnan, Muthumanickam; Narasingam, Poonkuzhali

    2015-01-01

    Currently, Service-Oriented Architecture (SOA) is becoming the most popular software architecture of contemporary enterprise applications, and one crucial technique of its implementation is web services. Individual service offered by some service providers may symbolize limited business functionality; however, by composing individual services from different service providers, a composite service describing the intact business process of an enterprise can be made. Many new standards have been defined to decipher web service composition problem namely Business Process Execution Language (BPEL). BPEL provides an initial work for forming an Extended Markup Language (XML) specification language for defining and implementing business practice workflows for web services. The problems with most realistic approaches to service composition are the verification of composed web services. It has to depend on formal verification method to ensure the correctness of composed services. A few research works has been carried out in the literature survey for verification of web services for deterministic system. Moreover the existing models did not address the verification properties like dead transition, deadlock, reachability and safetyness. In this paper, a new model to verify the composed web services using Enhanced Stacked Automata Model (ESAM) has been proposed. The correctness properties of the non-deterministic system have been evaluated based on the properties like dead transition, deadlock, safetyness, liveness and reachability. Initially web services are composed using Business Process Execution Language for Web Service (BPEL4WS) and it is converted into ESAM (combination of Muller Automata (MA) and Push Down Automata (PDA)) and it is transformed into Promela language, an input language for Simple ProMeLa Interpreter (SPIN) tool. The model is verified using SPIN tool and the results revealed better recital in terms of finding dead transition and deadlock in contrast to the

  20. 基于元胞自动机的海上溢油扩散模拟%Simulation of marine oil spill diffusion based on cellular automata

    Institute of Scientific and Technical Information of China (English)

    2015-01-01

    利用逻辑回归算法和决策树C5.0算法分别获取溢油扩散的转换规则,并构建了基于逻辑回归的CA模型和决策树CA模型。这两个模型仅需要设置起始影像、影响因子和权重等少数的变量,便可以方便地模拟出溢油的动态变化情况。把逻辑回归CA模型和决策树CA模型应用到DeepSpill项目的海上溢油模拟实验,结果表明逻辑回归CA模型的模拟总精度达到96.4%,Kappa系数达0.893,而决策树CA模型的模拟结果更为理想,其精度和kappa系数分别提高了0.2%和0.006。利用元胞自动机能够很好地模拟并预测出海上溢油的动态变化,可以满足对溢油快速响应的要求。%Cellular automata (CA) is an effective tool for simulating geographical process. In this paper, logistic regression and decision tree algorithm (C5.0) are introduced to obtain transition rules, which are used to build logistic regression CA model and decision-tree CA model. These two models are very convenient because they only need a few variables, such as starting image, impact factors and weights. And the simulation results of oil spill can be obtained. The logistic regression CA model and decision-tree CA model are applied to simulate the movement of oil spill in Deep Spill projects. Experiment re-sults showed that the overall accuracy and Kappa coefficient of simulation results in logistic regression CA were 96.4%and 0.893.Better results could be obtained using decision-tree CA model. Its overall accuracy and kappa coefficients increased by 0.2%and 0.006. Our experiment results showed that the CA models could simulate the dynamic changes of the oil spill and meet the requirements for rapid response of governments.

  1. Quantum Finite Automata and Weighted Automata

    CERN Document Server

    Rao, M V P

    2007-01-01

    Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular interest is the 2-way model of Ambainis and Watrous that has both quantum and classical states (2QCFA) [A. Ambainis and J. Watrous, Two-way finite automata with quantum and classical state, Theoretical Computer Science, 287(1), pp. 299-311, 2002], since it combines the advantage of the power of interference in a constant-sized quantum system with a 2-way head. This paper is a step towards finding the least powerful model which is purely classical and can mimic the dynamics of quantum phase. We consider weighted automata with the Cortes-Mohri definition of language recognition [C. Cortes and M. Mohri, Context-Free Recognition with Weighted Automata, Grammars 3(2/3), pp. 133-150, 2000] as a candidate model for simulating 2QCFA. Given any 2QCFA that (i) uses the accept-reject-continue observable, (ii) recognizes a language with one-sided error and (iii) the entries of whose unitary mat...

  2. 初等元胞自动机生成的时间序列的复杂性分析%COMPLEXITY ANALYSIS OF TIME SERIES GENERATED BY ELEMENTARY CELLULAR AUTOMATA

    Institute of Scientific and Technical Information of China (English)

    秦大康; 谢惠民

    2005-01-01

    Using the tools of distinct excluded blocks,computational search and symbolic dynamics,the classification problem of all 256 elementary cellular automata is discussed from the point of view of time series generated by them,and examples in each class are provided to explain the methods used.

  3. Efficient Modelling, Generation and Analysis of Markov Automata

    NARCIS (Netherlands)

    Timmer, Mark; Iwama, K.

    2014-01-01

    Quantitative model checking is concerned with the verification of both quantitative and qualitative properties over models incorporating quantitative information. Increases in expressivity of the models involved allow more types of systems to be analysed, but also raise the difficulty of their effic

  4. Efficient modelling, generation and analysis of Markov automata

    NARCIS (Netherlands)

    Timmer, Mark

    2013-01-01

    Quantitative model checking is concerned with the verification of both quantitative and qualitative properties over models incorporating quantitative information. Increases in expressivity of these models allow more types of systems to be analysed, but also raise the difficulty of their efficient an

  5. Effect of Carbon Distribution During the Microstructure Evolution of Dual-Phase Steels Studied Using Cellular Automata, Genetic Algorithms, and Experimental Strategies

    Science.gov (United States)

    Halder, Chandan; Karmakar, Anish; Hasan, Sk. Md.; Chakrabarti, Debalay; Pietrzyk, Maciej; Chakraborti, Nirupam

    2016-12-01

    The development of ferrite-martensite dual-phase microstructures by cold-rolling and intercritical annealing of 0.06 wt pct carbon steel was systematically studied using a dilatometer for two different heating rates (1 and 10 K/s). A step quenching treatment has been designed to develop dual-phase structures having a similar martensite fraction for two different heating rates. An increase in heating rate seemed to refine the ferrite grain size, but it increased the size and spacing of the martensitic regions. As a result, the strength of the steel increased with heating rate; however, the formability was affected. It has been concluded that the distribution of C during the annealing treatment of cold-rolled steel determines the size, distribution, and morphology of martensite, which ultimately influences the mechanical properties. Experimental detection of carbon distribution in austenite is difficult during annealing of the cold-rolled steel as the phase transformation occurs at a high temperature and C is an interstitial solute, which diffuses fast at that temperature. Therefore, a cellular automata (CA)-based phase transformation model is proposed in the present study for the prediction of C distribution in austenite during annealing of steel as the function of C content and heating rate. The CA model predicts that the carbon distribution in austenite becomes more inhomogeneous when the heating rate increases. In the CA model, the extent of carbon inhomogeneity is measured using a kernel averaging method for different orders of neighbors, which accounts for the different physical space during calculation. The obtained results reveal that the 10th order (covering 10- µm physical spaces around the cell of interest) is showing the maximum inhomogeneity of carbon and the same effect has been investigated and confirmed using auger electron spectroscopy (AES) for 0.06 wt pct carbon steel. Furthermore, the optimization of carbon homogeneity with respect to heating

  6. Simulating of evolution for the aviation service innovation competition with cellular automata%航空服务创新的元胞自动机竞争演化模拟

    Institute of Scientific and Technical Information of China (English)

    寇勇刚; 吴桐水; 朱金福

    2011-01-01

    In order to research the role of airlines service innovation in the competition of the aviation market, the competition model of aviation service innovation is built up with cellular automata. Taken one of Shenzhen Airlinees' Shenzhen to Beijing flight in 2008 as an example, satisfied result have acquired by repeated experiments of simulation to the innovational cabin service evolution during the competition. The research conclusion shows that there are three factors which include the initial data of cellular automata,the service fitness and the sales promotion,all of the three effect the evolutional mutation period and make it into positive trend. Meanwhile, the role of the three factors become decreasing while the parameter of them gradually increasing.%为研究航空公司服务创新在市场竞争中的作用,基于元胞自动机设计了航空服务创新竞争模型.以深航2008年在深圳-北京航线上推出服务创新为例,经过重复试验较好地模拟了在该航线上进行服务创新取得成功的竞争演化过程.研究结果表明:初始接受服务创新的元胞数量、服务匹配度和品牌宣传效应度三个影响因素都对演化的突变周期起正向影响作用,且三个因素对突变周期的正向作用随着取值的增大而逐渐减弱.

  7. Research of the Production Process of a Company Based on Cellular Automata%基于元胞自动机的企业生产过程的研究

    Institute of Scientific and Technical Information of China (English)

    罗丽珍; 吴瑞明

    2012-01-01

    To reduce and prevent the accidents in the production process of a company, the theory of cellular automata is applied to the research of this, a cellular automata model for the executing system of the workers in the processing plant is formulated. Through the simulation in different states of personal factors and environmental factors , the analysis shows that the extend that the works comply with the regulations is one of the key factors that affect the degree of safety in the production process. The advices are helpful that the company must pay more attention to how the regulations can be executed carefully to reduce the gaps between actual behaviors and standard behaviors according to the regulations. This is meaningful for the research of safe production of a company.%为减少和预防企业生产中意外事故的发生,将元胞自动机理论应用于企业生产过程的研究,建立了某企业生产中基层-员工执行系统的元胞自动机模型.通过对安全生产的个人因素和环境因素在不同状态下的模拟和分析,认为员工遵守规章规程的程度是影响企业安全生产的关键因素之一;并在此基础上,建议企业多关注于如何保证政策法规被规范执行,以缩小实际操作与规则规程之间的差距.这为企业安全生产的研究提供了一种新的思路.

  8. Automata networks model for alignment and least effort on vocabulary formation

    CERN Document Server

    Vera, Javier; Goles, Eric

    2015-01-01

    Can artificial communities of agents develop language with scaling relations close to the Zipf law? As a preliminary answer to this question, we propose an Automata Networks model of the formation of a vocabulary on a population of individuals, under two in principle opposite strategies: the alignment and the least effort principle. Within the previous account to the emergence of linguistic conventions (specially, the Naming Game), we focus on modeling speaker and hearer efforts as actions over their vocabularies and we study the impact of these actions on the formation of a shared language. The numerical simulations are essentially based on an energy function, that measures the amount of local agreement between the vocabularies. The results suggests that on one dimensional lattices the best strategy to the formation of shared languages is the one that minimizes the efforts of speakers on communicative tasks.

  9. Simulation of Stock Market Influenced by Securities and Margin Financing Based on Cellular Automata%融资融券影响的元胞自动机股票市场模拟研究

    Institute of Scientific and Technical Information of China (English)

    覃松; 邓敏艺; 孔令江

    2011-01-01

    In order to study the influences of margin financing, as well as how to relieve the impact of short selling system,modeling theory and method using cellular automata are applied to establish a single stock automata model. In this paper,simulations of trading volume and price fluctuation before and after the introduction of margin financing business are carried out. Simulation results show that the release of new margin financing can increase trading volume and stabalize trading price more easily,and it may help to increase the fluctuation of the trading price. The advices about relieving the impact of short selling system are helpful to financial supervision departments in maintaining market stability.%为研究融资融券推出对股票市场带来的影响以及如何减少融券卖空对市场的冲击,建立基于元胞自动机的股票市场模型,对融资融券推出前后的股票交易量和价格波动进行计算机仿真.仿真结果表明,融资融券的推出既可能增加股票市场的交易量,有利于市场内在价格稳定机制形成,也可能对价格助涨助跌,增大市场的波动.本文还针对融券卖空的潜在风险提出规避建议,这对相关金融部门保障市场稳定运行具有一定借鉴意义.

  10. 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.

  11. Weighted Watson-Crick automata

    Science.gov (United States)

    Tamrin, Mohd Izzuddin Mohd; Turaev, Sherzod; Sembok, Tengku Mohd Tengku

    2014-07-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.

  12. Automata, universality, computation tribute to Maurice Margenstern

    CERN Document Server

    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.

  13. Behavioral Modeling Based on Probabilistic Finite Automata: An Empirical Study †

    Science.gov (United States)

    Tîrnăucă, Cristina; Montaña, José L.; Ontañón, Santiago; González, Avelino J.; Pardo, Luis M.

    2016-01-01

    Imagine an agent that performs tasks according to different strategies. The goal of Behavioral Recognition (BR) is to identify which of the available strategies is the one being used by the agent, by simply observing the agent’s actions and the environmental conditions during a certain period of time. The goal of Behavioral Cloning (BC) is more ambitious. In this last case, the learner must be able to build a model of the behavior of the agent. In both settings, the only assumption is that the learner has access to a training set that contains instances of observed behavioral traces for each available strategy. This paper studies a machine learning approach based on Probabilistic Finite Automata (PFAs), capable of achieving both the recognition and cloning tasks. We evaluate the performance of PFAs in the context of a simulated learning environment (in this case, a virtual Roomba vacuum cleaner robot), and compare it with a collection of other machine learning approaches. PMID:27347956

  14. Cellular automaton for realistic modelling of landslides

    CERN Document Server

    Segrè, E; Enrico Segre; Chiara Deangeli

    1994-01-01

    We develop a numerical model for the simulation of debris flow in landslides over a complex three dimensional topography. The model is based on a lattice, in which debris can be transferred among nearest neighbours according to established empirical relationships for granular flows. The model is validated comparing its results with reported field data. Our model is in fact a realistic elaboration of simpler ``sandpile automata'', which have in recent years been studied as supposedly paradigmatic of ``self organized criticality''. Statistics and scaling properties of the simulation are examined, showing that the model has an intermittent behaviour.

  15. Cellular models for Parkinson's disease.

    Science.gov (United States)

    Falkenburger, Björn H; Saridaki, Theodora; Dinter, Elisabeth

    2016-10-01

    Developing new therapeutic strategies for Parkinson's disease requires cellular models. Current models reproduce the two most salient changes found in the brains of patients with Parkinson's disease: The degeneration of dopaminergic neurons and the existence of protein aggregates consisting mainly of α-synuclein. Cultured cells offer many advantages over studying Parkinson's disease directly in patients or in animal models. At the same time, the choice of a specific cellular model entails the requirement to focus on one aspect of the disease while ignoring others. This article is intended for researchers planning to use cellular models for their studies. It describes for commonly used cell types the aspects of Parkinson's disease they model along with technical advantages and disadvantages. It might also be helpful for researchers from other fields consulting literature on cellular models of Parkinson's disease. Important models for the study of dopaminergic neuron degeneration include Lund human mesencephalic cells and primary neurons, and a case is made for the use of non-dopaminergic cells to model pathogenesis of non-motor symptoms of Parkinson's disease. With regard to α-synuclein aggregates, this article describes strategies to induce and measure aggregates with a focus on fluorescent techniques. Cellular models reproduce the two most salient changes of Parkinson's disease, the degeneration of dopaminergic neurons and the existence of α-synuclein aggregates. This article is intended for researchers planning to use cellular models for their studies. It describes for commonly used cell types and treatments the aspects of Parkinson's disease they model along with technical advantages and disadvantages. Furthermore, this article describes strategies to induce and measure aggregates with a focus on fluorescent techniques. This article is part of a special issue on Parkinson disease.

  16. Performance Evaluation of Road Traffic Control Using a Fuzzy Cellular Model

    CERN Document Server

    Płaczek, Bartłomiej

    2011-01-01

    In this paper a method is proposed for performance evaluation of road traffic control systems. The method is designed to be implemented in an on-line simulation environment, which enables optimisation of adaptive traffic control strategies. Performance measures are computed using a fuzzy cellular traffic model, formulated as a hybrid system combining cellular automata and fuzzy calculus. Experimental results show that the introduced method allows the performance to be evaluated using imprecise traffic measurements. Moreover, the fuzzy definitions of performance measures are convenient for uncertainty determination in traffic control decisions.

  17. Simple Urban Simulation Atop Complicated Models: Multi-Scale Equation-Free Computing of Sprawl Using Geographic Automata

    Directory of Open Access Journals (Sweden)

    Yu Zou

    2013-07-01

    Full Text Available Reconciling competing desires to build urban models that can be simple and complicated is something of a grand challenge for urban simulation. It also prompts difficulties in many urban policy situations, such as urban sprawl, where simple, actionable ideas may need to be considered in the context of the messily complex and complicated urban processes and phenomena that work within cities. In this paper, we present a novel architecture for achieving both simple and complicated realizations of urban sprawl in simulation. Fine-scale simulations of sprawl geography are run using geographic automata to represent the geographical drivers of sprawl in intricate detail and over fine resolutions of space and time. We use Equation-Free computing to deploy population as a coarse observable of sprawl, which can be leveraged to run automata-based models as short-burst experiments within a meta-simulation framework.

  18. Enabling model checking for collaborative process analysis: from BPMN to `Network of Timed Automata'

    Science.gov (United States)

    Mallek, Sihem; Daclin, Nicolas; Chapurlat, Vincent; Vallespir, Bruno

    2015-04-01

    Interoperability is a prerequisite for partners involved in performing collaboration. As a consequence, the lack of interoperability is now considered a major obstacle. The research work presented in this paper aims to develop an approach that allows specifying and verifying a set of interoperability requirements to be satisfied by each partner in the collaborative process prior to process implementation. To enable the verification of these interoperability requirements, it is necessary first and foremost to generate a model of the targeted collaborative process; for this research effort, the standardised language BPMN 2.0 is used. Afterwards, a verification technique must be introduced, and model checking is the preferred option herein. This paper focuses on application of the model checker UPPAAL in order to verify interoperability requirements for the given collaborative process model. At first, this step entails translating the collaborative process model from BPMN into a UPPAAL modelling language called 'Network of Timed Automata'. Second, it becomes necessary to formalise interoperability requirements into properties with the dedicated UPPAAL language, i.e. the temporal logic TCTL.

  19. Mathematical Modeling of Cellular Metabolism.

    Science.gov (United States)

    Berndt, Nikolaus; Holzhütter, Hermann-Georg

    2016-01-01

    Cellular metabolism basically consists of the conversion of chemical compounds taken up from the extracellular environment into energy (conserved in energy-rich bonds of organic phosphates) and a wide array of organic molecules serving as catalysts (enzymes), information carriers (nucleic acids), and building blocks for cellular structures such as membranes or ribosomes. Metabolic modeling aims at the construction of mathematical representations of the cellular metabolism that can be used to calculate the concentration of cellular molecules and the rates of their mutual chemical interconversion in response to varying external conditions as, for example, hormonal stimuli or supply of essential nutrients. Based on such calculations, it is possible to quantify complex cellular functions as cellular growth, detoxification of drugs and xenobiotic compounds or synthesis of exported molecules. Depending on the specific questions to metabolism addressed, the methodological expertise of the researcher, and available experimental information, different conceptual frameworks have been established, allowing the usage of computational methods to condense experimental information from various layers of organization into (self-) consistent models. Here, we briefly outline the main conceptual frameworks that are currently exploited in metabolism research.

  20. Correlating Formal Semantic Models of Reo Connectors: Connector Coloring and Constraint Automata

    Directory of Open Access Journals (Sweden)

    Sung-Shik T.Q. Jongmans

    2011-07-01

    Full Text Available Over the past decades, coordination languages have emerged for the specification and implementation of interaction protocols for communicating software components. This class of languages includes Reo, a platform for compositional construction of connectors. In recent years, various formalisms for describing the behavior of Reo connectors have come to existence, each of them serving its own purpose. Naturally, questions about how these models relate to each other arise. From a theoretical point of view, answers to these questions provide us with better insight into the fundamentals of Reo, while from a more practical perspective, these answers broaden the applicability of Reo's development tools. In this paper, we address one of these questions: we investigate the equivalence between coloring models and constraint automata, the two most dominant and practically relevant semantic models of Reo. More specifically, we define operators that transform one model to the other (and vice versa, prove their correctness, and show that they distribute over composition. To ensure that the transformation operators map one-to-one (instead of many-to-one, we extend coloring models with data constraints. Though primarily a theoretical contribution, we sketch some potential applications of our results: the broadening of the applicability of existing tools for connector verification and animation.

  1. A Proliferation of Air Pollution Simulation System base on Cellular Automata%基于元胞自动机的污染气体扩散模拟系统

    Institute of Scientific and Technical Information of China (English)

    秦弋丰; 杨雨诚; 谢育武; 李俚; 吴皆强

    2015-01-01

    元胞自动机模型( Cellular Automation Model, CA模型)是一种用于模拟离散动力系统内部的各独立单元间因为强烈非线性作用而引发的系统自组织演化过程的建模方式,规则的局部性和时空离散化是CA模型的主要特征.本系统基于当今城市最为严重的空气污染问题展开研究,主要通过在地图上确定污染源位置,并录入污染源数据,通过元胞自动机原理,模拟在有风和无风状态下污染气体元胞的运动状况,从微观到宏观,系统地描述污染气体的运动状况.%Cellular Automation Model(CA) is a modeling method used to simulate the internal unit between discrete dynamic system that caused the evolution of a self-organization in system because of nonlinear function. Temporal discretization and local rule is it main feature. We developed this system according to the one of the most serious problems of our city in these days which is air pollution. By pain point the source of pollution on the map and input the pollution data, through the principle of the Cellular automata, stimulated the movement of pollution gas cell under condition of both windy calm. Describe the motion of the pollution gas from micro to macro.

  2. 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....

  3. Design of cryptographically secure AES like S-Box using second-order reversible cellular automata for wireless body area network applications.

    Science.gov (United States)

    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.

  4. World Automata: a compositional approach to model implicit communication in hierarchical Hybrid Systems

    Directory of Open Access Journals (Sweden)

    Marta Capiluppi

    2013-08-01

    Full Text Available We propose an extension of Hybrid I/O Automata (HIOAs to model agent systems and their implicit communication through perturbation of the environment, like localization of objects or radio signals diffusion and detection. The new object, called World Automaton (WA, is built in such a way to preserve as much as possible of the compositional properties of HIOAs and its underlying theory. From the formal point of view we enrich classical HIOAs with a set of world variables whose values are functions both of time and space. World variables are treated similarly to local variables of HIOAs, except in parallel composition, where the perturbations produced by world variables are summed. In such way, we obtain a structure able to model both agents and environments, thus inducing a hierarchy in the model and leading to the introduction of a new operator. Indeed this operator, called inplacement, is needed to represent the possibility of an object (WA of living inside another object/environment (WA.

  5. Modelling Implicit Communication in Multi-Agent Systems with Hybrid Input/Output Automata

    Directory of Open Access Journals (Sweden)

    Marta Capiluppi

    2012-10-01

    Full Text Available We propose an extension of Hybrid I/O Automata (HIOAs to model agent systems and their implicit communication through perturbation of the environment, like localization of objects or radio signals diffusion and detection. To this end we decided to specialize some variables of the HIOAs whose values are functions both of time and space. We call them world variables. Basically they are treated similarly to the other variables of HIOAs, but they have the function of representing the interaction of each automaton with the surrounding environment, hence they can be output, input or internal variables. Since these special variables have the role of simulating implicit communication, their dynamics are specified both in time and space, because they model the perturbations induced by the agent to the environment, and the perturbations of the environment as perceived by the agent. Parallel composition of world variables is slightly different from parallel composition of the other variables, since their signals are summed. The theory is illustrated through a simple example of agents systems.

  6. Algorithm of the shipyard ship shifting based on cellular automata theory%基于元胞理论的船厂码头移泊作业问题算法

    Institute of Scientific and Technical Information of China (English)

    陈建平; 徐洁

    2014-01-01

    为了解决大规模船厂的码头移泊作业问题,基于船舶移动路径具有过程演进的特性,建立了码头移泊作业问题的元胞数学模型。按照问题元胞模型的演进特性和演变规则,采用蚁群智能算法来对模型进行求解,并论证了该算法的收敛性。通过实例计算,其结果与船厂实际操作安排进行比较和分析,验证了该算法的有效性和优越性。%In the condition of issues on a large scale,an intelligent solution method of sol-ving the problem of shipyard ship shifting is presented.Based on the characteristics of ship shifting,evolutionary of ship location and Markov of directed network,ship cellular automata model of the problem is established.The ant colony algorithm of the model is studied.It is proved by practical application that the presented method is highly consist-ent with consistent convergence.The intelligent solution method has provided a fast and effective way for issues on a large scale.

  7. A cellular automaton model for ship traffic flow in waterways

    Science.gov (United States)

    Qi, Le; Zheng, Zhongyi; Gang, Longhui

    2017-04-01

    With the development of marine traffic, waterways become congested and more complicated traffic phenomena in ship traffic flow are observed. It is important and necessary to build a ship traffic flow model based on cellular automata (CAs) to study the phenomena and improve marine transportation efficiency and safety. Spatial discretization rules for waterways and update rules for ship movement are two important issues that are very different from vehicle traffic. To solve these issues, a CA model for ship traffic flow, called a spatial-logical mapping (SLM) model, is presented. In this model, the spatial discretization rules are improved by adding a mapping rule. And the dynamic ship domain model is considered in the update rules to describe ships' interaction more exactly. Take the ship traffic flow in the Singapore Strait for example, some simulations were carried out and compared. The simulations show that the SLM model could avoid ship pseudo lane-change efficiently, which is caused by traditional spatial discretization rules. The ship velocity change in the SLM model is consistent with the measured data. At finally, from the fundamental diagram, the relationship between traffic ability and the lengths of ships is explored. The number of ships in the waterway declines when the proportion of large ships increases.

  8. 基于元胞自动机的城市道路偶发性拥堵交通行为模拟%A simulation of the traffic behavior of the propagation of urban coincidental traffic j ams based on the cellular automata model

    Institute of Scientific and Technical Information of China (English)

    吴义虎; 李意芬; 喻伟; 喻丹

    2014-01-01

    The behavior of the driver was considered as the rule of the driver change of lanes,and the new rule of the changes of lanes with the combination between the driver behavior and the coincidental traffic was put forward,then a improved cellular automa-ton model was put forward,the model was proposed to describe the characteristics of co-incidental traffic j ams.By the proposed model,the velocity of traffic flow and the length of vehicle lines by coincidental traffic j ams was simulated,and the results of the simula-tion was proposed.%以元胞自动机模型为基础,在传统的车辆换道规则上,引入驾驶人行为因素,根据不同区域交通流特点和驾驶行为特点,给出了不同的车辆换道规则,建立了一种适用于城市道路偶发性拥堵交通流行为分析的元胞自动机改进模型。并利用该模型,模拟分析了偶发性拥堵发生时不同车流密度的车辆排队和平均车速情况。

  9. Multiple Attractor Cellular Automata Classification Method and Over-Fitting Problem with CART%分类回归树多吸引子细胞自动机分类方法及过拟合研究

    Institute of Scientific and Technical Information of China (English)

    方敏; 牛文科; 张晓松

    2012-01-01

    基于多吸引子细胞自动机的分类方法多是二分类算法,难以克服过度拟合问题,在生成多吸引子细胞自动机时如何有效地处理多分类及过度拟合问题还缺乏可行的方法.从细胞空间角度对模式空间进行分割是一种均匀分割,难以适应空间非均匀分割的需要.将CART算法同多吸引子细胞自动机相结合构造树型结构的分类器,以解决空间的非均匀分割及过度拟合问题,并基于粒子群优化方法提出树节点的最优多吸引子细胞自动机特征矩阵的构造方法.基于该方法构造的多吸引子细胞自动机分类器能够以较少的伪穷举域比特数获得好的分类性能,减少了分类器中的空盆数量,在保证分类正确率的同时改善了过拟合问题,缩短了分类时间.实验分析证明了所提出方法的可行性和有效性.%The classification methods based on multiple attractor cellular automata can process the classification of two classes, and they are difficult to overcome overfitting problem. There are not yet effective methods for constructing a multiple attractor cellular automata which can process multi-classification and overfitting problem. The pattern space partition in the view of cell space is a kind of uniform partition which is difficult to adapt to the needs of spatial non-uniform partition. By combining the CART algorithm with the multiple attractor cellular automata, a kind of classifier with tree structure is constructed to solve the non-uniform partition problem and overfitting problem. The multiple attractor cellular automata characteristic matrix is defined, and the learning method of classifiers as a node in a tree is studied based on particle swarm optimization algorithm. The multiple attractor cellular automata classifiers built on this approach are able to obtain good classification performance by using less number of bits of pseudo-exhaustive field. The classifier with tree frame of multiple

  10. Continuity Controlled Hybrid Automata

    OpenAIRE

    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 hybrid automata as timed transition systems. We also relate the synchronized product operator on hybrid automata to the parallel composition operator of the process algebra. It turns out that the f...

  11. Modeling dynamics of HIV infected cells using stochastic cellular automaton

    Science.gov (United States)

    Precharattana, Monamorn; Triampo, Wannapong

    2014-08-01

    Ever since HIV was first diagnosed in human, a great number of scientific works have been undertaken to explore the biological mechanisms involved in the infection and progression of the disease. Several cellular automata (CA) models have been introduced to gain insights into the dynamics of the disease progression but none of them has taken into account effects of certain immune cells such as the dendritic cells (DCs) and the CD8+ T lymphocytes (CD8+ T cells). In this work, we present a CA model, which incorporates effects of the HIV specific immune response focusing on the cell-mediated immunities, and investigate the interaction between the host immune response and the HIV infected cells in the lymph nodes. The aim of our work is to propose a model more realistic than the one in Precharattana et al. (2010) [10], by incorporating roles of the DCs, the CD4+ T cells, and the CD8+ T cells into the model so that it would reproduce the HIV infection dynamics during the primary phase of HIV infection.

  12. Modular tree automata

    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...

  13. Stream Automata Are Coalgebras

    NARCIS (Netherlands)

    Ciancia, V.; Venema, Y.

    2012-01-01

    Stream automata (also called ω-automata) and ω-regular languages are of paramount importance in Computer Science and Logic. A coalgebraic treatment of these structures has not been given yet. We study a simple two-sorted setting where deterministic Muller automata can be cast as coalgebras, so that

  14. Modular Tree Automata

    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 r...

  15. Cellular systems biology profiling applied to cellular models of disease.

    Science.gov (United States)

    Giuliano, Kenneth A; Premkumar, Daniel R; Strock, Christopher J; Johnston, Patricia; Taylor, Lansing

    2009-11-01

    Building cellular models of disease based on the approach of Cellular Systems Biology (CSB) has the potential to improve the process of creating drugs as part of the continuum from early drug discovery through drug development and clinical trials and diagnostics. This paper focuses on the application of CSB to early drug discovery. We discuss the integration of protein-protein interaction biosensors with other multiplexed, functional biomarkers as an example in using CSB to optimize the identification of quality lead series compounds.

  16. COMPLEXITY OF ANALYSIS & VERIFICATION PROBLEMS FOR COMMUNICATING AUTOMATA & DISCRETE DYNAMICAL SYSTEMS

    Energy Technology Data Exchange (ETDEWEB)

    H. B. HUNT; D. J. ROSENKRANTS; ET AL

    2001-03-01

    We identify several simple but powerful concepts, techniques, and results; and we use them to characterize the complexities of a number of basic problems II, that arise in the analysis and verification of the following models M of communicating automata and discrete dynamical systems: systems of communicating automata including both finite and infinite cellular automata, transition systems, discrete dynamical systems, and succinctly-specified finite automata. These concepts, techniques, and results are centered on the following: (i) reductions Of STATE-REACHABILITY problems, especially for very simple systems of communicating copies of a single simple finite automaton, (ii) reductions of generalized CNF satisfiability problems [Sc78], especially to very simple communicating systems of copies of a few basic acyclic finite sequential machines, and (iii) reductions of the EMPTINESS and EMPTINESS-OF-INTERSECTION problems, for several kinds of regular set descriptors. For systems of communicating automata and transition systems, the problems studied include: all equivalence relations and simulation preorders in the Linear-time/Branching-time hierarchies of equivalence relations and simulation preorders of [vG90, vG93], both without and with the hiding abstraction. For discrete dynamical systems, the problems studied include the INITIAL and BOUNDARY VALUE PROBLEMS (denoted IVPs and BVPS, respectively), for nonlinear difference equations over many different algebraic structures, e.g. all unitary rings, all finite unitary semirings, and all lattices. For succinctly-specified finite automata, the problems studied also include the several problems studied in [AY98], e.g. the EMPTINESS, EMPTINESS-OF-INTERSECTION, EQUIVALENCE and CONTAINMENT problems. The concepts, techniques, and results presented unify and significantly extend many of the known results in the literature, e.g. [Wo86, Gu89, BPT91, GM92, Ra92, HT94, SH+96, AY98, AKY99, RH93, SM73, Hu73, HRS76, HR78], for

  17. Complexity of analysis and verification problems for communicating automata and discrete dynamical systems.

    Energy Technology Data Exchange (ETDEWEB)

    Hunt, H. B. (Harry B.); Rosenkrantz, D. J. (Daniel J.); Barrett, C. L. (Christopher L.); Marathe, M. V. (Madhav V.); Ravi, S. S. (Sekharipuram S.)

    2001-01-01

    We identify several simple but powerful concepts, techniques, and results; and we use them to characterize the complexities of a number of basic problems II, that arise in the analysis and verification of the following models M of communicating automata and discrete dynamical systems: systems of communicating automata including both finite and infinite cellular automata, transition systems, discrete dynamical systems, and succinctly-specified finite automata. These concepts, techniques, and results are centered on the following: (1) reductions Of STATE-REACHABILITY problems, especially for very simple systems of communicating copies of a single simple finite automaton, (2) reductions of generalized CNF satisfiability problems [Sc78], especially to very simple communicating systems of copies of a few basic acyclic finite sequential machines, and (3) reductions of the EMPTINESS and EMPTINESS-OF-INTERSECTION problems, for several kinds of regular set descriptors. For systems of communicating automata and transition systems, the problems studied include: all equivalence relations and simulation preorders in the Linear-time/Branching-time hierarchies of equivalence relations and simulation preorders of [vG90, vG93], both without and with the hiding abstraction. For discrete dynamical systems, the problems studied include the INITIAL and BOUNDARY VALUE PROBLEMS (denoted IVPs and BVPs, respectively), for nonlinear difference equations over many different algebraic structures, e.g. all unitary rings, all finite unitary semirings, and all lattices. For succinctly specified finite automata, the problems studied also include the several problems studied in [AY98], e.g. the EMPTINESS, EMPTINESS-OF-INTERSECTION, EQUIVALENCE and CONTAINMENT problems. The concepts, techniques, and results presented unify and significantly extend many of the known results in the literature, e.g. [Wo86, Gu89, BPT91, GM92, Ra92, HT94, SH+96, AY98, AKY99, RH93, SM73, Hu73, HRS76, HR78], for

  18. Model Skinner Operant Conditioning automata i bionički naučeno upravljanje robota

    OpenAIRE

    Cai, Jianxian; Hong, Li; Cheng, Lina; Yu, Ruihong

    2016-01-01

    Fuzzy Skinner Operant Conditioning Automaton (FSOCA) sastavljen je na temelju Operant Conditioning mehanizma primjenom teorije neizrazitih skupova. Osnovno obilježje automata FSOCA je sljedeće: neizraziti rezultati stanja pomoću Gausove funkcije koriste se kao skupovi neizrazitog stanja; neizrazita pravila preslikavanja (fuzzy mapping rules) kod fuzzy-conditioning-operacije zamjenjuju stohastičke "conditioning-operant" skupove preslikavanja. Stoga se automat FSOCA može koristiti za opisivanje...

  19. Cellular Automata Simulation of Buying Behaviour during Corporation Crisis Formation%企业危机形成中的消费行为的元胞自动机模拟

    Institute of Scientific and Technical Information of China (English)

    刘天卓; 孙伟然; 杨靖

    2011-01-01

    在企业所面临的不同类型的危机中,产品质量危机所占的比重最大。本文从群体行为的角度研究企业产品质量危机的形成机理,利用元胞自动机的定性模拟理论和方法,建立消费者对产品的购买行为的演化模型,通过基于不同的从众系数和演化规则的演化,揭示群体从众行为与企业危机公关与企业产品质量危机的形成之间的关系,并在此基础上提出了基于消费者信任修复理论的管理思路,对现代企业的危机管理有一定的借鉴与指导意义。%In modem society, exigencies happen frequently, and if not handled properly in the incident, the influence that does not digest and relieve the crisis will result in formation. In the different types of crisis the corporation faced, the most proportion is product quality crisis. We research the formation mechanism of enterprise manufacture crisis from the point of group behaviour, utilize the theory and method of qualitative simulation of cellular automata, build the buying behaviour evolution model of customers, by the evolution based different conformity ratio and evolution rule, reveal the relationship between the group behaviour and business crisis public relation and enterprise production crisis, and based on that we propose management thread based on the consumer confidence restore model, which can guide the crisis management for companies.

  20. Mixed-Valence Molecular Unit for Quantum Cellular Automata: Beyond the Born-Oppenheimer Paradigm through the Symmetry-Assisted Vibronic Approach.

    Science.gov (United States)

    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

  1. 量子元胞自动机器件和电路的研究进展%Research Progress of Quantum Dot Cellular Automata Devices and Circuits

    Institute of Scientific and Technical Information of China (English)

    杨晓阔; 蔡理; 李政操; 陈祥叶

    2011-01-01

    Quantum dot cellular automata (QCA) is a novel nanotechnology, the information of QCA is calculated and transferred not by the voltage or current, but by the field interaction. The computation principles, basic logic gates and clockings of two kinds of QCA (EQCA and MQCA) devices are introduced firstly. It shows that different wire structures comprised of QCA cells could realize planar crossover and transmit signals in a single layer independently. Furthermore, the experiment methods and materials to fabricate QCA devices and function arrays or circuits are summarized, and the conclusion is obtained that the development of MQCA and molecular EQCA devices would bring QCA up to the actual application level gradually. The research progresses and existent issues of QCA devices and circuits (particularly memory cell architecture) are discussed in detail. The open projects and directions in theory and application research of QCA are presented.%量子元胞自动机(QCA)是一种新颖的纳米技术,该技术不再通过电流或电压而是基于场相互作用进行信息的计算和传递.首先,综述了两种量子元胞自动机(EQCA和MQCA)器件的计算原理、基本逻辑门和时钟.指出了QCA元胞构成的不同线结构可在相同层交叉传递信号而不受影响.然后,进一步总结了制备QCA器件和功能阵列或电路的实验方法和材料,得出MQCA器件和分子EQCA器件的发展将使该器件逐步达到实际应用水平的结论.详细讨论了目前QCA器件和电路(尤其是存储单元结构)研究取得的重要进展以及面临的问题.提出了QCA器件未来理论和应用研究中的开放课题和方向.

  2. Confluence reduction for Markov automata

    NARCIS (Netherlands)

    Timmer, Mark; Pol, van de Jaco; Stoelinga, Mariëlle

    2013-01-01

    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 gener

  3. Simulation of Quantum Cellular Automatas Based on Quantum Genetic Algorithm%基于量子遗传算法的量子细胞自动机仿真方法

    Institute of Scientific and Technical Information of China (English)

    赵晓辉; 蔡理; 张鹏

    2011-01-01

    利用遗传算法对基于半经典模型的量子细胞自动机进行仿真时,通常会遇到多个极值,容易陷入局部最优.为将量子遗传算法用于量子细胞自动机仿真,对量子遗传算法进行改进,将二进制量子位改为多进制量子位,重新设计了量子旋转门的调整策略,并给出了具体实现步骤.通过对测试函数寻优和量子细胞自动机电路的仿真,结果表明,改进后的量子遗传算法平均误差低,不易陷入局部极值,收敛速度较快,适用于量子细胞自动机仿真.%Using genetic algorithm (GA), there are usually many extremes in the simulation of quantum cellular automatas (QCA) based on the semi-classical model and therefore it is apt to falling into local optimization. An improved quantum genetic algorithm (QGA) to displace original binary quantum bits with multistate quantum bits was proposed to use in the QCA simulation. The adjustment strategy of the quantum revolving gate was redesigned and the concrete steps to apply the improved method into the QCA simulation were also given. Through the test function optimization and QCA circuit simulation, the results show that the improved quantum genetic algorithm has many advantages, including a lower average error and a faster convergence speed, and is easy to get out local extremum. Thus the improved algorithm with more excellent performances is very suitable for the QCA simulation.

  4. Application of stochastic automata networks for creation of continuous time Markov chain models of voltage gating of gap junction channels.

    Science.gov (United States)

    Snipas, Mindaugas; Pranevicius, Henrikas; Pranevicius, Mindaugas; Pranevicius, Osvaldas; Paulauskas, Nerijus; Bukauskas, Feliksas F

    2015-01-01

    The primary goal of this work was to study advantages of numerical methods used for the creation of continuous time Markov chain models (CTMC) of voltage gating of gap junction (GJ) channels composed of connexin protein. This task was accomplished by describing gating of GJs using the formalism of the stochastic automata networks (SANs), which allowed for very efficient building and storing of infinitesimal generator of the CTMC that allowed to produce matrices of the models containing a distinct block structure. All of that allowed us to develop efficient numerical methods for a steady-state solution of CTMC models. This allowed us to accelerate CPU time, which is necessary to solve CTMC models, ~20 times.

  5. Application of Stochastic Automata Networks for Creation of Continuous Time Markov Chain Models of Voltage Gating of Gap Junction Channels

    Directory of Open Access Journals (Sweden)

    Mindaugas Snipas

    2015-01-01

    Full Text Available The primary goal of this work was to study advantages of numerical methods used for the creation of continuous time Markov chain models (CTMC of voltage gating of gap junction (GJ channels composed of connexin protein. This task was accomplished by describing gating of GJs using the formalism of the stochastic automata networks (SANs, which allowed for very efficient building and storing of infinitesimal generator of the CTMC that allowed to produce matrices of the models containing a distinct block structure. All of that allowed us to develop efficient numerical methods for a steady-state solution of CTMC models. This allowed us to accelerate CPU time, which is necessary to solve CTMC models, ∼20 times.

  6. Height-Deterministic Pushdown Automata

    DEFF Research Database (Denmark)

    Nowotka, Dirk; Srba, Jiri

    2007-01-01

    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...

  7. Automata Networks Model of Memory Loss Effects on the Formation of Linguistic Conventions

    CERN Document Server

    Vera, Javier

    2015-01-01

    This paper proposes an Automata Networks approach to address the influence of memory loss on the formation of shared conventions. We focus our analysis on a numerical description of the dynamics over one and two dimensional periodic lattices, through an energy function that measures the local agreement between the individuals. For the two dimensional case, it exhibits a sharp transition on the relation between the energy and the parameter defined to measure the amount of memory loss. Finally, we briefly discuss the implications for the formation of language.

  8. Quantifying and Analysing Neighbourhood Characteristics Supporting Urban Land-Use Modelling

    DEFF Research Database (Denmark)

    Hansen, Henning Sten

    2009-01-01

    cellular automata (CA) to accomplish spatially explicit land-use change modelling. Spatial interaction between neighbour land-uses is an important component in urban cellular automata. Nevertheless, this component is calibrated through trial-and-error estimation. The aim of the current research project has...

  9. Quantum counter automata

    CERN Document Server

    Say, A C Cem

    2011-01-01

    The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA. This is the first demonstration of the superiority of a quantum model to the corresponding classical one in the real-time case with an error bound less than 1. We also introduce a generalization of the rtQ1CA, the quantum one-way one-counter automaton (1Q1CA), and show that they too are superior to the corresponding family of probabilistic machines. For this purpose, we provide general definitions of these models that reflect the modern approach to the definition of quantum finite automata, and point out some problems with previous results. We identify several remaining open problems.

  10. Parameter estimation with a novel gradient-based optimization method for biological lattice-gas cellular automaton models.

    Science.gov (United States)

    Mente, Carsten; Prade, Ina; Brusch, Lutz; Breier, Georg; Deutsch, Andreas

    2011-07-01

    Lattice-gas cellular automata (LGCAs) can serve as stochastic mathematical models for collective behavior (e.g. pattern formation) emerging in populations of interacting cells. In this paper, a two-phase optimization algorithm for global parameter estimation in LGCA models is presented. In the first phase, local minima are identified through gradient-based optimization. Algorithmic differentiation is adopted to calculate the necessary gradient information. In the second phase, for global optimization of the parameter set, a multi-level single-linkage method is used. As an example, the parameter estimation algorithm is applied to a LGCA model for early in vitro angiogenic pattern formation.

  11. Cellular automaton model of crowd evacuation inspired by slime mould

    Science.gov (United States)

    Kalogeiton, V. S.; Papadopoulos, D. P.; Georgilas, I. P.; Sirakoulis, G. Ch.; Adamatzky, A. I.

    2015-04-01

    In all the living organisms, the self-preservation behaviour is almost universal. Even the most simple of living organisms, like slime mould, is typically under intense selective pressure to evolve a response to ensure their evolution and safety in the best possible way. On the other hand, evacuation of a place can be easily characterized as one of the most stressful situations for the individuals taking part on it. Taking inspiration from the slime mould behaviour, we are introducing a computational bio-inspired model crowd evacuation model. Cellular Automata (CA) were selected as a fully parallel advanced computation tool able to mimic the Physarum's behaviour. In particular, the proposed CA model takes into account while mimicking the Physarum foraging process, the food diffusion, the organism's growth, the creation of tubes for each organism, the selection of optimum tube for each human in correspondence to the crowd evacuation under study and finally, the movement of all humans at each time step towards near exit. To test the model's efficiency and robustness, several simulation scenarios were proposed both in virtual and real-life indoor environments (namely, the first floor of office building B of the Department of Electrical and Computer Engineering of Democritus University of Thrace). The proposed model is further evaluated in a purely quantitative way by comparing the simulation results with the corresponding ones from the bibliography taken by real data. The examined fundamental diagrams of velocity-density and flow-density are found in full agreement with many of the already published corresponding results proving the adequacy, the fitness and the resulting dynamics of the model. Finally, several real Physarum experiments were conducted in an archetype of the aforementioned real-life environment proving at last that the proposed model succeeded in reproducing sufficiently the Physarum's recorded behaviour derived from observation of the aforementioned

  12. Switching the Localized Surface Plasmon Resonance of Single Gold Nanorods with a Phase-Change Material and the Implementation of a Cellular Automata Algorithm Using a Plasmon Particle Array

    Directory of Open Access Journals (Sweden)

    Takashi Hira

    2015-01-01

    Full Text Available We investigate the modulation of the localized surface plasmon resonance (LSPR of a gold nanorod (AuNR using a GeSbTe film as an active medium. We demonstrate high-contrast switching of LSPR in an AuNR/GST/Au thin film sandwich structure upon phase change. To go beyond this single-particle switching functionality, we consider a plasmon particle system interacting with a phase-change material (PCM to discuss the possibility of parallel processing devices with memory functionality, exploiting the plasticity and threshold behavior that are inherent characteristics of PCMs. We demonstrate that the temporal and spatial evolution of a plasmon-PCM array system can be equivalent to a cellular automata algorithm.

  13. Analysis of invulnerability of wireless sensor networks based on cellular automata%基于元胞自动机的无线传感器网络抗毁性分析

    Institute of Scientific and Technical Information of China (English)

    符修文; 李文锋; 宋威; 杨林

    2014-01-01

    The poor performance of invulnerability caused by features such as energy-sensitivity and effective connectivity is the major technical bottleneck that prohibits the widespread application of Wireless Sensor Networks(WSNs). Therefore, in this paper, the analysis of invulnerability of WSNs is carried on based on the 2-D cellular automata model. Through building five failure models(e.g. energy failure and failure of effective connectivity), the topology evolution rules of WSNs are established, and the invulnerability of WSNs under random attack and intended attack is analyzed. The experi-mental results show that the invulnerability of WSNs under random attack performs better than that of WSNs under attack scheme of intender attack. Moreover, through composition analysis of failure nodes, energy failure is mainly responsible for the network failure when facing random attack while failure of effective connectivity is more influential under intended attack. The results accessed in the paper provide the beneficial references and instructions for further research on methods of invulnerability-enhancement.%因能耗敏感与有效连通性特征等所造成的网络抗毁性能低下是制约无线传感器网络规模应用的主要技术瓶颈之一。针对该问题,利用二维元胞自动机考虑能耗失效、连通性失效等五种失效情形,建立无线传感器网络拓扑演化规则,并基于随机性失效策略与选择性失效策略对网络抗毁性能展开分析。研究表明,网络面临随机失效时抗毁性能明显优于选择性失效。通过失效节点构成分析,在随机失效策略下,能耗失效为造成网络失败主因,而在选择性失效策略下,连通性失效对性能影响更为显著。基于所得结论,为进一步研究网络抗毁性能提升方法提供有益借鉴。

  14. Priced Timed Automata:  Theory and Tools

    DEFF Research Database (Denmark)

    Larsen, Kim Guldstrand

    2009-01-01

    Priced timed automata are emerging as useful formalisms for modeling and analysing a broad range of resource allocation problems. In this extended abstract, we highlight recent (un)deci\\-dability results related to priced timed automata as well as point to a number of open problems.......Priced timed automata are emerging as useful formalisms for modeling and analysing a broad range of resource allocation problems. In this extended abstract, we highlight recent (un)deci\\-dability results related to priced timed automata as well as point to a number of open problems....

  15. Cellular Automata Based Traffic Flow Simulation and Actuated Signal Control Strategy%基于CA方法的交通流数值模拟及信号灯感应控制策略研究

    Institute of Scientific and Technical Information of China (English)

    陈晨; 陈建桥

    2011-01-01

    According to the theory of cellular automata ( CA), the urban traffic flows at 4 intersections were investigated and a set of discrete equations were proposed to describe the traffic dynamics. The effect of two signal control strategies, i.e., synchronous timing control and actuated control, on traffic flow were discussed. Simulation results show that ( 1 ) the effect of signal control strategies is related to the density of traffic flow; (2) and there exists a certain range of actuated control parameters in which the efficiency of traffic flow can be optimized. Therefore, in order to ensure the efficiency of traffic flow, one the proper signal control strategy should be chosen for different global densities of traffic flow.%采用细胞自动机方法(Cellular Automata:CA)模拟含4个路口的城市道路交通流状态,并通过离散方程描述车辆的运动过程.研究了信号灯控制策略(同步定时控制及感应控制)对交通流状态的影响.数值模拟结果表明,信号灯对交通流的影响与道路中车辆密度有关,同时,感应控制参数的选取存在一合理的取值范围,可优化交通流通行效率.因此,为保证交通流的通行效率,应针对不同的车辆密度,选取适当的信号灯控制方式.

  16. Visibly Pushdown Automata

    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...

  17. Continuity Controlled Hybrid Automata

    NARCIS (Netherlands)

    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

  18. Continuity controlled Hybrid Automata

    NARCIS (Netherlands)

    Bergstra, J.A.; Middelburg, C.A.

    2008-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

  19. Simulating the competition evolution of the civil aviation industry based on cellular automata%基于元胞自动机的民航运输产业竞争演化模拟

    Institute of Scientific and Technical Information of China (English)

    寇勇刚; 吴桐水; 柳青

    2011-01-01

    为研究民航运输产业的竞争演化,考虑航空公司的资源竞争力、职能竞争力、核心竞争力及动态核心能力四层次竞争力等因素,建立了元胞自动机模型.以中美两国民航运输产业的竞争演化为例,对主导元胞(航空公司)和支持元胞(机场)的协同发展及其盈利状况进行了模拟研究.研究结果表明,美国民航业放松航空管制后因航空公司动态核心能力不强,行业整体盈利状况不佳;我国民航业半放松管制后,盈利状况也不容乐观.然而,提高航空公司的动态核心能力既可以避免美国民航业发展中经营惨淡的局面,同时又能促进我国民航业的快速发展.%In order to research the competition evolution of the aviation industry, built the cellular automata model with consideration of resource, function, core competence and dynamic core competence of airlines four competition factors. Took competition evolution of the civil aviation industry in China and USA for examples, simulated the coordinated development and profit status of the major cells (airlines) and supportive cells (airports). The result indicates the industry profit status of USA are not good after the deregulation because airlines do not have enough dynamic core competence, the industry profit status of China also are not good after the half-deregulation. However, improving the dynamic core competence of airlines could prevent the civil aviation industry from the loss of USA development example, meanwhile, could promote rapidly development of our country's civil aviation industry, too.

  20. A cellular automaton model adapted to sandboxes to simulate the transport of solutes

    Science.gov (United States)

    Lora, Boris; Donado, Leonardo; Castro, Eduardo; Bayuelo, Alfredo

    2016-04-01

    The increasingly use of groundwater sources for human consumption and the growth of the levels of these hydric sources contamination make imperative to reach a deeper understanding how the contaminants are transported by the water, in particular through a heterogeneous porous medium. Accordingly, the present research aims to design a model, which simulates the transport of solutes through a heterogeneous porous medium, using cellular automata. Cellular automata (CA) are a class of spatially (pixels) and temporally discrete mathematical systems characterized by local interaction (neighborhoods). The pixel size and the CA neighborhood were determined in order to reproduce accurately the solute behavior (Ilachinski, 2001). For the design and corresponding validation of the CA model were developed different conservative tracer tests using a sandbox packed heterogeneously with a coarse sand (size # 20 grain diameter 0,85 to 0,6 mm) and clay. We use Uranine and a saline solution with NaCl as a tracer which were measured taking snapshots each 20 seconds. A calibration curve (pixel intensity Vs Concentration) was used to obtain concentration maps. The sandbox was constructed of acrylic (caliber 0,8 cms) with 70 x 45 x 4 cms of dimensions. The "sandbox" had a grid of 35 transversal holes with a diameter of 4 mm each and an uniform separation from one to another of 10 cms. To validate the CA-model it was used a metric consisting in rating the number of correctly predicted pixels over the total per image throughout the entire test run. The CA-model shows that calibrations of pixels and neighborhoods allow reaching results over the 60 % of correctly predictions usually. This makes possible to think that the application of the CA- model could be useful in further researches regarding the transport of contaminants in hydrogeology.

  1. Cellular Automaton Modeling of Pattern Formation

    NARCIS (Netherlands)

    Boerlijst, M.C.

    2006-01-01

    Book review Andreas Deutsch and Sabine Dormann, Cellular Automaton Modeling of Biological Pattern Formation, Characterization, Applications, and Analysis, Birkhäuser (2005) ISBN 0-8176-4281-1 331pp..

  2. Designing and implementing a regional urban modeling system using the SLEUTH cellular urban model

    Science.gov (United States)

    Jantz, C.A.; Goetz, S.J.; Donato, D.; Claggett, P.

    2010-01-01

    This paper presents a fine-scale (30 meter resolution) regional land cover modeling system, based on the SLEUTH cellular automata model, that was developed for a 257000 km2 area comprising the Chesapeake Bay drainage basin in the eastern United States. As part of this effort, we developed a new version of the SLEUTH model (SLEUTH-3r), which introduces new functionality and fit metrics that substantially increase the performance and applicability of the model. In addition, we developed methods that expand the capability of SLEUTH to incorporate economic, cultural and policy information, opening up new avenues for the integration of SLEUTH with other land-change models. SLEUTH-3r is also more computationally efficient (by a factor of 5) and uses less memory (reduced 65%) than the original software. With the new version of SLEUTH, we were able to achieve high accuracies at both the aggregate level of 15 sub-regional modeling units and at finer scales. We present forecasts to 2030 of urban development under a current trends scenario across the entire Chesapeake Bay drainage basin, and three alternative scenarios for a sub-region within the Chesapeake Bay watershed to illustrate the new ability of SLEUTH-3r to generate forecasts across a broad range of conditions. ?? 2009 Elsevier Ltd.

  3. Membrane Automata with Priorities

    Institute of Scientific and Technical Information of China (English)

    Luděk Cienciala; Lucie Ciencialová

    2004-01-01

    In this paper the one-way P automata with priorities are introduced. Such automata are P systemshere the membranes are only allowed to consume objects from parent membranes, under the given conditions. The result of computation of these systems is the set of multiset sequences consumed by skin membrane intc the system. The rules associated in some order with each membrane cannot modify any objects, they can only move them through membrane. We show that P automata with priorities and two membranes can accept every recursively enumerated language.

  4. From Orchestration to Choreography through Contract Automata

    Directory of Open Access Journals (Sweden)

    Davide Basile

    2014-10-01

    Full Text Available We study the relations between a contract automata and an interaction model. In the former model, distributed services are abstracted away as automata - oblivious of their partners - that coordinate with each other through an orchestrator. The interaction model relies on channel-based asynchronous communication and choreography to coordinate distributed services. We define a notion of strong agreement on the contract model, exhibit a natural mapping from the contract model to the interaction model, and give conditions to ensure that strong agreement corresponds to well-formed choreography.

  5. Urn Automata

    Science.gov (United States)

    2003-11-05

    of deadlock or loss of synchronization. The Chemical Abstract Machine of Berry and Boudol [1] is an abstract machine designed to model a situation in...only small growth in the number of tokens? References [1] G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217

  6. Types and Automata

    DEFF Research Database (Denmark)

    Schwartzbach, Michael Ignatieff; Meineche Smidt, Erik

    from suggesting an implementation, this connection lends a certain naturality to our type system. We also introduce a very general form of extended (recursive) type equations which are explained in terms of (monotone) alternating automata. Since types are simply equationally defined trees......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...

  7. Algebraic and structural automata theory

    CERN Document Server

    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.

  8. Cellular automata to understand the behaviour of beach-dune systems: Application to El Fangar Spit active dune system (Ebro delta, Spain)

    Science.gov (United States)

    Barrio-Parra, Fernando; Rodríguez-Santalla, Inmaculada

    2016-08-01

    Coastal dunes are sedimentary environments characterized by their high dynamism. Their evolution is determined by sedimentary exchanges between the beach-dune subsystems and the dune dynamics itself. Knowledge about these exchanges is important to prioritize management and conservation strategies of these environments. The aim of this work is the inclusion of the aeolian transport rates obtained using a calibrated cellular automaton to estimate the beach-dune sediment exchange rates in a real active dune field at El Fangar Spit (Ebro Delta, Spain). The dune dynamics model is able to estimate average aeolian sediment fluxes. These are used in combination with the observed net sediment budget to obtain a quantitative characterization of the sediment exchange interactions. The methods produce a substantial improvement in the understanding of coastal sedimentary systems that could have major implications in areas where the management and conservation of dune fields are of concern.

  9. A Modified Sensitive Driving Cellular Automaton Model

    Institute of Scientific and Technical Information of China (English)

    GE Hong-Xia; DAI Shi-Qiang; DONG Li-Yun; LEI Li

    2005-01-01

    A modified cellular automaton model for traffic flow on highway is proposed with a novel concept about the variable security gap. The concept is first introduced into the original Nagel-Schreckenberg model, which is called the non-sensitive driving cellular automaton model. And then it is incorporated with a sensitive driving NaSch model,in which the randomization brake is arranged before the deterministic deceleration. A parameter related to the variable security gap is determined through simulation. Comparison of the simulation results indicates that the variable security gap has different influence on the two models. The fundamental diagram obtained by simulation with the modified sensitive driving NaSch model shows that the maximumflow are in good agreement with the observed data, indicating that the presented model is more reasonable and realistic.

  10. Theory of automata, formal languages and computation

    CERN Document Server

    Xavier, SPE

    2004-01-01

    This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages. Turing Machines have been introduced and the book discusses computability and decidability. A number of problems with solutions have been provided for each chapter. A lot of exercises have been given with hints/answers to most of these tutorial problems.

  11. 基于元胞自动机的个体知识传播行为研究%Research on Knowledge Transfer Behavior of individuals Based on Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    吴江宁; 刘娜; 宣照国

    2011-01-01

    知识交流与传播是组织获取知识,提高自身知识存量及知识竞争优势的重要手段之一,越来越受到知识管理者的重视.因此,本文立足于组织内个体之间的知识获取与互传播,考虑个体不同的学习态度将个体分为主动学习和被动学习两类,并将个体知识表示为一个多维知识向量,个体在知识交流过程中相互影响会产生学习态度、行为及知识存量的改变,在此基础上,建立了基于状态更新和知识传播双层规则的元胞自动机知识传播模型,模拟分析了邻域结构及初始主动学习率对组织内个体知识传播行为的影响,并对模型中加入人员移动和专家引进机制的情形进行了模拟研究.研究发现,组织内人员微观层次上的局部交互行为在宏观上表现出自组织的复杂特性;Moore邻域结构更有利于组织内个体间的知识交流与传播;组织平均知识存量的增长速度随着初始主动学习率的提高而加快;人员移动和专家机制的引入能够提高组织内部知识传播的效率和知识存量;此外还发现组织平均知识存量的增长速度与人员的自主学习能力成正相关.%Knowledge exchange and transfer are key means for the organization to acquire knowledge and hence promote its knowledge stock and competitive competence, which has attracted more attention from many knowledge managers. This paper starts with this issue and focuses on the different learning styles of individuals within the organization.The individuals involved are divided into two types, i.e. active learner or passive learner, whose learning attitude,behavior and knowledge stock will be changed during the process of knowledge exchange. The knowledge to be exchanged is expressed by a multi-dimensional vector. Hereby, a cellular automata knowledge transfer model is proposed to study the influence of structure of neighborhood, the ratio of initial active learners, the people movement and

  12. AODV-ECA: Energy-Efficient AODV Routing Protocol Using Cellular Automata in Wireless Sensor Network%基于元胞自动机的无线传感器网节能路由协议

    Institute of Scientific and Technical Information of China (English)

    于秦; 肖志辉; 安宁

    2013-01-01

    Since the battery equipped wireless sensors have limited energy supply,conserving energy to extend the lifetime becomes the most important requirement in the wireless sensor network (WSN).An AODV routing protocol,AODV-ECA,was proposed,based on cellular automata (CA) mechanism,which was sourced from the thoughts of automatic breeding in biology.AODV-ECA could reduce and balance energy consumption to prolong the network lifetime by means of switching nodes' states between sleeping and working.Finally,AODV-ECA to other energy-efficient routing protocols by NS2 simulator was simulated and evaluated.%节能是设计无线传感器网路由协议首先要解决的问题.针对无线传感器网拓扑演化过程所呈现的时空动力学特性,基于源自生物学的元胞自动机理论,提出无线传感器网节能路由协议(AODV-ECA).仿真结果及分析表明,该算法能有效减少传感节点能量消耗,延长无线传感器网生存时间.

  13. Research on cellular automata of traffic flow based on granular computing%基于粒计算的元胞自动机交通流的研究

    Institute of Scientific and Technical Information of China (English)

    江顺亮; 黄小慧; 杨力; 徐少平

    2009-01-01

    Granular computing technology is introduced into the cellular automata traffic flow study. Based on the three-layer construction of cells, granules and traffic network, the traditional traffic flow systems may be improved. For the new traffic flow simulation system, the idea of granules and granular computing is reflected in the concept of motorcade, and the status of all cars will be updated in the hierarchal order of road sections, motorcades and vehicles during a time step.%将粒计算技术引入到元胞自动机的交通流研究中,从而为进一步提出基于元胞、粒和交通网络三层结构的交通流系统奠定基础,继而改进传统交通流模拟系统的架构.在此交通流模拟系统中,粒及粒计算的思想反映为系统设计中的车队概念,而在某一时间步进内,交通网络中所有车辆的更新将按照路段、车队、车辆的层级顺序进行.

  14. 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'.

  15. Confluence reduction for Markov automata (extended version)

    NARCIS (Netherlands)

    Timmer, M.; Pol, van de J.C.; Stoelinga, M.I.A.

    2013-01-01

    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 gener

  16. Optimal scheduling using priced timed automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum

    2005-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 [20] and AMETIST [16] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [18, 5] specialized for cost-optimal reachability for the extended model of so-called priced timed automata....

  17. 一种基于误差快速扩散元胞自动机的加密技术%A method of digital secure communication based on a cellular automata with rapid dispersion of errors

    Institute of Scientific and Technical Information of China (English)

    王福来

    2011-01-01

    构造了一个具有较大密钥空间的新型一维元胞自动机.在该元胞自动机中,密钥为采用移位映射的伪随机序列及受控扰动项,避免了数据膨胀,元胞自动机具有随机性触发规则.该元胞自动机一次处理信息量大,避免了复杂的计算过程.所生成的流密码在理论上被证明了具有理想的随机性与雪崩效应,误差扩散速度快.实证分析研究表明,流密码不仅在全局上、而且在局部上都具有良好的随机性能,通过测试长度为24000的流密码在400次迭代产生的数据表明,经x2检验,在显著性水平为5%时,频数检验通过率超过95%,序列检验通过率为100%;数据敏感性检验方面,密钥在任意位置改变1bit导致各流密码比特数发生改变的平均值(灵敏值为V)为49%-51%之间(理论上V=50%),均值为49.99%,方差为1.193×10-5.因此这是一个较理想的加密技术工具.%An improved one-dimensional cellular automata is designed in which the key space is large with pseudo random series on a shift map and perturbed terms and thus data expansion is avoided. Random triggering rules are involved. There is no complex computation, but a large amount of information can be processed every time. The stream cipher generated by the automata is proved to be of ideal randomness and avalanche effect with rapid dispersion velocity of errors. Empirical results show that the stream cipher is perfectly random both globally and locally. The chi-square test(confidence 95% ) on a set of stream cipher with a length of 24000 and its 400 time iterations shows that the passing rates of frequencies and series are above 95% and 100% , respectively. To test the sensitivity of the data, 1 bit is changed at any position of the key stream and the average variation rate of total bits is 49.99% , ranging from 49% to 51% (theoretical value is 50% ) , and variance is 1. 193 · 10 -5, which means that the automata is a good encryption technique.

  18. Automata learning algorithms and processes for providing more complete systems requirements specification by scenario generation, CSP-based syntax-oriented model construction, and R2D2C system requirements transformation

    Science.gov (United States)

    Hinchey, Michael G. (Inventor); Margaria, Tiziana (Inventor); Rash, James L. (Inventor); Rouff, Christopher A. (Inventor); Steffen, Bernard (Inventor)

    2010-01-01

    Systems, methods and apparatus are provided through which in some embodiments, automata learning algorithms and techniques are implemented to generate a more complete set of scenarios for requirements based programming. More specifically, a CSP-based, syntax-oriented model construction, which requires the support of a theorem prover, is complemented by model extrapolation, via automata learning. This may support the systematic completion of the requirements, the nature of the requirement being partial, which provides focus on the most prominent scenarios. This may generalize requirement skeletons by extrapolation and may indicate by way of automatically generated traces where the requirement specification is too loose and additional information is required.

  19. An Introduction to Input/Output Automata. Revision

    Science.gov (United States)

    1988-11-18

    example, a leader election algorithm. Finally, Section 5 contains a survey of some of the uses that have so far been made of the model. Keywords: I/O automata, Asynchronous systems, Concurrency, Computer modeling, Data transfer.

  20. Gradient Cellular Automata with the Consideration of Spatial Growth Potentiality for Urban Sprawling Simulation%一种考虑空间增长潜力的城市扩张灰度CA模型与应用

    Institute of Scientific and Technical Information of China (English)

    马世发; 艾彬; 赵克飞

    2014-01-01

    Geography simulation model such as Cellular Automata (CA) is one of the most important tools for simulating and early warning the urban growth. The CA model can simulate urban sprawling accurately only when suitable conversion rules for every cell are achieved. Hence, the core of CA is to derive the conversion rules, and many researchers have been interested in discovering the rules. However, the conversion rules of tradi-tional CA are mainly derived from historic samples, in which both changed samples and unchanged ones are con-sidered for function fitting to retrieve parameters simultaneously. In this approach, it is assumed that if the urban sprawling occurred, samples were labeled as 1; otherwise, samples were accordingly labeled as 0. However, it will result in over fitting for the unchanged samples, because those samples with labels of 0 may have the potenti-ality to transform in future, especially for those located at the rural-urban fringe. Therefore, we proposed a gradi-ent CA for simulating urban sprawling. In this model, whether or not urban growth would occur was determined by the developing probability instead of its developed or undeveloped status. Accordingly, the unchanged sam-ples were set to the values ranging from 0 to 1. And in this research, the developing potentiality was estimated ac-cording to present planning maps. Compared with traditional CA, the gradient CA could avoid the over fitting problem for the unchanged samples to a certain degree. Moreover, the fitting objective was distinguished from traditional CA for its ability in retrieving conversion rules. In addition, particle swarm optimization algorithm was used to obtain the parameters of spatial indices. Finally, Guangzhou City, which locates in the Pearl River Delta of China, was chosen as the study area for model implementation and validation. In this case study, the spa-tial developing potentiality was allocated referring to the major function zone (MFZ) planning, because MFZ is

  1. Turing Automata and Graph Machines

    Directory of Open Access Journals (Sweden)

    Miklós Bartha

    2010-06-01

    Full Text Available Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the collection of such machines becomes an indexed monoidal algebra. On the analogy of the von Neumann data-flow computer architecture, Turing graph machines are proposed as potentially reversible low-level universal computational devices, and a truly reversible molecular size hardware model is presented as an example.

  2. Characterizations of 1-Way Quantum Finite Automata

    CERN Document Server

    Brodsky, A; Brodsky, Alex; Pippenger, Nicholas

    1999-01-01

    The 2-way quantum finite automaton introduced by Kondacs and Watrous can accept non-regular languages with bounded error in polynomial time. If we restrict the head of the automaton to moving classically and to moving only in one direction, the acceptance power of this 1-way quantum finite automaton is reduced to a proper subset of the regular languages. In this paper we study two different models of 1-way quantum finite automata. The first model, termed measure-once quantum finite automata, was introduced by Moore and Crutchfield, and the second model, termed measure-many quantum finite automata, was introduced by Kondacs and Watrous. We characterize the measure-once model when it is restricted to accepting with bounded error and show that, without that restriction, it can solve the word problem over the free group. We also show that it can be simulated by a probabilistic finite automaton and describe an algorithm that determines if two measure-once automata are equivalent. We prove several closure propertie...

  3. Towards a theory of modelling with Boolean automata networks - I. Theorisation and observations

    CERN Document Server

    Noual, Mathilde

    2011-01-01

    Although models are built on the basis of some observations of reality, the concepts that derive theoretically from their definitions as well as from their characteristics and properties are not necessarily direct consequences of these initial observations. Indeed, many of them rather follow from chains of theoretical inferences that are only based on the precise model definitions and rely strongly, in addition, on some consequential working hypotheses. Thus, it is important to address the question of which features of a model effectively carry some modelling meaning and which only result from the task of formalising observations of reality into a mathematical language. In this article, we address this question with a theoretical point view that sets our discussion strictly between the two stages of the modelling process that require knowledge of real systems, that is, between the initial stage that chooses a global theoretical framework to build the model and the final stage that exploits its formal predicti...

  4. Applications of Weighted Automata in Natural Language Processing

    Science.gov (United States)

    Knight, Kevin; May, Jonathan

    We explain why weighted automata are an attractive knowledge representation for natural language problems. We first trace the close historical ties between the two fields, then present two complex real-world problems, transliteration and translation. These problems are usefully decomposed into a pipeline of weighted transducers, and weights can be set to maximize the likelihood of a training corpus using standard algorithms. We additionally describe the representation of language models, critical data sources in natural language processing, as weighted automata. We outline the wide range of work in natural language processing that makes use of weighted string and tree automata and describe current work and challenges.

  5. Cellular Automation of Galactic Habitable Zone

    CERN Document Server

    Vukotic, Branislav

    2010-01-01

    We present a preliminary results of our Galactic Habitable Zone (GHZ) 2D probabilistic cellular automata models. The relevant time-scales (emergence of life, it's diversification and evolution influenced with the global risk function) are modeled as the probability matrix elements and are chosen in accordance with the Copernican principle to be well-represented by the data inferred from the Earth's fossil record. With Fermi's paradox as a main boundary condition the resulting histories of astrobiological landscape are discussed.

  6. A refined cellular automaton model to rectify impractical vehicular movement behavior

    Science.gov (United States)

    Lan, Lawrence W.; Chiou, Yu-Chiun; Lin, Zih-Shin; Hsu, Chih-Cheng

    2009-09-01

    When implementing cellular automata (CA) into a traffic simulation, one common defect yet to be rectified is the abrupt deceleration when vehicles encounter stationary obstacles or traffic jams. To be more in line with real world vehicular movement, this paper proposes a piecewise-linear movement to replace the conventional particle-hopping movement adopted in most previous CA models. Upon this adjustment and coupled with refined cell system, a new CA model is developed using the rationale of Forbes’ et al. car-following concept. The proposed CA model is validated on a two-lane freeway mainline context. It shows that this model can fix the unrealistic deceleration behaviors, and thus can reflect genuine driver behavior in the real world. The model is also capable of revealing Kerner’s three-phase traffic patterns and phase transitions among them. Furthermore, the proposed CA model is applied to simulate a highway work zone wherein traffic efficiency (maximum flow rates) and safety (speed deviations) impacted by various control schemes are tested.

  7. 城市交通拥堵的经济学分析和元胞自动机模拟%Economic Analysis of Urban Traffic Congestion and Cellular Automata Simulation

    Institute of Scientific and Technical Information of China (English)

    李捷; 朱明皓

    2011-01-01

    分析了城市道路系统的公共性和外部性.使用均衡分析的方法对城市交通拥堵进行了经济学分析,认为当城市道路的使用者超过一定数量时,道路交通的外部性凸显出来,由于这种外部性,道路交通系统总数处于过度使用的状态.最后使用元胞自动机对城市交通拥堵现象进行了模拟,发现为了改善城市交通堵塞,虽然需要增加交通供给,但是更为重要的是如何优化车流使得现有的交通供给得到充分的利用.%This paper discusses the economic characteristics of urban road traffic system, analyzes the public and external nature of the urban road system. Using the method of equilibrium analysis, the paper gives an economic analysis of urban traffic congestion and finds that the urban road traffic system shows externality when the number of road users reach a certain threshold. Because of this externality, the urban road traffic system is constantly in the state of excessive use. Finally, the article uses cellular automata to simulate the urban traffic congestion phenomenon and finds that, to improve urban traffic congestion, necessary as it is to increase the supply of urban road traffic system, what is more important is to figure out how to optimize traffic flow to make existing supply fully utilized.

  8. 基于QCA可编程逻辑阵列单元的元胞缺陷研究%Study of Cell Defects of the Programmable Logic Array Unit Based on the Quantum-Dot Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    李政操; 蔡理; 黄宏图

    2012-01-01

    介绍了一种量子元胞自动机(QCA)可编程逻辑阵列结构,该结构可用于实现量子元胞自动机大规模可编程逻辑电路,采用QCADesigner仿真软件研究了元胞缺失、移位缺陷和未对准缺陷对可编程逻辑阵列单元逻辑功能的影响.得出了特定结构下,每个元胞移位缺陷和未对准缺陷的最大错位距离,以及导线模式中存在特定位置的8个可缺失元胞.这为缺陷单元的应用提供了一个具体的参数标准,提高了PLA阵列的单元利用率.%A programmable logic array (PLA) structure that can be used in the large scale integrated circuit using quantum-dot cellular automata (QCA) was introduced. The effects of the cell omission , cell misalignment and cell displacement on the PLA were researched by QCADesigner. And the maximum fault-tolerant ranges of displacement and misalignment for each cell were obtained for a certain structure. Besides that, the 8-cell omission defect in the wire mode was also achieved. The research provides a concrete parameter criterion for applying defect units normally, and advances the utilizing rate of the cell.

  9. Energy-Aware Scheduling of FIR Filter Structures using a Timed Automata Model

    DEFF Research Database (Denmark)

    Wognsen, Erik Ramsgaard; Hansen, Rene Rydhof; Larsen, Kim Guldstrand

    2016-01-01

    structures where we initially derive data flow graphs and precedence graphs using the Synchronous Data Flow (SDF) notation. Based on actual measurements on the Altera Cyclone IV FPGA, we derive power and timing estimates for addition and multiplication, including idling power consumption. We next model...

  10. Cellular automata method for solving nonlinear systems of equations and its global convergence proof%求解非线性方程组的元胞自动机方法及其全局收敛性证明

    Institute of Scientific and Technical Information of China (English)

    陆秋琴; 杨少敏; 黄光球

    2012-01-01

    为了求得非线性方程组所有精确解,根据元胞自动机的特点构造了求解非线性方程组的全局收敛算法.在该算法中,将非线性方程组解的理论搜索空间划分为离散搜索空间,将离散搜索空间定义为元胞空间;离散搜索空间的每个点就是一个元胞,而一个元胞对应着非线性方程组的一个试探解;元胞的状态由其空间位置及位置修正量构成.将元胞空间划分为若干个非空子集,所有元胞的状态从一个非空子集转移到另一个非空子集的状态演化过程实现了元胞空间对理论搜索空间的搜索.在元胞状态演化过程中,元胞从一个状态转移到另一个状态的状态转移概率可以计算出来;元胞演化过程中的每个状态对应于有限Markov链上的一个状态.利用可归约随机矩阵的稳定性条件证明了该算法具有全局收敛性.仿真实例表明该算法是高效的.%To get all the accurate solutions to Nonlinear Systems of Equations (NSE), the algorithm with global convergence was constructed for solving NSE based on the characteristics of Cellular Automata (CA). In the algorithm, the theoretical search space of NSE was divided into the discrete space, the discrete space was defined as the cellular space; each point in the discrete space was a cell in the cellular space, and each cell was a trial solution of NSE; a cellular state consisted of position and increment of position. The cellular space was divided into many nonempty subsets, and states evolution of all cells from one nonempty subset to another realized the search of the cellular space on the theoretical search space. During evolution process of all cells, each cell's transition probability from one position to any another position could be simply calculated; each state of cells during evolution corresponded to a state of a finite Markov chain. The stability condition of a reducible stochastic matrix was used to prove the global convergence

  11. Statistical physical models of cellular motility

    Science.gov (United States)

    Banigan, Edward J.

    Cellular motility is required for a wide range of biological behaviors and functions, and the topic poses a number of interesting physical questions. In this work, we construct and analyze models of various aspects of cellular motility using tools and ideas from statistical physics. We begin with a Brownian dynamics model for actin-polymerization-driven motility, which is responsible for cell crawling and "rocketing" motility of pathogens. Within this model, we explore the robustness of self-diffusiophoresis, which is a general mechanism of motility. Using this mechanism, an object such as a cell catalyzes a reaction that generates a steady-state concentration gradient that propels the object in a particular direction. We then apply these ideas to a model for depolymerization-driven motility during bacterial chromosome segregation. We find that depolymerization and protein-protein binding interactions alone are sufficient to robustly pull a chromosome, even against large loads. Next, we investigate how forces and kinetics interact during eukaryotic mitosis with a many-microtubule model. Microtubules exert forces on chromosomes, but since individual microtubules grow and shrink in a force-dependent way, these forces lead to bistable collective microtubule dynamics, which provides a mechanism for chromosome oscillations and microtubule-based tension sensing. Finally, we explore kinematic aspects of cell motility in the context of the immune system. We develop quantitative methods for analyzing cell migration statistics collected during imaging experiments. We find that during chronic infection in the brain, T cells run and pause stochastically, following the statistics of a generalized Levy walk. These statistics may contribute to immune function by mimicking an evolutionarily conserved efficient search strategy. Additionally, we find that naive T cells migrating in lymph nodes also obey non-Gaussian statistics. Altogether, our work demonstrates how physical

  12. Exactly solvable cellular automaton traffic jam model.

    Science.gov (United States)

    Kearney, Michael J

    2006-12-01

    A detailed study is undertaken of the v{max}=1 limit of the cellular automaton traffic model proposed by Nagel and Paczuski [Phys. Rev. E 51, 2909 (1995)]. The model allows one to analyze the behavior of a traffic jam initiated in an otherwise freely flowing stream of traffic. By mapping onto a discrete-time queueing system, itself related to various problems encountered in lattice combinatorics, exact results are presented in relation to the jam lifetime, the maximum jam length, and the jam mass (the space-time cluster size or integrated vehicle waiting time), both in terms of the critical and the off-critical behavior. This sets existing scaling results in their natural context and also provides several other interesting results in addition.

  13. Achieving of Fuzzy Automata for Processing Fuzzy Logic

    Institute of Scientific and Technical Information of China (English)

    SHU Lan; WU Qing-e

    2005-01-01

    At present, there has been an increasing interest in neuron-fuzzy systems, the combinations of artificial neural networks with fuzzy logic. In this paper, a definition of fuzzy finite state automata (FFA) is introduced and fuzzy knowledge equivalence representations between neural networks, fuzzy systems and models of automata are discussed. Once the network has been trained, we develop a method to extract a representation of the FFA encoded in the recurrent neural network that recognizes the training rules.

  14. Probabilistic and quantum finite automata with postselection

    CERN Document Server

    Yakaryilmaz, Abuzer

    2011-01-01

    We prove that endowing a real-time probabilistic or quantum computer with the ability of postselection increases its computational power. For this purpose, we provide a new model of finite automata with postselection, and compare it with the model of L\\={a}ce et al. We examine the related language classes, and also establish separations between the classical and quantum versions, and between the zero-error vs. bounded-error modes of recognition in this model.

  15. Effect of Driver Scope Awareness in the Lane Changing Maneuvers Using Cellular Automaton Model

    Directory of Open Access Journals (Sweden)

    Kohei Arai

    2013-07-01

    Full Text Available This paper investigated the effect of drivers’ visibility and their perception (e.g., to estimate the speed and arrival time of another vehicle on the lane changing maneuver. The term of scope awareness was used to describe the visibility required by the driver to make a perception about road condition and the speed of vehicle that exist in that road. A computer simulation model was conducted to show this driver awareness behavior. This studying attempt to precisely catching the lane changing behavior and illustrate the scope awareness parameter that reflects driver behavior. This paper proposes a simple cellular automata model for studying driver visibility effects of lane changing maneuver and driver perception of estimated speed. Different values of scope awareness were examined to capture its effect on the traffic flow. Simulation results show the ability of this model to capture the important features of lane changing maneuver and revealed the appearance of the short-thin solid line jam and the wide solid line jam in the traffic flow as the consequences of lane changing maneuver.

  16. Modelling Morphogenesis: From Single Cells to Crawling Slugs

    NARCIS (Netherlands)

    Savill, N.J.; Hogeweg, P.

    2002-01-01

    We present a three-dimensional hybrid cellular automata (CA)/partial differential equation (PDE) model that allows for the study of morphogenesis in simple cellular systems. We apply the model to the cellular slime mold Dictyostelium discoideum "from single cells to crawling slug". Using simple loca

  17. Modelling spread of foot-and-mouth disease in wild white-tailed deer and feral pig populations using a geographic-automata model and animal distributions.

    Science.gov (United States)

    Ward, Michael P; Laffan, Shawn W; Highfield, Linda D

    2009-09-01

    We investigated how the size and distribution of wild deer and feral pigs - species that might act as potential foot-and-mouth disease (FMD) virus maintenance hosts - might affect the persistence and spread of FMD. We used a susceptible-latent-infected-recovered geographic-automata model and spatially referenced data from southern Texas, USA. Within this study area, 100 locations were randomly selected and FMD virus spread was simulated (50 simulations each) at each location. As expected, the predicted sizes (km(2)) of the wild deer outbreaks were highly correlated (r(SP)>0.95) with the number of deer at incursion locations, the total number of deer within 2 km of incursion locations, and the minimum and maximum deer herd size within 2 km of incursion locations. However, the predicted sizes of the feral pig outbreaks were only moderately correlated (r(SP) 0.63-0.67) with the total, maximum and variance of the number of feral pigs within 2 km of incursion locations. Lack of continuity within the feral pig herd distribution across the landscape makes predicting disease spread more difficult than for deer, a more homogenously distributed species. When assessing the potential of wild and feral animal species at a locality to act as maintenance hosts of FMD virus, estimates of the population size and distribution might serve as a useful indicator of potential outbreaks in some circumstances.

  18. Cellular automata approach to extract shoreline from remote sensing imageries and its application%海岸线遥感信息提取的元胞自动机方法及其应用

    Institute of Scientific and Technical Information of China (English)

    冯永玖; 韩震

    2012-01-01

    Extraction shoreline information from remotely sensed imagery is important for islands investigation With remote sensing and the coastal comprehensive management. In order to accurately extract the information of shorelines, a new algorithm was developed based on a " bottom-up" approach cellular automata ( CA) by considering the direction information of images. The algorithm was developed under a Matlab environment, which includes functions such as mean smooth, land/water segmentation, discrete objects removal, and shoreline tracing. Using the proposed algorithm, the shorelines of an artificially coast at the Changxing-Hengsha islands of Shanghai and a muddy coast at Chongming Dongtan of Shanghai were extracted from Landsat ETM + images. The results demonstrate that the CA based shoreline extractor can accurately detect shoreline information of different coast types ( e. G. Artificially coast and muddy coast) from remote sensing images.%从遥感资料中准确提取海岸线信息,是海岛海岸带遥感调查与海岸带综合管理的重要内容.为了对多类型海岸线进行准确提取,基于“自下而上”演化的元胞自动机方法,结合遥感图像方向信息权重,构建了一种新的岸线提取算法,并在Matlab环境下开发实现包括均值平滑、海陆分离、离散地物去除和目标追踪的功能.以Landsat ETM+遥感影像作为数据源,分别对人工海岸上海市长兴岛-横沙岛和淤泥质海岸上海市崇明东滩岸线进行了检测,验证了该岸线信息提取的元胞自动机算法.研究表明,基于元胞自动机的岸线提取方法,能够以较高精度提取人工海岸和淤泥质海岸的岸线信息.

  19. 二阶可逆耦合触发细胞自动机的加密技术研究%Two-order Reversible Couple Toggle Cellular Automata Based Image Encryption Algorithm

    Institute of Scientific and Technical Information of China (English)

    彭川

    2012-01-01

    为了有效改进细胞自动机加密系统的实现复杂度和加解密效率,提出了一种二阶可逆耦合触发细胞自动机的图像加密方法.通过对简单的可逆细胞自动机进行扩展,构造二阶可逆细胞自动机,并以耦合触发规则对明文图像实行分块加密.二阶可逆细胞自动机的转移状态由其当前状态以及前一状态决定,有效增大了邻域范围,并且因为采用耦合触发规则,因此能明显增大加密系统的密钥空间,保证了系统的计算安全性.与一般触发自动机反向迭代的串行加密方式相比,该方法对于每个细胞的加密具有本质并行性,因此具有极高的加解密效率.通过实验验证其性能,结果表明与其它算法相比,该算法具有较大的密钥空间,能够有效抵抗蛮力攻击和差分分析攻击,且较小的邻域半径即可得到良好的加密效果,因此非常便于硬件实现.%To effectively improve the implement complexity and execution efficiency, an algorithm for image encryption is proposed which is based on two-order reversible couple toggle cellular automata (CA). By ways that extending the structure of simple reversible CA (RCA) and adopting couple toggle rules, the algorithm ciphers image which is divided into blocks previously. The CA's state is determined by previous state and next state, so it has larger key space and this can make system safe enough. Compared with general toggle CA (TCA) methods, the algorithm has much better efficiency because each cell is updated parallel Experiments and analysis indicate that this method has an enough large key space, high cipher and decipher speed and good scrambling effect. And the cryptosystem can resist brute attack and differential attack effectively.

  20. 记忆原理的元胞自动机优化算法及其收敛性证明%Cellular Automata Algorithm for Solving Optimization Problems Based on Memory Principles and its Global Convergence Proof

    Institute of Scientific and Technical Information of China (English)

    陆秋琴; 牛倩倩; 黄光球

    2013-01-01

    To solve large-scale optimization problems (OP) ,the algorithm with global convergence was constructed for solving OP based on the characteristics of memory principles(MP) and cellular automata(CA). In the algorithm, the theoretical search space of OP is divided into the discrete space,and the discrete space is defined as celullar space where each cell is an alternative solution of OP; the memorizing and forgeting rules of MP are used to control transition of states of each cell;a cellular state consists of position,increment of position and residual memory which is divided into three kinds of memory state such as instantaneous, short and long-term memory, each of which is strengthed or weakened by accepted stimulus strength, A cell is forgotted and then discarded when its residual memory is lower than a threshould. During evoluation process,a cell's transferring from one state to another realizes the search of cellular space on the theoretical search space. The stability condition of a reducible stochastic matrix was applied to prove the global convergence of the algorithm. The case study shows that the algorithm is efficient.%为了求解大规模优化问题,根据记忆原理与元胞自动机的特点构造了求解优化问题的全局收敛算法.在该算法中,将优化问题的理论搜索空间划分为离散搜索空间,该空间定义为元胞空间,其中的每个元胞对应着一个候选解.将记忆原理的记忆、遗忘规律用于控制每个元胞的状态转移;元胞的状态由其空间位置、位置修正量以及记忆残留值构成,该值分为瞬时记忆、短时记忆和长时记忆3种状态类型,并依据元胞接受刺激的强度被加强或衰减;记忆残留值低于某个阈值的元胞时被遗忘,不再被处理.在元胞演化过程中,元胞从一个状态转移到另一个状态实现了元胞空间对理论搜索空间的搜索.应用可归约随机矩阵的稳定性条件证明了本算法具有全局收敛性.

  1. Analytical Modeling of Uplink Cellular Networks

    CERN Document Server

    Novlan, Thomas D; Andrews, Jeffrey G

    2012-01-01

    Cellular uplink analysis has typically been undertaken by either a simple approach that lumps all interference into a single deterministic or random parameter in a Wyner-type model, or via complex system level simulations that often do not provide insight into why various trends are observed. This paper proposes a novel middle way that is both accurate and also results in easy-to-evaluate integral expressions based on the Laplace transform of the interference. We assume mobiles and base stations are randomly placed in the network with each mobile pairing up to its closest base station. The model requires two important changes compared to related recent work on the downlink. First, dependence is introduced between the user and base station point processes to make sure each base station serves a single mobile in the given resource block. Second, per-mobile power control is included, which further couples the locations of the mobiles and their receiving base stations. Nevertheless, we succeed in deriving the cov...

  2. Simulation of Group Spatial-Temporal Patterns Under Networked Geographic Space Based on Cellular Automata%网络化地理空间的元胞自动机群体时空格局仿真模型研究

    Institute of Scientific and Technical Information of China (English)

    陈建华; 涂文洋

    2016-01-01

    The correlation of geographic space has been significantly changed with the emergence of computer networks. In networked geographic spaces, network traffics that related to specific events, phenomena, or messages may lead to a particular group spatial-temporal distribution pattern when they reach a certain level. Therefore, for specific or targeted audiences, this will give rise to an unexpected result. Due to the characteristics of networked geographic space, by combining computer networks with geography, this paper built a cellular automata simulation model for networked geographic spaces. Simulation results show that:(1) there are five types of distributions for the cellular views in networked geographic spaces;(2) cellular spatial aggregation patterns exist in those spaces. The results can help us better understand the impact of information flow, which is related to specific events, phenomena, or messages, on the group spatial-temporal patterns in networked geographic spaces. They also provide the basis for analyzing the group spatial-temporal distributions of specific events.%计算机网络的出现,显著地改变了地理空间的相关性。在网络化地理空间中,相关事件、现象、消息的特定网络信息流达到一定程度时,可能引发并塑造群体的特定时空分布格局。因此,针对网络化地理空间特性,基于元胞自动机模型,构建了网络化地理空间元胞自动机仿真模型。仿真实验结果表明:(1)网络化地理空间中,元胞群体意见存在5种分布;(2)元胞在空间上呈现出聚集的时空分布格局。研究结果将有助于理解网络化地理空间中针对特定事件、现象、消息的信息流对群体时空分布格局的影响,为网络环境下特定事件、现象的群体时空分布格局分析提供依据。

  3. 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.

  4. Non-monotony and Boolean automata networks

    CERN Document Server

    Noual, Mathilde; Sené, Sylvain

    2011-01-01

    This paper aims at setting the keystone of a prospective theoretical study on the role of non-monotone interactions in biological regulation networks. Focusing on discrete models of these networks, namely, Boolean automata networks, we propose to analyse the contribution of non-monotony to the diversity and complexity in their dynamical behaviours. More precisely, in this paper, we start by detailing some motivations, both mathematical and biological, for our interest in non-monotony, and we discuss how it may account for phenomena that cannot be produced by monotony only. Then, to build some understanding in this direction, we propose some preliminary results on the dynamical behaviour of some specific non-monotone Boolean automata networks called XOR circulant networks.

  5. VERIFICATION OF PARALLEL AUTOMATA-BASED PROGRAMS

    Directory of Open Access Journals (Sweden)

    M. A. Lukin

    2014-01-01

    Full Text Available The paper deals with an interactive method of automatic verification for parallel automata-based programs. The hierarchical state machines can be implemented in different threads and can interact with each other. Verification is done by means of Spin tool and includes automatic Promela model construction, conversion of LTL-formula to Spin format and counterexamples in terms of automata. Interactive verification gives the possibility to decrease verification time and increase the maximum size of verifiable programs. Considered method supports verification of the parallel system for hierarchical automata that interact with each other through messages and shared variables. The feature of automaton model is that each state machine is considered as a new data type and can have an arbitrary bounded number of instances. Each state machine in the system can run a different state machine in a new thread or have nested state machine. This method was implemented in the developed Stater tool. Stater shows correct operation for all test cases.

  6. Minimum-Cost Reachability for Priced Timed Automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Fehnker, Ansgar; Hune, Thomas Seidelin;

    2001-01-01

    This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine the mini......This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine...... the minimum cost of executions from the initial state to the target state. This problem generalizes the minimum-time reachability problem for ordinary timed automata. We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques...... and a new notion of priced regions. The latter allows symbolic representation and manipulation of reachable states together with the cost of reaching them....

  7. 基于 C5.0决策树算法的元胞自动机的洪河湿地演化模拟%Cellular Automata Simulation Hong he Wetland Evolution Based on C5 .0 Decision Tree

    Institute of Scientific and Technical Information of China (English)

    于振华; 万鲁河

    2014-01-01

    以洪河自然保护区1992年、2001年、2010年三期TM遥感影像为数据源,利用C5.0决策树算法从已有的数据及其影响因子数据中挖掘出洪河湿地的演变规则,并将获得的转换规则应用到元胞自动机模型中进行洪河湿地演变的动态模拟与预测,分析和探讨了元胞自动机模型在湿地景观模拟和预测中的重要作用。结果表明,在现有的空间变量和条件不变的情况下,在未来的洪河自然保护区湿地面积将减小,洪河自然保护区干旱化将加重。通过对湿地景观的动态变化模拟和预测研究,能够较好地反映湿地景观的动态变化情况。%In this paper, Hong he Nature Reserve in 1992,2001,2010 three TM image as a data source.C5.0 decision tree algorithm using the data from the existing data mining and its influencing factors of the evolution of rules .Hong he Wetland and the obtained transformation rules applied to the cellular automaton model for the evolution of Hong he Wetland dynamic simulation and forecasting analysis and discussion of cellular automata in simulation and prediction of wetland landscape in an important role The results show that the existing spatial variables and conditions remain unchanged in the future Hong he Nature Reserve wetland area will be reduced . Hong he National Nature Reserve drought will increase .Through the study of the dynamic simulation and prediction of wetland land-scape, to better reflect the dynamic changes of wetland landscape .

  8. Execution spaces for simple higher dimensional automata

    DEFF Research Database (Denmark)

    Raussen, Martin

    Higher Dimensional Automata (HDA) are highly expressive models for concurrency in Computer Science, cf van Glabbeek [26]. For a topologist, they are attractive since they can be modeled as cubical complexes - with an inbuilt restriction for directions´of allowable (d-)paths. In Raussen [25], we...... applicable in greater generality. Furthermore, we take a close look at semaphore models with semaphores all of arity one. It turns out that execution spaces for these are always homotopy discrete with components representing sets of “compatible” permutations. Finally, we describe a model for the complement...

  9. A Lattice Gas Automata Model for the Coupled Heat Transfer and Chemical Reaction of Gas Flow Around and Through a Porous Circular Cylinder

    Directory of Open Access Journals (Sweden)

    Hongsheng Chen

    2015-12-01

    Full Text Available Coupled heat transfer and chemical reaction of fluid flow in complex boundaries are explored by introducing two additional properties, i.e. particle type and energy state into the Lattice gas automata (LGA Frisch–Hasslacher–Pomeau (FHP-II model. A mix-redistribute of energy and type of particles is also applied on top of collision rules to ensure randomness while maintaining the conservation of mass, momentum and energy. Simulations of heat transfer and heterogeneous reaction of gas flow passing a circular porous cylinder in a channel are presented. The effects of porosity of cylinder, gas inlet velocity, and reaction probability on the reaction process are further analyzed with respect to the characteristics of solid morphology, product concentration, and temperature profile. Numerical results indicate that the reaction rate increases with increasing reaction probability as well as gas inlet velocity. Cylinders with a higher value of porosity and more homogeneous structure also react with gas particles faster. These results agree well with the basic theories of gas–solid reactions, indicating the present model provides a method for describing gas–solid reactions in complex boundaries at mesoscopic level.

  10. Automata Learning through Counterexample Guided Abstraction Refinement

    DEFF Research Database (Denmark)

    Aarts, Fides; Heidarian, Faranak; Kuppens, Harco

    2012-01-01

    Abstraction is the key when learning behavioral models of realistic systems. Hence, in most practical applications where automata learning is used to construct models of software components, researchers manually define abstractions which, depending on the history, map a large set of concrete events...... automatically – models of several realistic software components, including the biometric passport and the SIP protocol....... are allowed. Our approach uses counterexample-guided abstraction refinement: whenever the current abstraction is too coarse and induces nondeterministic behavior, the abstraction is refined automatically. Using Tomte, a prototype tool implementing our algorithm, we have succeeded to learn – fully...

  11. 3D similar pattern generation of snow crystals with cellular automata%基于元胞自动化模型的三维雪花晶体近似模式的产生

    Institute of Scientific and Technical Information of China (English)

    李芳佳; 高尚策; 唐政; 石井雅博; 山下和也

    2009-01-01

    Computer simulation of snow crystal growing process has been done for many years. Cellular automaton is a computing model which is made from lattice cells and simple rules. Though it is a very simple model, it gives good results when used to imitate complex processes such as the life phenomenon, crystal growth and the turbulent flow. In this paper, a cellular model for 3Dimensional snow crystallization was proposed by extending the traditional 2-Dimensional cellular model. Simulation results indicated that the proposed model can accurately simulate most 3-Dimensional snow erystaUization processes.%关于雪花生长过程的计算机模拟已经受到了广泛关注.其中,元胞自动化模型是一种基于网格和简单规则的计算方法.尽管这是一种简单的模型,但其在模拟复杂过程(比如:生命现象,晶体生长和湍流)时往往能取得较好的结果.提出了一种由传统的二维模型扩展而来的三维雪花晶体生长方法.计算机模拟结果显示提出的方法能够更精确地模拟出三维雪花的晶体化过程.

  12. SEM++: A particle model of cellular growth, signaling and migration

    Science.gov (United States)

    Milde, Florian; Tauriello, Gerardo; Haberkern, Hannah; Koumoutsakos, Petros

    2014-06-01

    We present a discrete particle method to model biological processes from the sub-cellular to the inter-cellular level. Particles interact through a parametrized force field to model cell mechanical properties, cytoskeleton remodeling, growth and proliferation as well as signaling between cells. We discuss the guiding design principles for the selection of the force field and the validation of the particle model using experimental data. The proposed method is integrated into a multiscale particle framework for the simulation of biological systems.

  13. Automata theory and its applications

    CERN Document Server

    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 ...

  14. Cellular modelling using P systems and process algebra

    Institute of Scientific and Technical Information of China (English)

    Francisco J.Romero-Campero; Marian Gheorghe; Gabriel Ciobanu; John M. Auld; Mario J. Pérez-Jiménez

    2007-01-01

    In this paper various molecular chemical interactions are modelled under different computational paradigms. P systems and π-calculus are used to describe intra-cellular reactions like protein-protein interactions and gene regulation control.

  15. Modeling In Vitro Cellular Responses to Silver Nanoparticles

    Directory of Open Access Journals (Sweden)

    Dwaipayan Mukherjee

    2014-01-01

    Full Text Available Engineered nanoparticles (NPs have been widely demonstrated to induce toxic effects to various cell types. In vitro cell exposure systems have high potential for reliable, high throughput screening of nanoparticle toxicity, allowing focusing on particular pathways while excluding unwanted effects due to other cells or tissue dosimetry. The work presented here involves a detailed biologically based computational model of cellular interactions with NPs; it utilizes measurements performed in human cell culture systems in vitro, to develop a mechanistic mathematical model that can support analysis and prediction of in vivo effects of NPs. The model considers basic cellular mechanisms including proliferation, apoptosis, and production of cytokines in response to NPs. This new model is implemented for macrophages and parameterized using in vitro measurements of changes in cellular viability and mRNA levels of cytokines: TNF, IL-1b, IL-6, IL-8, and IL-10. The model includes in vitro cellular dosimetry due to nanoparticle transport and transformation. Furthermore, the model developed here optimizes the essential cellular parameters based on in vitro measurements, and provides a “stepping stone” for the development of more advanced in vivo models that will incorporate additional cellular and NP interactions.

  16. An Application of Quantum Finite Automata to Interactive Proof Systems

    CERN Document Server

    Nishimura, H; Nishimura, Harumichi; Yamakami, Tomoyuki

    2004-01-01

    Quantum finite automata have been studied intensively since their introduction in late 1990s as a natural model of a quantum computer with finite-dimensional quantum memory space. This paper seeks their direct application to interactive proof systems in which a mighty quantum prover communicates with a quantum-automaton verifier through a common communication cell. Our quantum interactive proof systems are juxtaposed to Dwork-Stockmeyer's classical interactive proof systems whose verifiers are two-way probabilistic automata. We demonstrate strengths and weaknesses of our systems and further study how various restrictions on the behaviors of quantum-automaton verifiers affect the power of quantum interactive proof systems.

  17. Mapping of cellular iron using hyperspectral fluorescence imaging in a cellular model of Parkinson's disease

    Science.gov (United States)

    Oh, Eung Seok; Heo, Chaejeong; Kim, Ji Seon; Lee, Young Hee; Kim, Jong Min

    2013-05-01

    Parkinson's disease (PD) is characterized by progressive dopaminergic cell loss in the substantianigra (SN) and elevated iron levels demonstrated by autopsy and with 7-Tesla magnetic resonance imaging. Direct visualization of iron with live imaging techniques has not yet been successful. The aim of this study is to visualize and quantify the distribution of cellular iron using an intrinsic iron hyperspectral fluorescence signal. The 1-methyl-4-phenylpyridinium (MPP+)-induced cellular model of PD was established in SHSY5Y cells. The cells were exposed to iron by treatment with ferric ammonium citrate (FAC, 100 μM) for up to 6 hours. The hyperspectral fluorescence imaging signal of iron was examined usinga high- resolution dark-field optical microscope system with signal absorption for the visible/ near infrared (VNIR) spectral range. The 6-hour group showed heavy cellular iron deposition compared with the small amount of iron accumulation in the 1-hour group. The cellular iron was dispersed in a small, particulate form, whereas extracellular iron was detected in an aggregated form. In addition, iron particles were found to be concentrated on the cell membrane/edge of shrunken cells. The cellular iron accumulation readily occurred in MPP+-induced cells, which is consistent with previous studies demonstrating elevated iron levels in the SN in PD. This direct iron imaging methodology could be applied to analyze the physiological role of iron in PD, and its application might be expanded to various neurological disorders involving other metals, such as copper, manganese or zinc.

  18. Agent-Based Modeling of Mitochondria Links Sub-Cellular Dynamics to Cellular Homeostasis and Heterogeneity

    Science.gov (United States)

    Dalmasso, Giovanni; Marin Zapata, Paula Andrea; Brady, Nathan Ryan; Hamacher-Brady, Anne

    2017-01-01

    Mitochondria are semi-autonomous organelles that supply energy for cellular biochemistry through oxidative phosphorylation. Within a cell, hundreds of mobile mitochondria undergo fusion and fission events to form a dynamic network. These morphological and mobility dynamics are essential for maintaining mitochondrial functional homeostasis, and alterations both impact and reflect cellular stress states. Mitochondrial homeostasis is further dependent on production (biogenesis) and the removal of damaged mitochondria by selective autophagy (mitophagy). While mitochondrial function, dynamics, biogenesis and mitophagy are highly-integrated processes, it is not fully understood how systemic control in the cell is established to maintain homeostasis, or respond to bioenergetic demands. Here we used agent-based modeling (ABM) to integrate molecular and imaging knowledge sets, and simulate population dynamics of mitochondria and their response to environmental energy demand. Using high-dimensional parameter searches we integrated experimentally-measured rates of mitochondrial biogenesis and mitophagy, and using sensitivity analysis we identified parameter influences on population homeostasis. By studying the dynamics of cellular subpopulations with distinct mitochondrial masses, our approach uncovered system properties of mitochondrial populations: (1) mitochondrial fusion and fission activities rapidly establish mitochondrial sub-population homeostasis, and total cellular levels of mitochondria alter fusion and fission activities and subpopulation distributions; (2) restricting the directionality of mitochondrial mobility does not alter morphology subpopulation distributions, but increases network transmission dynamics; and (3) maintaining mitochondrial mass homeostasis and responding to bioenergetic stress requires the integration of mitochondrial dynamics with the cellular bioenergetic state. Finally, (4) our model suggests sources of, and stress conditions amplifying

  19. Stochastic transition model for pedestrian dynamics

    CERN Document Server

    Schultz, Michael

    2012-01-01

    The proposed stochastic model for pedestrian dynamics is based on existing approaches using cellular automata, combined with substantial extensions, to compensate the deficiencies resulting of the discrete grid structure. This agent motion model is extended by both a grid-based path planning and mid-range agent interaction component. The stochastic model proves its capabilities for a quantitative reproduction of the characteristic shape of the common fundamental diagram of pedestrian dynamics. Moreover, effects of self-organizing behavior are successfully reproduced. The stochastic cellular automata approach is found to be adequate with respect to uncertainties in human motion patterns, a feature previously held by artificial noise terms alone.

  20. 基于HCA的拓扑优化状态场变量更新技术%Study of Updating Technology of Field Variables for Topology Optimization Based on Hybrid Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    田启华; 向晓波; 王进学

    2014-01-01

    针对连续体结构拓扑优化中的网格依赖性和灰度单元问题,基于混合元胞自动机(Hybrid Celular Automata,HCA)算法,提出了一种改进的状态场变量更新规则,以应变能最小化为优化目标,构建基于固体各向同性微惩罚结构的拓扑优化模型,通过二维经典拓扑优化算例,与已有的状态场变量更新规则的对比分析,验证了本文提出的变量更新规则的有效性和正确性.

  1. Minimal model for complex dynamics in cellular processes.

    Science.gov (United States)

    Suguna, C; Chowdhury, K K; Sinha, S

    1999-11-01

    Cellular functions are controlled and coordinated by the complex circuitry of biochemical pathways regulated by genetic and metabolic feedback processes. This paper aims to show, with the help of a minimal model of a regulated biochemical pathway, that the common nonlinearities and control structures present in biomolecular interactions are capable of eliciting a variety of functional dynamics, such as homeostasis, periodic, complex, and chaotic oscillations, including transients, that are observed in various cellular processes.

  2. 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 assumption...

  3. Algebraic Systems and Pushdown Automata

    Science.gov (United States)

    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.

  4. A cellular automaton evacuation model based on mobile robot's behaviors

    Institute of Scientific and Technical Information of China (English)

    WENG WenGuo; YUAN HongYong; FAN WeiCheng

    2007-01-01

    The research of evacuation in some emergencies, e.g. fire, is of great benefit to reducing the injuries of persons. In this paper, a cellular automaton evacuation model based on mobile robot's behaviors is presented. Each person is treated as an intelligent mobile robot, and motor schemas, including move-to-goal, avoid-obstacle, swirl-obstacle and nervous-motion, drive persons to interact with their environment. The motor schemas are combined with cellular automaton theory, and an evacuation model is built. Evacuation simulation of persons with different move velocities shows that the presented model can predict accurately the evacuation phenomena in some emergencies.

  5. Investigating the Effects of Stress Interaction Using a Cellular-automaton Based Model in Fault Networks of Varying Complexity.

    Science.gov (United States)

    Hetherington, A. P.; Steacy, S.; McCloskey, J.

    2007-12-01

    Seismicity spatial and temporal patterns are strongly influenced by stress interaction between faults. However the effects of such interaction on earthquake statistics is not yet well understood. Computer models provide accurate, large and complete datasets to investigate this issue and also have the benefit of allowing direct comparison of seismicity behavior in time and space in networks, with and without fault interaction. We investigate the effect of such interaction on modeled real-world fault networks of varying complexity using a cellular-automata based model. Each 3-D fault within the fault network is modeled by a discrete cellular automaton. The cell size is 1 km square which allows for a minimum earthquake size of approximately Mw=4. The cell strength is distributed fractally across each fault and all cells are loaded by a remote tectonic stressing rate. When the stress on a cell exceeds its strength, the cell fails and stress is transferred to its nearest neighbors which may in turn cause them to break allowing the earthquake to grow. These stress transfer rules allow realistic stress concentrations to develop at the boundary of the rupture. If the extent of the rupture exceeds a user defined minimum length, and if interaction between faults is allowed, a boundary element method is used to calculate stress transfer to neighboring faults. Here we present results from four simulated fault networks based on active faults in the San Francisco Bay Area, California, the Northern Anatolian Fault, Turkey, Southern California, and the Marlborough Fault System, South Island, New Zealand. These are chosen for their varying level of fault complexity and we examine both interacting and non-interacting models in terms of their b-value and recurrence intervals for each region. Results will be compared and discussed.

  6. A two-lane cellular automaton traffic flow model with the influence of driver, vehicle and road

    Science.gov (United States)

    Zhao, Han-Tao; Nie, Cen; Li, Jing-Ru; Wei, Yu-Ao

    2016-07-01

    On the basis of one-lane comfortable driving model, this paper established a two-lane traffic cellular automata model, which improves the slow randomization effected by brake light. Considering the driver psychological characteristics and mixed traffic, we studied the lateral influence between vehicles on adjacent lanes. Through computer simulation, the space-time diagram and the fundamental figure under different conditions are obtained. The study found that aggressive driver makes a slight congestion in low-density traffic and improves the capacity of high-density traffic, when the density exceeds 20pcu/km the more aggressive drivers the greater the flow, when the density below 40pcu/km driver character makes an effect, the more cautious driver, the lower the flow. The ratio of big cars has the same effect as the ratio of aggressive drivers. Brake lights have the greatest impact on traffic flow and when the density exceeds 10pcu/km the traffic flow fluctuates. Under periodic boundary conditions, the disturbance of road length on traffic is minimal. The lateral influence only play a limited role in the medium-density conditions, and only affect the average speed of traffic at low density.

  7. Modeling Integrated Cellular Machinery Using Hybrid Petri-Boolean Networks

    Science.gov (United States)

    Berestovsky, Natalie; Zhou, Wanding; Nagrath, Deepak; Nakhleh, Luay

    2013-01-01

    The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM) that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them using such more

  8. Modeling integrated cellular machinery using hybrid Petri-Boolean networks.

    Directory of Open Access Journals (Sweden)

    Natalie Berestovsky

    Full Text Available The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them

  9. Alternating register automata on finite words and trees

    CERN Document Server

    Figueira, Diego

    2012-01-01

    We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain. We investigate one-way automata with alternating control over data words or trees, with one register for storing data and comparing them for equality. This is a continuation of the study started by Demri, Lazic and Jurdzinski. From the standpoint of register automata models, this work aims at two objectives: (1) simplifying the existent decidability proofs for the emptiness problem for alternating register automata; and (2) exhibiting decidable extensions for these models. From the logical perspective, we show that (a) in the case of data words, satisfiability of LTL with one register and quantification over data values is decidable; and (b) the satisfiability problem for the so-called forward fragment of XPath on XML documents is decidable, even in the presence of DT...

  10. WWW Business Applications Based on the Cellular Model

    Institute of Scientific and Technical Information of China (English)

    Toshio Kodama; Tosiyasu L. Kunii; Yoichi Seki

    2008-01-01

    A cellular model based on the Incrementally Modular Abstraction Hierarchy (IMAH) is a novel model that can represent the architecture of and changes in cyberworlds, preserving invariants from a general level to a specific one. We have developed a data processing system called the Cellular Data System (CDS). In the development of business applications, you can prevent combinatorial explosion in the process of business design and testing by using CDS. In this paper, we have first designed and implemented wide-use algebra on the presentation level. Next, we have developed and verified the effectiveness of two general business applications using CDS: 1) a customer information management system, and 2) an estimate system.

  11. Model of information diffusion

    CERN Document Server

    Lande, D V

    2008-01-01

    The system of cellular automata, which expresses the process of dissemination and publication of the news among separate information resources, has been described. A bell-shaped dependence of news diffusion on internet-sources (web-sites) coheres well with a real behavior of thematic data flows, and at local time spans - with noted models, e.g., exponential and logistic ones.

  12. 基于时间自动机的CBI道岔转换时间建模与验证%Modeling and veriifcation of CBI switch transaction time based on timed automata

    Institute of Scientific and Technical Information of China (English)

    石佳

    2016-01-01

    Focusing on the problem that the safety of CBTC computer based interlocking is critical, this article introduced the theory of timed automata, analyzed the architecture and differences between CBTC computer based interlocking system and traditional interlocking system, took an example of switch transaction, switch transaction model was established by using UPPAAL. The security requirements of the model were also analyzed, which showed the feasibility and effectiveness of the modeling and veriifcation methods based on timed automata, during the process of developing computer based interlocking system.%针对CBTC计算机联锁安全性十分重要的问题,介绍时间自动机理论,分析CBTC计算机联锁系统的结构和与传统联锁系统的区别,以CBTC联锁系统的道岔转换功能为例,采用UPPAAL建立了道岔转换模型,分析模型的安全需求。表明了在联锁系统开发过程中采用基于时间自动机建模与验证的方法的可行性和有效性。

  13. A sub-cellular viscoelastic model for cell population mechanics.

    Directory of Open Access Journals (Sweden)

    Yousef Jamali

    Full Text Available Understanding the biomechanical properties and the effect of biomechanical force on epithelial cells is key to understanding how epithelial cells form uniquely shaped structures in two or three-dimensional space. Nevertheless, with the limitations and challenges posed by biological experiments at this scale, it becomes advantageous to use mathematical and 'in silico' (computational models as an alternate solution. This paper introduces a single-cell-based model representing the cross section of a typical tissue. Each cell in this model is an individual unit containing several sub-cellular elements, such as the elastic plasma membrane, enclosed viscoelastic elements that play the role of cytoskeleton, and the viscoelastic elements of the cell nucleus. The cell membrane is divided into segments where each segment (or point incorporates the cell's interaction and communication with other cells and its environment. The model is capable of simulating how cells cooperate and contribute to the overall structure and function of a particular tissue; it mimics many aspects of cellular behavior such as cell growth, division, apoptosis and polarization. The model allows for investigation of the biomechanical properties of cells, cell-cell interactions, effect of environment on cellular clusters, and how individual cells work together and contribute to the structure and function of a particular tissue. To evaluate the current approach in modeling different topologies of growing tissues in distinct biochemical conditions of the surrounding media, we model several key cellular phenomena, namely monolayer cell culture, effects of adhesion intensity, growth of epithelial cell through interaction with extra-cellular matrix (ECM, effects of a gap in the ECM, tensegrity and tissue morphogenesis and formation of hollow epithelial acini. The proposed computational model enables one to isolate the effects of biomechanical properties of individual cells and the

  14. Empirical study on entropy models of cellular manufacturing systems

    Institute of Scientific and Technical Information of China (English)

    Zhifeng Zhang; Renbin Xiao

    2009-01-01

    From the theoretical point of view,the states of manufacturing resources can be monitored and assessed through the amount of information needed to describe their technological structure and operational state.The amount of information needed to describe cellular manufacturing systems is investigated by two measures:the structural entropy and the operational entropy.Based on the Shannon entropy,the models of the structural entropy and the operational entropy of cellular manufacturing systems are developed,and the cognizance of the states of manufacturing resources is also illustrated.Scheduling is introduced to measure the entropy models of cellular manufacturing systems,and the feasible concepts of maximum schedule horizon and schedule adherence are advanced to quantitatively evaluate the effectiveness of schedules.Finally,an example is used to demonstrate the validity of the proposed methodology.

  15. A Modified Cellular Automaton Model for Traffic Flow

    Institute of Scientific and Technical Information of China (English)

    葛红霞; 董力耘; 雷丽; 戴世强

    2004-01-01

    A modified cellular automaton model for traffic flow was proposed. A novel concept about the changeable security gap was introduced and a parameter related to the variable security gap was determined. The fundamental diagram obtained by simulation shows that the maximum flow more approaches to the observed data than that of the NaSch model, indicating that the presented model is more reasonable and realistic.

  16. Modeling the desired direction in a force-based model for pedestrian dynamics

    CERN Document Server

    Chraibi, Mohcine; Schadschneider, Andreas; Seyfried, Armin

    2012-01-01

    We introduce an enhanced model based on the generalized centrifugal force model. Furthermore, the desired direction of pedestrians is investigated. A new approach leaning on the well-known concept of static and dynamic floor-fields in cellular automata is presented. Numerical results of the model are presented and compared with empirical data.

  17. Undecidable Problems About Timed Automata

    CERN Document Server

    Finkel, Olivier

    2007-01-01

    We solve some decision problems for timed automata which were recently raised by S. Tripakis in [ Folk Theorems on the Determinization and Minimization of Timed Automata, in the Proceedings of the International Workshop FORMATS'2003, LNCS, Volume 2791, p. 182-188, 2004 ] and by E. Asarin in [ Challenges in Timed Languages, From Applied Theory to Basic Theory, Bulletin of the EATCS, Volume 83, p. 106-120, 2004 ]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a timed regular language is timed regular. We show that the problem of the minimization of the number of clocks of a timed automaton is undecidable. It is also undecidable whether the shuffle of two timed regular languages is timed regular. We show that in the case of timed B\\"uchi automata accepting infinite timed words some of these problems are Pi^1_1-hard, hence highly undecidable (located beyond the arithmetical hierarchy).

  18. Algebras with actions and automata

    Directory of Open Access Journals (Sweden)

    W. Kühnel

    1982-01-01

    Full Text Available In the present paper we want to give a common structure theory of left action, group operations, R-modules and automata of different types defined over various kinds of carrier objects: sets, graphs, presheaves, sheaves, topological spaces (in particular: compactly generated Hausdorff spaces. The first section gives an axiomatic approach to algebraic structures relative to a base category B, slightly more powerful than that of monadic (tripleable functors. In section 2 we generalize Lawveres functorial semantics to many-sorted algebras over cartesian closed categories. In section 3 we treat the structures mentioned in the beginning as many-sorted algebras with fixed “scalar” or “input” object and show that they still have an algebraic (or monadic forgetful functor (theorem 3.3 and hence the general theory of algebraic structures applies. These structures were usually treated as one-sorted in the Lawvere-setting, the action being expressed by a family of unary operations indexed over the scalars. But this approach cannot, as the one developed here, describe continuity of the action (more general: the action to be a B-morphism, which is essential for the structures mentioned above, e.g. modules for a sheaf of rings or topological automata. Finally we discuss consequences of theorem 3.3 for the structure theory of various types of automata. The particular case of algebras with fixed “natural numbers object” has been studied by the authors in [23].

  19. Modeling the “learning process” of the teacher in a tutorial-like system using learning automata.

    Science.gov (United States)

    Oommen, B John; Hashem, M Khaled

    2013-12-01

    Unlike the field of tutorial systems, where a real-life student interacts and learns from a software system, our research focuses on a new philosophy in which no entity needs to be a real-life individual. Such systems are termed as tutorial-like systems, and research in this field endeavors to model every component of the system using an appropriate learning model [in our case, a learning automaton (LA)].1 While models for the student, the domain, the teacher, etc., have been presented elsewhere, the aim of this paper is to present a new approach to model how the teacher, in this paradigm, of our tutorial-like system "learns and improves his "teaching skills" while being himself an integral component of the system. We propose to model the "learning process" of the teacher by using a higher level LA, referred to as the metateacher, whose task is to assist the teacher himself. Ultimately, the intention is that the latter can communicate the teaching material to the student(s) in a manner customized to the particular student's ability and progress. In short, the teacher will infer the progress of the student and initiate a strategy by which he can "custom-communicate" the material to each individual student. The results that we present in a simulated environment validate the model for the teacher and for the metateacher. The use of the latter can be seen to significantly improve the teaching abilities of the teacher.

  20. Analytical modeling of bargaining solutions for multicast cellular services

    Directory of Open Access Journals (Sweden)

    Giuseppe Araniti

    2013-07-01

    Full Text Available Nowadays, the growing demand for group-oriented services over mobile devices has lead to the definition of new communication standards and multimedia applications in cellular systems. In this article we study the use of game theoretic solutions for these services to model and perform a trade-off analysis between fairness and efficiency in the resources allocation. More precisely, we model bargaining solutions for the multicast data services provisioning and introduce the analytical resolution for the proposed solutions.