Mitochondrial fusion through membrane automata.

PubMed

Giannakis, Konstantinos; Andronikos, Theodore

2015-01-01

Studies have shown that malfunctions in mitochondrial processes can be blamed for diseases. However, the mechanism behind these operations is yet not sufficiently clear. In this work we present a novel approach to describe a biomolecular model for mitochondrial fusion using notions from the membrane computing. We use a case study defined in BioAmbient calculus and we show how to translate it in terms of a P automata variant. We combine brane calculi with (mem)brane automata to produce a new scheme capable of describing simple, realistic models. We propose the further use of similar methods and the test of other biomolecular models with the same behaviour.

Modeling cell adhesion and proliferation: a cellular-automata based approach.

PubMed

Vivas, J; Garzón-Alvarado, D; Cerrolaza, M

Cell adhesion is a process that involves the interaction between the cell membrane and another surface, either a cell or a substrate. Unlike experimental tests, computer models can simulate processes and study the result of experiments in a shorter time and lower costs. One of the tools used to simulate biological processes is the cellular automata, which is a dynamic system that is discrete both in space and time. This work describes a computer model based on cellular automata for the adhesion process and cell proliferation to predict the behavior of a cell population in suspension and adhered to a substrate. The values of the simulated system were obtained through experimental tests on fibroblast monolayer cultures. The results allow us to estimate the cells settling time in culture as well as the adhesion and proliferation time. The change in the cells morphology as the adhesion over the contact surface progress was also observed. The formation of the initial link between cell and the substrate of the adhesion was observed after 100 min where the cell on the substrate retains its spherical morphology during the simulation. The cellular automata model developed is, however, a simplified representation of the steps in the adhesion process and the subsequent proliferation. A combined framework of experimental and computational simulation based on cellular automata was proposed to represent the fibroblast adhesion on substrates and changes in a macro-scale observed in the cell during the adhesion process. The approach showed to be simple and efficient.

A Rewriting-Based Approach to Trace Analysis

NASA Technical Reports Server (NTRS)

Havelund, Klaus; Rosu, Grigore; Clancy, Daniel (Technical Monitor)

2002-01-01

We present a rewriting-based algorithm for efficiently evaluating future time Linear Temporal Logic (LTL) formulae on finite execution traces online. While the standard models of LTL are infinite traces, finite traces appear naturally when testing and/or monitoring red applications that only run for limited time periods. The presented algorithm is implemented in the Maude executable specification language and essentially consists of a set of equations establishing an executable semantics of LTL using a simple formula transforming approach. The algorithm is further improved to build automata on-the-fly from formulae, using memoization. The result is a very efficient and small Maude program that can be used to monitor program executions. We furthermore present an alternative algorithm for synthesizing probably minimal observer finite state machines (or automata) from LTL formulae, which can be used to analyze execution traces without the need for a rewriting system, and can hence be used by observers written in conventional programming languages. The presented work is part of an ambitious runtime verification and monitoring project at NASA Ames, called PATHEXPLORER, and demonstrates that rewriting can be a tractable and attractive means for experimenting and implementing program monitoring logics.

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

NASA Astrophysics Data System (ADS)

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

Efficient Algorithms for Handling Nondeterministic Automata

NASA Astrophysics Data System (ADS)

Vojnar, Tomáš

Finite (word, tree, or omega) automata play an important role in different areas of computer science, including, for instance, formal verification. Often, deterministic automata are used for which traditional algorithms for important operations such as minimisation and inclusion checking are available. However, the use of deterministic automata implies a need to determinise nondeterministic automata that often arise during various computations even when the computations start with deterministic automata. Unfortunately, determinisation is a very expensive step since deterministic automata may be exponentially bigger than the original nondeterministic automata. That is why, it appears advantageous to avoid determinisation and work directly with nondeterministic automata. This, however, brings a need to be able to implement operations traditionally done on deterministic automata on nondeterministic automata instead. In particular, this is the case of inclusion checking and minimisation (or rather reduction of the size of automata). In the talk, we review several recently proposed techniques for inclusion checking on nondeterministic finite word and tree automata as well as Büchi automata. These techniques are based on using the so called antichains, possibly combined with a use of suitable simulation relations (and, in the case of Büchi automata, the so called Ramsey-based or rank-based approaches). Further, we discuss techniques for reducing the size of nondeterministic word and tree automata using quotienting based on the recently proposed notion of mediated equivalences. The talk is based on several common works with Parosh Aziz Abdulla, Ahmed Bouajjani, Yu-Fang Chen, Peter Habermehl, Lisa Kaati, Richard Mayr, Tayssir Touili, Lorenzo Clemente, Lukáš Holík, and Chih-Duo Hong.

A 2D flood inundation model based on cellular automata approach

NASA Astrophysics Data System (ADS)

Dottori, Francesco; Todini, Ezio

2010-05-01

In the past years, the cellular automata approach has been successfully applied in two-dimensional modelling of flood events. When used in experimental applications, models based on such approach have provided good results, comparable to those obtained with more complex 2D models; moreover, CA models have proven significantly faster and easier to apply than most of existing models, and these features make them a valuable tool for flood analysis especially when dealing with large areas. However, to date the real degree of accuracy of such models has not been demonstrated, since they have been mainly used in experimental applications, while very few comparisons with theoretical solutions have been made. Also, the use of an explicit scheme of solution, which is inherent in cellular automata models, forces them to work only with small time steps, thus reducing model computation speed. The present work describes a cellular automata model based on the continuity and diffusive wave equations. Several model versions based on different solution schemes have been realized and tested in a number of numerical cases, both 1D and 2D, comparing the results with theoretical and numerical solutions. In all cases, the model performed well compared to the reference solutions, and proved to be both stable and accurate. Finally, the version providing the best results in terms of stability was tested in a real flood event and compared with different hydraulic models. Again, the cellular automata model provided very good results, both in term of computational speed and reproduction of the simulated event.

A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata

NASA Astrophysics Data System (ADS)

Gómez, Rodolfo

Timed Automata with Deadlines (TAD) are a form of timed automata that admit a more natural representation of urgent actions, with the additional advantage of avoiding the most common form of timelocks. We offer a compositional translation of a practically useful subset of TAD to timed safety automata (the well-known variant of timed automata where time progress conditions are expressed by invariants). More precisely, we translate networks of TAD to the modeling language of Uppaal, a state-of-the-art verification tool for timed automata. We also describe an implementation of this translation, which allows Uppaal to aid the design and analysis of TAD models.

Identifying Flow Networks in a Karstified Aquifer by Application of the Cellular Automata-Based Deterministic Inversion Method (Lez Aquifer, France)

NASA Astrophysics Data System (ADS)

Fischer, P.; Jardani, A.; Wang, X.; Jourde, H.; Lecoq, N.

2017-12-01

The distributed modeling of flow paths within karstic and fractured fields remains a complex task because of the high dependence of the hydraulic responses to the relative locations between observational boreholes and interconnected fractures and karstic conduits that control the main flow of the hydrosystem. The inverse problem in a distributed model is one alternative approach to interpret the hydraulic test data by mapping the karstic networks and fractured areas. In this work, we developed a Bayesian inversion approach, the Cellular Automata-based Deterministic Inversion (CADI) algorithm to infer the spatial distribution of hydraulic properties in a structurally constrained model. This method distributes hydraulic properties along linear structures (i.e., flow conduits) and iteratively modifies the structural geometry of this conduit network to progressively match the observed hydraulic data to the modeled ones. As a result, this method produces a conductivity model that is composed of a discrete conduit network embedded in the background matrix, capable of producing the same flow behavior as the investigated hydrologic system. The method is applied to invert a set of multiborehole hydraulic tests collected from a hydraulic tomography experiment conducted at the Terrieu field site in the Lez aquifer, Southern France. The emergent model shows a high consistency to field observation of hydraulic connections between boreholes. Furthermore, it provides a geologically realistic pattern of flow conduits. This method is therefore of considerable value toward an enhanced distributed modeling of the fractured and karstified aquifers.

QM Automata: A New Class of Restricted Quantum Membrane Automata.

PubMed

Giannakis, Konstantinos; Singh, Alexandros; Kastampolidou, Kalliopi; Papalitsas, Christos; Andronikos, Theodore

2017-01-01

The term "Unconventional Computing" describes the use of non-standard methods and models in computing. It is a recently established field, with many interesting and promising results. In this work we combine notions from quantum computing with aspects of membrane computing to define what we call QM automata. Specifically, we introduce a variant of quantum membrane automata that operate in accordance with the principles of quantum computing. We explore the functionality and capabilities of the QM automata through indicative examples. Finally we suggest future directions for research on QM automata.

Automated Support for Rapid Coordination of Joint UUV Operation

DTIC Science & Technology

2015-03-01

automata , dead-reckoning, static plan, nmtime plan, rapid deployment, GPS 17. SECURITY CLASSIFICATION OF REPORT Unclassified 18. SECURITY...STATE MACHINES, MOORE AUTOMATA ..........................................9 A. MOORE AUTOMATA ...9 B. UUV PLANS AS MOORE AUTOMATA ...................................................11 C. SAMPLING RATE

Inferring the Limit Behavior of Some Elementary Cellular Automata

NASA Astrophysics Data System (ADS)

Ruivo, Eurico L. P.; de Oliveira, Pedro P. B.

Cellular automata locally define dynamical systems, discrete in space, time and in the state variables, capable of displaying arbitrarily complex global emergent behavior. One core question in the study of cellular automata refers to their limit behavior, that is, to the global dynamical features in an infinite time evolution. Previous works have shown that for finite time evolutions, the dynamics of one-dimensional cellular automata can be described by regular languages and, therefore, by finite automata. Such studies have shown the existence of growth patterns in the evolution of such finite automata for some elementary cellular automata rules and also inferred the limit behavior of such rules based upon the growth patterns; however, the results on the limit behavior were obtained manually, by direct inspection of the structures that arise during the time evolution. Here we present the formalization of an automatic method to compute such structures. Based on this, the rules of the elementary cellular automata space were classified according to the existence of a growth pattern in their finite automata. Also, we present a method to infer the limit graph of some elementary cellular automata rules, derived from the analysis of the regular expressions that describe their behavior in finite time. Finally, we analyze some attractors of two rules for which we could not compute the whole limit set.

Real-Time Extended Interface Automata for Software Testing Cases Generation

PubMed Central

Yang, Shunkun; Xu, Jiaqi; Man, Tianlong; Liu, Bin

2014-01-01

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

A Multi-Encoding Approach for LTL Symbolic Satisfiability Checking

NASA Technical Reports Server (NTRS)

Rozier, Kristin Y.; Vardi, Moshe Y.

2011-01-01

Formal behavioral specifications written early in the system-design process and communicated across all design phases have been shown to increase the efficiency, consistency, and quality of the system under development. To prevent introducing design or verification errors, it is crucial to test specifications for satisfiability. Our focus here is on specifications expressed in linear temporal logic (LTL). We introduce a novel encoding of symbolic transition-based Buchi automata and a novel, "sloppy," transition encoding, both of which result in improved scalability. We also define novel BDD variable orders based on tree decomposition of formula parse trees. We describe and extensively test a new multi-encoding approach utilizing these novel encoding techniques to create 30 encoding variations. We show that our novel encodings translate to significant, sometimes exponential, improvement over the current standard encoding for symbolic LTL satisfiability checking.

Simulation of the 1992 Tessina landslide by a cellular automata model and future hazard scenarios

NASA Astrophysics Data System (ADS)

Avolio, MV; Di Gregorio, Salvatore; Mantovani, Franco; Pasuto, Alessandro; Rongo, Rocco; Silvano, Sandro; Spataro, William

Cellular Automata are a powerful tool for modelling natural and artificial systems, which can be described in terms of local interactions of their constituent parts. Some types of landslides, such as debris/mud flows, match these requirements. The 1992 Tessina landslide has characteristics (slow mud flows) which make it appropriate for modelling by means of Cellular Automata, except for the initial phase of detachment, which is caused by a rotational movement that has no effect on the mud flow path. This paper presents the Cellular Automata approach for modelling slow mud/debris flows, the results of simulation of the 1992 Tessina landslide and future hazard scenarios based on the volumes of masses that could be mobilised in the future. They were obtained by adapting the Cellular Automata Model called SCIDDICA, which has been validated for very fast landslides. SCIDDICA was applied by modifying the general model to the peculiarities of the Tessina landslide. The simulations obtained by this initial model were satisfactory for forecasting the surface covered by mud. Calibration of the model, which was obtained from simulation of the 1992 event, was used for forecasting flow expansion during possible future reactivation. For this purpose two simulations concerning the collapse of about 1 million m 3 of material were tested. In one of these, the presence of a containment wall built in 1992 for the protection of the Tarcogna hamlet was inserted. The results obtained identified the conditions of high risk affecting the villages of Funes and Lamosano and show that this Cellular Automata approach can have a wide range of applications for different types of mud/debris flows.

Cellular Automata

NASA Astrophysics Data System (ADS)

Gutowitz, Howard

1991-08-01

Cellular automata, dynamic systems in which space and time are discrete, are yielding interesting applications in both the physical and natural sciences. The thirty four contributions in this book cover many aspects of contemporary studies on cellular automata and include reviews, research reports, and guides to recent literature and available software. Chapters cover mathematical analysis, the structure of the space of cellular automata, learning rules with specified properties: cellular automata in biology, physics, chemistry, and computation theory; and generalizations of cellular automata in neural nets, Boolean nets, and coupled map lattices. Current work on cellular automata may be viewed as revolving around two central and closely related problems: the forward problem and the inverse problem. The forward problem concerns the description of properties of given cellular automata. Properties considered include reversibility, invariants, criticality, fractal dimension, and computational power. The role of cellular automata in computation theory is seen as a particularly exciting venue for exploring parallel computers as theoretical and practical tools in mathematical physics. The inverse problem, an area of study gaining prominence particularly in the natural sciences, involves designing rules that possess specified properties or perform specified task. A long-term goal is to develop a set of techniques that can find a rule or set of rules that can reproduce quantitative observations of a physical system. Studies of the inverse problem take up the organization and structure of the set of automata, in particular the parameterization of the space of cellular automata. Optimization and learning techniques, like the genetic algorithm and adaptive stochastic cellular automata are applied to find cellular automaton rules that model such physical phenomena as crystal growth or perform such adaptive-learning tasks as balancing an inverted pole. Howard Gutowitz is Collaborateur in the Service de Physique du Solide et Résonance Magnetique, Commissariat a I'Energie Atomique, Saclay, France.

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

NASA Astrophysics Data System (ADS)

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.

Usage Automata

NASA Astrophysics Data System (ADS)

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.

Weighted Watson-Crick automata

NASA Astrophysics Data System (ADS)

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.

Simulation of miniature endplate potentials in neuromuscular junctions by using a cellular automaton

NASA Astrophysics Data System (ADS)

Avella, Oscar Javier; Muñoz, José Daniel; Fayad, Ramón

2008-01-01

Miniature endplate potentials are recorded in the neuromuscular junction when the acetylcholine contents of one or a few synaptic vesicles are spontaneously released into the synaptic cleft. Since their discovery by Fatt and Katz in 1952, they have been among the paradigms in neuroscience. Those potentials are usually simulated by means of numerical approaches, such as Brownian dynamics, finite differences and finite element methods. Hereby we propose that diffusion cellular automata can be a useful alternative for investigating them. To illustrate this point, we simulate a miniature endplate potential by using experimental parameters. Our model reproduces the potential shape, amplitude and time course. Since our automaton is able to track the history and interactions of each single particle, it is very easy to introduce non-linear effects with little computational effort. This makes cellular automata excellent candidates for simulating biological reaction-diffusion processes, where no other external forces are involved.

Spectral properties of finite two dimensional quantum dot arrays.

NASA Astrophysics Data System (ADS)

Cota, Ernesto; Ramírez, Felipe; Ulloa, Sergio E.

1997-08-01

Motivated by recent proposed geometries in cellular automata, we study arrays of four or five coupled quantum dots located at the corners and at the center of a square. We calculate the addition spectrum for dots with equal or different sizes at each site and compare with the case of linear arrays. We obtain the numerically exact solution for arrays with two electrons and study the properties of this system as a cell or building block of quantum dot cellular automata. We obtain the ``polarization" for each state and discuss its possible use as a two-state system or ``qubit," as proposed recently(C. S. Lent, P. D. Tougaw, and W. Porod, Appl. Phys. Lett. 62) 714, (1993). An extended Hubbard Hamiltonian is used which takes into account quantum confinement, intra- an inter-dot Coulomb interaction as well as tunneling between neighboring dots.

Spectral properties of finite two dimensional quantum dot arrays.

NASA Astrophysics Data System (ADS)

Ramirez, Felipe; Cota, Ernesto; Ulloa, Sergio E.

1997-03-01

Motivated by recent proposed geometries in cellular automata, we study arrays of four or five coupled quantum dots located at the corners and at the center of a square. We calculate the addition spectrum for dots with equal or different sizes at each site and compare with the case of linear arrays. We obtain the numerically exact solution for arrays with two electrons and study the properties of this system as a cell or building block of quantum dot cellular automata. We obtain the ``polarization" for each state and discuss its possible use as a two-state system or ``qubit," as proposed recently(C. S. Lent, P. D. Tougaw, and W. Porod, Appl. Phys. Lett. 62) 714, (1993). An extended Hubbard Hamiltonian is used which takes into account quantum confinement, intra- an inter-dot Coulomb interaction as well as tunneling between neighboring dots.

Symbolic LTL Compilation for Model Checking: Extended Abstract

NASA Technical Reports Server (NTRS)

Rozier, Kristin Y.; Vardi, Moshe Y.

2007-01-01

In Linear Temporal Logic (LTL) model checking, we check LTL formulas representing desired behaviors against a formal model of the system designed to exhibit these behaviors. To accomplish this task, the LTL formulas must be translated into automata [21]. We focus on LTL compilation by investigating LTL satisfiability checking via a reduction to model checking. Having shown that symbolic LTL compilation algorithms are superior to explicit automata construction algorithms for this task [16], we concentrate here on seeking a better symbolic algorithm.We present experimental data comparing algorithmic variations such as normal forms, encoding methods, and variable ordering and examine their effects on performance metrics including processing time and scalability. Safety critical systems, such as air traffic control, life support systems, hazardous environment controls, and automotive control systems, pervade our daily lives, yet testing and simulation alone cannot adequately verify their reliability [3]. Model checking is a promising approach to formal verification for safety critical systems which involves creating a formal mathematical model of the system and translating desired safety properties into a formal specification for this model. The complement of the specification is then checked against the system model. When the model does not satisfy the specification, model-checking tools accompany this negative answer with a counterexample, which points to an inconsistency between the system and the desired behaviors and aids debugging efforts.

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

DOE PAGES

Michael H. L. S. Wang; Cancelo, Gustavo; Green, Christopher; ...

2016-06-25

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

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Michael H. L. S. Wang; Cancelo, Gustavo; Green, Christopher

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

The Distributed Air Wing

DTIC Science & Technology

2014-06-01

Cruise Missile LCS Littoral Combat Ship LEO Low Earth Orbit LER Loss-Exchange-Ration LHA Landing Helicopter Assault LIDAR Laser Imaging Detection and...Ranging LOC Lines of Communication LP Linear Programming LRASM Long Range Anti-Ship Missile LT Long Ton MANA Map-Aware Non-uniform Automata ME...enemy’s spy satellites. Based on open source information, China currently has 25 satellites operating in Low Earth Orbit ( LEO ), each operates at an

Towards a Quantum Game of Life

NASA Astrophysics Data System (ADS)

Flitney, Adrian P.; Abbott, Derek

Cellular automata provide a means of obtaining complex behaviour from a simple array of cells and a deterministic transition function. They supply a method of computation that dispenses with the need for manipulation of individual cells and they are computationally universal. Classical cellular automata have proved of great interest to computer scientists but the construction of quantum cellular automata pose particular difficulties. We present a version of John Conway's famous two-dimensional classical cellular automata Life that has some quantum-like features, including interference effects. Some basic structures in the new automata are given and comparisons are made with Conway's game.

Nonsynchronous updating in the multiverse of cellular automata

NASA Astrophysics Data System (ADS)

Reia, Sandro M.; Kinouchi, Osame

2015-04-01

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

Nonsynchronous updating in the multiverse of cellular automata.

PubMed

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.

Self-organisation in Cellular Automata with Coalescent Particles: Qualitative and Quantitative Approaches

NASA Astrophysics Data System (ADS)

Hellouin de Menibus, Benjamin; Sablik, Mathieu

2017-06-01

This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial configuration at random according to some initial shift-ergodic measure, and use the limit measure to describe the asymptotic behaviour of the automata. We first take a qualitative approach, i.e. we obtain information on the limit measure(s). We prove that only particles moving in one particular direction can persist asymptotically. This provides some previously unknown information on the limit measures of various deterministic and probabilistic cellular automata: 3 and 4-cyclic cellular automata [introduced by Fisch (J Theor Probab 3(2):311-338, 1990; Phys D 45(1-3):19-25, 1990)], one-sided captive cellular automata [introduced by Theyssier (Captive Cellular Automata, 2004)], the majority-traffic cellular automaton, a self stabilisation process towards a discrete line [introduced by Regnault and Rémila (in: Mathematical Foundations of Computer Science 2015—40th International Symposium, MFCS 2015, Milan, Italy, Proceedings, Part I, 2015)]. In a second time we restrict our study to a subclass, the gliders cellular automata. For this class we show quantitative results, consisting in the asymptotic law of some parameters: the entry times [generalising K ůrka et al. (in: Proceedings of AUTOMATA, 2011)], the density of particles and the rate of convergence to the limit measure.

DOE Office of Scientific and Technical Information (OSTI.GOV)

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

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 andmore » 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.« less

Using cellular automata to generate image representation for biological sequences.

PubMed

Xiao, X; Shao, S; Ding, Y; Huang, Z; Chen, X; Chou, K-C

2005-02-01

A novel approach to visualize biological sequences is developed based on cellular automata (Wolfram, S. Nature 1984, 311, 419-424), a set of discrete dynamical systems in which space and time are discrete. By transforming the symbolic sequence codes into the digital codes, and using some optimal space-time evolvement rules of cellular automata, a biological sequence can be represented by a unique image, the so-called cellular automata image. Many important features, which are originally hidden in a long and complicated biological sequence, can be clearly revealed thru its cellular automata image. With biological sequences entering into databanks rapidly increasing in the post-genomic era, it is anticipated that the cellular automata image will become a very useful vehicle for investigation into their key features, identification of their function, as well as revelation of their "fingerprint". It is anticipated that by using the concept of the pseudo amino acid composition (Chou, K.C. Proteins: Structure, Function, and Genetics, 2001, 43, 246-255), the cellular automata image approach can also be used to improve the quality of predicting protein attributes, such as structural class and subcellular location.

Observability of Automata Networks: Fixed and Switching Cases.

PubMed

Li, Rui; Hong, Yiguang; Wang, Xingyuan

2018-04-01

Automata networks are a class of fully discrete dynamical systems, which have received considerable interest in various different areas. This brief addresses the observability of automata networks and switched automata networks in a unified framework, and proposes simple necessary and sufficient conditions for observability. The results are achieved by employing methods from symbolic computation, and are suited for implementation using computer algebra systems. Several examples are presented to demonstrate the application of the results.

Autonomous molecular cascades for evaluation of cell surfaces

NASA Astrophysics Data System (ADS)

Rudchenko, Maria; Taylor, Steven; Pallavi, Payal; Dechkovskaia, Alesia; Khan, Safana; Butler, Vincent P., Jr.; Rudchenko, Sergei; Stojanovic, Milan N.

2013-08-01

Molecular automata are mixtures of molecules that undergo precisely defined structural changes in response to sequential interactions with inputs. Previously studied nucleic acid-based automata include game-playing molecular devices (MAYA automata) and finite-state automata for the analysis of nucleic acids, with the latter inspiring circuits for the analysis of RNA species inside cells. Here, we describe automata based on strand-displacement cascades directed by antibodies that can analyse cells by using their surface markers as inputs. The final output of a molecular automaton that successfully completes its analysis is the presence of a unique molecular tag on the cell surface of a specific subpopulation of lymphocytes within human blood cells.

A full computation-relevant topological dynamics classification of elementary cellular automata.

PubMed

Schüle, Martin; Stoop, Ruedi

2012-12-01

Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and chaoticity. The "complex" ECA emerge to be sensitive, but not chaotic and not eventually weakly periodic. Based on this classification, we conjecture that elementary cellular automata capable of carrying out complex computations, such as needed for Turing-universality, are at the "edge of chaos."

Analysis of the Use of Unmanned Combat Aerial Vehicles in Conjunction with Manned Aircraft to Counter Active Terrorists in Rough Terrain

DTIC Science & Technology

2015-06-01

UCAVs) may enhance Turkey’s ability to counter active terrorists in that region. In this research, Map Aware Non-uniform Automata (MANA) is used to...Aerial Vehicles (UCAVs) may enhance Turkey’s ability to counter active terrorists in that region. In this research, Map Aware Non-uniform Automata (MANA...Attack Munition LOS Line-of-Sight MALE Medium-Altitude Long-Endurance MANA Map Aware Non-Uniform Automata MANA-V Map Aware Non-Uniform Automata

Superposition-Based Analysis of First-Order Probabilistic Timed Automata

NASA Astrophysics Data System (ADS)

Fietzke, Arnaud; Hermanns, Holger; Weidenbach, Christoph

This paper discusses the analysis of first-order probabilistic timed automata (FPTA) by a combination of hierarchic first-order superposition-based theorem proving and probabilistic model checking. We develop the overall semantics of FPTAs and prove soundness and completeness of our method for reachability properties. Basically, we decompose FPTAs into their time plus first-order logic aspects on the one hand, and their probabilistic aspects on the other hand. Then we exploit the time plus first-order behavior by hierarchic superposition over linear arithmetic. The result of this analysis is the basis for the construction of a reachability equivalent (to the original FPTA) probabilistic timed automaton to which probabilistic model checking is finally applied. The hierarchic superposition calculus required for the analysis is sound and complete on the first-order formulas generated from FPTAs. It even works well in practice. We illustrate the potential behind it with a real-life DHCP protocol example, which we analyze by means of tool chain support.

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

PubMed

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

2016-01-01

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

Using Mobile TLA as a Logic for Dynamic I/O Automata

NASA Astrophysics Data System (ADS)

Kapus, Tatjana

Input/Output (I/O) automata and the Temporal Logic of Actions (TLA) are two well-known techniques for the specification and verification of concurrent systems. Over the past few years, they have been extended to the so-called dynamic I/O automata and, respectively, Mobile TLA (MTLA) in order to be more appropriate for mobile agent systems. Dynamic I/O automata is just a mathematical model, whereas MTLA is a logic with a formally defined language. In this paper, therefore, we investigate how MTLA could be used as a formal language for the specification of dynamic I/O automata. We do this by writing an MTLA specification of a travel agent system which has been specified semi-formally in the literature on that model. In this specification, we deal with always existing agents as well as with an initially unknown number of dynamically created agents, with mobile and non-mobile agents, with I/O-automata-style communication, and with the changing communication capabilities of mobile agents. We have previously written a TLA specification of this system. This paper shows that an MTLA specification of such a system can be more elegant and faithful to the dynamic I/O automata definition because the agent existence and location can be expressed directly by using agent and location names instead of special variables as in TLA. It also shows how the reuse of names for dynamically created and destroyed agents within the dynamic I/O automata framework can be specified in MTLA.

Designing Composite Resins in the 21st Century: Ending the End Group Fallacy

DTIC Science & Technology

2015-09-30

unlimited. Network Automata • In correspondence with cellular automata , a system of differential equations describes the evolution of structures...LLNL). 11Distribution A: Approved for public release; distribution is unlimited. “State of the Art” Network Automata Example • Cure kinetics

Game of Life Music

NASA Astrophysics Data System (ADS)

Miranda, Eduardo R.; Kirke, Alexis

At the time when the first author was post-graduate student, in the evenings he used to entertain himself with the equipment in the electronic music studio at the University of York until dawn. It must have been around three o'clock in the morning of a rather cold winter night in the late 1980s, when he connected his Atari 1040ST computer to a synthesizer to test the first prototype of a system, which he was developing for his thesis. The system, named CAMUS (short for Cellular Automata Music), implemented a method that he invented to render music from the behaviour of the Game of Life (GoL) cellular automata (CA).

Exploring the concept of interaction computing through the discrete algebraic analysis of the Belousov-Zhabotinsky reaction.

PubMed

Dini, Paolo; Nehaniv, Chrystopher L; Egri-Nagy, Attila; Schilstra, Maria J

2013-05-01

Interaction computing (IC) aims to map the properties of integrable low-dimensional non-linear dynamical systems to the discrete domain of finite-state automata in an attempt to reproduce in software the self-organizing and dynamically stable properties of sub-cellular biochemical systems. As the work reported in this paper is still at the early stages of theory development it focuses on the analysis of a particularly simple chemical oscillator, the Belousov-Zhabotinsky (BZ) reaction. After retracing the rationale for IC developed over the past several years from the physical, biological, mathematical, and computer science points of view, the paper presents an elementary discussion of the Krohn-Rhodes decomposition of finite-state automata, including the holonomy decomposition of a simple automaton, and of its interpretation as an abstract positional number system. The method is then applied to the analysis of the algebraic properties of discrete finite-state automata derived from a simplified Petri net model of the BZ reaction. In the simplest possible and symmetrical case the corresponding automaton is, not surprisingly, found to contain exclusively cyclic groups. In a second, asymmetrical case, the decomposition is much more complex and includes five different simple non-abelian groups whose potential relevance arises from their ability to encode functionally complete algebras. The possible computational relevance of these findings is discussed and possible conclusions are drawn. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

Viewing hybrid systems as products of control systems and automata

NASA Technical Reports Server (NTRS)

Grossman, R. L.; Larson, R. G.

1992-01-01

The purpose of this note is to show how hybrid systems may be modeled as products of nonlinear control systems and finite state automata. By a hybrid system, we mean a network of consisting of continuous, nonlinear control system connected to discrete, finite state automata. Our point of view is that the automata switches between the control systems, and that this switching is a function of the discrete input symbols or letters that it receives. We show how a nonlinear control system may be viewed as a pair consisting of a bialgebra of operators coding the dynamics, and an algebra of observations coding the state space. We also show that a finite automata has a similar representation. A hybrid system is then modeled by taking suitable products of the bialgebras coding the dynamics and the observation algebras coding the state spaces.

Achieving microaggregation for secure statistical databases using fixed-structure partitioning-based learning automata.

PubMed

Fayyoumi, Ebaa; Oommen, B John

2009-10-01

We consider the microaggregation problem (MAP) that involves partitioning a set of individual records in a microdata file into a number of mutually exclusive and exhaustive groups. This problem, which seeks for the best partition of the microdata file, is known to be NP-hard and has been tackled using many heuristic solutions. In this paper, we present the first reported fixed-structure-stochastic-automata-based solution to this problem. The newly proposed method leads to a lower value of the information loss (IL), obtains a better tradeoff between the IL and the disclosure risk (DR) when compared with state-of-the-art methods, and leads to a superior value of the scoring index, which is a criterion involving a combination of the IL and the DR. The scheme has been implemented, tested, and evaluated for different real-life and simulated data sets. The results clearly demonstrate the applicability of learning automata to the MAP and its ability to yield a solution that obtains the best tradeoff between IL and DR when compared with the state of the art.

Cellular Automata Generalized To An Inferential System

NASA Astrophysics Data System (ADS)

Blower, David J.

2007-11-01

Stephen Wolfram popularized elementary one-dimensional cellular automata in his book, A New Kind of Science. Among many remarkable things, he proved that one of these cellular automata was a Universal Turing Machine. Such cellular automata can be interpreted in a different way by viewing them within the context of the formal manipulation rules from probability theory. Bayes's Theorem is the most famous of such formal rules. As a prelude, we recapitulate Jaynes's presentation of how probability theory generalizes classical logic using modus ponens as the canonical example. We emphasize the important conceptual standing of Boolean Algebra for the formal rules of probability manipulation and give an alternative demonstration augmenting and complementing Jaynes's derivation. We show the complementary roles played in arguments of this kind by Bayes's Theorem and joint probability tables. A good explanation for all of this is afforded by the expansion of any particular logic function via the disjunctive normal form (DNF). The DNF expansion is a useful heuristic emphasized in this exposition because such expansions point out where relevant 0s should be placed in the joint probability tables for logic functions involving any number of variables. It then becomes a straightforward exercise to rely on Boolean Algebra, Bayes's Theorem, and joint probability tables in extrapolating to Wolfram's cellular automata. Cellular automata are seen as purely deductive systems, just like classical logic, which probability theory is then able to generalize. Thus, any uncertainties which we might like to introduce into the discussion about cellular automata are handled with ease via the familiar inferential path. Most importantly, the difficult problem of predicting what cellular automata will do in the far future is treated like any inferential prediction problem.

Iterons, fractals and computations of automata

NASA Astrophysics Data System (ADS)

Siwak, Paweł

1999-03-01

Processing of strings by some automata, when viewed on space-time (ST) diagrams, reveals characteristic soliton-like coherent periodic objects. They are inherently associated with iterations of automata mappings thus we call them the iterons. In the paper we present two classes of one-dimensional iterons: particles and filtrons. The particles are typical for parallel (cellular) processing, while filtrons, introduced in (32) are specific for serial processing of strings. In general, the images of iterated automata mappings exhibit not only coherent entities but also the fractals, and quasi-periodic and chaotic dynamics. We show typical images of such computations: fractals, multiplication by a number, and addition of binary numbers defined by a Turing machine. Then, the particles are presented as iterons generated by cellular automata in three computations: B/U code conversion (13, 29), majority classification (9), and in discrete version of the FPU (Fermi-Pasta-Ulam) dynamics (7, 23). We disclose particles by a technique of combinational recoding of ST diagrams (as opposed to sequential recoding). Subsequently, we recall the recursive filters based on FCA (filter cellular automata) window operators, and considered by Park (26), Ablowitz (1), Fokas (11), Fuchssteiner (12), Bruschi (5) and Jiang (20). We present the automata equivalents to these filters (33). Some of them belong to the class of filter automata introduced in (30). We also define and illustrate some properties of filtrons. Contrary to particles, the filtrons interact nonlocally in the sense that distant symbols may influence one another. Thus their interactions are very unusual. Some examples have been given in (32). Here we show new examples of filtron phenomena: multifiltron solitonic collisions, attracting and repelling filtrons, trapped bouncing filtrons (which behave like a resonance cavity) and quasi filtrons.

Monitoring with Data Automata

NASA Technical Reports Server (NTRS)

Havelund, Klaus

2014-01-01

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

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

USGS Publications Warehouse

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.

Automatic Methods and Tools for the Verification of Real Time Systems

DTIC Science & Technology

1997-11-30

We developed formal methods and tools for the verification of real - time systems . This was accomplished by extending techniques, based on automata...embedded real - time systems , we introduced hybrid automata, which equip traditional discrete automata with real-numbered clock variables and continuous... real - time systems , and we identified the exact boundary between decidability and undecidability of real-time reasoning.

Industry Strength Tool and Technology for Automated Synthesis of Safety-Critical Applications from Formal Specifications

DTIC Science & Technology

2015-11-01

28 2.3.4 Input/Output Automata ...various other modeling frameworks such as I/O Automata , Kahn Process Networks, Petri-nets, Multi-dimensional SDF, etc. are also used for designing...Formal Ideally suited to model DSP applications 3 Petri Nets Graphical Formal Used for modeling distributed systems 4 I/O Automata Both Formal

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

PubMed

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.

Structure and Reversibility of 2D von Neumann Cellular Automata Over Triangular Lattice

NASA Astrophysics Data System (ADS)

Uguz, Selman; Redjepov, Shovkat; Acar, Ecem; Akin, Hasan

2017-06-01

Even though the fundamental main structure of cellular automata (CA) is a discrete special model, the global behaviors at many iterative times and on big scales could be a close, nearly a continuous, model system. CA theory is a very rich and useful phenomena of dynamical model that focuses on the local information being relayed to the neighboring cells to produce CA global behaviors. The mathematical points of the basic model imply the computable values of the mathematical structure of CA. After modeling the CA structure, an important problem is to be able to move forwards and backwards on CA to understand their behaviors in more elegant ways. A possible case is when CA is to be a reversible one. In this paper, we investigate the structure and the reversibility of two-dimensional (2D) finite, linear, triangular von Neumann CA with null boundary case. It is considered on ternary field ℤ3 (i.e. 3-state). We obtain their transition rule matrices for each special case. For given special triangular information (transition) rule matrices, we prove which triangular linear 2D von Neumann CAs are reversible or not. It is known that the reversibility cases of 2D CA are generally a much challenged problem. In the present study, the reversibility problem of 2D triangular, linear von Neumann CA with null boundary is resolved completely over ternary field. As far as we know, there is no structure and reversibility study of von Neumann 2D linear CA on triangular lattice in the literature. Due to the main CA structures being sufficiently simple to investigate in mathematical ways, and also very complex to obtain in chaotic systems, it is believed that the present construction can be applied to many areas related to these CA using any other transition rules.

Maximizing the Adjacent Possible in Automata Chemistries.

PubMed

Hickinbotham, Simon; Clark, Edward; Nellis, Adam; Stepney, Susan; Clarke, Tim; Young, Peter

2016-01-01

Automata chemistries are good vehicles for experimentation in open-ended evolution, but they are by necessity complex systems whose low-level properties require careful design. To aid the process of designing automata chemistries, we develop an abstract model that classifies the features of a chemistry from a physical (bottom up) perspective and from a biological (top down) perspective. There are two levels: things that can evolve, and things that cannot. We equate the evolving level with biology and the non-evolving level with physics. We design our initial organisms in the biology, so they can evolve. We design the physics to facilitate evolvable biologies. This architecture leads to a set of design principles that should be observed when creating an instantiation of the architecture. These principles are Everything Evolves, Everything's Soft, and Everything Dies. To evaluate these ideas, we present experiments in the recently developed Stringmol automata chemistry. We examine the properties of Stringmol with respect to the principles, and so demonstrate the usefulness of the principles in designing automata chemistries.

Asynchronous adaptive time step in quantitative cellular automata modeling

PubMed Central

Zhu, Hao; Pang, Peter YH; Sun, Yan; Dhar, Pawan

2004-01-01

Background The behaviors of cells in metazoans are context dependent, thus large-scale multi-cellular modeling is often necessary, for which cellular automata are natural candidates. Two related issues are involved in cellular automata based multi-cellular modeling: how to introduce differential equation based quantitative computing to precisely describe cellular activity, and upon it, how to solve the heavy time consumption issue in simulation. Results Based on a modified, language based cellular automata system we extended that allows ordinary differential equations in models, we introduce a method implementing asynchronous adaptive time step in simulation that can considerably improve efficiency yet without a significant sacrifice of accuracy. An average speedup rate of 4–5 is achieved in the given example. Conclusions Strategies for reducing time consumption in simulation are indispensable for large-scale, quantitative multi-cellular models, because even a small 100 × 100 × 100 tissue slab contains one million cells. Distributed and adaptive time step is a practical solution in cellular automata environment. PMID:15222901

YIP Formal Synthesis of Software-Based Control Protocols for Fractionated,Composable Autonomous Systems

DTIC Science & Technology

2016-07-08

Systems Using Automata Theory and Barrier Certifi- cates We developed a sound but incomplete method for the computational verification of specifications...method merges ideas from automata -based model checking with those from control theory including so-called barrier certificates and optimization-based... Automata theory meets barrier certificates: Temporal logic verification of nonlinear systems,” IEEE Transactions on Automatic Control, 2015. [J2] R

Analysis of Error Propagation Within Hierarchical Air Combat Models

DTIC Science & Technology

2016-06-01

Model Simulation MANA Map Aware Non-Uniform Automata MCET Mine Warfare Capabilities and Effectiveness Tool MOE measure of effectiveness MOP measure of...model for a two-versus-two air engagement between jet fighters in the stochastic, agent-based Map Aware Non- uniform Automata (MANA) simulation...Master’s thesis, Naval Postgraduate School, Monterey, CA. McIntosh, G. C. (2009). MANA-V (Map aware non-uniform automata – Vector) supplementary manual

Periodically-Scheduled Controller Analysis using Hybrid Systems Reachability and Continuization

DTIC Science & Technology

2015-12-01

tools to verify specifications for hybrid automata do not perform well on such periodically scheduled models. This is due to a combination of the large...an additive nondeterministic input. Reachability tools for hybrid automata can better handle such systems. We further improve the analysis by...formally as a hybrid automaton. However, reachability tools to verify specifications for hybrid automata do not perform well on such periodically

Experiments in Error Propagation within Hierarchal Combat Models

DTIC Science & Technology

2015-09-01

Bayesian Information Criterion CNO Chief of Naval Operations DOE Design of Experiments DOD Department of Defense MANA Map Aware Non-uniform Automata ...ground up” approach. First, it develops a mission-level model for one on one submarine combat in Map Aware Non-uniform Automata (MANA) simulation, an... Automata (MANA), an agent based simulation that can model the different postures of submarines. It feeds the results from MANA into stochastic

Activity Detection and Retrieval for Image and Video Data with Limited Training

DTIC Science & Technology

2015-06-10

applications. Here we propose two techniques for image segmentation. The first involves an automata based multiple threshold selection scheme, where a... automata . For our second approach to segmentation, we employ a region based segmentation technique that is capable of handling intensity inhomogeneity...techniques for image segmentation. The first involves an automata based multiple threshold selection scheme, where a mixture of Gaussian is fitted to the

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

NASA Astrophysics Data System (ADS)

Jjumba, Anthony; Dragićević, Suzana

2016-07-01

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

Traffic jam dynamics in stochastic cellular automata

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nagel, K.; Schreckenberg, M.

1995-09-01

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

Automatic Methods and Tools for the Verification of Real Time Systems

DTIC Science & Technology

1997-07-31

real - time systems . This was accomplished by extending techniques, based on automata theory and temporal logic, that have been successful for the verification of time-independent reactive systems. As system specification lanmaage for embedded real - time systems , we introduced hybrid automata, which equip traditional discrete automata with real-numbered clock variables and continuous environment variables. As requirements specification languages, we introduced temporal logics with clock variables for expressing timing constraints.

Lempel-Ziv complexity analysis of one dimensional cellular automata.

PubMed

Estevez-Rams, E; Lora-Serrano, R; Nunes, C A J; Aragón-Fernández, B

2015-12-01

Lempel-Ziv complexity measure has been used to estimate the entropy density of a string. It is defined as the number of factors in a production factorization of a string. In this contribution, we show that its use can be extended, by using the normalized information distance, to study the spatiotemporal evolution of random initial configurations under cellular automata rules. In particular, the transfer information from time consecutive configurations is studied, as well as the sensitivity to perturbed initial conditions. The behavior of the cellular automata rules can be grouped in different classes, but no single grouping captures the whole nature of the involved rules. The analysis carried out is particularly appropriate for studying the computational processing capabilities of cellular automata rules.

Lempel-Ziv complexity analysis of one dimensional cellular automata

NASA Astrophysics Data System (ADS)

Estevez-Rams, E.; Lora-Serrano, R.; Nunes, C. A. J.; Aragón-Fernández, B.

2015-12-01

Lempel-Ziv complexity measure has been used to estimate the entropy density of a string. It is defined as the number of factors in a production factorization of a string. In this contribution, we show that its use can be extended, by using the normalized information distance, to study the spatiotemporal evolution of random initial configurations under cellular automata rules. In particular, the transfer information from time consecutive configurations is studied, as well as the sensitivity to perturbed initial conditions. The behavior of the cellular automata rules can be grouped in different classes, but no single grouping captures the whole nature of the involved rules. The analysis carried out is particularly appropriate for studying the computational processing capabilities of cellular automata rules.

A Cellular Automata Model of Bone Formation

PubMed Central

Van Scoy, Gabrielle K.; George, Estee L.; Asantewaa, Flora Opoku; Kerns, Lucy; Saunders, Marnie M.; Prieto-Langarica, Alicia

2017-01-01

Bone remodeling is an elegantly orchestrated process by which osteocytes, osteoblasts and osteoclasts function as a syncytium to maintain or modify bone. On the microscopic level, bone consists of cells that create, destroy and monitor the bone matrix. These cells interact in a coordinated manner to maintain a tightly regulated homeostasis. It is this regulation that is responsible for the observed increase in bone gain in the dominant arm of a tennis player and the observed increase in bone loss associated with spaceflight and osteoporosis. The manner in which these cells interact to bring about a change in bone quality and quantity has yet to be fully elucidated. But efforts to understand the multicellular complexity can ultimately lead to eradication of metabolic bone diseases such as osteoporosis and improved implant longevity. Experimentally validated mathematical models that simulate functional activity and offer eventual predictive capabilities offer tremendous potential in understanding multicellular bone remodeling. Here we undertake the initial challenge to develop a mathematical model of bone formation validated with in vitro data obtained from osteoblastic bone cells induced to mineralize and quantified at 26 days of culture. A cellular automata model was constructed to simulate the in vitro characterization. Permutation tests were performed to compare the distribution of the mineralization in the cultures and the distribution of the mineralization in the mathematical models. The results of the permutation test show the distribution of mineralization from the characterization and mathematical model come from the same probability distribution, therefore validating the cellular automata model. PMID:28189632

Literature Review on Systems of Systems (SoS): A Methodology With Preliminary Results

DTIC Science & Technology

2013-11-01

Appendix H. The Enhanced ISAAC Neural Simulation Toolkit (EINSTein) 73  Appendix I. The Map Aware Nonuniform Automata (MANA) Agent-Based Model 81...83  Figure I-3. Quadrant chart addressing SoS and associated SoSA designs for the Map Aware Nonuniform Automata (MANA) agent...Map Aware Nonuniform Automata (MANA) agent-based model. 85  Table I-2. SoS and SoSA software component maturation scores associated with the Map

Fuzzy tree automata and syntactic pattern recognition.

PubMed

Lee, E T

1982-04-01

An approach of representing patterns by trees and processing these trees by fuzzy tree automata is described. Fuzzy tree automata are defined and investigated. The results include that the class of fuzzy root-to-frontier recognizable ¿-trees is closed under intersection, union, and complementation. Thus, the class of fuzzy root-to-frontier recognizable ¿-trees forms a Boolean algebra. Fuzzy tree automata are applied to processing fuzzy tree representation of patterns based on syntactic pattern recognition. The grade of acceptance is defined and investigated. Quantitative measures of ``approximate isosceles triangle,'' ``approximate elongated isosceles triangle,'' ``approximate rectangle,'' and ``approximate cross'' are defined and used in the illustrative examples of this approach. By using these quantitative measures, a house, a house with high roof, and a church are also presented as illustrative examples. In addition, three fuzzy tree automata are constructed which have the capability of processing the fuzzy tree representations of ``fuzzy houses,'' ``houses with high roofs,'' and ``fuzzy churches,'' respectively. The results may have useful applications in pattern recognition, image processing, artificial intelligence, pattern database design and processing, image science, and pictorial information systems.

Probabilistic Cellular Automata

PubMed Central

Agapie, Alexandru; Giuclea, Marius

2014-01-01

Abstract Cellular automata are binary lattices used for modeling complex dynamical systems. The automaton evolves iteratively from one configuration to another, using some local transition rule based on the number of ones in the neighborhood of each cell. With respect to the number of cells allowed to change per iteration, we speak of either synchronous or asynchronous automata. If randomness is involved to some degree in the transition rule, we speak of probabilistic automata, otherwise they are called deterministic. With either type of cellular automaton we are dealing with, the main theoretical challenge stays the same: starting from an arbitrary initial configuration, predict (with highest accuracy) the end configuration. If the automaton is deterministic, the outcome simplifies to one of two configurations, all zeros or all ones. If the automaton is probabilistic, the whole process is modeled by a finite homogeneous Markov chain, and the outcome is the corresponding stationary distribution. Based on our previous results for the asynchronous case—connecting the probability of a configuration in the stationary distribution to its number of zero-one borders—the article offers both numerical and theoretical insight into the long-term behavior of synchronous cellular automata. PMID:24999557

Probabilistic cellular automata.

PubMed

Agapie, Alexandru; Andreica, Anca; Giuclea, Marius

2014-09-01

Cellular automata are binary lattices used for modeling complex dynamical systems. The automaton evolves iteratively from one configuration to another, using some local transition rule based on the number of ones in the neighborhood of each cell. With respect to the number of cells allowed to change per iteration, we speak of either synchronous or asynchronous automata. If randomness is involved to some degree in the transition rule, we speak of probabilistic automata, otherwise they are called deterministic. With either type of cellular automaton we are dealing with, the main theoretical challenge stays the same: starting from an arbitrary initial configuration, predict (with highest accuracy) the end configuration. If the automaton is deterministic, the outcome simplifies to one of two configurations, all zeros or all ones. If the automaton is probabilistic, the whole process is modeled by a finite homogeneous Markov chain, and the outcome is the corresponding stationary distribution. Based on our previous results for the asynchronous case-connecting the probability of a configuration in the stationary distribution to its number of zero-one borders-the article offers both numerical and theoretical insight into the long-term behavior of synchronous cellular automata.

Algebraic Systems and Pushdown Automata

NASA Astrophysics Data System (ADS)

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.

Nonlinear adaptive networks: A little theory, a few applications

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jones, R.D.; Qian, S.; Barnes, C.W.

1990-01-01

We present the theory of nonlinear adaptive networks and discuss a few applications. In particular, we review the theory of feedforward backpropagation networks. We than present the theory of the Connectionist Normalized Linear Spline network in both its feedforward and iterated modes. Also, we briefly discuss the theory of stochastic cellular automata. We then discuss applications to chaotic time series tidal prediction in Venice Lagoon, sonar transient detection, control of nonlinear processes, balancing a double inverted pendulum and design advice for free electron lasers. 26 refs., 23 figs.

Finding and defining the natural automata acting in living plants: Toward the synthetic biology for robotics and informatics in vivo.

PubMed

Kawano, Tomonori; Bouteau, François; Mancuso, Stefano

2012-11-01

The automata theory is the mathematical study of abstract machines commonly studied in the theoretical computer science and highly interdisciplinary fields that combine the natural sciences and the theoretical computer science. In the present review article, as the chemical and biological basis for natural computing or informatics, some plants, plant cells or plant-derived molecules involved in signaling are listed and classified as natural sequential machines (namely, the Mealy machines or Moore machines) or finite state automata. By defining the actions (states and transition functions) of these natural automata, the similarity between the computational data processing and plant decision-making processes became obvious. Finally, their putative roles as the parts for plant-based computing or robotic systems are discussed.

Finding and defining the natural automata acting in living plants: Toward the synthetic biology for robotics and informatics in vivo

PubMed Central

Kawano, Tomonori; Bouteau, François; Mancuso, Stefano

2012-01-01

The automata theory is the mathematical study of abstract machines commonly studied in the theoretical computer science and highly interdisciplinary fields that combine the natural sciences and the theoretical computer science. In the present review article, as the chemical and biological basis for natural computing or informatics, some plants, plant cells or plant-derived molecules involved in signaling are listed and classified as natural sequential machines (namely, the Mealy machines or Moore machines) or finite state automata. By defining the actions (states and transition functions) of these natural automata, the similarity between the computational data processing and plant decision-making processes became obvious. Finally, their putative roles as the parts for plant-based computing or robotic systems are discussed. PMID:23336016

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

NASA Astrophysics Data System (ADS)

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 of teaching and learning, improvements to a course are possible. These improvements can eventually develop a "best practice" instructional environment. This view is not possible under a strictly constructivist learning theory as there is no way to teach a group of individuals in a "best" way. Using this theoretical basis, we examined the gathered data from CS 341. (Abstract shortened by UMI.)

Compositional schedulability analysis of real-time actor-based systems.

PubMed

Jaghoori, Mohammad Mahdi; de Boer, Frank; Longuet, Delphine; Chothia, Tom; Sirjani, Marjan

2017-01-01

We present an extension of the actor model with real-time, including deadlines associated with messages, and explicit application-level scheduling policies, e.g.,"earliest deadline first" which can be associated with individual actors. Schedulability analysis in this setting amounts to checking whether, given a scheduling policy for each actor, every task is processed within its designated deadline. To check schedulability, we introduce a compositional automata-theoretic approach, based on maximal use of model checking combined with testing. Behavioral interfaces define what an actor expects from the environment, and the deadlines for messages given these assumptions. We use model checking to verify that actors match their behavioral interfaces. We extend timed automata refinement with the notion of deadlines and use it to define compatibility of actor environments with the behavioral interfaces. Model checking of compatibility is computationally hard, so we propose a special testing process. We show that the analyses are decidable and automate the process using the Uppaal model checker.

The detection and stabilisation of limit cycle for deterministic finite automata

NASA Astrophysics Data System (ADS)

Han, Xiaoguang; Chen, Zengqiang; Liu, Zhongxin; Zhang, Qing

2018-04-01

In this paper, the topological structure properties of deterministic finite automata (DFA), under the framework of the semi-tensor product of matrices, are investigated. First, the dynamics of DFA are converted into a new algebraic form as a discrete-time linear system by means of Boolean algebra. Using this algebraic description, the approach of calculating the limit cycles of different lengths is given. Second, we present two fundamental concepts, namely, domain of attraction of limit cycle and prereachability set. Based on the prereachability set, an explicit solution of calculating domain of attraction of a limit cycle is completely characterised. Third, we define the globally attractive limit cycle, and then the necessary and sufficient condition for verifying whether all state trajectories of a DFA enter a given limit cycle in a finite number of transitions is given. Fourth, the problem of whether a DFA can be stabilised to a limit cycle by the state feedback controller is discussed. Criteria for limit cycle-stabilisation are established. All state feedback controllers which implement the minimal length trajectories from each state to the limit cycle are obtained by using the proposed algorithm. Finally, an illustrative example is presented to show the theoretical results.

Agent-based modeling of the immune system: NetLogo, a promising framework.

PubMed

Chiacchio, Ferdinando; Pennisi, Marzio; Russo, Giulia; Motta, Santo; Pappalardo, Francesco

2014-01-01

Several components that interact with each other to evolve a complex, and, in some cases, unexpected behavior, represents one of the main and fascinating features of the mammalian immune system. Agent-based modeling and cellular automata belong to a class of discrete mathematical approaches in which entities (agents) sense local information and undertake actions over time according to predefined rules. The strength of this approach is characterized by the appearance of a global behavior that emerges from interactions among agents. This behavior is unpredictable, as it does not follow linear rules. There are a lot of works that investigates the immune system with agent-based modeling and cellular automata. They have shown the ability to see clearly and intuitively into the nature of immunological processes. NetLogo is a multiagent programming language and modeling environment for simulating complex phenomena. It is designed for both research and education and is used across a wide range of disciplines and education levels. In this paper, we summarize NetLogo applications to immunology and, particularly, how this framework can help in the development and formulation of hypotheses that might drive further experimental investigations of disease mechanisms.

A Decomposition Theorem for Finite Automata.

ERIC Educational Resources Information Center

Santa Coloma, Teresa L.; Tucci, Ralph P.

1990-01-01

Described is automata theory which is a branch of theoretical computer science. A decomposition theorem is presented that is easier than the Krohn-Rhodes theorem. Included are the definitions, the theorem, and a proof. (KR)

A modular architecture for transparent computation in recurrent neural networks.

PubMed

Carmantini, Giovanni S; Beim Graben, Peter; Desroches, Mathieu; Rodrigues, Serafim

2017-01-01

Computation is classically studied in terms of automata, formal languages and algorithms; yet, the relation between neural dynamics and symbolic representations and operations is still unclear in traditional eliminative connectionism. Therefore, we suggest a unique perspective on this central issue, to which we would like to refer as transparent connectionism, by proposing accounts of how symbolic computation can be implemented in neural substrates. In this study we first introduce a new model of dynamics on a symbolic space, the versatile shift, showing that it supports the real-time simulation of a range of automata. We then show that the Gödelization of versatile shifts defines nonlinear dynamical automata, dynamical systems evolving on a vectorial space. Finally, we present a mapping between nonlinear dynamical automata and recurrent artificial neural networks. The mapping defines an architecture characterized by its granular modularity, where data, symbolic operations and their control are not only distinguishable in activation space, but also spatially localizable in the network itself, while maintaining a distributed encoding of symbolic representations. The resulting networks simulate automata in real-time and are programmed directly, in the absence of network training. To discuss the unique characteristics of the architecture and their consequences, we present two examples: (i) the design of a Central Pattern Generator from a finite-state locomotive controller, and (ii) the creation of a network simulating a system of interactive automata that supports the parsing of garden-path sentences as investigated in psycholinguistics experiments. Copyright © 2016 Elsevier Ltd. All rights reserved.

A cryptographic hash function based on chaotic network automata

NASA Astrophysics Data System (ADS)

Machicao, Jeaneth; Bruno, Odemir M.

2017-12-01

Chaos theory has been used to develop several cryptographic methods relying on the pseudo-random properties extracted from simple nonlinear systems such as cellular automata (CA). Cryptographic hash functions (CHF) are commonly used to check data integrity. CHF “compress” arbitrary long messages (input) into much smaller representations called hash values or message digest (output), designed to prevent the ability to reverse the hash values into the original message. This paper proposes a chaos-based CHF inspired on an encryption method based on chaotic CA rule B1357-S2468. Here, we propose an hybrid model that combines CA and networks, called network automata (CNA), whose chaotic spatio-temporal outputs are used to compute a hash value. Following the Merkle and Damgård model of construction, a portion of the message is entered as the initial condition of the network automata, so that the rest parts of messages are iteratively entered to perturb the system. The chaotic network automata shuffles the message using flexible control parameters, so that the generated hash value is highly sensitive to the message. As demonstrated in our experiments, the proposed model has excellent pseudo-randomness and sensitivity properties with acceptable performance when compared to conventional hash functions.

Formal methods for modeling and analysis of hybrid systems

NASA Technical Reports Server (NTRS)

Tiwari, Ashish (Inventor); Lincoln, Patrick D. (Inventor)

2009-01-01

A technique based on the use of a quantifier elimination decision procedure for real closed fields and simple theorem proving to construct a series of successively finer qualitative abstractions of hybrid automata is taught. The resulting abstractions are always discrete transition systems which can then be used by any traditional analysis tool. The constructed abstractions are conservative and can be used to establish safety properties of the original system. The technique works on linear and non-linear polynomial hybrid systems: the guards on discrete transitions and the continuous flows in all modes can be specified using arbitrary polynomial expressions over the continuous variables. An exemplar tool in the SAL environment built over the theorem prover PVS is detailed. The technique scales well to large and complex hybrid systems.

A Semi-quantum Version of the Game of Life

NASA Astrophysics Data System (ADS)

Flitney, Adrian P.; Abbott, Derek

The following sections are included: * Background and Motivation * Classical cellular automata * Conway's game of life * Quantum cellular automata * Semi-quantum Life * The idea * A first model * A semi-quantum model * Discussion * Summary * References

A cellular automata model of bone formation.

PubMed

Van Scoy, Gabrielle K; George, Estee L; Opoku Asantewaa, Flora; Kerns, Lucy; Saunders, Marnie M; Prieto-Langarica, Alicia

2017-04-01

Bone remodeling is an elegantly orchestrated process by which osteocytes, osteoblasts and osteoclasts function as a syncytium to maintain or modify bone. On the microscopic level, bone consists of cells that create, destroy and monitor the bone matrix. These cells interact in a coordinated manner to maintain a tightly regulated homeostasis. It is this regulation that is responsible for the observed increase in bone gain in the dominant arm of a tennis player and the observed increase in bone loss associated with spaceflight and osteoporosis. The manner in which these cells interact to bring about a change in bone quality and quantity has yet to be fully elucidated. But efforts to understand the multicellular complexity can ultimately lead to eradication of metabolic bone diseases such as osteoporosis and improved implant longevity. Experimentally validated mathematical models that simulate functional activity and offer eventual predictive capabilities offer tremendous potential in understanding multicellular bone remodeling. Here we undertake the initial challenge to develop a mathematical model of bone formation validated with in vitro data obtained from osteoblastic bone cells induced to mineralize and quantified at 26 days of culture. A cellular automata model was constructed to simulate the in vitro characterization. Permutation tests were performed to compare the distribution of the mineralization in the cultures and the distribution of the mineralization in the mathematical models. The results of the permutation test show the distribution of mineralization from the characterization and mathematical model come from the same probability distribution, therefore validating the cellular automata model. Copyright © 2017 Elsevier Inc. All rights reserved.

A novel image encryption algorithm using chaos and reversible cellular automata

NASA Astrophysics Data System (ADS)

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.

Self-organized perturbations enhance class IV behavior and 1/f power spectrum in elementary cellular automata.

PubMed

Nakajima, Kohei; Haruna, Taichi

2011-09-01

In this paper, we propose a new class of cellular automata based on the modification of its state space. It is introduced to model a computation which is exposed to an environment. We formalized the computation as extension and projection processes of its state space and resulting misidentifications of the state. This is motivated to embed the role of an environment into the system itself, which naturally induces self-organized internal perturbations rather than the usual external perturbations. Implementing this structure into the elementary cellular automata, we characterized its effect by means of input entropy and power spectral analysis. As a result, the cellular automata with this structure showed robust class IV behavior and a 1/f power spectrum in a wide range of rule space comparative to the notion of the edge of chaos. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

Predictability in cellular automata.

PubMed

Agapie, Alexandru; Andreica, Anca; Chira, Camelia; Giuclea, Marius

2014-01-01

Modelled as finite homogeneous Markov chains, probabilistic cellular automata with local transition probabilities in (0, 1) always posses a stationary distribution. This result alone is not very helpful when it comes to predicting the final configuration; one needs also a formula connecting the probabilities in the stationary distribution to some intrinsic feature of the lattice configuration. Previous results on the asynchronous cellular automata have showed that such feature really exists. It is the number of zero-one borders within the automaton's binary configuration. An exponential formula in the number of zero-one borders has been proved for the 1-D, 2-D and 3-D asynchronous automata with neighborhood three, five and seven, respectively. We perform computer experiments on a synchronous cellular automaton to check whether the empirical distribution obeys also that theoretical formula. The numerical results indicate a perfect fit for neighbourhood three and five, which opens the way for a rigorous proof of the formula in this new, synchronous case.

Mathematical Models of Elementary Mathematics Learning and Performance. Final Report.

ERIC Educational Resources Information Center

Suppes, Patrick

This project was concerned with the development of mathematical models of elementary mathematics learning and performance. Probabilistic finite automata and register machines with a finite number of registers were developed as models and extensively tested with data arising from the elementary-mathematics strand curriculum developed by the…

A smart sensor architecture based on emergent computation in an array of outer-totalistic cells

NASA Astrophysics Data System (ADS)

Dogaru, Radu; Dogaru, Ioana; Glesner, Manfred

2005-06-01

A novel smart-sensor architecture is proposed, capable to segment and recognize characters in a monochrome image. It is capable to provide a list of ASCII codes representing the recognized characters from the monochrome visual field. It can operate as a blind's aid or for industrial applications. A bio-inspired cellular model with simple linear neurons was found the best to perform the nontrivial task of cropping isolated compact objects such as handwritten digits or characters. By attaching a simple outer-totalistic cell to each pixel sensor, emergent computation in the resulting cellular automata lattice provides a straightforward and compact solution to the otherwise computationally intensive problem of character segmentation. A simple and robust recognition algorithm is built in a compact sequential controller accessing the array of cells so that the integrated device can provide directly a list of codes of the recognized characters. Preliminary simulation tests indicate good performance and robustness to various distortions of the visual field.

Evolution of cellular automata with memory: The Density Classification Task.

PubMed

Stone, Christopher; Bull, Larry

2009-08-01

The Density Classification Task is a well known test problem for two-state discrete dynamical systems. For many years researchers have used a variety of evolutionary computation approaches to evolve solutions to this problem. In this paper, we investigate the evolvability of solutions when the underlying Cellular Automaton is augmented with a type of memory based on the Least Mean Square algorithm. To obtain high performance solutions using a simple non-hybrid genetic algorithm, we design a novel representation based on the ternary representation used for Learning Classifier Systems. The new representation is found able to produce superior performance to the bit string traditionally used for representing Cellular automata. Moreover, memory is shown to improve evolvability of solutions and appropriate memory settings are able to be evolved as a component part of these solutions.

Prediction and control of chaotic processes using nonlinear adaptive networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jones, R.D.; Barnes, C.W.; Flake, G.W.

1990-01-01

We present the theory of nonlinear adaptive networks and discuss a few applications. In particular, we review the theory of feedforward backpropagation networks. We then present the theory of the Connectionist Normalized Linear Spline network in both its feedforward and iterated modes. Also, we briefly discuss the theory of stochastic cellular automata. We then discuss applications to chaotic time series, tidal prediction in Venice lagoon, finite differencing, sonar transient detection, control of nonlinear processes, control of a negative ion source, balancing a double inverted pendulum and design advice for free electron lasers and laser fusion targets.

Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language

NASA Astrophysics Data System (ADS)

Madhavapeddy, Anil

Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which provides a usable middle ground between ad-hoc coding and formal reasoning. It enables programmers to embed automata in their code which can be statically model-checked using SPIN and dynamically enforced. The performance overheads are minimal, and the automata also provide higher-level debugging capabilities. We also describe some practical uses of SPL by describing the automata used in an SSH server written entirely in OCaml/SPL.

The 3-dimensional cellular automata for HIV infection

NASA Astrophysics Data System (ADS)

Mo, Youbin; Ren, Bin; Yang, Wencao; Shuai, Jianwei

2014-04-01

The HIV infection dynamics is discussed in detail with a 3-dimensional cellular automata model in this paper. The model can reproduce the three-phase development, i.e., the acute period, the asymptotic period and the AIDS period, observed in the HIV-infected patients in a clinic. We show that the 3D HIV model performs a better robustness on the model parameters than the 2D cellular automata. Furthermore, we reveal that the occurrence of a perpetual source to successively generate infectious waves to spread to the whole system drives the model from the asymptotic state to the AIDS state.

Cellular Automata Simulation for Wealth Distribution

NASA Astrophysics Data System (ADS)

Lo, Shih-Ching

2009-08-01

Wealth distribution of a country is a complicate system. A model, which is based on the Epstein & Axtell's "Sugars cape" model, is presented in Netlogo. The model considers the income, age, working opportunity and salary as control variables. There are still other variables should be considered while an artificial society is established. In this study, a more complicate cellular automata model for wealth distribution model is proposed. The effects of social welfare, tax, economical investment and inheritance are considered and simulated. According to the cellular automata simulation for wealth distribution, we will have a deep insight of financial policy of the government.

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

NASA Astrophysics Data System (ADS)

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.

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

PubMed

Khan, Muhammad Sadiq Ali; Yousuf, Sidrah

2016-03-01

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

A Cellular Automata-based Model for Simulating Restitution Property in a Single Heart Cell.

PubMed

Sabzpoushan, Seyed Hojjat; Pourhasanzade, Fateme

2011-01-01

Ventricular fibrillation is the cause of the most sudden mortalities. Restitution is one of the specific properties of ventricular cell. The recent findings have clearly proved the correlation between the slope of restitution curve with ventricular fibrillation. This; therefore, mandates the modeling of cellular restitution to gain high importance. A cellular automaton is a powerful tool for simulating complex phenomena in a simple language. A cellular automaton is a lattice of cells where the behavior of each cell is determined by the behavior of its neighboring cells as well as the automata rule. In this paper, a simple model is depicted for the simulation of the property of restitution in a single cardiac cell using cellular automata. At first, two state variables; action potential and recovery are introduced in the automata model. In second, automata rule is determined and then recovery variable is defined in such a way so that the restitution is developed. In order to evaluate the proposed model, the generated restitution curve in our study is compared with the restitution curves from the experimental findings of valid sources. Our findings indicate that the presented model is not only capable of simulating restitution in cardiac cell, but also possesses the capability of regulating the restitution curve.

Data Automata in Scala

NASA Technical Reports Server (NTRS)

Havelund, Klaus

2014-01-01

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

Maritime Tactical Command and Control Analysis of Alternatives

DTIC Science & Technology

2016-01-01

JIIM joint, interagency, intergovernmental, and multinational LCC life-cycle cost MANA Map Aware Non-Uniform Automata MDA milestone decision authority...Map Aware Non-Uniform Automata (MANA), a combat and C4I, surveillance, and reconnaissance model developed by the New Zealand Defence Technology

A Cybernetic Approach To Study the Learnability of the LOGO Turtle World.

ERIC Educational Resources Information Center

Ippel, Martin J.; Meulemans, Caroline J. M.

1998-01-01

This study of second- and third-grade students in the Netherlands tests the hypothesis that simplification of the semantic structure will facilitate semantic understanding and acquisition of syntax knowledge within the LOGO Turtle World. Two microworlds were designed applying the theory of automata and abstract languages. (Author/LRW)

Robot Path Planning in Uncertain Environments: A Language-Measure-Theoretic Approach

DTIC Science & Technology

2015-03-01

in the framework of probabilistic finite state automata (PFSA) and language measure from a control-theoretic perspective. The proposed concept has been...DOI: 10.1115/1.4027876] Keywords: path planning, language measure, probabilistic finite state automata 1 Motivation and Introduction In general

Decentralized indirect methods for learning automata games.

PubMed

Tilak, Omkar; Martin, Ryan; Mukhopadhyay, Snehasis

2011-10-01

We discuss the application of indirect learning methods in zero-sum and identical payoff learning automata games. We propose a novel decentralized version of the well-known pursuit learning algorithm. Such a decentralized algorithm has significant computational advantages over its centralized counterpart. The theoretical study of such a decentralized algorithm requires the analysis to be carried out in a nonstationary environment. We use a novel bootstrapping argument to prove the convergence of the algorithm. To our knowledge, this is the first time that such analysis has been carried out for zero-sum and identical payoff games. Extensive simulation studies are reported, which demonstrate the proposed algorithm's fast and accurate convergence in a variety of game scenarios. We also introduce the framework of partial communication in the context of identical payoff games of learning automata. In such games, the automata may not communicate with each other or may communicate selectively. This comprehensive framework has the capability to model both centralized and decentralized games discussed in this paper.

Wavefront cellular learning automata.

PubMed

Moradabadi, Behnaz; Meybodi, Mohammad Reza

2018-02-01

This paper proposes a new cellular learning automaton, called a wavefront cellular learning automaton (WCLA). The proposed WCLA has a set of learning automata mapped to a connected structure and uses this structure to propagate the state changes of the learning automata over the structure using waves. In the WCLA, after one learning automaton chooses its action, if this chosen action is different from the previous action, it can send a wave to its neighbors and activate them. Each neighbor receiving the wave is activated and must choose a new action. This structure for the WCLA is necessary in many dynamic areas such as social networks, computer networks, grid computing, and web mining. In this paper, we introduce the WCLA framework as an optimization tool with diffusion capability, study its behavior over time using ordinary differential equation solutions, and present its accuracy using expediency analysis. To show the superiority of the proposed WCLA, we compare the proposed method with some other types of cellular learning automata using two benchmark problems.

Predictability in Cellular Automata

PubMed Central

Agapie, Alexandru; Andreica, Anca; Chira, Camelia; Giuclea, Marius

2014-01-01

Modelled as finite homogeneous Markov chains, probabilistic cellular automata with local transition probabilities in (0, 1) always posses a stationary distribution. This result alone is not very helpful when it comes to predicting the final configuration; one needs also a formula connecting the probabilities in the stationary distribution to some intrinsic feature of the lattice configuration. Previous results on the asynchronous cellular automata have showed that such feature really exists. It is the number of zero-one borders within the automaton's binary configuration. An exponential formula in the number of zero-one borders has been proved for the 1-D, 2-D and 3-D asynchronous automata with neighborhood three, five and seven, respectively. We perform computer experiments on a synchronous cellular automaton to check whether the empirical distribution obeys also that theoretical formula. The numerical results indicate a perfect fit for neighbourhood three and five, which opens the way for a rigorous proof of the formula in this new, synchronous case. PMID:25271778

Wavefront cellular learning automata

NASA Astrophysics Data System (ADS)

Moradabadi, Behnaz; Meybodi, Mohammad Reza

2018-02-01

This paper proposes a new cellular learning automaton, called a wavefront cellular learning automaton (WCLA). The proposed WCLA has a set of learning automata mapped to a connected structure and uses this structure to propagate the state changes of the learning automata over the structure using waves. In the WCLA, after one learning automaton chooses its action, if this chosen action is different from the previous action, it can send a wave to its neighbors and activate them. Each neighbor receiving the wave is activated and must choose a new action. This structure for the WCLA is necessary in many dynamic areas such as social networks, computer networks, grid computing, and web mining. In this paper, we introduce the WCLA framework as an optimization tool with diffusion capability, study its behavior over time using ordinary differential equation solutions, and present its accuracy using expediency analysis. To show the superiority of the proposed WCLA, we compare the proposed method with some other types of cellular learning automata using two benchmark problems.

Hybrid automata models of cardiac ventricular electrophysiology for real-time computational applications.

PubMed

Andalam, Sidharta; Ramanna, Harshavardhan; Malik, Avinash; Roop, Parthasarathi; Patel, Nitish; Trew, Mark L

2016-08-01

Virtual heart models have been proposed for closed loop validation of safety-critical embedded medical devices, such as pacemakers. These models must react in real-time to off-the-shelf medical devices. Real-time performance can be obtained by implementing models in computer hardware, and methods of compiling classes of Hybrid Automata (HA) onto FPGA have been developed. Models of ventricular cardiac cell electrophysiology have been described using HA which capture the complex nonlinear behavior of biological systems. However, many models that have been used for closed-loop validation of pacemakers are highly abstract and do not capture important characteristics of the dynamic rate response. We developed a new HA model of cardiac cells which captures dynamic behavior and we implemented the model in hardware. This potentially enables modeling the heart with over 1 million dynamic cells, making the approach ideal for closed loop testing of medical devices.

Cellular automata and integrodifferential equation models for cell renewal in mosaic tissues

PubMed Central

Bloomfield, J. M.; Sherratt, J. A.; Painter, K. J.; Landini, G.

2010-01-01

Mosaic tissues are composed of two or more genetically distinct cell types. They occur naturally, and are also a useful experimental method for exploring tissue growth and maintenance. By marking the different cell types, one can study the patterns formed by proliferation, renewal and migration. Here, we present mathematical modelling suggesting that small changes in the type of interaction that cells have with their local cellular environment can lead to very different outcomes for the composition of mosaics. In cell renewal, proliferation of each cell type may depend linearly or nonlinearly on the local proportion of cells of that type, and these two possibilities produce very different patterns. We study two variations of a cellular automaton model based on simple rules for renewal. We then propose an integrodifferential equation model, and again consider two different forms of cellular interaction. The results of the continuous and cellular automata models are qualitatively the same, and we observe that changes in local environment interaction affect the dynamics for both. Furthermore, we demonstrate that the models reproduce some of the patterns seen in actual mosaic tissues. In particular, our results suggest that the differing patterns seen in organ parenchymas may be driven purely by the process of cell replacement under different interaction scenarios. PMID:20375040

Unary probabilistic and quantum automata on promise problems

NASA Astrophysics Data System (ADS)

Gainutdinova, Aida; Yakaryılmaz, Abuzer

2018-02-01

We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error unary QFAs are more powerful than bounded-error unary PFAs, and, contrary to the binary language case, the computational power of Las-Vegas QFAs and bounded-error PFAs is equivalent to the computational power of deterministic finite automata (DFAs). Then, we present a new family of unary promise problems defined with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.

A comparative analysis of electronic and molecular quantum dot cellular automata

DOE Office of Scientific and Technical Information (OSTI.GOV)

Umamahesvari, H., E-mail: umamaheswarihema@gmail.com, E-mail: ajithavijay1@gmail.com; Ajitha, D., E-mail: umamaheswarihema@gmail.com, E-mail: ajithavijay1@gmail.com

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

Design of Efficient Mirror Adder in Quantum- Dot Cellular Automata

NASA Astrophysics Data System (ADS)

Mishra, Prashant Kumar; Chattopadhyay, Manju K.

2018-03-01

Lower power consumption is an essential demand for portable multimedia system using digital signal processing algorithms and architectures. Quantum dot cellular automata (QCA) is a rising nano technology for the development of high performance ultra-dense low power digital circuits. QCA based several efficient binary and decimal arithmetic circuits are implemented, however important improvements are still possible. This paper demonstrate Mirror Adder circuit design in QCA. We present comparative study of mirror adder cells designed using conventional CMOS technique and mirror adder cells designed using quantum-dot cellular automata. QCA based mirror adders are better in terms of area by order of three.

Simulation of interdiffusion and voids growth based on cellular automata

NASA Astrophysics Data System (ADS)

Zhang, Fan; Zhang, Boyan; Zhang, Nan; Du, Haishun; Zhang, Xinhong

2017-02-01

In the interdiffusion of two solid-state materials, if the diffusion coefficients of the two materials are not the same, the interface of the two materials will shift to the material with the lower diffusion coefficient. This effect is known as the Kirkendall effect. The Kirkendall effect leads to Kirkendall porosity. The pores act as sinks for vacancies and become voids. In this paper, the movement of the Kirkendall plane at interdiffusion is simulated based on cellular automata. The number of vacancies, the critical radius of voids nucleation and the nucleation rate are analysed. The vacancies diffusion, vacancies aggregation and voids growth are also simulated based on cellular automata.

Cellular Automata Ideas in Digital Circuits and Switching Theory.

ERIC Educational Resources Information Center

Siwak, Pawel P.

1985-01-01

Presents two examples which illustrate the usefulness of ideas from cellular automata. First, Lee's algorithm is recalled and its cellular nature shown. Then a problem from digraphs, which has arisen from analyzing predecessing configurations in the famous Conway's "game of life," is considered. (Author/JN)

Cellular Automata and the Humanities.

ERIC Educational Resources Information Center

Gallo, Ernest

1994-01-01

The use of cellular automata to analyze several pre-Socratic hypotheses about the evolution of the physical world is discussed. These hypotheses combine characteristics of both rigorous and metaphoric language. Since the computer demands explicit instructions for each step in the evolution of the automaton, such models can reveal conceptual…

Cellular automata with object-oriented features for parallel molecular network modeling.

PubMed

Zhu, Hao; Wu, Yinghui; Huang, Sui; Sun, Yan; Dhar, Pawan

2005-06-01

Cellular automata are an important modeling paradigm for studying the dynamics of large, parallel systems composed of multiple, interacting components. However, to model biological systems, cellular automata need to be extended beyond the large-scale parallelism and intensive communication in order to capture two fundamental properties characteristic of complex biological systems: hierarchy and heterogeneity. This paper proposes extensions to a cellular automata language, Cellang, to meet this purpose. The extended language, with object-oriented features, can be used to describe the structure and activity of parallel molecular networks within cells. Capabilities of this new programming language include object structure to define molecular programs within a cell, floating-point data type and mathematical functions to perform quantitative computation, message passing capability to describe molecular interactions, as well as new operators, statements, and built-in functions. We discuss relevant programming issues of these features, including the object-oriented description of molecular interactions with molecule encapsulation, message passing, and the description of heterogeneity and anisotropy at the cell and molecule levels. By enabling the integration of modeling at the molecular level with system behavior at cell, tissue, organ, or even organism levels, the program will help improve our understanding of how complex and dynamic biological activities are generated and controlled by parallel functioning of molecular networks. Index Terms-Cellular automata, modeling, molecular network, object-oriented.

Stochastic cellular automata model of cell migration, proliferation and differentiation: validation with in vitro cultures of muscle satellite cells.

PubMed

Garijo, N; Manzano, R; Osta, R; Perez, M A

2012-12-07

Cell migration and proliferation has been modelled in the literature as a process similar to diffusion. However, using diffusion models to simulate the proliferation and migration of cells tends to create a homogeneous distribution in the cell density that does not correlate to empirical observations. In fact, the mechanism of cell dispersal is not diffusion. Cells disperse by crawling or proliferation, or are transported in a moving fluid. The use of cellular automata, particle models or cell-based models can overcome this limitation. This paper presents a stochastic cellular automata model to simulate the proliferation, migration and differentiation of cells. These processes are considered as completely stochastic as well as discrete. The model developed was applied to predict the behaviour of in vitro cell cultures performed with adult muscle satellite cells. Moreover, non homogeneous distribution of cells has been observed inside the culture well and, using the above mentioned stochastic cellular automata model, we have been able to predict this heterogeneous cell distribution and compute accurate quantitative results. Differentiation was also incorporated into the computational simulation. The results predicted the myotube formation that typically occurs with adult muscle satellite cells. In conclusion, we have shown how a stochastic cellular automata model can be implemented and is capable of reproducing the in vitro behaviour of adult muscle satellite cells. Copyright © 2012 Elsevier Ltd. All rights reserved.

Design of automata theory of cubical complexes with applications to diagnosis and algorithmic description

NASA Technical Reports Server (NTRS)

Roth, J. P.

1972-01-01

Methods for development of logic design together with algorithms for failure testing, a method for design of logic for ultra-large-scale integration, extension of quantum calculus to describe the functional behavior of a mechanism component-by-component and to computer tests for failures in the mechanism using the diagnosis algorithm, and the development of an algorithm for the multi-output 2-level minimization problem are discussed.

Quantum-dot cellular automata: Review and recent experiments (invited)

NASA Astrophysics Data System (ADS)

Snider, G. L.; Orlov, A. O.; Amlani, I.; Zuo, X.; Bernstein, G. H.; Lent, C. S.; Merz, J. L.; Porod, W.

1999-04-01

An introduction to the operation of quantum-dot cellular automata is presented, along with recent experimental results. Quantum-dot cellular automata (QCA) is a transistorless computation paradigm that addresses the issues of device density and interconnection. The basic building blocks of the QCA architecture, such as AND, OR, and NOT are presented. The experimental device is a four-dot QCA cell with two electrometers. The dots are metal islands, which are coupled by capacitors and tunnel junctions. An improved design of the cell is presented in which all four dots of the cell are coupled by tunnel junctions. The operation of this basic cell is confirmed by the externally controlled polarization change of the cell.

Fuzzy cellular automata models in immunology

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ahmed, E.

1996-10-01

The self-nonself character of antigens is considered to be fuzzy. The Chowdhury et al. cellular automata model is generalized accordingly. New steady states are found. The first corresponds to a below-normal help and suppression and is proposed to be related to autoimmune diseases. The second corresponds to a below-normal B-cell level.

A cellular automata model of land cover change to integrate urban growth with open space conservation

EPA Science Inventory

The preservation of riparian zones and other environmentally sensitive areas has long been recognized as one of the most cost-effective methods of managing stormwater and providing a broad range of ecosystem services. In this research, a cellular automata (CA)—Markov chain model ...

Discovering Motifs in Biological Sequences Using the Micron Automata Processor.

PubMed

Roy, Indranil; Aluru, Srinivas

2016-01-01

Finding approximately conserved sequences, called motifs, across multiple DNA or protein sequences is an important problem in computational biology. In this paper, we consider the (l, d) motif search problem of identifying one or more motifs of length l present in at least q of the n given sequences, with each occurrence differing from the motif in at most d substitutions. The problem is known to be NP-complete, and the largest solved instance reported to date is (26,11). We propose a novel algorithm for the (l,d) motif search problem using streaming execution over a large set of non-deterministic finite automata (NFA). This solution is designed to take advantage of the micron automata processor, a new technology close to deployment that can simultaneously execute multiple NFA in parallel. We demonstrate the capability for solving much larger instances of the (l, d) motif search problem using the resources available within a single automata processor board, by estimating run-times for problem instances (39,18) and (40,17). The paper serves as a useful guide to solving problems using this new accelerator technology.

On the derivation of approximations to cellular automata models and the assumption of independence.

PubMed

Davies, K J; Green, J E F; Bean, N G; Binder, B J; Ross, J V

2014-07-01

Cellular automata are discrete agent-based models, generally used in cell-based applications. There is much interest in obtaining continuum models that describe the mean behaviour of the agents in these models. Previously, continuum models have been derived for agents undergoing motility and proliferation processes, however, these models only hold under restricted conditions. In order to narrow down the reason for these restrictions, we explore three possible sources of error in deriving the model. These sources are the choice of limiting arguments, the use of a discrete-time model as opposed to a continuous-time model and the assumption of independence between the state of sites. We present a rigorous analysis in order to gain a greater understanding of the significance of these three issues. By finding a limiting regime that accurately approximates the conservation equation for the cellular automata, we are able to conclude that the inaccuracy between our approximation and the cellular automata is completely based on the assumption of independence. Copyright © 2014 Elsevier Inc. All rights reserved.

Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information.

PubMed

Liu, Desheng; Huang, Zhiping; Zhang, Yimeng; Guo, Xiaojun; Su, Shaojing

2016-01-01

Obtaining a minimal automaton is a fundamental issue in the theory and practical implementation of deterministic finite automatons (DFAs). A minimization algorithm is presented in this paper that consists of two main phases. In the first phase, the backward depth information is built, and the state set of the DFA is partitioned into many blocks. In the second phase, the state set is refined using a hash table. The minimization algorithm has a lower time complexity O(n) than a naive comparison of transitions O(n2). Few states need to be refined by the hash table, because most states have been partitioned by the backward depth information in the coarse partition. This method achieves greater generality than previous methods because building the backward depth information is independent of the topological complexity of the DFA. The proposed algorithm can be applied not only to the minimization of acyclic automata or simple cyclic automata, but also to automata with high topological complexity. Overall, the proposal has three advantages: lower time complexity, greater generality, and scalability. A comparison to Hopcroft's algorithm demonstrates experimentally that the algorithm runs faster than traditional algorithms.

Regulation Effects by Programmed Molecules for Transcription-Based Diagnostic Automata towards Therapeutic Use

NASA Astrophysics Data System (ADS)

Hirabayashi, Miki; Ohashi, Hirotada; Kubo, Tai

We have presented experimental analysis on the controllability of our transcription-based diagnostic biomolecular automata by programmed molecules. Focusing on the noninvasive transcriptome diagnosis by salivary mRNAs, we already proposed the novel concept of diagnostic device using DNA computation. This system consists of the main computational element which has a stem shaped promoter region and a pseudo-loop shaped read-only memory region for transcription regulation through the conformation change caused by the recognition of disease-related biomarkers. We utilize the transcription of malachite green aptamer sequence triggered by the target recognition for observation of detection. This algorithm makes it possible to release RNA-aptamer drugs multiply, different from the digestion-based systems by the restriction enzyme which was proposed previously, for the in-vivo use, however, the controllability of aptamer release is not enough at the previous stage. In this paper, we verified the regulation effect on aptamer transcription by programmed molecules in basic conditions towards the developm! ent of therapeutic automata. These results would bring us one step closer to the realization of new intelligent diagnostic and therapeutic automata based on molecular circuits.

Solving multiconstraint assignment problems using learning automata.

PubMed

Horn, Geir; Oommen, B John

2010-02-01

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

Molecular Magnetic Quantum Cellular Automata

DTIC Science & Technology

2004-06-01

Folting K, Gatteschi D, Christou G, Hendrickson D N 1993a, High-Spin Molecules - [Mn12O12(O2CR)16(H2O)4], J. Am. Chem. Soc. 115 1804 Sessoli R... Gatteschi D, Caneschi A and Novak M A 1993b, Magnetic bistability in a metal-ion cluster, Nature 365 141 Twamely J 2003, Quantum-cellular-automata

Stimulus-Response Theory of Finite Automata, Technical Report No. 133.

ERIC Educational Resources Information Center

Suppes, Patrick

The central aim of this paper and its projected successors is to prove in detail that stimulus-response theory, or at least a mathematically precise version, can give an account of the learning of many phrase-structure grammars. Section 2 is concerned with standard notions of finite and probabilistic automata. An automaton is defined as a device…

A Methodology to Assess the Benefit of Operational or Tactic Adjustments to Reduce Marine Corps Fuel Consumption

DTIC Science & Technology

2015-12-01

simulation M777A2 howitzer MAGTF Marine Air-Ground Task Force MANA Map Aware Non-Uniform Automata MCWL Marine Corps Warfighting Lab MEB Marine...met. The project developed a Map Aware Non-Uniform Automata (MANA) model for each SPMAGTF size. The MANA models simulated the maneuver and direct

Is there more to communications technology than just information transfer

NASA Astrophysics Data System (ADS)

Kaltschmidt, H.

1980-02-01

In the present paper, communications is discussed in terms of information transfer among people, among automata, and among people and automata. Communications is treated as a cybernetics problem involving information sources and sinks. The principal signals and components of a communications system are examined, along with frequency- and time-multiplexing, optimal detection, correlators, etc.

Minimal entropy approximation for cellular automata

NASA Astrophysics Data System (ADS)

Fukś, Henryk

2014-02-01

We present a method for the construction of approximate orbits of measures under the action of cellular automata which is complementary to the local structure theory. The local structure theory is based on the idea of Bayesian extension, that is, construction of a probability measure consistent with given block probabilities and maximizing entropy. If instead of maximizing entropy one minimizes it, one can develop another method for the construction of approximate orbits, at the heart of which is the iteration of finite-dimensional maps, called minimal entropy maps. We present numerical evidence that the minimal entropy approximation sometimes outperforms the local structure theory in characterizing the properties of cellular automata. The density response curve for elementary CA rule 26 is used to illustrate this claim.

Optimal placement of fast cut back units based on the theory of cellular automata and agent

NASA Astrophysics Data System (ADS)

Yan, Jun; Yan, Feng

2017-06-01

The thermal power generation units with the function of fast cut back could serve power for auxiliary system and keep island operation after a major blackout, so they are excellent substitute for the traditional black-start power sources. Different placement schemes for FCB units have different influence on the subsequent restoration process. Considering the locality of the emergency dispatching rules, the unpredictability of specific dispatching instructions and unexpected situations like failure of transmission line energization, a novel deduction model for network reconfiguration based on the theory of cellular automata and agent is established. Several indexes are then defined for evaluating the placement schemes for FCB units. The attribute weights determination method based on subjective and objective integration and grey relational analysis are combinatorically used to determine the optimal placement scheme for FCB unit. The effectiveness of the proposed method is validated by the test results on the New England 10-unit 39-bus power system.

Using learning automata to determine proper subset size in high-dimensional spaces

NASA Astrophysics Data System (ADS)

Seyyedi, Seyyed Hossein; Minaei-Bidgoli, Behrouz

2017-03-01

In this paper, we offer a new method called FSLA (Finding the best candidate Subset using Learning Automata), which combines the filter and wrapper approaches for feature selection in high-dimensional spaces. Considering the difficulties of dimension reduction in high-dimensional spaces, FSLA's multi-objective functionality is to determine, in an efficient manner, a feature subset that leads to an appropriate tradeoff between the learning algorithm's accuracy and efficiency. First, using an existing weighting function, the feature list is sorted and selected subsets of the list of different sizes are considered. Then, a learning automaton verifies the performance of each subset when it is used as the input space of the learning algorithm and estimates its fitness upon the algorithm's accuracy and the subset size, which determines the algorithm's efficiency. Finally, FSLA introduces the fittest subset as the best choice. We tested FSLA in the framework of text classification. The results confirm its promising performance of attaining the identified goal.

Exact results of 1D traffic cellular automata: The low-density behavior of the Fukui-Ishibashi model

NASA Astrophysics Data System (ADS)

Salcido, Alejandro; Hernández-Zapata, Ernesto; Carreón-Sierra, Susana

2018-03-01

The maximum entropy states of the cellular automata models for traffic flow in a single-lane with no anticipation are presented and discussed. The exact analytical solutions for the low-density behavior of the stochastic Fukui-Ishibashi traffic model were obtained and compared with computer simulations of the model. An excellent agreement was found.

A stochastic cellular automata model of tautomer equilibria

NASA Astrophysics Data System (ADS)

Bowers, Gregory A.; Seybold, Paul G.

2018-03-01

Many chemical substances, including drugs and biomolecules, exist in solution not as a single species, but as a collection of tautomers and related species. Importantly, each of these species is an independent compoundwith its own specific biochemical and physicochemical properties. The species interconvert in a dynamic and often complicated manner, making modelling the overall species composition difficult. Agent-based cellular automata models are uniquely suited to meet this challenge, allowing the equilibria to be simulated using simple rulesand at the same time capturing the inherent stochasticity of the natural phenomenon. In the present example a stochastic cellular automata model is employed to simulate the tautomer equilibria of 9-anthrone and 9-anthrol in the presence of their common anion. The observed KE of the 9-anthrone ⇌ 9-anthrol tautomerisation along with the measured tautomer pKa values were used to model the equilibria at pH values 4, 7 and 10. At pH 4 and 7, the anthrone comprises >99% of the total species population, while at pH 10the anthrone and the anion each represent just under half of the total population. The advantages of the cellular automata approach over the customary coupled differential equation approach are discussed.

Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information

PubMed Central

Liu, Desheng; Huang, Zhiping; Zhang, Yimeng; Guo, Xiaojun; Su, Shaojing

2016-01-01

Obtaining a minimal automaton is a fundamental issue in the theory and practical implementation of deterministic finite automatons (DFAs). A minimization algorithm is presented in this paper that consists of two main phases. In the first phase, the backward depth information is built, and the state set of the DFA is partitioned into many blocks. In the second phase, the state set is refined using a hash table. The minimization algorithm has a lower time complexity O(n) than a naive comparison of transitions O(n2). Few states need to be refined by the hash table, because most states have been partitioned by the backward depth information in the coarse partition. This method achieves greater generality than previous methods because building the backward depth information is independent of the topological complexity of the DFA. The proposed algorithm can be applied not only to the minimization of acyclic automata or simple cyclic automata, but also to automata with high topological complexity. Overall, the proposal has three advantages: lower time complexity, greater generality, and scalability. A comparison to Hopcroft’s algorithm demonstrates experimentally that the algorithm runs faster than traditional algorithms. PMID:27806102

Failover in Cellular Automata

NASA Astrophysics Data System (ADS)

Kumar, Shailesh; Rao, Shrisha

This paper studies a phenomenon called failover, and shows that this phenomenon (in particular, stateless failover) can be modeled by Game of Life cellular automata. This is the first time that this sophisticated real-life system behavior has been modeled in abstract terms. 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 the 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.

The Neurona at Home project: Simulating a large-scale cellular automata brain in a distributed computing environment

NASA Astrophysics Data System (ADS)

Acedo, L.; Villanueva-Oller, J.; Moraño, J. A.; Villanueva, R.-J.

2013-01-01

The Berkeley Open Infrastructure for Network Computing (BOINC) has become the standard open source solution for grid computing in the Internet. Volunteers use their computers to complete an small part of the task assigned by a dedicated server. We have developed a BOINC project called Neurona@Home whose objective is to simulate a cellular automata random network with, at least, one million neurons. We consider a cellular automata version of the integrate-and-fire model in which excitatory and inhibitory nodes can activate or deactivate neighbor nodes according to a set of probabilistic rules. Our aim is to determine the phase diagram of the model and its behaviour and to compare it with the electroencephalographic signals measured in real brains.

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

NASA Technical Reports Server (NTRS)

Margaria, Tiziana (Inventor); Hinchey, Michael G. (Inventor); Rouff, Christopher A. (Inventor); Rash, James L. (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.

Functional test generation for digital circuits described with a declarative language: LUSTRE

NASA Astrophysics Data System (ADS)

Almahrous, Mazen

1990-08-01

A functional approach to the test generation problem starting from a high level description is proposed. The circuit tested is modeled, using the LUSTRE high level data flow description language. The different LUSTRE primitives are translated to a SATAN format graph in order to evaluate the testability of the circuit and to generate test sequences. Another method of testing the complex circuits comprising an operative part and a control part is defined. It consists of checking experiments for the control part observed through the operative part. It was applied to the automata generated from a LUSTRE description of the circuit.

An Automaton Analysis of the Learning of a Miniature System of Japanese. Psychology Series.

ERIC Educational Resources Information Center

Wexler, Kenneth Norman

The purpose of the study reported here was to do an automata-theoretical and experimental investigation of the learning of the syntax and semantics of a second natural language. The main thrust of the work was to ask what kind of automaton a person can become. Various kinds of automata were considered, predictions were made from them, and these…

Energy dissipation dataset for reversible logic gates in quantum dot-cellular automata.

PubMed

Bahar, Ali Newaz; Rahman, Mohammad Maksudur; Nahid, Nur Mohammad; Hassan, Md Kamrul

2017-02-01

This paper presents an energy dissipation dataset of different reversible logic gates in quantum-dot cellular automata. The proposed circuits have been designed and verified using QCADesigner simulator. Besides, the energy dissipation has been calculated under three different tunneling energy level at temperature T =2 K. For estimating the energy dissipation of proposed gates; QCAPro tool has been employed.

Specialized Silicon Compilers for Language Recognition.

DTIC Science & Technology

1984-07-01

realizations of non-deterministic automata have been reported that solve these problems in diffierent ways. Floyd and Ullman [ 281 have presented a...in Applied Mathematics, pages 19-31. American Mathematical Society, 1967. [ 281 Floyd, R. W. and J. D. Ullman. The Compilation of Regular Expressions...Shannon (editor). Automata Studies, chapter 1, pages 3-41. Princeton University Press, Princeton. N. J., 1956. [44] Kohavi, Zwi . Switching and Finite

Simulations of Forest Fires by the Cellular Automata Model "ABBAMPAU"

NASA Astrophysics Data System (ADS)

di Gregorio, S.; Bendicenti, E.

2003-04-01

Forest fires represent a serious environmental problem, whose negative impact is becoming day by day more worrisome. Forest fires are very complex phenomena; that need an interdisciplinary approach. The adopted method to modelling involves the definition of local rules, from which the global behaviour of the system can emerge. The paradigm of Cellular Automata was applied and the model ABBAMPAU was projected to simulate the evolution of forest fires. Cellular Automata features (parallelism and a-centrism) seem to match the system "forest fire"; the parameters, describing globally a forest fire, i.e. propagation rate, flame length and direction, fireline intensity, fire duration time et c. are mainly depending on some local characteristics i.e. vegetation type (live and dead fuel), relative humidity, fuel moisture, heat, territory morphology (altitude, slope), et c.. The only global characteristic is given by wind velocity and direction, but wind velocity and direction is locally altered according to the morphology; therefore wind has also to be considered at local level. ABBAMPAU accounts for the following aspects of the phenomenon: effects of combustion in surface and crown fire inside the cell, crown fire triggering off; surface and crown fire spread, determination of the local wind rate and direction. A validation of ABBAMPAU was tested on a real case of forest fire, in the territory of Villaputzu, Sardinia island, August 22nd, 1998. First simulations account for the main characteristics of the phenomenon and agree with the observations. The results show that the model could be applied for the forest fire preventions, the productions of risk scenarios and the evaluation of the forest fire environmental impact.

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

PubMed

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.

Canalization and Control in Automata Networks: Body Segmentation in Drosophila melanogaster

PubMed Central

Marques-Pita, Manuel; Rocha, Luis M.

2013-01-01

We present schema redescription as a methodology to characterize canalization in automata networks used to model biochemical regulation and signalling. In our formulation, canalization becomes synonymous with redundancy present in the logic of automata. This results in straightforward measures to quantify canalization in an automaton (micro-level), which is in turn integrated into a highly scalable framework to characterize the collective dynamics of large-scale automata networks (macro-level). This way, our approach provides a method to link micro- to macro-level dynamics – a crux of complexity. Several new results ensue from this methodology: uncovering of dynamical modularity (modules in the dynamics rather than in the structure of networks), identification of minimal conditions and critical nodes to control the convergence to attractors, simulation of dynamical behaviour from incomplete information about initial conditions, and measures of macro-level canalization and robustness to perturbations. We exemplify our methodology with a well-known model of the intra- and inter cellular genetic regulation of body segmentation in Drosophila melanogaster. We use this model to show that our analysis does not contradict any previous findings. But we also obtain new knowledge about its behaviour: a better understanding of the size of its wild-type attractor basin (larger than previously thought), the identification of novel minimal conditions and critical nodes that control wild-type behaviour, and the resilience of these to stochastic interventions. Our methodology is applicable to any complex network that can be modelled using automata, but we focus on biochemical regulation and signalling, towards a better understanding of the (decentralized) control that orchestrates cellular activity – with the ultimate goal of explaining how do cells and tissues ‘compute’. PMID:23520449

Canalization and control in automata networks: body segmentation in Drosophila melanogaster.

PubMed

Marques-Pita, Manuel; Rocha, Luis M

2013-01-01

We present schema redescription as a methodology to characterize canalization in automata networks used to model biochemical regulation and signalling. In our formulation, canalization becomes synonymous with redundancy present in the logic of automata. This results in straightforward measures to quantify canalization in an automaton (micro-level), which is in turn integrated into a highly scalable framework to characterize the collective dynamics of large-scale automata networks (macro-level). This way, our approach provides a method to link micro- to macro-level dynamics--a crux of complexity. Several new results ensue from this methodology: uncovering of dynamical modularity (modules in the dynamics rather than in the structure of networks), identification of minimal conditions and critical nodes to control the convergence to attractors, simulation of dynamical behaviour from incomplete information about initial conditions, and measures of macro-level canalization and robustness to perturbations. We exemplify our methodology with a well-known model of the intra- and inter cellular genetic regulation of body segmentation in Drosophila melanogaster. We use this model to show that our analysis does not contradict any previous findings. But we also obtain new knowledge about its behaviour: a better understanding of the size of its wild-type attractor basin (larger than previously thought), the identification of novel minimal conditions and critical nodes that control wild-type behaviour, and the resilience of these to stochastic interventions. Our methodology is applicable to any complex network that can be modelled using automata, but we focus on biochemical regulation and signalling, towards a better understanding of the (decentralized) control that orchestrates cellular activity--with the ultimate goal of explaining how do cells and tissues 'compute'.

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

NASA Astrophysics Data System (ADS)

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.

Design of Improved Arithmetic Logic Unit in Quantum-Dot Cellular Automata

NASA Astrophysics Data System (ADS)

Heikalabad, Saeed Rasouli; Gadim, Mahya Rahimpour

2018-06-01

The quantum-dot cellular automata (QCA) can be replaced to overcome the limitation of CMOS technology. An arithmetic logic unit (ALU) is a basic structure of any computer devices. In this paper, design of improved single-bit arithmetic logic unit in quantum dot cellular automata is presented. The proposed structure for ALU has AND, OR, XOR and ADD operations. A unique 2:1 multiplexer, an ultra-efficient two-input XOR and a low complexity full adder are used in the proposed structure. Also, an extended design of this structure is provided for two-bit ALU in this paper. The proposed structure of ALU is simulated by QCADesigner and simulation result is evaluated. Evaluation results show that the proposed design has best performance in terms of area, complexity and delay compared to the previous designs.

A mission operations architecture for the 21st century

NASA Technical Reports Server (NTRS)

Tai, W.; Sweetnam, D.

1996-01-01

An operations architecture is proposed for low cost missions beyond the year 2000. The architecture consists of three elements: a service based architecture; a demand access automata; and distributed science hubs. The service based architecture is based on a set of standard multimission services that are defined, packaged and formalized by the deep space network and the advanced multi-mission operations system. The demand access automata is a suite of technologies which reduces the need to be in contact with the spacecraft, and thus reduces operating costs. The beacon signaling, the virtual emergency room, and the high efficiency tracking automata technologies are described. The distributed science hubs provide information system capabilities to the small science oriented flight teams: individual access to all traditional mission functions and services; multimedia intra-team communications, and automated direct transparent communications between the scientists and the instrument.

Design of Improved Arithmetic Logic Unit in Quantum-Dot Cellular Automata

NASA Astrophysics Data System (ADS)

Heikalabad, Saeed Rasouli; Gadim, Mahya Rahimpour

2018-03-01

The quantum-dot cellular automata (QCA) can be replaced to overcome the limitation of CMOS technology. An arithmetic logic unit (ALU) is a basic structure of any computer devices. In this paper, design of improved single-bit arithmetic logic unit in quantum dot cellular automata is presented. The proposed structure for ALU has AND, OR, XOR and ADD operations. A unique 2:1 multiplexer, an ultra-efficient two-input XOR and a low complexity full adder are used in the proposed structure. Also, an extended design of this structure is provided for two-bit ALU in this paper. The proposed structure of ALU is simulated by QCADesigner and simulation result is evaluated. Evaluation results show that the proposed design has best performance in terms of area, complexity and delay compared to the previous designs.

Simulation of elastic wave propagation using cellular automata and peridynamics, and comparison with experiments

DOE PAGES

Nishawala, Vinesh V.; Ostoja-Starzewski, Martin; Leamy, Michael J.; ...

2015-09-10

Peridynamics is a non-local continuum mechanics formulation that can handle spatial discontinuities as the governing equations are integro-differential equations which do not involve gradients such as strains and deformation rates. This paper employs bond-based peridynamics. Cellular Automata is a local computational method which, in its rectangular variant on interior domains, is mathematically equivalent to the central difference finite difference method. However, cellular automata does not require the derivation of the governing partial differential equations and provides for common boundary conditions based on physical reasoning. Both methodologies are used to solve a half-space subjected to a normal load, known as Lamb’smore » Problem. The results are compared with theoretical solution from classical elasticity and experimental results. Furthermore, this paper is used to validate our implementation of these methods.« less

MSuPDA: A Memory Efficient Algorithm for Sequence Alignment.

PubMed

Khan, Mohammad Ibrahim; Kamal, Md Sarwar; Chowdhury, Linkon

2016-03-01

Space complexity is a million dollar question in DNA sequence alignments. In this regard, memory saving under pushdown automata can help to reduce the occupied spaces in computer memory. Our proposed process is that anchor seed (AS) will be selected from given data set of nucleotide base pairs for local sequence alignment. Quick splitting techniques will separate the AS from all the DNA genome segments. Selected AS will be placed to pushdown automata's (PDA) input unit. Whole DNA genome segments will be placed into PDA's stack. AS from input unit will be matched with the DNA genome segments from stack of PDA. Match, mismatch and indel of nucleotides will be popped from the stack under the control unit of pushdown automata. During the POP operation on stack, it will free the memory cell occupied by the nucleotide base pair.

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

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tsukerblat, Boris, E-mail: tsuker@bgu.ac.il, E-mail: andrew.palii@uv.es; Palii, Andrew, E-mail: tsuker@bgu.ac.il, E-mail: andrew.palii@uv.es; Clemente-Juan, Juan Modesto

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 accountmore » the two relevant electron transfer processes (through the side and through the diagonal of the square) as well as the difference in Coulomb energies for different instant positions of localization of the hole pair. The combined Jahn-Teller (JT) and pseudo JT vibronic coupling is treated within the conventional Piepho-Krauzs-Schatz model adapted to a bi-electronic MV species with the square-planar topology. The adiabatic potentials are evaluated for the low lying Coulomb levels in which the antipodal sites are occupied, the case just actual for utilization in mQCA. The conditions for the vibronic self-trapping in spin-singlet and spin-triplet states are revealed in terms of the two actual transfer pathways parameters and the strength of the vibronic coupling. Spin related effects in degrees of the localization which are found for spin-singlet and spin-triplet states are discussed. The polarization of the cell is evaluated and we demonstrate how the partial delocalization caused by the joint action of the vibronic coupling and electron transfer processes influences polarization of a four-dot cell. The results obtained within the adiabatic approach are compared with those based on the numerical solution of the dynamic vibronic problem. Finally, the Coulomb interaction between the cells is considered and the influence of the vibronic coupling on the shape on the non-linear cell-cell response function is revealed.« less

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

PubMed

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

2015-10-07

Our interest in this article is prompted by the vibronic problem of charge polarized states in the four-dot molecular quantum cellular automata (mQCA), a paradigm for nanoelectronics, in which binary information is encoded in charge configuration of the mQCA cell. Here, we report the evaluation of the electronic levels and adiabatic potentials of mixed-valence (MV) tetra-ruthenium (2Ru(ii) + 2Ru(iii)) derivatives (assembled as two coupled Creutz-Taube complexes) for which molecular implementations of quantum cellular automata (QCA) was proposed. The cell based on this molecule includes two holes shared among four spinless sites and correspondingly we employ the model which takes into account the two relevant electron transfer processes (through the side and through the diagonal of the square) as well as the difference in Coulomb energies for different instant positions of localization of the hole pair. The combined Jahn-Teller (JT) and pseudo JT vibronic coupling is treated within the conventional Piepho-Krauzs-Schatz model adapted to a bi-electronic MV species with the square-planar topology. The adiabatic potentials are evaluated for the low lying Coulomb levels in which the antipodal sites are occupied, the case just actual for utilization in mQCA. The conditions for the vibronic self-trapping in spin-singlet and spin-triplet states are revealed in terms of the two actual transfer pathways parameters and the strength of the vibronic coupling. Spin related effects in degrees of the localization which are found for spin-singlet and spin-triplet states are discussed. The polarization of the cell is evaluated and we demonstrate how the partial delocalization caused by the joint action of the vibronic coupling and electron transfer processes influences polarization of a four-dot cell. The results obtained within the adiabatic approach are compared with those based on the numerical solution of the dynamic vibronic problem. Finally, the Coulomb interaction between the cells is considered and the influence of the vibronic coupling on the shape on the non-linear cell-cell response function is revealed.

Sociable Interfaces

DTIC Science & Technology

2005-01-01

Interface Compatibility); the tool is written in Ocaml [10], and the symbolic algorithms for interface compatibility and refinement are built on top...automata for a fire detection and reporting system. be encoded in the input language of the tool TIC. The refinement of sociable interfaces is discussed...are closely related to the I/O Automata Language (IOA) of [11]. Interface models are games between Input and Output, and in the models, it is es

Cellular automata in photonic cavity arrays.

PubMed

Li, Jing; Liew, T C H

2016-10-31

We propose theoretically a photonic Turing machine based on cellular automata in arrays of nonlinear cavities coupled with artificial gauge fields. The state of the system is recorded making use of the bistability of driven cavities, in which losses are fully compensated by an external continuous drive. The sequential update of the automaton layers is achieved automatically, by the local switching of bistable states, without requiring any additional synchronization or temporal control.

Field validation of a free-agent cellular automata model of fire spread with fire–atmosphere coupling

Treesearch

Gary Achtemeier

2012-01-01

A cellular automata fire model represents ‘elements’ of fire by autonomous agents. A few simple algebraic expressions substituted for complex physical and meteorological processes and solved iteratively yield simulations for ‘super-diffusive’ fire spread and coupled surface-layer (2-m) fire–atmosphere processes. Pressure anomalies, which are integrals of the thermal...

A class of cellular automata modeling winnerless competition

NASA Astrophysics Data System (ADS)

Afraimovich, V.; Ordaz, F. C.; Urías, J.

2002-06-01

Neural units introduced by Rabinovich et al. ("Sensory coding with dynamically competitive networks," UCSD and CIT, February 1999) motivate a class of cellular automata (CA) where spatio-temporal encoding is feasible. The spatio-temporal information capacity of a CA is estimated by the information capacity of the attractor set, which happens to be finitely specified. Two-dimensional CA are studied in detail. An example is given for which the attractor is not a subshift.

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

PubMed

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

2013-11-07

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

An image encryption algorithm based on 3D cellular automata and chaotic maps

NASA Astrophysics Data System (ADS)

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

2015-05-01

A novel encryption algorithm to cipher digital images is presented in this work. The digital image is rendering into a three-dimensional (3D) lattice and the protocol consists of two phases: the confusion phase where 24 chaotic Cat maps are applied and the diffusion phase where a 3D cellular automata is evolved. The encryption method is shown to be secure against the most important cryptanalytic attacks.

Modelling Team Adversarial Actions in UAV Operations

DTIC Science & Technology

2007-11-01

support for the dynamic creation and destruction of entities is the history dependent automata ( HDA ) [9] which evolved from an algorithmic structure for...checking bi-similarity of π- calculus agents. The authors define HDA as automata which perform actions that can carry information generated in the...past history of the system. The states, transitions and labels of the HDA are enriched with sets of local names. Thus, each transition can refer to the

Local numerical modelling of ultrasonic guided waves in linear and nonlinear media

NASA Astrophysics Data System (ADS)

Packo, Pawel; Radecki, Rafal; Kijanka, Piotr; Staszewski, Wieslaw J.; Uhl, Tadeusz; Leamy, Michael J.

2017-04-01

Nonlinear ultrasonic techniques provide improved damage sensitivity compared to linear approaches. The combination of attractive properties of guided waves, such as Lamb waves, with unique features of higher harmonic generation provides great potential for characterization of incipient damage, particularly in plate-like structures. Nonlinear ultrasonic structural health monitoring techniques use interrogation signals at frequencies other than the excitation frequency to detect changes in structural integrity. Signal processing techniques used in non-destructive evaluation are frequently supported by modeling and numerical simulations in order to facilitate problem solution. This paper discusses known and newly-developed local computational strategies for simulating elastic waves, and attempts characterization of their numerical properties in the context of linear and nonlinear media. A hybrid numerical approach combining advantages of the Local Interaction Simulation Approach (LISA) and Cellular Automata for Elastodynamics (CAFE) is proposed for unique treatment of arbitrary strain-stress relations. The iteration equations of the method are derived directly from physical principles employing stress and displacement continuity, leading to an accurate description of the propagation in arbitrarily complex media. Numerical analysis of guided wave propagation, based on the newly developed hybrid approach, is presented and discussed in the paper for linear and nonlinear media. Comparisons to Finite Elements (FE) are also discussed.

Potential field cellular automata model for pedestrian flow

NASA Astrophysics Data System (ADS)

Zhang, Peng; Jian, Xiao-Xia; Wong, S. C.; Choi, Keechoo

2012-02-01

This paper proposes a cellular automata model of pedestrian flow that defines a cost potential field, which takes into account the costs of travel time and discomfort, for a pedestrian to move to an empty neighboring cell. The formulation is based on a reconstruction of the density distribution and the underlying physics, including the rule for resolving conflicts, which is comparable to that in the floor field cellular automaton model. However, we assume that each pedestrian is familiar with the surroundings, thereby minimizing his or her instantaneous cost. This, in turn, helps reduce the randomness in selecting a target cell, which improves the existing cellular automata modelings, together with the computational efficiency. In the presence of two pedestrian groups, which are distinguished by their destinations, the cost distribution for each group is magnified due to the strong interaction between the two groups. As a typical phenomenon, the formation of lanes in the counter flow is reproduced.

Three-dimensional cellular automata as a model of a seismic fault

NASA Astrophysics Data System (ADS)

Gálvez, G.; Muñoz, A.

2017-01-01

The Earth's crust is broken into a series of plates, whose borders are the seismic fault lines and it is where most of the earthquakes occur. This plating system can in principle be described by a set of nonlinear coupled equations describing the motion of the plates, its stresses, strains and other characteristics. Such a system of equations is very difficult to solve, and nonlinear parts leads to a chaotic behavior, which is not predictable. In 1989, Bak and Tang presented an earthquake model based on the sand pile cellular automata. The model though simple, provides similar results to those observed in actual earthquakes. In this work the cellular automata in three dimensions is proposed as a best model to approximate a seismic fault. It is noted that the three-dimensional model reproduces similar properties to those observed in real seismicity, especially, the Gutenberg-Richter law.

Modeling of urban growth using cellular automata (CA) optimized by Particle Swarm Optimization (PSO)

NASA Astrophysics Data System (ADS)

Khalilnia, M. H.; Ghaemirad, T.; Abbaspour, R. A.

2013-09-01

In this paper, two satellite images of Tehran, the capital city of Iran, which were taken by TM and ETM+ for years 1988 and 2010 are used as the base information layers to study the changes in urban patterns of this metropolis. The patterns of urban growth for the city of Tehran are extracted in a period of twelve years using cellular automata setting the logistic regression functions as transition functions. Furthermore, the weighting coefficients of parameters affecting the urban growth, i.e. distance from urban centers, distance from rural centers, distance from agricultural centers, and neighborhood effects were selected using PSO. In order to evaluate the results of the prediction, the percent correct match index is calculated. According to the results, by combining optimization techniques with cellular automata model, the urban growth patterns can be predicted with accuracy up to 75 %.

Evolution of Cellular Automata toward a LIFE-Like Rule Guided by 1/ƒ Noise

NASA Astrophysics Data System (ADS)

Ninagawa, Shigeru

There is evidence in favor of a relationship between the presence of 1/ƒ noise and computational universality in cellular automata. To confirm the relationship, we search for two-dimensional cellular automata with a 1/ƒ power spectrum by means of genetic algorithms. The power spectrum is calculated from the evolution of the state of the cell, starting from a random initial configuration. The fitness is estimated by the power spectrum with consideration of the spectral similarity to the 1/ƒ spectrum. The result shows that the rule with the highest fitness over the most runs exhibits a 1/ƒ type spectrum and its transition function and behavior are quite similar to those of the Game of Life, which is known to be a computationally universal cellular automaton. These results support the relationship between the presence of 1/ƒ noise and computational universality.

A dynamically reconfigurable logic cell: from artificial neural networks to quantum-dot cellular automata

NASA Astrophysics Data System (ADS)

Naqvi, Syed Rameez; Akram, Tallha; Iqbal, Saba; Haider, Sajjad Ali; Kamran, Muhammad; Muhammad, Nazeer

2018-02-01

Considering the lack of optimization support for Quantum-dot Cellular Automata, we propose a dynamically reconfigurable logic cell capable of implementing various logic operations by means of artificial neural networks. The cell can be reconfigured to any 2-input combinational logic gate by altering the strength of connections, called weights and biases. We demonstrate how these cells may appositely be organized to perform multi-bit arithmetic and logic operations. The proposed work is important in that it gives a standard implementation of an 8-bit arithmetic and logic unit for quantum-dot cellular automata with minimal area and latency overhead. We also compare the proposed design with a few existing arithmetic and logic units, and show that it is more area efficient than any equivalent available in literature. Furthermore, the design is adaptable to 16, 32, and 64 bit architectures.

MSuPDA: A memory efficient algorithm for sequence alignment.

PubMed

Khan, Mohammad Ibrahim; Kamal, Md Sarwar; Chowdhury, Linkon

2015-01-16

Space complexity is a million dollar question in DNA sequence alignments. In this regards, MSuPDA (Memory Saving under Pushdown Automata) can help to reduce the occupied spaces in computer memory. Our proposed process is that Anchor Seed (AS) will be selected from given data set of Nucleotides base pairs for local sequence alignment. Quick Splitting (QS) techniques will separate the Anchor Seed from all the DNA genome segments. Selected Anchor Seed will be placed to pushdown Automata's (PDA) input unit. Whole DNA genome segments will be placed into PDA's stack. Anchor Seed from input unit will be matched with the DNA genome segments from stack of PDA. Whatever matches, mismatches or Indel, of Nucleotides will be POP from the stack under the control of control unit of Pushdown Automata. During the POP operation on stack it will free the memory cell occupied by the Nucleotide base pair.

Construction of living cellular automata using the Physarum plasmodium

NASA Astrophysics Data System (ADS)

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.

Early warning of illegal development for protected areas by integrating cellular automata with neural networks.

PubMed

Li, Xia; Lao, Chunhua; Liu, Yilun; Liu, Xiaoping; Chen, Yimin; Li, Shaoying; Ai, Bing; He, Zijian

2013-11-30

Ecological security has become a major issue under fast urbanization in China. As the first two cities in this country, Shenzhen and Dongguan issued the ordinance of Eco-designated Line of Control (ELC) to "wire" ecologically important areas for strict protection in 2005 and 2009 respectively. Early warning systems (EWS) are a useful tool for assisting the implementation ELC. In this study, a multi-model approach is proposed for the early warning of illegal development by integrating cellular automata (CA) and artificial neural networks (ANN). The objective is to prevent the ecological risks or catastrophe caused by such development at an early stage. The integrated model is calibrated by using the empirical information from both remote sensing and handheld GPS (global positioning systems). The MAR indicator which is the ratio of missing alarms to all the warnings is proposed for better assessment of the model performance. It is found that the fast urban development has caused significant threats to natural-area protection in the study area. The integration of CA, ANN and GPS provides a powerful tool for describing and predicting illegal development which is in highly non-linear and fragmented forms. The comparison shows that this multi-model approach has much better performances than the single-model approach for the early warning. Compared with the single models of CA and ANN, this integrated multi-model can improve the value of MAR by 65.48% and 5.17% respectively. Copyright © 2013 Elsevier Ltd. All rights reserved.

Origin of Pareto-like spatial distributions in ecosystems.

PubMed

Manor, Alon; Shnerb, Nadav M

2008-12-31

Recent studies of cluster distribution in various ecosystems revealed Pareto statistics for the size of spatial colonies. These results were supported by cellular automata simulations that yield robust criticality for endogenous pattern formation based on positive feedback. We show that this patch statistics is a manifestation of the law of proportionate effect. Mapping the stochastic model to a Markov birth-death process, the transition rates are shown to scale linearly with cluster size. This mapping provides a connection between patch statistics and the dynamics of the ecosystem; the "first passage time" for different colonies emerges as a powerful tool that discriminates between endogenous and exogenous clustering mechanisms. Imminent catastrophic shifts (such as desertification) manifest themselves in a drastic change of the stability properties of spatial colonies.

A note on probabilistic models over strings: the linear algebra approach.

PubMed

Bouchard-Côté, Alexandre

2013-12-01

Probabilistic models over strings have played a key role in developing methods that take into consideration indels as phylogenetically informative events. There is an extensive literature on using automata and transducers on phylogenies to do inference on these probabilistic models, in which an important theoretical question is the complexity of computing the normalization of a class of string-valued graphical models. This question has been investigated using tools from combinatorics, dynamic programming, and graph theory, and has practical applications in Bayesian phylogenetics. In this work, we revisit this theoretical question from a different point of view, based on linear algebra. The main contribution is a set of results based on this linear algebra view that facilitate the analysis and design of inference algorithms on string-valued graphical models. As an illustration, we use this method to give a new elementary proof of a known result on the complexity of inference on the "TKF91" model, a well-known probabilistic model over strings. Compared to previous work, our proving method is easier to extend to other models, since it relies on a novel weak condition, triangular transducers, which is easy to establish in practice. The linear algebra view provides a concise way of describing transducer algorithms and their compositions, opens the possibility of transferring fast linear algebra libraries (for example, based on GPUs), as well as low rank matrix approximation methods, to string-valued inference problems.

A detailed experimental study of a DNA computer with two endonucleases.

PubMed

Sakowski, Sebastian; Krasiński, Tadeusz; Sarnik, Joanna; Blasiak, Janusz; Waldmajer, Jacek; Poplawski, Tomasz

2017-07-14

Great advances in biotechnology have allowed the construction of a computer from DNA. One of the proposed solutions is a biomolecular finite automaton, a simple two-state DNA computer without memory, which was presented by Ehud Shapiro's group at the Weizmann Institute of Science. The main problem with this computer, in which biomolecules carry out logical operations, is its complexity - increasing the number of states of biomolecular automata. In this study, we constructed (in laboratory conditions) a six-state DNA computer that uses two endonucleases (e.g. AcuI and BbvI) and a ligase. We have presented a detailed experimental verification of its feasibility. We described the effect of the number of states, the length of input data, and the nondeterminism on the computing process. We also tested different automata (with three, four, and six states) running on various accepted input words of different lengths such as ab, aab, aaab, ababa, and of an unaccepted word ba. Moreover, this article presents the reaction optimization and the methods of eliminating certain biochemical problems occurring in the implementation of a biomolecular DNA automaton based on two endonucleases.

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

NASA Astrophysics Data System (ADS)

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

2015-03-01

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

Supervisory control of (max,+) automata: extensions towards applications

NASA Astrophysics Data System (ADS)

Lahaye, Sébastien; Komenda, Jan; Boimond, Jean-Louis

2015-12-01

In this paper, supervisory control of (max,+) automata is studied. The synthesis of maximally permissive and just-in-time supervisor, as well as the synthesis of minimally permissive and just-after-time supervisor, are proposed. Results are also specialised to non-decreasing solutions, because only such supervisors can be realised in practice. The inherent issue of rationality raised recently is discussed. An illustration of concepts and results is presented through an example of a flexible manufacturing system.

Query Monitoring and Analysis for Database Privacy - A Security Automata Model Approach

PubMed Central

Kumar, Anand; Ligatti, Jay; Tu, Yi-Cheng

2015-01-01

Privacy and usage restriction issues are important when valuable data are exchanged or acquired by different organizations. Standard access control mechanisms either restrict or completely grant access to valuable data. On the other hand, data obfuscation limits the overall usability and may result in loss of total value. There are no standard policy enforcement mechanisms for data acquired through mutual and copyright agreements. In practice, many different types of policies can be enforced in protecting data privacy. Hence there is the need for an unified framework that encapsulates multiple suites of policies to protect the data. We present our vision of an architecture named security automata model (SAM) to enforce privacy-preserving policies and usage restrictions. SAM analyzes the input queries and their outputs to enforce various policies, liberating data owners from the burden of monitoring data access. SAM allows administrators to specify various policies and enforces them to monitor queries and control the data access. Our goal is to address the problems of data usage control and protection through privacy policies that can be defined, enforced, and integrated with the existing access control mechanisms using SAM. In this paper, we lay out the theoretical foundation of SAM, which is based on an automata named Mandatory Result Automata. We also discuss the major challenges of implementing SAM in a real-world database environment as well as ideas to meet such challenges. PMID:26997936

Modeling biological pathway dynamics with timed automata.

PubMed

Schivo, Stefano; Scholma, Jetse; Wanders, Brend; Urquidi Camacho, Ricardo A; van der Vet, Paul E; Karperien, Marcel; Langerak, Rom; van de Pol, Jaco; Post, Janine N

2014-05-01

Living cells are constantly subjected to a plethora of environmental stimuli that require integration into an appropriate cellular response. This integration takes place through signal transduction events that form tightly interconnected networks. The understanding of these networks requires capturing their dynamics through computational support and models. ANIMO (analysis of Networks with Interactive Modeling) is a tool that enables the construction and exploration of executable models of biological networks, helping to derive hypotheses and to plan wet-lab experiments. The tool is based on the formalism of Timed Automata, which can be analyzed via the UPPAAL model checker. Thanks to Timed Automata, we can provide a formal semantics for the domain-specific language used to represent signaling networks. This enforces precision and uniformity in the definition of signaling pathways, contributing to the integration of isolated signaling events into complex network models. We propose an approach to discretization of reaction kinetics that allows us to efficiently use UPPAAL as the computational engine to explore the dynamic behavior of the network of interest. A user-friendly interface hides the use of Timed Automata from the user, while keeping the expressive power intact. Abstraction to single-parameter kinetics speeds up construction of models that remain faithful enough to provide meaningful insight. The resulting dynamic behavior of the network components is displayed graphically, allowing for an intuitive and interactive modeling experience.

Query Monitoring and Analysis for Database Privacy - A Security Automata Model Approach.

PubMed

Kumar, Anand; Ligatti, Jay; Tu, Yi-Cheng

2015-11-01

Privacy and usage restriction issues are important when valuable data are exchanged or acquired by different organizations. Standard access control mechanisms either restrict or completely grant access to valuable data. On the other hand, data obfuscation limits the overall usability and may result in loss of total value. There are no standard policy enforcement mechanisms for data acquired through mutual and copyright agreements. In practice, many different types of policies can be enforced in protecting data privacy. Hence there is the need for an unified framework that encapsulates multiple suites of policies to protect the data. We present our vision of an architecture named security automata model (SAM) to enforce privacy-preserving policies and usage restrictions. SAM analyzes the input queries and their outputs to enforce various policies, liberating data owners from the burden of monitoring data access. SAM allows administrators to specify various policies and enforces them to monitor queries and control the data access. Our goal is to address the problems of data usage control and protection through privacy policies that can be defined, enforced, and integrated with the existing access control mechanisms using SAM. In this paper, we lay out the theoretical foundation of SAM, which is based on an automata named Mandatory Result Automata. We also discuss the major challenges of implementing SAM in a real-world database environment as well as ideas to meet such challenges.

A cellular automata approach for modeling surface water runoff

NASA Astrophysics Data System (ADS)

Jozefik, Zoltan; Nanu Frechen, Tobias; Hinz, Christoph; Schmidt, Heiko

2015-04-01

This abstract reports the development and application of a two-dimensional cellular automata based model, which couples the dynamics of overland flow, infiltration processes and surface evolution through sediment transport. The natural hill slopes are represented by their topographic elevation and spatially varying soil properties infiltration rates and surface roughness coefficients. This model allows modeling of Hortonian overland flow and infiltration during complex rainfall events. An advantage of the cellular automata approach over the kinematic wave equations is that wet/dry interfaces that often appear with rainfall overland flows can be accurately captured and are not a source of numerical instabilities. An adaptive explicit time stepping scheme allows for rainfall events to be adequately resolved in time, while large time steps are taken during dry periods to provide for simulation run time efficiency. The time step is constrained by the CFL condition and mass conservation considerations. The spatial discretization is shown to be first-order accurate. For validation purposes, hydrographs for non-infiltrating and infiltrating plates are compared to the kinematic wave analytic solutions and data taken from literature [1,2]. Results show that our cellular automata model quantitatively accurately reproduces hydrograph patterns. However, recent works have showed that even through the hydrograph is satisfyingly reproduced, the flow field within the plot might be inaccurate [3]. For a more stringent validation, we compare steady state velocity, water flux, and water depth fields to rainfall simulation experiments conducted in Thies, Senegal [3]. Comparisons show that our model is able to accurately capture these flow properties. Currently, a sediment transport and deposition module is being implemented and tested. [1] M. Rousseau, O. Cerdan, O. Delestre, F. Dupros, F. James, S. Cordier. Overland flow modeling with the Shallow Water Equation using a well balanced numerical scheme: Adding efficiency or sum more complexity?. 2012. [2] Fritz R. Fiedler, J. A. Ramirez. A numerical method for simulating discontinuous shallow flow over an infiltrating surface. In. J. Numer. Mech. Fluids 200: 32: 219-240. [3] C. Mügler, O. Planchon, J. Patin, S. Weill, N. Silvera, P. Richard, E. Mouche. Comparison of Roughness models to simulate overland flow and tracer transport experiments under simulated rainfall at plot scale. Journal of Hydrology. 402 (2011) 25-40.

Addressing population heterogeneity and distribution in epidemics models using a cellular automata approach

PubMed Central

2014-01-01

Background The spread of an infectious disease is determined by biological and social factors. Models based on cellular automata are adequate to describe such natural systems consisting of a massive collection of simple interacting objects. They characterize the time evolution of the global system as the emergent behaviour resulting from the interaction of the objects, whose behaviour is defined through a set of simple rules that encode the individual behaviour and the transmission dynamic. Methods An epidemic is characterized trough an individual–based–model built upon cellular automata. In the proposed model, each individual of the population is represented by a cell of the automata. This way of modeling an epidemic situation allows to individually define the characteristic of each individual, establish different scenarios and implement control strategies. Results A cellular automata model to study the time evolution of a heterogeneous populations through the various stages of disease was proposed, allowing the inclusion of individual heterogeneity, geographical characteristics and social factors that determine the dynamic of the desease. Different assumptions made to built the classical model were evaluated, leading to following results: i) for low contact rate (like in quarantine process or low density population areas) the number of infective individuals is lower than other areas where the contact rate is higher, and ii) for different initial spacial distributions of infected individuals different epidemic dynamics are obtained due to its influence on the transition rate and the reproductive ratio of disease. Conclusions The contact rate and spatial distributions have a central role in the spread of a disease. For low density populations the spread is very low and the number of infected individuals is lower than in highly populated areas. The spacial distribution of the population and the disease focus as well as the geographical characteristic of the area play a central role in the dynamics of the desease. PMID:24725804

Addressing population heterogeneity and distribution in epidemics models using a cellular automata approach.

PubMed

López, Leonardo; Burguerner, Germán; Giovanini, Leonardo

2014-04-12

The spread of an infectious disease is determined by biological and social factors. Models based on cellular automata are adequate to describe such natural systems consisting of a massive collection of simple interacting objects. They characterize the time evolution of the global system as the emergent behaviour resulting from the interaction of the objects, whose behaviour is defined through a set of simple rules that encode the individual behaviour and the transmission dynamic. An epidemic is characterized trough an individual-based-model built upon cellular automata. In the proposed model, each individual of the population is represented by a cell of the automata. This way of modeling an epidemic situation allows to individually define the characteristic of each individual, establish different scenarios and implement control strategies. A cellular automata model to study the time evolution of a heterogeneous populations through the various stages of disease was proposed, allowing the inclusion of individual heterogeneity, geographical characteristics and social factors that determine the dynamic of the desease. Different assumptions made to built the classical model were evaluated, leading to following results: i) for low contact rate (like in quarantine process or low density population areas) the number of infective individuals is lower than other areas where the contact rate is higher, and ii) for different initial spacial distributions of infected individuals different epidemic dynamics are obtained due to its influence on the transition rate and the reproductive ratio of disease. The contact rate and spatial distributions have a central role in the spread of a disease. For low density populations the spread is very low and the number of infected individuals is lower than in highly populated areas. The spacial distribution of the population and the disease focus as well as the geographical characteristic of the area play a central role in the dynamics of the desease.

Validating Cellular Automata Lava Flow Emplacement Algorithms with Standard Benchmarks

NASA Astrophysics Data System (ADS)

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

2015-12-01

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

Fire and Heat Spreading Model Based on Cellular Automata Theory

NASA Astrophysics Data System (ADS)

Samartsev, A. A.; Rezchikov, A. F.; Kushnikov, V. A.; Ivashchenko, V. A.; Bogomolov, A. S.; Filimonyuk, L. Yu; Dolinina, O. N.; Kushnikov, O. V.; Shulga, T. E.; Tverdokhlebov, V. A.; Fominykh, D. S.

2018-05-01

The distinctive feature of the proposed fire and heat spreading model in premises is the reduction of the computational complexity due to the use of the theory of cellular automata with probability rules of behavior. The possibilities and prospects of using this model in practice are noted. The proposed model has a simple mechanism of integration with agent-based evacuation models. The joint use of these models could improve floor plans and reduce the time of evacuation from premises during fires.

Cellular automata and its applications in protein bioinformatics.

PubMed

Xiao, Xuan; Wang, Pu; Chou, Kuo-Chen

2011-09-01

With the explosion of protein sequences generated in the postgenomic era, it is highly desirable to develop high-throughput tools for rapidly and reliably identifying various attributes of uncharacterized proteins based on their sequence information alone. The knowledge thus obtained can help us timely utilize these newly found protein sequences for both basic research and drug discovery. Many bioinformatics tools have been developed by means of machine learning methods. This review is focused on the applications of a new kind of science (cellular automata) in protein bioinformatics. A cellular automaton (CA) is an open, flexible and discrete dynamic model that holds enormous potentials in modeling complex systems, in spite of the simplicity of the model itself. Researchers, scientists and practitioners from different fields have utilized cellular automata for visualizing protein sequences, investigating their evolution processes, and predicting their various attributes. Owing to its impressive power, intuitiveness and relative simplicity, the CA approach has great potential for use as a tool for bioinformatics.

Opinion evolution based on cellular automata rules in small world networks

NASA Astrophysics Data System (ADS)

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

2010-03-01

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

Creating Clinical Fuzzy Automata with Fuzzy Arden Syntax.

PubMed

de Bruin, Jeroen S; Steltzer, Heinz; Rappelsberger, Andrea; Adlassnig, Klaus-Peter

2017-01-01

Formal constructs for fuzzy sets and fuzzy logic are incorporated into Arden Syntax version 2.9 (Fuzzy Arden Syntax). With fuzzy sets, the relationships between measured or observed data and linguistic terms are expressed as degrees of compatibility that model the unsharpness of the boundaries of linguistic terms. Propositional uncertainty due to incomplete knowledge of relationships between clinical linguistic concepts is modeled with fuzzy logic. Fuzzy Arden Syntax also supports the construction of fuzzy state monitors. The latter are defined as monitors that employ fuzzy automata to observe gradual transitions between different stages of disease. As a use case, we re-implemented FuzzyARDS, a previously published clinical monitoring system for patients suffering from acute respiratory distress syndrome (ARDS). Using the re-implementation as an example, we show how key concepts of fuzzy automata, i.e., fuzzy states and parallel fuzzy state transitions, can be implemented in Fuzzy Arden Syntax. The results showed that fuzzy state monitors can be implemented in a straightforward manner.

From QCA (Quantum Cellular Automata) to Organocatalytic Reactions with Stabilized Carbenium Ions.

PubMed

Gualandi, Andrea; Mengozzi, Luca; Manoni, Elisabetta; Giorgio Cozzi, Pier

2016-06-01

What do quantum cellular automata (QCA), "on water" reactions, and SN 1-type organocatalytic transformations have in common? The link between these distant arguments is the practical access to useful intermediates and key products through the use of stabilized carbenium ions. Over 10 years, starting with a carbenium ion bearing a ferrocenyl group, to the 1,3-benzodithiolylium carbenium ion, our group has exploited the use of these intermediates in useful and practical synthetic transformations. In particular, we have applied the use of carbenium ions to stereoselective organocatalytic alkylation reactions, showing a possible solution for the "holy grail of organocatalysis". Examples of the use of these quite stabilized intermediates are now also considered in organometallic chemistry. On the other hand, the stable carbenium ions are also applied to tailored molecules adapted to quantum cellular automata, a new possible paradigm for computation. Carbenium ions are not a problem, they can be a/the solution! © 2016 The Chemical Society of Japan & Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Towards mechanism-based simulation of impact damage using exascale computing

NASA Astrophysics Data System (ADS)

Shterenlikht, Anton; Margetts, Lee; McDonald, Samuel; Bourne, Neil K.

2017-01-01

Over the past 60 years, the finite element method has been very successful in modelling deformation in engineering structures. However the method requires the definition of constitutive models that represent the response of the material to applied loads. There are two issues. Firstly, the models are often difficult to define. Secondly, there is often no physical connection between the models and the mechanisms that accommodate deformation. In this paper, we present a potentially disruptive two-level strategy which couples the finite element method at the macroscale with cellular automata at the mesoscale. The cellular automata are used to simulate mechanisms, such as crack propagation. The stress-strain relationship emerges as a continuum mechanics scale interpretation of changes at the micro- and meso-scales. Iterative two-way updating between the cellular automata and finite elements drives the simulation forward as the material undergoes progressive damage at high strain rates. The strategy is particularly attractive on large-scale computing platforms as both methods scale well on tens of thousands of CPUs.

Distributed learning automata-based algorithm for community detection in complex networks

NASA Astrophysics Data System (ADS)

Khomami, Mohammad Mehdi Daliri; Rezvanian, Alireza; Meybodi, Mohammad Reza

2016-03-01

Community structure is an important and universal topological property of many complex networks such as social and information networks. The detection of communities of a network is a significant technique for understanding the structure and function of networks. In this paper, we propose an algorithm based on distributed learning automata for community detection (DLACD) in complex networks. In the proposed algorithm, each vertex of network is equipped with a learning automation. According to the cooperation among network of learning automata and updating action probabilities of each automaton, the algorithm interactively tries to identify high-density local communities. The performance of the proposed algorithm is investigated through a number of simulations on popular synthetic and real networks. Experimental results in comparison with popular community detection algorithms such as walk trap, Danon greedy optimization, Fuzzy community detection, Multi-resolution community detection and label propagation demonstrated the superiority of DLACD in terms of modularity, NMI, performance, min-max-cut and coverage.

Astrobiological complexity with probabilistic cellular automata.

PubMed

Vukotić, Branislav; Ćirković, Milan M

2012-08-01

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

Simulating large-scale pedestrian movement using CA and event driven model: Methodology and case study

NASA Astrophysics Data System (ADS)

Li, Jun; Fu, Siyao; He, Haibo; Jia, Hongfei; Li, Yanzhong; Guo, Yi

2015-11-01

Large-scale regional evacuation is an important part of national security emergency response plan. Large commercial shopping area, as the typical service system, its emergency evacuation is one of the hot research topics. A systematic methodology based on Cellular Automata with the Dynamic Floor Field and event driven model has been proposed, and the methodology has been examined within context of a case study involving the evacuation within a commercial shopping mall. Pedestrians walking is based on Cellular Automata and event driven model. In this paper, the event driven model is adopted to simulate the pedestrian movement patterns, the simulation process is divided into normal situation and emergency evacuation. The model is composed of four layers: environment layer, customer layer, clerk layer and trajectory layer. For the simulation of movement route of pedestrians, the model takes into account purchase intention of customers and density of pedestrians. Based on evacuation model of Cellular Automata with Dynamic Floor Field and event driven model, we can reflect behavior characteristics of customers and clerks at the situations of normal and emergency evacuation. The distribution of individual evacuation time as a function of initial positions and the dynamics of the evacuation process is studied. Our results indicate that the evacuation model using the combination of Cellular Automata with Dynamic Floor Field and event driven scheduling can be used to simulate the evacuation of pedestrian flows in indoor areas with complicated surroundings and to investigate the layout of shopping mall.

A study for bank effect on ship traffic in narrow water channels using cellular automata

NASA Astrophysics Data System (ADS)

Sun, Zhuo; Cong, Shuang; Pan, Junnan; Zheng, Jianfeng

2017-12-01

In narrow water channels, bank might affect nearby ships due to hydrodynamic forces (bank effect). To avoid accidents, different sailing rules (i.e., lane-changing, speed control) are required. In this paper, a two-lane cellular automata model is proposed to evaluate such phenomena. Numerical experiments show that ships will form a “slow-moving chunk” in the bank area, which will significantly block the flux. As further study demonstrated to alleviate bank effect, ship speed and bank length should be controlled.

The Design of Fault Tolerant Quantum Dot Cellular Automata Based Logic

NASA Technical Reports Server (NTRS)

Armstrong, C. Duane; Humphreys, William M.; Fijany, Amir

2002-01-01

As transistor geometries are reduced, quantum effects begin to dominate device performance. At some point, transistors cease to have the properties that make them useful computational components. New computing elements must be developed in order to keep pace with Moore s Law. Quantum dot cellular automata (QCA) represent an alternative paradigm to transistor-based logic. QCA architectures that are robust to manufacturing tolerances and defects must be developed. We are developing software that allows the exploration of fault tolerant QCA gate architectures by automating the specification, simulation, analysis and documentation processes.

Cellular automata and epidemiological models with spatial dependence

NASA Astrophysics Data System (ADS)

Fuentes, M. A.; Kuperman, M. N.

We present a cellular automata model developed to study the evolution of an infectivity nucleus in several conditions and for two kinds of epidemiologically different diseases. We analyse the role of the model parameters, concerning the epidemiological and demographic aspects of the problem, and of the evolution rules in relation to the spread of such infectious diseases, the arising of periodic temporal modulations related to the infectivity and recovery fronts, and the evolution of travelling waves. Among the obtained results we find analogies to endemic situations and pandemics.

Universal map for cellular automata

NASA Astrophysics Data System (ADS)

García-Morales, V.

2012-08-01

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

Cellular Automata with Anticipation: Examples and Presumable Applications

NASA Astrophysics Data System (ADS)

Krushinsky, Dmitry; Makarenko, Alexander

2010-11-01

One of the most prospective new methodologies for modelling is the so-called cellular automata (CA) approach. According to this paradigm, the models are built from simple elements connected into regular structures with local interaction between neighbours. The patterns of connections usually have a simple geometry (lattices). As one of the classical examples of CA we mention the game `Life' by J. Conway. This paper presents two examples of CA with anticipation property. These examples include a modification of the game `Life' and a cellular model of crowd movement.

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

NASA Astrophysics Data System (ADS)

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.

Algorithm for repairing the damaged images of grain structures obtained from the cellular automata and measurement of grain size

NASA Astrophysics Data System (ADS)

Ramírez-López, A.; Romero-Romo, M. A.; Muñoz-Negron, D.; López-Ramírez, S.; Escarela-Pérez, R.; Duran-Valencia, C.

2012-10-01

Computational models are developed to create grain structures using mathematical algorithms based on the chaos theory such as cellular automaton, geometrical models, fractals, and stochastic methods. Because of the chaotic nature of grain structures, some of the most popular routines are based on the Monte Carlo method, statistical distributions, and random walk methods, which can be easily programmed and included in nested loops. Nevertheless, grain structures are not well defined as the results of computational errors and numerical inconsistencies on mathematical methods. Due to the finite definition of numbers or the numerical restrictions during the simulation of solidification, damaged images appear on the screen. These images must be repaired to obtain a good measurement of grain geometrical properties. Some mathematical algorithms were developed to repair, measure, and characterize grain structures obtained from cellular automata in the present work. An appropriate measurement of grain size and the corrected identification of interfaces and length are very important topics in materials science because they are the representation and validation of mathematical models with real samples. As a result, the developed algorithms are tested and proved to be appropriate and efficient to eliminate the errors and characterize the grain structures.

Fire training in a virtual-reality environment

NASA Astrophysics Data System (ADS)

Freund, Eckhard; Rossmann, Jurgen; Bucken, Arno

2005-03-01

Although fire is very common in our daily environment - as a source of energy at home or as a tool in industry - most people cannot estimate the danger of a conflagration. Therefore it is important to train people in combating fire. Beneath training with propane simulators or real fires and real extinguishers, fire training can be performed in virtual reality, which means a pollution-free and fast way of training. In this paper we describe how to enhance a virtual-reality environment with a real-time fire simulation and visualisation in order to establish a realistic emergency-training system. The presented approach supports extinguishing of the virtual fire including recordable performance data as needed in teletraining environments. We will show how to get realistic impressions of fire using advanced particle-simulation and how to use the advantages of particles to trigger states in a modified cellular automata used for the simulation of fire-behaviour. Using particle systems that interact with cellular automata it is possible to simulate a developing, spreading fire and its reaction on different extinguishing agents like water, CO2 or oxygen. The methods proposed in this paper have been implemented and successfully tested on Cosimir, a commercial robot-and VR-simulation-system.

Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation

NASA Astrophysics Data System (ADS)

Banda, Gourinath; Gallagher, John P.

interpretation provides a practical approach to verifying properties of infinite-state systems. We apply the framework of abstract interpretation to derive an abstract semantic function for the modal μ-calculus, which is the basis for abstract model checking. The abstract semantic function is constructed directly from the standard concrete semantics together with a Galois connection between the concrete state-space and an abstract domain. There is no need for mixed or modal transition systems to abstract arbitrary temporal properties, as in previous work in the area of abstract model checking. Using the modal μ-calculus to implement CTL, the abstract semantics gives an over-approximation of the set of states in which an arbitrary CTL formula holds. Then we show that this leads directly to an effective implementation of an abstract model checking algorithm for CTL using abstract domains based on linear constraints. The implementation of the abstract semantic function makes use of an SMT solver. We describe an implemented system for proving properties of linear hybrid automata and give some experimental results.

A 3-D model of tumor progression based on complex automata driven by particle dynamics.

PubMed

Wcisło, Rafał; Dzwinel, Witold; Yuen, David A; Dudek, Arkadiusz Z

2009-12-01

The dynamics of a growing tumor involving mechanical remodeling of healthy tissue and vasculature is neglected in most of the existing tumor models. This is due to the lack of efficient computational framework allowing for simulation of mechanical interactions. Meanwhile, just these interactions trigger critical changes in tumor growth dynamics and are responsible for its volumetric and directional progression. We describe here a novel 3-D model of tumor growth, which combines particle dynamics with cellular automata concept. The particles represent both tissue cells and fragments of the vascular network. They interact with their closest neighbors via semi-harmonic central forces simulating mechanical resistance of the cell walls. The particle dynamics is governed by both the Newtonian laws of motion and the cellular automata rules. These rules can represent cell life-cycle and other biological interactions involving smaller spatio-temporal scales. We show that our complex automata, particle based model can reproduce realistic 3-D dynamics of the entire system consisting of the tumor, normal tissue cells, blood vessels and blood flow. It can explain phenomena such as the inward cell motion in avascular tumor, stabilization of tumor growth by the external pressure, tumor vascularization due to the process of angiogenesis, trapping of healthy cells by invading tumor, and influence of external (boundary) conditions on the direction of tumor progression. We conclude that the particle model can serve as a general framework for designing advanced multiscale models of tumor dynamics and it is very competitive to the modeling approaches presented before.

Cellular automata model for human articular chondrocytes migration, proliferation and cell death: An in vitro validation.

PubMed

Vaca-González, J J; Gutiérrez, M L; Guevara, J M; Garzón-Alvarado, D A

2017-01-01

Articular cartilage is characterized by low cell density of only one cell type, chondrocytes, and has limited self-healing properties. When articular cartilage is affected by traumatic injuries, a therapeutic strategy such as autologous chondrocyte implantation is usually proposed for its treatment. This approach requires in vitro chondrocyte expansion to yield high cell number for cell transplantation. To improve the efficiency of this procedure, it is necessary to assess cell dynamics such as migration, proliferation and cell death during culture. Computational models such as cellular automata can be used to simulate cell dynamics in order to enhance the result of cell culture procedures. This methodology has been implemented for several cell types; however, an experimental validation is required for each one. For this reason, in this research a cellular automata model, based on random-walk theory, was devised in order to predict articular chondrocyte behavior in monolayer culture during cell expansion. Results demonstrated that the cellular automata model corresponded to cell dynamics and computed-accurate quantitative results. Moreover, it was possible to observe that cell dynamics depend on weighted probabilities derived from experimental data and cell behavior varies according to the cell culture period. Thus, depending on whether cells were just seeded or proliferated exponentially, culture time probabilities differed in percentages in the CA model. Furthermore, in the experimental assessment a decreased chondrocyte proliferation was observed along with increased passage number. This approach is expected to having other uses as in enhancing articular cartilage therapies based on tissue engineering and regenerative medicine.

Sequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR

PubMed Central

MotieGhader, Habib; Gharaghani, Sajjad; Masoudi-Sobhanzadeh, Yosef; Masoudi-Nejad, Ali

2017-01-01

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as GA, PSO, ACO and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR feature selection are proposed. SGALA algorithm uses advantages of Genetic algorithm and Learning Automata sequentially and the MGALA algorithm uses advantages of Genetic Algorithm and Learning Automata simultaneously. We applied our proposed algorithms to select the minimum possible number of features from three different datasets and also we observed that the MGALA and SGALA algorithms had the best outcome independently and in average compared to other feature selection algorithms. Through comparison of our proposed algorithms, we deduced that the rate of convergence to optimal result in MGALA and SGALA algorithms were better than the rate of GA, ACO, PSO and LA algorithms. In the end, the results of GA, ACO, PSO, LA, SGALA, and MGALA algorithms were applied as the input of LS-SVR model and the results from LS-SVR models showed that the LS-SVR model had more predictive ability with the input from SGALA and MGALA algorithms than the input from all other mentioned algorithms. Therefore, the results have corroborated that not only is the predictive efficiency of proposed algorithms better, but their rate of convergence is also superior to the all other mentioned algorithms. PMID:28979308

Sequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR.

PubMed

MotieGhader, Habib; Gharaghani, Sajjad; Masoudi-Sobhanzadeh, Yosef; Masoudi-Nejad, Ali

2017-01-01

Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as GA, PSO, ACO and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR feature selection are proposed. SGALA algorithm uses advantages of Genetic algorithm and Learning Automata sequentially and the MGALA algorithm uses advantages of Genetic Algorithm and Learning Automata simultaneously. We applied our proposed algorithms to select the minimum possible number of features from three different datasets and also we observed that the MGALA and SGALA algorithms had the best outcome independently and in average compared to other feature selection algorithms. Through comparison of our proposed algorithms, we deduced that the rate of convergence to optimal result in MGALA and SGALA algorithms were better than the rate of GA, ACO, PSO and LA algorithms. In the end, the results of GA, ACO, PSO, LA, SGALA, and MGALA algorithms were applied as the input of LS-SVR model and the results from LS-SVR models showed that the LS-SVR model had more predictive ability with the input from SGALA and MGALA algorithms than the input from all other mentioned algorithms. Therefore, the results have corroborated that not only is the predictive efficiency of proposed algorithms better, but their rate of convergence is also superior to the all other mentioned algorithms.

Automatic User Interface Generation for Visualizing Big Geoscience Data

NASA Astrophysics Data System (ADS)

Yu, H.; Wu, J.; Zhou, Y.; Tang, Z.; Kuo, K. S.

2016-12-01

Along with advanced computing and observation technologies, geoscience and its related fields have been generating a large amount of data at an unprecedented growth rate. Visualization becomes an increasingly attractive and feasible means for researchers to effectively and efficiently access and explore data to gain new understandings and discoveries. However, visualization has been challenging due to a lack of effective data models and visual representations to tackle the heterogeneity of geoscience data. We propose a new geoscience data visualization framework by leveraging the interface automata theory to automatically generate user interface (UI). Our study has the following three main contributions. First, geoscience data has its unique hierarchy data structure and complex formats, and therefore it is relatively easy for users to get lost or confused during their exploration of the data. By applying interface automata model to the UI design, users can be clearly guided to find the exact visualization and analysis that they want. In addition, from a development perspective, interface automaton is also easier to understand than conditional statements, which can simplify the development process. Second, it is common that geoscience data has discontinuity in its hierarchy structure. The application of interface automata can prevent users from suffering automation surprises, and enhance user experience. Third, for supporting a variety of different data visualization and analysis, our design with interface automata could also make applications become extendable in that a new visualization function or a new data group could be easily added to an existing application, which reduces the overhead of maintenance significantly. We demonstrate the effectiveness of our framework using real-world applications.

Microgravity and Charge Transfer in the Neuronal Membrane: Implications for Computational Neurobiology

NASA Technical Reports Server (NTRS)

Wallace, Ron

1995-01-01

Evidence from natural and artificial membranes indicates that the neural membrane is a liquid crystal. A liquid-to-gel phase transition caused by the application of superposed electromagnetic fields to the outer membrane surface releases spin-correlated electron pairs which propagate through a charge transfer complex. The propagation generates Rydberg atoms in the lipid bilayer lattice. In the present model, charge density configurations in promoted orbitals interact as cellular automata and perform computations in Hilbert space. Due to the small binding energies of promoted orbitals, their automata are highly sensitive to microgravitational perturbations. It is proposed that spacetime is classical on the Rydberg scale, but formed of contiguous moving segments, each of which displays topological equivalence. This stochasticity is reflected in randomized Riemannian tensor values. Spacetime segments interact with charge automata as components of a computational process. At the termination of the algorithm, an orbital of high probability density is embedded in a more stabilized microscopic spacetime. This state permits the opening of an ion channel and the conversion of a quantum algorithm into a macroscopic frequency code.

Sampling from complex networks using distributed learning automata

NASA Astrophysics Data System (ADS)

Rezvanian, Alireza; Rahmati, Mohammad; Meybodi, Mohammad Reza

2014-02-01

A complex network provides a framework for modeling many real-world phenomena in the form of a network. In general, a complex network is considered as a graph of real world phenomena such as biological networks, ecological networks, technological networks, information networks and particularly social networks. Recently, major studies are reported for the characterization of social networks due to a growing trend in analysis of online social networks as dynamic complex large-scale graphs. Due to the large scale and limited access of real networks, the network model is characterized using an appropriate part of a network by sampling approaches. In this paper, a new sampling algorithm based on distributed learning automata has been proposed for sampling from complex networks. In the proposed algorithm, a set of distributed learning automata cooperate with each other in order to take appropriate samples from the given network. To investigate the performance of the proposed algorithm, several simulation experiments are conducted on well-known complex networks. Experimental results are compared with several sampling methods in terms of different measures. The experimental results demonstrate the superiority of the proposed algorithm over the others.

Stair evacuation simulation based on cellular automata considering evacuees’ walk preferences

NASA Astrophysics Data System (ADS)

Ding, Ning; Zhang, Hui; Chen, Tao; Peter, B. Luh

2015-06-01

As a physical model, the cellular automata (CA) model is widely used in many areas, such as stair evacuation. However, existing CA models do not consider evacuees’ walk preferences nor psychological status, and the structure of the basic model is unapplicable for the stair structure. This paper is to improve the stair evacuation simulation by addressing these issues, and a new cellular automata model is established. Several evacuees’ walk preference and how evacuee’s psychology influences their behaviors are introduced into this model. Evacuees’ speeds will be influenced by these features. To validate this simulation, two fire drills held in two high-rise buildings are video-recorded. It is found that the simulation results are similar to the fire drill results. The structure of this model is simple, and it is easy to further develop and utilize in different buildings with various kinds of occupants. Project supported by the National Basic Research Program of China (Grant No. 2012CB719705) and the National Natural Science Foundation of China (Grant Nos. 91224008, 91024032, and 71373139).

Simulation of root forms using cellular automata model

NASA Astrophysics Data System (ADS)

Winarno, Nanang; Prima, Eka Cahya; Afifah, Ratih Mega Ayu

2016-02-01

This research aims to produce a simulation program for root forms using cellular automata model. Stephen Wolfram in his book entitled "A New Kind of Science" discusses the formation rules based on the statistical analysis. In accordance with Stephen Wolfram's investigation, the research will develop a basic idea of computer program using Delphi 7 programming language. To best of our knowledge, there is no previous research developing a simulation describing root forms using the cellular automata model compared to the natural root form with the presence of stone addition as the disturbance. The result shows that (1) the simulation used four rules comparing results of the program towards the natural photographs and each rule had shown different root forms; (2) the stone disturbances prevent the root growth and the multiplication of root forms had been successfully modeled. Therefore, this research had added some stones, which have size of 120 cells placed randomly in the soil. Like in nature, stones cannot be penetrated by plant roots. The result showed that it is very likely to further develop the program of simulating root forms by 50 variations.

Dengue fever spreading based on probabilistic cellular automata with two lattices

NASA Astrophysics Data System (ADS)

Pereira, F. M. M.; Schimit, P. H. T.

2018-06-01

Modeling and simulation of mosquito-borne diseases have gained attention due to a growing incidence in tropical countries in the past few years. Here, we study the dengue spreading in a population modeled by cellular automata, where there are two lattices to model the human-mosquitointeraction: one lattice for human individuals, and one lattice for mosquitoes in order to enable different dynamics in populations. The disease considered is the dengue fever with one, two or three different serotypes coexisting in population. Although many regions exhibit the incidence of only one serotype, here we set a complete framework to also study the occurrence of two and three serotypes at the same time in a population. Furthermore, the flexibility of the model allows its use to other mosquito-borne diseases, like chikungunya, yellow fever and malaria. An approximation of the cellular automata is proposed in terms of ordinary differential equations; the spreading of mosquitoes is studied and the influence of some model parameters are analyzed with numerical simulations. Finally, a method to combat dengue spreading is simulated based on a reduction of mosquito birth and mosquito bites in population.

Quantifying a cellular automata simulation of electric vehicles

NASA Astrophysics Data System (ADS)

Hill, Graeme; Bell, Margaret; Blythe, Phil

2014-12-01

Within this work the Nagel-Schreckenberg (NS) cellular automata is used to simulate a basic cyclic road network. Results from SwitchEV, a real world Electric Vehicle trial which has collected more than two years of detailed electric vehicle data, are used to quantify the results of the NS automata, demonstrating similar power consumption behavior to that observed in the experimental results. In particular the efficiency of the electric vehicles reduces as the vehicle density increases, due in part to the reduced efficiency of EVs at low speeds, but also due to the energy consumption inherent in changing speeds. Further work shows the results from introducing spatially restricted speed restriction. In general it can be seen that induced congestion from spatially transient events propagates back through the road network and alters the energy and efficiency profile of the simulated vehicles, both before and after the speed restriction. Vehicles upstream from the restriction show a reduced energy usage and an increased efficiency, and vehicles downstream show an initial large increase in energy usage as they accelerate away from the speed restriction.

Reasoning about Probabilistic Security Using Task-PIOAs

NASA Astrophysics Data System (ADS)

Jaggard, Aaron D.; Meadows, Catherine; Mislove, Michael; Segala, Roberto

Task-structured probabilistic input/output automata (Task-PIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framework for the universal composability paradigms of protocol security. One of their advantages is that that they allow one to distinguish high-level nondeterminism that can affect the outcome of the protocol, from low-level choices, which can't. We present an alternative approach to analyzing the structure of Task-PIOAs that relies on ordered sets. We focus on two of the components that are required to define and apply Task-PIOAs: discrete probability theory and automata theory. We believe our development gives insight into the structure of Task-PIOAs and how they can be utilized to model crypto-protocols. We illustrate our approach with an example from anonymity, an area that has not previously been addressed using Task-PIOAs. We model Chaum's Dining Cryptographers Protocol at a level that does not require cryptographic primitives in the analysis. We show via this example how our approach can leverage a proof of security in the case a principal behaves deterministically to prove security when that principal behaves probabilistically.

Algebraic properties of automata associated to Petri nets and applications to computation in biological systems.

PubMed

Egri-Nagy, Attila; Nehaniv, Chrystopher L

2008-01-01

Biochemical and genetic regulatory networks are often modeled by Petri nets. We study the algebraic structure of the computations carried out by Petri nets from the viewpoint of algebraic automata theory. Petri nets comprise a formalized graphical modeling language, often used to describe computation occurring within biochemical and genetic regulatory networks, but the semantics may be interpreted in different ways in the realm of automata. Therefore, there are several different ways to turn a Petri net into a state-transition automaton. Here, we systematically investigate different conversion methods and describe cases where they may yield radically different algebraic structures. We focus on the existence of group components of the corresponding transformation semigroups, as these reflect symmetries of the computation occurring within the biological system under study. Results are illustrated by applications to the Petri net modelling of intermediary metabolism. Petri nets with inhibition are shown to be computationally rich, regardless of the particular interpretation method. Along these lines we provide a mathematical argument suggesting a reason for the apparent all-pervasiveness of inhibitory connections in living systems.

In silico and in vitro methods to optimize the performance of experimental gastroretentive floating mini-tablets.

PubMed

Eberle, Veronika A; Häring, Armella; Schoelkopf, Joachim; Gane, Patrick A C; Huwyler, Jörg; Puchkov, Maxim

2016-01-01

Development of floating drug delivery systems (FDDS) is challenging. To facilitate this task, an evaluation method was proposed, which allows for a combined investigation of drug release and flotation. It was the aim of the study to use functionalized calcium carbonate (FCC)-based lipophilic mini-tablet formulations as a model system to design FDDS with a floating behavior characterized by no floating lag time, prolonged flotation and loss of floating capability after complete drug release. Release of the model drug caffeine from the mini-tablets was assessed in vitro by a custom-built stomach model. A cellular automata-based model was used to simulate tablet dissolution. Based on the in silico data, floating forces were calculated and analyzed as a function of caffeine release. Two floating behaviors were identified for mini-tablets: linear decrease of the floating force and maintaining of the floating capability until complete caffeine release. An optimal mini-tablet formulation with desired drug release time and floating behavior was developed and tested. A classification system for a range of varied floating behavior of FDDS was proposed. The FCC-based mini-tablets had an ideal floating behavior: duration of flotation is defined and floating capability decreases after completion of drug release.

Simulating Space Radiation-Induced Breast Tumor Incidence Using Automata.

PubMed

Heuskin, A C; Osseiran, A I; Tang, J; Costes, S V

2016-07-01

Estimating cancer risk from space radiation has been an ongoing challenge for decades primarily because most of the reported epidemiological data on radiation-induced risks are derived from studies of atomic bomb survivors who were exposed to an acute dose of gamma rays instead of chronic high-LET cosmic radiation. In this study, we introduce a formalism using cellular automata to model the long-term effects of ionizing radiation in human breast for different radiation qualities. We first validated and tuned parameters for an automata-based two-stage clonal expansion model simulating the age dependence of spontaneous breast cancer incidence in an unexposed U.S. We then tested the impact of radiation perturbation in the model by modifying parameters to reflect both targeted and nontargeted radiation effects. Targeted effects (TE) reflect the immediate impact of radiation on a cell's DNA with classic end points being gene mutations and cell death. They are well known and are directly derived from experimental data. In contrast, nontargeted effects (NTE) are persistent and affect both damaged and undamaged cells, are nonlinear with dose and are not well characterized in the literature. In this study, we introduced TE in our model and compared predictions against epidemiologic data of the atomic bomb survivor cohort. TE alone are not sufficient for inducing enough cancer. NTE independent of dose and lasting ∼100 days postirradiation need to be added to accurately predict dose dependence of breast cancer induced by gamma rays. Finally, by integrating experimental relative biological effectiveness (RBE) for TE and keeping NTE (i.e., radiation-induced genomic instability) constant with dose and LET, the model predicts that RBE for breast cancer induced by cosmic radiation would be maximum at 220 keV/μm. This approach lays the groundwork for further investigation into the impact of chronic low-dose exposure, inter-individual variation and more complex space radiation scenarios.

Self-organizing intelligent network of smart electrical heating devices as an alternative to traditional ways of heating

NASA Astrophysics Data System (ADS)

Zaslavsky, Aleksander M.; Tkachov, Viktor V.; Protsenko, Stanislav M.; Bublikov, Andrii V.; Suleimenov, Batyrbek; Orshubekov, Nurbek; Gromaszek, Konrad

2017-08-01

The paper considers the problem of automated decentralized distribution of the electric energy among unlimited-power electric heaters providing the given temperature distribution within the zones of monitored object heating in the context of maximum use of electric power which limiting level is time-dependent randomly. Principles of collective selforganization automata for solving the problem are analyzed. It has been shown that after all the automata make decision, equilibrium of Nash type is attained when unused power within the electric network is not more than a power of any non-energized electric heater.

A Cellular Automata Model of Infection Control on Medical Implants

PubMed Central

Prieto-Langarica, Alicia; Kojouharov, Hristo; Chen-Charpentier, Benito; Tang, Liping

2011-01-01

S. epidermidis infections on medically implanted devices are a common problem in modern medicine due to the abundance of the bacteria. Once inside the body, S. epidermidis gather in communities called biofilms and can become extremely hard to eradicate, causing the patient serious complications. We simulate the complex S. epidermidis-Neutrophils interactions in order to determine the optimum conditions for the immune system to be able to contain the infection and avoid implant rejection. Our cellular automata model can also be used as a tool for determining the optimal amount of antibiotics for combating biofilm formation on medical implants. PMID:23543851

All-DNA finite-state automata with finite memory

PubMed Central

Wang, Zhen-Gang; Elbaz, Johann; Remacle, F.; Levine, R. D.; Willner, Itamar

2010-01-01

Biomolecular logic devices can be applied for sensing and nano-medicine. We built three DNA tweezers that are activated by the inputs H+/OH-; ; nucleic acid linker/complementary antilinker to yield a 16-states finite-state automaton. The outputs of the automata are the configuration of the respective tweezers (opened or closed) determined by observing fluorescence from a fluorophore/quencher pair at the end of the arms of the tweezers. The system exhibits a memory because each current state and output depend not only on the source configuration but also on past states and inputs. PMID:21135212

Partial information decomposition as a spatiotemporal filter.

PubMed

Flecker, Benjamin; Alford, Wesley; Beggs, John M; Williams, Paul L; Beer, Randall D

2011-09-01

Understanding the mechanisms of distributed computation in cellular automata requires techniques for characterizing the emergent structures that underlie information processing in such systems. Recently, techniques from information theory have been brought to bear on this problem. Building on this work, we utilize the new technique of partial information decomposition to show that previous information-theoretic measures can confound distinct sources of information. We then propose a new set of filters and demonstrate that they more cleanly separate out the background domains, particles, and collisions that are typically associated with information storage, transfer, and modification in cellular automata.

Automation Rover for Extreme Environments

NASA Technical Reports Server (NTRS)

Sauder, Jonathan; Hilgemann, Evan; Johnson, Michael; Parness, Aaron; Hall, Jeffrey; Kawata, Jessie; Stack, Kathryn

2017-01-01

Almost 2,300 years ago the ancient Greeks built the Antikythera automaton. This purely mechanical computer accurately predicted past and future astronomical events long before electronics existed1. Automata have been credibly used for hundreds of years as computers, art pieces, and clocks. However, in the past several decades automata have become less popular as the capabilities of electronics increased, leaving them an unexplored solution for robotic spacecraft. The Automaton Rover for Extreme Environments (AREE) proposes an exciting paradigm shift from electronics to a fully mechanical system, enabling longitudinal exploration of the most extreme environments within the solar system.

[Daedalus sive mechanicus--automated equipment and machines at the interface between mechanics and medicine].

PubMed

Bondio, Mariacarla Gadebusch

2009-01-01

Automata have always held a particular fascination. Their history leads back to their mythical ancestors, whose destinies raise considerable ethical questions about the sense of technology and about the boundaries between nature and art. In the 16th century engineers, architects and also physicians discussed the status of the ,artes mechanicae' and the machines they produced or used. Useful, sometimes dangerous, amusing and elaborate artefacts liven up their texts. Together with wonderful automata we find there also orthopaedic stretching machines and artificial limbs, whose acceptance by medical practice was anything but a matter of course.

A new simulation system of traffic flow based on cellular automata principle

NASA Astrophysics Data System (ADS)

Shan, Junru

2017-05-01

Traffic flow is a complex system of multi-behavior so it is difficult to give a specific mathematical equation to express it. With the rapid development of computer technology, it is an important method to study the complex traffic behavior by simulating the interaction mechanism between vehicles and reproduce complex traffic behavior. Using the preset of multiple operating rules, cellular automata is a kind of power system which has discrete time and space. It can be a good simulation of the real traffic process and a good way to solve the traffic problems.

Growth and Decay in Life-Like Cellular Automata

NASA Astrophysics Data System (ADS)

Eppstein, David

Since the study of life began, many have asked: is it unique in the universe, or are there other interesting forms of life elsewhere? Before we can answer that question, we should ask others: What makes life special? If we happen across another system with life-like behavior, how would we be able to recognize it? We are speaking, of course, of the mathematical systems of cellular automata, of the fascinating patterns that have been discovered and engineered in Conway's Game of Life, and of the possible existence of other cellular automaton rules with equally complex behavior to that of Life.

CREATIVE COMPUTATION.

DTIC Science & Technology

ARTIFICIAL INTELLIGENCE , RECURSIVE FUNCTIONS), (*RECURSIVE FUNCTIONS, ARTIFICIAL INTELLIGENCE ), (*MATHEMATICAL LOGIC, ARTIFICIAL INTELLIGENCE ), METAMATHEMATICS, AUTOMATA, NUMBER THEORY, INFORMATION THEORY, COMBINATORIAL ANALYSIS

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

PubMed

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

Modeling the Land Use/Cover Change in an Arid Region Oasis City Constrained by Water Resource and Environmental Policy Change using Cellular Automata Model

NASA Astrophysics Data System (ADS)

Hu, X.; Li, X.; Lu, L.

2017-12-01

Land use/cover change (LUCC) is an important subject in the research of global environmental change and sustainable development, while spatial simulation on land use/cover change is one of the key content of LUCC and is also difficult due to the complexity of the system. The cellular automata (CA) model had an irreplaceable role in simulating of land use/cover change process due to the powerful spatial computing power. However, the majority of current CA land use/cover models were binary-state model that could not provide more general information about the overall spatial pattern of land use/cover change. Here, a multi-state logistic-regression-based Markov cellular automata (MLRMCA) model and a multi-state artificial-neural-network-based Markov cellular automata (MANNMCA) model were developed and were used to simulate complex land use/cover evolutionary process in an arid region oasis city constrained by water resource and environmental policy change, the Zhangye city during the period of 1990-2010. The results indicated that the MANNMCA model was superior to MLRMCA model in simulated accuracy. These indicated that by combining the artificial neural network with CA could more effectively capture the complex relationships between the land use/cover change and a set of spatial variables. Although the MLRMCA model were also some advantages, the MANNMCA model was more appropriate for simulating complex land use/cover dynamics. The two proposed models were effective and reliable, and could reflect the spatial evolution of regional land use/cover changes. These have also potential implications for the impact assessment of water resources, ecological restoration, and the sustainable urban development in arid areas.

Scalable asynchronous execution of cellular automata

NASA Astrophysics Data System (ADS)

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.

Semiautomated hybrid algorithm for estimation of three-dimensional liver surface in CT using dynamic cellular automata and level-sets

PubMed Central

Dakua, Sarada Prasad; Abinahed, Julien; Al-Ansari, Abdulla

2015-01-01

Abstract. Liver segmentation continues to remain a major challenge, largely due to its intense complexity with surrounding anatomical structures (stomach, kidney, and heart), high noise level and lack of contrast in pathological computed tomography (CT) data. We present an approach to reconstructing the liver surface in low contrast CT. The main contributions are: (1) a stochastic resonance-based methodology in discrete cosine transform domain is developed to enhance the contrast of pathological liver images, (2) a new formulation is proposed to prevent the object boundary, resulting from the cellular automata method, from leaking into the surrounding areas of similar intensity, and (3) a level-set method is suggested to generate intermediate segmentation contours from two segmented slices distantly located in a subject sequence. We have tested the algorithm on real datasets obtained from two sources, Hamad General Hospital and medical image computing and computer-assisted interventions grand challenge workshop. Various parameters in the algorithm, such as w, Δt, z, α, μ, α1, and α2, play imperative roles, thus their values are precisely selected. Both qualitative and quantitative evaluation performed on liver data show promising segmentation accuracy when compared with ground truth data reflecting the potential of the proposed method. PMID:26158101

Optimizing radiotherapy protocols using computer automata to model tumour cell death as a function of oxygen diffusion processes.

PubMed

Paul-Gilloteaux, Perrine; Potiron, Vincent; Delpon, Grégory; Supiot, Stéphane; Chiavassa, Sophie; Paris, François; Costes, Sylvain V

2017-05-23

The concept of hypofractionation is gaining momentum in radiation oncology centres, enabled by recent advances in radiotherapy apparatus. The gain of efficacy of this innovative treatment must be defined. We present a computer model based on translational murine data for in silico testing and optimization of various radiotherapy protocols with respect to tumour resistance and the microenvironment heterogeneity. This model combines automata approaches with image processing algorithms to simulate the cellular response of tumours exposed to ionizing radiation, modelling the alteration of oxygen permeabilization in blood vessels against repeated doses, and introducing mitotic catastrophe (as opposed to arbitrary delayed cell-death) as a means of modelling radiation-induced cell death. Published data describing cell death in vitro as well as tumour oxygenation in vivo are used to inform parameters. Our model is validated by comparing simulations to in vivo data obtained from the radiation treatment of mice transplanted with human prostate tumours. We then predict the efficacy of untested hypofractionation protocols, hypothesizing that tumour control can be optimized by adjusting daily radiation dosage as a function of the degree of hypoxia in the tumour environment. Further biological refinement of this tool will permit the rapid development of more sophisticated strategies for radiotherapy.

Stochastic computing with biomolecular automata

PubMed Central

Adar, Rivka; Benenson, Yaakov; Linshiz, Gregory; Rosner, Amit; Tishby, Naftali; Shapiro, Ehud

2004-01-01

Stochastic computing has a broad range of applications, yet electronic computers realize its basic step, stochastic choice between alternative computation paths, in a cumbersome way. Biomolecular computers use a different computational paradigm and hence afford novel designs. We constructed a stochastic molecular automaton in which stochastic choice is realized by means of competition between alternative biochemical pathways, and choice probabilities are programmed by the relative molar concentrations of the software molecules coding for the alternatives. Programmable and autonomous stochastic molecular automata have been shown to perform direct analysis of disease-related molecular indicators in vitro and may have the potential to provide in situ medical diagnosis and cure. PMID:15215499

Multilane Traffic Flow Modeling Using Cellular Automata Theory

NASA Astrophysics Data System (ADS)

Chechina, Antonina; Churbanova, Natalia; Trapeznikova, Marina

2018-02-01

The paper deals with the mathematical modeling of traffic flows on urban road networks using microscopic approach. The model is based on the cellular automata theory and presents a generalization of the Nagel-Schreckenberg model to a multilane case. The created program package allows to simulate traffic on various types of road fragments (T or X type intersection, strait road elements, etc.) and on road networks that consist of these elements. Besides that, it allows to predict the consequences of various decisions regarding road infrastructure changes, such as: number of lanes increasing/decreasing, putting new traffic lights into operation, building new roads, entrances/exits, road junctions.

Computing aggregate properties of preimages for 2D cellular automata.

PubMed

Beer, Randall D

2017-11-01

Computing properties of the set of precursors of a given configuration is a common problem underlying many important questions about cellular automata. Unfortunately, such computations quickly become intractable in dimension greater than one. This paper presents an algorithm-incremental aggregation-that can compute aggregate properties of the set of precursors exponentially faster than naïve approaches. The incremental aggregation algorithm is demonstrated on two problems from the two-dimensional binary Game of Life cellular automaton: precursor count distributions and higher-order mean field theory coefficients. In both cases, incremental aggregation allows us to obtain new results that were previously beyond reach.

The Development of Design Tools for Fault Tolerant Quantum Dot Cellular Automata Based Logic

NASA Technical Reports Server (NTRS)

Armstrong, Curtis D.; Humphreys, William M.

2003-01-01

We are developing software to explore the fault tolerance of quantum dot cellular automata gate architectures in the presence of manufacturing variations and device defects. The Topology Optimization Methodology using Applied Statistics (TOMAS) framework extends the capabilities of the A Quantum Interconnected Network Array Simulator (AQUINAS) by adding front-end and back-end software and creating an environment that integrates all of these components. The front-end tools establish all simulation parameters, configure the simulation system, automate the Monte Carlo generation of simulation files, and execute the simulation of these files. The back-end tools perform automated data parsing, statistical analysis and report generation.

Reversible Flip-Flops in Quantum-Dot Cellular Automata

NASA Astrophysics Data System (ADS)

Rad, Samaneh Kazemi; Heikalabad, Saeed Rasouli

2017-09-01

Quantum-dot cellular automata is a new technology to design the efficient combinational and sequential circuits at the nano-scale. This technology has many desirable advantages compared to the CMOS technology such as low power consumption, less occupation area and low latency. These features make it suitable for use in flip-flop design. In this paper, with knowing the characteristics of reversible logic, we design new structures for flip-flops. The operations of these structures are evaluated with QCADesigner Version 2.0.3 simulator. In addition, we calculate the power dissipation of these structures by QCAPro tool. The results illustrated that proposed structures are efficient compared to the previous ones.

Modelling robot's behaviour using finite automata

NASA Astrophysics Data System (ADS)

Janošek, Michal; Žáček, Jaroslav

2017-07-01

This paper proposes a model of a robot's behaviour described by finite automata. We split robot's knowledge into several knowledge bases which are used by the inference mechanism of the robot's expert system to make a logic deduction. Each knowledgebase is dedicated to the particular behaviour domain and the finite automaton helps us switching among these knowledge bases with the respect of actual situation. Our goal is to simplify and reduce complexity of one big knowledgebase splitting it into several pieces. The advantage of this model is that we can easily add new behaviour by adding new knowledgebase and add this behaviour into the finite automaton and define necessary states and transitions.

On the effect of memory in one-dimensional K=4 automata on networks

NASA Astrophysics Data System (ADS)

Alonso-Sanz, Ramón; Cárdenas, Juan Pablo

2008-12-01

The effect of implementing memory in cells of one-dimensional CA, and on nodes of various types of automata on networks with increasing degrees of random rewiring is studied in this article, paying particular attention to the case of four inputs. As a rule, memory induces a moderation in the rate of changing nodes and in the damage spreading, albeit in the latter case memory turns out to be ineffective in the control of the damage as the wiring network moves away from the ordered structure that features proper one-dimensional CA. This article complements the previous work done in the two-dimensional context.

Computing aggregate properties of preimages for 2D cellular automata

NASA Astrophysics Data System (ADS)

Beer, Randall D.

2017-11-01

Computing properties of the set of precursors of a given configuration is a common problem underlying many important questions about cellular automata. Unfortunately, such computations quickly become intractable in dimension greater than one. This paper presents an algorithm—incremental aggregation—that can compute aggregate properties of the set of precursors exponentially faster than naïve approaches. The incremental aggregation algorithm is demonstrated on two problems from the two-dimensional binary Game of Life cellular automaton: precursor count distributions and higher-order mean field theory coefficients. In both cases, incremental aggregation allows us to obtain new results that were previously beyond reach.

Wolfram's class IV automata and a good life

NASA Astrophysics Data System (ADS)

McIntosh, Harold V.

1990-09-01

A comprehensive discussion of Wolfram's four classes of cellular automata is given, with the intention of relating them to Conway's criteria for a good game of Life. Although it is known that such classifications cannot be entirely rigorous, much information about the behavior of an automaton can be gleaned from the statistical properties of its transition table. Still more information can be deduced from the mean field approximation to its state densities, in particular, from the distribution of horizontal and diagonal tangents of the latter. In turn these characteristics can be related to the presence or absence of certain loops in the de Bruijn diagram of the automaton.

Emergent dynamic structures and statistical law in spherical lattice gas automata.

PubMed

Yao, Zhenwei

2017-12-01

Various lattice gas automata have been proposed in the past decades to simulate physics and address a host of problems on collective dynamics arising in diverse fields. In this work, we employ the lattice gas model defined on the sphere to investigate the curvature-driven dynamic structures and analyze the statistical behaviors in equilibrium. Under the simple propagation and collision rules, we show that the uniform collective movement of the particles on the sphere is geometrically frustrated, leading to several nonequilibrium dynamic structures not found in the planar lattice, such as the emergent bubble and vortex structures. With the accumulation of the collision effect, the system ultimately reaches equilibrium in the sense that the distribution of the coarse-grained speed approaches the two-dimensional Maxwell-Boltzmann distribution despite the population fluctuations in the coarse-grained cells. The emergent regularity in the statistical behavior of the system is rationalized by mapping our system to a generalized random walk model. This work demonstrates the capability of the spherical lattice gas automaton in revealing the lattice-guided dynamic structures and simulating the equilibrium physics. It suggests the promising possibility of using lattice gas automata defined on various curved surfaces to explore geometrically driven nonequilibrium physics.

PAM: Particle automata model in simulation of Fusarium graminearum pathogen expansion.

PubMed

Wcisło, Rafał; Miller, S Shea; Dzwinel, Witold

2016-01-21

The multi-scale nature and inherent complexity of biological systems are a great challenge for computer modeling and classical modeling paradigms. We present a novel particle automata modeling metaphor in the context of developing a 3D model of Fusarium graminearum infection in wheat. The system consisting of the host plant and Fusarium pathogen cells can be represented by an ensemble of discrete particles defined by a set of attributes. The cells-particles can interact with each other mimicking mechanical resistance of the cell walls and cell coalescence. The particles can move, while some of their attributes can be changed according to prescribed rules. The rules can represent cellular scales of a complex system, while the integrated particle automata model (PAM) simulates its overall multi-scale behavior. We show that due to the ability of mimicking mechanical interactions of Fusarium tip cells with the host tissue, the model is able to simulate realistic penetration properties of the colonization process reproducing both vertical and lateral Fusarium invasion scenarios. The comparison of simulation results with micrographs from laboratory experiments shows encouraging qualitative agreement between the two. Copyright © 2015 Elsevier Ltd. All rights reserved.

Emergent dynamic structures and statistical law in spherical lattice gas automata

NASA Astrophysics Data System (ADS)

Yao, Zhenwei

2017-12-01

Various lattice gas automata have been proposed in the past decades to simulate physics and address a host of problems on collective dynamics arising in diverse fields. In this work, we employ the lattice gas model defined on the sphere to investigate the curvature-driven dynamic structures and analyze the statistical behaviors in equilibrium. Under the simple propagation and collision rules, we show that the uniform collective movement of the particles on the sphere is geometrically frustrated, leading to several nonequilibrium dynamic structures not found in the planar lattice, such as the emergent bubble and vortex structures. With the accumulation of the collision effect, the system ultimately reaches equilibrium in the sense that the distribution of the coarse-grained speed approaches the two-dimensional Maxwell-Boltzmann distribution despite the population fluctuations in the coarse-grained cells. The emergent regularity in the statistical behavior of the system is rationalized by mapping our system to a generalized random walk model. This work demonstrates the capability of the spherical lattice gas automaton in revealing the lattice-guided dynamic structures and simulating the equilibrium physics. It suggests the promising possibility of using lattice gas automata defined on various curved surfaces to explore geometrically driven nonequilibrium physics.

An energy and cost efficient majority-based RAM cell in quantum-dot cellular automata

NASA Astrophysics Data System (ADS)

Khosroshahy, Milad Bagherian; Moaiyeri, Mohammad Hossein; Navi, Keivan; Bagherzadeh, Nader

Nanotechnologies, notably quantum-dot cellular automata, have achieved major attentions for their prominent features as compared to the conventional CMOS circuitry. Quantum-dot cellular automata, particularly owning to its considerable reduction in size, high switching speed and ultra-low energy consumption, is considered as a potential alternative for the CMOS technology. As the memory unit is one of the most essential components in a digital system, designing a well-optimized QCA random access memory (RAM) cell is an important area of research. In this paper, a new five-input majority gate is presented which is suitable for implementing efficient single-layer QCA circuits. In addition, a new RAM cell with set and reset capabilities is designed based on the proposed majority gate, which has an efficient and low-energy structure. The functionality, performance and energy consumption of the proposed designs are evaluated based on the QCADesigner and QCAPro tools. According to the simulation results, the proposed RAM design leads to on average 38% lower total energy dissipation, 25% smaller area, 20% lower cell count, 28% lower delay and 60% lower QCA cost as compared to its previous counterparts.

Simulation of root forms using cellular automata model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Winarno, Nanang, E-mail: nanang-winarno@upi.edu; Prima, Eka Cahya; Afifah, Ratih Mega Ayu

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 usedmore » 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.« less

Quantitative Analysis of Intra Urban Growth Modeling using socio economic agents by combining cellular automata model with agent based model

NASA Astrophysics Data System (ADS)

Singh, V. K.; Jha, A. K.; Gupta, K.; Srivastav, S. K.

2017-12-01

Recent studies indicate that there is a significant improvement in the urban land use dynamics through modeling at finer spatial resolutions. Geo-computational models such as cellular automata and agent based model have given evident proof regarding the quantification of the urban growth pattern with urban boundary. In recent studies, socio- economic factors such as demography, education rate, household density, parcel price of the current year, distance to road, school, hospital, commercial centers and police station are considered to the major factors influencing the Land Use Land Cover (LULC) pattern of the city. These factors have unidirectional approach to land use pattern which makes it difficult to analyze the spatial aspects of model results both quantitatively and qualitatively. In this study, cellular automata model is combined with generic model known as Agent Based Model to evaluate the impact of socio economic factors on land use pattern. For this purpose, Dehradun an Indian city is selected as a case study. Socio economic factors were collected from field survey, Census of India, Directorate of economic census, Uttarakhand, India. A 3X3 simulating window is used to consider the impact on LULC. Cellular automata model results are examined for the identification of hot spot areas within the urban area and agent based model will be using logistic based regression approach where it will identify the correlation between each factor on LULC and classify the available area into low density, medium density, high density residential or commercial area. In the modeling phase, transition rule, neighborhood effect, cell change factors are used to improve the representation of built-up classes. Significant improvement is observed in the built-up classes from 84 % to 89 %. However after incorporating agent based model with cellular automata model the accuracy improved from 89 % to 94 % in 3 classes of urban i.e. low density, medium density and commercial classes. Sensitivity study of the model indicated that southern and south-west part of the city have shown improvement and small patches of growth are also observed in the north western part of the city.The study highlights the growing importance of socio economic factors and geo-computational modeling approach on changing LULC of newly growing cities of modern India.

STANFORD ARTIFICIAL INTELLIGENCE PROJECT.

DTIC Science & Technology

ARTIFICIAL INTELLIGENCE , GAME THEORY, DECISION MAKING, BIONICS, AUTOMATA, SPEECH RECOGNITION, GEOMETRIC FORMS, LEARNING MACHINES, MATHEMATICAL MODELS, PATTERN RECOGNITION, SERVOMECHANISMS, SIMULATION, BIBLIOGRAPHIES.

Petri Net controller synthesis based on decomposed manufacturing models.

PubMed

Dideban, Abbas; Zeraatkar, Hashem

2018-06-01

Utilizing of supervisory control theory on the real systems in many modeling tools such as Petri Net (PN) becomes challenging in recent years due to the significant states in the automata models or uncontrollable events. The uncontrollable events initiate the forbidden states which might be removed by employing some linear constraints. Although there are many methods which have been proposed to reduce these constraints, enforcing them to a large-scale system is very difficult and complicated. This paper proposes a new method for controller synthesis based on PN modeling. In this approach, the original PN model is broken down into some smaller models in which the computational cost reduces significantly. Using this method, it is easy to reduce and enforce the constraints to a Petri net model. The appropriate results of our proposed method on the PN models denote worthy controller synthesis for the large scale systems. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Mosquito population dynamics from cellular automata-based simulation

NASA Astrophysics Data System (ADS)

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.

Stochastic modeling for dynamics of HIV-1 infection using cellular automata: A review.

PubMed

Precharattana, Monamorn

2016-02-01

Recently, the description of immune response by discrete models has emerged to play an important role to study the problems in the area of human immunodeficiency virus type 1 (HIV-1) infection, leading to AIDS. As infection of target immune cells by HIV-1 mainly takes place in the lymphoid tissue, cellular automata (CA) models thus represent a significant step in understanding when the infected population is dispersed. Motivated by these, the studies of the dynamics of HIV-1 infection using CA in memory have been presented to recognize how CA have been developed for HIV-1 dynamics, which issues have been studied already and which issues still are objectives in future studies.

Collective dynamics in heterogeneous networks of neuronal cellular automata

NASA Astrophysics Data System (ADS)

Manchanda, Kaustubh; Bose, Amitabha; Ramaswamy, Ramakrishna

2017-12-01

We examine the collective dynamics of heterogeneous random networks of model neuronal cellular automata. Each automaton has b active states, a single silent state and r - b - 1 refractory states, and can show 'spiking' or 'bursting' behavior, depending on the values of b. We show that phase transitions that occur in the dynamical activity can be related to phase transitions in the structure of Erdõs-Rényi graphs as a function of edge probability. Different forms of heterogeneity allow distinct structural phase transitions to become relevant. We also show that the dynamics on the network can be described by a semi-annealed process and, as a result, can be related to the Boolean Lyapunov exponent.

The two populations’ cellular automata model with predation based on the Penna model

NASA Astrophysics Data System (ADS)

He, Mingfeng; Lin, Jing; Jiang, Heng; Liu, Xin

2002-09-01

In Penna's single-species asexual bit-string model of biological ageing, the Verhulst factor has too strong a restraining effect on the development of the population. Danuta Makowiec gave an improved model based on the lattice, where the restraining factor of the four neighbours take the place of the Verhulst factor. Here, we discuss the two populations’ Penna model with predation on the planar lattice of two dimensions. A cellular automata model containing movable wolves and sheep has been built. The results show that both the quantity of the wolves and the sheep fluctuate in accordance with the law that one quantity increases while the other one decreases.

A cellular automata model of SARS epidemic spreading

NASA Astrophysics Data System (ADS)

Xu, Tian; Zhang, Peipei; Su, Beibei; Jiang, Yumai; He, Da-Ren

2004-03-01

We suggest a cellular automata model for a simulation on the process of SARS spreading in Beijing. Suppose a number of people are located in a two-dimensional lattice, in which a certain portion belongs to immune and others belong to acceptive. In every time step each of the acceptive people may become ill with a certain probability if one of his 8 neighbors is a SARS patient. At same time all the people have another possibility to change their positions. Each patient will recover or die after different number of days. A recovered patient becomes immune. The numerical simulation by this model leads to the results, which are in a good agreement with the practical statistical data.

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

NASA Astrophysics Data System (ADS)

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.

Object Synthesis in Conway's Game of Life and Other Cellular Automata

NASA Astrophysics Data System (ADS)

Niemiec, Mark D.

Of the very large number of cellular automata rules in existence, a relatively small number of rules may be considered interesting. Some of the features that make such rules interesting permit patterns to expand, contract, separate into multiple sub-patterns, or combine with other patterns. Such rules generally include still-lifes, oscillators, spaceships, spaceship guns, and puffer trains. Such structures can often be used to construct more complicated computational circuitry, and rules that contain them can often be shown to be computationally universal. Conway's Game of Life is one rule that has been well-studied for several decades, and has been shown to be very fruitful in this regard.

Theory of multicolor lattice gas - A cellular automaton Poisson solver

NASA Technical Reports Server (NTRS)

Chen, H.; Matthaeus, W. H.; Klein, L. W.

1990-01-01

The present class of models for cellular automata involving a quiescent hydrodynamic lattice gas with multiple-valued passive labels termed 'colors', the lattice collisions change individual particle colors while preserving net color. The rigorous proofs of the multicolor lattice gases' essential features are rendered more tractable by an equivalent subparticle representation in which the color is represented by underlying two-state 'spins'. Schemes for the introduction of Dirichlet and Neumann boundary conditions are described, and two illustrative numerical test cases are used to verify the theory. The lattice gas model is equivalent to a Poisson equation solution.

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

NASA Astrophysics Data System (ADS)

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

Primitive robotic procedures: automotions for medical liquids in 12th century Asia minor.

PubMed

Penbegul, Necmettin; Atar, Murat; Kendirci, Muammer; Bozkurt, Yasar; Hatipoglu, Namık Kemal; Verit, Ayhan; Kadıoglu, Ates

2014-12-30

In recent years, day by day, robotic surgery applications have increase their role in our medical life. In this article, we reported the discovery of the first primitive robotic applications as automatic machines for the sensitive calculation of liquids such as blood in the literature. Al-Jazari who wrote the book "Elcâmi 'Beyne'l - 'ilm ve'l - 'amel en-nâfi 'fi es-sınaâ 'ti'l - hiyel", lived in Anatolian territory between 1136 and 1206. In this book that was written in the twelfth century, Al-Jazari described nearly fifty graphics of robotic machines and six of them that were designed for medical purposes. We found that some of the robots mentioned in this book are related to medical applications. This book reviews approximately 50 devices, including water clocks, candle clocks, ewers, various automata used for amusement in drink assemblies, automata used for ablution, blood collection tanks, fountains, music devices, devices for water lifting, locks, a protractor, a boat-shaped water clock, and the gate of Diyarbakir City in south-east of Turkey, actually in northern Mesopotamia. We found that automata used for ablution and blood collection tanks were related with medical applications; therefore, we will describe these robots.

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

PubMed

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

2016-11-22

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.

Dynamic and quantitative method of analyzing service consistency evolution based on extended hierarchical finite state automata.

PubMed

Fan, Linjun; Tang, Jun; Ling, Yunxiang; Li, Benxian

2014-01-01

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

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

PubMed Central

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

2016-01-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. PMID:27874024

On complexity and homogeneity measures in predicting biological aggressiveness of prostate cancer; Implication of the cellular automata model of tumor growth.

PubMed

Tanase, Mihai; Waliszewski, Przemyslaw

2015-12-01

We propose a novel approach for the quantitative evaluation of aggressiveness in prostate carcinomas. The spatial distribution of cancer cell nuclei was characterized by the global spatial fractal dimensions D0, D1, and D2. Two hundred eighteen prostate carcinomas were stratified into the classes of equivalence using results of ROC analysis. A simulation of the cellular automata mix defined a theoretical frame for a specific geometric representation of the cell nuclei distribution called a local structure correlation diagram (LSCD). The LSCD and dispersion Hd were computed for each carcinoma. Data mining generated some quantitative criteria describing tumor aggressiveness. Alterations in tumor architecture along progression were associated with some changes in both shape and the quantitative characteristics of the LSCD consistent with those in the automata mix model. Low-grade prostate carcinomas with low complexity and very low biological aggressiveness are defined by the condition D0 < 1.545 and Hd < 38. High-grade carcinomas with high complexity and very high biological aggressiveness are defined by the condition D0 > 1.764 and Hd < 38. The novel homogeneity measure Hd identifies carcinomas with very low aggressiveness within the class of complexity C1 or carcinomas with very high aggressiveness in the class C7. © 2015 Wiley Periodicals, Inc.

Distribution functions of probabilistic automata

NASA Technical Reports Server (NTRS)

Vatan, F.

2001-01-01

Each probabilistic automaton M over an alphabet A defines a probability measure Prob sub(M) on the set of all finite and infinite words over A. We can identify a k letter alphabet A with the set {0, 1,..., k-1}, and, hence, we can consider every finite or infinite word w over A as a radix k expansion of a real number X(w) in the interval [0, 1]. This makes X(w) a random variable and the distribution function of M is defined as usual: F(x) := Prob sub(M) { w: X(w) < x }. Utilizing the fixed-point semantics (denotational semantics), extended to probabilistic computations, we investigate the distribution functions of probabilistic automata in detail. Automata with continuous distribution functions are characterized. By a new, and much more easier method, it is shown that the distribution function F(x) is an analytic function if it is a polynomial. Finally, answering a question posed by D. Knuth and A. Yao, we show that a polynomial distribution function F(x) on [0, 1] can be generated by a prob abilistic automaton iff all the roots of F'(x) = 0 in this interval, if any, are rational numbers. For this, we define two dynamical systems on the set of polynomial distributions and study attracting fixed points of random composition of these two systems.

Subgrouping Automata: automatic sequence subgrouping using phylogenetic tree-based optimum subgrouping algorithm.

PubMed

Seo, Joo-Hyun; Park, Jihyang; Kim, Eun-Mi; Kim, Juhan; Joo, Keehyoung; Lee, Jooyoung; Kim, Byung-Gee

2014-02-01

Sequence subgrouping for a given sequence set can enable various informative tasks such as the functional discrimination of sequence subsets and the functional inference of unknown sequences. Because an identity threshold for sequence subgrouping may vary according to the given sequence set, it is highly desirable to construct a robust subgrouping algorithm which automatically identifies an optimal identity threshold and generates subgroups for a given sequence set. To meet this end, an automatic sequence subgrouping method, named 'Subgrouping Automata' was constructed. Firstly, tree analysis module analyzes the structure of tree and calculates the all possible subgroups in each node. Sequence similarity analysis module calculates average sequence similarity for all subgroups in each node. Representative sequence generation module finds a representative sequence using profile analysis and self-scoring for each subgroup. For all nodes, average sequence similarities are calculated and 'Subgrouping Automata' searches a node showing statistically maximum sequence similarity increase using Student's t-value. A node showing the maximum t-value, which gives the most significant differences in average sequence similarity between two adjacent nodes, is determined as an optimum subgrouping node in the phylogenetic tree. Further analysis showed that the optimum subgrouping node from SA prevents under-subgrouping and over-subgrouping. Copyright © 2013. Published by Elsevier Ltd.

The role of the interaction network in the emergence of diversity of behavior

PubMed Central

Tabacof, Pedro; Von Zuben, Fernando J.

2017-01-01

How can systems in which individuals’ inner workings are very similar to each other, as neural networks or ant colonies, produce so many qualitatively different behaviors, giving rise to roles and specialization? In this work, we bring new perspectives to this question by focusing on the underlying network that defines how individuals in these systems interact. We applied a genetic algorithm to optimize rules and connections of cellular automata in order to solve the density classification task, a classical problem used to study emergent behaviors in decentralized computational systems. The networks used were all generated by the introduction of shortcuts in an originally regular topology, following the small-world model. Even though all cells follow the exact same rules, we observed the existence of different classes of cells’ behaviors in the best cellular automata found—most cells were responsible for memory and others for integration of information. Through the analysis of structural measures and patterns of connections (motifs) in successful cellular automata, we observed that the distribution of shortcuts between distant regions and the speed in which a cell can gather information from different parts of the system seem to be the main factors for the specialization we observed, demonstrating how heterogeneity in a network can create heterogeneity of behavior. PMID:28234962

A Programmable Cellular-Automata Polarized Dirac Vacuum

NASA Astrophysics Data System (ADS)

Osoroma, Drahcir S.

2013-09-01

We explore properties of a `Least Cosmological Unit' (LCU) as an inherent spacetime raster tiling or tessellating the unique backcloth of Holographic Anthropic Multiverse (HAM) cosmology as an array of programmable cellular automata. The HAM vacuum is a scale-invariant HD extension of a covariant polarized Dirac vacuum with `bumps' and `holes' typically described by extended electromagnetic theory corresponding to an Einstein energy-dependent spacetime metric admitting a periodic photon mass. The new cosmology incorporates a unique form of M-Theoretic Calabi-Yau-Poincaré Dodecadedral-AdS5-DS5space (PDS) with mirror symmetry best described by an HD extension of Cramer's Transactional Interpretation when integrated also with an HD extension of the de Broglie-Bohm-Vigier causal interpretation of quantum theory. We incorporate a unique form of large-scale additional dimensionality (LSXD) bearing some similarity to that conceived by Randall and Sundrum; and extend the fundamental basis of our model to the Unified Field, UF. A Sagnac Effect rf-pulsed incursive resonance hierarchy is utilized to manipulate and ballistically program the geometric-topological properties of this putative LSXD space-spacetime network. The model is empirically testable; and it is proposed that a variety of new technologies will arise from ballistic programming of tessellated LCU vacuum cellular automata.

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

PubMed Central

Fan, Linjun; Tang, Jun; Ling, Yunxiang; Li, Benxian

2014-01-01

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

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

NASA Astrophysics Data System (ADS)

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.

Cellular automata model for traffic flow at intersections in internet of vehicles

NASA Astrophysics Data System (ADS)

Zhao, Han-Tao; Liu, Xin-Ru; Chen, Xiao-Xu; Lu, Jian-Cheng

2018-03-01

Considering the effect of the front vehicle's speed, the influence of the brake light and the conflict of the traffic flow, we established a cellular automata model called CE-NS for traffic flow at the intersection in the non-vehicle networking environment. According to the information interaction of Internet of Vehicles (IoV), introducing parameters describing the congestion and the accurate speed of the front vehicle into the CE-NS model, we improved the rules of acceleration, deceleration and conflict, and finally established a cellular automata model for traffic flow at intersections of IoV. The relationship between traffic parameters such as vehicle speed, flow and average travel time is obtained by numerical simulation of two models. Based on this, we compared the traffic situation of the non-vehicle networking environment with conditions of IoV environment, and analyzed the influence of the different degree of IoV on the traffic flow. The results show that the traffic speed is increased, the travel time is reduced, the flux of intersections is increased and the traffic flow is more smoothly under IoV environment. After the vehicle which achieves IoV reaches a certain proportion, the operation effect of the traffic flow begins to improve obviously.

A Pathophysiological Model-Driven Communication for Dynamic Distributed Medical Best Practice Guidance Systems.

PubMed

Hosseini, Mohammad; Jiang, Yu; Wu, Poliang; Berlin, Richard B; Ren, Shangping; Sha, Lui

2016-11-01

There is a great divide between rural and urban areas, particularly in medical emergency care. Although medical best practice guidelines exist and are in hospital handbooks, they are often lengthy and difficult to apply clinically. The challenges are exaggerated for doctors in rural areas and emergency medical technicians (EMT) during patient transport. In this paper, we propose the concept of distributed executable medical best practice guidance systems to assist adherence to best practice from the time that a patient first presents at a rural hospital, through diagnosis and ambulance transfer to arrival and treatment at a regional tertiary hospital center. We codify complex medical knowledge in the form of simplified distributed executable disease automata, from the thin automata at rural hospitals to the rich automata in the regional center hospitals. However, a main challenge is how to efficiently and safely synchronize distributed best practice models as the communication among medical facilities, devices, and professionals generates a large number of messages. This complex problem of patient diagnosis and transport from rural to center facility is also fraught with many uncertainties and changes resulting in a high degree of dynamism. A critically ill patient's medical conditions can change abruptly in addition to changes in the wireless bandwidth during the ambulance transfer. Such dynamics have yet to be addressed in existing literature on telemedicine. To address this situation, we propose a pathophysiological model-driven message exchange communication architecture that ensures the real-time and dynamic requirements of synchronization among distributed emergency best practice models are met in a reliable and safe manner. Taking the signs, symptoms, and progress of stroke patients transported across a geographically distributed healthcare network as the motivating use case, we implement our communication system and apply it to our developed best practice automata using laboratory simulations. Our proof-of-concept experiments shows there is potential for the use of our system in a wide variety of domains.

Semiautomated hybrid algorithm for estimation of three-dimensional liver surface in CT using dynamic cellular automata and level-sets.

PubMed

Dakua, Sarada Prasad; Abinahed, Julien; Al-Ansari, Abdulla

2015-04-01

Liver segmentation continues to remain a major challenge, largely due to its intense complexity with surrounding anatomical structures (stomach, kidney, and heart), high noise level and lack of contrast in pathological computed tomography (CT) data. We present an approach to reconstructing the liver surface in low contrast CT. The main contributions are: (1) a stochastic resonance-based methodology in discrete cosine transform domain is developed to enhance the contrast of pathological liver images, (2) a new formulation is proposed to prevent the object boundary, resulting from the cellular automata method, from leaking into the surrounding areas of similar intensity, and (3) a level-set method is suggested to generate intermediate segmentation contours from two segmented slices distantly located in a subject sequence. We have tested the algorithm on real datasets obtained from two sources, Hamad General Hospital and medical image computing and computer-assisted interventions grand challenge workshop. Various parameters in the algorithm, such as [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text], play imperative roles, thus their values are precisely selected. Both qualitative and quantitative evaluation performed on liver data show promising segmentation accuracy when compared with ground truth data reflecting the potential of the proposed method.

Design of automata theory of cubical complexes with applications to diagnosis and algorithmic description

NASA Technical Reports Server (NTRS)

Roth, J. P.

1972-01-01

The following problems are considered: (1) methods for development of logic design together with algorithms, so that it is possible to compute a test for any failure in the logic design, if such a test exists, and developing algorithms and heuristics for the purpose of minimizing the computation for tests; and (2) a method of design of logic for ultra LSI (large scale integration). It was discovered that the so-called quantum calculus can be extended to render it possible: (1) to describe the functional behavior of a mechanism component by component, and (2) to compute tests for failures, in the mechanism, using the diagnosis algorithm. The development of an algorithm for the multioutput two-level minimization problem is presented and the program MIN 360 was written for this algorithm. The program has options of mode (exact minimum or various approximations), cost function, cost bound, etc., providing flexibility.

Electoral surveys’ influence on the voting processes: a cellular automata model

NASA Astrophysics Data System (ADS)

Alves, S. G.; Oliveira Neto, N. M.; Martins, M. L.

2002-12-01

Nowadays, in societies threatened by atomization, selfishness, short-term thinking, and alienation from political life, there is a renewed debate about classical questions concerning the quality of democratic decision making. In this work a cellular automata model for the dynamics of free elections, based on the social impact theory is proposed. By using computer simulations, power-law distributions for the size of electoral clusters and decision time have been obtained. The major role of broadcasted electoral surveys in guiding opinion formation and stabilizing the “status quo” was demonstrated. Furthermore, it was shown that in societies where these surveys are manipulated within the universally accepted statistical error bars, even a majoritary opposition could be hindered from reaching power through the electoral path.

Investigation of phase diagrams for cylindrical Ising nanotube using cellular automata

NASA Astrophysics Data System (ADS)

Astaraki, M.; Ghaemi, M.; Afzali, K.

2018-05-01

Recent developments in the field of applied nanoscience and nanotechnology have heightened the need for categorizing various characteristics of nanostructures. In this regard, this paper establishes a novel method to investigate magnetic properties (phase diagram and spontaneous magnetization) of a cylindrical Ising nanotube. Using a two-layer Ising model and the core-shell concept, the interactions within nanotube has been modelled. In the model, both ferromagnetic and antiferromagnetic cases have been considered. Furthermore, the effect of nanotube's length on the critical temperature is investigated. The model has been simulated using cellular automata approach and phase diagrams were constructed for different values of inter- and intra-layer couplings. For the antiferromagnetic case, the possibility of existence of compensation point is observed.

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

PubMed

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.

Towards Time Automata and Multi-Agent Systems

NASA Technical Reports Server (NTRS)

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.

History dependent quantum random walks as quantum lattice gas automata

DOE Office of Scientific and Technical Information (OSTI.GOV)

Shakeel, Asif, E-mail: asif.shakeel@gmail.com, E-mail: dmeyer@math.ucsd.edu, E-mail: plove@haverford.edu; Love, Peter J., E-mail: asif.shakeel@gmail.com, E-mail: dmeyer@math.ucsd.edu, E-mail: plove@haverford.edu; Meyer, David A., E-mail: asif.shakeel@gmail.com, E-mail: dmeyer@math.ucsd.edu, E-mail: plove@haverford.edu

Quantum Random Walks (QRW) were first defined as one-particle sectors of Quantum Lattice Gas Automata (QLGA). Recently, they have been generalized to include history dependence, either on previous coin (internal, i.e., spin or velocity) states or on previous position states. These models have the goal of studying the transition to classicality, or more generally, changes in the performance of quantum walks in algorithmic applications. We show that several history dependent QRW can be identified as one-particle sectors of QLGA. This provides a unifying conceptual framework for these models in which the extra degrees of freedom required to store the historymore » information arise naturally as geometrical degrees of freedom on the lattice.« less

Landslides, forest fires, and earthquakes: examples of self-organized critical behavior

NASA Astrophysics Data System (ADS)

Turcotte, Donald L.; Malamud, Bruce D.

2004-09-01

Per Bak conceived self-organized criticality as an explanation for the behavior of the sandpile model. Subsequently, many cellular automata models were found to exhibit similar behavior. Two examples are the forest-fire and slider-block models. Each of these models can be associated with a serious natural hazard: the sandpile model with landslides, the forest-fire model with actual forest fires, and the slider-block model with earthquakes. We examine the noncumulative frequency-area statistics for each natural hazard, and show that each has a robust power-law (fractal) distribution. We propose an inverse-cascade model as a general explanation for the power-law frequency-area statistics of the three cellular-automata models and their ‘associated’ natural hazards.

Evaluating a Novel Cellular Automata-Based Distributed Power Management Approach for Mobile Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Adabi, Sepideh; Adabi, Sahar; Rezaee, Ali

According to the traditional definition of Wireless Sensor Networks (WSNs), static sensors have limited the feasibility of WSNs in some kind of approaches, so the mobility was introduced in WSN. Mobile nodes in a WSN come equipped with battery and from the point of deployment, this battery reserve becomes a valuable resource since it cannot be replenished. Hence, maximizing the network lifetime by minimizing the energy is an important challenge in Mobile WSN. Energy conservation can be accomplished by different approaches. In this paper, we presented an energy conservation solution based on Cellular Automata. The main objective of this solution is based on dynamically adjusting the transmission range and switching between operational states of the sensor nodes.

Modeling a student-classroom interaction in a tutorial-like system using learning automata.

PubMed

Oommen, B John; Hashem, M Khaled

2010-02-01

Almost all of the learning paradigms used in machine learning, learning automata (LA), and learning theory, in general, use the philosophy of a Student (learning mechanism) attempting to learn from a teacher. This paradigm has been generalized in a myriad of ways, including the scenario when there are multiple teachers or a hierarchy of mechanisms that collectively achieve the learning. In this paper, we consider a departure from this paradigm by allowing the Student to be a member of a classroom of Students, where, for the most part, we permit each member of the classroom not only to learn from the teacher(s) but also to "extract" information from any of his fellow Students. This paper deals with issues concerning the modeling, decision-making process, and testing of such a scenario within the LA context. The main result that we show is that a weak learner can actually benefit from this capability of utilizing the information that he gets from a superior colleague-if this information transfer is done appropriately. As far as we know, the whole concept of Students learning from both a teacher and from a classroom of Students is novel and unreported in the literature. The proposed Student-classroom interaction has been tested for numerous strategies and for different environments, including the established benchmarks, and the results show that Students can improve their learning by interacting with each other. For example, for some interaction strategies, a weak Student can improve his learning by up to 73% when interacting with a classroom of Students, which includes Students of various capabilities. In these interactions, the Student does not have a priori knowledge of the identity or characteristics of the Students who offer their assistance.

Probabilistic arithmetic automata and their applications.

PubMed

Marschall, Tobias; Herms, Inke; Kaltenbach, Hans-Michael; Rahmann, Sven

2012-01-01

We present a comprehensive review on probabilistic arithmetic automata (PAAs), a general model to describe chains of operations whose operands depend on chance, along with two algorithms to numerically compute the distribution of the results of such probabilistic calculations. PAAs provide a unifying framework to approach many problems arising in computational biology and elsewhere. We present five different applications, namely 1) pattern matching statistics on random texts, including the computation of the distribution of occurrence counts, waiting times, and clump sizes under hidden Markov background models; 2) exact analysis of window-based pattern matching algorithms; 3) sensitivity of filtration seeds used to detect candidate sequence alignments; 4) length and mass statistics of peptide fragments resulting from enzymatic cleavage reactions; and 5) read length statistics of 454 and IonTorrent sequencing reads. The diversity of these applications indicates the flexibility and unifying character of the presented framework. While the construction of a PAA depends on the particular application, we single out a frequently applicable construction method: We introduce deterministic arithmetic automata (DAAs) to model deterministic calculations on sequences, and demonstrate how to construct a PAA from a given DAA and a finite-memory random text model. This procedure is used for all five discussed applications and greatly simplifies the construction of PAAs. Implementations are available as part of the MoSDi package. Its application programming interface facilitates the rapid development of new applications based on the PAA framework.

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

NASA Astrophysics Data System (ADS)

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.

Algebraic Semantics for Narrative

ERIC Educational Resources Information Center

Kahn, E.

1974-01-01

This paper uses discussion of Edmund Spenser's "The Faerie Queene" to present a theoretical framework for explaining the semantics of narrative discourse. The algebraic theory of finite automata is used. (CK)

Modelling and analyzing the watershed dynamics using Cellular Automata (CA)-Markov model - A geo-information based approach

NASA Astrophysics Data System (ADS)

Behera, Mukunda D.; Borate, Santosh N.; Panda, Sudhindra N.; Behera, Priti R.; Roy, Partha S.

2012-08-01

Improper practices of land use and land cover (LULC) including deforestation, expansion of agriculture and infrastructure development are deteriorating watershed conditions. Here, we have utilized remote sensing and GIS tools to study LULC dynamics using Cellular Automata (CA)-Markov model and predicted the future LULC scenario, in terms of magnitude and direction, based on past trend in a hydrological unit, Choudwar watershed, India. By analyzing the LULC pattern during 1972, 1990, 1999 and 2005 using satellite-derived maps, we observed that the biophysical and socio-economic drivers including residential/industrial development, road-rail and settlement proximity have influenced the spatial pattern of the watershed LULC, leading to an accretive linear growth of agricultural and settlement areas. The annual rate of increase from 1972 to 2004 in agriculture land, settlement was observed to be 181.96, 9.89 ha/year, respectively, while decrease in forest, wetland and marshy land were 91.22, 27.56 and 39.52 ha/year, respectively. Transition probability and transition area matrix derived using inputs of (i) residential/industrial development and (ii) proximity to transportation network as the major causes. The predicted LULC scenario for the year 2014, with reasonably good accuracy would provide useful inputs to the LULC planners for effective management of the watershed. The study is a maiden attempt that revealed agricultural expansion is the main driving force for loss of forest, wetland and marshy land in the Choudwar watershed and has the potential to continue in future. The forest in lower slopes has been converted to agricultural land and may soon take a call on forests occurring on higher slopes. Our study utilizes three time period changes to better account for the trend and the modelling exercise; thereby advocates for better agricultural practices with additional energy subsidy to arrest further forest loss and LULC alternations.

Game-theoretic cooperativity in networks of self-interested units

NASA Astrophysics Data System (ADS)

Barto, Andrew G.

1986-08-01

The behavior of theoretical neural networks is often described in terms of competition and cooperation. I present an approach to network learning that is related to game and team problems in which competition and cooperation have more technical meanings. I briefly describe the application of stochastic learning automata to game and team problems and then present an adaptive element that is a synthesis of aspects of stochastic learning automata and typical neuron-like adaptive elements. These elements act as self-interested agents that work toward improving their performance with respect to their individual preference orderings. Networks of these elements can solve a variety of team decision problems, some of which take the form of layered networks in which the ``hidden units'' become appropriate functional components as they attempt to improve their own payoffs.

Approximate probabilistic cellular automata for the dynamics of single-species populations under discrete logisticlike growth with and without weak Allee effects.

PubMed

Mendonça, J Ricardo G; Gevorgyan, Yeva

2017-05-01

We investigate one-dimensional elementary probabilistic cellular automata (PCA) whose dynamics in first-order mean-field approximation yields discrete logisticlike growth models for a single-species unstructured population with nonoverlapping generations. Beginning with a general six-parameter model, we find constraints on the transition probabilities of the PCA that guarantee that the ensuing approximations make sense in terms of population dynamics and classify the valid combinations thereof. Several possible models display a negative cubic term that can be interpreted as a weak Allee factor. We also investigate the conditions under which a one-parameter PCA derived from the more general six-parameter model can generate valid population growth dynamics. Numerical simulations illustrate the behavior of some of the PCA found.

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

PubMed Central

Pranevicius, Henrikas; Pranevicius, Mindaugas; Pranevicius, Osvaldas; 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. PMID:25705700

Dynamic Simulation of 1D Cellular Automata in the Active aTAM.

PubMed

Jonoska, Nataša; Karpenko, Daria; Seki, Shinnosuke

2015-07-01

The Active aTAM is a tile based model for self-assembly where tiles are able to transfer signals and change identities according to the signals received. We extend Active aTAM to include deactivation signals and thereby allow detachment of tiles. We show that the model allows a dynamic simulation of cellular automata with assemblies that do not record the entire computational history but only the current updates of the states, and thus provide a way for (a) algorithmic dynamical structural changes in the assembly and (b) reusable space in self-assembly. The simulation is such that at a given location the sequence of tiles that attach and detach corresponds precisely to the sequence of states the synchronous cellular automaton generates at that location.

Modelling of Microstructure Changes in Hot Deformed Materials Using Cellular Automata

NASA Astrophysics Data System (ADS)

Kuc, Dariusz; Gawąd, Jerzy

2011-01-01

The paper is focused on application of multi-scale 2D method. Model approach consists of Cellular Automata (CA) model of microstructure development and the finite element code to solve thermo-mechanical problem. Dynamic recrystallization phenomenon is taken into account in 2D CA model which takes advantage of explicit representation of microstructure, including individual grains and grain boundaries. Flow stress is the main material parameter in mechanical part of FE and is calculated on the basis of average dislocation density obtained from CA model. The results attained from the model were validated with the experimental data. In the present study, austenitic steel X3CrNi18-10 was investigated. The examination of microstructure for the initial and final microstructures was carried out, using light microscopy and transmission electron microscopy.

Dynamics of HIV infection on 2D cellular automata

NASA Astrophysics Data System (ADS)

Benyoussef, A.; HafidAllah, N. El; ElKenz, A.; Ez-Zahraouy, H.; Loulidi, M.

2003-05-01

We use a cellular automata approach to describe the interactions of the immune system with the human immunodeficiency virus (HIV). We study the evolution of HIV infection, particularly in the clinical latency period. The results we have obtained show the existence of four different behaviours in the plane of death rate of virus-death rate of infected T cell. These regions meet at a critical point, where the virus density and the infected T cell density remain invariant during the evolution of disease. We have introduced two kinds of treatments, the protease inhibitors and the RT inhibitors, in order to study their effects on the evolution of HIV infection. These treatments are powerful in decreasing the density of the virus in the blood and the delay of the AIDS onset.

Dynamic Simulation of 1D Cellular Automata in the Active aTAM

PubMed Central

Jonoska, Nataša; Karpenko, Daria; Seki, Shinnosuke

2016-01-01

The Active aTAM is a tile based model for self-assembly where tiles are able to transfer signals and change identities according to the signals received. We extend Active aTAM to include deactivation signals and thereby allow detachment of tiles. We show that the model allows a dynamic simulation of cellular automata with assemblies that do not record the entire computational history but only the current updates of the states, and thus provide a way for (a) algorithmic dynamical structural changes in the assembly and (b) reusable space in self-assembly. The simulation is such that at a given location the sequence of tiles that attach and detach corresponds precisely to the sequence of states the synchronous cellular automaton generates at that location. PMID:27789918

Congestion and communication in confined ant traffic

NASA Astrophysics Data System (ADS)

Gravish, Nick; Gold, Gregory; Zangwill, Andrew; Goodisman, Michael A. D.; Goldman, Daniel I.

2014-03-01

Many social animals move and communicate within confined spaces. In subterranean fire ants Solenopsis invicta, mobility within crowded nest tunnels is important for resource and information transport. Within confined tunnels, communication and traffic flow are at odds: trafficking ants communicate through tactile interactions while stopped, yet ants that stop to communicate impose physical obstacles on the traffic. We monitor the bi-directional flow of fire ant workers in laboratory tunnels of varied diameter D. The persistence time of communicating ant aggregations, τ, increases approximately linearly with the number of participating ants, n. The sensitivity of traffic flow increases as D decreases and diverges at a minimum diameter, Dc. A cellular automata model incorporating minimal traffic features--excluded volume and communication duration--reproduces features of the experiment. From the model we identify a competition between information transfer and the need to maintain jam-free traffic flow. We show that by balancing information transfer and traffic flow demands, an optimum group strategy exists which maximizes information throughput. We acknowledge funding from NSF PoLS #0957659 and #PHY-1205878.

Computational complexity of symbolic dynamics at the onset of chaos

NASA Astrophysics Data System (ADS)

Lakdawala, Porus

1996-05-01

In a variety of studies of dynamical systems, the edge of order and chaos has been singled out as a region of complexity. It was suggested by Wolfram, on the basis of qualitative behavior of cellular automata, that the computational basis for modeling this region is the universal Turing machine. In this paper, following a suggestion of Crutchfield, we try to show that the Turing machine model may often be too powerful as a computational model to describe the boundary of order and chaos. In particular we study the region of the first accumulation of period doubling in unimodal and bimodal maps of the interval, from the point of view of language theory. We show that in relation to the ``extended'' Chomsky hierarchy, the relevant computational model in the unimodal case is the nested stack automaton or the related indexed languages, while the bimodal case is modeled by the linear bounded automaton or the related context-sensitive languages.

Magnetohydrodynamic cellular automata

NASA Technical Reports Server (NTRS)

Montgomery, David; Doolen, Gary D.

1987-01-01

A generalization of the hexagonal lattice gas model of Frisch, Hasslacher and Pomeau is shown to lead to two-dimensional magnetohydrodynamics. The method relies on the ideal point-wise conservation law for vector potential.

Modeling Land Use/Cover Changes in an African Rural Landscape

NASA Astrophysics Data System (ADS)

Kamusoko, C.; Aniya, M.

2006-12-01

Land use/cover changes are analyzed in the Bindura district of Zimbabwe, Africa through the integration of data from a time series of Landsat imagery (1973, 1989 and 2000), a household survey and GIS coverages. We employed a hybrid supervised/unsupervised classification approach to generate land use/cover maps from which landscape metrics were calculated. Population and other household variables were derived from a sample of surveyed villages, while road accessibility and slope were obtained from topographic maps and digital elevation model, respectively. Markov-cellular automata modeling approach that incorporates Markov chain analysis, cellular automata and multi-criteria evaluation (MCE) / multi-objective allocation (MOLA) procedures was used to simulate land use/cover changes. A GIS-based MCE technique computed transition potential maps, whereas transition areas were derived from the 1973-2000 land use/cover maps using the Markov chain analysis. A 5 x 5 cellular automata filter was used to develop a spatially explicit contiguity- weighting factor to change the cells based on its previous state and those of its neighbors, while MOLA resolved land use/cover class allocation conflicts. The kappa index of agreement was used for model validation. Observed trends in land use/cover changes indicate that deforestation and the encroachment of cultivation in woodland areas is a continuous trend in the study area. This suggests that economic activities driven by agricultural expansion were the main causes of landscape fragmentation, leading to landscape degradation. Rigorous calibration of transition potential maps done by a MCE algorithm and Markovian transition probabilities produced accurate inputs for the simulation of land use/cover changes. Overall standard kappa index of agreement ranged from 0.73 to 0.83, which is sufficient for simulating land use/cover changes in the study area. Land use/cover simulations under the 1989 and 2000 scenario indicated further landscape degradation in the rural areas of the Bindura district. Keywords: Zimbabwe, land use/cover changes, landscape fragmentation, GIS, land use/cover change modeling, multi-criteria evaluation/multi-objective allocation procedures, Markov-cellular automata

Decomposition of timed automata for solving scheduling problems

NASA Astrophysics Data System (ADS)

Nishi, Tatsushi; Wakatake, Masato

2014-03-01

A decomposition algorithm for scheduling problems based on timed automata (TA) model is proposed. The problem is represented as an optimal state transition problem for TA. The model comprises of the parallel composition of submodels such as jobs and resources. The procedure of the proposed methodology can be divided into two steps. The first step is to decompose the TA model into several submodels by using decomposable condition. The second step is to combine individual solution of subproblems for the decomposed submodels by the penalty function method. A feasible solution for the entire model is derived through the iterated computation of solving the subproblem for each submodel. The proposed methodology is applied to solve flowshop and jobshop scheduling problems. Computational experiments demonstrate the effectiveness of the proposed algorithm compared with a conventional TA scheduling algorithm without decomposition.

A probabilistic cellular automata model for the dynamics of a population driven by logistic growth and weak Allee effect

NASA Astrophysics Data System (ADS)

Mendonça, J. R. G.

2018-04-01

We propose and investigate a one-parameter probabilistic mixture of one-dimensional elementary cellular automata under the guise of a model for the dynamics of a single-species unstructured population with nonoverlapping generations in which individuals have smaller probability of reproducing and surviving in a crowded neighbourhood but also suffer from isolation and dispersal. Remarkably, the first-order mean field approximation to the dynamics of the model yields a cubic map containing terms representing both logistic and weak Allee effects. The model has a single absorbing state devoid of individuals, but depending on the reproduction and survival probabilities can achieve a stable population. We determine the critical probability separating these two phases and find that the phase transition between them is in the directed percolation universality class of critical behaviour.

A novel FPGA-programmable switch matrix interconnection element in quantum-dot cellular automata

NASA Astrophysics Data System (ADS)

Hashemi, Sara; Rahimi Azghadi, Mostafa; Zakerolhosseini, Ali; Navi, Keivan

2015-04-01

The Quantum-dot cellular automata (QCA) is a novel nanotechnology, promising extra low-power, extremely dense and very high-speed structure for the construction of logical circuits at a nanoscale. In this paper, initially previous works on QCA-based FPGA's routing elements are investigated, and then an efficient, symmetric and reliable QCA programmable switch matrix (PSM) interconnection element is introduced. This element has a simple structure and offers a complete routing capability. It is implemented using a bottom-up design approach that starts from a dense and high-speed 2:1 multiplexer and utilise it to build the target PSM interconnection element. In this study, simulations of the proposed circuits are carried out using QCAdesigner, a layout and simulation tool for QCA circuits. The results demonstrate high efficiency of the proposed designs in QCA-based FPGA routing.

An Asynchronous Cellular Automata-Based Adaptive Illumination Facility

NASA Astrophysics Data System (ADS)

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

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

Does Geophysics Need "A new kind of Science"?

NASA Astrophysics Data System (ADS)

Turcotte, D. L.; Rundle, J. B.

2002-12-01

Stephen Wolfram's book "A New Kind of Science" has received a great deal of attention in the last six months, both positive and negative. The theme of the book is that "cellular automata", which arise from spatial and temporal coarse-graining of equations of motion, provide the foundations for a new nonlinear science of "complexity". The old science is the science of partial differential equations. Some of the major contributions of this old science have been in geophysics, i.e. gravity, magnetics, seismic waves, heat flow. The basis of the new science is the use of massive computing and numerical simulations. The new science is motivated by the observations that many physical systems display a vast multiplicity of space and time scales, and have hidden dynamics that in many cases are impossible to directly observe. An example would be molecular dynamics. Statistical physics derives continuum equations from the discrete interactions between atoms and molecules, in the modern world the continuum equations are then discretized using finite differences, finite elements, etc. in order to obtain numerical solutions. Examples of widely used cellular automata models include diffusion limited aggregation and site percolation. Also the class of models that are said to exhibit self-organized criticality, the sand-pile model, the slider-block model, the forest-fire model. Applications of these models include drainage networks, seismicity, distributions of minerals,and the evolution of landforms and coastlines. Simple cellular automata models generate deterministic chaos, i.e. the logistic map.

Computational Modeling of Proteins based on Cellular Automata: A Method of HP Folding Approximation.

PubMed

Madain, Alia; Abu Dalhoum, Abdel Latif; Sleit, Azzam

2018-06-01

The design of a protein folding approximation algorithm is not straightforward even when a simplified model is used. The folding problem is a combinatorial problem, where approximation and heuristic algorithms are usually used to find near optimal folds of proteins primary structures. Approximation algorithms provide guarantees on the distance to the optimal solution. The folding approximation approach proposed here depends on two-dimensional cellular automata to fold proteins presented in a well-studied simplified model called the hydrophobic-hydrophilic model. Cellular automata are discrete computational models that rely on local rules to produce some overall global behavior. One-third and one-fourth approximation algorithms choose a subset of the hydrophobic amino acids to form H-H contacts. Those algorithms start with finding a point to fold the protein sequence into two sides where one side ignores H's at even positions and the other side ignores H's at odd positions. In addition, blocks or groups of amino acids fold the same way according to a predefined normal form. We intend to improve approximation algorithms by considering all hydrophobic amino acids and folding based on the local neighborhood instead of using normal forms. The CA does not assume a fixed folding point. The proposed approach guarantees one half approximation minus the H-H endpoints. This lower bound guaranteed applies to short sequences only. This is proved as the core and the folds of the protein will have two identical sides for all short sequences.

Programmable and autonomous computing machine made of biomolecules

PubMed Central

Benenson, Yaakov; Paz-Elizur, Tamar; Adar, Rivka; Keinan, Ehud; Livneh, Zvi; Shapiro, Ehud

2013-01-01

Devices that convert information from one form into another according to a definite procedure are known as automata. One such hypothetical device is the universal Turing machine1, which stimulated work leading to the development of modern computers. The Turing machine and its special cases2, including finite automata3, operate by scanning a data tape, whose striking analogy to information-encoding biopolymers inspired several designs for molecular DNA computers4–8. Laboratory-scale computing using DNA and human-assisted protocols has been demonstrated9–15, but the realization of computing devices operating autonomously on the molecular scale remains rare16–20. Here we describe a programmable finite automaton comprising DNA and DNA-manipulating enzymes that solves computational problems autonomously. The automaton’s hardware consists of a restriction nuclease and ligase, the software and input are encoded by double-stranded DNA, and programming amounts to choosing appropriate software molecules. Upon mixing solutions containing these components, the automaton processes the input molecule via a cascade of restriction, hybridization and ligation cycles, producing a detectable output molecule that encodes the automaton’s final state, and thus the computational result. In our implementation 1012 automata sharing the same software run independently and in parallel on inputs (which could, in principle, be distinct) in 120 μl solution at room temperature at a combined rate of 109 transitions per second with a transition fidelity greater than 99.8%, consuming less than 10−10 W. PMID:11719800

Index Theory of One Dimensional Quantum Walks and Cellular Automata

NASA Astrophysics Data System (ADS)

Gross, D.; Nesme, V.; Vogts, H.; Werner, R. F.

2012-03-01

If a one-dimensional quantum lattice system is subject to one step of a reversible discrete-time dynamics, it is intuitive that as much "quantum information" as moves into any given block of cells from the left, has to exit that block to the right. For two types of such systems — namely quantum walks and cellular automata — we make this intuition precise by defining an index, a quantity that measures the "net flow of quantum information" through the system. The index supplies a complete characterization of two properties of the discrete dynamics. First, two systems S 1, S 2 can be "pieced together", in the sense that there is a system S which acts like S 1 in one region and like S 2 in some other region, if and only if S 1 and S 2 have the same index. Second, the index labels connected components of such systems: equality of the index is necessary and sufficient for the existence of a continuous deformation of S 1 into S 2. In the case of quantum walks, the index is integer-valued, whereas for cellular automata, it takes values in the group of positive rationals. In both cases, the map {S mapsto ind S} is a group homomorphism if composition of the discrete dynamics is taken as the group law of the quantum systems. Systems with trivial index are precisely those which can be realized by partitioned unitaries, and the prototypes of systems with non-trivial index are shifts.

A cellular automata model for social-learning processes in a classroom context

NASA Astrophysics Data System (ADS)

Bordogna, C. M.; Albano, E. V.

2002-02-01

A model for teaching-learning processes that take place in the classroom is proposed and simulated numerically. Recent ideas taken from the fields of sociology, educational psychology, statistical physics and computational science are key ingredients of the model. Results of simulations are consistent with well-established empirical results obtained in classrooms by means of different evaluation tools. It is shown that students engaged in collaborative groupwork reach higher achievements than those attending traditional lectures only. However, in many cases, this difference is subtle and consequently very difficult to be detected using tests. The influence of the number of students forming the collaborative groups on the average knowledge achieved is also studied and discussed.

Pattern-oriented modeling of agent-based complex systems: Lessons from ecology

USGS Publications Warehouse

Grimm, Volker; Revilla, Eloy; Berger, Uta; Jeltsch, Florian; Mooij, Wolf M.; Railsback, Steven F.; Thulke, Hans-Hermann; Weiner, Jacob; Wiegand, Thorsten; DeAngelis, Donald L.

2005-01-01

Agent-based complex systems are dynamic networks of many interacting agents; examples include ecosystems, financial markets, and cities. The search for general principles underlying the internal organization of such systems often uses bottom-up simulation models such as cellular automata and agent-based models. No general framework for designing, testing, and analyzing bottom-up models has yet been established, but recent advances in ecological modeling have come together in a general strategy we call pattern-oriented modeling. This strategy provides a unifying framework for decoding the internal organization of agent-based complex systems and may lead toward unifying algorithmic theories of the relation between adaptive behavior and system complexity.

Pattern-Oriented Modeling of Agent-Based Complex Systems: Lessons from Ecology

NASA Astrophysics Data System (ADS)

Grimm, Volker; Revilla, Eloy; Berger, Uta; Jeltsch, Florian; Mooij, Wolf M.; Railsback, Steven F.; Thulke, Hans-Hermann; Weiner, Jacob; Wiegand, Thorsten; DeAngelis, Donald L.

2005-11-01

Agent-based complex systems are dynamic networks of many interacting agents; examples include ecosystems, financial markets, and cities. The search for general principles underlying the internal organization of such systems often uses bottom-up simulation models such as cellular automata and agent-based models. No general framework for designing, testing, and analyzing bottom-up models has yet been established, but recent advances in ecological modeling have come together in a general strategy we call pattern-oriented modeling. This strategy provides a unifying framework for decoding the internal organization of agent-based complex systems and may lead toward unifying algorithmic theories of the relation between adaptive behavior and system complexity.

Memory-Augmented Cellular Automata for Image Analysis.

DTIC Science & Technology

1978-11-01

case in which each cell has memory size proportional to the logarithm of the input size, showing the increased capabilities of these machines for executing a variety of basic image analysis and recognition tasks. (Author)

Evolution, learning, and cognition

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Y.C.

1988-01-01

The book comprises more than fifteen articles in the areas of neural networks and connectionist systems, classifier systems, adaptive network systems, genetic algorithm, cellular automata, artificial immune systems, evolutionary genetics, cognitive science, optical computing, combinatorial optimization, and cybernetics.

Complexity Theory

USGS Publications Warehouse

Lee, William H K.

2016-01-01

A complex system consists of many interacting parts, generates new collective behavior through self organization, and adaptively evolves through time. Many theories have been developed to study complex systems, including chaos, fractals, cellular automata, self organization, stochastic processes, turbulence, and genetic algorithms.

CAM: A high-performance cellular-automaton machine

NASA Astrophysics Data System (ADS)

Toffoli, Tommaso

1984-01-01

CAM is a high-performance machine dedicated to the simulation of cellular automata and other distributed dynamical systems. Its speed is about one-thousand times greater than that of a general-purpose computer programmed to do the same task; in practical terms, this means that CAM can show the evolution of cellular automata on a color monitor with an update rate, dynamic range, and spatial resolution comparable to those of a Super-8 movie, thus permitting intensive interactive experimentation. Machines of this kind can open up novel fields of research, and in this context it is important that results be easy to obtain, reproduce, and transmit. For these reasons, in designing CAM it was important to achieve functional simplicity, high flexibility, and moderate production cost. We expect that many research groups will be able to own their own copy of the machine to do research with.

Strategies for using cellular automata to locate constrained layer damping on vibrating structures

NASA Astrophysics Data System (ADS)

Chia, C. M.; Rongong, J. A.; Worden, K.

2009-01-01

It is often hard to optimise constrained layer damping (CLD) for structures more complicated than simple beams and plates as its performance depends on its location, the shape of the applied patch, the mode shapes of the structure and the material properties. This paper considers the use of cellular automata (CA) in conjunction with finite element analysis to obtain an efficient coverage of CLD on structures. The effectiveness of several different sets of local rules governing the CA are compared against each other for a structure with known optimum coverage—namely a plate. The algorithm which attempts to replicate most closely known optimal configurations is considered the most successful. This algorithm is then used to generate an efficient CLD treatment that targets several modes of a curved composite panel. To validate the modelling approaches used, results are also presented of a comparison between theoretical and experimentally obtained modal properties of the damped curved panel.

A Coral Reef Algorithm Based on Learning Automata for the Coverage Control Problem of Heterogeneous Directional Sensor Networks

PubMed Central

Li, Ming; Miao, Chunyan; Leung, Cyril

2015-01-01

Coverage control is one of the most fundamental issues in directional sensor networks. In this paper, the coverage optimization problem in a directional sensor network is formulated as a multi-objective optimization problem. It takes into account the coverage rate of the network, the number of working sensor nodes and the connectivity of the network. The coverage problem considered in this paper is characterized by the geographical irregularity of the sensed events and heterogeneity of the sensor nodes in terms of sensing radius, field of angle and communication radius. To solve this multi-objective problem, we introduce a learning automata-based coral reef algorithm for adaptive parameter selection and use a novel Tchebycheff decomposition method to decompose the multi-objective problem into a single-objective problem. Simulation results show the consistent superiority of the proposed algorithm over alternative approaches. PMID:26690162

Fuzzy automata and pattern matching

NASA Technical Reports Server (NTRS)

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.

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

PubMed

Bahar, Ali Newaz; Waheed, Sajjad

2016-01-01

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

A Coral Reef Algorithm Based on Learning Automata for the Coverage Control Problem of Heterogeneous Directional Sensor Networks.

PubMed

Li, Ming; Miao, Chunyan; Leung, Cyril

2015-12-04

Coverage control is one of the most fundamental issues in directional sensor networks. In this paper, the coverage optimization problem in a directional sensor network is formulated as a multi-objective optimization problem. It takes into account the coverage rate of the network, the number of working sensor nodes and the connectivity of the network. The coverage problem considered in this paper is characterized by the geographical irregularity of the sensed events and heterogeneity of the sensor nodes in terms of sensing radius, field of angle and communication radius. To solve this multi-objective problem, we introduce a learning automata-based coral reef algorithm for adaptive parameter selection and use a novel Tchebycheff decomposition method to decompose the multi-objective problem into a single-objective problem. Simulation results show the consistent superiority of the proposed algorithm over alternative approaches.

A Study of Chaos in Cellular Automata

NASA Astrophysics Data System (ADS)

Kamilya, Supreeti; Das, Sukanta

This paper presents a study of chaos in one-dimensional cellular automata (CAs). The communication of information from one part of the system to another has been taken into consideration in this study. This communication is formalized as a binary relation over the set of cells. It is shown that this relation is an equivalence relation and all the cells form a single equivalence class when the cellular automaton (CA) is chaotic. However, the communication between two cells is sometimes blocked in some CAs by a subconfiguration which appears in between the cells during evolution. This blocking of communication by a subconfiguration has been analyzed in this paper with the help of de Bruijn graph. We identify two types of blocking — full and partial. Finally a parameter has been developed for the CAs. We show that the proposed parameter performs better than the existing parameters.

Construction of phase diagrams for nanoscaled Ising thin films on the honeycomb lattice using cellular automata simulation approach

NASA Astrophysics Data System (ADS)

Ghaemi, Mehrdad; Javadi, Nabi

2017-11-01

The phase diagrams of the three-layer Ising model on the honeycomb lattice with a diluted surface have been constructed using the probabilistic cellular automata based on Glauber algorithm. The effects of the exchange interactions on the phase diagrams have been investigated. A general mathematical expression for the critical temperature is obtained in terms of relative coupling r = J1/J and Δs = (Js/J) - 1, where J and Js represent the nearest neighbor coupling within inner- and surface-layers, respectively, and each magnetic site in the surface-layer is coupled with the nearest neighbor site in the inner-layer via the exchange coupling J1. In the case of antiferromagnetic coupling between surface-layer and inner-layer, system reveals many interesting phenomena, such as the possibility of existence of compensation line before the critical temperature.

CATS - A process-based model for turbulent turbidite systems at the reservoir scale

NASA Astrophysics Data System (ADS)

Teles, Vanessa; Chauveau, Benoît; Joseph, Philippe; Weill, Pierre; Maktouf, Fakher

2016-09-01

The Cellular Automata for Turbidite systems (CATS) model is intended to simulate the fine architecture and facies distribution of turbidite reservoirs with a multi-event and process-based approach. The main processes of low-density turbulent turbidity flow are modeled: downslope sediment-laden flow, entrainment of ambient water, erosion and deposition of several distinct lithologies. This numerical model, derived from (Salles, 2006; Salles et al., 2007), proposes a new approach based on the Rouse concentration profile to consider the flow capacity to carry the sediment load in suspension. In CATS, the flow distribution on a given topography is modeled with local rules between neighboring cells (cellular automata) based on potential and kinetic energy balance and diffusion concepts. Input parameters are the initial flow parameters and a 3D topography at depositional time. An overview of CATS capabilities in different contexts is presented and discussed.

Temperature Effects on Olive Fruit Fly Infestation in the FlySim Cellular Automata Model

NASA Astrophysics Data System (ADS)

Bruno, Vincenzo; Baldacchini, Valerio; di Gregorio, Salvatore

FlySim is a Cellular Automata model developed for simulating infestation of olive fruit flies (Bactrocera Oleae) on olive (Olea europaea) groves. The flies move into the groves looking for mature olives where eggs are spawn. This serious agricultural problem is mainly tackled by using chemical agents at the first signs of the infestation, but organic productions with no or few chemicals are strongly requested by the market. Oil made with infested olives is poor in quality, nor olives are suitable for selling in stores. The FlySim model simulates the diffusion of flies looking for mature olives and the growing of flies due to atmospheric conditions. Foreseeing an infestation is the best way to prevent it and to reduce the need of chemicals in agriculture. In this work we investigated the effects of temperature on olive fruit flies and resulting infestation during late spring and summer.

Study on queueing behavior in pedestrian evacuation by extended cellular automata model

NASA Astrophysics Data System (ADS)

Hu, Jun; You, Lei; Zhang, Hong; Wei, Juan; Guo, Yangyong

2018-01-01

This paper proposes a pedestrian evacuation model for effective simulation of evacuation efficiency based on extended cellular automata. In the model, pedestrians' momentary transition probability to a target position is defined in terms of the floor field and queueing time, and the critical time is defined as the waiting time threshold in a queue. Queueing time and critical time are derived using Fractal Brownian Motion through analysis of pedestrian arrival characteristics. Simulations using the platform and actual evacuations were conducted to study the relationships among system evacuation time, average system velocity, pedestrian density, flow rate, and critical time. The results demonstrate that at low pedestrian density, evacuation efficiency can be improved through adoption of the shortest route strategy, and critical time has an inverse relationship with average system velocity. Conversely, at higher pedestrian densities, it is better to adopt the shortest queueing time strategy, and critical time is inversely related to flow rate.

Design of a fault-tolerant reversible control unit in molecular quantum-dot cellular automata

NASA Astrophysics Data System (ADS)

Bahadori, Golnaz; Houshmand, Monireh; Zomorodi-Moghadam, Mariam

Quantum-dot cellular automata (QCA) is a promising emerging nanotechnology that has been attracting considerable attention due to its small feature size, ultra-low power consuming, and high clock frequency. Therefore, there have been many efforts to design computational units based on this technology. Despite these advantages of the QCA-based nanotechnologies, their implementation is susceptible to a high error rate. On the other hand, using the reversible computing leads to zero bit erasures and no energy dissipation. As the reversible computation does not lose information, the fault detection happens with a high probability. In this paper, first we propose a fault-tolerant control unit using reversible gates which improves on the previous design. The proposed design is then synthesized to the QCA technology and is simulated by the QCADesigner tool. Evaluation results indicate the performance of the proposed approach.

Analytical formulation of cellular automata rules using data models

NASA Astrophysics Data System (ADS)

Jaenisch, Holger M.; Handley, James W.

2009-05-01

We present a unique method for converting traditional cellular automata (CA) rules into analytical function form. CA rules have been successfully used for morphological image processing and volumetric shape recognition and classification. Further, the use of CA rules as analog models to the physical and biological sciences can be significantly extended if analytical (as opposed to discrete) models could be formulated. We show that such transformations are possible. We use as our example John Horton Conway's famous "Game of Life" rule set. We show that using Data Modeling, we are able to derive both polynomial and bi-spectrum models of the IF-THEN rules that yield equivalent results. Further, we demonstrate that the "Game of Life" rule set can be modeled using the multi-fluxion, yielding a closed form nth order derivative and integral. All of the demonstrated analytical forms of the CA rule are general and applicable to real-time use.

A stochastic Forest Fire Model for future land cover scenarios assessment

NASA Astrophysics Data System (ADS)

D'Andrea, M.; Fiorucci, P.; Holmes, T. P.

2010-10-01

Land cover is affected by many factors including economic development, climate and natural disturbances such as wildfires. The ability to evaluate how fire regimes may alter future vegetation, and how future vegetation may alter fire regimes, would assist forest managers in planning management actions to be carried out in the face of anticipated socio-economic and climatic change. In this paper, we present a method for calibrating a cellular automata wildfire regime simulation model with actual data on land cover and wildfire size-frequency. The method is based on the observation that many forest fire regimes, in different forest types and regions, exhibit power law frequency-area distributions. The standard Drossel-Schwabl cellular automata Forest Fire Model (DS-FFM) produces simulations which reproduce this observed pattern. However, the standard model is simplistic in that it considers land cover to be binary - each cell either contains a tree or it is empty - and the model overestimates the frequency of large fires relative to actual landscapes. Our new model, the Modified Forest Fire Model (MFFM), addresses this limitation by incorporating information on actual land use and differentiating among various types of flammable vegetation. The MFFM simulation model was tested on forest types with Mediterranean and sub-tropical fire regimes. The results showed that the MFFM was able to reproduce structural fire regime parameters for these two regions. Further, the model was used to forecast future land cover. Future research will extend this model to refine the forecasts of future land cover and fire regime scenarios under climate, land use and socio-economic change.

The salt marsh vegetation spread dynamics simulation and prediction based on conditions optimized CA

NASA Astrophysics Data System (ADS)

Guan, Yujuan; Zhang, Liquan

2006-10-01

The biodiversity conservation and management of the salt marsh vegetation relies on processing their spatial information. Nowadays, more attentions are focused on their classification surveying and describing qualitatively dynamics based on RS images interpreted, rather than on simulating and predicting their dynamics quantitatively, which is of greater importance for managing and planning the salt marsh vegetation. In this paper, our notion is to make a dynamic model on large-scale and to provide a virtual laboratory in which researchers can run it according requirements. Firstly, the characteristic of the cellular automata was analyzed and a conclusion indicated that it was necessary for a CA model to be extended geographically under varying conditions of space-time circumstance in order to make results matched the facts accurately. Based on the conventional cellular automata model, the author introduced several new conditions to optimize it for simulating the vegetation objectively, such as elevation, growth speed, invading ability, variation and inheriting and so on. Hence the CA cells and remote sensing image pixels, cell neighbors and pixel neighbors, cell rules and nature of the plants were unified respectively. Taking JiuDuanSha as the test site, where holds mainly Phragmites australis (P.australis) community, Scirpus mariqueter (S.mariqueter) community and Spartina alterniflora (S.alterniflora) community. The paper explored the process of making simulation and predictions about these salt marsh vegetable changing with the conditions optimized CA (COCA) model, and examined the links among data, statistical models, and ecological predictions. This study exploited the potential of applying Conditioned Optimized CA model technique to solve this problem.

Simulations of Living Cell Origins Using a Cellular Automata Model

NASA Astrophysics Data System (ADS)

Ishida, Takeshi

2014-04-01

Understanding the generalized mechanisms of cell self-assembly is fundamental for applications in various fields, such as mass producing molecular machines in nanotechnology. Thus, the details of real cellular reaction networks and the necessary conditions for self-organized cells must be elucidated. We constructed a 2-dimensional cellular automata model to investigate the emergence of biological cell formation, which incorporated a looped membrane and a membrane-bound information system (akin to a genetic code and gene expression system). In particular, with an artificial reaction system coupled with a thermal system, the simultaneous formation of a looped membrane and an inner reaction process resulted in a more stable structure. These double structures inspired the primitive biological cell formation process from chemical evolution stage. With a model to simulate cellular self-organization in a 2-dimensional cellular automata model, 3 phenomena could be realized: (1) an inner reaction system developed as an information carrier precursor (akin to DNA); (2) a cell border emerged (akin to a cell membrane); and (3) these cell structures could divide into 2. This double-structured cell was considered to be a primary biological cell. The outer loop evolved toward a lipid bilayer membrane, and inner polymeric particles evolved toward precursor information carriers (evolved toward DNA). This model did not completely clarify all the necessary and sufficient conditions for biological cell self-organization. Further, our virtual cells remained unstable and fragile. However, the "garbage bag model" of Dyson proposed that the first living cells were deficient; thus, it would be reasonable that the earliest cells were more unstable and fragile than the simplest current unicellular organisms.

Simulations of living cell origins using a cellular automata model.

PubMed

Ishida, Takeshi

2014-04-01

Understanding the generalized mechanisms of cell self-assembly is fundamental for applications in various fields, such as mass producing molecular machines in nanotechnology. Thus, the details of real cellular reaction networks and the necessary conditions for self-organized cells must be elucidated. We constructed a 2-dimensional cellular automata model to investigate the emergence of biological cell formation, which incorporated a looped membrane and a membrane-bound information system (akin to a genetic code and gene expression system). In particular, with an artificial reaction system coupled with a thermal system, the simultaneous formation of a looped membrane and an inner reaction process resulted in a more stable structure. These double structures inspired the primitive biological cell formation process from chemical evolution stage. With a model to simulate cellular self-organization in a 2-dimensional cellular automata model, 3 phenomena could be realized: (1) an inner reaction system developed as an information carrier precursor (akin to DNA); (2) a cell border emerged (akin to a cell membrane); and (3) these cell structures could divide into 2. This double-structured cell was considered to be a primary biological cell. The outer loop evolved toward a lipid bilayer membrane, and inner polymeric particles evolved toward precursor information carriers (evolved toward DNA). This model did not completely clarify all the necessary and sufficient conditions for biological cell self-organization. Further, our virtual cells remained unstable and fragile. However, the "garbage bag model" of Dyson proposed that the first living cells were deficient; thus, it would be reasonable that the earliest cells were more unstable and fragile than the simplest current unicellular organisms.

Complexity in Dynamical Systems

NASA Astrophysics Data System (ADS)

Moore, Cristopher David

The study of chaos has shown us that deterministic systems can have a kind of unpredictability, based on a limited knowledge of their initial conditions; after a finite time, the motion appears essentially random. This observation has inspired a general interest in the subject of unpredictability, and more generally, complexity; how can we characterize how "complex" a dynamical system is?. In this thesis, we attempt to answer this question with a paradigm of complexity that comes from computer science, we extract sets of symbol sequences, or languages, from a dynamical system using standard methods of symbolic dynamics; we then ask what kinds of grammars or automata are needed a generate these languages. This places them in the Chomsky heirarchy, which in turn tells us something about how subtle and complex the dynamical system's behavior is. This gives us insight into the question of unpredictability, since these automata can also be thought of as computers attempting to predict the system. In the culmination of the thesis, we find a class of smooth, two-dimensional maps which are equivalent to the highest class in the Chomsky heirarchy, the turning machine; they are capable of universal computation. Therefore, these systems possess a kind of unpredictability qualitatively different from the usual "chaos": even if the initial conditions are known exactly, questions about the system's long-term dynamics are undecidable. No algorithm exists to answer them. Although this kind of unpredictability has been discussed in the context of distributed, many-degree-of -freedom systems (for instance, cellular automata) we believe this is the first example of such phenomena in a smooth, finite-degree-of-freedom system.

Combining cellular automata and Lattice Boltzmann method to model multiscale avascular tumor growth coupled with nutrient diffusion and immune competition.

PubMed

Alemani, Davide; Pappalardo, Francesco; Pennisi, Marzio; Motta, Santo; Brusic, Vladimir

2012-02-28

In the last decades the Lattice Boltzmann method (LB) has been successfully used to simulate a variety of processes. The LB model describes the microscopic processes occurring at the cellular level and the macroscopic processes occurring at the continuum level with a unique function, the probability distribution function. Recently, it has been tried to couple deterministic approaches with probabilistic cellular automata (probabilistic CA) methods with the aim to model temporal evolution of tumor growths and three dimensional spatial evolution, obtaining hybrid methodologies. Despite the good results attained by CA-PDE methods, there is one important issue which has not been completely solved: the intrinsic stochastic nature of the interactions at the interface between cellular (microscopic) and continuum (macroscopic) level. CA methods are able to cope with the stochastic phenomena because of their probabilistic nature, while PDE methods are fully deterministic. Even if the coupling is mathematically correct, there could be important statistical effects that could be missed by the PDE approach. For such a reason, to be able to develop and manage a model that takes into account all these three level of complexity (cellular, molecular and continuum), we believe that PDE should be replaced with a statistic and stochastic model based on the numerical discretization of the Boltzmann equation: The Lattice Boltzmann (LB) method. In this work we introduce a new hybrid method to simulate tumor growth and immune system, by applying Cellular Automata Lattice Boltzmann (CA-LB) approach. Copyright © 2011 Elsevier B.V. All rights reserved.

Cellular automata model for use with real freeway data

DOT National Transportation Integrated Search

2002-01-01

The exponential rate of increase in freeway traffic is expanding the need for accurate and : realistic methods to model and predict traffic flow. Traffic modeling and simulation facilitates an : examination of both microscopic and macroscopic views o...

An Automation Framework for Neural Nets that Learn

ERIC Educational Resources Information Center

Kilmer, W. L.; Arbib, M. A.

1973-01-01

A discussion of several types of formal neurons, many of whose functions are modifiable by their own input stimuli. The language of finite automata is used to mathematicize the problem of adaptation sufficiently to remove some ambiguities of Brindley's approach. (Author)

A SIMPLE CELLULAR AUTOMATON MODEL FOR HIGH-LEVEL VEGETATION DYNAMICS

EPA Science Inventory

We have produced a simple two-dimensional (ground-plan) cellular automata model of vegetation dynamics specifically to investigate high-level community processes. The model is probabilistic, with individual plant behavior determined by physiologically-based rules derived from a w...

Software Replica of Minimal Living Processes

NASA Astrophysics Data System (ADS)

Bersini, Hugues

2010-04-01

There is a long tradition of software simulations in theoretical biology to complement pure analytical mathematics which are often limited to reproduce and understand the self-organization phenomena resulting from the non-linear and spatially grounded interactions of the huge number of diverse biological objects. Since John Von Neumann and Alan Turing pioneering works on self-replication and morphogenesis, proponents of artificial life have chosen to resolutely neglecting a lot of materialistic and quantitative information deemed not indispensable and have focused on the rule-based mechanisms making life possible, supposedly neutral with respect to their underlying material embodiment. Minimal life begins at the intersection of a series of processes which need to be isolated, differentiated and duplicated as such in computers. Only software developments and running make possible to understand the way these processes are intimately interconnected in order for life to appear at the crossroad. In this paper, I will attempt to set out the history of life as the disciples of artificial life understand it, by placing these different lessons on a temporal and causal axis, showing which one is indispensable to the appearance of the next and how does it connect to the next. I will discuss the task of artificial life as setting up experimental software platforms where these different lessons, whether taken in isolation or together, are tested, simulated, and, more systematically, analyzed. I will sketch some of these existing software platforms: chemical reaction networks, Varela’s autopoietic cellular automata, Ganti’s chemoton model, whose running delivers interesting take home messages to open-minded biologists.

Product-oriented Software Certification Process for Software Synthesis

NASA Technical Reports Server (NTRS)

Nelson, Stacy; Fischer, Bernd; Denney, Ewen; Schumann, Johann; Richardson, Julian; Oh, Phil

2004-01-01

The purpose of this document is to propose a product-oriented software certification process to facilitate use of software synthesis and formal methods. Why is such a process needed? Currently, software is tested until deemed bug-free rather than proving that certain software properties exist. This approach has worked well in most cases, but unfortunately, deaths still occur due to software failure. Using formal methods (techniques from logic and discrete mathematics like set theory, automata theory and formal logic as opposed to continuous mathematics like calculus) and software synthesis, it is possible to reduce this risk by proving certain software properties. Additionally, software synthesis makes it possible to automate some phases of the traditional software development life cycle resulting in a more streamlined and accurate development process.

Mechanisms of Deformation and Fracture of Thin Coatings on Different Substrates in Instrumented Indentation

NASA Astrophysics Data System (ADS)

Eremina, G. M.; Smolin, A. Yu.; Psakhie, S. G.

2018-04-01

Mechanical properties of thin surface layers and coatings are commonly studied using instrumented indentation and scratch testing, where the mechanical response of the coating - substrate system essentially depends on the substrate material. It is quite difficult to distinguish this dependence and take it into account in the course of full-scale experiments due to a multivariative and nonlinear character of the influence. In this study the process of instrumented indentation of a hardening coating formed on different substrates is investigated numerically by the method of movable cellular automata. As a result of modeling, we identified the features of the substrate material influence on the derived mechanical characteristics of the coating - substrate systems and the processes of their deformation and fracture.

Quantum cloning by cellular automata

NASA Astrophysics Data System (ADS)

D'Ariano, G. M.; Macchiavello, C.; Rossi, M.

2013-03-01

We introduce a quantum cellular automaton that achieves approximate phase-covariant cloning of qubits. The automaton is optimized for 1→2N economical cloning. The use of the automaton for cloning allows us to exploit different foliations for improving the performance with given resources.

Long-Term Memory: A State-Space Approach

ERIC Educational Resources Information Center

Kiss, George R.

1972-01-01

Some salient concepts derived from the information sciences and currently used in theories of human memory are critically reviewed. The application of automata theory is proposed as a new approach in this field. The approach is illustrated by applying it to verbal memory. (Author)

On the Equivalence of Formal Grammars and Machines.

ERIC Educational Resources Information Center

Lund, Bruce

1991-01-01

Explores concepts of formal language and automata theory underlying computational linguistics. A computational formalism is described known as a "logic grammar," with which computational systems process linguistic data, with examples in declarative and procedural semantics and definite clause grammars. (13 references) (CB)

Automatic Management of Parallel and Distributed System Resources

NASA Technical Reports Server (NTRS)

Yan, Jerry; Ngai, Tin Fook; Lundstrom, Stephen F.

1990-01-01

Viewgraphs on automatic management of parallel and distributed system resources are presented. Topics covered include: parallel applications; intelligent management of multiprocessing systems; performance evaluation of parallel architecture; dynamic concurrent programs; compiler-directed system approach; lattice gaseous cellular automata; and sparse matrix Cholesky factorization.

An attempt of modelling debris flows characterised by strong inertial effects through Cellular Automata

NASA Astrophysics Data System (ADS)

Iovine, G.; D'Ambrosio, D.

2003-04-01

Cellular Automata models do represent a valid method for the simulation of complex phenomena, when these latter can be described in "a-centric" terms - i.e. through local interactions within a discrete time-space. In particular, flow-type landslides (such as debris flows) can be viewed as a-centric dynamical system. SCIDDICA S4b, the last release of a family of two-dimensional hexagonal Cellular Automata models, has recently been developed for simulating debris flows characterised by strong inertial effects. It has been derived by progressively enriching an initial simplified CA model, originally derived for simulating very simple cases of slow-moving flow-type landslides. In S4b, by applying an empirical strategy, the inertial characters of the flowing mass have been translated into CA terms. In the transition function of the model, the distribution of landslide debris among the cells is computed by considering the momentum of the debris which move among the cells of the neighbourhood, and privileging the flow direction. By properly setting the value of one of the global parameters of the model (the "inertial factor"), the mechanism of distribution of the landslide debris among the cells can be influenced in order to emphasise the inertial effects, according to the energy of the flowing mass. Moreover, the high complexity of both the model and of the phenomena to be simulated (e.g. debris flows characterised by severe erosion along their path, and by strong inertial effects) suggested to employ an automated technique of evaluation, for the determination of the best set of global parameters. Accordingly, the calibration of the model has been performed through Genetic Algorithms, by considering several real cases of study: these latter have been selected among the population of landslides triggered in Campania (Southern Italy) in May 1998 and December 1999. Obtained results are satisfying: errors computed by comparing the simulations with the map of the real landslides are smaller than those previously obtained either through previous releases of the same model or without Genetic Algorithms. Nevertheless, results are still only preliminary, as the experiments have been realised in sequential computing environment. A more efficient calibration of the model would certainly be possible by adopting a parallel environment of computing, as a great number of tests could be performed in reasonable times; moreover, the parameters' optimisation could be realised in wider ranges, and in greater detail.

Stochastic cellular automata model of neurosphere growth: Roles of proliferative potential, contact inhibition, cell death, and phagocytosis.

PubMed

Sipahi, Rifat; Zupanc, Günther K H

2018-05-14

Neural stem and progenitor cells isolated from the central nervous system form, under specific culture conditions, clonal cell clusters known as neurospheres. The neurosphere assay has proven to be a powerful in vitro system to study the behavior of such cells and the development of their progeny. However, the theory of neurosphere growth has remained poorly understood. To overcome this limitation, we have, in the present paper, developed a cellular automata model, with which we examined the effects of proliferative potential, contact inhibition, cell death, and clearance of dead cells on growth rate, final size, and composition of neurospheres. Simulations based on this model indicated that the proliferative potential of the founder cell and its progenitors has a major influence on neurosphere size. On the other hand, contact inhibition of proliferation limits the final size, and reduces the growth rate, of neurospheres. The effect of this inhibition is particularly dramatic when a stem cell becomes encapsulated by differentiated or other non-proliferating cells, thereby suppressing any further mitotic division - despite the existing proliferative potential of the stem cell. Conversely, clearance of dead cells through phagocytosis is predicted to accelerate growth by reducing contact inhibition. A surprising prediction derived from our model is that cell death, while resulting in a decrease in growth rate and final size of neurospheres, increases the degree of differentiation of neurosphere cells. It is likely that the cellular automata model developed as part of the present investigation is applicable to the study of tissue growth in a wide range of systems. Copyright © 2018 Elsevier Ltd. All rights reserved.

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

PubMed Central

Zhu, Hao; Sun, Yan; Rajagopal, Gunaretnam; Mondry, Adrian; Dhar, Pawan

2004-01-01

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

Cellular automata simulation of topological effects on the dynamics of feed-forward motifs

PubMed Central

Apte, Advait A; Cain, John W; Bonchev, Danail G; Fong, Stephen S

2008-01-01

Background Feed-forward motifs are important functional modules in biological and other complex networks. The functionality of feed-forward motifs and other network motifs is largely dictated by the connectivity of the individual network components. While studies on the dynamics of motifs and networks are usually devoted to the temporal or spatial description of processes, this study focuses on the relationship between the specific architecture and the overall rate of the processes of the feed-forward family of motifs, including double and triple feed-forward loops. The search for the most efficient network architecture could be of particular interest for regulatory or signaling pathways in biology, as well as in computational and communication systems. Results Feed-forward motif dynamics were studied using cellular automata and compared with differential equation modeling. The number of cellular automata iterations needed for a 100% conversion of a substrate into a target product was used as an inverse measure of the transformation rate. Several basic topological patterns were identified that order the specific feed-forward constructions according to the rate of dynamics they enable. At the same number of network nodes and constant other parameters, the bi-parallel and tri-parallel motifs provide higher network efficacy than single feed-forward motifs. Additionally, a topological property of isodynamicity was identified for feed-forward motifs where different network architectures resulted in the same overall rate of the target production. Conclusion It was shown for classes of structural motifs with feed-forward architecture that network topology affects the overall rate of a process in a quantitatively predictable manner. These fundamental results can be used as a basis for simulating larger networks as combinations of smaller network modules with implications on studying synthetic gene circuits, small regulatory systems, and eventually dynamic whole-cell models. PMID:18304325

Topology Optimization - Engineering Contribution to Architectural Design

NASA Astrophysics Data System (ADS)

Tajs-Zielińska, Katarzyna; Bochenek, Bogdan

2017-10-01

The idea of the topology optimization is to find within a considered design domain the distribution of material that is optimal in some sense. Material, during optimization process, is redistributed and parts that are not necessary from objective point of view are removed. The result is a solid/void structure, for which an objective function is minimized. This paper presents an application of topology optimization to multi-material structures. The design domain defined by shape of a structure is divided into sub-regions, for which different materials are assigned. During design process material is relocated, but only within selected region. The proposed idea has been inspired by architectural designs like multi-material facades of buildings. The effectiveness of topology optimization is determined by proper choice of numerical optimization algorithm. This paper utilises very efficient heuristic method called Cellular Automata. Cellular Automata are mathematical, discrete idealization of a physical systems. Engineering implementation of Cellular Automata requires decomposition of the design domain into a uniform lattice of cells. It is assumed, that the interaction between cells takes place only within the neighbouring cells. The interaction is governed by simple, local update rules, which are based on heuristics or physical laws. The numerical studies show, that this method can be attractive alternative to traditional gradient-based algorithms. The proposed approach is evaluated by selected numerical examples of multi-material bridge structures, for which various material configurations are examined. The numerical studies demonstrated a significant influence the material sub-regions location on the final topologies. The influence of assumed volume fraction on final topologies for multi-material structures is also observed and discussed. The results of numerical calculations show, that this approach produces different results as compared with classical one-material problems.

Formal Verification of Quasi-Synchronous Systems

DTIC Science & Technology

2015-07-01

pg. 215-226, Springer-Verlag: London, UK, 2001. [4] Nicolas Halbwachs and Louis Mandel, Simulation and Verification of Asynchronous Systems by...Huang, S. A. Smolka, W. Tan , and S. Tripakis, Deep Random Search for Efficient Model Checking of Timed Automata, in Proceedings of the 13th Monterey

THE USE OF CELLULAR AUTOMATA MODELING APPROACHES TO UNDERSTAND POTENTIAL IMPACTS OF GM PLANTS ON PLANT COMMUNITIES

EPA Science Inventory

The development of models is of interest to ecologists, regulators and developers, since it may assist theoretical understanding, decision making in experimental design, product development and risk assessment. A successful modeling methodology for investigating such characteris...

Project Solo; Newsletter Number Twenty.

ERIC Educational Resources Information Center

Pittsburgh Univ., PA. Project Solo.

Three Project Solo modules are presented. They are designed to teach the concepts of elementary matrix operation, matrix multiplication, and finite-state automata. Together with the module on communication matrices from Newsletter #17 they form a well motivated but structured path to expertise in this area. (JY)

Research 1970/1971: Annual Progress Report.

ERIC Educational Resources Information Center

Georgia Inst. of Tech., Atlanta. Science Information Research Center.

The report presents a summary of science information research activities of the School of Information and Computer Science, Georgia Institute of Technology. Included are project reports on interrelated studies in science information, information processing and systems design, automata and systems theories, and semiotics and linguistics. Also…

Semiotics, Information Science, Documents and Computers.

ERIC Educational Resources Information Center

Warner, Julian

1990-01-01

Discusses the relationship and value of semiotics to the established domains of information science. Highlights include documentation; computer operations; the language of computing; automata theory; linguistics; speech and writing; and the written language as a unifying principle for the document and the computer. (93 references) (LRW)

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

NASA Astrophysics Data System (ADS)

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.

Implementation of Basic and Universal Gates In a single Circuit Based On Quantum-dot Cellular Automata Using Multi-Layer Crossbar Wire

NASA Astrophysics Data System (ADS)

Bhowmik, Dhrubajyoti; Saha, Apu Kr; Dutta, Paramartha; Nandi, Supratim

2017-08-01

Quantum-dot Cellular Automata (QCA) is one of the most substitutes developing nanotechnologies for electronic circuits, as a result of lower force utilization, higher speed and smaller size in correlation with CMOS innovation. The essential devices, a Quantum-dot cell can be utilized to logic gates and wires. As it is the key building block on nanotechnology circuits. By applying simple gates, the hardware requirements for a QCA circuit can be decreased and circuits can be less complex as far as level, delay and cell check. This article exhibits an unobtrusive methodology for actualizing novel upgraded simple and universal gates, which can be connected to outline numerous variations of complex QCA circuits. Proposed gates are straightforward in structure and capable as far as implementing any digital circuits. The main aim is to build all basic and universal gates in a simple circuit with and without crossbar-wire. Simulation results and physical relations affirm its handiness in actualizing each advanced circuit.

A cellular automaton for the signed particle formulation of quantum mechanics

NASA Astrophysics Data System (ADS)

Sellier, J. M.; Kapanova, K. G.; Dimov, I.

2017-02-01

Recently, a new formulation of quantum mechanics, based on the concept of signed particles, has been suggested. In this paper, we introduce a cellular automaton which mimics the dynamics of quantum objects in the phase-space in a time-dependent fashion. This is twofold: it provides a simplified and accessible language to non-physicists who wants to simulate quantum mechanical systems, at the same time it enables a different way to explore the laws of Physics. Moreover, it opens the way towards hybrid simulations of quantum systems by combining full quantum models with cellular automata when the former fail. In order to show the validity of the suggested cellular automaton and its combination with the signed particle formalism, several numerical experiments are performed, showing very promising results. Being this article a preliminary study on quantum simulations in phase-space by means of cellular automata, some conclusions are drawn about the encouraging results obtained so far and the possible future developments.

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

PubMed

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

2016-06-01

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

[A Cellular Automata Model for a Community Comprising Two Plant Species of Different Growth Forms].

PubMed

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

2015-01-01

A cellular automata computer model for the interactions between two plant species of different growth forms--the lime hairgrass Deschampsia caespitosa (L.) P. Beauv., a sod cereal, and the moneywort Lysimachia nummularia L., a ground creeping perennial herb--is considered. Computer experiments on the self-maintenance of the populations of each species against the background of a gradual increase in the share of randomly eliminated individuals, coexistence of the populations of two species, and the effect of the phytogenous field have been conducted. As has been shown, all the studied factors determine the number of individuals and self-sustainability of the simulated populations by the degree of their impact. The limits of action have been determined for individual factors; within these limits, the specific features in plant reproduction and dispersal provide sustainable coexistence of the simulated populations. It has been demonstrated that the constructed model allows for studying the long-term developmental dynamics of the plants belonging to the selected growth forms.

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

NASA Technical Reports Server (NTRS)

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.

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

PubMed

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.

Fast and Epsilon-Optimal Discretized Pursuit Learning Automata.

PubMed

Zhang, JunQi; Wang, Cheng; Zhou, MengChu

2015-10-01

Learning automata (LA) are powerful tools for reinforcement learning. A discretized pursuit LA is the most popular one among them. During an iteration its operation consists of three basic phases: 1) selecting the next action; 2) finding the optimal estimated action; and 3) updating the state probability. However, when the number of actions is large, the learning becomes extremely slow because there are too many updates to be made at each iteration. The increased updates are mostly from phases 1 and 3. A new fast discretized pursuit LA with assured ε -optimality is proposed to perform both phases 1 and 3 with the computational complexity independent of the number of actions. Apart from its low computational complexity, it achieves faster convergence speed than the classical one when operating in stationary environments. This paper can promote the applications of LA toward the large-scale-action oriented area that requires efficient reinforcement learning tools with assured ε -optimality, fast convergence speed, and low computational complexity for each iteration.

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

PubMed

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

2015-12-14

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

Authorship attribution based on Life-Like Network Automata.

PubMed

Machicao, Jeaneth; Corrêa, Edilson A; Miranda, Gisele H B; Amancio, Diego R; Bruno, Odemir M

2018-01-01

The authorship attribution is a problem of considerable practical and technical interest. Several methods have been designed to infer the authorship of disputed documents in multiple contexts. While traditional statistical methods based solely on word counts and related measurements have provided a simple, yet effective solution in particular cases; they are prone to manipulation. Recently, texts have been successfully modeled as networks, where words are represented by nodes linked according to textual similarity measurements. Such models are useful to identify informative topological patterns for the authorship recognition task. However, there is no consensus on which measurements should be used. Thus, we proposed a novel method to characterize text networks, by considering both topological and dynamical aspects of networks. Using concepts and methods from cellular automata theory, we devised a strategy to grasp informative spatio-temporal patterns from this model. Our experiments revealed an outperformance over structural analysis relying only on topological measurements, such as clustering coefficient, betweenness and shortest paths. The optimized results obtained here pave the way for a better characterization of textual networks.

Computer simulation of a cellular automata model for the immune response in a retrovirus system

NASA Astrophysics Data System (ADS)

Pandey, R. B.

1989-02-01

Immune response in a retrovirus system is modeled by a network of three binary cell elements to take into account some of the main functional features of T4 cells, T8 cells, and viruses. Two different intercell interactions are introduced, one of which leads to three fixed points while the other yields bistable fixed points oscillating between a healthy state and a sick state in a mean field treatment. Evolution of these cells is studied for quenched and annealed random interactions on a simple cubic lattice with a nearest neighbor interaction using inhomogenous cellular automata. Populations of T4 cells and viral cells oscillate together with damping (with constant amplitude) for annealed (quenched) interaction on increasing the value of mixing probability B from zero to a characteristic value B ca ( B cq). For higher B, the average number of T4 cells increases while that of the viral infected cells decreases monotonically on increasing B, suggesting a phase transition at B ca ( B cq).

Critical Behavior in Cellular Automata Animal Disease Transmission Model

NASA Astrophysics Data System (ADS)

Morley, P. D.; Chang, Julius

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

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

NASA Astrophysics Data System (ADS)

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.

Modeling Reality - How Computers Mirror Life

NASA Astrophysics Data System (ADS)

Bialynicki-Birula, Iwo; Bialynicka-Birula, Iwona

2005-01-01

The bookModeling Reality covers a wide range of fascinating subjects, accessible to anyone who wants to learn about the use of computer modeling to solve a diverse range of problems, but who does not possess a specialized training in mathematics or computer science. The material presented is pitched at the level of high-school graduates, even though it covers some advanced topics (cellular automata, Shannon's measure of information, deterministic chaos, fractals, game theory, neural networks, genetic algorithms, and Turing machines). These advanced topics are explained in terms of well known simple concepts: Cellular automata - Game of Life, Shannon's formula - Game of twenty questions, Game theory - Television quiz, etc. The book is unique in explaining in a straightforward, yet complete, fashion many important ideas, related to various models of reality and their applications. Twenty-five programs, written especially for this book, are provided on an accompanying CD. They greatly enhance its pedagogical value and make learning of even the more complex topics an enjoyable pleasure.

Experimental Studies of Quasi-Adiabatic Quantum-dot Cellular Automata

NASA Astrophysics Data System (ADS)

Orlov, Alexei; Amlani, Islamshah; Kummamuru, Ravi; Toth, Geza; Bernstein, Gary; Lent, Craig; Snider, Gregory

2000-03-01

The computational approach known as Quantum-dot Cellular Automata (QCA) uses interacting quantum dots to encode and process binary information. The first realization of a functioning QCA cell has already been reported. Recently, quasi-adiabatic switching of QCA in a metal dot system near the instantaneous ground state was proposed [1]. The advantage if this approach is that it allows both logic and addressable memory to be implemented within the QCA framework. We report on the fabrication and measurement of such a device in the Al-AlOx tunnel junction system. This basic building block consists of three metal islands connected in series by tunnel junctions, where an electron can be moved between islands by means of electrostatic perturbation on either control electrodes or adjacent cells. The cell can have three operational modes, i.e. active, locked and null, which provide a solution for ground state computing that is not susceptible to metastable states. [1] G. Toth and C. S. Lent, J. appl. Phys. 85 5, 2977-2984, 1999.

A Model-Driven Development Method for Management Information Systems

NASA Astrophysics Data System (ADS)

Mizuno, Tomoki; Matsumoto, Keinosuke; Mori, Naoki

Traditionally, a Management Information System (MIS) has been developed without using formal methods. By the informal methods, the MIS is developed on its lifecycle without having any models. It causes many problems such as lack of the reliability of system design specifications. In order to overcome these problems, a model theory approach was proposed. The approach is based on an idea that a system can be modeled by automata and set theory. However, it is very difficult to generate automata of the system to be developed right from the start. On the other hand, there is a model-driven development method that can flexibly correspond to changes of business logics or implementing technologies. In the model-driven development, a system is modeled using a modeling language such as UML. This paper proposes a new development method for management information systems applying the model-driven development method to a component of the model theory approach. The experiment has shown that a reduced amount of efforts is more than 30% of all the efforts.

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

PubMed

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.

Ca-Pri a Cellular Automata Phenomenological Research Investigation: Simulation Results

NASA Astrophysics Data System (ADS)

Iannone, G.; Troisi, A.

2013-05-01

Following the introduction of a phenomenological cellular automata (CA) model capable to reproduce city growth and urban sprawl, we develop a toy model simulation considering a realistic framework. The main characteristic of our approach is an evolution algorithm based on inhabitants preferences. The control of grown cells is obtained by means of suitable functions which depend on the initial condition of the simulation. New born urban settlements are achieved by means of a logistic evolution of the urban pattern while urban sprawl is controlled by means of the population evolution function. In order to compare model results with a realistic urban framework we have considered, as the area of study, the island of Capri (Italy) in the Mediterranean Sea. Two different phases of the urban evolution on the island have been taken into account: a new born initial growth as induced by geographic suitability and the simulation of urban spread after 1943 induced by the population evolution after this date.

Stochastic cellular automata model for stock market dynamics

NASA Astrophysics Data System (ADS)

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.

Accurate reliability analysis method for quantum-dot cellular automata circuits

NASA Astrophysics Data System (ADS)

Cui, Huanqing; Cai, Li; Wang, Sen; Liu, Xiaoqiang; Yang, Xiaokuo

2015-10-01

Probabilistic transfer matrix (PTM) is a widely used model in the reliability research of circuits. However, PTM model cannot reflect the impact of input signals on reliability, so it does not completely conform to the mechanism of the novel field-coupled nanoelectronic device which is called quantum-dot cellular automata (QCA). It is difficult to get accurate results when PTM model is used to analyze the reliability of QCA circuits. To solve this problem, we present the fault tree models of QCA fundamental devices according to different input signals. After that, the binary decision diagram (BDD) is used to quantitatively investigate the reliability of two QCA XOR gates depending on the presented models. By employing the fault tree models, the impact of input signals on reliability can be identified clearly and the crucial components of a circuit can be found out precisely based on the importance values (IVs) of components. So this method is contributive to the construction of reliable QCA circuits.

An Optimized Three-Level Design of Decoder Based on Nanoscale Quantum-Dot Cellular Automata

NASA Astrophysics Data System (ADS)

Seyedi, Saeid; Navimipour, Nima Jafari

2018-03-01

Quantum-dot Cellular Automata (QCA) has been potentially considered as a supersede to Complementary Metal-Oxide-Semiconductor (CMOS) because of its inherent advantages. Many QCA-based logic circuits with smaller feature size, improved operating frequency, and lower power consumption than CMOS have been offered. This technology works based on electron relations inside quantum-dots. Due to the importance of designing an optimized decoder in any digital circuit, in this paper, we design, implement and simulate a new 2-to-4 decoder based on QCA with low delay, area, and complexity. The logic functionality of the 2-to-4 decoder is verified using the QCADesigner tool. The results have shown that the proposed QCA-based decoder has high performance in terms of a number of cells, covered area, and time delay. Due to the lower clock pulse frequency, the proposed 2-to-4 decoder is helpful for building QCA-based sequential digital circuits with high performance.

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

PubMed

Esmaeilpour, Mansour; Naderifar, Vahideh; Shukur, Zarina

2014-01-01

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

The Synthesis of Intelligent Real-Time Systems

DTIC Science & Technology

1990-11-09

Synthesis of Intelligent Real - Time Systems . The purpose of the effort was to develop and extend theories and techniques that facilitate the design and...implementation of intelligent real - time systems . In particular, Teleos has extended situated-automata theory to apply to situations in which the system has

HiVy automated translation of stateflow designs for model checking verification

NASA Technical Reports Server (NTRS)

Pingree, Paula

2003-01-01

tool set enables model checking of finite state machines designs. This is acheived by translating state-chart specifications into the input language of the Spin model checker. An abstract syntax of hierarchical sequential automata (HSA) is provided as an intermediate format tool set.

A Turing Machine Simulator.

ERIC Educational Resources Information Center

Navarro, Aaron B.

1981-01-01

Presents a program in Level II BASIC for a TRS-80 computer that simulates a Turing machine and discusses the nature of the device. The program is run interactively and is designed to be used as an educational tool by computer science or mathematics students studying computational or automata theory. (MP)

Probabilistic Relational Structures and Their Applications

ERIC Educational Resources Information Center

Domotor, Zoltan

The principal objects of the investigation reported were, first, to study qualitative probability relations on Boolean algebras, and secondly, to describe applications in the theories of probability logic, information, automata, and probabilistic measurement. The main contribution of this work is stated in 10 definitions and 20 theorems. The basic…

Autonomy-How much is too much

DTIC Science & Technology

2007-06-22

throughout the ages Hero of Alexandria designed a number of water- and air-powered automata[3][4] Leonardo da Vinci designed and built a number...Verlag, 2006. [6] Benedict Sweeney. “Leonardo’s Hands.” http://www.leonardoshands.com/artman2/publish/ leonardos - robot-knight/index.shtml [7] Peter

Collective Behaviors in Spatially Extended Systems with Local Interactions and Synchronous Updating

NASA Astrophysics Data System (ADS)

ChatÉ, H.; Manneville, P.

1992-01-01

Assessing the extent to which dynamical systems with many degrees of freedom can be described within a thermodynamics formalism is a problem that currently attracts much attention. In this context, synchronously updated regular lattices of identical, chaotic elements with local interactions are promising models for which statistical mechanics may be hoped to provide some insights. This article presents a large class of cellular automata rules and coupled map lattices of the above type in space dimensions d = 2 to 6.Such simple models can be approached by a mean-field approximation which usually reduces the dynamics to that of a map governing the evolution of some extensive density. While this approximation is exact in the d = infty limit, where macroscopic variables must display the time-dependent behavior of the mean-field map, basic intuition from equilibrium statistical mechanics rules out any such behavior in a low-dimensional systems, since it would involve the collective motion of locally disordered elements.The models studied are chosen to be as close as possible to mean-field conditions, i.e., rather high space dimension, large connectivity, and equal-weight coupling between sites. While the mean-field evolution is never observed, a new type of non-trivial collective behavior is found, at odds with the predictions of equilibrium statistical mechanics. Both in the cellular automata models and in the coupled map lattices, macroscopic variables frequently display a non-transient, time-dependent, low-dimensional dynamics emerging out of local disorder. Striking examples are period 3 cycles in two-state cellular automata and a Hopf bifurcation for a d = 5 lattice of coupled logistic maps. An extensive account of the phenomenology is given, including a catalog of behaviors, classification tables for the celular automata rules, and bifurcation diagrams for the coupled map lattices.The observed underlying dynamics is accompanied by an intrinsic quasi-Gaussian noise (stemming from the local disorder) which disappears in the infinite-size limit. The collective behaviors constitute a robust phenomenon, resisting external noise, small changes in the local dynamics, and modifications of the initial and boundary conditions. Synchronous updating, high space dimension and the regularity of connections are shown to be crucial ingredients in the subtle build-up of correlations giving rise to the collective motion. The discussion stresses the need for a theoretical understanding that neither equilibrium statistical mechanics nor higher-order mean-field approximations are able to provide.

Geometry and Formal Linguistics.

ERIC Educational Resources Information Center

Huff, George A.

This paper presents a method of encoding geometric line-drawings in a way which allows sets of such drawings to be interpreted as formal languages. A characterization of certain geometric predicates in terms of their properties as languages is obtained, and techniques usually associated with generative grammars and formal automata are then applied…

Sequences for Student Investigation

ERIC Educational Resources Information Center

Barton, Jeffrey; Feil, David; Lartigue, David; Mullins, Bernadette

2004-01-01

We describe two classes of sequences that give rise to accessible problems for undergraduate research. These problems may be understood with virtually no prerequisites and are well suited for computer-aided investigation. The first sequence is a variation of one introduced by Stephen Wolfram in connection with his study of cellular automata. The…

The Concept of Nondeterminism: Its Development and Implications for Teaching

ERIC Educational Resources Information Center

Armoni, Michal; Ben-Ari, Mordechai

2009-01-01

Nondeterminism is a fundamental concept in computer science that appears in various contexts such as automata theory, algorithms and concurrent computation. We present a taxonomy of the different ways that nondeterminism can be defined and used; the categories of the taxonomy are domain, nature, implementation, consistency, execution and…

Associative Memory Acceptors.

ERIC Educational Resources Information Center

Card, Roger

The properties of an associative memory are examined in this paper from the viewpoint of automata theory. A device called an associative memory acceptor is studied under real-time operation. The family "L" of languages accepted by real-time associative memory acceptors is shown to properly contain the family of languages accepted by one-tape,…

Theoretical Branches in Teaching Computer Science

ERIC Educational Resources Information Center

Habiballa, Hashim; Kmet, Tibor

2004-01-01

The present paper describes an educational experiment dealing with teaching the theory of formal languages and automata as well as their application concepts. It presents a practical application of an educational experiment and initial results based on comparative instruction of two samples of students (n = 56). The application concept should…

Forest Fires, Oil Spills, and Fractal Geometry: An Investigation in Two Parts. Part 2: Using Fractal Complexity to Analyze Mathematical Models.

ERIC Educational Resources Information Center

Biehl, L. Charles

1999-01-01

Presents an activity that utilizes the mathematical models of forest fires and oil spills that were generated (in the first part of this activity, published in the November 1998 issue) by students using probability and cellular automata. (ASK)

Model Checking, Abstraction, and Compositional Verification

DTIC Science & Technology

1993-07-01

the ( alois connections used by Bensalrnu el al. [6], and also has some relation to Kurshan’s automata homonuor- phisms [62]. (Actually. we can impose a...multiprocessor simulation model. ACM Transactions on Computer Systems, 4(4):273-298, November 1986. [41 D. L. Beatty, R. E. Bryant, and C.-J. Seger

Simulating Flaring Events via an Intelligent Cellular Automata Mechanism

NASA Astrophysics Data System (ADS)

Dimitropoulou, M.; Vlahos, L.; Isliker, H.; Georgoulis, M.

2010-07-01

We simulate flaring events through a Cellular Automaton (CA) model, in which, for the first time, we use observed vector magnetograms as initial conditions. After non-linear force free extrapolation of the magnetic field from the vector magnetograms, we identify magnetic discontinuities, using two alternative criteria: (1) the average magnetic field gradient, or (2) the normalized magnetic field curl (i.e. the current). Magnetic discontinuities are identified at the grid-sites where the magnetic field gradient or curl exceeds a specified threshold. We then relax the magnetic discontinuities according to the rules of Lu and Hamilton (1991) or Lu et al. (1993), i.e. we redistribute the magnetic field locally so that the discontinuities disappear. In order to simulate the flaring events, we consider several alternative scenarios with regard to: (1) The threshold above which magnetic discontinuities are identified (applying low, high, and height-dependent threshold values); (2) The driving process that occasionally causes new discontinuities (at randomly chosen grid sites, magnetic field increments are added that are perpendicular (or may-be also parallel) to the existing magnetic field). We address the question whether the coronal active region magnetic fields can indeed be considered to be in the state of self-organized criticality (SOC).

Convergence Time and Phase Transition in a Non-monotonic Family of Probabilistic Cellular Automata

NASA Astrophysics Data System (ADS)

Ramos, A. D.; Leite, A.

2017-08-01

In dynamical systems, some of the most important questions are related to phase transitions and convergence time. We consider a one-dimensional probabilistic cellular automaton where their components assume two possible states, zero and one, and interact with their two nearest neighbors at each time step. Under the local interaction, if the component is in the same state as its two neighbors, it does not change its state. In the other cases, a component in state zero turns into a one with probability α , and a component in state one turns into a zero with probability 1-β . For certain values of α and β , we show that the process will always converge weakly to δ 0, the measure concentrated on the configuration where all the components are zeros. Moreover, the mean time of this convergence is finite, and we describe an upper bound in this case, which is a linear function of the initial distribution. We also demonstrate an application of our results to the percolation PCA. Finally, we use mean-field approximation and Monte Carlo simulations to show coexistence of three distinct behaviours for some values of parameters α and β.

Multidisciplinary Design Optimization (MDO) Methods: Their Synergy with Computer Technology in Design Process

NASA Technical Reports Server (NTRS)

Sobieszczanski-Sobieski, Jaroslaw

1998-01-01

The paper identifies speed, agility, human interface, generation of sensitivity information, task decomposition, and data transmission (including storage) as important attributes for a computer environment to have in order to support engineering design effectively. It is argued that when examined in terms of these attributes the presently available environment can be shown to be inadequate a radical improvement is needed, and it may be achieved by combining new methods that have recently emerged from multidisciplinary design optimization (MDO) with massively parallel processing computer technology. The caveat is that, for successful use of that technology in engineering computing, new paradigms for computing will have to be developed - specifically, innovative algorithms that are intrinsically parallel so that their performance scales up linearly with the number of processors. It may be speculated that the idea of simulating a complex behavior by interaction of a large number of very simple models may be an inspiration for the above algorithms, the cellular automata are an example. Because of the long lead time needed to develop and mature new paradigms, development should be now, even though the widespread availability of massively parallel processing is still a few years away.

Computational Science in Armenia (Invited Talk)

NASA Astrophysics Data System (ADS)

Marandjian, H.; Shoukourian, Yu.

This survey is devoted to the development of informatics and computer science in Armenia. The results in theoretical computer science (algebraic models, solutions to systems of general form recursive equations, the methods of coding theory, pattern recognition and image processing), constitute the theoretical basis for developing problem-solving-oriented environments. As examples can be mentioned: a synthesizer of optimized distributed recursive programs, software tools for cluster-oriented implementations of two-dimensional cellular automata, a grid-aware web interface with advanced service trading for linear algebra calculations. In the direction of solving scientific problems that require high-performance computing resources, examples of completed projects include the field of physics (parallel computing of complex quantum systems), astrophysics (Armenian virtual laboratory), biology (molecular dynamics study of human red blood cell membrane), meteorology (implementing and evaluating the Weather Research and Forecast Model for the territory of Armenia). The overview also notes that the Institute for Informatics and Automation Problems of the National Academy of Sciences of Armenia has established a scientific and educational infrastructure, uniting computing clusters of scientific and educational institutions of the country and provides the scientific community with access to local and international computational resources, that is a strong support for computational science in Armenia.

Multidisciplinary Design Optimisation (MDO) Methods: Their Synergy with Computer Technology in the Design Process

NASA Technical Reports Server (NTRS)

Sobieszczanski-Sobieski, Jaroslaw

1999-01-01

The paper identifies speed, agility, human interface, generation of sensitivity information, task decomposition, and data transmission (including storage) as important attributes for a computer environment to have in order to support engineering design effectively. It is argued that when examined in terms of these attributes the presently available environment can be shown to be inadequate. A radical improvement is needed, and it may be achieved by combining new methods that have recently emerged from multidisciplinary design optimisation (MDO) with massively parallel processing computer technology. The caveat is that, for successful use of that technology in engineering computing, new paradigms for computing will have to be developed - specifically, innovative algorithms that are intrinsically parallel so that their performance scales up linearly with the number of processors. It may be speculated that the idea of simulating a complex behaviour by interaction of a large number of very simple models may be an inspiration for the above algorithms; the cellular automata are an example. Because of the long lead time needed to develop and mature new paradigms, development should begin now, even though the widespread availability of massively parallel processing is still a few years away.

Low-Speed Investigation of Upper-Surface Leading-Edge Blowing on a High-Speed Civil Transport Configuration

NASA Technical Reports Server (NTRS)

Banks, Daniel W.; Laflin, Brenda E. Gile; Kemmerly, Guy T.; Campbell, Bryan A.

1999-01-01

The paper identifies speed, agility, human interface, generation of sensitivity information, task decomposition, and data transmission (including storage) as important attributes for a computer environment to have in order to support engineering design effectively. It is argued that when examined in terms of these attributes the presently available environment can be shown to be inadequate. A radical improvement is needed, and it may be achieved by combining new methods that have recently emerged from multidisciplinary design optimisation (MDO) with massively parallel processing computer technology. The caveat is that, for successful use of that technology in engineering computing, new paradigms for computing will have to be developed - specifically, innovative algorithms that are intrinsically parallel so that their performance scales up linearly with the number of processors. It may be speculated that the idea of simulating a complex behaviour by interaction of a large number of very simple models may be an inspiration for the above algorithms; the cellular automata are an example. Because of the long lead time needed to develop and mature new paradigms, development should begin now, even though the widespread availability of massively parallel processing is still a few years away.

A Cellular Automata Approach to Computer Vision and Image Processing.

DTIC Science & Technology

1980-09-01

the ACM, vol. 15, no. 9, pp. 827-837. [ Duda and Hart] R. 0. Duda and P. E. Hart, Pattern Classification and Scene Analysis, Wiley, New York, 1973...Center TR-738, 1979. [Farley] Arthur M. Farley and Andrzej Proskurowski, "Gossiping in Grid Graphs", University of Oregon Computer Science Department CS-TR

Image-Data Compression Using Edge-Optimizing Algorithm for WFA Inference.

ERIC Educational Resources Information Center

Culik, Karel II; Kari, Jarkko

1994-01-01

Presents an inference algorithm that produces a weighted finite automata (WFA), in particular, the grayness functions of graytone images. Image-data compression results based on the new inference algorithm produces a WFA with a relatively small number of edges. Image-data compression results alone and in combination with wavelets are discussed.…

Computational Nonlinear Morphology with Emphasis on Semitic Languages. Studies in Natural Language Processing.

ERIC Educational Resources Information Center

Kiraz, George Anton

This book presents a tractable computational model that can cope with complex morphological operations, especially in Semitic languages, and less complex morphological systems present in Western languages. It outlines a new generalized regular rewrite rule system that uses multiple finite-state automata to cater to root-and-pattern morphology,…

The Role of Automata and Machine Theory in School and College Mathematics Syllabuses.

ERIC Educational Resources Information Center

Holcombe, M.

1981-01-01

The introduction of certain topics in the theory of machines and languages into school and college mathematics courses in place of the more usual discussion of groups and formal logic is proposed. Examples of machines and languages and their interconnections suitable for such courses are outlined. (MP)

Integrating remote sensing, GIS and dynamic models for landscape-level simulation of forest insect disturbance

USDA-ARS?s Scientific Manuscript database

Cellular automata (CA) is a powerful tool in modeling the evolution of macroscopic scale phenomena as it couples time, space, and variable together while remaining in a simplified form. However, such application has remained challenging in landscape-level chronic forest insect epidemics due to the h...

Intelligent Tutoring Systems: Formalization as Automata and Interface Design Using Neural Networks

ERIC Educational Resources Information Center

Curilem, S. Gloria; Barbosa, Andrea R.; de Azevedo, Fernando M.

2007-01-01

This article proposes a mathematical model of Intelligent Tutoring Systems (ITS), based on observations of the behaviour of these systems. One of the most important problems of pedagogical software is to establish a common language between the knowledge areas involved in their development, basically pedagogical, computing and domain areas. A…

A Formal Theory of Perception. Technical Report No. 161.

ERIC Educational Resources Information Center

Rottmayer, William Arthur

An attempt to build a mathematical model of a device that could learn geometry is discussed. The report discusses the background and motivation of the study, the coding problem, the derivation of Suppes "Stimulus-Response Theory of Finite Automata" used in the work in learning theory, and a summary of the technical work. (DB)

Exploring the Uncanny Valley to Find the Edge of Play

ERIC Educational Resources Information Center

Eberle, Scott G.

2009-01-01

Play often rewards us with a thrill or a sense of wonder. But, just over the edge of play, uncanny objects like dolls, automata, robots, and realistic animations may become monstrous rather than marvelous. Drawing from diverse sources, literary evidence, psychological and psychoanalytic theory, new insights in neuroscience, marketing literature,…

Toward a Probabilistic Automata Model of Some Aspects of Code-Switching.

ERIC Educational Resources Information Center

Dearholt, D. W.; Valdes-Fallis, G.

1978-01-01

The purpose of the model is to select either Spanish or English as the language to be used; its goals at this stage of development include modeling code-switching for lexical need, apparently random code-switching, dependency of code-switching upon sociolinguistic context, and code-switching within syntactic constraints. (EJS)

A cellular automata approach to estimate incident-related travel time on Interstate 66 in near real time : final contract report.

DOT National Transportation Integrated Search

2010-03-01

Incidents account for a large portion of all congestion and a need clearly exists for tools to predict and estimate incident effects. This study examined (1) congestion back propagation to estimate the length of the queue and travel time from upstrea...

Teaching Group Theory Using Rubik's Cubes

ERIC Educational Resources Information Center

Cornock, Claire

2015-01-01

Being situated within a course at the applied end of the spectrum of maths degrees, the pure mathematics modules at Sheffield Hallam University have an applied spin. Pure topics are taught through consideration of practical examples such as knots, cryptography and automata. Rubik's cubes are used to teach group theory within a final year pure…

Application of Cellular Automata to Detection of Malicious Network Packets

ERIC Educational Resources Information Center

Brown, Robert L.

2014-01-01

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

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

NASA Astrophysics Data System (ADS)

Jokar Arsanjani, Jamal; Helbich, Marco; Kainz, Wolfgang; Darvishi Boloorani, Ali

2013-04-01

This research analyses the suburban expansion in the metropolitan area of Tehran, Iran. A hybrid model consisting of logistic regression model, Markov chain (MC), and cellular automata (CA) was designed to improve the performance of the standard logistic regression model. Environmental and socio-economic variables dealing with urban sprawl were operationalised to create a probability surface of spatiotemporal states of built-up land use for the years 2006, 2016, and 2026. For validation, the model was evaluated by means of relative operating characteristic values for different sets of variables. The approach was calibrated for 2006 by cross comparing of actual and simulated land use maps. The achieved outcomes represent a match of 89% between simulated and actual maps of 2006, which was satisfactory to approve the calibration process. Thereafter, the calibrated hybrid approach was implemented for forthcoming years. Finally, future land use maps for 2016 and 2026 were predicted by means of this hybrid approach. The simulated maps illustrate a new wave of suburban development in the vicinity of Tehran at the western border of the metropolis during the next decades.

Safety evaluation of driver cognitive failures and driving errors on right-turn filtering movement at signalized road intersections based on Fuzzy Cellular Automata (FCA) model.

PubMed

Chai, Chen; Wong, Yiik Diew; Wang, Xuesong

2017-07-01

This paper proposes a simulation-based approach to estimate safety impact of driver cognitive failures and driving errors. Fuzzy Logic, which involves linguistic terms and uncertainty, is incorporated with Cellular Automata model to simulate decision-making process of right-turn filtering movement at signalized intersections. Simulation experiments are conducted to estimate the relationships between cognitive failures and driving errors with safety performance. Simulation results show Different types of cognitive failures are found to have varied relationship with driving errors and safety performance. For right-turn filtering movement, cognitive failures are more likely to result in driving errors with denser conflicting traffic stream. Moreover, different driving errors are found to have different safety impacts. The study serves to provide a novel approach to linguistically assess cognitions and replicate decision-making procedures of the individual driver. Compare to crash analysis, the proposed FCA model allows quantitative estimation of particular cognitive failures, and the impact of cognitions on driving errors and safety performance. Copyright © 2017 Elsevier Ltd. All rights reserved.

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

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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.

Phase change cellular automata modeling of GeTe, GaSb and SnSe stacked chalcogenide films

NASA Astrophysics Data System (ADS)

Mihai, C.; Velea, A.

2018-06-01

Data storage needs are increasing at a rapid pace across all economic sectors, so the need for new memory technologies with adequate capabilities is also high. Phase change memories (PCMs) are a leading contender in the emerging race for non-volatile memories due to their fast operation speed, high scalability, good reliability and low power consumption. However, in order to meet the present and future storage demands, PCM technologies must further increase the storage density. Here, we employ a probabilistic cellular automata approach to explore the multi-step threshold switching from the reset (off) to the set (on) state in chalcogenide stacked structures. Simulations have shown that in order to obtain multi-step switching with high contrast among different resistance states, the stacked structure needs to contain materials with a large difference among their crystallization temperatures and careful tuning of strata thicknesses. The crystallization dynamics can be controlled through the external energy pulses applied to the system, in such a way that a balance between nucleation and growth in phase change behavior can be achieved, optimized for PCMs.

Conway's Game of Life is a near-critical metastable state in the multiverse of cellular automata.

PubMed

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

Definition and application of a five-parameter characterization of one-dimensional cellular automata rule space.

PubMed

Oliveira, G M; de Oliveira, P P; Omar, N

2001-01-01

Cellular automata (CA) are important as prototypical, spatially extended, discrete dynamical systems. Because the problem of forecasting dynamic behavior of CA is undecidable, various parameter-based approximations have been developed to address the problem. Out of the analysis of the most important parameters available to this end we proposed some guidelines that should be followed when defining a parameter of that kind. Based upon the guidelines, new parameters were proposed and a set of five parameters was selected; two of them were drawn from the literature and three are new ones, defined here. This article presents all of them and makes their qualities evident. Then, two results are described, related to the use of the parameter set in the Elementary Rule Space: a phase transition diagram, and some general heuristics for forecasting the dynamics of one-dimensional CA. Finally, as an example of the application of the selected parameters in high cardinality spaces, results are presented from experiments involving the evolution of radius-3 CA in the Density Classification Task, and radius-2 CA in the Synchronization Task.

Using Cellular Automata for Parking Recommendations in Smart Environments

PubMed Central

Horng, Gwo-Jiun

2014-01-01

In this work, we propose an innovative adaptive recommendation mechanism for smart parking. The cognitive RF module will transmit the vehicle location information and the parking space requirements to the parking congestion computing center (PCCC) when the driver must find a parking space. Moreover, for the parking spaces, we use a cellular automata (CA) model mechanism that can adjust to full and not full parking lot situations. Here, the PCCC can compute the nearest parking lot, the parking lot status and the current or opposite driving direction with the vehicle location information. By considering the driving direction, we can determine when the vehicles must turn around and thus reduce road congestion and speed up finding a parking space. The recommendation will be sent to the drivers through a wireless communication cognitive radio (CR) model after the computation and analysis by the PCCC. The current study evaluates the performance of this approach by conducting computer simulations. The simulation results show the strengths of the proposed smart parking mechanism in terms of avoiding increased congestion and decreasing the time to find a parking space. PMID:25153671

A scale-invariant cellular-automata model for distributed seismicity

NASA Technical Reports Server (NTRS)

Barriere, Benoit; Turcotte, Donald L.

1991-01-01

In the standard cellular-automata model for a fault an element of stress is randomly added to a grid of boxes until a box has four elements, these are then redistributed to the adjacent boxes on the grid. The redistribution can result in one or more of these boxes having four or more elements in which case further redistributions are required. On the average added elements are lost from the edges of the grid. The model is modified so that the boxes have a scale-invariant distribution of sizes. The objective is to model a scale-invariant distribution of fault sizes. When a redistribution from a box occurs it is equivalent to a characteristic earthquake on the fault. A redistribution from a small box (a foreshock) can trigger an instability in a large box (the main shock). A redistribution from a large box always triggers many instabilities in the smaller boxes (aftershocks). The frequency-size statistics for both main shocks and aftershocks satisfy the Gutenberg-Richter relation with b = 0.835 for main shocks and b = 0.635 for aftershocks. Model foreshocks occur 28 percent of the time.

Tuning of quantum entanglement in molecular quantum cellular automata based on mixed-valence tetrameric units.

PubMed

Palii, Andrew; Tsukerblat, Boris

2016-10-25

In this article we consider two coupled tetrameric mixed-valence (MV) units accommodating electron pairs, which play the role of cells in molecular quantum cellular automata. It is supposed that the Coulombic interaction between instantly localized electrons within the cell markedly inhibits the transfer processes between the redox centers. Under this condition, as well as due to the vibronic localization of the electron pair, the cell can encode binary information, which is controlled by neighboring cells. We show that under certain conditions the two low-lying vibronic spin levels of the cell (ground and first excited states) can be regarded as originating from an effective spin-spin interaction. This is shown to depend on the internal parameters of the cell as well as on the induced polarization. Within this simplified two-level picture we evaluate the quantum entanglement in the system represented by the two electrons in the cell and show how the entanglement within the cell and concurrence can be controlled via polarization of the neighboring cells and temperature.

Authorship attribution based on Life-Like Network Automata

PubMed Central

Machicao, Jeaneth; Corrêa, Edilson A.; Miranda, Gisele H. B.; Amancio, Diego R.

2018-01-01

The authorship attribution is a problem of considerable practical and technical interest. Several methods have been designed to infer the authorship of disputed documents in multiple contexts. While traditional statistical methods based solely on word counts and related measurements have provided a simple, yet effective solution in particular cases; they are prone to manipulation. Recently, texts have been successfully modeled as networks, where words are represented by nodes linked according to textual similarity measurements. Such models are useful to identify informative topological patterns for the authorship recognition task. However, there is no consensus on which measurements should be used. Thus, we proposed a novel method to characterize text networks, by considering both topological and dynamical aspects of networks. Using concepts and methods from cellular automata theory, we devised a strategy to grasp informative spatio-temporal patterns from this model. Our experiments revealed an outperformance over structural analysis relying only on topological measurements, such as clustering coefficient, betweenness and shortest paths. The optimized results obtained here pave the way for a better characterization of textual networks. PMID:29566100

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

PubMed

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.

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

PubMed

Chai, C; Wong, Y D

2014-02-01

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

Molecular quantum cellular automata cell design trade-offs: latching vs. power dissipation.

PubMed

Rahimi, Ehsan; Reimers, Jeffrey R

2018-06-20

The use of molecules to enact quantum cellular automata (QCA) cells has been proposed as a new way for performing electronic logic operations at sub-nm dimensions. A key question that arises concerns whether chemical or physical processes are to be exploited. The use of chemical reactions allows the state of a switch element to be latched in molecular form, making the output of a cell independent of its inputs, but costs energy to do the reaction. Alternatively, if purely electronic polarization is manipulated then no internal latching occurs, but no power is dissipated provided the fields from the inputs change slowly compared to the molecular response times. How these scenarios pan out is discussed by considering calculated properties of the 1,4-diallylbutane cation, a species often used as a paradigm for molecular electronic switching. Utilized are results from different calculation approaches that depict the ion either as a charge-localized mixed-valence compound functioning as a bistable switch, or else as an extremely polarizable molecule with a delocalized electronic structure. Practical schemes for using molecular cells in QCA and other devices emerge.

An Orthogonal Evolutionary Algorithm With Learning Automata for Multiobjective Optimization.

PubMed

Dai, Cai; Wang, Yuping; Ye, Miao; Xue, Xingsi; Liu, Hailin

2016-12-01

Research on multiobjective optimization problems becomes one of the hottest topics of intelligent computation. In order to improve the search efficiency of an evolutionary algorithm and maintain the diversity of solutions, in this paper, the learning automata (LA) is first used for quantization orthogonal crossover (QOX), and a new fitness function based on decomposition is proposed to achieve these two purposes. Based on these, an orthogonal evolutionary algorithm with LA for complex multiobjective optimization problems with continuous variables is proposed. The experimental results show that in continuous states, the proposed algorithm is able to achieve accurate Pareto-optimal sets and wide Pareto-optimal fronts efficiently. Moreover, the comparison with the several existing well-known algorithms: nondominated sorting genetic algorithm II, decomposition-based multiobjective evolutionary algorithm, decomposition-based multiobjective evolutionary algorithm with an ensemble of neighborhood sizes, multiobjective optimization by LA, and multiobjective immune algorithm with nondominated neighbor-based selection, on 15 multiobjective benchmark problems, shows that the proposed algorithm is able to find more accurate and evenly distributed Pareto-optimal fronts than the compared ones.

A solution to the biodiversity paradox by logical deterministic cellular automata.

PubMed

Kalmykov, Lev V; Kalmykov, Vyacheslav L

2015-06-01

The paradox of biological diversity is the key problem of theoretical ecology. The paradox consists in the contradiction between the competitive exclusion principle and the observed biodiversity. The principle is important as the basis for ecological theory. On a relatively simple model we show a mechanism of indefinite coexistence of complete competitors which violates the known formulations of the competitive exclusion principle. This mechanism is based on timely recovery of limiting resources and their spatio-temporal allocation between competitors. Because of limitations of the black-box modeling there was a problem to formulate the exclusion principle correctly. Our white-box multiscale model of two-species competition is based on logical deterministic individual-based cellular automata. This approach provides an automatic deductive inference on the basis of a system of axioms, and gives a direct insight into mechanisms of the studied system. It is one of the most promising methods of artificial intelligence. We reformulate and generalize the competitive exclusion principle and explain why this formulation provides a solution of the biodiversity paradox. In addition, we propose a principle of competitive coexistence.

Computer simulation of a cellular automata model for the immune response in a retrovirus system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pandey, R.B.

1989-02-01

Immune response in a retrovirus system is modeled by a network of three binary cell elements to take into account some of the main functional features of T4 cells, T8 cells, and viruses. Two different intercell interactions are introduced, one of which leads to three fixed points while the other yields bistable fixed points oscillating between a healthy state and a sick state in a mean field treatment. Evolution of these cells is studied for quenched and annealed random interactions on a simple cubic lattice with a nearest neighbor interaction using inhomogenous cellular automata. Populations of T4 cells and viralmore » cells oscillate together with damping (with constant amplitude) for annealed (quenched) interaction on increasing the value of mixing probability B from zero to a characteristic value B/sub ca/ (B/sub cq/). For higher B, the average number of T4 cells increases while that of the viral infected cells decreases monotonically on increasing B, suggesting a phase transition at B/sub ca/ (B/sub cq/).« less

Cook-Levin Theorem Algorithmic-Reducibility/Completeness = Wilson Renormalization-(Semi)-Group Fixed-Points; ``Noise''-Induced Phase-Transitions (NITs) to Accelerate Algorithmics (``NIT-Picking'') REPLACING CRUTCHES!!!: Models: Turing-machine, finite-state-models, finite-automata

NASA Astrophysics Data System (ADS)

Young, Frederic; Siegel, Edward

Cook-Levin theorem theorem algorithmic computational-complexity(C-C) algorithmic-equivalence reducibility/completeness equivalence to renormalization-(semi)-group phase-transitions critical-phenomena statistical-physics universality-classes fixed-points, is exploited via Siegel FUZZYICS =CATEGORYICS = ANALOGYICS =PRAGMATYICS/CATEGORY-SEMANTICS ONTOLOGY COGNITION ANALYTICS-Aristotle ``square-of-opposition'' tabular list-format truth-table matrix analytics predicts and implements ''noise''-induced phase-transitions (NITs) to accelerate versus to decelerate Harel [Algorithmics (1987)]-Sipser[Intro.Thy. Computation(`97)] algorithmic C-C: ''NIT-picking''(!!!), to optimize optimization-problems optimally(OOPO). Versus iso-''noise'' power-spectrum quantitative-only amplitude/magnitude-only variation stochastic-resonance, ''NIT-picking'' is ''noise'' power-spectrum QUALitative-type variation via quantitative critical-exponents variation. Computer-''science''/SEANCE algorithmic C-C models: Turing-machine, finite-state-models, finite-automata,..., discrete-maths graph-theory equivalence to physics Feynman-diagrams are identified as early-days once-workable valid but limiting IMPEDING CRUTCHES(!!!), ONLY IMPEDE latter-days new-insights!!!

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

PubMed Central

Rafi Ahamed, Shaik

2016-01-01

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

Impact of time delay on the dynamics of SEIR epidemic model using cellular automata

NASA Astrophysics Data System (ADS)

Sharma, Natasha; Gupta, Arvind Kumar

2017-04-01

The delay of an infectious disease is significant when aiming to predict its strength and spreading patterns. In this paper the SEIR ​(susceptible-exposed-infected-recovered) epidemic spread with time delay is analyzed through a two-dimensional cellular automata model. The time delay corresponding to the infectious span, predominantly, includes death during the latency period in due course of infection. The advancement of whole system is described by SEIR transition function complemented with crucial factors like inhomogeneous population distribution, birth and disease independent mortality. Moreover, to reflect more realistic population dynamics some stochastic parameters like population movement and connections at local level are also considered. The existence and stability of disease free equilibrium is investigated. Two prime behavioral patterns of disease dynamics is found depending on delay. The critical value of delay, beyond which there are notable variations in spread patterns, is computed. The influence of important parameters affecting the disease dynamics on basic reproduction number is also examined. The results obtained show that delay plays an affirmative role to control disease progression in an infected host.

Evaluation of the dispersion effect in through movement bicycles at signalized intersection via cellular automata simulation

NASA Astrophysics Data System (ADS)

Jiang, Hang; Ma, Yongjian; Jiang, Lin; Chen, Guozhou; Wang, Dongwei

2018-05-01

At signalized intersection areas, bicycle traffic presents a dispersion feature which may influence the movements of vehicles during peak period. The primary objective of this study is to simulate the dispersion effect in through-movement bicycle traffic at intersection areas and evaluate its influence on through-movement traffic. A cellular automata (CA) model is developed and validated to simulate the operations of through-movement bicycle traffic departing from two types of intersection approaches. Simulation results show that bicycles benefit from the dispersion effect when they depart from the approach with an exclusive right-turn vehicle lane. But when bicycles travel from the approach with a shared right-turn and through vehicle lane, the dispersion effect will result in friction interference and block interference on through-movement vehicles. Bicycle interferences reduce the vehicle speed and increase the delay of through-movement vehicles. The policy implications in regard to the dispersion effect from two types of approaches are discussed to improve the performance of through-movement traffic operations at signalized intersections.

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

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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.

On the topological sensitivity of cellular automata

NASA Astrophysics Data System (ADS)

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.

An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks

PubMed Central

Cabessa, Jérémie; Villa, Alessandro E. P.

2014-01-01

We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866

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

NASA Astrophysics Data System (ADS)

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.

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

NASA Astrophysics Data System (ADS)

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

Passive detection of subpixel obstacles for flight safety

NASA Astrophysics Data System (ADS)

Nixon, Matthew D.; Loveland, Rohan C.

2001-12-01

Military aircraft fly below 100 ft. above ground level in support of their missions. These aircraft include fixed and rotary wing and may be manned or unmanned. Flying at these low altitudes presents a safety hazard to the aircrew and aircraft, due to the occurrences of obstacles within the aircraft's flight path. The pilot must rely on eyesight and in some cases, infrared sensors to see obstacles. Many conditions can exacerbate visibility creating a situation in which obstacles are essentially invisible, creating a safety hazard, even to an alerted aircrew. Numerous catastrophic accidents have occurred in which aircraft have collided with undetected obstacles. Accidents of this type continue to be a problem for low flying military and commercial aircraft. Unmanned Aerial Vehicles (UAVs) have the same problem, whether operating autonomously or under control of a ground operator. Boeing-SVS has designed a passive, small, low- cost (under $100k) gimbaled, infrared imaging based system with advanced obstacle detection algorithms. Obstacles are detected in the infrared band, and linear features are analyzed by innovative cellular automata based software. These algorithms perform detection and location of sub-pixel linear features. The detection of the obstacles is performed on a frame by frame basis, in real time. Processed images are presented to the aircrew on their display as color enhanced features. The system has been designed such that the detected obstacles are displayed to the aircrew in sufficient time to react and maneuver the aircraft to safety. A patent for this system is on file with the US patent office, and all material herein should be treated accordingly.

Experimental investigation of the stability boundary for double-diffusive finger convection in a Hele-Shaw cell

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cooper, Clay A.; Glass, Robert J.; Tyler, Scott W.

OAK - B135 We apply high resolution, full field light transmission techniques to study the onset and development of convection in simulated porous media (Hele-Shaw cells) and fractures. The light transmission technique allows quantitative measurement of the solute concentration fields in time thus allowing direct measurements of the mass flux of components. Experiments are first designed to test theoretical stability relations as a function of the solute concentrations, solute diffusivities and the medium's permeability. Structural evolution and convective transport as a function of dimensionless control parameters is then determined across the full range of parameter space. We also consider themore » application of lattice gas automata techniques to numerically model the onset and development of convection. (Gary Drew notified on 3/25/03 of copyrighted Material)« less

Consequences of Landscape Fragmentation on Lyme Disease Risk: A Cellular Automata Approach

PubMed Central

Li, Sen; Hartemink, Nienke; Speybroeck, Niko; Vanwambeke, Sophie O.

2012-01-01

The abundance of infected Ixodid ticks is an important component of human risk of Lyme disease, and various empirical studies have shown that this is associated, at least in part, to landscape fragmentation. In this study, we aimed at exploring how varying woodland fragmentation patterns affect the risk of Lyme disease, through infected tick abundance. A cellular automata model was developed, incorporating a heterogeneous landscape with three interactive components: an age-structured tick population, a classical disease transmission function, and hosts. A set of simplifying assumptions were adopted with respect to the study objective and field data limitations. In the model, the landscape influences both tick survival and host movement. The validation of the model was performed with an empirical study. Scenarios of various landscape configurations (focusing on woodland fragmentation) were simulated and compared. Lyme disease risk indices (density and infection prevalence of nymphs) differed considerably between scenarios: (i) the risk could be higher in highly fragmented woodlands, which is supported by a number of recently published empirical studies, and (ii) grassland could reduce the risk in adjacent woodland, which suggests landscape fragmentation studies of zoonotic diseases should not focus on the patch-level woodland patterns only, but also on landscape-level adjacent land cover patterns. Further analysis of the simulation results indicated strong correlations between Lyme disease risk indices and the density, shape and aggregation level of woodland patches. These findings highlight the strong effect of the spatial patterns of local host population and movement on the spatial dynamics of Lyme disease risks, which can be shaped by woodland fragmentation. In conclusion, using a cellular automata approach is beneficial for modelling complex zoonotic transmission systems as it can be combined with either real world landscapes for exploring direct spatial effects or artificial representations for outlining possible empirical investigations. PMID:22761842

Preliminary cellular-automata forecast of permit activity from 1998 to 2010, Idaho and Western Montana

USGS Publications Warehouse

Raines, G.L.; Zientek, M.L.; Causey, J.D.; Boleneus, D.E.

2002-01-01

For public land management in Idaho and western Montana, the U.S. Forest Service (USFS) has requested that the U.S. Geological Survey (USGS) predict where mineral-related activity will occur in the next decade. Cellular automata provide an approach to simulation of this human activity. Cellular automata (CA) are defined by an array of cells, which evolve by a simple transition rule, the automaton. Based on exploration trends, we assume that future exploration will focus in areas of past exploration. Spatial-temporal information about mineral-related activity, that is permits issued by USFS and Bureau of Land Management (BLM) in the last decade, and spatial information about undiscovered resources, provide a basis to calibrate a CA. The CA implemented is a modified annealed voting rule that simulates mineral-related activity with spatial and temporal resolution of 1 mi2 and 1 year based on activity from 1989 to 1998. For this CA, the state of the economy and exploration technology is assumed constant for the next decade. The calibrated CA reproduces the 1989-1998-permit activity with an agreement of 94%, which increases to 98% within one year. Analysis of the confusion matrix and kappa correlation statistics indicates that the CA underestimates high activity and overestimates low activity. Spatially, the major differences between the actual and calculated activity are that the calculated activity occurs in a slightly larger number of small patches and is slightly more uneven than the actual activity. Using the calibrated CA in a Monte Carlo simulation projecting from 1998 to 2010, an estimate of the probability of mineral activity shows high levels of activity in Boise, Caribou, Elmore, Lincoln, and western Valley counties in Idaho and Beaverhead, Madison, and Stillwater counties in Montana, and generally low activity elsewhere. ?? 2002 International Association for Mathematical Geology.

In silico characterization of cell-cell interactions using a cellular automata model of cell culture.

PubMed

Kihara, Takanori; Kashitani, Kosuke; Miyake, Jun

2017-07-14

Cell proliferation is a key characteristic of eukaryotic cells. During cell proliferation, cells interact with each other. In this study, we developed a cellular automata model to estimate cell-cell interactions using experimentally obtained images of cultured cells. We used four types of cells; HeLa cells, human osteosarcoma (HOS) cells, rat mesenchymal stem cells (MSCs), and rat smooth muscle A7r5 cells. These cells were cultured and stained daily. The obtained cell images were binarized and clipped into squares containing about 10 4 cells. These cells showed characteristic cell proliferation patterns. The growth curves of these cells were generated from the cell proliferation images and we determined the doubling time of these cells from the growth curves. We developed a simple cellular automata system with an easily accessible graphical user interface. This system has five variable parameters, namely, initial cell number, doubling time, motility, cell-cell adhesion, and cell-cell contact inhibition (of proliferation). Within these parameters, we obtained initial cell numbers and doubling times experimentally. We set the motility at a constant value because the effect of the parameter for our simulation was restricted. Therefore, we simulated cell proliferation behavior with cell-cell adhesion and cell-cell contact inhibition as variables. By comparing growth curves and proliferation cell images, we succeeded in determining the cell-cell interaction properties of each cell. Simulated HeLa and HOS cells exhibited low cell-cell adhesion and weak cell-cell contact inhibition. Simulated MSCs exhibited high cell-cell adhesion and positive cell-cell contact inhibition. Simulated A7r5 cells exhibited low cell-cell adhesion and strong cell-cell contact inhibition. These simulated results correlated with the experimental growth curves and proliferation images. Our simulation approach is an easy method for evaluating the cell-cell interaction properties of cells.

Last-position elimination-based learning automata.

PubMed

Zhang, Junqi; Wang, Cheng; Zhou, MengChu

2014-12-01

An update scheme of the state probability vector of actions is critical for learning automata (LA). The most popular is the pursuit scheme that pursues the estimated optimal action and penalizes others. This paper proposes a reverse philosophy that leads to last-position elimination-based learning automata (LELA). The action graded last in terms of the estimated performance is penalized by decreasing its state probability and is eliminated when its state probability becomes zero. All active actions, that is, actions with nonzero state probability, equally share the penalized state probability from the last-position action at each iteration. The proposed LELA is characterized by the relaxed convergence condition for the optimal action, the accelerated step size of the state probability update scheme for the estimated optimal action, and the enriched sampling for the estimated nonoptimal actions. The proof of the ϵ-optimal property for the proposed algorithm is presented. Last-position elimination is a widespread philosophy in the real world and has proved to be also helpful for the update scheme of the learning automaton via the simulations of well-known benchmark environments. In the simulations, two versions of the LELA, using different selection strategies of the last action, are compared with the classical pursuit algorithms Discretized Pursuit Reward-Inaction (DP(RI)) and Discretized Generalized Pursuit Algorithm (DGPA). Simulation results show that the proposed schemes achieve significantly faster convergence and higher accuracy than the classical ones. Specifically, the proposed schemes reduce the interval to find the best parameter for a specific environment in the classical pursuit algorithms. Thus, they can have their parameter tuning easier to perform and can save much more time when applied to a practical case. Furthermore, the convergence curves and the corresponding variance coefficient curves of the contenders are illustrated to characterize their essential differences and verify the analysis results of the proposed algorithms.

Monitoring of seismic time-series with advanced parallel computational tools and complex networks

NASA Astrophysics Data System (ADS)

Kechaidou, M.; Sirakoulis, G. Ch.; Scordilis, E. M.

2012-04-01

Earthquakes have been in the focus of human and research interest for several centuries due to their catastrophic effect to the everyday life as they occur almost all over the world demonstrating a hard to be modelled unpredictable behaviour. On the other hand, their monitoring with more or less technological updated instruments has been almost continuous and thanks to this fact several mathematical models have been presented and proposed so far to describe possible connections and patterns found in the resulting seismological time-series. Especially, in Greece, one of the most seismically active territories on earth, detailed instrumental seismological data are available from the beginning of the past century providing the researchers with valuable and differential knowledge about the seismicity levels all over the country. Considering available powerful parallel computational tools, such as Cellular Automata, these data can be further successfully analysed and, most important, modelled to provide possible connections between different parameters of the under study seismic time-series. More specifically, Cellular Automata have been proven very effective to compose and model nonlinear complex systems resulting in the advancement of several corresponding models as possible analogues of earthquake fault dynamics. In this work preliminary results of modelling of the seismic time-series with the help of Cellular Automata so as to compose and develop the corresponding complex networks are presented. The proposed methodology will be able to reveal under condition hidden relations as found in the examined time-series and to distinguish the intrinsic time-series characteristics in an effort to transform the examined time-series to complex networks and graphically represent their evolvement in the time-space. Consequently, based on the presented results, the proposed model will eventually serve as a possible efficient flexible computational tool to provide a generic understanding of the possible triggering mechanisms as arrived from the adequately monitoring and modelling of the regional earthquake phenomena.

Neural nets on the MPP

NASA Technical Reports Server (NTRS)

Hastings, Harold M.; Waner, Stefan

1987-01-01

The Massively Parallel Processor (MPP) is an ideal machine for computer experiments with simulated neural nets as well as more general cellular automata. Experiments using the MPP with a formal model neural network are described. The results on problem mapping and computational efficiency apply equally well to the neural nets of Hopfield, Hinton et al., and Geman and Geman.

The Use of Cellular Automata in the Learning of Emergence

ERIC Educational Resources Information Center

Faraco, G.; Pantano, P.; Servidio, R.

2006-01-01

In recent years, research efforts on complex systems have contributed to improve our ability in investigating, at different levels of complexity, the emergent behaviour shown by a system in the course of its evolution. The study of emergence, an intrinsic property of a large number of complex systems, can be tackled by making use of Cellular…

Computer Education for Teachers in Secondary Schools; Aims and Objectives in Teacher Training.

ERIC Educational Resources Information Center

International Federation for Information Processing, Geneva (Switzerland). Working Group on Secondary School Education.

Society and education are changing rapidly, and since computers are playing a significant role in these changes it is imperative that secondary school teachers become more fully informed about computers. Computers are of interest to learners because they have led to new theoretical developments, such as automata theory, have many practical…

Landscape- vs gap-level controls on the abundance of a fire-sensitive, late-successional tree species.

Treesearch

Michael C. Wimberly; Thomas A. Spies

2002-01-01

Tsuga heterophylla (western hemlock), a fire-sensitive, late-successional tree species, is an important component of old-growth forests in the Pacific Northwest, USA. In the Oregon Coast Range, however, T. heterophylla occurs at low densities in or is completely absent from many conifer stands. We used a cellular automata-based...

Self-Organized Air Tasking: Examining a Non-Hierarchical Model for Joint Air Operations

DTIC Science & Technology

2004-06-01

refers to systems with this dynamic incoherence as “strong sense of agency ” systems, and uses “weak sense of agency ” to refer to more predictable...agent-based systems, such as robotics or state-determined automata. Increasing the level of dynamic incoherency indicates a stronger sense of agency . This

A quantum Samaritan’s dilemma cellular automaton

PubMed Central

Situ, Haozhen

2017-01-01

The dynamics of a spatial quantum formulation of the iterated Samaritan’s dilemma game with variable entangling is studied in this work. The game is played in the cellular automata manner, i.e. with local and synchronous interaction. The game is assessed in fair and unfair contests, in noiseless scenarios and with disrupting quantum noise. PMID:28680654

Cooperative Networked Control of Dynamical Peer-to-Peer Vehicle Systems

DTIC Science & Technology

2007-12-28

dynamic deployment and task allocation;verification and hybrid systems; and information management for cooperative control. The activity of the...32 5.3 Decidability Results on Discrete and Hybrid Systems ...... .................. 33 5.4 Switched Systems...solved. Verification and hybrid systems. The program has produced significant advances in the theory of hybrid input-output automata, (HIOA) and the

Symbolic Dynamics, Flower Automata and Infinite Traces

NASA Astrophysics Data System (ADS)

Foryś, Wit; Oprocha, Piotr; Bakalarski, Slawomir

Considering a finite alphabet as a set of allowed instructions, we can identify finite words with basic actions or programs. Hence infinite paths on a flower automaton can represent order in which these programs are executed and a flower shift related with it represents list of instructions to be executed at some mid-point of the computation.

Design Pattern Mining Using Distributed Learning Automata and DNA Sequence Alignment

PubMed Central

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

Quantum information and the problem of mechanisms of biological evolution.

PubMed

Melkikh, Alexey V

2014-01-01

One of the most important conditions for replication in early evolution is the de facto elimination of the conformational degrees of freedom of the replicators, the mechanisms of which remain unclear. In addition, realistic evolutionary timescales can be established based only on partially directed evolution, further complicating this issue. A division of the various evolutionary theories into two classes has been proposed based on the presence or absence of a priori information about the evolving system. A priori information plays a key role in solving problems in evolution. Here, a model of partially directed evolution, based on the learning automata theory, which includes a priori information about the fitness space, is proposed. A potential repository of such prior information is the states of biologically important molecules. Thus, the need for extended evolutionary synthesis is discussed. Experiments to test the hypothesis of partially directed evolution are proposed. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

QCCM Center for Quantum Algorithms

DTIC Science & Technology

2008-10-17

algorithms (e.g., quantum walks and adiabatic computing ), as well as theoretical advances relating algorithms to physical implementations (e.g...Park, NC 27709-2211 15. SUBJECT TERMS Quantum algorithms, quantum computing , fault-tolerant error correction Richard Cleve MITACS East Academic...0511200 Algebraic results on quantum automata A. Ambainis, M. Beaudry, M. Golovkins, A. Kikusts, M. Mercer, D. Thrien Theory of Computing Systems 39(2006

A Model Driven Question-Answering System for a CAI Environment. Final Report (July 1970 to May 1972).

ERIC Educational Resources Information Center

Brown, John S.; And Others

A question answering system which permits a computer-assisted instruction (CAI) student greater initiative in the variety of questions he can ask is described. A method is presented to represent the dynamic processes of a subject matter area by augmented finite state automata, which permits efficient inferencing about dynamic processes and…

Searching for Order Within Chaos: Complexity Theorys Implications to Intelligence Support During Joint Operational Planning

DTIC Science & Technology

2017-06-09

structures constantly arise in firefights and skirmishes on the battlefield. Source: Andrew Ilachinski, Artificial War: Multiagent- Based Simulation of...Alternative Methods of Analysis and Innovative Organizational Structures .” Conference, Rome, Italy March 31-April 2. ...Intelligence Analysis, Joint Operational Planning, Cellular Automata, Agent- Based Modeling 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT 18

A cellular automaton implementation of a quantum battle of the sexes game with imperfect information

NASA Astrophysics Data System (ADS)

Alonso-Sanz, Ramón

2015-10-01

The dynamics of a spatial quantum formulation of the iterated battle of the sexes game with imperfect information is studied in this work. The game is played with variable entangling in a cellular automata manner, i.e. with local and synchronous interaction. The effect of spatial structure is assessed in fair and unfair scenarios.

Quantifying the driving factors for language shift in a bilingual region.

PubMed

Prochazka, Katharina; Vogl, Gero

2017-04-25

Many of the world's around 6,000 languages are in danger of disappearing as people give up use of a minority language in favor of the majority language in a process called language shift. Language shift can be monitored on a large scale through the use of mathematical models by way of differential equations, for example, reaction-diffusion equations. Here, we use a different approach: we propose a model for language dynamics based on the principles of cellular automata/agent-based modeling and combine it with very detailed empirical data. Our model makes it possible to follow language dynamics over space and time, whereas existing models based on differential equations average over space and consequently provide no information on local changes in language use. Additionally, cellular automata models can be used even in cases where models based on differential equations are not applicable, for example, in situations where one language has become dispersed and retreated to language islands. Using data from a bilingual region in Austria, we show that the most important factor in determining the spread and retreat of a language is the interaction with speakers of the same language. External factors like bilingual schools or parish language have only a minor influence.

A cellular automata model for avascular solid tumor growth under the effect of therapy

NASA Astrophysics Data System (ADS)

Reis, E. A.; Santos, L. B. L.; Pinho, S. T. R.

2009-04-01

Tumor growth has long been a target of investigation within the context of mathematical and computer modeling. The objective of this study is to propose and analyze a two-dimensional stochastic cellular automata model to describe avascular solid tumor growth, taking into account both the competition between cancer cells and normal cells for nutrients and/or space and a time-dependent proliferation of cancer cells. Gompertzian growth, characteristic of some tumors, is described and some of the features of the time-spatial pattern of solid tumors, such as compact morphology with irregular borders, are captured. The parameter space is studied in order to analyze the occurrence of necrosis and the response to therapy. Our findings suggest that transitions exist between necrotic and non-necrotic phases (no-therapy cases), and between the states of cure and non-cure (therapy cases). To analyze cure, the control and order parameters are, respectively, the highest probability of cancer cell proliferation and the probability of the therapeutic effect on cancer cells. With respect to patterns, it is possible to observe the inner necrotic core and the effect of the therapy destroying the tumor from its outer borders inwards.

Decision theory with resource-bounded agents.

PubMed

Halpern, Joseph Y; Pass, Rafael; Seeman, Lior

2014-04-01

There have been two major lines of research aimed at capturing resource-bounded players in game theory. The first, initiated by Rubinstein (), charges an agent for doing costly computation; the second, initiated by Neyman (), does not charge for computation, but limits the computation that agents can do, typically by modeling agents as finite automata. We review recent work on applying both approaches in the context of decision theory. For the first approach, we take the objects of choice in a decision problem to be Turing machines, and charge players for the "complexity" of the Turing machine chosen (e.g., its running time). This approach can be used to explain well-known phenomena like first-impression-matters biases (i.e., people tend to put more weight on evidence they hear early on) and belief polarization (two people with different prior beliefs, hearing the same evidence, can end up with diametrically opposed conclusions) as the outcomes of quite rational decisions. For the second approach, we model people as finite automata, and provide a simple algorithm that, on a problem that captures a number of settings of interest, provably performs optimally as the number of states in the automaton increases. Copyright © 2014 Cognitive Science Society, Inc.

Analysis of traffic congestion induced by the work zone

NASA Astrophysics Data System (ADS)

Fei, L.; Zhu, H. B.; Han, X. L.

2016-05-01

Based on the cellular automata model, a meticulous two-lane cellular automata model is proposed, in which the driving behavior difference and the difference of vehicles' accelerations between the moving state and the starting state are taken into account. Furthermore the vehicles' motion is refined by using the small cell of one meter long. Then accompanied by coming up with a traffic management measure, a two-lane highway traffic model containing a work zone is presented, in which the road is divided into normal area, merging area and work zone. The vehicles in different areas move forward according to different lane changing rules and position updating rules. After simulation it is found that when the density is small the cluster length in front of the work zone increases with the decrease of the merging probability. Then the suitable merging length and the appropriate speed limit value are recommended. The simulation result in the form of the speed-flow diagram is in good agreement with the empirical data. It indicates that the presented model is efficient and can partially reflect the real traffic. The results may be meaningful for traffic optimization and road construction management.

An effective approach of lesion segmentation within the breast ultrasound image based on the cellular automata principle.

PubMed

Liu, Yan; Cheng, H D; Huang, Jianhua; Zhang, Yingtao; Tang, Xianglong

2012-10-01

In this paper, a novel lesion segmentation within breast ultrasound (BUS) image based on the cellular automata principle is proposed. Its energy transition function is formulated based on global image information difference and local image information difference using different energy transfer strategies. First, an energy decrease strategy is used for modeling the spatial relation information of pixels. For modeling global image information difference, a seed information comparison function is developed using an energy preserve strategy. Then, a texture information comparison function is proposed for considering local image difference in different regions, which is helpful for handling blurry boundaries. Moreover, two neighborhood systems (von Neumann and Moore neighborhood systems) are integrated as the evolution environment, and a similarity-based criterion is used for suppressing noise and reducing computation complexity. The proposed method was applied to 205 clinical BUS images for studying its characteristic and functionality, and several overlapping area error metrics and statistical evaluation methods are utilized for evaluating its performance. The experimental results demonstrate that the proposed method can handle BUS images with blurry boundaries and low contrast well and can segment breast lesions accurately and effectively.

Safety impacts of red light cameras at signalized intersections based on cellular automata models.

PubMed

Chai, C; Wong, Y D; Lum, K M

2015-01-01

This study applies a simulation technique to evaluate the hypothesis that red light cameras (RLCs) exert important effects on accident risks. Conflict occurrences are generated by simulation and compared at intersections with and without RLCs to assess the impact of RLCs on several conflict types under various traffic conditions. Conflict occurrences are generated through simulating vehicular interactions based on an improved cellular automata (CA) model. The CA model is calibrated and validated against field observations at approaches with and without RLCs. Simulation experiments are conducted for RLC and non-RLC intersections with different geometric layouts and traffic demands to generate conflict occurrences that are analyzed to evaluate the hypothesis that RLCs exert important effects on road safety. The comparison of simulated conflict occurrences show favorable safety impacts of RLCs on crossing conflicts and unfavorable impacts for rear-end conflicts during red/amber phases. Corroborative results are found from broad analysis of accident occurrence. RLCs are found to have a mixed effect on accident risk at signalized intersections: crossing collisions are reduced, whereas rear-end collisions may increase. The specially developed CA model is found to be a feasible safety assessment tool.

Using Integer Clocks to Verify the Timing-Sync Sensor Network Protocol

NASA Technical Reports Server (NTRS)

Huang, Xiaowan; Singh, Anu; Smolka, Scott A.

2010-01-01

We use the UPPAAL model checker for Timed Automata to verify the Timing-Sync time-synchronization protocol for sensor networks (TPSN). The TPSN protocol seeks to provide network-wide synchronization of the distributed clocks in a sensor network. Clock-synchronization algorithms for sensor networks such as TPSN must be able to perform arithmetic on clock values to calculate clock drift and network propagation delays. They must be able to read the value of a local clock and assign it to another local clock. Such operations are not directly supported by the theory of Timed Automata. To overcome this formal-modeling obstacle, we augment the UPPAAL specification language with the integer clock derived type. Integer clocks, which are essentially integer variables that are periodically incremented by a global pulse generator, greatly facilitate the encoding of the operations required to synchronize clocks as in the TPSN protocol. With this integer-clock-based model of TPSN in hand, we use UPPAAL to verify that the protocol achieves network-wide time synchronization and is devoid of deadlock. We also use the UPPAAL Tracer tool to illustrate how integer clocks can be used to capture clock drift and resynchronization during protocol execution

Structural classification of proteins using texture descriptors extracted from the cellular automata image.

PubMed

Kavianpour, Hamidreza; Vasighi, Mahdi

2017-02-01

Nowadays, having knowledge about cellular attributes of proteins has an important role in pharmacy, medical science and molecular biology. These attributes are closely correlated with the function and three-dimensional structure of proteins. Knowledge of protein structural class is used by various methods for better understanding the protein functionality and folding patterns. Computational methods and intelligence systems can have an important role in performing structural classification of proteins. Most of protein sequences are saved in databanks as characters and strings and a numerical representation is essential for applying machine learning methods. In this work, a binary representation of protein sequences is introduced based on reduced amino acids alphabets according to surrounding hydrophobicity index. Many important features which are hidden in these long binary sequences can be clearly displayed through their cellular automata images. The extracted features from these images are used to build a classification model by support vector machine. Comparing to previous studies on the several benchmark datasets, the promising classification rates obtained by tenfold cross-validation imply that the current approach can help in revealing some inherent features deeply hidden in protein sequences and improve the quality of predicting protein structural class.

Space-time dynamics of Stem Cell Niches: a unified approach for Plants.

PubMed

Pérez, Maria Del Carmen; López, Alejandro; Padilla, Pablo

2013-06-01

Many complex systems cannot be analyzed using traditional mathematical tools, due to their irreducible nature. This makes it necessary to develop models that can be implemented computationally to simulate their evolution. Examples of these models are cellular automata, evolutionary algorithms, complex networks, agent-based models, symbolic dynamics and dynamical systems techniques. We review some representative approaches to model the stem cell niche in Arabidopsis thaliana and the basic biological mechanisms that underlie its formation and maintenance. We propose a mathematical model based on cellular automata for describing the space-time dynamics of the stem cell niche in the root. By making minimal assumptions on the cell communication process documented in experiments, we classify the basic developmental features of the stem-cell niche, including the basic structural architecture, and suggest that they could be understood as the result of generic mechanisms given by short and long range signals. This could be a first step in understanding why different stem cell niches share similar topologies, not only in plants. Also the fact that this organization is a robust consequence of the way information is being processed by the cells and to some extent independent of the detailed features of the signaling mechanism.

Space-time dynamics of stem cell niches: a unified approach for plants.

PubMed

Pérez, Maria del Carmen; López, Alejandro; Padilla, Pablo

2013-04-02

Many complex systems cannot be analyzed using traditional mathematical tools, due to their irreducible nature. This makes it necessary to develop models that can be implemented computationally to simulate their evolution. Examples of these models are cellular automata, evolutionary algorithms, complex networks, agent-based models, symbolic dynamics and dynamical systems techniques. We review some representative approaches to model the stem cell niche in Arabidopsis thaliana and the basic biological mechanisms that underlie its formation and maintenance. We propose a mathematical model based on cellular automata for describing the space-time dynamics of the stem cell niche in the root. By making minimal assumptions on the cell communication process documented in experiments, we classify the basic developmental features of the stem-cell niche, including the basic structural architecture, and suggest that they could be understood as the result of generic mechanisms given by short and long range signals. This could be a first step in understanding why different stem cell niches share similar topologies, not only in plants. Also the fact that this organization is a robust consequence of the way information is being processed by the cells and to some extent independent of the detailed features of the signaling mechanism.

Cellular automata rule characterization and classification using texture descriptors

NASA Astrophysics Data System (ADS)

Machicao, Jeaneth; Ribas, Lucas C.; Scabini, Leonardo F. S.; Bruno, Odermir M.

2018-05-01

The cellular automata (CA) spatio-temporal patterns have attracted the attention from many researchers since it can provide emergent behavior resulting from the dynamics of each individual cell. In this manuscript, we propose an approach of texture image analysis to characterize and classify CA rules. The proposed method converts the CA spatio-temporal patterns into a gray-scale image. The gray-scale is obtained by creating a binary number based on the 8-connected neighborhood of each dot of the CA spatio-temporal pattern. We demonstrate that this technique enhances the CA rule characterization and allow to use different texture image analysis algorithms. Thus, various texture descriptors were evaluated in a supervised training approach aiming to characterize the CA's global evolution. Our results show the efficiency of the proposed method for the classification of the elementary CA (ECAs), reaching a maximum of 99.57% of accuracy rate according to the Li-Packard scheme (6 classes) and 94.36% for the classification of the 88 rules scheme. Moreover, within the image analysis context, we found a better performance of the method by means of a transformation of the binary states to a gray-scale.

Dirac Cellular Automaton from Split-step Quantum Walk

PubMed Central

Mallick, Arindam; Chandrashekar, C. M.

2016-01-01

Simulations of one quantum system by an other has an implication in realization of quantum machine that can imitate any quantum system and solve problems that are not accessible to classical computers. One of the approach to engineer quantum simulations is to discretize the space-time degree of freedom in quantum dynamics and define the quantum cellular automata (QCA), a local unitary update rule on a lattice. Different models of QCA are constructed using set of conditions which are not unique and are not always in implementable configuration on any other system. Dirac Cellular Automata (DCA) is one such model constructed for Dirac Hamiltonian (DH) in free quantum field theory. Here, starting from a split-step discrete-time quantum walk (QW) which is uniquely defined for experimental implementation, we recover the DCA along with all the fine oscillations in position space and bridge the missing connection between DH-DCA-QW. We will present the contribution of the parameters resulting in the fine oscillations on the Zitterbewegung frequency and entanglement. The tuneability of the evolution parameters demonstrated in experimental implementation of QW will establish it as an efficient tool to design quantum simulator and approach quantum field theory from principles of quantum information theory. PMID:27184159

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

PubMed

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.

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

NASA Astrophysics Data System (ADS)

Aono, Masashi; Gunji, Yukio-Pegio

2004-08-01

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

Estimation of the spatiotemporal dynamics of snow covered area by using cellular automata models

NASA Astrophysics Data System (ADS)

Pardo-Igúzquiza, Eulogio; Collados-Lara, Antonio-Juan; Pulido-Velazquez, David

2017-07-01

Given the need to consider the cryosphere in water resources management for mountainous regions, the purpose of this paper is to model the daily spatially distributed dynamics of snow covered area (SCA) by using calibrated cellular automata models. For the operational use of the calibrated model, the only data requirements are the altitude of each cell of the spatial discretization of the area of interest and precipitation and temperature indexes for the area of interest. For the calibration step, experimental snow covered area data are needed. Potential uses of the model are to estimate the snow covered area when satellite data are absent, or when they provide a temporal resolution different from the operational resolution, or when the satellite images are useless because they are covered by clouds or because there has been a sensor failure. Another interesting application is the simulation of SCA dynamics for the snow covered area under future climatic scenarios. The model is applied to the Sierra Nevada mountain range, in southern Spain, which is home to significant biodiversity, contains important water resources in its snowpack, and contains the most meridional ski resort in Europe.

Noise, chaos, and (ɛ, τ)-entropy per unit time

NASA Astrophysics Data System (ADS)

Gaspard, Pierre; Wang, Xiao-Jing

1993-12-01

The degree of dynamical randomness of different time processes is characterized in terms of the (ε, τ)-entropy per unit time. The (ε, τ)-entropy is the amount of information generated per unit time, at different scales τ of time and ε of the observables. This quantity generalizes the Kolmogorov-Sinai entropy per unit time from deterministic chaotic processes, to stochastic processes such as fluctuations in mesoscopic physico-chemical phenomena or strong turbulence in macroscopic spacetime dynamics. The random processes that are characterized include chaotic systems, Bernoulli and Markov chains, Poisson and birth-and-death processes, Ornstein-Uhlenbeck and Yaglom noises, fractional Brownian motions, different regimes of hydrodynamical turbulence, and the Lorentz-Boltzmann process of nonequilibrium statistical mechanics. We also extend the (ε, τ)-entropy to spacetime processes like cellular automata, Conway's game of life, lattice gas automata, coupled maps, spacetime chaos in partial differential equations, as well as the ideal, the Lorentz, and the hard sphere gases. Through these examples it is demonstrated that the (ε, τ)-entropy provides a unified quantitative measure of dynamical randomness to both chaos and noises, and a method to detect transitions between dynamical states of different degrees of randomness as a parameter of the system is varied.

Numerical study of the influence of the thickness and roughness of TiN coatings on their wear in scratch testing

NASA Astrophysics Data System (ADS)

Eremina, G. M.; Smolin, A. Yu.

2017-12-01

One of the mostly used and complicated surgical operations on large human joints is total hip replacement. An endoprosthesis is chosen individually for each person on the basis of his anatomical features and physical activity. However, such an important factor affecting the durability of an endoprosthesis as wear in the head-acetabular cup friction pair is still poorly understood, and it is taken into account only qualitatively. The determining role in wear belongs to the structure of the surface layers and coatings of the friction pair. The mechanical and structural characteristics of the coating largely depend on the method of its application. In this paper, to study the tribological characteristics of the coating material of the friction pair, we use computer simulation of scratch testing. The simulations are performed with the application of the method of movable cellular automata. The model specimens correspond to real coatings manufactured under different treatment conditions (deposition temperature and time). The analysis of the simulation results allows one to choose the optimal regime corresponding to the maximum hardness of coatings or adhesive strength.

Continuum models of cohesive stochastic swarms: The effect of motility on aggregation patterns

NASA Astrophysics Data System (ADS)

Hughes, Barry D.; Fellner, Klemens

2013-10-01

Mathematical models of swarms of moving agents with non-local interactions have many applications and have been the subject of considerable recent interest. For modest numbers of agents, cellular automata or related algorithms can be used to study such systems, but in the present work, instead of considering discrete agents, we discuss a class of one-dimensional continuum models, in which the agents possess a density ρ(x,t) at location x at time t. The agents are subject to a stochastic motility mechanism and to a global cohesive inter-agent force. The motility mechanisms covered include classical diffusion, nonlinear diffusion (which may be used to model, in a phenomenological way, volume exclusion or other short-range local interactions), and a family of linear redistribution operators related to fractional diffusion equations. A variety of exact analytic results are discussed, including equilibrium solutions and criteria for unimodality of equilibrium distributions, full time-dependent solutions, and transitions between asymptotic collapse and asymptotic escape. We address the behaviour of the system for diffusive motility in the low-diffusivity limit for both smooth and singular interaction potentials and show how this elucidates puzzling behaviour in fully deterministic non-local particle interaction models. We conclude with speculative remarks about extensions and applications of the models.

Verifying Hybrid Systems Modeled as Timed Automata: A Case Study

DTIC Science & Technology

1997-03-01

Introduction Researchers have proposed many innovative formal methods for developing real - time systems [9]. Such methods can give system developers and...customers greater con dence that real - time systems satisfy their requirements, especially their crit- ical requirements. However, applying formal methods...specifying and reasoning about real - time systems that is designed to address these challenging problems. Our approach is to build formal reasoning tools

On the effect of memory in a quantum prisoner's dilemma cellular automaton

NASA Astrophysics Data System (ADS)

Alonso-Sanz, Ramón; Revuelta, Fabio

2018-03-01

The disrupting effect of quantum memory on the dynamics of a spatial quantum formulation of the iterated prisoner's dilemma game with variable entangling is studied. The game is played within a cellular automata framework, i.e., with local and synchronous interactions. The main findings of this work refer to the shrinking effect of memory on the disruption induced by noise.

Research on traffic flow characteristics at signal intersection

NASA Astrophysics Data System (ADS)

Zeng, Jun-Wei; Yu, Sen-Bin; Qian, Yong-Sheng; Wei, Xu-Ting; Feng, Xiao; Wang, Hui

2017-09-01

Based on the cautious driving behavior and the principle of the vehicles at left-side having priority to pass in the intersection, a two-dimensional cellular automata model for planar signalized intersection (NS-STCA) is established. The different turning vehicles are regarded as the research objects and the effect of the left-turn probability, signal cycle, vehicle flow density on traffic flow at the intersection is investigated.

Research on the decision-making model of land-use spatial optimization

NASA Astrophysics Data System (ADS)

He, Jianhua; Yu, Yan; Liu, Yanfang; Liang, Fei; Cai, Yuqiu

2009-10-01

Using the optimization result of landscape pattern and land use structure optimization as constraints of CA simulation results, a decision-making model of land use spatial optimization is established coupled the landscape pattern model with cellular automata to realize the land use quantitative and spatial optimization simultaneously. And Huangpi district is taken as a case study to verify the rationality of the model.

Rough Finite State Automata and Rough Languages

NASA Astrophysics Data System (ADS)

Arulprakasam, R.; Perumal, R.; Radhakrishnan, M.; Dare, V. R.

2018-04-01

Sumita Basu [1, 2] recently introduced the concept of a rough finite state (semi)automaton, rough grammar and rough languages. Motivated by the work of [1, 2], in this paper, we investigate some closure properties of rough regular languages and establish the equivalence between the classes of rough languages generated by rough grammar and the classes of rough regular languages accepted by rough finite automaton.

Robots: Fantasy and Reality

DOE Office of Scientific and Technical Information (OSTI.GOV)

Grossman, David

A irreverent non-technical review of the history of surprisingly animate machines, from ancient Egypt to current times. Areas include teleoperators for hazardous environments, assembly systems, medical applications, entertainment, and science fiction. The talk has over 100 slides, covering such varied topics as Memnon son of Dawn, Droz's automata, Vaucanson's duck, cathedral clocks, Von Kempelen's chess player, household robots, Asimov's laws, Disneyland, dinosaurs, and movie droids and cyborgs.

Lattice-Gas Automata Fluids on Parallel Supercomputers

DTIC Science & Technology

1993-11-23

Kelvin-Helmholtz shear instabil- ity, and the Von Karman vortex shedding instability. Performance of the two machines in terms of both site update... PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Phillips Laboratory,Hanscom Field,MA,01731 8. PERFORMING ORGANIZATION REPORT NUMBER 9. SPONSORING...Helmholtz shear instability, and the Von Karman vortex shedding instability. Performance of the two machines in terms of both site update rate and

A stochastic automata network for earthquake simulation and hazard estimation

NASA Astrophysics Data System (ADS)

Belubekian, Maya Ernest

1998-11-01

This research develops a model for simulation of earthquakes on seismic faults with available earthquake catalog data. The model allows estimation of the seismic hazard at a site of interest and assessment of the potential damage and loss in a region. There are two approaches for studying the earthquakes: mechanistic and stochastic. In the mechanistic approach, seismic processes, such as changes in stress or slip on faults, are studied in detail. In the stochastic approach, earthquake occurrences are simulated as realizations of a certain stochastic process. In this dissertation, a stochastic earthquake occurrence model is developed that uses the results from dislocation theory for the estimation of slip released in earthquakes. The slip accumulation and release laws and the event scheduling mechanism adopted in the model result in a memoryless Poisson process for the small and moderate events and in a time- and space-dependent process for large events. The minimum and maximum of the hazard are estimated by the model when the initial conditions along the faults correspond to a situation right after a largest event and after a long seismic gap, respectively. These estimates are compared with the ones obtained from a Poisson model. The Poisson model overestimates the hazard after the maximum event and underestimates it in the period of a long seismic quiescence. The earthquake occurrence model is formulated as a stochastic automata network. Each fault is divided into cells, or automata, that interact by means of information exchange. The model uses a statistical method called bootstrap for the evaluation of the confidence bounds on its results. The parameters of the model are adjusted to the target magnitude patterns obtained from the catalog. A case study is presented for the city of Palo Alto, where the hazard is controlled by the San Andreas, Hayward and Calaveras faults. The results of the model are used to evaluate the damage and loss distribution in Palo Alto. The sensitivity analysis of the model results to the variation in basic parameters shows that the maximum magnitude has the most significant impact on the hazard, especially for long forecast periods.

A Comparison of Three Approaches to Model Human Behavior

NASA Astrophysics Data System (ADS)

Palmius, Joel; Persson-Slumpi, Thomas

2010-11-01

One way of studying social processes is through the use of simulations. The use of simulations for this purpose has been established as its own field, social simulations, and has been used for studying a variety of phenomena. A simulation of a social setting can serve as an aid for thinking about that social setting, and for experimenting with different parameters and studying the outcomes caused by them. When using the simulation as an aid for thinking and experimenting, the chosen simulation approach will implicitly steer the simulationist towards thinking in a certain fashion in order to fit the model. To study the implications of model choice on the understanding of a setting where human anticipation comes into play, a simulation scenario of a coffee room was constructed using three different simulation approaches: Cellular Automata, Systems Dynamics and Agent-based modeling. The practical implementations of the models were done in three different simulation packages: Stella for Systems Dynamic, CaFun for Cellular automata and SesAM for Agent-based modeling. The models were evaluated both using Randers' criteria for model evaluation, and through introspection where the authors reflected upon how their understanding of the scenario was steered through the model choice. Further the software used for implementing the simulation models was evaluated, and practical considerations for the choice of software package are listed. It is concluded that the models have very different strengths. The Agent-based modeling approach offers the most intuitive support for thinking about and modeling a social setting where the behavior of the individual is in focus. The Systems Dynamics model would be preferable in situations where populations and large groups would be studied as wholes, but where individual behavior is of less concern. The Cellular Automata models would be preferable where processes need to be studied from the basis of a small set of very simple rules. It is further concluded that in most social simulation settings the Agent-based modeling approach would be the probable choice. This since the other models does not offer much in the way of supporting the modeling of the anticipatory behavior of humans acting in an organization.

Cellular automata models for diffusion of information and highway traffic flow

NASA Astrophysics Data System (ADS)

Fuks, Henryk

In the first part of this work we study a family of deterministic models for highway traffic flow which generalize cellular automaton rule 184. This family is parameterized by the speed limit m and another parameter k that represents degree of 'anticipatory driving'. We compare two driving strategies with identical maximum throughput: 'conservative' driving with high speed limit and 'anticipatory' driving with low speed limit. Those two strategies are evaluated in terms of accident probability. We also discuss fundamental diagrams of generalized traffic rules and examine limitations of maximum achievable throughput. Possible modifications of the model are considered. For rule 184, we present exact calculations of the order parameter in a transition from the moving phase to the jammed phase using the method of preimage counting, and use this result to construct a solution to the density classification problem. In the second part we propose a probabilistic cellular automaton model for the spread of innovations, rumors, news, etc., in a social system. We start from simple deterministic models, for which exact expressions for the density of adopters are derived. For a more realistic model, based on probabilistic cellular automata, we study the influence of a range of interaction R on the shape of the adoption curve. When the probability of adoption is proportional to the local density of adopters, and individuals can drop the innovation with some probability p, the system exhibits a second order phase transition. Critical line separating regions of parameter space in which asymptotic density of adopters is positive from the region where it is equal to zero converges toward the mean-field line when the range of the interaction increases. In a region between R=1 critical line and the mean-field line asymptotic density of adopters depends on R, becoming zero if R is too small (smaller than some critical value). This result demonstrates the importance of connectivity in diffusion of information. We also define a new class of automata networks which incorporates non-local interactions, and discuss its applicability in modeling of diffusion of innovations.

Social interactions of eating behaviour among high school students: a cellular automata approach

PubMed Central

2012-01-01

Background Overweight and obesity in children and adolescents is a global epidemic posing problems for both developed and developing nations. The prevalence is particularly alarming in developed nations, such as the United States, where approximately one in three school-aged adolescents (ages 12-19) are overweight or obese. Evidence suggests that weight gain in school-aged adolescents is related to energy imbalance exacerbated by the negative aspects of the school food environment, such as presence of unhealthy food choices. While a well-established connection exists between the food environment, presently there is a lack of studies investigating the impact of the social environment and associated interactions of school-age adolescents. This paper uses a mathematical modelling approach to explore how social interactions among high school adolescents can affect their eating behaviour and food choice. Methods In this paper we use a Cellular Automata (CA) modelling approach to explore how social interactions among school-age adolescents can affect eating behaviour, and food choice. Our CA model integrates social influences and transition rules to simulate the way individuals would interact in a social community (e.g., school cafeteria). To replicate these social interactions, we chose the Moore neighbourhood which allows all neighbours (eights cells in a two-dimensional square lattice) to influence the central cell. Our assumption is that individuals belong to any of four states; Bring Healthy, Bring Unhealthy, Purchase Healthy, and Purchase Unhealthy, and will influence each other according to parameter settings and transition rules. Simulations were run to explore how the different states interact under varying parameter settings. Results This study, through simulations, illustrates that students will change their eating behaviour from unhealthy to healthy as a result of positive social and environmental influences. In general, there is one common characteristic of changes across time; students with similar eating behaviours tend to form groups, represented by distinct clusters. Transition of healthy and unhealthy eating behaviour is non-linear and a sharp change is observed around a critical point where positive and negative influences are equal. Conclusions Conceptualizing the social environment of individuals is a crucial step to increasing our understanding of obesogenic environments of high-school students, and moreover, the general population. Incorporating both contextual, and individual determinants found in real datasets, in our model will greatly enhance calibration of future models. Complex mathematical modelling has a potential to contribute to the way public health data is collected and analyzed. PMID:23046793

Coupled Finite Element and Cellular Automata Methods for Analysis of Composite Structures in an Acoustic Domain

DTIC Science & Technology

2012-09-01

the geometry and constraints of the structure with the material properties of its components to generate a response (e.g., displacement, stress, and...phenomena with relative simplicity. Generally, both space and time are treated discretely and the value of the quantity in question is limited to a ...Feit [45] was used. Consider a semi- infinite fluid-filled space with a given uniform

Coping with the Bounds: Speculations on Nonlinearity in Military Affairs

DTIC Science & Technology

2003-08-01

organizing criticality, cellular automata, solitons, and so on–because they all globally share this property . Nonlinearity reflects the science of the...Why does it matter? One rea- son for emphasizing nonlinearity is that it constitutes the well-established mathematical property underlying and making...have some hints as to what those principles might be.3 Complex adaptive systems, or cas, contain seven basic attributes. These consist of four properties

A Technology Analysis to Support Acquisition of UAVs for Gulf Coalition Forces Operations

DTIC Science & Technology

2017-06-01

their selection of the most suitable and cost-effective unmanned aerial vehicles to support detection operations. This study uses Map Aware Non ...being detected by Gulf Coalition Forces and improved time to detect them, support the use of UAVs in detection missions. Computer experimentations and...aerial vehicles to support detection operations. We use Map Aware Non - Uniform Automata, an agent-based simulation software platform, for the

Plan Debugging Using Approximate Domain Theories.

DTIC Science & Technology

1995-03-01

compelling suggestion that generative plan- ning systems solving large problems will need to exploit the control information implicit in uncertain...control information implicit in uncertain information may well lead the planner to expand one portion of a plan at one point, and a separate portion of...solutions that have been proposed are to abandon declarativism (as suggested in the work on situated automata theory and its variants [1, 16, 56, 72

Quantifying the driving factors for language shift in a bilingual region

PubMed Central

Prochazka, Katharina; Vogl, Gero

2017-01-01

Many of the world’s around 6,000 languages are in danger of disappearing as people give up use of a minority language in favor of the majority language in a process called language shift. Language shift can be monitored on a large scale through the use of mathematical models by way of differential equations, for example, reaction–diffusion equations. Here, we use a different approach: we propose a model for language dynamics based on the principles of cellular automata/agent-based modeling and combine it with very detailed empirical data. Our model makes it possible to follow language dynamics over space and time, whereas existing models based on differential equations average over space and consequently provide no information on local changes in language use. Additionally, cellular automata models can be used even in cases where models based on differential equations are not applicable, for example, in situations where one language has become dispersed and retreated to language islands. Using data from a bilingual region in Austria, we show that the most important factor in determining the spread and retreat of a language is the interaction with speakers of the same language. External factors like bilingual schools or parish language have only a minor influence. PMID:28298530

Threshold effect with stochastic fluctuation in bacteria-colony-like proliferation dynamics as analyzed through a comparative study of reaction-diffusion equations and cellular automata

NASA Astrophysics Data System (ADS)

Odagiri, Kenta; Takatsuka, Kazuo

2009-02-01

We report a comparative study on pattern formation between the methods of cellular automata (CA) and reaction-diffusion equations (RD) applying to a morphology of bacterial colony formation. To do so, we began the study with setting an extremely simple model, which was designed to realize autocatalytic proliferation of bacteria (denoted as X ) fed with nutrition (N) and their inactive state (prespore state) P1 due to starvation: X+N→2X and X→P1 , respectively. It was found numerically that while the CA could successfully generate rich patterns ranging from the circular fat structure to the viscous-finger-like complicated one, the naive RD reproduced only the circular pattern but failed to give a finger structure. Augmenting the RD equations by adding two physical factors, (i) a threshold effect in the dynamics of X+N→2X (breaking the continuity limit of RD) and (ii) internal noise with onset threshold (breaking the inherent symmetry of RD), we have found that the viscous-finger-like realistic patterns are indeed recovered by thus modified RD. This highlights the important difference between CA and RD, and at the same time, clarifies the necessary factors for the complicated patterns to emerge in such a surprisingly simple model system.

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

NASA Astrophysics Data System (ADS)

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.