Science.gov

Sample records for automata linear rules

  1. Boolean linear differential operators on elementary cellular automata

    NASA Astrophysics Data System (ADS)

    Martín Del Rey, Ángel

    2014-12-01

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

  2. Complex dynamics of cellular automata rule 119

    NASA Astrophysics Data System (ADS)

    Chen, Fang-Fang; Chen, Fang-Yue

    2009-03-01

    In this paper, the dynamical behaviors of cellular automata rule 119 are studied from the viewpoint of symbolic dynamics in the bi-infinite symbolic sequence space Σ2. It is shown that there exists one Bernoulli-measure global attractor of rule 119, which is also the nonwandering set of the rule. Moreover, it is demonstrated that rule 119 is topologically mixing on the global attractor and possesses the positive topological entropy. Therefore, rule 119 is chaotic in the sense of both Li-Yorke and Devaney on the global attractor. It is interesting that rule 119, a member of Wolfram’s class II which was said to be simple as periodic before, actually possesses a chaotic global attractor in Σ2. Finally, it is noted that the method presented in this work is also applicable to studying the dynamics of other rules, especially the 112 Bernoulli-shift rules therein.

  3. Reversible Cellular Automata with Penta-Cyclic Rule and ECCs

    NASA Astrophysics Data System (ADS)

    Siap, Irfan; Akin, Hasan; Koroglu, Mehmet E.

    2012-10-01

    The reversibility problem for linear cellular automata with null boundary defined by a rule matrix in the form of a pentadiagonal matrix was studied over the binary field ℤ2 by Martín del Rey et al. [Appl. Math. Comput.217, 8360 (2011)]. Recently, the reversibility problem of 1D Cellular automata with periodic boundary has been extended to ternary fields and further to finite primitive fields ℤp by Cinkir et al. [J. Stat. Phys.143, 807 (2011)]. In this work, we restudy some of the work done in Cinkir et al. [J. Stat. Phys.143, 807 (2011)] by using a different approach which is based on the theory of error correcting codes. While we reestablish some of the theorems already presented in Cinkir et al. [J. Stat. Phys.143, 807 (2011)], we further extend the results to more general cases. Also, a conjecture that is left open in Cinkir et al. [J. Stat. Phys.143, 807 (2011)] is also solved here. We conclude by presenting an application to Error Correcting Codes (ECCs) where reversibility of cellular automata is crucial.

  4. Chaos of elementary cellular automata rule 42 of Wolfram's class II.

    PubMed

    Chen, Fang-Yue; Jin, Wei-Feng; Chen, Guan-Rong; Chen, Fang-Fang; Chen, Lin

    2009-03-01

    In this paper, the dynamics of elementary cellular automata rule 42 is investigated in the bi-infinite symbolic sequence space. Rule 42, a member of Wolfram's class II which was said to be simply as periodic before, actually defines a chaotic global attractor; that is, rule 42 is topologically mixing on its global attractor and possesses the positive topological entropy. Therefore, rule 42 is chaotic in the sense of both Li-Yorke and Devaney. Meanwhile, the characteristic function and the basin tree diagram of rule 42 are explored for some finite length of binary strings, which reveal its Bernoulli characteristics. The method presented in this work is also applicable to studying the dynamics of other rules, especially the 112 Bernoulli-shift rules of the elementary cellular automata. PMID:19335004

  5. Chaos of elementary cellular automata rule 42 of Wolfram's class II

    NASA Astrophysics Data System (ADS)

    Chen, Fang-Yue; Jin, Wei-Feng; Chen, Guan-Rong; Chen, Fang-Fang; Chen, Lin

    2009-03-01

    In this paper, the dynamics of elementary cellular automata rule 42 is investigated in the bi-infinite symbolic sequence space. Rule 42, a member of Wolfram's class II which was said to be simply as periodic before, actually defines a chaotic global attractor; that is, rule 42 is topologically mixing on its global attractor and possesses the positive topological entropy. Therefore, rule 42 is chaotic in the sense of both Li-Yorke and Devaney. Meanwhile, the characteristic function and the basin tree diagram of rule 42 are explored for some finite length of binary strings, which reveal its Bernoulli characteristics. The method presented in this work is also applicable to studying the dynamics of other rules, especially the 112 Bernoulli-shift rules of the elementary cellular automata.

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

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

    NASA Astrophysics Data System (ADS)

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

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

  8. Rule-based Modeling and Simulation of Biochemical Systems with Molecular Finite Automata

    PubMed Central

    Yang, Jin; Meng, Xin; Hlavacek, William S.

    2011-01-01

    We propose a theoretical formalism, molecular finite automata (MFA), to describe individual proteins as rule-based computing machines. The MFA formalism provides a framework for modeling individual protein behaviors and systems-level dynamics via construction of programmable and executable machines. Models specified within this formalism explicitly represent the context-sensitive dynamics of individual proteins driven by external inputs and represent protein-protein interactions as synchronized machine reconfigurations. Both deterministic and stochastic simulations can be applied to quantitatively compute the dynamics of MFA models. We apply the MFA formalism to model and simulate a simple example of a signal transduction system that involves a MAP kinase cascade and a scaffold protein. PMID:21073243

  9. Quantum features of natural cellular automata

    NASA Astrophysics Data System (ADS)

    Elze, Hans-Thomas

    2016-03-01

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

  10. Refining Linear Fuzzy Rules by Reinforcement Learning

    NASA Technical Reports Server (NTRS)

    Berenji, Hamid R.; Khedkar, Pratap S.; Malkani, Anil

    1996-01-01

    Linear fuzzy rules are increasingly being used in the development of fuzzy logic systems. Radial basis functions have also been used in the antecedents of the rules for clustering in product space which can automatically generate a set of linear fuzzy rules from an input/output data set. Manual methods are usually used in refining these rules. This paper presents a method for refining the parameters of these rules using reinforcement learning which can be applied in domains where supervised input-output data is not available and reinforcements are received only after a long sequence of actions. This is shown for a generalization of radial basis functions. The formation of fuzzy rules from data and their automatic refinement is an important step in closing the gap between the application of reinforcement learning methods in the domains where only some limited input-output data is available.

  11. Multipartite cellular automata and the superposition principle

    NASA Astrophysics Data System (ADS)

    Elze, Hans-Thomas

    2016-05-01

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

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

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

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

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

  16. 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. PMID:25974442

  17. Symmetry analysis of cellular automata

    NASA Astrophysics Data System (ADS)

    García-Morales, V.

    2013-01-01

    By means of B-calculus [V. García-Morales, Phys. Lett. A 376 (2012) 2645] a universal map for deterministic cellular automata (CAs) has been derived. The latter is shown here to be invariant upon certain transformations (global complementation, reflection and shift). When constructing CA rules in terms of rules of lower range a new symmetry, “invariance under construction” is uncovered. Modular arithmetic is also reformulated within B-calculus and a new symmetry of certain totalistic CA rules, which calculate the Pascal simplices modulo an integer number p, is then also uncovered.

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

  19. Dynamical Systems Perspective of Wolfram's Cellular Automata

    NASA Astrophysics Data System (ADS)

    Courbage, M.; Kamiński, B.

    2013-01-01

    Leon Chua, following Wolfram, devoted a big effort to understand deeply the wealth of complexity of the rules of all elementary one-dimensional cellular automata from the point of view of the nonlinear dynamicist. Here we complete this point of view by a dynamical system perspective, extending them to the limit of infinite number of sites.

  20. Local unitary quantum cellular automata

    SciTech Connect

    Perez-Delgado, Carlos A.; Cheung, Donny

    2007-09-15

    In this paper we present a quantization of cellular automata. Our formalism is based on a lattice of qudits and an update rule consisting of local unitary operators that commute with their own lattice translations. One purpose of this model is to act as a theoretical model of quantum computation, similar to the quantum circuit model. It is also shown to be an appropriate abstraction for space-homogeneous quantum phenomena, such as quantum lattice gases, spin chains, and others. Some results that show the benefits of basing the model on local unitary operators are shown: universality, strong connections to the circuit model, simple implementation on quantum hardware, and a wealth of applications.

  1. From deterministic cellular automata to coupled map lattices

    NASA Astrophysics Data System (ADS)

    García-Morales, Vladimir

    2016-07-01

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

  2. From Referents to Symbols: Visual Cues and Pointing Effects on Children's Acquisition of Linear Function Rules

    ERIC Educational Resources Information Center

    Lee, Seong-Soo; Dobson, Leona N.

    1977-01-01

    Children learned two linear function rules under varying conditions: presence vs. absence of pointing; visual cues (context vs. weight vs. both pictured); and a verbal-only baseline condition. A complex rule was learned as a transfer task. Visual cues aided both learning and transfer; pointing helped initial learning, but retarded transfer.…

  3. Automata-Based Verification of Temporal Properties on Running Programs

    NASA Technical Reports Server (NTRS)

    Giannakopoulou, Dimitra; Havelund, Klaus; Lan, Sonie (Technical Monitor)

    2001-01-01

    This paper presents an approach to checking a running program against its Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finite-state automata, which are used as observers of the program behavior. The translation algorithm we propose modifies standard LTL to Buchi automata conversion techniques to generate automata that check finite program traces. The algorithm has been implemented in a tool, which has been integrated with the generic JPaX framework for runtime analysis of Java programs.

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

  5. GARDENS OF EDEN OF ELEMENTARY CELLULAR AUTOMATA.

    SciTech Connect

    Barrett, C. L.; Chen, W. Y. C.; Reidys, C. M.

    2001-01-01

    Using de Bruijn graphs, we give a characterization of elementary cellular automata on the linear lattice that do not have any Gardens of Eden. It turns out that one can easily recoginze a CA that does not have any Gardens of Eden by looking at its de Bruijn graph. We also present a sufficient condition for the set of words accepted by a CA not to constitute a finite-complement language.

  6. Actin Automata with Memory

    NASA Astrophysics Data System (ADS)

    Alonso-Sanz, Ramón; Adamatzky, Andy

    Actin is a globular protein which forms long polar filaments in eukaryotic. The actin filaments play the roles of cytoskeleton, motility units, information processing and learning. We model actin filament as a double chain of finite state machines, nodes, which take states “0” and “1”. The states are abstractions of absence and presence of a subthreshold charge on actin units corresponding to the nodes. All nodes update their state in parallel to discrete time. A node updates its current state depending on states of two closest neighbors in the node chain and two closest neighbors in the complementary chain. Previous models of actin automata consider momentary state transitions of nodes. We enrich the actin automata model by assuming that states of nodes depend not only on the current states of neighboring node but also on their past states. Thus, we assess the effect of memory of past states on the dynamics of acting automata. We demonstrate in computational experiments that memory slows down propagation of perturbations, decrease entropy of space-time patterns generated, transforms traveling localizations to stationary oscillators, and stationary oscillations to still patterns.

  7. Non-Condon nonequilibrium Fermi's golden rule rates from the linearized semiclassical method

    NASA Astrophysics Data System (ADS)

    Sun, Xiang; Geva, Eitan

    2016-08-01

    The nonequilibrium Fermi's golden rule describes the transition between a photoexcited bright donor electronic state and a dark acceptor electronic state, when the nuclear degrees of freedom start out in a nonequilibrium state. In a previous paper [X. Sun and E. Geva, J. Chem. Theory Comput. 12, 2926 (2016)], we proposed a new expression for the nonequilibrium Fermi's golden rule within the framework of the linearized semiclassical approximation and based on the Condon approximation, according to which the electronic coupling between donor and acceptor is assumed constant. In this paper we propose a more general expression, which is applicable to the case of non-Condon electronic coupling. We test the accuracy of the new non-Condon nonequilibrium Fermi's golden rule linearized semiclassical expression on a model where the donor and acceptor potential energy surfaces are parabolic and identical except for shifts in the equilibrium energy and geometry, and the coupling between them is linear in the nuclear coordinates. Since non-Condon effects may or may not give rise to conical intersections, both possibilities are examined by considering the following: (1) A modified Garg-Onuchic-Ambegaokar model for charge transfer in the condensed phase, where the donor-acceptor coupling is linear in the primary-mode coordinate, and for which non-Condon effects do not give rise to a conical intersection; (2) the linear vibronic coupling model for electronic transitions in gas phase molecules, where non-Condon effects give rise to conical intersections. We also present a comprehensive comparison between the linearized semiclassical expression and a progression of more approximate expressions, in both normal and inverted regions, and over a wide range of initial nonequilibrium states, temperatures, and frictions.

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

  9. Linear solvation energy relationships: "rule of thumb" for estimation of variable values

    USGS Publications Warehouse

    Hickey, James P.; Passino-Reader, Dora R.

    1991-01-01

    For the linear solvation energy relationship (LSER), values are listed for each of the variables (Vi/100, π*, &betam, αm) for fundamental organic structures and functional groups. We give the guidelines to estimate LSER variable values quickly for a vast array of possible organic compounds such as those found in the environment. The difficulty in generating these variables has greatly discouraged the application of this quantitative structure-activity relationship (QSAR) method. This paper present the first compilation of molecular functional group values together with a utilitarian set of the LSER variable estimation rules. The availability of these variable values and rules should facilitate widespread application of LSER for hazard evaluation of environmental contaminants.

  10. Linear solvation energy relationships: Rules of thumb' for estimation of variable values

    SciTech Connect

    Hickey, J.P.; Passino-Reader, D.R. )

    1991-10-01

    For the linear solvation energy relationship (LSER), values are listed for each of the variables (V{sub i}/100, {pi}{sup *}, {beta}{sub m}, {alpha}{sub m}) for fundamental organic structures and functional groups. The authors give the guidelines to estimate LSER variable values quickly for a vast array of possible organic compounds such as those found in the environment. The difficulty in generating these variables has greatly discouraged the application of this quantitative structure-activity relationship (QSAR) method. This paper presents the first compilation of molecular functional group values together with a utilitarian set of the LSER variable estimation rules. The availability of these variable values and rules should facilitate widespread application of LSER for hazard evaluation of environmental contaminants.

  11. Weighted Watson-Crick automata

    SciTech Connect

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

    2014-07-10

    There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power.

  12. Weighted Watson-Crick automata

    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.

  13. Inertial Estimator Learning Automata

    NASA Astrophysics Data System (ADS)

    Zhang, Junqi; Ni, Lina; Xie, Chen; Gao, Shangce; Tang, Zheng

    This paper presents an inertial estimator learning automata scheme by which both the short-term and long-term perspectives of the environment can be incorporated in the stochastic estimator — the long term information crystallized in terms of the running reward-probability estimates, and the short term information used by considering whether the most recent response was a reward or a penalty. Thus, when the short-term perspective is considered, the stochastic estimator becomes pertinent in the context of the estimator algorithms. The proposed automata employ an inertial weight estimator as the short-term perspective to achieve a rapid and accurate convergence when operating in stationary random environments. According to the proposed inertial estimator scheme, the estimates of the reward probabilities of actions are affected by the last response from environment. In this way, actions that have gotten the positive response from environment in the short time, have the opportunity to be estimated as “optimal”, to increase their choice probability and consequently, to be selected. The estimates become more reliable and consequently, the automaton rapidly and accurately converges to the optimal action. The asymptotic behavior of the proposed scheme is analyzed and it is proved to be ε-optimal in every stationary random environment. Extensive simulation results indicate that the proposed algorithm converges faster than the traditional stochastic-estimator-based SERI scheme, and the deterministic-estimator-based DGPA and DPRI schemes when operating in stationary random environments.

  14. Multipebble Simulations for Alternating Automata

    NASA Astrophysics Data System (ADS)

    Clemente, Lorenzo; Mayr, Richard

    We study generalized simulation relations for alternating Büchi automata (ABA), as well as alternating finite automata. Having multiple pebbles allows the Duplicator to "hedge her bets" and delay decisions in the simulation game, thus yielding a coarser simulation relation. We define (k 1,k 2)-simulations, with k 1/k 2 pebbles on the left/right, respectively. This generalizes previous work on ordinary simulation (i.e., (1,1)-simulation) for nondeterministic Büchi automata (NBA)[4] in and ABA in [5], and (1,k)-simulation for NBA in [3].

  15. Mining Distance Based Outliers in Near Linear Time with Randomization and a Simple Pruning Rule

    NASA Technical Reports Server (NTRS)

    Bay, Stephen D.; Schwabacher, Mark

    2003-01-01

    Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal of finding fast algorithms for this task. We show that a simple nested loop algorithm that in the worst case is quadratic can give near linear time performance when the data is in random order and a simple pruning rule is used. We test our algorithm on real high-dimensional data sets with millions of examples and show that the near linear scaling holds over several orders of magnitude. Our average case analysis suggests that much of the efficiency is because the time to process non-outliers, which are the majority of examples, does not depend on the size of the data set.

  16. Efficient Translation of LTL Formulae into Buchi Automata

    NASA Technical Reports Server (NTRS)

    Giannakopoulou, Dimitra; Lerda, Flavio

    2001-01-01

    Model checking is a fully automated technique for checking that a system satisfies a set of required properties. With explicit-state model checkers, properties are typically defined in linear-time temporal logic (LTL), and are translated into B chi automata in order to be checked. This report presents how we have combined and improved existing techniques to obtain an efficient LTL to B chi automata translator. In particular, we optimize the core of existing tableau-based approaches to generate significantly smaller automata. Our approach has been implemented and is being released as part of the Java PathFinder software (JPF), an explicit state model checker under development at the NASA Ames Research Center.

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

    NASA Astrophysics Data System (ADS)

    Kato, Tsuyoshi; Tsujimoto, Satoshi; Zuk, Andrzej

    2016-06-01

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

  18. Non-Condon equilibrium Fermi's golden rule electronic transition rate constants via the linearized semiclassical method

    NASA Astrophysics Data System (ADS)

    Sun, Xiang; Geva, Eitan

    2016-06-01

    In this paper, we test the accuracy of the linearized semiclassical (LSC) expression for the equilibrium Fermi's golden rule rate constant for electronic transitions in the presence of non-Condon effects. We do so by performing a comparison with the exact quantum-mechanical result for a model where the donor and acceptor potential energy surfaces are parabolic and identical except for shifts in the equilibrium energy and geometry, and the coupling between them is linear in the nuclear coordinates. Since non-Condon effects may or may not give rise to conical intersections, both possibilities are examined by considering: (1) A modified Garg-Onuchic-Ambegaokar model for charge transfer in the condensed phase, where the donor-acceptor coupling is linear in the primary mode coordinate, and for which non-Condon effects do not give rise to a conical intersection; (2) the linear vibronic coupling model for electronic transitions in gas phase molecules, where non-Condon effects give rise to conical intersections. We also present a comprehensive comparison between the linearized semiclassical expression and a progression of more approximate expressions. The comparison is performed over a wide range of frictions and temperatures for model (1) and over a wide range of temperatures for model (2). The linearized semiclassical method is found to reproduce the exact quantum-mechanical result remarkably well for both models over the entire range of parameters under consideration. In contrast, more approximate expressions are observed to deviate considerably from the exact result in some regions of parameter space.

  19. Non-Condon equilibrium Fermi's golden rule electronic transition rate constants via the linearized semiclassical method.

    PubMed

    Sun, Xiang; Geva, Eitan

    2016-06-28

    In this paper, we test the accuracy of the linearized semiclassical (LSC) expression for the equilibrium Fermi's golden rule rate constant for electronic transitions in the presence of non-Condon effects. We do so by performing a comparison with the exact quantum-mechanical result for a model where the donor and acceptor potential energy surfaces are parabolic and identical except for shifts in the equilibrium energy and geometry, and the coupling between them is linear in the nuclear coordinates. Since non-Condon effects may or may not give rise to conical intersections, both possibilities are examined by considering: (1) A modified Garg-Onuchic-Ambegaokar model for charge transfer in the condensed phase, where the donor-acceptor coupling is linear in the primary mode coordinate, and for which non-Condon effects do not give rise to a conical intersection; (2) the linear vibronic coupling model for electronic transitions in gas phase molecules, where non-Condon effects give rise to conical intersections. We also present a comprehensive comparison between the linearized semiclassical expression and a progression of more approximate expressions. The comparison is performed over a wide range of frictions and temperatures for model (1) and over a wide range of temperatures for model (2). The linearized semiclassical method is found to reproduce the exact quantum-mechanical result remarkably well for both models over the entire range of parameters under consideration. In contrast, more approximate expressions are observed to deviate considerably from the exact result in some regions of parameter space. PMID:27369495

  20. Computational classification of cellular automata

    NASA Astrophysics Data System (ADS)

    Sutner, Klaus

    2012-08-01

    We discuss attempts at the classification of cellular automata, in particular with a view towards decidability. We will see that a large variety of properties relating to the short-term evolution of configurations are decidable in principle, but questions relating to the long-term evolution are typically undecidable. Even in the decidable case, computational hardness poses a major obstacle for the automatic analysis of cellular automata.

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

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

    NASA Astrophysics Data System (ADS)

    Wootters, William K.; Langton, Chris G.

    1990-09-01

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

  3. Return of the Quantum Cellular Automata: Episode VI

    NASA Astrophysics Data System (ADS)

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

    2016-05-01

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

  4. Self-description for construction and computation on graph-rewriting automata.

    PubMed

    Tomita, Kohji; Murata, Satoshi; Kurokawa, Haruhisa

    2007-01-01

    This article shows how self-description can be realized for construction and computation in a single framework of a variant of graph-rewriting systems called graph-rewriting automata. Graph-rewriting automata define symbol dynamics on graphs, in contrast to cellular automata on lattice space. Structural change is possible along with state transition. Self-replication based on a self-description is shown as an example of self-description for construction. This process is performed using a construction arm, which is realized as a subgraph, that executes a program described in the graph structure. In addition, a metanode structure is introduced to embed rule sets in the graph structure as self-description for computation. These are regarded as universal graph-rewriting automata that can serve as a model of systems that maintain themselves through replication and modification.

  5. On Matrices, Automata, and Double Counting

    NASA Astrophysics Data System (ADS)

    Beldiceanu, Nicolas; Carlsson, Mats; Flener, Pierre; Pearson, Justin

    Matrix models are ubiquitous for constraint problems. Many such problems have a matrix of variables M, with the same constraint defined by a finite-state automaton A on each row of M and a global cardinality constraint gcc on each column of M. We give two methods for deriving, by double counting, necessary conditions on the cardinality variables of the gcc constraints from the automaton A. The first method yields linear necessary conditions and simple arithmetic constraints. The second method introduces the cardinality automaton, which abstracts the overall behaviour of all the row automata and can be encoded by a set of linear constraints. We evaluate the impact of our methods on a large set of nurse rostering problem instances.

  6. Adaptive stochastic cellular automata: Applications

    NASA Astrophysics Data System (ADS)

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

    1990-09-01

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

  7. SELF-ORGANIZED CRITICALITY AND CELLULAR AUTOMATA

    SciTech Connect

    CREUTZ,M.

    2007-01-01

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

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

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

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

  11. Free Quantum Field Theory from Quantum Cellular Automata

    NASA Astrophysics Data System (ADS)

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

    2015-10-01

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

  12. Xtoys: Cellular automata on xwindows

    SciTech Connect

    Creutz, M.

    1995-08-15

    Xtoys is a collection of xwindow programs for demonstrating simulations of various statistical models. Included are xising, for the two dimensional Ising model, xpotts, for the q-state Potts model, xautomalab, for a fairly general class of totalistic cellular automata, xsand, for the Bak-Tang-Wiesenfield model of self organized criticality, and xfires, a simple forest fire simulation. The programs should compile on any machine supporting xwindows.

  13. Massive Cellular Automata in Geosimulation: Antarctica Ice Melting as Example

    NASA Astrophysics Data System (ADS)

    Lan, H.; Torrens, P.; Lin, J.; Han, R.

    2015-12-01

    One of the essential features of the cellular automata (CA) model is its high scalability: CA lattices can be theoretically run at gargantuan size to represent intricacies of complex phenomena. However, one barrier in the use of cellular automata for scientific simulations is the issue of scalability in terms of the number of cells, to either model phenomena at finer granularities or at larger scales. Some researchers have developed parallel CA algorithms using MapReduce to eke out efficiency, but MapReduce may not provide the ideal scheme to address messy parallelism in large CA when they require complex rule-sets and broker a lot of state exchange across large solution-space lattices. In this research, we take advantage of the Bulk Synchronous Parallel (BSP) model of distributed computation, via the Giraph open-source implementation, to implement large-scale cellular automata simulations. Additionally, this study also describes a scientifically interesting example, in which ice dynamics in Antarctic is simulated using a melting model. Short-term and medium-term ice sheet dynamics are driven by a variety of forces. We do not fully understand what they might be and how they interplay, and simulation is an important medium for building the science to guide us in finding answers. In our experiments, using a voxel CA comprising 1 trillion cells—by far the largest scale voxel-based CA model reported in literature—which took only 2.48 minutes for per step for processing.

  14. Unstable vicinal crystal growth from cellular automata

    NASA Astrophysics Data System (ADS)

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

    2016-03-01

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

  15. Generalized information-lossless automata. I

    SciTech Connect

    Speranskii, D.V.

    1995-01-01

    Huffman and Even introduced classes of abstract automata, which they called respectively information-lossless automata (ILL) and information-lossless automata of finite order (ILLFO). The underlying property of these automata is the ability to reconstruct unknown input sequences from observations of the output response, assuming that the true initial state of the automaton is known. Similar classes of automata introduced in are called essentially information-lossless automata, and they are capable of reconstructing the unknown input word without knowledge of the initial state of the automaton. It is only assumed that the set of possible initial states of the automaton is the set of all automaton states. In this paper we analyze a structural analog of an abstract ILL-automaton whose set of initial states may be of arbitrary cardinality. This class of automata is thus a generalization of the classical ILL-automata, which allows not only for the structure of the input and output alphabets, but also for the configuration of the set of possible initial states.

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

    PubMed

    Diaz, N; Tischer, I

    2016-01-01

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

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

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

  19. Game level layout generation using evolved cellular automata

    NASA Astrophysics Data System (ADS)

    Pech, Andrew; Masek, Martin; Lam, Chiou-Peng; Hingston, Philip

    2016-01-01

    Design of level layouts typically involves the production of a set of levels which are different, yet display a consistent style based on the purpose of a particular level. In this paper, a new approach to the generation of unique level layouts, based on a target set of attributes, is presented. These attributes, which are learned automatically from an example layout, are used for the off-line evolution of a set of cellular automata rules. These rules can then be used for the real-time generation of level layouts that meet the target parameters. The approach is demonstrated on a set of maze-like level layouts. Results are presented to show the effect of various CA parameters and rule representation.

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

  1. Stochastic computing with biomolecular automata

    NASA Astrophysics Data System (ADS)

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

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

  2. Linear low-dose extrapolation for noncancer heath effects is the exception, not the rule.

    PubMed

    Rhomberg, Lorenz R; Goodman, Julie E; Haber, Lynne T; Dourson, Michael; Andersen, Melvin E; Klaunig, James E; Meek, Bette; Price, Paul S; McClellan, Roger O; Cohen, Samuel M

    2011-01-01

    The nature of the exposure-response relationship has a profound influence on risk analyses. Several arguments have been proffered as to why all exposure-response relationships for both cancer and noncarcinogenic endpoints should be assumed to be linear at low doses. We focused on three arguments that have been put forth for noncarcinogens. First, the general "additivity-to-background" argument proposes that if an agent enhances an already existing disease-causing process, then even small exposures increase disease incidence in a linear manner. This only holds if it is related to a specific mode of action that has nonuniversal properties-properties that would not be expected for most noncancer effects. Second, the "heterogeneity in the population" argument states that variations in sensitivity among members of the target population tend to "flatten out and linearize" the exposure-response curve, but this actually only tends to broaden, not linearize, the dose-response relationship. Third, it has been argued that a review of epidemiological evidence shows linear or no-threshold effects at low exposures in humans, despite nonlinear exposure-response in the experimental dose range in animal testing for similar endpoints. It is more likely that this is attributable to exposure measurement error rather than a true nonthreshold association. Assuming that every chemical is toxic at high exposures and linear at low exposures does not comport to modern-day scientific knowledge of biology. There is no compelling evidence-based justification for a general low-exposure linearity; rather, case-specific mechanistic arguments are needed.

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

  4. Equilibrium Fermi's Golden Rule Charge Transfer Rate Constants in the Condensed Phase: The Linearized Semiclassical Method vs Classical Marcus Theory.

    PubMed

    Sun, Xiang; Geva, Eitan

    2016-05-19

    In this article, we present a comprehensive comparison between the linearized semiclassical expression for the equilibrium Fermi's golden rule rate constant and the progression of more approximate expressions that lead to the classical Marcus expression. We do so within the context of the canonical Marcus model, where the donor and acceptor potential energy surface are parabolic and identical except for a shift in both the free energies and equilibrium geometries, and within the Condon region. The comparison is performed for two different spectral densities and over a wide range of frictions and temperatures, thereby providing a clear test for the validity, or lack thereof, of the more approximate expressions. We also comment on the computational cost and scaling associated with numerically calculating the linearized semiclassical expression for the rate constant and its dependence on the spectral density, temperature, and friction.

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

  6. Cellular automata to describe seismicity: A review

    NASA Astrophysics Data System (ADS)

    Jiménez, Abigail

    2013-12-01

    Cellular Automata have been used in the literature to describe seismicity. We first historically introduce Cellular Automata and provide some important definitions. Then we proceed to review the most important models, most of them being variations of the spring-block model proposed by Burridge and Knopoff, and describe the most important results obtained from them. We discuss the relation with criticality and also describe some models that try to reproduce real data.

  7. A Cellular Automata Model for the Study of Landslides

    NASA Astrophysics Data System (ADS)

    Liucci, Luisa; Suteanu, Cristian; Melelli, Laura

    2016-04-01

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

  8. Modeling urban land use changes in Lanzhou based on artificial neural network and cellular automata

    NASA Astrophysics Data System (ADS)

    Xu, Xibao; Zhang, Jianming; Zhou, Xiaojian

    2008-10-01

    This paper presented a model to simulate urban land use changes based on artificial neural network (ANN) and cellular automata (CA). The model was scaled down at the intra-urban level with subtle land use categorization, developed with Matlab 7.2 and loosely coupled with GIS. Urban land use system is a very complicated non-linear social system influenced by many factors. In this paper, four aspects of a totality 17 factors, including physical, social-economic, neighborhoods and policy, were considered synthetically. ANN was proposed as a solution of CA model calibration through its training to acquire the multitudinous parameters as a substitute for the complex transition rules. A stochastic perturbation parameter v was added into the model, and five different scenarios with different values of v and the threshold were designed for simulations and predictions to explore their effects on urban land use changes. Simulations of 2005 and predictions of 2015 under the five different scenarios were made and evaluated. Finally, the advantages and disadvantages of the model were discussed.

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

  10. Evaluation of empirical rule of linearly correlated peptide selection (ERLPS) for proteotypic peptide-based quantitative proteomics.

    PubMed

    Liu, Kehui; Zhang, Jiyang; Fu, Bin; Xie, Hongwei; Wang, Yingchun; Qian, Xiaohong

    2014-07-01

    Precise protein quantification is essential in comparative proteomics. Currently, quantification bias is inevitable when using proteotypic peptide-based quantitative proteomics strategy for the differences in peptides measurability. To improve quantification accuracy, we proposed an "empirical rule for linearly correlated peptide selection (ERLPS)" in quantitative proteomics in our previous work. However, a systematic evaluation on general application of ERLPS in quantitative proteomics under diverse experimental conditions needs to be conducted. In this study, the practice workflow of ERLPS was explicitly illustrated; different experimental variables, such as, different MS systems, sample complexities, sample preparations, elution gradients, matrix effects, loading amounts, and other factors were comprehensively investigated to evaluate the applicability, reproducibility, and transferability of ERPLS. The results demonstrated that ERLPS was highly reproducible and transferable within appropriate loading amounts and linearly correlated response peptides should be selected for each specific experiment. ERLPS was used to proteome samples from yeast to mouse and human, and in quantitative methods from label-free to O18/O16-labeled and SILAC analysis, and enabled accurate measurements for all proteotypic peptide-based quantitative proteomics over a large dynamic range.

  11. Benchmark study between FIDAP and a cellular automata code

    NASA Astrophysics Data System (ADS)

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

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

  12. Automata in random environments with application to machine intelligence

    SciTech Connect

    Wegman, E.J.; Gould, J.

    1982-09-01

    Computers and brains are modeled by finite and probabilistic automata, respectively. Probabilistic automata are known to be strictly more powerful than finite automata. The observation that the environment affects behavior of both computer and brain is made. Automata are then modeled in an environment. Theorem 1 shows that useful environmental models are those which are infinite sets. A probabilistic structure is placed on the environment set. Theorem 2 compares the behavior of finite (deterministic) and probabilistic automata in random environments. Several interpretations of theorem 2 are discussed which offer some insight into some mathematical limits of machine intelligence. 15 references.

  13. Infrared image enhancement using Cellular Automata

    NASA Astrophysics Data System (ADS)

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

    2016-05-01

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

  14. Runtime Analysis of Linear Temporal Logic Specifications

    NASA Technical Reports Server (NTRS)

    Giannakopoulou, Dimitra; Havelund, Klaus

    2001-01-01

    This report presents an approach to checking a running program against its Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finite-state automata, which are used as observers of the program behavior. The translation algorithm we propose modifies standard LTL to B chi automata conversion techniques to generate automata that check finite program traces. The algorithm has been implemented in a tool, which has been integrated with the generic JPaX framework for runtime analysis of Java programs.

  15. Towards modeling DNA sequences as automata

    NASA Astrophysics Data System (ADS)

    Burks, Christian; Farmer, Doyne

    1984-01-01

    We seek to describe a starting point for modeling the evolution and role of DNA sequences within the framework of cellular automata by discussing the current understanding of genetic information storage in DNA sequences. This includes alternately viewing the role of DNA in living organisms as a simple scheme and as a complex scheme; a brief review of strategies for identifying and classifying patterns in DNA sequences; and finally, notes towards establishing DNA-like automata models, including a discussion of the extent of experimentally determined DNA sequence data present in the database at Los Alamos.

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

  17. Cellular automata and complex dynamics of driven elastic media

    SciTech Connect

    Coppersmith, S.N.; Littlewodd, P.B.; Sibani, P.

    1995-12-01

    Several systems of importance in condensed matter physics can be modelled as an elastic medium in a disordered environment and driven by an external force. In the simplest cases, the equation of motion involves competition between a local non-linear potential (fluctuating in space) and elastic coupling, as well as relaxational (inertialess) dynamics. Despite a simple mathematical description, the interactions between many degrees of freedom lead to the emergence of time and length scales much longer than those set by the microscopic dynamics. Extensive computations have improved the understanding of the behavior of such models, but full solutions of the equations of motion for very large systems are time-consuming and may obscure important physical principles in a massive volume of output. The development of cellular automata models has been crucial, both in conceptual simplification and in allowing the collection of data on many replicas of very large systems. We will discuss how the marriage of cellular automata models and parallel computation on a MasPar MP-1216 computer has helped to elucidate the dynamical properties of these many-degree-of-freedom systems.

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

  19. Entanglement dynamics in one-dimensional quantum cellular automata

    SciTech Connect

    Brennen, Gavin K.; Williams, Jamie E.

    2003-10-01

    Several proposed schemes for the physical realization of a quantum computer consist of qubits arranged in a cellular array. In the quantum circuit model of quantum computation, an often complex series of two-qubit gate operations is required between arbitrarily distant pairs of lattice qubits. An alternative model of quantum computation based on quantum cellular automata (QCA) requires only homogeneous local interactions that can be implemented in parallel. This would be a huge simplification in an actual experiment. We find some minimal physical requirements for the construction of unitary QCA in a one-dimensional Ising spin chain and demonstrate optimal pulse sequences for information transport and entanglement distribution. We also introduce the theory of nonunitary QCA and show by example that nonunitary rules can generate environment assisted entanglement.

  20. Physical modeling of traffic with stochastic cellular automata

    SciTech Connect

    Schreckenberg, M.; Nagel, K. |

    1995-09-01

    A new type of probabilistic cellular automaton for the physical description of single and multilane traffic is presented. In this model space, time and the velocity of the cars are represented by integer numbers (as usual in cellular automata) with local update rules for the velocity. The model is very efficient for both numerical simulations and analytical investigations. The numerical results from extensive simulations reproduce very well data taken from real traffic (e.g. fundamental diagrams). Several analytical results for the model are presented as well as new approximation schemes for stationary traffic. In addition the relation to continuum hydrodynamic theory (Lighthill-Whitham) and the follow-the-leader models is discussed. The model is part of an interdisciplinary research program in Northrhine-Westfalia (``NRW Forschungsverbund Verkehrssimulation``) for the construction of a large scale microsimulation model for network traffic, supported by the government of NRW.

  1. Zeno's paradox in quantum cellular automata

    NASA Astrophysics Data System (ADS)

    Grössing, Gerhard; Zeilinger, Anton

    1991-07-01

    The effect of Zeno's paradox in quantum theory is demonstrated with the aid of quantum mechanical cellular automata. It is shown that the degree of non-unitarity of the cellular automaton evolution and the frequency of consecutive measurements of cellular automaton states are operationally indistinguishable.

  2. a Predator-Prey Model Based on the Fully Parallel Cellular Automata

    NASA Astrophysics Data System (ADS)

    He, Mingfeng; Ruan, Hongbo; Yu, Changliang

    We presented a predator-prey lattice model containing moveable wolves and sheep, which are characterized by Penna double bit strings. Sexual reproduction and child-care strategies are considered. To implement this model in an efficient way, we build a fully parallel Cellular Automata based on a new definition of the neighborhood. We show the roles played by the initial densities of the populations, the mutation rate and the linear size of the lattice in the evolution of this model.

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

    NASA Astrophysics Data System (ADS)

    Jin, Sheng; Qu, Xiaobo; Xu, Cheng; Ma, Dongfang; Wang, Dianhai

    2015-10-01

    This letter develops an improved multi-value cellular automata model for heterogeneous bicycle traffic flow taking the higher maximum speed of electric bicycles into consideration. The update rules of both regular and electric bicycles are improved, with maximum speeds of two and three cells per second respectively. Numerical simulation results for deterministic and stochastic cases are obtained. The fundamental diagrams and multiple states effects under different model parameters are analyzed and discussed. Field observations were made to calibrate the slowdown probabilities. The results imply that the improved extended Burgers cellular automata (IEBCA) model is more consistent with the field observations than previous models and greatly enhances the realism of the bicycle traffic model.

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

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

    NASA Astrophysics Data System (ADS)

    Bakhshandeh, Atieh; Eslami, Ziba

    2013-06-01

    This paper introduces a new image encryption scheme based on chaotic maps, cellular automata and permutation-diffusion architecture. In the permutation phase, a piecewise linear chaotic map is utilized to confuse the plain-image and in the diffusion phase, we employ the Logistic map as well as a reversible memory cellular automata to obtain an efficient and secure cryptosystem. The proposed method admits advantages such as highly secure diffusion mechanism, computational efficiency and ease of implementation. A novel property of the proposed scheme is its authentication ability which can detect whether the image is tampered during the transmission or not. This is particularly important in applications where image data or part of it contains highly sensitive information. Results of various analyses manifest high security of this new method and its capability for practical image encryption.

  6. Cellular automata model for citrus variegated chlorosis

    NASA Astrophysics Data System (ADS)

    Martins, M. L.; Ceotto, G.; Alves, S. G.; Bufon, C. C. B.; Silva, J. M.; Laranjeira, F. F.

    2000-11-01

    A cellular automata model is proposed to analyze the progress of citrus variegated chlorosis epidemics in São Paulo orange plantations. In this model epidemiological and environmental features, such as motility of sharpshooter vectors that perform Lévy flights, level of plant hydric and nutritional stress, and seasonal climatic effects, are included. The observed epidemic data were quantitatively reproduced by the proposed model on varying the parameters controlling vector motility, plant stress, and initial population of diseased plants.

  7. Cellular automata model for citrus variegated chlorosis.

    PubMed

    Martins, M L; Ceotto, G; Alves, S G; Bufon, C C; Silva, J M; Laranjeira, F F

    2000-11-01

    A cellular automata model is proposed to analyze the progress of citrus variegated chlorosis epidemics in São Paulo orange plantations. In this model epidemiological and environmental features, such as motility of sharpshooter vectors that perform Lévy flights, level of plant hydric and nutritional stress, and seasonal climatic effects, are included. The observed epidemic data were quantitatively reproduced by the proposed model on varying the parameters controlling vector motility, plant stress, and initial population of diseased plants. PMID:11102058

  8. 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. PMID:24808226

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

    SciTech Connect

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

    1999-03-11

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

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

  11. Cellular automata modeling of pedestrian's crossing dynamics.

    PubMed

    Zhang, Jin; Wang, Hui; Li, Ping

    2004-07-01

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

  12. Rules for selecting the parameters of Oustaloup recursive approximation for the simulation of linear feedback systems containing PI λ D μ controller

    NASA Astrophysics Data System (ADS)

    Merrikh-Bayat, Farshad

    2012-04-01

    Oustaloup recursive approximation (ORA) is widely used to find a rational integer-order approximation for fractional-order integrators and differentiators of the form sv, v ∈ (-1, 1). In this method the lower bound, the upper bound and the order of approximation should be determined beforehand, which is currently performed by trial and error and may be inefficient in some cases. The aim of this paper is to provide efficient rules for determining the suitable value of these parameters when a fractional-order PID controller is used in a stable linear feedback system. Two numerical examples are also presented to confirm the effectiveness of the proposed formulas.

  13. Guess My Rule Revisited

    ERIC Educational Resources Information Center

    Carraher, David W.; Earnest, Darrell

    2003-01-01

    We present classroom research on a variant of the guess-my-rule game, in which nine-year-old students make up linear functions and challenge classmates to determine their secret rule. We focus on issues students and their teacher confronted in inferring underlying rules and in deciding whether the conjectured rule matched the rule of the creators.…

  14. Cellular-automata models of solid-liquid interfaces.

    PubMed

    Cheng, Cho-Kun; Kier, Lemont B

    2007-11-01

    A series of cellular-automata (CA) models have been created, simulating relationships between water (or aqueous solutions) and solid surfaces of differing hydropathic (i.e., hydrophilic or hydrophobic) nature. Both equilibrium- and dynamic-flow models were examined, employing simple breaking and joining rules to simulate the hydropathic interactions. The CA simulations show that water accumulates near hydrophilic surfaces and avoids hydrophobic surfaces, forming concave-up and concave-down meniscuses, resp., under equilibrium conditions. In the dynamic-flow simulations, the flow rate of water was found to increase past a wall surface as the surface became less hydrophilic, reaching a maximum rate when the solid surface was of intermediate hydropathic state, and then declining with further increase in the hydrophobicity of the surface. Solution simulations show that non-polar solutes tend to achieve higher concentrations near hydrophobic-wall surfaces, whereas other hydrophobic/hydrophilic combinations of solutes and surfaces do not show such accumulations. Physical interpretations of the results are presented, as are some possible biological consequences. PMID:18027370

  15. On the prediction of local patterns in cellular automata

    NASA Astrophysics Data System (ADS)

    Wilbur, John W.; Lipman, David J.; Shamma, Shihab A.

    1986-04-01

    The class of deterministic one-dimensional cellular automata studied recently by Wolfram are considered. We represent a state of an automaton as probability distribution of patterns of a fixed size. In this way information is lost but it is possible to approximate the stepwise action of the automaton by the iteration of an analytic mapping of the set of probability distributions to itself. Such nonlinear analytic mappings generally have nontrivial attrators and in the most interesting cases (Wolfram Class III) these are single points. The point attractors under appropriate circumstances provide good approximations to the frequencies of local patterns generated by the discrete rules from which they were derived. Two appropriate settings for such approximation are transient patterns generated from random starts and patterns generated in a noisy environment. In the case with noise improvement is found by correction of the analytic mappings for the effects of noise. Examples of both types of approximation are considered. Presently at: Dept. of Electrical Engineering, Univ. of Maryland, College Park, MD 20742, USA.

  16. Weyl, Dirac and Maxwell Quantum Cellular Automata

    NASA Astrophysics Data System (ADS)

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

    2015-10-01

    Recent advances on quantum foundations achieved the derivation of free quantum field theory from general principles, without referring to mechanical notions and relativistic invariance. From the aforementioned principles a quantum cellular automata (QCA) theory follows, whose relativistic limit of small wave-vector provides the free dynamics of quantum field theory. The QCA theory can be regarded as an extended quantum field theory that describes in a unified way all scales ranging from an hypothetical discrete Planck scale up to the usual Fermi scale. The present paper reviews the automaton theory for the Weyl field, and the composite automata for Dirac and Maxwell fields. We then give a simple analysis of the dynamics in the momentum space in terms of a dispersive differential equation for narrowband wave-packets. We then review the phenomenology of the free-field automaton and consider possible visible effects arising from the discreteness of the framework. We conclude introducing the consequences of the automaton dispersion relation, leading to a deformed Lorentz covariance and to possible effects on the thermodynamics of ideal gases.

  17. Astrobiological Complexity with Probabilistic Cellular Automata

    NASA Astrophysics Data System (ADS)

    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.

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

  19. 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. PMID:22832998

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

  1. 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. PMID:26549468

  2. Multilevel programmable logic array schemes for microprogrammed automata

    SciTech Connect

    Barkalov, A.A.

    1995-03-01

    Programmable logic arrays (PLAs) provide an efficient tool for implementation of logic schemes of microprogrammed automata (MPA). The number of PLAs in the MPA logic scheme can be minimized by increasing the number of levels. In this paper, we analyze the structures of multilevel schemes of Mealy automata, propose a number of new structures, consider the corresponding correctness conditions, and examine some problems that must be solved in order to satisfy these conditions.

  3. Traffic jam dynamics in stochastic cellular automata

    SciTech Connect

    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) and in NRW (Germany) for large scale microsimulations of network traffic.

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

    NASA Astrophysics Data System (ADS)

    Mu, Fengyun; Zhang, Zengxiang

    2005-10-01

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

  5. Linear solvation energy relationships (LSER): 'rules of thumb' for Vi/100, π*, Βm, and αm estimation and use in aquatic toxicology

    USGS Publications Warehouse

    Hickey, James P.

    1996-01-01

    This chapter provides a listing of the increasing variety of organic moieties and heteroatom group for which Linear Solvation Energy Relationship (LSER) values are available, and the LSER variable estimation rules. The listings include values for typical nitrogen-, sulfur- and phosphorus-containing moieties, and general organosilicon and organotin groups. The contributions by an ion pair situation to the LSER values are also offered in Table 1, allowing estimation of parameters for salts and zwitterions. The guidelines permit quick estimation of values for the four primary LSER variables Vi/100, π*, Βm, and αm by summing the contribtuions from its components. The use of guidelines and Table 1 significantly simplifies computation of values for the LSER variables for most possible organic comppounds in the environment, including the larger compounds of environmental and biological interest.

  6. Dynamic behavior of multirobot systems using lattice gas automata

    NASA Astrophysics Data System (ADS)

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

    1999-07-01

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

  7. Quasi-linear magnetoresistance and the violation of Kohler's rule in the quasi-one-dimensional Ta₄Pd₃Te₁₆ superconductor.

    PubMed

    Xu, Xiaofeng; Jiao, W H; Zhou, N; Guo, Y; Li, Y K; Dai, Jianhui; Lin, Z Q; Liu, Y J; Zhu, Zengwei; Lu, Xin; Yuan, H Q; Cao, Guanghan

    2015-08-26

    We report on the quasi-linear in field intrachain magnetoresistance in the normal state of a quasi-one-dimensional superconductor Ta4Pd3Te16 (Tc ~ 4.6 K). Both the longitudinal and transverse in-chain magnetoresistance shows a power-law dependence, Δρ∝B(α) with the exponent α close to 1 over a wide temperature and field range. The magnetoresistance shows no sign of saturation up to 50 T studied. The linear magnetoresistance observed in Ta4Pd3Te16 is found to be overall inconsistent with the interpretations based on the Dirac fermions in the quantum limit, charge conductivity fluctuations as well as quantum electron-electron interference. Moreover, it is observed that the Kohler's rule, regardless of the field orientations, is violated in its normal state. This result suggests the loss of charge carriers in the normal state of this chain-containing compound, due presumably to the charge-density-wave fluctuations. PMID:26222182

  8. Quasi-linear magnetoresistance and the violation of Kohler's rule in the quasi-one-dimensional Ta₄Pd₃Te₁₆ superconductor.

    PubMed

    Xu, Xiaofeng; Jiao, W H; Zhou, N; Guo, Y; Li, Y K; Dai, Jianhui; Lin, Z Q; Liu, Y J; Zhu, Zengwei; Lu, Xin; Yuan, H Q; Cao, Guanghan

    2015-08-26

    We report on the quasi-linear in field intrachain magnetoresistance in the normal state of a quasi-one-dimensional superconductor Ta4Pd3Te16 (Tc ~ 4.6 K). Both the longitudinal and transverse in-chain magnetoresistance shows a power-law dependence, Δρ∝B(α) with the exponent α close to 1 over a wide temperature and field range. The magnetoresistance shows no sign of saturation up to 50 T studied. The linear magnetoresistance observed in Ta4Pd3Te16 is found to be overall inconsistent with the interpretations based on the Dirac fermions in the quantum limit, charge conductivity fluctuations as well as quantum electron-electron interference. Moreover, it is observed that the Kohler's rule, regardless of the field orientations, is violated in its normal state. This result suggests the loss of charge carriers in the normal state of this chain-containing compound, due presumably to the charge-density-wave fluctuations.

  9. Modeling dynamic urban growth using hybrid cellular automata and particle swarm optimization

    NASA Astrophysics Data System (ADS)

    Rabbani, Amirhosein; Aghababaee, Hossein; Rajabi, Mohammad A.

    2012-01-01

    Conventional raster-based cellular automata (CA) confront many difficulties because of cell size and neighborhood sensitivity. Alternatively, vector CA-based models are very complex and difficult to implement. We present a hybrid cellular automata (HCA) model as a combination of cellular structure and vector concept. The space is still defined by a set of cells, but rasterized spatial objects are also utilized in the structure of transition rules. Particle swarm optimization (PSO) is also used to calculate the urbanization probability of cells based on their distance from the development parameters. The proposed model is applied to Landsat satellite imagery of the city of Tehran, Iran with 28.5-m spatial resolution to simulate the urban growth from 1988 to 2010. Statistical comparison of the ground truth and the simulated image using a kappa coefficient shows an accuracy of 83.42% in comparison to the 81.13% accuracy for the conventional Geo-CA model. Moreover, decreasing the spatial resolution by a factor of one-fourth has reduced the accuracy of the HCA and Geo-CA models by 1.19% and 3.04%, respectively, which shows the lower scale sensitivity of the proposed model. The HCA model is developed to have the simplicity of cellular structure together with optimum features of vector models.

  10. Optimal design of sewer networks using cellular automata-based hybrid methods: Discrete and continuous approaches

    NASA Astrophysics Data System (ADS)

    Afshar, M. H.; Rohani, M.

    2012-01-01

    In this article, cellular automata based hybrid methods are proposed for the optimal design of sewer networks and their performance is compared with some of the common heuristic search methods. The problem of optimal design of sewer networks is first decomposed into two sub-optimization problems which are solved iteratively in a two stage manner. In the first stage, the pipe diameters of the network are assumed fixed and the nodal cover depths of the network are determined by solving a nonlinear sub-optimization problem. A cellular automata (CA) method is used for the solution of the optimization problem with the network nodes considered as the cells and their cover depths as the cell states. In the second stage, the nodal cover depths calculated from the first stage are fixed and the pipe diameters are calculated by solving a second nonlinear sub-optimization problem. Once again a CA method is used to solve the optimization problem of the second stage with the pipes considered as the CA cells and their corresponding diameters as the cell states. Two different updating rules are derived and used for the CA of the second stage depending on the treatment of the pipe diameters. In the continuous approach, the pipe diameters are considered as continuous variables and the corresponding updating rule is derived mathematically from the original objective function of the problem. In the discrete approach, however, an adhoc updating rule is derived and used taking into account the discrete nature of the pipe diameters. The proposed methods are used to optimally solve two sewer network problems and the results are presented and compared with those obtained by other methods. The results show that the proposed CA based hybrid methods are more efficient and effective than the most powerful search methods considered in this work.

  11. Cells as strain-cued automata

    NASA Astrophysics Data System (ADS)

    Cox, Brian N.; Snead, Malcolm L.

    2016-02-01

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

  12. Programmable DNA-Based Finite Automata

    NASA Astrophysics Data System (ADS)

    Ratner, Tamar; Keinan, Ehud

    Computation using DNA has many advantages, including the potential for massive parallelism that allows for large number of operations per second, the direct interface between the computation process and a biological output, and the miniaturization of the computing devices to a molecular scale. In 2001, we reported on the first DNA-based, programmable finite automaton (2-symbol-2-state) capable of computing autonomously with all its hardware, software, input, and output being soluble biomolecules mixed in solution. Later, using similar principles, we developed advanced 3-symbol-3-state automata. We have also shown that real-time detection of the output signal, as well as real-time monitoring of all the computation intermediates, can be achieved by the use of surface plasmon resonance (SPR) technology. More recently, we have shown that it is possible to achieve a biologically relevant output, such as specific gene expression, by using a reporter-gene as an output-readout. We cloned the input into circular plasmids, and thereby achieved control over gene expression by a programmable sequence of computation events. Further efforts are currently directed to immobilization of the input molecules onto a solid chip to enable parallel computation, where the location of the input on the chip represents specific tagging.

  13. Canonical number systems, counting automata and fractals

    NASA Astrophysics Data System (ADS)

    Scheicher, Klaus; Thuswaldner, Jörg M.

    2002-07-01

    In this paper we study properties of the fundamental domain [script F][beta] of number systems, which are defined in rings of integers of number fields. First we construct addition automata for these number systems. Since [script F][beta] defines a tiling of the n-dimensional vector space, we ask, which tiles of this tiling ‘touch’ [script F][beta]. It turns out that the set of these tiles can be described with help of an automaton, which can be constructed via an easy algorithm which starts with the above-mentioned addition automaton. The addition automaton is also useful in order to determine the box counting dimension of the boundary of [script F][beta]. Since this boundary is a so-called graph-directed self-affine set, it is not possible to apply the general theory for the calculation of the box counting dimension of self similar sets. Thus we have to use direct methods.

  14. Cellular automata modelling of biomolecular networks dynamics.

    PubMed

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

    2010-01-01

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

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

  16. On the applications of multiplicity automata in learning

    SciTech Connect

    Beimel, A.; Bergadano, F.; Bshouty, N.H.

    1996-12-31

    Recently the learnability of multiplicity automata attracted a lot of attention, mainly because of its implications on the learnability of several classes of DNF formulae. In this paper we further study the learnability of multiplicity automata. Our starting point is a known theorem from automata theory relating the number of states in a minimal multiplicity automaton for a function f to the rank of a certain matrix F. With this theorem in hand we obtain the following results: (1) A new simple algorithm for learning multiplicity automata in the spirit with a better query complexity. As a result, we improve the complexity for all classes that use the algorithms of and also obtain the best query complexity for several classes known to be learnable by other methods such as decision trees and polynomials over GF(2). (2) We prove the learnability of some new classes that were not known to be learnable before. Most notably, the class of polynomials over finite fields, the class of bounded-degree polynomials over infinite fields, the class of XOR of terms, and a certain class of decision-trees. (3) While multiplicity automata were shown to be useful to prove the learnability of some subclasses of DNF formulae and various other classes, we study the limitations of this method. We prove that this method cannot be used to resolve the learnability of some other open problems such as the learnability of general DNF formulae or even k -term DNF for k = {omega}(log n) or satisfy-s DNF formulae for s = {omega}(1). These results are proven by exhibiting functions in the above classes that require multiplicity automata with superpolynomial number of states.

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

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

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

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

    NASA Astrophysics Data System (ADS)

    Liucci, Luisa; Melelli, Laura; Suteanu, Cristian

    2015-04-01

    Landslides are caused by complex processes controlled by the interaction of numerous factors. Increasing efforts are being made to understand the spatial and temporal evolution of this phenomenon, and the use of remote sensing data is making significant contributions in improving forecast. This paper studies landslides seen as complex dynamic systems, in order to investigate their potential Self Organized Critical (SOC) behavior, and in particular, scale-invariant aspects of processes governing the spatial development of landslides and their temporal evolution, as well as the mechanisms involved in driving the system and keeping it in a critical state. For this purpose, we build Cellular Automata Models, which have been shown to be capable of reproducing the complexity of real world features using a small number of variables and simple rules, thus allowing for the reduction of the number of input parameters commonly used in the study of processes governing landslide evolution, such as those linked to the geomechanical properties of soils. This type of models has already been successfully applied in studying the dynamics of other natural hazards, such as earthquakes and forest fires. The basic structure of the model is composed of three modules: (i) An initialization module, which defines the topographic surface at time zero as a grid of square cells, each described by an altitude value; the surface is acquired from real Digital Elevation Models (DEMs). (ii) A transition function, which defines the rules used by the model to update the state of the system at each iteration. The rules use a stability criterion based on the slope angle and introduce a variable describing the weakening of the material over time, caused for example by rainfall. The weakening brings some sites of the system out of equilibrium thus causing the triggering of landslides, which propagate within the system through local interactions between neighboring cells. By using different rates of

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

    SciTech Connect

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

    1999-11-01

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

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

  3. Annealed and quenched inhomogeneous cellular automata (INCA)

    SciTech Connect

    Vichniac, G.Y.; Tamayo, P.; Hartman, H.

    1986-12-01

    A probabilistic one-dimensional cellular automaton model by Domany and Kinzel is mapped into an inhomogeneous cellular automaton with the Boolean functions XOR an AND as transition rules. Wolfram's classification is recovered by varying the frequency of these two simple rules and by quenching or annealing the inhomogeneity. In particular, ''class 4'' is related to critical behavior in directed percolation. Also, the critical slowing down of second-order phase transitions is related to a stochastic version of the classical ''halting problem'' of computation theory.

  4. A Conformance Testing Relation for Symbolic Timed Automata

    NASA Astrophysics Data System (ADS)

    von Styp, Sabrina; Bohnenkamp, Henrik; Schmaltz, Julien

    We introduce Symbolic Timed Automata, an amalgamation of symbolic transition systems and timed automata, which allows to express nondeterministic data-dependent control flow with inputs and outputs and real-time behaviour. In particular, input data can influence the timing behaviour. We define two semantics for STA, a concrete one as timed labelled transition systems and another one on a symbolic level. We show that the symbolic semantics is complete and correct w.r.t. the concrete one. Finally, we introduce symbolic conformance relation stioco , which is an extension of the well-known ioco conformance relation. Relation stioco is defined using FO-logic on a purely symbolic level. We show that stioco corresponds on the concrete semantic level to Krichen and Tripakis' implementation relation tioco for timed labelled transition systems.

  5. Regular languages, regular grammars and automata in splicing systems

    NASA Astrophysics Data System (ADS)

    Mohamad Jan, Nurhidaya; Fong, Wan Heng; Sarmin, Nor Haniza

    2013-04-01

    Splicing system is known as a mathematical model that initiates the connection between the study of DNA molecules and formal language theory. In splicing systems, languages called splicing languages refer to the set of double-stranded DNA molecules that may arise from an initial set of DNA molecules in the presence of restriction enzymes and ligase. In this paper, some splicing languages resulted from their respective splicing systems are shown. Since all splicing languages are regular, languages which result from the splicing systems can be further investigated using grammars and automata in the field of formal language theory. The splicing language can be written in the form of regular languages generated by grammar. Besides that, splicing systems can be accepted by automata. In this research, two restriction enzymes are used in splicing systems namely BfuCI and NcoI.

  6. On the secure obfuscation of deterministic finite automata.

    SciTech Connect

    Anderson, William Erik

    2008-06-01

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

  7. Relational String Verification Using Multi-track Automata

    NASA Astrophysics Data System (ADS)

    Yu, Fang; Bultan, Tevfik; Ibarra, Oscar H.

    Verification of string manipulation operations is a crucial problem in computer security. In this paper, we present a new relational string verification technique based on multi-track automata. Our approach is capable of verifying properties that depend on relations among string variables. This enables us to prove that vulnerabilities that result from improper string manipulation do not exist in a given program. Our main contributions in this paper can be summarized as follows: (1) We formally characterize the string verification problem as the reachability analysis of string systems and show decidability/undecidability results for several string analysis problems. (2) We develop a sound symbolic analysis technique for string verification that over-approximates the reachable states of a given string system using multi-track automata and summarization. (3) We evaluate the presented techniques with respect to several string analysis benchmarks extracted from real web applications.

  8. A cellular automata model for citrus variegated chlorosis

    NASA Astrophysics Data System (ADS)

    Martins, M. L.; Ceotto, G.; Alves, S. G.; Bufon, C. C. B.; Silva, J. M.; Laranjeira, F. F.

    2001-06-01

    A review of the main results obtained by a cellular automata model recently proposed to analyze the progress of citrus variegated chlorosis epidemics is done. In this model epidemiological and environmental features, such as motility of sharpshooter vectors which perform Lévy flights, hydric and nutritional level of plant stress and seasonal climatic effects, are included. The observed epidemics data were quantitatively reproduced by the proposed model varying the parameters controlling vectors motility, plant stress and initial population of diseased plants.

  9. 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. PMID:26886735

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

    NASA Astrophysics Data System (ADS)

    Alonso, J.; Fernández, A.; Fort, H.

    2006-06-01

    We propose an extension of the evolutionary Prisoner's Dilemma cellular automata, introduced by Nowak and May (1992 Nature 359 826), in which the pressure of the environment is taken into account. This is implemented by requiring that individuals need to collect a minimum score Umin, representing indispensable resources (nutrients, energy, money, etc) to prosper in this environment. So the agents, instead of evolving just by adopting the behaviour of the most successful neighbour (who got Umsn), also take into account if Umsn is above or below the threshold Umin. If Umsnrule (as happens, for example, when the sucker's payoff is much worse than the punishment for mutual defection). We also analyse a more sophisticated version of this model in which the selective rule is supplemented with a 'win-stay, lose-shift' criterion. The cluster structure is analysed, and for this more complex version we found power-law scaling for a restricted region in the parameter space.

  11. Analytical Solution of Traffic Cellular Automata Model

    NASA Astrophysics Data System (ADS)

    Lo, Shih-Ching; Hsu, Chia-Hung

    2009-08-01

    Complex traffic system seems to be simulated successfully by cellular automaton (CA) models. Various models are developed to understand single-lane traffic, multilane traffic, lane-changing behavior and network traffic situations. However, the result of CA simulation can only be obtained after massive microscopic computation. Although, the mean field theory (MFT) has been studied to be the approximation of CA model, the MFT can only applied to the simple CA rules or small value of parameters. In this study, we simulate traffic flow by the NaSch model under different combination of parameters, which are maximal speed, dawdling probability and density. After that, the position of critical density, the slope of free-flow and congested regime are observed and modeled due to the simulated data. Finally, the coefficients of the model will be calibrated by the simulated data and the analytical solution of traffic CA is obtained.

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

  13. Evolution of optimal behaviour in networks of Boolean automata.

    PubMed

    Beaumont, M A

    1993-12-21

    This paper describes the response to selection for optimal behaviour in networks of Boolean automata. The networks considered are "open" in the sense that they receive an input and produce an output. The task that the nets are selected to solve is to maximize the mean "height" attained in a fixed number of iterations in "landscapes" that vary in their ruggedness. This is analogous to an organism with a fixed time budget that attempts to maximize its food intake in an environment where the food concentration varies in space. The results suggest that it is possible to select simple Boolean nets to respond adaptively to their inputs. Selection on simple environments produces a near "optimal" response. The response to complex environments is worse. The results suggest that nets selected on complex environments perform better on environments of different degrees of complexity than those selected on simple environments. Although nets with larger numbers of automata do not respond markedly better to selection, the variability in the response to selection is reduced. It appears to be difficult to predict the movements of nets from a study of the attractors of net with sensory units clamped at particular values. The cycle of bits in clamped nets can vary greatly with small changes in the inputs to the nets. The actual movement of nets does not, however, reflect this instability. It is concluded that networks of Boolean automata may be useful models with which to investigate different genetic algorithms. Furthermore, perturbations in such systems may give insights into the nature of pleiotropy and epistasis.

  14. Bus Automata For Intelligent Robots And Computer Vision

    NASA Astrophysics Data System (ADS)

    Rothstein, Jerome

    1988-02-01

    Bus automata (BA's) are arrays of automata, each controlling a module of a global interconnection network, an automaton and its module constituting a cell. Connecting modules permits cells to become effectively nearest neighbors even when widely separated. This facilitates parallelism in computation far in excess of that allowed by the "bucket-brigade" communication bottleneck of traditional cellular automata (CA's). Distributed information storage via local automaton states permits complex parallel data processing for rapid pattern recognition, language parsing and other distributed computation at systolic array rates. Global BA architecture can be entirely changed in the time to make one cell state transition. The BA is thus a neural model (cells correspond to neurons) with network plasticity attractive for brain models. Planar (chip) BA's admitting optical input (phototransistors) become powerful retinal models. The distributed input pattern is optically fed directly to distributed local memory, ready for distributed processing, both "retinally" and cooperatively with other BA chips ("brain"). This composite BA can compute control signals for output organs, and sensory inputs other than visual can be utilized similarly. In the BA retina is essentially brain, as in mammals (retina and brain are embryologically the same). The BA can also model opto-motor response (frogs, insects) or sonar response (dolphins, bats), and is proposed as the model of choice for the brains of future intelligent robots and for computer eyes with local parallel image processing capability. Multidimensional formal languages are introduced, corresponding to BA's and patterns the way generative grammars correspond to sequential machines, and applied to fractals and their recognition by BA's.

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

    SciTech Connect

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

    1992-05-01

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

  16. Cellular Automata with network incubation in information technology diffusion

    NASA Astrophysics Data System (ADS)

    Guseo, Renato; Guidolin, Mariangela

    2010-06-01

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

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

    SciTech Connect

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

    1992-01-01

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

  18. The Complexity of Finding Reset Words in Finite Automata

    NASA Astrophysics Data System (ADS)

    Olschewski, Jörg; Ummels, Michael

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

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

  20. Studies of vehicle lane-changing to avoid pedestrians with cellular automata

    NASA Astrophysics Data System (ADS)

    Li, Xiang; Sun, Jian-Qiao

    2015-11-01

    This paper presents studies of interactions between vehicles and crossing pedestrians. A cellular automata system model of the traffic is developed, which includes a number of subsystem models such as the single-lane vehicle model, pedestrian model, interaction model and lane-changing model. The random street crossings of pedestrians are modeled as a Poisson process. The drivers of the passing vehicles are assumed to follow a safety-rule in order not to hit the pedestrians. The results of both single and multiple car simulations are presented. We have found that in general, the traffic can benefit from vehicle lane-changing to avoid road-crossing pedestrians. The traffic flow and average vehicle speed can be increased, which leads to higher traffic efficiency. The interactions between vehicles and pedestrians are reduced, which results in shorter vehicle decelerating time due to pedestrians and less switches of the driving mode, thus leads to the better energy economy. The traffic safety can be improved in the perspective of both vehicles and pedestrians. Finally, pedestrians can cross road faster. The negative effect of lane-changing is that pedestrians have to stay longer between the lanes in the crossing.

  1. Co-evolving non-uniform cellular automata to perform computations

    NASA Astrophysics Data System (ADS)

    Sipper, Moshe

    A major impediment of cellular automata (CA) stems from the difficulty of utilizing their complex behavior to perform useful computations. Recent studies by Packard and Mitchell et al. have shown that CAs can be evolved to perform a computational task. In this paper non-uniform CAs are studied, where each cell may contain a different rule, in contrast to the original, uniform model. We describe experiments in which non-uniform CAs are evolved to perform the computational task using a local, co-evolutionary algorithm. For radius r = 3 we attain peak performance values of 0.92 comparable to those obtained for uniform CAs (0.93-0.95). This is notable considering the huge search spaces involved, much larger than the uniform case. Smaller radius CAs (previously unstudied in this context) attain performance values of 0.93-0.94. For r = 1 this is considerably higher than the maximal possible uniform CA performance of 0.83, suggesting that non-uniformity reduces connectivity requirements. We thus demonstrate that: (1) non-uniform CAs can attain high computational performance, and (2) such systems can be evolved rather than designed.

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

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

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

  5. 1/ fα spectra in elementary cellular automata and fractal signals

    NASA Astrophysics Data System (ADS)

    Nagler, Jan; Claussen, Jens Christian

    2005-06-01

    We systematically compute the power spectra of the one-dimensional elementary cellular automata introduced by Wolfram. On the one hand our analysis reveals that one automaton displays 1/f spectra though considered as trivial, and on the other hand that various automata classified as chaotic or complex display no 1/f spectra. We model the results generalizing the recently investigated Sierpinski signal to a class of fractal signals that are tailored to produce 1/fα spectra. From the widespread occurrence of (elementary) cellular automata patterns in chemistry, physics, and computer sciences, there are various candidates to show spectra similar to our results.

  6. Optimal design of variable-stiffness fiber-reinforced composites using cellular automata

    NASA Astrophysics Data System (ADS)

    Setoodeh, Shahriar

    The growing number of applications of composite materials in aerospace and naval structures along with advancements in manufacturing technologies demand continuous innovations in the design of composite structures. In the traditional design of composite laminates, fiber orientation angles are constant for each layer and are usually limited to 0, 90, and +/-45 degrees. To fully benefit from the directional properties of composite laminates, such limitations have to be removed. The concept of variable-stiffness laminates allows the stiffness properties to vary spatially over the laminate. Through tailoring of fiber orientations and laminate thickness spatially in an optimal fashion, mechanical properties of a part can be improved. In this thesis, the optimal design of variable-stiffness fiber-reinforced composite laminates is studied using an emerging numerical engineering optimization scheme based on the cellular automata paradigm. A cellular automaton (CA) based design scheme uses local update rule for both field variables (displacements) and design variables (lay-up configuration and laminate density measure) in an iterative fashion to convergence to an optimal design. In the present work, the displacements are updated based on the principle of local equilibrium and the design variables are updated according to the optimality criteria for minimum compliance design. A closed form displacement update rule for constant thickness isotropic continua is derived, while for the general anisotropic continua with variable thickness a numeric update rule is used. Combined lay-up and topology design of variable-stiffness flat laminates is performed under the action of in-plane loads and bending loads. An optimality criteria based formulation is used to obtain local design rules for minimum compliance design subject to a volume constraint. It is shown that the design rule splits into a two step application. In the first step an optimal lay-up configuration is computed and in

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

    NASA Astrophysics Data System (ADS)

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

    2016-04-01

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

  8. Born Rule(s)

    SciTech Connect

    Sinha, Urbasi

    2011-09-23

    This paper is based on work published in [1]. It describes a triple slit experiment using single photons that has been used to provide a bound on one of the most fundamental axioms of quantum mechanics i.e. Born's rule for probabilities [2]. In spite of being one of the most successful theories which describes various natural phenomena, quantum mechanics has enough intricacies and ''weirdness'' associated with it which makes many physicists believe that it may not be the final theory and hints towards the possibility of more generalized versions. Quantum interference as shown by a double slit diffraction experiment only occurs from pairs of paths. Even in multi-slit versions, interference can only occur between pairs of possibilities and increasing the number of slits does not increase the complexity of the theory that still remains second-order. However, more generalized versions of quantum mechanics may allow for multi-path i.e. higher than second order interference. This experiment also provides a bound on the magnitude of such higher order interference. We have been able to bound the magnitude of three-path interference to less than 10{sup -2} of the expected two-path interference, thus ruling out third and higher order interference and providing a bound on the accuracy of Born's rule.

  9. Born Rule(s)

    NASA Astrophysics Data System (ADS)

    Sinha, Urbasi

    2011-09-01

    This paper is based on work published in [1]. It describes a triple slit experiment using single photons that has been used to provide a bound on one of the most fundamental axioms of quantum mechanics i.e. Born's rule for probabilities [2]. In spite of being one of the most successful theories which describes various natural phenomena, quantum mechanics has enough intricacies and "weirdness" associated with it which makes many physicists believe that it may not be the final theory and hints towards the possibility of more generalized versions. Quantum interference as shown by a double slit diffraction experiment only occurs from pairs of paths. Even in multi-slit versions, interference can only occur between pairs of possibilities and increasing the number of slits does not increase the complexity of the theory that still remains second-order. However, more generalized versions of quantum mechanics may allow for multi-path i.e. higher than second order interference. This experiment also provides a bound on the magnitude of such higher order interference. We have been able to bound the magnitude of three-path interference to less than 10-2 of the expected two-path interference, thus ruling out third and higher order interference and providing a bound on the accuracy of Born's rule.

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

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

    NASA Astrophysics Data System (ADS)

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

    2016-10-01

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

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

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

    NASA Astrophysics Data System (ADS)

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

    2013-12-01

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

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

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

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

  16. History dependent quantum random walks as quantum lattice gas automata

    SciTech Connect

    Shakeel, Asif E-mail: dmeyer@math.ucsd.edu Love, Peter J. E-mail: dmeyer@math.ucsd.edu; Meyer, David A. E-mail: dmeyer@math.ucsd.edu

    2014-12-15

    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 history information arise naturally as geometrical degrees of freedom on the lattice.

  17. Critical Probabilities and Convergence Time of Percolation Probabilistic Cellular Automata

    NASA Astrophysics Data System (ADS)

    Taggi, Lorenzo

    2015-05-01

    This paper considers a class of probabilistic cellular automata undergoing a phase transition with an absorbing state. Denoting by the neighbourhood of site , the transition probability is if or otherwise, . For any there exists a non-trivial critical probability that separates a phase with an absorbing state from a fluctuating phase. This paper studies how the neighbourhood affects the value of and provides lower bounds for . Furthermore, by using dynamic renormalization techniques, we prove that the expected convergence time of the processes on a finite space with periodic boundaries grows exponentially (resp. logarithmically) with the system size if (resp. ). This provides a partial answer to an open problem in Toom et al. (Stochastic Cellular Systems: Ergodicity, Memory, Morphogenesis, pp. 1-182. Manchester University Press, Manchester, 1990; Topics in Contemporary Probability and its Applications, pp. 117-157. CRC Press, Boca Raton, 1995).

  18. Evolutionary strategies of stochastic learning automata in the prisoner's dilemma.

    PubMed

    Billard, E A

    1996-01-01

    Stochastic learning automata (SLA) model stimulus-response species which receive feedback from the environment and adjust their mixed strategies in a Prisoner's Dilemma. A large heterogeneous population consists of SLA applying different strategies (i.e. different learning parameters) and other players applying deterministic strategies, Tit-For-Tat (TFT) or Always-Defect (ALLD). The predicted equilibria determine the payoffs within a generation for applying particular strategies and these equilibria are confirmed by simulation. The resultant population dynamics over many generations show that SLA with insensitive penalty responses strongly favor defection and dominate in subsequent generations over SLA with sensitive penalty responses. The SLA strategies are not evolutionarily stable as they can be invaded by TFT or ALLD. With the introduction of memory in the stimulus-response model, SLA learn to cooperate with TFT players.

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

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

    SciTech Connect

    Crutchfield, J.P.; Mitchell, M.

    1998-04-01

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

  1. 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. PMID:25476990

  2. Phonematic recognition by linear prediction: Experiment

    NASA Astrophysics Data System (ADS)

    Miclet, L.; Grenier, Y.; Leroux, J.

    The recognition of speech signals analyzed by linear prediction is introduced. The principle of the channel adapted vocoder (CAV) is outlined. The learning of each channel model and adaptation to the speaker are discussed. A method stemming from the canonical analysis of correlations is given. This allows, starting with the CAV of one speaker, the calculation of that of another. The projection function is learned from a series of key words pronounced by both speakers. The reconstruction of phonemes can be explained by recognition factors arising from the vocoder. Automata associated with the channels are used for local smoothing and series of segments are treated in order to produce a phonemic lattice.

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

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

  5. 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." PMID:25353755

  6. Cramer's Rule Revisited

    ERIC Educational Resources Information Center

    Ayoub, Ayoub B.

    2005-01-01

    In 1750, the Swiss mathematician Gabriel Cramer published a well-written algebra book entitled "Introduction a l'Analyse des Lignes Courbes Algebriques." In the appendix to this book, Cramer gave, without proof, the rule named after him for solving a linear system of equations using determinants (Kosinki, 2001). Since then several derivations of…

  7. Action principle for cellular automata and the linearity of quantum mechanics

    NASA Astrophysics Data System (ADS)

    Eilenberger, Falk; Prater, Karin; Minardi, Stefano; Geiss, Reinhard; Röpke, Ulrich; Kobelke, Jens; Schuster, Kay; Bartelt, Hartmut; Nolte, Stefan; Tünnermann, Andreas; Pertsch, Thomas

    2013-10-01

    We report the first experimental observation of vortex light bullets that are discrete, spatiotemporal, solitary waves with orbital angular momentum. We analyze conditions for their existence and investigate their rich properties and dynamics. Vortex light bullets are excited in fiber arrays with spatially shaped femtosecond pulses and analyzed with a spatiotemporal cross correlator. Most importantly, we find that they have entirely new stability properties, being robust against considerable degrees of perturbation in a limited range of energies. All experimental findings are backed up by rigorous simulations, giving further insight into the rich dynamics of vortex light bullets.

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

    PubMed

    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.

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

  10. Some properties of the floor field cellular automata evacuation model

    NASA Astrophysics Data System (ADS)

    Gwizdałła, Tomasz M.

    2015-02-01

    We study the process of evacuation of pedestrians from the room with the given arrangement of doors and obstacles by using the cellular automata technique. The technique which became quite popular is characterized by the discretization of time as well as space. For such a discretized space we use so-called floor field model which generally corresponds to the description of every cell by some monotonic function of distance between this cell and the closest exit. We study several types of effects. We start from some general features of model like the kind of a neighborhood or the factors disrupting the motion. Then we analyze the influence of asymmetry and size on the evacuation time. Finally we show characteristics concerning different arrangements of exits and include a particular approach to the proxemics effects. The scaling analyses help us to distinguish these cases which just reflect the geometry of the system and those which depend also on the simulation properties. All calculations are performed for a wide range of initial densities corresponding to different occupation rates as described by the typical crowd counting techniques.

  11. Cellular automata for traffic flow modeling. Final report

    SciTech Connect

    Benjaafar, S.; Dooley, K.; Setyawan, W.

    1997-12-01

    In this paper, the authors explore the usefulness of cellular automata to traffic flow modeling. The authors extend some of the existing CA models to capture characteristics of traffic flow that have not been possible to model using either conventional analytical models or existing simulation techniques. In particular, the authors examine higher moments of traffic flow and evaluate their effect on overall traffic performance. The behavior of these higher moments is found to be surprising, somewhat counter-intuitive, and to have important implications for design and control of traffic systems. For example, the authors show that the density of maximum throughput is near the density of maximum speed variance. Contrary to current practice, traffic should, therefore, be steered away from this density region. For deterministic systems the authors found traffic flow to possess a finite period which is highly sensitive to density in a non-monotonic fashion. The authors show that knowledge of this periodic behavior to be very useful in designing and controlling automated systems. These results are obtained for both single and two lane systems. For two lane systems, the authors also examine the relationship between lane changing behavior and flow performance. The authors show that the density of maximum land changing frequency occurs past the density of maximum throughput. Therefore, traffic should also be steered away from this density region.

  12. Correlation velocities in heterogeneous bidirectional cellular automata traffic flow

    NASA Astrophysics Data System (ADS)

    Lakouari, N.; Bentaleb, K.; Ez-Zahraouy, H.; Benyoussef, A.

    2015-12-01

    Traffic flow behavior and velocity correlation in a bidirectional two lanes road are studied using Cellular Automata (CA) model within a mixture of fast and slow vehicles. The behaviors of the Inter-lane and Intra-lane Velocity Correlation Coefficients (V.C.C.) due to the interactions between vehicles in the same lane and the opposite lane as a function of the density are investigated. It is shown that high densities in one lane lead to large cluster in the second one, which decreases the Intra-lane velocity correlations and thereby form clusters in the opposite lane. Moreover, we have found that there is a critical density over which the Inter-lane V.C.C. occurs, but below which no Inter-lane V.C.C. happens. The spatiotemporal diagrams correspond to those regions are derived numerically. Furthermore, the effect of the overtaking probability in one lane on the Intra-lane V.C.C. in the other lane is also investigated. It is shown that the decrease of the overtaking probability in one lane decreases slightly the Intra-lane V.C.C. at intermediate density regimes in the other lane, which improves the current, as well as the Inter-lane V.C.C. decreases.

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

    PubMed

    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

  14. Robustness of a cellular automata model for the HIV infection

    NASA Astrophysics Data System (ADS)

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

    2008-11-01

    An investigation was conducted to study the robustness of the results obtained from the cellular automata model which describes the spread of the HIV infection within lymphoid tissues [R.M. Zorzenon dos Santos, S. Coutinho, Phys. Rev. Lett. 87 (2001) 168102]. The analysis focused on the dynamic behavior of the model when defined in lattices with different symmetries and dimensionalities. The results illustrated that the three-phase dynamics of the planar models suffered minor changes in relation to lattice symmetry variations and, while differences were observed regarding dimensionality changes, qualitative behavior was preserved. A further investigation was conducted into primary infection and sensitiveness of the latency period to variations of the model’s stochastic parameters over wide ranging values. The variables characterizing primary infection and the latency period exhibited power-law behavior when the stochastic parameters varied over a few orders of magnitude. The power-law exponents were approximately the same when lattice symmetry varied, but there was a significant variation when dimensionality changed from two to three. The dynamics of the three-dimensional model was also shown to be insensitive to variations of the deterministic parameters related to cell resistance to the infection, and the necessary time lag to mount the specific immune response to HIV variants. The robustness of the model demonstrated in this work reinforce that its basic hypothesis are consistent with the three-stage dynamic of the HIV infection observed in patients.

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

  16. Topometry optimization of sheet metal structures for crashworthiness design using hybrid cellular automata

    NASA Astrophysics Data System (ADS)

    Mozumder, Chandan K.

    The objective in crashworthiness design is to generate plastically deformable energy absorbing structures which can satisfy the prescribed force-displacement (FD) response. The FD behavior determines the reaction force, displacement and the internal energy that the structure should withstand. However, attempts to include this requirement in structural optimization problems remain scarce. The existing commercial optimization tools utilize models under static loading conditions because of the complexities associated with dynamic/impact loading. Due to the complexity of a crash event and the consequent time required to numerically analyze the dynamic response of the structure, classical methods (i.e., gradient-based and direct) are not well developed to solve this undertaking. This work presents an approach under the framework of the hybrid cellular automaton (HCA) method to solve the above challenge. The HCA method has been successfully applied to nonlinear transient topology optimization for crashworthiness design. In this work, the HCA algorithm has been utilized to develop an efficient methodology for synthesizing shell-based sheet metal structures with optimal material thickness distribution under a dynamic loading event using topometry optimization. This method utilizes the cellular automata (CA) computing paradigm and nonlinear transient finite element analysis (FEA) via ls-dyna. In this method, a set field variables is driven to their target states by changing a convenient set of design variables (e.g., thickness). These rules operate locally in cells within a lattice that only know local conditions. The field variables associated with the cells are driven to a setpoint to obtain the desired structure. This methodology is used to design for structures with controlled energy absorption with specified buckling zones. The peak reaction force and the maximum displacement are also constrained to meet the desired safety level according to passenger safety

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

  18. Ecological risk assessment of genetically modified crops based on cellular automata modeling.

    PubMed

    Yang, Jun; Wang, Zhi-Rui; Yang, De-Li; Yang, Qing; Yan, Jun; He, Ming-Feng

    2009-01-01

    The assessment of ecological risk in genetically modified (GM) biological systems is critically important for decision-making and public acceptance. Cellular automata (CA) provide a potential modeling and simulation framework for representing relationships and interspecies interactions both temporally and spatially. In this paper, a simple subsystem contains only four species: crop, target pest, non-target pest and enemy insect, and a three layer arrangement of LxL stochastic cellular automata with a periodic boundary were established. The simulation of this simplified system showed abundant and sufficient complexity in population assembly and densities, suggesting a prospective application in ecological risk assessment of GM crops. PMID:19477260

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

    NASA Astrophysics Data System (ADS)

    Umamahesvari, H.; Ajitha, D.

    2015-06-01

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

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

    SciTech Connect

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

    2015-06-24

    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.

  1. Ecological risk assessment of genetically modified crops based on cellular automata modeling.

    PubMed

    Yang, Jun; Wang, Zhi-Rui; Yang, De-Li; Yang, Qing; Yan, Jun; He, Ming-Feng

    2009-01-01

    The assessment of ecological risk in genetically modified (GM) biological systems is critically important for decision-making and public acceptance. Cellular automata (CA) provide a potential modeling and simulation framework for representing relationships and interspecies interactions both temporally and spatially. In this paper, a simple subsystem contains only four species: crop, target pest, non-target pest and enemy insect, and a three layer arrangement of LxL stochastic cellular automata with a periodic boundary were established. The simulation of this simplified system showed abundant and sufficient complexity in population assembly and densities, suggesting a prospective application in ecological risk assessment of GM crops.

  2. A stochastic parameterization for deep convection using cellular automata

    NASA Astrophysics Data System (ADS)

    Bengtsson, L.; Steinheimer, M.; Bechtold, P.; Geleyn, J.

    2012-12-01

    Cumulus parameterizations used in most operational weather and climate models today are based on the mass-flux concept which took form in the early 1970's. In such schemes it is assumed that a unique relationship exists between the ensemble-average of the sub-grid convection, and the instantaneous state of the atmosphere in a vertical grid box column. However, such a relationship is unlikely to be described by a simple deterministic function (Palmer, 2011). Thus, because of the statistical nature of the parameterization challenge, it has been recognized by the community that it is important to introduce stochastic elements to the parameterizations (for instance: Plant and Craig, 2008, Khouider et al. 2010, Frenkel et al. 2011, Bentsson et al. 2011, but the list is far from exhaustive). There are undoubtedly many ways in which stochastisity can enter new developments. In this study we use a two-way interacting cellular automata (CA), as its intrinsic nature possesses many qualities interesting for deep convection parameterization. In the one-dimensional entraining plume approach, there is no parameterization of horizontal transport of heat, moisture or momentum due to cumulus convection. In reality, mass transport due to gravity waves that propagate in the horizontal can trigger new convection, important for the organization of deep convection (Huang, 1988). The self-organizational characteristics of the CA allows for lateral communication between adjacent NWP model grid-boxes, and temporal memory. Thus the CA scheme used in this study contain three interesting components for representation of cumulus convection, which are not present in the traditional one-dimensional bulk entraining plume method: horizontal communication, memory and stochastisity. The scheme is implemented in the high resolution regional NWP model ALARO, and simulations show enhanced organization of convective activity along squall-lines. Probabilistic evaluation demonstrate an enhanced spread in

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

  4. Correlation and coherence in quantum-dot cellular automata

    NASA Astrophysics Data System (ADS)

    Toth, Geza

    In this thesis we investigate the role of correlation and coherence in two possible realizations of Quantum-dot Cellular Automata (QCA): realizations as a semiconductor multi-quantum-dot structure and as a metal-island single electron tunneling circuit. The two are different from the point of view of the underlying physics. The metal island circuits are very strongly connected to the heat bath and they can be modeled semi-classically, using classical quantities such as charging energy and capacitance. To model the semiconductor realization, a quantum mechanical treatment is necessary. The quantum mechanical state of the cells evolves coherently, at least for time scales smaller than the decoherence time. In the first part of the thesis the theory of metal island circuits is used to design a cell structure permitting adiabatic clocking. It is also used to analyze the conductance suppression of coupled double-dots and reproduce the corresponding experimental results from the theory by modeling coherent electron motion inside the QCA cell. In the second part the semiconductor QCA realization is studied. Using Hartree-Fock approximation the basic phenomena in the one dimensional QCA array (large and small amplitude polarization wave propagation and collision) is investigated. The approach is also used to define Quantum Cellular Neural Networks. In the last part of the thesis intermediate approximations are constructed between the Hartree-Fock and the exact model. An alternative of the density matrix description, the coherence vector formalism is reviewed and used to investigate possibility of quantum computing with QCA. Using the coherence vector formalism as a basis an approximation is presented that includes all two-point correlations while neglects the higher order correlations. Another approach is shown for improving the self-consistent Hartree-Fock model for a majority gate by including correlation effects. The method fixes the qualitatively wrong results obtained

  5. Lower bounds on parallel, distributed, and automata computations

    SciTech Connect

    Gereb-Graus, M.

    1989-01-01

    In this thesis the author presents a collection of lower bound results from several areas of computer science. Conventional wisdom states that lower bounds are much more difficult to prove than upper bounds. To get an upper bound one has to demonstrate just one scheme with the appropriate complexity. On the other hand, to prove lower bounds one has to deal with all possible schemes. The difficulty of lower bounds can be further demonstrated by the fact that wherever for some problem he has a very large gap between the lower and the upper bound, the conjecture for the truth usually is the known upper bound. His first two results are impossibility results for finite state automata. A hierarchy of complexity classes on tree languages (analogous to the polynomial hierarchy) accepted by alternating finite state machines is introduced. It turns out that the alternating class is equal to the well known tree language class accepted by the treeautomata. By separating the deterministic and the nondeterministic classes of his hierarchy he gives a negative answer to the folklore question whether the expressive power of the treeautomata is the same as that of the finite state automaton that can walk on the edges of the tree (bugautomaton). He proves that three-head one-way DFA cannot perform string-matching, that is, no three-head one-way DFA accepts the language L = (x{number sign}y {vert bar} x is a substring of y, where x,y {element of} (0,1){sup *}). He proves that in a one round fair coin flipping (or voting) scheme with n participants, there is at least one participant who has a chance to decide the outcome with probability at least 3/n {minus} o(1/n).

  6. 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. PMID:24244472

  7. Simulating the Conversion of Rural Settlements to Town Land Based on Multi-Agent Systems and Cellular Automata

    PubMed Central

    Liu, Yaolin; Kong, Xuesong; Liu, Yanfang; Chen, Yiyun

    2013-01-01

    Rapid urbanization in China has triggered the conversion of land from rural to urban use, particularly the conversion of rural settlements to town land. This conversion is the result of the joint effects of the geographic environment and agents involving the government, investors, and farmers. To understand the dynamic interaction dominated by agents and to predict the future landscape of town expansion, a small town land-planning model is proposed based on the integration of multi-agent systems (MAS) and cellular automata (CA). The MAS-CA model links the decision-making behaviors of agents with the neighbor effect of CA. The interaction rules are projected by analyzing the preference conflicts among agents. To better illustrate the effects of the geographic environment, neighborhood, and agent behavior, a comparative analysis between the CA and MAS-CA models in three different towns is presented, revealing interesting patterns in terms of quantity, spatial characteristics, and the coordinating process. The simulation of rural settlements conversion to town land through modeling agent decision and human-environment interaction is very useful for understanding the mechanisms of rural-urban land-use change in developing countries. This process can assist town planners in formulating appropriate development plans. PMID:24244472

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

  9. Statistical properties of cellular automata in the context of learning and recognition: Part 2, inverting local structure theory equations to find cellular automata with specified properties

    SciTech Connect

    Gutowitz, H.A.

    1988-11-18

    This is the second of two lectures. In the first lecture the map from a cellular automaton to a sequence of analytical approximations called the local structure theory was described. In this lecture the inverse map from approximation to the class of cellular automata approximated is constructed. The key matter is formatting the local structure theory equations in terms of block probability estimates weighted by coefficients. The inverse mapping relies on this format. Each possible assignment of values to the coefficients defines a class of automata with related statistical properties. It is suggested that these coefficients serve to smoothly parameterize the space of cellular automata. By varying the values of the parameters a cellular automaton network may be designed so that it has a specified invariant measure. If an invariant measure is considered a ''memory'' of the network, then this variation of parameters to specify the invariant measure must be considered ''learning.'' It is important to note that in this view learning is not the storage of patterns in a network, but rather the tailoring of the dynamics of a network. 7 figs.

  10. 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. PMID:16117022

  11. Applications of automata and graphs: Labeling operators in Hilbert space. II

    SciTech Connect

    Cho, Ilwoo; Jorgensen, Palle E. T.

    2009-06-15

    We introduced a family of infinite graphs directly associated with a class of von Neumann automaton model A{sub G}. These are finite state models used in symbolic dynamics: stimuli models and in control theory. In the context of groupoid von Neumann algebras, and an associated fractal group, we prove a classification theorem for representations of automata.

  12. Study of the dynamic behavior of quantum cellular automata in graphane nanoclusters

    NASA Astrophysics Data System (ADS)

    León, A.; Pacheco, M.

    2011-03-01

    The possible creation of architectures of quantum cellular automata formed by simple molecules opens a very promising and interesting area of research due to the possibility of going beyond the current limits of miniaturization and integration of devices. In this research we theoretically study the electronic properties of a quan- tum dot array in graphene nanoribbons and in an array of molecules with graphane structures. The role of quantum dots in the ribbons and in the mole- cules is played by oxide reduction centers that can trap or release electrons. With the knowledge about these properties we design cellular automata archi- tectures with nanoribbons and molecular arrays, with this it will be feasible to store and process logic information at room temperature. The stability of the proposed graphene structures are studied using quan- tum methods of geometric optimization [1]. The electronic properties of the nanoribbons are obtained from first-principle calculations based on pseudo- potentials by using the generalized gradient approximation (GGA) of Perdew- Burke-Ernzerhof [2-3]. With the parameters obtained from the study of the electronic properties of the cells that make up the automata, we can make a simulation of the dynamical response of the system. To do this, we use a set of accelerated algorithms for discrete systems [4] based on the Glauber dynamic [5]. Our results show that the studied system can be scaled so that the propagation of digital information throughout the automata is possible at room temperature.

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

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

  15. Performance of the majority voting rule in solving the density classification problem in high dimensions

    NASA Astrophysics Data System (ADS)

    Gómez Soto, José Manuel; Fukś, Henryk

    2011-11-01

    The density classification problem (DCP) is one of the most widely studied problems in the theory of cellular automata. After it was shown that the DCP cannot be solved perfectly, the research in this area has been focused on finding better rules that could solve the DCP approximately. In this paper, we argue that the majority voting rule in high dimensions can achieve high performance in solving the DCP, and that its performance increases with dimension. We support this conjecture with arguments based on the mean-field approximation and direct computer simulations.

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

  17. Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages

    NASA Astrophysics Data System (ADS)

    Okhotin, Alexander

    Linear conjunctive grammars define the same family of languages as one-way real-time cellular automata (Okhotin, "On the equivalence of linear conjunctive grammars to trellis automata", RAIRO ITA, 2004), and this family is known to be incomparable to the context-free languages (Terrier, "On real-time one-way cellular array", Theoret. Comput. Sci., 1995). This paper investigates subclasses of the context-free languages for possible containment in this class. It is shown that every visibly pushdown automaton (Alur, Madhusudan, "Visibly pushdown languages", STOC 2004) can be simulated by a one-way real-time cellular automaton, but already for LL(1) context-free languages and for one-counter DPDAs no simulation is possible.

  18. Efficient process development for bulk silicon etching using cellular automata simulation techniques

    NASA Astrophysics Data System (ADS)

    Marchetti, James; He, Yie; Than, Olaf; Akkaraju, Sandeep

    1998-09-01

    This paper describes cellular automata simulation techniques used to predict the anisotropic etching of single-crystal silicon. In particular, this paper will focus on the application of wet etching of silicon wafers using typical anisotropic etchants such as KOH, TMAH, and EDP. Achieving a desired final 3D geometry of etch silicon wafers often is difficult without requiring a number of fabrication design iterations. The result is wasted time and resources. AnisE, a tool to simulate anisotropic etching of silicon wafers using cellular automata simulation, was developed in order to efficiently prototype and manufacture MEMS devices. AnisE has been shown to effectively decrease device development time and costs by up to 50% and 60%, respectively.

  19. Simulation of a plane wavefront propagating in cardiac tissue using a cellular automata model.

    PubMed

    Barbosa, Carlos R Hall

    2003-12-21

    We present a detailed description of a cellular automata model for the propagation of action potential in a planar cardiac tissue, which is very fast and easy to use. The model incorporates anisotropy in the electrical conductivity and a spatial variation of the refractory time. The transmembrane potential distribution is directly derived from the cell states, and the intracellular and extracellular potential distributions are calculated for the particular case of a plane wavefront. Once the potential distributions are known, the associated current densities are calculated by Ohm's law, and the magnetic field is determined at a plane parallel to the cardiac tissue by applying the law of Biot and Savart. The results obtained for propagation speed and for magnetic field amplitude with the cellular automata model are compared with values predicted by the bidomain formulation, for various angles between wavefront propagation and fibre direction, characterizing excellent agreement between the models.

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

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

    DOE PAGESBeta

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

    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

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

    SciTech Connect

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

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

  3. Spatial organization and evolution period of the epidemic model using cellular automata.

    PubMed

    Liu, Quan-Xing; Jin, Zhen; Liu, Mao-Xing

    2006-09-01

    We investigate epidemic models with spatial structure based on the cellular automata method. The construction of the cellular automata is from the study by Weimar and Boon about the reaction-diffusion equations [Phys. Rev. E 49, 1749 (1994)]. Our results show that the spatial epidemic models exhibit the spontaneous formation of irregular spiral waves at large scales within the domain of chaos. Moreover, the irregular spiral waves grow stably. The system also shows a spatial period-2 structure at one dimension outside the domain of chaos. It is interesting that the spatial period-2 structure will break and transform into a spatial synchronous configuration in the domain of chaos. Our results confirm that populations embed and disperse more stably in space than they do in nonspatial counterparts. PMID:17025597

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

    NASA Astrophysics Data System (ADS)

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

    2016-08-01

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

  5. Spatial organization and evolution period of the epidemic model using cellular automata.

    PubMed

    Liu, Quan-Xing; Jin, Zhen; Liu, Mao-Xing

    2006-09-01

    We investigate epidemic models with spatial structure based on the cellular automata method. The construction of the cellular automata is from the study by Weimar and Boon about the reaction-diffusion equations [Phys. Rev. E 49, 1749 (1994)]. Our results show that the spatial epidemic models exhibit the spontaneous formation of irregular spiral waves at large scales within the domain of chaos. Moreover, the irregular spiral waves grow stably. The system also shows a spatial period-2 structure at one dimension outside the domain of chaos. It is interesting that the spatial period-2 structure will break and transform into a spatial synchronous configuration in the domain of chaos. Our results confirm that populations embed and disperse more stably in space than they do in nonspatial counterparts.

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

  7. Exploiting the features of the finite state automata for biomolecular computing.

    PubMed

    Martínez-Pérez, Israel Marck; Ignatova, Zoya; Zimmermann, Karl-Heinz

    2009-01-01

    Here, we review patents that have emerged in the field of DNA-based computing focusing thereby on the discoveries using the concept of molecular finite state automata. A finite state automaton, operating on a finite sequence of symbols and converting information from one to another, provides a basis for developing molecular-scale autonomous programmable models of biomolecular computation at cellular level. We also provide a brief overview on inventions which methodologically support the DNA-based computational approach. PMID:19519583

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

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

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

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

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

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

    NASA Astrophysics Data System (ADS)

    Vanag, Vladimir K.

    1999-05-01

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

  14. Linearly Adjustable International Portfolios

    NASA Astrophysics Data System (ADS)

    Fonseca, R. J.; Kuhn, D.; Rustem, B.

    2010-09-01

    We present an approach to multi-stage international portfolio optimization based on the imposition of a linear structure on the recourse decisions. Multiperiod decision problems are traditionally formulated as stochastic programs. Scenario tree based solutions however can become intractable as the number of stages increases. By restricting the space of decision policies to linear rules, we obtain a conservative tractable approximation to the original problem. Local asset prices and foreign exchange rates are modelled separately, which allows for a direct measure of their impact on the final portfolio value.

  15. Collaboration rules.

    PubMed

    Evans, Philip; Wolf, Bob

    2005-01-01

    Corporate leaders seeking to boost growth, learning, and innovation may find the answer in a surprising place: the Linux open-source software community. Linux is developed by an essentially volunteer, self-organizing community of thousands of programmers. Most leaders would sell their grandmothers for workforces that collaborate as efficiently, frictionlessly, and creatively as the self-styled Linux hackers. But Linux is software, and software is hardly a model for mainstream business. The authors have, nonetheless, found surprising parallels between the anarchistic, caffeinated, hirsute world of Linux hackers and the disciplined, tea-sipping, clean-cut world of Toyota engineering. Specifically, Toyota and Linux operate by rules that blend the self-organizing advantages of markets with the low transaction costs of hierarchies. In place of markets' cash and contracts and hierarchies' authority are rules about how individuals and groups work together (with rigorous discipline); how they communicate (widely and with granularity); and how leaders guide them toward a common goal (through example). Those rules, augmented by simple communication technologies and a lack of legal barriers to sharing information, create rich common knowledge, the ability to organize teams modularly, extraordinary motivation, and high levels of trust, which radically lowers transaction costs. Low transaction costs, in turn, make it profitable for organizations to perform more and smaller transactions--and so increase the pace and flexibility typical of high-performance organizations. Once the system achieves critical mass, it feeds on itself. The larger the system, the more broadly shared the knowledge, language, and work style. The greater individuals' reputational capital, the louder the applause and the stronger the motivation. The success of Linux is evidence of the power of that virtuous circle. Toyota's success is evidence that it is also powerful in conventional companies. PMID

  16. Collaboration rules.

    PubMed

    Evans, Philip; Wolf, Bob

    2005-01-01

    Corporate leaders seeking to boost growth, learning, and innovation may find the answer in a surprising place: the Linux open-source software community. Linux is developed by an essentially volunteer, self-organizing community of thousands of programmers. Most leaders would sell their grandmothers for workforces that collaborate as efficiently, frictionlessly, and creatively as the self-styled Linux hackers. But Linux is software, and software is hardly a model for mainstream business. The authors have, nonetheless, found surprising parallels between the anarchistic, caffeinated, hirsute world of Linux hackers and the disciplined, tea-sipping, clean-cut world of Toyota engineering. Specifically, Toyota and Linux operate by rules that blend the self-organizing advantages of markets with the low transaction costs of hierarchies. In place of markets' cash and contracts and hierarchies' authority are rules about how individuals and groups work together (with rigorous discipline); how they communicate (widely and with granularity); and how leaders guide them toward a common goal (through example). Those rules, augmented by simple communication technologies and a lack of legal barriers to sharing information, create rich common knowledge, the ability to organize teams modularly, extraordinary motivation, and high levels of trust, which radically lowers transaction costs. Low transaction costs, in turn, make it profitable for organizations to perform more and smaller transactions--and so increase the pace and flexibility typical of high-performance organizations. Once the system achieves critical mass, it feeds on itself. The larger the system, the more broadly shared the knowledge, language, and work style. The greater individuals' reputational capital, the louder the applause and the stronger the motivation. The success of Linux is evidence of the power of that virtuous circle. Toyota's success is evidence that it is also powerful in conventional companies.

  17. Linear Accelerators

    SciTech Connect

    Sidorin, Anatoly

    2010-01-05

    In linear accelerators the particles are accelerated by either electrostatic fields or oscillating Radio Frequency (RF) fields. Accordingly the linear accelerators are divided in three large groups: electrostatic, induction and RF accelerators. Overview of the different types of accelerators is given. Stability of longitudinal and transverse motion in the RF linear accelerators is briefly discussed. The methods of beam focusing in linacs are described.

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

  19. Linear Colliders

    NASA Astrophysics Data System (ADS)

    Yamamoto, Akira; Yokoya, Kaoru

    2015-02-01

    An overview of linear collider programs is given. The history and technical challenges are described and the pioneering electron-positron linear collider, the SLC, is first introduced. For future energy frontier linear collider projects, the International Linear Collider (ILC) and the Compact Linear Collider (CLIC) are introduced and their technical features are discussed. The ILC is based on superconducting RF technology and the CLIC is based on two-beam acceleration technology. The ILC collaboration completed the Technical Design Report in 2013, and has come to the stage of "Design to Reality." The CLIC collaboration published the Conceptual Design Report in 2012, and the key technology demonstration is in progress. The prospects for further advanced acceleration technology are briefly discussed for possible long-term future linear colliders.

  20. Linear Colliders

    NASA Astrophysics Data System (ADS)

    Yamamoto, Akira; Yokoya, Kaoru

    An overview of linear collider programs is given. The history and technical challenges are described and the pioneering electron-positron linear collider, the SLC, is first introduced. For future energy frontier linear collider projects, the International Linear Collider (ILC) and the Compact Linear Collider (CLIC) are introduced and their technical features are discussed. The ILC is based on superconducting RF technology and the CLIC is based on two-beam acceleration technology. The ILC collaboration completed the Technical Design Report in 2013, and has come to the stage of "Design to Reality." The CLIC collaboration published the Conceptual Design Report in 2012, and the key technology demonstration is in progress. The prospects for further advanced acceleration technology are briefly discussed for possible long-term future linear colliders.

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

  2. Linear Collisions

    ERIC Educational Resources Information Center

    Walkiewicz, T. A.; Newby, N. D., Jr.

    1972-01-01

    A discussion of linear collisions between two or three objects is related to a junior-level course in analytical mechanics. The theoretical discussion uses a geometrical approach that treats elastic and inelastic collisions from a unified point of view. Experiments with a linear air track are described. (Author/TS)

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

    PubMed

    Yilmaz, Ozgur

    2015-12-01

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

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

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

    NASA Astrophysics Data System (ADS)

    Baetens, Jan M.; Gravner, Janko

    2016-10-01

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

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

    NASA Astrophysics Data System (ADS)

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

    2010-03-01

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

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

    PubMed

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

    2014-09-20

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

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

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

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

    NASA Astrophysics Data System (ADS)

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

    2016-04-01

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

  11. LINEAR ACCELERATOR

    DOEpatents

    Christofilos, N.C.; Polk, I.J.

    1959-02-17

    Improvements in linear particle accelerators are described. A drift tube system for a linear ion accelerator reduces gap capacity between adjacent drift tube ends. This is accomplished by reducing the ratio of the diameter of the drift tube to the diameter of the resonant cavity. Concentration of magnetic field intensity at the longitudinal midpoint of the external sunface of each drift tube is reduced by increasing the external drift tube diameter at the longitudinal center region.

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

    NASA Astrophysics Data System (ADS)

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

    2012-12-01

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

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

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

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

  16. 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. PMID:27087101

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

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

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

    SciTech Connect

    Tsukerblat, Boris E-mail: andrew.palii@uv.es; Palii, Andrew E-mail: andrew.palii@uv.es; 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

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

    NASA Astrophysics Data System (ADS)

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

    2015-10-01

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

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

  1. Classical nucleation theory with a radius-dependent surface tension: a two-dimensional lattice-gas automata model.

    PubMed

    Hickey, Joseph; L'Heureux, Ivan

    2013-02-01

    The constant surface tension assumption of the Classical Nucleation Theory (CNT) is known to be flawed. In order to probe beyond this limitation, we consider a microscopic, two-dimensional Lattice-Gas Automata (LGA) model of nucleation in a supersaturated system, with model input parameters E(ss) (solid particle-to-solid particle bonding energy), E(sw) (solid particle-to-water bonding energy), η (next-to-nearest-neighbor bonding coefficient in solid phase), and C(in) (initial solute concentration). The LGA method has the advantages of easy implementation, low memory requirements, and fast computation speed. Analytical results for the system's concentration and the crystal radius as functions of time are derived and the former is fit to the simulation data in order to determine the equilibrium concentration. The "Mean First-Passage Time" technique is used to obtain the nucleation rate and critical nucleus size from the simulation data. The nucleation rate and supersaturation data are evaluated using a modification to the CNT that incorporates a two-dimensional radius-dependent surface tension term. The Tolman parameter, δ, which controls the radius dependence of the surface tension, decreases (increases) as a function of the magnitude of E(ss) (E(sw)), at fixed values of η and E(sw) (E(ss)). On the other hand, δ increases as η increases while E(ss) and E(sw) are held constant. The constant surface tension term of the CNT, Σ(0), increases (decreases) with increasing magnitudes of E(ss) (E(sw)) at fixed values of E(sw) (E(ss)) and increases as η is increased. Σ(0) increases linearly as a function of the change in energy during an attachment or detachment reaction, |ΔE|, however, with a slope less than that predicted for a crystal that is uniformly packed at maximum density. These results indicate an increase in the radius-dependent surface tension, Σ, with respect to increasing magnitude of the difference between E(ss) and E(sw).

  2. Hyper-heuristic Evolution of Dispatching Rules: A Comparison of Rule Representations.

    PubMed

    Branke, Jürgen; Hildebrandt, Torsten; Scholz-Reiter, Bernd

    2015-01-01

    Dispatching rules are frequently used for real-time, online scheduling in complex manufacturing systems. Design of such rules is usually done by experts in a time consuming trial-and-error process. Recently, evolutionary algorithms have been proposed to automate the design process. There are several possibilities to represent rules for this hyper-heuristic search. Because the representation determines the search neighborhood and the complexity of the rules that can be evolved, a suitable choice of representation is key for a successful evolutionary algorithm. In this paper we empirically compare three different representations, both numeric and symbolic, for automated rule design: A linear combination of attributes, a representation based on artificial neural networks, and a tree representation. Using appropriate evolutionary algorithms (CMA-ES for the neural network and linear representations, genetic programming for the tree representation), we empirically investigate the suitability of each representation in a dynamic stochastic job shop scenario. We also examine the robustness of the evolved dispatching rules against variations in the underlying job shop scenario, and visualize what the rules do, in order to get an intuitive understanding of their inner workings. Results indicate that the tree representation using an improved version of genetic programming gives the best results if many candidate rules can be evaluated, closely followed by the neural network representation that already leads to good results for small to moderate computational budgets. The linear representation is found to be competitive only for extremely small computational budgets.

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

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

    PubMed

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

    2014-09-20

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

  5. Occupants’ behavior of going with the crowd based on cellular automata occupant evacuation model

    NASA Astrophysics Data System (ADS)

    Zhao, Daoliang; Yang, Lizhong; Li, Jian

    2008-06-01

    Occupant behavior which is very complex affects evacuation efficiency and route choice a lot. The psychology and behavior of going with the crowd is very common in daily life and also in occupant evacuation. In this paper, a two-dimensional Cellular Automata model is applied to simulate the process of evacuation considering the psychology of going with the crowd with different room structure or occupant density. The psychology of going with the crowd (the abbreviation is GWC) is classified into directional GWC ( DGWC) and spatial GWC ( SGWC). The influence of two such kinds of psychology on occupant evacuation is discussed in order to provide some useful guidance on the emergency management of evacuation.

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

    NASA Astrophysics Data System (ADS)

    Xu, Yan; Cao, Cheng-Xun; Li, Ming-Hua; Luo, Jin-Long

    2012-12-01

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

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

    NASA Astrophysics Data System (ADS)

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

    2014-10-01

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

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

    PubMed Central

    Sen, Bibhash; Sikdar, Biplab K.

    2013-01-01

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

  9. Learning to construct pushdown automata for accepting deterministic context-free languages

    NASA Astrophysics Data System (ADS)

    Sen, Sandip; Janakiraman, Janani

    1992-03-01

    Genetic algorithms (GAs) are a class of probabilistic optimization algorithms which utilize ideas from natural genetics. In this paper, we apply the genetic algorithm to a difficult machine learning problem, viz., to learn the description of pushdown automata (PDA) to accept a context-free language (CFL), given legal and illegal sentences of the language. Previous work has involved the use of GAs in learning descriptions for finite state machines for accepting regular languages. CFLs are known to properly include regular languages, and hence, the learning problem addressed here is of a greater complexity. The ability to accept context free languages can be applied to a number of practical problems like text processing, speech recognition, etc.

  10. Conflict game in evacuation process: A study combining Cellular Automata model

    NASA Astrophysics Data System (ADS)

    Zheng, Xiaoping; Cheng, Yuan

    2011-03-01

    The game-theoretic approach is an essential tool in the research of conflicts of human behaviors. The aim of this study is to research crowd dynamic conflicts during evacuation processes. By combining a conflict game with a Cellular Automata model, the following factors such as rationality, herding effect and conflict cost are taken into the research on frequency of each strategy of evacuees, and evacuation time. Results from Monte Carlo simulations show that (i) in an emergency condition, rationality leads to “vying” behaviors and inhibited “polite” behavior; (ii) high herding causes a crowd of high rationality (especially in normal circumstances) to become more “vying” in behavior; (iii) the high-rationality crowd is shown to spend more evacuation time than a low-rationality crowd in emergency situations. This study provides a new perspective to understand conflicts in evacuation processes as well as the rationality of evacuees.

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

    NASA Astrophysics Data System (ADS)

    McNally, Douglas M.; Clemens, James P.

    2016-09-01

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

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

    PubMed Central

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

    2016-01-01

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

  13. Scale-invariant cellular automata and self-similar Petri nets

    NASA Astrophysics Data System (ADS)

    Schaller, M.; Svozil, K.

    2009-05-01

    Two novel computing models based on an infinite tessellation of space-time are introduced. They consist of recursively coupled primitive building blocks. The first model is a scale-invariant generalization of cellular automata, whereas the second one utilizes self-similar Petri nets. Both models are capable of hypercomputations and can, for instance, “solve” the halting problem for Turing machines. These two models are closely related, as they exhibit a step-by-step equivalence for finite computations. On the other hand, they differ greatly for computations that involve an infinite number of building blocks: the first one shows indeterministic behavior, whereas the second one halts. Both models are capable of challenging our understanding of computability, causality, and space-time.

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

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

    NASA Astrophysics Data System (ADS)

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

    2011-11-01

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

  16. Simulation of wastewater treatment by aerobic granules in a sequencing batch reactor based on cellular automata.

    PubMed

    Benzhai, Hai; Lei, Liu; Ge, Qin; Yuwan, Peng; Ping, Li; Qingxiang, Yang; Hailei, Wang

    2014-10-01

    In the present paper, aerobic granules were developed in a sequencing batch reactor (SBR) using synthetic wastewater, and 81 % of granular rate was obtained after 15-day cultivation. Aerobic granules have a 96 % BOD removal to the wastewater, and the reactor harbors a mount of biomass including bacteria, fungi and protozoa. In view of the complexity of kinetic behaviors of sludge and biological mechanisms of the granular SBR, a cellular automata model was established to simulate the process of wastewater treatment. The results indicate that the model not only visualized the complex adsorption and degradation process of aerobic granules, but also well described the BOD removal of wastewater and microbial growth in the reactor. Thus, CA model is suitable for simulation of synthetic wastewater treatment. This is the first report about dynamical and visual simulation of treatment process of synthetic wastewater in a granular SBR.

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

  18. Consequences of landscape fragmentation on Lyme disease risk: a cellular automata approach.

    PubMed

    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

  19. LL Leftmost k-Linear Scattered Context Grammars

    NASA Astrophysics Data System (ADS)

    Meduna, Alexander; Vrábel, Lukáš; Zemek, Petr

    2011-09-01

    The present paper introduces a new variant of a scattered context grammar, called an LL leftmost k-linear scattered context grammar. It is an ordinary scattered context grammar without erasing rules, where (1) every scattered context rule is composed of k-linear rules, (2) if we take the first components of every rule, the resulting context-free grammar is an LL grammar, and (3) every rule is applied in a leftmost way. We study the generative power of this variant and its parsing properties, including time and space complexity. In the conclusion, several remarks regarding the achieved results are made.

  20. Discovering Sentinel Rules for Business Intelligence

    NASA Astrophysics Data System (ADS)

    Middelfart, Morten; Pedersen, Torben Bach

    This paper proposes the concept of sentinel rules for multi-dimensional data that warns users when measure data concerning the external environment changes. For instance, a surge in negative blogging about a company could trigger a sentinel rule warning that revenue will decrease within two months, so a new course of action can be taken. Hereby, we expand the window of opportunity for organizations and facilitate successful navigation even though the world behaves chaotically. Since sentinel rules are at the schema level as opposed to the data level, and operate on data changes as opposed to absolute data values, we are able to discover strong and useful sentinel rules that would otherwise be hidden when using sequential pattern mining or correlation techniques. We present a method for sentinel rule discovery and an implementation of this method that scales linearly on large data volumes.

  1. Learning and Tuning of Fuzzy Rules

    NASA Technical Reports Server (NTRS)

    Berenji, Hamid R.

    1997-01-01

    In this chapter, we review some of the current techniques for learning and tuning fuzzy rules. For clarity, we refer to the process of generating rules from data as the learning problem and distinguish it from tuning an already existing set of fuzzy rules. For learning, we touch on unsupervised learning techniques such as fuzzy c-means, fuzzy decision tree systems, fuzzy genetic algorithms, and linear fuzzy rules generation methods. For tuning, we discuss Jang's ANFIS architecture, Berenji-Khedkar's GARIC architecture and its extensions in GARIC-Q. We show that the hybrid techniques capable of learning and tuning fuzzy rules, such as CART-ANFIS, RNN-FLCS, and GARIC-RB, are desirable in development of a number of future intelligent systems.

  2. LINEAR ACCELERATOR

    DOEpatents

    Colgate, S.A.

    1958-05-27

    An improvement is presented in linear accelerators for charged particles with respect to the stable focusing of the particle beam. The improvement consists of providing a radial electric field transverse to the accelerating electric fields and angularly introducing the beam of particles in the field. The results of the foregoing is to achieve a beam which spirals about the axis of the acceleration path. The combination of the electric fields and angular motion of the particles cooperate to provide a stable and focused particle beam.

  3. Linear Clouds

    NASA Technical Reports Server (NTRS)

    2006-01-01

    [figure removed for brevity, see original site] Context image for PIA03667 Linear Clouds

    These clouds are located near the edge of the south polar region. The cloud tops are the puffy white features in the bottom half of the image.

    Image information: VIS instrument. Latitude -80.1N, Longitude 52.1E. 17 meter/pixel resolution.

    Note: this THEMIS visual image has not been radiometrically nor geometrically calibrated for this preliminary release. An empirical correction has been performed to remove instrumental effects. A linear shift has been applied in the cross-track and down-track direction to approximate spacecraft and planetary motion. Fully calibrated and geometrically projected images will be released through the Planetary Data System in accordance with Project policies at a later time.

    NASA's Jet Propulsion Laboratory manages the 2001 Mars Odyssey mission for NASA's Office of Space Science, Washington, D.C. The Thermal Emission Imaging System (THEMIS) was developed by Arizona State University, Tempe, in collaboration with Raytheon Santa Barbara Remote Sensing. The THEMIS investigation is led by Dr. Philip Christensen at Arizona State University. Lockheed Martin Astronautics, Denver, is the prime contractor for the Odyssey project, and developed and built the orbiter. Mission operations are conducted jointly from Lockheed Martin and from JPL, a division of the California Institute of Technology in Pasadena.

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

  5. Optimal piecewise locally linear modeling

    NASA Astrophysics Data System (ADS)

    Harris, Chris J.; Hong, Xia; Feng, M.

    1999-03-01

    Associative memory networks such as Radial Basis Functions, Neurofuzzy and Fuzzy Logic used for modelling nonlinear processes suffer from the curse of dimensionality (COD), in that as the input dimension increases the parameterization, computation cost, training data requirements, etc. increase exponentially. Here a new algorithm is introduced for the construction of a Delaunay input space partitioned optimal piecewise locally linear models to overcome the COD as well as generate locally linear models directly amenable to linear control and estimation algorithms. The training of the model is configured as a new mixture of experts network with a new fast decision rule derived using convex set theory. A very fast simulated reannealing (VFSR) algorithm is utilized to search a global optimal solution of the Delaunay input space partition. A benchmark non-linear time series is used to demonstrate the new approach.

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

    DOE PAGESBeta

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

    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.

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

    NASA Astrophysics Data System (ADS)

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

    2016-10-01

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

  8. A Customizable Quantum-Dot Cellular Automata Building Block for the Synthesis of Classical and Reversible Circuits.

    PubMed

    Moustafa, Ahmed; Younes, Ahmed; Hassan, Yasser F

    2015-01-01

    Quantum-dot cellular automata (QCA) are nanoscale digital logic constructs that use electrons in arrays of quantum dots to carry out binary operations. In this paper, a basic building block for QCA will be proposed. The proposed basic building block can be customized to implement classical gates, such as XOR and XNOR gates, and reversible gates, such as CNOT and Toffoli gates, with less cell count and/or better latency than other proposed designs. PMID:26345412

  9. Phonological reduplication in sign language: Rules rule.

    PubMed

    Berent, Iris; Dupuis, Amanda; Brentari, Diane

    2014-01-01

    Productivity-the hallmark of linguistic competence-is typically attributed to algebraic rules that support broad generalizations. Past research on spoken language has documented such generalizations in both adults and infants. But whether algebraic rules form part of the linguistic competence of signers remains unknown. To address this question, here we gauge the generalization afforded by American Sign Language (ASL). As a case study, we examine reduplication (X→XX)-a rule that, inter alia, generates ASL nouns from verbs. If signers encode this rule, then they should freely extend it to novel syllables, including ones with features that are unattested in ASL. And since reduplicated disyllables are preferred in ASL, such a rule should favor novel reduplicated signs. Novel reduplicated signs should thus be preferred to nonreduplicative controls (in rating), and consequently, such stimuli should also be harder to classify as nonsigns (in the lexical decision task). The results of four experiments support this prediction. These findings suggest that the phonological knowledge of signers includes powerful algebraic rules. The convergence between these conclusions and previous evidence for phonological rules in spoken language suggests that the architecture of the phonological mind is partly amodal.

  10. Phonological reduplication in sign language: Rules rule

    PubMed Central

    Berent, Iris; Dupuis, Amanda; Brentari, Diane

    2014-01-01

    Productivity—the hallmark of linguistic competence—is typically attributed to algebraic rules that support broad generalizations. Past research on spoken language has documented such generalizations in both adults and infants. But whether algebraic rules form part of the linguistic competence of signers remains unknown. To address this question, here we gauge the generalization afforded by American Sign Language (ASL). As a case study, we examine reduplication (X→XX)—a rule that, inter alia, generates ASL nouns from verbs. If signers encode this rule, then they should freely extend it to novel syllables, including ones with features that are unattested in ASL. And since reduplicated disyllables are preferred in ASL, such a rule should favor novel reduplicated signs. Novel reduplicated signs should thus be preferred to nonreduplicative controls (in rating), and consequently, such stimuli should also be harder to classify as nonsigns (in the lexical decision task). The results of four experiments support this prediction. These findings suggest that the phonological knowledge of signers includes powerful algebraic rules. The convergence between these conclusions and previous evidence for phonological rules in spoken language suggests that the architecture of the phonological mind is partly amodal. PMID:24959158

  11. A Better Budget Rule

    ERIC Educational Resources Information Center

    Dothan, Michael; Thompson, Fred

    2009-01-01

    Debt limits, interest coverage ratios, one-off balanced budget requirements, pay-as-you-go rules, and tax and expenditure limits are among the most important fiscal rules for constraining intertemporal transfers. There is considerable evidence that the least costly and most effective of such rules are those that focus directly on the rate of…

  12. Rules on determining hearing appearances. Final rule.

    PubMed

    2013-05-21

    This final rule is another step in our continual efforts to handle workloads more effectively and efficiently. We are publishing final rules for portions of the rules we proposed in October 2007 that relate to persons, other than the claimant or any other party to the hearing, appearing by telephone. We are also clarifying that the administrative law judge (ALJ) will allow the claimant or any other party to a hearing to appear by telephone under certain circumstances when the claimant or other party requests to make his or her appearance in that manner. We expect that these final rules will make the hearings process more efficient and help us continue to reduce the hearings backlog. In addition, we made some minor editorial changes to our regulations that do not have any effect on the rights of claimants or any other parties.

  13. Second sum rule for the hot plasma permittivity

    SciTech Connect

    Bobrov, V. B.; Mendeleyev, V. Ya.; Skovorod'ko, S. N.; Trigger, S. A.

    2011-02-15

    Based on linear response theory, Kramers-Kronig relations, and diagram techniques of perturbation theory, it is shown that the second sum rule is satisfied for hot plasma permittivity. An explicit analytical expression for the second sum rule in the limit of weak nonideality is derived.

  14. Testing cellular automata interpretation of quantum mechanics in carbon nanotubes and superconductivity

    NASA Astrophysics Data System (ADS)

    Dolce, Donatello; Perali, Andrea

    2015-07-01

    Cellular Automata (CA) are represented at an effective level as intrinsic periodic phenomena, classical in the essence, reproducing the complete coherence (perfect recurrences) associated to pure quantum behaviours in condensed matter systems. By means of this approach it is possible to obtain a consistent, novel derivation of SuperConductivity (SC) essential phenomenology and of the peculiar quantum behaviour of electrons in graphene physics and Carbon Nanotubes (CNs), in which electrons cyclic dynamics simulate CA. In this way we will derive, from classical arguments, the essential electronic properties of these — or similar — graphene systems, such as energy bands and density of states. Similarly, in the second part of the paper, we will derive the fundamental phenomenology of SC by means of fundamental quantum dynamics and geometrical considerations, directly derived from the CA evolution law, rather than on empirical microscopical characteristics of the materials as in the standard approaches. This allows for a novel heuristic interpretation of the related gauge symmetry breaking and of the occurrence of high temperature superconductivity by means of simple considerations on the competition of quantum recurrence and thermal noise.

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

    PubMed

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

    2013-01-01

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

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

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

    NASA Astrophysics Data System (ADS)

    Wang, Z. F.; Liu, Feng

    2011-10-01

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

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

  19. High Detailed Debris Flows Hazard Maps by a Cellular Automata Approach

    NASA Astrophysics Data System (ADS)

    Lupiano, V.; Lucà, F.; Robustelli, G.; Rongo, R.; D'Ambrosio, D.; Spataro, W.; Avolio, M. V.

    2012-04-01

    The individuation of areas that are more likely to be interested by new debris flows in regions that are particularly exposed to such kind of phenomena is of fundamental relevance for mitigating possible consequences, both in terms of loss of human lives and material properties. Here we show the adaption of a recent methodology, already successfully applied to lava flows, for defining flexible high-detailed and reliable hazard maps. The methodology relies on both an adequate knowledge of the study area, assessed by an accurate analysis of its past behavior, together with a reliable numerical model for simulating debris flows on present topographic data (the Cellular Automata model SCIDDICA, in the present case). Furthermore, High Performance Parallel Computing is employed for increasing computational efficiency, due to the great number of simulations of hypothetical events that are required for characterizing the susceptibility to flow invasion of the study area. The application of the presented methodology to the case of Gragnano (Italy) pointed out the goodness of the proposed approach, suggesting its appropriateness for land use planning and Civil Defense applications.

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

    NASA Astrophysics Data System (ADS)

    Egger, Jan; Nimsky, Christopher

    2016-03-01

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

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

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

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

    NASA Astrophysics Data System (ADS)

    Moradabadi, Behnaz; Meybodi, Mohammad Reza

    2016-10-01

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

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

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

  6. General-purpose optimization methods for parallelization of digital terrain analysis based on cellular automata

    NASA Astrophysics Data System (ADS)

    Cheng, Guo; Liu, Lu; Jing, Ning; Chen, Luo; Xiong, Wei

    2012-08-01

    Solving traditional spatial analysis problems benefits from high performance geo-computation powered by parallel computing. Digital Terrain Analysis (DTA) is a typical example of data and computationally intensive spatial analysis problems and can be improved by parallelization technologies. Previous work on this topic has mainly focused on applying optimization schemes for specific DTA case studies. The task addressed in this paper, in contrast, is to find optimization methods that are generally applicable to the parallelization of DTA. By modeling a complex DTA problem with Cellular Automata (CA), we developed a temporal model that can describe the time cost of the solution. Three methods for optimizing different components in the temporal model are proposed: (1) a parallel loading/writing method that can improve the IO efficiency; (2) a best cell division method that can minimize the communication time among processes; and (3) a communication evolution overlapping method that can reduce the total time of evolutions and communications. The feasibilities and practical efficiencies of the proposed methods have been verified by comparative experiments conducted on an elevation dataset from North America using the Slope of Aspect (SOA) as an example of a general DTA problem. The results showed that the parallel performance of the SOA can be improved by applying the proposed methods individually or in an integrated fashion.

  7. Modelling the shrub encroachment in a grassland with a Cellular Automata Model

    NASA Astrophysics Data System (ADS)

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

    2014-09-01

    Arid and semi-arid grasslands of southwestern North America have changed dramatically over the last 150 years as a result of shrub encroachment, i.e. the increase in density, cover and biomass of indigenous shrubby plants in grasslands. Numerous studies have documented the expansion of shrublands in the southwestern American grasslands; in particular shrub encroachment has occurred strongly in part of the northern Chihuahuan desert since 1860. This encroachment has been simulated using an ecohydrological Cellular Automata model, CATGraSS. It is a spatially distributed model driven by spatially explicit irradiance and runs on a fine-resolution gridded domain. Plant competition is modelled by keeping track of mortality and establishment of plants; both are calculated probabilistically based on soil moisture stress. For this study CATGraSS has been improved with a stochastic fire module and a grazing function. The model has been implemented in a small area in Sevilleta National Wildlife Refuge (SNWR), characterized by two vegetation types (grass savanna and creosote bush shrub), considering as encroachment causes the fire return period increase, the grazing increase, the seed dispersal caused by animals, the role of wind direction and plant type competition. The model is able to reproduce the encroachment that has occurred in SNWR, simulating an increase of the shrub from 2% in 1860 to the current shrub percentage, 42%, and highlighting among the most influential factors the reduced fire frequency and the increased grazing intensity.

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

    NASA Astrophysics Data System (ADS)

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

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

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

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

    NASA Astrophysics Data System (ADS)

    Xu, Xiaoming; Du, Ziqiang; Zhang, Hong

    2016-10-01

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

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

  12. 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. PMID:25980478

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

    PubMed

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

    2013-01-01

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

  14. Cellular automata-based modelling and simulation of biofilm structure on multi-core computers.

    PubMed

    Skoneczny, Szymon

    2015-01-01

    The article presents a mathematical model of biofilm growth for aerobic biodegradation of a toxic carbonaceous substrate. Modelling of biofilm growth has fundamental significance in numerous processes of biotechnology and mathematical modelling of bioreactors. The process following double-substrate kinetics with substrate inhibition proceeding in a biofilm has not been modelled so far by means of cellular automata. Each process in the model proposed, i.e. diffusion of substrates, uptake of substrates, growth and decay of microorganisms and biofilm detachment, is simulated in a discrete manner. It was shown that for flat biofilm of constant thickness, the results of the presented model agree with those of a continuous model. The primary outcome of the study was to propose a mathematical model of biofilm growth; however a considerable amount of focus was also placed on the development of efficient algorithms for its solution. Two parallel algorithms were created, differing in the way computations are distributed. Computer programs were created using OpenMP Application Programming Interface for C++ programming language. Simulations of biofilm growth were performed on three high-performance computers. Speed-up coefficients of computer programs were compared. Both algorithms enabled a significant reduction of computation time. It is important, inter alia, in modelling and simulation of bioreactor dynamics. PMID:26606102

  15. Cellular Automata Modeling of Decarburization of Metal Droplets in Basic Oxygen Steelmaking

    NASA Astrophysics Data System (ADS)

    Ankit; Kundu, T. K.

    2016-02-01

    In steelmaking, a supersonic jet is blown over the bath to refine the hot metal to produce steel. The refining process primarily consists of removal of impurities from the hot metal to a permissible level. The impact of oxygen jet on the surface of the hot metal bath results in ejection of droplets, which mix with slag and form emulsion. The formed emulsion plays an important role in refining reactions kinetics and understanding of this process is required todevelopimproved process control model for the steel industry. In this paper, cellular automata technique has been explored to simulate decarburization in emulsion caused by interfacial reactions between the metal droplets and slag. In the course of the work, a framework has also been developed to quantify the contribution of carbon monoxide, generated by decarburization, in bloating of metal droplets and formation of halo around the droplets. The model has incorporated diffusion and decarburization reaction based on probabilities to study the evolution of the system. Simulations with varying parameters have been performed and decarburization trends obtained are comparable with the experimentally determined data reported in literatures.

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

  17. Minimum energy dissipation in computing: Maxwell's demon in quantum-dot cellular automata

    NASA Astrophysics Data System (ADS)

    Timler, John; Lent, Craig S.

    2002-03-01

    Discussions of the minimum energy required to compute and to erase information frequently occur in a fairly abstract context. We explore the ideas of Landauer in a specific system of possible technological interest. We examine the minimum energy dissipation incurred during information erasure in the context of quantum-dot cellular automata (QCA). We calculate the amount of energy dissipated by a QCA cell undergoing the erasure of a single bit. Irreversible information loss and energy dissipation occur when the cell contains the only copy of the bit. This situation is contrasted with the case when a neighboring "demon" cell first measures the cell state and then enables erasure with far less dissipation.Data propagation in a QCA shift register can be viewed as a succession of such read and erase cycles. Although the energy dissipated in reversible "demon-assisted" erasure can be made arbitrarily small, the actual amount of energy dissipated increases rapidly as the switching speed is increased. [1] R. Landauer, Phys. Rev. Lett. 53, 1205 (1984).

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

    NASA Astrophysics Data System (ADS)

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

    1990-06-01

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

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

  20. Firing patterns in a random network cellular automata model of the brain

    NASA Astrophysics Data System (ADS)

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

    2015-10-01

    One of the main challenges in the simulation of even reduced areas of the brain is the presence of a large number of neurons and a large number of connections among them. Even from a theoretical point of view, the behaviour of dynamical models of complex networks with high connectivity is unknown, precisely because the cost of computation is still unaffordable and it will likely be in the near future. In this paper we discuss the simulation of a cellular automata network model of the brain including up to one million sites with a maximum average of three hundred connections per neuron. This level of connectivity was achieved thanks to a distributed computing environment based on the BOINC (Berkeley Open Infrastructure for Network Computing) platform. Moreover, in this work we consider the interplay among excitatory neurons (which induce the excitation of their neighbours) and inhibitory neurons (which prevent resting neurons from firing and induce firing neurons to pass to the refractory state). Our objective is to classify the normal (noisy but asymptotically constant patterns) and the abnormal (high oscillations with spindle-like behaviour) patterns of activity in the model brain and their stability and parameter ranges in order to determine the role of excitatory and inhibitory compensatory effects in healthy and diseased individuals.

  1. Modeling and predicting urban growth pattern of the Tokyo metropolitan area based on cellular automata

    NASA Astrophysics Data System (ADS)

    Zhao, Yaolong; Zhao, Junsan; Murayama, Yuji

    2008-10-01

    The period of high economic growth in Japan which began in the latter half of the 1950s led to a massive migration of population from rural regions to the Tokyo metropolitan area. This phenomenon brought about rapid urban growth and urban structure changes in this area. Purpose of this study is to establish a constrained CA (Cellular Automata) model with GIS (Geographical Information Systems) to simulate urban growth pattern in the Tokyo metropolitan area towards predicting urban form and landscape for the near future. Urban land-use is classified into multi-categories for interpreting the effect of interaction among land-use categories in the spatial process of urban growth. Driving factors of urban growth pattern, such as land condition, railway network, land-use zoning, random perturbation, and neighborhood interaction and so forth, are explored and integrated into this model. These driving factors are calibrated based on exploratory spatial data analysis (ESDA), spatial statistics, logistic regression, and "trial and error" approach. The simulation is assessed at both macro and micro classification levels in three ways: visual approach; fractal dimension; and spatial metrics. Results indicate that this model provides an effective prototype to simulate and predict urban growth pattern of the Tokyo metropolitan area.

  2. The Cellular Automata for modelling of spreading of lava flow on the earth surface

    NASA Astrophysics Data System (ADS)

    Jarna, A.

    2012-12-01

    Volcanic risk assessment is a very important scientific, political and economic issue in densely populated areas close to active volcanoes. Development of effective tools for early prediction of a potential volcanic hazard and management of crises are paramount. However, to this date volcanic hazard maps represent the most appropriate way to illustrate the geographical area that can potentially be affected by a volcanic event. Volcanic hazard maps are usually produced by mapping out old volcanic deposits, however dynamic lava flow simulation gaining popularity and can give crucial information to corroborate other methodologies. The methodology which is used here for the generation of volcanic hazard maps is based on numerical simulation of eruptive processes by the principle of Cellular Automata (CA). The python script is integrated into ArcToolbox in ArcMap (ESRI) and the user can select several input and output parameters which influence surface morphology, size and shape of the flow, flow thickness, flow velocity and length of lava flows. Once the input parameters are selected, the software computes and generates hazard maps on the fly. The results can be exported to Google Maps (.klm format) to visualize the results of the computation. For validation of the simulation code are used data from a real lava flow. Comparison of the simulation results with real lava flows mapped out from satellite images will be presented.

  3. The cellular automata for modelling of spreading of lava flow on the earth surface

    NASA Astrophysics Data System (ADS)

    Jarna, Alexandra; Cirbus, Juraj

    2013-04-01

    Volcanic risk assessment is a very important scientific, political and economic issue in densely populated areas close to active volcanoes. Development of effective tools for early prediction of a potential volcanic hazard and management of crises are paramount. However, to this date volcanic hazard maps represent the most appropriate way to illustrate the geographical area that can potentially be affected by a volcanic event. Volcanic hazard maps are usually produced by mapping out old volcanic deposits, however dynamic lava flow simulation gaining popularity and can give crucial information to corroborate other methodologies. The methodology which is used here for the generation of volcanic hazard maps is based on numerical simulation of eruptive processes by the principle of Cellular Automata (CA). The python script is integrated into ArcToolbox in ArcMap (ESRI) and the user can select several input and output parameters which influence surface morphology, size and shape of the flow, flow thickness, flow velocity and length of lava flows. Once the input parameters are selected, the software computes and generates hazard maps on the fly. The results can be exported to Google Maps (.klm format) to visualize the results of the computation. For validation of the simulation code are used data from a real lava flow.

  4. Cellular automata-based modelling and simulation of biofilm structure on multi-core computers.

    PubMed

    Skoneczny, Szymon

    2015-01-01

    The article presents a mathematical model of biofilm growth for aerobic biodegradation of a toxic carbonaceous substrate. Modelling of biofilm growth has fundamental significance in numerous processes of biotechnology and mathematical modelling of bioreactors. The process following double-substrate kinetics with substrate inhibition proceeding in a biofilm has not been modelled so far by means of cellular automata. Each process in the model proposed, i.e. diffusion of substrates, uptake of substrates, growth and decay of microorganisms and biofilm detachment, is simulated in a discrete manner. It was shown that for flat biofilm of constant thickness, the results of the presented model agree with those of a continuous model. The primary outcome of the study was to propose a mathematical model of biofilm growth; however a considerable amount of focus was also placed on the development of efficient algorithms for its solution. Two parallel algorithms were created, differing in the way computations are distributed. Computer programs were created using OpenMP Application Programming Interface for C++ programming language. Simulations of biofilm growth were performed on three high-performance computers. Speed-up coefficients of computer programs were compared. Both algorithms enabled a significant reduction of computation time. It is important, inter alia, in modelling and simulation of bioreactor dynamics.

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

  6. Phenomenological study of irregular cellular automata based on Lyapunov exponents and Jacobians

    NASA Astrophysics Data System (ADS)

    Baetens, Jan M.; De Baets, Bernard

    2010-09-01

    Originally, cellular automata (CA) have been defined upon regular tessellations of the n-dimensional Euclidean space, while CA on irregular tessellations have received only little attention from the scientific community, notwithstanding serious shortcomings are associated with the former manner of subdividing Rn. In this paper we present a profound phenomenological study of two-state, two-dimensional irregular CA from a dynamical systems viewpoint. We opted to exploit properly defined quantitative measures instead of resorting to qualitative methods for discriminating between behavioral classes. As such, we employ Lyapunov exponents, measuring the divergence rate of close trajectories in phase space, and Jacobians, formulated using Boolean derivatives and expressing the sensitivity of a cellular automaton to its inputs. Both are stated for two-state CA on irregular tessellations, enabling us to characterize these discrete dynamical systems, and advancing us to propose a classification scheme for this CA family. In addition, a relationship between these quantitative measures is established in extension of the insights already developed for the classical CA paradigm. Finally, we discuss the repercussions on the CA dynamics that arise when the geometric variability of the spatial entities is taken into account during the CA simulation.

  7. The forms of azeotropic rule for multidimensional diagrams of equilibrium distillation

    NASA Astrophysics Data System (ADS)

    Pisarenko, Yu. A.; Usol'tseva, O. O.; Cardona, C. A.; Gerard, O. T.

    2013-09-01

    Linear independent forms of the azeotropy rule applicable to diagrams of distillation (reaction distillation) and their fragments are established and presented as simple polyhedra of arbitrary dimensions.

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

    NASA Astrophysics Data System (ADS)

    Ohmori, Shousuke; Yamazaki, Yoshihiro

    2016-01-01

    Ultradiscrete equations are derived from a set of reaction-diffusion partial differential equations, and cellular automaton rules are obtained on the basis of the ultradiscrete equations. Some rules reproduce the dynamical properties of the original reaction-diffusion equations, namely, bistability and pulse annihilation. Furthermore, other rules bring about soliton-like preservation and periodic pulse generation with a pacemaker, which are not obtained from the original reaction-diffusion equations.

  9. Extending Linear Models to Non-Linear Contexts: An In-Depth Study about Two University Students' Mathematical Productions

    ERIC Educational Resources Information Center

    Esteley, Cristina; Villarreal, Monica; Alagia, Humberto

    2004-01-01

    This research report presents a study of the work of agronomy majors in which an extension of linear models to non-linear contexts can be observed. By linear models we mean the model y=a.x+b, some particular representations of direct proportionality and the diagram for the rule of three. Its presence and persistence in different types of problems…

  10. Strategy as simple rules.

    PubMed

    Eisenhardt, K M; Sull, D N

    2001-01-01

    The success of Yahoo!, eBay, Enron, and other companies that have become adept at morphing to meet the demands of changing markets can't be explained using traditional thinking about competitive strategy. These companies have succeeded by pursuing constantly evolving strategies in market spaces that were considered unattractive according to traditional measures. In this article--the third in an HBR series by Kathleen Eisenhardt and Donald Sull on strategy in the new economy--the authors ask, what are the sources of competitive advantage in high-velocity markets? The secret, they say, is strategy as simple rules. The companies know that the greatest opportunities for competitive advantage lie in market confusion, but they recognize the need for a few crucial strategic processes and a few simple rules. In traditional strategy, advantage comes from exploiting resources or stable market positions. In strategy as simple rules, advantage comes from successfully seizing fleeting opportunities. Key strategic processes, such as product innovation, partnering, or spinout creation, place the company where the flow of opportunities is greatest. Simple rules then provide the guidelines within which managers can pursue such opportunities. Simple rules, which grow out of experience, fall into five broad categories: how- to rules, boundary conditions, priority rules, timing rules, and exit rules. Companies with simple-rules strategies must follow the rules religiously and avoid the temptation to change them too frequently. A consistent strategy helps managers sort through opportunities and gain short-term advantage by exploiting the attractive ones. In stable markets, managers rely on complicated strategies built on detailed predictions of the future. But when business is complicated, strategy should be simple. PMID:11189455

  11. Rules, culture, and fitness.

    PubMed

    Baum, W M

    1995-01-01

    Behavior analysis risks intellectual isolation unless it integrates its explanations with evolutionary theory. Rule-governed behavior is an example of a topic that requires an evolutionary perspective for a full understanding. A rule may be defined as a verbal discriminative stimulus produced by the behavior of a speaker under the stimulus control of a long-term contingency between the behavior and fitness. As a discriminative stimulus, the rule strengthens listener behavior that is reinforced in the short run by socially mediated contingencies, but which also enters into the long-term contingency that enhances the listener's fitness. The long-term contingency constitutes the global context for the speaker's giving the rule. When a rule is said to be "internalized," the listener's behavior has switched from short- to long-term control. The fitness-enhancing consequences of long-term contingencies are health, resources, relationships, or reproduction. This view ties rules both to evolutionary theory and to culture. Stating a rule is a cultural practice. The practice strengthens, with short-term reinforcement, behavior that usually enhances fitness in the long run. The practice evolves because of its effect on fitness. The standard definition of a rule as a verbal statement that points to a contingency fails to distinguish between a rule and a bargain ("If you'll do X, then I'll do Y"), which signifies only a single short-term contingency that provides mutual reinforcement for speaker and listener. In contrast, the giving and following of a rule ("Dress warmly; it's cold outside") can be understood only by reference also to a contingency providing long-term enhancement of the listener's fitness or the fitness of the listener's genes. Such a perspective may change the way both behavior analysts and evolutionary biologists think about rule-governed behavior.

  12. Core Rules of Netiquette.

    ERIC Educational Resources Information Center

    Shea, Virginia

    1994-01-01

    Discusses rules of etiquette for communicating via computer networks, including conversing as politely as you would face-to-face; ethical behavior; becoming familiar with the domain that you are in; rules for discussion groups; quality of writing; sharing appropriate knowledge; and respecting individuals' privacy. (LRW)

  13. "Chaos Rules" Revisited

    ERIC Educational Resources Information Center

    Murphy, David

    2011-01-01

    About 20 years ago, while lost in the midst of his PhD research, the author mused over proposed titles for his thesis. He was pretty pleased with himself when he came up with "Chaos Rules" (the implied double meaning was deliberate), or more completely, "Chaos Rules: An Exploration of the Work of Instructional Designers in Distance Education." He…

  14. How Rules Shape Experience

    ERIC Educational Resources Information Center

    Emo, Kenneth

    2008-01-01

    Rules guide and constrain participants' actions as they participate in any educational activity. This ethnographically driven case study examines how organizational rules--the implicit and explicit regulations that constrain actions and interactions--influence children to use science in the experiential educational activity of raising 4-H market…

  15. Delayed rule following

    PubMed Central

    Schmitt, David R.

    2001-01-01

    Although the elements of a fully stated rule (discriminative stimulus [SD], some behavior, and a consequence) can occur nearly contemporaneously with the statement of the rule, there is often a delay between the rule statement and the SD. The effects of this delay on rule following have not been studied in behavior analysis, but they have been investigated in rule-like settings in the areas of prospective memory (remembering to do something in the future) and goal pursuit. Discriminative events for some behavior can be event based (a specific setting stimulus) or time based. The latter are more demanding with respect to intention following and show age-related deficits. Studies suggest that the specificity with which the components of a rule (termed intention) are stated has a substantial effect on intention following, with more detailed specifications increasing following. Reminders of an intention, too, are most effective when they refer specifically to both the behavior and its occasion. Covert review and written notes are two effective strategies for remembering everyday intentions, but people who use notes appear not to be able to switch quickly to covert review. By focusing on aspects of the setting and rule structure, research on prospective memory and goal pursuit expands the agenda for a more complete explanation of rule effects. PMID:22478363

  16. 5-Second Rule

    MedlinePlus

    ... 5-second rule" — that random saying about how food won't become contaminated with bacteria if you pick it up off the floor in 5 seconds or less. The 5-second rule has become such a part of our culture that scientists actually tested it. As you can ...

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

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

    NASA Astrophysics Data System (ADS)

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

    2014-05-01

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

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

    NASA Astrophysics Data System (ADS)

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

    2013-03-01

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

  20. Following the Rules.

    PubMed

    Katz, Anne

    2016-05-01

    I am getting better at following the rules as I grow older, although I still bristle at many of them. I was a typical rebellious teenager; no one understood me, David Bowie was my idol, and, one day, my generation was going to change the world. Now I really want people to understand me: David Bowie remains one of my favorite singers and, yes, my generation has changed the world, and not necessarily for the better. Growing up means that you have to make the rules, not just follow those set by others, and, at times, having rules makes a lot of sense.
