WorldWideScience

Sample records for automata

  1. Usage Automata

    Science.gov (United States)

    Bartoletti, Massimo

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

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

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

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

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

  6. Stream Automata Are Coalgebras

    NARCIS (Netherlands)

    Ciancia, V.; Venema, Y.

    2012-01-01

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

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

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

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

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

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

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

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

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

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

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

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

  18. Reactive Programming of Cellular Automata

    OpenAIRE

    Boussinot, Frédéric

    2004-01-01

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

  19. Cellular automata: structures

    OpenAIRE

    Ollinger, Nicolas

    2002-01-01

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

  20. Failover in cellular automata

    CERN Document Server

    Kumar, Shailesh

    2010-01-01

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

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

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

  3. Quantum counter automata

    CERN Document Server

    Say, A C Cem

    2011-01-01

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

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

  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. Free fall and cellular automata

    Directory of Open Access Journals (Sweden)

    Pablo Arrighi

    2016-03-01

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

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

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

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

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

  11. Confluence reduction for Markov automata

    NARCIS (Netherlands)

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

    2013-01-01

    Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosion threatens the analysability of the models gener

  12. THE RELATIONSHIPS OF THREE ELEMENTARY CELLULAR AUTOMATA

    Institute of Scientific and Technical Information of China (English)

    Zhisong JIANG

    2006-01-01

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

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

  14. Classifying cellular automata using grossone

    Science.gov (United States)

    D'Alotto, Louis

    2016-10-01

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

  15. Undecidable Problems About Timed Automata

    CERN Document Server

    Finkel, Olivier

    2007-01-01

    We solve some decision problems for timed automata which were recently raised by S. Tripakis in [ Folk Theorems on the Determinization and Minimization of Timed Automata, in the Proceedings of the International Workshop FORMATS'2003, LNCS, Volume 2791, p. 182-188, 2004 ] and by E. Asarin in [ Challenges in Timed Languages, From Applied Theory to Basic Theory, Bulletin of the EATCS, Volume 83, p. 106-120, 2004 ]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a timed regular language is timed regular. We show that the problem of the minimization of the number of clocks of a timed automaton is undecidable. It is also undecidable whether the shuffle of two timed regular languages is timed regular. We show that in the case of timed B\\"uchi automata accepting infinite timed words some of these problems are Pi^1_1-hard, hence highly undecidable (located beyond the arithmetical hierarchy).

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

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

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

  19. Logic and Automata History and Perspectives

    CERN Document Server

    Gradel, Erich; Wilk, Thomas

    2007-01-01

    Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d'horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field. Title: Logic and Automata : History and Perspectives Print ISBN: 9789053565766 Author(s): Flum, Jörg; Gr; del, Erich; Wilke, Thomas eISBN: 9789048501281 Publisher: Amsterdam University Press Dewey: 511.3 Publication Date: 01 Jan, 2007 Pages: 737 Category: Mathematics LCCN: Language: English Edition: N/A LCSH:

  20. Turing Automata and Graph Machines

    Directory of Open Access Journals (Sweden)

    Miklós Bartha

    2010-06-01

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

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

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

  3. Quantum features of natural cellular automata

    Science.gov (United States)

    Elze, Hans-Thomas

    2016-03-01

    Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schrödinger equation. This includes corresponding conservation laws. The class of “natural” Hamiltonian cellular automata is based exclusively on integer-valued variables and couplings and their dynamics derives from an Action Principle. They can be mapped reversibly to continuum models by applying Sampling Theory. Thus, “deformed” quantum mechanical models with a finite discreteness scale l are obtained, which for l → 0 reproduce familiar continuum results. We have recently demonstrated that such automata can form “multipartite” systems consistently with the tensor product structures of nonrelativistic many-body quantum mechanics, while interacting and maintaining the linear evolution. Consequently, the Superposition Principle fully applies for such primitive discrete deterministic automata and their composites and can produce the essential quantum effects of interference and entanglement.

  4. Intrinsic Simulations between Stochastic Cellular Automata

    Directory of Open Access Journals (Sweden)

    Pablo Arrighi

    2012-08-01

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

  5. Densities and entropies in cellular automata

    CERN Document Server

    Guillon, Pierre

    2012-01-01

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

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

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

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

  9. Fuzzy automata and pattern matching

    Science.gov (United States)

    Setzer, C. B.; Warsi, N. A.

    1986-01-01

    A wide-ranging search for articles and books concerned with fuzzy automata and syntactic pattern recognition is presented. A number of survey articles on image processing and feature detection were included. Hough's algorithm is presented to illustrate the way in which knowledge about an image can be used to interpret the details of the image. It was found that in hand generated pictures, the algorithm worked well on following the straight lines, but had great difficulty turning corners. An algorithm was developed which produces a minimal finite automaton recognizing a given finite set of strings. One difficulty of the construction is that, in some cases, this minimal automaton is not unique for a given set of strings and a given maximum length. This algorithm compares favorably with other inference algorithms. More importantly, the algorithm produces an automaton with a rigorously described relationship to the original set of strings that does not depend on the algorithm itself.

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

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

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

  13. Infinite Runs in Weighted Timed Automata with Energy Constraints

    DEFF Research Database (Denmark)

    Bouyer, Patricia; Fahrenberg, Uli; Larsen, Kim Guldstrand;

    2008-01-01

    We study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the accumulated weight. More specifically, we consider automata equipped with positive and negative weights on transitions...

  14. Computing Distances between Probabilistic Automata

    Directory of Open Access Journals (Sweden)

    Mathieu Tracol

    2011-07-01

    Full Text Available We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA, that allow some error epsilon. When epsilon is zero we retrieve the usual notions of bisimulation and simulation on PAs. We give logical characterisations of these notions by choosing suitable logics which differ from the elementary ones, L with negation and L without negation, by the modal operator. Using flow networks, we show how to compute the relations in PTIME. This allows the definition of an efficiently computable non-discounted distance between the states of a PA. A natural modification of this distance is introduced, to obtain a discounted distance, which weakens the influence of long term transitions. We compare our notions of distance to others previously defined and illustrate our approach on various examples. We also show that our distance is not expansive with respect to process algebra operators. Although L without negation is a suitable logic to characterise epsilon-(bisimulation on deterministic PAs, it is not for general PAs; interestingly, we prove that it does characterise weaker notions, called a priori epsilon-(bisimulation, which we prove to be NP-difficult to decide.

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

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

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

  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. Multipartite cellular automata and the superposition principle

    Science.gov (United States)

    Elze, Hans-Thomas

    2016-05-01

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

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

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

  2. Improved Undecidability Results for Reachability Games on Recursive Timed Automata

    Directory of Open Access Journals (Sweden)

    Shankara Narayanan Krishna

    2014-08-01

    Full Text Available We study reachability games on recursive timed automata (RTA that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is undecidable for automata with two or more clocks, while the problem is decidable for automata with only one clock. Ouaknine and Worrell recently proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. We revisited games on recursive timed automata with time-bounded restriction in the hope of recovering decidability. However, we found that the problem still remains undecidable for recursive timed automata with three or more clocks. Using similar proof techniques we characterize a decidability frontier for a generalization of RTA to recursive stopwatch automata.

  3. Optimal scheduling using priced timed automata

    DEFF Research Database (Denmark)

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

    2005-01-01

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

  4. From Orchestration to Choreography through Contract Automata

    Directory of Open Access Journals (Sweden)

    Davide Basile

    2014-10-01

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

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

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

  7. Importance Sampling for Stochastic Timed Automata

    DEFF Research Database (Denmark)

    Jegourel, Cyrille; Larsen, Kim Guldstrand; Legay, Axel

    2016-01-01

    We present an importance sampling framework that combines symbolic analysis and simulation to estimate the probability of rare reachability properties in stochastic timed automata. By means of symbolic exploration, our framework first identifies states that cannot reach the goal. A state...

  8. Characterizations of 1-Way Quantum Finite Automata

    CERN Document Server

    Brodsky, A; Brodsky, Alex; Pippenger, Nicholas

    1999-01-01

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

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

  10. Confluence reduction for Markov automata (extended version)

    NARCIS (Netherlands)

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

    2013-01-01

    Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosion threatens the analysability of the models gener

  11. Efficient Modelling and Generation of Markov Automata

    NARCIS (Netherlands)

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

    2012-01-01

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

  12. Selective networks and recognition automata.

    Science.gov (United States)

    Reeke, G N; Edelman, G M

    1984-01-01

    The results we have presented demonstrate that a network based on a selective principle can function in the absence of forced learning or an a priori program to give recognition, classification, generalization, and association. While Darwin II is not a model of any actual nervous system, it does set out to solve one of the same problems that evolution had to solve--the need to form categories in a bottom-up manner from information in the environment, without incorporating the assumptions of any particular observer. The key features of the model that make this possible are (1) Darwin II incorporates selective networks whose initial specificities enable them to respond without instruction to unfamiliar stimuli; (2) degeneracy provides multiple possibilities of response to any one stimulus, at the same time providing functional redundancy against component failure; (3) the output of Darwin II is a pattern of response, making use of the simultaneous responses of multiple degenerate groups to avoid the need for very high specificity and the combinatorial disaster that would imply; (4) reentry within individual networks vitiates the limitations described by Minsky and Papert for a class of perceptual automata lacking such connections; and (5) reentry between intercommunicating networks with different functions gives rise to new functions, such as association, that either one alone could not display. The two kinds of network are roughly analogous to the two kinds of category formation that people use: Darwin, corresponding to the exemplar description of categories, and Wallace, corresponding to the probabilistic matching description of categories. These principles lead to a new class of pattern-recognizing machine of which Darwin II is just an example. There are a number of obvious extensions to this work that we are pursuing. These include giving Darwin II the capability to deal with stimuli that are in motion, an ability that probably precedes the ability of biological

  13. The Decidability Frontier for Probabilistic Automata on Infinite Words

    CERN Document Server

    Chatterjee, Krishnendu; Tracol, Mathieu

    2011-01-01

    We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, B\\"uchi, coB\\"uchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.

  14. Cellular non-deterministic automata and partial differential equations

    Science.gov (United States)

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

    2015-09-01

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

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

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

  17. Problems on Finite Automata and the Exponential Time Hypothesis

    Directory of Open Access Journals (Sweden)

    Henning Fernau

    2017-02-01

    Full Text Available We study several classical decision problems on finite automata under the (Strong Exponential Time Hypothesis. We focus on three types of problems: universality, equivalence, and emptiness of intersection. All these problems are known to be CoNP-hard for nondeterministic finite automata, even when restricted to unary input alphabets. A different type of problems on finite automata relates to aperiodicity and to synchronizing words. We also consider finite automata that work on commutative alphabets and those working on two-dimensional words.

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

  19. Nonsynchronous updating in the multiverse of cellular automata

    Science.gov (United States)

    Reia, Sandro M.; Kinouchi, Osame

    2015-04-01

    In this paper we study updating effects on cellular automata rule space. We consider a subset of 6144 order-3 automata from the space of 262144 bidimensional outer-totalistic rules. We compare synchronous to asynchronous and sequential updatings. Focusing on two automata, we discuss how update changes destroy typical structures of these rules. Besides, we show that the first-order phase transition in the multiverse of synchronous cellular automata, revealed with the use of a recently introduced control parameter, seems to be robust not only to changes in update schema but also to different initial densities.

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

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

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

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

  4. Non-monotony and Boolean automata networks

    CERN Document Server

    Noual, Mathilde; Sené, Sylvain

    2011-01-01

    This paper aims at setting the keystone of a prospective theoretical study on the role of non-monotone interactions in biological regulation networks. Focusing on discrete models of these networks, namely, Boolean automata networks, we propose to analyse the contribution of non-monotony to the diversity and complexity in their dynamical behaviours. More precisely, in this paper, we start by detailing some motivations, both mathematical and biological, for our interest in non-monotony, and we discuss how it may account for phenomena that cannot be produced by monotony only. Then, to build some understanding in this direction, we propose some preliminary results on the dynamical behaviour of some specific non-monotone Boolean automata networks called XOR circulant networks.

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

  6. Probabilistic and quantum finite automata with postselection

    CERN Document Server

    Yakaryilmaz, Abuzer

    2011-01-01

    We prove that endowing a real-time probabilistic or quantum computer with the ability of postselection increases its computational power. For this purpose, we provide a new model of finite automata with postselection, and compare it with the model of L\\={a}ce et al. We examine the related language classes, and also establish separations between the classical and quantum versions, and between the zero-error vs. bounded-error modes of recognition in this model.

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

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

  9. A Myhill-Nerode theorem for automata with advice

    Directory of Open Access Journals (Sweden)

    Alex Kruckman

    2012-10-01

    Full Text Available An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice.

  10. Entropies of the automata networks with additive rule

    Institute of Scientific and Technical Information of China (English)

    Guo-qingGU; GeCHEN; 等

    1996-01-01

    The matrix presentation for automata networks with additive rule are described.A set of entropy theorems of additive automata network are proved and an analytic formula of its entropy is built.For example,we proved that the topological entropy is identically equal to metric entropy for an additive antomata network.

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

    CERN Document Server

    Arrighi, P

    2005-01-01

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

  12. Infinite Time Cellular Automata: A Real Computation Model

    CERN Document Server

    Givors, Fabien; Ollinger, Nicolas

    2010-01-01

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

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

    Institute of Scientific and Technical Information of China (English)

    XIE Huimin

    2001-01-01

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

  14. Restarting Automata with Auxiliary Symbols and Small Lookahead

    DEFF Research Database (Denmark)

    Schluter, Natalie Elaine

    2012-01-01

    We present a study on lookahead hierarchies for restarting automata with auxiliary symbols and small lookahead. In particular, we show that there are just two different classes of languages recognised by RRWW automata, through the restriction of lookahead size. We also show that the respective...

  15. The Quest for Minimal Quotients for Probabilistic Automata

    DEFF Research Database (Denmark)

    Eisentraut, Christian; Hermanns, Holger; Schuster, Johann;

    2013-01-01

    One of the prevailing ideas in applied concurrency theory and verification is the concept of automata minimization with respect to strong or weak bisimilarity. The minimal automata can be seen as canonical representations of the behaviour modulo the bisimilarity considered. Together with congruen...

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

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

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

  19. Scalable asynchronous execution of cellular automata

    Science.gov (United States)

    Folino, Gianluigi; Giordano, Andrea; Mastroianni, Carlo

    2016-10-01

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

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

  1. Cellular automata models for synchronized traffic flow

    CERN Document Server

    Jiang Rui

    2003-01-01

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

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

  3. Automata Learning through Counterexample Guided Abstraction Refinement

    DEFF Research Database (Denmark)

    Aarts, Fides; Heidarian, Faranak; Kuppens, Harco

    2012-01-01

    Abstraction is the key when learning behavioral models of realistic systems. Hence, in most practical applications where automata learning is used to construct models of software components, researchers manually define abstractions which, depending on the history, map a large set of concrete events...... automatically – models of several realistic software components, including the biometric passport and the SIP protocol....... are allowed. Our approach uses counterexample-guided abstraction refinement: whenever the current abstraction is too coarse and induces nondeterministic behavior, the abstraction is refined automatically. Using Tomte, a prototype tool implementing our algorithm, we have succeeded to learn – fully...

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

  5. Applications of Weighted Automata in Natural Language Processing

    Science.gov (United States)

    Knight, Kevin; May, Jonathan

    We explain why weighted automata are an attractive knowledge representation for natural language problems. We first trace the close historical ties between the two fields, then present two complex real-world problems, transliteration and translation. These problems are usefully decomposed into a pipeline of weighted transducers, and weights can be set to maximize the likelihood of a training corpus using standard algorithms. We additionally describe the representation of language models, critical data sources in natural language processing, as weighted automata. We outline the wide range of work in natural language processing that makes use of weighted string and tree automata and describe current work and challenges.

  6. On Reachability for Hybrid Automata over Bounded Time

    CERN Document Server

    Brihaye, Thomas; Geeraerts, Gilles; Ouaknine, Joël; Raskin, Jean-François; Worrell, James

    2011-01-01

    This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational value. We show that, in contrast to the classical (unbounded) reachability problem, the timed-bounded version is decidable for rectangular hybrid automata provided only non-negative rates are allowed. This class of systems is of practical interest and subsumes, among others, the class of stopwatch automata. We also show that the problem becomes undecidable if either diagonal constraints or both negative and positive rates are allowed.

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

  8. Language Emptiness of Continuous-Time Parametric Timed Automata

    DEFF Research Database (Denmark)

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

    2015-01-01

    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...... 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......-time semantics only. To the best of our knowledge, this is the first positive result in the case of continuous-time and unbounded integer parameters, except for the rather simple case of single-clock automata....

  9. An Introduction to Input/Output Automata. Revision

    Science.gov (United States)

    1988-11-18

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

  10. Resource-Optimal Scheduling Using Priced Timed Automata

    DEFF Research Database (Denmark)

    Larsen, Kim Guldstrand; Rasmussen, Jacob Illum; Subramani, K.

    2004-01-01

    In this paper, we show how the simple structure of the linear programs encountered during symbolic minimum-cost reachability analysis of priced timed automata can be exploited in order to substantially improve the performance of the current algorithm. The idea is rooted in duality of linear progr......-80 percent performance gain. As a main application area, we show how to solve energy-optimal task graph scheduling problems using the framework of priced timed automata....

  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. Cellular automata in Xenakis's music. Theory and Practice

    OpenAIRE

    Solomos, Makis

    2005-01-01

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

  13. Achieving of Fuzzy Automata for Processing Fuzzy Logic

    Institute of Scientific and Technical Information of China (English)

    SHU Lan; WU Qing-e

    2005-01-01

    At present, there has been an increasing interest in neuron-fuzzy systems, the combinations of artificial neural networks with fuzzy logic. In this paper, a definition of fuzzy finite state automata (FFA) is introduced and fuzzy knowledge equivalence representations between neural networks, fuzzy systems and models of automata are discussed. Once the network has been trained, we develop a method to extract a representation of the FFA encoded in the recurrent neural network that recognizes the training rules.

  14. Fuzzy Automata Induction using Construction Method

    Directory of Open Access Journals (Sweden)

    Mo Z. Wen

    2006-01-01

    Full Text Available Recurrent neural networks have recently been demonstrated to have the ability to learn simple grammars. In particular, networks using second-order units have been successfully at this task. However, it is often difficult to predict the optimal neural network size to induce an unknown automaton from examples. Instead of just adjusting the weights in a network of fixed topology, we adopt the dynamic networks (i.e. the topology and weights can be simultaneously changed during training for this application. We apply the idea of maximizing correlation in the cascade-correlation algorithm to the second-order single-layer recurrent neural network to generate a new construction algorithm and use it to induce fuzzy finite state automata. The experiment indicates that such a dynamic network performs well.

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

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

  17. Modelling Cow Behaviour Using Stochastic Automata

    DEFF Research Database (Denmark)

    Jónsson, Ragnar Ingi

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

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

  19. Partitioned quantum cellular automata are intrinsically universal

    CERN Document Server

    Arrighi, Pablo

    2010-01-01

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

  20. Particles and Patterns in Cellular Automata

    Energy Technology Data Exchange (ETDEWEB)

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

    1999-06-03

    This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). Our objective has been to develop tools for studying particle interactions in a class of dynamical systems characterized by discreteness, determinism, local interaction, and an inherently parallel form of evolution. These systems can be described by cellular automata (CA) and the behavior we studied has improved our understanding of the nature of patterns generated by CAs, their ability to perform global computations, and their relationship to continuous dynamical systems. We have also developed a rule-table mathematics that enables one to custom-design CA rule tables to generate patterns of specified types, or to perform specified computational tasks.

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

  2. Computing by Temporal Order: Asynchronous Cellular Automata

    Directory of Open Access Journals (Sweden)

    Michael Vielhaber

    2012-08-01

    Full Text Available Our concern is the behaviour of the elementary cellular automata with state set 0,1 over the cell set Z/nZ (one-dimensional finite wrap-around case, under all possible update rules (asynchronicity. Over the torus Z/nZ (n<= 11,we will see that the ECA with Wolfram rule 57 maps any v in F_2^n to any w in F_2^n, varying the update rule. We furthermore show that all even (element of the alternating group bijective functions on the set F_2^n = 0,...,2^n-1, can be computed by ECA57, by iterating it a sufficient number of times with varying update rules, at least for n <= 10. We characterize the non-bijective functions computable by asynchronous rules.

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

  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. Cells as strain-cued automata

    Science.gov (United States)

    Cox, Brian N.; Snead, Malcolm L.

    2016-02-01

    We argue in favor of representing living cells as automata and review demonstrations that autonomous cells can form patterns by responding to local variations in the strain fields that arise from their individual or collective motions. An autonomous cell's response to strain stimuli is assumed to be effected by internally-generated, internally-powered forces, which generally move the cell in directions other than those implied by external energy gradients. Evidence of cells acting as strain-cued automata have been inferred from patterns observed in nature and from experiments conducted in vitro. Simulations that mimic particular cases of pattern forming share the idealization that cells are assumed to pass information among themselves solely via mechanical boundary conditions, i.e., the tractions and displacements present at their membranes. This assumption opens three mechanisms for pattern formation in large cell populations: wavelike behavior, kinematic feedback in cell motility that can lead to sliding and rotational patterns, and directed migration during invasions. Wavelike behavior among ameloblast cells during amelogenesis (the formation of dental enamel) has been inferred from enamel microstructure, while strain waves in populations of epithelial cells have been observed in vitro. One hypothesized kinematic feedback mechanism, "enhanced shear motility", accounts successfully for the spontaneous formation of layered patterns during amelogenesis in the mouse incisor. Directed migration is exemplified by a theory of invader cells that sense and respond to the strains they themselves create in the host population as they invade it: analysis shows that the strain fields contain positional information that could aid the formation of cell network structures, stabilizing the slender geometry of branches and helping govern the frequency of branch bifurcation and branch coalescence (the formation of closed networks). In simulations of pattern formation in

  6. Minimum-Cost Reachability for Priced Timed Automata

    DEFF Research Database (Denmark)

    Behrmann, Gerd; Fehnker, Ansgar; Hune, Thomas Seidelin;

    2001-01-01

    This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine the mini......This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine...... the minimum cost of executions from the initial state to the target state. This problem generalizes the minimum-time reachability problem for ordinary timed automata. We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques...... and a new notion of priced regions. The latter allows symbolic representation and manipulation of reachable states together with the cost of reaching them....

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

  8. The Design of ADAT: A Tool for Assessing Automata-Based Assignments

    Directory of Open Access Journals (Sweden)

    Zarina Shukur

    2008-01-01

    Full Text Available This study describes the design of an automatic assessment system for assessing an automata-based assignment. Automata concept is taught in several undergraduate computing courses such as Theory of Computation, Automata and Formal Languages and Compilers. We take two elements into consideration when assessing the student's answers; static element and dynamic element. The static element involves the number of states (initial and final as well and the number of transitions. Whilst the dynamic aspect involves executing the automata against several test data. In this work, we rely heavily on the JFLAP for drawing and executing the automata.

  9. Modelling Social-Technical Attacks with Timed Automata

    DEFF Research Database (Denmark)

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

    2015-01-01

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

  10. Design of the Sequential System Automata using Temporal Equivalence Classes

    Directory of Open Access Journals (Sweden)

    A. Ursu

    1997-10-01

    Full Text Available A design method of sequential system automata using temporal logic specifications is proposed in this paper. The method is based on well-known Z.Manna and P.Wolper temporal logic satisfiability analysis procedure [1] and is extended to include past time temporal operators. A new specification method which uses temporal equivalence classes is proposed to specify the behaviour of large digital circuits. The impact of the composition and decomposition operations of the temporal equivalence classes on the final automata has been studied. A case study is carried out which deals with the design of the synchronous bus arbiter circuit element. The SMV tool has been used to verify the temporal properties of the obtained automata.

  11. An Application of Quantum Finite Automata to Interactive Proof Systems

    CERN Document Server

    Nishimura, H; Nishimura, Harumichi; Yamakami, Tomoyuki

    2004-01-01

    Quantum finite automata have been studied intensively since their introduction in late 1990s as a natural model of a quantum computer with finite-dimensional quantum memory space. This paper seeks their direct application to interactive proof systems in which a mighty quantum prover communicates with a quantum-automaton verifier through a common communication cell. Our quantum interactive proof systems are juxtaposed to Dwork-Stockmeyer's classical interactive proof systems whose verifiers are two-way probabilistic automata. We demonstrate strengths and weaknesses of our systems and further study how various restrictions on the behaviors of quantum-automaton verifiers affect the power of quantum interactive proof systems.

  12. A half-century of automata theory celebration and inspiration

    CERN Document Server

    Salomaa, A; Yu, S

    2001-01-01

    This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Award winners. In each contribution, the early developments of automata theory are reminisced about and future directions are suggested. Although some of the contributions go into rather intriguing technical details, most of the book is accessible to a wide audience interested in the progress of the age of computers. The book is a must for professionals in theoretical computer science and related areas of mathematics. For students in these areas it provides an exceptionally deep view at the beginn

  13. A Bibliography on Fuzzy Automata, Grammars and Lanuages

    NARCIS (Netherlands)

    Asveld, P.R.J.

    1996-01-01

    This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy languages by means of fuzzy grammars, the recognition of fuzzy languages by fuzzy automata and machines, as well as some applications of fuzzy set theory to syntactic pattern recognition, linguistics a

  14. A Bibliography on Fuzzy Automata, Grammars and Lanuages

    NARCIS (Netherlands)

    Asveld, Peter R.J.

    1995-01-01

    This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy languages by means of fuzzy grammars, the recognition of fuzzy languages by fuzzy automata and machines, as well as some applications of fuzzy set theory to syntactic pattern recognition, linguistics a

  15. Automata for the People: Machine Noise and Attention

    Directory of Open Access Journals (Sweden)

    David Ellison

    2012-11-01

    Full Text Available This article examines the production and reception of incidental machine noise, specifically the variably registered sounds emanating from automata in the eighteenth and nineteenth centuries. The argument proposed here is that the audience for automata performances demonstrated a capacity to screen out mechanical noise that may have otherwise interfered with the narrative theatricality of their display. In this regard the audience may be said to resemble auditors at musical performances who learned to suppress the various noises associated with the physical mechanics of performance, and the faculty of attention itself. For William James among others, attention demands selection among competing stimuli. As the incidental noise associated with automata disappears from sensibility over time, its capacity to signify in other contexts emerges. In the examples traced here, such noise is a means of distinguishing a specifically etherealised human-machine interaction. This is in sharp distinction from other more degrading forms of relationship such as the sound of bodies labouring at machines. In this regard, the barely detected sound of the automata in operation may be seen as a precursor to the white noise associated with modern, corporate productivity.

  16. Quantum cellular automata and free quantum field theory

    Science.gov (United States)

    D'Ariano, Giacomo Mauro; Perinotti, Paolo

    2017-02-01

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

  17. Verification of Continuous Dynamical Systems by Timed Automata

    DEFF Research Database (Denmark)

    Sloth, Christoffer; Wisniewski, Rafael

    2011-01-01

    This paper presents a method for abstracting continuous dynamical systems by timed automata. The abstraction is based on partitioning the state space of a dynamical system using positive invariant sets, which form cells that represent locations of a timed automaton. The abstraction is intended to...

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

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

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

    NARCIS (Netherlands)

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

    2010-01-01

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

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

  2. Reachability analysis for timed automata using max-plus algebra

    DEFF Research Database (Denmark)

    Lu, Qi; Madsen, Michael; Milata, Martin

    2012-01-01

    We show that max-plus polyhedra are usable as a data structure in reachability analysis of timed automata. Drawing inspiration from the extensive work that has been done on difference bound matrices, as well as previous work on max-plus polyhedra in other areas, we develop the algorithms needed t...

  3. Alternating register automata on finite words and trees

    CERN Document Server

    Figueira, Diego

    2012-01-01

    We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain. We investigate one-way automata with alternating control over data words or trees, with one register for storing data and comparing them for equality. This is a continuation of the study started by Demri, Lazic and Jurdzinski. From the standpoint of register automata models, this work aims at two objectives: (1) simplifying the existent decidability proofs for the emptiness problem for alternating register automata; and (2) exhibiting decidable extensions for these models. From the logical perspective, we show that (a) in the case of data words, satisfiability of LTL with one register and quantification over data values is decidable; and (b) the satisfiability problem for the so-called forward fragment of XPath on XML documents is decidable, even in the presence of DT...

  4. Exact quantum algorithms for promise problems in automata theory

    CERN Document Server

    Yakaryilmaz, Abuzer

    2011-01-01

    In this note, we show that quantum finite automata can be polynomially more succinct than their classical counterparts for promise problems in case of exact computation. Additionally, in terms of language recognition, the same result is shown to be valid up to a constant factor depending on how bigger the size of the alphabet is.

  5. TAME: A Specialized Specification and Verification System for Timed Automata

    Science.gov (United States)

    1996-12-01

    Lecture Notes in Computer Science . Springer...Courcoubetis, edi- tor, Computer Aided Veri cation, CAV 󈨡, vol- ume 697 of Lecture Notes in Computer Science , pages 292{304. Springer-Verlag, 1993. [10...automata. In J. C. M. Baeten and J. F. Goote, editors, CONCUR󈨟: 2nd Intern. Conference on Concurrency Theory, volume 527 of Lecture Notes in Computer Science ,

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

  7. On using priced timed automata to achieve optimal scheduling

    DEFF Research Database (Denmark)

    Rasmussen, Jacob Illum; Larsen, Kim Guldstrand; Subramani, K.

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

  8. Comprehensive bidding strategies with genetic programming/finite state automata

    Energy Technology Data Exchange (ETDEWEB)

    Richter, C.W. Jr.; Sheble, G.B.; Ashlock, D.

    1999-11-01

    This research is an extension of the authors' previous work in double auctions aimed at developing bidding strategies for electric utilities which trade electricity competitively. The improvements detailed in this paper come from using data structures which combine genetic programming and finite state automata termed GP-Automata. The strategies developed by the method described here are adaptive--reacting to inputs--whereas the previously developed strategies were only suitable in the particular scenario for which they had been designed. The strategies encoded in the GP-Automata are tested in an auction simulator. The simulator pits them against other distribution companies (distcos) and generation companies (gencos), buying and selling power via double auctions implemented in regional commodity exchanges. The GP-Automata are evolved with a genetic algorithm so that they possess certain characteristics. In addition to designing successful bidding strategies (whose usage would result in higher profits) the resulting strategies can also be designed to imitate certain types of trading behaviors. The resulting strategies can be implemented directly in on-line trading, or can be used as realistic competitors in an off-line trading simulator.

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

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

  11. Complete Abstractions of Dynamical Systems by Timed Automata

    DEFF Research Database (Denmark)

    Sloth, Christoffer; Wisniewski, Rafael

    2013-01-01

    This paper addresses the generation of complete abstractions of polynomial dynamical systems by timed automata. For the proposed abstraction, the state space is divided into cells by sublevel sets of functions. We identify a relation between these functions and their directional derivatives along...

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

    NARCIS (Netherlands)

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

    2012-01-01

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

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

    DEFF Research Database (Denmark)

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

    2012-01-01

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

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

  15. From Nondeterministic B\\"uchi and Streett Automata to Deterministic Parity Automata

    CERN Document Server

    Piterman, Nir

    2007-01-01

    In this paper we revisit Safra's determinization constructions. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions. Specifically, starting from a nondeterministic Buchi automaton with n states our construction yields a deterministic parity automaton with $2 n^n n!$ states and index 2n (instead of a Rabin automaton with $12^n n^{2n}$ states and n pairs). Starting from a nondeterministic Streett automaton with n states and k pairs our construction yields a deterministic parity automaton with $2n^n(k+1)^{n(k+1)}(n(k+1))!$ states and index 2n(k+1) (instead of a Rabin automaton with $12^{n(k+1)} n^n (k+1)^{n(k+1)} (n(k+1))^{n(k+1)}$ states and n(k+1) pairs). The parity condition is much simpler than the Rabin condition. For example, translating the Rabin condition to a parity condition involves a blowup in the number of states of n^2n! and the time complexity of solving Rabin games is that of solving parity games multiplied by $n^2 n!$.

  16. Dominant Strategies of Quantum Games on Quantum Periodic Automata

    Directory of Open Access Journals (Sweden)

    Konstantinos Giannakis

    2015-11-01

    Full Text Available Game theory and its quantum extension apply in numerous fields that affect people’s social, political, and economical life. Physical limits imposed by the current technology used in computing architectures (e.g., circuit size give rise to the need for novel mechanisms, such as quantum inspired computation. Elements from quantum computation and mechanics combined with game-theoretic aspects of computing could open new pathways towards the future technological era. This paper associates dominant strategies of repeated quantum games with quantum automata that recognize infinite periodic inputs. As a reference, we used the PQ-PENNY quantum game where the quantum strategy outplays the choice of pure or mixed strategy with probability 1 and therefore the associated quantum automaton accepts with probability 1. We also propose a novel game played on the evolution of an automaton, where players’ actions and strategies are also associated with periodic quantum automata.

  17. Notes on automata theory based on quantum logic

    Institute of Scientific and Technical Information of China (English)

    QIU DaoWen

    2007-01-01

    The main results are as follows: (1) it deals with a number of basic operations (concatenation, Kleene closure, homomorphism, complement); (2) due to a condition imposed on the implication operator for discussing some basic issues in orthomodular lattice-valued automata, this condition is investigated in detail, and it is discovered that all the relatively reasonable five implication operators in quantum logic do not satisfy this condition, and that one of the five implications satisfies such a condition iff the truth-value lattice is indeed a Boolean algebra; (3) it deals further with orthomodular lattice-valued successor and source operators; (4) an example is provided, implying that some negative results obtained in the literature may still hold in some typical orthomodular lattice-valued automata.

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

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

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

  1. Steganography by using Logistic Map Function and Cellular Automata

    Directory of Open Access Journals (Sweden)

    Mehdi Alirezanejad

    2012-12-01

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

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

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

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

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

  6. Analysis for Embedded Systems: Experiments with Priced Timed Automata

    DEFF Research Database (Denmark)

    Ovatman, Tolga; Brekling, Aske Wiid; Hansen, Michael Reichhardt

    2010-01-01

    Analysis of resource consumption of embedded systems is a major challenge in the industry since the number of components that can be included in a single chip keeps getting bigger. In this paper, we consider simple models of embedded systems and the automated analysis about timing and memory access...... priced timed automata and Uppaal Cora as a model checking tool in reasoning about resource consumption of embedded systems....

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

  8. An autonomous DNA model for finite state automata.

    Science.gov (United States)

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

    2009-01-01

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

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

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

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

  12. An Evolution Strategy for the Induction of Fuzzy Finite-State Automata

    Institute of Scientific and Technical Information of China (English)

    WAN Min; MO Zhi-wen

    2005-01-01

    This paper presents an evolution strategy to induce fuzzy finite-state automata from examples of fuzzy languages .The coding, fitness function of a generated automaton and corresponding mutation operators are given respectively. The application example given at last shows the effectiveness of the proposed evolution strategy for automata induction.

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

    Science.gov (United States)

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

    2016-10-01

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

  14. Tree automata-based refinement with application to Horn clause verification

    DEFF Research Database (Denmark)

    Kafle, Bishoksan; Gallagher, John Patrick

    2015-01-01

    underlying the Horn clauses. Experiments using linear constraint problems and the abstract domain of convex polyhedra show that the refinement technique is practical and that iteration of abstract interpretation with tree automata-based refinement solves many challenging Horn clause verification problems. We......In this paper we apply tree-automata techniques to refinement of abstract interpretation in Horn clause verification. We go beyond previous work on refining trace abstractions; firstly we handle tree automata rather than string automata and thereby can capture traces in any Horn clause derivations...... rather than just transition systems; secondly, we show how algorithms manipulating tree automata interact with abstract interpretations, establishing progress in refinement and generating refined clauses that eliminate causes of imprecision. We show how to derive a refined set of Horn clauses in which...

  15. Horn clause verification with convex polyhedral abstraction and tree automata-based refinement

    DEFF Research Database (Denmark)

    Kafle, Bishoksan; Gallagher, John Patrick

    2017-01-01

    underlying the Horn clauses. Experiments using linear constraint problems and the abstract domain of convex polyhedra show that the refinement technique is practical and that iteration of abstract interpretation with tree automata-based refinement solves many challenging Horn clause verification problems. We......In this paper we apply tree-automata techniques to refinement of abstract interpretation in Horn clause verification. We go beyond previous work on refining trace abstractions; firstly we handle tree automata rather than string automata and thereby can capture traces in any Horn clause derivations...... rather than just transition systems; secondly, we show how algorithms manipulating tree automata interact with abstract interpretations, establishing progress in refinement and generating refined clauses that eliminate causes of imprecision. We show how to derive a refined set of Horn clauses in which...

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

  17. Modelling discrete longitudinal data using acyclic probabilistic finite automata

    DEFF Research Database (Denmark)

    Anantharama Ankinakatte, Smitha; Edwards, David

    2015-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Arman Roohi

    2011-11-01

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

  19. The Complexity of Finding Reset Words in Finite Automata

    Science.gov (United States)

    Olschewski, Jörg; Ummels, Michael

    We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP. This result answers a question posed by Volkov. For the search problems of finding a shortest reset word and the length of a shortest reset word, we establish membership in the complexity classes FPNP and FPNP[log], respectively. Moreover, we show that both these problems are hard for FPNP[log]. Finally, we observe that computing a reset word of a given length is FNP-complete.

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

  1. Lattice gas automata for flow and transport in geochemical systems

    Energy Technology Data Exchange (ETDEWEB)

    Janecky, D.R.; Chen, S.; Dawson, S.; Eggert, K.C.; Travis, B.J.

    1992-01-01

    Lattice gas automata models are described, which couple solute transport with chemical reactions at mineral surfaces within pore networks. Diffusion in a box calculations are illustrated, which compare directly with Fickian diffusion. Chemical reactions at solid surfaces, including precipitation/dissolution, sorption, and catalytic reaction, can be examined with the model because hydrodynamic transport, solute diffusion and mineral surface processes are all treated explicitly. The simplicity and flexibility of the approach provides the ability to study the interrelationship between fluid flow and chemical reactions in porous materials, at a level of complexity that has not previously been computationally possible.

  2. Two Novel Quantum-Dot Cellular Automata Full Adders

    OpenAIRE

    Mahdie Qanbari; Reza Sabbaghi-Nadooshan

    2013-01-01

    Quantum-dot cellular automata (QCA) is an efficient technology to create computing devices. QCA is a suitable candidate for the next generation of digital systems. Full adders are the main member of computational systems because other operations can be implemented by adders. In this paper, two QCA full adders are introduced. The first one is implemented in one layer, and the second one is implemented in three layers. Five-input majority gate is used in both of them. These full adders are bett...

  3. Microbial Growth Modeling and Simulation Based on Cellular Automata

    Directory of Open Access Journals (Sweden)

    Hong Men

    2013-07-01

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

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

    Science.gov (United States)

    Avalle, Michele; Serafini, Alessio

    2014-05-01

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

  5. Formal languages, automata and numeration systems, v.2

    CERN Document Server

    Rigo, Michel

    2014-01-01

    The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a "simple" binary expansion, by B. Adamczewski and Y. Bugeaud. This book is at the heart of this interplay through a unified exposition. Objects are considered with a perspective that comes both from t

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

    CERN Document Server

    Machicao, Marina Jeaneth; Bruno, Odemir M

    2011-01-01

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

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

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

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

  10. Negative circuits and sustained oscillations in asynchronous automata networks

    CERN Document Server

    Richard, Adrien

    2009-01-01

    The biologist Ren\\'e Thomas conjectured, twenty years ago, that the presence of a negative feedback circuit in the interaction graph of a dynamical system is a necessary condition for this system to produce sustained oscillations. In this paper, we state and prove this conjecture for asynchronous automata networks, a class of discrete dynamical systems extensively used to model the behaviors of gene networks. As a corollary, we obtain the following fixed point theorem: given a product $X$ of $n$ finite intervals of integers, and a map $F$ from $X$ to itself, if the interaction graph associated with $F$ has no negative circuit, then $F$ has at least one fixed point.

  11. Motion Planning in Multi-robot Systems using Timed Automata

    DEFF Research Database (Denmark)

    Andersen, Michael. S.; Jensen, Rune S.; Bak, Thomas;

    kinematics, is captured in an automata formalism that allows formal composition and symbolic reasoning. The verification software UppAal is used to verify specification requirements formulated in computational tree logic (CTL), generating all feasible trajectories that satisfy specifications. The results...... of the planning are demonstrateted in a testbed that allows execution of the planned paths and motion primitives by synchronizing the planning results from UppAal with actual robotic vehicles. The planning problem may be modified online by moving obstacles in the physical environment, which causes a re...

  12. Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo

    Science.gov (United States)

    Sakakibara, Yasubumi

    We overview a series of our research on implementing finite automata in vitro and in vivo in the framework of DNA-based computing [1,2]. First, we employ the length-encoding technique proposed and presented in [3,4] to implement finite automata in test tube. In the length-encoding method, the states and state transition functions of a target finite automaton are effectively encoded into DNA sequences, a computation (accepting) process of finite automata is accomplished by self-assembly of encoded complementary DNA strands, and the acceptance of an input string is determined by the detection of a completely hybridized double-strand DNA. Second, we report our intensive in vitro experiments in which we have implemented and executed several finite-state automata in test tube. We have designed and developed practical laboratory protocols which combine several in vitro operations such as annealing, ligation, PCR, and streptavidin-biotin bonding to execute in vitro finite automata based on the length-encoding technique. We have carried laboratory experiments on various finite automata with 2 up to 6 states for several input strings. Third, we present a novel framework to develop a programmable and autonomous in vivo computer using Escherichia coli (E. coli), and implement in vivo finite-state automata based on the framework by employing the protein-synthesis mechanism of E. coli. We show some successful experiments to run an in vivo finite-state automaton on E. coli.

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

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

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

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

  17. Interpolant tree automata and their application in Horn clause verification

    DEFF Research Database (Denmark)

    Kafle, Bishoksan; Gallagher, John Patrick

    2016-01-01

    This paper investigates the combination of abstract interpretation over the domain of convex polyhedra with interpolant tree automata, in an abstraction-refinement scheme for Horn clause verification. These techniques have been previously applied separately, but are combined in a new way in this ...... clause verification problems indicates that the combination of interpolant tree automaton with abstract interpretation gives some increase in the power of the verification tool, while sometimes incurring a performance overhead.......This paper investigates the combination of abstract interpretation over the domain of convex polyhedra with interpolant tree automata, in an abstraction-refinement scheme for Horn clause verification. These techniques have been previously applied separately, but are combined in a new way...... in this paper. The role of an interpolant tree automaton is to provide a generalisation of a spurious counterexample during refinement, capturing a possibly infinite set of spurious counterexample traces. In our approach these traces are then eliminated using a transformation of the Horn clauses. We compare...

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

    CERN Document Server

    Gershenson, Carlos

    2009-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Ville Salo

    2012-08-01

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

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

  1. Weak invertibility of linear finite automata (I)——Classification and enumeration of transfer functions

    Institute of Scientific and Technical Information of China (English)

    戴宗铎; 叶顶峰

    1996-01-01

    Let 3V denote the set of all possible transfer function matrices of weakly invertible linear finite automata over a given finite field F. A classification and an enumeration on the infinite set are given.

  2. Spectral Analysis of Transition Operators, Automata Groups and Translation in BBS

    Science.gov (United States)

    Kato, Tsuyoshi; Tsujimoto, Satoshi; Zuk, Andrzej

    2016-06-01

    We give the automata that describe time evolution rules of the box-ball system with a carrier. It can be shown by use of tropical geometry that such systems are ultradiscrete analogues of KdV equation. We discuss their relation with the lamplighter group generated by an automaton. We present spectral analysis of the stochastic matrices induced by these automata and verify their spectral coincidence.

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

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

    Science.gov (United States)

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

    2016-06-24

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

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

  6. LAHS: A novel harmony search algorithm based on learning automata

    Science.gov (United States)

    Enayatifar, Rasul; Yousefi, Moslem; Abdullah, Abdul Hanan; Darus, Amer Nordin

    2013-12-01

    This study presents a learning automata-based harmony search (LAHS) for unconstrained optimization of continuous problems. The harmony search (HS) algorithm performance strongly depends on the fine tuning of its parameters, including the harmony consideration rate (HMCR), pitch adjustment rate (PAR) and bandwidth (bw). Inspired by the spur-in-time responses in the musical improvisation process, learning capabilities are employed in the HS to select these parameters based on spontaneous reactions. An extensive numerical investigation is conducted on several well-known test functions, and the results are compared with the HS algorithm and its prominent variants, including the improved harmony search (IHS), global-best harmony search (GHS) and self-adaptive global-best harmony search (SGHS). The numerical results indicate that the LAHS is more efficient in finding optimum solutions and outperforms the existing HS algorithm variants.

  7. Computer Models and Automata Theory in Biology and Medicine

    CERN Document Server

    Baianu, I C

    2004-01-01

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

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

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

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

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

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

    CERN Document Server

    Arrighi, Pablo; Nesme, Vincent; Thierry, Eric

    2011-01-01

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

  13. Encoding nondeterministic fuzzy tree automata into recursive neural networks.

    Science.gov (United States)

    Gori, Marco; Petrosino, Alfredo

    2004-11-01

    Fuzzy neural systems have been a subject of great interest in the last few years, due to their abilities to facilitate the exchange of information between symbolic and subsymbolic domains. However, the models in the literature are not able to deal with structured organization of information, that is typically required by symbolic processing. In many application domains, the patterns are not only structured, but a fuzziness degree is attached to each subsymbolic pattern primitive. The purpose of this paper is to show how recursive neural networks, properly conceived for dealing with structured information, can represent nondeterministic fuzzy frontier-to-root tree automata. Whereas available prior knowledge expressed in terms of fuzzy state transition rules are injected into a recursive network, unknown rules are supposed to be filled in by data-driven learning. We also prove the stability of the encoding algorithm, extending previous results on the injection of fuzzy finite-state dynamics in high-order recurrent networks.

  14. Quantum state transfer through noisy quantum cellular automata

    Science.gov (United States)

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

    2015-05-01

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

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

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

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

  18. Verifying Automata Specification of Distributed Probabilistic Real—Time Systems

    Institute of Scientific and Technical Information of China (English)

    罗铁庚; 陈火旺; 等

    1998-01-01

    In this paper,a qualitative model checking algorithm for verification of distributed probabilistic real-time systems(DPRS)is presented.The model of DPRS,called real-time proba bilistic process model(RPPM),is over continuous time domain.The properties of DPRS are described by using deterministic timed automata(DTA).The key part in the algorithm is to map continuous time to finite time intervals with flag variables.Compared with the existing algorithms,this algorithm uses more general delay time equivalence classes instead of the unit delay time equivalence classes restricted by event sequence,and avoids generating the equivalence classes of states only due to the passage of time.The result shows that this algorithm is cheaper.

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

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

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

  2. Lattice Automata for Control of Self-Reconfigurable Robots

    DEFF Research Database (Denmark)

    Støy, Kasper

    2015-01-01

    Self-reconfigurable robots are built from robotic modules typically organised in a lattice. The robotic modules themselves are complete, although simple, robots and have onboard batteries, actuators, sensors, processing power, and communication capabilities. The modules can automatically connect...... to and disconnect from neighbour modules and move around in the lattice of modules. The self-reconfigurable robot as a whole can, through this automatic rearrangement of modules, change its own shape to adapt to the environment or as a response to new tasks. Potential advantages of self-reconfigurable robots...... are extreme versatility and robustness. The organisation of self-reconfigurable robots in a lattice structure and the emphasis on local communication between modules mean that lattice automata are a useful basis for control of self-reconfigurable robots. However, there are significant differences which arise...

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

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

    Energy Technology Data Exchange (ETDEWEB)

    Crutchfield, J.P.; Mitchell, M.

    1998-04-01

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

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

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

  7. Online Induction of Probabilistic Real-Time Automata

    Institute of Scientific and Technical Information of China (English)

    Jana Schmidt; Stefan Kramer

    2014-01-01

    The probabilistic real-time automaton (PRTA) is a representation of dynamic processes arising in the sciences and industry. Currently, the induction of automata is divided into two steps: the creation of the prefix tree acceptor (PTA) and the merge procedure based on clustering of the states. These two steps can be very time intensive when a PRTA is to be induced for massive or even unbounded datasets. The latter one can be efficiently processed, as there exist scalable online clustering algorithms. However, the creation of the PTA still can be very time consuming. To overcome this problem, we propose a genuine online PRTA induction approach that incorporates new instances by first collapsing them and then using a maximum frequent pattern based clustering. The approach is tested against a predefined synthetic automaton and real world datasets, for which the approach is scalable and stable. Moreover, we present a broad evaluation on a real world disease group dataset that shows the applicability of such a model to the analysis of medical processes.

  8. Weak factor automata: the failure of failure factor oracles?

    Directory of Open Access Journals (Sweden)

    Loek Cleophas

    2014-08-01

    Full Text Available In indexing of, and pattern matching on, DNA and text sequences, it is often important to represent all factors of a sequence. One efficient, compact representation is the factor oracle (FO. At the same time, any classical deterministic finite automata (DFA can be transformed to a so-called failure one (FDFA, which may use failure transitions to replace multiple symbol transitions, potentially yielding a more compact representation. We combine the two ideas and directly construct a failure factor oracle (FFO from a given sequence, in contrast to ex post facto transformation to an FDFA. The algorithm is suitable for both short and long sequences. We empirically compared the resulting FFOs and FOs on number of transitions for many DNA sequences of lengths 4 − 512, showing gains of up to 10% in total number of transitions, with failure transitions also taking up less space than symbol transitions. The resulting FFOs can be used for indexing, as well as in a variant of the FO-using backward oracle matching algorithm. We discuss and classify this pattern matching algorithm in terms of the keyword pattern matching taxonomies of Watson, Cleophas and Zwaan. We also empirically compared the use of FOs and FFOs in such backward reading pattern matching algorithms, using both DNA and natural language (English data sets. The results indicate that the decrease in pattern matching performance of an algorithm using an FFO instead of an FO may outweigh the gain in representation space by using an FFO instead of an FO.

  9. Devising an unconventional formal logic for bioinspired spacefaring automata

    Science.gov (United States)

    Santoli, Salvatore

    2011-03-01

    The field of robotics is increasingly moving from robots confined to factory floors and assembly lines and bound to perform the same tasks over and over in an uncertainty-free, well foreseeable environment, to robots designed for operating in highly dynamic and uncertainty domains, like those of interest in space exploration. According to an idea of a "new system of formal logic less rigid than past and present formal logic" advocated by von Neumann for building a powerful theory of automata, such system should be "closer to another discipline which has been little linked in the past with logic, i.e. thermodynamics, primarily in the form it was received by Boltzmann". Following that idea, which is particularly interesting now with the emerging computational nano-sciences, it is stressed here that a full set of isomorphisms can be established between the fundamental logical principles and the information flows, Hamiltonian or dissipative, in phase space. This form of logic, dubbed here kinetic logic, takes standard formal logic out of the field of combinatorics and into the field of the Boltzmannian form of thermodynamics, i.e. kinetics.

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

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

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

  13. Stochastic cellular automata model for stock market dynamics

    Science.gov (United States)

    Bartolozzi, M.; Thomas, A. W.

    2004-04-01

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

  14. Improve Energy Efficiency Routing In WSN By Using Automata

    Directory of Open Access Journals (Sweden)

    Elham Hajian

    2010-06-01

    Full Text Available Low power and limited processing are characteristic s of nodes in Wireless sensor networks. Therefore, optimal consumption of energy for WSN protocols seems essen tial. In a number of WSN applications, sensor nodes sense data periodically from environment and transfer it to th e sink. Because of limitation in energy and selecti on of best route, for the purpose of increasing network remaining ene rgy a node with most energy level will be used for transmission of data. The most part of energy in nodes is wasted on radio transmission; thus decreasing number of t ransferred packets in the network will result in increase in n ode and network lifetimes. In algorithms introduced for data transmission in such networks up to now, a single r oute is used for data transmissions that results in decrease in energy of nodes located on this route which in turn results in increasing of remaining energy. In this paper a new method is proposed for selection of data transmissi on route that is able to solve this problem. This m ethod is based on learning automata that selects the route with re gard to energy parameters and the distance to sink. In this method energy of network nodes finishes rather simultaneou sly preventing break down of network into two separ ate parts. This will result in increased lifetime. Simulation results show that this method has been very effecti ve in increasing of remaining energy and it increases network lifetime.

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

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

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

    Science.gov (United States)

    Diaz, N; Tischer, I

    2016-05-13

    Cellular automata model identification is an important way of building simplified simulation models. In this study, we describe a generic architectural framework to ease the development process of new metaheuristic-based algorithms for cellular automata model identification in protein-folding trajectories. Our framework was developed by a methodology based on design patterns that allow an improved experience for new algorithms development. The usefulness of the proposed framework is demonstrated by the implementation of four algorithms, able to obtain extremely precise cellular automata models of the protein-folding process with a protein contact map representation. Dynamic rules obtained by the proposed approach are discussed, and future use for the new tool is outlined.

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

    Directory of Open Access Journals (Sweden)

    Paweł Topa

    2013-01-01

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

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

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

  1. NATO Advanced Study Institute on Structural Theory of Automata, Semigroups and Universal Algebra

    CERN Document Server

    Rosenberg, Ivo; Goldstein, Martin

    2005-01-01

    Several of the contributions to this volume bring forward many mutually beneficial interactions and connections between the three domains of the title. Developing them was the main purpose of the NATO ASI summerschool held in Montreal in 2003. Although some connections, for example between semigroups and automata, were known for a long time, developing them and surveying them in one volume is novel and hopefully stimulating for the future. Another aspect is the emphasis on the structural theory of automata that studies ways to contstruct big automata from small ones. The volume also has contributions on top current research or surveys in the three domains. One contribution even links clones of universal algebra with the computational complexity of computer science. Three contributions introduce the reader to research in the former East block.

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

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

  4. Increasing Ranks of Linear Finite Automata and Complexity of FA Public Key Cryptosystem

    Institute of Scientific and Technical Information of China (English)

    鲍丰

    1994-01-01

    The encryption algorithm of finite automata (FA) public key cryptosystem is implemented by a weakly invertible finite automata (WIFA) which is composed of a nonlinear WIFA with delay 0 and a linear WIFA with delay τ. In this paper, we proved that such an automaton bears the same properties as the linear WIFA and the increasing ranks of the latter are key factors to affecting the former. A probabilistic algorithm is given to realize a ciphertext attack, and its complexity is analysed through the increasing ranks of the linear WIFA. The size of the parameters for safe linear WIFA is estimated.

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

  6. Some Notes on Graph Automata,Tiling Systems and Partition Logic

    Institute of Scientific and Technical Information of China (English)

    沈恩绍

    1998-01-01

    Introduce heuristically the newly definition(W.Thomas)for graph automata-using “tiles”to simulate the extension(over dag's) of the classical notions of transition moves;propose a sufficient condition for when graph automata can be reduced to (simpler)tiling systems,which is a generalization of a Thomas' result;and finally study the logic sepcification of tiling systems (particularly,over picture languages)by (existential)monadic partition logic,instead of the ususal and stronger framework(E)MSO.

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

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

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

  10. Dynamic behavior of multirobot systems using lattice gas automata

    Science.gov (United States)

    Stantz, Keith M.; Cameron, Stewart M.; Robinett, Rush D., III; Trahan, Michael W.; Wagner, John S.

    1999-07-01

    Recent attention has been given to the deployment of an adaptable sensor array realized by multi-robotic systems (or swarms). Our group has been studying the collective, autonomous behavior of these such systems and their applications in the area of remote-sensing and emerging threats. To accomplish such tasks, an interdisciplinary research effort at Sandia National Laboratories are conducting tests in the fields of sensor technology, robotics, and multi- agents architectures. Our goal is to coordinate a constellation of point sensors using unmanned robotic vehicles (e.g., RATLERs, Robotic All-Terrain Lunar Exploration Rover- class vehicles) that optimizes spatial coverage and multivariate signal analysis. An overall design methodology evolves complex collective behaviors realized through local interaction (kinetic) physics and artificial intelligence. Learning objectives incorporate real-time operational responses to environmental changes. This paper focuses on our recent work understanding the dynamics of many-body systems according to the physics-based hydrodynamic model of lattice gas automata. Three design features are investigated. One, for single-speed robots, a hexagonal nearest-neighbor interaction topology is necessary to preserve standard hydrodynamic flow. Two, adaptability, defined by the swarm's rate of deformation, can be controlled through the hydrodynamic viscosity term, which, in turn, is defined by the local robotic interaction rules. Three, due to the inherent nonlinearity of the dynamical equations describing large ensembles, stability criteria ensuring convergence to equilibrium states is developed by scaling information flow rates relative to a swarm's hydrodynamic flow rate. An initial test case simulates a swarm of twenty-five robots maneuvering past an obstacle while following a moving target. A genetic algorithm optimizes applied nearest-neighbor forces in each of five spatial regions distributed over the simulation domain. Armed with

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

    Science.gov (United States)

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

    2017-03-01

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

  12. THE FINITE AUTOMATA OF EVENTUALLY PERIODIC UNIMODAL MAPS ON THE INTERVAL

    Institute of Scientific and Technical Information of China (English)

    谢惠民

    1993-01-01

    For unimodal maps on the interval we prove that, if the kneading sequences (KS) are eventually periodic, then their formal languages are regular ones. The finite automata for such languages are constructed. Comparing with the languages generated by periodic KS, it is shown that the languages here are not finite complement languages.

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

    DEFF Research Database (Denmark)

    Jensen, Mads Brath; Foged, Isak Worre

    2014-01-01

    . An architectural methodological response to this situation is presented through the development of a conceptual computational design system that allows these dynamics to unfold and to be observed for architectural design decision taking. Reflecting on the development and implementation of a cellular automata based...

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

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

    DEFF Research Database (Denmark)

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

    2009-01-01

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

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

    CERN Document Server

    Salo, Ville

    2012-01-01

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

  17. A linear process-algebraic format with data for probabilistic automata

    NARCIS (Netherlands)

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

    2011-01-01

    This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong probabilistic bisimulation. This generalises similar te

  18. Behavioural differential equations : a coinductive calculus of streams, automata, and power series

    NARCIS (Netherlands)

    Rutten, J.J.M.M.

    2000-01-01

    Streams, (automata and) languages, and formal power series are viewed coalgebraically. In summary, this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being final. Finality then forms the basis for both definitions and proofs by coinduct

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

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

    NARCIS (Netherlands)

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

    2008-01-01

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

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

  2. Analysis of timed and long-run objectives for Markov automata

    NARCIS (Netherlands)

    Guck, Dennis; Hatefi, Hassan; Hermanns, Holger; Katoen, Joost-Pieter; Timmer, Mark

    2014-01-01

    Markov automata (MAs) extend labelled transition systems with random delays and probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution over states, whereas timed transitions impose a random delay governed by an exponential distribution. MAs are thus a nondete

  3. Perceptions of teaching and learning automata theory in a college-level computer science course

    Science.gov (United States)

    Weidmann, Phoebe Kay

    This dissertation identifies and describes student and instructor perceptions that contribute to effective teaching and learning of Automata Theory in a competitive college-level Computer Science program. Effective teaching is the ability to create an appropriate learning environment in order to provide effective learning. We define effective learning as the ability of a student to meet instructor set learning objectives, demonstrating this by passing the course, while reporting a good learning experience. We conducted our investigation through a detailed qualitative case study of two sections (118 students) of Automata Theory (CS 341) at The University of Texas at Austin taught by Dr. Lily Quilt. Because Automata Theory has a fixed curriculum in the sense that many curricula and textbooks agree on what Automata Theory contains, differences being depth and amount of material to cover in a single course, a case study would allow for generalizable findings. Automata Theory is especially problematic in a Computer Science curriculum since students are not experienced in abstract thinking before taking this course, fail to understand the relevance of the theory, and prefer classes with more concrete activities such as programming. This creates a special challenge for any instructor of Automata Theory as motivation becomes critical for student learning. Through the use of student surveys, instructor interviews, classroom observation, material and course grade analysis we sought to understand what students perceived, what instructors expected of students, and how those perceptions played out in the classroom in terms of structure and instruction. Our goal was to create suggestions that would lead to a better designed course and thus a higher student success rate in Automata Theory. We created a unique theoretical basis, pedagogical positivism, on which to study college-level courses. Pedagogical positivism states that through examining instructor and student perceptions

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

  5. Enhancement of Users Call Logging facilities using Push Down Automata (PDA with Real Time Constraint Notation (RTCN

    Directory of Open Access Journals (Sweden)

    Vivek Kr. Singh

    2012-05-01

    Full Text Available This paper highlights the use of Push - Down Automata (PDA in storing and maintaining the call logs. The special feature about this paper is to maintain incoming call record from the different mobile service provider in a mobile in clustered way to the user. It focuses on real time constraint notation being applied to the push down automata for formal verification of the model.

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

  7. A Learning Automata Based Algorithm For Solving Capacitated Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Mir Mohammad Alipour

    2012-03-01

    Full Text Available This paper presents an approximate algorithm based on distributed learning automata for solving capacitated vehicle routing problem. The vehicle routing problem (VRP is an NP-hard problem and capacitated vehicle routing problem variant (CVRP is considered here. This problem is one of the NP-hard problems and for this reason many approximate algorithms have been designed for solving it. Distributed learning automata that is a general searching tool and is a solving tool for variety of NP-complete problems, is used to solve this problem and tested on fourteen benchmark problems. Our results were compared to the best known results. The results of comparison have shown the efficiency of the proposed algorithm.

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

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

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

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

  12. Semi-tensor product approach to controllability and stabilizability of finite automata

    Institute of Scientific and Technical Information of China (English)

    Yongyi Yan; Zengqiang Chen; Zhongxin Liu

    2015-01-01

    Using semi-tensor product of matrices, the control-lability and stabilizability of finite automata are investigated. By expressing the states, inputs, and outputs in vector forms, the transition and output functions are represented in matrix forms. Based on this algebraic description, a necessary and sufficient condition is proposed for checking whether a state is control able to another one. By this condition, an algorithm is established to find al the control sequences of an arbitrary length. Moreover, the stabilizability of finite automata is considered, and a necessary and sufficient condition is presented to examine whether some states can be stabilized. Final y, the study of il ustrative examples verifies the correctness of the presented results/algorithms.

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

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

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

  16. Automation of Algorithmic Tasks for Virtual Laboratories Based on Automata Theory

    Directory of Open Access Journals (Sweden)

    Evgeniy A. Efimchik

    2016-03-01

    Full Text Available In the work a description of an automata model of standard algorithm for constructing a correct solution of algorithmic tests is given. The described model allows a formal determination of the variant complexity of algorithmic test and serves as a basis for determining the complexity functions, including the collision concept – the situation of uncertainty, when a choice must be made upon fulfilling the task between the alternatives with various priorities. The influence of collisions on the automata model and its inner structure is described. The model and complexity functions are applied for virtual laboratories upon designing the algorithms of constructing variant with a predetermined complexity in real time and algorithms of the estimation procedures of students’ solution with respect to collisions. The results of the work are applied to the development of virtual laboratories, which are used in the practical part of massive online course on graph theory.

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

  18. Proceedings of Second International Symposium on Games, Automata, Logics and Formal Verification

    CERN Document Server

    D'Agostino, Giovanna; 10.4204/EPTCS.54

    2011-01-01

    This volume contains the Proceedings of the Second International Symposium on Games, Automata, Languages, and Formal Verification (GandALF 2011). The conference was held in Minori (Amalfi Coast, Italy), from the 15th to the 17th of June 2011. The aim of the GandALF Symposium is to provide a forum for researchers from different areas and with different background, that share a common interest in game theory, mathematical logic, automata theory, and their applications to the specification, design, and verification of complex systems. This proceedings contain the abstracts of three invited talks and nineteen regular papers that have been selected through a rigorous reviewing process according to originality, quality, and relevance to the topics of the symposium.

  19. Fast Track Pattern Recognition in High Energy Physics Experiments with the Automata Processor

    CERN Document Server

    Wang, Michael H L S; Green, Christopher; Guo, Deyuan; Wang, Ke; Zmuda, Ted

    2016-01-01

    We explore the Micron Automata Processor (AP) as a suitable commodity technology that can address the growing computational needs of track pattern recognition in High Energy Physics experiments. A toy detector model is developed for which a track trigger based on the Micron AP is used to demonstrate a proof-of-principle. Although primarily meant for high speed text-based searches, we demonstrate that the Micron AP is ideally suited to track finding applications.

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

    OpenAIRE

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

    2016-01-01

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

  1. Cell Based GIS as Cellular Automata for Disaster Spreading Predictions and Required Data Systems

    Directory of Open Access Journals (Sweden)

    Kohei Arai

    2013-03-01

    Full Text Available A method for prediction and simulation based on the Cell Based Geographic Information System(GIS as Cellular Automata (CA is proposed together with required data systems, in particular metasearch engine usage in an unified way. It is confirmed that the proposed cell based GIS as CA has flexible usage of the attribute information that is attached to the cell in concert with location information and does work for disaster spreading simulation and prediction.

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

    Directory of Open Access Journals (Sweden)

    Bachir Djafri

    2009-04-01

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

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

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

  5. Formal languages, automata and numeration systems introduction to combinatorics on words

    CERN Document Server

    Rigo, Michel

    2014-01-01

    Formal Languages, Automaton and Numeration Systems presents readers with a review of research related to formal language theory, combinatorics on words or numeration systems, such as Words, DLT (Developments in Language Theory), ICALP, MFCS (Mathematical Foundation of Computer Science), Mons Theoretical Computer Science Days, Numeration, CANT (Combinatorics, Automata and Number Theory). Combinatorics on words deals with problems that can be stated in a non-commutative monoid, such as subword complexity of finite or infinite words, construction and properties of infinite words, unavoidabl

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

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

  8. Degeneralization Algorithm for Generation of Büchi Automata Based on Contented Situation

    Directory of Open Access Journals (Sweden)

    Laixiang Shan

    2015-01-01

    Full Text Available We present on-the-fly degeneralization algorithm used to transform generalized Büchi automata (GBA into Büchi Automata (BA different from the standard degeneralization algorithm. Contented situation, which is used to record what acceptance conditions are satisfiable during expanding LTL formulae, is attached to the states and transitions in the BA. In order to get the deterministic BA, the Shannon expansion is used recursively when we expand LTL formulae by applying the tableau rules. On-the-fly degeneralization algorithm is carried out in each step of the expansion of LTL formulae. Ordered binary decision diagrams are used to represent the BA and simplify LTL formulae. The temporary automata are stored as syntax directed acyclic graph in order to save storage space. These ideas are implemented in a conversion algorithm used to build a property automaton corresponding to the given LTL formulae. We compare our method to previous work and show that it is more efficient for four sets of random formulae generated by LBTT.

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

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

    Science.gov (United States)

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

    2015-01-01

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Sara Hashemi

    2014-04-01

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

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

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

    CERN Document Server

    Vera, Javier

    2015-01-01

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

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

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

    Directory of Open Access Journals (Sweden)

    P. G. Klyucharev

    2014-01-01

    Full Text Available In the paper the author considers hardware implementation of the GRACE-H family general cellular automata based cryptographic hash functions. VHDL is used as a language and Altera FPGA as a platform for hardware implementation. Performance and effectiveness of the FPGA implementations of GRACE-H hash functions were compared with Keccak (SHA-3, SHA-256, BLAKE, Groestl, JH, Skein hash functions. According to the performed tests, performance of the hardware implementation of GRACE-H family hash functions significantly (up to 12 times exceeded performance of the hardware implementation of previously known hash functions, and effectiveness of that hardware implementation was also better (up to 4 times.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2010-05-15

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

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

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

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

    Institute of Scientific and Technical Information of China (English)

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

    2005-01-01

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

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

    Science.gov (United States)

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

    2015-08-01

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

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

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

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

  6. TCTL-Preserving Translations from Timed-Arc Petri Nets to Networks of Timed Automata

    DEFF Research Database (Denmark)

    Byg, Joakim; Jacobsen, Morten; Jacobsen, Lasse;

    2014-01-01

    We present a framework for TCTL-preserving translations between time-dependent modeling formalisms. The framework guarantees that once the original and the translated system are in one-by-many correspondence relation (a notion of behavioral equivalence between timed transition systems) then TCTL...... properties of the original system can be transformed too while preserving the verification answers. We demonstrate the usability of the technique on two reductions from bounded timed-arc Petri nets to networks for timed automata, providing unified proofs of the translations implemented in the verification...

  7. Dynamic and Quantitative Method of Analyzing Service Consistency Evolution Based on Extended Hierarchical Finite State Automata

    Directory of Open Access Journals (Sweden)

    Linjun Fan

    2014-01-01

    Full Text Available This paper is concerned with the dynamic evolution analysis and quantitative measurement of primary factors that cause service inconsistency in service-oriented distributed simulation applications (SODSA. Traditional methods are mostly qualitative and empirical, and they do not consider the dynamic disturbances among factors in service’s evolution behaviors such as producing, publishing, calling, and maintenance. Moreover, SODSA are rapidly evolving in terms of large-scale, reusable, compositional, pervasive, and flexible features, which presents difficulties in the usage of traditional analysis methods. To resolve these problems, a novel dynamic evolution model extended hierarchical service-finite state automata (EHS-FSA is constructed based on finite state automata (FSA, which formally depict overall changing processes of service consistency states. And also the service consistency evolution algorithms (SCEAs based on EHS-FSA are developed to quantitatively assess these impact factors. Experimental results show that the bad reusability (17.93% on average is the biggest influential factor, the noncomposition of atomic services (13.12% is the second biggest one, and the service version’s confusion (1.2% is the smallest one. Compared with previous qualitative analysis, SCEAs present good effectiveness and feasibility. This research can guide the engineers of service consistency technologies toward obtaining a higher level of consistency in SODSA.

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

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

    Science.gov (United States)

    Miranda, Gisele Helena Barboni; Machicao, Jeaneth; Bruno, Odemir Martinez

    2016-11-01

    Network science is an interdisciplinary field which provides an integrative approach for the study of complex systems. In recent years, network modeling has been used for the study of emergent phenomena in many real-world applications. Pattern recognition in networks has been drawing attention to the importance of network characterization, which may lead to understanding the topological properties that are related to the network model. In this paper, the Life-Like Network Automata (LLNA) method is introduced, which was designed for pattern recognition in networks. LLNA uses the network topology as a tessellation of Cellular Automata (CA), whose dynamics produces a spatio-temporal pattern used to extract the feature vector for network characterization. The method was evaluated using synthetic and real-world networks. In the latter, three pattern recognition applications were used: (i) identifying organisms from distinct domains of life through their metabolic networks, (ii) identifying online social networks and (iii) classifying stomata distribution patterns varying according to different lighting conditions. LLNA was compared to structural measurements and surpasses them in real-world applications, achieving improvement in the classification rate as high as 23%, 4% and 7% respectively. Therefore, the proposed method is a good choice for pattern recognition applications using networks and demonstrates potential for general applicability.

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

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

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

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

    Science.gov (United States)

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

    2012-12-01

    We study the two-dimensional traffic of cellular automata using computer simulation. We propose two type of decentralized cooperation strategies, which are called stepping aside (CS-SA) and choosing alternative routes (CS-CAR) respectively. We introduce them into an existing two-dimensional cellular automata (CA) model. CS-SA is designed to prohibit a kind of ping-pong jump when two objects standing together try to move in opposite directions. CS-CAR is designed to change the solution of conflict in parallel update. CS-CAR encourages the objects involved in parallel conflicts choose their alternative routes instead of waiting. We also combine the two cooperation strategies (CS-SA-CAR) to test their combined effects. It is found that the system keeps on a partial jam phase with nonzero velocity and flow until the density reaches one. The ratios of the ping-pong jump and the waiting objects involved in conflict are decreased obviously, especially at the free phase. And the average flow is improved by the three cooperation strategies. Although the average travel time is lengthened a bit by CS-CAR, it is shorten by CS-SA and CS-SA-CAR. In addition, we discuss the advantage and applicability of decentralized cooperation modeling.

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

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

    CERN Document Server

    Arrighi, Pablo

    2012-01-01

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

  16. On the implementation of frontier-to-root tree automata in recursive neural networks.

    Science.gov (United States)

    Gori, M; Küchler, A; Sperduti, A

    1999-01-01

    In this paper we explore the node complexity of recursive neural network implementations of frontier-to-root tree automata (FRA). Specifically, we show that an FRAO (Mealy version) with m states, l input-output labels, and maximum rank N can be implemented by a recursive neural network with O(radical(log l+log m)lm(N)/log l+N log m) units and four computational layers, i.e., without counting the input layer. A lower bound is derived which is tight when no restrictions are placed on the number of layers. Moreover, we present a construction with three computational layers having node complexity of O((log l + log m)radical lmN) and O((log l + log m) lmN) connections. A construction with two computational layers is given that implements any given FRAO with a node complexity of O(lmN) and O((log l+N log m)lmN) connections. As a corollary we also get a new upper bound for the implementation of finite-state automata (FSA) into recurrent neural networks with three computational layers.

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

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

  19. Becoming Automatous: Automata in The Old Curiosity Shop and Our Mutual Friend

    Directory of Open Access Journals (Sweden)

    Katherine Inglis

    2008-04-01

    Full Text Available An automaton is a mechanical dissembler, appearing to possess that which by definition it cannot – autonomy. In the Victorian material imagination, this liminal figure appears as an analogy for both normal and pathological behaviours, as a paradigm and a warning, as a doppelgänger of the ideal worker and a symbol of all that was held to be reactive, affectless and inhuman. In 'The Old Curiosity Shop 'and 'Our Mutual Friend', Dickens merges this symbolic automaton with the marvellous showpieces and mass-produced toys of popular culture, creating an ambiguous, distressed figure whose unstable autonomy casts doubt on the authenticity of the freedom of automatous (automaton-like characters. 'The Old Curiosity Shop', which features a cameo by an automaton, draws on factory literature's shifting material subjectivity in its portrayal of Little Nell and Quilp's automatous affinities. In 'Our Mutual Friend' musical automata and speaking machines are models for human degradation. In both novels, automatous humans appear to be autonomous self-movers, but are perhaps, like android automata, dissemblers performing an imperfect impression of human agency.

  20. Analysis of quantum particle automata for solving the density classification problem

    Science.gov (United States)

    Yu, Tina; Ben-Av, Radel

    2015-04-01

    To advance our understanding of quantum cellular automata in problem solving through parallel and distributed computing, this research quantized the density classification problem and adopted the quantum particle automata (QPA) to solve the quantized problem. In order to solve this problem, the QPA needed a unitary operator to carry out the QPA evolution and a boundary partition to make the classification decisions. We designed a genetic algorithm (GA) to search for the unitary operators and the boundary partitions to classify the density of binary inputs with length 5. The GA was able to find more than one unitary operator that can transform the QPA in ways such that when the particle was measured, it was more likely to collapse to the basis states that were on the correct side of the boundary partition for the QPA to decide whether the binary input had majority density 0 or majority density 1. We analyzed these solutions and found that the QPA evolution dynamic was driven by a particular parameter of the unitary operator: A small gave the particle small mass hence fast evolution, while large had the opposite effect. While these results are encouraging, scaling these solutions for binary inputs of arbitrary length of requires additional analysis, which we will investigate in our future work.

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

    NARCIS (Netherlands)

    Azari, M; Tayyebi, A; Helbich, M; Ahadnejad Reveshty, M

    2016-01-01

    Urbanization processes challenge the growth of orchards areas in many cities in Iran. In Maragheh orchards are crucial ecological, economical, and tourist sources. To explore orchards threatened by urban expansion, this study aims, first, to develop a new model by coupling cellular automata and arti

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

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

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

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

    Institute of Scientific and Technical Information of China (English)

    XU Bin; TANG Linxin; SHI Hanmin

    2006-01-01

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

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

  7. Towards a Formal Semantics for UML/MARTE State Machines Based on Hierarchical Timed Automata

    Institute of Scientific and Technical Information of China (English)

    Yu Zhou; Luciano Baresi; Matteo Rossi

    2013-01-01

    UML is a widely-used,general purpose modeling language.But its lack of a rigorous semantics forbids the thorough analysis of designed solution,and thus precludes the discovery of significant problems at design time.To bridge the gap,the paper investigates the underlying semantics of UML state machine diagrams,along with the time-related modeling elements of MARTE,the profile for modeling and analysis of real-time embedded systems,and proposes a formal operational semantics based on extended hierarchical timed automata.The approach is exemplified on a simple example taken from the automotive domain.Verification is accomplished by translating designed models into the input language of the UPPAAL model checker.

  8. Real-Time Extended Interface Automata for Software Testing Cases Generation

    Directory of Open Access Journals (Sweden)

    Shunkun Yang

    2014-01-01

    Full Text Available Testing and verification of the interface between software components are particularly important due to the large number of complex interactions, which requires the traditional modeling languages to overcome the existing shortcomings in the aspects of temporal information description and software testing input controlling. This paper presents the real-time extended interface automata (RTEIA which adds clearer and more detailed temporal information description by the application of time words. We also establish the input interface automaton for every input in order to solve the problems of input controlling and interface covering nimbly when applied in the software testing field. Detailed definitions of the RTEIA and the testing cases generation algorithm are provided in this paper. The feasibility and efficiency of this method have been verified in the testing of one real aircraft braking system.

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

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

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

    CERN Document Server

    Zapata, Elena Villarreal

    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 characteristics in a detailed manner, and submitting them to a set of randomness tests with the end of knowing which of them will enable us to obtain those pseudo-random numbers that will conform the key for data ciphering.

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

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

    CERN Document Server

    Vera, Javier; Goles, Eric

    2015-01-01

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

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

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

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

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

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

    Science.gov (United States)

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

    2013-01-01

    Further downscaling of CMOS technology becomes challenging as it faces limitation of feature size reduction. Quantum-dot cellular automata (QCA), a potential alternative to CMOS, promises efficient digital design at nanoscale. Investigations on the reduction of QCA primitives (majority gates and inverters) for various adders are limited, and very few designs exist for reference. As a result, design of adders under QCA framework is gaining its importance in recent research. This work targets developing multi-layered full adder architecture in QCA framework based on five-input majority gate proposed here. A minimum clock zone (2 clock) with high compaction (0.01 μ m(2)) for a full adder around QCA is achieved. Further, the usefulness of such design is established with the synthesis of high-level logic. Experimental results illustrate the significant improvements in design level in terms of circuit area, cell count, and clock compared to that of conventional design approaches.

  17. Design of Efficient Full Adder in Quantum-Dot Cellular Automata

    Directory of Open Access Journals (Sweden)

    Bibhash Sen

    2013-01-01

    Full Text Available Further downscaling of CMOS technology becomes challenging as it faces limitation of feature size reduction. Quantum-dot cellular automata (QCA, a potential alternative to CMOS, promises efficient digital design at nanoscale. Investigations on the reduction of QCA primitives (majority gates and inverters for various adders are limited, and very few designs exist for reference. As a result, design of adders under QCA framework is gaining its importance in recent research. This work targets developing multi-layered full adder architecture in QCA framework based on five-input majority gate proposed here. A minimum clock zone (2 clock with high compaction (0.01 μm2 for a full adder around QCA is achieved. Further, the usefulness of such design is established with the synthesis of high-level logic. Experimental results illustrate the significant improvements in design level in terms of circuit area, cell count, and clock compared to that of conventional design approaches.

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

    Science.gov (United States)

    Orbanic, Henri; Junkar, Mihael

    2004-11-01

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

  19. Cellular Automata Modelling of Photo-Induced Oxidation Processes in Molecularly Doped Polymers

    Directory of Open Access Journals (Sweden)

    David M. Goldie

    2016-11-01

    Full Text Available The possibility of employing cellular automata (CA to model photo-induced oxidation processes in molecularly doped polymers is explored. It is demonstrated that the oxidation dynamics generated using CA models exhibit stretched-exponential behavior. This dynamical characteristic is in general agreement with an alternative analysis conducted using standard rate equations provided the molecular doping levels are sufficiently low to prohibit the presence of safe-sites which are impenetrable to dissolved oxygen. The CA models therefore offer the advantage of exploring the effect of dopant agglomeration which is difficult to assess from standard rate equation solutions. The influence of UV-induced bleaching or darkening upon the resulting oxidation dynamics may also be easily incorporated into the CA models and these optical effects are investigated for various photo-oxidation product scenarios. Output from the CA models is evaluated for experimental photo-oxidation data obtained from a series of hydrazone-doped polymers.

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

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

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

    Directory of Open Access Journals (Sweden)

    Faraoun Kamel Mohamed

    2014-06-01

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

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

    Science.gov (United States)

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Kenichi Morita

    2012-08-01

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

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

  8. Gioco ingegno utopia. Automata sonori nel mondo greco romano. Alcuni spunti di riflessione

    Directory of Open Access Journals (Sweden)

    Francesca Berlinzani

    2013-07-01

    Full Text Available The paper collects the greek and latin testimonies on real or fictitious acoustic automata. The words and the meanings concerning the automatic devices have been considered and analysed, together with the most important personalities of engineers and inventors, in order to determine and single out the possible connections between their creations and the social, political and economic systems that gave impulse to this creative impetus. The analysis tries also to point to the ludic aspects of this process, in which abstraction, epistemological mechanisms, empiric praxis, go together and alternate themselves in a game played between the inventor and his public, a game made of secrets, enigmas, discoveries and acknowledgement, in order to obtain concrete objects that share many aspects with the toys.

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

    Science.gov (United States)

    Vargas, David L.

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

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

    Science.gov (United States)

    Karkaj, Ehsan Taher; Heikalabad, Saeed Rasouli

    2017-01-01

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

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

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

  13. REDUNDANT ELECTRIC MOTOR DRIVE CONTROL UNIT DESIGN USING AUTOMATA-BASED APPROACH

    Directory of Open Access Journals (Sweden)

    Yuri Yu. Yankin

    2014-11-01

    Full Text Available Implementation of redundant unit for motor drive control based on programmable logic devices is discussed. Continuous redundancy method is used. As compared to segregated standby redundancy and whole system standby redundancy, such method provides preservation of all unit functions in case of redundancy and gives the possibility for continuous monitoring of major and redundant elements. Example of that unit is given. Electric motor drive control channel block diagram contains two control units – the major and redundant; it also contains four power supply units. Control units programming was carried out using automata-based approach. Electric motor drive control channel model was developed; it provides complex simulation of control state-machine and power converter. Through visibility and hierarchy of finite state machines debug time was shortened as compared to traditional programming. Control state-machine description using hardware description language is required for its synthesis with FPGA-devices vendor design software. This description was generated automatically by MATLAB software package. To verify results two prototype control units, two prototype power supply units, and device mock-up were developed and manufactured. Units were installed in the device mock-up. Prototype units were created in accordance with requirements claimed to deliverable hardware. Control channel simulation and tests results in the perfect state and during imitation of major element fault are presented. Automata-based approach made it possible to observe and debug control state-machine transitions during simulation of transient processes, occurring at imitation of faults. Results of this work can be used in development of fault tolerant electric motor drive control channels.

  14. Urn Automata

    Science.gov (United States)

    2003-11-05

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

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

    Directory of Open Access Journals (Sweden)

    Yu Zou

    2013-07-01

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

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

    Science.gov (United States)

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

    2013-10-01

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

  17. Using the automata processor for fast pattern recognition in high energy physics experiments—A proof of concept

    Energy Technology Data Exchange (ETDEWEB)

    Wang, Michael H.L.S., E-mail: mwang@fnal.gov [Fermi National Accelerator Laboratory, Batavia, IL 60510 (United States); Cancelo, Gustavo; Green, Christopher [Fermi National Accelerator Laboratory, Batavia, IL 60510 (United States); Guo, Deyuan; Wang, Ke [University of Virginia, Charlottesville, VA 22904 (United States); Zmuda, Ted [Fermi National Accelerator Laboratory, Batavia, IL 60510 (United States)

    2016-10-01

    We explore the Micron Automata Processor (AP) as a suitable commodity technology that can address the growing computational needs of pattern recognition in High Energy Physics (HEP) experiments. A toy detector model is developed for which an electron track confirmation trigger based on the Micron AP serves as a test case. Although primarily meant for high speed text-based searches, we demonstrate a proof of concept for the use of the Micron AP in a HEP trigger application.

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

    DEFF Research Database (Denmark)

    Skiadas, Ioannis V.; Ahring, Birgitte Kiær

    2002-01-01

    characteristics and lead to different reactor behaviour. A dynamic mathematical model has been developed for the anaerobic digestion of a glucose based synthetic wastewater in UASB reactors. Cellular automata (CA) theory has been applied to simulate the granule development process. The model takes...... into consideration that granule diameter and granule microbial composition are functions of the reactor operational parameters and is capable of predicting the UASB performance and the layer structure of the granules....

  19. Using the automata processor for fast pattern recognition in high energy physics experiments-A proof of concept

    Science.gov (United States)

    Wang, Michael H. L. S.; Cancelo, Gustavo; Green, Christopher; Guo, Deyuan; Wang, Ke; Zmuda, Ted

    2016-10-01

    We explore the Micron Automata Processor (AP) as a suitable commodity technology that can address the growing computational needs of pattern recognition in High Energy Physics (HEP) experiments. A toy detector model is developed for which an electron track confirmation trigger based on the Micron AP serves as a test case. Although primarily meant for high speed text-based searches, we demonstrate a proof of concept for the use of the Micron AP in a HEP trigger application.

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

    Directory of Open Access Journals (Sweden)

    Pabitra Pal Choudhury

    2011-01-01

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

  1. Controlling chemical dosing for sulfide mitigation in sewer networks using a hybrid automata control strategy.

    Science.gov (United States)

    Liu, Yiqi; Ganigué, Ramon; Sharma, Keshab; Yuan, Zhiguo

    2013-01-01

    Chemicals such as magnesium hydroxide (Mg(OH)2) and iron salts are widely used to control sulfide-induced corrosion in sewer networks composed of interconnected sewer pipe lines and pumping stations. Chemical dosing control is usually non-automatic and based on experience, thus often resulting in sewage reaching the discharge point receiving inadequate or even no chemical dosing. Moreover, intermittent operation of pumping stations makes traditional control theory inadequate. A hybrid automata-based (HA-based) control method is proposed in this paper to coordinate sewage pumping station operations by considering their states, thereby ensuring suitable chemical concentrations in the network discharge. The performance of the proposed control method was validated through a simulation study of a real sewer network using real sewage flow data. The physical, chemical and biological processes were simulated using the well-established SeweX model. The results suggested that the HA-based control strategy significantly improved chemical dosing control performance and sulfide mitigation in sewer networks, compared to the current common practice.

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

    Directory of Open Access Journals (Sweden)

    Xian-sheng Li

    2013-01-01

    Full Text Available With the rapid development of urban transport and the sharp increase in vehicle population, traffic accidents form one of the most important causes of urban traffic congestion other than the imbalance between traffic supply and demand. Traffic congestion causes severe problems, such as environment contamination and energy dissipation. Therefore, it would be useful to analyze the congestion propagation characteristics after traffic accidents. Numerical analysis and computer simulation were two of the typical methods used at present to study the traffic congestion propagation properties. The latter was more widespread as it is more consistent with the actual traffic flow and more visual than the former. In this paper, an improved cellular automata (CA model was presented to analyze traffic congestion propagation properties and to evaluate control strategies. In order to apply them to urban traffic flow simulation, the CA models have been improved and expanded on. Computer simulations were built for congestion not only extending to the upstream intersection, but also the upstream intersection and the entire road network, respectively. Congestion propagation characteristics after road traffic accidents were obtained, and controls of different severities and durations were analyzed. The results provide the theoretical foundation and practical means for the control of congestion.

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

    Directory of Open Access Journals (Sweden)

    Sung-Shik T.Q. Jongmans

    2011-07-01

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

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

    Directory of Open Access Journals (Sweden)

    Liqiang Ji

    2013-01-01

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

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

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

  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. Defining high-detail hazard maps by a cellular automata approach: application to Mount Etna (Italy

    Directory of Open Access Journals (Sweden)

    William Spataro

    2011-12-01

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

  9. Analysis of competition between transformation pathways in the functioning of biotic abstract dual automata.

    Science.gov (United States)

    Popa, Radu; Cimpoiasu, Vily M

    2013-05-01

    Properties of avenues of transformation and their mutualism with forms of organization in dynamic systems are essential for understanding the evolution of prebiotic order. We have analyzed competition between two avenues of transformation in an A↔B system, using the simulation approach called BiADA (Biotic Abstract Dual Automata). We discuss means of avoiding common pitfalls of abstract system modeling and benefits of BiADA-based simulations. We describe the effect of the availability of free energy, energy sink magnitude, and autocatalysis on the evolution of energy flux and order in the system. Results indicate that prebiotic competition between avenues of transformation was more stringent in energy-limited environments. We predict that in such conditions the efficiency of autocatalysis during competition between alternative system states will increase for systems with forms of organization having short half-lives and thus information that is time-sensitive to energy starvation. Our results also offer a potential solution to Manfred Eigen's error catastrophe dilemma. In the conditions discussed above, the exponential growth of quasi species is curbed through the removal of less competitive "genetic" variants via energy starvation. We propose that one of the most important achievements (and selective edges) of a dynamic network during competition in energy-limited or energy-variable environments was the capacity to correlate the internal energy flux and the need for free energy with the availability of free energy in the environment.

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

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

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

    Science.gov (United States)

    Progias, Pavlos; Amanatiadis, Angelos A.; Spataro, William; Trunfio, Giuseppe A.; Sirakoulis, Georgios Ch.

    2016-10-01

    Optimization algorithms are often inspired by processes occuring in nature, such as animal behavioral patterns. The main concern with implementing such algorithms in software is the large amounts of processing power they require. In contrast to software code, that can only perform calculations in a serial manner, an implementation in hardware, exploiting the inherent parallelism of single-purpose processors, can prove to be much more efficient both in speed and energy consumption. Furthermore, the use of Cellular Automata (CA) in such an implementation would be efficient both as a model for natural processes, as well as a computational paradigm implemented well on hardware. In this paper, we propose a VHDL implementation of a metaheuristic algorithm inspired by the echolocation behavior of bats. More specifically, the CA model is inspired by the metaheuristic algorithm proposed earlier in the literature, which could be considered at least as efficient than other existing optimization algorithms. The function of the FPGA implementation of our algorithm is explained in full detail and results of our simulations are also demonstrated.

  13. Statistical learning and the challenge of syntax: Beyond finite state automata

    Science.gov (United States)

    Elman, Jeff

    2003-10-01

    Over the past decade, it has been clear that even very young infants are sensitive to the statistical structure of language input presented to them, and use the distributional regularities to induce simple grammars. But can such statistically-driven learning also explain the acquisition of more complex grammar, particularly when the grammar includes recursion? Recent claims (e.g., Hauser, Chomsky, and Fitch, 2002) have suggested that the answer is no, and that at least recursion must be an innate capacity of the human language acquisition device. In this talk evidence will be presented that indicates that, in fact, statistically-driven learning (embodied in recurrent neural networks) can indeed enable the learning of complex grammatical patterns, including those that involve recursion. When the results are generalized to idealized machines, it is found that the networks are at least equivalent to Push Down Automata. Perhaps more interestingly, with limited and finite resources (such as are presumed to exist in the human brain) these systems demonstrate patterns of performance that resemble those in humans.

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

  15. A Novel Stochastic Learning Automata Based SON Interference Mitigation Framework for 5G HetNets

    Directory of Open Access Journals (Sweden)

    M. N. Qureshi

    2016-12-01

    Full Text Available Long Term Evolution Advanced (LTE-A Heterogeneous Networks (HetNet are an important aspect of 5th generation mobile communication systems. They consists of high power macrocells along with low power cells i.e. picocells and femtocells to fill up macrocell coverage gaps. HetNet permit deployment of femtocells by users for added flexibility, but then interference issues between neighbouring cells have to be addressed as all femtocells use the same frequency channels for transmission. To mitigate this problem, LTE-A standard offers two new features, one is carrier aggregation in which Component Carriers (CC form the basic aggregate units shared among cells and the other is enhanced Inter-Cell Interference Co-ordination (eICIC through X2 interface. The physical implementation of these features is left open to research. This paper investigates two distinct techniques for orthogonal CC selection through Stochastic Cellular Learning Automata (SCLA to improve the QoS performance of a femtocell. The first, technique uses SCLA with user feedback, and the second technique uses SCLA with a central publishing server where all cells upload their past used CC vectors. SCLA methods are better suited for Self Organizing Network (SON as they do not require synchronized cell coordination, have low complexity and have good optimization characteristics. The simulation results show that the techniques enhance the cell edge performance considerably.

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

    Science.gov (United States)

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

    2013-10-01

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

  17. Pedestrian intention prediction based on dynamic fuzzy automata for vehicle driving at nighttime

    Science.gov (United States)

    Kwak, Joon-Young; Ko, Byoung Chul; Nam, Jae-Yeal

    2017-03-01

    In this paper, we propose a novel algorithm that can predict a pedestrian's intention using images captured by a far-infrared thermal camera mounted on a moving car at nighttime. To predict a pedestrian's intention in consecutive sequences, we use the dynamic fuzzy automata (DFA) method, which not only provides a systemic approach for handling uncertainty but also is able to handle continuous spaces. As the spatio-temporal features, the distance between the curbs and the pedestrian and the pedestrian's velocity and head orientation are used. In this study, we define four intention states of the pedestrian: Standing-Sidewalk (S-SW), Walking-Sidewalk (W-SW), Walking-Crossing (W-Cro), and Running-Crossing (R-Cro). In every frame, the proposed system determines the final intention of the pedestrian as 'Stop' if the pedestrian's intention state is S-SW or W-SW. In contrast, the proposed system determines the final intention of a pedestrian as 'Cross' if the pedestrian's intention state is W-Cro or R-Cro. A performance comparison with other related methods shows that the performance of the proposed algorithm is better than that of other related methods. The proposed algorithm was successfully applied to our dataset, which includes complex environments with many pedestrians.

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

    Directory of Open Access Journals (Sweden)

    ChengHe Guan

    2016-12-01

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

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

    Science.gov (United States)

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

    2016-11-01

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

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

  1. Link prediction based on temporal similarity metrics using continuous action set learning automata

    Science.gov (United States)

    Moradabadi, Behnaz; Meybodi, Mohammad Reza

    2016-10-01

    Link prediction is a social network research area that tries to predict future links using network structure. The main approaches in this area are based on predicting future links using network structure at a specific period, without considering the links behavior through different periods. For example, a common traditional approach in link prediction calculates a chosen similarity metric for each non-connected link and outputs the links with higher similarity scores as the prediction result. In this paper, we propose a new link prediction method based on temporal similarity metrics and Continuous Action set Learning Automata (CALA). The proposed method takes advantage of using different similarity metrics as well as different time periods. In the proposed algorithm, we try to model the link prediction problem as a noisy optimization problem and use a team of CALAs to solve the noisy optimization problem. CALA is a reinforcement based optimization tool which tries to learn the optimal behavior from the environment feedbacks. To determine the importance of different periods and similarity metrics on the prediction result, we define a coefficient for each of different periods and similarity metrics and use a CALA for each coefficient. Each CALA tries to learn the true value of the corresponding coefficient. Final link prediction is obtained from a combination of different similarity metrics in different times based on the obtained coefficients. The link prediction results reported here show satisfactory of the proposed method for some social network data sets.

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

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

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

  5. Control of Discrete-Event Systems Automata and Petri Net Perspectives

    CERN Document Server

    Silva, Manuel; Schuppen, Jan

    2013-01-01

    Control of Discrete-event Systems provides a survey of the most important topics in the discrete-event systems theory with particular focus on finite-state automata, Petri nets and max-plus algebra. Coverage ranges from introductory material on the basic notions and definitions of discrete-event systems to more recent results. Special attention is given to results on supervisory control, state estimation and fault diagnosis of both centralized and distributed/decentralized systems developed in the framework of the Distributed Supervisory Control of Large Plants (DISC) project. Later parts of the text are devoted to the study of congested systems though fluidization, an over approximation allowing a much more efficient study of observation and control problems of timed Petri nets. Finally, the max-plus algebraic approach to the analysis and control of choice-free systems is also considered. Control of Discrete-event Systems provides an introduction to discrete-event systems for readers that are not familiar wi...

  6. From Boolean logic to switching circuits and automata. Towards modern information technology

    Energy Technology Data Exchange (ETDEWEB)

    Stankovic, Radomir S. [Nis Univ. (RS). Dept. of Computer Science; Astola, Jaakko [Tampere Univ. of Technology (Finland). Dept. of Signal Processing

    2011-07-01

    Logic networks and automata are facets of digital systems. The change of the design of logic networks from skills and art into a scientific discipline was possible by the development of the underlying mathematical theory called the Switching Theory. The fundamentals of this theory come from the attempts towards an algebraic description of laws of thoughts presented in the works by George J. Boole and the works on logic by Augustus De Morgan. As often the case in engineering, when the importance of a problem and the need for solving it reach certain limits, the solutions are searched by many scholars in different parts of the word, simultaneously or at about the same time, however, quite independently and often unaware of the work by other scholars. The formulation and rise of Switching Theory is such an example. This book presents a brief account of the developments of Switching Theory and highlights some less known facts in the history of it. The readers will find the book a fresh look into the development of the field revealing how difficult it has been to arrive at many of the concepts that we now consider obvious. Researchers in the history or philosophy of computing will find this book a valuable source of information that complements the standard presentations of the topic. (orig.)

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

    Science.gov (United States)

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

    2015-05-01

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

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

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

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

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

    Science.gov (United States)

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

    1990-06-01

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

  10. Using probabilistic finite automata to simulate hourly series of global radiation

    Energy Technology Data Exchange (ETDEWEB)

    Mora-Lopez, L. [Universidad de Malaga (Spain). Dpto. Lenguajes y Computacion; Sidrach-de-Cardona, M. [Universidad de Malaga (Spain). Dpto. Fisica Aplicada II

    2003-03-01

    A model to generate synthetic series of hourly exposure of global radiation is proposed. This model has been constructed using a machine learning approach. It is based on the use of a subclass of probabilistic finite automata which can be used for variable-order Markov processes. This model allows us to represent the different relationships and the representative information observed in the hourly series of global radiation; the variable-order Markov process can be used as a natural way to represent different types of days, and to take into account the ''variable memory'' of cloudiness. A method to generate new series of hourly global radiation, which incorporates the randomness observed in recorded series, is also proposed. As input data this method only uses the mean monthly value of the daily solar global radiation. We examine if the recorded and simulated series are similar. It can be concluded that both series have the same statistical properties. (author)

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

    Institute of Scientific and Technical Information of China (English)

    LU Yi; CAO Min; ZHANG Lei

    2015-01-01

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

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

    Science.gov (United States)

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

    2015-04-01

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Marta Capiluppi

    2012-10-01

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

  16. Reasoning about real-time systems with temporal interval logic constraints on multi-state automata

    Science.gov (United States)

    Gabrielian, Armen

    1991-01-01

    Models of real-time systems using a single paradigm often turn out to be inadequate, whether the paradigm is based on states, rules, event sequences, or logic. A model-based approach to reasoning about real-time systems is presented in which a temporal interval logic called TIL is employed to define constraints on a new type of high level automata. The combination, called hierarchical multi-state (HMS) machines, can be used to model formally a real-time system, a dynamic set of requirements, the environment, heuristic knowledge about planning-related problem solving, and the computational states of the reasoning mechanism. In this framework, mathematical techniques were developed for: (1) proving the correctness of a representation; (2) planning of concurrent tasks to achieve goals; and (3) scheduling of plans to satisfy complex temporal constraints. HMS machines allow reasoning about a real-time system from a model of how truth arises instead of merely depending of what is true in a system.

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

    Science.gov (United States)

    Tambunan, L.; Salamah, H.; Asriana, N.

    2017-03-01

    This study aims to determine the influence of architectural design on the risk of fire spread in densely urban settlement area. Cellular Automata (CA) is used to analyse the fire spread pattern, speed, and the extent of damage. Four cells represent buildings, streets, and fields characteristic in the simulated area, as well as their flammability level and fire spread capabilities. Two fire scenarios are used to model the spread of fire: (1) fire origin in a building with concrete and wood material majority, and (2) fire origin in building with wood material majority. Building shape, building distance, road width, and total area of wall openings are considered constant, while wind is ignored. The result shows that fire spread faster in the building area with wood majority than with concrete majority. Significant amount of combustible building material, absence of distance between buildings, narrow streets and limited fields are factors which influence fire spread speed and pattern as well as extent of damage when fire occurs in the densely urban settlement area.

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

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

    Directory of Open Access Journals (Sweden)

    Paulo Rangel Rios

    2006-06-01

    Full Text Available The effect of non-random nuclei location and the efficiency of microstructural descriptors in assessing such a situation are studied. Cellular automata simulation of recrystallization in two dimensions is carried out to simulate microstrutural evolution for nuclei distribution ranging from a periodic arrangement to clusters of nuclei. The simulation results are compared in detail with microstrutural descriptors normally used to follow transformation evolution. It is shown that the contiguity is particularly relevant to detect microstructural deviations from randomness. This work focuses on recrystallization but its results are applicable to any nucleation and growth transformation.

  20. Dynamical Behavior of Multi-Robot Systems Using Lattice Gas Automata

    Energy Technology Data Exchange (ETDEWEB)

    Cameron, S.M.; Robinett, R.; Stantz, K.M.; Trahan, M.W.; Wagner, J.S.

    1999-03-11

    Recent attention has been given to the deployment of an adaptable sensor array realized by multi-robotic systems. Our group has been studying the collective behavior of autonomous, multi-agent systems and their applications in the area of remote-sensing and emerging threats. To accomplish such tasks, an interdisciplinary research effort at Sandia National Laboratories are conducting tests in the fields of sensor technology, robotics, and multi-robotic and multi-agents architectures. Our goal is to coordinate a constellation of point sensors that optimizes spatial coverage and multivariate signal analysis using unmanned robotic vehicles (e.g., RATLERs, Robotic All-ten-sin Lunar Exploration Rover-class vehicles). Overall design methodology is to evolve complex collective behaviors realized through simple interaction (kinetic) physics and artificial intelligence to enable real-time operational responses to emerging threats. This paper focuses on our recent work understanding the dynamics of many-body systems using the physics-based hydrodynamic model of lattice gas automata. Three design features are investigated. One, for single-speed robots, a hexagonal nearest-neighbor interaction topology is necessary to preserve standard hydrodynamic flow. Two, adaptability, defined by the swarm's deformation rate, can be controlled through the hydrodynamic viscosity term, which, in turn, is defined by the local robotic interaction rules. Three, due to the inherent non-linearity of the dynamical equations describing large ensembles, development of stability criteria ensuring convergence to equilibrium states is developed by scaling information flow rates relative to a swarm's hydrodynamic flow rate. An initial test case simulates a swarm of twenty-five robots that maneuvers past an obstacle while following a moving target. A genetic algorithm optimizes applied nearest-neighbor forces in each of five spatial regions distributed over the simulation domain. Armed with

  1. Design pattern mining using distributed learning automata and DNA sequence alignment.

    Directory of Open Access Journals (Sweden)

    Mansour Esmaeilpour

    Full Text Available CONTEXT: Over the last decade, design patterns have been used extensively to generate reusable solutions to frequently encountered problems in software engineering and object oriented programming. A design pattern is a repeatable software design solution that provides a template for solving various instances of a general problem. OBJECTIVE: This paper describes a new method for pattern mining, isolating design patterns and relationship between them; and a related tool, DLA-DNA for all implemented pattern and all projects used for evaluation. DLA-DNA achieves acceptable precision and recall instead of other evaluated tools based on distributed learning automata (DLA and deoxyribonucleic acid (DNA sequences alignment. METHOD: The proposed method mines structural design patterns in the object oriented source code and extracts the strong and weak relationships between them, enabling analyzers and programmers to determine the dependency rate of each object, component, and other section of the code for parameter passing and modular programming. The proposed model can detect design patterns better that available other tools those are Pinot, PTIDEJ and DPJF; and the strengths of their relationships. RESULTS: The result demonstrate that whenever the source code is build standard and non-standard, based on the design patterns, then the result of the proposed method is near to DPJF and better that Pinot and PTIDEJ. The proposed model is tested on the several source codes and is compared with other related models and available tools those the results show the precision and recall of the proposed method, averagely 20% and 9.6% are more than Pinot, 27% and 31% are more than PTIDEJ and 3.3% and 2% are more than DPJF respectively. CONCLUSION: The primary idea of the proposed method is organized in two following steps: the first step, elemental design patterns are identified, while at the second step, is composed to recognize actual design patterns.

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

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

    Science.gov (United States)

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

    2014-05-01

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

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

  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. Design Pattern Mining Using Distributed Learning Automata and DNA Sequence Alignment

    Science.gov (United States)

    Esmaeilpour, Mansour; Naderifar, Vahideh; Shukur, Zarina

    2014-01-01

    Context Over the last decade, design patterns have been used extensively to generate reusable solutions to frequently encountered problems in software engineering and object oriented programming. A design pattern is a repeatable software design solution that provides a template for solving various instances of a general problem. Objective This paper describes a new method for pattern mining, isolating design patterns and relationship between them; and a related tool, DLA-DNA for all implemented pattern and all projects used for evaluation. DLA-DNA achieves acceptable precision and recall instead of other evaluated tools based on distributed learning automata (DLA) and deoxyribonucleic acid (DNA) sequences alignment. Method The proposed method mines structural design patterns in the object oriented source code and extracts the strong and weak relationships between them, enabling analyzers and programmers to determine the dependency rate of each object, component, and other section of the code for parameter passing and modular programming. The proposed model can detect design patterns better that available other tools those are Pinot, PTIDEJ and DPJF; and the strengths of their relationships. Results The result demonstrate that whenever the source code is build standard and non-standard, based on the design patterns, then the result of the proposed method is near to DPJF and better that Pinot and PTIDEJ. The proposed model is tested on the several source codes and is compared with other related models and available tools those the results show the precision and recall of the proposed method, averagely 20% and 9.6% are more than Pinot, 27% and 31% are more than PTIDEJ and 3.3% and 2% are more than DPJF respectively. Conclusion The primary idea of the proposed method is organized in two following steps: the first step, elemental design patterns are identified, while at the second step, is composed to recognize actual design patterns. PMID:25243670

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

    Science.gov (United States)

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

    2017-02-01

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

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

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

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

    Energy Technology Data Exchange (ETDEWEB)

    Mora, Juan Carlos Seck Tuoh [Centro de Investigacion Avanzada en Ingenieria Industrial, Universidad Autonoma del Estado de Hidalgo, Carr Pachuca-Tulancingo Km 4.5, 42020 Pachuca (Mexico); Hernandez, Manuel Gonzalez [Centro de Investigacion Avanzada en Ingenieria Industrial, Universidad Autonoma del Estado de Hidalgo, Carr Pachuca-Tulancingo Km 4.5, 42020 Pachuca (Mexico); Vergara, Sergio V Chapa [Depto de Ingenieria Electrica, Seccion Computacion, Centro de Investigacion y de Estudios Avanzados, Instituto Politecnico Nacional, Av IPN 2508, Col San Pedro Zacatenco, 07300 DF (Mexico)

    2003-07-25

    Reversible cellular automata are invertible discrete dynamical systems which have been widely studied both for analysing interesting theoretical questions and for obtaining relevant practical applications, for instance, simulating invertible natural systems or implementing data coding devices. An important problem in the theory of reversible automata is to know how the local behaviour which is not invertible is able to yield a reversible global one. In this sense, symbolic dynamics plays an important role for obtaining an adequate representation of a reversible cellular automaton. In this paper we prove the equivalence between a reversible automaton where the ancestors only differ at one side (technically with one of the two Welch indices equal to 1) and a full shift. We represent any reversible automaton by a de Bruijn diagram, and we characterize the way in which the diagram produces an evolution formed by undefined repetitions of two states. By means of amalgamations, we prove that there is always a way of transforming a de Bruijn diagram into the full shift. Finally, we provide an example illustrating the previous results.

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

    Science.gov (United States)

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

    2014-03-01

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

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

  13. 基于有限自动机的二值图像的开运算%Binary image open operation based on finite automata

    Institute of Scientific and Technical Information of China (English)

    刘耀军; 张姗梅

    2012-01-01

    以图像与图像平移的并集作为状态集,以探针与探针拷贝的并集作为输入字母表,用向量加减法构造状态转换映射和输出映射,给出了实现数学形态学基本运算开运算的有限自动机。与通用计算机对图像的串行处理相比,开运算自动机采取了并行结构。开运算自动机将运算的时间复杂度降低到了探针像素个数减1。%This paper designs finite automata for the basic morphological operation open. The state set of the automata is the union of the image with its translation, and the input alphabet is the union of the probe with its copy. The state transformation and output mapping are constructed by using vector addition and subtraction. Compared the serial image processing of the general- purpose computer, the open automata adopts parallel architecture. The open automata reduces the time complexity to the probe pixe] number minus 1.

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

    NARCIS (Netherlands)

    Hoef, M.A. van der; Frenkel, D.

    1990-01-01

    We report simulations of the velocity autocorrelation function (VACF) of a tagged particle in two- and three-dimensional lattice-gas cellular automata, using a new technique that is about a million times more efficient than the conventional techniques. The simulations clearly show the algebraic t-D/

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

    Science.gov (United States)

    Molina, Mario Martínez; Moreno-Armendáriz, Marco A; Carlos Seck Tuoh Mora, Juan

    2013-11-07

    A two-dimensional lattice model based on Cellular Automata theory and swarm intelligence is used to study the spatial and population dynamics of a theoretical ecosystem. It is found that the social interactions among predators provoke the formation of clusters, and that by increasing the mobility of predators the model enters into an oscillatory behavior.

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

    Science.gov (United States)

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

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

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

  18. Quantum Genetics in terms of Quantum Reversible Automata and Quantum Computation of Genetic Codes and Reverse Transcription

    CERN Document Server

    Baianu,I C

    2004-01-01

    The concepts of quantum automata and quantum computation are studied in the context of quantum genetics and genetic networks with nonlinear dynamics. In previous publications (Baianu,1971a, b) the formal concept of quantum automaton and quantum computation, respectively, were introduced and their possible implications for genetic processes and metabolic activities in living cells and organisms were considered. This was followed by a report on quantum and abstract, symbolic computation based on the theory of categories, functors and natural transformations (Baianu,1971b; 1977; 1987; 2004; Baianu et al, 2004). The notions of topological semigroup, quantum automaton, or quantum computer, were then suggested with a view to their potential applications to the analogous simulation of biological systems, and especially genetic activities and nonlinear dynamics in genetic networks. Further, detailed studies of nonlinear dynamics in genetic networks were carried out in categories of n-valued, Lukasiewicz Logic Algebra...

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

    Directory of Open Access Journals (Sweden)

    Sofiane Baghor

    2016-06-01

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

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

    Institute of Scientific and Technical Information of China (English)

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

    2013-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Seyed Mahdi Mazhari

    2012-06-01

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

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

    Science.gov (United States)

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

    2015-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Mindaugas Snipas

    2015-01-01

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

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

  5. A Note on Non-Closure Property of Sublogarithmic Space-Bounded 1-Inkdot Alternating Pushdown Automata with Only Existential (Universal) States

    Institute of Scientific and Technical Information of China (English)

    Jian-Liang Xu; Yun-Xia Liu; Tsunehiro Yoshinaga

    2006-01-01

    1-inkdot alternating pushdown automaton is a slightly modified alternating pushdown automaton with the additional power of marking at most 1 tape-cell on the input (with an inkdot) once. This paper investigates the closure property of sublogarithmic space-bounded 1-inkdot alternating pushdown automata with only existential (universal) states,and shows, for example, that for any function L(n) such that L(n) ≥ log log n and L(n) = o(log n), the class of sets accepted by weakly (strongly) L(n) space-bounded 1-inkdot two-way alternating pushdown automata with only existential (universal)states is not closed under concatenation with regular sets, length-preserving homomorphism, and Kleene closure.

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

    Directory of Open Access Journals (Sweden)

    Ignacia Arcaya

    2010-06-01

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

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

    Institute of Scientific and Technical Information of China (English)

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

    2015-01-01

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

  8. 基于ADAMS的自动步枪自动机数值仿真研究%Numerical Simulation Based on ADAMS for Automatic Rifle Automata

    Institute of Scientific and Technical Information of China (English)

    隋超杰; 姚养无

    2014-01-01

    An automatic rifle was taken as study object ,the simulation model of the automatic rifle automata was set up by UG and ADAMS ,and the virtual prototype model of the automata was realized in ADAMS/View environment .Through ADAMS simulation analysis function ,the dynamic characteristic curves of the automata were obtained .This study may provide a basis for the design and test of firearms .%以某自动步枪为研究对象,利用 UG 和 ADAMS 软件联合建立了其三维仿真模型,将其导入ADAMS/View环境中得到虚拟样机模型,通过ADAMS自身的仿真分析功能得到了自动机的动力学特性曲线。为枪械设计提供了依据,并大大降低了枪械试验的费用和时间。

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

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

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

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

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

    Institute of Scientific and Technical Information of China (English)

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

    2005-01-01

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

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

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

    Science.gov (United States)

    Weinert, Wagner Rodrigo; Lopes, Heitor Silvério

    2010-01-01

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

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

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

    Science.gov (United States)

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

    2015-02-01

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

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

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

    Directory of Open Access Journals (Sweden)

    Larissa Albantakis

    2015-07-01

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

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

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

    Directory of Open Access Journals (Sweden)

    Javad Aramideh

    2014-11-01

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

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

    Science.gov (United States)

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

    2016-10-01

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

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

    Science.gov (United States)

    Chai, C; Wong, Y D

    2014-02-01

    At intersection, vehicles coming from different directions conflict with each other. Improper geometric design and signal settings at signalized intersection will increase occurrence of conflicts between road users and results in a reduction of the safety level. This study established a cellular automata (CA) model to simulate vehicular interactions involving right-turn vehicles (as similar to left-turn vehicles in US). Through various simulation scenarios for four case cross-intersections, the relationships between conflict occurrences involving right-turn vehicles with traffic volume and right-turn movement control strategies are analyzed. Impacts of traffic volume, permissive right-turn compared to red-amber-green (RAG) arrow, shared straight-through and right-turn lane as well as signal setting are estimated from simulation results. The simulation model is found to be able to provide reasonable assessment of conflicts through comparison of existed simulation approach and observed accidents. Through the proposed approach, prediction models for occurrences and severity of vehicle conflicts can be developed for various geometric layouts and traffic control strategies.

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

    Science.gov (United States)

    Reia, Sandro M.; Kinouchi, Osame

    2014-05-01

    Conway's cellular automaton Game of Life has been conjectured to be a critical (or quasicritical) dynamical system. This criticality is generally seen as a continuous order-disorder transition in cellular automata (CA) rule space. Life's mean-field return map predicts an absorbing vacuum phase (ρ =0) and an active phase density, with ρ =0.37, which contrasts with Life's absorbing states in a square lattice, which have a stationary density of ρ2D≈0.03. Here, we study and classify mean-field maps for 6144 outer-totalistic CA and compare them with the corresponding behavior found in the square lattice. We show that the single-site mean-field approach gives qualitative (and even quantitative) predictions for most of them. The transition region in rule space seems to correspond to a nonequilibrium discontinuous absorbing phase transition instead of a continuous order-disorder one. We claim that Life is a quasicritical nucleation process where vacuum phase domains invade the alive phase. Therefore, Life is not at the "border of chaos," but thrives on the "border of extinction."

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

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

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

    Science.gov (United States)

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

    2010-01-01

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

  8. 格值模糊自动机及对应语言的分级%Hierarchy of lattice-valued fuzzy automata and their languages

    Institute of Scientific and Technical Information of China (English)

    薛倩倩; 李永明

    2014-01-01

    In order to explore the condition of equivalence of lattice valued fuzzy automata,by u-sing the method of restricting the lattice-ordered monoid,automata could be divided into determi-nate,sequential,unambiguous,finitely ambiguous and infinitely ambiguous automata.In which the lattice-ordered monoid is commutative,then it is obviously that L-DFAL-SeqL-NAmbL-FAmbL-Reg.If the lattice-ordered monoid is not local finiteness,the relationship among the languages is L-DFAL-SeqL-NAmbL-FAmbL-Reg.And if it is local finiteness,the rela-tionship could be L-DFA=L-Seq=L-NAmb=L-FAmb=L-Reg.%为了探讨格值模糊自动机等价的条件,采用对偏序格半群加以限制的方法,将格值模糊有限自动机划分为确定的、序列型的、无歧义的、有限歧义以及无限歧义自动机这几种不同的类型,得到这几类自动机接受语言之间的关系为L-DFAL-SeqL-NAmbL-FAmbL-Reg;当偏序格半群非局部有限时,关系为L-DFAL-SeqL-NAmbL-FAmbL-Reg;当偏序格半群局部有限时,关系为L-DFA=L-Seq=L-NAmb=L-FAmb=L-Reg.

  9. 处理图像语言的格点自动机与格点文法%Grid Automata and Grid Grammars for Picture Languages

    Institute of Scientific and Technical Information of China (English)

    沈恩绍

    2000-01-01

    A two-dimensional grid grammar was designed to fill up the missing ring in the Equivalence Theorem for recognizable picture languages (REC), summarized in a survey paper by Giammarresi and Restivo. Instead of 2-dimensional on-line tessellation automata, grid automata were introduced, which were closer to the traditional binary tree automata, to bridge the grid grammar and other approaches of describing the class of REC. Meanwhile the standard (existential) monadic second order logic was substituted by a weaker logic framework: positive monadic partition logic. A new and complete version of Equivalence Theorem for REC is presented.%Giammarresi与Restivo在一篇综述中总结出一个关于可识别的图像语言(即2维矩形语言)REC的等价性定理.对比1维字语言的相应结果,其中还缺少关于生成文法的相应一环.提出了一种(矩形的)格点文法,正好弥补了这一缺环.而取代2维on-line tesselation自动机,引入了格点自动机的概念.一方面,它与经典的2元树型自动机更相似,另一方面,它也是格点文法与等价性定理中关于REC的其他描述方式之间的一座桥梁.同时,标准的existential monadic二阶逻辑也被一种更弱的规范框架--positive monadic分划逻辑所取代.由此导出一个新的更完整的关于REC的等价性定理.

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

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

    Science.gov (United States)

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

    2008-09-01

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

  12. 基于粘贴系统的Watson-Crick正则文法及自动机%Watson-Crick Regular Grammars and Automata Based on Sticker System

    Institute of Scientific and Technical Information of China (English)

    赵洋; 汤建钢

    2012-01-01

    This paper introduces the DNA calculation of the relevant knowledge, the use of DNA language and sticker mode and sticker system structure Watson-Crick regular grammar, briefly introduced the Watson- Crick automata. DNA sticker mode is one of the main models in the DNA calculation.%通过介绍DNA计算中的相关知识,利用DNA语言和粘贴模型及粘贴系统构造watson-crick正则文法,简单介绍TWatson-Crick自动机.

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

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

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

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

    Science.gov (United States)

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

    2016-11-01

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

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

    Directory of Open Access Journals (Sweden)

    Liu Tao

    2013-09-01

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

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

    Institute of Scientific and Technical Information of China (English)

    秦大康; 谢惠民

    2005-01-01

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

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

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

    Institute of Scientific and Technical Information of China (English)

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

    2012-01-01

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

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

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

  4. Application of finite automata in vehicle management system development%有穷自动机在车辆管理系统开发中的应用

    Institute of Scientific and Technical Information of China (English)

    王伟; 黄俊恒; 徐永东

    2012-01-01

    利用有穷自动机理论对“企业车辆管理”的生命周期状态转化进行了形式化描述.通过分析车辆管理的流程,得到了车辆管理所涉及的各项业务流程,并对各项业务进行了说明,使得车辆管理的业务流程更加清晰.%In this paper, the state transformations of the life cycle of the corporate vehicle management were described by finite automata. By analyzing the process of vehicle management , various business processes could be got and be described, which were more clearly to business processes of the vehicle management.

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

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

  7. Implicit Real Vector Automata

    Directory of Open Access Journals (Sweden)

    Jean-François Degbomont

    2010-10-01

    Full Text Available This paper addresses the symbolic representation of non-convex real polyhedra, i.e., sets of real vectors satisfying arbitrary Boolean combinations of linear constraints. We develop an original data structure for representing such sets, based on an implicit and concise encoding of a known structure, the Real Vector Automaton. The resulting formalism provides a canonical representation of polyhedra, is closed under Boolean operators, and admits an efficient decision procedure for testing the membership of a vector.

  8. Automata, Languages and Programming

    DEFF Research Database (Denmark)

    Aceto, Luca; Goldberg, Leslie Ann; Halldórsson, Magnús M.

    2008-01-01

    functions), induce a space overhead of Θ(n) bits over the optimum, regardless of the evaluation time. We show that for any k, query time O(k) can be achieved using space that is within a factor 1 + e − k of optimal, asymptotically for large n. The time to construct the data structure is O(n), expected....... If we allow logarithmic evaluation time, the additive overhead can be reduced to O(loglogn) bits whp. A general reduction transfers the results on retrieval into analogous results on approximate membership, a problem traditionally addressed using Bloom filters. Thus we obtain space bounds arbitrarily...... close to the lower bound for this problem as well. The evaluation procedures of our data structures are extremely simple. For the results stated above we assume free access to fully random hash functions. This assumption can be justified using space o(n) to simulate full randomness on a RAM....

  9. Baire and automata

    Directory of Open Access Journals (Sweden)

    Benoit Cagnard

    2007-05-01

    Full Text Available In his thesis Baire defined functions of Baire class 1. A function f is of Baire class 1 if it is the pointwise limit of a sequence of continuous functions. Baire proves the following theorem. A function f is not of class 1 if and only if there exists a closed nonempty set F such that the restriction of f to F has no point of continuity. We prove the automaton version of this theorem. An ω-rational function is not of class 1 if and only if there exists a closed nonempty set F recognized by a Büchi automaton such that the restriction of f to F has no point of continuity. This gives us the opportunity for a discussion on Hausdorff's analysis of Δ° 2, ordinals, transfinite induction and some applications of computer science.

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

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

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

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

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

    Directory of Open Access Journals (Sweden)

    Yongqiang Liu

    2012-07-01

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

  15. Modelling spread of foot-and-mouth disease in wild white-tailed deer and feral pig populations using a geographic-automata model and animal distributions.

    Science.gov (United States)

    Ward, Michael P; Laffan, Shawn W; Highfield, Linda D

    2009-09-01

    We investigated how the size and distribution of wild deer and feral pigs - species that might act as potential foot-and-mouth disease (FMD) virus maintenance hosts - might affect the persistence and spread of FMD. We used a susceptible-latent-infected-recovered geographic-automata model and spatially referenced data from southern Texas, USA. Within this study area, 100 locations were randomly selected and FMD virus spread was simulated (50 simulations each) at each location. As expected, the predicted sizes (km(2)) of the wild deer outbreaks were highly correlated (r(SP)>0.95) with the number of deer at incursion locations, the total number of deer within 2 km of incursion locations, and the minimum and maximum deer herd size within 2 km of incursion locations. However, the predicted sizes of the feral pig outbreaks were only moderately correlated (r(SP) 0.63-0.67) with the total, maximum and variance of the number of feral pigs within 2 km of incursion locations. Lack of continuity within the feral pig herd distribution across the landscape makes predicting disease spread more difficult than for deer, a more homogenously distributed species. When assessing the potential of wild and feral animal species at a locality to act as maintenance hosts of FMD virus, estimates of the population size and distribution might serve as a useful indicator of potential outbreaks in some circumstances.

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

    Science.gov (United States)

    Qiu, Menglong; Wang, Qi; Li, Fangbai; Chen, Junjian; Yang, Guoyi; Liu, Liming

    2016-01-01

    A customized logistic-based cellular automata (CA) model was developed to simulate changes in heavy metal contamination (HMC) in farmland soils of Dongguan, a manufacturing center in Southern China, and to discover the relationship between HMC and related explanatory variables (continuous and categorical). The model was calibrated through the simulation and validation of HMC in 2012. Thereafter, the model was implemented for the scenario simulation of development alternatives for HMC in 2022. The HMC in 2002 and 2012 was determined through soil tests and cokriging. Continuous variables were divided into two groups by odds ratios. Positive variables (odds ratios >1) included the Nemerow synthetic pollution index in 2002, linear drainage density, distance from the city center, distance from the railway, slope, and secondary industrial output per unit of land. Negative variables (odds ratios soil pH, and distance from bodies of water. Categorical variables, including soil type, parent material type, organic content grade, and land use type, also significantly influenced HMC according to Wald statistics. The relative operating characteristic and kappa coefficients were 0.91 and 0.64, respectively, which proved the validity and accuracy of the model. The scenario simulation shows that the government should not only implement stricter environmental regulation but also strengthen the remediation of the current polluted area to effectively mitigate HMC.

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

    Science.gov (United States)

    Gangadari, Bhoopal Rao; Rafi Ahamed, Shaik

    2016-09-01

    In biomedical, data security is the most expensive resource for wireless body area network applications. Cryptographic algorithms are used in order to protect the information against unauthorised access. Advanced encryption standard (AES) cryptographic algorithm plays a vital role in telemedicine applications. The authors propose a novel approach for design of substitution bytes (S-Box) using second-order reversible one-dimensional cellular automata (RCA(2)) as a replacement to the classical look-up-table (LUT) based S-Box used in AES algorithm. The performance of proposed RCA(2) based S-Box and conventional LUT based S-Box is evaluated in terms of security using the cryptographic properties such as the nonlinearity, correlation immunity bias, strict avalanche criteria and entropy. Moreover, it is also shown that RCA(2) based S-Boxes are dynamic in nature, invertible and provide high level of security. Further, it is also found that the RCA(2) based S-Box have comparatively better performance than that of conventional LUT based S-Box.

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

  19. A Lattice Gas Automata Model for the Coupled Heat Transfer and Chemical Reaction of Gas Flow Around and Through a Porous Circular Cylinder

    Directory of Open Access Journals (Sweden)

    Hongsheng Chen

    2015-12-01

    Full Text Available Coupled heat transfer and chemical reaction of fluid flow in complex boundaries are explored by introducing two additional properties, i.e. particle type and energy state into the Lattice gas automata (LGA Frisch–Hasslacher–Pomeau (FHP-II model. A mix-redistribute of energy and type of particles is also applied on top of collision rules to ensure randomness while maintaining the conservation of mass, momentum and energy. Simulations of heat transfer and heterogeneous reaction of gas flow passing a circular porous cylinder in a channel are presented. The effects of porosity of cylinder, gas inlet velocity, and reaction probability on the reaction process are further analyzed with respect to the characteristics of solid morphology, product concentration, and temperature profile. Numerical results indicate that the reaction rate increases with increasing reaction probability as well as gas inlet velocity. Cylinders with a higher value of porosity and more homogeneous structure also react with gas particles faster. These results agree well with the basic theories of gas–solid reactions, indicating the present model provides a method for describing gas–solid reactions in complex boundaries at mesoscopic level.

  20. 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网最短路径与关键路径求解的统一.

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

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

    Institute of Scientific and Technical Information of China (English)

    陈芳跃; 金伟锋

    2015-01-01

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

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

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

    Science.gov (United States)

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

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

  5. Algebraic and Logical Characterizations of Quantum Büchi Automata%量子Büchi自动机的代数及逻辑刻画

    Institute of Scientific and Technical Information of China (English)

    韩召伟

    2013-01-01

    The notion of quantum Büchi automaton (LVBA for short )is introduced ,by means of quantum state construction , the equivalence of an LVBA and an LVSBA with crisp transition function is proved ,based on this ,the algebraic and level character-izations and also the Büchi characterization of quantum infinite regular languages are investigated ,and also the closed properties of those quantum infinite regular languages under some regular operations are dealt with .By providing the concept of monadic second-order quantum logic (LVMSO in short ) ,the monadic second-order logic characterizations of infinite regular languages recognized by quantum Büchi automata are presented ,which deepen and generalize the fundamental Büchi theorem to quantum setting .%提出量子Büchi自动机(简记为LVBA )的概念,利用量子状态构造方法证明了一般LVBA与状态转移为经典函数的LVSBA间的相互等价性,籍此研究了量子无穷正则语言的代数刻画、层次刻画和Büchi刻画以及对于正则运算的封闭性;通过引入单体二阶量子逻辑(简记为LVMSO )的概念,给出量子Büchi自动机所识别无穷语言的单体二阶逻辑描述,深化和推广了量子逻辑意义下的Büchi基本定理。

  6. 基于时间自动机的CBI道岔转换时间建模与验证%Modeling and veriifcation of CBI switch transaction time based on timed automata

    Institute of Scientific and Technical Information of China (English)

    石佳

    2016-01-01

    Focusing on the problem that the safety of CBTC computer based interlocking is critical, this article introduced the theory of timed automata, analyzed the architecture and differences between CBTC computer based interlocking system and traditional interlocking system, took an example of switch transaction, switch transaction model was established by using UPPAAL. The security requirements of the model were also analyzed, which showed the feasibility and effectiveness of the modeling and veriifcation methods based on timed automata, during the process of developing computer based interlocking system.%针对CBTC计算机联锁安全性十分重要的问题,介绍时间自动机理论,分析CBTC计算机联锁系统的结构和与传统联锁系统的区别,以CBTC联锁系统的道岔转换功能为例,采用UPPAAL建立了道岔转换模型,分析模型的安全需求。表明了在联锁系统开发过程中采用基于时间自动机建模与验证的方法的可行性和有效性。

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

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

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

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

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

    Science.gov (United States)

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

    On 15-16 December 1999, heavy rainfall severely stroke Campania region (southern Italy), triggering numerous debris flows on the slopes of the San Martino Valle Caudina-Cervinara area. Soil slips originated within the weathered volcaniclastic mantle of soil cover overlying the carbonate skeleton of the massif. Debris slides turned into fast flowing mixtures of matrix and large blocks, downslope eroding the soil cover and increasing their original volume. At the base of the slopes, debris flows impacted on the urban areas, causing victims and severe destruction (Vittori et al., 2000). Starting from a recent study on landslide risk conditions in Campania, carried out by the Regional Authority (PAI -Hydrogeological setting plan, in press), an evaluation of the debris-flow susceptibility has been performed for selected areas of the above mentioned villages. According to that study, such zones would be in fact characterised by the highest risk levels within the administrative boundaries of the same villages ("HR-zones"). Our susceptibility analysis has been performed by applying SCIDDICA S3-hex - a hexagonal Cellular Automata model (von Neumann, 1966), specifically developed for simulating the spatial evolution of debris flows (Iovine et al., 2002). In order to apply the model to a given study area, detailed topographic data and a map of the erodable soil cover overlying the bedrock of the massif must be provided (as input matrices); moreover, extent and location of landslide source must also be given. Real landslides, selected among those triggered on winter 1999, have first been utilised for calibrating SCIDDICA S3-hex and for defining "optimal" values for parameters. Calibration has been carried out with a GIS tool, by quantitatively comparing simulations with actual cases: optimal values correspond to best simulations. Through geological evaluations, source locations of new phenomena have then been hypothesised within the HR-zones. Initial volume for these new cases

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

    Science.gov (United States)

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

    2016-08-09

    In this article, we focus on the electron-vibrational problem of the tetrameric mixed-valence (MV) complexes proposed for implementation as four-dot molecular quantum cellular automata (mQCA).1 Although the adiabatic approximation explored in ref 2 is an appropriate tool for the qualitative analysis of the basic characteristics of mQCA, like vibronic trapping of the electrons encoding binary information and cell-cell response, it loses its accuracy providing moderate vibronic coupling and fails in the description of the discrete pattern of the vibronic levels. Therefore, a precise solution of the quantum-mechanical vibronic problem is of primary importance for the evaluation of the shapes of the electron transfer optical absorption bands and quantitative analysis of the main parameters of tetrameric quantum cells. Here, we go beyond the Born-Oppenheimer paradigm and present a solution of the quantum-mechanical pseudo Jahn-Teller (JT) vibronic problem in bielectronic MV species (exemplified by the tetra-ruthenium complexes) based on the recently developed symmetry-assisted approach.3,4 The mathematical approach to the vibronic eigenproblem takes into consideration the point symmetry basis, and therefore, the total matrix of the JT Hamiltonian is blocked to the maximum extent. The submatrices correspond to the irreducible representations (irreps) of the point group. With this tool, we also extend the theory of the mQCA cell beyond the limit of prevailing Coulomb repulsion in the electronic pair (adopted in ref 2), and therefore, the general pseudo-JT problems for spin-singlet ((1)B1g, 2(1)A1g, (1)B2g, (1)Eu) ⊗ (b1g + eu) and spin-triplet states ((3)A2g, (3)B1g, 2(3)Eu) ⊗ (b1g + eu) in a square-planar bielectronic system are solved. The obtained symmetry-adapted electron-vibrational functions are employed for the calculation of the profiles (shape functions) of the charge transfer absorption bands in the tetrameric MV complexes and for the discussion of the

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

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

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

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

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

    Science.gov (United States)

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

    2016-12-01

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

  18. Modeling and Verifying Services of Internet of Things Based on Timed Automata%基于时间自动机的物联网服务建模和验证

    Institute of Scientific and Technical Information of China (English)

    李力行; 金芝; 李戈

    2011-01-01

    The modeling and verifying of Internet of Things (IOT) services is now an important aspect of IOT software design. First, we introduce the concept of environment entities that are used to describe both the attributes and behaviors of things in the physical world. Then the behaviors of an IOT service are specified by its interaction with the corresponding environment entities, these interactions lead to the expected changes on the entities, and show the effectiveness of the IOT services. Based on timed automata, an IOT services modeling approach is proposed, in which different kinds of environment entities and IOT services are all modeled as individual timed automata. All these timed automata come into a network that represents the communication and concurrency of the whole IOT system, in which, the running of the IOT services will be represented as some computation path in the network. Based on the proposed approach, we present the properties with which the IOT services should be satisfied. By using the model-checking tool UPPAAL and the environment entities, we also present a verification approach for the correctness of IOT services models.%物联网服务的建模和验证是当前物联网服务提供中的一个重要问题.文中将物联网服务的行为建模为其与相关环境实体的交互,并引入环境实体以刻画物理世界各种物体的属性和行为,从而将物联网服务能力建模为它能够导致的环境实体发生的期望变化.文中以时间自动机为建模工具,分别为将要监测和要控制的物理环境实体以及不同种类的物联网服务独立建模,以表现它们的独立性和自主性.这些时间自动机形成一个网络,刻画完整的物联网服务的通信并发过程,物联网服务的实施过程表现为时间自动机网络上的状态变迁通路.最后,文中提出一组物联网服务要满足的性质,并利用模型检测工具UPPAAL验证物联网服务的正确性.

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

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

    Directory of Open Access Journals (Sweden)

    Takashi Hira

    2015-01-01

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