Reversible quantum cellular automata
Schumacher, B
2004-01-01
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions this allows us to give an explicit characterization of all local rules generating such automata. The same local rules also generate the global time step for automata with periodic boundary conditions. Our main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitary operations in a generalized Margolus partitioning scheme. This implies that, in contrast to the classical case, the inverse of a nearest neighbor quantum cellular automaton is again a nearest neighbor automaton. We present several construction methods for quantum cellular automata, based on unitaries commuting with their translates, on the quantization of (arbitrary) reversible classical cellular automata, on quantum c...
Exploring Quantum Dot Cellular Automata Based Reversible Circuit
Directory of Open Access Journals (Sweden)
Saroj Kumar Chandra
2012-03-01
Full Text Available Quantum-dot Cellular Automata (QCA is a new technology for development of logic circuits based on nanotechnology, and it is an one of the alternative for designing high performance computing over existing CMOS technology. The basic logic in QCA does not use voltage level for logic representation rather it represent binary state by polarization of electrons on the Quantum Cell which is basic building block of QCA. Extensive work is going on QCA for circuit design due to low power consumption and regularity in the circuit.. Clocking is used in QCA circuit to synchronize and control the information flow and to provide the power to run the circuit. Reversible logic design is a well-known paradigm in digital computation, and if circuit developed is reversible then it consumes very low power . Here, in this paper we are presenting a Reversible Universal Gate (RUG based on Quantum-dot Cellular Automata (QCA. The RUG implemented by QCA Designer tool and also its behavior is simulated by it.
Exploring Quantum Dot Cellular Automata Based Reversible Circuit
Directory of Open Access Journals (Sweden)
Saroj Kumar Chandra
2012-03-01
Full Text Available Quantum-dot Cellular Automata (QCA is a new technology for development of logic circuits based on nanotechnology, and it is an one of the alternative for designing high performance computing over existing CMOS technology. The basic logic in QCA does not use voltage level for logic representation rather it represent binary state by polarization of electrons on the Quantum Cell which is basic building block of QCA. Extensive work is going on QCA for circuit design due to low power consumption and regularity in the circuit.. Clocking is used in QCA circuit to synchronize and control the information flow and to provide the power to run the circuit. Reversible logic design is a well-known paradigm in digital computation, and if circuit developed is reversible then it consumes very low power. Here, in this paper we are presenting a Reversible Universal Gate (RUG based on Quantum-dot Cellular Automata (QCA. The RUG implemented by QCA Designer tool and also its behavior is simulated by it.
Energy dissipation dataset for reversible logic gates in quantum dot-cellular automata.
Bahar, Ali Newaz; Rahman, Mohammad Maksudur; Nahid, Nur Mohammad; Hassan, Md Kamrul
2017-02-01
This paper presents an energy dissipation dataset of different reversible logic gates in quantum-dot cellular automata. The proposed circuits have been designed and verified using QCADesigner simulator. Besides, the energy dissipation has been calculated under three different tunneling energy level at temperature T=2 K. For estimating the energy dissipation of proposed gates; QCAPro tool has been employed.
A Novel Design of Half Subtractor using Reversible Feynman Gate in Quantum Dot cellular Automata
Directory of Open Access Journals (Sweden)
Rubina Akter
2014-12-01
Full Text Available Quantum Dot cellular Automata (QCA is an emerging, promising alternative to CMOS technology that performs its task by encoding binary information on electronic charge configuration of a cell. All circuit based on QCA has an advantages of high speed, high parallel processing, high integrityand low power consumption. Reversible logic gates are the leading part in Quantum Dot cellular Automata. Reversible logic gates have an extensive feature that does not lose information. In this paper, we present a novel architecture of half subtractor gate design by reversible Feynman gate. This circuit is designedbased on QCA logic gates such as QCA majority voter gate, majority AND gate, majority OR gate and inverter gate. This circuit will provide an effective working efficiency on computational units of the digital circuit system.
Energy dissipation dataset for reversible logic gates in quantum dot-cellular automata
Directory of Open Access Journals (Sweden)
Ali Newaz Bahar
2017-02-01
Full Text Available This paper presents an energy dissipation dataset of different reversible logic gates in quantum-dot cellular automata. The proposed circuits have been designed and verified using QCADesigner simulator. Besides, the energy dissipation has been calculated under three different tunneling energy level at temperature T=2 K. For estimating the energy dissipation of proposed gates; QCAPro tool has been employed.
Baianu,I C
2004-01-01
The concepts of quantum automata and quantum computation are studied in the context of quantum genetics and genetic networks with nonlinear dynamics. In previous publications (Baianu,1971a, b) the formal concept of quantum automaton and quantum computation, respectively, were introduced and their possible implications for genetic processes and metabolic activities in living cells and organisms were considered. This was followed by a report on quantum and abstract, symbolic computation based on the theory of categories, functors and natural transformations (Baianu,1971b; 1977; 1987; 2004; Baianu et al, 2004). The notions of topological semigroup, quantum automaton, or quantum computer, were then suggested with a view to their potential applications to the analogous simulation of biological systems, and especially genetic activities and nonlinear dynamics in genetic networks. Further, detailed studies of nonlinear dynamics in genetic networks were carried out in categories of n-valued, Lukasiewicz Logic Algebra...
Directory of Open Access Journals (Sweden)
Ahmed Moustafa
2015-01-01
Full Text Available 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.
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.
Quantum Finite Automata and Weighted Automata
Rao, M V P
2007-01-01
Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular interest is the 2-way model of Ambainis and Watrous that has both quantum and classical states (2QCFA) [A. Ambainis and J. Watrous, Two-way finite automata with quantum and classical state, Theoretical Computer Science, 287(1), pp. 299-311, 2002], since it combines the advantage of the power of interference in a constant-sized quantum system with a 2-way head. This paper is a step towards finding the least powerful model which is purely classical and can mimic the dynamics of quantum phase. We consider weighted automata with the Cortes-Mohri definition of language recognition [C. Cortes and M. Mohri, Context-Free Recognition with Weighted Automata, Grammars 3(2/3), pp. 133-150, 2000] as a candidate model for simulating 2QCFA. Given any 2QCFA that (i) uses the accept-reject-continue observable, (ii) recognizes a language with one-sided error and (iii) the entries of whose unitary mat...
Quantum features of natural cellular automata
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.
Quantum features of natural cellular automata
Elze, Hans-Thomas
2016-01-01
Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schroedinger equation. This includes corresponding conservation laws. The class of "natural" Hamiltonian cellular automata is based exclusively on integer-valued variables and couplings and their dynamics derives from an Action Principle. They can be mapped reversibly to continuum models by applying Sampling Theory. Thus, "deformed" quantum mechanical models with a finite discreteness scale $l$ are obtained, which for $l\\rightarrow 0$ reproduce familiar continuum results. We have recently demonstrated that such automata can form "multipartite" systems consistently with the tensor product structures of nonrelativistic many-body quantum mechanics, while interacting and maintaining the linear evolution. Consequently, the Superposition Principle fully applies for such primitive discrete deterministic automata and their composites and can produce...
Say, A C Cem
2011-01-01
The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA. This is the first demonstration of the superiority of a quantum model to the corresponding classical one in the real-time case with an error bound less than 1. We also introduce a generalization of the rtQ1CA, the quantum one-way one-counter automaton (1Q1CA), and show that they too are superior to the corresponding family of probabilistic machines. For this purpose, we provide general definitions of these models that reflect the modern approach to the definition of quantum finite automata, and point out some problems with previous results. We identify several remaining open problems.
Institute of Scientific and Technical Information of China (English)
Jadav Chandra DAS; Debashis DE
2016-01-01
Quantum-dot cellular automata (QCA) is an emerging area of research in reversible computing. It can be used to design nanoscale circuits. In nanocommunication, the detection and correction of errors in a received message is a major factor. Besides, device density and power dissipation are the key issues in the nanocommunication architecture. For the first time, QCA-based designs of the reversible low-power odd parity generator and odd parity checker using the Feynman gate have been achieved in this study. Using the proposed parity generator and parity checker circuit, a nanocommunication architecture is pro-posed. The detection of errors in the received message during transmission is also explored. The proposed QCA Feynman gate outshines the existing ones in terms of area, cell count, and delay. The quantum costs of the proposed conventional reversible circuits and their QCA layouts are calculated and compared, which establishes that the proposed QCA circuits have very low quantum cost compared to conventional designs. The energy dissipation by the layouts is estimated, which ensures the possibility of QCA nano-device serving as an alternative platform for the implementation of reversible circuits. The stability of the proposed circuits under thermal randomness is analyzed, showing the operational efficiency of the circuits. The simulation results of the proposed design are tested with theoretical values, showing the accuracy of the circuits. The proposed circuits can be used to design more complex low-power nanoscale lossless nanocommunication architecture such as nano-transmitters and nano-receivers.
Reversible multi-head finite automata characterize reversible logarithmic space
DEFF Research Database (Denmark)
Axelsen, Holger Bock
2012-01-01
Deterministic and non-deterministic multi-head finite automata are known to characterize the deterministic and non- deterministic logarithmic space complexity classes, respectively. Recently, Morita introduced reversible multi-head finite automata (RMFAs), and posed the question of whether RMFAs...... characterize reversible logarithmic space as well. Here, we resolve the question affirmatively, by exhibiting a clean RMFA simulation of logarithmic space reversible Turing machines. Indirectly, this also proves that reversible and deterministic multi-head finite automata recognize the same languages....
An overview of quantum computation models: quantum automata
Institute of Scientific and Technical Information of China (English)
2008-01-01
Quantum automata,as theoretical models of quantum computers,include quantum finite automata (QFA),quantum sequential machines (QSM),quantum pushdown automata (QPDA),quantum Turing machines (QTM),quantum cellular automata (QCA),and the others,for example,automata theory based on quantum logic (orthomodular lattice-valued automata).In this paper,we try to outline a basic progress in the research on these models,focusing on QFA,QSM,QPDA,QTM,and orthomodular lattice-valued automata.Also,other models closely relative to them are mentioned.In particular,based on the existing results in the literature,we finally address a number of problems to be studied in future.
Characterizations of 1-Way Quantum Finite Automata
Brodsky, A; Brodsky, Alex; Pippenger, Nicholas
1999-01-01
The 2-way quantum finite automaton introduced by Kondacs and Watrous can accept non-regular languages with bounded error in polynomial time. If we restrict the head of the automaton to moving classically and to moving only in one direction, the acceptance power of this 1-way quantum finite automaton is reduced to a proper subset of the regular languages. In this paper we study two different models of 1-way quantum finite automata. The first model, termed measure-once quantum finite automata, was introduced by Moore and Crutchfield, and the second model, termed measure-many quantum finite automata, was introduced by Kondacs and Watrous. We characterize the measure-once model when it is restricted to accepting with bounded error and show that, without that restriction, it can solve the word problem over the free group. We also show that it can be simulated by a probabilistic finite automaton and describe an algorithm that determines if two measure-once automata are equivalent. We prove several closure propertie...
Probabilistic and quantum finite automata with postselection
Yakaryilmaz, Abuzer
2011-01-01
We prove that endowing a real-time probabilistic or quantum computer with the ability of postselection increases its computational power. For this purpose, we provide a new model of finite automata with postselection, and compare it with the model of L\\={a}ce et al. We examine the related language classes, and also establish separations between the classical and quantum versions, and between the zero-error vs. bounded-error modes of recognition in this model.
Dominant Strategies of Quantum Games on Quantum Periodic Automata
Directory of Open Access Journals (Sweden)
Konstantinos Giannakis
2015-11-01
Full Text Available Game theory and its quantum extension apply in numerous fields that affect people’s social, political, and economical life. Physical limits imposed by the current technology used in computing architectures (e.g., circuit size give rise to the need for novel mechanisms, such as quantum inspired computation. Elements from quantum computation and mechanics combined with game-theoretic aspects of computing could open new pathways towards the future technological era. This paper associates dominant strategies of repeated quantum games with quantum automata that recognize infinite periodic inputs. As a reference, we used the PQ-PENNY quantum game where the quantum strategy outplays the choice of pure or mixed strategy with probability 1 and therefore the associated quantum automaton accepts with probability 1. We also propose a novel game played on the evolution of an automaton, where players’ actions and strategies are also associated with periodic quantum automata.
Quantum cellular automata and free quantum field theory
D'Ariano, Giacomo Mauro; Perinotti, Paolo
2017-02-01
In a series of recent papers [1-4] it has been shown how free quantum field theory can be derived without using mechanical primitives (including space-time, special relativity, quantization rules, etc.), but only considering the easiest quantum algorithm encompassing a countable set of quantum systems whose network of interactions satisfies the simple principles of unitarity, homogeneity, locality, and isotropy. This has opened the route to extending the axiomatic information-theoretic derivation of the quantum theory of abstract systems [5, 6] to include quantum field theory. The inherent discrete nature of the informational axiomatization leads to an extension of quantum field theory to a quantum cellular automata theory, where the usual field theory is recovered in a regime where the discrete structure of the automata cannot be probed. A simple heuristic argument sets the scale of discreteness to the Planck scale, and the customary physical regime where discreteness is not visible is the relativistic one of small wavevectors. In this paper we provide a thorough derivation from principles that in the most general case the graph of the quantum cellular automaton is the Cayley graph of a finitely presented group, and showing how for the case corresponding to Euclidean emergent space (where the group resorts to an Abelian one) the automata leads to Weyl, Dirac and Maxwell field dynamics in the relativistic limit. We conclude with some perspectives towards the more general scenario of non-linear automata for interacting quantum field theory.
An algebraic study of unitary one dimensional quantum cellular automata
Arrighi, P
2005-01-01
We provide algebraic characterizations of unitary one dimensional quantum cellular automata. We do so both by algebraizing existing decision procedures, and by adding constraints into the model which do not change the quantum cellular automata's computational power. The configurations we consider have finite but unbounded size.
Free Quantum Field Theory from Quantum Cellular Automata
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).
An Application of Quantum Finite Automata to Interactive Proof Systems
Nishimura, H; Nishimura, Harumichi; Yamakami, Tomoyuki
2004-01-01
Quantum finite automata have been studied intensively since their introduction in late 1990s as a natural model of a quantum computer with finite-dimensional quantum memory space. This paper seeks their direct application to interactive proof systems in which a mighty quantum prover communicates with a quantum-automaton verifier through a common communication cell. Our quantum interactive proof systems are juxtaposed to Dwork-Stockmeyer's classical interactive proof systems whose verifiers are two-way probabilistic automata. We demonstrate strengths and weaknesses of our systems and further study how various restrictions on the behaviors of quantum-automaton verifiers affect the power of quantum interactive proof systems.
Noisy Quantum Cellular Automata for Quantum versus Classical Excitation Transfer
Avalle, Michele; Serafini, Alessio
2014-05-01
We introduce a class of noisy quantum cellular automata on a qubit lattice that includes all classical Markov chains, as well as maps where quantum coherence between sites is allowed to build up over time. We apply such a construction to the problem of excitation transfer through 1D lattices, and compare the performance of classical and quantum dynamics with equal local transition probabilities. Our discrete approach has the merits of stripping down the complications of the open system dynamics, of clearly isolating coherent effects, and of allowing for an exact treatment of conditional dynamics, all while capturing a rich variety of dynamical behaviors.
Partitioned quantum cellular automata are intrinsically universal
Arrighi, Pablo
2010-01-01
There have been several non-axiomatic approaches taken to define Quantum Cellular Automata (QCA). Partitioned QCA (PQCA) are the most canonical of these non-axiomatic definitions. In this work we show that any QCA can be put into the form of a PQCA. Our construction reconciles all the non-axiomatic definitions of QCA, showing that they can all simulate one another, and hence that they are all equivalent to the axiomatic definition. This is achieved by defining generalised n-dimensional intrinsic simulation, which brings the computer science based concepts of simulation and universality closer to theoretical physics. The result is not only an important simplification of the QCA model, it also plays a key role in the identification of a minimal n-dimensional intrinsically universal QCA.
Quantum state transfer through noisy quantum cellular automata
Avalle, Michele; Genoni, Marco G.; Serafini, Alessio
2015-05-01
We model the transport of an unknown quantum state on one dimensional qubit lattices by means of a quantum cellular automata (QCA) evolution. We do this by first introducing a class of discrete noisy dynamics, in the first excitation sector, in which a wide group of classical stochastic dynamics is embedded within the more general formalism of quantum operations. We then extend the Hilbert space of the system to accommodate a global vacuum state, thus allowing for the transport of initial on-site coherences besides excitations, and determine the dynamical constraints that define the class of noisy QCA in this subspace. We then study the transport performance through numerical simulations, showing that for some instances of the dynamics perfect quantum state transfer is attainable. Our approach provides one with a natural description of both unitary and open quantum evolutions, where the homogeneity and locality of interactions allow one to take into account several forms of quantum noise in a plausible scenario.
Return of the Quantum Cellular Automata: Episode VI
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.
Exact quantum algorithms for promise problems in automata theory
Yakaryilmaz, Abuzer
2011-01-01
In this note, we show that quantum finite automata can be polynomially more succinct than their classical counterparts for promise problems in case of exact computation. Additionally, in terms of language recognition, the same result is shown to be valid up to a constant factor depending on how bigger the size of the alphabet is.
Quantum reversibility and a new model of quantum automaton
Ciamarra, M P
2001-01-01
This article is an attempt to generalize the classical theory of reversible computing, principally developed by Bennet [IBM J. Res. Develop., 17(1973)] and by Fredkin and Toffoli [Internat. J. Theoret. Phys., 21(1982)], to the quantum case. This is a fundamental step towards the construction of a quantum computer because a time efficient quantum computation is a reversible physical process. The paper is organized as follows. The first section reviews the classical theory of reversible computing. In the second section it is showed that the designs used in the classical framework to decrease the consumption of space cannot be generalized to the quantum case; it is also suggested that quantum computing is generally more demanding of space than classical computing. In the last section a new model of fully quantum and reversible automaton is proposed. The computational power of this automaton is at least equal to that of classical automata. Some conclusion are drawn in the last section.
Characterizations of one-way general quantum finite automata
Li, Lvzhou; Zou, Xiangfu; Li, Lvjun; Wu, Lihua
2009-01-01
In this paper we study a generalized model named one-way general quantum finite automata} (1gQFA), in which each symbol in the input alphabet induces a trace-preserving quantum operation, instead of a unitary transformation. Two different kinds of 1gQFA will be studied: measure-once one-way general quantum finite automata} (MO-1gQFA), and measure-many one-way general quantum finite automata (MM-1gQFA). We prove that MO-1gQFA can recognize all regular languages but only regular languages with bounded error. We prove that MM-1gQFA also recognize only regular languages with bounded error. Thus, MM-1gQFA and MO-1gQFA have the same language recognition power, which is greatly different from the conventional case in which the times of measurement performed in the computation generally affect the language recognition power of one-way QFA. Finally, we present a sufficient and necessary condition for two MM-1gQFA to be equivalent.
Nanosensor Data Processor in Quantum-Dot Cellular Automata
Fenghui Yao; Mohamed Saleh Zein-Sabatto; Guifeng Shao; Mohammad Bodruzzaman; Mohan Malkani
2014-01-01
Quantum-dot cellular automata (QCA) is an attractive nanotechnology with the potential alterative to CMOS technology. QCA provides an interesting paradigm for faster speed, smaller size, and lower power consumption in comparison to transistor-based technology, in both communication and computation. This paper describes the design of a 4-bit multifunction nanosensor data processor (NSDP). The functions of NSDP contain (i) sending the preprocessed raw data to high-level processor, (ii) counting...
Notes on automata theory based on quantum logic
Institute of Scientific and Technical Information of China (English)
QIU DaoWen
2007-01-01
The main results are as follows: (1) it deals with a number of basic operations (concatenation, Kleene closure, homomorphism, complement); (2) due to a condition imposed on the implication operator for discussing some basic issues in orthomodular lattice-valued automata, this condition is investigated in detail, and it is discovered that all the relatively reasonable five implication operators in quantum logic do not satisfy this condition, and that one of the five implications satisfies such a condition iff the truth-value lattice is indeed a Boolean algebra; (3) it deals further with orthomodular lattice-valued successor and source operators; (4) an example is provided, implying that some negative results obtained in the literature may still hold in some typical orthomodular lattice-valued automata.
Vargas, David L.
Emerging quantum simulator technologies provide a new challenge to quantum many body theory. Quantifying the emergent order in and predicting the dynamics of such complex quantum systems requires a new approach. We develop such an approach based on complex network analysis of quantum mutual information. First, we establish the usefulness of quantum mutual information complex networks by reproducing the phase diagrams of transverse Ising and Bose-Hubbard models. By quantifying the complexity of quantum cellular automata we then demonstrate the applicability of complex network theory to non-equilibrium quantum dynamics. We conclude with a study of student collaboration networks, correlating a student's role in a collaboration network with their grades. This work thus initiates a quantitative theory of quantum complexity and provides a new tool for physics education research. (Abstract shortened by ProQuest.).
Hamiltonian Quantum Cellular Automata in 1D
Nagaj, Daniel; Wocjan, Pawel
2008-01-01
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process. We only require the ability to prepare an initial computational basis state which encodes both the quantum circuit and its input. The computational process is then carried out by the autonomous Hamiltonian time evolution. After a time polynomially long in th...
A new phenomenon of quantum-dot cellular automata
Institute of Scientific and Technical Information of China (English)
无
2005-01-01
Ifan external point charge and the movable charges of an isolated quantum-dot cellular automata (QCA) cell have the same polarity, the point charge greatly affects the polarization (P) of the cell only when it is in a narrow band with periodically changing width. The center of the band is on a radius R circle. The ratio of R to the electric charge (q) is a constant determined by the parameters of the cell. A QCA cell can be used as charge detector based on the above phenomenon.
Two Novel Quantum-Dot Cellular Automata Full Adders
Mahdie Qanbari; Reza Sabbaghi-Nadooshan
2013-01-01
Quantum-dot cellular automata (QCA) is an efficient technology to create computing devices. QCA is a suitable candidate for the next generation of digital systems. Full adders are the main member of computational systems because other operations can be implemented by adders. In this paper, two QCA full adders are introduced. The first one is implemented in one layer, and the second one is implemented in three layers. Five-input majority gate is used in both of them. These full adders are bett...
Two Novel Quantum-Dot Cellular Automata Full Adders
Directory of Open Access Journals (Sweden)
Mahdie Qanbari
2013-01-01
Full Text Available Quantum-dot cellular automata (QCA is an efficient technology to create computing devices. QCA is a suitable candidate for the next generation of digital systems. Full adders are the main member of computational systems because other operations can be implemented by adders. In this paper, two QCA full adders are introduced. The first one is implemented in one layer, and the second one is implemented in three layers. Five-input majority gate is used in both of them. These full adders are better than pervious designs in terms of area, delay, and complexity.
Nanosensor Data Processor in Quantum-Dot Cellular Automata
Directory of Open Access Journals (Sweden)
Fenghui Yao
2014-01-01
Full Text Available Quantum-dot cellular automata (QCA is an attractive nanotechnology with the potential alterative to CMOS technology. QCA provides an interesting paradigm for faster speed, smaller size, and lower power consumption in comparison to transistor-based technology, in both communication and computation. This paper describes the design of a 4-bit multifunction nanosensor data processor (NSDP. The functions of NSDP contain (i sending the preprocessed raw data to high-level processor, (ii counting the number of the active majority gates, and (iii generating the approximate sigmoid function. The whole system is designed and simulated with several different input data.
A Novel Architecture for Quantum-Dot Cellular Automata Multiplexer
Directory of Open Access Journals (Sweden)
Arman Roohi
2011-11-01
Full Text Available Quantum-dot Cellular Automata (QCA technology is attractive due to its low power consumption, fast speed and small dimension; therefore it is a promising alternative to CMOS technology. Additionally, multiplexer is a useful part in many important circuits. In this paper we propose a novel design of 2:1 MUX in QCA. Moreover, a 4:1 multiplexer, an XOR gate and a latch are proposed based on our 2:1 multiplexer design. The simulation results have been verified using the QCADesigner.
Quantum reverse hypercontractivity
Energy Technology Data Exchange (ETDEWEB)
Cubitt, Toby [Department of Computer Science, University College London, London, United Kingdom and Centre for Quantum Information and Foundations, DAMTP, University of Cambridge, Cambridge (United Kingdom); Kastoryano, Michael [NBIA, Niels Bohr Institute, University of Copenhagen, 2100 Copenhagen (Denmark); Montanaro, Ashley [School of Mathematics, University of Bristol, Bristol (United Kingdom); Temme, Kristan [Institute for Quantum Information and Matter, California Institute of Technology, Pasadena, California 91125 (United States)
2015-10-15
We develop reverse versions of hypercontractive inequalities for quantum channels. By generalizing classical techniques, we prove a reverse hypercontractive inequality for tensor products of qubit depolarizing channels. We apply this to obtain a rapid mixing result for depolarizing noise applied to large subspaces and to prove bounds on a quantum generalization of non-interactive correlation distillation.
A novel image encryption algorithm using chaos and reversible cellular automata
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.
Ntalaperas, D
2016-01-01
We propose an architecture based on Quantum cellular Automata which allows the use of only one type of quantum gates per computational step in order to perform nearest neighbor interactions. The model is built in partial steps, each one of them analyzed using nearest neighbor interactions, starting with single qubit operations and continuing with two qubit ones. The effectiveness of the model is tested and valuated by developing a quantum circuit implementing the Quantum Fourier Transform. The important outcome of this validation was that the operations are performed in a local and controlled manner thus reducing the error rate of each computational step.
A testable parity conservative gate in quantum-dot cellular automata
Karkaj, Ehsan Taher; Heikalabad, Saeed Rasouli
2017-01-01
There are important challenges in current VLSI technology such as feature size. New technologies are emerging to overcome these challenges. One of these technologies is quantum-dot cellular automata (QCA) but it also has some disadvantages. One of the very important challenges in QCA is the occurrence of faults due to its very small area. There are different ways to overcome this challenge, one of which is the testable logic gate. There are two types of testable gate; reversible gate, and conservative gate. We propose a new testable parity conservative gate in this paper. This gate is simulated with QCADesigner and compared with previous structures. Power dissipation of proposed gate investigated using QCAPro simulator as an accurate power estimator tool.
Design of arithmetic circuits in quantum dot cellular automata nanotechnology
Sridharan, K
2015-01-01
This research monograph focuses on the design of arithmetic circuits in Quantum Dot Cellular Automata (QCA). Using the fact that the 3-input majority gate is a primitive in QCA, the book sets out to discover hitherto unknown properties of majority logic in the context of arithmetic circuit designs. The pursuit for efficient adders in QCA takes two forms. One involves application of the new results in majority logic to existing adders. The second involves development of a custom adder for QCA technology. A QCA adder named as hybrid adder is proposed and it is shown that it outperforms existing multi-bit adders with respect to area and delay. The work is extended to the design of a low-complexity multiplier for signed numbers in QCA. Furthermore the book explores two aspects unique to QCA technology, namely thermal robustness and the role of interconnects. In addition, the book introduces the reader to QCA layout design and simulation using QCADesigner. Features & Benefits: This research-based book: · �...
元胞自动机可逆性研究%Research on Reversibility of Cellular Automata
Institute of Scientific and Technical Information of China (English)
刘栋
2011-01-01
Cellular automata is an important theoretical tool of modeling complex adaptive system. As a necessary condition of simulating physics reversible space, reversibility is an important attribute of cellular automata. This paper introduces basic concept, reversibility and computability about cellular automata, and describes how one-dimensional reversible cellular automata are computationally universal.%元胞自动机是对复杂适应系统建模的重要理论工具.可逆性是元胞自动机的一个重要属性,是模拟物理可逆空间的必要条件.本文介绍元胞自动机的基本概念、可逆性和可计算性,并介绍一维可逆元胞自动机可计算的证明思路.
Directory of Open Access Journals (Sweden)
Rashmi Pandey
2014-09-01
Full Text Available Quantum Dot Cellular Automata (QCA is an advanced nanotechnology that attempts to create general computational at the nano-scale by controlling the position of single electrons. Quantum dot cellular automata (QCA defines a new device architecture that permits the innovative design of digital systems. QCA technology has large potential in terms of high space density and power dissipation with the development of the faster computer with smaller size & low power consumption.QCA help us to overcome the limitations of CMOS technology. In this paper, A design 16-bit arithmetic logic unit (ALU based on the Quantum dot cellular automata (QCA is presented. The simulation result of 16 bit ALU is verified using QCA Designer tool.
A comparative analysis of electronic and molecular quantum dot cellular automata
Energy Technology Data Exchange (ETDEWEB)
Umamahesvari, H., E-mail: umamaheswarihema@gmail.com, E-mail: ajithavijay1@gmail.com [Sreenivasa Institute of Technology and Management Studies, (SITAMS) Autonomous, Chittoor (India); Ajitha, D., E-mail: umamaheswarihema@gmail.com, E-mail: ajithavijay1@gmail.com [JNTUCEA, Anatapuramu Andrapradesh (India)
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.
Directory of Open Access Journals (Sweden)
Somsak Panyakeow
2010-10-01
Full Text Available Laterally close-packed quantum dots (QDs called quantum dot molecules (QDMs are grown by modified molecular beam epitaxy (MBE. Quantum dots could be aligned and cross hatched. Quantum rings (QRs created from quantum dot transformation during thin or partial capping are used as templates for the formations of bi-quantum dot molecules (Bi-QDMs and quantum dot rings (QDRs. Preferable quantum dot nanostructure for quantum computation based on quantum dot cellular automata (QCA is laterally close-packed quantum dot molecules having four quantum dots at the corners of square configuration. These four quantum dot sets are called quadra-quantum dots (QQDs. Aligned quadra-quantum dots with two electron confinements work like a wire for digital information transmission by Coulomb repulsion force, which is fast and consumes little power. Combination of quadra-quantum dots in line and their cross-over works as logic gates and memory bits. Molecular Beam Epitaxial growth technique called 'Droplet Epitaxy' has been developed for several quantum nanostructures such as quantum rings and quantum dot rings. Quantum rings are prepared by using 20 ML In-Ga (15:85 droplets deposited on a GaAs substrate at 390'C with a droplet growth rate of 1ML/s. Arsenic flux (7'8'10-6Torr is then exposed for InGaAs crystallization at 200'C for 5 min. During droplet epitaxy at a high droplet thickness and high temperature, out-diffusion from the centre of droplets occurs under anisotropic strain. This leads to quantum ring structures having non-uniform ring stripes and deep square-shaped nanoholes. Using these peculiar quantum rings as templates, four quantum dots situated at the corners of a square shape are regrown. Two of these four quantum dots are aligned either or, which are preferable crystallographic directions of quantum dot alignment in general.
A simple block representation of reversible cellular automata with time-symmetry
Arrighi, Pablo
2012-01-01
Reversible Cellular Automata (RCA) are a physics-like model of computation consisting of an array of identical cells, evolving in discrete time steps by iterating a global evolution G. Further, G is required to be shift-invariant (it acts the same everywhere), causal (information cannot be transmitted faster than some fixed number of cells per time step), and reversible (it has an inverse which verifies the same requirements). An important, though only recently studied special case is that of Time-symmetric Cellular Automata (TSCA), for which G and its inverse are related via a local operation. In this note we revisit the question of the Block representation of RCA, i.e. we provide a very simple proof of the existence of a reversible circuit description implementing G. This operational, bottom-up description of G turns out to be time-symmetric, suggesting interesting connections with TSCA. Indeed we prove, using a similar technique, that a wide class of them admit an Exact block representation (EBR), i.e. one...
Universality of One-Dimensional Reversible and Number-Conserving Cellular Automata
Directory of Open Access Journals (Sweden)
Kenichi Morita
2012-08-01
Full Text Available We study one-dimensional reversible and number-conserving cellular automata (RNCCA that have both properties of reversibility and number-conservation. In the case of 2-neighbor RNCCA, García-Ramos proved that every RNCCA shows trivial behavior in the sense that all the signals in the RNCCA do not interact each other. However, if we increase the neighborhood size, we can find many complex RNCCAs. Here, we show that for any one-dimensional 2-neighbor reversible partitioned CA (RPCA with s states, we can construct a 4-neighbor RNCCA with 4s states that simulates the former. Since it is known that there is a computationally universal 24-state 2-neighbor RPCA, we obtain a universal 96-state 4-neighbor RNCCA.
Nanopatterned graphene quantum dots as building blocks for quantum cellular automata
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.
Six-Correction Logic (SCL Gates in Quantum-dot Cellular Automata (QCA
Directory of Open Access Journals (Sweden)
Md. Anisur Rahman
2015-11-01
Full Text Available Quantum Dot Cellular Automata (QCA is a promising nanotechnology in Quantum electronics for its ultra low power consumption, faster speed and small size features. It has significant advantages over the Complementary Metal–Oxide–Semiconductor (CMOS technology. This paper present, a novel QCA representation of Six-Correction Logic (SCL gate based on QCA logic gates: the Maj3, Maj AND gate and Maj OR. In order to design and verify the functionality of the proposed layout, QCADesigner a familiar QCA simulator has been employed. The simulation results confirm correctness of the claims and its usefulness in designing a digital circuits.
A parallel block-based encryption schema for digital images using reversible cellular automata
Directory of Open Access Journals (Sweden)
Faraoun Kamel Mohamed
2014-06-01
Full Text Available We propose a novel images encryption schema based on reversible one-dimensional cellular automata. Contrasting to the sequential operating mode of several existing approaches, the proposed one is fully parallelizable since the encryption/decryption tasks can be executed using multiple processes running independently for the same single image. The parallelization is made possible by defining a new RCA-based construction of an extended pseudorandom permutation that takes a nonce as a supplementary parameter. The defined PRP exploit the chaotic behavior and the high initial condition's sensitivity of the RCAs to ensure perfect cryptographic security properties. Results of various experiments and analysis show that high security and execution performances can be achieved using the approach, and furthermore, it provides the ability to perform a selective area decryption since any part of the ciphered-image can be deciphered independently from others, which is very useful for real time applications.
Designing quantum-dot cellular automata circuits using a robust one layer crossover scheme
Directory of Open Access Journals (Sweden)
Sara Hashemi
2014-04-01
Full Text Available Quantum-dot cellular automata (QCA is a novel nanotechnology which is considered as a solution to the scaling problems in complementary metal oxide semiconductor technology. In this Letter, a robust one layer crossover scheme is introduced. It uses only 90° QCA cells and works based on a proper clock assignment. The application of this new scheme is shown in designing a sample QCA circuit. Simulation results demonstrate that using this new scheme, significant improvements in terms of area and complexity can be achieved.
A Three-Layer Full Adder/Subtractor Structure in Quantum-Dot Cellular Automata
Barughi, Yashar Zirak; Heikalabad, Saeed Rasouli
2017-06-01
Nowadays, quantum-dot cellular automata (QCA) is one of the paramount modern technologies for designing logical structures at the nano-scale. This technology is being used in molecular levels and it is based on QCA cells. High speed data transfer and low consumable power are the advantages of this technology. In this paper, we are designing and simulating a fulladder/subtractor with minimum number of cells and complexities in three layers. QCA designer software has been used to simulate the proposed design.
Performance of 1D quantum cellular automata in the presence of error
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.
Multipartite cellular automata and the superposition principle
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.
Model-Checking Linear-Time Properties of Quantum Systems
Ying, Mingsheng; Yu, Nengkun; Feng, Yuan
2011-01-01
We define a formal framework for reasoning about linear-time properties of quantum systems in which quantum automata are employed in the modeling of systems and certain closed subspaces of state (Hilbert) spaces are used as the atomic propositions about the behavior of systems. We provide an algorithm for verifying invariants of quantum automata. Then automata-based model-checking technique is generalized for the verification of safety properties recognizable by reversible automata and omega-properties recognizable by reversible Buechi automata.
Analysis of quantum particle automata for solving the density classification problem
Yu, Tina; Ben-Av, Radel
2015-04-01
To advance our understanding of quantum cellular automata in problem solving through parallel and distributed computing, this research quantized the density classification problem and adopted the quantum particle automata (QPA) to solve the quantized problem. In order to solve this problem, the QPA needed a unitary operator to carry out the QPA evolution and a boundary partition to make the classification decisions. We designed a genetic algorithm (GA) to search for the unitary operators and the boundary partitions to classify the density of binary inputs with length 5. The GA was able to find more than one unitary operator that can transform the QPA in ways such that when the particle was measured, it was more likely to collapse to the basis states that were on the correct side of the boundary partition for the QPA to decide whether the binary input had majority density 0 or majority density 1. We analyzed these solutions and found that the QPA evolution dynamic was driven by a particular parameter of the unitary operator: A small gave the particle small mass hence fast evolution, while large had the opposite effect. While these results are encouraging, scaling these solutions for binary inputs of arbitrary length of requires additional analysis, which we will investigate in our future work.
Design and Analysis of Adders using Nanotechnology Based Quantum dot Cellular Automata
Directory of Open Access Journals (Sweden)
S. K. Lakshmi
2011-01-01
Full Text Available Problem statement: The area and complexity are the major issues in circuit design. Here, we propose different types of adder designs based on Quantum dot Cellular Automata (QCA that reduces number of QCA cells and area compare to previous designs. The quantum dot cellular automata is a novel computing paradigm in nanotechnology that can implement digital circuits with faster speed, smaller size and low power consumption. By taking the advantages of QCA we are able to design interesting computational architectures. The QCA cell is a basic building block of nanotechnology that can be used to make gates, wires and memories. The basic logic circuits used in this technology are the inverter and the Majority Gate (MG, using this other logical circuits can be designed. Approach: In this paper, the adders such as half, full and serial bit were designed and analyzed. These structures were designed with minimum number of cells by using cell minimization techniques. The techniques are (1 using two cells inverter and (2 suitable arrangement of cells without overlapping of neighboring cells. The proposed method can be used to minimize area and complexity. Results: These circuits were designed by majority gate and implemented by QCA cells. Then, they simulated using QCA Designer. The simulated results were verified according to the truth table. Conclusion: The performance analyses of those circuits are compared according to complexity, area and number of clock cycles and are also compared with previous designs.
Intrinsically universal n-dimensional quantum cellular automata
Arrighi, Pablo
2009-01-01
We describe an n-dimensional quantum cellular automaton (QCA) capable of simulating all others, in that the initial configuration and the forward evolution of any n-dimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA. The encoding is linear and hence does not carry any of the cost of the computation. Part of our proof consists of showing that any QCA can be presented in the more canonical, operational form of a Partitioned QCA, thereby showing an equivalence between many definitions of QCA that are present in the literature.
A Novel Seven Input Majority Gate in Quantum-dot Cellular Automata
Directory of Open Access Journals (Sweden)
Keivan Navi
2012-01-01
Full Text Available A Quantum Cellular Automaton (QCA is a nanotechnology which is an attractive alternative for transistor based technologies in the near future. A new seven input majority gate in quantum dot cellular automata is proposed in this paper. The basic elements in QCA are majority and inverter gates, therefore using a majority gate with more inputs in QCA circuit will cause reduction in cell count, latency and complexity. Furthermore, by using the proposed seven input majority gate we can design four inputs AND gate and OR gate in only two clock phases. By applying these kinds of gates QCA circuits could be simplified and optimized. In order to prove the functionality of the proposed device, QCADesigner tool and some physical proofs are utilized.
Energy Technology Data Exchange (ETDEWEB)
Mora, Juan Carlos Seck Tuoh [Centro de Investigacion Avanzada en Ingenieria Industrial, Universidad Autonoma del Estado de Hidalgo, Carr Pachuca-Tulancingo Km 4.5, 42020 Pachuca (Mexico); Hernandez, Manuel Gonzalez [Centro de Investigacion Avanzada en Ingenieria Industrial, Universidad Autonoma del Estado de Hidalgo, Carr Pachuca-Tulancingo Km 4.5, 42020 Pachuca (Mexico); Vergara, Sergio V Chapa [Depto de Ingenieria Electrica, Seccion Computacion, Centro de Investigacion y de Estudios Avanzados, Instituto Politecnico Nacional, Av IPN 2508, Col San Pedro Zacatenco, 07300 DF (Mexico)
2003-07-25
Reversible cellular automata are invertible discrete dynamical systems which have been widely studied both for analysing interesting theoretical questions and for obtaining relevant practical applications, for instance, simulating invertible natural systems or implementing data coding devices. An important problem in the theory of reversible automata is to know how the local behaviour which is not invertible is able to yield a reversible global one. In this sense, symbolic dynamics plays an important role for obtaining an adequate representation of a reversible cellular automaton. In this paper we prove the equivalence between a reversible automaton where the ancestors only differ at one side (technically with one of the two Welch indices equal to 1) and a full shift. We represent any reversible automaton by a de Bruijn diagram, and we characterize the way in which the diagram produces an evolution formed by undefined repetitions of two states. By means of amalgamations, we prove that there is always a way of transforming a de Bruijn diagram into the full shift. Finally, we provide an example illustrating the previous results.
Novel Design for Quantum Dots Cellular Automata to Obtain Fault-Tolerant Majority Gate
Directory of Open Access Journals (Sweden)
Razieh Farazkish
2012-01-01
Full Text Available Quantum-dot Cellular Automata (QCA is one of the most attractive technologies for computing at nanoscale. The principle element in QCA is majority gate. In this paper, fault-tolerance properties of the majority gate is analyzed. This component is suitable for designing fault-tolerant QCA circuits. We analyze fault-tolerance properties of three-input majority gate in terms of misalignment, missing, and dislocation cells. In order to verify the functionality of the proposed component some physical proofs using kink energy (the difference in electrostatic energy between the two polarization states and computer simulations using QCA Designer tool are provided. Our results clearly demonstrate that the redundant version of the majority gate is more robust than the standard style for this gate.
Design of efficient full adder in quantum-dot cellular automata.
Sen, Bibhash; Rajoria, Ayush; Sikdar, Biplab K
2013-01-01
Further downscaling of CMOS technology becomes challenging as it faces limitation of feature size reduction. Quantum-dot cellular automata (QCA), a potential alternative to CMOS, promises efficient digital design at nanoscale. Investigations on the reduction of QCA primitives (majority gates and inverters) for various adders are limited, and very few designs exist for reference. As a result, design of adders under QCA framework is gaining its importance in recent research. This work targets developing multi-layered full adder architecture in QCA framework based on five-input majority gate proposed here. A minimum clock zone (2 clock) with high compaction (0.01 μ m(2)) for a full adder around QCA is achieved. Further, the usefulness of such design is established with the synthesis of high-level logic. Experimental results illustrate the significant improvements in design level in terms of circuit area, cell count, and clock compared to that of conventional design approaches.
Design of Efficient Full Adder in Quantum-Dot Cellular Automata
Directory of Open Access Journals (Sweden)
Bibhash Sen
2013-01-01
Full Text Available Further downscaling of CMOS technology becomes challenging as it faces limitation of feature size reduction. Quantum-dot cellular automata (QCA, a potential alternative to CMOS, promises efficient digital design at nanoscale. Investigations on the reduction of QCA primitives (majority gates and inverters for various adders are limited, and very few designs exist for reference. As a result, design of adders under QCA framework is gaining its importance in recent research. This work targets developing multi-layered full adder architecture in QCA framework based on five-input majority gate proposed here. A minimum clock zone (2 clock with high compaction (0.01 μm2 for a full adder around QCA is achieved. Further, the usefulness of such design is established with the synthesis of high-level logic. Experimental results illustrate the significant improvements in design level in terms of circuit area, cell count, and clock compared to that of conventional design approaches.
High-performance full adder architecture in quantum-dot cellular automata
Directory of Open Access Journals (Sweden)
Hamid Rashidi
2017-06-01
Full Text Available Quantum-dot cellular automata (QCA is a new and promising computation paradigm, which can be a viable replacement for the complementary metal–oxide–semiconductor technology at nano-scale level. This technology provides a possible solution for improving the computation in various computational applications. Two QCA full adder architectures are presented and evaluated: a new and efficient 1-bit QCA full adder architecture and a 4-bit QCA ripple carry adder (RCA architecture. The proposed architectures are simulated using QCADesigner tool version 2.0.1. These architectures are implemented with the coplanar crossover approach. The simulation results show that the proposed 1-bit QCA full adder and 4-bit QCA RCA architectures utilise 33 and 175 QCA cells, respectively. Our simulation results show that the proposed architectures outperform most results so far in the literature.
Defect-tolerance analysis of fundamental quantum-dot cellular automata devices
Directory of Open Access Journals (Sweden)
Yongqiang Zhang
2015-04-01
Full Text Available Quantum-dot cellular automata (QCA is a burgeoning technology at the nano-scale range, with the potential for lower power consumption, smaller size and faster speed than conventional complementary metal–oxide semiconductor-based technology. Because of its ultra-density integration and its inherent physical properties, fault-tolerance is an important property to consider in the research and manufacture of QCA. In this paper, one type of defect, in which displacement and misalignment occur coinstantaneously, is investigated in detail on rudimentary QCA devices (majority voter (MV, inverter, wire with QCADesigner. Another MV with rotated cells is also proposed, and it is more robust than the original one. Simulation results present the defect-tolerance of these devices, that is, the maximum precise region the defective cell can be moved moreover, with correct logical function. These conclusions have a meaningful guiding significance for QCA physical implementation and fault-tolerance research.
Quasi-classical modeling of molecular quantum-dot cellular automata multidriver gates
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.
Szilard engine reversibility as quantum gate function
Mihelic, F. Matthew
2012-06-01
A quantum gate is a logically and thermodynamically reversible situation that effects a unitary transformation of qubits of superimposed information, and essentially constitutes a situation for a reversible quantum decision. A quantum decision is a symmetry break, and the effect of the function of a Szilard engine is a symmetry break. A quantum gate is a situation in which a reversible quantum decision can be made, and so if a logically and thermodynamically reversible Szilard engine can be theoretically constructed then it would function as a quantum gate. While the traditionally theorized Szilard engine is not thermodynamically reversible, if one of the bounding walls of a Szilard engine were to be constructed out of the physical information by which it functions in such a manner as to make that information available to both sides of the wall simultaneously, then such a Szilard engine would be both logically and thermodynamically reversible, and thus capable of function as a quantum gate. A theoretical model of the special case of a reversible Szilard engine functioning as a quantum gate is presented and discussed, and since a quantum decision is made when the shutter of a Szilard engine closes, the coherence of linked reversible Szilard engines should be considered as a state during which all of the shutters of linked Szilard engines are open simultaneously.
Baianu, IC
2004-01-01
Two important concepts for nanoscience and nanotechnology-- the quantum automaton and quantum computation--were introduced in the context of quantum genetics and complex genetic networks with nonlinear dynamics. In previous publications (Baianu,1971a, b) the formal definition of quantum automaton was initially presented in the Schrodinger representation of quantum mechanics, and several possible implications for genetic processes and metabolic activities in living cells and organisms were considered. This was followed by reports on quantum, as well as symbolic, abstract computations based on the theory of categories, functors and natural transformations (Baianu,1971b; 1977; 1987; 2004; Baianu et al, 2004). The notions of quantum topological semigroup, quantum automaton, and/or quantum computer, were then suggested with a view to their potential applications to the analogous simulation of biological systems, and especially genetic activities and nonlinear dynamics in genetic networks. A representation of inter...
Self-doping of molecular quantum-dot cellular automata: mixed valence zwitterions.
Lu, Yuhui; Lent, Craig
2011-09-07
Molecular quantum-dot cellular automata (QCA) is a promising paradigm for realizing molecular electronics. In molecular QCA, binary information is encoded in the distribution of intramolecular charge, and Coulomb interactions between neighboring molecules combine to create long-range correlations in charge distribution that can be exploited for signal transfer and computation. Appropriate mixed-valence species are promising candidates for single-molecule device operation. A complication arises because many mixed-valence compounds are ions and the associated counterions can potentially disrupt the correct flow of information through the circuit. We suggest a self-doping mechanism which incorporates the counterion covalently into the structure of a neutral molecular cell, thus producing a zwitterionic mixed-valence complex. The counterion is located at the geometrical center of the QCA molecule and bound to the working dots via covalent bonds, thus avoiding counterion effects that bias the system toward one binary information state or the other. We investigate the feasibility of using multiply charged anion (MCA) boron clusters, specifically closo-borate dianion, as building blocks. A first principle calculation shows that neutral, bistable, and switchable QCA molecules are possible. The self-doping mechanism is confirmed by molecular orbital analysis, which shows that MCA counterions can be stabilized by the electrostatic interaction between negatively charged counterions and positively charged working dots. This journal is © the Owner Societies 2011
Importance of reversibility in the quantum formalism.
David, François
2011-10-28
In this Letter I stress the role of causal reversibility (time symmetry), together with causality and locality, in the justification of the quantum formalism. First, in the algebraic quantum formalism, I show that the assumption of reversibility implies that the observables of a quantum theory form an abstract real C^{⋆} algebra, and can be represented as an algebra of operators on a real Hilbert space. Second, in the quantum logic formalism, I emphasize which axioms for the lattice of propositions (the existence of an orthocomplementation and the covering property) derive from reversibility. A new argument based on locality and Soler's theorem is used to derive the representation as projectors on a regular Hilbert space from the general quantum logic formalism. In both cases it is recalled that the restriction to complex algebras and Hilbert spaces comes from the constraints of locality and separability.
Time reversibility in the quantum frame
Energy Technology Data Exchange (ETDEWEB)
Masot-Conde, Fátima [Escuela Superior Ingenieros, Dpt. Física Aplicada III, Universidad de Sevilla Isla Mágica, 41092- Sevilla (Spain)
2014-12-04
Classic Mechanics and Electromagnetism, conventionally taken as time-reversible, share the same concept of motion (either of mass or charge) as the basis of the time reversibility in their own fields. This paper focuses on the relationship between mobile geometry and motion reversibility. The goal is to extrapolate the conclusions to the quantum frame, where matter and radiation behave just as elementary mobiles. The possibility that the asymmetry of Time (Time’s arrow) is an effect of a fundamental quantum asymmetry of elementary particles, turns out to be a consequence of the discussion.
An enhanced high-speed multi-digit BCD adder using quantum-dot cellular automata
Ajitha, D.; Ramanaiah, K. V.; Sumalatha, V.
2017-02-01
The advent of development of high-performance, low-power digital circuits is achieved by a suitable emerging nanodevice called quantum-dot cellular automata (QCA). Even though many efficient arithmetic circuits were designed using QCA, there is still a challenge to implement high-speed circuits in an optimized manner. Among these circuits, one of the essential structures is a parallel multi-digit decimal adder unit with significant speed which is very attractive for future environments. To achieve high speed, a new correction logic formulation method is proposed for single and multi-digit BCD adder. The proposed enhanced single-digit BCD adder (ESDBA) is 26% faster than the carry flow adder (CFA)-based BCD adder. The multi-digit operations are also performed using the proposed ESDBA, which is cascaded innovatively. The enhanced multi-digit BCD adder (EMDBA) performs two 4-digit and two 8-digit BCD addition 50% faster than the CFA-based BCD adder with the nominal overhead of the area. The EMDBA performs two 4-digit BCD addition 24% faster with 23% decrease in the area, similarly for 8-digit operation the EMDBA achieves 36% increase in speed with 21% less area compared to the existing carry look ahead (CLA)-based BCD adder design. The proposed multi-digit adder produces significantly less delay of (N –1) + 3.5 clock cycles compared to the N* One digit BCD adder delay required by the conventional BCD adder method. It is observed that as per our knowledge this is the first innovative proposal for multi-digit BCD addition using QCA.
Reversible and quantum circuits optimization and complexity analysis
Abdessaied, Nabila
2016-01-01
This book presents a new optimization flow for quantum circuits realization. At the reversible level, optimization algorithms are presented to reduce the quantum cost. Then, new mapping approaches to decompose reversible circuits to quantum circuits using different quantum libraries are described. Finally, optimization techniques to reduce the quantum cost or the delay are applied to the resulting quantum circuits. Furthermore, this book studies the complexity of reversible circuits and quantum circuits from a theoretical perspective.
Energy Technology Data Exchange (ETDEWEB)
Naji Asfestani, Mazaher; Rasouli Heikalabad, Saeed, E-mail: s.rasouli@iaut.ac.ir
2017-05-01
Quantum-dot cellular automata (QCA) is the advent of technology and suitable replacement for semiconductor transistor technology. In this paper, a unique structure for the 2:1 multiplexer is presented in QCA. The structure of this component is simple, ultra-efficient and very useful to implement the various logical functions. The proposed structure does not follow any Boolean function. It takes advantage of the inherent characteristics of quantum technology to produce the desired output. Based on these principles, we design the new and efficient structures for the 4:1 multiplexer and 8:1 multiplexer in the QCA technology. These structures are designed with QCADesigner simulator and simulation results are examined. Investigation results indicate the amazing performance of proposed structure compared to existing structures in terms of area, complexity, power consumption and latency.
Reversible Projective Measurement in Quantum Ensembles
Khitrin, Anatoly; Lee, Jae-Seung
2010-01-01
We present experimental NMR demonstration of a scheme of reversible projective measurement, which allows extracting information on outcomes and probabilities of a projective measurement in a non-destructive way, with a minimal net effect on the quantum state of an ensemble. The scheme uses reversible dynamics and weak measurement of the intermediate state. The experimental system is an ensemble of 133Cs (S = 7/2) nuclei in a liquid-crystalline matrix.
Reversible arithmetic logic unit for quantum arithmetic
DEFF Research Database (Denmark)
Thomsen, Michael Kirkedal; Glück, Robert; Axelsen, Holger Bock
2010-01-01
-bit operands and does not use ancillae. This remarkable low resource consumption was achieved by generalizing the V-shape design first introduced for quantum ripple-carry adders and nesting multiple V-shapes in a novel integrated design. This communication shows that the realization of an efficient reversible...
Novel Designs of Quantum Reversible Counters
Qi, Xuemei; Zhu, Haihong; Chen, Fulong; Zhu, Junru; Zhang, Ziyang
2016-11-01
Reversible logic, as an interesting and important issue, has been widely used in designing combinational and sequential circuits for low-power and high-speed computation. Though a significant number of works have been done on reversible combinational logic, the realization of reversible sequential circuit is still at premature stage. Reversible counter is not only an important part of the sequential circuit but also an essential part of the quantum circuit system. In this paper, we designed two kinds of novel reversible counters. In order to construct counter, the innovative reversible T Flip-flop Gate (TFG), T Flip-flop block (T_FF) and JK flip-flop block (JK_FF) are proposed. Based on the above blocks and some existing reversible gates, the 4-bit binary-coded decimal (BCD) counter and controlled Up/Down synchronous counter are designed. With the help of Verilog hardware description language (Verilog HDL), these counters above have been modeled and confirmed. According to the simulation results, our circuits' logic structures are validated. Compared to the existing ones in terms of quantum cost (QC), delay (DL) and garbage outputs (GBO), it can be concluded that our designs perform better than the others. There is no doubt that they can be used as a kind of important storage components to be applied in future low-power computing systems.
Gangadari, Bhoopal Rao; Ahamed, Shaik Rafi
2016-12-01
In this paper, we presented a novel approach of low energy consumption architecture of S-Box used in Advanced Encryption Standard (AES) algorithm using programmable second order reversible cellular automata (RCA (2)). The architecture entails a low power implementation with minimal delay overhead and the performance of proposed RCA (2) based S-Box in terms of security is evaluated using the cryptographic properties such as nonlinearity, correlation immunity bias, strict avalanche criteria, entropy and also found that the proposed architecture is secure enough for cryptographic applications. Moreover, the proposed AES algorithm architecture simulation studies show that energy consumption of 68.726 nJ, power dissipation of 3.856 mW for 0.18- μm at 13.69 MHz and energy consumption of 29.408 nJ, power dissipation of 1.65 mW for 0.13- μm at 13.69 MHz. The proposed AES algorithm with RCA (2) based S-Box shows a reduction power consumption by 50 % and energy consumption by 5 % compared to best classical S-Box and composite field arithmetic based AES algorithm. Apart from that, it is also shown that RCA (2) based S-Boxes are dynamic in nature, invertible, low power dissipation compared to that of LUT based S-Box and hence suitable for Wireless Body Area Network (WBAN) applications.
Quantum Reversibility: Is there an Echo?
Hiller, M; Cohen, D; Geisel, T; Hiller, Moritz; Kottos, Tsampikos; Cohen, Doron; Geisel, Theo
2004-01-01
We study the possibility to undo the quantum mechanical evolution in a time reversal experiment. The naive expectation, as reflected in the common terminology ("Loschmidt echo"), is that maximum compensation results if the reversed dynamics extends to the same time as the forward evolution. We challenge this belief, and demonstrate that the time $t_r$ for maximum return probability is in general shorter. We find that $t_r$ depends on $lambda = eps_evol/eps_prep$, being the ratio of the error in setting the parameters (fields) for the time reversed evolution to the perturbation which is involved in the preparation process. Our results should be observable in spin-echo experiments where the dynamical irreversibility of quantum phases is measured.
A reversible optical to microwave quantum interface
Barzanjeh, Sh; Milburn, G J; Tombesi, P; Vitali, D
2011-01-01
Quantum technology, like many mature classical technologies, will ultimately integrate distinct modules to achieve a function that transcends the capability of any one of them. We describe a reversible quantum interface between an optical and a microwave photon using a hybrid device based on the common interaction of microwave and optical fields with a nano-mechanical resonator in a superconducting circuit, which is one of the major challenges in the field. The scheme provides a path for generating a traveling microwave field strongly entangled with an optical mode, thus bridging the gap between quantum optical and solid state implementations of quantum information. This is an effective source of (bright) two-mode squeezing with an optical idler (signal) and a microwave signal (idler) and as such enables a continuous variable teleportation protocol.
Design of a novel quantum reversible ternary up-counter
Houshmand, Pouran; Haghparast, Majid
2015-08-01
Reversible logic has been recently considered as an interesting and important issue in designing combinational and sequential circuits. The combination of reversible logic and multi-valued logic can improve power dissipation, time and space utilization rate of designed circuits. Only few works have been reported about sequential reversible circuits and almost there are no paper exhibited about quantum ternary reversible counter. In this paper, first we designed 2-qutrit and 3-qutrit quantum reversible ternary up-counters using quantum ternary reversible T-flip-flop and quantum reversible ternary gates. Then we proposed generalized quantum reversible ternary n-qutrit up-counter. We also introduced a new approach for designing any type of n-qutrit ternary and reversible counter. According to the results, we can conclude that applying second approach quantum reversible ternary up-counter is better than the others.
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.
A novel multiplexer-based structure for random access memory cell in quantum-dot cellular automata
Naji Asfestani, Mazaher; Rasouli Heikalabad, Saeed
2017-09-01
Quantum-dot cellular automata (QCA) is a new technology in scale of nano and perfect replacement for CMOS circuits in the future. Memory is one of the basic components in any digital system, so designing the random access memory (RAM) with high speed and optimal in QCA is important. In this paper, by employing the structure of multiplexer, a novel RAM cell architecture is proposed. The proposed architecture is implemented without the coplanar crossover approach. The proposed architecture is simulated using the QCADesigner version 2.0.3 and QCAPro. The simulation results demonstrate that the proposed QCA RAM architecture has the best performance in terms of delay, circuit complexity, area, cell count and energy consumption in comparison with other QCA RAM architectures.
Reversible part of a quantum dynamical system
2016-01-01
In this work a quantum dynamical system $(\\mathfrak M,\\Phi, \\varphi)$ is constituted by a von Neumann algebra $\\mathfrak M$, by a unital Schwartz map $\\Phi:\\mathfrak{M\\rightarrow M}$ and by a $\\Phi$-invariant normal faithful state $\\varphi$ on $\\mathfrak M$. The ergodic properties of a quantum dynamical system, depends on its reversible part $(\\mathfrak{D}_\\infty,\\Phi_\\infty, \\varphi_\\infty)$. It is constituted by a von Neumann sub-algebra $\\mathfrak{D}_\\infty$ of $\\mathfrak M$ by an automorp...
Reversible logic synthesis methodologies with application to quantum computing
Taha, Saleem Mohammed Ridha
2016-01-01
This book opens the door to a new interesting and ambitious world of reversible and quantum computing research. It presents the state of the art required to travel around that world safely. Top world universities, companies and government institutions are in a race of developing new methodologies, algorithms and circuits on reversible logic, quantum logic, reversible and quantum computing and nano-technologies. In this book, twelve reversible logic synthesis methodologies are presented for the first time in a single literature with some new proposals. Also, the sequential reversible logic circuitries are discussed for the first time in a book. Reversible logic plays an important role in quantum computing. Any progress in the domain of reversible logic can be directly applied to quantum logic. One of the goals of this book is to show the application of reversible logic in quantum computing. A new implementation of wavelet and multiwavelet transforms using quantum computing is performed for this purpose. Rese...
Reversible computing fundamentals, quantum computing, and applications
De Vos, Alexis
2010-01-01
Written by one of the few top internationally recognized experts in the field, this book concentrates on those topics that will remain fundamental, such as low power computing, reversible programming languages, and applications in thermodynamics. It describes reversible computing from various points of view: Boolean algebra, group theory, logic circuits, low-power electronics, communication, software, quantum computing. It is this multidisciplinary approach that makes it unique.Backed by numerous examples, this is useful for all levels of the scientific and academic community, from undergr
Preference reversal in quantum decision theory
Yukalov, V I
2015-01-01
We consider the psychological effect of preference reversal and show that it finds a natural explanation in the frame of quantum decision theory. When people choose between lotteries with non-negative payoffs, they prefer a more certain lottery because of uncertainty aversion. But when people evaluate lottery prices, e.g. for selling to others the right to play them, they do this more rationally, being less subject to behavioral biases. This difference can be explained by the presence of the attraction factors entering the expression of quantum probabilities. Only the existence of attraction factors can explain why, considering two lotteries with close utility factors, a decision maker prefers one of them when choosing, but evaluates higher the other one when pricing. We derive a general quantitative criterion for the preference reversal to occur that relates the utilities of the two lotteries to the attraction factors under choosing versus pricing and test successfully its application on experiments by Tvers...
Preference reversal in quantum decision theory.
Yukalov, Vyacheslav I; Sornette, Didier
2015-01-01
We consider the psychological effect of preference reversal and show that it finds a natural explanation in the frame of quantum decision theory. When people choose between lotteries with non-negative payoffs, they prefer a more certain lottery because of uncertainty aversion. But when people evaluate lottery prices, e.g., for selling to others the right to play them, they do this more rationally, being less subject to behavioral biases. This difference can be explained by the presence of the attraction factors entering the expression of quantum probabilities. Only the existence of attraction factors can explain why, considering two lotteries with close utility factors, a decision maker prefers one of them when choosing, but evaluates higher the other one when pricing. We derive a general quantitative criterion for the preference reversal to occur that relates the utilities of the two lotteries to the attraction factors under choosing vs. pricing and test successfully its application on experiments by Tversky et al. We also show that the planning paradox can be treated as a kind of preference reversal.
A novel power-efficient high-speed clock management unit using quantum-dot cellular automata
Abutaleb, M. M.
2017-04-01
Quantum-dot cellular automata (QCA) is one of the most attractive alternatives for complementary metal-oxide semiconductor technology. The QCA widely supports a new paradigm in the field of nanotechnology that has the potential for high density, low power, and high speed. The clock manager is an essential building block in the new microwave and radio frequency integrated circuits. This paper describes a novel QCA-based clock management unit (CMU) that provides innovative clocking capabilities. The proposed CMU is achieved by utilizing edge-triggered D-type flip-flops (D-FFs) in the design of frequency synthesizer and phase splitter. Edge-triggered D-FF structures proposed in this paper have the successful QCA implementation and simulation with the least complexity and power dissipation as compared to earlier structures. The frequency synthesizer is used to generate new clock frequencies from the reference clock frequency based on a combination of power-of-two frequency dividers. The phase splitter is integrated with the frequency synthesizer to generate four clock signals that are 90o out of phase with each other. This paper demonstrates that the proposed QCA CMU structure has a superior performance. Furthermore, the proposed CMU is straightforwardly scalable due to the use of modular component architecture.
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
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
Phase-selective reversible quantum decoherence in cavity QED experiment
Filip, R
2001-01-01
New feasible cavity QED experiment is proposed to analyse reversible quantum decoherence in consequence of quantum complementarity and entanglement. Utilizing the phase selective manipulations with enviroment, it is demonstrated how the complementarity particularly induces a preservation of visibility, whereas quantum decoherence is more progressive due to pronounced entanglement between system and enviroment. This effect can be directly observed using the proposed cavity QED measurements.
Quantum Cost Efficient Reversible BCD Adder for Nanotechnology Based Systems
Islam, Md Saiful; Begum, Zerina
2011-01-01
Reversible logic allows low power dissipating circuit design and founds its application in cryptography, digital signal processing, quantum and optical information processing. This paper presents a novel quantum cost efficient reversible BCD adder for nanotechnology based systems using PFAG gate. It has been demonstrated that the proposed design offers less hardware complexity and requires minimum number of garbage outputs than the existing counterparts. The remarkable property of the proposed designs is that its quantum realization is given in NMR technology.
Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost
Wille, Robert; Drechsler, Rolf
2010-01-01
Many synthesis approaches for reversible and quantum logic have been proposed so far. However, most of them generate circuits with respect to simple metrics, i.e. gate count or quantum cost. On the other hand, to physically realize reversible and quantum hardware, additional constraints exist. In this paper, we describe cost metrics beyond gate count and quantum cost that should be considered while synthesizing reversible and quantum logic for the respective target technologies. We show that the evaluation of a synthesis approach may differ if additional costs are applied. In addition, a new cost metric, namely Nearest Neighbor Cost (NNC) which is imposed by realistic physical quantum architectures, is considered in detail. We discuss how existing synthesis flows can be extended to generate optimal circuits with respect to NNC while still keeping the quantum cost small.
Deriving quantum theory from its local structure and reversibility.
de la Torre, Gonzalo; Masanes, Lluís; Short, Anthony J; Müller, Markus P
2012-08-31
We investigate the class of physical theories with the same local structure as quantum theory but potentially different global structure. It has previously been shown that any bipartite correlations generated by such a theory can be simulated in quantum theory but that this does not hold for tripartite correlations. Here we explore whether imposing an additional constraint on this space of theories-that of dynamical reversibility-will allow us to recover the global quantum structure. In the particular case in which the local systems are identical qubits, we show that any theory admitting at least one continuous reversible interaction must be identical to quantum theory.
Optimized 4-bit Quantum Reversible Arithmetic Logic Unit
Ayyoub, Slimani; Achour, Benslama
2017-08-01
Reversible logic has received a great attention in the recent years due to its ability to reduce the power dissipation. The main purposes of designing reversible logic are to decrease quantum cost, depth of the circuits and the number of garbage outputs. The arithmetic logic unit (ALU) is an important part of central processing unit (CPU) as the execution unit. This paper presents a complete design of a new reversible arithmetic logic unit (ALU) that can be part of a programmable reversible computing device such as a quantum computer. The proposed ALU based on a reversible low power control unit and small performance parameters full adder named double Peres gates. The presented ALU can produce the largest number (28) of arithmetic and logic functions and have the smallest number of quantum cost and delay compared with existing designs.
Three myths about time reversal in quantum theory
Roberts, Bryan W
2016-01-01
Many have suggested that the transformation standardly referred to as 'time reversal' in quantum theory is not deserving of the name. I argue on the contrary that the standard definition is perfectly appropriate, and is indeed forced by basic considerations about the nature of time in the quantum formalism.
Quantum transport enhancement by time-reversal symmetry breaking.
Zimborás, Zoltán; Faccin, Mauro; Kádár, Zoltán; Whitfield, James D; Lanyon, Ben P; Biamonte, Jacob
2013-01-01
Quantum mechanics still provides new unexpected effects when considering the transport of energy and information. Models of continuous time quantum walks, which implicitly use time-reversal symmetric Hamiltonians, have been intensely used to investigate the effectiveness of transport. Here we show how breaking time-reversal symmetry of the unitary dynamics in this model can enable directional control, enhancement, and suppression of quantum transport. Examples ranging from exciton transport to complex networks are presented. This opens new prospects for more efficient methods to transport energy and information.
Parallel Optimization of a Reversible (Quantum) Ripple-Carry Adder
DEFF Research Database (Denmark)
Thomsen, Michael Kirkedal; Axelsen, Holger Bock
2008-01-01
The design of fast arithmetic logic circuits is an important research topic for reversible and quantum computing. A special challenge in this setting is the computation of standard arithmetical functions without the generation of garbage. The CDKM-adder is a recent garbage-less reversible (quantum......(mk). We also show designs for garbage-less reversible set-less-than circuits. We compare the circuit costs of the CDKM and parallel adder in measures of circuit delay, width, gate and transistor count, and find that the parallelized adder offers significant speedups at realistic word sizes with modest...
Codd, E F
1968-01-01
Cellular Automata presents the fundamental principles of homogeneous cellular systems. This book discusses the possibility of biochemical computers with self-reproducing capability.Organized into eight chapters, this book begins with an overview of some theorems dealing with conditions under which universal computation and construction can be exhibited in cellular spaces. This text then presents a design for a machine embedded in a cellular space or a machine that can compute all computable functions and construct a replica of itself in any accessible and sufficiently large region of t
Gangadari, Bhoopal Rao; Rafi Ahamed, Shaik
2016-09-01
In biomedical, data security is the most expensive resource for wireless body area network applications. Cryptographic algorithms are used in order to protect the information against unauthorised access. Advanced encryption standard (AES) cryptographic algorithm plays a vital role in telemedicine applications. The authors propose a novel approach for design of substitution bytes (S-Box) using second-order reversible one-dimensional cellular automata (RCA(2)) as a replacement to the classical look-up-table (LUT) based S-Box used in AES algorithm. The performance of proposed RCA(2) based S-Box and conventional LUT based S-Box is evaluated in terms of security using the cryptographic properties such as the nonlinearity, correlation immunity bias, strict avalanche criteria and entropy. Moreover, it is also shown that RCA(2) based S-Boxes are dynamic in nature, invertible and provide high level of security. Further, it is also found that the RCA(2) based S-Box have comparatively better performance than that of conventional LUT based S-Box.
Optimization Approaches for Designing Quantum Reversible Arithmetic Logic Unit
Haghparast, Majid; Bolhassani, Ali
2016-03-01
Reversible logic is emerging as a promising alternative for applications in low-power design and quantum computation in recent years due to its ability to reduce power dissipation, which is an important research area in low power VLSI and ULSI designs. Many important contributions have been made in the literatures towards the reversible implementations of arithmetic and logical structures; however, there have not been many efforts directed towards efficient approaches for designing reversible Arithmetic Logic Unit (ALU). In this study, three efficient approaches are presented and their implementations in the design of reversible ALUs are demonstrated. Three new designs of reversible one-digit arithmetic logic unit for quantum arithmetic has been presented in this article. This paper provides explicit construction of reversible ALU effecting basic arithmetic operations with respect to the minimization of cost metrics. The architectures of the designs have been proposed in which each block is realized using elementary quantum logic gates. Then, reversible implementations of the proposed designs are analyzed and evaluated. The results demonstrate that the proposed designs are cost-effective compared with the existing counterparts. All the scales are in the NANO-metric area.
Learning automata an introduction
Narendra, Kumpati S
2012-01-01
This self-contained introductory text on the behavior of learning automata focuses on how a sequential decision-maker with a finite number of choices responds in a random environment. Topics include fixed structure automata, variable structure stochastic automata, convergence, 0 and S models, nonstationary environments, interconnected automata and games, and applications of learning automata. A must for all students of stochastic algorithms, this treatment is the work of two well-known scientists and is suitable for a one-semester graduate course in automata theory and stochastic algorithms.
Algebraic and Logical Characterizations of Quantum Büchi Automata%量子Büchi自动机的代数及逻辑刻画
Institute of Scientific and Technical Information of China (English)
韩召伟
2013-01-01
The notion of quantum Büchi automaton (LVBA for short )is introduced ,by means of quantum state construction , the equivalence of an LVBA and an LVSBA with crisp transition function is proved ,based on this ,the algebraic and level character-izations and also the Büchi characterization of quantum infinite regular languages are investigated ,and also the closed properties of those quantum infinite regular languages under some regular operations are dealt with .By providing the concept of monadic second-order quantum logic (LVMSO in short ) ,the monadic second-order logic characterizations of infinite regular languages recognized by quantum Büchi automata are presented ,which deepen and generalize the fundamental Büchi theorem to quantum setting .%提出量子Büchi自动机（简记为LVBA ）的概念，利用量子状态构造方法证明了一般LVBA与状态转移为经典函数的LVSBA间的相互等价性，籍此研究了量子无穷正则语言的代数刻画、层次刻画和Büchi刻画以及对于正则运算的封闭性；通过引入单体二阶量子逻辑（简记为LVMSO ）的概念，给出量子Büchi自动机所识别无穷语言的单体二阶逻辑描述，深化和推广了量子逻辑意义下的Büchi基本定理。
Scalable time reversal of Raman echo quantum memory and quantum waveform conversion of light pulse
Moiseev, E S
2013-01-01
We have found the new hidden symmetry of time reversal light-atom interaction in the photon echo quantum memory with Raman atomic transition. The time-reversed quantum memory provides generalized condition for ideal compression/decompression of time duration and wavelength conversion of the input light pulse. Based on a general analytical approach to this scheme, we have studied the optimal conditions of the light field compression/decompression in resonant atomic systems characterized by realistic spectral properties. The demonstrated effective quantum conversion of the light waveform and wavelength are also discussed for various possible realizations of the quantum memory scheme. The performed study promises new capabilities for fundamental study of the light-atom interaction and for deterministic quantum manipulation of the light field interested for quantum communication and quantum computing.
Optimized parity preserving quantum reversible full adder/subtractor
Haghparast, Majid; Bolhassani, Ali
2016-07-01
Reversible logic is one of the indispensable aspects of emerging technologies for reducing physical entropy gain, since reversible circuits do not lose information in the form of internal heat during computation. This paper aimed to initiate constructing parity preserving reversible circuits. A novel parity preserving reversible block, HB is presented. Then a new design of a cost-effective parity preserving reversible full adder/subtractor (PPFA/S) is proposed. Next, we suggested a new parity preserving binary to BCD converter. Finally, we proposed new realization of parity preserving reversible BCD adder. The proposed designs are cost-effective in terms of quantum cost and delay. All the scales are in the NANO-metric area.
Continuity Controlled Hybrid Automata
Bergstra, J. A.; Middelburg, C.A.
2004-01-01
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation of hybrid automata as timed transition systems. We also relate the synchronized product operator on hybrid automata to the parallel composition operator of the process algebra. It turns out that the f...
Design of Reversible Sequential Circuit Using Reversible Logic Synthesis
Directory of Open Access Journals (Sweden)
Md. Mosharof Hossin
2012-01-01
Full Text Available Reversible logic is one of the most vital issue at present time and it has different areas for its application, those are low power CMOS, quantum computing, nanotechnology, cryptography, optical computing, DNA computing, digital signal processing (DSP, quantum dot cellular automata, communication, computer graphics. It is not possible to realize quantum computing without implementation of reversible logic. The main purposes of designing reversible logic are to decrease quantum cost, depth of the circuits and the number of garbage outputs. In this paper, we have proposed a new reversible gate. And we have designedRS flip flop and D flip flop by using our proposed gate and Peres gate. The proposed designs are better than the existing proposed ones in terms of number of reversible gates and garbage outputs. So, this realization is more efficient and less costly than other realizations.
DEFF Research Database (Denmark)
Bahr, Patrick
2012-01-01
Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular r...
Stream Automata Are Coalgebras
Ciancia, V.; Venema, Y.
2012-01-01
Stream automata (also called ω-automata) and ω-regular languages are of paramount importance in Computer Science and Logic. A coalgebraic treatment of these structures has not been given yet. We study a simple two-sorted setting where deterministic Muller automata can be cast as coalgebras, so that
DEFF Research Database (Denmark)
Bahr, Patrick
2012-01-01
Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular...
Indian Academy of Sciences (India)
Deepak D’Souza; P S Thiagarajan
2002-04-01
We identify a subclass of timed automata called product interval automata and develop its theory. These automata consist of a network of timed agents with the key restriction being that there is just one clock for each agent and the way the clocks are read and reset is determined by the distribution of shared actions across the agents. We show that the resulting automata admit a clean theory in both logical and language theoretic terms. We also show that product interval automata are expressive enough to model the timed behaviour of asynchronous digital circuits.
Genetic Synthesis of New Reversible/Quantum Ternary Comparator
Directory of Open Access Journals (Sweden)
DEIBUK, V.
2015-08-01
Full Text Available Methods of quantum/reversible logic synthesis are based on the use of the binary nature of quantum computing. However, multiple-valued logic is a promising choice for future quantum computer technology due to a number of advantages over binary circuits. In this paper we have developed a synthesis of ternary reversible circuits based on Muthukrishnan-Stroud gates using a genetic algorithm. The method of coding chromosome is presented, and well-grounded choice of algorithm parameters allowed obtaining better circuit schemes of one- and n-qutrit ternary comparators compared with other methods. These parameters are quantum cost of received reversible devices, delay time and number of constant input (ancilla lines. Proposed implementation of the genetic algorithm has led to reducing of the device delay time and the number of ancilla qutrits to 1 and 2n-1 for one- and n-qutrits full comparators, respectively. For designing of n-qutrit comparator we have introduced a complementary device which compares output functions of 1-qutrit comparators.
Energy Technology Data Exchange (ETDEWEB)
Tsukerblat, Boris, E-mail: tsuker@bgu.ac.il, E-mail: andrew.palii@uv.es [Ben-Gurion University of the Negev, Beer-Sheva (Israel); Palii, Andrew, E-mail: tsuker@bgu.ac.il, E-mail: andrew.palii@uv.es [Institute of Applied Physics, Academy of Sciences of Moldova, Kishinev (Moldova, Republic of); Clemente-Juan, Juan Modesto; Coronado, Eugenio [Instituto de Ciencia Molecular (ICMol), Universidad de Valencia, Paterna (Spain)
2015-10-07
Our interest in this article is prompted by the vibronic problem of charge polarized states in the four-dot molecular quantum cellular automata (mQCA), a paradigm for nanoelectronics, in which binary information is encoded in charge configuration of the mQCA cell. Here, we report the evaluation of the electronic levels and adiabatic potentials of mixed-valence (MV) tetra-ruthenium (2Ru(II) + 2Ru(III)) derivatives (assembled as two coupled Creutz-Taube complexes) for which molecular implementations of quantum cellular automata (QCA) was proposed. The cell based on this molecule includes two holes shared among four spinless sites and correspondingly we employ the model which takes into account the two relevant electron transfer processes (through the side and through the diagonal of the square) as well as the difference in Coulomb energies for different instant positions of localization of the hole pair. The combined Jahn-Teller (JT) and pseudo JT vibronic coupling is treated within the conventional Piepho-Krauzs-Schatz model adapted to a bi-electronic MV species with the square-planar topology. The adiabatic potentials are evaluated for the low lying Coulomb levels in which the antipodal sites are occupied, the case just actual for utilization in mQCA. The conditions for the vibronic self-trapping in spin-singlet and spin-triplet states are revealed in terms of the two actual transfer pathways parameters and the strength of the vibronic coupling. Spin related effects in degrees of the localization which are found for spin-singlet and spin-triplet states are discussed. The polarization of the cell is evaluated and we demonstrate how the partial delocalization caused by the joint action of the vibronic coupling and electron transfer processes influences polarization of a four-dot cell. The results obtained within the adiabatic approach are compared with those based on the numerical solution of the dynamic vibronic problem. Finally, the Coulomb interaction between
Turing Automata and Graph Machines
Directory of Open Access Journals (Sweden)
Miklós Bartha
2010-06-01
Full Text Available Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the collection of such machines becomes an indexed monoidal algebra. On the analogy of the von Neumann data-flow computer architecture, Turing graph machines are proposed as potentially reversible low-level universal computational devices, and a truly reversible molecular size hardware model is presented as an example.
nLukac, Maarti; Kameyama, Michitaka
2011-01-01
It has been experimentally proven that realizing universal quantum gates using higher-radices logic is practically and technologically possible. We developed a Parallel Genetic Algorithm that synthesizes Boolean reversible circuits realized with a variety of quantum gates on qudits with various radices. In order to allow synthesizing circuits of medium sizes in the higher radix quantum space we performed the experiments using a GPU accelerated Genetic Algorithm. Using the accelerated GA we compare heuristic improvements to the mutation process based on cost minimization, on the adaptive cost of the primitives and improvements due to Baldwinian vs. Lamarckian GA. We also describe various fitness function formulations that allowed for various realizations of well known universal Boolean reversible or quantum-probabilistic circuits.
Directory of Open Access Journals (Sweden)
Ken Tokunaga
2010-08-01
Full Text Available Dynamic behavior of signal transmission through metal complexes [L5M-BL-ML5]5+ (M=Fe, Ru, Os, BL=pyrazine (py, 4,4’-bipyridine (bpy, L=NH3, which are simplified models of the molecular quantum-dot cellular automata (molecular QCA, is discussed from the viewpoint of one-electron theory, density functional theory. It is found that for py complexes, the signal transmission time (tst is Fe(0.6 fs < Os(0.7 fs < Ru(1.1 fs and the signal amplitude (A is Fe(0.05 e < Os(0.06 e < Ru(0.10 e. For bpy complexes, tst and A are Fe(1.4 fs < Os(1.7 fs < Ru(2.5 fs and Os(0.11 e < Ru(0.12 e
Information-theoretic approach to quantum error correction and reversible measurement
Nielsen, M A; Schumacher, B; Barnum, H N; Caves, Carlton M.; Schumacher, Benjamin; Barnum, Howard
1997-01-01
Quantum operations provide a general description of the state changes allowed by quantum mechanics. The reversal of quantum operations is important for quantum error-correcting codes, teleportation, and reversing quantum measurements. We derive information-theoretic conditions and equivalent algebraic conditions that are necessary and sufficient for a general quantum operation to be reversible. We analyze the thermodynamic cost of error correction and show that error correction can be regarded as a kind of ``Maxwell demon,'' for which there is an entropy cost associated with information obtained from measurements performed during error correction. A prescription for thermodynamically efficient error correction is given.
Design of Digital Adder Using Reversible Logic
Directory of Open Access Journals (Sweden)
Gowthami P
2016-02-01
Full Text Available Reversible logic circuits have promising applications in Quantum computing, Low power VLSI design, Nanotechnology, optical computing, DNA computing and Quantum dot cellular automata. In spite of them another main prominent application of reversible logic is Quantum computers where the quantum devices are essential which are ideally operated at ultra high speed with less power dissipation must be built from reversible logic components. This makes the reversible logic as a one of the most promising research areas in the past few decades. In VLSI design the delay is the one of the major issue along with area and power. This paper presents the implementation of Ripple Carry Adder (RCA circuits using reversible logic gates are discussed.
Clemente-Juan, Juan Modesto; Palii, Andrew; Coronado, Eugenio; Tsukerblat, Boris
2016-08-09
In this article, we focus on the electron-vibrational problem of the tetrameric mixed-valence (MV) complexes proposed for implementation as four-dot molecular quantum cellular automata (mQCA).1 Although the adiabatic approximation explored in ref 2 is an appropriate tool for the qualitative analysis of the basic characteristics of mQCA, like vibronic trapping of the electrons encoding binary information and cell-cell response, it loses its accuracy providing moderate vibronic coupling and fails in the description of the discrete pattern of the vibronic levels. Therefore, a precise solution of the quantum-mechanical vibronic problem is of primary importance for the evaluation of the shapes of the electron transfer optical absorption bands and quantitative analysis of the main parameters of tetrameric quantum cells. Here, we go beyond the Born-Oppenheimer paradigm and present a solution of the quantum-mechanical pseudo Jahn-Teller (JT) vibronic problem in bielectronic MV species (exemplified by the tetra-ruthenium complexes) based on the recently developed symmetry-assisted approach.3,4 The mathematical approach to the vibronic eigenproblem takes into consideration the point symmetry basis, and therefore, the total matrix of the JT Hamiltonian is blocked to the maximum extent. The submatrices correspond to the irreducible representations (irreps) of the point group. With this tool, we also extend the theory of the mQCA cell beyond the limit of prevailing Coulomb repulsion in the electronic pair (adopted in ref 2), and therefore, the general pseudo-JT problems for spin-singlet ((1)B1g, 2(1)A1g, (1)B2g, (1)Eu) ⊗ (b1g + eu) and spin-triplet states ((3)A2g, (3)B1g, 2(3)Eu) ⊗ (b1g + eu) in a square-planar bielectronic system are solved. The obtained symmetry-adapted electron-vibrational functions are employed for the calculation of the profiles (shape functions) of the charge transfer absorption bands in the tetrameric MV complexes and for the discussion of the
Simulation of Quantum Cellular Automatas Based on Quantum Genetic Algorithm%基于量子遗传算法的量子细胞自动机仿真方法
Institute of Scientific and Technical Information of China (English)
赵晓辉; 蔡理; 张鹏
2011-01-01
利用遗传算法对基于半经典模型的量子细胞自动机进行仿真时,通常会遇到多个极值,容易陷入局部最优.为将量子遗传算法用于量子细胞自动机仿真,对量子遗传算法进行改进,将二进制量子位改为多进制量子位,重新设计了量子旋转门的调整策略,并给出了具体实现步骤.通过对测试函数寻优和量子细胞自动机电路的仿真,结果表明,改进后的量子遗传算法平均误差低,不易陷入局部极值,收敛速度较快,适用于量子细胞自动机仿真.%Using genetic algorithm (GA), there are usually many extremes in the simulation of quantum cellular automatas (QCA) based on the semi-classical model and therefore it is apt to falling into local optimization. An improved quantum genetic algorithm (QGA) to displace original binary quantum bits with multistate quantum bits was proposed to use in the QCA simulation. The adjustment strategy of the quantum revolving gate was redesigned and the concrete steps to apply the improved method into the QCA simulation were also given. Through the test function optimization and QCA circuit simulation, the results show that the improved quantum genetic algorithm has many advantages, including a lower average error and a faster convergence speed, and is easy to get out local extremum. Thus the improved algorithm with more excellent performances is very suitable for the QCA simulation.
DEFF Research Database (Denmark)
Srba, Jiri
2006-01-01
We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds...
DEFF Research Database (Denmark)
Srba, Jiri
2006-01-01
We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds...
Continuity Controlled Hybrid Automata
Bergstra, J.A.; Middelburg, C.A.
2004-01-01
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation of
Continuity controlled Hybrid Automata
Bergstra, J.A.; Middelburg, C.A.
2008-01-01
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpretations of hybrid automata in the process algebra for hybrid systems and compare them with the standard interpretation of
Radix-independent, efficient arrays for multi-level n-qudit quantum and reversible computation
Mohammadi, Majid
2015-08-01
Multiple-valued quantum logic allows the designers to reduce the number of cells while obtaining more functionality in the quantum circuits. Large r-valued reversible or quantum gates ( r stands for radix and is more than 2) cannot be directly realized in the current quantum technology. Therefore, we are interested in designing the large reversible and quantum controlled gates using the arrays of one-quantum digit (qudit) or two-qudit gates. In our previous work, we proposed quantum arrays to implement the r-valued quantum circuits. In this paper, we propose novel efficient structures and arrays, for r-valued quantum logic gates. The quantum costs of the developed quantum arrays are independent of the radix of calculations in the quantum circuit.
Reverse reconciliation for continuous variable quantum key distribution
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
An efficient and practical post-processing technique based on reverse reconciliation for continuous variable quantum key distribution is proposed and simulated with low-density parity check (LDPC) codes. MultiLevel Coding/ MultiStage Decoding, which fully utilizes optimization technique such as vector quantization and iterative decoding and the optimal channel coding most close to the Shannon limit, was used to realize efficient reverse reconciliation algorithm. Simulation results showed that the proposed method can improve the secure key distribution rate to 2.2 kb/s and the coding efficiency to 0.89 over 20 km in single-mode optical fiber. Moreover, there still is room for much improvement.
Discrimination of mixed quantum states. Reversible maps and unambiguous strategies
Energy Technology Data Exchange (ETDEWEB)
Kleinmann, Matthias
2008-06-30
The discrimination of two mixed quantum states is a fundamental task in quantum state estimation and quantum information theory. In quantum state discrimination a quantum system is assumed to be in one of two possible - in general mixed - non-orthogonal quantum states. The discrimination then consists of a measurement strategy that allows to decide in which state the system was before the measurement. In unambiguous state discrimination the aim is to make this decision without errors, but it is allowed to give an inconclusive answer. Especially interesting are measurement strategies that minimize the probability of an inconclusive answer. A starting point for the analysis of this optimization problem was a result by Eldar et al. [Phys. Rev. A 69, 062318 (2004)], which provides non-operational necessary and sufficient conditions for a given measurement strategy to be optimal. These conditions are reconsidered and simplified in such a way that they become operational. The simplified conditions are the basis for further central results: It is shown that the optimal measurement strategy is unique, a statement that is e.g. of importance for the complexity analysis of optimal measurement devices. The optimal measurement strategy is derived for the case, where one of the possible input states has at most rank two, which was an open problem for many years. Furthermore, using the optimality criterion it is shown that there always exists a threshold probability for each state, such that below this probability it is optimal to exclude this state from the discrimination strategy. If the two states subject to discrimination can be brought to a diagonal structure with (2 x 2)-dimensional blocks, then the unambiguous discrimination of these states can be reduced to the unambiguous discrimination of pure states. A criterion is presented that allows to identify the presence of such a structure for two self-adjoint operators. This criterion consists of the evaluation of three
Optimization of reversible sequential circuits
Sayem, Abu Sadat Md
2010-01-01
In recent years reversible logic has been considered as an important issue for designing low power digital circuits. It has voluminous applications in the present rising nanotechnology such as DNA computing, Quantum Computing, low power VLSI and quantum dot automata. In this paper we have proposed optimized design of reversible sequential circuits in terms of number of gates, delay and hardware complexity. We have designed the latches with a new reversible gate and reduced the required number of gates, garbage outputs, and delay and hardware complexity. As the number of gates and garbage outputs increase the complexity of reversible circuits, this design will significantly enhance the performance. We have proposed reversible D-latch and JK latch which are better than the existing designs available in literature.
Adamatzky, Andrew
2015-01-01
The book gives a comprehensive overview of the state-of-the-art research and engineering in theory and application of Lattice Automata in design and control of autonomous Robots. Automata and robots share the same notional meaning. Automata (originated from the latinization of the Greek word “αυτόματον”) as self-operating autonomous machines invented from ancient years can be easily considered the first steps of robotic-like efforts. Automata are mathematical models of Robots and also they are integral parts of robotic control systems. A Lattice Automaton is a regular array or a collective of finite state machines, or automata. The Automata update their states by the same rules depending on states of their immediate neighbours. In the context of this book, Lattice Automata are used in developing modular reconfigurable robotic systems, path planning and map exploration for robots, as robot controllers, synchronisation of robot collectives, robot vision, parallel robotic actuators. All chapters are...
Applying causality principles to the axiomatization of probabilistic cellular automata
Arrighi, Pablo; Nesme, Vincent; Thierry, Eric
2011-01-01
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global evolution G is required to be shift-invariant (it acts the same everywhere) and causal (information cannot be transmitted faster than some fixed number of cells per time step). At least in the classical, reversible and quantum cases, these two top-down axiomatic conditions are sufficient to entail more bottom-up, operational descriptions of G. We investigate whether the same is true in the probabilistic case. Keywords: Characterization, noise, Markov process, stochastic Einstein locality, screening-off, common cause principle, non-signalling, Multi-party non-local box.
Membrane Automata with Priorities
Institute of Scientific and Technical Information of China (English)
Luděk Cienciala; Lucie Ciencialová
2004-01-01
In this paper the one-way P automata with priorities are introduced. Such automata are P systemshere the membranes are only allowed to consume objects from parent membranes, under the given conditions. The result of computation of these systems is the set of multiset sequences consumed by skin membrane intc the system. The rules associated in some order with each membrane cannot modify any objects, they can only move them through membrane. We show that P automata with priorities and two membranes can accept every recursively enumerated language.
Time-reversal-breaking induced quantum spin Hall effect
Luo, Wei; Shao, D. X.; Deng, Ming-Xun; Deng, W. Y.; Sheng, L.
2017-01-01
We show that quantum spin Hall (QSH) effect does not occur in a square lattice model due to cancellation of the intrinsic spin-orbit coupling coming from different hopping paths. However, we show that QSH effect can be induced by the presence of staggered magnetic fluxes alternating directions square by square. When the resulting Peierls phase takes a special value , the system has a composite symmetry ΘΡ− with Θ the time-reversal operator and Ρ− transforming the Peierls phase from γ to γ − , which protects the gapless edge states. Once the phase deviates from , the edge states open a gap, as the composite symmetry is broken. We further investigate the effect of a Zeeman field on the QSH state, and find that the edge states remain gapless for . This indicates that the QSH effect is immune to the magnetic perturbation. PMID:28220858
Efficient Design of Reversible Multiplexers with Low Quantum Cost
Directory of Open Access Journals (Sweden)
Ashima Malhotra
2014-07-01
Full Text Available Multiplexing is the generic term used to designate the operation of sending one or more analogue or digital signals over a common transmission line at dissimilar times or speeds and as such, the scheme we use to do just that is called a Multiplexer. In digital electronics, multiplexers are similarly known as data selectors as they can “select” each input line, are made from individual Analogue Switches encased in a single IC package as conflicting to the “mechanical” type selectors such as standard conservative switches and relays. In today era, reversibility has become essential part of digital world to make digital circuits more efficient. In this paper, we have proposed a new method to reduce quantum cost and power for various multiplexers. The results are simulated in Xilinx by using VHDL language.
DEFF Research Database (Denmark)
Schwartzbach, Michael Ignatieff; Meineche Smidt, Erik
to have well-known automata analogues, such as language equality, language inclusion, etc. This provides optimal or best known algorithms for the type system, by a process of translating type equations to automata, solving the analogous problem, and translating the result back to type equations. Apart......A hierarchical type system for imperative programming languages gives rise to various computational problems, such as type equivalence, type ordering, etc. We present a particular class of finite automata which are shown to be isomorphic to type equations. All the relevant type concepts turn out...... from suggesting an implementation, this connection lends a certain naturality to our type system. We also introduce a very general form of extended (recursive) type equations which are explained in terms of (monotone) alternating automata. Since types are simply equationally defined trees...
Algebraic and structural automata theory
Mikolajczak, B
1991-01-01
Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development.The result of over ten years of research, this book presents work in the following areas of Automata Theory: automata morphisms, time-varying automata, automata realizations and relationships between automata and semigroups.Aimed at those working in discrete mathematics and computer science, parts of the book are suitable for use in graduate courses in computer science, electronics, telecommunications, and control engineering. It is assumed that the reader is familiar with the basic concepts of algebra and graph theory.
量子元胞自动机器件和电路的研究进展%Research Progress of Quantum Dot Cellular Automata Devices and Circuits
Institute of Scientific and Technical Information of China (English)
杨晓阔; 蔡理; 李政操; 陈祥叶
2011-01-01
Quantum dot cellular automata (QCA) is a novel nanotechnology, the information of QCA is calculated and transferred not by the voltage or current, but by the field interaction. The computation principles, basic logic gates and clockings of two kinds of QCA (EQCA and MQCA) devices are introduced firstly. It shows that different wire structures comprised of QCA cells could realize planar crossover and transmit signals in a single layer independently. Furthermore, the experiment methods and materials to fabricate QCA devices and function arrays or circuits are summarized, and the conclusion is obtained that the development of MQCA and molecular EQCA devices would bring QCA up to the actual application level gradually. The research progresses and existent issues of QCA devices and circuits (particularly memory cell architecture) are discussed in detail. The open projects and directions in theory and application research of QCA are presented.%量子元胞自动机(QCA)是一种新颖的纳米技术,该技术不再通过电流或电压而是基于场相互作用进行信息的计算和传递.首先,综述了两种量子元胞自动机(EQCA和MQCA)器件的计算原理、基本逻辑门和时钟.指出了QCA元胞构成的不同线结构可在相同层交叉传递信号而不受影响.然后,进一步总结了制备QCA器件和功能阵列或电路的实验方法和材料,得出MQCA器件和分子EQCA器件的发展将使该器件逐步达到实际应用水平的结论.详细讨论了目前QCA器件和电路(尤其是存储单元结构)研究取得的重要进展以及面临的问题.提出了QCA器件未来理论和应用研究中的开放课题和方向.
Castagnoli, G C
1999-01-01
In former work, quantum computation has been shown to be a problem solving process essentially affected by both the reversible dynamics leading to the state before measurement, and the logical-mathematical constraints introduced by quantum measurement (in particular, the constraint that there is only one measurement outcome). This dual influence, originated by independent initial and final conditions, justifies the quantum computation speed-up and is not representable inside dynamics, namely as a one-way propagation. In this work, we reformulate von Neumann's model of quantum measurement at the light of above findings. We embed it in a broader representation based on the quantum logic gate formalism and capable of describing the interplay between dynamical and non-dynamical constraints. The two steps of the original model, namely (1) dynamically reaching a complete entanglement between pointer and quantum object and (2) enforcing the one-outcome-constraint, are unified and reversed. By representing step (2) r...
Hassan, Md Kamrul; Nahid, Nur Mohammad; Bahar, Ali Newaz; Bhuiyan, Mohammad Maksudur Rahman; Abdullah-Al-Shafi, Md; Ahmed, Kawsar
2017-08-01
Quantum-dot cellular automata (QCA) is a developing nanotechnology, which seems to be a good candidate to replace the conventional complementary metal-oxide-semiconductor (CMOS) technology. In this article, we present the dataset of average output polarization (AOP) for basic reversible logic gates presented in Ali Newaz et al. (2016) [1]. QCADesigner 2.0.3 has been employed to analysis the AOP of reversible gates at different temperature levels in Kelvin (K) unit.
Directory of Open Access Journals (Sweden)
Md. Kamrul Hassan
2017-08-01
Full Text Available Quantum-dot cellular automata (QCA is a developing nanotechnology, which seems to be a good candidate to replace the conventional complementary metal-oxide-semiconductor (CMOS technology. In this article, we present the dataset of average output polarization (AOP for basic reversible logic gates presented in Ali Newaz et al. (2016 [1]. QCADesigner 2.0.3 has been employed to analysis the AOP of reversible gates at different temperature levels in Kelvin (K unit.
DEFF Research Database (Denmark)
Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum
2004-01-01
This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European proj...... projects VHS [22] and AMETIST [17] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [20,5] specialized for cost-optimal reachability for the extended model of priced timed automata....
Designing reversible arithmetic, logic circuit to implement micro-operation in quantum computation
Kalita, Gunajit; Saikia, Navajit
2016-10-01
The futuristic computing is desired to be more power full with low-power consumption. That is why quantum computing has been a key area of research for quite some time and is getting more and more attention. Quantum logic being reversible, a significant amount of contributions has been reported on reversible logic in recent times. Reversible circuits are essential parts of quantum computers, and hence their designs are of great importance. In this paper, designs of reversible circuits are proposed using a recently proposed reversible gate for arithmetic and logic operations to implement various micro-operations (simple add and subtract, add with carry, subtract with borrow, transfer, incrementing, decrementing etc., and logic operations like XOR, XNOR, complementing etc.) in a reversible computer like quantum computer. The two new reversible designs proposed here for half adder and full adders are also used in the presented reversible circuits to implement various microoperations. The quantum costs of these designs are comparable. Many of the implemented micro-operations are not seen in previous literatures. The performances of the proposed circuits are compared with existing designs wherever available.
Arrighi, Pablo
2016-01-01
Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded speed, with respect to the distance given by the graph. Suppose, moreover, that the graph itself is subject to the evolution, and may be driven to be in a quantum superposition of graphs---in accordance to the superposition principle. We show that these unitary causal operators must decompose as a finite-depth circuit of local unitary gates. This unifies a result on Quantum Cellular Automata with another on Reversible Causal Graph Dynamics. Along the way we formalize a notion of causality which is valid in the context of quantum superpositions of time-varying graphs, and has a number of good properties. Keywords: Quantum Lattice Gas Automata, Block-representation, Curtis-Hedlund-Lyndon, No-signalling, Localizability, Quantum Gravity, Quantum Graphity, Causal Dynamical Triangula...
Energy Technology Data Exchange (ETDEWEB)
Goderis, D.; Maes, C. (Liege Univ. (BE))
1991-01-01
The relation between certain quantum systems and classical stochastic processes - e.g. in the method of functional integration - is formulated on the level of the dynamics for both quantum and classical dissipative time evolutions. An essentially unique quantum dissipation is constructed from a classical interacting spin system, preserving the notion of detailed balance. Translation invariant and reversible infinite volume quantum dynamics are found in this way and the Hamiltonian is recovered from the action of the generator in the GNS-representation of the corresponding groundstate for which a Feynmann-Kac formula holds. Local reversibility of quantum dissipations is shown to give rise to an almost classical characterization of the corresponding quantum states.
Ham, Byoung S
2008-09-01
A method of reversible quantum optical data storage is presented using resonant Raman field excited spin coherence, where the spin coherence is stored in an inhomogeneously broadened spin ensemble. Unlike the photon echo method, in the present technique, a 2pi Raman optical rephasing pulse area is used and multimode (parallel) optical channels are available in which the multimode access gives a great benefit to quantum information processors such as quantum repeaters.
Automata, universality, computation tribute to Maurice Margenstern
2015-01-01
This book is an intellectually stimulating excursion into mathematical machines and structures capable for a universal computation. World top experts in computer science and mathematics overview exciting and intriguing topics of logical theory of monoids, geometry of Gauss word, philosophy of mathematics in computer science, asynchronous and parallel P-systems, decidability in cellular automata, splicing systems, reversible Turing machines, information flows in two-way finite automata, prime generators in automaton arrays, Grossone and Turing machines, automaton models of atomic lattices. The book is full of visually attractive examples of mathematical machines, open problems and challenges for future research. Those interested in the advancement of a theory of computation, philosophy of mathematics, future and emergent computing paradigms, architectures and implementations will find the book vital for their research and development.
Reverse reconciliation protocols for quantum cryptography with continuous variables
Grosshans, F; Grosshans, Fr\\'ed\\'eric; Grangier, Philippe
2002-01-01
We introduce new quantum key distribution protocols using quantum continuous variables, that are secure against individual attacks for any transmission of the optical line between Alice and Bob. In particular, it is not required that this transmission is larger than 50 %. Though squeezing or entanglement may be helpful, they are not required, and there is no need for quantum memories or entanglement purification. These protocols can thus be implemented using coherent states and homodyne detection, and they may be more efficient than usual protocols using quantum discrete variables.
The criterion for time symmetry of probabilistic theories and the reversibility of quantum mechanics
Holster, A. T.
2003-10-01
Physicists routinely claim that the fundamental laws of physics are 'time symmetric' or 'time reversal invariant' or 'reversible'. In particular, it is claimed that the theory of quantum mechanics is time symmetric. But it is shown in this paper that the orthodox analysis suffers from a fatal conceptual error, because the logical criterion for judging the time symmetry of probabilistic theories has been incorrectly formulated. The correct criterion requires symmetry between future-directed laws and past-directed laws. This criterion is formulated and proved in detail. The orthodox claim that quantum mechanics is reversible is re-evaluated. The property demonstrated in the orthodox analysis is shown to be quite distinct from time reversal invariance. The view of Satosi Watanabe that quantum mechanics is time asymmetric is verified, as well as his view that this feature does not merely show a de facto or 'contingent' asymmetry, as commonly supposed, but implies a genuine failure of time reversal invariance of the laws of quantum mechanics. The laws of quantum mechanics would be incompatible with a time-reversed version of our universe.
Magnetic reversal dynamics of a quantum system on a picosecond timescale.
Klenov, Nikolay V; Kuznetsov, Alexey V; Soloviev, Igor I; Bakurskiy, Sergey V; Tikhonova, Olga V
2015-01-01
We present our approach for a consistent, fully quantum mechanical description of the magnetization reversal process in natural and artificial atomic systems by means of short magnetic pulses. In terms of the simplest model of a two-level system with a magnetic moment, we analyze the possibility of a fast magnetization reversal on the picosecond timescale induced by oscillating or short unipolar magnetic pulses. We demonstrate the possibility of selective magnetization reversal of a superconducting flux qubit using a single flux quantum-based pulse and suggest a promising, rapid Λ-scheme for resonant implementation of this process. In addition, the magnetization reversal treatment is fulfilled within the framework of the macroscopic theory of the magnetic moment, which allows for the comparison and explanation of the quantum and classical behavior.
A compositional Translation of Stochastic Automata into Timed Automata
d' Argenio, P.R.
We present a translation from stochastic automata [17, 16] into timed automata with deadlines [37, 13]. The translation preserves traces when the stochastic characteristics, namely the probability measures, are abstracted from the original stochastic automaton. Moreover, we show that the translation
Reactive Programming of Cellular Automata
Boussinot, Frédéric
2004-01-01
Implementation of cellular automata using reactive programming gives a way to code cell behaviors in an abstract and modular way. Multiprocessing also becomes possible. The paper describes the implementation of cellular automata with the reactive programming language LOFT, a thread-based extension of C. Self replicating loops considered in artificial life are coded to show the interest of the approach.
Single spin measurement using cellular automata techniques
Perez-Delgado, C A; Cory, D G; Mosca, M; Cappellaro, Paola; Cory, David G.; Mosca, Michele; Perez-Delgado, Carlos A.
2006-01-01
We propose an approach for single spin measurement. Our method uses techniques from the theory of quantum cellular automata to correlate a large amount of ancillary spins to the one to be measured. It has the distinct advantage of being efficient, and to a certain extent fault-tolerant. Under ideal conditions, it requires the application of only order of cube root of N steps (each requiring a constant number of rf pulses) to create a system of N correlated spins. It is also fairly robust against pulse errors, imperfect initial polarization of the ancilla spin system, and does not rely on entanglement. We study the scalability of our scheme through numerical simulation.
Cellular automata analysis and applications
Hadeler, Karl-Peter
2017-01-01
This book focuses on a coherent representation of the main approaches to analyze the dynamics of cellular automata. Cellular automata are an inevitable tool in mathematical modeling. In contrast to classical modeling approaches as partial differential equations, cellular automata are straightforward to simulate but hard to analyze. In this book we present a review of approaches and theories that allow the reader to understand the behavior of cellular automata beyond simulations. The first part consists of an introduction of cellular automata on Cayley graphs, and their characterization via the fundamental Cutis-Hedlund-Lyndon theorems in the context of different topological concepts (Cantor, Besicovitch and Weyl topology). The second part focuses on classification results: What classification follows from topological concepts (Hurley classification), Lyapunov stability (Gilman classification), and the theory of formal languages and grammars (Kůrka classification). These classifications suggest to cluster cel...
Time-reversal symmetry breaking in quantum billiards
Energy Technology Data Exchange (ETDEWEB)
Schaefer, Florian
2009-01-26
The present doctoral thesis describes experimentally measured properties of the resonance spectra of flat microwave billiards with partially broken timereversal invariance induced by an embedded magnetized ferrite. A vector network analyzer determines the complex scattering matrix elements. The data is interpreted in terms of the scattering formalism developed in nuclear physics. At low excitation frequencies the scattering matrix displays isolated resonances. At these the effect of the ferrite on isolated resonances (singlets) and pairs of nearly degenerate resonances (doublets) is investigated. The hallmark of time-reversal symmetry breaking is the violation of reciprocity, i.e. of the symmetry of the scattering matrix. One finds that reciprocity holds in singlets; it is violated in doublets. This is modeled by an effective Hamiltonian of the resonator. A comparison of the model to the data yields time-reversal symmetry breaking matrix elements in the order of the level spacing. Their dependence on the magnetization of the ferrite is understood in terms of its magnetic properties. At higher excitation frequencies the resonances overlap and the scattering matrix elements fluctuate irregularly (Ericson fluctuations). They are analyzed in terms of correlation functions. The data are compared to three models based on random matrix theory. The model by Verbaarschot, Weidenmueller and Zirnbauer describes time-reversal invariant scattering processes. The one by Fyodorov, Savin and Sommers achieves the same for systems with complete time-reversal symmetry breaking. An extended model has been developed that accounts for partial breaking of time-reversal invariance. This extended model is in general agreement with the data, while the applicability of the other two models is limited. The cross-correlation function between forward and backward reactions determines the time-reversal symmetry breaking matrix elements of the Hamiltonian to up to 0.3 mean level spacings. Finally
A compact topology for sand automata
Dennunzio, Alberto; Masson, Benoît
2008-01-01
In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology for sand automata, and a new context in which sand automata are homeomorphic to cellular automata acting on a specific subshift. We show that the existing topological results for sand automata, including the Hedlund-like representation theorem, still hold. In this context, we give a characterization of the cellular automata which are sand automata, and study some dynamical behaviors such as equicontinuity. Furthermore, we deal with the nilpotency. We show that the classical definition is not meaningful for sand automata. Then, we introduce a suitable new notion of nilpotency for sand automata. Finally, we prove that this simple dynamical behavior is undecidable.
Institute of Scientific and Technical Information of China (English)
彭川
2012-01-01
为了有效改进细胞自动机加密系统的实现复杂度和加解密效率,提出了一种二阶可逆耦合触发细胞自动机的图像加密方法.通过对简单的可逆细胞自动机进行扩展,构造二阶可逆细胞自动机,并以耦合触发规则对明文图像实行分块加密.二阶可逆细胞自动机的转移状态由其当前状态以及前一状态决定,有效增大了邻域范围,并且因为采用耦合触发规则,因此能明显增大加密系统的密钥空间,保证了系统的计算安全性.与一般触发自动机反向迭代的串行加密方式相比,该方法对于每个细胞的加密具有本质并行性,因此具有极高的加解密效率.通过实验验证其性能,结果表明与其它算法相比,该算法具有较大的密钥空间,能够有效抵抗蛮力攻击和差分分析攻击,且较小的邻域半径即可得到良好的加密效果,因此非常便于硬件实现.%To effectively improve the implement complexity and execution efficiency, an algorithm for image encryption is proposed which is based on two-order reversible couple toggle cellular automata (CA). By ways that extending the structure of simple reversible CA (RCA) and adopting couple toggle rules, the algorithm ciphers image which is divided into blocks previously. The CA's state is determined by previous state and next state, so it has larger key space and this can make system safe enough. Compared with general toggle CA (TCA) methods, the algorithm has much better efficiency because each cell is updated parallel Experiments and analysis indicate that this method has an enough large key space, high cipher and decipher speed and good scrambling effect. And the cryptosystem can resist brute attack and differential attack effectively.
Kumar, Shailesh
2010-01-01
A cellular automata (CA) configuration is constructed that exhibits emergent failover. The configuration is based on standard Game of Life rules. Gliders and glider-guns form the core messaging structure in the configuration. The blinker is represented as the basic computational unit, and it is shown how it can be recreated in case of a failure. Stateless failover using primary-backup mechanism is demonstrated. The details of the CA components used in the configuration and its working are described, and a simulation of the complete configuration is also presented.
Ollinger, Nicolas
2002-01-01
Jury : François Blanchard (Rapporteur), Marianne Delorme (Directeur), Jarkko Kari (Président), Jacques Mazoyer (Directeur), Dominique Perrin, Géraud Sénizergues (Rapporteur); Cellular automata provide a uniform framework to study an important problem of "complex systems" theory: how and why do system with a easily understandable -- local -- microscopic behavior can generate a more complicated -- global -- macroscopic behavior? Since its introduction in the 40s, a lot of work has been done to ...
Quantum Dots-based Reverse Phase Protein Microarray
Energy Technology Data Exchange (ETDEWEB)
Shingyoji, Masato; Gerion, Daniele; Pinkel, Dan; Gray, Joe W.; Chen, Fanqing
2005-07-15
CdSe nanocrystals, also called quantum dots (Qdots) are a novel class of fluorophores, which have a diameter of a few nanometers and possess high quantum yield, tunable emission wavelength and photostability. They are an attractive alternative to conventional fluorescent dyes. Quantum dots can be silanized to be soluble in aqueous solution under biological conditions, and thus be used in bio-detection. In this study, we established a novel Qdot-based technology platform that can perform accurate and reproducible quantification of protein concentration in a crude cell lysate background. Protein lysates have been spiked with a target protein, and a dilution series of the cell lysate with a dynamic range of three orders of magnitude has been used for this proof-of-concept study. The dilution series has been spotted in microarray format, and protein detection has been achieved with a sensitivity that is at least comparable to standard commercial assays, which are based on horseradish peroxidase (HRP) catalyzed diaminobenzidine (DAB) chromogenesis. The data obtained through the Qdot method has shown a close linear correlation between relative fluorescence unit and relative protein concentration. The Qdot results are in almost complete agreement with data we obtained with the well-established HRP-DAB colorimetric array (R{sup 2} = 0.986). This suggests that Qdots can be used for protein quantification in microarray format, using the platform presented here.
Weighted Watson-Crick automata
Energy Technology Data Exchange (ETDEWEB)
Tamrin, Mohd Izzuddin Mohd [Department of Information System, Kulliyyah of Information and Communication Technology, International Islamic University Malaysia, 50728 Gombak, Selangor (Malaysia); Turaev, Sherzod; Sembok, Tengku Mohd Tengku [Department of Computer Science, Kulliyyah of Information and Communication Technology, International Islamic University Malaysia, 50728 Gombak, Selangor (Malaysia)
2014-07-10
There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power.
Weighted Watson-Crick automata
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.
Quantum Interactomics and Cancer Molecular Mechanisms: I. Report Outline
Baianu, I C
2004-01-01
Single cell interactomics in simpler organisms, as well as somatic cell interactomics in multicellular organisms, involve biomolecular interactions in complex signalling pathways that were recently represented in modular terms by quantum automata with ‘reversible behavior’ representing normal cell cycling and division. Other implications of such quantum automata, modular modeling of signaling pathways and cell differentiation during development are in the fields of neural plasticity and brain development leading to quantum-weave dynamic patterns and specific molecular processes underlying extensive memory, learning, anticipation mechanisms and the emergence of human consciousness during the early brain development in children. Cell interactomics is here represented for the first time as a mixture of ‘classical’ states that determine molecular dynamics subject to Boltzmann statistics and ‘steady-state’, metabolic (multi-stable) manifolds, together with ‘configuration’ spaces of metastable quant...
An Improved Structure Of Reversible Adder And Subtractor
Directory of Open Access Journals (Sweden)
Aakash Gupta
2013-03-01
Full Text Available In today’s world everyday a new technology which is faster, smaller and more complex than its predecessor is being developed. The increased number of transistors packed onto a chip of a conventional system results in increased power consumption that is why Reversible logic has drawn attention of Researchers due to its less heat dissipating characteristics. Reversible logic can be imposed over applications such as quantum computing, optical computing, quantum dot cellular automata, low power VLSI circuits, DNA computing. This paper presents the reversible combinational circuit of adder, subtractor and parity preserving subtractor. The suggested circuit in this paper are designed using Feynman, Double Feynman and MUX gates which are better than the existing one in literature in terms of Quantum cost, Garbage output and Total logical calculations.
Uzdin, Raam
2016-08-01
Collective behavior, where a set of elements interact and generate effects that are beyond the reach of the individual noninteracting elements, is always of great interest in physics. Quantum collective effects that have no classical analog are even more intriguing. In this work, we show how to construct collective quantum heat machines and explore their performance boosts with respect to regular machines. Without interactions between the machines, the individual units operate in a stochastic, nonquantum manner. The construction of the collective machine becomes possible by introducing two simple quantum operations: coherence extraction and coherence injection. Together, these operations can harvest coherence from one engine and use it to boost the performance of a slightly different engine. For weakly driven engines, we show that the collective work output scales quadratically with the number of engines rather than linearly. Eventually, the boost saturates and then becomes linear. Nevertheless, even in saturation, work is still significantly boosted compared to individual operation. To study the reversibility of the collective machine, we introduce the "entropy-pollution" measure. It is shown that there is a regime where the collective machine is N times more reversible while producing N times more work, compared to the individual operation of N units. Moreover, the collective machine can even be more reversible than the most reversible unit in the collective. This high level of reversibility becomes possible due to a special symbiotic mechanism between engine pairs.
Orlova, A O; Gromova, Yu A; Maslov, V G; Andreeva, O V; Baranov, A V; Fedorov, A V; Prudnikau, A V; Artemyev, M V; Berwick, K
2013-08-23
The photoluminescence response of semiconductor CdSe/ZnS quantum dots embedded in a borosilicate porous glass matrix to exposure to ammonia vapor is investigated. The formation of surface complexes on the quantum dots results in quenching of the photoluminescence and a shortening of the luminescence decay time. The process is reversible, desorption of ammonia molecules from the quantum dot surface causes the photoluminescence to recover. The sensitivity of the quantum dot luminescence intensity and decay time to the interaction time and the reversibility of the photoluminescence changes make the CdSe/ZnS quantum dots in porous glass system a candidate for use as an optical sensor of ammonia.
Orlova, A. O.; Gromova, Yu A.; Maslov, V. G.; Andreeva, O. V.; Baranov, A. V.; Fedorov, A. V.; Prudnikau, A. V.; Artemyev, M. V.; Berwick, K.
2013-08-01
The photoluminescence response of semiconductor CdSe/ZnS quantum dots embedded in a borosilicate porous glass matrix to exposure to ammonia vapor is investigated. The formation of surface complexes on the quantum dots results in quenching of the photoluminescence and a shortening of the luminescence decay time. The process is reversible, desorption of ammonia molecules from the quantum dot surface causes the photoluminescence to recover. The sensitivity of the quantum dot luminescence intensity and decay time to the interaction time and the reversibility of the photoluminescence changes make the CdSe/ZnS quantum dots in porous glass system a candidate for use as an optical sensor of ammonia.
Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding
Lai, Hong; Zhang, Jun; Luo, Ming-Xing; Pan, Lei; Pieprzyk, Josef; Xiao, Fuyuan; Orgun, Mehmet A.
2016-08-01
With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by m-bonacci sequences to detect eavesdropping. Meanwhile, we encode m-bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications.
Institute of Scientific and Technical Information of China (English)
Bai Xu-Fang; Chi Feng; Zheng Jun; Li Yi-Nan
2012-01-01
We propose to generate and reverse the spin accumulation in a quantum dot (QD) by using the temperature difference between the two ferromagnetic leads connected to the dot.The electrons are driven purely by the temperature gradient in the absence of an electric bias and a magnetic field.In the Coulomb blockade regime,we find two ways to reverse the spin accumulation.One is by adjusting the QD energy level with a fixed temperature gradient,and the other is by reversing the temperature gradient direction for a fixed value of the dot level.The spin accumulation in the QD can be enhanced by the magnitudes of both the leads' spin polarization and the asymmetry of the dot-lead coupling strengths.The present device is quite simple,and the obtained results may have practical usage in spintronics or quantum information processing.
Energy Games in Multiweighted Automata
DEFF Research Database (Denmark)
Fahrenberg, U.; Juhl, L.; Larsen, Kim Guldstrand;
2011-01-01
Energy games have recently attracted a lot of attention. These are games played on finite weighted automata and concern the existence of infinite runs subject to boundary constraints on the accumulated weight, allowing e.g only for behaviours where a resource is always available (nonnegative...... accumulated weight), yet does not exceed a given maximum capacity. We extend energy games to a multiweighted and parameterized setting, allowing us to model systems with multiple quantitative aspects. We present reductions between Petri nets and multiweighted automata and among different types...... of multiweighted automata and identify new complexity and (un)decidability results for both one- and two-player games. We also investigate the tractability of an extension of multiweighted energy games in the setting of timed automata....
Faulkner, Nicholas
2012-01-01
We study some dynamical properties of a family of two-dimensional cellular automata: those that arise from an underlying one dimensional sand automaton whose local rule is obtained using a latin square. We identify a simple sand automaton G whose local rule is algebraic, and classify this automaton as having equicontinuity points, but not being equicontinuous. We also show it is not surjective. We generalise some of these results to a wider class of sand automata.
Reversible Carriers Tunnelling in Asymmetric Coupled InGaN/GaN Quantum Wells
Institute of Scientific and Technical Information of China (English)
PEI Xiao-Jiang; GUO Li-Wei; WANG Yang; WANG Xiao-Hui; JIA Hai-Qiang; CHEN Hong; ZHOU Jun-Ming; WANG Li; Tamai N
2008-01-01
Temperature-dependent photoluminescence (PL) and time resolved photoluminescence (TRPL) are performed to study the PL characteristics and carrier transfer mechanism in asymmetric coupled InGaN/GaN multiple quantum wells (AS-QWs). Our results reveal that abnormal carrier tunnelling from the wide quantum well (WQW) to the narrow quantum well (NQW) is observed at temperature higher than about lOOK, while a normal carrier tunnelling from the NQW to the WQW is observed at temperature lower than 100 K. The reversible carrier tunnelling between the two QWs makes it possible to explore new types of temperature sensitive emission devices.It is shown that PL internal quantum efficiency (IQE) of the NQW is enhanced to about 46% due to the assistant of the abnormal carrier tunnelling.
A Novel Quantum Cost Efficient Reversible Full Adder Gate in Nanotechnology
Islam, Md Saiful
2010-01-01
Reversible logic has become one of the promising research directions in low power dissipating circuit design in the past few years and has found its applications in low power CMOS design, cryptography, optical information processing and nanotechnology. This paper presents a novel and quantum cost efficient reversible full adder gate in nanotechnology. This gate can work singly as a reversible full adder unit and requires only one clock cycle. The proposed gate is a universal gate in the sense that it can be used to synthesize any arbitrary Boolean functions. It has been demonstrated that the hardware complexity offered by the proposed gate is less than the existing counterparts. The proposed reversible full adder gate also adheres to the theoretical minimum established by the researchers.
Xiao, Xing; Yao, Yao; Xie, Ying-Mao; Wang, Xing-Hua; Li, Yan-Ling
2016-09-01
Based on the quantum technique of weak measurement, we propose a scheme to protect the entanglement from correlated amplitude damping decoherence. In contrast to the results of memoryless amplitude damping channel, we show that the memory effects play a significant role in the suppression of entanglement sudden death and protection of entanglement under severe decoherence. Moreover, we find that the initial entanglement could be drastically amplified by the combination of weak measurement and quantum measurement reversal even under the correlated amplitude damping channel. The underlying mechanism can be attributed to the probabilistic nature of weak measurements.
Continuity and invariance in hybrid automata
Lygeros, John; Johansson, Karl H.; Simic, Slobodan; ZHANG, JUN; Sastry, Shankar
2001-01-01
Hybrid automata have been proposed as a language for modelling and analysing the interaction of digital and analogue dynamics in embedded computer systems. In the paper, hybrid automata are studied from a dynamical systems perspective. Extending earlier work on conditions for existence and uniqueness of executions of hybrid automata, we characterise a class of hybrid automata whose executions depend continuously on the initial state. The continuity conditions are subsequently used to derive a...
Reverse the force direction at long distance by quantum corrections with a mass
Chen, X S
2005-01-01
We demonstrate that quantum corrections can possibly reverse the sign of the one-particle-exchange potential (OPEP) at long distance if (and under general assumptions, only if) the exchanged particle has a mass $m$, either intrinsic or effective. Such phenomenon requires a running coupling constant $\\alpha(q^2)$ satisfying $\\alpha (-m^2)<0$ in the off-shell renormalization scheme. Reversal of the OPEP sign at long distance (and hence attraction transits to repulsion, or vice versa) may have important implications for gravity and cosmic acceleration, particle and nuclear physics, and also condensed matter properties such as superconductivity.
Design of a Ternary Reversible/Quantum Adder using Genetic Algorithm
Directory of Open Access Journals (Sweden)
Vitaly G. Deibuk
2015-08-01
Full Text Available —Typical methods of quantum/reversible synthesis are based on using the binary character of quantum computing. However, multi-valued logic is a promising choice for future computer technologies, given a set of advantages when comparing to binary circuits. In this work, we have developed a genetic algorithm-based synthesis of ternary reversible circuits using Muthukrishnan-Stroud gates. The method for chromosomes coding that we present, as well as a judicious choice of algorithm parameters, allowed obtaining circuits for half-adder and full adder which are better than other published methods in terms of cost, delay times and amount of input ancillary bits. A structure of the circuits is analyzed in details, based on their decomposition.
Directory of Open Access Journals (Sweden)
Alexis De Vos
2011-06-01
Full Text Available Whereas quantum computing circuits follow the symmetries of the unitary Lie group, classical reversible computation circuits follow the symmetries of a finite group, i.e., the symmetric group. We confront the decomposition of an arbitrary classical reversible circuit with w bits and the decomposition of an arbitrary quantum circuit with w qubits. Both decompositions use the control gate as building block, i.e., a circuit transforming only one (qubit, the transformation being controlled by the other w−1 (qubits. We explain why the former circuit can be decomposed into 2w − 1 control gates, whereas the latter circuit needs 2w − 1 control gates. We investigate whether computer circuits, not based on the full unitary group but instead on a subgroup of the unitary group, may be decomposable either into 2w − 1 or into 2w − 1 control gates.
Experimental Test of the State Estimation-Reversal Tradeoff Relation in General Quantum Measurements
Directory of Open Access Journals (Sweden)
Geng Chen
2014-06-01
Full Text Available When a measurement has limited strength, only partial information, regarding the initial state, is extracted, and, correspondingly, there is a probability to reverse its effect on the system and retrieve the original state. Recently, a clear and direct quantitative description of this complementary relationship, in terms of a tradeoff relation, was developed by Y. K. Cheong and S. W. Lee. [Phys. Rev. Lett. 109, 150402 (2012]. Here, this tradeoff relation is experimentally verified using polarization-encoded single photons from a quantum dot. Measurement operators representing a complete range, from not affecting the system to a projection to a single polarization state, are realized. In addition, for each measurement operator, an optimal reversal operator is also implemented. The upper bound of the tradeoff relation is mapped to experimental parameters representing the measurement strength. Our results complement the theoretical work and provide a hands-on characterization of general quantum measurements.
Semiclassical matrix model for quantum chaotic transport with time-reversal symmetry
Energy Technology Data Exchange (ETDEWEB)
Novaes, Marcel, E-mail: marcel.novaes@gmail.com
2015-10-15
We show that the semiclassical approach to chaotic quantum transport in the presence of time-reversal symmetry can be described by a matrix model. In other words, we construct a matrix integral whose perturbative expansion satisfies the semiclassical diagrammatic rules for the calculation of transport statistics. One of the virtues of this approach is that it leads very naturally to the semiclassical derivation of universal predictions from random matrix theory.
Automata theory and its applications
Khoussainov, Bakhadyr
2001-01-01
The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's ...
Institute of Scientific and Technical Information of China (English)
李政操; 蔡理; 黄宏图
2012-01-01
介绍了一种量子元胞自动机(QCA)可编程逻辑阵列结构,该结构可用于实现量子元胞自动机大规模可编程逻辑电路,采用QCADesigner仿真软件研究了元胞缺失、移位缺陷和未对准缺陷对可编程逻辑阵列单元逻辑功能的影响.得出了特定结构下,每个元胞移位缺陷和未对准缺陷的最大错位距离,以及导线模式中存在特定位置的8个可缺失元胞.这为缺陷单元的应用提供了一个具体的参数标准,提高了PLA阵列的单元利用率.%A programmable logic array (PLA) structure that can be used in the large scale integrated circuit using quantum-dot cellular automata (QCA) was introduced. The effects of the cell omission , cell misalignment and cell displacement on the PLA were researched by QCADesigner. And the maximum fault-tolerant ranges of displacement and misalignment for each cell were obtained for a certain structure. Besides that, the 8-cell omission defect in the wire mode was also achieved. The research provides a concrete parameter criterion for applying defect units normally, and advances the utilizing rate of the cell.
Zhang, Yanliang; Fang, Maofa; Kang, Guodong; Zhou, Qingping
2015-08-01
We have investigated the dynamic features of the quantum-memory-assisted entropic uncertainty relation (QMA EUR) in the amplitude damping (AD) channel. The initial state of qubit system and quantum memory system shared between Alice and Bob is assumed as extended by Werner-like (EWL) state. To reduce the amount of entropic uncertainty of Pauli observables in this noisy channel, we presented a reduction scheme by means of weak measurements (WMs) and weak measurement reversals (WMRs) before and after the entangled system subjecting to the noisy channel. It is shown that the prior WM and poster WMR can effectively reduce quantity of entropic uncertainty, but the poster WM operation cannot played a positive role on reduction of quantity of entropic uncertainty. We hope that our proposal could be verified experimentally and might possibly have future applications in quantum information processing.
Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology
Directory of Open Access Journals (Sweden)
Ville Salo
2012-08-01
Full Text Available We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also, reversible automata form a closed set, while surjective ones are dense. The second topology, which is induced by a metric, is studied in more detail. Continuity of composition (under certain restrictions and inversion, as well as closedness of the set of surjective automata, are proved, and some counterexamples are given. We then generalize this space, in the sense that every shift-invariant measure on the configuration space induces a pseudometric on cellular automata, and study the properties of these spaces. We also characterize the pseudometric spaces using the Besicovitch distance, and show a connection to the first (pathological space.
Height-Deterministic Pushdown Automata
DEFF Research Database (Denmark)
Nowotka, Dirk; Srba, Jiri
2007-01-01
of regular languages and still closed under boolean language operations, are considered. Several of such language classes have been described in the literature. Here, we suggest a natural and intuitive model that subsumes all the formalisms proposed so far by employing height-deterministic pushdown automata...
Confluence reduction for Markov automata
Timmer, Mark; Pol, van de Jaco; Stoelinga, Mariëlle
2013-01-01
Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosion threatens the analysability of the models gener
Algebraic Systems and Pushdown Automata
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.
Free fall and cellular automata
Directory of Open Access Journals (Sweden)
Pablo Arrighi
2016-03-01
Full Text Available Three reasonable hypotheses lead to the thesis that physical phenomena can be described and simulated with cellular automata. In this work, we attempt to describe the motion of a particle upon which a constant force is applied, with a cellular automaton, in Newtonian physics, in Special Relativity, and in General Relativity. The results are very different for these three theories.
About Strongly Universal Cellular Automata
Directory of Open Access Journals (Sweden)
Maurice Margenstern
2013-09-01
Full Text Available In this paper, we construct a strongly universal cellular automaton on the line with 11 states and the standard neighbourhood. We embed this construction into several tilings of the hyperbolic plane and of the hyperbolic 3D space giving rise to strongly universal cellular automata with 10 states.
Electric-field-controlled spin reversal in a quantum dot with ferromagnetic contacts
Hauptmann, J. R.; Paaske, J.; Lindelof, P. E.
2008-05-01
Manipulation of the spin states of a quantum dot by purely electrical means is a highly desirable property of fundamental importance for the development of spintronic devices such as spin filters, spin transistors and single spin memories as well as for solid-state qubits. An electrically gated quantum dot in the Coulomb blockade regime can be tuned to hold a single unpaired spin-1/2, which is routinely spin polarized by an applied magnetic field. Using ferromagnetic electrodes, however, the quantum dot becomes spin polarized by the local exchange field. Here, we report on the experimental realization of this tunnelling-induced spin splitting in a carbon-nanotube quantum dot coupled to ferromagnetic nickel electrodes with a strong tunnel coupling ensuring a sizeable exchange field. As charge transport in this regime is dominated by the Kondo effect, we can use this sharp many-body resonance to read off the local spin polarization from the measured bias spectroscopy. We demonstrate that the exchange field can be compensated by an external magnetic field, thus restoring a zero-bias Kondo resonance, and we demonstrate that the exchange field itself, and hence the local spin polarization, can be tuned and reversed merely by tuning the gate voltage.
THE RELATIONSHIPS OF THREE ELEMENTARY CELLULAR AUTOMATA
Institute of Scientific and Technical Information of China (English)
Zhisong JIANG
2006-01-01
Limit language complexity of cellular automata which is first posed by S. Wolfram has become a new branch of cellular automata. In this paper, we obtain two interesting relationships between elementary cellular automata of rules 126, 146(182) and 18, and prove that if the limit language of rule 18 is not regular, nor are the limit languages of rules 126 and 146(182).
Linear Parametric Model Checking of Timed Automata
DEFF Research Database (Denmark)
Hune, Tohmas Seidelin; Romijn, Judi; Stoelinga, Mariëlle
2001-01-01
of a subclass of parametric timed automata (L/U automata), for which the emptiness problem is decidable, contrary to the full class where it is know to be undecidable. Also we present a number of lemmas enabling the verication eort to be reduced for L/U automata in some cases. We illustrate our approach......We present an extension of the model checker Uppaal capable of synthesize linear parameter constraints for the correctness of parametric timed automata. The symbolic representation of the (parametric) state-space is shown to be correct. A second contribution of this paper is the identication...
Polycation-Capped CdS Quantum Dots Synthesized in Reverse Microemulsions
Directory of Open Access Journals (Sweden)
Karina Lemke
2012-01-01
Full Text Available This paper is focused on the formation and recovery of cadmium sulfide (CdS nanoparticles in two different types of polycation-modified reverse microemulsions using low molecular weight poly(diallyldimethylammonium chloride (PDADMAC and poly(ethyleneimine (PEI. Both polymers were incorporated in a quaternary w/o microemulsion consisting of water, toluene-pentanol (1 : 1, and sodium dodecyl sulfate (SDS, as well as in a ternary w/o microemulsion consisting of water, heptanol, and 3-(N,N-dimethyl-dodecylammonio-propanesulfonate (SB. UV-vis and fluorescence measurements in the microemulsion illustrate the capping effect of the polycations on the formation of the CdS quantum dots. The nanoparticles are redispersed in water and characterized by using UV-vis and fluorescence spectroscopy, in combination with dynamic light scattering. From the quaternary microemulsion, only nanoparticle aggregates of about 100 nm can be redispersed, but, from the ternary microemulsion, well-stabilized polycation-capped CdS quantum dots can be obtained. The results show that the electrostatic interactions between the polycation and the surfactant are of high relevance especially in the solvent evaporation and redispersion process. That means only that in the case of moderate polycation-surfactant interactions a redispersion of the polymer-capped CdS quantum dots without problems of aggregation is possible.
Interface Input/Output Automata
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand; Nyman, Ulrik; Wasowski, Andrzej
2006-01-01
Building on the theory of interface automata by de Alfaro and Henzinger we design an interface language for Lynch’s I/O, a popular formalism used in the development of distributed asynchronous systems, not addressed by previous interface research. We introduce an explicit separation of assumptions...... from guarantees not yet seen in other behavioral interface theories. Moreover we derive the composition operator systematically and formally, guaranteeing that the resulting compositions are always the weakest in the sense of assumptions, and the strongest in the sense of guarantees. We also present...... a method for solving systems of relativized behavioral inequalities as used in our setup and draw a formal correspondence between our work and interface automata....
Information Flow for Timed Automata
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis; Vasilikos, Panagiotis
2017-01-01
One of the key demands of cyberphysical systems is that they meet their safety goals. Timed Automata has established itself as a formalism for modelling and analysing the real-time safety aspects of cyberphysical systems. Increasingly it is also demanded that cyberphysical systems meet a number o...... of security goals for confidentiality and integrity. Information Flow Control is an approach to ensuring that there are no flows of information that violate the stated security policy.......One of the key demands of cyberphysical systems is that they meet their safety goals. Timed Automata has established itself as a formalism for modelling and analysing the real-time safety aspects of cyberphysical systems. Increasingly it is also demanded that cyberphysical systems meet a number...
Identification of Nonstationary Cellular Automata
Institute of Scientific and Technical Information of China (English)
AndrewI.Adamatzky
1992-01-01
The principal feature of nonstationary cellular automata(NCA) is that a local transitiol rule of each cell is changed at each time step depending on neighborhood configuration at previous time step.The identification problem for NCA is extraction of local transition rules and the establishment of mechanism for changing these rules using sequence of NCA configurations.We present serial and parallel algorithms for identification of NCA.
Undecidable Problems About Timed Automata
Finkel, Olivier
2007-01-01
We solve some decision problems for timed automata which were recently raised by S. Tripakis in [ Folk Theorems on the Determinization and Minimization of Timed Automata, in the Proceedings of the International Workshop FORMATS'2003, LNCS, Volume 2791, p. 182-188, 2004 ] and by E. Asarin in [ Challenges in Timed Languages, From Applied Theory to Basic Theory, Bulletin of the EATCS, Volume 83, p. 106-120, 2004 ]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a timed regular language is timed regular. We show that the problem of the minimization of the number of clocks of a timed automaton is undecidable. It is also undecidable whether the shuffle of two timed regular languages is timed regular. We show that in the case of timed B\\"uchi automata accepting infinite timed words some of these problems are Pi^1_1-hard, hence highly undecidable (located beyond the arithmetical hierarchy).
Classifying cellular automata using grossone
D'Alotto, Louis
2016-10-01
This paper proposes an application of the Infinite Unit Axiom and grossone, introduced by Yaroslav Sergeyev (see [7] - [12]), to the development and classification of one and two-dimensional cellular automata. By the application of grossone, new and more precise nonarchimedean metrics on the space of definition for one and two-dimensional cellular automata are established. These new metrics allow us to do computations with infinitesimals. Hence configurations in the domain space of cellular automata can be infinitesimally close (but not equal). That is, they can agree at infinitely many places. Using the new metrics, open disks are defined and the number of points in each disk computed. The forward dynamics of a cellular automaton map are also studied by defined sets. It is also shown that using the Infinite Unit Axiom, the number of configurations that follow a given configuration, under the forward iterations of cellular automaton maps, can now be computed and hence a classification scheme developed based on this computation.
Algebras with actions and automata
Directory of Open Access Journals (Sweden)
W. Kühnel
1982-01-01
Full Text Available In the present paper we want to give a common structure theory of left action, group operations, R-modules and automata of different types defined over various kinds of carrier objects: sets, graphs, presheaves, sheaves, topological spaces (in particular: compactly generated Hausdorff spaces. The first section gives an axiomatic approach to algebraic structures relative to a base category B, slightly more powerful than that of monadic (tripleable functors. In section 2 we generalize Lawveres functorial semantics to many-sorted algebras over cartesian closed categories. In section 3 we treat the structures mentioned in the beginning as many-sorted algebras with fixed scalar or input object and show that they still have an algebraic (or monadic forgetful functor (theorem 3.3 and hence the general theory of algebraic structures applies. These structures were usually treated as one-sorted in the Lawvere-setting, the action being expressed by a family of unary operations indexed over the scalars. But this approach cannot, as the one developed here, describe continuity of the action (more general: the action to be a B-morphism, which is essential for the structures mentioned above, e.g. modules for a sheaf of rings or topological automata. Finally we discuss consequences of theorem 3.3 for the structure theory of various types of automata. The particular case of algebras with fixed natural numbers object has been studied by the authors in [23].
Modelling and analysis of Markov reward automata
Guck, Dennis; Timmer, Mark; Hatefi, Hassan; Ruijters, Enno; Stoelinga, Mariëlle
2014-01-01
Costs and rewards are important ingredients for many types of systems, modelling critical aspects like energy consumption, task completion, repair costs, and memory usage. This paper introduces Markov reward automata, an extension of Markov automata that allows the modelling of systems incorporating
Efficient Modelling and Generation of Markov Automata
Timmer, Mark; Katoen, Joost P.; van de Pol, Jan Cornelis; Stoelinga, Mariëlle Ida Antoinette
2012-01-01
This presentation introduces a process-algebraic framework with data for modelling and generating Markov automata. We show how an existing linearisation procedure for process-algebraic representations of probabilistic automata can be reused to transform systems in our new framework to a special
Unary self-verifying symmetric difference automata
CSIR Research Space (South Africa)
Marais, Laurette
2016-07-01
Full Text Available We investigate self-verifying nondeterministic finite automata, in the case of unary symmetric difference nondeterministic finite automata (SV-XNFA). We show that there is a family of languages Ln=2 which can always be represented non...
Beyond Language Equivalence on Visibly Pushdown Automata
DEFF Research Database (Denmark)
Srba, Jiri
2009-01-01
We study (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied...
Logic and Automata History and Perspectives
Gradel, Erich; Wilk, Thomas
2007-01-01
Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d'horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field. Title: Logic and Automata : History and Perspectives Print ISBN: 9789053565766 Author(s): Flum, Jörg; Gr; del, Erich; Wilke, Thomas eISBN: 9789048501281 Publisher: Amsterdam University Press Dewey: 511.3 Publication Date: 01 Jan, 2007 Pages: 737 Category: Mathematics LCCN: Language: English Edition: N/A LCSH:
Quantum anomalous Hall effect in time-reversal-symmetry breaking topological insulators.
Chang, Cui-Zu; Li, Mingda
2016-03-31
The quantum anomalous Hall effect (QAHE), the last member of Hall family, was predicted to exhibit quantized Hall conductivity σ(yx) = e2/h without any external magnetic field. The QAHE shares a similar physical phenomenon with the integer quantum Hall effect (QHE), whereas its physical origin relies on the intrinsic topological inverted band structure and ferromagnetism. Since the QAHE does not require external energy input in the form of magnetic field, it is believed that this effect has unique potential for applications in future electronic devices with low-power consumption. More recently, the QAHE has been experimentally observed in thin films of the time-reversal symmetry breaking ferromagnetic (FM) topological insulators (TI), Cr- and V- doped (Bi,Sb)2Te3. In this topical review, we review the history of TI based QAHE, the route to the experimental observation of the QAHE in the above two systems, the current status of the research of the QAHE, and finally the prospects for future studies.
Novel Design of a Nano-metric Fast 4*4 Reversible unsigned Wallace Multiplier Circuit
Directory of Open Access Journals (Sweden)
Ehsan PourAliAkbar
2015-12-01
Full Text Available One of the most promising technologies in designing low-power circuits is reversible computing. It is used in nanotechnology, quantum computing, quantum dot cellular automata (QCA, DNA computing, optical computing and in CMOS low-power designs. Since reversible logic is subject to certain restrictions (e.g. fan-out and feedback are not allowed, traditional synthesis methods are not applicable and specific methods have been developed. In this paper, we offer a Wallace 4*4 reversible multiplier circuits which have faster speed and lower complexity in comparison with the other multiplier circuits. This circuit performs better, regarding to the number of gates, garbage outputs and constant inputs work better than the same circuits. In this paper, Peres gate is used as HA and HNG gate is used as FA. We offer the best method to multiply two 4 bit numbers. These Nano-metric circuits can be used in very complex systems.
Learning automata theory and applications
Najim, K
1994-01-01
Learning systems have made a significant impact on all areas of engineering problems. They are attractive methods for solving many problems which are too complex, highly non-linear, uncertain, incomplete or non-stationary, and have subtle and interactive exchanges with the environment where they operate. The main aim of the book is to give a systematic treatment of learning automata and to produce a guide to a wide variety of ideas and methods that can be used in learning systems, including enough theoretical material to enable the user of the relevant techniques and concepts to understand why
Cellular automata a parallel model
Mazoyer, J
1999-01-01
Cellular automata can be viewed both as computational models and modelling systems of real processes. This volume emphasises the first aspect. In articles written by leading researchers, sophisticated massive parallel algorithms (firing squad, life, Fischer's primes recognition) are treated. Their computational power and the specific complexity classes they determine are surveyed, while some recent results in relation to chaos from a new dynamic systems point of view are also presented. Audience: This book will be of interest to specialists of theoretical computer science and the parallelism challenge.
CELLULAR AUTOMATA AND COMPUTER GRAPHICS
Directory of Open Access Journals (Sweden)
Şen ÇAKIR
1999-01-01
Full Text Available Cellular Automata (CA are simple mathematical systems which provide models for a variety of physical processes. They show how minute changes and simple rules lead to enormous changes in the behaviour of a system. They can also be used as computer graphics tools to produce a rich reservoir of interesting figures. In recent years, CA have attracked the attention of many scientists. Today, CA are used in many fields from ecology to image processing. In this paper, it is shown that a large number of complex and interesting patterns can be created with relatively simple CA rules.
Reversible Logic Based Concurrent Error Detection Methodology For Emerging Nanocircuits
Thapliyal, Himanshu
2011-01-01
Reversible logic has promising applications in emerging nanotechnologies, such as quantum computing, quantum dot cellular automata and optical computing, etc. Faults in reversible logic circuits that result in multi-bit error at the outputs are very tough to detect, and thus in literature, researchers have only addressed the problem of online testing of faults that result single-bit error at the outputs based on parity preserving logic. In this work, we propose a methodology for the concurrent error detection in reversible logic circuits to detect faults that can result in multi-bit error at the outputs. The methodology is based on the inverse property of reversible logic and is termed as 'inverse and compare' method. By using the inverse property of reversible logic, all the inputs can be regenerated at the outputs. Thus, by comparing the original inputs with the regenerated inputs, the faults in reversible circuits can be detected. Minimizing the garbage outputs is one of the main goals in reversible logic ...
Quantum computing classical physics.
Meyer, David A
2002-03-15
In the past decade, quantum algorithms have been found which outperform the best classical solutions known for certain classical problems as well as the best classical methods known for simulation of certain quantum systems. This suggests that they may also speed up the simulation of some classical systems. I describe one class of discrete quantum algorithms which do so--quantum lattice-gas automata--and show how to implement them efficiently on standard quantum computers.
Sedimentation of Reversibly Interacting Macromolecules with Changes in Fluorescence Quantum Yield
Chaturvedi, Sumit K.; Zhao, Huaying; Schuck, Peter
2017-04-01
Sedimentation velocity analytical ultracentrifugation with fluorescence detection has emerged as a powerful method for the study of interacting systems of macromolecules. It combines picomolar sensitivity with high hydrodynamic resolution, and can be carried out with photoswitchable fluorophores for multi-component discrimination, to determine the stoichiometry, affinity, and shape of macromolecular complexes with dissociation equilibrium constants from picomolar to micromolar. A popular approach for data interpretation is the determination of the binding affinity by isotherms of weight-average sedimentation coefficients, sw. A prevailing dogma in sedimentation analysis is that the weight-average sedimentation coefficient from the transport method corresponds to the signal- and population-weighted average of all species. We show that this does not always hold true for systems that exhibit significant signal changes with complex formation - properties that may be readily encountered in practice, e.g., from a change in fluorescence quantum yield. Coupled transport in the reaction boundary of rapidly reversible systems can make significant contributions to the observed migration in a way that cannot be accounted for in the standard population-based average. Effective particle theory provides a simple physical picture for the reaction-coupled migration process. On this basis we develop a more general binding model that converges to the well-known form of sw with constant signals, but can account simultaneously for hydrodynamic co-transport in the presence of changes in fluorescence quantum yield. We believe this will be useful when studying interacting systems exhibiting fluorescence quenching, enhancement or Forster resonance energy transfer with transport methods.
Densities and entropies in cellular automata
Guillon, Pierre
2012-01-01
Following work by Hochman and Meyerovitch on multidimensional SFT, we give computability-theoretic characterizations of the real numbers that can appear as the topological entropies of one-dimensional and two-dimensional cellular automata.
Intrinsic Simulations between Stochastic Cellular Automata
Directory of Open Access Journals (Sweden)
Pablo Arrighi
2012-08-01
Full Text Available The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner. Armed with this formalism, we extend the notion of intrinsic simulation between deterministic cellular automata, to the non-deterministic and stochastic settings. We then provide explicit tools to prove or disprove the existence of such a simulation between two stochastic cellular automata, even though the intrinsic simulation relation is shown to be undecidable in dimension two and higher. The key result behind this is the caracterization of equality of stochastic global maps by the existence of a coupling between the random sources. We then prove that there is a universal non-deterministic cellular automaton, but no universal stochastic cellular automaton. Yet we provide stochastic cellular automata achieving optimal partial universality.
Reaction-Diffusion Automata Phenomenology, Localisations, Computation
Adamatzky, Andrew
2013-01-01
Reaction-diffusion and excitable media are amongst most intriguing substrates. Despite apparent simplicity of the physical processes involved the media exhibit a wide range of amazing patterns: from target and spiral waves to travelling localisations and stationary breathing patterns. These media are at the heart of most natural processes, including morphogenesis of living beings, geological formations, nervous and muscular activity, and socio-economic developments. This book explores a minimalist paradigm of studying reaction-diffusion and excitable media using locally-connected networks of finite-state machines: cellular automata and automata on proximity graphs. Cellular automata are marvellous objects per se because they show us how to generate and manage complexity using very simple rules of dynamical transitions. When combined with the reaction-diffusion paradigm the cellular automata become an essential user-friendly tool for modelling natural systems and designing future and emergent computing arch...
On the Behavior Characteristics of Cellular Automata
Institute of Scientific and Technical Information of China (English)
CHEN Jin-cai; ZHANG Jiang-ling; FENG Dan
2005-01-01
In this paper, the inherent relationships between the running regulations and behavior characteristics of cellular automata are presented; an imprecise taxonomy of such systems is put forward; the three extreme cases of stable systems are discussed; and the illogicalness of evolutional strategies of cellular automata is analyzed. The result is suitable for the emulation and prediction of behavior of discrete dynamics systems; especially it can be taken as an important analysis means of dynamic performance of complex networks.
Discrete geodesics and cellular automata
Arrighi, Pablo
2015-01-01
This paper proposes a dynamical notion of discrete geodesics, understood as straightest trajectories in discretized curved spacetime. The notion is generic, as it is formulated in terms of a general deviation function, but readily specializes to metric spaces such as discretized pseudo-riemannian manifolds. It is effective: an algorithm for computing these geodesics naturally follows, which allows numerical validation---as shown by computing the perihelion shift of a Mercury-like planet. It is consistent, in the continuum limit, with the standard notion of timelike geodesics in a pseudo-riemannian manifold. Whether the algorithm fits within the framework of cellular automata is discussed at length. KEYWORDS: Discrete connection, parallel transport, general relativity, Regge calculus.
Fuzzy automata and pattern matching
Setzer, C. B.; Warsi, N. A.
1986-01-01
A wide-ranging search for articles and books concerned with fuzzy automata and syntactic pattern recognition is presented. A number of survey articles on image processing and feature detection were included. Hough's algorithm is presented to illustrate the way in which knowledge about an image can be used to interpret the details of the image. It was found that in hand generated pictures, the algorithm worked well on following the straight lines, but had great difficulty turning corners. An algorithm was developed which produces a minimal finite automaton recognizing a given finite set of strings. One difficulty of the construction is that, in some cases, this minimal automaton is not unique for a given set of strings and a given maximum length. This algorithm compares favorably with other inference algorithms. More importantly, the algorithm produces an automaton with a rigorously described relationship to the original set of strings that does not depend on the algorithm itself.
Modelling and analysis of Markov reward automata (extended version)
Guck, Dennis; Timmer, Mark; Hatefi, Hassan; Ruijters, Enno; Stoelinga, Mariëlle
2014-01-01
Costs and rewards are important ingredients for cyberphysical systems, modelling critical aspects like energy consumption, task completion, repair costs, and memory usage. This paper introduces Markov reward automata, an extension of Markov automata that allows the modelling of systems incorporating
Non deterministic finite automata for power systems fault diagnostics
Directory of Open Access Journals (Sweden)
LINDEN, R.
2009-06-01
Full Text Available This paper introduces an application based on finite non-deterministic automata for power systems diagnosis. Automata for the simpler faults are presented and the proposed system is compared with an established expert system.
Color image encryption based on hybrid hyper-chaotic system and cellular automata
Yaghouti Niyat, Abolfazl; Moattar, Mohammad Hossein; Niazi Torshiz, Masood
2017-03-01
This paper proposes an image encryption scheme based on Cellular Automata (CA). CA is a self-organizing structure with a set of cells in which each cell is updated by certain rules that are dependent on a limited number of neighboring cells. The major disadvantages of cellular automata in cryptography include limited number of reversal rules and inability to produce long sequences of states by these rules. In this paper, a non-uniform cellular automata framework is proposed to solve this problem. This proposed scheme consists of confusion and diffusion steps. In confusion step, the positions of the original image pixels are replaced by chaos mapping. Key image is created using non-uniform cellular automata and then the hyper-chaotic mapping is used to select random numbers from the image key for encryption. The main contribution of the paper is the application of hyper chaotic functions and non-uniform CA for robust key image generation. Security analysis and experimental results show that the proposed method has a very large key space and is resistive against noise and attacks. The correlation between adjacent pixels in the encrypted image is reduced and the amount of entropy is equal to 7.9991 which is very close to 8 which is ideal.
Computing Distances between Probabilistic Automata
Directory of Open Access Journals (Sweden)
Mathieu Tracol
2011-07-01
Full Text Available We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA, that allow some error epsilon. When epsilon is zero we retrieve the usual notions of bisimulation and simulation on PAs. We give logical characterisations of these notions by choosing suitable logics which differ from the elementary ones, L with negation and L without negation, by the modal operator. Using flow networks, we show how to compute the relations in PTIME. This allows the definition of an efficiently computable non-discounted distance between the states of a PA. A natural modification of this distance is introduced, to obtain a discounted distance, which weakens the influence of long term transitions. We compare our notions of distance to others previously defined and illustrate our approach on various examples. We also show that our distance is not expansive with respect to process algebra operators. Although L without negation is a suitable logic to characterise epsilon-(bisimulation on deterministic PAs, it is not for general PAs; interestingly, we prove that it does characterise weaker notions, called a priori epsilon-(bisimulation, which we prove to be NP-difficult to decide.
Cellular automata modelling of SEIRS
Institute of Scientific and Technical Information of China (English)
Liu Quan-Xing; Jin Zhen
2005-01-01
In this paper the SEIRS epidemic spread is analysed, and a two-dimensional probability cellular automata model for SEIRS is presented. Each cellular automation cell represents a part of the population that may be found in one of five states of individuals: susceptible, exposed (or latency), infected, immunized (or recovered) and death. Here studied are the effects of two cases on the epidemic spread. i.e. the effects of non-segregation and segregation on the latency and the infected of population. The conclusion is reached that the epidemic will persist in the case of non-segregation but it will decrease in the case of segregation. The proposed model can serve as a basis for the development of algorithms to simulate real epidemics based on real data. Last we find the density series of the exposed and the infected will fluctuate near a positive equilibrium point, when the constant for the immunized is less than its corresponding constant τ0. Our theoretical results are verified by numerical simulations.
Constructing Finite Automata with Invertibility by Transformation Method
Institute of Scientific and Technical Information of China (English)
TAO Renji; CHEN Shihua
2000-01-01
Ra, Pb transformations were successfully applied to establish invertibility theory for linear and quasi-linear finite automata over finite fields. In a previous paper, the authors generalized Ra, Rb transformations to deal with nonlinear memory finite automata, and gave sufficient conditions for weak inverse and for weakly invertible memory finite automata and inversion processes concerned;methods by transformation to generate a kind of nonlinear memory finite automata satisfying one of these sufficient conditions were also given.This paper extends the concepts, methods and results to general finite automata, in which states consist of finite input history, finite output history and finite "inner state" history.
Benchmark study between FIDAP and a cellular automata code
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.
Automata theory based on complete residuated lattice-valued logic
Institute of Scientific and Technical Information of China (English)
邱道文
2001-01-01
This paper establishes a fundamental framework of automata theory based on complete residuated lattice-valued logic. First it deals with how to extend the transition relation of states and particularly presents a characterization of residuated lattice by fuzzy automata (called valued automata).After that fuzzy subautomata (called valued subautomata), successor and source operators are proposed and their basic properties as well as the equivalent relation among them are discussed, from which it follows that the two fuzzy operators are exactly fuzzy closure operators. Finally an L bifuzzy topological characterization of valued automata is presented, so a more generalized fuzzy automata theory is built.
Infrared image enhancement using Cellular Automata
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.
Proton-driven spin diffusion in rotating solids via reversible and irreversible quantum dynamics.
Veshtort, Mikhail; Griffin, Robert G
2011-10-07
Proton-driven spin diffusion (PDSD) experiments in rotating solids have received a great deal of attention as a potential source of distance constraints in large biomolecules. However, the quantitative relationship between the molecular structure and observed spin diffusion has remained obscure due to the lack of an accurate theoretical description of the spin dynamics in these experiments. We start with presenting a detailed relaxation theory of PDSD in rotating solids that provides such a description. The theory applies to both conventional and radio-frequency-assisted PDSD experiments and extends to the non-Markovian regime to include such phenomena as rotational resonance (R(2)). The basic kinetic equation of the theory in the non-Markovian regime has the form of a memory function equation, with the role of the memory function played by the correlation function. The key assumption used in the derivation of this equation expresses the intuitive notion of the irreversible dissipation of coherences in macroscopic systems. Accurate expressions for the correlation functions and for the spin diffusion constants are given. The theory predicts that the spin diffusion constants governing the multi-site PDSD can be approximated by the constants observed in the two-site diffusion. Direct numerical simulations of PDSD dynamics via reversible Liouville-von Neumann equation are presented to support and compliment the theory. Remarkably, an exponential decay of the difference magnetization can be observed in such simulations in systems consisting of only 12 spins. This is a unique example of a real physical system whose typically macroscopic and apparently irreversible behavior can be traced via reversible microscopic dynamics. An accurate value for the spin diffusion constant can be usually obtained through direct simulations of PDSD in systems consisting of two (13)C nuclei and about ten (1)H nuclei from their nearest environment. Spin diffusion constants computed by this
Improved Undecidability Results for Reachability Games on Recursive Timed Automata
Directory of Open Access Journals (Sweden)
Shankara Narayanan Krishna
2014-08-01
Full Text Available We study reachability games on recursive timed automata (RTA that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is undecidable for automata with two or more clocks, while the problem is decidable for automata with only one clock. Ouaknine and Worrell recently proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. We revisited games on recursive timed automata with time-bounded restriction in the hope of recovering decidability. However, we found that the problem still remains undecidable for recursive timed automata with three or more clocks. Using similar proof techniques we characterize a decidability frontier for a generalization of RTA to recursive stopwatch automata.
Optimal scheduling using priced timed automata
DEFF Research Database (Denmark)
Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum
2005-01-01
This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European...... projects VHS [20] and AMETIST [16] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [18, 5] specialized for cost-optimal reachability for the extended model of so-called priced timed automata....
Optimal scheduling using priced timed automata
DEFF Research Database (Denmark)
Behrmann, Gerd; Larsen, Kim Guldstrand; Rasmussen, Jacob Illum
2005-01-01
This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European proj...... projects VHS [20] and AMETIST [16] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [18, 5] specialized for cost-optimal reachability for the extended model of so-called priced timed automata....
Theory of automata, formal languages and computation
Xavier, SPE
2004-01-01
This book is aimed at providing an introduction to the basic models of computability to the undergraduate students. This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages. Turing Machines have been introduced and the book discusses computability and decidability. A number of problems with solutions have been provided for each chapter. A lot of exercises have been given with hints/answers to most of these tutorial problems.
From Orchestration to Choreography through Contract Automata
Directory of Open Access Journals (Sweden)
Davide Basile
2014-10-01
Full Text Available We study the relations between a contract automata and an interaction model. In the former model, distributed services are abstracted away as automata - oblivious of their partners - that coordinate with each other through an orchestrator. The interaction model relies on channel-based asynchronous communication and choreography to coordinate distributed services. We define a notion of strong agreement on the contract model, exhibit a natural mapping from the contract model to the interaction model, and give conditions to ensure that strong agreement corresponds to well-formed choreography.
Wu, Qi-Cheng; Huang, Bi-Hua; Chen, Ye-Hong; Shi, Zhi-Cheng; Song, Jie; Xia, Yan
2017-10-01
We propose a method to design shortcuts to adiabaticity for implementing perfect quantum state engineering by the combination of the counterdiabatic driving and the reverse engineering technique. Based on the method, we can design simple schemes to realize the intended dynamics. For the sake of clearness, we apply this method to several examples including two-level, three-level and four-level system. We show that fast quantum state engineering can be realized by utilizing simply-designed auxiliary Hamiltonian. Furthermore, a suitable choice of the control parameters can eliminate the additional couplings in the introduced auxiliary Hamiltonian. Numerical simulation reveals that the constructed scheme is reliable and robust against various dissipation effects and the fluctuations of control parameters in current technology.
Ulanov, Alexander E; Fedorov, Ilya A; Sychev, Demid; Grangier, Philippe; Lvovsky, A I
2016-06-21
Highly entangled quantum states, shared by remote parties, are vital for quantum communications and metrology. Particularly promising are the N00N states-entangled N-photon wavepackets delocalized between two different locations-which outperform coherent states in measurement sensitivity. However, these states are notoriously vulnerable to losses, making them difficult to both share them between remote locations and recombine in order to exploit interference effects. Here we address this challenge by utilizing the reverse Hong-Ou-Mandel effect to prepare a high-fidelity two-photon N00N state shared between two parties connected by a lossy optical medium. We measure the prepared state by two-mode homodyne tomography, thereby demonstrating that the enhanced phase sensitivity can be exploited without recombining the two parts of the N00N state. Finally, we demonstrate the application of our method to remotely prepare superpositions of coherent states, known as Schrödinger's cat states.
Loss-tolerant state engineering for quantum-enhanced metrology via the reverse Hong–Ou–Mandel effect
Ulanov, Alexander E.; Fedorov, Ilya A.; Sychev, Demid; Grangier, Philippe; Lvovsky, A. I.
2016-01-01
Highly entangled quantum states, shared by remote parties, are vital for quantum communications and metrology. Particularly promising are the N00N states—entangled N-photon wavepackets delocalized between two different locations—which outperform coherent states in measurement sensitivity. However, these states are notoriously vulnerable to losses, making them difficult to both share them between remote locations and recombine in order to exploit interference effects. Here we address this challenge by utilizing the reverse Hong–Ou–Mandel effect to prepare a high-fidelity two-photon N00N state shared between two parties connected by a lossy optical medium. We measure the prepared state by two-mode homodyne tomography, thereby demonstrating that the enhanced phase sensitivity can be exploited without recombining the two parts of the N00N state. Finally, we demonstrate the application of our method to remotely prepare superpositions of coherent states, known as Schrödinger's cat states. PMID:27324115
Optimal width of quantum well for reversed polarization blue InGaN light-emitting diodes
Directory of Open Access Journals (Sweden)
Junjie Kang
2013-07-01
Full Text Available The optical properties of reversed polarization (RP blue InGaN light-emitting diodes (LEDs under different quantum wells (QWs width are numerically studied. We compared the band diagram, electron and hole concentration, emission wavelength, radiation recombination, internal quantum efficiency (IQE, turn on voltage and light output power (LOP of these structures by numerical simulation. It found that QW width has a remarkable influence on the properties of RP blue InGaN LEDs. With the increase of QW width, the turn on voltage and radiation recombination rate decreases. It finds that the optimal width of QWs is about 3 nm at the current injection density of 15 A/cm2.
Loss-tolerant state engineering for quantum-enhanced metrology via the reverse Hong-Ou-Mandel effect
Ulanov, Alexander E.; Fedorov, Ilya A.; Sychev, Demid; Grangier, Philippe; Lvovsky, A. I.
2016-06-01
Highly entangled quantum states, shared by remote parties, are vital for quantum communications and metrology. Particularly promising are the N00N states--entangled N-photon wavepackets delocalized between two different locations--which outperform coherent states in measurement sensitivity. However, these states are notoriously vulnerable to losses, making them difficult to both share them between remote locations and recombine in order to exploit interference effects. Here we address this challenge by utilizing the reverse Hong-Ou-Mandel effect to prepare a high-fidelity two-photon N00N state shared between two parties connected by a lossy optical medium. We measure the prepared state by two-mode homodyne tomography, thereby demonstrating that the enhanced phase sensitivity can be exploited without recombining the two parts of the N00N state. Finally, we demonstrate the application of our method to remotely prepare superpositions of coherent states, known as Schrödinger's cat states.
Li, Yan-Ling; Huang, Jinsong; Xu, Zhonghui; Xiao, Xing
2017-10-01
Taking the advantage of weak measurement and quantum measurement reversal, we propose a scheme to enhance the fidelity of transferring quantum state from one atom trapped in cavity to another distant one trapped in another cavity which is coupled by an optical fiber. It is turned out that the fidelity can be greatly improved even when the system is under serious dissipation. Moreover, the scheme works in both the strong-coupling and weak-coupling regimes. It is also robust to the ratio of the coupling constant between the atoms and the cavity modes to the coupling constant between the fiber and cavity modes. The underlying mechanism can be attributed to the probabilistic nature of weak measurements.
García-Pablos, D.; García, N.; Serena, P.A.; Raedt, H. De
1996-01-01
We investigate the reversal of magnetization and the coherence of tunneling when an external magnetic field is rotated instantaneously in systems of a few (N) spin 1/2 particles described by an anisotropic Heisenberg Hamiltonian at T=0. The temporal evolution is calculated by a numerically exact sol
García-Pablos, D.; García, N.; Serena, P.A.; Raedt, H. De
1996-01-01
We investigate the reversal of magnetization and the coherence of tunneling when an external magnetic field is rotated instantaneously in systems of a few (N) spin 1/2 particles described by an anisotropic Heisenberg Hamiltonian at T=0. The temporal evolution is calculated by a numerically exact sol
Synthesis of Bi2S3 quantum dots for sensitized solar cells by reverse SILAR
Singh, Navjot; Sharma, J.; Tripathi, S. K.
2016-05-01
Quantum Dot Sensitized Solar cells (QDSSC) have great potential to replace silicon-based solar cells. Quantum dots of various materials and sizes could be used to convert most of the visible light into the electrical current. This paper put emphasis on the synthesis of Bismuth Sulphide quantum dots and selectivity of the anionic precursor by Successive Ionic Layer Adsorption Reaction (SILAR). Bismuth Sulfide (Bi2S3) (group V - Vi semiconductor) is strong contestant for cadmium free solar cells due to its optimum band gap for light harvesting. Optical, structural and electrical measurements are reported and discussed. Problem regarding the choice of precursor for anion extraction is discussed. Band gap of the synthesized quantum dots is 1.2 eV which does not match with the required energy band gap of bismuth sulfide that is 1.7eV.
Minimization of Fuzzy Finite Generalized Automata
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Some concepts in Fuzzy Generalized Automata (FGA) are established. Then an important new algorithm which would calculate the minimal FGA is given. The new algorithm is composed of two parts: the first is called E-reduction which contracts equivalent states, and the second is called RE-reduction which removes retrievable states. Finally an example is given to illuminate the algorithm of minimization.
Confluence reduction for Markov automata (extended version)
Timmer, M.; Pol, van de J.C.; Stoelinga, M.I.A.
2013-01-01
Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosion threatens the analysability of the models gener
Efficient Modelling and Generation of Markov Automata
Timmer, Mark; Katoen, Joost-Pieter; Pol, van de Jaco; Stoelinga, Mariëlle; Koutny, M.; Ulidowski, I.
2012-01-01
This paper introduces a framework for the efficient modelling and generation of Markov automata. It consists of (1) the data-rich process-algebraic language MAPA, allowing concise modelling of systems with nondeterminism, probability and Markovian timing; (2) a restricted form of the language, the M
Blackhole State-Controlled Regulated Pushdown Automata
Csuhaj-Varju, E.; Masopust, T.; Vaszil, G.; Bordihn, H.; Freund, R.; Hinze, T.; Holzer, M.; Kutrib, M.; Otto, F.
2010-01-01
In this paper, we introduce and study a variant of regulated pushdown automata, called blackhole state-controlled R-PDA where a symbol can always be pushed to the pushdown, but only a given depth of the pushdown contents is remembered; the rest of the pushdown contents is lost. In addition, the auto
Automata Learning through Counterexample Guided Abstraction Refinement
DEFF Research Database (Denmark)
Aarts, Fides; Heidarian, Faranak; Kuppens, Harco
2012-01-01
Abstraction is the key when learning behavioral models of realistic systems. Hence, in most practical applications where automata learning is used to construct models of software components, researchers manually define abstractions which, depending on the history, map a large set of concrete events...
Selective networks and recognition automata.
Reeke, G N; Edelman, G M
1984-01-01
The results we have presented demonstrate that a network based on a selective principle can function in the absence of forced learning or an a priori program to give recognition, classification, generalization, and association. While Darwin II is not a model of any actual nervous system, it does set out to solve one of the same problems that evolution had to solve--the need to form categories in a bottom-up manner from information in the environment, without incorporating the assumptions of any particular observer. The key features of the model that make this possible are (1) Darwin II incorporates selective networks whose initial specificities enable them to respond without instruction to unfamiliar stimuli; (2) degeneracy provides multiple possibilities of response to any one stimulus, at the same time providing functional redundancy against component failure; (3) the output of Darwin II is a pattern of response, making use of the simultaneous responses of multiple degenerate groups to avoid the need for very high specificity and the combinatorial disaster that would imply; (4) reentry within individual networks vitiates the limitations described by Minsky and Papert for a class of perceptual automata lacking such connections; and (5) reentry between intercommunicating networks with different functions gives rise to new functions, such as association, that either one alone could not display. The two kinds of network are roughly analogous to the two kinds of category formation that people use: Darwin, corresponding to the exemplar description of categories, and Wallace, corresponding to the probabilistic matching description of categories. These principles lead to a new class of pattern-recognizing machine of which Darwin II is just an example. There are a number of obvious extensions to this work that we are pursuing. These include giving Darwin II the capability to deal with stimuli that are in motion, an ability that probably precedes the ability of biological
An authenticated image encryption scheme based on chaotic maps and memory cellular automata
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.
Quantum reverse-engineering and reference frame alignment without non-local correlations
Bagán, E; Muñoz-Tàpia, R
2004-01-01
Estimation of unknown qubit elementary gates and alignment of reference frames are formally the same problem. Using quantum states made out of $N$ qubits, we show that the theoretical precision limit for both problems, which behaves as $1/N^{2}$, can be asymptotically attained with a covariant protocol that exploits the quantum correlation of internal degrees of freedom instead of the more fragile entanglement between distant parties. This cuts by half the number of qubits needed to achieve the precision of the dense covariant coding protocol.
Some Properties of Fractals Generated by Linear Cellular Automata
Institute of Scientific and Technical Information of China (English)
倪天佳
2003-01-01
Fractals and cellular automata are both significant areas of research in nonlinear analysis. This paper studies a class of fractals generated by cellular automata. The patterns produced by cellular automata give a special sequence of sets in Euclidean space. The corresponding limit set is shown to be a fractal and the dimension is independent of the choice of the finite initial seed. As opposed to previous works, the fractals here do not depend on the time parameter.
Cellular non-deterministic automata and partial differential equations
Kohler, D.; Müller, J.; Wever, U.
2015-09-01
We define cellular non-deterministic automata (CNDA) in the spirit of non-deterministic automata theory. They are different from the well-known stochastic automata. We propose the concept of deterministic superautomata to analyze the dynamical behavior of a CNDA and show especially that a CNDA can be embedded in a deterministic cellular automaton. As an application we discuss a connection between certain partial differential equations and CNDA.
The Decidability Frontier for Probabilistic Automata on Infinite Words
Chatterjee, Krishnendu; Tracol, Mathieu
2011-01-01
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, B\\"uchi, coB\\"uchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.
Problems on Finite Automata and the Exponential Time Hypothesis
Directory of Open Access Journals (Sweden)
Henning Fernau
2017-02-01
Full Text Available We study several classical decision problems on finite automata under the (Strong Exponential Time Hypothesis. We focus on three types of problems: universality, equivalence, and emptiness of intersection. All these problems are known to be CoNP-hard for nondeterministic finite automata, even when restricted to unary input alphabets. A different type of problems on finite automata relates to aperiodicity and to synchronizing words. We also consider finite automata that work on commutative alphabets and those working on two-dimensional words.
Nonsynchronous updating in the multiverse of cellular automata
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.
Priced Timed Automata: Theory and Tools
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand
2009-01-01
Priced timed automata are emerging as useful formalisms for modeling and analysing a broad range of resource allocation problems. In this extended abstract, we highlight recent (un)deci\\-dability results related to priced timed automata as well as point to a number of open problems.......Priced timed automata are emerging as useful formalisms for modeling and analysing a broad range of resource allocation problems. In this extended abstract, we highlight recent (un)deci\\-dability results related to priced timed automata as well as point to a number of open problems....
Priced Timed Automata: Theory and Tools
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand
2009-01-01
Priced timed automata are emerging as useful formalisms for modeling and analysing a broad range of resource allocation problems. In this extended abstract, we highlight recent (un)deci\\-dability results related to priced timed automata as well as point to a number of open problems.......Priced timed automata are emerging as useful formalisms for modeling and analysing a broad range of resource allocation problems. In this extended abstract, we highlight recent (un)deci\\-dability results related to priced timed automata as well as point to a number of open problems....
Non-monotony and Boolean automata networks
Noual, Mathilde; Sené, Sylvain
2011-01-01
This paper aims at setting the keystone of a prospective theoretical study on the role of non-monotone interactions in biological regulation networks. Focusing on discrete models of these networks, namely, Boolean automata networks, we propose to analyse the contribution of non-monotony to the diversity and complexity in their dynamical behaviours. More precisely, in this paper, we start by detailing some motivations, both mathematical and biological, for our interest in non-monotony, and we discuss how it may account for phenomena that cannot be produced by monotony only. Then, to build some understanding in this direction, we propose some preliminary results on the dynamical behaviour of some specific non-monotone Boolean automata networks called XOR circulant networks.
Designing beauty the art of cellular automata
Martínez, Genaro
2016-01-01
This fascinating, colourful book offers in-depth insights and first-hand working experiences in the production of art works, using simple computational models with rich morphological behaviour, at the edge of mathematics, computer science, physics and biology. It organically combines ground breaking scientific discoveries in the theory of computation and complex systems with artistic representations of the research results. In this appealing book mathematicians, computer scientists, physicists, and engineers brought together marvelous and esoteric patterns generated by cellular automata, which are arrays of simple machines with complex behavior. Configurations produced by cellular automata uncover mechanics of dynamic patterns formation, their propagation and interaction in natural systems: heart pacemaker, bacterial membrane proteins, chemical rectors, water permeation in soil, compressed gas, cell division, population dynamics, reaction-diffusion media and self-organisation. The book inspires artists to tak...
Simulation of earthquakes with cellular automata
Directory of Open Access Journals (Sweden)
P. G. Akishin
1998-01-01
Full Text Available The relation between cellular automata (CA models of earthquakes and the Burridge–Knopoff (BK model is studied. It is shown that the CA proposed by P. Bak and C. Tang,although they have rather realistic power spectra, do not correspond to the BK model. We present a modification of the CA which establishes the correspondence with the BK model.An analytical method of studying the evolution of the BK-like CA is proposed. By this method a functional quadratic in stress release, which can be regarded as an analog of the event energy, is constructed. The distribution of seismic events with respect to this “energy” shows rather realistic behavior, even in two dimensions. Special attention is paid to two-dimensional automata; the physical restrictions on compression and shear stiffnesses are imposed.
Astrobiological Complexity with Probabilistic Cellular Automata
Vukotić, B
2012-01-01
Search for extraterrestrial life and intelligence constitutes one of the major endeavors in science, but has yet been quantitatively modeled only rarely and in a cursory and superficial fashion. We argue that probabilistic cellular automata (PCA) represent the best quantitative framework for modeling astrobiological history of the Milky Way and its Galactic Habitable Zone. The relevant astrobiological parameters are to be modeled as the elements of the input probability matrix for the PCA kernel. With the underlying simplicity of the cellular automata constructs, this approach enables a quick analysis of large and ambiguous input parameters' space. We perform a simple clustering analysis of typical astrobiological histories and discuss the relevant boundary conditions of practical importance for planning and guiding actual empirical astrobiological and SETI projects. In addition to showing how the present framework is adaptable to more complex situations and updated observational databases from current and ne...
Asymptotic Behavior of Excitable Cellular Automata
Durrett, R; Durrett, Richard; Griffeath, David
1993-01-01
Abstract: We study two families of excitable cellular automata known as the Greenberg-Hastings Model (GHM) and the Cyclic Cellular Automaton (CCA). Each family consists of local deterministic oscillating lattice dynamics, with parallel discrete-time updating, parametrized by the range of interaction, the "shape" of its neighbor set, threshold value for contact updating, and number of possible states per site. GHM and CCA are mathematically tractable prototypes for the spatially distributed periodic wave activity of so-called excitable media observed in diverse disciplines of experimental science. Earlier work by Fisch, Gravner, and Griffeath studied the ergodic behavior of these excitable cellular automata on Z^2, and identified two distinct (but closely-related) elaborate phase portraits as the parameters vary. In particular, they noted the emergence of asymptotic phase diagrams (and Euclidean dynamics) in a well-defined threshold-range scaling limit. In this study we present several rigorous results and som...
The Relationships Among Several Types of Finite Automata Based on Quantum Logic%基于量子逻辑的几类有穷自动机之间的关系
Institute of Scientific and Technical Information of China (English)
李平; 李永明
2011-01-01
With respect to the initial state and the final state being crisp or not, we classify the nondeterministic quantum finite automaton into four forms and the deterministic quantum finite automaton into three forms, and discuss the relationships among them. By employing a new construction method, we obtain that a deterministic quantum finite automaton with crisp initial state is equivalent to a deterministic quantum finite automaton with crisp final state. The results provide the theoretical foundations for the appropriate choice of computing models in practice.%根据初始状态和终止状态是否为分明的,非确定型量子有穷自动机可分为四类,确定型量子有穷自动机可分为三类.本文详细讨论了四类非确定型量子有穷自动机之间的关系以及三类确定型量子有穷自动机之间的关系,并且利用新的构造方法,证明了初态为分明的确定型量子有穷自动机与终态为分明的确定型量子有穷自动机是等价的.这些结论为实际应用中计算模型的合理选取提供了理论依据.
Investigation of Landau level spin reversal in (110) oriented p-type GaAs quantum wells
Energy Technology Data Exchange (ETDEWEB)
Isik, Nebile
2009-09-01
In this thesis, the Landau level crossing or anticrossing of hole levels has been investigated in p-type GaAs 400 Aa wide quantum wells. In magneto-transport measurements, this is evidenced with the presence of an anomalous peak in the longitudinal resistance measurements at {nu}=1. In the transversal resistance measurements, no signature of this anomalous peak is observed. By increasing the hole density in the quantum well by applying a top gate voltage, the position of the anomalous peak shifts to higher magnetic fields. At very high densities, anomalous peak disappears. By applying a back gate voltage, the electric field in the quantum well is tuned. A consequence is that the geometry of the quantum well is tuned from square to triangular. The anomalous peak position is shown to depend also on the back gate voltage applied. Temperature dependence of the peak height is consistent with thermal activation energy gap ({delta}/2= 135 {mu}eV). The activation energy gap as a function of the magnetic field has a parabolic like dependence, with the minimum of 135 {mu}eV at 4 T. The peak magnitude is observed to decrease with increasing temperature. An additional peak is observed at {nu}=2 minimum. This additional peak at {nu}=2 might be due to the higher Landau level crossing. The p-type quantum wells have been investigated by photoluminescence spectroscopy, as a function of the magnetic field. The polarization of the emitted light has been analyzed in order to distinguish between the transitions related to spin of electron {+-} 1/2 and spin of hole -+ 3/2. The transition energies of the lowest electron Landau levels with spin {+-} 1/2 and hole Landau levels with spin -+ 3/2 versus magnetic field show crossing at 4 T. The heavy hole Landau levels with spins {+-} 3/2 are obtained by the substraction of transition energies from the sum of lowest electron Landau level energy and the energy gap of GaAs. The heavy hole Landau levels show a crossing at 4 T. However, due to the
VERIFICATION OF PARALLEL AUTOMATA-BASED PROGRAMS
Directory of Open Access Journals (Sweden)
M. A. Lukin
2014-01-01
Full Text Available The paper deals with an interactive method of automatic verification for parallel automata-based programs. The hierarchical state machines can be implemented in different threads and can interact with each other. Verification is done by means of Spin tool and includes automatic Promela model construction, conversion of LTL-formula to Spin format and counterexamples in terms of automata. Interactive verification gives the possibility to decrease verification time and increase the maximum size of verifiable programs. Considered method supports verification of the parallel system for hierarchical automata that interact with each other through messages and shared variables. The feature of automaton model is that each state machine is considered as a new data type and can have an arbitrary bounded number of instances. Each state machine in the system can run a different state machine in a new thread or have nested state machine. This method was implemented in the developed Stater tool. Stater shows correct operation for all test cases.
Comparison of the Cost Metrics for Reversible and Quantum Logic Synthesis
Miller, D M; Maslov, Dmitri
2005-01-01
A breadth-first search method for determining optimal 3-line circuits composed of quantum NOT, CNOT, controlled-V and controlled-V+ (NCV) gates is introduced. Results are presented for simple gate count and for technology motivated cost metrics. The optimal NCV circuits are also compared to NCV circuits derived from optimal NOT, CNOT and Toffoli (NCT) gate circuits. The work presented here provides basic results and motivation for continued study of the direct synthesis of NCV circuits, and establishes relations between function realizations in different circuit cost metrics.
Wu, Yu-Nien; Wu, Ming-Fan; Ou, Ya-Wen; Chou, Ying-Lin; Cheng, Shun-Jen
2017-08-01
We present a theoretical investigation of anisotropic g -factor tensors of single holes confined in droplet epitaxial GaAs/AlGaAs quantum dots under electrical and mechanical controls using the gauge-invariant discretization method within the framework of four-band Luttinger-Kohn k ⃗.p ⃗ theory. We reveal an intrinsic obstacle to realize the electrical sign reversal of the hole g -factors, being a key condition required for a full spin control in the scheme of g -tensor modulation, for the quantum dots solely with electrical bias control. Constructively, our studies show that, besides electrical gating, slightly stressing an inherently unstrained droplet epitaxial GaAs/AlGaAs quantum dot can offset the transverse hole g -factor to be nearly zero and make the electrical sign reversal of the hole g -factors feasible.
Infinite Time Cellular Automata: A Real Computation Model
Givors, Fabien; Ollinger, Nicolas
2010-01-01
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and infinite inputs; thus inheriting many of its properties. We then show how to simulate the canonical real computation model, BSS machines, with infinite time cellular automata in exactly \\omega steps.
Restarting Automata with Auxiliary Symbols and Small Lookahead
DEFF Research Database (Denmark)
Schluter, Natalie Elaine
2012-01-01
We present a study on lookahead hierarchies for restarting automata with auxiliary symbols and small lookahead. In particular, we show that there are just two different classes of languages recognised by RRWW automata, through the restriction of lookahead size. We also show that the respective...
THE COMPLEXITY OF LIMIT LANGUAGES OF CELLULAR AUTOMATA: AN EXAMPLE
Institute of Scientific and Technical Information of China (English)
XIE Huimin
2001-01-01
The limit languages of cellular automata are defined and theircomplexity are discussed. New tools, which include skew evolution, skew periodic string, trace string, some algebraic calculation method, and restricted membership problem, are developed through a discussion focusing on the limit language of an elementary cellular automata of rule 94.It is proved that this language is non-regular.
A Myhill-Nerode theorem for automata with advice
Directory of Open Access Journals (Sweden)
Alex Kruckman
2012-10-01
Full Text Available An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice.
Entropies of the automata networks with additive rule
Institute of Scientific and Technical Information of China (English)
Guo－qingGU; GeCHEN; 等
1996-01-01
The matrix presentation for automata networks with additive rule are described.A set of entropy theorems of additive automata network are proved and an analytic formula of its entropy is built.For example,we proved that the topological entropy is identically equal to metric entropy for an additive antomata network.
The Quest for Minimal Quotients for Probabilistic Automata
DEFF Research Database (Denmark)
Eisentraut, Christian; Hermanns, Holger; Schuster, Johann;
2013-01-01
One of the prevailing ideas in applied concurrency theory and verification is the concept of automata minimization with respect to strong or weak bisimilarity. The minimal automata can be seen as canonical representations of the behaviour modulo the bisimilarity considered. Together with congruen...
Recursive definition of global cellular-automata mappings
DEFF Research Database (Denmark)
Feldberg, Rasmus; Knudsen, Carsten; Rasmussen, Steen
1994-01-01
A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping as...
An Interface Theory for Input/Output Automata
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand; Nyman, Ulrik; Wasowski, Andrzej
Building on the theory of interface automata by de~Alfaro and Henzinger we design an interface language for Lynch's Input/Output Automata, a popular formalism used in the development of distributed asynchronous systems, not addressed by previous interface research. We introduce an explicit separa...
Optimal Conditional Reachability for Multi-Priced Timed Automata
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand; Rasmussen, Jacob Illum
2005-01-01
In this paper, we prove decidability of the optimal conditional reachability problem for multi-priced timed automata, an extension of timed automata with multiple cost variables evolving according to given rates for each location. More precisely, we consider the problem of determining the minimal...
Input-Trees of Finite Automata and Application to Cryptanalysis
Institute of Scientific and Technical Information of China (English)
陶仁骥; 陈世华
2000-01-01
In this paper, weights of output set and of input set for finite automata are discussed. For a weakly invertible finite automaton, we prove that for states with minimal output weight, the distribution of input sets is uniform. Then for a kind of compound finite automata, we give weights of output set and of input set explicitly, and a characterization of their input-trees. For finite automaton public key cryptosystems, of which automata in public keys belong to such a kind of compound finite automata, we evaluate search amounts of exhaust search algorithms in average case and in worse case for both encryption and signature, and successful probabilities of stochastic search algorithms for both encryption and signature. In addition, a result on mutual invertibility of finite automata is also given.
Scalable asynchronous execution of cellular automata
Folino, Gianluigi; Giordano, Andrea; Mastroianni, Carlo
2016-10-01
The performance and scalability of cellular automata, when executed on parallel/distributed machines, are limited by the necessity of synchronizing all the nodes at each time step, i.e., a node can execute only after the execution of the previous step at all the other nodes. However, these synchronization requirements can be relaxed: a node can execute one step after synchronizing only with the adjacent nodes. In this fashion, different nodes can execute different time steps. This can be a notable advantageous in many novel and increasingly popular applications of cellular automata, such as smart city applications, simulation of natural phenomena, etc., in which the execution times can be different and variable, due to the heterogeneity of machines and/or data and/or executed functions. Indeed, a longer execution time at a node does not slow down the execution at all the other nodes but only at the neighboring nodes. This is particularly advantageous when the nodes that act as bottlenecks vary during the application execution. The goal of the paper is to analyze the benefits that can be achieved with the described asynchronous implementation of cellular automata, when compared to the classical all-to-all synchronization pattern. The performance and scalability have been evaluated through a Petri net model, as this model is very useful to represent the synchronization barrier among nodes. We examined the usual case in which the territory is partitioned into a number of regions, and the computation associated with a region is assigned to a computing node. We considered both the cases of mono-dimensional and two-dimensional partitioning. The results show that the advantage obtained through the asynchronous execution, when compared to the all-to-all synchronous approach is notable, and it can be as large as 90% in terms of speedup.
Rational quantum integrable systems of DN type with polarized spin reversal operators
Directory of Open Access Journals (Sweden)
B. Basu-Mallick
2015-09-01
Full Text Available We study the spin Calogero model of DN type with polarized spin reversal operators, as well as its associated spin chain of Haldane–Shastry type, both in the antiferromagnetic and ferromagnetic cases. We compute the spectrum and the partition function of the former model in closed form, from which we derive an exact formula for the chain's partition function in terms of products of partition functions of Polychronakos–Frahm spin chains of type A. Using a recursion relation for the latter partition functions that we derive in the paper, we are able to numerically evaluate the partition function, and thus the spectrum, of the DN-type spin chain for relatively high values of the number of spins N. We analyze several global properties of the chain's spectrum, such as the asymptotic level density, the distribution of consecutive spacings of the unfolded spectrum, and the average degeneracy. In particular, our results suggest that this chain is invariant under a suitable Yangian group, and that its spectrum coincides with that of a Yangian-invariant vertex model with linear energy function and dispersion relation.
Cellular automata modeling of pedestrian's crossing dynamics
Institute of Scientific and Technical Information of China (English)
张晋; 王慧; 李平
2004-01-01
Cellular automata modeling techniques and the characteristics of mixed traffic flow were used to derive the 2-dimensional model presented here for simulation of pedestrian's crossing dynamics.A conception of "stop point" is introduced to deal with traffic obstacles and resolve conflicts among pedestrians or between pedestrians and the other vehicles on the crosswalk.The model can be easily extended,is very efficient for simulation of pedestrian's crossing dynamics,can be integrated into traffic simulation software,and has been proved feasible by simulation experiments.
Cellular automata models for synchronized traffic flow
Jiang Rui
2003-01-01
This paper presents a new cellular automata model for describing synchronized traffic flow. The fundamental diagrams, the spacetime plots and the 1 min average data have been analysed in detail. It is shown that the model can describe the outflow from the jams, the light synchronized flow as well as heavy synchronized flow with average speed greater than approximately 24 km h sup - sup 1. As for the synchronized flow with speed lower than 24 km h sup - sup 1 , it is unstable and will evolve into the coexistence of jams, free flow and light synchronized flow. This is consistent with the empirical findings (Kerner B S 1998 Phys. Rev. Lett. 81 3797).
Execution spaces for simple higher dimensional automata
DEFF Research Database (Denmark)
Raussen, Martin
Higher Dimensional Automata (HDA) are highly expressive models for concurrency in Computer Science, cf van Glabbeek [26]. For a topologist, they are attractive since they can be modeled as cubical complexes - with an inbuilt restriction for directions´of allowable (d-)paths. In Raussen [25], we...... applicable in greater generality. Furthermore, we take a close look at semaphore models with semaphores all of arity one. It turns out that execution spaces for these are always homotopy discrete with components representing sets of “compatible” permutations. Finally, we describe a model for the complement...
Cellular automata modelling of hantarvirus infection
Energy Technology Data Exchange (ETDEWEB)
Abdul Karim, Mohamad Faisal [School of Distance Education, Universiti Sains Malaysia, Minden 11800, Penang (Malaysia)], E-mail: faisal@usm.my; Md Ismail, Ahmad Izani [School of Mathematical Sciences, Universiti Sains Malaysia, Minden 11800, Penang (Malaysia)], E-mail: izani@cs.usm.my; Ching, Hoe Bee [School of Mathematical Sciences, Universiti Sains Malaysia, Minden 11800, Penang (Malaysia)], E-mail: Bee_Ching_Janice_Hoe@dell.com
2009-09-15
Hantaviruses are a group of viruses which have been identified as being responsible for the outbreak of diseases such as the hantavirus pulmonary syndrome. In an effort to understand the characteristics and dynamics of hantavirus infection, mathematical models based on differential equations have been developed and widely studied. However, such models neglect the local characteristics of the spreading process and do not include variable susceptibility of individuals. In this paper, we develop an alternative approach based on cellular automata to analyze and study the spatiotemporal patterns of hantavirus infection.
Measuring Communication in Parallel Communicating Finite Automata
Directory of Open Access Journals (Sweden)
Henning Bordihn
2014-05-01
Full Text Available Systems of deterministic finite automata communicating by sending their states upon request are investigated, when the amount of communication is restricted. The computational power and decidability properties are studied for the case of returning centralized systems, when the number of necessary communications during the computations of the system is bounded by a function depending on the length of the input. It is proved that an infinite hierarchy of language families exists, depending on the number of messages sent during their most economical recognitions. Moreover, several properties are shown to be not semi-decidable for the systems under consideration.
Learn with SAT to Minimize Büchi Automata
Directory of Open Access Journals (Sweden)
Stephan Barth
2012-10-01
Full Text Available We describe a minimization procedure for nondeterministic Büchi automata (NBA. For an automaton A another automaton A_min with the minimal number of states is learned with the help of a SAT-solver. This is done by successively computing automata A' that approximate A in the sense that they accept a given finite set of positive examples and reject a given finite set of negative examples. In the course of the procedure these example sets are successively increased. Thus, our method can be seen as an instance of a generic learning algorithm based on a "minimally adequate teacher'' in the sense of Angluin. We use a SAT solver to find an NBA for given sets of positive and negative examples. We use complementation via construction of deterministic parity automata to check candidates computed in this manner for equivalence with A. Failure of equivalence yields new positive or negative examples. Our method proved successful on complete samplings of small automata and of quite some examples of bigger automata. We successfully ran the minimization on over ten thousand automata with mostly up to ten states, including the complements of all possible automata with two states and alphabet size three and discuss results and runtimes; single examples had over 100 states.
On Reachability for Hybrid Automata over Bounded Time
Brihaye, Thomas; Geeraerts, Gilles; Ouaknine, Joël; Raskin, Jean-François; Worrell, James
2011-01-01
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational value. We show that, in contrast to the classical (unbounded) reachability problem, the timed-bounded version is decidable for rectangular hybrid automata provided only non-negative rates are allowed. This class of systems is of practical interest and subsumes, among others, the class of stopwatch automata. We also show that the problem becomes undecidable if either diagonal constraints or both negative and positive rates are allowed.
Applications of Weighted Automata in Natural Language Processing
Knight, Kevin; May, Jonathan
We explain why weighted automata are an attractive knowledge representation for natural language problems. We first trace the close historical ties between the two fields, then present two complex real-world problems, transliteration and translation. These problems are usefully decomposed into a pipeline of weighted transducers, and weights can be set to maximize the likelihood of a training corpus using standard algorithms. We additionally describe the representation of language models, critical data sources in natural language processing, as weighted automata. We outline the wide range of work in natural language processing that makes use of weighted string and tree automata and describe current work and challenges.
On the Effect of Quantum Noise in a Quantum-Relativistic Prisoner's Dilemma Cellular Automaton
Alonso-Sanz, Ramón; Situ, Haozhen
2016-12-01
The disrupting effect of quantum noise on the dynamics of a spatial quantum relativistic formulation of the iterated prisoner's dilemma game with variable entangling is studied in this work. The game is played in the cellular automata manner, i.e., with local and synchronous interaction. The game is assessed in fair and unfair contests.
Language Emptiness of Continuous-Time Parametric Timed Automata
DEFF Research Database (Denmark)
Benes, Nikola; Bezdek, Peter; Larsen, Kim Guldstrand
2015-01-01
Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even for various restricted subclasses. We thus focus on the case...... of these clocks is compared with (an arbitrary number of) parameters, we show that the parametric language emptiness is decidable. The undecidability result tightens the bounds of a previous result which assumed six parameters, while the decidability result extends the existing approaches that deal with discrete......-time semantics only. To the best of our knowledge, this is the first positive result in the case of continuous-time and unbounded integer parameters, except for the rather simple case of single-clock automata....
Schema Redescription in Cellular Automata: Revisiting Emergence in Complex Systems
Marques-Pita, Manuel
2011-01-01
We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of individual input variables, and another to capture permutability in sets of input variables: fully characterizing the canalization present in Boolean functions. Two-symbol schemata explain aspects of the behaviour of automata networks that the characterization of their emergent patterns does not capture. We use our method to compare two well-known cellular automata for the density classification task: the human engineered CA GKL, and another obtained via genetic programming. We show that despite having very different collective behaviour, these rules are very similar. Indeed, GKL is a special case of GP. Therefore, we demonstrate that it is more feasible to compare cellular automata via schema redescriptions of their rules, than by looking at their emergent behaviour, leading us to question the tendency in complexity research to pay much m...
Viewing hybrid systems as products of control systems and automata
Grossman, R. L.; Larson, R. G.
1992-01-01
The purpose of this note is to show how hybrid systems may be modeled as products of nonlinear control systems and finite state automata. By a hybrid system, we mean a network of consisting of continuous, nonlinear control system connected to discrete, finite state automata. Our point of view is that the automata switches between the control systems, and that this switching is a function of the discrete input symbols or letters that it receives. We show how a nonlinear control system may be viewed as a pair consisting of a bialgebra of operators coding the dynamics, and an algebra of observations coding the state space. We also show that a finite automata has a similar representation. A hybrid system is then modeled by taking suitable products of the bialgebras coding the dynamics and the observation algebras coding the state spaces.
An Introduction to Input/Output Automata. Revision
1988-11-18
example, a leader election algorithm. Finally, Section 5 contains a survey of some of the uses that have so far been made of the model. Keywords: I/O automata, Asynchronous systems, Concurrency, Computer modeling, Data transfer.
Achieving of Fuzzy Automata for Processing Fuzzy Logic
Institute of Scientific and Technical Information of China (English)
SHU Lan; WU Qing-e
2005-01-01
At present, there has been an increasing interest in neuron-fuzzy systems, the combinations of artificial neural networks with fuzzy logic. In this paper, a definition of fuzzy finite state automata (FFA) is introduced and fuzzy knowledge equivalence representations between neural networks, fuzzy systems and models of automata are discussed. Once the network has been trained, we develop a method to extract a representation of the FFA encoded in the recurrent neural network that recognizes the training rules.
Cellular automata in Xenakis's music. Theory and Practice
Solomos, Makis
2005-01-01
International audience; Cellular automata are developed since some decades, belonging to the field of abstract automata. In the beginning of the 1980s, they were popularized in relationship with the study of dynamic systems and chaos theories. They were also applied for modelling the evolution of natural systems (for instance biological ones), especially in relationship with the idea of auto-organization. From the end of the 1980s since nowadays, several composers begin to use cellular automa...
Concretization and animation of Finite Automata with c-cards
DEFF Research Database (Denmark)
Valente, Andrea
2004-01-01
to classes of 10 to 12 years old, and in general to students with a limited mathematical background. Our approach builds on {\\em computational cards} (or c-cards), a project aiming at scaling-down the learning complexity of computer science core contents, by presenting symbol manipulation via a t......-cards is given and its educational implication discussed: the mapping provides a mean to concretize and animate automata. The algorithm works with both deterministic and non-deterministic finite automata....
Resource-Optimal Scheduling Using Priced Timed Automata
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand; Rasmussen, Jacob Illum; Subramani, K.
2004-01-01
In this paper, we show how the simple structure of the linear programs encountered during symbolic minimum-cost reachability analysis of priced timed automata can be exploited in order to substantially improve the performance of the current algorithm. The idea is rooted in duality of linear progr......-80 percent performance gain. As a main application area, we show how to solve energy-optimal task graph scheduling problems using the framework of priced timed automata....
Scattering in Quantum Lattice Gases
O'Hara, Andrew; Love, Peter
2009-03-01
Quantum Lattice Gas Automata (QLGA) are of interest for their use in simulating quantum mechanics on both classical and quantum computers. QLGAs are an extension of classical Lattice Gas Automata where the constraint of unitary evolution is added. In the late 1990s, David A. Meyer as well as Bruce Boghosian and Washington Taylor produced similar models of QLGAs. We start by presenting a unified version of these models and study them from the point of view of the physics of wave-packet scattering. We show that the Meyer and Boghosian-Taylor models are actually the same basic model with slightly different parameterizations and limits. We then implement these models computationally using the Python programming language and show that QLGAs are able to replicate the analytic results of quantum mechanics (for example reflected and transmitted amplitudes for step potentials and the Klein paradox).
SELF-ORGANIZED CRITICALITY AND CELLULAR AUTOMATA
Energy Technology Data Exchange (ETDEWEB)
CREUTZ,M.
2007-01-01
Cellular automata provide a fascinating class of dynamical systems based on very simple rules of evolution yet capable of displaying highly complex behavior. These include simplified models for many phenomena seen in nature. Among other things, they provide insight into self-organized criticality, wherein dissipative systems naturally drive themselves to a critical state with important phenomena occurring over a wide range of length and the scales. This article begins with an overview of self-organized criticality. This is followed by a discussion of a few examples of simple cellular automaton systems, some of which may exhibit critical behavior. Finally, some of the fascinating exact mathematical properties of the Bak-Tang-Wiesenfeld sand-pile model [1] are discussed.
Simulating Complex Systems by Cellular Automata
Kroc, Jiri; Hoekstra, Alfons G
2010-01-01
Deeply rooted in fundamental research in Mathematics and Computer Science, Cellular Automata (CA) are recognized as an intuitive modeling paradigm for Complex Systems. Already very basic CA, with extremely simple micro dynamics such as the Game of Life, show an almost endless display of complex emergent behavior. Conversely, CA can also be designed to produce a desired emergent behavior, using either theoretical methodologies or evolutionary techniques. Meanwhile, beyond the original realm of applications - Physics, Computer Science, and Mathematics – CA have also become work horses in very different disciplines such as epidemiology, immunology, sociology, and finance. In this context of fast and impressive progress, spurred further by the enormous attraction these topics have on students, this book emerges as a welcome overview of the field for its practitioners, as well as a good starting point for detailed study on the graduate and post-graduate level. The book contains three parts, two major parts on th...
Cellular Automata Models for Diffusion of Innovations
Fuks, H; Fuks, Henryk; Boccara, Nino
1997-01-01
We propose a probabilistic cellular automata model for the spread of innovations, rumors, news, etc. in a social system. The local rule used in the model is outertotalistic, and the range of interaction can vary. When the range R of the rule increases, the takeover time for innovation increases and converges toward its mean-field value, which is almost inversely proportional to R when R is large. Exact solutions for R=1 and $R=\\infty$ (mean-field) are presented, as well as simulation results for other values of R. The average local density is found to converge to a certain stationary value, which allows us to obtain a semi-phenomenological solution valid in the vicinity of the fixed point n=1 (for large t).
Computing by Temporal Order: Asynchronous Cellular Automata
Directory of Open Access Journals (Sweden)
Michael Vielhaber
2012-08-01
Full Text Available Our concern is the behaviour of the elementary cellular automata with state set 0,1 over the cell set Z/nZ (one-dimensional finite wrap-around case, under all possible update rules (asynchronicity. Over the torus Z/nZ (n<= 11,we will see that the ECA with Wolfram rule 57 maps any v in F_2^n to any w in F_2^n, varying the update rule. We furthermore show that all even (element of the alternating group bijective functions on the set F_2^n = 0,...,2^n-1, can be computed by ECA57, by iterating it a sufficient number of times with varying update rules, at least for n <= 10. We characterize the non-bijective functions computable by asynchronous rules.
A cellular automata model for ant trails
Indian Academy of Sciences (India)
Sibel Gokce; Ozhan Kayacan
2013-05-01
In this study, the unidirectional ant traffic flow with U-turn in an ant trail was investigated using one-dimensional cellular automata model. It is known that ants communicate with each other by dropping a chemical, called pheromone, on the substrate. Apart from the studies in the literature, it was considered in the model that (i) ant colony consists of two kinds of ants, goodand poor-smelling ants, (ii) ants might make U-turn for some special reasons. For some values of densities of good- and poor-smelling ants, the flux and mean velocity of the colony were studied as a function of density and evaporation rate of pheromone.
Knowledge discovery for geographical cellular automata
Institute of Scientific and Technical Information of China (English)
LI Xia; Anthony Gar-On Yeh
2005-01-01
This paper proposes a new method for geographical simulation by applying data mining techniques to cellular automata. CA has strong capabilities in simulating complex systems. The core of CA is how to define transition rules. There are no good methods for defining these transition rules. They are usually defined by using heuristic methods and thus subject to uncertainties. Mathematical equations are used to represent transition rules implicitly and have limitations in capturing complex relationships. This paper demonstrates that the explicit transition rules of CA can be automatically reconstructed through the rule induction procedure of data mining. The proposed method can reduce the influences of individual knowledge and preferences in defining transition rules and generate more reliable simulation results. It can efficiently discover knowledge from a vast volume of spatial data.
Cellular automata in image processing and geometry
Adamatzky, Andrew; Sun, Xianfang
2014-01-01
The book presents findings, views and ideas on what exact problems of image processing, pattern recognition and generation can be efficiently solved by cellular automata architectures. This volume provides a convenient collection in this area, in which publications are otherwise widely scattered throughout the literature. The topics covered include image compression and resizing; skeletonization, erosion and dilation; convex hull computation, edge detection and segmentation; forgery detection and content based retrieval; and pattern generation. The book advances the theory of image processing, pattern recognition and generation as well as the design of efficient algorithms and hardware for parallel image processing and analysis. It is aimed at computer scientists, software programmers, electronic engineers, mathematicians and physicists, and at everyone who studies or develops cellular automaton algorithms and tools for image processing and analysis, or develops novel architectures and implementations of mass...
Modelling Cow Behaviour Using Stochastic Automata
DEFF Research Database (Denmark)
Jónsson, Ragnar Ingi
This report covers an initial study on the modelling of cow behaviour using stochastic automata with the aim of detecting lameness. Lameness in cows is a serious problem that needs to be dealt with because it results in less profitable production units and in reduced quality of life...... of which describe the cows' activity in the two regarded behavioural scenarios, non-lame and lame. Using the experimental measurement data the different behavioural relations for the two regarded behavioural scenarios are assessed. The three models comprise activity within last hour, activity within last...... for the affected livestock. By featuring training data consisting of measurements of cow activity, three different models are obtained, namely an autonomous stochastic automaton, a stochastic automaton with coinciding state and output and an autonomous stochastic automaton with coinciding state and output, all...
Fuzzy Automata Induction using Construction Method
Directory of Open Access Journals (Sweden)
Mo Z. Wen
2006-01-01
Full Text Available Recurrent neural networks have recently been demonstrated to have the ability to learn simple grammars. In particular, networks using second-order units have been successfully at this task. However, it is often difficult to predict the optimal neural network size to induce an unknown automaton from examples. Instead of just adjusting the weights in a network of fixed topology, we adopt the dynamic networks (i.e. the topology and weights can be simultaneously changed during training for this application. We apply the idea of maximizing correlation in the cascade-correlation algorithm to the second-order single-layer recurrent neural network to generate a new construction algorithm and use it to induce fuzzy finite state automata. The experiment indicates that such a dynamic network performs well.
Particles and Patterns in Cellular Automata
Energy Technology Data Exchange (ETDEWEB)
Jen, E.; Das, R.; Beasley, C.E.
1999-06-03
This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). Our objective has been to develop tools for studying particle interactions in a class of dynamical systems characterized by discreteness, determinism, local interaction, and an inherently parallel form of evolution. These systems can be described by cellular automata (CA) and the behavior we studied has improved our understanding of the nature of patterns generated by CAs, their ability to perform global computations, and their relationship to continuous dynamical systems. We have also developed a rule-table mathematics that enables one to custom-design CA rule tables to generate patterns of specified types, or to perform specified computational tasks.
Chua's Nonlinear Dynamics Perspective of Cellular Automata
Pazienza, Giovanni E.
2013-01-01
Chua's `Nonlinear Dynamics Perspective of Cellular Automata' represents a genuine breakthrough in this area and it has had a major impact on the recent scientific literature. His results have been accurately described in a series of fourteen papers appeared over the course of eight years but there is no compendious introduction to his work. Therefore, here for the first time, we present Chua's main ideas as well as a few unpublished results that have not been included in his previous papers. This overview illustrates the essence of Chua's work by using a clear terminology and a consistent notation, and it is aimed at those who want to approach this subject through a concise but thorough exposition.
Design and Performance Analysis of Reversible Logic Four Quadrant Multiplier Using CSLA and CLAA
Directory of Open Access Journals (Sweden)
Mr. P. Dileep Kumar Reddy
2014-03-01
Full Text Available Multiplication is a fundamental operation in most signal processing algorithms. Multipliers have large area, long latency and consume considerable power. Therefore low-power multiplier design has been an important part in low- power VLSI system design. There has been extensive work on low-power multipliers at technology, physical, circuit and logic levels. A system’s performance is generally determined by the performance of the multiplier because the multiplier is generally the slowest element in the system. Furthermore, it is generally the most area consuming. Hence, optimizing the speed and area of the multiplier is a major design issue. However, area and speed are usually conflicting constraints so that improving speed results mostly in larger areas. As a result, a whole spectrum of multipliers with different area- speed constraints has been designed with reversible logic gates. The reversible logic has the promising applications in emerging computing paradigm such as quantum computing, quantum dot cellular automata, optical computing, etc. In reversible logic gates there is a unique one-to-one mapping between the inputs and outputs.
Al-Khalili, Jim
2003-01-01
In this lively look at quantum science, a physicist takes you on an entertaining and enlightening journey through the basics of subatomic physics. Along the way, he examines the paradox of quantum mechanics--beautifully mathematical in theory but confoundingly unpredictable in the real world. Marvel at the Dual Slit experiment as a tiny atom passes through two separate openings at the same time. Ponder the peculiar communication of quantum particles, which can remain in touch no matter how far apart. Join the genius jewel thief as he carries out a quantum measurement on a diamond without ever touching the object in question. Baffle yourself with the bizzareness of quantum tunneling, the equivalent of traveling partway up a hill, only to disappear then reappear traveling down the opposite side. With its clean, colorful layout and conversational tone, this text will hook you into the conundrum that is quantum mechanics.
A quantum Samaritan’s dilemma cellular automaton
Situ, Haozhen
2017-01-01
The dynamics of a spatial quantum formulation of the iterated Samaritan’s dilemma game with variable entangling is studied in this work. The game is played in the cellular automata manner, i.e. with local and synchronous interaction. The game is assessed in fair and unfair contests, in noiseless scenarios and with disrupting quantum noise. PMID:28680654
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
Minimum-Cost Reachability for Priced Timed Automata
DEFF Research Database (Denmark)
Behrmann, Gerd; Fehnker, Ansgar; Hune, Thomas Seidelin;
2001-01-01
This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine the mini......This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine...... the minimum cost of executions from the initial state to the target state. This problem generalizes the minimum-time reachability problem for ordinary timed automata. We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques...... and a new notion of priced regions. The latter allows symbolic representation and manipulation of reachable states together with the cost of reaching them....
What are the Hidden Quantum Processes Behind Newton's Laws?
Ostoma, Tom; Trushyk, Mike
1999-01-01
We investigate the hidden quantum processes that are responsible for Newton's laws of motion and Newton's universal law of gravity. We apply Electro-Magnetic Quantum Gravity or EMQG to investigate Newtonian classical physics. EQMG is a quantum gravity theory that is manifestly compatible with Cellular Automata (CA) theory, a new paradigm for physical reality. EMQG is also based on a theory of inertia proposed by R. Haisch, A. Rueda, and H. Puthoff, which we modified and called Quantum Inertia...
Urban sprawl modeling using cellular automata
Directory of Open Access Journals (Sweden)
Shikhar Deep
2014-12-01
Full Text Available The population settlements in the fast-growing urban world need to be monitored in order to design a sustainable urban habitat. The remote sensing and GIS are considered as an effective monitoring and decision-support tool in urban planning. This study compiles the results of a study undertaken to measure the urban sprawl in Dehradun city, India through cellular automata CA-Markov model. CA-Markov model can effectively be used to study the urban dynamics in rapidly growing cities. Being an effective tool for encoding spatial structures, the information generated by it could be used to predict urban scenarios for sustainable growth. To achieve the goal, the temporal images of LISS IV were used to analyse the spatial pattern of land cover change in the area and the future growth was modeled by applying CA-Markov model. The results clearly suggest that major changes between the periods of 2004 and 2009 occurred in built up classes (about 27% followed by agriculture (17.7% and fallow land (10.2%. The projection as predicted using CA-Markov model suggested a value of kappa coefficient = 0.91 which indicates the validity of the model to predict future projections. Modeling suggested a clear trend of various land use classes’ transformation in the area of urban built up expansions. It is concluded that RS and GIS can be an effective decision support tool for policy makers to design sustainable urban habitats.
On the topological sensitivity of cellular automata
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.
Communicative automata based programming. Society Framework
Directory of Open Access Journals (Sweden)
Andrei Micu
2015-10-01
Full Text Available One of the aims of this paper is to present a new programming paradigm based on the new paradigms intensively used in IT industry. Implementation of these techniques can improve the quality of code through modularization, not only in terms of entities used by a program, but also in terms of states in which they pass. Another aspect followed in this paper takes into account that in the development of software applications, the transition from the design to the source code is a very expensive step in terms of effort and time spent. Diagrams can hide very important details for simplicity of understanding, which can lead to incorrect or incomplete implementations. To improve this process communicative automaton based programming comes with an intermediate step. We will see how it goes after creating modeling diagrams to communicative automata and then to writing code for each of them. We show how the transition from one step to another is much easier and intuitive.
The Design of ADAT: A Tool for Assessing Automata-Based Assignments
Directory of Open Access Journals (Sweden)
Zarina Shukur
2008-01-01
Full Text Available This study describes the design of an automatic assessment system for assessing an automata-based assignment. Automata concept is taught in several undergraduate computing courses such as Theory of Computation, Automata and Formal Languages and Compilers. We take two elements into consideration when assessing the student's answers; static element and dynamic element. The static element involves the number of states (initial and final as well and the number of transitions. Whilst the dynamic aspect involves executing the automata against several test data. In this work, we rely heavily on the JFLAP for drawing and executing the automata.
Design of the Sequential System Automata using Temporal Equivalence Classes
Directory of Open Access Journals (Sweden)
A. Ursu
1997-10-01
Full Text Available A design method of sequential system automata using temporal logic specifications is proposed in this paper. The method is based on well-known Z.Manna and P.Wolper temporal logic satisfiability analysis procedure [1] and is extended to include past time temporal operators. A new specification method which uses temporal equivalence classes is proposed to specify the behaviour of large digital circuits. The impact of the composition and decomposition operations of the temporal equivalence classes on the final automata has been studied. A case study is carried out which deals with the design of the synchronous bus arbiter circuit element. The SMV tool has been used to verify the temporal properties of the obtained automata.
Minimum-Cost Reachability for Priced Timed Automata
DEFF Research Database (Denmark)
Behrmann, Gerd; Fehnker, Ansgar; Hune, Thomas Seidelin
2001-01-01
This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both transitions and locations. For this model we consider the minimum-cost reachability problem: i.e. given a linearly priced timed automaton and a target state, determine...... the minimum cost of executions from the initial state to the target state. This problem generalizes the minimum-time reachability problem for ordinary timed automata. We prove decidability of this problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques...... and a new notion of priced regions. The latter allows symbolic representation and manipulation of reachable states together with the cost of reaching them....
Modelling Social-Technical Attacks with Timed Automata
DEFF Research Database (Denmark)
David, Nicolas; David, Alexandre; Hansen, Rene Rydhof
2015-01-01
in our model and perform analysis and simulation of both model and attack, revealing details about the specific interaction between attacker and victim. Using timed automata also allows for intuitive modelling of systems, in which quantities like time and cost can be easily added and analysed.......Attacks on a system often exploit vulnerabilities that arise from human behaviour or other human activity. Attacks of this type, so-called socio-technical attacks, cover everything from social engineering to insider attacks, and they can have a devastating impact on an unprepared organisation....... In this paper we develop an approach towards modelling socio-technical systems in general and socio-technical attacks in particular, using timed automata and illustrate its application by a complex case study. Thanks to automated model checking and automata theory, we can automatically generate possible attacks...
A Quantum Relativistic Prisoner's Dilemma Cellular Automaton
Alonso-Sanz, Ramón; Carvalho, Márcio; Situ, Haozhen
2016-10-01
The effect of variable entangling on the dynamics of a spatial quantum relativistic formulation of the iterated prisoner's dilemma game is studied in this work. The game is played in the cellular automata manner, i.e., with local and synchronous interaction. The game is assessed in fair and unfair contests.
Optimal Conditional Reachability for Multi-Priced Timed Automata
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand; Rasmussen, Jacob Illum
2005-01-01
In this paper, we prove decidability of the optimal conditional reachability problem for multi-priced timed automata, an extension of timed automata with multiple cost variables evolving according to given rates for each location. More precisely, we consider the problem of determining the minimal...... cost of reaching a given target state, with respect to some primary cost variable, while respecting upper bound constraints on the remaining (secondary) cost variables. Decidability is proven by constructing a zone-based algorithm that always terminates while synthesizing the optimal cost with a single...... secondary cost variable. The approach is then lifted to any number of secondary cost variables....
A half-century of automata theory celebration and inspiration
Salomaa, A; Yu, S
2001-01-01
This volume gathers lectures by 8 distinguished pioneers of automata theory, including two Turing Award winners. In each contribution, the early developments of automata theory are reminisced about and future directions are suggested. Although some of the contributions go into rather intriguing technical details, most of the book is accessible to a wide audience interested in the progress of the age of computers. The book is a must for professionals in theoretical computer science and related areas of mathematics. For students in these areas it provides an exceptionally deep view at the beginn
Segnorile, H H
2013-01-01
An experimental study of NMR spin decoherence in nematic liquid crystals is presented. The outcome of the experiments are analyzed in the framework of a theory that considers the spins as an open quantum system coupled to a quantum molecular environment, presented by the authors recently. Decoherence dynamics can be put in evidence by means of refocusing experiments of the dipolar interactions. The experimental technique used in this work is based on the MREV8 pulse sequence. Non-idealities of the experimental setting, like external field inhomogeneity, pulse misadjustments and the presence of non-reverted spin interaction terms are analysed in detail and their effects on the observed signal decay are estimated. It is found that, though all these non-idealities could in principle affect the evolution of the spin dynamics, their influence can be mitigated and they do not present the characteristic behaviour of the irreversible spin decoherence. As unique characteristic of decoherence, the experimental results ...
Reversible Logic Circuit Synthesis
Shende, V V; Markov, I L; Prasad, A K; Hayes, John P.; Markov, Igor L.; Prasad, Aditya K.; Shende, Vivek V.
2002-01-01
Reversible, or information-lossless, circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requirement for quantum computation. We investigate the synthesis of reversible circuits that employ a minimum number of gates and contain no redundant input-output line-pairs (temporary storage channels). We propose new constructions for reversible circuits composed of NOT, Controlled-NOT, and TOFFOLI gates (the CNT gate library) based on permutation theory. A new algorithm is given to synthesize optimal reversible circuits using an arbitrary gate library. We also describe much faster heuristic algorithms. We also pursue applications of the proposed techniques to the synthesis of quantum circuits.
Alternating register automata on finite words and trees
Figueira, Diego
2012-01-01
We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain. We investigate one-way automata with alternating control over data words or trees, with one register for storing data and comparing them for equality. This is a continuation of the study started by Demri, Lazic and Jurdzinski. From the standpoint of register automata models, this work aims at two objectives: (1) simplifying the existent decidability proofs for the emptiness problem for alternating register automata; and (2) exhibiting decidable extensions for these models. From the logical perspective, we show that (a) in the case of data words, satisfiability of LTL with one register and quantification over data values is decidable; and (b) the satisfiability problem for the so-called forward fragment of XPath on XML documents is decidable, even in the presence of DT...
Complete Abstractions of Dynamical Systems by Timed Automata
DEFF Research Database (Denmark)
Sloth, Christoffer; Wisniewski, Rafael
2013-01-01
This paper addresses the generation of complete abstractions of polynomial dynamical systems by timed automata. For the proposed abstraction, the state space is divided into cells by sublevel sets of functions. We identify a relation between these functions and their directional derivatives along...
Boolean linear differential operators on elementary cellular automata
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.
Comprehensive bidding strategies with genetic programming/finite state automata
Energy Technology Data Exchange (ETDEWEB)
Richter, C.W. Jr.; Sheble, G.B.; Ashlock, D.
1999-11-01
This research is an extension of the authors' previous work in double auctions aimed at developing bidding strategies for electric utilities which trade electricity competitively. The improvements detailed in this paper come from using data structures which combine genetic programming and finite state automata termed GP-Automata. The strategies developed by the method described here are adaptive--reacting to inputs--whereas the previously developed strategies were only suitable in the particular scenario for which they had been designed. The strategies encoded in the GP-Automata are tested in an auction simulator. The simulator pits them against other distribution companies (distcos) and generation companies (gencos), buying and selling power via double auctions implemented in regional commodity exchanges. The GP-Automata are evolved with a genetic algorithm so that they possess certain characteristics. In addition to designing successful bidding strategies (whose usage would result in higher profits) the resulting strategies can also be designed to imitate certain types of trading behaviors. The resulting strategies can be implemented directly in on-line trading, or can be used as realistic competitors in an off-line trading simulator.
Efficient Modelling and Generation of Markov Automata (extended version)
Timmer, Mark; Katoen, Joost-Pieter; Pol, van de Jaco; Stoelinga, Mariëlle
2012-01-01
This paper introduces a framework for the efficient modelling and generation of Markov automata. It consists of (1) the data-rich process-algebraic language MAPA, allowing concise modelling of systems with nondeterminism, probability and Markovian timing; (2) a restricted form of the language, the M
Reachability analysis for timed automata using max-plus algebra
DEFF Research Database (Denmark)
Lu, Qi; Madsen, Michael; Milata, Martin
2012-01-01
We show that max-plus polyhedra are usable as a data structure in reachability analysis of timed automata. Drawing inspiration from the extensive work that has been done on difference bound matrices, as well as previous work on max-plus polyhedra in other areas, we develop the algorithms needed t...
Modeling diffusion of innovations with probabilistic cellular automata
Boccara, N; Boccara, Nino; Fuks, Henryk
1997-01-01
We present a family of one-dimensional cellular automata modeling the diffusion of an innovation in a population. Starting from simple deterministic rules, we construct models parameterized by the interaction range and exhibiting a second-order phase transition. We show that the number of individuals who eventually keep adopting the innovation strongly depends on connectivity between individuals.
Modelling and simulating in-stent restenosis with complex automata
Hoekstra, A.G.; Lawford, P.; Hose, R.
2010-01-01
In-stent restenosis, the maladaptive response of a blood vessel to injury caused by the deployment of a stent, is a multiscale system involving a large number of biological and physical processes. We describe a Complex Automata Model for in-stent restenosis, coupling bulk flow, drug diffusion, and s
Asynchronous adaptive time step in quantitative cellular automata modeling
Directory of Open Access Journals (Sweden)
Sun Yan
2004-06-01
Full Text Available Abstract Background The behaviors of cells in metazoans are context dependent, thus large-scale multi-cellular modeling is often necessary, for which cellular automata are natural candidates. Two related issues are involved in cellular automata based multi-cellular modeling: how to introduce differential equation based quantitative computing to precisely describe cellular activity, and upon it, how to solve the heavy time consumption issue in simulation. Results Based on a modified, language based cellular automata system we extended that allows ordinary differential equations in models, we introduce a method implementing asynchronous adaptive time step in simulation that can considerably improve efficiency yet without a significant sacrifice of accuracy. An average speedup rate of 4–5 is achieved in the given example. Conclusions Strategies for reducing time consumption in simulation are indispensable for large-scale, quantitative multi-cellular models, because even a small 100 × 100 × 100 tissue slab contains one million cells. Distributed and adaptive time step is a practical solution in cellular automata environment.
Modeling urban expansion by using variable weights logistic cellular automata
Shu, Bangrong; Bakker, Martha M.; Zhang, Honghui; Li, Yongle; Qin, Wei; Carsjens, Gerrit J.
2017-01-01
Simulation models based on cellular automata (CA) are widely used for understanding and simulating complex urban expansion process. Among these models, logistic CA (LCA) is commonly adopted. However, the performance of LCA models is often limited because the fixed coefficients obtained from binary
On using priced timed automata to achieve optimal scheduling
DEFF Research Database (Denmark)
Rasmussen, Jacob Illum; Larsen, Kim Guldstrand; Subramani, K.
2006-01-01
This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European proj...
Completely reproducible description of digital sound data with cellular automata
Energy Technology Data Exchange (ETDEWEB)
Wada, Masato; Kuroiwa, Jousuke; Nara, Shigetoshi
2002-12-30
A novel method of compressive and completely reproducible description of digital sound data by means of rule dynamics of CA (cellular automata) is proposed. The digital data of spoken words and music recorded with the standard format of a compact disk are reproduced completely by this method with use of only two rules in a one-dimensional CA without loss of information.
Timed-Arc Petri Nets vs. Networks of Timed Automata
DEFF Research Database (Denmark)
Srba, Jiri
requirement and provide efficient (polynomial time) reductions between networks of timed automata and 1-safe timed-arc Petri nets preserving the answer to the reachability question. This makes our techniques suitable for automatic translation into a format required by tools like UPPAAL and KRONOS. A direct...
A Bibliography on Fuzzy Automata, Grammars and Lanuages
Asveld, P.R.J.
1996-01-01
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy languages by means of fuzzy grammars, the recognition of fuzzy languages by fuzzy automata and machines, as well as some applications of fuzzy set theory to syntactic pattern recognition, linguistics a
A Bibliography on Fuzzy Automata, Grammars and Lanuages
Asveld, Peter R.J.
1995-01-01
This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy languages by means of fuzzy grammars, the recognition of fuzzy languages by fuzzy automata and machines, as well as some applications of fuzzy set theory to syntactic pattern recognition, linguistics a
Some applications and prospects of cellular automata in traffic problems
Goldengorin, Boris; Makarenko, Alexander; Smelyanec, Natalia; Yacoubi, SE; Chopard, B; Bandini, S
2006-01-01
In this paper we deal with mathematical modeling of participants' movement based on cellular automata (CA). We describe some improvements of CA models of pedestrian motion taking into account the real geometrical constraints induced by a specific restricted space. Also some presumable optimization p
TAME: A Specialized Specification and Verification System for Timed Automata
1996-12-01
Lecture Notes in Computer Science . Springer...Courcoubetis, edi- tor, Computer Aided Veri cation, CAV , vol- ume 697 of Lecture Notes in Computer Science , pages 292{304. Springer-Verlag, 1993. [10...automata. In J. C. M. Baeten and J. F. Goote, editors, CONCUR: 2nd Intern. Conference on Concurrency Theory, volume 527 of Lecture Notes in Computer Science ,
Modelling and simulating in-stent restenosis with complex automata
Hoekstra, A.G.; Lawford, P.; Hose, R.
2010-01-01
In-stent restenosis, the maladaptive response of a blood vessel to injury caused by the deployment of a stent, is a multiscale system involving a large number of biological and physical processes. We describe a Complex Automata Model for in-stent restenosis, coupling bulk flow, drug diffusion, and s
Using a satisfiability solver to identify deterministic finite state automata
Heule, M.J.H.; Verwer, S.
2009-01-01
We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level SAT representation, our approach seems to be competitive with alternative techniques. Our contributions are threefold: First, we p
Automata for the People: Machine Noise and Attention
Directory of Open Access Journals (Sweden)
David Ellison
2012-11-01
Full Text Available This article examines the production and reception of incidental machine noise, specifically the variably registered sounds emanating from automata in the eighteenth and nineteenth centuries. The argument proposed here is that the audience for automata performances demonstrated a capacity to screen out mechanical noise that may have otherwise interfered with the narrative theatricality of their display. In this regard the audience may be said to resemble auditors at musical performances who learned to suppress the various noises associated with the physical mechanics of performance, and the faculty of attention itself. For William James among others, attention demands selection among competing stimuli. As the incidental noise associated with automata disappears from sensibility over time, its capacity to signify in other contexts emerges. In the examples traced here, such noise is a means of distinguishing a specifically etherealised human-machine interaction. This is in sharp distinction from other more degrading forms of relationship such as the sound of bodies labouring at machines. In this regard, the barely detected sound of the automata in operation may be seen as a precursor to the white noise associated with modern, corporate productivity.
UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata
DEFF Research Database (Denmark)
Bulychev, Petr; David, Alexandre; Larsen, Kim Guldstrand
2012-01-01
This paper offers a survey of U PPAAL - SMC, a major extension of the real-time verification tool U PPAAL. U PPAAL - SMC allows for the efficient analysis of performance properties of networks of priced timed automata under a natural stochastic semantics. In particular, U PPAAL - SMC relies on a ...
About the globular homology of higher dimensional automata
Gaucher, Philippe
2000-01-01
We introduce a new simplicial nerve of higher dimensional automata whose homology groups yield a new definition of the globular homology. With this new definition, the drawbacks noticed with the construction of math.CT/9902151 disappear. Moreover the important morphisms which associate to every globe its corresponding branching area and merging area of execution paths become morphisms of simplicial sets.
Project RAMA: Reconstructing Asteroids Into Mechanical Automata
Dunn, Jason; Fagin, Max; Snyder, Michael; Joyce, Eric
2017-01-01
Many interesting ideas have been conceived for building space-based infrastructure in cislunar space. From O'Neill's space colonies, to solar power satellite farms, and even prospecting retrieved near earth asteroids. In all the scenarios, one thing remained fixed - the need for space resources at the outpost. To satisfy this need, O'Neill suggested an electromagnetic railgun to deliver resources from the lunar surface, while NASA's Asteroid Redirect Mission called for a solar electric tug to deliver asteroid materials from interplanetary space. At Made In Space, we propose an entirely new concept. One which is scalable, cost effective, and ensures that the abundant material wealth of the inner solar system becomes readily available to humankind in a nearly automated fashion. We propose the RAMA architecture, which turns asteroids into self-contained spacecraft capable of moving themselves back to cislunar space. The RAMA architecture is just as capable of transporting conventional-sized asteroids on the 10-meter length scale as transporting asteroids 100 meters or larger, making it the most versatile asteroid retrieval architecture in terms of retrieved-mass capability. This report describes the results of the Phase I study funded by the NASA NIAC program for Made In Space to establish the concept feasibility of using space manufacturing to convert asteroids into autonomous, mechanical spacecraft. Project RAMA, Reconstituting Asteroids into Mechanical Automata, is designed to leverage the future advances of additive manufacturing (AM), in-situ resource utilization (ISRU) and in-situ manufacturing (ISM) to realize enormous efficiencies in repeated asteroid redirect missions. A team of engineers at Made In Space performed the study work with consultation from the asteroid mining industry, academia, and NASA. Previous studies for asteroid retrieval have been constrained to studying only asteroids that are both large enough to be discovered, and small enough to be
Energy Technology Data Exchange (ETDEWEB)
Hosseini, Mohammad Saeid, E-mail: mshosseini1336@yahoo.com; Kamali, Mohsen
2015-11-15
In this work, CdS/ZnS quantum dots (QDs) coated with aspartic acid (AsA) were synthesized in reverse micelles. The synthesized QDs were characterized by XRD, TEM, IR and photoluminescence (PL) spectroscopy. It was found that the intensity of CdS/ZnS QDs coated with AsA is much greater than CdS, and CdS/ZnS QDs. The interaction of some heavy metal ions with CdS/ZnS/AsA QDs was investigated at different buffering pH media. Based on the PL quenching of the QDs in the presence of each one of the metal ions, the feasibility of their determinations was examined according to the Stern–Volmer equation. The investigations showed that Hg(II) ions can be easily determined in contaminated atmospheric environments with the detection limit of 0.05 mg m{sup −3}. The results were satisfactorily confirmed by cold vapor atomic absorption spectrometric method. - Highlights: • A new CdS/ZnS quantum dot capped with aspartic acid (DDBA) was prepared. • The prepared QDs benefit from a favorable fluorescence. • Interaction of some metal ions with the QDs was examined according to the Stern–Volmer equation. • The determination of Hg(II) is feasible in the present of many co-existence metal ions. • The method benefits from a high-speed and considerable simplicity for Hg(II) determination.
Zhang, Yichen; Li, Zhengyu; Zhao, Yijia; Yu, Song; Guo, Hong
2017-02-01
We analyze the security of the two-way continuous-variable quantum key distribution protocol in reverse reconciliation against general two-mode attacks, which represent all accessible attacks at fixed channel parameters. Rather than against one specific attack model, the expression of secret key rates of the two-way protocol are derived against all accessible attack models. It is found that there is an optimal two-mode attack to minimize the performance of the protocol in terms of both secret key rates and maximal transmission distances. We identify the optimal two-mode attack, give the specific attack model of the optimal two-mode attack and show the performance of the two-way protocol against the optimal two-mode attack. Even under the optimal two-mode attack, the performances of two-way protocol are still better than the corresponding one-way protocol, which shows the advantage of making double use of the quantum channel and the potential of long-distance secure communication using a two-way protocol.
A full computation-relevant topological dynamics classification of elementary cellular automata
SchÜle, M.; Stoop, R.
2012-01-01
Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and chaoticity. The "complex" ECA emerge to be sensitive, but not chaotic and not eventually weakly periodic. Based on this classification, we conjecture that elementary cellular automata capable of carrying out complex computations, such as needed for Turing-universal...
Quantum information theory with Gaussian systems
Energy Technology Data Exchange (ETDEWEB)
Krueger, O.
2006-04-06
This thesis applies ideas and concepts from quantum information theory to systems of continuous-variables such as the quantum harmonic oscillator. The focus is on three topics: the cloning of coherent states, Gaussian quantum cellular automata and Gaussian private channels. Cloning was investigated both for finite-dimensional and for continuous-variable systems. We construct a private quantum channel for the sequential encryption of coherent states with a classical key, where the key elements have finite precision. For the case of independent one-mode input states, we explicitly estimate this precision, i.e. the number of key bits needed per input state, in terms of these parameters. (orig.)
Quantum reversible logic circuits synthesis based on genetic algorithm%基于遗传算法的量子可逆逻辑电路综合方法研究
Institute of Scientific and Technical Information of China (English)
吕洪君; 乐亮; 韩良顺; 解光军
2011-01-01
量子可逆逻辑电路综合主要是研究在给定的量子门和量子电路的约束条件及限制下,找到最小或较小的量子代价实现所需量子逻辑功能的电路.把量子逻辑门的功能用矩阵的数学模型表示,用遗传算法作全局搜索工具,将遗传算法应用于量子可逆逻辑电路综合,是一种全新的可逆逻辑电路综合方法,实现了合成、优化同步进行.四阶量子电路实验已取得了很好的效果,并进一步分析了此方法在高阶量子电路综合问题上的应用前景.%Reversible quantum logic synthesis is to study given quantum gates and quantum circuits of the constraints and limitations and find the smallest or smaller quantum cost to achieve the desired quantum logic circuits. The quantum logic gate functions of the matrix is indicated by the mathematical model. The synthesis and optimization are achieved simultaneously by the genetic algorithm as global search tool. Genetic algorithm is applied to quantum reversible logic synthesis. The fourth-order quantum circuit experiment has achieved good results, and further analysis of this method in high-level synthesis of quantum circuits and its application is completed.
From Nondeterministic B\\"uchi and Streett Automata to Deterministic Parity Automata
Piterman, Nir
2007-01-01
In this paper we revisit Safra's determinization constructions. We show how to construct deterministic automata with fewer states and, most importantly, parity acceptance conditions. Specifically, starting from a nondeterministic Buchi automaton with n states our construction yields a deterministic parity automaton with $2 n^n n!$ states and index 2n (instead of a Rabin automaton with $12^n n^{2n}$ states and n pairs). Starting from a nondeterministic Streett automaton with n states and k pairs our construction yields a deterministic parity automaton with $2n^n(k+1)^{n(k+1)}(n(k+1))!$ states and index 2n(k+1) (instead of a Rabin automaton with $12^{n(k+1)} n^n (k+1)^{n(k+1)} (n(k+1))^{n(k+1)}$ states and n(k+1) pairs). The parity condition is much simpler than the Rabin condition. For example, translating the Rabin condition to a parity condition involves a blowup in the number of states of n^2n! and the time complexity of solving Rabin games is that of solving parity games multiplied by $n^2 n!$.
Multi-Robot Motion Planning: A Timed Automata Approach
DEFF Research Database (Denmark)
Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh
2004-01-01
This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar...... against specification requirements formulated in computational tree logic (CTL). In this way, all feasible trajectories that satisfy specifications and which moves the robots from a set of initial positions to a set of desired goal positions may be algorithmically analyzed. The trajectories can...... then subsequently be used as a high-level motion plan for the robots. This paper reports on the timed automata framework, results of two verification experiments, promise of the approach, and gives a perspective for future research....
Multi-Robot Motion Planning: A Timed Automata Approach
DEFF Research Database (Denmark)
Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh
This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar...... against specification requirements formulated in computational tree logic (CTL). In this way, all feasible trajectories that satisfy specifications and which moves the robots from a set of initial positions to a set of desired goal positions may be algorithmically analyzed. The trajectories can...... then subsequently be used as a high-level motion plan for the robots. This paper reports on the timed automata framework, results of two verification experiments, promise of the approach, and gives a perspective for future research....
A cellular automata model with probability infection and spatial dispersion
Institute of Scientific and Technical Information of China (English)
Jin Zhen; Liu Quan-Xing; Mainul Haque
2007-01-01
In this article, we have proposed an epidemic model based on the probability cellular automata theory. The essential mathematical features are analysed with the help of stability theory. We have given an alternative modelling approach for the spatiotemporal system which is more realistic from the practical point of view. A discrete and spatiotemporal approach is shown by using cellular automata theory. It is interesting to note that both the size of the endemic equilibrium and the density of the individuals increase with the increase of the neighbourhood size and infection rate, but the infections decrease with the increase of the recovery rate. The stability of the system around the positive interior equilibrium has been shown by using a suitable Lyapunov function. Finally, experimental data simulation for SARS disease in China in 2003 and a brief discussion are given.
Steganography by using Logistic Map Function and Cellular Automata
Directory of Open Access Journals (Sweden)
Mehdi Alirezanejad
2012-12-01
Full Text Available A tradeoff between the hiding capacity of a cover image and the quality of a stego-image in steganographic schemes is inevitable. In this study a hybrid model of cellular automata and chaotic function is proposed for steganography. In this method, N-bits mask is used for choosing a pixel position in main image which is suitable for hiding one bit of secret data. This mask is generated in each stage by cellular automat and logistic map function. Using cellular automata and logistic map function cause more security and safety in proposed method. Studying the obtained results of the performed experiments, high resistance of the proposed method against brute-force and statistical invasions is obviously illustrated.
Construction of living cellular automata using the Physarum plasmodium
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.
Generalized Cayley Graphs and Cellular Automata over them
Arrighi, Pablo; Nesme, Vincent
2012-01-01
Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their equality; to name all vertices relative to a point; the fact that they have a well-defined notion of translation, and that they can be endowed with a compact metric. We propose a notion of graph associated to a language, which conserves or generalizes these features. Whereas Cayley graphs are regular; associated graphs are arbitrary, although of a bounded degree. Moreover, it is well-known that cellular automata can be characterized as the set of translation-invariant continuous functions for a distance on the set of configurations that makes it a compact metric space; this point of view makes it easy to extend their definition from grids to Cayley graphs. Similarly, we extend their definition to these arbitrary, bounded degree, time-varying graphs. KEYWORDS: Causal Graph Dynamics, Curtis-Hedlund-Lynden, Dynamical networks, Boolean networks, Generative networks automata, Graph Autom...
Station Model for Rail Transit System Using Cellular Automata
Institute of Scientific and Technical Information of China (English)
XUN Jing; NING Bin; LI Ke-Ping
2009-01-01
In this paper, we propose a new cellular automata model to simulate the railway traffic at station.Based on NaSch model, the proposed station model is composed of the main track and the siding track.Two different schemes for trains passing through station are considered.One is the scheme of "pass by the main track, start and stop by the siding track".The other is the scheme of "two tracks play the same role".We simulate the train movement using the proposed model and analyze the traffic flow at station.The simulation results demonstrate that the proposed cellular automata model can be successfully used for the simulations of railway traffic.Some characteristic behaviors of railway traffic flow can be reproduced.Moreover, the simulation values of the minimum headway are close to the theoretical values.This result demonstrates the dependability and availability of the proposed model.
On the secure obfuscation of deterministic finite automata.
Energy Technology Data Exchange (ETDEWEB)
Anderson, William Erik
2008-06-01
In this paper, we show how to construct secure obfuscation for Deterministic Finite Automata, assuming non-uniformly strong one-way functions exist. We revisit the software protection approaches originally proposed by [5, 10, 12, 17] and revise them to the current obfuscation setting of Barak et al. [2]. Under this model, we introduce an efficient oracle that retains some 'small' secret about the original program. Using this secret, we can construct an obfuscator and two-party protocol that securely obfuscates Deterministic Finite Automata against malicious adversaries. The security of this model retains the strong 'virtual black box' property originally proposed in [2] while incorporating the stronger condition of dependent auxiliary inputs in [15]. Additionally, we show that our techniques remain secure under concurrent self-composition with adaptive inputs and that Turing machines are obfuscatable under this model.
Realizing Controllable Quantum States
Takayanagi, Hideaki; Nitta, Junsaku
-T[stmbol] superconducting thin films with special arrangements of antidots / R. Wöerdenweber, P. Dymashevski and V. R. Misko. Quantum tunneling of relativistic fluxons / K. Konno et al. -- 6. Quantum information processing in solid states. Qubit decoherence by low-frequency noise / K. Rabenstein, V. A. Sverdlov and D. V. Averin. A critique of two-level approximation / K. Savran and T. Hakioǧlu. Josephson arrays as quantum channels / A. Romito, C. Bruder and R. Fazio. Fighting decoherence in a Josephson qubit circuit / E. Collin et al. Fast switching current detection at low critical currents / J. Walter, S. Corlevi and D. Haviland. Asymmetric flux bias for coupled qubits to observe entangled states / Y. Shimazu. Interaction of Josephson qubits with strong QED cavity modes: dynamical entanglement transfer and navigation / G. Falci et al. Controlling decoherence of transported quantum spin information in semiconductor spintronics / B. Nikolic and S. Souma. Decoherence due to telegraph and 1/f noise in Josephson qubits / E. Paladino et al. Detection of entanglement in NMR quantum information processing / R. Rahimi, K. Takeda and M. Kitagawa. Multiphoton absorption and SQUID switching current behaviors in superconducting flux-qubit experiments / H. Takayanagi et al. -- 7. Quantum information theory. Quantum query complexities / K. Iwama. A construction for non-stabilizer Clifford codes / M. Hagiwara and H. Imai. Quantum pushdown automata that can deterministically solve a certain problem / Y. Murakami et al. Trading classical for quantum computation using indirection / R. van Meter. Intractability of the initial arrangement of input data on qubits / Y. Kawano et al. Reversibility of modular squaring / N. Kunihiro, Y. Takahashi and Y. Kawano. Study of proximity effect at D-wave superconductors in quasiclassical methods / Y. Tanuma, Y. Tanaka and S. Kashiwaya -- 8. Spintronics in band electrons. Triplet superconductors: exploitable basis for scalable quantum computing / K. S. Wood et al. Spin
An autonomous DNA model for finite state automata.
Martinez-Perez, Israel M; Zimmermann, Karl-Heinz; Ignatova, Zoya
2009-01-01
In this paper we introduce an autonomous DNA model for finite state automata. This model called sticker automaton model is based on the hybridisation of single stranded DNA molecules (stickers) encoding transition rules and input data. The computation is carried out in an autonomous manner by one enzyme which allows us to determine whether a resulting double-stranded DNA molecule belongs to the automaton's language or not.
Bisimulation for Higher-Dimensional Automata. A Geometric Interpretation
DEFF Research Database (Denmark)
Fahrenberg, Ulrich
We show how parallel compostition of higher-dimensional automata (HDA) can be expressed categorically in the spirit of Winskel & Nielsen. Employing the notion of computation path introduced by van Glabbeek, we define a new notion of bisimulation of HDA using open maps. We derive a connection betw...... between computation paths and carrier sequences of dipaths and show that bisimilarity of HDA can be decided by the use of geometric techniques....
Non-Structural Subtype Entailment in Automata Theory
Niehren, Joachim; Priesnitz, Tim
2001-01-01
International audience; Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize the problem equivalently by using regular expressions and word equations. This characterization induces new results on non-structural subtype entailment, constitutes a promising starting point for further investigations on decidability, and explains for the first time why the problem is so d...
Analysis for Embedded Systems: Experiments with Priced Timed Automata
DEFF Research Database (Denmark)
Ovatman, Tolga; Brekling, Aske Wiid; Hansen, Michael Reichhardt
2010-01-01
Analysis of resource consumption of embedded systems is a major challenge in the industry since the number of components that can be included in a single chip keeps getting bigger. In this paper, we consider simple models of embedded systems and the automated analysis about timing and memory access...... priced timed automata and Uppaal Cora as a model checking tool in reasoning about resource consumption of embedded systems....
Using Cellular Automata for Parking Recommendations in Smart Environments
Gwo-Jiun Horng
2014-01-01
In this work, we propose an innovative adaptive recommendation mechanism for smart parking. The cognitive RF module will transmit the vehicle location information and the parking space requirements to the parking congestion computing center (PCCC) when the driver must find a parking space. Moreover, for the parking spaces, we use a cellular automata (CA) model mechanism that can adjust to full and not full parking lot situations. Here, the PCCC can compute the nearest parking lot, the parking...
Weighted automata as coalgebras in categories of matrices
Oliveira, José Nuno Fonseca
2013-01-01
The evolution from non-deterministic to weighted automata represents a shift from qual- itative to quantitative methods in computer science. The trend calls for a language able to reconcile quantitative reasoning with formal logic and set theory, which have for so many years supported qualitative reasoning. Such a lingua franca should be typed, poly- morphic, diagrammatic, calculational and easy to blend with conventional notation. This paper puts forward typed linear algebra as a candidat...
A cellular automata evacuation model considering friction and repulsion
Institute of Scientific and Technical Information of China (English)
SONG Weiguo; YU Yanfei; FAN Weicheng; Zhang Heping
2005-01-01
There exist interactions among pedestrians and between pedestrian and environment in evacuation. These interactions include attraction, repulsion and friction that play key roles in human evacuation behaviors, speed and efficiency. Most former evacuation models focus on the attraction force, while repulsion and friction are not well modeled. As a kind of multi-particle self-driven model, the social force model introduced in recent years can represent those three forces but with low simulation efficiency because it is a continuous model with complex rules. Discrete models such as the cellular automata model and the lattice gas model have simple rules and high simulation efficiency, but are not quite suitable for interactions' simulation. In this paper, a new cellular automata model based on traditional models is introduced in which repulsion and friction are modeled quantitatively. It is indicated that the model can simulate some basic behaviors, e.g.arching and the "faster-is-slower" phenomenon, in evacuation as multi-particle self-driven models, but with high efficiency as the normal cellular automata model and the lattice gas model.
Quantum field theoretic behavior of a deterministic cellular automaton
Hooft, G. 't; Isler, K.; Kalitzin, S.
1992-01-01
A certain class of cellular automata in 1 space + 1 time dimension is shown to be closely related to quantum field theories containing Dirac fermions. In the massless case this relation can be studied analytically, while the introduction of Dirac mass requires numerical simulations. We show that in
Quantum field theoretic behavior of a deterministic cellular automaton
Hooft, G. 't; Isler, K.; Kalitzin, S.
1992-01-01
A certain class of cellular automata in 1 space + 1 time dimension is shown to be closely related to quantum field theories containing Dirac fermions. In the massless case this relation can be studied analytically, while the introduction of Dirac mass requires numerical simulations. We show that in
Observation of Quantum Spin Hall States in InAs/GaSb Bilayers under Broken Time-Reversal Symmetry
Du, Lingjie; Knez, Ivan; Sullivan, Gerard; Du, Rui-Rui
2014-03-01
Topological insulators (TIs) are a novel class of materials with nontrivial surface or edge states. Time-reversal symmetry (TRS) protected TIs are characterized by the Z2 topological invariant. The fate of the Z2 TIs under broken TRS is a fundamental question in understanding the physics of topological matter but remains largely unanswered. Here we show, a two-dimensional TI is realized in an inverted electron-hole bilayer engineered from InAs/GaSb semiconductors which retains robust helical liquid (HL) edge states under a strong magnetic field. Wide conductance plateaus of 2e2/h value are observed; they persist to 10T applied in-plane field before transitioning to a trivial semimetal. In a perpendicular field up to 35T, broken TRS leads to a spatial separation of the movers in Kramers pair and consequently the intra-pair backscattering phase space vanishes, i.e., the conductance increases from 2e2/h in strong fields manifesting chiral edge transport. We propose a phenomenological phases diagram, where inside the topological gap the HL transfers into a ``canned helical state'' driven by perpendicular fields. Our findings suggest that once established, the HL is remarkably resilient and only undergoes adiabatic deformation under TRS breaking. The work at Rice was supported by DOE, NSF, and Welch Foundation.
Asymptotic analysis of Complex Automata models for reaction-diffusion systems
Caiazzo, A.; Falcone, J.-L.; Chopard, B.; Hoekstra, A.G.
2009-01-01
Complex Automata (CxA) have been recently introduced as a paradigm to simulate multiscale multiscience systems as a collection of generalized Cellular Automata on different scales. The approach yields numerical and computational challenges and can become a powerful tool for the simulation of
An Evolution Strategy for the Induction of Fuzzy Finite-State Automata
Institute of Scientific and Technical Information of China (English)
WAN Min; MO Zhi-wen
2005-01-01
This paper presents an evolution strategy to induce fuzzy finite-state automata from examples of fuzzy languages .The coding, fitness function of a generated automaton and corresponding mutation operators are given respectively. The application example given at last shows the effectiveness of the proposed evolution strategy for automata induction.
Team automata : a formal approach to the modeling of collaboration between system components
Beek, Maurice Henri ter
2003-01-01
This thesis studies formal aspects of team automata, a mathematical framework introduced in 1997 by C.A. Ellis to model components of groupware systems and their interconnections. We focus on the flexibility that team automata offer when modeling collaboration between system components
Learning and Model-checking Networks of I/O Automata
DEFF Research Database (Denmark)
Mao, Hua; Jaeger, Manfred
2012-01-01
We introduce a new statistical relational learning (SRL) approach in which models for structured data, especially network data, are constructed as networks of communicating nite probabilistic automata. Leveraging existing automata learning methods from the area of grammatical inference, we can le...
Wickramasuriya, R.C.; Bregt, A.K.; Delden, van H.; Hagen-Zanker, A.
2009-01-01
This paper presents an extension to the Constrained Cellular Automata (CCA) land use model of White et al. [White, R., Engelen, G., Uljee, I., 1997. The use of constrained cellular automata for high-resolution modelling of urban land-use dynamics. Environment and Planning B: Planning and Design
Emergence of linguistic-like structures in one-dimensional cellular automata
Bertacchini, Francesca; Bilotta, Eleonora; Caldarola, Fabio; Pantano, Pietro; Bustamante, Leonardo Renteria
2016-10-01
In this paper we give a summary of some empirical investigations which show high analogies between Cellular Automata and linguistic structures. In particular we show as coupling regular domains of Cellular Automata we find complex emerging structures similar to combination of words, phonemes and morphemes in natural languages.
Di Vincenzo, D P
1997-01-01
A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates. I highlight the quantum XOR or controlled NOT as the fundamental two-bit gate for quantum computation. This gate plays a central role in networks for quantum error correction.
Tree automata-based refinement with application to Horn clause verification
DEFF Research Database (Denmark)
Kafle, Bishoksan; Gallagher, John Patrick
2015-01-01
underlying the Horn clauses. Experiments using linear constraint problems and the abstract domain of convex polyhedra show that the refinement technique is practical and that iteration of abstract interpretation with tree automata-based refinement solves many challenging Horn clause verification problems. We......In this paper we apply tree-automata techniques to refinement of abstract interpretation in Horn clause verification. We go beyond previous work on refining trace abstractions; firstly we handle tree automata rather than string automata and thereby can capture traces in any Horn clause derivations...... rather than just transition systems; secondly, we show how algorithms manipulating tree automata interact with abstract interpretations, establishing progress in refinement and generating refined clauses that eliminate causes of imprecision. We show how to derive a refined set of Horn clauses in which...
Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
DEFF Research Database (Denmark)
Kafle, Bishoksan; Gallagher, John Patrick
2017-01-01
underlying the Horn clauses. Experiments using linear constraint problems and the abstract domain of convex polyhedra show that the refinement technique is practical and that iteration of abstract interpretation with tree automata-based refinement solves many challenging Horn clause verification problems. We......In this paper we apply tree-automata techniques to refinement of abstract interpretation in Horn clause verification. We go beyond previous work on refining trace abstractions; firstly we handle tree automata rather than string automata and thereby can capture traces in any Horn clause derivations...... rather than just transition systems; secondly, we show how algorithms manipulating tree automata interact with abstract interpretations, establishing progress in refinement and generating refined clauses that eliminate causes of imprecision. We show how to derive a refined set of Horn clauses in which...
Design of Reversible Sequential Circuit Using Reversible Logic Synthesis
Directory of Open Access Journals (Sweden)
Md. Belayet Ali
2011-12-01
Full Text Available Reversible logic is one of the most vital issue at present time and it has different areas for its application,those are low power CMOS, quantum computing, nanotechnology, cryptography, optical computing, DNA computing, digital signal processing (DSP, quantum dot cellular auto meta, communication, computer graphics. It is not possible to realize quantum computing without implementation of reversible logic. The main purposes of designing reversible logic are to decrease quantum cost, depth of the circuits and the number of garbage outputs. In this paper, we have proposed a new reversible gate. And we have designed RS flip flop and D flip flop by using our proposed gate and Peres gate. The proposed designs are better than the existing proposed ones in terms of number of reversible gates and garbage outputs. So, this realization is more efficient and less costly than other realizations.
A quantum relativistic battle of the sexes cellular automaton
Alonso-Sanz, Ramón; Situ, Haozhen
2017-02-01
The effect of variable entangling on the dynamics of a spatial quantum relativistic formulation of the iterated battle of the sexes game is studied in this work. The game is played in the cellular automata manner, i.e., with local and synchronous interaction. The game is assessed in fair and unfair contests. Despite the full range of quantum parameters initially accessible, they promptly converge into fairly stable configurations, that often show rich spatial structures in simulations with no negligible entanglement.
Variable entangling in a quantum prisoner's dilemma cellular automaton
Alonso-Sanz, Ramón
2015-01-01
The effect of variable entangling on the dynamics of a spatial quantum formulation of the iterated prisoner's dilemma game is studied in this work. The game is played in the cellular automata manner, i.e., with local and synchronous interaction. The effect of spatial structure is assessed when allowing the players to adopt quantum and classical strategies, both in the two- and three-parameter strategy spaces.
Formal languages, automata and numeration systems, v.2
Rigo, Michel
2014-01-01
The interplay between words, computability, algebra and arithmetic has now proved its relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite automata (such as that initiated by J.R. Büchi) or between combinatorics on words and number theory has paved the way to recent dramatic developments, for example, the transcendence results for the real numbers having a "simple" binary expansion, by B. Adamczewski and Y. Bugeaud. This book is at the heart of this interplay through a unified exposition. Objects are considered with a perspective that comes both from t
Lattice gas automata for flow and transport in geochemical systems
Energy Technology Data Exchange (ETDEWEB)
Janecky, D.R.; Chen, S.; Dawson, S.; Eggert, K.C.; Travis, B.J.
1992-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.
Microbial Growth Modeling and Simulation Based on Cellular Automata
Directory of Open Access Journals (Sweden)
Hong Men
2013-07-01
Full Text Available In order to simulate the micro-evolutionary process of the microbial growth, [Methods] in this study, we adopt two-dimensional cellular automata as its growth space. Based on evolutionary mechanism of microbial and cell-cell interactions, we adopt Moore neighborhood and make the transition rules. Finally, we construct the microbial growth model. [Results] It can describe the relationships among the cell growth, division and death. And also can effectively reflect spatial inhibition effect and substrate limitation effect. [Conclusions] The simulation results show that CA model is not only consistent with the classic microbial kinetic model, but also be able to simulate the microbial growth and evolution.
Cellular Automata with network incubation in information technology diffusion
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.
Chaotic Encryption Method Based on Life-Like Cellular Automata
Machicao, Marina Jeaneth; Bruno, Odemir M
2011-01-01
We propose a chaotic encryption method based on Cellular Automata(CA), specifically on the family called the "Life-Like" type. Thus, the encryption process lying on the pseudo-random numbers generated (PRNG) by each CA's evolution, which transforms the password as the initial conditions to encrypt messages. Moreover, is explored the dynamical behavior of CA to reach a "good" quality as PRNG based on measures to quantify "how chaotic a dynamical system is", through the combination of the entropy, Lyapunov exponent, and Hamming distance. Finally, we present the detailed security analysis based on experimental tests: DIEHARD and ENT suites, as well as Fouriers Power Spectrum, used as a security criteria.
The Complexity of Finding Reset Words in Finite Automata
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.
Lattice gas automata for flow and transport in geochemical systems
Energy Technology Data Exchange (ETDEWEB)
Janecky, D.R.; Chen, S.; Dawson, S.; Eggert, K.C.; Travis, B.J.
1992-01-01
Lattice gas automata models are described, which couple solute transport with chemical reactions at mineral surfaces within pore networks. Diffusion in a box calculations are illustrated, which compare directly with Fickian diffusion. Chemical reactions at solid surfaces, including precipitation/dissolution, sorption, and catalytic reaction, can be examined with the model because hydrodynamic transport, solute diffusion and mineral surface processes are all treated explicitly. The simplicity and flexibility of the approach provides the ability to study the interrelationship between fluid flow and chemical reactions in porous materials, at a level of complexity that has not previously been computationally possible.
Accelerating cellular automata simulations using AVX and CUDA
Szkoda, Sebastian; Tykierko, Mateusz
2012-01-01
We investigated various methods of parallelization of the Frish-Hasslacher-Pomeau (FHP) cellular automata algorithm for modeling fluid flow. These methods include SSE, AVX, and POSIX Threads for central processing units (CPUs) and CUDA for graphics processing units (GPUs). We present implementation details of the FHP algorithm based on AVX/SSE and CUDA technologies. We found that (a) using AVX or SSE is necessary to fully utilize the potential of modern CPUs; (b) CPUs and GPUs are comparable in terms of computational and economic efficiency only if the CPU code uses AVX or SSE instructions; (c) AVX does not offer any substantial improvement relative to SSE.
Negative circuits and sustained oscillations in asynchronous automata networks
Richard, Adrien
2009-01-01
The biologist Ren\\'e Thomas conjectured, twenty years ago, that the presence of a negative feedback circuit in the interaction graph of a dynamical system is a necessary condition for this system to produce sustained oscillations. In this paper, we state and prove this conjecture for asynchronous automata networks, a class of discrete dynamical systems extensively used to model the behaviors of gene networks. As a corollary, we obtain the following fixed point theorem: given a product $X$ of $n$ finite intervals of integers, and a map $F$ from $X$ to itself, if the interaction graph associated with $F$ has no negative circuit, then $F$ has at least one fixed point.
Motion Planning in Multi-robot Systems using Timed Automata
DEFF Research Database (Denmark)
Andersen, Michael. S.; Jensen, Rune S.; Bak, Thomas;
kinematics, is captured in an automata formalism that allows formal composition and symbolic reasoning. The verification software UppAal is used to verify specification requirements formulated in computational tree logic (CTL), generating all feasible trajectories that satisfy specifications. The results...... of the planning are demonstrateted in a testbed that allows execution of the planned paths and motion primitives by synchronizing the planning results from UppAal with actual robotic vehicles. The planning problem may be modified online by moving obstacles in the physical environment, which causes a re...
Modelling discrete longitudinal data using acyclic probabilistic finite automata
DEFF Research Database (Denmark)
Anantharama Ankinakatte, Smitha; Edwards, David
2015-01-01
Acyclic probabilistic finite automata (APFA) constitute a rich family of models for discrete longitudinal data. An APFA may be represented as a directed multigraph, and embodies a set of context-specific conditional independence relations that may be read off the graph. A model selection algorithm...... to minimize a penalized likelihood criterion such as AIC or BIC is described. This algorithm is compared to one implemented in Beagle, a widely used program for processing genomic data, both in terms of rate of convergence to the true model as the sample size increases, and a goodness-of-fit measure assessed...
Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo
Sakakibara, Yasubumi
We overview a series of our research on implementing finite automata in vitro and in vivo in the framework of DNA-based computing [1,2]. First, we employ the length-encoding technique proposed and presented in [3,4] to implement finite automata in test tube. In the length-encoding method, the states and state transition functions of a target finite automaton are effectively encoded into DNA sequences, a computation (accepting) process of finite automata is accomplished by self-assembly of encoded complementary DNA strands, and the acceptance of an input string is determined by the detection of a completely hybridized double-strand DNA. Second, we report our intensive in vitro experiments in which we have implemented and executed several finite-state automata in test tube. We have designed and developed practical laboratory protocols which combine several in vitro operations such as annealing, ligation, PCR, and streptavidin-biotin bonding to execute in vitro finite automata based on the length-encoding technique. We have carried laboratory experiments on various finite automata with 2 up to 6 states for several input strings. Third, we present a novel framework to develop a programmable and autonomous in vivo computer using Escherichia coli (E. coli), and implement in vivo finite-state automata based on the framework by employing the protein-synthesis mechanism of E. coli. We show some successful experiments to run an in vivo finite-state automaton on E. coli.
Gaur, Girija; Koktysh, Dmitry S; Fleetwood, Daniel M; Weller, Robert A; Reed, Robert A; Rogers, Bridget R; Weiss, Sharon M
2016-03-01
We investigate the influence of high energy photons and thiol ligands on the photophysical properties of sub-monolayer CdTe/CdS quantum dots (QDs) immobilized in porous silica (PSiO2) scaffolds. The highly disperse, uniform distributions of QDs in a three-dimensional PSiO2 framework ensure uniform interaction of not only radiation but also subsequent surface repassivation solutions to all immobilized QDs. The high optical densities of QDs achieved using PSiO2 enable straightforward monitoring of the QD photoluminescence intensities and carrier lifetimes. Irradiation of QDs in PSiO2 by high energy photons, X-rays, and γ-rays leads to dose-dependent QD photodarkening, which is accompanied by accelerated photooxidative effects in ambient environments that give rise to blue-shifts in the peak QD emission wavelength. Irradiation in an oxygen-free environment also leads to QD photodarkening but with no accompanying blue-shift of the QD emission. Significant reversal of QD photodarkening is demonstrated following QD surface repassivation with a solution containing free-thiols, suggesting reformation of a CdS shell, etching of surface oxidized species, and possible reduction of photoionized dark QDs to a neutral, bright state. Permanent lattice displacement damage effects may contribute toward some irreversible γ radiation damage. This work contributes to an improved understanding of the influence of surface ligands on the optical properties of QDs and opens up the possibilities of engineering large area, low-cost, reuseable, and flexible QD-based optical radiation sensors.
Modeling evolution and immune system by cellular automata
Energy Technology Data Exchange (ETDEWEB)
Bezzi, M. [Scuola Internazionale Superiore di Studi Avanzati, Trieste (Italy); Istituto Nazionale di Fisica della Materia, Florence (Italy)
2001-07-01
In this review the behavior of two different biological systems is investigated using cellular automata. Starting from this spatially extended approach it is also tried, in some cases, to reduce the complexity of the system introducing mean-field approximation, and solving (or trying to solve) these simplified systems. It is discussed the biological meaning of the results, the comparison with experimental data (if available) and the different features between spatially extended and mean-field versions. The biological systems considered in this review are the following: Darwinian evolution in simple ecosystems and immune system response. In the first section the main features of molecular evolution are introduced, giving a short survey of genetics for physicists and discussing some models for prebiotic systems and simple ecosystems. It is also introduced a cellular automaton model for studying a set of evolving individuals in a general fitness landscape, considering also the effects of co-evolution. In particular the process of species formation (speciation) is described in sect. 5. The second part deals with immune system modeling. The biological features of immune response are discussed, as well as it is introduced the concept of shape space and of idiotypic network. More detailed reviews which deal with immune system models (mainly focused on idiotypic network models) can be found. Other themes here discussed: the applications of CA to immune system modeling, two complex cellular automata for humoral and cellular immune response. Finally, it is discussed the biological data and the general conclusions are drawn in the last section.
Simulation of root forms using cellular automata model
Energy Technology Data Exchange (ETDEWEB)
Winarno, Nanang, E-mail: nanang-winarno@upi.edu; Prima, Eka Cahya [International Program on Science Education, Universitas Pendidikan Indonesia, Jl. Dr. Setiabudi no 229, Bandung40154 (Indonesia); Afifah, Ratih Mega Ayu [Department of Physics Education, Post Graduate School, Universitas Pendidikan Indonesia, Jl. Dr. Setiabudi no 229, Bandung40154 (Indonesia)
2016-02-08
This research aims to produce a simulation program for root forms using cellular automata model. Stephen Wolfram in his book entitled “A New Kind of Science” discusses the formation rules based on the statistical analysis. In accordance with Stephen Wolfram’s investigation, the research will develop a basic idea of computer program using Delphi 7 programming language. To best of our knowledge, there is no previous research developing a simulation describing root forms using the cellular automata model compared to the natural root form with the presence of stone addition as the disturbance. The result shows that (1) the simulation used four rules comparing results of the program towards the natural photographs and each rule had shown different root forms; (2) the stone disturbances prevent the root growth and the multiplication of root forms had been successfully modeled. Therefore, this research had added some stones, which have size of 120 cells placed randomly in the soil. Like in nature, stones cannot be penetrated by plant roots. The result showed that it is very likely to further develop the program of simulating root forms by 50 variations.
Modeling self-organizing traffic lights with elementary cellular automata
Gershenson, Carlos
2009-01-01
There have been several highway traffic models proposed based on cellular automata. The simplest one is elementary cellular automaton rule 184. We extend this model to city traffic with cellular automata coupled at intersections using only rules 184, 252, and 136. The simplicity of the model offers a clear understanding of the main properties of city traffic and its phase transitions. We use the proposed model to compare two methods for coordinating traffic lights: a green-wave method that tries to optimize phases according to expected flows and a self-organizing method that adapts to the current traffic conditions. The self-organizing method delivers considerable improvements over the green-wave method. For low densities, the self-organizing method promotes the formation and coordination of platoons that flow freely in four directions, i.e. with a maximum velocity and no stops. For medium densities, the method allows a constant usage of the intersections, exploiting their maximum flux capacity. For high dens...
Interpolant tree automata and their application in Horn clause verification
DEFF Research Database (Denmark)
Kafle, Bishoksan; Gallagher, John Patrick
2016-01-01
This paper investigates the combination of abstract interpretation over the domain of convex polyhedra with interpolant tree automata, in an abstraction-refinement scheme for Horn clause verification. These techniques have been previously applied separately, but are combined in a new way in this ...... clause verification problems indicates that the combination of interpolant tree automaton with abstract interpretation gives some increase in the power of the verification tool, while sometimes incurring a performance overhead.......This paper investigates the combination of abstract interpretation over the domain of convex polyhedra with interpolant tree automata, in an abstraction-refinement scheme for Horn clause verification. These techniques have been previously applied separately, but are combined in a new way...... in this paper. The role of an interpolant tree automaton is to provide a generalisation of a spurious counterexample during refinement, capturing a possibly infinite set of spurious counterexample traces. In our approach these traces are then eliminated using a transformation of the Horn clauses. We compare...
Dirac Cellular Automaton from Split-step Quantum Walk.
Mallick, Arindam; Chandrashekar, C M
2016-05-17
Simulations of one quantum system by an other has an implication in realization of quantum machine that can imitate any quantum system and solve problems that are not accessible to classical computers. One of the approach to engineer quantum simulations is to discretize the space-time degree of freedom in quantum dynamics and define the quantum cellular automata (QCA), a local unitary update rule on a lattice. Different models of QCA are constructed using set of conditions which are not unique and are not always in implementable configuration on any other system. Dirac Cellular Automata (DCA) is one such model constructed for Dirac Hamiltonian (DH) in free quantum field theory. Here, starting from a split-step discrete-time quantum walk (QW) which is uniquely defined for experimental implementation, we recover the DCA along with all the fine oscillations in position space and bridge the missing connection between DH-DCA-QW. We will present the contribution of the parameters resulting in the fine oscillations on the Zitterbewegung frequency and entanglement. The tuneability of the evolution parameters demonstrated in experimental implementation of QW will establish it as an efficient tool to design quantum simulator and approach quantum field theory from principles of quantum information theory.
Dirac Cellular Automaton from Split-step Quantum Walk
Mallick, Arindam; Chandrashekar, C. M.
2016-05-01
Simulations of one quantum system by an other has an implication in realization of quantum machine that can imitate any quantum system and solve problems that are not accessible to classical computers. One of the approach to engineer quantum simulations is to discretize the space-time degree of freedom in quantum dynamics and define the quantum cellular automata (QCA), a local unitary update rule on a lattice. Different models of QCA are constructed using set of conditions which are not unique and are not always in implementable configuration on any other system. Dirac Cellular Automata (DCA) is one such model constructed for Dirac Hamiltonian (DH) in free quantum field theory. Here, starting from a split-step discrete-time quantum walk (QW) which is uniquely defined for experimental implementation, we recover the DCA along with all the fine oscillations in position space and bridge the missing connection between DH-DCA-QW. We will present the contribution of the parameters resulting in the fine oscillations on the Zitterbewegung frequency and entanglement. The tuneability of the evolution parameters demonstrated in experimental implementation of QW will establish it as an efficient tool to design quantum simulator and approach quantum field theory from principles of quantum information theory.
Institute of Scientific and Technical Information of China (English)
戴宗铎; 叶顶峰
1996-01-01
Let 3V denote the set of all possible transfer function matrices of weakly invertible linear finite automata over a given finite field F. A classification and an enumeration on the infinite set are given.
Genetic Algorithm Calibration of Probabilistic Cellular Automata for Modeling Mining Permit Activity
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.
Control difuso para un sistema de nivel implementado en un automata programmable
National Research Council Canada - National Science Library
Gutierrez Marroquin, William; Lopez Sotelo, Jesus Alfonso
2011-01-01
.... Se presenta la implementacion de un control difuso en un automata programable, definiendo rutinas especificas para la realizacion de la maquina de inferencia, lo cual representa economia de recursos...
Learning and Model-checking Networks of I/O Automata
DEFF Research Database (Denmark)
Mao, Hua; Jaeger, Manfred
2012-01-01
learn generic models for network entities in the form of automata templates. As is characteristic for SRL techniques, the abstraction level aorded by learning generic templates enables one to apply the learned model to new domains. A main benet of learning models based on nite automata lies in the fact......We introduce a new statistical relational learning (SRL) approach in which models for structured data, especially network data, are constructed as networks of communicating nite probabilistic automata. Leveraging existing automata learning methods from the area of grammatical inference, we can...... that one can analyse the resulting models using formal model-checking techniques, which adds a dimension of model analysis not usually available for traditional SRL modeling frameworks....
Quantum mechanical Carnot engine
Bender, C M; Meister, B K
2000-01-01
A cyclic thermodynamic heat engine runs most efficiently if it is reversible. Carnot constructed such a reversible heat engine by combining adiabatic and isothermal processes for a system containing an ideal gas. Here, we present an example of a cyclic engine based on a single quantum-mechanical particle confined to a potential well. The efficiency of this engine is shown to equal the Carnot efficiency because quantum dynamics is reversible. The quantum heat engine has a cycle consisting of adiabatic and isothermal quantum processes that are close analogues of the corresponding classical processes.
Simple Cellular Automata-Based Linear Models for the Shrinking Generator
Fúster-Sabater, Amparo
2010-01-01
Structural properties of two well-known families of keystream generators, Shrinking Generators and Cellular Automata, have been analyzed. Emphasis is on the equivalence of the binary sequences obtained from both kinds of generators. In fact, Shrinking Generators (SG) can be identified with a subset of linear Cellular Automata (mainly rule 90, rule 150 or a hybrid combination of both rules). The linearity of these cellular models can be advantageously used in the cryptanalysis of those keystream generators.
Spectral Analysis of Transition Operators, Automata Groups and Translation in BBS
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.
Behavioral Modeling Based on Probabilistic Finite Automata: An Empirical Study.
Tîrnăucă, Cristina; Montaña, José L; Ontañón, Santiago; González, Avelino J; Pardo, Luis M
2016-06-24
Imagine an agent that performs tasks according to different strategies. The goal of Behavioral Recognition (BR) is to identify which of the available strategies is the one being used by the agent, by simply observing the agent's actions and the environmental conditions during a certain period of time. The goal of Behavioral Cloning (BC) is more ambitious. In this last case, the learner must be able to build a model of the behavior of the agent. In both settings, the only assumption is that the learner has access to a training set that contains instances of observed behavioral traces for each available strategy. This paper studies a machine learning approach based on Probabilistic Finite Automata (PFAs), capable of achieving both the recognition and cloning tasks. We evaluate the performance of PFAs in the context of a simulated learning environment (in this case, a virtual Roomba vacuum cleaner robot), and compare it with a collection of other machine learning approaches.
Modeling and simulation for train control system using cellular automata
Institute of Scientific and Technical Information of China (English)
LI; KePing; GAO; ZiYou; YANG; LiXing
2007-01-01
Train control system plays a key role in railway traffic. Its function is to manage and control the train movement on railway networks. In our previous works, based on the cellular automata (CA) model, we proposed several models and algorithms for simulating the train movement under different control system conditions. However, these models are only suitable for some simple traffic conditions. Some basic factors, which are important for train movement, are not considered. In this paper, we extend these models and algorithms and give a unified formula. Using the proposed method, we analyze and discuss the space-time diagram of railway traffic flow and the trajectories of the train movement. The numerical simulation and analytical results demonstrate that the unified CA model is an effective tool for simulating the train control system.
Verification of Continuous Dynamical Systems by Timed Automata
DEFF Research Database (Denmark)
Sloth, Christoffer; Wisniewski, Rafael
2011-01-01
This paper presents a method for abstracting continuous dynamical systems by timed automata. The abstraction is based on partitioning the state space of a dynamical system using positive invariant sets, which form cells that represent locations of a timed automaton. The abstraction is intended...... to enable formal verification of temporal properties of dynamical systems without simulating any system trajectory, which is currently not possible. Therefore, conditions for obtaining sound, complete, and refinable abstractions are set up. The novelty of the method is the partitioning of the state space...... of the verification process. The proposed abstraction is applied to two examples, which illustrate how sound and complete abstractions are generated and the type of specification we can check. Finally, an example shows how the compositionality of the abstraction can be used to analyze a high-dimensional system....
Modelling Nonlinear Sequence Generators in terms of Linear Cellular Automata
Fúster-Sabater, Amparo; 10.1016/j.apm.2005.08.013
2010-01-01
In this work, a wide family of LFSR-based sequence generators, the so-called Clock-Controlled Shrinking Generators (CCSGs), has been analyzed and identified with a subset of linear Cellular Automata (CA). In fact, a pair of linear models describing the behavior of the CCSGs can be derived. The algorithm that converts a given CCSG into a CA-based linear model is very simple and can be applied to CCSGs in a range of practical interest. The linearity of these cellular models can be advantageously used in two different ways: (a) for the analysis and/or cryptanalysis of the CCSGs and (b) for the reconstruction of the output sequence obtained from this kind of generators.
Directional Dynamics along Arbitrary Curves in Cellular Automata
Delacourt, Martin; Sablik, Mathieu; Theyssier, Guillaume
2010-01-01
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule (temporal action) and the shift map (spacial action): qualitative behaviours inherited from topological dynamics (equicontinuity, sensitivity, expansivity) are thus considered along arbitrary curves in space-time. The main contributions of the paper concern equicontinuous dynamics which can be connected to the notion of consequences of a word. We show that there is a cellular automaton with an equicontinuous dynamics along a parabola, but which is sensitive along any linear direction. We also show that real numbers that occur as the slope of a limit linear direction with equicontinuous dynamics in some cellular automaton are exactly the computably enumerable numbers.
Cellular automata simulation of medication-induced autoimmune diseases
Stauffer, Dietrich; Proykova, Ana
2004-01-01
We implement the cellular automata model proposed by Stauffer and Weisbuch in 1992 to describe the response of the immune system to antigens in the presence of medications. The model contains two thresholds, θ1 and θ2, suggested by de Boer, Segel, and Perelson to present the minimum field needed to stimulate the proliferation of the receptors and to suppress it, respectively. The influence of the drug is mimicked by increasing the second threshold, thus enhancing the immune response. If this increase is too strong, the immune response is triggered in the whole immune repertoire, causing it to attack the own body. This effect is seen in our simulations to depend both on the ratio of the thresholds and on their absolute values.
Algorithmic Approach to Abstracting Linear Systems by Timed Automata
DEFF Research Database (Denmark)
Sloth, Christoffer; Wisniewski, Rafael
2011-01-01
This paper proposes an LMI-based algorithm for abstracting dynamical systems by timed automata, which enables automatic formal verification of linear systems. The proposed abstraction is based on partitioning the state space of the system using positive invariant sets, generated by Lyapunov...... functions. This partitioning ensures that the vector field of the dynamical system is transversal to all facets of the cells, which induces some desirable properties of the abstraction. The algorithm is based on identifying intersections of level sets of quadratic Lyapunov functions, and determining...... the minimum and maximum time that a trajectory of the system can stay in a set, defined as the set-difference of sub-level sets of Lyapunov functions. The proposed algorithm applies for linear systems and can therefore be efficiently implemented using LMI-based tools....
Selfing dynamics in the rule space of additive cellular automata
Voorhees, Burton
2012-08-01
A unique aspect of additive cellular automata (CA) rules is that the state space on which these rules operate is also the representation space for the rules. Thus, a rule can operate on itself to produce a new rule that is not just its square. This operation will be called selfing, in analogy to reproduction by selfing in Mendelian genetics. This paper explains the properties of the selfing operation on one-dimensional binary-valued additive CA. Results characterizing the selfing transition diagram are derived and some suggestions as to possible applications are presented. The most transparent expression of results is given by representing both rules and states in terms of roots of unity, and this formalism is briefly developed in the initial section.
Critical Behavior in a Cellular Automata Animal Disease Transmission Model
Morley, P D; Chang, Julius
2003-01-01
Using a cellular automata model, we simulate the British Government Policy (BGP) in the 2001 foot and mouth epidemic in Great Britain. When clinical symptoms of the disease appeared on a farm, there is mandatory slaughter (culling) of all livestock on an infected premise (IP). Those farms that neighbor an IP (contiguous premise, CP), are also culled, aka nearest neighbor interaction. Farms where the disease may be prevalent from animal, human, vehicle or airborne transmission (dangerous contact, DC), are additionally culled, aka next-to-nearest neighbor iteractions and lightning factor. The resulting mathematical model possesses a phase transition, whereupon if the physical disease transmission kernel exceeds a critical value, catastrophic loss of animals ensues. The non-local disease transport probability can be as low as .01% per day and the disease can still be in the high mortality phase. We show that the fundamental equation for sustainable disease transport is the criticality equation for neutron fissio...
Verifying Automata Specification of Distributed Probabilistic Real—Time Systems
Institute of Scientific and Technical Information of China (English)
罗铁庚; 陈火旺; 等
1998-01-01
In this paper,a qualitative model checking algorithm for verification of distributed probabilistic real-time systems(DPRS)is presented.The model of DPRS,called real-time proba bilistic process model(RPPM),is over continuous time domain.The properties of DPRS are described by using deterministic timed automata(DTA).The key part in the algorithm is to map continuous time to finite time intervals with flag variables.Compared with the existing algorithms,this algorithm uses more general delay time equivalence classes instead of the unit delay time equivalence classes restricted by event sequence,and avoids generating the equivalence classes of states only due to the passage of time.The result shows that this algorithm is cheaper.
Towards Time Automata and Multi-Agent Systems
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.
Robustness of a Cellular Automata Model for the HIV Infection
Figueirêdo, P H; Santos, R M Zorzenon dos
2008-01-01
An investigation was conducted to study the robustness of the results obtained from the cellular automata model which describes the spread of the HIV infection within lymphoid tissues [R. M. Zorzenon dos Santos and S. Coutinho, Phys. Rev. Lett. 87, 168102 (2001)]. The analysis focussed on the dynamic behavior of the model when defined in lattices with different symmetries and dimensionalities. The results illustrated that the three-phase dynamics of the planar models suffered minor changes in relation to lattice symmetry variations and, while differences were observed regarding dimensionality changes, qualitative behavior was preserved. A further investigation was conducted into primary infection and sensitiveness of the latency period to variations of the model's stochastic parameters over wide ranging values. The variables characterizing primary infection and the latency period exhibited power-law behavior when the stochastic parameters varied over a few orders of magnitude. The power-law exponents were app...
Occupant evacuation model based on cellular automata in fire
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
By applying the rules set in traffic flow and pedestrian flow models, a basic cellular automata model is presented to simulate occupant evacuation in fire. Some extended models are introduced to study the special phenomena of evacuation from the fire room. The key of the models is the introduction of the danger grade which makes the route choice convenient and reasonable. Fire not only influences the emotional and behavioral characteristics of an individual but also affects his physical constitution, which reduces his maximal possible velocity. The models consider these influence factors by applying a set of simple but effective rules. It is needed to emphasize that all rules are established according to the essential phenomenon in fire evacuation, that is, all the occupants would try to move to the safest place as fast as possible. Some simulation examples are also presented to validate the applicability of the models.
Computer Models and Automata Theory in Biology and Medicine
Baianu, I C
2004-01-01
The applications of computers to biological and biomedical problem solving goes back to the very beginnings of computer science, automata theory [1], and mathematical biology [2]. With the advent of more versatile and powerful computers, biological and biomedical applications of computers have proliferated so rapidly that it would be virtually impossible to compile a comprehensive review of all developments in this field. Limitations of computer simulations in biology have also come under close scrutiny, and claims have been made that biological systems have limited information processing power [3]. Such general conjectures do not, however, deter biologists and biomedical researchers from developing new computer applications in biology and medicine. Microprocessors are being widely employed in biological laboratories both for automatic data acquisition/processing and modeling; one particular area, which is of great biomedical interest, involves fast digital image processing and is already established for rout...
Encoding nondeterministic fuzzy tree automata into recursive neural networks.
Gori, Marco; Petrosino, Alfredo
2004-11-01
Fuzzy neural systems have been a subject of great interest in the last few years, due to their abilities to facilitate the exchange of information between symbolic and subsymbolic domains. However, the models in the literature are not able to deal with structured organization of information, that is typically required by symbolic processing. In many application domains, the patterns are not only structured, but a fuzziness degree is attached to each subsymbolic pattern primitive. The purpose of this paper is to show how recursive neural networks, properly conceived for dealing with structured information, can represent nondeterministic fuzzy frontier-to-root tree automata. Whereas available prior knowledge expressed in terms of fuzzy state transition rules are injected into a recursive network, unknown rules are supposed to be filled in by data-driven learning. We also prove the stability of the encoding algorithm, extending previous results on the injection of fuzzy finite-state dynamics in high-order recurrent networks.
LAHS: A novel harmony search algorithm based on learning automata
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.
Lattice Automata for Control of Self-Reconfigurable Robots
DEFF Research Database (Denmark)
Støy, Kasper
2015-01-01
Self-reconfigurable robots are built from robotic modules typically organised in a lattice. The robotic modules themselves are complete, although simple, robots and have onboard batteries, actuators, sensors, processing power, and communication capabilities. The modules can automatically connect...... to and disconnect from neighbour modules and move around in the lattice of modules. The self-reconfigurable robot as a whole can, through this automatic rearrangement of modules, change its own shape to adapt to the environment or as a response to new tasks. Potential advantages of self-reconfigurable robots...... are extreme versatility and robustness. The organisation of self-reconfigurable robots in a lattice structure and the emphasis on local communication between modules mean that lattice automata are a useful basis for control of self-reconfigurable robots. However, there are significant differences which arise...
Integration of Neural Networks and Cellular Automata for Urban Planning
Institute of Scientific and Technical Information of China (English)
Anthony Gar-on Yeh; LI Xia
2004-01-01
This paper presents a new type of cellular automata (CA) model for the simulation of alternative land development using neural networks for urban planning. CA models can be regarded as a planning tool because they can generate alternative urban growth. Alternative development patterns can be formed by using different sets of parameter values in CA simulation. A critical issue is how to define parameter values for realistic and idealized simulation. This paper demonstrates that neural networks can simplify CA models but generate more plausible results. The simulation is based on a simple three-layer network with an output neuron to generate conversion probability. No transition rules are required for the simulation. Parameter values are automatically obtained from the training of network by using satellite remote sensing data. Original training data can be assessed and modified according to planning objectives. Alternative urban patterns can be easily formulated by using the modified training data sets rather than changing the model.
The Toothpick Sequence and Other Sequences from Cellular Automata
Applegate, David; Sloane, N J A
2010-01-01
A two-dimensional arrangement of toothpicks is constructed by the following iterative procedure. At stage 1, place a single toothpick of length 1 on a square grid, aligned with the y-axis. At each subsequent stage, for every exposed toothpick end, place an orthogonal toothpick centered at that end. The resulting structure has a fractal-like appearance. We will analyze the toothpick sequence, which gives the total number of toothpicks after n steps. We also study several related sequences that arise from enumerating active cells in cellular automata. Some unusual recurrences appear: a typical example is that instead of the Fibonacci recurrence, which we may write as a(2+i) = a(i) + a(i+1), we set n = 2^k+i (0 = 0} (1+x^{2^k-1}+2x^{2^k}) and variations thereof.
Mosquito population dynamics from cellular automata-based simulation
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.
Evolution of cellular automata with memory: The Density Classification Task.
Stone, Christopher; Bull, Larry
2009-08-01
The Density Classification Task is a well known test problem for two-state discrete dynamical systems. For many years researchers have used a variety of evolutionary computation approaches to evolve solutions to this problem. In this paper, we investigate the evolvability of solutions when the underlying Cellular Automaton is augmented with a type of memory based on the Least Mean Square algorithm. To obtain high performance solutions using a simple non-hybrid genetic algorithm, we design a novel representation based on the ternary representation used for Learning Classifier Systems. The new representation is found able to produce superior performance to the bit string traditionally used for representing Cellular automata. Moreover, memory is shown to improve evolvability of solutions and appropriate memory settings are able to be evolved as a component part of these solutions.
Adaptive Data Stream Management System Using Learning Automata
Mohammadi, Shirin; Abdi, Fatemeh; Haghjoo, Mostafa S
2011-01-01
In many modern applications, data are received as infinite, rapid, unpredictable and time- variant data elements that are known as data streams. Systems which are able to process data streams with such properties are called Data Stream Management Systems (DSMS). Due to the unpredictable and time- variant properties of data streams as well as system, adaptivity of the DSMS is a major requirement for each DSMS. Accordingly, determining parameters which are effective on the most important performance metric of a DSMS (i.e., response time) and analysing them will affect on designing an adaptive DSMS. In this paper, effective parameters on response time of DSMS are studied and analysed and a solution is proposed for DSMSs' adaptivity. The proposed adaptive DSMS architecture includes a learning unit that frequently evaluates system to adjust the optimal value for each of tuneable effective. Learning Automata is used as the learning mechanism of the learning unit to adjust the value of tuneable effective parameters....
Simple cellular automata to mimic foraging ants submitted to abduction
Tejera, F
2015-01-01
Many species of ants forage by building up two files: an outbound one moving from the nest to the foraging area, and a nestbound one, returning from it to the nest. Those files are eventually submitted to different threats. If the danger is concentrated at one point of the file, one might expect that ants returning to the nest will pass danger information to their nestmates moving in the opposite direction towards the danger area. In this paper, we construct simple cellular automata models for foraging ants submitted to localized abduction, were danger information is transmitted using different protocols, including the possibility of no transmission. The parameters we have used in the simulations have been estimated from actual experiments under natural conditions. So, it would be easy to test our information-transmission hypothese in real experiments. Preliminary experimental results published elsewhere suggest that the behavior of foraging ants of the species Atta insularis is best described using the hypot...
Evolving cellular automata to perform computations. Final technical report
Energy Technology Data Exchange (ETDEWEB)
Crutchfield, J.P.; Mitchell, M.
1998-04-01
The overall goals of the project are to determine the usefulness of genetic algorithms (GAs) in designing spatially extended parallel systems to perform computational tasks and to develop theoretical frameworks both for understanding the computation in the systems evolved by the GA and for understanding the evolutionary process which successful systems are designed. In the original proposal the authors scheduled the first year of the project to be devoted to experimental grounding. During the first year they developed the simulation and graphics software necessary for doing experiments and analysis on one dimensional cellular automata (CAs), and they performed extensive experiments and analysis concerning two computational tasks--density classification and synchronization. Details of these experiments and results, and a list of resulting publications, were given in the 1994--1995 report. The authors scheduled the second year to be devoted to theoretical development. (A third year, to be funded by the National Science Foundation, will be devoted to applications.) Accordingly, most of the effort during the second year was spent on theory, both of GAs and of the CAs that they evolve. A central notion is that of the computational strategy of a CA, which they formalize in terms of domains, particles, and particle interactions. This formalization builds on the computational mechanics framework developed by Crutchfield and Hanson for understanding intrinsic computation in spatially extended dynamical systems. They have made significant progress in the following areas: (1) statistical dynamics of GAs; (2) formalizing particle based computation in cellular automata; and (3) computation in two-dimensional CAs.
Optimized reversible BCD adder using new reversible logic gates
Bhagyalakshmi, H R
2010-01-01
Reversible logic has received great attention in the recent years due to their ability to reduce the power dissipation which is the main requirement in low power digital design. It has wide applications advanced computing, low power CMOS design, Optical information processing, DNA computing, bio information, quantum computation and nanotechnology. This paper presents an optimized reversible BCD adder using a new reversible gate. A comparative result is presented which shows that the proposed design is more optimized in terms of number of gates, number of garbage outputs and quantum cost than the existing designs.
Reversible logic gates on Physarum Polycephalum
Energy Technology Data Exchange (ETDEWEB)
Schumann, Andrew [University of Information Technology and Management, Sucharskiego 2, Rzeszow, 35-225 (Poland)
2015-03-10
In this paper, we consider possibilities how to implement asynchronous sequential logic gates and quantum-style reversible logic gates on Physarum polycephalum motions. We show that in asynchronous sequential logic gates we can erase information because of uncertainty in the direction of plasmodium propagation. Therefore quantum-style reversible logic gates are more preferable for designing logic circuits on Physarum polycephalum.
Partial Reversible Gates(PRG) for Reversible BCD Arithmetic
Thapliyal, Himanshu; Bajpai, Rajnish; Sharma, Kamal K
2007-01-01
IEEE 754r is the ongoing revision to the IEEE 754 floating point standard and a major enhancement to the standard is the addition of decimal format. Furthermore, in the recent years reversible logic has emerged as a promising computing paradigm having its applications in low power CMOS, quantum computing, nanotechnology, and optical computing. The major goal in reversible logic is to minimize the number of reversible gates and garbage outputs. Thus, this paper proposes the novel concept of partial reversible gates that will satisfy the reversibility criteria for specific cases in BCD arithmetic. The partial reversible gate is proposed to minimize the number of reversible gates and garbage outputs, while designing the reversible BCD arithmetic circuits.
Dirac Quantum Cellular Automaton from Split-step Quantum Walk
Mallick, Arindam
2015-01-01
Simulations of one quantum system by an other has an implications in realization of quantum machine that can imitate any quantum systems and solve problems that are not accessible to classical computers. One of the approach to engineer quantum simulations is to discretize the space-time degree of freedom in quantum dynamics and define the quantum cellular automata (QCA), a local unitary update rule on a lattice. Different models of QCA are constructed using different set of conditions which are not uniquely defined. The form of the operators in these model are not always in implementable configuration on an other system. Here, starting from a split-step discrete-time quantum walk (DTQW) which are uniquely defined for experimental implementation, we recover the Dirac quantum cellular automaton (DQCA). This will bridge the connection between Dirac equation(DE)-DQCA-DTQW and eliminate the explicit use of invariance, symmetries and limiting range of parameter to establish the connections. For a combination of par...
Free spin quantum computation with semiconductor nanostructures
Zhang, W M; Soo, C; Zhang, Wei-Min; Wu, Yin-Zhong; Soo, Chopin
2005-01-01
Taking the excess electron spin in a unit cell of semiconductor multiple quantum-dot structure as a qubit, we can implement scalable quantum computation without resorting to spin-spin interactions. The technique of single electron tunnelings and the structure of quantum-dot cellular automata (QCA) are used to create a charge entangled state of two electrons which is then converted into spin entanglement states by using single spin rotations. Deterministic two-qubit quantum gates can also be manipulated using only single spin rotations with help of QCA. A single-short read-out of spin states can be realized by coupling the unit cell to a quantum point contact.
Basic Reversible Logic Gates and It’s Qca Implementation
Directory of Open Access Journals (Sweden)
Papiya Biswas,
2014-06-01
Full Text Available Reversible logic has various applications in various field like in Nanotechnology, quantum computing, Low power CMOS, Optical computing and DNA computing, etc. Quantum computation is One of the most important applications of the reversible logic.Basically reversible circuits do not lose information & reversible computation is performed only when system comprises of reversible gates. The reversible logic is design,main purposes are - decrease quantum cost, depth of the circuits & the number of garbage output. This paper provides the basic‘s of reversible logic gates & its implementation in qca.
Kulikova, Olga
2016-01-01
This thesis was focused on the analysis of the concept of reverse logistics and actual reverse processes which are implemented in mining industry and finding solutions for the optimization of reverse logistics in this sphere. The objective of this paper was the assessment of the development of reverse logistics in mining industry on the example of potash production. The theoretical part was based on reverse logistics and mining waste related literature and provided foundations for further...
Energy Technology Data Exchange (ETDEWEB)
H. B. HUNT; D. J. ROSENKRANTS; ET AL
2001-03-01
We identify several simple but powerful concepts, techniques, and results; and we use them to characterize the complexities of a number of basic problems II, that arise in the analysis and verification of the following models M of communicating automata and discrete dynamical systems: systems of communicating automata including both finite and infinite cellular automata, transition systems, discrete dynamical systems, and succinctly-specified finite automata. These concepts, techniques, and results are centered on the following: (i) reductions Of STATE-REACHABILITY problems, especially for very simple systems of communicating copies of a single simple finite automaton, (ii) reductions of generalized CNF satisfiability problems [Sc78], especially to very simple communicating systems of copies of a few basic acyclic finite sequential machines, and (iii) reductions of the EMPTINESS and EMPTINESS-OF-INTERSECTION problems, for several kinds of regular set descriptors. For systems of communicating automata and transition systems, the problems studied include: all equivalence relations and simulation preorders in the Linear-time/Branching-time hierarchies of equivalence relations and simulation preorders of [vG90, vG93], both without and with the hiding abstraction. For discrete dynamical systems, the problems studied include the INITIAL and BOUNDARY VALUE PROBLEMS (denoted IVPs and BVPS, respectively), for nonlinear difference equations over many different algebraic structures, e.g. all unitary rings, all finite unitary semirings, and all lattices. For succinctly-specified finite automata, the problems studied also include the several problems studied in [AY98], e.g. the EMPTINESS, EMPTINESS-OF-INTERSECTION, EQUIVALENCE and CONTAINMENT problems. The concepts, techniques, and results presented unify and significantly extend many of the known results in the literature, e.g. [Wo86, Gu89, BPT91, GM92, Ra92, HT94, SH+96, AY98, AKY99, RH93, SM73, Hu73, HRS76, HR78], for
Energy Technology Data Exchange (ETDEWEB)
Hunt, H. B. (Harry B.); Rosenkrantz, D. J. (Daniel J.); Barrett, C. L. (Christopher L.); Marathe, M. V. (Madhav V.); Ravi, S. S. (Sekharipuram S.)
2001-01-01
We identify several simple but powerful concepts, techniques, and results; and we use them to characterize the complexities of a number of basic problems II, that arise in the analysis and verification of the following models M of communicating automata and discrete dynamical systems: systems of communicating automata including both finite and infinite cellular automata, transition systems, discrete dynamical systems, and succinctly-specified finite automata. These concepts, techniques, and results are centered on the following: (1) reductions Of STATE-REACHABILITY problems, especially for very simple systems of communicating copies of a single simple finite automaton, (2) reductions of generalized CNF satisfiability problems [Sc78], especially to very simple communicating systems of copies of a few basic acyclic finite sequential machines, and (3) reductions of the EMPTINESS and EMPTINESS-OF-INTERSECTION problems, for several kinds of regular set descriptors. For systems of communicating automata and transition systems, the problems studied include: all equivalence relations and simulation preorders in the Linear-time/Branching-time hierarchies of equivalence relations and simulation preorders of [vG90, vG93], both without and with the hiding abstraction. For discrete dynamical systems, the problems studied include the INITIAL and BOUNDARY VALUE PROBLEMS (denoted IVPs and BVPs, respectively), for nonlinear difference equations over many different algebraic structures, e.g. all unitary rings, all finite unitary semirings, and all lattices. For succinctly specified finite automata, the problems studied also include the several problems studied in [AY98], e.g. the EMPTINESS, EMPTINESS-OF-INTERSECTION, EQUIVALENCE and CONTAINMENT problems. The concepts, techniques, and results presented unify and significantly extend many of the known results in the literature, e.g. [Wo86, Gu89, BPT91, GM92, Ra92, HT94, SH+96, AY98, AKY99, RH93, SM73, Hu73, HRS76, HR78], for
Quantum information theory mathematical foundation
Hayashi, Masahito
2017-01-01
This graduate textbook provides a unified view of quantum information theory. Clearly explaining the necessary mathematical basis, it merges key topics from both information-theoretic and quantum- mechanical viewpoints and provides lucid explanations of the basic results. Thanks to this unified approach, it makes accessible such advanced topics in quantum communication as quantum teleportation, superdense coding, quantum state transmission (quantum error-correction) and quantum encryption. Since the publication of the preceding book Quantum Information: An Introduction, there have been tremendous strides in the field of quantum information. In particular, the following topics – all of which are addressed here – made seen major advances: quantum state discrimination, quantum channel capacity, bipartite and multipartite entanglement, security analysis on quantum communication, reverse Shannon theorem and uncertainty relation. With regard to the analysis of quantum security, the present book employs an impro...
AOT/异辛烷反胶束体系制备CdTe量子点的研究%Synthesis of CdTe Quantum Dots in AOT/isooctane Reversed Micelle System
Institute of Scientific and Technical Information of China (English)
林谦; 王小燕; 罗志敏
2012-01-01
采用反胶束法制备CdTe量子点。反胶束体系由CdTe前驱体、AOT（丁二酸二异辛酯磺酸钠）、异辛烷组成;CdTe前驱体在水相中以巯基丙酸为稳定剂、按nCd2＋：nHTe-：nMPA=3：1：6、pH=9.8的条件合成。考察了反胶束体系中ω（ω=[水]/[表面活性剂]）、表面活性剂浓度对合成CdTe量子点的光学性质的影响。试验表明：当AOT的浓度为0.06g.mL-1时,改变ω能合成不同粒径的CdTe量子点,ω从7增加到13荧光发射光谱位移117.2nm。%Quantum Dots were prepared by using reversed micelle.CdTe precursors was formed in aqueous solution with MPA as stabilizer under the following condition: nCd2+: nHTe-: nMPA=3:1:6,ph=9.8.Reversed Micelle System was formed with AOT,isooctane and CdTe precursors.The impact of ω(ω=/[ surfactant]) and concentration of surfactant on the optical properties of synthesized CdTe quantum dots has been examined.The experiment has found that when the concentration of AOT was 0.06g.mL-1,changing ω can synthesize CdTe quantum dots of different particle diameters;when ω was increased from 7 to 13,fluorescent emission spectra shifted for 117.2nm.
A novel time series link prediction method: Learning automata approach
Moradabadi, Behnaz; Meybodi, Mohammad Reza
2017-09-01
Link prediction is a main social network challenge that uses the network structure to predict future links. The common link prediction approaches to predict hidden links use a static graph representation where a snapshot of the network is analyzed to find hidden or future links. For example, similarity metric based link predictions are a common traditional approach that calculates the similarity metric for each non-connected link and sort the links based on their similarity metrics and label the links with higher similarity scores as the future links. Because people activities in social networks are dynamic and uncertainty, and the structure of the networks changes over time, using deterministic graphs for modeling and analysis of the social network may not be appropriate. In the time-series link prediction problem, the time series link occurrences are used to predict the future links In this paper, we propose a new time series link prediction based on learning automata. In the proposed algorithm for each link that must be predicted there is one learning automaton and each learning automaton tries to predict the existence or non-existence of the corresponding link. To predict the link occurrence in time T, there is a chain consists of stages 1 through T - 1 and the learning automaton passes from these stages to learn the existence or non-existence of the corresponding link. Our preliminary link prediction experiments with co-authorship and email networks have provided satisfactory results when time series link occurrences are considered.
Stochastic cellular automata model for stock market dynamics
Bartolozzi, M.; Thomas, A. W.
2004-04-01
In the present work we introduce a stochastic cellular automata model in order to simulate the dynamics of the stock market. A direct percolation method is used to create a hierarchy of clusters of active traders on a two-dimensional grid. Active traders are characterized by the decision to buy, σi (t)=+1 , or sell, σi (t)=-1 , a stock at a certain discrete time step. The remaining cells are inactive, σi (t)=0 . The trading dynamics is then determined by the stochastic interaction between traders belonging to the same cluster. Extreme, intermittent events, such as crashes or bubbles, are triggered by a phase transition in the state of the bigger clusters present on the grid, where almost all the active traders come to share the same spin orientation. Most of the stylized aspects of the financial market time series, including multifractal proprieties, are reproduced by the model. A direct comparison is made with the daily closures of the S&P500 index.
Text Extraction and Enhancement of Binary Images Using Cellular Automata
Institute of Scientific and Technical Information of China (English)
G. Sahoo; Tapas Kumar; B.L. Rains; C.M. Bhatia
2009-01-01
Text characters embedded in images represent a rich source of information for content-based indexing and retrieval applications. However, these text characters are difficult to be detected and recognized due to their various sizes, grayscale values, and complex backgrounds. Existing methods cannot handle well those texts with different contrast or embedded in a complex image background. In this paper, a set of sequential algorithms for text extraction and enhancement of image using cellular automata are proposed. The image enhancement includes gray level, contrast manipulation, edge detection, and filtering. First, it applies edge detection and uses a threshold to filter out for low-contrast text and simplify complex background of high-contrast text from binary image. The proposed algorithm is simple and easy to use and requires only a sample texture binary image as an input. It generates textures with perceived quality, better than those proposed by earlier published techniques. The performance of our method is demonstrated by presenting experimental results for a set of text based binary images. The quality of thresholding is assessed using the precision and recall analysis of the resultant text in the binary image.
Devising an unconventional formal logic for bioinspired spacefaring automata
Santoli, Salvatore
2011-03-01
The field of robotics is increasingly moving from robots confined to factory floors and assembly lines and bound to perform the same tasks over and over in an uncertainty-free, well foreseeable environment, to robots designed for operating in highly dynamic and uncertainty domains, like those of interest in space exploration. According to an idea of a "new system of formal logic less rigid than past and present formal logic" advocated by von Neumann for building a powerful theory of automata, such system should be "closer to another discipline which has been little linked in the past with logic, i.e. thermodynamics, primarily in the form it was received by Boltzmann". Following that idea, which is particularly interesting now with the emerging computational nano-sciences, it is stressed here that a full set of isomorphisms can be established between the fundamental logical principles and the information flows, Hamiltonian or dissipative, in phase space. This form of logic, dubbed here kinetic logic, takes standard formal logic out of the field of combinatorics and into the field of the Boltzmannian form of thermodynamics, i.e. kinetics.
Online Induction of Probabilistic Real-Time Automata
Institute of Scientific and Technical Information of China (English)
Jana Schmidt; Stefan Kramer
2014-01-01
The probabilistic real-time automaton (PRTA) is a representation of dynamic processes arising in the sciences and industry. Currently, the induction of automata is divided into two steps: the creation of the prefix tree acceptor (PTA) and the merge procedure based on clustering of the states. These two steps can be very time intensive when a PRTA is to be induced for massive or even unbounded datasets. The latter one can be efficiently processed, as there exist scalable online clustering algorithms. However, the creation of the PTA still can be very time consuming. To overcome this problem, we propose a genuine online PRTA induction approach that incorporates new instances by first collapsing them and then using a maximum frequent pattern based clustering. The approach is tested against a predefined synthetic automaton and real world datasets, for which the approach is scalable and stable. Moreover, we present a broad evaluation on a real world disease group dataset that shows the applicability of such a model to the analysis of medical processes.
Buffered Simulation Games for Büchi Automata
Directory of Open Access Journals (Sweden)
Milka Hutagalung
2014-05-01
Full Text Available Simulation relations are an important tool in automata theory because they provide efficiently computable approximations to language inclusion. In recent years, extensions of ordinary simulations have been studied, for instance multi-pebble and multi-letter simulations which yield better approximations and are still polynomial-time computable. In this paper we study the limitations of approximating language inclusion in this way: we introduce a natural extension of multi-letter simulations called buffered simulations. They are based on a simulation game in which the two players share a FIFO buffer of unbounded size. We consider two variants of these buffered games called continuous and look-ahead simulation which differ in how elements can be removed from the FIFO buffer. We show that look-ahead simulation, the simpler one, is already PSPACE-hard, i.e. computationally as hard as language inclusion itself. Continuous simulation is even EXPTIME-hard. We also provide matching upper bounds for solving these games with infinite state spaces.
Weak factor automata: the failure of failure factor oracles?
Directory of Open Access Journals (Sweden)
Loek Cleophas
2014-08-01
Full Text Available In indexing of, and pattern matching on, DNA and text sequences, it is often important to represent all factors of a sequence. One efficient, compact representation is the factor oracle (FO. At the same time, any classical deterministic finite automata (DFA can be transformed to a so-called failure one (FDFA, which may use failure transitions to replace multiple symbol transitions, potentially yielding a more compact representation. We combine the two ideas and directly construct a failure factor oracle (FFO from a given sequence, in contrast to ex post facto transformation to an FDFA. The algorithm is suitable for both short and long sequences. We empirically compared the resulting FFOs and FOs on number of transitions for many DNA sequences of lengths 4 − 512, showing gains of up to 10% in total number of transitions, with failure transitions also taking up less space than symbol transitions. The resulting FFOs can be used for indexing, as well as in a variant of the FO-using backward oracle matching algorithm. We discuss and classify this pattern matching algorithm in terms of the keyword pattern matching taxonomies of Watson, Cleophas and Zwaan. We also empirically compared the use of FOs and FFOs in such backward reading pattern matching algorithms, using both DNA and natural language (English data sets. The results indicate that the decrease in pattern matching performance of an algorithm using an FFO instead of an FO may outweigh the gain in representation space by using an FFO instead of an FO.
Using cellular automata for parking recommendations in smart environments.
Directory of Open Access Journals (Sweden)
Gwo-Jiun Horng
Full Text Available In this work, we propose an innovative adaptive recommendation mechanism for smart parking. The cognitive RF module will transmit the vehicle location information and the parking space requirements to the parking congestion computing center (PCCC when the driver must find a parking space. Moreover, for the parking spaces, we use a cellular automata (CA model mechanism that can adjust to full and not full parking lot situations. Here, the PCCC can compute the nearest parking lot, the parking lot status and the current or opposite driving direction with the vehicle location information. By considering the driving direction, we can determine when the vehicles must turn around and thus reduce road congestion and speed up finding a parking space. The recommendation will be sent to the drivers through a wireless communication cognitive radio (CR model after the computation and analysis by the PCCC. The current study evaluates the performance of this approach by conducting computer simulations. The simulation results show the strengths of the proposed smart parking mechanism in terms of avoiding increased congestion and decreasing the time to find a parking space.
Using cellular automata for parking recommendations in smart environments.
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.
An Automata Based Intrusion Detection Method for Internet of Things
Directory of Open Access Journals (Sweden)
Yulong Fu
2017-01-01
Full Text Available Internet of Things (IoT transforms network communication to Machine-to-Machine (M2M basis and provides open access and new services to citizens and companies. It extends the border of Internet and will be developed as one part of the future 5G networks. However, as the resources of IoT’s front devices are constrained, many security mechanisms are hard to be implemented to protect the IoT networks. Intrusion detection system (IDS is an efficient technique that can be used to detect the attackers when cryptography is broken, and it can be used to enforce the security of IoT networks. In this article, we analyzed the intrusion detection requirements of IoT networks and then proposed a uniform intrusion detection method for the vast heterogeneous IoT networks based on an automata model. The proposed method can detect and report the possible IoT attacks with three types: jam-attack, false-attack, and reply-attack automatically. We also design an experiment to verify the proposed IDS method and examine the attack of RADIUS application.
A cellular automata model of epidemics of a heterogeneous susceptibility
Institute of Scientific and Technical Information of China (English)
Jin Zhen; Liu Quan-Xing
2006-01-01
In this paper we present a model with spatial heterogeneity based on cellular automata (CA). In the model we consider the relevant heterogeneity of host (susceptible) mixing and the natural birth rate. We divide the susceptible population into three groups according to the immunity of each individual based on the classical susceptible-infectedremoved (SIR) epidemic models, and consider the spread of an infectious disease transmitted by direct contact among humans and vectors that have not an incubation period to become infectious. We test the local stability and instability of the disease-free equilibrium by the spectrum radii of Jacobian. The simulation shows that the structure of the nearest neighbour size of the cell (or the degree of the scale-free networks) plays a very important role in the spread properties of infectious disease. The positive equilibrium of the infections versus the neighbour size follows the third power law if an endemic equilibrium point exists. Finally, we analyse the feature of the infection waves for the homogeneity and heterogeneous cases respectively.
Improve Energy Efficiency Routing In WSN By Using Automata
Directory of Open Access Journals (Sweden)
Elham Hajian
2010-06-01
Full Text Available Low power and limited processing are characteristic s of nodes in Wireless sensor networks. Therefore, optimal consumption of energy for WSN protocols seems essen tial. In a number of WSN applications, sensor nodes sense data periodically from environment and transfer it to th e sink. Because of limitation in energy and selecti on of best route, for the purpose of increasing network remaining ene rgy a node with most energy level will be used for transmission of data. The most part of energy in nodes is wasted on radio transmission; thus decreasing number of t ransferred packets in the network will result in increase in n ode and network lifetimes. In algorithms introduced for data transmission in such networks up to now, a single r oute is used for data transmissions that results in decrease in energy of nodes located on this route which in turn results in increasing of remaining energy. In this paper a new method is proposed for selection of data transmissi on route that is able to solve this problem. This m ethod is based on learning automata that selects the route with re gard to energy parameters and the distance to sink. In this method energy of network nodes finishes rather simultaneou sly preventing break down of network into two separ ate parts. This will result in increased lifetime. Simulation results show that this method has been very effecti ve in increasing of remaining energy and it increases network lifetime.
Compression-based investigation of the dynamical properties of cellular automata and other systems
Zenil, Hector
2009-01-01
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the compression-based approach classifies cellular automata (CA) into clusters according to their heuristic behavior, with these clusters showing a correspondence with Wolfram's main classes of CA behavior. A compression based method to estimate a characteristic exponent to detect phase transitions and measure the resiliency or sensitivity of a system to its initial conditions is also proposed, constituting a compression-based framework for investigating the dynamical properties of cellular automata and other systems. Keywords: cellular automata classification, Wolfram's four classes, phase transition detection, program-size complexity, compression-based clustering, non-linear dynamics, Lyapunov characteristic exponents.
Directory of Open Access Journals (Sweden)
Marc-Thorsten Hütt
2012-06-01
Full Text Available Cellular automata (CA are a remarkably efficient tool for exploring general properties of complex systems and spatiotemporal patterns arising from local rules. Totalistic cellular automata, where the update rules depend only on the density of neighboring states, are at the same time a versatile tool for exploring dynamical processes on graphs. Here we briefly review our previous results on cellular automata on graphs, emphasizing some systematic relationships between network architecture and dynamics identified in this way. We then extend the investigation towards graphs obtained in a simulated-evolution procedure, starting from Erdő s–Rényi (ER graphs and selecting for low entropies of the CA dynamics. Our key result is a strong association of low Shannon entropies with a broadening of the graph’s degree distribution.
IMPACT OF SPATIAL FILTER ON LAND-USE CHANGES MODELLING USING URBAN CELLULAR AUTOMATA
Directory of Open Access Journals (Sweden)
M. Omidipoor
2017-09-01
Full Text Available Urban cellular automata is used vastly in simulating of urban evolutions and dynamics. Finding an appropriate neighbourhood size in urban cellular automata modelling is important because the outputs are strongly influenced by input parameters. This paper investigates the impact of spatial filters on behaviour and outcome of urban cellular automata models. In this study different spatial filters in various sizes including 3*3, 5*5, 7*7, 9*9, 11*11, 13*13, 15*15 and 17*17 cells are used in a scenario of land-use changes. The proposed method is examined changes in size and shape of spatial filter whereas the resolution was kept fixed. The implementation results in Ahvaz city demonstrated that KAPPA index is changed in different shapes and types at the time when different spatial filters are used. However, circular shape with size of 5*5 offers better accuracy.
L-FLAT: Logtalk Toolkit for Formal Languages and Automata Theory
Moura, Paulo
2011-01-01
We describe L-FLAT, a Logtalk Toolkit for teaching Formal Languages and Automata Theory. L-FLAT supports the definition of \\textsl{alphabets}, the definition of \\textsl{orders} over alphabet symbols, the partial definition of \\textsl{languages} using unit tests, and the definition of \\textsl{mechanisms}, which implement language generators or language recognizers. Supported mechanisms include \\textsl{predicates}, \\textsl{regular expressions}, \\textsl{finite automata}, \\textsl{context-free grammars}, \\textsl{Turing machines}, and \\textsl{push-down automata}. L-FLAT entities are implemented using the object-oriented features of Logtalk, providing a highly portable and easily extendable framework. The use of L-FLAT in educational environments is enhanced by supporting Mooshak, a web application that features automatic grading of submitted programs.
NATO Advanced Study Institute on Structural Theory of Automata, Semigroups and Universal Algebra
Rosenberg, Ivo; Goldstein, Martin
2005-01-01
Several of the contributions to this volume bring forward many mutually beneficial interactions and connections between the three domains of the title. Developing them was the main purpose of the NATO ASI summerschool held in Montreal in 2003. Although some connections, for example between semigroups and automata, were known for a long time, developing them and surveying them in one volume is novel and hopefully stimulating for the future. Another aspect is the emphasis on the structural theory of automata that studies ways to contstruct big automata from small ones. The volume also has contributions on top current research or surveys in the three domains. One contribution even links clones of universal algebra with the computational complexity of computer science. Three contributions introduce the reader to research in the former East block.
Using Shared Memory As A Cache In High Performance Cellular Automata Water Flow Simulations
Directory of Open Access Journals (Sweden)
Paweł Topa
2013-01-01
Full Text Available Graphics processors (GPU -- Graphic Processor Units recently have gained a lot of interest as an efficient platform for general-purpose computation. Cellular Automata approach which is inherently parallel gives the opportunity to implement high performance simulations. This paper presents how shared memory in GPU can be used to improve performance for Cellular Automata models. In our previous works, we proposed algorithms for Cellular Automata model that use only a GPU global memory. Using a profiling tool, we found bottlenecks in our approach. We introduce modifications that takes an advantage of fast shared memory. The modified algorithm is presented in details, and the results of profiling and performance test are demonstrated. Our unique achievement is comparing the efficiency of the same algorithm working with a global and shared memory.
CCABC: Cyclic Cellular Automata Based Clustering For Energy Conservation in Sensor Networks
Banerjee, Indrajit; Rahaman, Hafizur
2011-01-01
Sensor network has been recognized as the most significant technology for next century. Despites of its potential application, wireless sensor network encounters resource restriction such as low power, reduced bandwidth and specially limited power sources. This work proposes an efficient technique for the conservation of energy in a wireless sensor network (WSN) by forming an effective cluster of the network nodes distributed over a wide range of geographical area. The clustering scheme is developed around a specified class of cellular automata (CA) referred to as the modified cyclic cellular automata (mCCA). It sets a number of nodes in stand-by mode at an instance of time without compromising the area of network coverage and thereby conserves the battery power. The proposed scheme also determines an effective cluster size where the inter-cluster and intra-cluster communication cost is minimum. The simulation results establish that the cyclic cellular automata based clustering for energy conservation in sens...
Generic framework for mining cellular automata models on protein-folding simulations.
Diaz, N; Tischer, I
2016-05-13
Cellular automata model identification is an important way of building simplified simulation models. In this study, we describe a generic architectural framework to ease the development process of new metaheuristic-based algorithms for cellular automata model identification in protein-folding trajectories. Our framework was developed by a methodology based on design patterns that allow an improved experience for new algorithms development. The usefulness of the proposed framework is demonstrated by the implementation of four algorithms, able to obtain extremely precise cellular automata models of the protein-folding process with a protein contact map representation. Dynamic rules obtained by the proposed approach are discussed, and future use for the new tool is outlined.
Some Notes on Graph Automata,Tiling Systems and Partition Logic
Institute of Scientific and Technical Information of China (English)
沈恩绍
1998-01-01
Introduce heuristically the newly definition(W.Thomas)for graph automata-using “tiles”to simulate the extension(over dag's) of the classical notions of transition moves;propose a sufficient condition for when graph automata can be reduced to (simpler)tiling systems,which is a generalization of a Thomas' result;and finally study the logic sepcification of tiling systems (particularly,over picture languages)by (existential)monadic partition logic,instead of the ususal and stronger framework(E)MSO.
A Characterization of Cellular Automata Generated by Idempotents on the Full Shift
Salo, Ville
2012-01-01
In this article, we discuss the family of cellular automata generated by so-called idempotent cellular automata (CA G such that G^2 = G) on the full shift. We prove a characterization of products of idempotent CA, and show examples of CA which are not easy to directly decompose into a product of idempotents, but which are trivially seen to satisfy the conditions of the characterization. Our proof uses ideas similar to those used in the well-known Embedding Theorem and Lower Entropy Factor Theorem in symbolic dynamics. We also consider some natural decidability questions for the class of products of idempotent CA.
Institute of Scientific and Technical Information of China (English)
LI; Xia(黎夏); YEH; Gar-On(叶嘉安)
2002-01-01
This paper discusses the issues about the correlation of spatial variables during spatial decisionmaking using multicriteria evaluation (MCE) and cellular automata (CA). The correlation of spatial variables can cause the malfunction of MCE. In urban simulation, spatial factors often exhibit a high degree of correlation which is considered as an undesirable property for MCE. This study uses principal components analysis (PCA) to remove data redundancy among a large set of spatial variables and determine 'ideal points' for land development. PCA is integrated with cellular automata and geographical information systems (GIS) for the simulation of idealized urban forms for planning purposes.
Increasing Ranks of Linear Finite Automata and Complexity of FA Public Key Cryptosystem
Institute of Scientific and Technical Information of China (English)
鲍丰
1994-01-01
The encryption algorithm of finite automata (FA) public key cryptosystem is implemented by a weakly invertible finite automata (WIFA) which is composed of a nonlinear WIFA with delay 0 and a linear WIFA with delay τ. In this paper, we proved that such an automaton bears the same properties as the linear WIFA and the increasing ranks of the latter are key factors to affecting the former. A probabilistic algorithm is given to realize a ciphertext attack, and its complexity is analysed through the increasing ranks of the linear WIFA. The size of the parameters for safe linear WIFA is estimated.
The Study Of Properties Of The Word Of Mouth Marketing Using Cellular Automata
Directory of Open Access Journals (Sweden)
Kowalska-Styczeń Agnieszka
2014-02-01
Full Text Available This article presents the possibility of using cellular automata, to study the properties of word of mouth (w-o-m marketing. Cellular automata allow to analyze the dynamics of changes in views and attitudes in social groups based on local interactions between people in small groups of friends, family members etc. The proposed paper shows the possibility of modelling the dynamics of word of mouth mechanism, if the basic assumptions of this process are: different size groups where this phenomenon occurs, and varied access to information. On the competing firms market, the dependence of the w-o-m mechanism dynamics on the model parameters is shown
A Novel Approach for Attacks Mitigation in Mobile Ad Hoc Networks Using Cellular Automatas
Directory of Open Access Journals (Sweden)
Himadri Nath Saha
2012-04-01
Full Text Available Many security schemes for mobile ad-hoc network(MANET have been proposed so far but none of them has been successful in combating the different types of attacks that a mobile ad-hoc network often faces. This paper is providing one way of mitigating attacks in mobile ad-hoc networks by authenticating the node who tries to access this network .This scheme has been applied by using cellular automata (CA. Our simulation results show how cellular automata(CA is implemented for user authentication and secure transmission in MANET.
Lu, Dawei; Biamonte, Jacob D.; Li, Jun; Li, Hang; Johnson, Tomi H.; Bergholm, Ville; Faccin, Mauro; Zimborás, Zoltán; Laflamme, Raymond; Baugh, Jonathan; Lloyd, Seth
2016-04-01
Given its importance to many other areas of physics, from condensed-matter physics to thermodynamics, time-reversal symmetry has had relatively little influence on quantum information science. Here we develop a network-based picture of time-reversal theory, classifying Hamiltonians and quantum circuits as time symmetric or not in terms of the elements and geometries of their underlying networks. Many of the typical circuits of quantum information science are found to exhibit time asymmetry. Moreover, we show that time asymmetry in circuits can be controlled using local gates only and can simulate time asymmetry in Hamiltonian evolution. We experimentally implement a fundamental example in which controlled time-reversal asymmetry in a palindromic quantum circuit leads to near-perfect transport. Our results pave the way for using time-symmetry breaking to control coherent transport and imply that time asymmetry represents an omnipresent yet poorly understood effect in quantum information science.
Lu, DaWei; Li, Jun; Li, Hang; Johnson, Tomi H; Bergholm, Ville; Faccin, Mauro; Zimborás, Zoltán; Laflamme, Raymond; Baugh, Jonathan; Lloyd, Seth
2016-01-01
Given its importance to many other areas of physics, from condensed matter physics to thermodynamics, time-reversal symmetry has had relatively little influence on quantum information science. Here we develop a network-based picture of time-reversal theory, classifying Hamiltonians and quantum circuits as time-symmetric or not in terms of the elements and geometries of their underlying networks. Many of the typical circuits of quantum information science are found to exhibit time-asymmetry. Moreover, we show that time-asymmetry in circuits can be controlled using local gates only, and can simulate time-asymmetry in Hamiltonian evolution. We experimentally implement a fundamental example in which controlled time-reversal asymmetry in a palindromic quantum circuit leads to near-perfect transport. Our results pave the way for using time-symmetry breaking to control coherent transport, and imply that time-asymmetry represents an omnipresent yet poorly understood effect in quantum information science.
A stochastic parameterization for deep convection using cellular automata
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
Dynamic behavior of multirobot systems using lattice gas automata
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
Fuel management optimization based on power profile by Cellular Automata
Energy Technology Data Exchange (ETDEWEB)
Fadaei, Amir Hosein, E-mail: Fadaei_amir@aut.ac.i [Faculty of Nuclear Engineering and Physics, Amirkabir University of Technology (Tehran Polytechnique), Hafez Street, Tehran (Iran, Islamic Republic of); Moghaddam, Nader Maleki [Faculty of Nuclear Engineering and Physics, Amirkabir University of Technology (Tehran Polytechnique), Hafez Street, Tehran (Iran, Islamic Republic of); Zahedinejad, Ehsan [Department of Energy Engineering, Sharif University of Technology, Azadi Str., Tehran (Iran, Islamic Republic of); Fadaei, Mohammad Mehdi [Department of Electrical Engineering, Faculty of Engineering, Central Tehran Branch, Islamic Azad University, Punak Square, Tehran (Iran, Islamic Republic of); Kia, Shabnam [Faculty of Engineering, Islamic Azad University, Science and Research Branch, Punak Square, Tehran (Iran, Islamic Republic of)
2010-12-15
Fuel management in PWR nuclear reactors is comprised of a collection of principles and practices required for the planning, scheduling, refueling, and safe operation of nuclear power plants to minimize the total plant and system energy costs to the extent possible. Despite remarkable advancements in optimization procedures, inherent complexities in nuclear reactor structure and strong inter-dependency among the fundamental parameters of the core make it necessary to evaluate the most efficient arrangement of the core. Several patterns have been presented so far to determine the best configuration of fuels in the reactor core by emphasis on minimizing the local power peaking factor (P{sub q}). In this research, a new strategy for optimizing the fuel arrangements in a VVER-1000 reactor core is developed while lowering the P{sub q} is considered as the main target. For this purpose, a Fuel Quality Factor, Z(r), served to depict the reactor core pattern. Mapping to ideal pattern is tracked over the optimization procedure in which the ideal pattern is prepared with considering the Z(r) constraints and their effects on flux and P{sub q} uniformity. For finding the best configuration corresponding to the desired pattern, Cellular Automata (CA) is applied as a powerful and reliable tool on optimization procedure. To obtain the Z(r) constraints, the MCNP code was used and core calculations were performed by WIMS and CITATION codes. The results are compared with the predictions of a Neural Network as a smart optimization method, and the Final Safety Analysis Report (FSAR) as a reference proposed by the designer.
Floating point based Cellular Automata simulations using a dual FPGA-enabled system
Murtaza, S.; Hoekstra, A.G.; Sloot, P.M.A.; Kindratenko, V.
2008-01-01
With the recent emergence of multicore architectures, the age of multicore computing might have already dawned upon us. This shift might have triggered the evolution of von Neumann architecture towards a parallel processing paradigm. Cellular Automata- inherently decentralized spatially extended sys
Analysis of timed and long-run objectives for Markov automata
Guck, Dennis; Hatefi, Hassan; Hermanns, Holger; Katoen, Joost-Pieter; Timmer, Mark
2014-01-01
Markov automata (MAs) extend labelled transition systems with random delays and probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution over states, whereas timed transitions impose a random delay governed by an exponential distribution. MAs are thus a nondete
Simulating Urban Growth Using a Random Forest-Cellular Automata (RF-CA Model
Directory of Open Access Journals (Sweden)
Courage Kamusoko
2015-04-01
Full Text Available Sustainable urban planning and management require reliable land change models, which can be used to improve decision making. The objective of this study was to test a random forest-cellular automata (RF-CA model, which combines random forest (RF and cellular automata (CA models. The Kappa simulation (KSimulation, figure of merit, and components of agreement and disagreement statistics were used to validate the RF-CA model. Furthermore, the RF-CA model was compared with support vector machine cellular automata (SVM-CA and logistic regression cellular automata (LR-CA models. Results show that the RF-CA model outperformed the SVM-CA and LR-CA models. The RF-CA model had a Kappa simulation (KSimulation accuracy of 0.51 (with a figure of merit statistic of 47%, while SVM-CA and LR-CA models had a KSimulation accuracy of 0.39 and −0.22 (with figure of merit statistics of 39% and 6%, respectively. Generally, the RF-CA model was relatively accurate at allocating “non-built-up to built-up” changes as reflected by the correct “non-built-up to built-up” components of agreement of 15%. The performance of the RF-CA model was attributed to the relatively accurate RF transition potential maps. Therefore, this study highlights the potential of the RF-CA model for simulating urban growth.
A cellular automata intraurban model with prices and income-differentiated actors
Furtado, B.A.; Ettema, D.F.; Ruiz, R.M.; Hurkens, J.; Delden, H. van
2012-01-01
This paper presents an intraurban cellular automata model that is an extension to White and Engelen’s pioneering model. The paper’s main contribution is to distinguish between agglomerative eff ects, determined by the attraction of the neighbourhood, and disagglomerative eff ects, driven by land pri
Applications of the Cellular Automata Paradigm in Structural Analysis and Design
Abdalla, M.M.
2004-01-01
Recent is een techniek ontstaan voor de aanpak van gecombineerde automatische analyse en ontwerp van een- of meerdimensionale elastische systemen in een omgeving van meervoudig parallel rekenen. De aanpak is gebaseerd op het paradigma van âcellular automata (CA)â. De implementatie van deze techniek
Behavioural differential equations : a coinductive calculus of streams, automata, and power series
Rutten, J.J.M.M.
2000-01-01
Streams, (automata and) languages, and formal power series are viewed coalgebraically. In summary, this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being final. Finality then forms the basis for both definitions and proofs by coinduct
Study of phase separation using liquid-gas model of lattice-gas cellular automata
Energy Technology Data Exchange (ETDEWEB)
Ebihara, Kenichi; Watanabe, Tadashi; Kaburaki, Hideo [Japan Atomic Energy Research Inst., Tokai, Ibaraki (Japan). Tokai Research Establishment
1997-07-01
This report describes the study of phase separation by the liquid gas model of lattice gas cellular automata. The lattice gas cellular automaton is one model for simulating fluid phenomena which was proposed by Frisch, Hasslacher and Pomeau in 1986. In 1990, Appert and Zaleski added a new long-range interaction to lattice gas cellular automata to construct a model, the liquid-gas model, which could simulate phase separation using lattice-gas cellular automata. Gerits et al formulated the liquid-gas model mathematically using the theory of statistical dynamics in 1993 and explained the mechanism of phase separation in the liquid-gas model using the equation of state. At first this report explains the FHP model of lattice gas cellular automata and derives fluid dynamics equations such as the equation of continuity and the Navier-Stokes equation. Then the equation of state for the liquid-gas model which was derived by Gerits et al is modified by adding the interactions which were proposed by Appert but not considered by Gerits et al. The modified equation of state is verified by the computer simulation using the liquid gas model. The relation between phase separation and the equation of state is discussed. (author)
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
DEFF Research Database (Denmark)
Srba, Jiri
2008-01-01
were suggested as real-time extensions of several well-known untimed models. The most studied formalisms include Networks of Timed Automata which extend the model of communicating finite-state machines with a finite number of real-valued clocks, and timed extensions of Petri nets where the added time...
Behavioural differential equations : a coinductive calculus of streams, automata, and power series
J.J.M.M. Rutten (Jan)
2000-01-01
textabstractStreams, (automata and) languages, and formal power series are viewed coalgebraically. In summary, this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being final. Finality then forms the basis for both definitions and proofs
THE FINITE AUTOMATA OF EVENTUALLY PERIODIC UNIMODAL MAPS ON THE INTERVAL
Institute of Scientific and Technical Information of China (English)
谢惠民
1993-01-01
For unimodal maps on the interval we prove that, if the kneading sequences (KS) are eventually periodic, then their formal languages are regular ones. The finite automata for such languages are constructed. Comparing with the languages generated by periodic KS, it is shown that the languages here are not finite complement languages.
Caiazzo, A.; Evans, D.; Falcone, J.-L.; Hegewald, J.; Lorenz, E.; Stahl, B.; Wang, D.; Bernsdorf, J.; Chopard, B.; Gunn, J.; Hose, R.; Krafczyk, M.; Lawford, P.; Smallwood, R.; Walker, D.; Hoekstra, A.
2011-01-01
In-stent restenosis, the maladaptive response of a blood vessel to injury caused by the deployment of a stent, is a multiscale system involving a large number of biological and physical processes. We describe a Complex Automata model for in-stent restenosis, coupling bulk flow, drug diffusion, and s
Towards a Complex Automata multiscale model of in-stent restenosis
Caiazzo, A.; Evans, D.; Falcone, J.-L.; Hegewald, J.; Lorenz, E.; Stahl, B.; Wang, D.; Bernsdorf, J.; Chopard, B.; Gunn, J.; Hose, R.; Krafczyk, M.; Lawford, P.; Smallwood, R.; Walker, D.; Hoekstra, A.G.
2009-01-01
In-stent restenosis, the maladaptive response of a blood vessel to injury caused by the deployment of a stent, is a multiscale problem involving a large number of processes. We describe a Complex Automata Model for in-stent restenosis, coupling a bulk flow, drug diffusion, and smooth muscle cell mod
A study of a main-road cellular automata traffic flow model
Institute of Scientific and Technical Information of China (English)
黄乒花; 孔令江; 刘慕仁
2002-01-01
A main-road cellular automata traffic flow model on two dimensions is presented based on the Biham-Middleton-Levine traffic model. Its evolution equations are given and the self-organization and organization cooperation phenomenain this model are also studied by using computer simulation.
Asymptotic Nilpotency Implies Nilpotency in Cellular Automata on the d-Dimensional Full Shift
Salo, Ville
2012-01-01
We prove a conjecture in [3] by showing that cellular automata that eventually fix all cells to a fixed symbol 0 are nilpotent on S^{\\Z^d} for all d. We also briefly discuss nilpotency on other subshifts, and show that weak nilpotency implies nilpotency in all subshifts and all dimensions, since we do not know a published reference for this.
A linear process-algebraic format with data for probabilistic automata
Katoen, Joost-Pieter; Pol, van de Jaco; Stoelinga, Mariëlle; Timmer, Mark
2011-01-01
This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingredient is a symbolic transformation of probabilistic process algebra terms that incorporate data into this linear format while preserving strong probabilistic bisimulation. This generalises similar te
Oestrus Detection in Dairy Cows using Automata Modelling and Diagnosis Techniques
DEFF Research Database (Denmark)
Jónsson, Ragnar Ingi; Caponetti, Fabio; Blanke, Mogens
2009-01-01
This paper addresses detection of oestrus in dairy cows using automata-based modelling and diagnosis. Measuring lying/standing behaviour of the cows by a sensor attached to the cows hindleg, lying/standing behaviour is modelled as a stochastic automaton. The paper introduces a cow's lying-balance...
On the relationship between LTL normal forms and Büchi automata
DEFF Research Database (Denmark)
Li, Jianwen; Pu, Geguang; Zhang, Lijun
2013-01-01
In this paper, we revisit the problem of translating LTL formulas to Büchi automata. We first translate the given LTL formula into a special disjuctive-normal form (DNF). The formula will be part of the state, and its DNF normal form specifies the atomic properties that should hold immediately...
Cellular Automata as a learning process in Architecture and Urban design
DEFF Research Database (Denmark)
Jensen, Mads Brath; Foged, Isak Worre
2014-01-01
. An architectural methodological response to this situation is presented through the development of a conceptual computational design system that allows these dynamics to unfold and to be observed for architectural design decision taking. Reflecting on the development and implementation of a cellular automata based...
Finite automata, their algebras and grammars towards a theory of formal expressions
Büchi, J Richard
1989-01-01
The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Büchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and aga...
Perceptions of teaching and learning automata theory in a college-level computer science course
Weidmann, Phoebe Kay
This dissertation identifies and describes student and instructor perceptions that contribute to effective teaching and learning of Automata Theory in a competitive college-level Computer Science program. Effective teaching is the ability to create an appropriate learning environment in order to provide effective learning. We define effective learning as the ability of a student to meet instructor set learning objectives, demonstrating this by passing the course, while reporting a good learning experience. We conducted our investigation through a detailed qualitative case study of two sections (118 students) of Automata Theory (CS 341) at The University of Texas at Austin taught by Dr. Lily Quilt. Because Automata Theory has a fixed curriculum in the sense that many curricula and textbooks agree on what Automata Theory contains, differences being depth and amount of material to cover in a single course, a case study would allow for generalizable findings. Automata Theory is especially problematic in a Computer Science curriculum since students are not experienced in abstract thinking before taking this course, fail to understand the relevance of the theory, and prefer classes with more concrete activities such as programming. This creates a special challenge for any instructor of Automata Theory as motivation becomes critical for student learning. Through the use of student surveys, instructor interviews, classroom observation, material and course grade analysis we sought to understand what students perceived, what instructors expected of students, and how those perceptions played out in the classroom in terms of structure and instruction. Our goal was to create suggestions that would lead to a better designed course and thus a higher student success rate in Automata Theory. We created a unique theoretical basis, pedagogical positivism, on which to study college-level courses. Pedagogical positivism states that through examining instructor and student perceptions