. PMID:27105186

  1. Draft Wetlands Rule Released

    NASA Astrophysics Data System (ADS)

    Zielinski, Sarah

    2006-04-01

    The U.S. Environmental Protection Agency (EPA) and the U.S. Army Corps of Engineers released on 28 March a draft of a new rule to guide compensatory mitigation for when wetlands are unavoidably lost due to development. However, whether the rule is successful in preventing a net loss in wetlands will depend largely on its implementation, according to two wetlands scientists who evaluated the issue for the U.S. National Research Council (NRC) in 2001. Under the federal Clean Water Act, developers who seek to build on wetlands must compensate for any wetlands loss if they are unable to avoid or minimize the loss. Such compensation is covered under the newly proposed compensatory mitigation rule. Benjamin Grumbles, EPA assistant administrator for water, called the rule an ``innovative new standard that will accelerate the pace of wetlands conservation and restoration.''

  2. Drug Plan Coverage Rules

    MedlinePlus

    ... works with other insurance Find health & drug plans Drug plan coverage rules Note Call your Medicare drug ... shingles vaccine) when medically necessary to prevent illness. Drugs you get in hospital outpatient settings In most ...

  3. Linear inflation from quartic potential

    NASA Astrophysics Data System (ADS)

    Kannike, Kristjan; Racioppi, Antonio; Raidal, Martti

    2016-01-01

    We show that if the inflaton has a non-minimal coupling to gravity and the Planck scale is dynamically generated, the results of Coleman-Weinberg inflation are confined in between two attractor solutions: quadratic inflation, which is ruled out by the recent measurements, and linear inflation which, instead, is in the experimental allowed region. The minimal scenario has only one free parameter — the inflaton's non-minimal coupling to gravity — that determines all physical parameters such as the tensor-to-scalar ratio and the reheating temperature of the Universe. Should the more precise future measurements of inflationary parameters point towards linear inflation, further interest in scale-invariant scenarios would be motivated.

  4. (FIELD) SYMMETRIZATION SELECTION RULES

    SciTech Connect

    P. PAGE

    2000-08-01

    QCD and QED exhibit an infinite set of three-point Green's functions that contain only OZI rule violating contributions, and (for QCD) are subleading in the large N{sub c} expansion. We prove that the QCD amplitude for a neutral hybrid {l_brace}1,3,5. . .{r_brace}{+-} exotic current to create {eta}{pi}{sup 0} only comes from OZI rule violating contributions under certain conditions, and is subleading in N{sub c}.

  5. Pushing the rules: effects and aftereffects of deliberate rule violations.

    PubMed

    Wirth, Robert; Pfister, Roland; Foerster, Anna; Huestegge, Lynn; Kunde, Wilfried

    2016-09-01

    Most of our daily life is organized around rules and social norms. But what makes rules so special? And what if one were to break a rule intentionally? Can we simply free us from the present set of rules or do we automatically adhere to them? How do rule violations influence subsequent behavior? To investigate the effects and aftereffects of violating simple S-R rule, we conducted three experiments that investigated continuous finger-tracking responses on an iPad. Our experiments show that rule violations are distinct from rule-based actions in both response times and movement trajectories, they take longer to initiate and execute, and their movement trajectory is heavily contorted. Data not only show differences between the two types of response (rule-based vs. violation), but also yielded a characteristic pattern of aftereffects in case of rule violations: rule violations do not trigger adaptation effects that render further rule violations less difficult, but every rule violation poses repeated effort on the agent. The study represents a first step towards understanding the signature and underlying mechanisms of deliberate rule violations, they cannot be acted out by themselves, but require the activation of the original rule first. Consequently, they are best understood as reformulations of existing rules that are not accessible on their own, but need to be constantly derived from the original rule, with an add-on that might entail an active tendency to steer away from mental representations that reflect (socially) unwanted behavior.

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

    NASA Astrophysics Data System (ADS)

    Zhou, Lei; Brian, Schwartz

    2001-06-01

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

  7. The unified method rules

    SciTech Connect

    Juric, R.

    1996-12-31

    Any methodology for information systems development defines rules and conditions that are to be followed and satisfied when applying it to developing analysis and design models of a system. The newest attempt to achieve a successful systems development and establish standards in object oriented analysis and design technologies resulted in the unified method documentation set, version 0.8 being published in late 1995. In this paper I will analyse the first draft and present a set of rules that must be satisfied by the valid unified method. The rules are divided into different sections: (A) classes/objects and categories, (B) attributes and operations, (C) associations and inheritance, (D) message trace diagram/object message diagram/state diagram/use cases.

  8. Novice Rules for Projectile Motion.

    ERIC Educational Resources Information Center

    Maloney, David P.

    1988-01-01

    Investigates several aspects of undergraduate students' rules for projectile motion including general patterns; rules for questions about time, distance, solids and liquids; and changes in rules when asked to ignore air resistance. Reports approach differences by sex and high school physics experience, and that novice rules are situation…

  9. Badger's rule revisited

    NASA Astrophysics Data System (ADS)

    Cioslowski, Jerzy; Liu, Guanghua; Mosquera Castro, Ricardo A.

    2000-12-01

    Numerical experiments demonstrate that the accuracy of stretching force constants ke provided by Badger's rule is unlikely to be substantially improved either by modification of the functional dependence on the equilibrium bond length Re or the inclusion of bond parameters related to electron density. These results, based upon both the experimental and QCISD/6-311++G(3d2f, 3p2d) values of Re and ke, imply that most of the universal characteristics of the bond strength vs. bond length dependence are accounted for by Badger's rule, the more detailed features being unexplainable by first-order response properties such as electron density.

  10. Vet Centers. Final rule.

    PubMed

    2016-03-01

    The Department of Veterans Affairs (VA) adopts as final an interim final rule that amends its medical regulation that governs Vet Center services. The National Defense Authorization Act for Fiscal Year 2013 (the 2013 Act) requires Vet Centers to provide readjustment counseling services to broader groups of veterans, members of the Armed Forces, including a member of a reserve component of the Armed Forces, and family members of such veterans and members. This final rule adopts as final the regulatory criteria to conform to the 2013 Act, to include new and revised definitions. PMID:26934755

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

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

  13. 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. PMID:25705700

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

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

  16. 13 Rules That Expire

    ERIC Educational Resources Information Center

    Karp, Karen S.; Bush, Sarah B.; Dougherty, Barbara J.

    2014-01-01

    Overgeneralizing commonly accepted strategies, using imprecise vocabulary, and relying on tips and tricks that do not promote conceptual mathematical understanding can lead to misunderstanding later in students' math careers. In this article, the authors present thirteen pervasive mathematics rules that "expire." With the…

  17. An Airship Slide Rule

    NASA Technical Reports Server (NTRS)

    Weaver, E R; Pickering, S F

    1924-01-01

    This report prepared for the National Advisory Committee for Aeronautics, describes an airship slide rule developed by the Gas-Chemistry Section of the Bureau of Standards, at the request of the Bureau of Engineering of the Navy Department. It is intended primarily to give rapid solutions of a few problems of frequent occurrence in airship navigation, but it can be used to advantage in solving a great variety of problems, involving volumes, lifting powers, temperatures, pressures, altitudes and the purity of the balloon gas. The rule is graduated to read directly in the units actually used in making observations, constants and conversion factors being taken care of by the length and location of the scales. It is thought that with this rule practically any problem likely to arise in this class of work can be readily solved after the user has become familiar with the operation of the rule; and that the solution will, in most cases, be as accurate as the data warrant.

  18. Crispen's Five Antivirus Rules.

    ERIC Educational Resources Information Center

    Crispen, Patrick Douglas

    2000-01-01

    Explains five rules to protect computers from viruses. Highlights include commercial antivirus software programs and the need to upgrade them periodically (every year to 18 months); updating virus definitions at least weekly; scanning attached files from email with antivirus software before opening them; Microsoft Word macro protection; and the…

  19. Crispen's Five Antivirus Rules.

    ERIC Educational Resources Information Center

    Crispen, Patrick Douglas

    2000-01-01

    Provides rules for protecting computers from viruses, Trojan horses, or worms. Topics include purchasing commercial antivirus programs and keeping them updated; updating virus definitions weekly; precautions before opening attached files; macro virus protection in Microsoft Word; and precautions with executable files. (LRW)

  20. Willpower and Personal Rules.

    ERIC Educational Resources Information Center

    Benabou, Roland; Tirole, Jean

    2004-01-01

    We develop a theory of internal commitments or "personal rules" based on self-reputation over one's willpower, which transforms lapses into precedents that undermine future self-restraint. The foundation for this mechanism is the imperfect recall of past motives and feelings, leading people to draw inferences from their past actions. The degree of…

  1. Caregivers program. Final rule.

    PubMed

    2015-01-01

    The Department of Veterans Affairs (VA) adopts, with changes, the interim final rule concerning VA's Program of Comprehensive Assistance for Family Caregivers. VA administers this program to provide certain medical, travel, training, and financial benefits to caregivers of certain veterans and servicemembers who were seriously injured during service on or after September 11, 2001. Also addressed in this rulemaking is the Program of General Caregiver Support Services that provides support services to caregivers of veterans from all eras who are enrolled in the VA health care system. Specifically, changes in this final rule include a requirement that Veterans be notified in writing should a Family Caregiver request revocation (to no longer be a Family Caregiver), an extension of the application timeframe from 30 days to 45 days for a Family Caregiver, and a change in the stipend calculation to ensure that Primary Family Caregivers do not experience unexpected decreases in stipend amounts from year to year. PMID:25581943

  2. Disagreement Rules, Referral Rules and the Spanish Feminine Article "el."

    ERIC Educational Resources Information Center

    Harris, J. W.

    1987-01-01

    The Spanish feminine article /el/, ordinarily the singular masculine definite article, has been used as evidence of the need for obligatory disagreement rules. Others explain the anamoly by means of referral rules. A third solution is suggested: an allomorphy rule which can be interpreted syntactically or phonologically. (LMO)

  3. Parental Rule Socialization for Preventive Health and Adolescent Rule Compliance

    ERIC Educational Resources Information Center

    Bylund, Carma L.; Baxter, Leslie A.; Imes, Rebecca S.; Wolf, Bianca

    2010-01-01

    This study examined family rules about nutrition, exercise, and sun protection in 164 parent-young adult children dyads. Both parents and their young adult children independently reported on health rules that they perceived throughout their child's adolescent years and the extent to which the rules were articulated, violations sanctioned, and…

  4. Electrothermal linear actuator

    NASA Technical Reports Server (NTRS)

    Derr, L. J.; Tobias, R. A.

    1969-01-01

    Converting electric power into powerful linear thrust without generation of magnetic fields is accomplished with an electrothermal linear actuator. When treated by an energized filament, a stack of bimetallic washers expands and drives the end of the shaft upward.

  5. A linear programming manual

    NASA Technical Reports Server (NTRS)

    Tuey, R. C.

    1972-01-01

    Computer solutions of linear programming problems are outlined. Information covers vector spaces, convex sets, and matrix algebra elements for solving simultaneous linear equations. Dual problems, reduced cost analysis, ranges, and error analysis are illustrated.

  6. Linear elastic fracture mechanics primer

    NASA Technical Reports Server (NTRS)

    Wilson, Christopher D.

    1992-01-01

    This primer is intended to remove the blackbox perception of fracture mechanics computer software by structural engineers. The fundamental concepts of linear elastic fracture mechanics are presented with emphasis on the practical application of fracture mechanics to real problems. Numerous rules of thumb are provided. Recommended texts for additional reading, and a discussion of the significance of fracture mechanics in structural design are given. Griffith's criterion for crack extension, Irwin's elastic stress field near the crack tip, and the influence of small-scale plasticity are discussed. Common stress intensities factor solutions and methods for determining them are included. Fracture toughness and subcritical crack growth are discussed. The application of fracture mechanics to damage tolerance and fracture control is discussed. Several example problems and a practice set of problems are given.

  7. Diagnosis supporting rules of the Hepar system.

    PubMed

    Bobrowski, L; Wasyluk, H

    2001-01-01

    The "Hepar" system comprises a clinical database and the shell of procedures that aim at data analysis and the support of diagnosis. The database consists of hepatological patient cases. Each case is described by about 200 medical findings and histopathologically verified diagnosis. The diagnosis supporting rules of "Hepar" are based on visualizing data transformations and on the similarity based techniques. The applied linear visualizing transformations of data sets on the plane aim at separating of the groups of patients associated with different diseases. The resulting diagnostic maps by the visual inspection allow to find such cases in the database that are similar to the previously diagnosed patients. This paper examines combining of data transformations with the nearest neighbors techniques in the support of diagnosis. We report the results on the experimental comparisons of different decision rules including the feature selection procedure.

  8. Linear-Algebra Programs

    NASA Technical Reports Server (NTRS)

    Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.

    1982-01-01

    The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.

  9. Modifications of Team Sports Rules.

    ERIC Educational Resources Information Center

    Rokosz, Francis M.

    In general, there are two reasons for modifying the rules in sport activities: (1) to meet a specific objective or (2) to solve a perceived problem. The sense of the original game is usually not altered significantly because the number of rule changes is kept to a minimum. Changes in rules may be made for administrative or financial reasons, or to…

  10. Optimal Hedging Rule for Reservoir Refill Operation

    NASA Astrophysics Data System (ADS)

    Wan, W.; Zhao, J.; Lund, J. R.; Zhao, T.; Lei, X.; Wang, H.

    2015-12-01

    This paper develops an optimal reservoir Refill Hedging Rule (RHR) for combined water supply and flood operation using mathematical analysis. A two-stage model is developed to formulate the trade-off between operations for conservation benefit and flood damage in the reservoir refill season. Based on the probability distribution of the maximum refill water availability at the end of the second stage, three zones are characterized according to the relationship among storage capacity, expected storage buffer (ESB), and maximum safety excess discharge (MSED). The Karush-Kuhn-Tucker conditions of the model show that the optimality of the refill operation involves making the expected marginal loss of conservation benefit from unfilling (i.e., ending storage of refill period less than storage capacity) as nearly equal to the expected marginal flood damage from levee overtopping downstream as possible while maintaining all constraints. This principle follows and combines the hedging rules for water supply and flood management. A RHR curve is drawn analogously to water supply hedging and flood hedging rules, showing the trade-off between the two objectives. The release decision result has a linear relationship with the current water availability, implying the linearity of RHR for a wide range of water conservation functions (linear, concave, or convex). A demonstration case shows the impacts of factors. Larger downstream flood conveyance capacity and empty reservoir capacity allow a smaller current release and more water can be conserved. Economic indicators of conservation benefit and flood damage compete with each other on release, the greater economic importance of flood damage is, the more water should be released in the current stage, and vice versa. Below a critical value, improving forecasts yields less water release, but an opposing effect occurs beyond this critical value. Finally, the Danjiangkou Reservoir case study shows that the RHR together with a rolling

  11. Physics of the Lindemann melting rule

    SciTech Connect

    Lawson, Andrew C

    2008-01-01

    We investigate the thermodynamics of melting for 74 distinct chemical elements including several actinides and rare earths. We find that the observed melting points are consistent with a linear relationship between the correlation entropy of the liquid and the Grueneisen constant of the solid, and that the Lindemann rule is well obeyed for the elements with simple structures and less well obeyed for the less symmetric more open structures. No special assumptions are required to explain the melting points of the rare earths or light actinides.

  12. Rules for Optical Metrology

    NASA Technical Reports Server (NTRS)

    Stahl, H. Philip

    2014-01-01

    Based on 30 years of optical testing experience, a lot of mistakes, a lot of learning and a lot of experience, I have defined seven guiding principles for optical testing - regardless of how small or how large the optical testing or metrology task. GUIDING PRINCIPLES 1. Fully Understand the Task 2. Develop an Error Budget 3. Continuous Metrology Coverage 4. Know where you are 5. 'Test like you fly' 6. Independent Cross-Checks 7. Understand All Anomalies. These rules have been applied with great success to the in-process optical testing and final specification compliance testing of the JWST mirrors.

  13. Rules for Optical Testing

    NASA Technical Reports Server (NTRS)

    Stahl, H. Philip

    2014-01-01

    Based on 30 years of optical testing experience, a lot of mistakes, a lot of learning and a lot of experience, I have defined seven guiding principles for optical testing - regardless of how small or how large the optical testing or metrology task: Fully Understand the Task, Develop an Error Budget, Continuous Metrology Coverage, Know where you are, Test like you fly, Independent Cross-Checks, Understand All Anomalies. These rules have been applied with great success to the inprocess optical testing and final specification compliance testing of the JWST mirrors.

  14. Rules for Optical Metrology

    NASA Technical Reports Server (NTRS)

    Stahl, H. Philip

    2014-01-01

    Based on 30 years of optical testing experience, a lot of mistakes, a lot of learning and a lot of experience, I have defined seven guiding principles for optical testing - regardless of how small or how large the optical testing or metrology task. GUIDING PRINCIPLES 1.Fully Understand the Task 2.Develop an Error Budget 3.Continuous Metrology Coverage 4.Know where you are 5. 'Test like you fly' 6.Independent Cross-Checks 7.Understand All Anomalies. These rules have been applied with great success to the in-process optical testing and final specification compliance testing of the JWST mirrors.

  15. Linear collider: a preview

    SciTech Connect

    Wiedemann, H.

    1981-11-01

    Since no linear colliders have been built yet it is difficult to know at what energy the linear cost scaling of linear colliders drops below the quadratic scaling of storage rings. There is, however, no doubt that a linear collider facility for a center of mass energy above say 500 GeV is significantly cheaper than an equivalent storage ring. In order to make the linear collider principle feasible at very high energies a number of problems have to be solved. There are two kinds of problems: one which is related to the feasibility of the principle and the other kind of problems is associated with minimizing the cost of constructing and operating such a facility. This lecture series describes the problems and possible solutions. Since the real test of a principle requires the construction of a prototype I will in the last chapter describe the SLC project at the Stanford Linear Accelerator Center.

  16. Linear mass actuator

    NASA Technical Reports Server (NTRS)

    Holloway, Sidney E., III (Inventor); Crossley, Edward A., Jr. (Inventor); Jones, Irby W. (Inventor); Miller, James B. (Inventor); Davis, C. Calvin (Inventor); Behun, Vaughn D. (Inventor); Goodrich, Lewis R., Sr. (Inventor)

    1992-01-01

    A linear mass actuator includes an upper housing and a lower housing connectable to each other and having a central passageway passing axially through a mass that is linearly movable in the central passageway. Rollers mounted in the upper and lower housings in frictional engagement with the mass translate the mass linearly in the central passageway and drive motors operatively coupled to the roller means, for rotating the rollers and driving the mass axially in the central passageway.

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

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

  19. Linear phase compressive filter

    DOEpatents

    McEwan, Thomas E.

    1995-01-01

    A phase linear filter for soliton suppression is in the form of a laddered series of stages of non-commensurate low pass filters with each low pass filter having a series coupled inductance (L) and a reverse biased, voltage dependent varactor diode, to ground which acts as a variable capacitance (C). L and C values are set to levels which correspond to a linear or conventional phase linear filter. Inductance is mapped directly from that of an equivalent nonlinear transmission line and capacitance is mapped from the linear case using a large signal equivalent of a nonlinear transmission line.

  20. Linear phase compressive filter

    DOEpatents

    McEwan, T.E.

    1995-06-06

    A phase linear filter for soliton suppression is in the form of a laddered series of stages of non-commensurate low pass filters with each low pass filter having a series coupled inductance (L) and a reverse biased, voltage dependent varactor diode, to ground which acts as a variable capacitance (C). L and C values are set to levels which correspond to a linear or conventional phase linear filter. Inductance is mapped directly from that of an equivalent nonlinear transmission line and capacitance is mapped from the linear case using a large signal equivalent of a nonlinear transmission line. 2 figs.

  1. Fault tolerant linear actuator

    DOEpatents

    Tesar, Delbert

    2004-09-14

    In varying embodiments, the fault tolerant linear actuator of the present invention is a new and improved linear actuator with fault tolerance and positional control that may incorporate velocity summing, force summing, or a combination of the two. In one embodiment, the invention offers a velocity summing arrangement with a differential gear between two prime movers driving a cage, which then drives a linear spindle screw transmission. Other embodiments feature two prime movers driving separate linear spindle screw transmissions, one internal and one external, in a totally concentric and compact integrated module.

  2. The Product and Quotient Rules Revisited

    ERIC Educational Resources Information Center

    Eggleton, Roger; Kustov, Vladimir

    2011-01-01

    Mathematical elegance is illustrated by strikingly parallel versions of the product and quotient rules of basic calculus, with some applications. Corresponding rules for second derivatives are given: the product rule is familiar, but the quotient rule is less so.

  3. 9 CFR 11.3 - Scar rule.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... WELFARE HORSE PROTECTION REGULATIONS § 11.3 Scar rule. The scar rule applies to all horses born on or after October 1, 1975. Horses subject to this rule that do not meet the following scar rule...

  4. The biosphere rules.

    PubMed

    Unruh, Gregory C

    2008-02-01

    Sustainability, defined by natural scientists as the capacity of healthy ecosystems to function indefinitely, has become a clarion call for business. Leading companies have taken high-profile steps toward achieving it: Wal-Mart, for example, with its efforts to reduce packaging waste, and Nike, which has removed toxic chemicals from its shoes. But, says Unruh, the director of Thunderbird's Lincoln Center for Ethics in Global Management, sustainability is more than an endless journey of incremental steps. It is a destination, for which the biosphere of planet Earth--refined through billions of years of trial and error--is a perfect model. Unruh distills some lessons from the biosphere into three rules: Use a parsimonious palette. Managers can rethink their sourcing strategies and dramatically simplify the number and types of materials their companies use in production, making recycling cost-effective. After the furniture manufacturer Herman Miller discovered that its leading desk chair had 200 components made from more than 800 chemical compounds, it designed an award-winning successor whose far more limited materials palette is 96% recyclable. Cycle up, virtuously. Manufacturers should design recovery value into their products at the outset. Shaw Industries, for example, recycles the nylon fiber from its worn-out carpet into brand-new carpet tile. Exploit the power of platforms. Platform design in industry tends to occur at the component level--but the materials in those components constitute a more fundamental platform. Patagonia, by recycling Capilene brand performance underwear, has achieved energy costs 76% below those for virgin sourcing. Biosphere rules can teach companies how to build ecologically friendly products that both reduce manufacturing costs and prove highly attractive to consumers. And managers need not wait for a green technological revolution to implement them.

  5. The biosphere rules.

    PubMed

    Unruh, Gregory C

    2008-02-01

    Sustainability, defined by natural scientists as the capacity of healthy ecosystems to function indefinitely, has become a clarion call for business. Leading companies have taken high-profile steps toward achieving it: Wal-Mart, for example, with its efforts to reduce packaging waste, and Nike, which has removed toxic chemicals from its shoes. But, says Unruh, the director of Thunderbird's Lincoln Center for Ethics in Global Management, sustainability is more than an endless journey of incremental steps. It is a destination, for which the biosphere of planet Earth--refined through billions of years of trial and error--is a perfect model. Unruh distills some lessons from the biosphere into three rules: Use a parsimonious palette. Managers can rethink their sourcing strategies and dramatically simplify the number and types of materials their companies use in production, making recycling cost-effective. After the furniture manufacturer Herman Miller discovered that its leading desk chair had 200 components made from more than 800 chemical compounds, it designed an award-winning successor whose far more limited materials palette is 96% recyclable. Cycle up, virtuously. Manufacturers should design recovery value into their products at the outset. Shaw Industries, for example, recycles the nylon fiber from its worn-out carpet into brand-new carpet tile. Exploit the power of platforms. Platform design in industry tends to occur at the component level--but the materials in those components constitute a more fundamental platform. Patagonia, by recycling Capilene brand performance underwear, has achieved energy costs 76% below those for virgin sourcing. Biosphere rules can teach companies how to build ecologically friendly products that both reduce manufacturing costs and prove highly attractive to consumers. And managers need not wait for a green technological revolution to implement them. PMID:18314639

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

    NASA Astrophysics Data System (ADS)

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

    2016-10-01

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

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

    PubMed Central

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

    2014-01-01

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

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

    NASA Astrophysics Data System (ADS)

    Feliciani, Claudio; Nishinari, Katsuhiro

    2016-06-01

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

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

    PubMed

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

    2014-01-01

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

  10. Signal transmission through molecular quantum-dot cellular automata: a theoretical study on Creutz-Taube complexes for molecular computing.

    PubMed

    Tokunaga, Ken

    2009-03-14

    Signal transmission through Creutz-Taube complexes [(NH(3))(5)Ru-BL-Ru(NH(3))(5)](5+)(BL = pyrazine (py), 4,4'-bipyridine (bpy)), which are simplified models of the molecular quantum-dot cellular automata (molecular QCA), is discussed both statically and dynamically with a view to designing useful molecular QCA. In the static treatment, the difference between stationary states before and after the switch of the input to the molecular QCA is discussed. In the dynamic treatment, time-evolution of electronic structure after the moment of the switch is simulated, and a simple method for the simulation is also proposed. Geometric and electronic structures are obtained by density functional theory (UB3LYP) and Hartree-Fock (UHF) calculations, and discussions are based on the Mulliken charge. It is found that signal amplitude (A) is strongly dependent on the position and charge of the input to the molecular QCA, but signal period (T) is almost independent of them. These results are explained from molecular orbitals and orbital energies, and a set of large A (large overlap between orbitals) and small T (large energy gap) generally leads to a prompt signal transmission.

  11. Exact modeling of finite temperature and quantum delocalization effects on reliability of quantum-dot cellular automata

    NASA Astrophysics Data System (ADS)

    Tiihonen, Juha; Schramm, Andreas; Kylänpää, Ilkka; Rantala, Tapio T.

    2016-02-01

    A thorough simulation study is carried out on thermal and quantum delocalization effects on the feasibility of a quantum-dot cellular automata (QCA) cell. The occupation correlation of two electrons is modeled with a simple four-site array of harmonic quantum dots (QD). QD sizes range from 20 nm to 40 nm with site separations from 20 nm to 100 nm, relevant for state-of-the-art GaAs/InAs semiconductor technology. The choice of parameters introduces QD overlap, which is only simulated properly with exact treatment of strong Coulombic correlation and thermal equilibrium quantum statistics. These are taken into account with path integral Monte Carlo approach. Thus, we demonstrate novel joint effects of quantum delocalization and decoherence in QCA, but also highly sophisticated quantitative evidence supporting the traditional relations in pragmatic QCA design. Moreover, we show the effects of dimensionality and spin state, and point out the parameter space conditions, where the ‘classical’ treatment becomes invalid.

  12. Study on rule-based adaptive fuzzy excitation control technology

    NASA Astrophysics Data System (ADS)

    Zhao, Hui; Wang, Hong-jun; Liu, Lu-yuan; Yue, You-jun

    2008-10-01

    Power system is a kind of typical non-linear system, it is hard to achieve excellent control performance with conventional PID controller under different operating conditions. Fuzzy parameter adaptive PID exciting controller is very efficient to overcome the influence of tiny disturbances, but the performance of the control system will be worsened when operating conditions of the system change greatly or larger disturbances occur. To solve this problem, this article presents a rule adaptive fuzzy control scheme for synchronous generator exciting system. In this scheme the control rule adaptation is implemented by regulating the value of parameter di under the given proportional divisors K1, K2 and K3 of fuzzy sets Ai and Bi. This rule adaptive mechanism is constituted by two groups of original rules about the self-generation and self-correction of the control rule. Using two groups of rules, the control rule activated by status 1 and 2 in figure 2 system can be regulated automatically and simultaneously at the time instant k. The results from both theoretical analysis and simulation show that the presented scheme is effective and feasible and possesses good performance.

  13. Aurora Borealis: stochastic cellular automata simulations of the excited-state dynamics of oxygen atoms.

    NASA Astrophysics Data System (ADS)

    Seybold, P. G.; Kier, L. B.; Cheng, C.-K.

    1999-12-01

    Emissions from the 1S and 1D excited states of atomic oxygen play a prominent role in creating the dramatic light displays (aurora borealis) seen in the skies over polar regions of the Northern Hemisphere. A probabilistic asynchronous cellular automaton model described previously has been applied to the excited-state dynamics of atomic oxygen. The model simulates the time-dependent variations in ground (3P) and excited-state populations that occur under user-defined probabilistic transition rules for both pulse and steady-state conditions. Although each trial simulation is itself an independent "experiment", deterministic values for the excited-state emission lifetimes and quantum yields emerge as limiting cases for large numbers of cells or large numbers of trials. Stochastic variations in the lifetimes and emission yields can be estimated from repeated trials.

  14. Linearly polarized fiber amplifier

    SciTech Connect

    Kliner, Dahv A.; Koplow, Jeffery P.

    2004-11-30

    Optically pumped rare-earth-doped polarizing fibers exhibit significantly higher gain for one linear polarization state than for the orthogonal state. Such a fiber can be used to construct a single-polarization fiber laser, amplifier, or amplified-spontaneous-emission (ASE) source without the need for additional optical components to obtain stable, linearly polarized operation.

  15. SLAC Linear Collider

    SciTech Connect

    Richter, B.

    1985-12-01

    A report is given on the goals and progress of the SLAC Linear Collider. The status of the machine and the detectors are discussed and an overview is given of the physics which can be done at this new facility. Some ideas on how (and why) large linear colliders of the future should be built are given.

  16. Linear force device

    NASA Technical Reports Server (NTRS)

    Clancy, John P.

    1988-01-01

    The object of the invention is to provide a mechanical force actuator which is lightweight and manipulatable and utilizes linear motion for push or pull forces while maintaining a constant overall length. The mechanical force producing mechanism comprises a linear actuator mechanism and a linear motion shaft mounted parallel to one another. The linear motion shaft is connected to a stationary or fixed housing and to a movable housing where the movable housing is mechanically actuated through actuator mechanism by either manual means or motor means. The housings are adapted to releasably receive a variety of jaw or pulling elements adapted for clamping or prying action. The stationary housing is adapted to be pivotally mounted to permit an angular position of the housing to allow the tool to adapt to skewed interfaces. The actuator mechanisms is operated by a gear train to obtain linear motion of the actuator mechanism.

  17. Linear models: permutation methods

    USGS Publications Warehouse

    Cade, B.S.; Everitt, B.S.; Howell, D.C.

    2005-01-01

    Permutation tests (see Permutation Based Inference) for the linear model have applications in behavioral studies when traditional parametric assumptions about the error term in a linear model are not tenable. Improved validity of Type I error rates can be achieved with properly constructed permutation tests. Perhaps more importantly, increased statistical power, improved robustness to effects of outliers, and detection of alternative distributional differences can be achieved by coupling permutation inference with alternative linear model estimators. For example, it is well-known that estimates of the mean in linear model are extremely sensitive to even a single outlying value of the dependent variable compared to estimates of the median [7, 19]. Traditionally, linear modeling focused on estimating changes in the center of distributions (means or medians). However, quantile regression allows distributional changes to be estimated in all or any selected part of a distribution or responses, providing a more complete statistical picture that has relevance to many biological questions [6]...

  18. The Clean Air Interstate Rule

    SciTech Connect

    Debra Jezouit; Frank Rambo

    2005-07-01

    On May 12, 2005, EPA promulgated the Clean Air Interstate Rule, which overhauls and expands the scope of air emissions trading programs in the eastern United States. The rule imposes statewide caps on emissions of nitrogen oxides and sulfur dioxide to be introduced in two phases, beginning in 2009. This article briefly explains the background leading up to the rule and summarizes its key findings and requirements. 2 refs., 1 fig., 1 tab.

  19. Empirically derived injury prevention rules.

    PubMed Central

    Peterson, L; Schick, B

    1993-01-01

    This study describes a set of empirically derived safety rules that if followed, would have prevented the occurrence of minor injuries. Epidemiologists have criticized behavioral interventions as increasing "safe" behavior but failing to demonstrate a decrease in injury. The present study documents retrospectively the link between safe behavior and injury. It demonstrates that these empirically derived rules are very similar to rules for the prevention of serious injury. The study also shows that these rules are not widely accepted and implemented by parents. Suggestions for future research in this area are advanced. PMID:8307829

  20. Fluctuations in classical sum rules.

    PubMed

    Elton, John R; Lakshminarayan, Arul; Tomsovic, Steven

    2010-10-01

    Classical sum rules arise in a wide variety of physical contexts. Asymptotic expressions have been derived for many of these sum rules in the limit of long orbital period (or large action). Although sum-rule convergence may well be exponentially rapid for chaotic systems in a global phase-space sense with time, individual contributions to the sums may fluctuate with a width which diverges in time. Our interest is in the global convergence of sum rules as well as their local fluctuations. It turns out that a simple version of a lazy baker map gives an ideal system in which classical sum rules, their corrections, and their fluctuations can be worked out analytically. This is worked out in detail for the Hannay-Ozorio sum rule. In this particular case the rate of convergence of the sum rule is found to be governed by the Pollicott-Ruelle resonances, and both local and global boundaries for which the sum rule may converge are given. In addition, the width of the fluctuations is considered and worked out analytically, and it is shown to have an interesting dependence on the location of the region over which the sum rule is applied. It is also found that as the region of application is decreased in size the fluctuations grow. This suggests a way of controlling the length scale of the fluctuations by considering a time dependent phase-space volume, which for the lazy baker map decreases exponentially rapidly with time.

  1. RuleEd, a web-based semantic network interface for constructing and revising computable eligibility rules.

    PubMed

    Olasov, Ben; Sim, Ida

    2006-01-01

    RuleEd is a web-based editing environment which enables clinical trial eligibility rules entered as free text to be represented as a series of terms mapped to unique concepts in a controlled vocabulary. RuleEd provides interfaces for creating and refining concept mappings for terms within rules and disambiguating multiply-mapped terms. A combination of inter-active and non-interactive methods enable authors to specify eligibility rule representations with a fine level of control.

  2. Linear magnetic bearing

    NASA Technical Reports Server (NTRS)

    Studer, P. A. (Inventor)

    1983-01-01

    A linear magnetic bearing system having electromagnetic vernier flux paths in shunt relation with permanent magnets, so that the vernier flux does not traverse the permanent magnet, is described. Novelty is believed to reside in providing a linear magnetic bearing having electromagnetic flux paths that bypass high reluctance permanent magnets. Particular novelty is believed to reside in providing a linear magnetic bearing with a pair of axially spaced elements having electromagnets for establishing vernier x and y axis control. The magnetic bearing system has possible use in connection with a long life reciprocating cryogenic refrigerator that may be used on the space shuttle.

  3. A DIAMOND method of inducing classification rules for biological data.

    PubMed

    Li, Han-Lin; Huang, Yao-Huei

    2011-08-01

    Identifying the classification rules for patients, based on a given dataset, is an important role in medical tasks. For example, the rules for estimating the likelihood of survival for patients undergoing breast cancer surgery are critical in treatment planning. Many well-known classification methods (as decision tree methods and hyper-plane methods) assume that classes can be separated by a linear function. However, these methods suffer when the boundaries between the classes are non-linear. This study presents a novel method, called DIAMOND, to induce classification rules from datasets containing non-linear interactions between the input data and the classes to be predicted. Given a set of objects with some classes, DIAMOND separates the objects into different cubes, and assigns each cube to a class. Via the unions of these cubes, DIAMOND uses mixed-integer programs to induce classification rules with better rates of accuracy, support and compact. This study uses three practical datasets (Iris flower, HSV patients, and breast cancer patients) to illustrate the advantages of DIAMOND over some current methods.

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

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

    2010-01-01

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

  5. Developmental Disabilities Program. Final rule.

    PubMed

    2015-07-27

    This rule implements the Developmental Disabilities Assistance and Bill of Rights Act of 2000. The previous regulations were completed in 1997 before the current law was passed. The rule will align the regulations and current statute and will provide guidance to AIDD grantees. PMID:26214859

  6. The Clean Air Mercury Rule

    SciTech Connect

    Michael Rossler

    2005-07-01

    Coming into force on July 15, 2005, the US Clean Air Mercury Rule will use a market-based cap-and-trade approach under Section 111 of the Clean Air Act to reduce mercury emissions from the electric power sector. This article provides a comprehensive summary of the new rule. 14 refs., 2 tabs.

  7. Electron Charge and Current Densities, the Geometrie Phase and Cellular Automata

    NASA Astrophysics Data System (ADS)

    Sukumar, N.; Deb, B. M.; Singh, Harjinder

    1993-02-01

    Some consequences of the quantum fluid dynamics formulation are discussed for excited states of atoms and molecules and for time-dependent processes. It is shown that the conservation of electronic current density j(r) allows us to manufacture a gauge potential for each excited state of an atom, molecule or atom in a molecule. This potential gives rise to a tube of magnetic flux carried around by the many-electron system. In time-dependent situations, the evolution of the electronic density distribution can be followed with simple, site-dependent cellular automaton (CA) rules. The CA consists of a lattice of sites, each with a finite set of possible values, here representing finite localized elements of electronic charge and current density (since the charge density r no longer suffices to fully characterize a time-dependent system, it needs to be supplemented with information about the current density j).Our numerical results are presented elsewhere and further development is in progress.

  8. Linear Accelerator (LINAC)

    MedlinePlus

    ... is the device most commonly used for external beam radiation treatments for patients with cancer. The linear ... shape of the patient's tumor and the customized beam is directed to the patient's tumor. The beam ...

  9. Isolated linear blaschkoid psoriasis.

    PubMed

    Nasimi, M; Abedini, R; Azizpour, A; Nikoo, A

    2016-10-01

    Linear psoriasis (LPs) is considered a rare clinical presentation of psoriasis, which is characterized by linear erythematous and scaly lesions along the lines of Blaschko. We report the case of a 20-year-old man who presented with asymptomatic linear and S-shaped erythematous, scaly plaques on right side of his trunk. The plaques were arranged along the lines of Blaschko with a sharp demarcation at the midline. Histological examination of a skin biopsy confirmed the diagnosis of psoriasis. Topical calcipotriol and betamethasone dipropionate ointments were prescribed for 2 months. A good clinical improvement was achieved, with reduction in lesion thickness and scaling. In patients with linear erythematous and scaly plaques along the lines of Blaschko, the diagnosis of LPs should be kept in mind, especially in patients with asymptomatic lesions of late onset. PMID:27663156

  10. [IgA linear dermatosis (author's transl)].

    PubMed

    Jablonska, S; Chorzelski, T

    1979-09-01

    Besides the typical forms of dermatitis herpetiformis (DH) and bullous pemphigoid (BP) of adults and children, there are cases combining clinical, histological and electronmicroscopic features of both. Linear continuous IgA deposits along basement membrane zone (BMZ) are a most characteristic finding. They differ from the granular IgA deposits in DH, even if these are also distributed along the BMZ (however, preserving as a rule their granular pattern). IgG circulating anti-BMZ antibodies are absent, whereas in some cases IgA anti-BMZ antibodies may be found. In contrast to DH, there is no gluten-sensitive enteropathy, and the gluten-free diet is ineffective. The recognition of this bullous disease as a distinct entity is of practical significance because these cases respond well to combined treatment with sulfones and corticosteroids, all in small doses. Because of diagnostic importance of linear IgA deposits at BMZ we have proposed the name IgA linear dermatosis. In children a counterpart of IgA linear dermatosis of adults is chronic bullous disease of childhood (CBDC), which we propose to call IgA linear dermatosis of childhood.

  11. Examining Tennessee's collateral source rule.

    PubMed

    Regan, Judith; Hadley, Edward; Regan, William M

    2008-11-01

    The common law collateral source rule was established to prevent the defendant from benefiting from their wrongful actions. Despite a trend in the United States to limit the effects of the collateral source rule, the rule remains in force in courts of the State of Tennessee. However, to assist with the malpractice crisis, the legislature prohibited this rule by statute in regards to the Medical Malpractice Act. Although this statutory prohibition of the collateral source rule worked to lessen verdicts in malpractice cases after passage, the availability of consortium damages resulting from Jordan v. Baptist Three Rivers Hospital in 1999 has worked to drive verdicts substantially higher. Regardless the Medical Malpractice Act has been held as constitutional and has been clarified through several recent Tennessee court decisions. PMID:19024250

  12. Inertial Linear Actuators

    NASA Technical Reports Server (NTRS)

    Laughlin, Darren

    1995-01-01

    Inertial linear actuators developed to suppress residual accelerations of nominally stationary or steadily moving platforms. Function like long-stroke version of voice coil in conventional loudspeaker, with superimposed linear variable-differential transformer. Basic concept also applicable to suppression of vibrations of terrestrial platforms. For example, laboratory table equipped with such actuators plus suitable vibration sensors and control circuits made to vibrate much less in presence of seismic, vehicular, and other environmental vibrational disturbances.

  13. Linear Alopecia Areata.

    PubMed

    Shetty, Shricharith; Rao, Raghavendra; Kudva, R Ranjini; Subramanian, Kumudhini

    2016-01-01

    Alopecia areata (AA) over scalp is known to present in various shapes and extents of hair loss. Typically it presents as circumscribed patches of alopecia with underlying skin remaining normal. We describe a rare variant of AA presenting in linear band-like form. Only four cases of linear alopecia have been reported in medical literature till today, all four being diagnosed as lupus erythematosus profundus. PMID:27625568

  14. Linear Alopecia Areata

    PubMed Central

    Shetty, Shricharith; Rao, Raghavendra; Kudva, R Ranjini; Subramanian, Kumudhini

    2016-01-01

    Alopecia areata (AA) over scalp is known to present in various shapes and extents of hair loss. Typically it presents as circumscribed patches of alopecia with underlying skin remaining normal. We describe a rare variant of AA presenting in linear band-like form. Only four cases of linear alopecia have been reported in medical literature till today, all four being diagnosed as lupus erythematosus profundus.

  15. Linear Alopecia Areata

    PubMed Central

    Shetty, Shricharith; Rao, Raghavendra; Kudva, R Ranjini; Subramanian, Kumudhini

    2016-01-01

    Alopecia areata (AA) over scalp is known to present in various shapes and extents of hair loss. Typically it presents as circumscribed patches of alopecia with underlying skin remaining normal. We describe a rare variant of AA presenting in linear band-like form. Only four cases of linear alopecia have been reported in medical literature till today, all four being diagnosed as lupus erythematosus profundus. PMID:27625568

  16. The rule of rescue.

    PubMed

    McKie, John; Richardson, Jeff

    2003-06-01

    Jonsen coined the term "Rule of Rescue"(RR) to describe the imperative people feel to rescue identifiable individuals facing avoidable death. In this paper we attempt to draw a more detailed picture of the RR, identifying its conflict with cost-effectiveness analysis, the preference it entails for identifiable over statistical lives, the shock-horror response it elicits, the preference it entails for lifesaving over non-lifesaving measures, its extension to non-life-threatening conditions, and whether it is motivated by duty or sympathy. We also consider the measurement problems it raises, and argue that quantifying the RR would probably require a two-stage procedure. In the first stage the size of the individual utility gain from a health intervention would be assessed using a technique such as the Standard Gamble or the Time Trade-Off, and in the second the social benefits arising from the RR would be quantified employing the Person Trade-Off. We also consider the normative status of the RR. We argue that it can be defended from a utilitarian point of view, on the ground that rescues increase well-being by reinforcing people's belief that they live in a community that places great value upon life. However, utilitarianism has long been criticised for failing to take sufficient account of fairness, and the case is no different here: fairness requires that we do not discriminate between individuals on morally irrelevant grounds, whereas being "identifiable" does not seem to be a morally relevant ground for discrimination.

  17. Linear discriminant analysis with misallocation in training samples

    NASA Technical Reports Server (NTRS)

    Chhikara, R. (Principal Investigator); Mckeon, J.

    1982-01-01

    Linear discriminant analysis for a two-class case is studied in the presence of misallocation in training samples. A general appraoch to modeling of mislocation is formulated, and the mean vectors and covariance matrices of the mixture distributions are derived. The asymptotic distribution of the discriminant boundary is obtained and the asymptotic first two moments of the two types of error rate given. Certain numerical results for the error rates are presented by considering the random and two non-random misallocation models. It is shown that when the allocation procedure for training samples is objectively formulated, the effect of misallocation on the error rates of the Bayes linear discriminant rule can almost be eliminated. If, however, this is not possible, the use of Fisher rule may be preferred over the Bayes rule.

  18. Incorporating topography in a cellular automata model to simulate residents evacuation in a mountain area in China

    NASA Astrophysics Data System (ADS)

    Wang, Li; Liu, Mao; Meng, Bo

    2013-02-01

    In China, both the mountainous areas and the number of people who live in mountain areas occupy a significant proportion. When production accidents or natural disasters happen, the residents in mountain areas should be evacuated and the evacuation is of obvious importance to public safety. But it is a pity that there are few studies on safety evacuation in rough terrain. The particularity of the complex terrain in mountain areas, however, makes it difficult to study pedestrian evacuation. In this paper, a three-dimensional surface cellular automata model is proposed to numerically simulate the real time dynamic evacuation of residents. The model takes into account topographic characteristics (the slope gradient) of the environment and the biomechanics characteristics (weight and leg extensor power) of the residents to calculate the walking speed. This paper only focuses on the influence of topography and the physiological parameters are defined as constants according to a statistical report. Velocity varies with the topography. In order to simulate the behavior of a crowd with varying movement velocities, and a numerical algorithm is used to determine the time step of iteration. By doing so, a numerical simulation can be conducted in a 3D surface CA model. Moreover, considering residents evacuation around a gas well in a mountain area as a case, a visualization system for a three-dimensional simulation of pedestrian evacuation is developed. In the simulation process, population behaviors of congestion, queuing and collision avoidance can be observed. The simulation results are explained reasonably. Therefore, the model presented in this paper can realize a 3D dynamic simulation of pedestrian evacuation vividly in complex terrain and predict the evacuation procedure and evacuation time required, which can supply some valuable information for emergency management.

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

    PubMed

    Mukhopadhyay, Anirban; Mondal, Parimal; Barik, Jyotiskona; Chowdhury, S M; Ghosh, Tuhin; Hazra, Sugata

    2015-06-01

    The composition and assemblage of mangroves in the Bangladesh Sundarbans are changing systematically in response to several environmental factors. In order to understand the impact of the changing environmental conditions on the mangrove forest, species composition maps for the years 1985, 1995 and 2005 were studied. In the present study, 1985 and 1995 species zonation maps were considered as base data and the cellular automata-Markov chain model was run to predict the species zonation for the year 2005. The model output was validated against the actual dataset for 2005 and calibrated. Finally, using the model, mangrove species zonation maps for the years 2025, 2055 and 2105 have been prepared. The model was run with the assumption that the continuation of the current tempo and mode of drivers of environmental factors (temperature, rainfall, salinity change) of the last two decades will remain the same in the next few decades. Present findings show that the area distribution of the following species assemblages like Goran (Ceriops), Sundari (Heritiera), Passur (Xylocarpus), and Baen (Avicennia) would decrease in the descending order, whereas the area distribution of Gewa (Excoecaria), Keora (Sonneratia) and Kankra (Bruguiera) dominated assemblages would increase. The spatial distribution of projected mangrove species assemblages shows that more salt tolerant species will dominate in the future; which may be used as a proxy to predict the increase of salinity and its spatial variation in Sundarbans. Considering the present rate of loss of forest land, 17% of the total mangrove cover is predicted to be lost by the year 2105 with a significant loss of fresh water loving mangroves and related ecosystem services. This paper describes a unique approach to assess future changes in species composition and future forest zonation in mangroves under the 'business as usual' scenario of climate change. PMID:25719448

  20. Cellular automata-based forecasting of the impact of accidental fire and toxic dispersion in process industries.

    PubMed

    Sarkar, Chinmoy; Abbasi, S A

    2006-09-01

    The strategies to prevent accidents from occurring in a process industry, or to minimize the harm if an accident does take place, always revolve around forecasting the likely accidents and their impacts. Based on the likely frequency and severity of the accidents, resources are committed towards preventing the accidents. Nearly all techniques of ranking hazardous units, be it the hazard and operability studies, fault tree analysis, hazard indice, etc.--qualitative as well as quantitative--depend essentially on the assessment of the likely frequency and the likely harm accidents in different units may cause. This fact makes it exceedingly important that the forecasting the accidents and their likely impact is done as accurately as possible. In the present study we introduce a new approach to accident forecasting based on the discrete modeling paradigm of cellular automata. In this treatment an accident is modeled as a self-evolving phenomena, the impact of which is strongly influenced by the size, nature, and position of the environmental components which lie in the vicinity of the accident site. The outward propagation of the mass, energy and momentum from the accident epicenter is modeled as a fast diffusion process occurring in discrete space-time coordinates. The quantum of energy and material that would flow into each discrete space element (cell) due to the accidental release is evaluated and the degree of vulnerability posed to the receptors if present in the cell is measured at the end of each time element. This approach is able to effectively take into account the modifications in the flux of energy and material which occur as a result of the heterogeneous environment prevailing between the accident epicenter and the receptor. Consequently, more realistic accident scenarios are generated than possible with the prevailing techniques. The efficacy of the approach has been illustrated with case studies.

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

    PubMed

    Mukhopadhyay, Anirban; Mondal, Parimal; Barik, Jyotiskona; Chowdhury, S M; Ghosh, Tuhin; Hazra, Sugata

    2015-06-01

    The composition and assemblage of mangroves in the Bangladesh Sundarbans are changing systematically in response to several environmental factors. In order to understand the impact of the changing environmental conditions on the mangrove forest, species composition maps for the years 1985, 1995 and 2005 were studied. In the present study, 1985 and 1995 species zonation maps were considered as base data and the cellular automata-Markov chain model was run to predict the species zonation for the year 2005. The model output was validated against the actual dataset for 2005 and calibrated. Finally, using the model, mangrove species zonation maps for the years 2025, 2055 and 2105 have been prepared. The model was run with the assumption that the continuation of the current tempo and mode of drivers of environmental factors (temperature, rainfall, salinity change) of the last two decades will remain the same in the next few decades. Present findings show that the area distribution of the following species assemblages like Goran (Ceriops), Sundari (Heritiera), Passur (Xylocarpus), and Baen (Avicennia) would decrease in the descending order, whereas the area distribution of Gewa (Excoecaria), Keora (Sonneratia) and Kankra (Bruguiera) dominated assemblages would increase. The spatial distribution of projected mangrove species assemblages shows that more salt tolerant species will dominate in the future; which may be used as a proxy to predict the increase of salinity and its spatial variation in Sundarbans. Considering the present rate of loss of forest land, 17% of the total mangrove cover is predicted to be lost by the year 2105 with a significant loss of fresh water loving mangroves and related ecosystem services. This paper describes a unique approach to assess future changes in species composition and future forest zonation in mangroves under the 'business as usual' scenario of climate change.

  2. Revisions to direct fee payment rules. Final rules.

    PubMed

    2015-01-01

    We are adopting, with two revisions, our interim final rules that implemented amendments to the Social Security Act (Act) made by the Social Security Disability Applicants' Access to Professional Representation Act of 2010 (PRA). The interim final rules made permanent the direct fee payment rules for eligible non-attorney representatives under titles II and XVI of the Act and for attorney representatives under title XVI of the Act. They also revised some of our eligibility policies for non-attorney representatives under titles II and XVI of the Act. Based on public comment and subsequent inquiries, we are revising our rules to clarify that an eligible non-attorney representative's liability insurance policy must include malpractice coverage. We are also reaffirming that a business entity legally permitted to provide the required insurance in the States in which the non-attorney representative conducts business must underwrite the policies.

  3. Universal waste rule: Final rule issued. Environmental Guidance Regulatory Bulletin

    SciTech Connect

    1995-08-14

    On February 11, 1993, EPA proposed to streamline the management requirements for certain hazardous wastes that were generated in large quantities by a variety of generators (i.e., residential, small businesses, industries, etc.). EPA`s intention was to facilitate the environmentally sound collection and disposal of these types of wastes. In this proposed rule, EPA termed these types of hazardous wastes ``universal wastes`` and developed a management system which was less stringent than the existing Subtitle C regulations. EPA proposed that the following three types of hazardous wastes be managed as universal wastes: batteries, certain pesticides, and thermostats. Because EPA believed that the authority to propose the promulgation of the universal waste rule was not significantly linked to HSWA provisions, the Agency proposed the promulgation of the universal waste rule under pre-HSWA authority. On May 11, 1995, at FR 25492, EPA promulgated a pre-HSWA rule that streamlined hazardous waste management regulations for universal wastes.

  4. Superconducting linear actuator

    NASA Technical Reports Server (NTRS)

    Johnson, Bruce; Hockney, Richard

    1993-01-01

    Special actuators are needed to control the orientation of large structures in space-based precision pointing systems. Electromagnetic actuators that presently exist are too large in size and their bandwidth is too low. Hydraulic fluid actuation also presents problems for many space-based applications. Hydraulic oil can escape in space and contaminate the environment around the spacecraft. A research study was performed that selected an electrically-powered linear actuator that can be used to control the orientation of a large pointed structure. This research surveyed available products, analyzed the capabilities of conventional linear actuators, and designed a first-cut candidate superconducting linear actuator. The study first examined theoretical capabilities of electrical actuators and determined their problems with respect to the application and then determined if any presently available actuators or any modifications to available actuator designs would meet the required performance. The best actuator was then selected based on available design, modified design, or new design for this application. The last task was to proceed with a conceptual design. No commercially-available linear actuator or modification capable of meeting the specifications was found. A conventional moving-coil dc linear actuator would meet the specification, but the back-iron for this actuator would weigh approximately 12,000 lbs. A superconducting field coil, however, eliminates the need for back iron, resulting in an actuator weight of approximately 1000 lbs.

  5. Designing linear systolic arrays

    SciTech Connect

    Kumar, V.K.P.; Tsai, Y.C. . Dept. of Electrical Engineering)

    1989-12-01

    The authors develop a simple mapping technique to design linear systolic arrays. The basic idea of the technique is to map the computations of a certain class of two-dimensional systolic arrays onto one-dimensional arrays. Using this technique, systolic algorithms are derived for problems such as matrix multiplication and transitive closure on linearly connected arrays of PEs with constant I/O bandwidth. Compared to known designs in the literature, the technique leads to modular systolic arrays with constant hardware in each PE, few control lines, lexicographic data input/output, and improved delay time. The unidirectional flow of control and data in this design assures implementation of the linear array in the known fault models of wafer scale integration.

  6. Linear encoding device

    NASA Technical Reports Server (NTRS)

    Leviton, Douglas B. (Inventor)

    1993-01-01

    A Linear Motion Encoding device for measuring the linear motion of a moving object is disclosed in which a light source is mounted on the moving object and a position sensitive detector such as an array photodetector is mounted on a nearby stationary object. The light source emits a light beam directed towards the array photodetector such that a light spot is created on the array. An analog-to-digital converter, connected to the array photodetector is used for reading the position of the spot on the array photodetector. A microprocessor and memory is connected to the analog-to-digital converter to hold and manipulate data provided by the analog-to-digital converter on the position of the spot and to compute the linear displacement of the moving object based upon the data from the analog-to-digital converter.

  7. Learning diagnostic features: the delta rule does Bubbles.

    PubMed

    Hannagan, Thomas; Grainger, Jonathan

    2013-07-17

    It has been shown (Murray & Gold, 2004a) that the Bubbles paradigm for studying human perceptual identification can be formally analyzed and compared to reverse correlation methods when the underlying identification model is conceived as a linear amplifier (LAM). However the usefulness of a LAM for characterizing human perceptual identification mechanisms has subsequently been questioned (Gosselin & Schyns, 2004). In this article we show that a simple linear model that is formally analogous to the LAM--a linear perceptron trained with the delta rule--can make sense of several Bubbles experiments in the context of letter identification. Specifically, an analysis of input-output connection weights after training revealed that the most positive weights clustered around letter parts in a way that mimicked the diagnostic parts of letters revealed by the Bubbles technique (Fiset et al., 2008). Our results suggest that linear observer models are indeed unreasonably effective, at least as first approximations to human letter identification mechanisms.

  8. Breaking the Carboxyl Rule

    PubMed Central

    Balashov, Sergei P.; Petrovskaya, Lada E.; Imasheva, Eleonora S.; Lukashev, Evgeniy P.; Dioumaev, Andrei K.; Wang, Jennifer M.; Sychev, Sergey V.; Dolgikh, Dmitriy A.; Rubin, Andrei B.; Kirpichnikov, Mikhail P.; Lanyi, Janos K.

    2013-01-01

    A lysine instead of the usual carboxyl group is in place of the internal proton donor to the retinal Schiff base in the light-driven proton pump of Exiguobacterium sibiricum (ESR). The involvement of this lysine in proton transfer is indicated by the finding that its substitution with alanine or other residues slows reprotonation of the Schiff base (decay of the M intermediate) by more than 2 orders of magnitude. In these mutants, the rate constant of the M decay linearly decreases with a decrease in proton concentration, as expected if reprotonation is limited by the uptake of a proton from the bulk. In wild type ESR, M decay is biphasic, and the rate constants are nearly pH-independent between pH 6 and 9. Proton uptake occurs after M formation but before M decay, which is especially evident in D2O and at high pH. Proton uptake is biphasic; the amplitude of the fast phase decreases with a pKa of 8.5 ± 0.3, which reflects the pKa of the donor during proton uptake. Similarly, the fraction of the faster component of M decay decreases and the slower one increases, with a pKa of 8.1 ± 0.2. The data therefore suggest that the reprotonation of the Schiff base in ESR is preceded by transient protonation of an initially unprotonated donor, which is probably the ϵ-amino group of Lys-96 or a water molecule in its vicinity, and it facilitates proton delivery from the bulk to the reaction center of the protein. PMID:23696649

  9. A Perspective on Solubility Rules.

    ERIC Educational Resources Information Center

    Monroe, Manus; Abrams, Karl

    1984-01-01

    Presents four generalizations about solubilities. These generalizations (rules), are useful in introducing the dynamic topics of solubility and in helping high school and introductory college chemistry students make some order out of the tremendous number of facts available. (JN)

  10. General rules for bosonic bunching in multimode interferometers.

    PubMed

    Spagnolo, Nicolò; Vitelli, Chiara; Sansoni, Linda; Maiorino, Enrico; Mataloni, Paolo; Sciarrino, Fabio; Brod, Daniel J; Galvão, Ernesto F; Crespi, Andrea; Ramponi, Roberta; Osellame, Roberto

    2013-09-27

    We perform a comprehensive set of experiments that characterize bosonic bunching of up to three photons in interferometers of up to 16 modes. Our experiments verify two rules that govern bosonic bunching. The first rule, obtained recently, predicts the average behavior of the bunching probability and is known as the bosonic birthday paradox. The second rule is new and establishes a n!-factor quantum enhancement for the probability that all n bosons bunch in a single output mode, with respect to the case of distinguishable bosons. In addition to its fundamental importance in phenomena such as Bose-Einstein condensation, bosonic bunching can be exploited in applications such as linear optical quantum computing and quantum-enhanced metrology.

  11. Network of evolutionary processors with splicing rules and permitting context.

    PubMed

    Choudhary, Ashish; Krithivasan, Kamala

    2007-02-01

    In this paper we consider networks of evolutionary processors with splicing rules and permitting context (NEPPS) as language generating and computational devices. Such a network consists of several processors placed on the nodes of a virtual graph and are able to perform splicing (which is a biologically motivated operation) on the words present in that node, according to the splicing rules present there. Before applying the splicing operation on words, we check for the presence of certain symbols (permitting context) in the strings on which the rule is applied. Each node is associated with an input and output filter. When the filters are based on random context conditions, one gets the computational power of Turing machines with networks of size two. We also show how these networks can be used to solve NP-complete problems in linear time. PMID:17045388

  12. Sum rule for response function in nonequilibrium Langevin systems

    NASA Astrophysics Data System (ADS)

    Yuge, Tatsuro

    2010-11-01

    We derive general properties of the linear-response functions of nonequilibrium steady states in Langevin systems. These correspond to extension of the results which were recently found in Hamiltonian systems [A. Shimizu and T. Yuge, J. Phys. Soc. Jpn. 79, 013002 (2010)10.1143/JPSJ.79.013002]. We discuss one of the properties, the sum rule for the response function, in particular detail. We show that the sum rule for the response function of the velocity holds in the underdamped case, whereas it is violated in the overdamped case. This implies that the overdamped Langevin models should be used with great care. We also investigate the relation of the sum rule to an equality on the energy dissipation in nonequilibrium Langevin systems, which was derived by Harada and Sasa.

  13. Rule-Based Runtime Verification

    NASA Technical Reports Server (NTRS)

    Barringer, Howard; Goldberg, Allen; Havelund, Klaus; Sen, Koushik

    2003-01-01

    We present a rule-based framework for defining and implementing finite trace monitoring logics, including future and past time temporal logic, extended regular expressions, real-time logics, interval logics, forms of quantified temporal logics, and so on. Our logic, EAGLE, is implemented as a Java library and involves novel techniques for rule definition, manipulation and execution. Monitoring is done on a state-by-state basis, without storing the execution trace.

  14. Simple rules for a “simple” nervous system? Molecular and biomathematical approaches to enteric nervous system formation and malformation

    PubMed Central

    Newgreen, Donald F.; Dufour, Sylvie; Howard, Marthe J.; Landman, Kerry A.

    2013-01-01

    We review morphogenesis of the enteric nervous system from migratory neural crest cells, and defects of this process such as Hirschsprung disease, centering on cell motility and assembly, and cell adhesion and extracellular matrix molecules, along with cell proliferation and growth factors. We then review continuum and agent-based (cellular automata) models with rules of cell movement and logistical proliferation. Both movement and proliferation at the individual cell level are modeled with stochastic components from which stereotyped outcomes emerge at the population level. These models reproduced the wave-like colonization of the intestine by enteric neural crest cells, and several new properties emerged, such as colonization by frontal expansion, which were later confirmed biologically. These models predict a surprising level of clonal heterogeneity both in terms of number and distribution of daughter cells. Biologically, migrating cells form stable chains made up of unstable cells, but this is not seen in the initial model. We outline additional rules for cell differentiation into neurons, axon extension, cell-axon and cell-cell adhesions, chemotaxis and repulsion which can reproduce chain migration. After the migration stage, the cells rearrange as a network of ganglia. Changes in cell adhesion molecules parallel this, and we describe additional rules based on Steinberg's Differential Adhesion Hypothesis, reflecting changing levels of adhesion in neural crest cells and neurons. This was able to reproduce enteric ganglionation in a model. Mouse mutants with disturbances of enteric nervous system morphogenesis are discussed, and these suggest future refinement of the models. The modeling suggests a relatively simple set of cell behavioral rules could account for complex patterns of morphogenesis. The model has allowed the proposal that Hirschsprung disease is mostly an enteric neural crest cell proliferation defect, not a defect of cell migration. In addition

  15. Improved Electrohydraulic Linear Actuators

    NASA Technical Reports Server (NTRS)

    Hamtil, James

    2004-01-01

    A product line of improved electrohydraulic linear actuators has been developed. These actuators are designed especially for use in actuating valves in rocket-engine test facilities. They are also adaptable to many industrial uses, such as steam turbines, process control valves, dampers, motion control, etc. The advantageous features of the improved electrohydraulic linear actuators are best described with respect to shortcomings of prior electrohydraulic linear actuators that the improved ones are intended to supplant. The flow of hydraulic fluid to the two ports of the actuator cylinder is controlled by a servo valve that is controlled by a signal from a servo amplifier that, in turn, receives an analog position-command signal (a current having a value between 4 and 20 mA) from a supervisory control system of the facility. As the position command changes, the servo valve shifts, causing a greater flow of hydraulic fluid to one side of the cylinder and thereby causing the actuator piston to move to extend or retract a piston rod from the actuator body. A linear variable differential transformer (LVDT) directly linked to the piston provides a position-feedback signal, which is compared with the position-command signal in the servo amplifier. When the position-feedback and position-command signals match, the servo valve moves to its null position, in which it holds the actuator piston at a steady position.

  16. Tissue non-linearity.

    PubMed

    Duck, F

    2010-01-01

    The propagation of acoustic waves is a fundamentally non-linear process, and only waves with infinitesimally small amplitudes may be described by linear expressions. In practice, all ultrasound propagation is associated with a progressive distortion in the acoustic waveform and the generation of frequency harmonics. At the frequencies and amplitudes used for medical diagnostic scanning, the waveform distortion can result in the formation of acoustic shocks, excess deposition of energy, and acoustic saturation. These effects occur most strongly when ultrasound propagates within liquids with comparatively low acoustic attenuation, such as water, amniotic fluid, or urine. Attenuation by soft tissues limits but does not extinguish these non-linear effects. Harmonics may be used to create tissue harmonic images. These offer improvements over conventional B-mode images in spatial resolution and, more significantly, in the suppression of acoustic clutter and side-lobe artefacts. The quantity B/A has promise as a parameter for tissue characterization, but methods for imaging B/A have shown only limited success. Standard methods for the prediction of tissue in-situ exposure from acoustic measurements in water, whether for regulatory purposes, for safety assessment, or for planning therapeutic regimes, may be in error because of unaccounted non-linear losses. Biological effects mechanisms are altered by finite-amplitude effects. PMID:20349813

  17. Linear motion valve

    NASA Technical Reports Server (NTRS)

    Chandler, J. A. (Inventor)

    1985-01-01

    The linear motion valve is described. The valve spool employs magnetically permeable rings, spaced apart axially, which engage a sealing assembly having magnetically permeable pole pieces in magnetic relationship with a magnet. The gap between the ring and the pole pieces is sealed with a ferrofluid. Depletion of the ferrofluid is minimized.

  18. Resistors Improve Ramp Linearity

    NASA Technical Reports Server (NTRS)

    Kleinberg, L. L.

    1982-01-01

    Simple modification to bootstrap ramp generator gives more linear output over longer sweep times. New circuit adds just two resistors, one of which is adjustable. Modification cancels nonlinearities due to variations in load on charging capacitor and due to changes in charging current as the voltage across capacitor increases.

  19. On Solving Linear Recurrences

    ERIC Educational Resources Information Center

    Dobbs, David E.

    2013-01-01

    A direct method is given for solving first-order linear recurrences with constant coefficients. The limiting value of that solution is studied as "n to infinity." This classroom note could serve as enrichment material for the typical introductory course on discrete mathematics that follows a calculus course.

  20. Using the Chain Rule as the Key Link in Deriving the General Rules for Differentiation

    ERIC Educational Resources Information Center

    Sprows, David

    2011-01-01

    The standard approach to the general rules for differentiation is to first derive the power, product, and quotient rules and then derive the chain rule. In this short article we give an approach to these rules which uses the chain rule as the main tool in deriving the power, product, and quotient rules in a manner which is more student-friendly…

  1. Rules and Self-Rules: Effects of Variation upon Behavioral Sensitivity to Change

    ERIC Educational Resources Information Center

    Baumann, Ana A.; Abreu-Rodrigues, Josele; da Silva Souza, Alessandra

    2009-01-01

    Four experiments compared the effects of self-rules and rules, and varied and specific schedules of reinforcement. Participants were first exposed to either several schedules (varied groups) or to one schedule (specific groups) and either were asked to generate rules (self-rule groups), were provided rules (rule groups), or were not asked nor…

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

    NASA Technical Reports Server (NTRS)

    Fijany, Amir; Toomarian, Benny N.

    2000-01-01

    There has been significant improvement in the performance of VLSI devices, in terms of size, power consumption, and speed, in recent years and this trend may also continue for some near future. However, it is a well known fact that there are major obstacles, i.e., physical limitation of feature size reduction and ever increasing cost of foundry, that would prevent the long term continuation of this trend. This has motivated the exploration of some fundamentally new technologies that are not dependent on the conventional feature size approach. Such technologies are expected to enable scaling to continue to the ultimate level, i.e., molecular and atomistic size. Quantum computing, quantum dot-based computing, DNA based computing, biologically inspired computing, etc., are examples of such new technologies. In particular, quantum-dots based computing by using Quantum-dot Cellular Automata (QCA) has recently been intensely investigated as a promising new technology capable of offering significant improvement over conventional VLSI in terms of reduction of feature size (and hence increase in integration level), reduction of power consumption, and increase of switching speed. Quantum dot-based computing and memory in general and QCA specifically, are intriguing to NASA due to their high packing density (10(exp 11) - 10(exp 12) per square cm ) and low power consumption (no transfer of current) and potentially higher radiation tolerant. Under Revolutionary Computing Technology (RTC) Program at the NASA/JPL Center for Integrated Space Microelectronics (CISM), we have been investigating the potential applications of QCA for the space program. To this end, exploiting the intrinsic features of QCA, we have designed novel QCA-based circuits for co-planner (i.e., single layer) and compact implementation of a class of data permutation matrices, a class of interconnection networks, and a bit-serial processor. Building upon these circuits, we have developed novel algorithms and QCA

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

    NASA Astrophysics Data System (ADS)

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

    2016-05-01

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

  4. Reciprocating linear motor

    NASA Technical Reports Server (NTRS)

    Goldowsky, Michael P. (Inventor)

    1987-01-01

    A reciprocating linear motor is formed with a pair of ring-shaped permanent magnets having opposite radial polarizations, held axially apart by a nonmagnetic yoke, which serves as an axially displaceable armature assembly. A pair of annularly wound coils having axial lengths which differ from the axial lengths of the permanent magnets are serially coupled together in mutual opposition and positioned with an outer cylindrical core in axial symmetry about the armature assembly. One embodiment includes a second pair of annularly wound coils serially coupled together in mutual opposition and an inner cylindrical core positioned in axial symmetry inside the armature radially opposite to the first pair of coils. Application of a potential difference across a serial connection of the two pairs of coils creates a current flow perpendicular to the magnetic field created by the armature magnets, thereby causing limited linear displacement of the magnets relative to the coils.

  5. General linear chirplet transform

    NASA Astrophysics Data System (ADS)

    Yu, Gang; Zhou, Yiqi

    2016-03-01

    Time-frequency (TF) analysis (TFA) method is an effective tool to characterize the time-varying feature of a signal, which has drawn many attentions in a fairly long period. With the development of TFA, many advanced methods are proposed, which can provide more precise TF results. However, some restrictions are introduced inevitably. In this paper, we introduce a novel TFA method, termed as general linear chirplet transform (GLCT), which can overcome some limitations existed in current TFA methods. In numerical and experimental validations, by comparing with current TFA methods, some advantages of GLCT are demonstrated, which consist of well-characterizing the signal of multi-component with distinct non-linear features, being independent to the mathematical model and initial TFA method, allowing for the reconstruction of the interested component, and being non-sensitivity to noise.

  6. Electrostatic Linear Actuator

    NASA Technical Reports Server (NTRS)

    Collins, Earl R., Jr.; Curry, Kenneth C.

    1990-01-01

    Electrically charged helices attract or repel each other. Proposed electrostatic linear actuator made with intertwined dual helices, which holds charge-bearing surfaces. Dual-helix configuration provides relatively large unbroken facing charged surfaces (relatively large electrostatic force) within small volume. Inner helix slides axially in outer helix in response to voltages applied to conductors. Spiral form also makes components more rigid. Actuator conceived to have few moving parts and to be operable after long intervals of inactivity.

  7. Linear induction accelerator

    DOEpatents

    Buttram, M.T.; Ginn, J.W.

    1988-06-21

    A linear induction accelerator includes a plurality of adder cavities arranged in a series and provided in a structure which is evacuated so that a vacuum inductance is provided between each adder cavity and the structure. An energy storage system for the adder cavities includes a pulsed current source and a respective plurality of bipolar converting networks connected thereto. The bipolar high-voltage, high-repetition-rate square pulse train sets and resets the cavities. 4 figs.

  8. Relativistic Linear Restoring Force

    ERIC Educational Resources Information Center

    Clark, D.; Franklin, J.; Mann, N.

    2012-01-01

    We consider two different forms for a relativistic version of a linear restoring force. The pair comes from taking Hooke's law to be the force appearing on the right-hand side of the relativistic expressions: d"p"/d"t" or d"p"/d["tau"]. Either formulation recovers Hooke's law in the non-relativistic limit. In addition to these two forces, we…

  9. Combustion powered linear actuator

    DOEpatents

    Fischer, Gary J.

    2007-09-04

    The present invention provides robotic vehicles having wheeled and hopping mobilities that are capable of traversing (e.g. by hopping over) obstacles that are large in size relative to the robot and, are capable of operation in unpredictable terrain over long range. The present invention further provides combustion powered linear actuators, which can include latching mechanisms to facilitate pressurized fueling of the actuators, as can be used to provide wheeled vehicles with a hopping mobility.

  10. Representation of linear orders.

    PubMed

    Taylor, D A; Kim, J O; Sudevan, P

    1984-01-01

    Two binary classification tasks were used to explore the associative structure of linear orders. In Experiment 1, college students classified English letters as targets or nontargets, the targets being consecutive letters of the alphabet. The time to reject nontargets was a decreasing function of the distance from the target set, suggesting response interference mediated by automatic associations from the target to the nontarget letters. The way in which this interference effect depended on the placement of the boundaries between the target and nontarget sets revealed the relative strengths of individual interletter associations. In Experiment 2, students were assigned novel linear orders composed of letterlike symbols and asked to classify pairs of symbols as being adjacent or nonadjacent in the assigned sequence. Reaction time was found to be a joint function of the distance between any pair of symbols and the relative positions of those symbols within the sequence. The effects of both distance and position decreased systematically over 6 days of practice with a particular order, beginning at a level typical of unfamiliar orders and converging on a level characteristic of familiar orders such as letters and digits. These results provide an empirical unification of two previously disparate sets of findings in the literature on linear orders, those concerning familiar and unfamiliar orders, and the systematic transition between the two patterns of results suggests the gradual integration of a new associative structure.

  11. Anti- (conjugate) linearity

    NASA Astrophysics Data System (ADS)

    Uhlmann, Armin

    2016-03-01

    This is an introduction to antilinear operators. In following Wigner the terminus antilinear is used as it is standard in Physics. Mathematicians prefer to say conjugate linear. By restricting to finite-dimensional complex-linear spaces, the exposition becomes elementary in the functional analytic sense. Nevertheless it shows the amazing differences to the linear case. Basics of antilinearity is explained in sects. 2, 3, 4, 7 and in sect. 1.2: Spectrum, canonical Hermitian form, antilinear rank one and two operators, the Hermitian adjoint, classification of antilinear normal operators, (skew) conjugations, involutions, and acq-lines, the antilinear counterparts of 1-parameter operator groups. Applications include the representation of the Lagrangian Grassmannian by conjugations, its covering by acq-lines. As well as results on equivalence relations. After remembering elementary Tomita-Takesaki theory, antilinear maps, associated to a vector of a two-partite quantum system, are defined. By allowing to write modular objects as twisted products of pairs of them, they open some new ways to express EPR and teleportation tasks. The appendix presents a look onto the rich structure of antilinear operator spaces.

  12. Linearized Kernel Dictionary Learning

    NASA Astrophysics Data System (ADS)

    Golts, Alona; Elad, Michael

    2016-06-01

    In this paper we present a new approach of incorporating kernels into dictionary learning. The kernel K-SVD algorithm (KKSVD), which has been introduced recently, shows an improvement in classification performance, with relation to its linear counterpart K-SVD. However, this algorithm requires the storage and handling of a very large kernel matrix, which leads to high computational cost, while also limiting its use to setups with small number of training examples. We address these problems by combining two ideas: first we approximate the kernel matrix using a cleverly sampled subset of its columns using the Nystr\\"{o}m method; secondly, as we wish to avoid using this matrix altogether, we decompose it by SVD to form new "virtual samples," on which any linear dictionary learning can be employed. Our method, termed "Linearized Kernel Dictionary Learning" (LKDL) can be seamlessly applied as a pre-processing stage on top of any efficient off-the-shelf dictionary learning scheme, effectively "kernelizing" it. We demonstrate the effectiveness of our method on several tasks of both supervised and unsupervised classification and show the efficiency of the proposed scheme, its easy integration and performance boosting properties.

  13. The Stanford Linear Collider

    SciTech Connect

    Rees, J.R.

    1989-10-01

    April, 1989, the first Z zero particle was observed at the Stanford Linear Collider (SLC). The SLC collides high-energy beams of electrons and positrons into each other. In break with tradition the SLC aims two linear beams at each other. Strong motives impelled the Stanford team to choose the route of innovation. One reason being that linear colliders promise to be less expensive to build and operate than storage ring colliders. An equally powerful motive was the desire to build an Z zero factory, a facility at which the Z zero particle can be studied in detail. More than 200 Z zero particles have been detected at the SLC and more continue to be churned out regularly. It is in measuring the properties of the Z zero that the SLC has a seminal contribution to make. One of the primary goals of the SLC experimental program is to determine the mass of the Z zero as precisely as possible.In the end, the SLC's greatest significance will be in having proved a new accelerator technology. 7 figs.

  14. Rule-based simulation models

    NASA Technical Reports Server (NTRS)

    Nieten, Joseph L.; Seraphine, Kathleen M.

    1991-01-01

    Procedural modeling systems, rule based modeling systems, and a method for converting a procedural model to a rule based model are described. Simulation models are used to represent real time engineering systems. A real time system can be represented by a set of equations or functions connected so that they perform in the same manner as the actual system. Most modeling system languages are based on FORTRAN or some other procedural language. Therefore, they must be enhanced with a reaction capability. Rule based systems are reactive by definition. Once the engineering system has been decomposed into a set of calculations using only basic algebraic unary operations, a knowledge network of calculations and functions can be constructed. The knowledge network required by a rule based system can be generated by a knowledge acquisition tool or a source level compiler. The compiler would take an existing model source file, a syntax template, and a symbol table and generate the knowledge network. Thus, existing procedural models can be translated and executed by a rule based system. Neural models can be provide the high capacity data manipulation required by the most complex real time models.

  15. A Bayesian model averaging method for the derivation of reservoir operating rules

    NASA Astrophysics Data System (ADS)

    Zhang, Jingwen; Liu, Pan; Wang, Hao; Lei, Xiaohui; Zhou, Yanlai

    2015-09-01

    Because the intrinsic dynamics among optimal decision making, inflow processes and reservoir characteristics are complex, functional forms of reservoir operating rules are always determined subjectively. As a result, the uncertainty of selecting form and/or model involved in reservoir operating rules must be analyzed and evaluated. In this study, we analyze the uncertainty of reservoir operating rules using the Bayesian model averaging (BMA) model. Three popular operating rules, namely piecewise linear regression, surface fitting and a least-squares support vector machine, are established based on the optimal deterministic reservoir operation. These individual models provide three-member decisions for the BMA combination, enabling the 90% release interval to be estimated by the Markov Chain Monte Carlo simulation. A case study of China's the Baise reservoir shows that: (1) the optimal deterministic reservoir operation, superior to any reservoir operating rules, is used as the samples to derive the rules; (2) the least-squares support vector machine model is more effective than both piecewise linear regression and surface fitting; (3) BMA outperforms any individual model of operating rules based on the optimal trajectories. It is revealed that the proposed model can reduce the uncertainty of operating rules, which is of great potential benefit in evaluating the confidence interval of decisions.

  16. Constructing compact Takagi-Sugeno rule systems: identification of complex interactions in epidemiological data.

    PubMed

    Zhou, Shang-Ming; Lyons, Ronan A; Brophy, Sinead; Gravenor, Mike B

    2012-01-01

    The Takagi-Sugeno (TS) fuzzy rule system is a widely used data mining technique, and is of particular use in the identification of non-linear interactions between variables. However the number of rules increases dramatically when applied to high dimensional data sets (the curse of dimensionality). Few robust methods are available to identify important rules while removing redundant ones, and this results in limited applicability in fields such as epidemiology or bioinformatics where the interaction of many variables must be considered. Here, we develop a new parsimonious TS rule system. We propose three statistics: R, L, and ω-values, to rank the importance of each TS rule, and a forward selection procedure to construct a final model. We use our method to predict how key components of childhood deprivation combine to influence educational achievement outcome. We show that a parsimonious TS model can be constructed, based on a small subset of rules, that provides an accurate description of the relationship between deprivation indices and educational outcomes. The selected rules shed light on the synergistic relationships between the variables, and reveal that the effect of targeting specific domains of deprivation is crucially dependent on the state of the other domains. Policy decisions need to incorporate these interactions, and deprivation indices should not be considered in isolation. The TS rule system provides a basis for such decision making, and has wide applicability for the identification of non-linear interactions in complex biomedical data.

  17. Synaptic dynamics: linear model and adaptation algorithm.

    PubMed

    Yousefi, Ali; Dibazar, Alireza A; Berger, Theodore W

    2014-08-01

    In this research, temporal processing in brain neural circuitries is addressed by a dynamic model of synaptic connections in which the synapse model accounts for both pre- and post-synaptic processes determining its temporal dynamics and strength. Neurons, which are excited by the post-synaptic potentials of hundred of the synapses, build the computational engine capable of processing dynamic neural stimuli. Temporal dynamics in neural models with dynamic synapses will be analyzed, and learning algorithms for synaptic adaptation of neural networks with hundreds of synaptic connections are proposed. The paper starts by introducing a linear approximate model for the temporal dynamics of synaptic transmission. The proposed linear model substantially simplifies the analysis and training of spiking neural networks. Furthermore, it is capable of replicating the synaptic response of the non-linear facilitation-depression model with an accuracy better than 92.5%. In the second part of the paper, a supervised spike-in-spike-out learning rule for synaptic adaptation in dynamic synapse neural networks (DSNN) is proposed. The proposed learning rule is a biologically plausible process, and it is capable of simultaneously adjusting both pre- and post-synaptic components of individual synapses. The last section of the paper starts with presenting the rigorous analysis of the learning algorithm in a system identification task with hundreds of synaptic connections which confirms the learning algorithm's accuracy, repeatability and scalability. The DSNN is utilized to predict the spiking activity of cortical neurons and pattern recognition tasks. The DSNN model is demonstrated to be a generative model capable of producing different cortical neuron spiking patterns and CA1 Pyramidal neurons recordings. A single-layer DSNN classifier on a benchmark pattern recognition task outperforms a 2-Layer Neural Network and GMM classifiers while having fewer numbers of free parameters and

  18. 16 CFR 429.1 - The Rule.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 16 Commercial Practices 1 2011-01-01 2011-01-01 false The Rule. 429.1 Section 429.1 Commercial Practices FEDERAL TRADE COMMISSION TRADE REGULATION RULES RULE CONCERNING COOLING-OFF PERIOD FOR SALES MADE AT HOMES OR AT CERTAIN OTHER LOCATIONS § 429.1 The Rule. In connection with any door-to-door sale,...

  19. 16 CFR 429.1 - The Rule.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 16 Commercial Practices 1 2010-01-01 2010-01-01 false The Rule. 429.1 Section 429.1 Commercial Practices FEDERAL TRADE COMMISSION TRADE REGULATION RULES RULE CONCERNING COOLING-OFF PERIOD FOR SALES MADE AT HOMES OR AT CERTAIN OTHER LOCATIONS § 429.1 The Rule. In connection with any door-to-door sale,...

  20. 75 FR 66709 - Commercial Radio Operators Rules

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-10-29

    ... COMMISSION 47 CFR Parts 0, 1, 13, 80, and 87 Commercial Radio Operators Rules AGENCY: Federal Communications Commission. ACTION: Proposed rule. SUMMARY: This document proposes to amend our rules concerning commercial... within the commercial radio operators service, to determine which rules can be clarified, streamlined,...

  1. 76 FR 76815 - Business Opportunity Rule

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-12-08

    ... ``Amended Franchise Rule'' refers to the amended Franchise Rule published at 72 FR 15444 (Mar. 30, 2007) and... Opportunity Ventures: Advanced Notice of Proposed Rulemaking, 62 FR 9115 (Feb. 28, 1997). ``Initial Proposed... Rule, 71 FR 9054 (Apr. 12, 2006). ``Interim Business Opportunity Rule'' refers to the...

  2. 29 CFR 18.802 - Hearsay rule.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 29 Labor 1 2010-07-01 2010-07-01 true Hearsay rule. 18.802 Section 18.802 Labor Office of the Secretary of Labor RULES OF PRACTICE AND PROCEDURE FOR ADMINISTRATIVE HEARINGS BEFORE THE OFFICE OF ADMINISTRATIVE LAW JUDGES Rules of Evidence Hearsay § 18.802 Hearsay rule. Hearsay is not admissible except...

  3. Conformance Testing: Measurement Decision Rules

    NASA Technical Reports Server (NTRS)

    Mimbs, Scott M.

    2010-01-01

    The goal of a Quality Management System (QMS) as specified in ISO 9001 and AS9100 is to provide assurance to the customer that end products meet specifications. Measuring devices, often called measuring and test equipment (MTE), are used to provide the evidence of product conformity to specified requirements. Unfortunately, processes that employ MTE can become a weak link to the overall QMS if proper attention is not given to the measurement process design, capability, and implementation. Documented "decision rules" establish the requirements to ensure measurement processes provide the measurement data that supports the needs of the QMS. Measurement data are used to make the decisions that impact all areas of technology. Whether measurements support research, design, production, or maintenance, ensuring the data supports the decision is crucial. Measurement data quality can be critical to the resulting consequences of measurement-based decisions. Historically, most industries required simplistic, one-size-fits-all decision rules for measurements. One-size-fits-all rules in some cases are not rigorous enough to provide adequate measurement results, while in other cases are overly conservative and too costly to implement. Ideally, decision rules should be rigorous enough to match the criticality of the parameter being measured, while being flexible enough to be cost effective. The goal of a decision rule is to ensure that measurement processes provide data with a sufficient level of quality to support the decisions being made - no more, no less. This paper discusses the basic concepts of providing measurement-based evidence that end products meet specifications. Although relevant to all measurement-based conformance tests, the target audience is the MTE end-user, which is anyone using MTE other than calibration service providers. Topics include measurement fundamentals, the associated decision risks, verifying conformance to specifications, and basic measurement

  4. Flight Rules Critical Readiness Review

    NASA Technical Reports Server (NTRS)

    Kim, E.; Knudsen, F.; Rice, S.

    2010-01-01

    The increment 23/24 Critical Readiness Review (CRR) flight rules are presented. The topics include: 1) B13-152 Acoustic Constraints; 2) B13-113 IFM/Corrective Action Prioritization Due to Loss of Exercise Capability; 3) B13-116 Constraints on Treadmill VIS Failure; 4) B13-201 Medical Management of ISS Fire/Smoke Response; 5) ARED and T2 Exercise constraints Flight rules (flight and stage specific); 6) FYI: B14 FR to be updated with requirement to sample crew sleep locations prior to receiving a "recommendation" from SRAG on where to sleep.

  5. Rule generation from neural networks

    SciTech Connect

    Fu, L.

    1994-08-01

    The neural network approach has proven useful for the development of artificial intelligence systems. However, a disadvantage with this approach is that the knowledge embedded in the neural network is opaque. In this paper, we show how to interpret neural network knowledge in symbolic form. We lay down required definitions for this treatment, formulate the interpretation algorithm, and formally verify its soundness. The main result is a formalized relationship between a neural network and a rule-based system. In addition, it has been demonstrated that the neural network generates rules of better performance than the decision tree approach in noisy conditions. 7 refs.

  6. Comprehensive Child Welfare Information System. Final rule.

    PubMed

    2016-06-01

    This final rule replaces the Statewide and Tribal Automated Child Welfare Information Systems (S/TACWIS) rule with the Comprehensive Child Welfare Information System (CCWIS) rule. The rule also makes conforming amendments in rules in related requirements. This rule will assist title IV-E agencies in developing information management systems that leverage new innovations and technology in order to better serve children and families. More specifically, this final rule supports the use of cost-effective, innovative technologies to automate the collection of high-quality case management data and to promote its analysis, distribution, and use by workers, supervisors, administrators, researchers, and policy makers.

  7. Parallel machine architecture for production rule systems

    DOEpatents

    Allen, Jr., John D.; Butler, Philip L.

    1989-01-01

    A parallel processing system for production rule programs utilizes a host processor for storing production rule right hand sides (RHS) and a plurality of rule processors for storing left hand sides (LHS). The rule processors operate in parallel in the recognize phase of the system recognize -Act Cycle to match their respective LHS's against a stored list of working memory elements (WME) in order to find a self consistent set of WME's. The list of WME is dynamically varied during the Act phase of the system in which the host executes or fires rule RHS's for those rules for which a self-consistent set has been found by the rule processors. The host transmits instructions for creating or deleting working memory elements as dictated by the rule firings until the rule processors are unable to find any further self-consistent working memory element sets at which time the production rule system is halted.

  8. Optimizing water supply and hydropower reservoir operation rule curves: An imperialist competitive algorithm approach

    NASA Astrophysics Data System (ADS)

    Afshar, Abbas; Emami Skardi, Mohammad J.; Masoumi, Fariborz

    2015-09-01

    Efficient reservoir management requires the implementation of generalized optimal operating policies that manage storage volumes and releases while optimizing a single objective or multiple objectives. Reservoir operating rules stipulate the actions that should be taken under the current state of the system. This study develops a set of piecewise linear operating rule curves for water supply and hydropower reservoirs, employing an imperialist competitive algorithm in a parameterization-simulation-optimization approach. The adaptive penalty method is used for constraint handling and proved to work efficiently in the proposed scheme. Its performance is tested deriving an operation rule for the Dez reservoir in Iran. The proposed modelling scheme converged to near-optimal solutions efficiently in the case examples. It was shown that the proposed optimum piecewise linear rule may perform quite well in reservoir operation optimization as the operating period extends from very short to fairly long periods.

  9. Sparse linear programming subprogram

    SciTech Connect

    Hanson, R.J.; Hiebert, K.L.

    1981-12-01

    This report describes a subprogram, SPLP(), for solving linear programming problems. The package of subprogram units comprising SPLP() is written in Fortran 77. The subprogram SPLP() is intended for problems involving at most a few thousand constraints and variables. The subprograms are written to take advantage of sparsity in the constraint matrix. A very general problem statement is accepted by SPLP(). It allows upper, lower, or no bounds on the variables. Both the primal and dual solutions are returned as output parameters. The package has many optional features. Among them is the ability to save partial results and then use them to continue the computation at a later time.

  10. Ultrasonic linear measurement system

    NASA Technical Reports Server (NTRS)

    Marshall, Scot H. (Inventor)

    1991-01-01

    An ultrasonic linear measurement system uses the travel time of surface waves along the perimeter of a three-dimensional curvilinear body to determine the perimeter of the curvilinear body. The system can also be used piece-wise to measure distances along plane surfaces. The system can be used to measure perimeters where use of laser light, optical means or steel tape would be extremely difficult, time consuming or impossible. It can also be used to determine discontinuities in surfaces of known perimeter or dimension.

  11. [Congenital linear nevus sebaceus].

    PubMed

    Linnemann, Anders; Bygum, Anette; Fenger-Grøn, Jesper

    2011-09-01

    An unusual case of nevus sebaceous is described. Nevus sebaceous is a congenital epidermal hamartoma of the skin and the predilection site is the head or neck. In this case the nevus followed the lines of Blaschko along the back of the left lower extremity. The linear lesion seemed papulovesicular which caused suspicion of incontinentia pigmenti or infection, and the boy received antimicrobial treatment until a biopsy revealed the correct diagnosis. We wish to emphasize this clinical picture to spare the patient and relatives from unnecessary tests, treatment and concern. PMID:21893006

  12. Lead screw linear actuator

    NASA Technical Reports Server (NTRS)

    Perkins, Gerald S. (Inventor)

    1980-01-01

    A linear actuator which can apply high forces is described, which includes a reciprocating rod having a threaded portion engaged by a nut that is directly coupled to the rotor of an electric motor. The nut is connected to the rotor in a manner that minimizes loading on the rotor, by the use of a coupling that transmits torque to the nut but permits it to shift axially and radially with respect to the rotor. The nut has a threaded hydrostatic bearing for engaging the threaded rod portion, with an oilcarrying groove in the nut being interrupted.

  13. Induction linear accelerators

    NASA Astrophysics Data System (ADS)

    Birx, Daniel

    1992-03-01

    Among the family of particle accelerators, the Induction Linear Accelerator is the best suited for the acceleration of high current electron beams. Because the electromagnetic radiation used to accelerate the electron beam is not stored in the cavities but is supplied by transmission lines during the beam pulse it is possible to utilize very low Q (typically<10) structures and very large beam pipes. This combination increases the beam breakup limited maximum currents to of order kiloamperes. The micropulse lengths of these machines are measured in 10's of nanoseconds and duty factors as high as 10-4 have been achieved. Until recently the major problem with these machines has been associated with the pulse power drive. Beam currents of kiloamperes and accelerating potentials of megavolts require peak power drives of gigawatts since no energy is stored in the structure. The marriage of liner accelerator technology and nonlinear magnetic compressors has produced some unique capabilities. It now appears possible to produce electron beams with average currents measured in amperes, peak currents in kiloamperes and gradients exceeding 1 MeV/meter, with power efficiencies approaching 50%. The nonlinear magnetic compression technology has replaced the spark gap drivers used on earlier accelerators with state-of-the-art all-solid-state SCR commutated compression chains. The reliability of these machines is now approaching 1010 shot MTBF. In the following paper we will briefly review the historical development of induction linear accelerators and then discuss the design considerations.

  14. Pseudo Linear Gyro Calibration

    NASA Technical Reports Server (NTRS)

    Harman, Richard; Bar-Itzhack, Itzhack Y.

    2003-01-01

    Previous high fidelity onboard attitude algorithms estimated only the spacecraft attitude and gyro bias. The desire to promote spacecraft and ground autonomy and improvements in onboard computing power has spurred development of more sophisticated calibration algorithms. Namely, there is a desire to provide for sensor calibration through calibration parameter estimation onboard the spacecraft as well as autonomous estimation on the ground. Gyro calibration is a particularly challenging area of research. There are a variety of gyro devices available for any prospective mission ranging from inexpensive low fidelity gyros with potentially unstable scale factors to much more expensive extremely stable high fidelity units. Much research has been devoted to designing dedicated estimators such as particular Extended Kalman Filter (EKF) algorithms or Square Root Information Filters. This paper builds upon previous attitude, rate, and specialized gyro parameter estimation work performed with Pseudo Linear Kalman Filter (PSELIKA). The PSELIKA advantage is the use of the standard linear Kalman Filter algorithm. A PSELIKA algorithm for an orthogonal gyro set which includes estimates of attitude, rate, gyro misalignments, gyro scale factors, and gyro bias is developed and tested using simulated and flight data. The measurements PSELIKA uses include gyro and quaternion tracker data.

  15. All Things Out of Rule

    ERIC Educational Resources Information Center

    Gregory, Nuala

    2015-01-01

    This article brings together and compares my own artistic practice of drawing/painting and the eighteenth-century novel "Tristram Shandy." In both cases, there is a free play of lines, textual or graphic, which sets "all things out of rule". A whole typology of lines is woven throughout Sterne's text and reappears,…

  16. The Eighteen-Electron Rule

    ERIC Educational Resources Information Center

    Mitchell, P. R.; Parish, R. V.

    1969-01-01

    Discusses the stability of the structures of transition metal complexes (primarily carbonyls and organometallic compounds) having 18 electrons or less in their valence shell. Presents molecular orbital diagrams for various structures involving alpha and pi bonding and describes the conditions under which the 18 electron rule applies. (RR)

  17. Rule Induction with Extension Matrices.

    ERIC Educational Resources Information Center

    Wu, Xindong

    1998-01-01

    Presents a heuristic, attribute-based, noise-tolerant data mining program, HCV (Version 2.0) based on the newly-developed extension matrix approach. Outlines some techniques implemented in the HCV program for noise handling and discretization of continuous domains; an empirical comparison shows that rules generated by HCV are more compact than the…

  18. Introduction to QCD Sum Rules

    NASA Astrophysics Data System (ADS)

    Dominguez, C. A.

    2013-08-01

    A general, and very basic introduction to QCD sum rules is presented, with emphasis on recent issues to be described at length in other papers in this issue. Collectively, these papers constitute the proceedings of the International Workshop on Determination of the Fundamental Parameters of QCD, Singapore, March 2013.

  19. Seven Rules for Social Research

    ERIC Educational Resources Information Center

    Firebaugh, Glenn

    2008-01-01

    "Seven Rules for Social Research" teaches social scientists how to get the most out of their technical skills and tools, providing a resource that fully describes the strategies and concepts no researcher or student of human behavior can do without. Glenn Firebaugh provides indispensable practical guidance for anyone doing research in the social…

  20. 18 CFR 39.10 - Changes to an Electric Reliability Organization Rule or Regional Entity Rule.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... with the Commission for approval any proposed Electric Reliability Organization Rule or Rule change. A Regional Entity shall submit a Regional Entity Rule or Rule change to the Electric Reliability Organization... or upon complaint, may propose a change to an Electric Reliability Organization Rule or...

  1. 18 CFR 39.10 - Changes to an Electric Reliability Organization Rule or Regional Entity Rule.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... with the Commission for approval any proposed Electric Reliability Organization Rule or Rule change. A Regional Entity shall submit a Regional Entity Rule or Rule change to the Electric Reliability Organization... or upon complaint, may propose a change to an Electric Reliability Organization Rule or...

  2. Stability of an overland flow scheme in the framework of a fully coupled eco-hydrological model based on the Macroscopic Cellular Automata approach

    NASA Astrophysics Data System (ADS)

    Mendicino, Giuseppe; Pedace, Jessica; Senatore, Alfonso

    2015-04-01

    Cellular Automata are often used for modeling the evolution in time of environmental systems mainly because they are directly compatible with parallel programming. Nevertheless, defining the optimal time step criterion for integrating forward in time numerical processes can further enhance model computational efficiency. To this aim, a numerical stability analysis of an original overland flow model, within the framework of a fully coupled eco-hydrological system based on the Macroscopic Cellular Automata paradigm, is performed. According to the other modules of the system describing soil water flow, soil-surface-atmosphere fluxes and vegetation dynamics, overland flow model equations were derived through a direct discrete formulation (i.e. no differential equations were discretized), adopting the diffusion wave model as an approximation of the full De Saint Venant equations and including the capability of accounting for specific processes, such as the increasing roughness effects due to vegetation growth or surface-soil water exchanges. Suitable formulations of robust tools usually applied in the stability analyses, such as Courant-Friedrichs-Lewy and von Neumann conditions, were initially derived for the CA-based overland flow model. Afterwards, the theoretical stability conditions were compared to experimental time step constraints through several numerical simulations of a 5-h rain event. Specifically, adopting a constant (i.e. not adaptive) time step for simulations, and discretizing head losses in a way that increases model stability, experimental upper limits preventing numerical instability were found for 13 test cases with different slopes, precipitation intensities, vegetation densities and depths of surface depressions. Even though von Neumann condition and experimental values were well positively correlated, the latter were almost always sensibly lower, excluding cases when free surface gradients tended to zero. Therefore, based on the original method

  3. Comet LINEAR Splits Further

    NASA Astrophysics Data System (ADS)

    2001-05-01

    Third Nucleus Observed with the VLT Summary New images from the VLT show that one of the two nuclei of Comet LINEAR (C/2001 A2), now about 100 million km from the Earth, has just split into at least two pieces . The three fragments are now moving through space in nearly parallel orbits while they slowly drift apart. This comet will pass through its perihelion (nearest point to the Sun) on May 25, 2001, at a distance of about 116 million kilometres. It has brightened considerably due to the splitting of its "dirty snowball" nucleus and can now be seen with the unaided eye by observers in the southern hemisphere as a faint object in the southern constellation of Lepus (The Hare). PR Photo 18a/01 : Three nuclei of Comet LINEAR . PR Photo 18b/01 : The break-up of Comet LINEAR (false-colour). Comet LINEAR splits and brightens ESO PR Photo 18a/01 ESO PR Photo 18a/01 [Preview - JPEG: 400 x 438 pix - 55k] [Normal - JPEG: 800 x 875 pix - 136k] ESO PR Photo 18b/01 ESO PR Photo 18b/01 [Preview - JPEG: 367 x 400 pix - 112k] [Normal - JPEG: 734 x 800 pix - 272k] Caption : ESO PR Photo 18a/01 shows the three nuclei of Comet LINEAR (C/2001 A2). It is a reproduction of a 1-min exposure in red light, obtained in the early evening of May 16, 2001, with the 8.2-m VLT YEPUN (UT4) telescope at Paranal. ESO PR Photo 18b/01 shows the same image, but in a false-colour rendering for more clarity. The cometary fragment "B" (right) has split into "B1" and "B2" (separation about 1 arcsec, or 500 km) while fragment "A" (upper left) is considerably fainter. Technical information about these photos is available below. Comet LINEAR was discovered on January 3, 2001, and designated by the International Astronomical Union (IAU) as C/2001 A2 (see IAU Circular 7564 [1]). Six weeks ago, it was suddenly observed to brighten (IAUC 7605 [1]). Amateurs all over the world saw the comparatively faint comet reaching naked-eye magnitude and soon thereafter, observations with professional telescopes indicated

  4. On the linear programming bound for linear Lee codes.

    PubMed

    Astola, Helena; Tabus, Ioan

    2016-01-01

    Based on an invariance-type property of the Lee-compositions of a linear Lee code, additional equality constraints can be introduced to the linear programming problem of linear Lee codes. In this paper, we formulate this property in terms of an action of the multiplicative group of the field [Formula: see text] on the set of Lee-compositions. We show some useful properties of certain sums of Lee-numbers, which are the eigenvalues of the Lee association scheme, appearing in the linear programming problem of linear Lee codes. Using the additional equality constraints, we formulate the linear programming problem of linear Lee codes in a very compact form, leading to a fast execution, which allows to efficiently compute the bounds for large parameter values of the linear codes.

  5. Stopping Rules for Turbo Decoders

    NASA Astrophysics Data System (ADS)

    Matache, A.; Dolinar, S.; Pollara, F.

    2000-04-01

    Decoders for turbo codes are iterative in nature, i.e., they have to perform a certain number of iterations before reaching a satisfactory degree of confidence regarding a frame to be decoded. Until now standard turbo decoders have used a fixed number of iterations. In this article, we propose some simple "stopping rules" that can be used to reduce the average number of iterations. This technique offers a trade-off between speed and performance and can provide a significant increase in the average decoding speed while not sacrificing decoder performance. We tested several types of stopping rules for turbo decoders. One type is based on comparing decoded bits (hard bit decisions) with previous decoded bits; a second type is based on comparing reliabilities (soft bit decisions) with a threshold; and a third type uses a cyclic redundancy check (CRC) code applied to hard decoded bits. We simulated turbo decoder performance using these rules (including several variations of t he first two types) and further required that the decoder cease after 20 iterations if the stopping rule is not yet satisfied. Specifically, we analyzed the decoder-error rates and the average number of iterations for each rule. We found that the average number of iterations was roughly between 4 and 7 for a bit signal-to-noise ratio, E_b/N_0, near the "waterfall" threshold, as compared with the 10 fixed iterations used by the current turbo decoder. In addition, the resulting error rates were noticeably lower than those for 10 fixed iterations, and in fact were very nearly equal to the error rates achieved by a decoder using 20 fixed iterations.

  6. Model Checking Linear-Time Properties of Probabilistic Systems

    NASA Astrophysics Data System (ADS)

    Baier, Christel; Größer, Marcus; Ciesinski, Frank

    This chapter is about the verification of Markov decision processes (MDPs) which incorporate one of the fundamental models for reasoning about probabilistic and nondeterministic phenomena in reactive systems. MDPs have their roots in the field of operations research and are nowadays used in a wide variety of areas including verification, robotics, planning, controlling, reinforcement learning, economics and semantics of randomized systems. Furthermore, MDPs served as the basis for the introduction of probabilistic automata which are related to weighted automata. We describe the use of MDPs as an operational model for randomized systems, e.g., systems that employ randomized algorithms, multi-agent systems or systems with unreliable components or surroundings. In this context we outline the theory of verifying ω-regular properties of such operational models. As an integral part of this theory we use ω-automata, i.e., finite-state automata over finite alphabets that accept languages of infinite words. Additionally, basic concepts of important reduction techniques are sketched, namely partial order reduction of MDPs and quotient system reduction of the numerical problem that arises in the verification of MDPs. Furthermore we present several undecidability and decidability results for the controller synthesis problem for partially observable MDPs.

  7. Sum rules for magnetic moments and polarizabilities in QED and chiral effective-field theory

    SciTech Connect

    Barry Holstein; Vladimir Pascalutsa; Marc Vanderhaeghen

    2005-08-01

    We elaborate on a recently proposed extension of the Gerasimov-Drell-Hearn (GDH) sum rule which is achieved by taking derivatives with respect to the anomalous magnetic moment. The new sum rule features a linear relation between the anomalous magnetic moment and the dispersion integral over a cross-section quantity. We find some analogy of the linearized form of the GDH sum rule with the ''sideways dispersion relations''. As an example, we apply the linear sum rule to reproduce the famous Schwinger's correction to the magnetic moment in QED from a tree-level cross-section calculation and outline the procedure for computing the two-loop correction from a one-loop cross-section calculation. The polarizabilities of the electron in QED are considered as well by using the other forward-Compton-scattering sum rules. We also employ the sum rules to study the magnetic moment and polarizabilities of the nucleon in a relativistic chiral EFT framework. In particular we investigate the chiral extrapolation of these quantities.

  8. Molecular design of electron transport with orbital rule: toward conductance-decay free molecular junctions.

    PubMed

    Tada, Tomofumi; Yoshizawa, Kazunari

    2015-12-28

    In this study, we report our viewpoint of single molecular conductance in terms of frontier orbitals. The orbital rule derived from orbital phase and amplitude is a powerful guideline for the qualitative understanding of molecular conductance in both theoretical and experimental studies. The essence of the orbital rule is the phase-related quantum interference, and on the basis of this rule a constructive or destructive pathway for electron transport is easily predicted. We have worked on the construction of the orbital rule for more than ten years and recently found from its application that π-stacked molecular junctions fabricated experimentally are in line with the concept for conductance-decay free junctions. We explain the orbital rule using benzene molecular junctions with the para-, meta- and ortho-connections and discuss linear π-conjugated chains and π-stacked molecular junctions with respect to their small decay factors in this manuscript.

  9. The Born Rule and Time-Reversal Symmetry of Quantum Equations of Motion

    NASA Astrophysics Data System (ADS)

    Ilyin, Aleksey V.

    2016-07-01

    It was repeatedly underlined in literature that quantum mechanics cannot be considered a closed theory if the Born Rule is postulated rather than derived from the first principles. In this work the Born Rule is derived from the time-reversal symmetry of quantum equations of motion. The derivation is based on a simple functional equation that takes into account properties of probability, as well as the linearity and time-reversal symmetry of quantum equations of motion. The derivation presented in this work also allows to determine certain limits to applicability of the Born Rule.

  10. Positrons for linear colliders

    SciTech Connect

    Ecklund, S.

    1987-11-01

    The requirements of a positron source for a linear collider are briefly reviewed, followed by methods of positron production and production of photons by electromagnetic cascade showers. Cross sections for the electromagnetic cascade shower processes of positron-electron pair production and Compton scattering are compared. A program used for Monte Carlo analysis of electromagnetic cascades is briefly discussed, and positron distributions obtained from several runs of the program are discussed. Photons from synchrotron radiation and from channeling are also mentioned briefly, as well as positron collection, transverse focusing techniques, and longitudinal capture. Computer ray tracing is then briefly discussed, followed by space-charge effects and thermal heating and stress due to showers. (LEW)

  11. Non Linear Conjugate Gradient

    2006-11-17

    Software that simulates and inverts electromagnetic field data for subsurface electrical properties (electrical conductivity) of geological media. The software treats data produced by a time harmonic source field excitation arising from the following antenna geometery: loops and grounded bipoles, as well as point electric and magnetic dioples. The inversion process is carried out using a non-linear conjugate gradient optimization scheme, which minimizes the misfit between field data and model data using a least squares criteria.more » The software is an upgrade from the code NLCGCS_MP ver 1.0. The upgrade includes the following components: Incorporation of new 1 D field sourcing routines to more accurately simulate the 3D electromagnetic field for arbitrary geologic& media, treatment for generalized finite length transmitting antenna geometry (antennas with vertical and horizontal component directions). In addition, the software has been upgraded to treat transverse anisotropy in electrical conductivity.« less

  12. Linear response at criticality

    NASA Astrophysics Data System (ADS)

    Svenkeson, Adam; Bologna, Mauro; Grigolini, Paolo

    2012-10-01

    We study a set of cooperatively interacting units at criticality, and we prove with analytical and numerical arguments that they generate the same renewal non-Poisson intermittency as that produced by blinking quantum dots, thereby giving a stronger support to the results of earlier investigation. By analyzing how this out-of-equilibrium system responds to harmonic perturbations, we find that the response can be described only using a new form of linear response theory that accounts for aging and the nonergodic behavior of the underlying process. We connect the undamped response of the system at criticality to the decaying response predicted by the recently established nonergodic fluctuation-dissipation theorem for dichotomous processes using information about the second moment of the fluctuations. We demonstrate that over a wide range of perturbation frequencies the response of the cooperative system is greatest when at criticality.

  13. HEAVY ION LINEAR ACCELERATOR

    DOEpatents

    Van Atta, C.M.; Beringer, R.; Smith, L.

    1959-01-01

    A linear accelerator of heavy ions is described. The basic contributions of the invention consist of a method and apparatus for obtaining high energy particles of an element with an increased charge-to-mass ratio. The method comprises the steps of ionizing the atoms of an element, accelerating the resultant ions to an energy substantially equal to one Mev per nucleon, stripping orbital electrons from the accelerated ions by passing the ions through a curtain of elemental vapor disposed transversely of the path of the ions to provide a second charge-to-mass ratio, and finally accelerating the resultant stripped ions to a final energy of at least ten Mev per nucleon.

  14. Linear Proof Mass Actuator

    NASA Technical Reports Server (NTRS)

    Holloway, Sidney E., III

    1994-01-01

    This paper describes the mechanical design, analysis, fabrication, testing, and lessons learned by developing a uniquely designed spaceflight-like actuator. The linear proof mass actuator (LPMA) was designed to attach to both a large space structure and a ground test model without modification. Previous designs lacked the power to perform in a terrestrial environment while other designs failed to produce the desired accelerations or frequency range for spaceflight applications. Thus, the design for a unique actuator was conceived and developed at NASA Langley Research Center. The basic design consists of four large mechanical parts (mass, upper housing, lower housing, and center support) and numerous smaller supporting components including an accelerometer, encoder, and four drive motors. Fabrication personnel were included early in the design phase of the LPMA as part of an integrated manufacturing process to alleviate potential difficulties in machining an already challenging design. Operating testing of the LPMA demonstrated that the actuator is capable of various types of load functions.

  15. Linear Proof Mass Actuator

    NASA Technical Reports Server (NTRS)

    Holloway, S. E., III

    1995-01-01

    This paper describes the mechanical design, analysis, fabrication, testing, and lessons learned by developing a uniquely designed spaceflight-like actuator. The Linear Proof Mass Actuator (LPMA) was designed to attach to both a large space structure and a ground test model without modification. Previous designs lacked the power to perform in a terrestrial environment while other designs failed to produce the desired accelerations or frequency range for spaceflight applications. Thus, the design for a unique actuator was conceived and developed at NASA Langley Research Center. The basic design consists of four large mechanical parts (Mass, Upper Housing, Lower Housing, and Center Support) and numerous smaller supporting components including an accelerometer, encoder, and four drive motors. Fabrication personnel were included early in the design phase of the LPMA as part of an integrated manufacturing process to alleviate potential difficulties in machining an already challenging design. Operational testing of the LPMA demonstrated that the actuator is capable of various types of load functions.

  16. Computer Program For Linear Algebra

    NASA Technical Reports Server (NTRS)

    Krogh, F. T.; Hanson, R. J.

    1987-01-01

    Collection of routines provided for basic vector operations. Basic Linear Algebra Subprogram (BLAS) library is collection from FORTRAN-callable routines for employing standard techniques to perform basic operations of numerical linear algebra.

  17. Exploration of SWRL Rule Bases through Visualization, Paraphrasing, and Categorization of Rules

    NASA Astrophysics Data System (ADS)

    Hassanpour, Saeed; O'Connor, Martin J.; Das, Amar K.

    Rule bases are increasingly being used as repositories of knowledge content on the Semantic Web. As the size and complexity of these rule bases increases, developers and end users need methods of rule abstraction to facilitate rule management. In this paper, we describe a rule abstraction method for Semantic Web Rule Language (SWRL) rules that is based on lexical analysis and a set of heuristics. Our method results in a tree data structure that we exploit in creating techniques to visualize, paraphrase, and categorize SWRL rules. We evaluate our approach by applying it to several biomedical ontologies that contain SWRL rules, and show how the results reveal rule patterns within the rule base. We have implemented our method as a plug-in tool for Protégé-OWL, the most widely used ontology modeling software for the Semantic Web. Our tool can allow users to rapidly explore content and patterns in SWRL rule bases, enabling their acquisition and management.

  18. Uncertainties drive arsenic rule delay

    SciTech Connect

    Pontius, F.W.

    1995-04-01

    The US Environmental Protection Agency (USEPA) is under court order to sign a proposed rule for arsenic by Nov. 30, 1995. The agency recently announced that it will not meet this deadline, citing the need to gather additional information. Development of a National Interim Primary Drinking Water Regulation for arsenic has been delayed several times over the past 10 years because of uncertainties regarding health issues and costs associated with compliance. The early history of development of the arsenic rule has been reviewed. Only recent developments are reviewed here. The current maximum contaminant level (MCL) for arsenic in drinking water is 0.05 mg/L. This MCL was set in 1975, based on the 1962 US Public Health Standards. The current Safe Drinking Water Act (SDWA) requires that the revised arsenic MCL be set as close to the MCL goal (MCLG) as is feasible using best technology, treatment techniques, or other means and taking cost into consideration.

  19. Passive acquisition of CLIPS rules

    NASA Technical Reports Server (NTRS)

    Kovarik, Vincent J., Jr.

    1991-01-01

    The automated acquisition of knowledge by machine has not lived up to expectations, and knowledge engineering remains a human intensive task. Part of the reason for the lack of success is the difference in the cognitive focus of the expert. The expert must shift his or her focus from the subject domain to that of the representation environment. In doing so this cognitive shift introduces opportunity for errors and omissions. Presented here is work that observes the expert interact with a simulation of the domain. The system logs changes in the simulation objects and the expert's actions in response to those changes. This is followed by the application of inductive reasoning to move the domain specific rules observed to general domain rules.

  20. EPA rule could cut pollutants

    NASA Astrophysics Data System (ADS)

    Showstack, Randy

    The U.S. Environmental Protection Agency issued a rule on November 14 that it claims could nearly eliminate dioxin discharges into waterways and reduce other toxic pollutants into the air and water from 155 pulp and paper mills.EPA estimates that results will include a 96% reduction in dioxin and a nearly 60% reduction in toxic air pollutants. Also, volatile organic compounds and sulfur emissions could be cut in half, with particulate matter cut by 37%.

  1. LINEAR - DERIVATION AND DEFINITION OF A LINEAR AIRCRAFT MODEL

    NASA Technical Reports Server (NTRS)

    Duke, E. L.

    1994-01-01

    The Derivation and Definition of a Linear Model program, LINEAR, provides the user with a powerful and flexible tool for the linearization of aircraft aerodynamic models. LINEAR was developed to provide a standard, documented, and verified tool to derive linear models for aircraft stability analysis and control law design. Linear system models define the aircraft system in the neighborhood of an analysis point and are determined by the linearization of the nonlinear equations defining vehicle dynamics and sensors. LINEAR numerically determines a linear system model using nonlinear equations of motion and a user supplied linear or nonlinear aerodynamic model. The nonlinear equations of motion used are six-degree-of-freedom equations with stationary atmosphere and flat, nonrotating earth assumptions. LINEAR is capable of extracting both linearized engine effects, such as net thrust, torque, and gyroscopic effects and including these effects in the linear system model. The point at which this linear model is defined is determined either by completely specifying the state and control variables, or by specifying an analysis point on a trajectory and directing the program to determine the control variables and the remaining state variables. The system model determined by LINEAR consists of matrices for both the state and observation equations. The program has been designed to provide easy selection of state, control, and observation variables to be used in a particular model. Thus, the order of the system model is completely under user control. Further, the program provides the flexibility of allowing alternate formulations of both the state and observation equations. Data describing the aircraft and the test case is input to the program through a terminal or formatted data files. All data can be modified interactively from case to case. The aerodynamic model can be defined in two ways: a set of nondimensional stability and control derivatives for the flight point of

  2. Generalized Linear Covariance Analysis

    NASA Astrophysics Data System (ADS)

    Markley, F. Landis; Carpenter, J. Russell

    2009-01-01

    This paper presents a comprehensive approach to filter modeling for generalized covariance analysis of both batch least-squares and sequential estimators. We review and extend in two directions the results of prior work that allowed for partitioning of the state space into "solve-for" and "consider" parameters, accounted for differences between the formal values and the true values of the measurement noise, process noise, and a priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and a priori solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator's epoch time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the "variance sandpile" and the "sensitivity mosaic," and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.

  3. Generalized Linear Covariance Analysis

    NASA Technical Reports Server (NTRS)

    Carpenter, James R.; Markley, F. Landis

    2014-01-01

    This talk presents a comprehensive approach to filter modeling for generalized covariance analysis of both batch least-squares and sequential estimators. We review and extend in two directions the results of prior work that allowed for partitioning of the state space into solve-for'' and consider'' parameters, accounted for differences between the formal values and the true values of the measurement noise, process noise, and textita priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator's epoch time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the variance sandpile'' and the sensitivity mosaic,'' and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.

  4. Winding for linear pump

    DOEpatents

    Kliman, Gerald B.; Brynsvold, Glen V.; Jahns, Thomas M.

    1989-01-01

    A winding and method of winding for a submersible linear pump for pumping liquid sodium is disclosed. The pump includes a stator having a central cylindrical duct preferably vertically aligned. The central vertical duct is surrounded by a system of coils in slots. These slots are interleaved with magnetic flux conducting elements, these magnetic flux conducting elements forming a continuous magnetic field conduction path along the stator. The central duct has placed therein a cylindrical magnetic conducting core, this core having a cylindrical diameter less than the diameter of the cylindrical duct. The core once placed to the duct defines a cylindrical interstitial pumping volume of the pump. This cylindrical interstitial pumping volume preferably defines an inlet at the bottom of the pump, and an outlet at the top of the pump. Pump operation occurs by static windings in the outer stator sequentially conveying toroidal fields from the pump inlet at the bottom of the pump to the pump outlet at the top of the pump. The winding apparatus and method of winding disclosed uses multiple slots per pole per phase with parallel winding legs on each phase equal to or less than the number of slots per pole per phase. The slot sequence per pole per phase is chosen to equalize the variations in flux density of the pump sodium as it passes into the pump at the pump inlet with little or no flux and acquires magnetic flux in passage through the pump to the pump outlet.

  5. Winding for linear pump

    DOEpatents

    Kliman, G.B.; Brynsvold, G.V.; Jahns, T.M.

    1989-08-22

    A winding and method of winding for a submersible linear pump for pumping liquid sodium are disclosed. The pump includes a stator having a central cylindrical duct preferably vertically aligned. The central vertical duct is surrounded by a system of coils in slots. These slots are interleaved with magnetic flux conducting elements, these magnetic flux conducting elements forming a continuous magnetic field conduction path along the stator. The central duct has placed therein a cylindrical magnetic conducting core, this core having a cylindrical diameter less than the diameter of the cylindrical duct. The core once placed to the duct defines a cylindrical interstitial pumping volume of the pump. This cylindrical interstitial pumping volume preferably defines an inlet at the bottom of the pump, and an outlet at the top of the pump. Pump operation occurs by static windings in the outer stator sequentially conveying toroidal fields from the pump inlet at the bottom of the pump to the pump outlet at the top of the pump. The winding apparatus and method of winding disclosed uses multiple slots per pole per phase with parallel winding legs on each phase equal to or less than the number of slots per pole per phase. The slot sequence per pole per phase is chosen to equalize the variations in flux density of the pump sodium as it passes into the pump at the pump inlet with little or no flux and acquires magnetic flux in passage through the pump to the pump outlet. 4 figs.

  6. Linear induction pump

    DOEpatents

    Meisner, John W.; Moore, Robert M.; Bienvenue, Louis L.

    1985-03-19

    Electromagnetic linear induction pump for liquid metal which includes a unitary pump duct. The duct comprises two substantially flat parallel spaced-apart wall members, one being located above the other and two parallel opposing side members interconnecting the wall members. Located within the duct are a plurality of web members interconnecting the wall members and extending parallel to the side members whereby the wall members, side members and web members define a plurality of fluid passageways, each of the fluid passageways having substantially the same cross-sectional flow area. Attached to an outer surface of each side member is an electrically conductive end bar for the passage of an induced current therethrough. A multi-phase, electrical stator is located adjacent each of the wall members. The duct, stators, and end bars are enclosed in a housing which is provided with an inlet and outlet in fluid communication with opposite ends of the fluid passageways in the pump duct. In accordance with a preferred embodiment, the inlet and outlet includes a transition means which provides for a transition from a round cross-sectional flow path to a substantially rectangular cross-sectional flow path defined by the pump duct.

  7. Generalized Linear Covariance Analysis

    NASA Technical Reports Server (NTRS)

    Carpenter, J. Russell; Markley, F. Landis

    2008-01-01

    We review and extend in two directions the results of prior work on generalized covariance analysis methods. This prior work allowed for partitioning of the state space into "solve-for" and "consider" parameters, allowed for differences between the formal values and the true values of the measurement noise, process noise, and a priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and a priori solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator s anchor time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the "variance sandpile" and the "sensitivity mosaic," and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.

  8. Global Linear Instability

    NASA Astrophysics Data System (ADS)

    Theofilis, Vassilios

    2011-01-01

    This article reviews linear instability analysis of flows over or through complex two-dimensional (2D) and 3D geometries. In the three decades since it first appeared in the literature, global instability analysis, based on the solution of the multidimensional eigenvalue and/or initial value problem, is continuously broadening both in scope and in depth. To date it has dealt successfully with a wide range of applications arising in aerospace engineering, physiological flows, food processing, and nuclear-reactor safety. In recent years, nonmodal analysis has complemented the more traditional modal approach and increased knowledge of flow instability physics. Recent highlights delivered by the application of either modal or nonmodal global analysis are briefly discussed. A conscious effort is made to demystify both the tools currently utilized and the jargon employed to describe them, demonstrating the simplicity of the analysis. Hopefully this will provide new impulses for the creation of next-generation algorithms capable of coping with the main open research areas in which step-change progress can be expected by the application of the theory: instability analysis of fully inhomogeneous, 3D flows and control thereof.

  9. Berkeley Proton Linear Accelerator

    DOE R&D Accomplishments Database

    Alvarez, L. W.; Bradner, H.; Franck, J.; Gordon, H.; Gow, J. D.; Marshall, L. C.; Oppenheimer, F. F.; Panofsky, W. K. H.; Richman, C.; Woodyard, J. R.

    1953-10-13

    A linear accelerator, which increases the energy of protons from a 4 Mev Van de Graaff injector, to a final energy of 31.5 Mev, has been constructed. The accelerator consists of a cavity 40 feet long and 39 inches in diameter, excited at resonance in a longitudinal electric mode with a radio-frequency power of about 2.2 x 10{sup 6} watts peak at 202.5 mc. Acceleration is made possible by the introduction of 46 axial "drift tubes" into the cavity, which is designed such that the particles traverse the distance between the centers of successive tubes in one cycle of the r.f. power. The protons are longitudinally stable as in the synchrotron, and are stabilized transversely by the action of converging fields produced by focusing grids. The electrical cavity is constructed like an inverted airplane fuselage and is supported in a vacuum tank. Power is supplied by 9 high powered oscillators fed from a pulse generator of the artificial transmission line type.

  10. Statistical inference of static analysis rules

    NASA Technical Reports Server (NTRS)

    Engler, Dawson Richards (Inventor)

    2009-01-01

    Various apparatus and methods are disclosed for identifying errors in program code. Respective numbers of observances of at least one correctness rule by different code instances that relate to the at least one correctness rule are counted in the program code. Each code instance has an associated counted number of observances of the correctness rule by the code instance. Also counted are respective numbers of violations of the correctness rule by different code instances that relate to the correctness rule. Each code instance has an associated counted number of violations of the correctness rule by the code instance. A respective likelihood of the validity is determined for each code instance as a function of the counted number of observances and counted number of violations. The likelihood of validity indicates a relative likelihood that a related code instance is required to observe the correctness rule. The violations may be output in order of the likelihood of validity of a violated correctness rule.

  11. Abegg, Lewis, Langmuir, and the Octet Rule.

    ERIC Educational Resources Information Center

    Jensen, William B.

    1984-01-01

    Discusses major events leading to the development of the octet rule. Three conclusions based on the work of Mendeleev, Abegg, Thompson, Kossel, Lewis, and Langmuir are considered as is the debate over the rule's validity. (JN)

  12. 7 CFR 29.1132 - Rule 26.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... INSPECTION Standards Rules § 29.1132 Rule 26. Tobacco that contains a moderate amount of dirt or sand, but... from the Primings group, shall be designated by placing the special factor, “dirt” or “sand” after...

  13. Autonomous Rule Creation for Intrusion Detection

    SciTech Connect

    Todd Vollmer; Jim Alves-Foss; Milos Manic

    2011-04-01

    Many computational intelligence techniques for anomaly based network intrusion detection can be found in literature. Translating a newly discovered intrusion recognition criteria into a distributable rule can be a human intensive effort. This paper explores a multi-modal genetic algorithm solution for autonomous rule creation. This algorithm focuses on the process of creating rules once an intrusion has been identified, rather than the evolution of rules to provide a solution for intrusion detection. The algorithm was demonstrated on anomalous ICMP network packets (input) and Snort rules (output of the algorithm). Output rules were sorted according to a fitness value and any duplicates were removed. The experimental results on ten test cases demonstrated a 100 percent rule alert rate. Out of 33,804 test packets 3 produced false positives. Each test case produced a minimum of three rule variations that could be used as candidates for a production system.

  14. Significant Figure Rules for General Arithmetic Functions.

    ERIC Educational Resources Information Center

    Graham, D. M.

    1989-01-01

    Provides some significant figure rules used in chemistry including the general theoretical basis; logarithms and antilogarithms; exponentiation (with exactly known exponents); sines and cosines; and the extreme value rule. (YP)

  15. 49 CFR 365.301 - Applicable rules.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... Transportation Other Regulations Relating to Transportation (Continued) FEDERAL MOTOR CARRIER SAFETY ADMINISTRATION, DEPARTMENT OF TRANSPORTATION FEDERAL MOTOR CARRIER SAFETY REGULATIONS RULES GOVERNING APPLICATIONS FOR OPERATING AUTHORITY General Rules Governing the Application Process § 365.301 Applicable...

  16. 77 FR 52313 - Notice of Scope Rulings

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-08-29

    ....225(o). \\2\\ See Notice of Scope Rulings, 77 FR 50084 (August 20, 2012). Scope Rulings Completed... 30, 2012. See Notice of Scope Rulings, 77 FR at 50085. The notice should have indicated that the... the People's Republic of China Requestor: HSE USA, Inc.; its religious cross with Jesus series...

  17. 7 CFR 29.3618 - Rule 17.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... 7 Agriculture 2 2010-01-01 2010-01-01 false Rule 17. 29.3618 Section 29.3618 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... INSPECTION Standards Rules § 29.3618 Rule 17. Any lot of tobacco which is not green but contains over...

  18. Error Analysis of Quadrature Rules. Classroom Notes

    ERIC Educational Resources Information Center

    Glaister, P.

    2004-01-01

    Approaches to the determination of the error in numerical quadrature rules are discussed and compared. This article considers the problem of the determination of errors in numerical quadrature rules, taking Simpson's rule as the principal example. It suggests an approach based on truncation error analysis of numerical schemes for differential…

  19. 75 FR 41987 - Inland Navigation Rules; Correction

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-07-20

    ...-1565 Scott.R.Medeiros@uscg.mil . SUPPLEMENTARY INFORMATION: In FR doc 2010-8532 appearing on page 20294... SECURITY Coast Guard 33 CFR Part 100 RIN 1625-AB43 Inland Navigation Rules; Correction ACTION: Final rule... Navigation Rules into the Code of Federal Regulations. That publication contained an error in...

  20. 14 CFR 437.39 - Flight rules.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 14 Aeronautics and Space 4 2011-01-01 2011-01-01 false Flight rules. 437.39 Section 437.39 Aeronautics and Space COMMERCIAL SPACE TRANSPORTATION, FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF... Documentation § 437.39 Flight rules. An applicant must provide flight rules as required by § 437.71....