246 research outputs found
Cryptography using Automata Theory
Encryption and decryption are the two most crucial components of cryptography. Data protection is the main objective of both systems. We utilised encryption to transform plain text into ciphertext. Decryption, which works the other way around from encryption, is the process of converting encrypted text back into plain text. By using a finite state machine and the LU decomposition method, the created encryption solution ensures data secrecy for safe communication. In our suggested approach, we additionally employ lower and upper triangular matrices, which are obtained by decomposing a square matrix. During encryption, the key will be a lower triangular matrix modulated by a prime number, and during decryption, an upper triangular matrix modulated by a prime number. The tactic is beneficial. This tactic is helpful in sectors such as finance and military services where confidential material must be delivered
Cellular Automata
Modelling and simulation are disciplines of major importance for science and engineering. There is no science without models, and simulation has nowadays become a very useful tool, sometimes unavoidable, for development of both science and engineering. The main attractive feature of cellular automata is that, in spite of their conceptual simplicity which allows an easiness of implementation for computer simulation, as a detailed and complete mathematical analysis in principle, they are able to exhibit a wide variety of amazingly complex behaviour. This feature of cellular automata has attracted the researchers' attention from a wide variety of divergent fields of the exact disciplines of science and engineering, but also of the social sciences, and sometimes beyond. The collective complex behaviour of numerous systems, which emerge from the interaction of a multitude of simple individuals, is being conveniently modelled and simulated with cellular automata for very different purposes. In this book, a number of innovative applications of cellular automata models in the fields of Quantum Computing, Materials Science, Cryptography and Coding, and Robotics and Image Processing are presented
An information-theoretic approach to self-organisation: Emergence of complex interdependencies in coupled dynamical systems
Self-organisation lies at the core of fundamental but still unresolved scientific questions, and holds the promise of de-centralised paradigms crucial for future technological developments. While self-organising processes have been traditionally explained by the tendency of dynamical systems to evolve towards specific configurations, or attractors, we see self-organisation as a consequence of the interdependencies that those attractors induce. Building on this intuition, in this work we develop a theoretical framework for understanding and quantifying self-organisation based on coupled dynamical systems and multivariate information theory. We propose a metric of global structural strength that identifies when self-organisation appears, and a multi-layered decomposition that explains the emergent structure in terms of redundant and synergistic interdependencies. We illustrate our framework on elementary cellular automata, showing how it can detect and characterise the emergence of complex structures
Reversible Computation: Extending Horizons of Computing
This open access State-of-the-Art Survey presents the main recent scientific outcomes in the area of reversible computation, focusing on those that have emerged during COST Action IC1405 "Reversible Computation - Extending Horizons of Computing", a European research network that operated from May 2015 to April 2019. Reversible computation is a new paradigm that extends the traditional forwards-only mode of computation with the ability to execute in reverse, so that computation can run backwards as easily and naturally as forwards. It aims to deliver novel computing devices and software, and to enhance existing systems by equipping them with reversibility. There are many potential applications of reversible computation, including languages and software tools for reliable and recovery-oriented distributed systems and revolutionary reversible logic gates and circuits, but they can only be realized and have lasting effect if conceptual and firm theoretical foundations are established first
Reversible Computation: Extending Horizons of Computing
This open access State-of-the-Art Survey presents the main recent scientific outcomes in the area of reversible computation, focusing on those that have emerged during COST Action IC1405 "Reversible Computation - Extending Horizons of Computing", a European research network that operated from May 2015 to April 2019. Reversible computation is a new paradigm that extends the traditional forwards-only mode of computation with the ability to execute in reverse, so that computation can run backwards as easily and naturally as forwards. It aims to deliver novel computing devices and software, and to enhance existing systems by equipping them with reversibility. There are many potential applications of reversible computation, including languages and software tools for reliable and recovery-oriented distributed systems and revolutionary reversible logic gates and circuits, but they can only be realized and have lasting effect if conceptual and firm theoretical foundations are established first
Cellular Automata Models of Road Traffic
In this paper, we give an elaborate and understandable review of traffic
cellular automata (TCA) models, which are a class of computationally efficient
microscopic traffic flow models. TCA models arise from the physics discipline
of statistical mechanics, having the goal of reproducing the correct
macroscopic behaviour based on a minimal description of microscopic
interactions. After giving an overview of cellular automata (CA) models, their
background and physical setup, we introduce the mathematical notations, show
how to perform measurements on a TCA model's lattice of cells, as well as how
to convert these quantities into real-world units and vice versa. The majority
of this paper then relays an extensive account of the behavioural aspects of
several TCA models encountered in literature. Already, several reviews of TCA
models exist, but none of them consider all the models exclusively from the
behavioural point of view. In this respect, our overview fills this void, as it
focusses on the behaviour of the TCA models, by means of time-space and
phase-space diagrams, and histograms showing the distributions of vehicles'
speeds, space, and time gaps. In the report, we subsequently give a concise
overview of TCA models that are employed in a multi-lane setting, and some of
the TCA models used to describe city traffic as a two-dimensional grid of
cells, or as a road network with explicitly modelled intersections. The final
part of the paper illustrates some of the more common analytical approximations
to single-cell TCA models.Comment: Accepted for publication in "Physics Reports". A version of this
paper with high-quality images can be found at: http://phdsven.dyns.cx (go to
"Papers written"
Bits from Biology for Computational Intelligence
Computational intelligence is broadly defined as biologically-inspired
computing. Usually, inspiration is drawn from neural systems. This article
shows how to analyze neural systems using information theory to obtain
constraints that help identify the algorithms run by such systems and the
information they represent. Algorithms and representations identified
information-theoretically may then guide the design of biologically inspired
computing systems (BICS). The material covered includes the necessary
introduction to information theory and the estimation of information theoretic
quantities from neural data. We then show how to analyze the information
encoded in a system about its environment, and also discuss recent
methodological developments on the question of how much information each agent
carries about the environment either uniquely, or redundantly or
synergistically together with others. Last, we introduce the framework of local
information dynamics, where information processing is decomposed into component
processes of information storage, transfer, and modification -- locally in
space and time. We close by discussing example applications of these measures
to neural data and other complex systems
Complex systems dynamics in laser excited ensembles of Rydberg atoms
In this thesis I present experimental and theoretical results showing that an ultracold gas under laser excitation to Rydberg states offers a controllable platform for studying the interesting complex dynamics that can emerge in driven-dissipative systems. The findings can be summarized according to the following three main insights: (i) The discovery of self-organized criticality (SOC) in our Rydberg system under facilitated excitation via three signatures: self-organization of the density to a stationary state; scale invariant behavior; and a critical response in terms of power-law distributed excitation avalanches. Additionally, we explore a mechanism inherent to our system which stabilizes the SOC state. We further investigate this stabilization via a controlled, variable driving of the system. These analyses can help answer the question of why scale invariant behavior is so prevalent in nature. (ii) A striking connection between the power-law growth of the Rydberg excitation number and epidemic spreading is found. Based on this, an epidemic network model is devised which efficiently describes the collective excitation dynamics. The importance of heterogeneity in the emergent Rydberg network and associated Griffiths effects provide a way to explain the observation of non-universal power laws. (iii) A novel quantum cellular automata implementation is proposed using atomic arrays together with multifrequency laser fields. This provides a natural framework to study the relation between microscopic processes and global dynamics, where special rules are found to generate entangled states with applications in quantum metrology and computing
- …