WorldWideScience

Sample records for cellular automata approach

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

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

  3. Adaptive stochastic cellular automata: Applications

    Science.gov (United States)

    Qian, S.; Lee, Y. C.; Jones, R. D.; Barnes, C. W.; Flake, G. W.; O'Rourke, M. K.; Lee, K.; Chen, H. H.; Sun, G. Z.; Zhang, Y. Q.; Chen, D.; Giles, C. L.

    1990-09-01

    The stochastic learning cellular automata model has been applied to the problem of controlling unstable systems. Two example unstable systems studied are controlled by an adaptive stochastic cellular automata algorithm with an adaptive critic. The reinforcement learning algorithm and the architecture of the stochastic CA controller are presented. Learning to balance a single pole is discussed in detail. Balancing an inverted double pendulum highlights the power of the stochastic CA approach. The stochastic CA model is compared to conventional adaptive control and artificial neural network approaches.

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

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

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

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

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

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

  10. Two Phase Flow Simulation Using Cellular Automata

    International Nuclear Information System (INIS)

    The classical mathematical treatment of two-phase flows is based on the average of the conservation equations for each phase.In this work, a complementary approach to the modeling of these systems based on statistical population balances of aut omata sets is presented.Automata are entities defined by mathematical states that change following iterative rules representing interactions with the neighborhood.A model of automata for two-phase flow simulation is presented.This model consists of fie lds of virtual spheres that change their volumes and move around a certain environment.The model is more general than the classical cellular automata in two respects: the grid of cellular automata is dismissed in favor of a trajectory generator, and the rules of interaction involve parameters representing the actual physical interactions between phases.Automata simulation was used to study unsolved two-phase flow problems involving high heat flux rates. One system described in this work consists of a vertical channel with saturated water at normal pressure heated from the lower surface.The heater causes water to boil and starts the bubble production.We used cellular automata to describe two-phase flows and the interaction with the heater.General rule s for such cellular automata representing bubbles moving in stagnant liquid were used, with special attention to correct modeling of different mechanisms of heat transfer.The results of the model were compared to previous experiments and correlations finding good agreement.One of the most important findings is the confirmation of Kutateladze's idea about a close relation between the start of critical heat flux and a change in the flow's topology.This was analyzed using a control volume located in the upper surface of the heater.A strong decrease in the interfacial surface just before the CHF start was encountered.The automata describe quite well some characteristic parameters such as the shape of the local void fraction in the

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

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

  13. Universal map for cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    García-Morales, V., E-mail: vmorales@ph.tum.de [Institute for Advanced Study – Technische Universität München, Lichtenbergstr. 2a, D-85748 Garching (Germany)

    2012-08-20

    A universal map is derived for all deterministic 1D cellular automata (CAs) containing no freely adjustable parameters and valid for any alphabet size and any neighborhood range (including non-symmetrical neighborhoods). The map can be extended to an arbitrary number of dimensions and topologies and to arbitrary order in time. Specific CA maps for the famous Conway's Game of Life and Wolfram's 256 elementary CAs are given. An induction method for CAs, based in the universal map, allows mathematical expressions for the orbits of a wide variety of elementary CAs to be systematically derived. -- Highlights: ► A universal map is derived for all deterministic 1D cellular automata (CA). ► The map is generalized to 2D for Von Neumann, Moore and hexagonal neighborhoods. ► A map for all Wolfram's 256 elementary CAs is derived. ► A map for Conway's “Game of Life” is obtained.

  14. Modelling the role of nucleation on recrystallization kinetics: A cellular automata approach

    Science.gov (United States)

    Tripathy, Haraprasanna; Rai, Arun Kumar; Hajra, Raj Narayan; Raju, Subramanian; Saibaba, Saroja

    2016-05-01

    In present study, a two dimensional cellular automata (CA) simulation has been carried out to study the effect of nucleation mode on the kinetics of recrystallization and microstructure evolution in an austenitic stainless steel. Two different nucleation modes i.e. site saturation and continuous nucleation with interface control growth mechanism has been considered in this modified CA algorithm. The observed Avrami exponent for both nucleation modes shows a better agreement with the theoretical predicted values. The site saturated nucleation mode shows a nearly consistent value of Avrami exponent, whereas in the case of continuous nucleation the exponent shows a little variation during transformation. The simulations in the present work can be applied for the optimization of microstructure and properties in austenitic steels.

  15. A hybrid gene selection approach for microarray data classification using cellular learning automata and ant colony optimization.

    Science.gov (United States)

    Vafaee Sharbaf, Fatemeh; Mosafer, Sara; Moattar, Mohammad Hossein

    2016-06-01

    This paper proposes an approach for gene selection in microarray data. The proposed approach consists of a primary filter approach using Fisher criterion which reduces the initial genes and hence the search space and time complexity. Then, a wrapper approach which is based on cellular learning automata (CLA) optimized with ant colony method (ACO) is used to find the set of features which improve the classification accuracy. CLA is applied due to its capability to learn and model complicated relationships. The selected features from the last phase are evaluated using ROC curve and the most effective while smallest feature subset is determined. The classifiers which are evaluated in the proposed framework are K-nearest neighbor; support vector machine and naïve Bayes. The proposed approach is evaluated on 4 microarray datasets. The evaluations confirm that the proposed approach can find the smallest subset of genes while approaching the maximum accuracy. PMID:27154739

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

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

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

  19. Single spin measurement using cellular automata techniques

    CERN Document Server

    Perez-Delgado, C A; Cory, D G; Mosca, M; Cappellaro, Paola; Cory, David G.; Mosca, Michele; Perez-Delgado, Carlos A.

    2006-01-01

    We propose an approach for single spin measurement. Our method uses techniques from the theory of quantum cellular automata to correlate a large amount of ancillary spins to the one to be measured. It has the distinct advantage of being efficient, and to a certain extent fault-tolerant. Under ideal conditions, it requires the application of only order of cube root of N steps (each requiring a constant number of rf pulses) to create a system of N correlated spins. It is also fairly robust against pulse errors, imperfect initial polarization of the ancilla spin system, and does not rely on entanglement. We study the scalability of our scheme through numerical simulation.

  20. Single spin measurement using cellular automata techniques

    OpenAIRE

    Perez-Delgado, Carlos A.; Mosca, Michele; Cappellaro, Paola; Cory, David G.

    2006-01-01

    We propose an approach for single spin measurement. Our method uses techniques from the theory of quantum cellular automata to correlate a large amount of ancillary spins to the one to be measured. It has the distinct advantage of being efficient, and to a certain extent fault-tolerant. Under ideal conditions, it requires the application of only order of cube root of N steps (each requiring a constant number of rf pulses) to create a system of N correlated spins. It is also fairly robust agai...

  1. Chaotic behavior in the disorder cellular automata

    International Nuclear Information System (INIS)

    Disordered cellular automata (DCA) represent an intermediate class between elementary cellular automata and the Kauffman network. Recently, Rule 126 of DCA has been explicated: the system can be accurately described by a discrete probability function. However, a means of extending to other rules has not been developed. In this investigation, a density map of the dynamical behavior of DCA is formulated based on Rule 22 and other totalistic rules. The numerical results reveal excellent agreement between the model and original automata. Furthermore, the inhomogeneous situation is also discussed

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

  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. Astrobiological complexity with probabilistic cellular automata.

    Science.gov (United States)

    Vukotić, Branislav; Ćirković, Milan M

    2012-08-01

    The 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 the 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 space of the input parameters. We perform a simple clustering analysis of typical astrobiological histories with "Copernican" choice of input parameters and discuss the relevant boundary conditions of practical importance for planning and guiding 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 near-future space missions, we demonstrate how numerical results could offer a cautious rationale for continuation of practical SETI searches. PMID:22832998

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

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

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

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

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

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

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

  14. Cellular automata with majority rule on evolving network

    OpenAIRE

    Makowiec, Danuta

    2004-01-01

    The cellular automata discrete dynamical system is considered as the two-stage process: the majority rule for the change in the automata state and the rule for the change in topological relations between automata. The influence of changing topology to the cooperative phenomena, namely zero-temperature ferromagnetic phase transition, is observed.

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

  16. Cellular automata modelling of biomolecular networks dynamics.

    Science.gov (United States)

    Bonchev, D; Thomas, S; Apte, A; Kier, L B

    2010-01-01

    The modelling of biological systems dynamics is traditionally performed by ordinary differential equations (ODEs). When dealing with intracellular networks of genes, proteins and metabolites, however, this approach is hindered by network complexity and the lack of experimental kinetic parameters. This opened the field for other modelling techniques, such as cellular automata (CA) and agent-based modelling (ABM). This article reviews this emerging field of studies on network dynamics in molecular biology. The basics of the CA technique are discussed along with an extensive list of related software and websites. The application of CA to networks of biochemical reactions is exemplified in detail by the case studies of the mitogen-activated protein kinase (MAPK) signalling pathway, the FAS-ligand (FASL)-induced and Bcl-2-related apoptosis. The potential of the CA method to model basic pathways patterns, to identify ways to control pathway dynamics and to help in generating strategies to fight with cancer is demonstrated. The different line of CA applications presented includes the search for the best-performing network motifs, an analysis of importance for effective intracellular signalling and pathway cross-talk. PMID:20373215

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

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

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

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

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

  2. Recursive definition of global cellular-automata mappings

    DEFF Research Database (Denmark)

    Feldberg, Rasmus; Knudsen, Carsten; Rasmussen, Steen

    1994-01-01

    A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping...... as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set...

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

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

  5. Cellular-automata model of the dwarf shrubs populations and communities dynamics

    OpenAIRE

    A. S. Komarov; E. V. Zubkova; P. V. Frolov

    2015-01-01

    The probabilistic cellular-automata model of development and long-time dynamics of dwarf shrub populations and communities is developed. It is based on the concept of discrete description of the plant ontogenesis and joint model approaches in terms of probabilistic cellular automata and L-systems by Lindenmayer. Short representation of the basic model allows evaluation of the approach and software implementation. The main variables of the model are a number of partial bushes in clones or area...

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

  7. Traffic jam dynamics in stochastic cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Nagel, K. [Los Alamos National Lab., NM (United States)]|[Santa Fe Inst., NM (United States); Schreckenberg, M. [Univ. Duisburg (Germany)

    1995-09-01

    Simple models for particles hopping on a grid (cellular automata) are used to simulate (single lane) traffic flow. Despite their simplicity, these models are astonishingly realistic in reproducing start-stop-waves and realistic fundamental diagrams. One can use these models to investigate traffic phenomena near maximum flow. A so-called phase transition at average maximum flow is visible in the life-times of jams. The resulting dynamic picture is consistent with recent fluid-dynamical results by Kuehne/Kerner/Konhaeuser, and with Treiterer`s hysteresis description. This places CA models between car-following models and fluid-dynamical models for traffic flow. CA models are tested in projects in Los Alamos (USA) and in NRW (Germany) for large scale microsimulations of network traffic.

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

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

  10. Particles and Patterns in Cellular Automata

    International Nuclear Information System (INIS)

    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

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

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

  13. Modeling evolution and immune system by cellular automata

    International Nuclear Information System (INIS)

    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

  14. On reversibility of cellular automata with periodic boundary conditions

    Energy Technology Data Exchange (ETDEWEB)

    Nobe, Atsushi [Graduate School of Engineering Science, Osaka University, Machikaneyama-cho 1-3, Toyonaka, Osaka 560-8531 (Japan); Yura, Fumitaka [Imai Quantum Computing and Information Project, ERATO, JST, Daini Hongo White Bldg 201, 5-28-3 Hongo, Bunkyo, Tokyo 113-0033 (Japan)

    2004-06-04

    Reversibility of one-dimensional cellular automata with periodic boundary conditions is discussed. It is shown that there exist exactly 16 reversible elementary cellular automaton rules for infinitely many cell sizes by means of a correspondence between elementary cellular automaton and the de Bruijn graph. In addition, a sufficient condition for reversibility of three-valued and two-neighbour cellular automaton is given.

  15. Renormalization group and continuum limit of quantum cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Zimboras, Zoltan [Quantum Information Theory Group, ISI, Torino (Italy)

    2012-07-01

    We develop a renormalization group formalism for quantum cellular automata (reminiscent of the algebraic renormalization group of Buchholz and Verch). Using this formalism, we can define the continuum limit for certain automata. As a particular example, we show that the continuum limit of the so-called ''Glider Clifford cellular automaton'' is the 1+1 dimensional relativistic QFT of free Majorana fermions.

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

  17. Cellular automata modeling of cooperative eutectic growth

    Directory of Open Access Journals (Sweden)

    E. Olejnik

    2010-01-01

    Full Text Available The model and results of the 2D simulation of the cooperative growth of two phases in the lamellar eutectic are presented. The pro-posed model takes into account heat transfer, components diffusion and nonstationary concentration distribution in the liquid and solid phases, non-equlibrium nature of the phase transformation and kinetics of the growth, influence of the surface energy and interface curva-ture on the conditions of the thermodynamic equilibrium. For the determination of the phase interface shape the Cellular Automata tech-nique (CA was used. For the calculation of temperature and concentration distribution the numerical solution of the Fourier equation was used. The partial differential equations were solved by Finite Differences Method (FDM. The spatial position and cell sizes of CA lattice and FDM mesh are equal.Proposed model can predict the steady state growth with a constant interlamellar spacing in the regular plate eutectic, as well as some transient processes that bring to the changes of that parameters. Obtained simulation data show the solid-liquid interface changes result in the termination of lamella and enlargement of interlamellar spacing. Another simulation results illustrate a pocket formation in the center of one phase that forestalls nucleation (or intergrowth of the new lamellae of another phase. The data of the solidification study of the transparent material (CBr4 – 8,4% C2Cl6 obtained in the thin layer demonstrate the qualita-tive agreement of the simulation.

  18. Unstable vicinal crystal growth from cellular automata

    Science.gov (United States)

    Krasteva, A.; Popova, H.; KrzyŻewski, F.; Załuska-Kotur, M.; Tonchev, V.

    2016-03-01

    In order to study the unstable step motion on vicinal crystal surfaces we devise vicinal Cellular Automata. Each cell from the colony has value equal to its height in the vicinal, initially the steps are regularly distributed. Another array keeps the adatoms, initially distributed randomly over the surface. The growth rule defines that each adatom at right nearest neighbor position to a (multi-) step attaches to it. The update of whole colony is performed at once and then time increases. This execution of the growth rule is followed by compensation of the consumed particles and by diffusional update(s) of the adatom population. Two principal sources of instability are employed - biased diffusion and infinite inverse Ehrlich-Schwoebel barrier (iiSE). Since these factors are not opposed by step-step repulsion the formation of multi-steps is observed but in general the step bunches preserve a finite width. We monitor the developing surface patterns and quantify the observations by scaling laws with focus on the eventual transition from diffusion-limited to kinetics-limited phenomenon. The time-scaling exponent of the bunch size N is 1/2 for the case of biased diffusion and 1/3 for the case of iiSE. Additional distinction is possible based on the time-scaling exponents of the sizes of multi-step Nmulti, these are 0.36÷0.4 (for biased diffusion) and 1/4 (iiSE).

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

  20. The brittleness model of complex system based on cellular automata

    Institute of Scientific and Technical Information of China (English)

    LIN De-ming; JIN Hong-zhang; LI Qi; WU Hong-mei

    2004-01-01

    Now the research on the complex system is a hot spot. Brittleness is one of the basic characteristics of a complex system. In a complex system, after one of subsystems is struck to be collapsed, the whole system will collapse. Meanwhile, cellular automata is a discrete dynamic system. When the rule is given, the cellular automata could be defined. Then it can imitate the complex action. Cellular automata is used to simulate the brittleness action in this study. Entropy was used to analyze the action and get the rule. Then,three normal brittleness models were given. The result shows that the brittleness of complex system is existent and in addition some important behavior mode of complex system brittleness has been achieved.

  1. Lattice gas cellular automata and lattice Boltzmann models an introduction

    CERN Document Server

    Wolf-Gladrow, Dieter A

    2000-01-01

    Lattice-gas cellular automata (LGCA) and lattice Boltzmann models (LBM) are relatively new and promising methods for the numerical solution of nonlinear partial differential equations. The book provides an introduction for graduate students and researchers. Working knowledge of calculus is required and experience in PDEs and fluid dynamics is recommended. Some peculiarities of cellular automata are outlined in Chapter 2. The properties of various LGCA and special coding techniques are discussed in Chapter 3. Concepts from statistical mechanics (Chapter 4) provide the necessary theoretical background for LGCA and LBM. The properties of lattice Boltzmann models and a method for their construction are presented in Chapter 5.

  2. Cellular automata simulation of traffic including cars and bicycles

    Science.gov (United States)

    Vasic, Jelena; Ruskin, Heather J.

    2012-04-01

    As 'greening' of all aspects of human activity becomes mainstream, transportation science is also increasingly focused around sustainability. Modal co-existence between motorised and non-motorised traffic on urban networks is, in this context, of particular interest for traffic flow modelling. The main modelling problems here are posed by the heterogeneity of vehicles, including size and dynamics, and by the complex interactions at intersections. Herein we address these with a novel technique, based on one-dimensional cellular automata components, for modelling network infrastructure and its occupancy by vehicles. We use this modelling approach, together with a corresponding vehicle behaviour model, to simulate combined car and bicycle traffic for two elemental scenarios-examples of components that would be used in the building of an arbitrary network. Results of simulations performed on these scenarios, (i) a stretch of road and (ii) an intersection causing conflict between cars and bicycles sharing a lane, are presented and analysed.

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

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

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

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

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

  8. Quantum dot spin cellular automata for realizing a quantum processor

    International Nuclear Information System (INIS)

    We show how single quantum dots, each hosting a singlet–triplet qubit, can be placed in arrays to build a spin quantum cellular automaton. A fast (∼10 ns) deterministic coherent singlet–triplet filtering, as opposed to current incoherent tunneling/slow-adiabatic based quantum gates (operation time ∼300 ns), can be employed to produce a two-qubit gate through capacitive (electrostatic) couplings that can operate over significant distances. This is the coherent version of the widely discussed charge and nano-magnet cellular automata, and would increase speed, reduce dissipation, and perform quantum computation while interfacing smoothly with its classical counterpart. This combines the best of two worlds—the coherence of spin pairs known from quantum technologies, and the strength and range of electrostatic couplings from the charge-based classical cellular automata. Significantly our system has zero electric dipole moment during the whole operation process, thereby increasing its charge dephasing time. (paper)

  9. Neural networks and cellular automata in experimental high energy physics

    International Nuclear Information System (INIS)

    Within the past few years, two novel computing techniques, cellular automata and neural networks, have shown considerable promise in the solution of problems of a very high degree of complexity, such as turbulent fluid flow, image processing, and pattern recognition. Many of the problems faced in experimental high energy physics are also of this nature. Track reconstruction in wire chambers and cluster finding in cellular calorimeters, for instance, involve pattern recognition and high combinatorial complexity since many combinations of hits or cells must be considered in order to arrive at the final tracks or clusters. Here we examine in what way connective network methods can be applied to some of the problems of experimental high physics. It is found that such problems as track and cluster finding adapt naturally to these approaches. When large scale hardwired connective networks become available, it will be possible to realize solutions to such problems in a fraction of the time required by traditional methods. For certain types of problems, faster solutions are already possible using model networks implemented on vector or other massively parallel machines. It should also be possible, using existing technology, to build simplified networks that will allow detailed reconstructed event information to be used in fast trigger decisions

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

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

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

  13. Feedback Shift Registers as Cellular Automata Boundary Conditions

    OpenAIRE

    Salman, K.

    2013-01-01

    We present a new design for random number generatio n. The outputs of linear feedback shift registers (LFSRs) act as continuous inputs to the t wo boundaries of a one-dimensional (1-D) Elementary Cellular Automata (ECA). The results sho w superior randomness features and the output string has passed the Diehard statistical ba ttery of tests. The design is good candidate for parallel random number generation, ...

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

  15. Evolution of Cellular Automata using Lindenmayer Systems and Fourier Transforms

    OpenAIRE

    Berg, Sivert

    2013-01-01

    Cellular automata (CAs) are a class of highly parallel computing systems consisting of many simple computing elements called cells. The cells can only communicate with neighboring cells, meaning there is no global communication in the system. Programming such a system to solve complex problems can be a daunting task, and indirect methods are often applied to make it easier. In this thesis we use evolutionary algorithms (EAs) to evolve CAs. We also look at the possibility of employing L-system...

  16. Improving Quality of Clustering using Cellular Automata for Information retrieval

    Directory of Open Access Journals (Sweden)

    P. K. Sree

    2008-01-01

    Full Text Available Clustering has been widely applied to Information Retrieval (IR on the grounds of its potential improved effectiveness over inverted file search. Clustering is a mostly unsupervised procedure and the majority of the clustering algorithms depend on certain assumptions in order to define the subgroups present in a data set .A clustering quality measure is a function that, given a data set and its partition into clusters, returns a non-negative real number representing the quality of that clustering. Moreover, they may behave in a different way depending on the features of the data set and their input parameters values. Therefore, in most applications the resulting clustering scheme requires some sort of evaluation as regards its validity. The quality of clustering can be enhanced by using a Cellular Automata Classifier for information retrieval. In this study we take the view that if cellular automata with clustering is applied to search results (query-specific clustering, then it has the potential to increase the retrieval effectiveness compared both to that of static clustering and of conventional inverted file search. We conducted a number of experiments using ten document collections and eight hierarchic clustering methods. Our results show that the effectiveness of query-specific clustering with cellular automata is indeed higher and suggest that there is scope for its application to IR.

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

  18. 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. PMID:25153671

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

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

  1. The Consensus Problem, Cellular Automata, and Self- replicating Structures

    OpenAIRE

    Griffin, David

    2016-01-01

    Over The course of the last four years I have researched the consensus problem. I have done so by studying how cellular automata following the 2DGKL rule are able to reach consensus in a verity of ways. There are only certain structures that can form within a network, and these structures can be described and examined directly from the rules that make them up. I have also explored a variety of methods to study the rule including, graph theory and liner algebra representations of the cellular ...

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

  3. Cellular Automata Rules and Linear Numbers

    OpenAIRE

    Nayak, Birendra Kumar; Sahoo, Sudhakar; Biswal, Sagarika

    2012-01-01

    In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers associated with linear CA rules are defined as linear numbers and the properties of these linear numbers are studied.

  4. Multigrid Implementation of Cellular Automata for Topology Optimisation of Continuum Structures with Design Dependent loads

    OpenAIRE

    Zakhama, R.

    2009-01-01

    Topology optimisation of continuum structures has become mature enough to be often applied in industry and continues to attract the attention of researchers and software companies in various engineering fields. Traditionally, most available algorithms for solving topology optimisation problems are based on the global solution approach and require a large number of costly analyses. An alternative methodology, based on cellular automata (CA) and accelerated with a multigrid discretisation schem...

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

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

  7. Cellular automata model of magnetospheric-ionospheric coupling

    OpenAIRE

    Kozelov, B. V.; Kozelova, T. V.

    2003-01-01

    We propose a cellular automata model (CAM) to describe the substorm activity of the magnetospheric-ionospheric system. The state of each cell in the model is described by two numbers that correspond to the energy content in a region of the current sheet in the magnetospheric tail and to the conductivity of the ionospheric domain that is magnetically connected with this region. The driving force of the system is supposed to be provided by the solar wind that is convected along the two b...

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

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

  10. Do integrable cellular automata have the confinement property?

    Energy Technology Data Exchange (ETDEWEB)

    Grammaticos, B. [IMNC, Universite Paris VII-Paris XI, CNRS, UMR 8165, Bat. 104, 91406 Orsay (France); Ramani, A. [Centre de Physique Theorique, Ecole Polytechnique, CNRS, 91128 Palaiseau (France); Tamizhmani, K.M. [Departement of Mathematics, Pondicherry University, Kalapet, 605014 Puducherry (India); Tamizhmani, T. [Department of Mathematics, Kanchi Mamunivar Centre for Postgraduate Studies, Puducherry (India); Carstea, A.S. [Department of Theoretical Physics, Institute of Physics and Nuclear Engineering, 407 Atomistilor, Magurele, 077125 Bucharest (Romania)

    2007-07-27

    We analyse a criterion, introduced by Joshi and Lafortune, for the integrability of cellular automata obtained from discrete systems through the ultradiscretization procedure. We show that while this criterion can be used in order to single out integrable ultradiscrete systems, there do exist cases where the system is nonintegrable and still the criterion is satisfied. Conversely we show that for ultradiscrete systems that are derived from linearizable mappings the criterion is not satisfied. We investigate this phenomenon further in the case of a mapping which includes a linearizable subcase and show how the violation of the criterion comes to be. Finally, we comment on the growth properties of ultradiscrete systems. (fast track communication)

  11. Do integrable cellular automata have the confinement property?

    International Nuclear Information System (INIS)

    We analyse a criterion, introduced by Joshi and Lafortune, for the integrability of cellular automata obtained from discrete systems through the ultradiscretization procedure. We show that while this criterion can be used in order to single out integrable ultradiscrete systems, there do exist cases where the system is nonintegrable and still the criterion is satisfied. Conversely we show that for ultradiscrete systems that are derived from linearizable mappings the criterion is not satisfied. We investigate this phenomenon further in the case of a mapping which includes a linearizable subcase and show how the violation of the criterion comes to be. Finally, we comment on the growth properties of ultradiscrete systems. (fast track communication)

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

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

  14. Cellular automata for traffic flow simulation with safety embedded notions

    OpenAIRE

    Larraga, M. E.; Alvarez-Icaza, L.

    2007-01-01

    In this paper a cellular automata model for one-lane traffic flow is presented. A new set of rules is proposed to better capture driver reactions to traffic that are intended to preserve safety on the highway. As a result, drivers behavior is derived from an analysis that determines the most appropriate action for a vehicle based on the distance from the vehicle ahead of it and the velocities of the two neighbor vehicles. The model preserves simplicity of CA rules and at the same time makes t...

  15. Validating Cellular Automata Lava Flow Emplacement Algorithms with Standard Benchmarks

    Science.gov (United States)

    Richardson, J. A.; Connor, L.; Charbonnier, S. J.; Connor, C.; Gallant, E.

    2015-12-01

    A major existing need in assessing lava flow simulators is a common set of validation benchmark tests. We propose three levels of benchmarks which test model output against increasingly complex standards. First, imulated lava flows should be morphologically identical, given changes in parameter space that should be inconsequential, such as slope direction. Second, lava flows simulated in simple parameter spaces can be tested against analytical solutions or empirical relationships seen in Bingham fluids. For instance, a lava flow simulated on a flat surface should produce a circular outline. Third, lava flows simulated over real world topography can be compared to recent real world lava flows, such as those at Tolbachik, Russia, and Fogo, Cape Verde. Success or failure of emplacement algorithms in these validation benchmarks can be determined using a Bayesian approach, which directly tests the ability of an emplacement algorithm to correctly forecast lava inundation. Here we focus on two posterior metrics, P(A|B) and P(¬A|¬B), which describe the positive and negative predictive value of flow algorithms. This is an improvement on less direct statistics such as model sensitivity and the Jaccard fitness coefficient. We have performed these validation benchmarks on a new, modular lava flow emplacement simulator that we have developed. This simulator, which we call MOLASSES, follows a Cellular Automata (CA) method. The code is developed in several interchangeable modules, which enables quick modification of the distribution algorithm from cell locations to their neighbors. By assessing several different distribution schemes with the benchmark tests, we have improved the performance of MOLASSES to correctly match early stages of the 2012-3 Tolbachik Flow, Kamchakta Russia, to 80%. We also can evaluate model performance given uncertain input parameters using a Monte Carlo setup. This illuminates sensitivity to model uncertainty.

  16. Modeling chemical systems using cellular automata a textbook and laboratory manual

    CERN Document Server

    Kier, Lemont B; Cheng, Chao-Kun

    2006-01-01

    Provides a practical introduction to an exciting modeling paradigm for complex systems. This book discusses the nature of scientific inquiry using models and simulations, and describes the nature of cellular automata models. It gives descriptions of how cellular automata models can be used in the study of a variety of phenomena.

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

  18. From deterministic cellular automata to coupled map lattices

    Science.gov (United States)

    García-Morales, Vladimir

    2016-07-01

    A general mathematical method is presented for the systematic construction of coupled map lattices (CMLs) out of deterministic cellular automata (CAs). The entire CA rule space is addressed by means of a universal map for CAs that we have recently derived and that is not dependent on any freely adjustable parameters. The CMLs thus constructed are termed real-valued deterministic cellular automata (RDCA) and encompass all deterministic CAs in rule space in the asymptotic limit κ \\to 0 of a continuous parameter κ. Thus, RDCAs generalize CAs in such a way that they constitute CMLs when κ is finite and nonvanishing. In the limit κ \\to ∞ all RDCAs are shown to exhibit a global homogeneous fixed-point that attracts all initial conditions. A new bifurcation is discovered for RDCAs and its location is exactly determined from the linear stability analysis of the global quiescent state. In this bifurcation, fuzziness gradually begins to intrude in a purely deterministic CA-like dynamics. The mathematical method presented allows to get insight in some highly nontrivial behavior found after the bifurcation.

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

  20. Simulation of root forms using cellular automata model

    International Nuclear Information System (INIS)

    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

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

  2. Lorentz symmetry for 3d Quantum Cellular Automata

    CERN Document Server

    Bisio, Alessandro; Perinotti, Paolo

    2015-01-01

    We introduce a definition of Lorentz transformations in the framework of quantum cellular automata. Our definition does not require space-time, and retains the usual interpretation in the emergent one. The definition is group theoretical, with flatness of space-time corresponding to Abelianity of the cellular automaton group. We consider the covariance in the case of the Weyl automaton. The notion of particle as Poincar\\'e irreducible representation survives at all scales. The interpolation of the Lorentz symmetry from the discrete to the continuum scale occurs through a nonlinear representation. We also discuss the connection of the nonlinear Lorentz transformations with the Poincar\\'e and k-Poincar\\'e Hopf algebra, the emerging non-commutative space-time, and the deformed Heisenberg commutation relations.

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

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

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

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

  8. An Asynchronous Cellular Automata-Based Adaptive Illumination Facility

    Science.gov (United States)

    Bandini, Stefania; Bonomi, Andrea; Vizzari, Giuseppe; Acconci, Vito

    The term Ambient Intelligence refers to electronic environments that are sensitive and responsive to the presence of people; in the described scenario the environment itself is endowed with a set of sensors (to perceive humans or other physical entities such as dogs, bicycles, etc.), interacting with a set of actuators (lights) that choose their actions (i.e. state of illumination) in an attempt improve the overall experience of these users. The model for the interaction and action of sensors and actuators is an asynchronous Cellular Automata (CA) with memory, supporting a self-organization of the system as a response to the presence and movements of people inside it. The paper will introduce the model, as well as an ad hoc user interface for the specification of the relevant parameters of the CA transition rule that determines the overall system behaviour.

  9. Evolving localizations in reaction-diffusion cellular automata

    CERN Document Server

    Adamatzky, Andrew; Collet, Pierre; Sapin, Emmanuel

    2007-01-01

    We consider hexagonal cellular automata with immediate cell neighbourhood and three cell-states. Every cell calculates its next state depending on the integral representation of states in its neighbourhood, i.e. how many neighbours are in each one state. We employ evolutionary algorithms to breed local transition functions that support mobile localizations (gliders), and characterize sets of the functions selected in terms of quasi-chemical systems. Analysis of the set of functions evolved allows to speculate that mobile localizations are likely to emerge in the quasi-chemical systems with limited diffusion of one reagent, a small number of molecules is required for amplification of travelling localizations, and reactions leading to stationary localizations involve relatively equal amount of quasi-chemical species. Techniques developed can be applied in cascading signals in nature-inspired spatially extended computing devices, and phenomenological studies and classification of non-linear discrete systems.

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

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

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

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

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

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

  17. Cellular Automata-Based Parallel Random Number Generators Using FPGAs

    Directory of Open Access Journals (Sweden)

    David H. K. Hoe

    2012-01-01

    Full Text Available Cellular computing represents a new paradigm for implementing high-speed massively parallel machines. Cellular automata (CA, which consist of an array of locally connected processing elements, are a basic form of a cellular-based architecture. The use of field programmable gate arrays (FPGAs for implementing CA accelerators has shown promising results. This paper investigates the design of CA-based pseudo-random number generators (PRNGs using an FPGA platform. To improve the quality of the random numbers that are generated, the basic CA structure is enhanced in two ways. First, the addition of a superrule to each CA cell is considered. The resulting self-programmable CA (SPCA uses the superrule to determine when to make a dynamic rule change in each CA cell. The superrule takes its inputs from neighboring cells and can be considered itself a second CA working in parallel with the main CA. When implemented on an FPGA, the use of lookup tables in each logic cell removes any restrictions on how the super-rules should be defined. Second, a hybrid configuration is formed by combining a CA with a linear feedback shift register (LFSR. This is advantageous for FPGA designs due to the compactness of the LFSR implementations. A standard software package for statistically evaluating the quality of random number sequences known as Diehard is used to validate the results. Both the SPCA and the hybrid CA/LFSR were found to pass all the Diehard tests.

  18. Cellular Automata as a learning process in Architecture and Urban design

    DEFF Research Database (Denmark)

    Jensen, Mads Brath; Foged, Isak Worre

    2014-01-01

    . An architectural methodological response to this situation is presented through the development of a conceptual computational design system that allows these dynamics to unfold and to be observed for architectural design decision taking. Reflecting on the development and implementation of a cellular automata based...... design approach on a master level urban design studio this paper will discuss the strategies for dealing with complexity at an urban scale as well as the pedagogical considerations behind applying computational tools and methods to a urban design education....

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

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

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

  2. Critical Behavior in Cellular Automata Animal Disease Transmission Model

    Science.gov (United States)

    Morley, P. D.; Chang, Julius

    Using 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 in a farm, there is mandatory slaughter (culling) of all livestock in an infected premise (IP). Those farms in the neighboring of 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 interactions 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 nonlocal disease transport probability can be as low as 0.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 fission cascade. Finally, we calculate that the percentage of culled animals that are actually healthy is ≈30%.

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

  4. A cellular automata-based mathematical model for thymocyte development.

    Directory of Open Access Journals (Sweden)

    Hallan Souza-e-Silva

    Full Text Available Intrathymic T cell development is an important process necessary for the normal formation of cell-mediated immune responses. Importantly, such a process depends on interactions of developing thymocytes with cellular and extracellular elements of the thymic microenvironment. Additionally, it includes a series of oriented and tunely regulated migration events, ultimately allowing mature cells to cross endothelial barriers and leave the organ. Herein we built a cellular automata-based mathematical model for thymocyte migration and development. The rules comprised in this model take into account the main stages of thymocyte development, two-dimensional sections of the normal thymic microenvironmental network, as well as the chemokines involved in intrathymic cell migration. Parameters of our computer simulations with further adjusted to results derived from previous experimental data using sub-lethally irradiated mice, in which thymus recovery can be evaluated. The model fitted with the increasing numbers of each CD4/CD8-defined thymocyte subset. It was further validated since it fitted with the times of permanence experimentally ascertained in each CD4/CD8-defined differentiation stage. Importantly, correlations using the whole mean volume of young normal adult mice revealed that the numbers of cells generated in silico with the mathematical model fall within the range of total thymocyte numbers seen in these animals. Furthermore, simulations made with a human thymic epithelial network using the same mathematical model generated similar profiles for temporal evolution of thymocyte developmental stages. Lastly, we provided in silico evidence that the thymus architecture is important in the thymocyte development, since changes in the epithelial network result in different theoretical profiles for T cell development/migration. This model likely can be used to predict thymocyte evolution following therapeutic strategies designed for recovery of the

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

  6. Fuel management optimization based on power profile by Cellular Automata

    International Nuclear Information System (INIS)

    Fuel management in PWR nuclear reactors is comprised of a collection of principles and practices required for the planning, scheduling, refueling, and safe operation of nuclear power plants to minimize the total plant and system energy costs to the extent possible. Despite remarkable advancements in optimization procedures, inherent complexities in nuclear reactor structure and strong inter-dependency among the fundamental parameters of the core make it necessary to evaluate the most efficient arrangement of the core. Several patterns have been presented so far to determine the best configuration of fuels in the reactor core by emphasis on minimizing the local power peaking factor (Pq). In this research, a new strategy for optimizing the fuel arrangements in a VVER-1000 reactor core is developed while lowering the Pq is considered as the main target. For this purpose, a Fuel Quality Factor, Z(r), served to depict the reactor core pattern. Mapping to ideal pattern is tracked over the optimization procedure in which the ideal pattern is prepared with considering the Z(r) constraints and their effects on flux and Pq uniformity. For finding the best configuration corresponding to the desired pattern, Cellular Automata (CA) is applied as a powerful and reliable tool on optimization procedure. To obtain the Z(r) constraints, the MCNP code was used and core calculations were performed by WIMS and CITATION codes. The results are compared with the predictions of a Neural Network as a smart optimization method, and the Final Safety Analysis Report (FSAR) as a reference proposed by the designer.

  7. Effect of asynchronous updating on the stability of cellular automata

    International Nuclear Information System (INIS)

    Highlights: ► An upper bound on the Lyapunov exponent of asynchronously updated CA is established. ► The employed update method has repercussions on the stability of CAs. ► A decision on the employed update method should be taken with care. ► Substantial discrepancies arise between synchronously and asynchronously updated CA. ► Discrepancies between different asynchronous update schemes are less pronounced. - Abstract: Although cellular automata (CAs) were conceptualized as utter discrete mathematical models in which the states of all their spatial entities are updated simultaneously at every consecutive time step, i.e. synchronously, various CA-based models that rely on so-called asynchronous update methods have been constructed in order to overcome the limitations that are tied up with the classical way of evolving CAs. So far, only a few researchers have addressed the consequences of this way of updating on the evolved spatio-temporal patterns, and the reachable stationary states. In this paper, we exploit Lyapunov exponents to determine to what extent the stability of the rules within a family of totalistic CAs is affected by the underlying update method. For that purpose, we derive an upper bound on the maximum Lyapunov exponent of asynchronously iterated CAs, and show its validity, after which we present a comparative study between the Lyapunov exponents obtained for five different update methods, namely one synchronous method and four well-established asynchronous methods. It is found that the stability of CAs is seriously affected if one of the latter methods is employed, whereas the discrepancies arising between the different asynchronous methods are far less pronounced and, finally, we discuss the repercussions of our findings on the development of CA-based models.

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

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

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

  11. Is there a sharp phase transition for deterministic cellular automata

    Energy Technology Data Exchange (ETDEWEB)

    Wootters, W.K. (Santa Fe Inst., NM (USA) Los Alamos National Lab., NM (USA) Williams Coll., Williamstown, MA (USA). Dept. of Physics); Langton, C.G. (Los Alamos National Lab., NM (USA))

    1990-01-01

    Previous work has suggested that there is a kind of phase transition between deterministic automata exhibiting periodic behavior and those exhibiting chaotic behavior. However, unlike the usual phase transitions of physics, this transition takes place over a range of values of the parameter rather than at a specific value. The present paper asks whether the transition can be made sharp, either by taking the limit of an infinitely large rule table, or by changing the parameter in terms of which the space of automata is explored. We find strong evidence that, for the class of automata we consider, the transition does become sharp in the limit of an infinite number of symbols, the size of the neighborhood being held fixed. Our work also suggests an alternative parameter in terms of which it is likely that the transition will become fairly sharp even if one does not increase the number of symbols. In the course of our analysis, we find that mean field theory, which is our main tool, gives surprisingly good predictions of the statistical properties of the class of automata we consider. 18 refs., 6 figs.

  12. Is there a sharp phase transition for deterministic cellular automata?

    International Nuclear Information System (INIS)

    Previous work has suggested that there is a kind of phase transition between deterministic automata exhibiting periodic behavior and those exhibiting chaotic behavior. However, unlike the usual phase transitions of physics, this transition takes place over a range of values of the parameter rather than at a specific value. The present paper asks whether the transition can be made sharp, either by taking the limit of an infinitely large rule table, or by changing the parameter in terms of which the space of automata is explored. We find strong evidence that, for the class of automata we consider, the transition does become sharp in the limit of an infinite number of symbols, the size of the neighborhood being held fixed. Our work also suggests an alternative parameter in terms of which it is likely that the transition will become fairly sharp even if one does not increase the number of symbols. In the course of our analysis, we find that mean field theory, which is our main tool, gives surprisingly good predictions of the statistical properties of the class of automata we consider. 18 refs., 6 figs

  13. A Cellular Automata Model for the Study of Landslides

    Science.gov (United States)

    Liucci, Luisa; Suteanu, Cristian; Melelli, Laura

    2016-04-01

    Power-law scaling has been observed in the frequency distribution of landslide sizes in many regions of the world, for landslides triggered by different factors, and in both multi-temporal and post-event datasets, thus indicating the universal character of this property of landslides and suggesting that the same mechanisms drive the dynamics of mass wasting processes. The reasons for the scaling behavior of landslide sizes are widely debated, since their understanding would improve our knowledge of the spatial and temporal evolution of this phenomenon. Self-Organized Critical (SOC) dynamics and the key role of topography have been suggested as possible explanations. The scaling exponent of the landslide size-frequency distribution defines the probability of landslide magnitudes and it thus represents an important parameter for hazard assessment. Therefore, another - still unanswered - important question concerns the factors on which its value depends. This paper investigates these issues using a Cellular Automata (CA) model. The CA uses a real topographic surface acquired from a Digital Elevation Model to represent the initial state of the system, where the states of cells are defined in terms of altitude. The stability criterion is based on the slope gradient. The system is driven to instability through a temporal decrease of the stability condition of cells, which may be thought of as representing the temporal weakening of soil caused by factors like rainfall. A transition rule defines the way in which instabilities lead to discharge from unstable cells to the neighboring cells, deciding upon the landslide direction and the quantity of mass involved. Both the direction and the transferred mass depend on the local topographic features. The scaling properties of the area-frequency distributions of the resulting landslide series are investigated for several rates of weakening and for different time windows, in order to explore the response of the system to model

  14. Cellular automata model of magnetospheric-ionospheric coupling

    Directory of Open Access Journals (Sweden)

    B. V. Kozelov

    Full Text Available We propose a cellular automata model (CAM to describe the substorm activity of the magnetospheric-ionospheric system. The state of each cell in the model is described by two numbers that correspond to the energy content in a region of the current sheet in the magnetospheric tail and to the conductivity of the ionospheric domain that is magnetically connected with this region. The driving force of the system is supposed to be provided by the solar wind that is convected along the two boundaries of the system. The energy flux inside is ensured by the penetration of the energy from the solar wind into the array of cells (magnetospheric tail with a finite velocity. The third boundary (near to the Earth is closed and the fourth boundary is opened, thereby modeling the flux far away from the tail. The energy dissipation in the system is quite similar to other CAM models, when the energy in a particular cell exceeds some pre-defined threshold, and the part of the energy excess is redistributed between the neighbouring cells. The second number attributed to each cell mimics ionospheric conductivity that can allow for a part of the energy to be shed on field-aligned currents. The feedback between "ionosphere" and "magnetospheric tail" is provided by the change in a part of the energy, which is redistributed in the tail when the threshold is surpassed. The control parameter of the model is the z-component of the interplanetary magnetic field (Bz IMF, "frozen" into the solar wind. To study the internal dynamics of the system at the beginning, this control parameter is taken to be constant. The dynamics of the system undergoes several bifurcations, when the constant varies from - 0.6 to - 6.0. The Bz IMF input results in the periodic transients (activation regions and the inter-transient period decreases with the decrease of Bz. At the same time the onset of activations in the array shifts towards the "Earth". When the modulus of the Bz IMF exceeds some

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

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

  17. A comparative analysis of electronic and molecular quantum dot cellular automata

    Science.gov (United States)

    Umamahesvari, H.; Ajitha, D.

    2015-06-01

    This paper presents a comparative analysis of electronic quantum-dot cellular automata (EQCA) and Magnetic quantum dot Cellular Automata (MQCA). QCA is a computing paradigm that encodes and processes information by the position of individual electrons. To enhance the high dense and ultra-low power devices, various researches have been actively carried out to find an alternative way to continue and follow Moore's law, so called "beyond CMOS technology". There have been several proposals for physically implementing QCA, EQCA and MQCA are the two important QCAs reported so far. This paper provides a comparative study on these two QCAs

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

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

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

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

  2. 基于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环境下建立了仿真算例模拟微电网格局的时空动态演化过程.仿真结果验证了该方法对于微电网格局计算以及模拟微电网格局时空动态演化过程的可行性和有效性.

  3. Cellular-automata model of the dwarf shrubs populations and communities dynamics

    Directory of Open Access Journals (Sweden)

    A. S. Komarov

    2015-06-01

    Full Text Available The probabilistic cellular-automata model of development and long-time dynamics of dwarf shrub populations and communities is developed. It is based on the concept of discrete description of the plant ontogenesis and joint model approaches in terms of probabilistic cellular automata and L-systems by Lindenmayer. Short representation of the basic model allows evaluation of the approach and software implementation. The main variables of the model are a number of partial bushes in clones or area projective cover. The model allows us to investigate the conditions of self-maintenance and sustainability population under different environmental conditions (inaccessibility of the territory for settlement, mosaic moisture conditions of soil and wealth. The model provides a forecast of the total biomass dynamics shrubs and their fractions (stems, leaves, roots, fine roots, fruits on the basis of the data obtained in the discrete description of ontogenesis and further information on the productivity of the plant fractions. The inclusion of the joint dynamics of biomass of shrubs and soil in EFIMOD models cycle of carbon and nitrogen to evaluate the role of shrubs in these circulations, especially at high impact, such as forest fires and clear cutting, allow forecasting of the dynamics of populations and ecosystem functions of shrubs (regulation of biogeochemical cycles maintaining biodiversity, participation in the creation of non-wood products with changing climatic conditions and strong damaging effects (logging, fires; and application of the models developed to investigate the stability and productivity of shrubs and their participation in the cycle of carbon and nitrogen in different climatic and edaphic conditions.

  4. The Research of Image Encryption Algorithm Based on Chaos Cellular Automata

    OpenAIRE

    Shuiping Zhang; Huijune Luo

    2012-01-01

    The Research presents an image encryption algorithm which bases on chaotic cellular automata. This algorithm makes use of features that extreme sensitivity of chaotic system to initial conditions, the cellular automaton with a high degree of parallel processing. The encryption algorithm uses two-dimensional chaotic system to Encrypt image, Then establish a cellular automaton model on the initial encrypted image. Encryption key of this algorithm is made up of the initial value by the two-dimen...

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

  6. Self-Learning Cellular Automata for Forecasting Precipitation from Radar Images

    NARCIS (Netherlands)

    Li, H.; Corzo Perez, G.A.; Martinez, C.A.; Mynett, A.E.

    2013-01-01

    This paper presents a new forecasting methodology that uses self-learning cellular automata (SLCA) for including variables that consider the spatial dynamics of the mass of precipitation in a radar forecast model. Because the meteorological conditions involve nonlinear dynamic behavior, an automatic

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

  8. Integration of logistic regression, Markov chain and cellular automata models to simulate urban expansion

    NARCIS (Netherlands)

    Jokar Arsanjani, J.; Helbich, M.; Kainz, W.; Boloorani, A.

    2013-01-01

    This research analyses the suburban expansion in the metropolitan area of Tehran, Iran. A hybrid model consisting of logistic regression model, Markov chain (MC), and cellular automata (CA) was designed to improve the performance of the standard logistic regression model. Environmental and socio-eco

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

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

  11. An application of lattice-gas cellular automata to the study of Brownian motion

    NARCIS (Netherlands)

    Ladd, A.J.C.; Frenkel, D.; Colvin, M.E.

    1988-01-01

    An adaptation of lattice-gas cellular automata to the simulation of solid-fluid suspensions is described. The method incorporates both dissipative hydrodynamic forces and thermal fluctuations. At low solid densities, theoretical results for the drag force on a single disk and the viscosity of a susp

  12. The Research of Image Encryption Algorithm Based on Chaos Cellular Automata

    Directory of Open Access Journals (Sweden)

    Shuiping Zhang

    2012-02-01

    Full Text Available The Research presents an image encryption algorithm which bases on chaotic cellular automata. This algorithm makes use of features that extreme sensitivity of chaotic system to initial conditions, the cellular automaton with a high degree of parallel processing. The encryption algorithm uses two-dimensional chaotic system to Encrypt image, Then establish a cellular automaton model on the initial encrypted image. Encryption key of this algorithm is made up of the initial value by the two-dimensional chaotic systems, parameters, two-dimensional cellular automata local evolution rules f and iterations n. Experimental results shows that the algorithm has features that high efficiency, better security, sensitivity to the key and so on.

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

  14. 元胞自动机可逆性研究%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.%元胞自动机是对复杂适应系统建模的重要理论工具.可逆性是元胞自动机的一个重要属性,是模拟物理可逆空间的必要条件.本文介绍元胞自动机的基本概念、可逆性和可计算性,并介绍一维可逆元胞自动机可计算的证明思路.

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

  16. Calculation of impulse responses with a cellular automata algorithm

    Science.gov (United States)

    Barjau, Ana

    2001-05-01

    The air columns in musical instruments usually have a predominant dimension and thus are very often modeled as 1D systems where uniparametric waves propagate. Different algorithms can be found in the literature to simulate this propagation. The more widely used are finite difference schemes and delay lines. A finite difference scheme (FD) is a numerical integration of a differential formulation (the wave equation), while delay lines (DL) use analytical exact solutions of the wave equation over finite lengths. A new and different approach is that of a cellular automaton (CA) scheme. The underlying philosophy is opposite those of FD and DL, as the starting point is not the wave equation. In a CA approach, the phenomenon to be studied is reduced to a few simple physical laws that are applied to a set of cells representing the physical system (in the present case, the propagation medium). In this paper, a CA will be proposed to obtain the impulse response of different bore geometries. The results will be compared to those obtained with other algorithms.

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

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

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

  20. A New Optimized Data Clustering Technique using Cellular Automata and Adaptive Central Force Optimization (ACFO

    Directory of Open Access Journals (Sweden)

    G. Srinivasa Rao

    2015-06-01

    Full Text Available As clustering techniques are gaining more important today, we propose a new clustering technique by means of ACFO and cellular automata. The cellular automata uniquely characterizes the condition of a cell at a specific moment by employing the data like the conditions of a reference cell together with its adjoining cell, total number of cells, restraint, transition function and neighbourhood calculation. With an eye on explaining the condition of the cell, morphological functions are executed on the image. In accordance with the four stages of the morphological process, the rural and the urban areas are grouped separately. In order to steer clear of the stochastic turbulences, the threshold is optimized by means of the ACFO. The test outcomes obtained vouchsafe superb performance of the innovative technique. The accomplishment of the new-fangled technique is assessed by using additional number of images and is contrasted with the traditional methods like CFO (Central Force Optimization and PSO (Particle Swarm Optimization.

  1. Opinion evolution based on cellular automata rules in small world networks

    Science.gov (United States)

    Shi, Xiao-Ming; Shi, Lun; Zhang, Jie-Fang

    2010-03-01

    In this paper, we apply cellular automata rules, which can be given by a truth table, to human memory. We design each memory as a tracking survey mode that keeps the most recent three opinions. Each cellular automata rule, as a personal mechanism, gives the final ruling in one time period based on the data stored in one's memory. The key focus of the paper is to research the evolution of people's attitudes to the same question. Based on a great deal of empirical observations from computer simulations, all the rules can be classified into 20 groups. We highlight the fact that the phenomenon shown by some rules belonging to the same group will be altered within several steps by other rules in different groups. It is truly amazing that, compared with the last hundreds of presidential voting in America, the eras of important events in America's history coincide with the simulation results obtained by our model.

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

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

  4. The Improved Cellular Automata and Its Application in Delineation of Urban Spheres of Influence

    Directory of Open Access Journals (Sweden)

    Yu Deng

    2014-12-01

    Full Text Available The issue of spatial diffusion and pattern division of traditional cellular automata (CA has drawn widespread attention and generated extensive work by scholars. However, there are many deficiencies in traditional configurations of CA neighborhoods, which reduce simulation accuracy. The effect of improved methods of traditional configurations of CA neighborhoods is not obvious, and its interoperability is not strong. Therefore, this paper firstly puts forward the concept of the circular neighborhood of CA constrained by the space metric method based on map algebra, and compares the spatial division pattern and anisotropy of different types of neighborhoods in detail. Then, the CA’s weighted diffusion model is discussed to delineate urban spheres of influence in Henan Province. Finally, Weibo data is used to justify a reasonable delineation of urban spheres of influence and can correctly reflect the state of regional development, further proving that improved cellular automata in algorithms and applications have great significance.

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

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

  8. Multi-Robot Motion Planning: A Timed Automata Approach

    DEFF Research Database (Denmark)

    Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh

    This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar...... against specification requirements formulated in computational tree logic (CTL). In this way, all feasible trajectories that satisfy specifications and which moves the robots from a set of initial positions to a set of desired goal positions may be algorithmically analyzed. The trajectories can...... then subsequently be used as a high-level motion plan for the robots. This paper reports on the timed automata framework, results of two verification experiments, promise of the approach, and gives a perspective for future research....

  9. Multi-Robot Motion Planning: A Timed Automata Approach

    DEFF Research Database (Denmark)

    Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh

    2004-01-01

    This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar...... against specification requirements formulated in computational tree logic (CTL). In this way, all feasible trajectories that satisfy specifications and which moves the robots from a set of initial positions to a set of desired goal positions may be algorithmically analyzed. The trajectories can...... then subsequently be used as a high-level motion plan for the robots. This paper reports on the timed automata framework, results of two verification experiments, promise of the approach, and gives a perspective for future research....

  10. Efficient Design of Reversible Code Converters Using Quantum Dot Cellular Automata

    OpenAIRE

    Javeed Iqbal Reshi; M. Tariq Banday

    2016-01-01

    Quantum dot Cellular Automata (QCA) is an attractive field of nano-technology which offers the various advantages over existing CMOS technology for the development of logic circuits. Contradictory to other technologies which use the voltage levels for logic representation, QCA utilizes the polarization of electrons for representing the binary states in the QCA Cell. Conventional logic circuits are not energy efficient as they are not reversible in nature and hence lead to energy dissipation. ...

  11. Learning emergence: adaptive cellular automata façade trained by artificial neural networks

    OpenAIRE

    Skavara, M. M. E.

    2009-01-01

    This thesis looks into the possibilities of controlling the emergent behaviour of Cellular Automata (CA) to achieve specific architectural goals. More explicitly, the objective is to develop a performing, adaptive building facade, which is fed with the history of its achievements and errors, to provide optimum light conditions in buildings’ interiors. To achieve that, an artificial Neural Network (NN) is implemented. However, can an artificial NN cope with the complexity of suc...

  12. Cellular automata simulations on nanocrystallization processes: From instantaneous growth approximation to limited growth

    OpenAIRE

    Blázquez, J.S.; Conde, C. F.; Conde, A.

    2011-01-01

    Cellular automata simulations have been performed to simulate the crystallization process under a limited growth approximation. This approximation resembles several characteristics exhibited by nanocrystalline microstructures and nanocrystallization kinetics. Avrami exponent decreases from a value n = 4 indicating interface controlled growth and constant nucleation rate to a value n ~ 1 indicating absence of growth. A continuous change of the growth contribution to the Avrami exponent from ze...

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

  14. REVIEWS OF TOPICAL PROBLEMS: Study of spatially extended dynamical systems using probabilistic cellular automata

    Science.gov (United States)

    Vanag, Vladimir K.

    1999-05-01

    Spatially extended dynamical systems are ubiquitous and include such things as insect and animal populations; complex chemical, technological, and geochemical processes; humanity itself, and much more. It is clearly desirable to have a certain universal tool with which the highly complex behaviour of nonlinear dynamical systems can be analyzed and modelled. For this purpose, cellular automata seem to be good candidates. In the present review, emphasis is placed on the possibilities that various types of probabilistic cellular automata (PCA), such as DSMC (direct simulation Monte Carlo) and LGCA (lattice-gas cellular automata), offer. The methods are primarily designed for modelling spatially extended dynamical systems with inner fluctuations accounted for. For the Willamowskii-Roessler and Oregonator models, PCA applications to the following problems are illustrated: the effect of fluctuations on the dynamics of nonlinear systems; Turing structure formation; the effect of hydrodynamic modes on the behaviour of nonlinear chemical systems (stirring effects); bifurcation changes in the dynamical regimes of complex systems with restricted geometry or low spatial dimension; and the description of chemical systems in microemulsions.

  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. 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. PMID:27033136

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

  18. An event-driven model simulating fundamental seismic characteristics with the use of cellular automata

    Science.gov (United States)

    Pavlou, L.; Georgoudas, I. G.; Sirakoulis, G. Ch.; Scordilis, E. M.; Andreadis, I.

    This paper presents an extensive simulation tool based on a Cellular Automata (CA) system that models fundamental seismic characteristics of a region. The CA-based dynamic model consists of cells-charges and it is used for the simulation of the earthquake process. The simulation tool has remarkably accelerated the response of the model by incorporating principles of the High Performance Computing (HPC). Extensive programming features of parallel computing have been applied, thus improving its processing effectiveness. The tool implements an enhanced (or hyper-) 2-dimensional version of the proposed CA model. Regional characteristics that depend on the seismic background of the area under study are assigned to the model with the application of a user-friendly software environment. The model is evaluated with real data that correspond to a circular region around Skyros Island, Greece, for different time periods, as for example one of 45 years (1901-1945). The enhanced 2-dimensional version of the model incorporates all principal characteristics of the 2-dimensional one, also including groups of CA cells that interact with others, located to a considerable distance in an attempt to simulate long-range interaction. The advanced simulation tool has been thoroughly evaluated. Several measurements have been made for different critical states, as well as for various cascade (earthquake) sizes, cell activities and different neighbourhood sizes. Simulation results qualitatively approach the Gutenberg-Richter (GR) scaling law and reveal fundamental characteristics of the system.

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

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

    Institute of Scientific and Technical Information of China (English)

    LI; Xia; YANG; QingSheng; LIU; XiaoPing

    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.

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

  2. Derivation of Solar Flare Cellular Automata Models from a Subset of the Magnetohydrodynamic Equations

    Science.gov (United States)

    Vassiliadis, D.; Anastasiadis, A.; Georgoulis, M.; Vlahos, L.

    1998-12-01

    Cellular automata (CA) models account for the power-law distributions found for solar flare hard X-ray observations, but their physics has been unclear. We examine four of these models and show that their criteria and magnetic field distribution rules can be derived by discretizing the MHD diffusion equation as obtained from a simplified Ohm's law. Identifying the discrete MHD with the CA models leads to an expression for the resistivity as a function of the current on the flux tube boundary, as may be expected from current-driven instabilities. Anisotropic CA models correspond to a nonlinear resistivity η(J), while isotropic ones are associated with hyperresistivity η(▽2J). The discrete equations satisfy the necessary conditions for self-organized criticality (Lu): there is local conservation of a field (magnetic flux), while the nonlinear resistivity provides a rapid dissipation and relaxation mechanism. The approach justifies many features of the CA models that were originally based on intuition.

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

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

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

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

    International Nuclear Information System (INIS)

    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)

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

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

  9. Car Deceleration Considering Its Own Velocity in Cellular Automata Model

    Institute of Scientific and Technical Information of China (English)

    LI Ke-Ping

    2006-01-01

    In this paper, we propose a new cellular automaton model, which is based on NaSch traffic model. In our method, when a car has a larger velocity, if the gap between the car and its leading car is not enough large, it will decrease. The aim is that the following car has a buffer space to decrease its velocity at the next time, and then avoid to decelerate too high. The simulation results show that using our model, the car deceleration is realistic, and is closer to thefield measure than that of NaSch model.

  10. Progresses in the Analysis of Stochastic 2D Cellular Automata: a Study of Asynchronous 2D Minority

    CERN Document Server

    Regnault, Damien; Thierry, Éric

    2007-01-01

    Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the behavior of cellular automata drastically changed under asynchronous updates. Still, the few mathematical analyses of asynchronism focus on one-dimensional probabilistic cellular automata, either on single examples or on specific classes. As for other classic dynamical systems in physics, extending known methods from one- to two-dimensional systems is a long lasting challenging problem. In this paper, we address the problem of analysing an apparently simple 2D asynchronous cellular automaton: 2D Minority where each cell, when fired, updates to the minority state of its neighborhood. Our experiments reveal that in spite of its simplicity, the minority rule exhibits a quite complex response to asynchronism. By focusing on the fully asynchronous regime, we are however able to describe completely the asymptotic behavior of this dynamics...

  11. Threshold-Range Scaling of Excitable Cellular Automata

    CERN Document Server

    Fisch, R; Griffeath, D; Fisch, Robert; Gravner, Janko; Griffeath, David

    1993-01-01

    Each cell of a two-dimensional lattice is painted one of k colors, arranged in a "color wheel." The colors advance (0 to k-1 mod k) either automatically or by contact with at least a threshold number of successor colors in a prescribed local neighborhood. Discrete-time parallel systems of this sort in which color 0 updates by contact and the rest update automatically are called Greenberg-Hastings (GH) rules. A system in which all colors update by contact is called a cyclic cellular automaton (CCA). Started from appropriate initial conditions these models generate periodic traveling waves. Started from random configurations the same rules exhibit complex self-organization, typically characterized by nucleation of locally periodic "ram's horns" or spirals. Corresponding random processes give rise to a variety of "forest fire" equilibria that display large-scale stochastic wave fronts. This article describes a framework, theoretically based, but relying on extensive interactive computer graphics experimentation,...

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

  13. Cellular automata model based on GIS and urban sprawl dynamics simulation

    Science.gov (United States)

    Mu, Fengyun; Zhang, Zengxiang

    2005-10-01

    The simulation of land use change process needs the support of Geographical Information System (GIS) and other relative technologies. While the present commercial GIS lack capabilities of distribution, prediction, and simulation of spatial-temporal data. Cellular automata (CA) provide dynamically modeling "from bottom-to-top" framework and posses the capability of modeling spatial-temporal evolvement process of a complicated geographical system, which is composed of a fourfold: cells, states, neighbors and rules. The simplicity and flexibility make CA have the ability to simulate a variety of behaviors of complex systems. One of the most potentially useful applications of cellular automata from the point of view of spatial planning is their use in simulations of urban sprawl at local and regional level. The paper firstly introduces the principles and characters of the cellular automata, and then discusses three methods of the integration of CA and GIS. The paper analyses from a practical point of view the factors that effect urban activities in the science of spatial decision-making. The status of using CA to dynamic simulates of urban expansion at home and abroad is analyzed. Finally, the problems and tendencies that exist in the application of CA model are detailed discussed, such as the quality of the data that the CA needs, the self-organization of the CA roots in the mutual function among the elements of the system, the partition of the space scale, the time calibration of the CA and the integration of the CA with other modular such as artificial nerve net modular and population modular etc.

  14. Symbolic Computation Using Cellular Automata-Based Hyperdimensional Computing.

    Science.gov (United States)

    Yilmaz, Ozgur

    2015-12-01

    This letter introduces a novel framework of reservoir computing that is capable of both connectionist machine intelligence and symbolic computation. A cellular automaton is used as the reservoir of dynamical systems. Input is randomly projected onto the initial conditions of automaton cells, and nonlinear computation is performed on the input via application of a rule in the automaton for a period of time. The evolution of the automaton creates a space-time volume of the automaton state space, and it is used as the reservoir. The proposed framework is shown to be capable of long-term memory, and it requires orders of magnitude less computation compared to echo state networks. As the focus of the letter, we suggest that binary reservoir feature vectors can be combined using Boolean operations as in hyperdimensional computing, paving a direct way for concept building and symbolic processing. To demonstrate the capability of the proposed system, we make analogies directly on image data by asking, What is the automobile of air?

  15. Fluctuation in option pricing using cellular automata based market models

    Science.gov (United States)

    Gao, Yuying; Beni, Gerardo

    2005-05-01

    A new agent-based Cellular Automaton (CA) computational algorithm for option pricing is proposed. CAs have been extensively used in modeling complex dynamical systems but not in modeling option prices. Compared with traditional tools, which rely on guessing volatilities to calculate option prices, the CA model is directly addressing market mechanisms and simulates price fluctuation from aggregation of actions made by interacting individual market makers in a large population. This paper explores whether CA models can provide reasonable good answers to pricing European options. The Black-Scholes model and the Binomial Tree model are used for comparison. Comparison reveals that CA models perform reasonably well in pricing options, reproducing overall characteristics of random walk based model, while at the same time providing plausible results for the 'fat-tail' phenomenon observed in many markets. We also show that the binomial tree model can be obtained from a CA rule. Thus, CA models are suitable tools to generalize the standard theories of option pricing.

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

  17. Integral Imaging Based 3-D Image Encryption Algorithm Combined with Cellular Automata

    OpenAIRE

    Li, X. W.; Kim, D. H.; Cho, S. J.; Kim, S. T.

    2013-01-01

    A novel optical encryption method is proposed in this paper to achieve 3-D image encryption. This proposed encryption algorithm combines the use of computational integral imaging (CII) and linear-complemented maximum- length cellular automata (LC-MLCA) to encrypt a 3D image. In the encryption process, the 2-D elemental image array (EIA) recorded by light rays of the 3-D image are mapped inversely through the lenslet array according the ray tracing theory. Next, the 2-D EIA is encrypted by LC-...

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

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

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

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

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

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

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

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

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

  7. An improved multi-value cellular automata model for heterogeneous bicycle traffic flow

    International Nuclear Information System (INIS)

    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

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

    International Nuclear Information System (INIS)

    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.

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

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

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

  12. Facilitating arrhythmia simulation: the method of quantitative cellular automata modeling and parallel running

    Directory of Open Access Journals (Sweden)

    Mondry Adrian

    2004-08-01

    Full Text Available Abstract Background Many arrhythmias are triggered by abnormal electrical activity at the ionic channel and cell level, and then evolve spatio-temporally within the heart. To understand arrhythmias better and to diagnose them more precisely by their ECG waveforms, a whole-heart model is required to explore the association between the massively parallel activities at the channel/cell level and the integrative electrophysiological phenomena at organ level. Methods We have developed a method to build large-scale electrophysiological models by using extended cellular automata, and to run such models on a cluster of shared memory machines. We describe here the method, including the extension of a language-based cellular automaton to implement quantitative computing, the building of a whole-heart model with Visible Human Project data, the parallelization of the model on a cluster of shared memory computers with OpenMP and MPI hybrid programming, and a simulation algorithm that links cellular activity with the ECG. Results We demonstrate that electrical activities at channel, cell, and organ levels can be traced and captured conveniently in our extended cellular automaton system. Examples of some ECG waveforms simulated with a 2-D slice are given to support the ECG simulation algorithm. A performance evaluation of the 3-D model on a four-node cluster is also given. Conclusions Quantitative multicellular modeling with extended cellular automata is a highly efficient and widely applicable method to weave experimental data at different levels into computational models. This process can be used to investigate complex and collective biological activities that can be described neither by their governing differentiation equations nor by discrete parallel computation. Transparent cluster computing is a convenient and effective method to make time-consuming simulation feasible. Arrhythmias, as a typical case, can be effectively simulated with the methods

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

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

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

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

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

  18. Equal Distribution Model of Epidemic Drugs Based on a Cellular Automata Model

    Directory of Open Access Journals (Sweden)

    Huang Xinyi

    2015-01-01

    Full Text Available The epidemic spreading of infectious disease is a process of evolution over time. Based on the cellular automata model[1], this paper analyzes the epidemic spreading rules, and establishes an efficient equal distribution model of drugs in a broad sense. For multiple regions, in case of demand of drugs exceeding supply, the drugs shall be distributed according to the proportion of a total number of people in each region, the number of patients, the number of the isolated, and the number of deaths. It is necessary to simulate based on these four schemes to obtain simulation results. The results show that, when the drugs are distributed by the proportion of the number of deaths, it is optimal for controlling over epidemic situations.

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

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

  1. Efficient Design of Reversible Code Converters Using Quantum Dot Cellular Automata

    Directory of Open Access Journals (Sweden)

    Javeed Iqbal Reshi

    2016-06-01

    Full Text Available Quantum dot Cellular Automata (QCA is an attractive field of nano-technology which offers the various advantages over existing CMOS technology for the development of logic circuits. Contradictory to other technologies which use the voltage levels for logic representation, QCA utilizes the polarization of electrons for representing the binary states in the QCA Cell. Conventional logic circuits are not energy efficient as they are not reversible in nature and hence lead to energy dissipation. Thus there is a need of a serious effort that will provide an efficient paradigm for designing the circuits which does not dissipation the energy and hence will preserve the information. This paper offers the efficient design of various QCA reversible code converters which prove to be efficient in term of cell Area, cell count, total area, latency and complexity. All the proposed reversible code converter designs were simulated and their credibility was successfully verified with the QCADesigner tool

  2. Potential Field Cellular Automata Model for Pedestrian Evacuation in a Domain with a Ramp

    Directory of Open Access Journals (Sweden)

    Xiao-Xia Jian

    2014-01-01

    Full Text Available We propose a potential field cellular automata model with a pushing force field to simulate the pedestrian evacuation in a domain with a ramp. We construct a cost potential depending on the ramp angle and introduce a function to evaluate the pushing force, which is related to the cost and the desired direction of pedestrian. With increase of crowd density, there is no empty space for pedestrian moving forward; pedestrian will purposefully push another pedestrian on her or his desired location to arrive the destination quickly. We analyse the relationship between the slope of ramp and the pushing force and investigate the changing of injured situations with the changing of the slope of ramp. When the number of pedestrians and the ramp angle arrive at certain critical points, the Domino effect will be simulated by this proposed model.

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

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

  5. 3D image copyright protection based on cellular automata transform and direct smart pixel mapping

    Science.gov (United States)

    Li, Xiao-Wei; Kim, Seok-Tae; Lee, In-Kwon

    2014-10-01

    We propose a three-dimensional (3D) watermarking system with the direct smart pixel mapping algorithm to improve the resolution of the reconstructed 3D watermark plane images. The depth-converted elemental image array (EIA) is obtained through the computational pixel mapping method. In the watermark embedding process, the depth-converted EIA is first scrambled by using the Arnold transform, which is then embedded in the middle frequency of the cellular automata (CA) transform. Compared with conventional computational integral imaging reconstruction (CIIR) methods, this proposed scheme gives us a higher resolution of the reconstructed 3D plane images by using the quality-enhanced depth-converted EIA. The proposed method, which can obtain many transform planes for embedding watermark data, uses CA transforms with various gateway values. To prove the effectiveness of the proposed method, we present the results of our preliminary experiments.

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

  7. 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. PMID:25322138

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

  9. CELLULAR AUTOMATA MODELLING OF GRAIN COARSENING DURING REIHEATING AND VALIDATION WITH THE EXPERIMENTAL RESULTS

    Institute of Scientific and Technical Information of China (English)

    W.H. Yu; E.J. Palmiere; S.P. Banks; J.T. Han

    2005-01-01

    A novel 2D cellular automata (CA) model has been developed for description of normal grain coarsening and abnormal grain coarsening process. The program reflects the grain coarsening quite well even through the average grain size becomes very large. Follow results have been obtained: (a) The model reflect the normal grain growth kinetics gradually increase with probability and grain growth speed can be controlled. Based on this result, temperature can be coupled in the model. (b) Abnormal grain growth is modelled successfully. (c) Methodology has been put forward to find the relationship between the experiment results and modelling results. The experimental work on the grain coarsening has been carried out. Graphical output matched the realistic microstructure in every detail. Because many physical parameters can be taken into account in the CA programme, this CA model could not only qualitatively demonstrate the grain growth process, but also quantitatively predict and analyse the grain coarsening process.

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

    International Nuclear Information System (INIS)

    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

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

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

  13. Implementation and simulation of arithmetic logic unit, shifter and Multiplier in Quantum cellular automata technology

    Directory of Open Access Journals (Sweden)

    Dr.E.N.Ganesh

    2010-08-01

    Full Text Available Quantum cellular automata (QCA is a new technology in the nanometer scale and has been considered as one of the alternative to CMOS technology. QCA have a large potential in the development of circuits with high space density and low heat dissipation and allow the development of faster computers with lower power consumption. This paper discusses the design and construction of simple two bit arithmetic logic unit , four bit shifter and carry save in multiplier circuits. The advantage of this type of ALU is to construct functional unit all around the input lines and thereby reducing circuit complexity. Four bit shifter are constructed using serial AND and OR QCA circuits. QCA multiplier designed and constructed here has advantage of carry save in by delaying one clock cycle and no of bits can also be increased by adding the full adder stages. These circuits are the building block of nanoprocessors and provide us to understand the nanodevices of the future.

  14. A cardiac electrical activity model based on a cellular automata system in comparison with neural network model.

    Science.gov (United States)

    Khan, Muhammad Sadiq Ali; Yousuf, Sidrah

    2016-03-01

    Cardiac Electrical Activity is commonly distributed into three dimensions of Cardiac Tissue (Myocardium) and evolves with duration of time. The indicator of heart diseases can occur randomly at any time of a day. Heart rate, conduction and each electrical activity during cardiac cycle should be monitor non-invasively for the assessment of "Action Potential" (regular) and "Arrhythmia" (irregular) rhythms. Many heart diseases can easily be examined through Automata model like Cellular Automata concepts. This paper deals with the different states of cardiac rhythms using cellular automata with the comparison of neural network also provides fast and highly effective stimulation for the contraction of cardiac muscles on the Atria in the result of genesis of electrical spark or wave. The specific formulated model named as "States of automaton Proposed Model for CEA (Cardiac Electrical Activity)" by using Cellular Automata Methodology is commonly shows the three states of cardiac tissues conduction phenomena (i) Resting (Relax and Excitable state), (ii) ARP (Excited but Absolutely refractory Phase i.e. Excited but not able to excite neighboring cells) (iii) RRP (Excited but Relatively Refractory Phase i.e. Excited and able to excite neighboring cells). The result indicates most efficient modeling with few burden of computation and it is Action Potential during the pumping of blood in cardiac cycle. PMID:27087101

  15. Ergodic properties and thermodynamic behavior of elementary reversible cellular automata. I. Basic properties

    International Nuclear Information System (INIS)

    This is the first part of a series devoted to the study of thermodynamic behavior of large dynamical systems with the use of a family of full-discrete and conservative models named elementary reversible cellular automata (ERCAs). In this paper, basic properties such as conservation laws and phase space structure are investigated in preparation for the later studies. ERCAs are a family of one-dimensional reversible cellular automata having two Boolean variables on each site. Reflection and Boolean conjugation symmetries divide them into 88 equivalence classes. For each rule, additive conserved quantities written in a certain form are regarded as a kind of energy, if they exist. By the aid of the discreteness of the variables, every ERCA satisfies the Liouville theorem or the preservation of phase space volume. Thus, if an energy exists in the above sense, statistical mechanics of the model can formally be constructed. If a locally defined quantity is conserved, however, it prevents the realization of statistical mechanics. The existence of such a quantity is examined for each class and a number of rules which have at least one energy but no local conservation laws are selected as hopeful candidates for the realization of thermodynamic behavior. In addition, the phase space structure of ERCAs is analyzed by enumerating cycles exactly in the phase space for systems of comparatively small sizes. As a result, it is revealed that a finite ERCA is not ergodic, that is, a large number of orbits coexist on an energy surface. It is argued that this fact does not necessarily mean the failure of thermodynamic behavior on the basis of an analogy with the ergodic nature of infinite systems

  16. An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models

    OpenAIRE

    Linden, Alexander; Wolper, Pierre

    2010-01-01

    This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relaxation, which corresponds to the use of store buffers. The proposed approach proceeds by using finite automata to symbolically represent the possible contents of the store buffers. Store, load and commit operations then correspond to operations on these finite automata. The advantage of this approa...

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

  18. Geographic Spatiotemporal Dynamic Model using Cellular Automata and Data Mining Techniques

    Directory of Open Access Journals (Sweden)

    Ahmad Zuhdi

    2011-05-01

    Full Text Available Geospatial data and information availability has been increasing rapidly and has provided users with knowledge on entities change and movement in a system. Cellular Geography model applies Cellular Automata on Geographic data by defining transition rules to the data grid. This paper presents the techniques for extracting transition rule(s from time series data grids, using multiple linear regression analysis. Clustering technique is applied to minimize the number of transition rules, which can be offered and chosen to change a new unknown grid. Each centroid of a cluster is associated with a transition rule and a grid of data. The chosen transition rule is associated with grid that has a minimum distance to the new data grid to be simulated. Validation of the model can be provided either quantitatively through an error measurement or qualitatively by visualizing the result of the simulation process. The visualization can also be more informative by adding the error information. Increasing number of cluster may give possibility to improve the simulation accuracy.

  19. Cellular Automata in Modular Space : Rigid Systems – Volume I – Number I

    OpenAIRE

    Fridenfalk, Mikael

    2015-01-01

    This book series presents a new type of cellular automata for 2D pattern generation, characterized by a high reproduction rate, in combination with the application of a small-sized 2D modular square lattice. The presented patterns are in the spirit of mathematical minimalism, generated from rudimentary kernels and a minimal set of rules. In similarity with fractals, this new concept could provide for the generation of patterns and geometries with applications in areas such as, visual arts, lo...

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

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

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

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

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

  6. Resolution of Infinite-Loop in Hyperincursive and Nonlocal Cellular Automata: Introduction to Slime Mold Computing

    Science.gov (United States)

    Aono, Masashi; Gunji, Yukio-Pegio

    2004-08-01

    How can non-algorithmic/non-deterministic computational syntax be computed? "The hyperincursive system" introduced by Dubois is an anticipatory system embracing the contradiction/uncertainty. Although it may provide a novel viewpoint for the understanding of complex systems, conventional digital computers cannot run faithfully as the hyperincursive computational syntax specifies, in a strict sense. Then is it an imaginary story? In this paper we try to argue that it is not. We show that a model of complex systems "Elementary Conflictable Cellular Automata (ECCA)" proposed by Aono and Gunji is embracing the hyperincursivity and the nonlocality. ECCA is based on locality-only type settings basically as well as other CA models, and/but at the same time, each cell is required to refer to globality-dominant regularity. Due to this contradictory locality-globality loop, the time evolution equation specifies that the system reaches the deadlock/infinite-loop. However, we show that there is a possibility of the resolution of these problems if the computing system has parallel and/but non-distributed property like an amoeboid organism. This paper is an introduction to "the slime mold computing" that is an attempt to cultivate an unconventional notion of computation.

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

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

  9. Integral Imaging Based 3-D Image Encryption Algorithm Combined with Cellular Automata

    Directory of Open Access Journals (Sweden)

    X. W. Li

    2013-08-01

    Full Text Available A novel optical encryption method is proposed in this paper to achieve 3-D image encryption. This proposed encryption algorithm combines the use of computational integral imaging (CII and linear-complemented maximum- length cellular automata (LC-MLCA to encrypt a 3D image. In the encryption process, the 2-D elemental image array (EIA recorded by light rays of the 3-D image are mapped inversely through the lenslet array according the ray tracing theory. Next, the 2-D EIA is encrypted by LC-MLCA algorithm. When decrypting the encrypted image, the 2-D EIA is recovered by the LC-MLCA. Using the computational integral imaging reconstruction (CIIR technique and a 3-D object is subsequently reconstructed on the output plane from the 2-D recovered EIA. Because the 2-D EIA is composed of a number of elemental images having their own perspectives of a 3-D image, even if the encrypted image is seriously harmed, the 3-D image can be successfully reconstructed only with partial data. To verify the usefulness of the proposed algorithm, we perform computational experiments and present the experimental results for various attacks. The experiments demonstrate that the proposed encryption method is valid and exhibits strong robustness and security.

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

  11. Estimation of daily Snow Cover Area combining MODIS and LANDSAT information by using cellular automata

    Science.gov (United States)

    Pardo-Iguzquiza, Eulogio; Juan Collados Lara, Antonio; Pulido-Velazquez, David

    2016-04-01

    The snow availability in Alpine catchments is essential for the economy of these areas. It plays an important role in tourist development but also in the management of the Water Resources Snow is an important water resource in many river basins with mountains in the catchment area. The determination of the snow water equivalent requires the estimation of the evolution of the snow pack (cover area, thickness and snow density) along the time. Although there are complex physical models of the dynamics of the snow pack, sometimes the data available are scarce and a stochastic model like the cellular automata (CA) can be of great practical interest. CA can be used to model the dynamics of growth and wane of the snow pack. The CA is calibrated with historical data. This requires the determination of transition rules that are capable of modeling the evolution of the spatial pattern of snow cover area. Furthermore, CA requires the definition of states and neighborhoods. We have included topographical variables and climatological variables in order to define the state of each pixel. The evolution of snow cover in a pixel depends on its state, the state of the neighboring pixels and the transition rules. The calibration of the CA is done using daily MODIS data, available for the period 24/02/2002 to present with a spatial resolution of 500 m, and the LANDSAT information available with a sixteen-day periodicity from 1984 to the present and with spatial resolution of 30 m. The methodology has been applied to estimation of the snow cover area of Sierra Nevada mountain range in the Southern of Spain to obtain snow cover area daily information with 500 m spatial resolution for the period 1980-2014. Acknowledgments: This research has been partially supported by the GESINHIMPADAPT project (CGL2013-48424-C2-2-R) with Spanish MINECO funds. We would also like to thank NASA DAAC and LANDSAT project for the data provided for this study.

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

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

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

  15. 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. PMID:25719448

  16. Algorithmic Approach to Abstracting Linear Systems by Timed Automata

    DEFF Research Database (Denmark)

    Sloth, Christoffer; Wisniewski, Rafael

    2011-01-01

    This paper proposes an LMI-based algorithm for abstracting dynamical systems by timed automata, which enables automatic formal verification of linear systems. The proposed abstraction is based on partitioning the state space of the system using positive invariant sets, generated by Lyapunov...... the minimum and maximum time that a trajectory of the system can stay in a set, defined as the set-difference of sub-level sets of Lyapunov functions. The proposed algorithm applies for linear systems and can therefore be efficiently implemented using LMI-based tools....... functions. This partitioning ensures that the vector field of the dynamical system is transversal to all facets of the cells, which induces some desirable properties of the abstraction. The algorithm is based on identifying intersections of level sets of quadratic Lyapunov functions, and determining...

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

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

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

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

    Science.gov (United States)

    Christopher Immanuel, W.; Paul Mary Deborrah, S.; Samuel Selvaraj, R.

    2014-03-01

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

  2. Synthesis of a Neutral Mixed-Valence Diferrocenyl Carborane for Molecular Quantum-Dot Cellular Automata Applications.

    Science.gov (United States)

    Christie, John A; Forrest, Ryan P; Corcelli, Steven A; Wasio, Natalie A; Quardokus, Rebecca C; Brown, Ryan; Kandel, S Alex; Lu, Yuhui; Lent, Craig S; Henderson, Kenneth W

    2015-12-14

    The preparation of 7-Fc(+) -8-Fc-7,8-nido-[C2 B9 H10 ](-) (Fc(+) FcC2 B9 (-) ) demonstrates the successful incorporation of a carborane cage as an internal counteranion bridging between ferrocene and ferrocenium units. This neutral mixed-valence Fe(II) /Fe(III) complex overcomes the proximal electronic bias imposed by external counterions, a practical limitation in the use of molecular switches. A combination of UV/Vis-NIR spectroscopic and TD-DFT computational studies indicate that electron transfer within Fc(+) FcC2 B9 (-) is achieved through a bridge-mediated mechanism. This electronic framework therefore provides the possibility of an all-neutral null state, a key requirement for the implementation of quantum-dot cellular automata (QCA) molecular computing. The adhesion, ordering, and characterization of Fc(+) FcC2 B9 (-) on Au(111) has been observed by scanning tunneling microscopy. PMID:26516063

  3. Design and implementation of an efficient single layer five input majority voter gate in quantum-dot cellular automata.

    Science.gov (United States)

    Bahar, Ali Newaz; Waheed, Sajjad

    2016-01-01

    The fundamental logical element of a quantum-dot cellular automata (QCA) circuit is majority voter gate (MV). The efficiency of a QCA circuit is depends on the efficiency of the MV. This paper presents an efficient single layer five-input majority voter gate (MV5). The structure of proposed MV5 is very simple and easy to implement in any logical circuit. This proposed MV5 reduce number of cells and use conventional QCA cells. However, using MV5 a multilayer 1-bit full-adder (FA) is designed. The functional accuracy of the proposed MV5 and FA are confirmed by QCADesigner a well-known QCA layout design and verification tools. Furthermore, the power dissipation of proposed circuits are estimated, which shows that those circuits dissipate extremely small amount of energy and suitable for reversible computing. The simulation outcomes demonstrate the superiority of the proposed circuit. PMID:27330902

  4. Cellular Automata based Encrypted ECG-hash Code Generation: An Application in Inter-human Biometric Authentication System

    Directory of Open Access Journals (Sweden)

    Subrata Nandi

    2014-10-01

    Full Text Available In this modern era, biometrics incorporate various mechanisms to recognize inimitable features of human beings by utilizing their biological and evident features. This paper proposes a novel technique for constructing a resilient and secure biometric recognition system. In this paper, an ECG-hash code of two distinct individuals has been formed by taking dot product of electrocardiogram (ECG feature matrices of two persons located at two different sites at respective databases. The validity of the system increases as samples from both persons, between whom the transmission takes place, are essential. Besides, electrocardiogram is such a unique feature of an individual that could not be compromised at any circumstance as contradictory to other features like fingerprints, face recognition etc. Moreover, the ECG-hash code is encrypted using rule vector of cellular automata that gives better security in terms of randomness of generated cipher text.

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

  6. Asymptotic analysis of Complex Automata models for reaction-diffusion systems

    NARCIS (Netherlands)

    A. Caiazzo; J.-L. Falcone; B. Chopard; A.G. Hoekstra

    2009-01-01

    Complex Automata (CxA) have been recently introduced as a paradigm to simulate multiscale multiscience systems as a collection of generalized Cellular Automata on different scales. The approach yields numerical and computational challenges and can become a powerful tool for the simulation of particu

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

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

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

    Science.gov (United States)

    Tsukerblat, Boris; Palii, Andrew; Clemente-Juan, Juan Modesto; Coronado, Eugenio

    2015-10-01

    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 the

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

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

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

  13. IN-MACA-MCC: Integrated Multiple Attractor Cellular Automata with Modified Clonal Classifier for Human Protein Coding and Promoter Prediction

    Directory of Open Access Journals (Sweden)

    Kiran Sree Pokkuluri

    2014-01-01

    Full Text Available Protein coding and promoter region predictions are very important challenges of bioinformatics (Attwood and Teresa, 2000. The identification of these regions plays a crucial role in understanding the genes. Many novel computational and mathematical methods are introduced as well as existing methods that are getting refined for predicting both of the regions separately; still there is a scope for improvement. We propose a classifier that is built with MACA (multiple attractor cellular automata and MCC (modified clonal classifier to predict both regions with a single classifier. The proposed classifier is trained and tested with Fickett and Tung (1992 datasets for protein coding region prediction for DNA sequences of lengths 54, 108, and 162. This classifier is trained and tested with MMCRI datasets for protein coding region prediction for DNA sequences of lengths 252 and 354. The proposed classifier is trained and tested with promoter sequences from DBTSS (Yamashita et al., 2006 dataset and nonpromoters from EID (Saxonov et al., 2000 and UTRdb (Pesole et al., 2002 datasets. The proposed model can predict both regions with an average accuracy of 90.5% for promoter and 89.6% for protein coding region predictions. The specificity and sensitivity values of promoter and protein coding region predictions are 0.89 and 0.92, respectively.

  14. IN-MACA-MCC: Integrated Multiple Attractor Cellular Automata with Modified Clonal Classifier for Human Protein Coding and Promoter Prediction

    Science.gov (United States)

    Pokkuluri, Kiran Sree; Inampudi, Ramesh Babu; Nedunuri, S. S. S. N. Usha Devi

    2014-01-01

    Protein coding and promoter region predictions are very important challenges of bioinformatics (Attwood and Teresa, 2000). The identification of these regions plays a crucial role in understanding the genes. Many novel computational and mathematical methods are introduced as well as existing methods that are getting refined for predicting both of the regions separately; still there is a scope for improvement. We propose a classifier that is built with MACA (multiple attractor cellular automata) and MCC (modified clonal classifier) to predict both regions with a single classifier. The proposed classifier is trained and tested with Fickett and Tung (1992) datasets for protein coding region prediction for DNA sequences of lengths 54, 108, and 162. This classifier is trained and tested with MMCRI datasets for protein coding region prediction for DNA sequences of lengths 252 and 354. The proposed classifier is trained and tested with promoter sequences from DBTSS (Yamashita et al., 2006) dataset and nonpromoters from EID (Saxonov et al., 2000) and UTRdb (Pesole et al., 2002) datasets. The proposed model can predict both regions with an average accuracy of 90.5% for promoter and 89.6% for protein coding region predictions. The specificity and sensitivity values of promoter and protein coding region predictions are 0.89 and 0.92, respectively. PMID:25132849

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

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

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

    Directory of Open Access Journals (Sweden)

    Yaolin Liu

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

  18. An optimization method based on combination of cellular automata and simulated annealing for VVER-1000 NPP loading pattern

    International Nuclear Information System (INIS)

    This paper introduces a design methodology in the context of finding new and innovative design principles by means of optimization techniques. In this method cellular automata (CA) and simulated annealing (SA) were combined and used for solving the optimization problem. This method contains two principles that are neighboring concept from CA and accepting each displacement basis on decreasing of objective function and Boltzman distribution from SA that plays role of transition rule. Proposed method was used for solving fuel management optimization problem in VVER-1000 Russian reactor. Since the fuel management problem contains a huge amount of calculation for finding the best configuration for fuel assemblies in reactor core this method has been introduced for reducing the volume of calculation. In this study reducing of power peaking factor inside the reactor core of Bushehr NPP is considered as the objective function. The proposed optimization method is compared with Hopfield neural network procedure that was used for solving this problem and has been shown that the result, velocity and qualification of new method are comparable with that. Besides, the result is the optimum configuration, which is in agreement with the pattern proposed by the designer.

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

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

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

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

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

  4. Particle acceleration in a complex solar active region modelled by a Cellular automata model

    Science.gov (United States)

    Dauphin, C.; Vilmer, N.; Anastasiadis, A.

    2004-12-01

    The models of cellular automat allowed to reproduce successfully several statistical properties of the solar flares. We use a cellular automat model based on the concept of self-organised critical system to model the evolution of the magnetic energy released in an eruptive active area. Each burst of magnetic energy released is assimilated to a process of magnetic reconnection. We will thus generate several current layers (RCS) where the particles are accelerated by a direct electric field. We calculate the energy gain of the particles (ions and electrons) for various types of magnetic configuration. We calculate the distribution function of the kinetic energy of the particles after their interactions with a given number of RCS for each type of configurations. We show that the relative efficiency of the acceleration of the electrons and the ions depends on the selected configuration.

  5. Monitoring with Data Automata

    Science.gov (United States)

    Havelund, Klaus

    2014-01-01

    We present a form of automaton, referred to as data automata, suited for monitoring sequences of data-carrying events, for example emitted by an executing software system. This form of automata allows states to be parameterized with data, forming named records, which are stored in an efficiently indexed data structure, a form of database. This very explicit approach differs from other automaton-based monitoring approaches. Data automata are also characterized by allowing transition conditions to refer to other parameterized states, and by allowing transitions sequences. The presented automaton concept is inspired by rule-based systems, especially the Rete algorithm, which is one of the well-established algorithms for executing rule-based systems. We present an optimized external DSL for data automata, as well as a comparable unoptimized internal DSL (API) in the Scala programming language, in order to compare the two solutions. An evaluation compares these two solutions to several other monitoring systems.

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

  8. Robust tracking by cellular automata and neural networks with nonlocal weights

    Science.gov (United States)

    Ososkov, Gennadii A.

    1995-04-01

    A modified rotor model of the Hopfield neural networks (HNN) is proposed for finding tracks in multiwire proportional chambers. That requires us to apply both raw data prefiltering by cellular automaton and HNN weights furnishing by a special robust multiplier. Then this model is developed to be applicable for a more general type of data and detectors. As an example, data processing of ionospheric measurements are considered. For handling tracks detected by high pressure drift chambers with their up-down ambiguity a modification of deformable templates method is proposed. A new concept of controlled HNN is proposed for solving the so-called track-match problem.

  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 of Eutectic Saturation Influence on Microstructure in Thin Wall Ductile Iron Casting Using Cellular Automata

    Directory of Open Access Journals (Sweden)

    M. Górny

    2012-12-01

    Full Text Available The mathematical model of the globular eutectic solidification in 2D was designed. Proposed model is based on the Cellular AutomatonFinite Differences (CA-FD calculation method. Model has been used for studies of the primary austenite and of globular eutectic grainsgrowth during the ductile iron solidification in the thin wall casting. Model takes into account, among other things, non-uniformtemperature distribution in the casting wall cross-section, kinetics of the austenite and graphite grains nucleation, and non-equilibriumnature of the interphase boundary migration. Calculation of eutectic saturation influence (Sc = 0.9 - 1.1 on microstructure (austenite and graphite fraction, density of austenite and graphite grains and temperature curves in 2 mm wall ductile iron casting has been done.

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

  12. Ocean acidification affects competition for space: projections of community structure using cellular automata.

    Science.gov (United States)

    McCoy, Sophie J; Allesina, Stefano; Pfister, Catherine A

    2016-03-16

    Historical ecological datasets from a coastal marine community of crustose coralline algae (CCA) enabled the documentation of ecological changes in this community over 30 years in the Northeast Pacific. Data on competitive interactions obtained from field surveys showed concordance between the 1980s and 2013, yet also revealed a reduction in how strongly species interact. Here, we extend these empirical findings with a cellular automaton model to forecast ecological dynamics. Our model suggests the emergence of a new dominant competitor in a global change scenario, with a reduced role of herbivory pressure, or trophic control, in regulating competition among CCA. Ocean acidification, due to its energetic demands, may now instead play this role in mediating competitive interactions and thereby promote species diversity within this guild. PMID:26936244

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

  14. Visualization of Patterns and Self-organization of Cellular Automata in Urban Traffic Situations

    Science.gov (United States)

    Zhou, Lei; Brian, Schwartz

    2001-06-01

    The use of cellular automaton (CA) techniques is very good at modeling complex or nonlinear systems. In dynamic system within the context of discrete mathematical steps for CA simulations, simple local rules produce complex global rules. The simplicity of CA rules enables us to model and investigate more realistic models for the behavior traffic in two-dimensional flow systems. Our numerical solution presents self-organization behavior, which is called grid-lock for urban city street traffic and a phase transitions in the fundamental flow rate vs. density diagrams. We present calculations, which demonstrate the effects of micro CA rules and traffic parameters on the macro properties of traffic flow and behavior. We modified the stochastic parameter p, which is constant in the original CA rules, to a variable depending on the state of the vehicles. This structure of path dependence on history for traffic properties is in many cases analogous to solutions obtained for interactive magnetic systems. Using 3D ray tracer software, we are able to render the visualization of patterns of grid-lock into a 3D virtual urban environment.

  15. Particle acceleration and radiation in flaring complex solar active regions modeled by cellular automata

    Science.gov (United States)

    Dauphin, C.; Vilmer, N.; Anastasiadis, A.

    2007-06-01

    Context: We study the acceleration and radiation of electrons and ions interacting with multiple small-scale dissipation regions resulting from the magnetic energy release process. Aims: We aim to calculate the distribution functions of the kinetic energy of the particles and the X-ray spectra and γ-ray fluxes produced by the accelerated particles. Methods: The evolution of the magnetic energy released in an active region is mimicked by a cellular automaton model based on the concept of self-organized criticality. Each burst of magnetic energy release is associated with a reconnecting current sheet (RCS) in which the particles are accelerated by a direct electric field. Results: We calculate the energy gain of the particles (ions and electrons) for three different magnetic configurations of the RCS after their interactions with a given number of RCS. We finally compare our results with existing observations. Conclusions: The results of our simulation can reproduce several properties of the observations such as variable electron and ion energy contents and γ-ray line ratio. Even if very flat X-ray spectra have been reported in a few events, the X-ray spectra produced in this model are too flat when compared to most X-ray observations.

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

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

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

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

  20. L.A.U.D.E: Learning Automata for Urban Development Exploration. The Case Study of Rome Urban System

    OpenAIRE

    Rabino, Giovanni A.; Papini, Lorenzo; Silvana T. Lombardo; Colonna, Antonio; Stefano, Vittorio Di

    1998-01-01

    This paper deals with urban cellular automata. It is organized in two parts. The first one is concerning theory, methodology and operational aspects of the application of cellular automata to the simulation of dynamics of urban systems. Starting with a review of the literature on this research field (Batty, Cecchini, Couclelis, White et al.) we present: ? as to theoretical foundation of the approach, a clarification on the distinction between global and local description (the traditional mode...

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

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

  3. 基于细胞自动机的安全图像加密算法%Secure Image Encryption Algorithm Based on Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    熊永红; 廖晓峰; 周庆

    2011-01-01

    In order to solve the problems that the cipher image encrypted by encryption algorithm based on the merit of the state attractors of Elementary Cellular Automata(ECA) can still discern part outline of the original image, and the plaintext sensitivity is poor, this paper proposes a secure image encryption algorithm. It employs the method which encrypts every bit plane with period two 2D Cellular Automata(CA), and then uses state attractors to encrypt the image, to achieve the effect that I bit change in the plaintext can be spreaded to the whole cipher image. Simulation results show that the improved algorithm is more sensitive, has larger key space, and easy to implement.%利用初等细胞自动机状态环性质进行加密后的密文图像仍可看出原图像的部分轮廓,且明文敏感性差.由此提出一种安全的图像加密算法,采用周期为2的二维细胞自动机对图像进行位平面加密,再通过状态环加密的方法使明文改变1 bit即可影响整个密文图像.仿真结果表明,改进算法敏感性更高,密钥空间更大,且加密速度较快.

  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. 元胞自动机理论在金融市场建模中的应用%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.

  6. Using Learning Automata in Coordination Among Heterogeneous Agents in a Complex Multi-Agent Domain

    Directory of Open Access Journals (Sweden)

    Mohammadreza Khojasteh

    2012-06-01

    Full Text Available This paper describes our use of Learning Automata as a reinforcement learning method in coordination among three heterogeneous teams of agents acting in RoboCup Rescue Simulation environment. We provide a brief introduction to Learning Automata and Cellular Learning Automata, the reinforcement machine learning methods that we have used in lots of parts of our agents’ development. Then we will describe the major challenges each team of agents should be concerned about in such a complex domain and for each challenge, we propose our approaches to develop cooperative teams. Finally, some results of using Learning Automata in coordinating these heterogeneous teams of agents that cooperate to mitigate the disastrous damages in a simulated city are evaluated.

  7. Learning communicating and nondeterministic automata

    OpenAIRE

    Kern, Carsten

    2009-01-01

    The results of this dissertation are two-fold. On the one hand, inductive learning techniques are extended and two new inference algorithms for inferring nondeterministic, and universal, respectively, finite-state automata are presented. On the other hand, certain learning techniques are employed and enhanced to semi-automatically infer communicating automata (also called design models in the software development cycle). For both topics, theoretical results on the feasibility of the approache...

  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. Adder design using a 5-input majority gate in a novel “multilayer gate design paradigm” for quantum dot cellular automata circuits

    International Nuclear Information System (INIS)

    This paper proposes a novel design paradigm for circuits designed in quantum dot cellular automata (QCA) technology. Previously reported QCA circuits in the literature have generally been designed in a single layer which is the main logical block in which the inverter and majority gate are on the base layer, except for the parts where multilayer wire crossing was used. In this paper the concept of multilayer wire crossing has been extended to design logic gates in multilayers. Using a 5-input majority gate in a multilayer, a 1-bit and 2-bit adder have been designed in the proposed multilayer gate design paradigm. A comparison has been made with some adders reported previously in the literature and it has been shown that circuits designed in the proposed design paradigm are much more efficient in terms of area, the requirement of QCA cells in the design and the input–output delay of the circuit. Over all, the availability of one additional spatial dimension makes the design process much more flexible and there is scope for the customizability of logic gate designs to make the circuit compact. (paper)

  10. 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 polluting enterprises, distance from the town center, soil pH, and distance from bodies of water. Categorical variables, including soil type, parent material type, organic content grade, and land use type, also significantly influenced HMC according to Wald statistics. The relative operating characteristic and kappa coefficients were 0.91 and 0.64, respectively, which proved the validity and accuracy of the model. The scenario simulation shows that the government should not only implement stricter environmental regulation but also strengthen the remediation of the current polluted area to effectively mitigate HMC.

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

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

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

  14. Genetic Cellular Automata Model of Evolving Stock Market%股市演化的遗传元胞自动机模型

    Institute of Scientific and Technical Information of China (English)

    应尚军; 范英

    2013-01-01

    Guided by the theory of complexity sciences ,this paper formulates a genetic cellular automa model of stock market using several research tools including cellular automata ,genetic algorithm and simulation ,and techniques of investment analysis is involved as well .During the modeling ,the reservoir of evolving rules is used to conduct the stock market simulation ,whereas classifier system is used to training the model′s parameters so that the evolving model is as close to real market as possible .The application to YZMY stock market implies that the intelligent e‐volving model can simulate the real market on complexity characteristics ,and can provide scien‐tific basis for stock market administration and regulation after further studies .%  以复杂性科学的理论方法为指导,运用元胞自动机、遗传算法、系统仿真、分类器系统等研究工具,结合投资分析技术,在形成演化规则库的基础上,构建了股市系统演化的遗传元胞自动机模型。其中,分类器系统被用来学习演化模型的参数,它使演化市场的复杂性特征充分逼近现实市场。通过对兖州煤业的实证分析,表明该演化模型可以模拟现实市场的复杂性,可以通过具有学习功能的演化模型进一步分析股票市场,为股市的监管和调控提供依据。

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

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

  17. Cellular neural network-based hybrid approach toward automatic image registration

    Science.gov (United States)

    Arun, Pattathal VijayaKumar; Katiyar, Sunil Kumar

    2013-01-01

    Image registration is a key component of various image processing operations that involve the analysis of different image data sets. Automatic image registration domains have witnessed the application of many intelligent methodologies over the past decade; however, inability to properly model object shape as well as contextual information has limited the attainable accuracy. A framework for accurate feature shape modeling and adaptive resampling using advanced techniques such as vector machines, cellular neural network (CNN), scale invariant feature transform (SIFT), coreset, and cellular automata is proposed. CNN has been found to be effective in improving feature matching as well as resampling stages of registration and complexity of the approach has been considerably reduced using coreset optimization. The salient features of this work are cellular neural network approach-based SIFT feature point optimization, adaptive resampling, and intelligent object modelling. Developed methodology has been compared with contemporary methods using different statistical measures. Investigations over various satellite images revealed that considerable success was achieved with the approach. This system has dynamically used spectral and spatial information for representing contextual knowledge using CNN-prolog approach. This methodology is also illustrated to be effective in providing intelligent interpretation and adaptive resampling.

  18. 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综合了多智能体和元胞自动机的优点,充分考虑了个体内在因素,更接近现实大型体育场馆的人群疏散情形,缩短了疏散时间。

  19. Image Encryption Algorithm Based on Extended Two-dimensional Cellular Automata%基于扩展型二维CA的图像加密算法

    Institute of Scientific and Technical Information of China (English)

    罗小刚; 李轩; 彭承琳; 侯长军; 霍丹群

    2009-01-01

    根据数字图像的存储特点,提出一种基于扩展型二维元胞自动机的图像加密算法,将二维元胞自动机与图像加密技术结合,利用元胞自动机生成数值范围在0~255区间的二维伪随机数矩阵,截取与图像大小相等的伪随机数矩阵作为密码对图像像素进行加密,解密为加密的逆过程.实验结果表明,该算法能快速产生密码,加密形式简单,具有较好的抗攻击能力,适合对数据量大的数字图像进行加密.%According to the storage characteristics of digital image, an image encryption algorithm based on extended two-dimensional Cellular Automata(CA) is proposed in this paper. It combines the two-dimensional CA with the technology of image encryption, which uses CA to generate a two-dimensional matrix pseudo-random number ranged from 0 to 255 automatically and takes a part of this matrix as the code to enerypt image pixels, and the size of this matrix is the same as the image. The decryption is the converse process of encryption. Experimental results demonstrate this algorithm can generate cryptogram rapidly and has a simple encrypt form as well as a better performance against attacks. It is suitable for encrypting digital images with huge data.

  20. Climate change and Ecotone boundaries: Insights from a cellular automata ecohydrology model in a Mediterranean catchment with topography controlled vegetation patterns

    Science.gov (United States)

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

    2014-11-01

    Regions of vegetation transitions (ecotones) are known to be highly sensitive to climate fluctuations. In this study, the Cellular-Automata Tree Grass Shrub Simulator (CATGraSS) has been modified, calibrated and used with downscaled future climate scenarios to examine the role of climate change on vegetation patterns in a steep mountainous catchment (1.3 km2) located in Sicily, Italy. In the catchment, north-facing slopes are mostly covered by trees and grass, and south-facing slopes by Indian Fig opuntia and grass, with grasses dominating as elevation grows. CATGraSS simulates solar radiation, evapotranspiration, and soil moisture in space and time. Each model cell can hold a single plant type or can be bare soil. Plant competition is modeled explicitly through mortality and the establishment of individual plants in open spaces. In this study, CATGraSS is modified to account for heterogeneity in soil thickness and tested in the study catchment using the historical climate of the region. Predicted vegetation patterns are compared with those obtained from satellite images. Results of model under current climate underscore the importance of solar irradiance and soil thickness, especially in the uplands where soil is shallow, in determining vegetation composition over complex terrain. A stochastic weather generator is used to generate future climate change scenarios for the catchment by downscaling GCM realizations in space and time. Future increase in atmospheric CO2 concentration was considered through modifying the vegetation water use efficiency and stomatal resistance for our study site. Model results suggest that vegetation pattern is highly sensitive to temperature and rainfall variations provided by climate scenarios (30% reduction of the annual precipitation and a 2.8 °C increase of the mean annual temperature). Future climate change is predicted to bring a considerable reorganization of the plant composition following topographic patterns, leading to a

  1. Simulation of Forest Fire Spreading Based on Geographic Cellular Automata%林火蔓延地理元胞自动机仿真模拟

    Institute of Scientific and Technical Information of China (English)

    湛玉剑; 张帅; 张磊; 刘学军

    2013-01-01

    On the basis of geographical cellular automata, a forest fire spread simulation model which applied in the complex diversity of tree species is proposed for the complexity of the impact of forest fire spread factors in this paper. Meanwhile ,GIS technology, which is convenient to CA forest fire spread model for its ability to handle and analysis raster data and other abilities, is used to design and achieve a dynamic simulation of the spread model in this paper. Simulation results show that the model can simulate forest fire spread of different environments, and is suitable for simulation analyzing forest fire spread under the combined effects of various factors ,and also can provide technical support for prediction analysis of fire spread,estimating fire shape,burned area and the rate of spread and optimizing fire suppression decision-making.%针对林火蔓延影响因子的复杂性,在地理元胞自动机的基础上,提出一种应用于具有复杂树种多样性的林火蔓延模拟模型,同时借助GIS技术实现了蔓延模型的动态模拟.实验结果表明,模型可以模拟不同环境下的林火蔓延,适用于仿真分析多种因素综合作用下的林火蔓延,能够为预测分析火势蔓延趋势,估算火场形状、过火面积、蔓延速度以及优化灭火决策等提供技术支持.

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

  3. Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation

    Science.gov (United States)

    Oku, Makito; Aihara, Kazuyuki

    2010-11-01

    A modularly-structured neural network model is considered. Each module, which we call a ‘cell’, consists of two parts: a Hopfield neural network model and a multilayered perceptron. An array of such cells is used to simulate the Rule 110 cellular automaton with high accuracy even when all the units of neural networks are replaced by stochastic binary ones. We also find that noise not only degrades but also facilitates computation if the outputs of multilayered perceptrons are below the threshold required to update the states of the cells, which is a stochastic resonance in computation.

  4. 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......-complete on visibly one-counter automata and P-complete on visibly BPA. Our PSPACE lower bound for visibly one-counter automata improves also the previously known DP-hardness results for ordinary one-counter automata and one-counter nets. Finally, we study regularity checking problems for visibly pushdown automata...

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

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

  7. Developing an effective 2-D urban flood inundation model for city emergency management based on cellular automata

    Science.gov (United States)

    Liu, L.; Liu, Y.; Wang, X.; Yu, D.; Liu, K.; Huang, H.; Hu, G.

    2015-03-01

    Flash floods have occurred frequently in the urban areas of southern China. An effective process-oriented urban flood inundation model is urgently needed for urban storm-water and emergency management. This study develops an efficient and flexible cellular automaton (CA) model to simulate storm-water runoff and the flood inundation process during extreme storm events. The process of infiltration, inlets discharge and flow dynamics can be simulated with little preprocessing on commonly available basic urban geographic data. In this model, a set of gravitational diverging rules are implemented to govern the water flow in a rectangular template of three cells by three cells of a raster layer. The model is calibrated by one storm event and validated by another in a small urban catchment in Guangzhou of southern China. The depth of accumulated water at the catchment outlet is interpreted from street-monitoring closed-circuit television (CCTV) videos and verified by on-site survey. A good level of agreement between the simulated process and the reality is reached for both storm events. The model reproduces the changing extent and depth of flooded areas at the catchment outlet with an accuracy of 4 cm in water depth. Comparisons with a physically based 2-D model (FloodMap) show that the model is capable of effectively simulating flow dynamics. The high computational efficiency of the CA model can meet the needs of city emergency management.

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

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

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

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

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

  13. 量子元胞自动机器件和电路的研究进展%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器件未来理论和应用研究中的开放课题和方向.

  14. 基于元胞自动机的海上溢油扩散模拟%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.

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

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

  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. Towards Cancer Hybrid Automata

    Directory of Open Access Journals (Sweden)

    Loes Olde Loohuis

    2012-08-01

    Full Text Available This paper introduces Cancer Hybrid Automata (CHAs, a formalism to model the progression of cancers through discrete phenotypes. The classification of cancer progression using discrete states like stages and hallmarks has become common in the biology literature, but primarily as an organizing principle, and not as an executable formalism. The precise computational model developed here aims to exploit this untapped potential, namely, through automatic verification of progression models (e.g., consistency, causal connections, etc., classification of unreachable or unstable states and computer-generated (individualized or universal therapy plans. The paper builds on a phenomenological approach, and as such does not need to assume a model for the biochemistry of the underlying natural progression. Rather, it abstractly models transition timings between states as well as the effects of drugs and clinical tests, and thus allows formalization of temporal statements about the progression as well as notions of timed therapies. The model proposed here is ultimately based on hybrid automata, and we show how existing controller synthesis algorithms can be generalized to CHA models, so that therapies can be generated automatically. Throughout this paper we use cancer hallmarks to represent the discrete states through which cancer progresses, but other notions of discretely or continuously varying state formalisms could also be used to derive similar therapies.

  19. Probabilistic weighted automata

    OpenAIRE

    Chatterjee, Krishnendu; Doyen, Laurent; Henzinger, Thomas A.

    2009-01-01

    Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages $L$ that assign to each word $w$ a real number $L(w)$. The value of an infinite word $w$ is computed as the maximal value of all runs over $w$, and the value of a run as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We introduce probabilistic weighted automata, in which the transitions are chosen in a randomized (rather ...

  20. Theory of Digital Automata

    CERN Document Server

    Borowik, Bohdan; Lahno, Valery; Petrov, Oleksandr

    2013-01-01

    This book serves a dual purpose: firstly to combine the treatment of circuits and digital electronics, and secondly, to establish a strong connection with the contemporary world of digital systems. The need for this approach arises from the observation that introducing digital electronics through a course in traditional circuit analysis is fast becoming obsolete. Our world has gone digital. Automata theory helps with the design of digital circuits such as parts of computers, telephone systems and control systems. A complete perspective is emphasized, because even the most elegant computer architecture will not function without adequate supporting circuits. The focus is on explaining the real-world implementation of complete digital systems. In doing so, the reader is prepared to immediately begin design and implementation work. This work serves as a bridge to take readers from the theoretical world to the everyday design world where solutions must be complete to be successful.

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

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

  3. 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年在深圳-北京航线上推出服务创新为例,经过重复试验较好地模拟了在该航线上进行服务创新取得成功的竞争演化过程.研究结果表明:初始接受服务创新的元胞数量、服务匹配度和品牌宣传效应度三个影响因素都对演化的突变周期起正向影响作用,且三个因素对突变周期的正向作用随着取值的增大而逐渐减弱.

  4. 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个路口的城市道路交通流状态,并通过离散方程描述车辆的运动过程.研究了信号灯控制策略(同步定时控制及感应控制)对交通流状态的影响.数值模拟结果表明,信号灯对交通流的影响与道路中车辆密度有关,同时,感应控制参数的选取存在一合理的取值范围,可优化交通流通行效率.因此,为保证交通流的通行效率,应针对不同的车辆密度,选取适当的信号灯控制方式.

  5. 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.%为减少和预防企业生产中意外事故的发生,将元胞自动机理论应用于企业生产过程的研究,建立了某企业生产中基层-员工执行系统的元胞自动机模型.通过对安全生产的个人因素和环境因素在不同状态下的模拟和分析,认为员工遵守规章规程的程度是影响企业安全生产的关键因素之一;并在此基础上,建议企业多关注于如何保证政策法规被规范执行,以缩小实际操作与规则规程之间的差距.这为企业安全生产的研究提供了一种新的思路.

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

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

  8. Cellular vs. organ approaches to dose estimates

    International Nuclear Information System (INIS)

    The cellular distribution of tissue-incorporated radionuclides has generally been neglected in the dosimetry of internal emitters. Traditional dosimetry assumes homogeneous distribution of radionuclides in organs of interest, while presuming that the ranges of particulate radiations are large relative to typical cell diameters. The macroscopic distribution of dose thus calculated has generally served as a sufficient approximation for the energy deposited within radiosensitive sites. However, with the increasing utilization of intracellular agents, such as thallium-201, it has become necessary to examine the microscopic distribution of energy at the cellular level. This is particularly important in the instance of radionuclides that decay by electron capture or by internal conversion with the release of Auger and Coster-Kronig electrons. In many instances, these electrons are released as a dense shower of low-energy particles with ranges of subcellular dimensions. The high electron density in the immediate vicinity of the decaying atom produces a focal deposition of energy that far exceeds the average dose taken over several cell diameters. These studies point out the increasing need to take into account the microscopic distribution of dose on the cellular level as radionuclides distributed in cells become more commonplace, especially if the decay involves electron capture or internal conversion. As radiotracers are developed for the measurement of intracellular functions these factors should be given greater consideration. 16 references, 5 figures, 5 tables

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

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

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

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

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

  15. Automata and Quantum Computing

    OpenAIRE

    Ambainis, Andris; Yakaryilmaz, Abuzer

    2015-01-01

    Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted models such as quantum versions of finite automata have been studied. In this paper, we survey various models of quantum finite automata and their properties. We also provide some open questions and new directions for researchers.

  16. Multi-Automata Learning

    OpenAIRE

    Katja, Verbeeck; Ann, Nowe; Peter, Vrancx; Maarten, Peeters

    2008-01-01

    In this chapter we have demonstrated that Learning Automata are interesting building blocks for multi-agent Reinforcement learning algorithms. LA can be viewed as policy iterators, that update their action probabilities based on private information only. Even in multi-automaton settings, each LA is updated using only the environment response, and not on the basis of any knowledge regarding the other automata, i.e. nor their strategies, nor their feedback. As such LA based agent algorithms are...

  17. Using Learning Automata in Coordination Among Heterogeneous Agents in a Complex Multi-Agent Domain

    OpenAIRE

    Mohammadreza Khojasteh; Aida Kazimi

    2012-01-01

    This paper describes our use of Learning Automata as a reinforcement learning method in coordination among three heterogeneous teams of agents acting in RoboCup Rescue Simulation environment. We provide a brief introduction to Learning Automata and Cellular Learning Automata, the reinforcement machine learning methods that we have used in lots of parts of our agents’ development. Then we will describe the major challenges each team of agents should be concerned about in such a complex domain ...

  18. 元胞自动机(CA)模型在土地利用领域的研究综述%The Research Summary of Land use with the Model of Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    周嵩山; 李红波

    2012-01-01

    通过模型对区域土地利用/覆盖变化(LUCC)进行分析已经成为了当前全球的研究主要内容之一.元胞自动机(CA)模型是一种通过定义局部的简单的计算规则来模拟和表示整个系统中复杂现象的时空动态模型,其“自下而上”的研究思路,强大的复杂计算功能及高度动态,使得它在模拟空间复杂系统的时空动态演变方面具有很强的能力.CA模型通过与其他模型相结合,在综合考虑各种限制因素和转换规则的前提下,通过反复迭代综合空间分析与非空间分析,模拟土地利用变化情景,在国内外已经形成了较为成熟的研究模型.本文首先提出了CA模型在土地利用变化中应用的背景及其特点;然后,分析了CA模型的构成原理以及在国内外的应用进展与现状;最后,详细阐述了CA模型在土地利用变化中的发展趋势及今后研究工作中应注意的问题.%The model of the regional land use /cover change (I.UCC) has become main content of global research. Cellular automata (CA) model is a temporal and spatial dynamic model to simulate and represent complex phenomena in the entire system by definition of local simple calculation rules, its "bottom up" research approach, strong functions of complexity computing and highly dynamic, make it has a strong ability in the evolution of the spatial and temporal dynamics of the simulated space complex systems. CA model by combining with other models in the premise of considering the various constraints and transformation rules through iterative comprehensive spatial analysis and non-spatial analysis, for the simulation of land-use change scenarios, both at home and abroad it has been a comparatively mature research model. In this paper we first give the background and characteristics of the CA model in the application of land-use change; then analyzing the composition principles of the CA model and application condition and progress at home and

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

  20. 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.%利用改进的层次域元胞自动机模型,研究了正菱形网格空间中的行人疏散问题.这类网格可以避免行人贴近房间墙壁或障碍物,转移概率考虑了各种逃生受阻因素.数值仿真显示,出口处的行人分布与实验快照展示的行人分布基本相同,疏散时间和出口宽度呈线性关系,行人流率接近实验结果.

  1. 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.%将粒计算技术引入到元胞自动机的交通流研究中,从而为进一步提出基于元胞、粒和交通网络三层结构的交通流系统奠定基础,继而改进传统交通流模拟系统的架构.在此交通流模拟系统中,粒及粒计算的思想反映为系统设计中的车队概念,而在某一时间步进内,交通网络中所有车辆的更新将按照路段、车队、车辆的层级顺序进行.

  2. Priced Timed Automata

    DEFF Research Database (Denmark)

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

    2004-01-01

    This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European proj...... projects VHS [22] and AMETIST [17] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [20,5] specialized for cost-optimal reachability for the extended model of priced timed automata....

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

  4. Language Emptiness of Continuous-Time Parametric Timed Automata

    DEFF Research Database (Denmark)

    Benes, Nikola; Bezdek, Peter; Larsen, Kim Guldstrand;

    2015-01-01

    of these clocks is compared with (an arbitrary number of) parameters, we show that the parametric language emptiness is decidable. The undecidability result tightens the bounds of a previous result which assumed six parameters, while the decidability result extends the existing approaches that deal with discrete......Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even for various restricted subclasses. We thus focus on the case...

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

  6. Data Automata in Scala

    Science.gov (United States)

    Havelund, Klaus

    2014-01-01

    The field of runtime verification has during the last decade seen a multitude of systems for monitoring event sequences (traces) emitted by a running system. The objective is to ensure correctness of a system by checking its execution traces against formal specifications representing requirements. A special challenge is data parameterized events, where monitors have to keep track of the combination of control states as well as data constraints, relating events and the data they carry across time points. This poses a challenge wrt. efficiency of monitors, as well as expressiveness of logics. Data automata is a form of automata where states are parameterized with data, supporting monitoring of data parameterized events. We describe the full details of a very simple API in the Scala programming language, an internal DSL (Domain-Specific Language), implementing data automata. The small implementation suggests a design pattern. Data automata allow transition conditions to refer to other states than the source state, and allow target states of transitions to be inlined, offering a temporal logic flavored notation. An embedding of a logic in a high-level language like Scala in addition allows monitors to be programmed using all of Scala's language constructs, offering the full flexibility of a programming language. The framework is demonstrated on an XML processing scenario previously addressed in related work.

  7. Combinatorial approaches to evaluate nanodiamond uptake and induced cellular fate

    Science.gov (United States)

    Eldawud, Reem; Reitzig, Manuela; Opitz, Jörg; Rojansakul, Yon; Jiang, Wenjuan; Nangia, Shikha; Zoica Dinu, Cerasela

    2016-02-01

    Nanodiamonds (NDs) are an emerging class of engineered nanomaterials that hold great promise for the next generation of bionanotechnological products to be used for drug and gene delivery, or for bio-imaging and biosensing. Previous studies have shown that upon their cellular uptake, NDs exhibit high biocompatibility in various in vitro and in vivo set-ups. Herein we hypothesized that the increased NDs biocompatibility is a result of minimum membrane perturbations and their reduced ability to induce disruption or damage during cellular translocation. Using multi-scale combinatorial approaches that simulate ND-membrane interactions, we correlated NDs real-time cellular uptake and kinetics with the ND-induced membrane fluctuations to derive energy requirements for the uptake to occur. Our discrete and real-time analyses showed that the majority of NDs internalization occurs within 2 h of cellular exposure, however, with no effects on cellular viability, proliferation or cellular behavior. Furthermore, our simulation analyses using coarse-grained models identified key changes in the energy profile, membrane deformation and recovery time, all functions of the average ND or ND-based agglomerate size. Understanding the mechanisms responsible for ND-cell membrane interactions could possibly advance their implementation in various biomedical applications.

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

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

  10. Simulation of Two-Way Pushdown Automata Revisited

    OpenAIRE

    Robert Glück

    2013-01-01

    The linear-time simulation of 2-way deterministic pushdown automata (2DPDA) by the Cook and Jones constructions is revisited. Following the semantics-based approach by Jones, an interpreter is given which, when extended with random-access memory, performs a linear-time simulation of 2DPDA. The recursive interpreter works without the dump list of the original constructions, which makes Cook's insight into linear-time simulation of exponential-time automata more intuitive and the complexity arg...

  11. Concretization and animation of Finite Automata with c-cards

    DEFF Research Database (Denmark)

    Valente, Andrea

    2004-01-01

    to classes of 10 to 12 years old, and in general to students with a limited mathematical background. Our approach builds on {\\em computational cards} (or c-cards), a project aiming at scaling-down the learning complexity of computer science core contents, by presenting symbol manipulation via a t......-cards is given and its educational implication discussed: the mapping provides a mean to concretize and animate automata. The algorithm works with both deterministic and non-deterministic finite automata....

  12. CATALAN NUMBERS, DYCK LANGUAGE AND TIME SERIES OF ELEMENTARY CELLULAR AUTOMATON OF RULE 56

    Institute of Scientific and Technical Information of China (English)

    QIN Dakang; XIE Huimin

    2005-01-01

    A new approach to study the evolution complexity of cellular automata is proposed and explained thoroughly by an example of elementary cellular automaton of rule 56. Using the tools of distinct excluded blocks, computational search and symbolic dynamics, the mathematical structure underlying the time series generated from the elementary cellular automaton of rule 56 is analyzed and its complexity is determined, in which the Dyck language and Catalan numbers emerge naturally.

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

  14. 城市交通拥堵的经济学分析和元胞自动机模拟%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.

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

  16. A combined approach for modeling particle behavior in granular impact damper using discrete element method and cellular automata

    OpenAIRE

    Komatsuzaki, Toshihiko; Iwata, Yoshio

    2016-01-01

    A particle impact damper is a vibration absorber type that consists of a container attached to a primary vibrating structure. It also contains many particles that are constrained to move inside the container, whereby the damping effect can be obtained by collision between particles and the container. The discrete element method (DEM) has been developed for modeling granular systems, where the kinematics of each particle are calculated numerically using the equations of motion. However, the co...

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

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

  19. Emergence, Competition and Dynamical Stabilization of Dissipative Rotating Spiral Waves in an Excitable Medium: A Computational Model Based on Cellular Automata

    CERN Document Server

    Makovetskiy, S D

    2008-01-01

    We report some qualitatively new features of emergence, competition and dynamical stabilization of dissipative rotating spiral waves (RSWs) in the cellular-automaton model of laser-like excitable media proposed in arXiv:cond-mat/0410460v2 ; arXiv:cond-mat/0602345 . Part of the observed features are caused by unusual mechanism of excitation vorticity when the RSW's core get into the surface layer of an active medium. Instead of the well known scenario of RSW collapse, which takes place after collision of RSW's core with absorbing boundary, we observed complicated transformations of the core leading to regeneration (nonlinear "reflection" from the boundary) of the RSW or even to birth of several new RSWs in the surface layer. Computer experiments on bottlenecked evolution of such the RSW-ensembles (vortex matter) are reported and a possible explanation of real experiments on spin-lattice relaxation in dilute paramagnets is proposed on the basis of an analysis of the RSWs dynamics. Chimera states in RSW-ensemble...

  20. Whole-Organism Cellular Pathology: A Systems Approach to Phenomics.

    Science.gov (United States)

    Cheng, K C; Katz, S R; Lin, A Y; Xin, X; Ding, Y

    2016-01-01

    Phenotype is defined as the state of an organism resulting from interactions between genes, environment, disease, molecular mechanisms, and chance. The purpose of the emerging field of phenomics is to systematically determine and measure phenotypes across biology for the sake of understanding. Phenotypes can affect more than one cell type and life stage, so ideal phenotyping would include the state of every cell type within the context of both tissue architecture and the whole organism at each life stage. In medicine, high-resolution anatomic assessment of phenotype is obtained from histology. Histology's interpretative power, codified by Virchow as cellular pathology, is derived from its ability to discern diagnostic and characteristic cellular changes in diseased tissues. Cellular pathology is observed in every major human disease and relies on the ability of histology to detect cellular change in any cell type due to unbiased pan-cellular staining, even in optically opaque tissues. Our laboratory has shown that histology is far more sensitive than stereomicroscopy for detecting phenotypes in zebrafish mutants. Those studies have also shown that more complete sampling, greater consistency in sample orientation, and the inclusion of phenotypes extending over longer length scales would provide greater coverage of common phenotypes. We are developing technical approaches to achieve an ideal detection of cellular pathology using an improved form of X-ray microtomography that retains the strengths and addresses the weaknesses of histology as a screening tool. We are using zebrafish as a vertebrate model based on the overlaps between zebrafish and mammalian tissue architecture, and a body size small enough to allow whole-organism, volumetric imaging at cellular resolution. Automation of whole-organism phenotyping would greatly increase the value of phenomics. Potential societal benefits would include reduction in the cost of drug development, a reduction in the

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

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

  3. 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基本图。

  4. 基于最大发展潜力值的元胞自动机城市扩张模型%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年的城市扩张情况,最后,将模拟结果与实际土地利用现状图进行对比发现改进后的新方法在模拟精度上大大提高。

  5. 二阶可逆耦合触发细胞自动机的加密技术研究%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.

  6. 基于土壤侵蚀的元胞自动机转换规则框架%The Transition Rule Frame for Cellular Automata based on Soil Erosion

    Institute of Scientific and Technical Information of China (English)

    赵京

    2014-01-01

    The erosion process of the Loess Plateau can be regarded as the computation of a huge comles system, cellular automaton is a theoretical model which couldreact the comlexphenomenonverywel due to the charataristc of itsnonlinearness than the other traditional model in the are a of soilerosion forecast.Inthispaper,we use the theory of cel ularautomata to disscuss the process of soilerosionon the micro-scale,we for cuson the dynamicbalance of water and soil in each cel to built a transition rule frame of erosion cel ular automata, single flow direction algorithm cal ed D8(Deterministic eight-node) appoint the outflow direction and use the multi-agent proguammable modeling environment cal ed NelLogo to simulate the transition rule, the com-putaionofthecel ularautomatonshowsgoodresult.%黄土高原的土壤侵蚀过程可以被看做是一种地形演变的复杂系统。元胞自动机是一种能够很好的体现这样复杂现象的理论模型,因其非线性的特点使得其在土壤侵蚀的预测方面相比其他模型能够有一定的优势。本文利用元胞自动机的思想对于在降雨条件下的土壤侵蚀过程进行探究。利用每个单位元胞内的水量平衡和泥沙平衡构建元胞之间各参数的转换规则,利用D8流向算法计算水流方向。综合得出一种基于水量平衡与泥沙平衡的土壤侵蚀元胞自动机转换规则框架,并利用netlogo建模环境来实现模型,得出了较好的模拟结果。

  7. Energy consumption of bus rapid transit system based on cellular automata theory%基于元胞自动机理论的快速公交系统能耗研究

    Institute of Scientific and Technical Information of China (English)

    陈永; 王晓明; 党建武

    2012-01-01

    交通运输能源消耗已经成为决策管理者高度关注的信息.采用元胞自动机(CA)理论研究了快速公交系统能耗问题,以元胞自动机NaSch交通流模型为基础,通过结合动能定理,建立了快速公交系统的元胞自动机能耗动力学仿真模型.并以目前建设的兰州市快速公交系统为例,仿真研究了周期性边界条件下,不同行车密度、不同停靠站时间以及驾驶员行为差异下随机慢化对快速公交车系统能耗的影响,得到了相应的定量分析结论.仿真结果表明,快速公交车辆停靠站时间越长,拥堵的范围越大,路面交通流能耗损失越小,对应的流量、速度也越小,系统越早进入堵塞相.%Transportation energy consumption has aroused high attention of the decision-makers. In this case, an energy consumption of Bus Rapid Transit (BRT) Cellular Automata (CA) model was designed, which was based on NaSch traffic model and Kinetic energy theorem. Taking Lanzhou city bus rapid transit traffic system as an example, the effects of BRT vehicle random slowness in the different traffic density, different road condition and drivers' behavior under periodic boundary conditions was studied. And corresponding quantitative analysis conclusion was get. The simulation results show that the rapid transit vehicle stops longer, the greater the range of congestion and the smaller the energy loss of the road traffic flow. Besides, the corresponding flow rate is also smaller, thus the system is plugged into congestion phase earlier.

  8. 记忆原理的元胞自动机优化算法及其收敛性证明%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种状态类型,并依据元胞接受刺激的强度被加强或衰减;记忆残留值低于某个阈值的元胞时被遗忘,不再被处理.在元胞演化过程中,元胞从一个状态转移到另一个状态实现了元胞空间对理论搜索空间的搜索.应用可归约随机矩阵的稳定性条件证明了本算法具有全局收敛性.

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

  10. 基于GIS和元胞自动机的土地利用/覆盖变化模拟——以滇西北香格里拉县为例%Simulation of Land Use/Cover Change Based on GIS and Cellular Automata Model: A Case Study of Shangri-La County in Northwest Yunnan Province

    Institute of Scientific and Technical Information of China (English)

    卢鹏; 岳彩荣; 冯水琴; 任健; 岑纲; 禄鑫

    2011-01-01

    选取林地面积减少较为严重的滇西北香格里拉县为例,对研究区的土地利用变化驱动机制进行了分析,并集合GIS技术,尝试运用元胞自动机理论构建Loit模型对研究区的土地利用空间格局进行了模拟和预测.模拟的Kappa指数为0.79,表明CA模型在土地利用/覆盖变化的预测方面有巨大优势.%A study was conducted to analyze the land-use change-driven mechanism of forest land in Shangri-La County, northwest Yunnan Province, where the forest land area decreased more seriously. The spatial pattern of land use in the study area was simulated and predicted by CIS technology and the Logit Model obtained from the cellular automata theory. The kappa index of the simulation was 0. 79, indicating that the cellular automata model has more advantages in the simulation of Land use/cover change.

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

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

  13. A MULTI CRITERIA APPROACH TO DESIGNING THE CELLULAR MANUFACTURING SYSTEM

    Directory of Open Access Journals (Sweden)

    Rika Ampuh Hadiguna

    2005-01-01

    Full Text Available Cellular manufacturing system design problems such as design framework, manufacturing cells layout and layout evaluation. The research objective is developing the framework to designing manufacturing cells with considering the organization and management aspects in shopfloor. In this research have compared the existing layout with proposed layout which applied the multi criteria approach. The proposed method is combining Analytical Hierarchy Process (AHP, Clustering and heuristic approach. The result has show that grouping with Single Linkage Clustering (SLC to be selected as manufacturing cells. The comparison of clustering weight is 0,567, 0,245 and 0,188 for SLC, Complete Linkage Clustering (CLC and Average Linkage Clustering (ALC, respectively. This result shows that generating layout by using grouping result from SLC. The evaluation result shows that types of manufacturing cells better than process layout which used the existing system.

  14. Complex systems modeling by cellular automata

    NARCIS (Netherlands)

    J. Kroc; P.M.A. Sloot

    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

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

  16. Reversible computing and cellular automata - A survey

    OpenAIRE

    Morita, Kenichi

    2008-01-01

    Reversible computing is a paradigm where computing models are defined so that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. In this survey/tutorial paper, we discuss how computation can be carried out in a reversible system, how a universal reversible computer can be constructed by reversible logic elements, and how such logic elements are related to reversible physical phenomena. We shall see that, in reversible systems, computation can ...

  17. Cellular Automata Simulations - Tools and Techniques

    OpenAIRE

    Fuks, Henryk

    2010-01-01

    We presented an overview of basic issues associated with CA simulations, concentrating on selected problems which, in the mind of the author, deserve closer attention. We also demonstrated how HCELL can be used to perform some typical CA simulation tasks. Obviously, many important topics have been omitted. In particular, the issue of dimensionality of space has not been addressed, and yet many important CA models require 2D, 3D, and higher dimensional lattices. Some collective phenomena in CA...

  18. Cellular automata modeling of cooperative eutectic growth

    OpenAIRE

    E. Olejnik; E. Fraś; D. Gurgul; A. Burbelko

    2010-01-01

    The model and results of the 2D simulation of the cooperative growth of two phases in the lamellar eutectic are presented. The pro-posed model takes into account heat transfer, components diffusion and nonstationary concentration distribution in the liquid and solid phases, non-equlibrium nature of the phase transformation and kinetics of the growth, influence of the surface energy and interface curva-ture on the conditions of the thermodynamic equilibrium. For the determination of the phase ...

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

  1. 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个非均匀二维单断层模型样本,并通过设计的细胞自动机模拟程序,在保持其它模拟参数不变的条件下对它们进行了模拟试验.研究结果表明,随着断层结构非匀质度的增加,其宏观变形破坏行为由相对脆性向塑性变化;地震序列类型依次表现出主震型、前震-主震-余震型和震群型;震级分布表现出非均匀性依次减小;地震发生在时间上表现为一种确定性的随机过程,即小震随机、中强地震丛集和大震准周期的特点.此

  2. Simulation of Two-Way Pushdown Automata Revisited

    Directory of Open Access Journals (Sweden)

    Robert Glück

    2013-09-01

    Full Text Available The linear-time simulation of 2-way deterministic pushdown automata (2DPDA by the Cook and Jones constructions is revisited. Following the semantics-based approach by Jones, an interpreter is given which, when extended with random-access memory, performs a linear-time simulation of 2DPDA. The recursive interpreter works without the dump list of the original constructions, which makes Cook's insight into linear-time simulation of exponential-time automata more intuitive and the complexity argument clearer. The simulation is then extended to 2-way nondeterministic pushdown automata (2NPDA to provide for a cubic-time recognition of context-free languages. The time required to run the final construction depends on the degree of nondeterminism. The key mechanism that enables the polynomial-time simulations is the sharing of computations by memoization.

  3. Modelling Social-Technical Attacks with Timed Automata

    DEFF Research Database (Denmark)

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

    2015-01-01

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

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

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

  6. Using Learning Automata in Coordination Among Heterogeneous Agents in a Complex Multi-Agent Domain

    Directory of Open Access Journals (Sweden)

    Mohammadreza Khojasteh

    2012-06-01

    Full Text Available This paper describes our use of Learning Automata as a reinforcement learning method incoordination among three heterogeneous teams of agents acting in RoboCup Rescue Simulationenvironment. We provide a brief introduction to Learning Automata and Cellular LearningAutomata, the reinforcement machine learning methods that we have used in lots of parts of ouragents’ development. Then we will describe the major challenges each team of agents should beconcerned about in such a complex domain and for each challenge, we propose our approachesto develop cooperative teams. Finally, some results of using Learning Automata in coordinatingthese heterogeneous teams of agents that cooperate to mitigate the disastrous damages in asimulated city are evaluated.

  7. 基于元胞自动机模型的开采沉陷模拟%Simulation of Coal Mining Subsidence Based on the Model of Cellular Automata

    Institute of Scientific and Technical Information of China (English)

    陈秋计

    2013-01-01

    The simulation of mining subsidence plays an important role in mining environmental management and ecological restoration. Based on the GIS platform, the mining subsidence theory and geographical Cellular Automata (CA) are combined with each other, and then the mining subsidence cellular space is constructed by using the development tool of object-oriented method with the help of software of VS2010. The mining subsidence frame structure of CA model and realization method is discussed, and the mining subsidence simulation object relation graph is constructed. The evolution model of CA for mining subsidence is established based on the research result. Finally, the prototype system of mining subsidence CA is developed by taking a coal mine in Shanxi Province as an example. Based on the coal seam condition and mining method of the study area, the evolution of mining subsidence in the future is simulated usi ng the prototype system in order to provide the basis for land reclamation and ecological restoration. The results show that object-oriented method is good for the analysis and exploitation of mining subsidence simulation system, and mining subsidence simulation based on GIS and CA, which is facilitated to the development of the system and has good compatibility, is able to show more spatiotemporal information, facilitating data management. In space division, the CA model could organically integrate into traditional method, and is able to accurately predict the future of surface subsidence damage, providing the basis for the treatment for subsidence area. Since mining subsidence relates to many subjects, there are many works need to be down in the future for further perfecting evolution model, exploring the evolution process of system in three-dimensional space, and enhancing the reality and practicability of simulation.%开采沉陷模拟对矿区的环境治理和生态恢复具有重要意义.本文将开采沉陷理论与地理元胞自动

  8. Using a satisfiability solver to identify deterministic finite state automata

    NARCIS (Netherlands)

    Heule, M.J.H.; Verwer, S.

    2009-01-01

    We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level SAT representation, our approach seems to be competitive with alternative techniques. Our contributions are threefold: First, we p

  9. Cellular phones and traffic accidents: an epidemiological approach.

    Science.gov (United States)

    Violanti, J M; Marshall, J R

    1996-03-01

    Using epidemiological case-control design and logistic regression techniques, this study examined the association of cellular phone use in motor vehicles and traffic accident risk. The amount of time per month spent talking on a cellular phone and 18 other driver inattention factors were examined. Data were obtained from: (1) a case group of 100 randomly selected drivers involved in accidents within the past 2 years, and (2) a control group of 100 randomly selected licensed drivers not involved in accidents within the past 10 years. Groups were matched on geographic residence. Approximately 13% (N = 7) of the accident and 9% (N = 7) of the non-accident group reported use of cellular phones while driving. Data was obtained from Department of Motor Vehicles accident reports and survey information from study subjects. We hypothesized that increased use of cellular phones while driving was associated with increased odds of a traffic accident. Results indicated that talking more than 50 minutes per month on cellular phones in a vehicle was associated with a 5.59-fold increased risk in a traffic accident. The combined use of cellular phones and motor and cognitive activities while driving were also associated with increased traffic accident risk. Readers should be cautioned that this study: (1) consists of a small sample, (2) reveals statistical associations and not causal relationships, and (3) does not conclude that talking on cellular phones while driving is inherently dangerous.

  10. Beyond Language Equivalence on Visibly Pushdown Automata

    CERN Document Server

    Srba, Jiří

    2009-01-01

    We study (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied preorders and equivalences like simulation, completed simulation, ready simulation, 2-nested simulation preorders/equivalences and bisimulation equivalence. Our main results are that all the mentioned equivalences and preorders are EXPTIME-complete on visibly pushdown automata, PSPACE-complete on visibly one-counter automata and P-complete on visibly BPA. Our PSPACE lower bound for visibly one-counter automata improves also the previously known DP-hardness results for ordinary one-counter automata and one-counter nets. Finally, we study regularity checking problems for visibly pushdown automata and show that they can be decided in polynomial time.

  11. Application of Fuzzy Algebra in Automata theory

    Directory of Open Access Journals (Sweden)

    Kharatti Lal

    2016-06-01

    Full Text Available In our first application we consider strings of fuzzy singletons as input to a fuzzy finite state machine. The notion of fuzzy automata was introduced in [58]. There has been considerable growth in the area [18]. In this section present a theory of free fuzzy monoids and apply the results to the area of fuzzy automata. In fuzzy automata, the set of strings of input symbols can be considered to be a free monoid. We introduced the motion of fuzzy strings of input symbols, where the fuzzy strings from free fuzzy submonoids of the free monoids of input strings. We show that fuzzy automata with fuzzy input are equivalent to fuzzy automata with crisp input. Hence the result of fuzzy automata theory can be immediately applied to those of fuzzy automata theory with fuzzy input. The result are taken from [7] and [34].

  12. Multiscale approach to description of deformation and fracture of brittle media with hierarchical porous structure on the basis of movable cellular automaton method

    Directory of Open Access Journals (Sweden)

    S. G. Psakhie

    2013-04-01

    Full Text Available An approach to multiscale description of deformation and fracture of brittle porous materials on the basis of movable cellular automaton method was proposed. The material characterized by pore size distribution function having two maxima was considered. The core of the proposed approach consists in finding the automaton effective response function by means of direct numerical simulation of representative volume of the porous material. A hierarchical two-scale model of mechanical behavior of ceramics under compression and shear loading was developed. Zirconia based ceramics with pore size greater than the average grain size was considered. At the first scale of the model only small pores (corresponding to the first maximum of the pore size distribution function were taking into account explicitly (by removing automata from the initial structure. The representative volume and effective elastic properties of the porous material at this scale were evaluated. At the second scale of the model, big pores were taking into account explicitly, the parameters of the matrix corresponded to the ones determined at the first scale. Simulation results showed that the proposed multiscale model allows qualitatively and quantitatively correct describing of deformation and fracture of brittle material with hierarchical porous structure.

  13. Lateral Drift Behavior Analysis in Mixed Bicycle Traffic: A Cellular Automaton Model Approach

    Directory of Open Access Journals (Sweden)

    Xue Feng

    2016-01-01

    Full Text Available Bicycle movements are always associated with lateral drifts. However, the impacts of lateral drift behavior, as well as variable lateral clearance maintaining behavior due to the variation of drift intensity, on mixed bicycle flow are not clear. This paper establishes a new cellular automata model to study typical characteristics of mixed bicycle traffic induced by lateral drift and its accompanying behavior. Based on derived positive correlation between passing speed and drift speed through survey, the occurrence probability of lateral drift and the degree of maintained lateral clearance are both introduced in accordance with the variance of passing speed. Then, in whole density region, firm conformity between simulation results and actual survey data is reached, which has seldom been achieved in previous studies. It is further verified that speed distortions in intermediate and high density region induced by assumption of constant lateral clearance requirements can be revised by introducing its variability characteristics. In addition, two contrastive impacts of lateral drift behavior are observed. That is, it causes speed fluctuation in low density while alleviating the speed fluctuation in relatively high density. These results are expected to be helpful to improve the simulation performance of mixed bicycle flow as well as depict more realistic vehicle-bicycle conflicts and so on.

  14. Online isolation of defects in cellular nanocomputers

    Institute of Scientific and Technical Information of China (English)

    Teijiro Isokawa; Shin'ya Kowada; Ferdinand Peper; Naotake Kamiura; Nobuyuki Matsui

    2007-01-01

    Unreliability will be a major issue for computers built from components at nanometer scales.Thus,it's to be expected that such computers will need a high degree of defect-tolerance to overcome components' defects which have arisen during the process of manufacturing.This paper presents a novel approach to defect-tolerance that is especially geared towards nanocomputers based on asynchronous cellular automata.According to this approach,defective cells are detected and isolated by small configurations that move around randomly in cellular space.These configurations,called random flies,will attach to configurations that are static,which is typical for configurations that contain defective cells.On the other hand,dynamic configurations,like those that conduct computations,will not be isolated from the rest of the cellular space by the random flies,and will be able to continue their operations unaffectedly.

  15. 基于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)算法,提出了一种改进的状态场变量更新规则,以应变能最小化为优化目标,构建基于固体各向同性微惩罚结构的拓扑优化模型,通过二维经典拓扑优化算例,与已有的状态场变量更新规则的对比分析,验证了本文提出的变量更新规则的有效性和正确性.

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

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

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

  19. A Chemical Genetic Approach To The Study Of Cellular Transport

    NARCIS (Netherlands)

    Nieland, T.J.F.

    2005-01-01

    The focus of this thesis is the use of chemical genetics to study two different aspects of membrane biology, (a) the mechanisms underlying cellular lipid transport and (b) the intersection between endocytic and exocytic traffic. The broad goals of chemical genetics are to find novel chemical tool

  20. Time reverse automata patterns generated by Spencer-Brown's modulator: invertibility based on autopoiesis.

    Science.gov (United States)

    Gunji, Y; Nakamura, T

    1991-01-01

    In the present paper the self-consistency or operational closure of autopoiesis is described by introducing time explicitly. It is an extension of Spencer-Brown's idea of time, however. The definition of time is segregated into two parts, corresponding to the syntax and semantics of language, respectively. In this context, time reversibility is defined by the formalization of the relationship between time and self-consistency. This idea has also been discussed in the context of designation and/or naming. Here we will discuss it in the context of cellular automata and explain the structure of one-to-many type mappings. Our approach is the first attempt to extend autopoietic systems in terms of dynamics. It illustrates how to introduce an autopoietic time which looks irreversible, but without the concept of entropy. PMID:1912385

  1. Novel Approaches to Cellular Transplantation from the US Space Program

    Science.gov (United States)

    Pellis, Neal R.; Homick, Jerry L. (Technical Monitor)

    1999-01-01

    Research in the treatment of type I diabetes is entering a new era that takes advantage of our knowledge in an ever increasing variety of scientific disciplines. Some may originate from very diverse sources, one of which is the Space Program at National Aeronautics and Space Administration (NASA). The Space Program contributes to diabetes-related research in several treatment modalities. As an ongoing effort for medical monitoring of personnel involved in space exploration activities NASA and the extramural scientific community investigate strategies for noninvasive estimation of blood glucose levels. Part of the effort in the space protein crystal growth program is high-resolution structural analysis insulin as a means to better understand the interaction with its receptor and with host immune components and as a basis for rational design of a "better" insulin molecule. The Space Program is also developing laser technology for potential early cataract detection as well as a noninvasive analyses for addressing preclinical diabetic retinopathy. Finally, NASA developed an exciting cell culture system that affords some unique advantages in the propagation and maintenance of mammalian cells in vitro. The cell culture system was originally designed to maintain cell suspensions with a minimum of hydrodynamic and mechanical sheer while awaiting launch into microgravity. Currently the commercially available NASA bioreactor (Synthecon, Inc., Houston, TX) is used as a research tool in basic and applied cell biology. In recent years there is continued strong interest in cellular transplantation as treatment for type I diabetes. The advantages are the potential for successful long-term amelioration and a minimum risk for morbidity in the event of rejection of the transplanted cells. The pathway to successful application of this strategy is accompanied by several substantial hurdles: (1) isolation and propagation of a suitable uniform donor cell population; (2) management of

  2. On path hypercompositions in graphs and automata

    Directory of Open Access Journals (Sweden)

    Massouros Christos G.

    2016-01-01

    Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.

  3. Learning Recursive Automata from Positive Examples

    OpenAIRE

    Tellier, Isabelle

    2006-01-01

    National audience; In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial grammars. To this aim, we first study how to translate finite state automata into categorial grammars and back. We then show that the generalization operators employed in both domains can be compared, and that their result can always be represented by generalized automata, called "recursive automata". The relati...

  4. A Mean Field Game Approach to Scheduling in Cellular Systems

    OpenAIRE

    Manjrekar, Mayank; Ramaswamy, Vinod; Shakkottai, Srinivas

    2013-01-01

    We study auction-theoretic scheduling in cellular networks using the idea of mean field equilibrium (MFE). Here, agents model their opponents through a distribution over their action spaces and play the best response. The system is at an MFE if this action is itself a sample drawn from the assumed distribution. In our setting, the agents are smart phone apps that generate service requests, experience waiting costs, and bid for service from base stations. We show that if we conduct a second-pr...

  5. Cellular and Molecular Biological Approaches to Interpreting Ancient Biomarkers

    Science.gov (United States)

    Newman, Dianne K.; Neubauer, Cajetan; Ricci, Jessica N.; Wu, Chia-Hung; Pearson, Ann

    2016-06-01

    Our ability to read the molecular fossil record has advanced significantly in the past decade. Improvements in biomarker sampling and quantification methods, expansion of molecular sequence databases, and the application of genetic and cellular biological tools to problems in biomarker research have enabled much of this progress. By way of example, we review how attempts to understand the biological function of 2-methylhopanoids in modern bacteria have changed our interpretation of what their molecular fossils tell us about the early history of life. They were once thought to be biomarkers of cyanobacteria and hence the evolution of oxygenic photosynthesis, but we now believe that 2-methylhopanoid biosynthetic capacity originated in the Alphaproteobacteria, that 2-methylhopanoids are regulated in response to stress, and that hopanoid 2-methylation enhances membrane rigidity. We present a new interpretation of 2-methylhopanes that bridges the gap between studies of the functions of 2-methylhopanoids and their patterns of occurrence in the rock record.

  6. Learning about Cellular Respiration: An Active Approach Illustrating the Process of Scientific Inquiry.

    Science.gov (United States)

    Johnson, Margaret (Peg)

    1998-01-01

    Details the active-learning approach to teaching cellular respiration in an introductory, one-semester course for nonmajors. Focuses on a laboratory exercise designed to answer the question of what happens to food when eaten. Contains 19 references. (DDR)

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

  8. Beyond Language Equivalence on Visibly Pushdown Automata

    DEFF Research Database (Denmark)

    Srba, Jiri

    2009-01-01

    We study (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied...

  9. Parrondo games as lattice gas automata

    OpenAIRE

    Meyer, David A.; Blumer, Heather

    2001-01-01

    Parrondo games are coin flipping games with the surprising property that alternating plays of two losing games can produce a winning game. We show that this phenomenon can be modelled by probabilistic lattice gas automata. Furthermore, motivated by the recent introduction of quantum coin flipping games, we show that quantum lattice gas automata provide an interesting definition for quantum Parrondo games.

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

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

  12. GPM ground validation via commercial cellular networks: an exploratory approach

    Science.gov (United States)

    Rios Gaona, Manuel Felipe; Overeem, Aart; Leijnse, Hidde; Brasjen, Noud; Uijlenhoet, Remko

    2016-04-01

    The suitability of commercial microwave link networks for ground validation of GPM (Global Precipitation Measurement) data is evaluated here. Two state-of-the-art rainfall products are compared over the land surface of the Netherlands for a period of 7 months, i.e., rainfall maps from commercial cellular communication networks and Integrated Multi-satellite Retrievals for GPM (IMERG). Commercial microwave link networks are nowadays the core component in telecommunications worldwide. Rainfall rates can be retrieved from measurements of attenuation between transmitting and receiving antennas. If adequately set up, these networks enable rainfall monitoring tens of meters above the ground at high spatiotemporal resolutions (temporal sampling of seconds to tens of minutes, and spatial sampling of hundreds of meters to tens of kilometers). The GPM mission is the successor of TRMM (Tropical Rainfall Measurement Mission). For two years now, IMERG offers rainfall estimates across the globe (180°W - 180°E and 60°N - 60°S) at spatiotemporal resolutions of 0.1° x 0.1° every 30 min. These two data sets are compared against a Dutch gauge-adjusted radar data set, considered to be the ground truth given its accuracy, spatiotemporal resolution and availability. The suitability of microwave link networks in satellite rainfall evaluation is of special interest, given the independent character of this technique, its high spatiotemporal resolutions and availability. These are valuable assets for water management and modeling of floods, landslides, and weather extremes; especially in places where rain gauge networks are scarce or poorly maintained, or where weather radar networks are too expensive to acquire and/or maintain.

  13. a Web Service Approach for Linking Sensors and Cellular Spaces

    Science.gov (United States)

    Isikdag, U.

    2013-09-01

    More and more devices are starting to be connected to the Internet. In the future the Internet will not only be a communication medium for people, it will in fact be a communication environment for devices. The connected devices which are also referred as Things will have an ability to interact with other devices over the Internet, i.) provide information in interoperable form and ii.) consume /utilize such information with the help of sensors embedded in them. This overall concept is known as Internet-of- Things (IoT). This requires new approaches to be investigated for system architectures to establish relations between spaces and sensors. The research presented in this paper elaborates on an architecture developed with this aim, i.e. linking spaces and sensors using a RESTful approach. The objective is making spaces aware of (sensor-embedded) devices, and making devices aware of spaces in a loosely coupled way (i.e. a state/usage/function change in the spaces would not have effect on sensors, similarly a location/state/usage/function change in sensors would not have any effect on spaces). The proposed architecture also enables the automatic assignment of sensors to spaces depending on space geometry and sensor location.

  14. On the secure obfuscation of deterministic finite automata.

    Energy Technology Data Exchange (ETDEWEB)

    Anderson, William Erik

    2008-06-01

    In this paper, we show how to construct secure obfuscation for Deterministic Finite Automata, assuming non-uniformly strong one-way functions exist. We revisit the software protection approaches originally proposed by [5, 10, 12, 17] and revise them to the current obfuscation setting of Barak et al. [2]. Under this model, we introduce an efficient oracle that retains some 'small' secret about the original program. Using this secret, we can construct an obfuscator and two-party protocol that securely obfuscates Deterministic Finite Automata against malicious adversaries. The security of this model retains the strong 'virtual black box' property originally proposed in [2] while incorporating the stronger condition of dependent auxiliary inputs in [15]. Additionally, we show that our techniques remain secure under concurrent self-composition with adaptive inputs and that Turing machines are obfuscatable under this model.

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

  16. Learning automata theory and applications

    CERN Document Server

    Najim, K

    1994-01-01

    Learning systems have made a significant impact on all areas of engineering problems. They are attractive methods for solving many problems which are too complex, highly non-linear, uncertain, incomplete or non-stationary, and have subtle and interactive exchanges with the environment where they operate. The main aim of the book is to give a systematic treatment of learning automata and to produce a guide to a wide variety of ideas and methods that can be used in learning systems, including enough theoretical material to enable the user of the relevant techniques and concepts to understand why

  17. Edit Distance for Pushdown Automata

    OpenAIRE

    Chatterjee, Krishnendu; Henzinger, Thomas A.; Ibsen-Jensen, Rasmus; Otop, Jan

    2015-01-01

    The edit distance between two words $w_1, w_2$ is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform $w_1$ to $w_2$. The edit distance generalizes to languages ${\\cal L}_1, {\\cal L}_2$, where the edit distance is the minimal number $k$ such that for every word from ${\\cal L}_1$ there exists a word in ${\\cal L}_2$ with edit distance at most $k$. We study the edit distance computation problem between pushdown automata and their subclas...

  18. Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages

    OpenAIRE

    Golovkins, Marats; Kravtsev, Maksim; Kravcevs, Vasilijs

    2011-01-01

    We study the recognition of R-trivial idempotent (R1) languages by various models of "decide-and-halt" quantum finite automata (QFA) and probabilistic reversible automata (DH-PRA). We introduce bistochastic QFA (MM-BQFA), a model which generalizes both Nayak's enhanced QFA and DH-PRA. We apply tools from algebraic automata theory and systems of linear inequalities to give a complete characterization of R1 languages recognized by all these models. We also find that "forbidden constructions" kn...

  19. Towards a voxel-based geographic automata for the simulation of geospatial processes

    Science.gov (United States)

    Jjumba, Anthony; Dragićević, Suzana

    2016-07-01

    Many geographic processes evolve in a three dimensional space and time continuum. However, when they are represented with the aid of geographic information systems (GIS) or geosimulation models they are modelled in a framework of two-dimensional space with an added temporal component. The objective of this study is to propose the design and implementation of voxel-based automata as a methodological approach for representing spatial processes evolving in the four-dimensional (4D) space-time domain. Similar to geographic automata models which are developed to capture and forecast geospatial processes that change in a two-dimensional spatial framework using cells (raster geospatial data), voxel automata rely on the automata theory and use three-dimensional volumetric units (voxels). Transition rules have been developed to represent various spatial processes which range from the movement of an object in 3D to the diffusion of airborne particles and landslide simulation. In addition, the proposed 4D models demonstrate that complex processes can be readily reproduced from simple transition functions without complex methodological approaches. The voxel-based automata approach provides a unique basis to model geospatial processes in 4D for the purpose of improving representation, analysis and understanding their spatiotemporal dynamics. This study contributes to the advancement of the concepts and framework of 4D GIS.

  20. Lattice polymer automata

    Energy Technology Data Exchange (ETDEWEB)

    Rasmussen, S. [Los Alamos National Lab., NM (United States)]|[Santa Fe Institute, NM (United States); Smith, J.R. [Santa Fe Institute, NM (United States)]|[Massachusetts Media Lab., Cambridge, MA (United States). Physics and Media Group

    1995-05-01

    We present a new style of molecular dynamics and self-assembly simulation, the Lattice Polymer Automaton (LPA). In the LPA all interactions, including electromagnetic forces, are decomposed and communicated via propagating particles, {open_quotes}photons.{close_quotes} The monomer-monomer bondforces, the molecular excluded volume forces, the longer range intermolecular forces, and the polymer-solvent interactions may all be modeled with propagating particles. The LPA approach differs significantly from both of the standard approaches, Monte Carlo lattice methods and Molecular Dynamics simulations. On the one hand, the LPA provides more realism than Monte Carlo methods, because it produces a time series of configurations of a single molecule, rather than a set of causally unrelated samples from a distribution of configurations. The LPA can therefore be used directly to study dynamical properties; one can in fact watch polymers move in real time. On the other hand, the LPA is fully discrete, and therefore much simpler than traditional Molecular Dynamics models, which are continuous and operate on much shorter time scales. Due to this simplicity it is possible to simulate longer real time periods, which should enable the study of molecular self-organization on workstations supercomputers are not needed.

  1. Simulation of plant communities with a cellular automaton

    Energy Technology Data Exchange (ETDEWEB)

    Gassmann, F. [Paul Scherrer Inst. (PSI), Villigen (Switzerland)

    1999-08-01

    With a modelling approach based on cellular automata, five observed types of plant development can be simulated. In addition, the proposed model shows a strong tendency towards the formation of patches and a high degree of dynamical and structural instability leading to limits of predictability for the asymptotic solution chosen by the system among several possible metastable patterns (multistability). Further, external fluctuations can be shown to have advantages for certain plant types. The presented model unifies the fundamental dichotomy in vegetation dynamics between determinism (understood as predictability) and disorder (chance effects) by showing the outcome of both classical theories as special cases. (author) 2 figs., 4 refs.

  2. TRAFFIC FLOW MODEL BASED ON CELLULAR AUTOMATION WITH ADAPTIVE DECELERATION

    OpenAIRE

    Shinkarev, A. A.

    2016-01-01

    This paper describes continuation of the authors’ work in the field of traffic flow mathematical models based on the cellular automata theory. The refactored representation of the multifactorial traffic flow model based on the cellular automata theory is used for a representation of an adaptive deceleration step implementation. The adaptive deceleration step in the case of a leader deceleration allows slowing down smoothly but not instantly. Concepts of the number of time steps without confli...

  3. 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.%关于雪花生长过程的计算机模拟已经受到了广泛关注.其中,元胞自动化模型是一种基于网格和简单规则的计算方法.尽管这是一种简单的模型,但其在模拟复杂过程(比如:生命现象,晶体生长和湍流)时往往能取得较好的结果.提出了一种由传统的二维模型扩展而来的三维雪花晶体生长方法.计算机模拟结果显示提出的方法能够更精确地模拟出三维雪花的晶体化过程.

  4. Combinatorics of Boolean automata circuits dynamics

    OpenAIRE

    Demongeot, Jacques; Noual, Mathilde; Sené, Sylvain

    2012-01-01

    International audience In line with fields of theoretical computer science and biology that study Boolean automata networks to model regulation networks, we present some results concerning the dynamics of networks whose underlying structures are oriented cycles, that is, Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of the biological networks that contain them. Our work fo...

  5. A Case-Based Approach Increases Student Learning Outcomes and Comprehension of Cellular Respiration Concepts

    Science.gov (United States)

    Rybarczyk, Brian J.; Baines, Antonio T.; McVey, Mitch; Thompson, Joseph T.; Wilkins, Heather

    2007-01-01

    This study investigated student learning outcomes using a case-based approach focused on cellular respiration. Students who used the case study, relative to students who did not use the case study, exhibited a significantly greater learning gain, and demonstrated use of higher-order thinking skills. Preliminary data indicate that after engaging…

  6. Bayesian approaches to reverse engineer cellular systems: a simulation study on nonlinear Gaussian networks

    Directory of Open Access Journals (Sweden)

    Ramoni Marco F

    2007-05-01

    Full Text Available Abstract Background Reverse engineering cellular networks is currently one of the most challenging problems in systems biology. Dynamic Bayesian networks (DBNs seem to be particularly suitable for inferring relationships between cellular variables from the analysis of time series measurements of mRNA or protein concentrations. As evaluating inference results on a real dataset is controversial, the use of simulated data has been proposed. However, DBN approaches that use continuous variables, thus avoiding the information loss associated with discretization, have not yet been extensively assessed, and most of the proposed approaches have dealt with linear Gaussian models. Results We propose a generalization of dynamic Gaussian networks to accommodate nonlinear dependencies between variables. As a benchmark dataset to test the new approach, we used data from a mathematical model of cell cycle control in budding yeast that realistically reproduces the complexity of a cellular system. We evaluated the ability of the networks to describe the dynamics of cellular systems and their precision in reconstructing the true underlying causal relationships between variables. We also tested the robustness of the results by analyzing the effect of noise on the data, and the impact of a different sampling time. Conclusion The results confirmed that DBNs with Gaussian models can be effectively exploited for a first level analysis of data from complex cellular systems. The inferred models are parsimonious and have a satisfying goodness of fit. Furthermore, the networks not only offer a phenomenological description of the dynamics of cellular systems, but are also able to suggest hypotheses concerning the causal interactions between variables. The proposed nonlinear generalization of Gaussian models yielded models characterized by a slightly lower goodness of fit than the linear model, but a better ability to recover the true underlying connections between

  7. Non deterministic finite automata for power systems fault diagnostics

    Directory of Open Access Journals (Sweden)

    LINDEN, R.

    2009-06-01

    Full Text Available This paper introduces an application based on finite non-deterministic automata for power systems diagnosis. Automata for the simpler faults are presented and the proposed system is compared with an established expert system.

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

  9. Cellular automaton for chimera states

    OpenAIRE

    García-Morales, Vladimir

    2016-01-01

    A minimalistic model for chimera states is presented. The model is a cellular automaton (CA) which depends on only one adjustable parameter, the range of the nonlocal coupling, and is built from elementary cellular automata and the majority (voting) rule. This suggests the universality of chimera-like behavior from a new point of view: Already simple CA rules based on the majority rule exhibit this behavior. After a short transient, we find chimera states for arbitrary initial conditions, the...

  10. Linear matrix inequality approach for synchronization control of fuzzy cellular neural networks with mixed time delays

    Institute of Scientific and Technical Information of China (English)

    P. Balasubramaniam; M. Kalpana; R. Rakkiyappan

    2012-01-01

    Fuzzy cellular neural networks (FCNNs) are special kinds of cellular neural networks (CNNs).Each cell in an FCNN contains fuzzy operating abilities.The entire network is governed by cellular computing laws.The design of FCNNs is based on fuzzy local rules.In this paper,a linear matrix inequality (LMI) approach for synchronization control of FCNNs with mixed delays is investigated.Mixed delays include discrete time-varying delays and unbounded distributed delays.A dynamic control scheme is proposed to achieve the synchronization between a drive network and a response network.By constructing the Lyapunov-Krasovskii functional which contains a triple-integral term and the free-weighting matrices method an improved delay-dependent stability criterion is derived in terms of LMIs.The controller can be easily obtained by solving the derived LMIs.A numerical example and its simulations are presented to illustrate the effectiveness of the proposed method.

  11. Resource Allocation for Multicell Device-to-Device Communications in Cellular Network: A Game Theoretic Approach

    Directory of Open Access Journals (Sweden)

    Jun Huang

    2015-08-01

    Full Text Available Device-to-Device (D2D communication has recently emerged as a promising technology to improve the capacity and coverage of cellular systems. To successfully implement D2D communications underlaying a cellular network, resource allocation for D2D links plays a critical role. While most of prior resource allocation mechanisms for D2D communications have focused on interference within a single-cell system, this paper investigates the resource allocation problem for a multicell cellular network in which a D2D link reuses available spectrum resources of multiple cells. A repeated game theoretic approach is proposed to address the problem. In this game, the base stations (BSs act as players that compete for resource supply of D2D, and the utility of each player is formulated as revenue collected from both cellular and D2D users using resources. Extensive simulations are conducted to verify the proposed approach and the results show that it can considerably enhance the system performance in terms of sum rate and sum rate gain.

  12. Inclusion Matching Implementation of Automata Modulo Theory (AMT)

    OpenAIRE

    Massacci, Fabio; Siahaan, Ida

    2009-01-01

    The traditional realm of formal methods is the off-line verification of formal properties of hardware and software. In this technical report we describe a different approach that uses formal methods (namely the integration of automata modulo theory with decision procedures) on-the-fly, at the time an application is downloaded on a mobile application such as PDA or a smart phone. We also describe its integration with decision solver based on MathSAT and NuSMV, and the results of our experiments ...

  13. Reversible elementary cellular automaton with rule number 150 and periodic boundary conditions over 𝔽p

    Science.gov (United States)

    Martín Del Rey, A.; Rodríguez Sánchez, G.

    2015-03-01

    The study of the reversibility of elementary cellular automata with rule number 150 over the finite state set 𝔽p and endowed with periodic boundary conditions is done. The dynamic of such discrete dynamical systems is characterized by means of characteristic circulant matrices, and their analysis allows us to state that the reversibility depends on the number of cells of the cellular space and to explicitly compute the corresponding inverse cellular automata.

  14. On the use of spin glass concepts in random automata networks

    Energy Technology Data Exchange (ETDEWEB)

    Miranda, E.N.; Parga, N.

    1988-06-01

    We apply concepts and techniques developed in the context of the mean-field theory of spin glasses to networks of random automata. This approach, proposed recently by Derrida and Flyvbjerg, may be useful in understanding the multivalley structure of the Kauffman model.

  15. Mimo radar waveform design for spectrum sharing with cellular systems a Matlab based approach

    CERN Document Server

    Khawar, Awais; Clancy, T Charles

    2016-01-01

    This book discusses spectrum sharing between cellular systems and radars. The book addresses a novel way to design radar waveforms that can enable spectrum sharing between radars and communication systems, without causing interference to communication systems, and at the same time achieving radar objectives of target detection, estimation, and tracking. The book includes a MATLAB-based approach, which provides reader with a way to learn, experiment, compare, and build on top of existing algorithms.

  16. A Computation in a Cellular Automaton Collider Rule 110

    CERN Document Server

    Martinez, Genaro J; McIntosh, Harold V

    2016-01-01

    A cellular automaton collider is a finite state machine build of rings of one-dimensional cellular automata. We show how a computation can be performed on the collider by exploiting interactions between gliders (particles, localisations). The constructions proposed are based on universality of elementary cellular automaton rule 110, cyclic tag systems, supercolliders, and computing on rings.

  17. 双目标推动下群体行为的元胞自动机模拟%Cellular automata simulation of group behavior driven by dual-targets

    Institute of Scientific and Technical Information of China (English)

    姚灿中; 杨建梅

    2012-01-01

    采用元胞自动机对自推动粒子改进模型进行模拟,在此基础上分别探讨无目标与双目标群体行为的演化特征.无目标条件下群体行为的元胞模拟结果显示低密度环境下大部分个体处于动态均衡,高密度环境下大部分个体处于静态均衡,中等密度下两种均衡均存在.基于双目标吸引力的群体行为模拟结果显示当智能体的理性程度较低时系统演化能够产生一定的集聚效应,处于吸引源以外的智能体与吸引源保持一定距离并呈湍流式运动,而当智能体具备小概率全局理性判断能力时,群体行为的演化结果为大部分智能体都聚集在吸引源附近.%This paper improves the self-propelled particle models by cellular automaton; through this model, the evolution characteristic of group behaviors is further studied in the conditions of non-target and dual-targets. The group behaviors simulation under the non-target condition shows that most individuals reach the dynamic equilibrium in low-density environment, most individuals are in static equilibrium in high-density environment, and both the static and the dynamic equilibrium exist in medium-density environment. The simulation results of group behaviors based on dual-targets attractiveness model show that when the agent's rational level is low, the system evolution can produce the concentration effect to a certain extent, and the agents outside the attracted source region maintain a certain distance with the source and the movement is turbulent. When the agents have the small probability of global rationality, the evolution results of group behaviors show that most agents gather in the vicinity of the attractive source.

  18. Constructing Finite Automata with Invertibility by Transformation Method

    Institute of Scientific and Technical Information of China (English)

    TAO Renji; CHEN Shihua

    2000-01-01

    Ra, Pb transformations were successfully applied to establish invertibility theory for linear and quasi-linear finite automata over finite fields. In a previous paper, the authors generalized Ra, Rb transformations to deal with nonlinear memory finite automata, and gave sufficient conditions for weak inverse and for weakly invertible memory finite automata and inversion processes concerned;methods by transformation to generate a kind of nonlinear memory finite automata satisfying one of these sufficient conditions were also given.This paper extends the concepts, methods and results to general finite automata, in which states consist of finite input history, finite output history and finite "inner state" history.

  19. Automata theory based on complete residuated lattice-valued logic

    Institute of Scientific and Technical Information of China (English)

    邱道文

    2001-01-01

    This paper establishes a fundamental framework of automata theory based on complete residuated lattice-valued logic. First it deals with how to extend the transition relation of states and particularly presents a characterization of residuated lattice by fuzzy automata (called valued automata).After that fuzzy subautomata (called valued subautomata), successor and source operators are proposed and their basic properties as well as the equivalent relation among them are discussed, from which it follows that the two fuzzy operators are exactly fuzzy closure operators. Finally an L bifuzzy topological characterization of valued automata is presented, so a more generalized fuzzy automata theory is built.

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

  1. Integrated approaches for assessment of cellular performance in industrially relevant filamantous fungi

    DEFF Research Database (Denmark)

    Workman, Mhairi; Andersen, Mikael Rørdam; Thykær, Jette

    2013-01-01

    The performance of filamentous fungi in submerged cultivation determines their suitability for large-scale industrial biotechnology processes and is the result of complex interplay between the physical and chemical parameters of the process and the cellular biology of the fungi. Filamentous fungi...... biotechnology , focusing on physiological aspects of the fungi that provide the basis of their cellular performance. We also discuss the advancement of systems biology approaches and how the establishment of these tools for fungal research has begun to reveal the possibilities for further exploitation...... of these organisms. Increased future focus on multicellular physiology and relevant assays will lead to fungal cells and processes that are customizable to a greater degree, finally allowing the full potential of these complex organisms and their product diversity to unfold....

  2. Blackhole State-Controlled Regulated Pushdown Automata

    NARCIS (Netherlands)

    Csuhaj-Varju, E.; Masopust, T.; Vaszil, G.; Bordihn, H.; Freund, R.; Hinze, T.; Holzer, M.; Kutrib, M.; Otto, F.

    2010-01-01

    In this paper, we introduce and study a variant of regulated pushdown automata, called blackhole state-controlled R-PDA where a symbol can always be pushed to the pushdown, but only a given depth of the pushdown contents is remembered; the rest of the pushdown contents is lost. In addition, the auto

  3. On Probabilistic Automata in Continuous Time

    DEFF Research Database (Denmark)

    Eisentraut, Christian; Hermanns, Holger; Zhang, Lijun

    2010-01-01

    We develop a compositional behavioural model that integrates a variation of probabilistic automata into a conservative extension of interactive Markov chains. The model is rich enough to embody the semantics of generalised stochastic Petri nets. We define strong and weak bisimulations and discuss...

  4. Minimization of Fuzzy Finite Generalized Automata

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Some concepts in Fuzzy Generalized Automata (FGA) are established. Then an important new algorithm which would calculate the minimal FGA is given. The new algorithm is composed of two parts: the first is called E-reduction which contracts equivalent states, and the second is called RE-reduction which removes retrievable states. Finally an example is given to illuminate the algorithm of minimization.

  5. Solving multiconstraint assignment problems using learning automata.

    Science.gov (United States)

    Horn, Geir; Oommen, B John

    2010-02-01

    This paper considers the NP-hard problem of object assignment with respect to multiple constraints: assigning a set of elements (or objects) into mutually exclusive classes (or groups), where the elements which are "similar" to each other are hopefully located in the same class. The literature reports solutions in which the similarity constraint consists of a single index that is inappropriate for the type of multiconstraint problems considered here and where the constraints could simultaneously be contradictory. This feature, where we permit possibly contradictory constraints, distinguishes this paper from the state of the art. Indeed, we are aware of no learning automata (or other heuristic) solutions which solve this problem in its most general setting. Such a scenario is illustrated with the static mapping problem, which consists of distributing the processes of a parallel application onto a set of computing nodes. This is a classical and yet very important problem within the areas of parallel computing, grid computing, and cloud computing. We have developed four learning-automata (LA)-based algorithms to solve this problem: First, a fixed-structure stochastic automata algorithm is presented, where the processes try to form pairs to go onto the same node. This algorithm solves the problem, although it requires some centralized coordination. As it is desirable to avoid centralized control, we subsequently present three different variable-structure stochastic automata (VSSA) algorithms, which have superior partitioning properties in certain settings, although they forfeit some of the scalability features of the fixed-structure algorithm. All three VSSA algorithms model the processes as automata having first the hosting nodes as possible actions; second, the processes as possible actions; and, third, attempting to estimate the process communication digraph prior to probabilistically mapping the processes. This paper, which, we believe, comprehensively reports the

  6. Improving Quality of Clustering using Cellular Automata for Information retrieval

    OpenAIRE

    Sree, Pokkuluri Kiran; Babu, Inampudi Ramesh

    2014-01-01

    Clustering has been widely applied to Information Retrieval (IR) on the grounds of its potential improved effectiveness over inverted file search. Clustering is a mostly unsupervised procedure and the majority of the clustering algorithms depend on certain assumptions in order to define the subgroups present in a data set .A clustering quality measure is a function that, given a data set and its partition into clusters, returns a non-negative real number representing the quality of that clust...

  7. Application of Cellular Automata to Detection of Malicious Network Packets

    Science.gov (United States)

    Brown, Robert L.

    2014-01-01

    A problem in computer security is identification of attack signatures in network packets. An attack signature is a pattern of bits that characterizes a particular attack. Because there are many kinds of attacks, there are potentially many attack signatures. Furthermore, attackers may seek to avoid detection by altering the attack mechanism so that…

  8. Cellular Automata and Artificia Intelligence in Ecohydraulics Modellin

    NARCIS (Netherlands)

    Chen, Q.

    2004-01-01

    Recent international events like the UN Summit in Johannesburg (2002) and the3rd World Water Forum in Kyoto (2003) are reemphasising the importanee of meeting the difficult challenges related to the sustainable development of water and environment. Direct actions are proclaimed on improving water re

  9. Evolution of cooperation in Axelrod tournament using cellular automata

    Science.gov (United States)

    Schimit, P. H. T.; Santos, B. O.; Soares, C. A.

    2015-11-01

    Results of the Axelrod Tournament were published in 1981, and since then, evolutionary game theory emerged as an idea for understanding relations, like conflict and cooperation, between rational decision-makers. Robert Axelrod organized it as a round-robin tournament where strategies for iterated Prisoner's Dilemma were faced in a sequence of two players game. Here, we attempt to simulate the strategies submitted to the tournament in a multi-agent context, where individuals play a two-player game with their neighbors. Each individual has one of the strategies, and it plays the Prisoner's Dilemma with its neighbors. According to actions chosen (cooperate or defect), points of life are subtracted from their profiles. When an individual dies, some fitness functions are defined to choose the most successful strategy which the new individual will copy. Although tit-for-tat was the best strategy, on average, in the tournament, in our evolutionary multi-agent context, it has not been successful.

  10. Cellular automata pedestrian movement model considering human behavior

    Institute of Scientific and Technical Information of China (English)

    YANG Lizhong; FANG Weifeng; LI Jian; HUANG Rui; FAN Weicheng

    2003-01-01

    The pedestrian movement is more complex than vehicular flow for the reason that people are more flexible and intelligent than car. Without the limit of "lanes" pedestrian movement is loose and free. Furthermore, they are easily affected by other walkers as well as the environment around. In this paper some special technique is introduced considering human behavior to make the rules more reasonable. By simulating the two-dimension pedestrian movement, the phase transition phenomena of pedestrian movement, including the up walkers moving from the bottom to the upper boundary and the right walkers moving from the left to the right boundary, are presented. Studying on the effect of the system size on the critical density shows that the critical density is independent of the system size in the scope studied in this paper.

  11. Cellular automata cell structure for modeling heterogeneous traffic

    OpenAIRE

    Pal, Dibyendu; C.Mallikarjuna

    2010-01-01

    Gap maintaining behavior significantly affects the traffic flow modeling under heterogeneous traffic conditions. The clearance between two adjacent moving vehicles varies depending on several traffic conditions. From the data collected on the gap maintaining behavior it has been observed that vehicles maintain different gaps when travelling under different traffic conditions and this is also influenced by lateral position of the vehicle. Mallikarjuna (2007) has found that this variable gap ma...

  12. Finite automata, their algebras and grammars towards a theory of formal expressions

    CERN Document Server

    Büchi, J Richard

    1989-01-01

    The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Büchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and aga...

  13. Stability analysis of switched cellular neural networks: A mode-dependent average dwell time approach.

    Science.gov (United States)

    Huang, Chuangxia; Cao, Jie; Cao, Jinde

    2016-10-01

    This paper addresses the exponential stability of switched cellular neural networks by using the mode-dependent average dwell time (MDADT) approach. This method is quite different from the traditional average dwell time (ADT) method in permitting each subsystem to have its own average dwell time. Detailed investigations have been carried out for two cases. One is that all subsystems are stable and the other is that stable subsystems coexist with unstable subsystems. By employing Lyapunov functionals, linear matrix inequalities (LMIs), Jessen-type inequality, Wirtinger-based inequality, reciprocally convex approach, we derived some novel and less conservative conditions on exponential stability of the networks. Comparing to ADT, the proposed MDADT show that the minimal dwell time of each subsystem is smaller and the switched system stabilizes faster. The obtained results extend and improve some existing ones. Moreover, the validness and effectiveness of these results are demonstrated through numerical simulations.

  14. Structure of Weakly Invertible Semi-Input-Memory Finite Automata with Delay 2

    Institute of Scientific and Technical Information of China (English)

    陶仁骥; 陈世华

    2002-01-01

    Semi-input-memory finite automata, a kind of finite automata introduced bythe author of this paper for studying error propagation, are a generalization of input-memoryfinite automata by appending an autonomous finite automaton component. This paper gives acharacterization on the structure of weakly invertible semi-input-memory finite automata withdelay 2 in which input alphabets and output alphabets have two elements and autonomousfinite automata are cyclic. For the structure of feedforward inverse finite automata with delay2, Zhu first gave a characterization; from a result on mutual invertibility of finite automata, theresult mentioned above also leads to a different characterization on the structure of feedforwardinverse finite automata with delay 2.

  15. Reversible Multi-Head Finite Automata Characterize Reversible Logarithmic Space

    DEFF Research Database (Denmark)

    Axelsen, Holger Bock

    2012-01-01

    Deterministic and non-deterministic multi-head finite automata are known to characterize the deterministic and non- deterministic logarithmic space complexity classes, respectively. Recently, Morita introduced reversible multi-head finite automata (RMFAs), and posed the question of whether RMFAs...... characterize reversible logarithmic space as well. Here, we resolve the question affirmatively, by exhibiting a clean RMFA simulation of logarithmic space reversible Turing machines. Indirectly, this also proves that reversible and deterministic multi-head finite automata recognize the same languages....

  16. Deterministic recognizability of picture languages with Wang automata

    OpenAIRE

    V. Lonati; M. Pradella

    2010-01-01

    special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications International audience We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessellation acceptors and 4-way automata: as in online tessellation acceptors, computation assigns states to each picture position; as in 4-way automata, the input head visits the pictur...

  17. Thixoinfiltration: a new approach to produce cellular and other low density metallic materials

    Directory of Open Access Journals (Sweden)

    M.H. Robert

    2010-06-01

    Full Text Available Purpose: the work presents an innovative approach for the production of cellular metallic materials as well as low density metal matrix composites, by using thixoforming techniques; thixotropic semisolid metal is infiltrated into removable and non-removable space holder preforms. Different kinds of preforms are tested to obtain open cell material (sponges, syntactic foams and low density composites. Products are evaluated concerning relative density and mechanical behavior under compressive stresses.Design/methodology/approach: Al alloy AA2011 was infiltrated in the semisolid state into preforms of sintered NaCl particles, sintered glass spheres, vermicular ceramic particles and porous ceramic granulates. After solidification, preforms were either removed by leaching (NaCl resulting in open cell cellular product, or not (all others, resulting in composites of low density. Tomography tests were used to observe internal quality, and semi-static and dynamic compression tests were performed to evaluate the deformation ability of the material.Findings: results show that thixoinfiltration is a simple and low cost technique to produce different types of low density, porous material. Open cell material as well as syntactic foams and low density composites can be produced with reliable internal quality and dispersion of cells and reinforcement. Composites containing porous reinforcements can present some mechanical characteristics of the conventional cellular metals.Research limitations/implications: as all new developments, the complete understanding of the influence of processing variables upon the final quality of the product, as well as its consistency, must be provided before the technology can be widely used commercially.Practical implications: the technique can represent an alternative, low cost processing route for the fabrication of sponges, foams and low density composites, which can avoid restrictions and operational difficulties of presently

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

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

  20. 基于灰色模型-元胞自动机模型的佛山市土地利用情景模拟分析%Land use scenarios simulation of Foshan city based on gray model and cellular automata model

    Institute of Scientific and Technical Information of China (English)

    王丽萍; 金晓斌; 杜心栋; 周寅康

    2012-01-01

    LUCC model is an efficient tool to analysis the processes and consequences of land use systems, and to support land use planning and policy. According to the problem that constructive land expansion is the main reason for land use change in Foshan city, based on remote sensing data of land use change with spatial resolution of 30 m, the paper choose grey model as quantitative model and the cellular automata model as spatial model to simulate the land use pattern of 2015 by setting different scenario conditions. Results showed that in three kinds of expansion circumstances of.constructive land, the area of constructive land increased 27 830 、 21 645 and 15 461 hm2 respectively, the corresponding proportion of the cultivated land was 42.28%, 48.38% and 55.96% respectively. This indicates that cultivated land is still the main source of constructive land expansion, the contradiction between cultivated land protection and economic development will further expend.%通过模拟土地利用变化情景,了解土地利用变化趋势,可为制定科学的土地利用管理策略提供支持,根据近年来建设用地扩张在佛山市土地利用类型变化中占主导地位的特点,选择灰色模型作为数量模型,元胞自动机模型作为空间模型,设定3种建设用地扩张情景:适度约束、中度约束和强力约束,结合数量模型和空间模型的优点,模拟2015年土地利用空间布局.研究结果表明:在设定的3种建设用地扩张情景下,建设用地增加的面积分别为278.3、216.5和154.6 km2,相应来源于耕地的比率分别为42.28%、48.38%和55.96%,说明耕地仍然是建设用地增加的主要来源,也即耕地保护和经济发展的矛盾将会进一步增大,可为政府和土地管理部门制定政策提供一定的参考,从而采取更有针对性的措施.

  1. Simulation of emotional contagion using modified SIR model: A cellular automaton approach

    Science.gov (United States)

    Fu, Libi; Song, Weiguo; Lv, Wei; Lo, Siuming

    2014-07-01

    Emotion plays an important role in the decision-making of individuals in some emergency situations. The contagion of emotion may induce either normal or abnormal consolidated crowd behavior. This paper aims to simulate the dynamics of emotional contagion among crowds by modifying the epidemiological SIR model to a cellular automaton approach. This new cellular automaton model, entitled the “CA-SIRS model”, captures the dynamic process ‘susceptible-infected-recovered-susceptible', which is based on SIRS contagion in epidemiological theory. Moreover, in this new model, the process is integrated with individual movement. The simulation results of this model show that multiple waves and dynamical stability around a mean value will appear during emotion spreading. It was found that the proportion of initial infected individuals had little influence on the final stable proportion of infected population in a given system, and that infection frequency increased with an increase in the average crowd density. Our results further suggest that individual movement accelerates the spread speed of emotion and increases the stable proportion of infected population. Furthermore, decreasing the duration of an infection and the probability of reinfection can markedly reduce the number of infected individuals. It is hoped that this study will be helpful in crowd management and evacuation organization.

  2. A quantitative systems approach reveals dynamic control of tRNA modifications during cellular stress.

    Directory of Open Access Journals (Sweden)

    Clement T Y Chan

    2010-12-01

    Full Text Available Decades of study have revealed more than 100 ribonucleoside structures incorporated as post-transcriptional modifications mainly in tRNA and rRNA, yet the larger functional dynamics of this conserved system are unclear. To this end, we developed a highly precise mass spectrometric method to quantify tRNA modifications in Saccharomyces cerevisiae. Our approach revealed several novel biosynthetic pathways for RNA modifications and led to the discovery of signature changes in the spectrum of tRNA modifications in the damage response to mechanistically different toxicants. This is illustrated with the RNA modifications Cm, m(5C, and m(2 (2G, which increase following hydrogen peroxide exposure but decrease or are unaffected by exposure to methylmethane sulfonate, arsenite, and hypochlorite. Cytotoxic hypersensitivity to hydrogen peroxide is conferred by loss of enzymes catalyzing the formation of Cm, m(5C, and m(2 (2G, which demonstrates that tRNA modifications are critical features of the cellular stress response. The results of our study support a general model of dynamic control of tRNA modifications in cellular response pathways and add to the growing repertoire of mechanisms controlling translational responses in cells.

  3. Giant congenital cellular blue nevus of the scalp: neonatal presentation and approach

    Directory of Open Access Journals (Sweden)

    Debyser M

    2011-12-01

    Full Text Available Martine Debyser1, Sofie De Schepper2, James D'haese1, Veerle De Ketelaere3, Luc Cornette11Neonatal Intensive Care Unit AZ St Jan Bruges-Ostend AV, Bruges, Belgium; 2Department of Dermatology, Ghent University Hospital, Ghent, Belgium; 3Department of Paediatrics, St Rembert Hospital, Torhout, BelgiumAbstract: The authors report the case of a massive vaginal bleeding during labor and delivery, resulting in the birth of a newborn infant in hypovolemic shock. The origin of the bleeding was a giant congenital cellular blue nevus (CBN of the scalp. The report illustrates the crucial role of immediate and aggressive volume resuscitation, suturing of the skin dehiscence, and firm external compression. This therapy was combined with whole-body hypothermia. The neurological outcome of the patient was normal. A shiny blue mass on the scalp should alert neonatologists to the possibility of a blue nevus of the scalp, rather than a simple scalp hematoma. Final diagnosis is made by biopsy and histologic examination. Early surgical intervention is necessary to prevent malignant degeneration and metastasis. A multidisciplinary approach involving a pediatrician/neonatologist, dermatologist, and surgeon is thus needed for diagnosis, treatment, and long-term follow-up.Keywords: neonate, cellular blue nevus, giant blue nevus, giant congenital blue nevus, hemorrhagic shock, whole-body hypothermia

  4. Decidable and undecidable problems about quantum automata

    CERN Document Server

    Blondel, V D; Koiran, P; Portier, N; Blondel, Vincent D.; Jeandel, Emmanuel; Koiran, Pascal; Portier, Natacha

    2003-01-01

    We study the following decision problem: is the language recognized by a quantum finite automaton empty or non-empty? We prove that this problem is decidable or undecidable depending on whether recognition is defined by strict or non-strict thresholds. This result is in contrast with the corresponding situation for probabilistic finite automata for which it is known that strict and non-strict thresholds both lead to undecidable problems.

  5. The Tower of Hanoi and finite automata

    OpenAIRE

    Allouche, Jean-Paul; Shallit, Jeff

    2009-01-01

    Some of the algorithms for solving the Tower of Hanoi puzzle can be applied "with eyes closed" or "without memory". Here we survey the solution for the classical Tower of Hanoi that uses finite automata, as well as some variations on the original puzzle. In passing, we obtain a new result on morphisms generating the classical and the lazy Tower of Hanoi, and a new result on automatic sequences.

  6. Finite Automata with Generalized Acceptance Criteria

    OpenAIRE

    Timo Peichl; Heribert Vollmer

    2001-01-01

    We examine the power of nondeterministic finite automata with acceptance of an input word defined by a leaf language, i.e., a condition on the sequence of leaves in the automaton's computation tree. We study leaf languages either taken from one of the classes of the Chomsky hierarchy, or taken from a time- or space-bounded complexity class. We contrast the obtained results with those known for leaf languages for Turing machines and Boolean circuits.

  7. Modelling Cow Behaviour Using Stochastic Automata

    OpenAIRE

    Jónsson, Ragnar Ingi

    2010-01-01

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

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

  9. A mathematical model in cellular manufacturing system considering subcontracting approach under constraints

    Directory of Open Access Journals (Sweden)

    Kamran Forghani

    2012-10-01

    Full Text Available In this paper, a new mathematical model in cellular manufacturing systems (CMSs has been presented. In order to increase the performance of manufacturing system, the production quantity of parts has been considered as a decision variable, i.e. each part can be produced and outsourced, simultaneously. This extension would be minimized the unused capacity of machines. The exceptional elements (EEs are taken into account and would be totally outsourced to the external supplier in order to remove intercellular material handling cost. The problem has been formulated as a mixed-integer programming to minimize the sum of manufacturing variable costs under budget, machines capacity and demand constraints. Also, to evaluate advantages of the model, several illustrative numerical examples have been provided to compare the performance of the proposed model with the available classical approaches in the literature.

  10. Quantitative Redox Biology: An approach to understanding the role of reactive species in defining the cellular redox environment

    OpenAIRE

    Buettner, Garry R.; Wagner, Brett A.; Victor G J Rodgers

    2013-01-01

    Systems biology is now recognized as a needed approach to understand the dynamics of inter- and intra-cellular processes. Redox processes are at the foundation of nearly all aspects of biology. Free radicals, related oxidants, and antioxidants are central to the basic functioning of cells and tissues. They set the cellular redox environment and therefore are key to regulation of biochemical pathways and networks, thereby influencing organism health. To understand how short-lived, quasi-stable...

  11. Towards Time Automata and Multi-Agent Systems

    Science.gov (United States)

    Hutzler, G.; Klaudel, H.; Wang, D. Y.

    2004-01-01

    The design of reactive systems must comply with logical correctness (the system does what it is supposed to do) and timeliness (the system has to satisfy a set of temporal constraints) criteria. In this paper, we propose a global approach for the design of adaptive reactive systems, i.e., systems that dynamically adapt their architecture depending on the context. We use the timed automata formalism for the design of the agents' behavior. This allows evaluating beforehand the properties of the system (regarding logical correctness and timeliness), thanks to model-checking and simulation techniques. This model is enhanced with tools that we developed for the automatic generation of code, allowing to produce very quickly a running multi-agent prototype satisfying the properties of the model.

  12. Lipids, lipid droplets and lipoproteins in their cellular context; an ultrastructural approach

    NARCIS (Netherlands)

    Mesman, R.J.

    2013-01-01

    Lipids are essential for cellular life, functioning either organized as bilayer membranes to compartmentalize cellular processes, as signaling molecules or as metabolic energy storage. Our current knowledge on lipid organization and cellular lipid homeostasis is mainly based on biochemical data. How

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

  14. An Interface Theory for Input/Output Automata

    DEFF Research Database (Denmark)

    Larsen, Kim Guldstrand; Nyman, Ulrik; Wasowski, Andrzej

    Building on the theory of interface automata by de~Alfaro and Henzinger we design an interface language for Lynch's Input/Output Automata, a popular formalism used in the development of distributed asynchronous systems, not addressed by previous interface research. We introduce an explicit separa...

  15. An empirical Bayesian approach for model-based inference of cellular signaling networks

    Directory of Open Access Journals (Sweden)

    Klinke David J

    2009-11-01

    Full Text Available Abstract Background A common challenge in systems biology is to infer mechanistic descriptions of biological process given limited observations of a biological system. Mathematical models are frequently used to represent a belief about the causal relationships among proteins within a signaling network. Bayesian methods provide an attractive framework for inferring the validity of those beliefs in the context of the available data. However, efficient sampling of high-dimensional parameter space and appropriate convergence criteria provide barriers for implementing an empirical Bayesian approach. The objective of this study was to apply an Adaptive Markov chain Monte Carlo technique to a typical study of cellular signaling pathways. Results As an illustrative example, a kinetic model for the early signaling events associated with the epidermal growth factor (EGF signaling network was calibrated against dynamic measurements observed in primary rat hepatocytes. A convergence criterion, based upon the Gelman-Rubin potential scale reduction factor, was applied to the model predictions. The posterior distributions of the parameters exhibited complicated structure, including significant covariance between specific parameters and a broad range of variance among the parameters. The model predictions, in contrast, were narrowly distributed and were used to identify areas of agreement among a collection of experimental studies. Conclusion In summary, an empirical Bayesian approach was developed for inferring the confidence that one can place in a particular model that describes signal transduction mechanisms and for inferring inconsistencies in experimental measurements.

  16. Input-Trees of Finite Automata and Application to Cryptanalysis

    Institute of Scientific and Technical Information of China (English)

    陶仁骥; 陈世华

    2000-01-01

    In this paper, weights of output set and of input set for finite automata are discussed. For a weakly invertible finite automaton, we prove that for states with minimal output weight, the distribution of input sets is uniform. Then for a kind of compound finite automata, we give weights of output set and of input set explicitly, and a characterization of their input-trees. For finite automaton public key cryptosystems, of which automata in public keys belong to such a kind of compound finite automata, we evaluate search amounts of exhaust search algorithms in average case and in worse case for both encryption and signature, and successful probabilities of stochastic search algorithms for both encryption and signature. In addition, a result on mutual invertibility of finite automata is also given.

  17. Cellular automaton for chimera states

    Science.gov (United States)

    García-Morales, Vladimir

    2016-04-01

    A minimalistic model for chimera states is presented. The model is a cellular automaton (CA) which depends on only one adjustable parameter, the range of the nonlocal coupling, and is built from elementary cellular automata and the majority (voting) rule. This suggests the universality of chimera-like behavior from a new point of view: Already simple CA rules based on the majority rule exhibit this behavior. After a short transient, we find chimera states for arbitrary initial conditions, the system spontaneously splitting into stable domains separated by static boundaries, some synchronously oscillating and the others incoherent. When the coupling range is local, nontrivial coherent structures with different periodicities are formed.

  18. Aut\\'omatas celulares elementales aplicados a la encriptaci\\'on de datos

    OpenAIRE

    Zapata, Elena Villarreal; Salazar, Francisco Cruz Ordaz

    2011-01-01

    For data ciphering a key is usually needed as a base, so it is indispensable to have one that is strong and trustworthy, so as to keep others from accessing the ciphered data. This requires a pseudo-random number generator that would provide such a key, so it is proposed to work with cellular automata helped along with \\emph{Mathematica} to check that the rules and to what level are actually pseudo-random. This project centers on the examination of possible mathematical rules, analyzing their...

  19. Endometriosis: A New Cellular and Molecular Genetic Approach for understanding the pathogenesis and evolutivity

    Directory of Open Access Journals (Sweden)

    Jean eBouquet De Joliniere

    2014-05-01

    Full Text Available ABSTRACT. Endometriosis is a benign disease with high prevalence in women of reproductive age estimated between 10 and 15% and is associated with considerable morbidity. Its etiology and pathogenesis are controversial but it is believed to involve multiple genetic, environmental, immunological, angiogenic and endocrine processes. Altered expressions of growth factors, cytokines, adhesion molecules, matrix metalloproteinases, and enzymes for estrogen synthesis and metabolism have been frequently observed in this condition. The possibility of genetic basis of endometriosis is demonstrated in studies of familial disease, in which the incidence of endometriosis is higher for first-degree relatives of probands as compared to controls. This review describes mainly the cellular, cytochemical, cytogenetic and molecular genetic features of endometriotic lesions and cultured endometriotic cells. In attempts to identify candidate gene (s involved in the pathogenesis of endometriosis, a tissue-based approaches including conventional cytogenetics (RHG-banding, loss of heterozygosity (LOH and Comparative Genomic Hybridization (CGH were employed. In addition to the karyotipic anomalies, consistent chromosome instability was confirmed by CGH and Fluorescence in Situ Hybridization (FISH. The nature and significance of the molecular genetic aberrations in relation to the locations and function of oncogenes and tumor supressor genes will be discussed. At last, a possible pathogenic role of embryonic duct remnants was observed in 7 female foetal reproductive tract in endometriosis and may induce a discussion about the begining of ovarian tumors and malignant proliferations

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