We consider the out-of-equilibrium transport in TTover ¯-deformed (1+1)-dimension conformal field theories (CFTs). The theories admit two disparate approaches, integrability and holography, which we ...make full use of in order to compute the transport quantities, such as the exact nonequilibrium steady state currents. We find perfect agreements between the results obtained from these two methods, which serve as nontrivial checks of the TTover ¯-deformed holographic correspondence from the dynamical standpoint. It turns out that integrability also allows us to compute the momentum diffusion, which is given by a universal formula. We also remark on an intriguing connection between the TTover ¯-deformed CFTs and reversible cellular automata.
Various nonclassical approaches of distributed information processing, such as neural networks, reservoir computing (RC), vector symbolic architectures (VSAs), and others, employ the principle of ...collective-state computing. In this type of computing, the variables relevant in computation are superimposed into a single high-dimensional state vector, the collective state. The variable encoding uses a fixed set of random patterns, which has to be stored and kept available during the computation. In this article, we show that an elementary cellular automaton with rule 90 (CA90) enables the space-time tradeoff for collective-state computing models that use random dense binary representations, i.e., memory requirements can be traded off with computation running CA90. We investigate the randomization behavior of CA90, in particular, the relation between the length of the randomization period and the size of the grid, and how CA90 preserves similarity in the presence of the initialization noise. Based on these analyses, we discuss how to optimize a collective-state computing model, in which CA90 expands representations on the fly from short seed patterns-rather than storing the full set of random patterns. The CA90 expansion is applied and tested in concrete scenarios using RC and VSAs. Our experimental results show that collective-state computing with CA90 expansion performs similarly compared to traditional collective-state models, in which random patterns are generated initially by a pseudorandom number generator and then stored in a large memory.
Higher-order cellular automata (HOCA) are a variant of cellular automata (CA) used in many applications (ranging, for instance, from the design of secret sharing schemes to data compression and image ...processing), and in which the global state of the system at time t depends not only on the state at time t−1, as in the original model, but also on the states at time t−2, …,t−n, where n is the memory size of the HOCA. We provide decidable characterizations of two important dynamical properties, namely, sensitivity to the initial conditions and equicontinuity, for linear HOCA over the alphabet Zm. These characterizations have an impact in applications since the involved linear HOCA are usually required to exhibit a chaotic or stable behaviour. Moreover, they extend the ones shown in 28 for linear CA (LCA) over the alphabet Zmn in the case n=1. We also show that linear HOCA of memory size n over Zm form a class that is indistinguishable from a specific subclass of LCA over Zmn. This enables to decide injectivity and surjectivity for linear HOCA of memory size n over Zm using the decidable characterization provided in 2 and 25 for injectivity and surjectivity of LCA over Zmn. Finally, we prove an equivalence between LCA over Zmn and an important class of non-uniform CA, another variant of CA used in many applications.
The work describes the scenario of conflict interactions in information system and intruder security using the formalism of hybrid automata. Analysis of probability of winning on both sides in the ...conflict. The possibility of abstraction from a concrete kind of density distributions for the time the parties to the conflict in their possible States. Based on the destructive effects of information distribution models in information system shows the mutual influence of the spread of the destructive processes information on process state changes subjects information system. With this approach, based on a view of information system in the form of a two-dimensional cellular automaton. The results of experimental research of confirming the theoretical conclusions.
We investigate the application of quantum cellular automata in image encryption and propose a novel quantum gray-scale image encryption algorithm based on one-dimensional quantum cellular automata. ...The quantum image encryption algorithm can be realized by subtly constructing the evolution rules of one-dimensional quantum cellular automata. Because all quantum operations are invertible, the quantum image decryption algorithm is the inverse of the encryption algorithm. The proposed quantum image encryption algorithm has an algorithm complexity of Θ(n), lower than the algorithm complexity, Θ(n2) of existing quantum image encryption schemes based on quantum Fourier transform. Supported by detailed numerical simulation and theoretical analysis, our proposal has outperformed its classical counterpart and other image encryption schemes in terms of the security, computational complexity, and robustness. And it also provides a clue of introducing quantum cellular automata into image encryption.
The conjunction of approximate computing and emerging nanotechnology could lead to very powerful and energy efficient integrated infrastructures in the near future. Research in this field is already ...very active and promising. In this brief, we present the design of approximate binary adders that very effectively exploit the inherent logic and physical behaviors of the Quantum-dot Cellular Automata technology. With respect to state-of-the-art competitors, the 16-bit architecture, designed as proposed here, exhibits an energy-delay-product and an area occupancy up to ~9 and ~3.7 times lower, respectively, with an accuracy more than 10 times higher.
Cellular automata are a famous model of computation, yet it is still a challenging task to assess the computational capacity of a given automaton; especially when it comes to showing negative ...results. In this paper, we focus on studying this problem via the notion of CA intrinsic simulation. We say that automaton A is simulated by B if each space-time diagram of A can be, after suitable transformations, reproduced by B.
We study affine automata – i.e., automata whose local rules are affine mappings of vector spaces. This broad class contains the well-studied cases of linear automata. The main result of this paper shows that (almost) every automaton affine over a finite field Fp can only simulate affine automata over Fp. We discuss how this general result implies, and widely surpasses, limitations of linear and additive automata previously proved in the literature.
We provide a formalization of the simulation notions into algebraic language and discuss how this opens a new path to showing negative results about the computational power of cellular automata using deeper algebraic theorems.
Traditional 3D image steganography is cumbersome and difficult owing to the special structure of 3D image, imposing a practical limit for its applications. Herein, we propose a 3D image steganography ...scheme utilizing cellular automata transformation (CAT). By using CAT with various rule numbers to hide images, the weakness of previous algorithms with only one transformation plane is overcome, and the hidden image quality can be improved by reducing energy loss. In the 3D reconstruction process, we apply a depth estimation algorithm based on a convolutional network to obtain corresponding depth maps from a single RGB image, simplifying the elemental image array (EIA) pickup process and even overcoming the phase difference problem caused by the traditional optical pickup process using lens arrays. Before hiding, we use the maximum length cellular automata (MLCA) to encrypt a single RGB image instead of encrypting EIA images with huge data, which greatly reduces the complexity of the encryption algorithm and improves efficiency. Finally, we reconstruct the decrypted image optically and obtain a full color and full parallax 3D image through the display device.
•The quality of hidden images is improved by CAT-based hiding schemes.•The process of EIA pickup is simplified through the depth network.•The complexity of the encryption algorithm is reduced by encrypting the single RGB image.
![TT[over ¯]-Deformed Conform...](http://api.summon.serialssolutions.com/2.0.0/image/issn/XR4PS5YY4K/0031-9007/small "TT[over ¯]-Deformed Conformal Field Theories out of Equilibrium")
PDF
