Asynchronous cellular learning automata

Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in different cells are activated synchronously, has found many applications. In some applications a type of cellular learning automata in which learning automata in different cells are activated asynchronously (asynchronous cellular learning automata) is needed. In this paper, we introduce asynchronous cellular learning automata and study its steady state behavior. Then an application of this new model to cellular networks has been presented.     

MapInfo中元胞自动机集成开发方案及其应用

元胞自动机与地理信息系统(GIS)的集成弥补了GIS在时空分析和时空演化方面的不足,为地理学的研究提供了新的手段。论文用实例论述了MapInfo中元胞自动机的集成开发方案。讲述了元胞自动机的原理及与GIS集成的优点和具体技术,并就二值型(城市扩张演化型)元胞自动机的应用做了示范。     

Sand automata as cellular automata

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 cellular automata which are sand automata, and study some dynamical behaviors such as equicontinuity. Furthermore, we deal with simple sand automata. We show that the classical definition of nilpotency is not meaningful for sand automata. Then, we introduce the suitable new notion of flattening sand automata. Finally, we prove that this simple dynamical behavior is undecidable.     

Structure and reversibility of 2D hexagonal cellular automata

Cellular automata are used to model dynamical phenomena by focusing on their local behavior which depends on the neighboring cells in order to express their global behavior. The geometrical structure of the models suggests the algebraic structure of cellular automata. After modeling the dynamical phenomena, it is sometimes an important problem to be able to move backwards in order to understand it better. This is only possible if cellular automata is reversible. In this paper, 2D finite cellular automata defined by local rules based on hexagonal cell structure are studied. Rule matrix of the hexagonal finite cellular automaton is obtained. The rank of rule matrices representing the 2D hexagonal finite cellular automata via an algorithm is computed. It is a well known fact that determining the reversibility of a 2D cellular automata is a very difficult problem in general. Here, the reversibility problem of this family of 2D hexagonal cellular automata is also resolved completely.     

Garden of eden configurations for 2-D cellular automata with rule 2460 N

An important problem in cellular automata theory is the reversibility of a cellular automaton which is related to the existence of Garden of Eden configurations in cellular automata. In this paper, we study new local rules for two-dimensional cellular automata over the ternary field Z₃ (the set of integers modulo three) with some of their important characteristics. We obtain necessary and sufficient conditions for the existence of Garden of Eden configurations for two-dimensional ternary cellular automata. Also by making use of the matrix representation of two-dimensional cellular automata, we provide an algorithm to obtain the number of Garden of Eden configurations for two-dimensional cellular automata defined by rule 2460 N. We present an application of the reversible two-dimensional ternary cellular automata to cryptography.     

A “lifegame” approach to surface modeling and rendering

Conway's Lifegame is a trivial and wellknown application of a more general theory called the theory of cellular automata. Complex systems modeling may be based on the theory of cellular automata, originated by John von Neumann. Our approach is to define simple components that we call analog automata. An analog automaton is a finite state automaton where the state is defined in terms of real numbers representing physical quantities such a position, velocity, mass or color. Deterministic state transition function are applied to these automata using information from the state of neighboring automata. In our case, successive generations in the evolution of these cellular automata are mapped onto polygonal meshes in order to build and texture arbitrary surfaces.     

分类回归树多吸引子细胞自动机分类方法及过拟合研究

基于多吸引子细胞自动机的分类方法多是二分类算法,难以克服过度拟合问题,在生成多吸引子细胞自动机时如何有效地处理多分类及过度拟合问题还缺乏可行的方法.从细胞空间角度对模式空间进行分割是一种均匀分割,难以适应空间非均匀分割的需要.将CART算法同多吸引子细胞自动机相结合构造树型结构的分类器,以解决空间的非均匀分割及过度拟合问题,并基于粒子群优化方法提出树节点的最优多吸引子细胞自动机特征矩阵的构造方法.基于该方法构造的多吸引子细胞自动机分类器能够以较少的伪穷举域比特数获得好的分类性能,减少了分类器中的空盆数量,在保证分类正确率的同时改善了过拟合问题,缩短了分类时间.实验分析证明了所提出方法的可行性和有效性.     

Alternation on cellular automata

In this paper we consider several notions of alternation in cellular automata: non-uniform, uniform and weak alternation. We study relations among these notions and with alternating Turing machines. It is proved that the languages accepted in polynomial time by alternating Turing machines are those accepted by alternating cellular automata in polynomial time for all the proposed alternating cellular automata. In particular, this is true for the weak model where the difference between existential and universal states is omitted for all the cells except the first one. It is proved that real time alternation in cellular automata is strictly more powerful than real time alternation in Turing machines, with only one read-write tape. Moreover, it is shown that in linear time uniform and weak models agree.     

On real-time cellular automata and trellis automata

Summary It is shown that f(n)-time one-way cellular automata are equivalent to f(n)-time trellis automata, the real-time one-way cellular automata languages are closed under reversal, the 2n-time one-way cellular automata are equivalent to real-time cellular automata and the latter are strictly more powerful than the real-time one-way cellular automata.This work has been done during the second author's visit at the University of Paris and during both authors' visit at the Institute für Informationsverarbeitung Graz, Austria     

Digital image scrambling based on elementary cellular automata

Image scrambling is the process of converting an image to an unintelligible format, mainly for security reasons. The scrambling is considered as a pre-process or a post-process of security related applications such as watermarking, information hiding, fingerprinting, and encryption. Cellular automata are parallel models of computation that prove an interesting concept where a simple configuration can lead to a complex behavior. Since there are a lot of parameters to configure, cellular automata have many types and these types differ in terms of complexity and behavior. Cellular automata were previously used in scrambling different types of multimedia, but only complex two-dimensional automata were explored. We propose a scheme where the simplest type of cellular automata is used that is the elementary type. We test the scrambling degree for different cellular automata rules that belong to classes three and four of Wolfram’s classification which correspond to complex and chaotic behavior; we also check the effect of other parameters such as the number of generations and the boundary condition. Experimental results show that our proposed scheme outperforms other schemes based on cellular automata in terms of scrambling degree.     

On the computational power of totalistic cellular automata

Totalistic cellular automata, introduced by S. Wolfram, are cellular automata in which the state transition function depends only on the sum of the states in a cell's neighborhood. Each state is considered as a nonnegative integer and the sum includes the cell's own state. It is shown that one-dimensional totalistic cellular automata can simulate an arbitrary Turing machine in linear time, even when the neighborhood is restricted to one cell on each side. This result settles Wolfram's conjecture that totalistic cellular automata are computation-universal.Research performed while visiting the Department of Computer Science, University of Cincinnati, 1984/85.     

CEPROL: A cellular programming language

Realized cellular automata may be operated by universal computer systems as programmable special-purpose processors for parallelizable problems. Because of their architecture (local neighbourhood, small storage size per cell, they are well suited for processing systolic algorithms. A cellular programming language — named CEPROL — is presented which offers means for programming and controlling cellular automata processing such algorithms.     

耦合双触发元胞自动机的加密技术研究

针对单向触发元胞自动机加密中误差传播的相似性问题,以及双向触发元胞自动机中密钥空间小的问题,提出了耦合双触发元胞自动机的加密技术,通过相互作用、相互影响的元胞自动机系统之间的共同演化,反向迭代完成数据加密,正向演化完成数据解密,达到解决密文相似性问题以及增加密钥的目的.分析结果表明,该算法可以抵抗蛮力攻击和已知明文、已知密文以及差分分析攻击,具有较高的安全性和很强的实用性.     

基于多耦合元胞自动机的加密算法

提出了耦合系数的概念,构造了一个新的耦合元胞自动机模型,并分析了耦合系数对耦合元胞自动机时空演化的影响。针对已有的单耦合元胞自动机加密系统中存在的不足,提出了基于多耦合元胞自动机的加密算法,该算法将多个元胞进行耦合,增强了两个元胞自动机之间的作用,扩大了相互影响的范围,使得误差扩散更为快速。仿真结果表明,该算法具有更为理想的扩散和扰乱特性,可抵抗蛮力攻击和差分分析攻击。     

Self-assembling modular robotic structures

Cellular automata in the two-dimensional (2-D) world have been used to simulate self-replicating structures based on natural biological systems, evolution, and emergence. In self-replication, large structures consisting of multiple cells are programmed to make copies of themselves using the rule-based systems upon which the cellular automata are governed. Although cellular automata environments are computer-based tools for representing complex systems within a virtual world, the field of modular robotics partly came about as an attempt to create self-relocatable cuboids that could function as cellular automata in the three-dimensional (3-D) real world to create physical self-replicating systems. The application of cellular automata to 3-D real-world applications has resulted in lattice-type modular robotic systems. Lattice systems are cubical in nature, where each cube is a self-mobile unit that can move orthogonally to a vacant position by sliding along existing portions of structure. These lattice-type modular robotics systems have been used to study self-reconfigurability in the real world with autonomous elements.     

Simulation of dynamic phenomena by cellular automata

This paper is aimed at showing how cellular automata can be conveniently employed to simulate dynamic phenomena, typically involving transportation, diffusion, or propagation problems. A cellular automaton can be viewed as made of two parts: a computational engine based on a proper discretization of the domain and charged with correctness and consistency controls, and a dynamic model constituted by transition functions that express cell behaviour. The adoption of cellular automata introduces a new means of spatial data modelling, in addition to those traditionally provided by GIS packages, resulting in the possibility of storing elements of dynamic knowledge in cellular maps: each cell is provided with the attributes that constitute its state, and groups of cells with the functions that describe their mutual interaction. The basic characteristics of cellular automata are discussed with reference to a significant application case, the study of tide propagation over a lagoon.     

Audio scrambling technique based on cellular automata

Scrambling is a process that has proved to be very effective in increasing the quality of data hiding, watermarking, and encryption applications. Cellular automata are used in diverse and numerous applications because of their ability to obtain complex global behavior from simple and localized rules. In this paper we apply cellular automata in the field of audio scrambling because of the potential it holds in breaking the correlation between audio samples effectively. We also analyze the effect of using different cellular automata types on audio scrambling and we test different cellular automata rules with different Lambda values. The scrambling degree is measured and the relation between the robustness and the scrambling degree obtained is studied. Experimental results show that the proposed technique is robust to data loss attack where 1/3 of the data is lost and that the algorithm can be applied to music and speech files of different sizes.     

元胞自动机在"数字油田"中的应用

“数字油田”要设计一个涵盖油田全部业务活动的综合信息系统指导性框架,当作今后油田信息化建设的指南。它作为一个复杂的开放系统,适于使用元胞自动机模型来进行研究。介绍了元胞自动机的产生与原理,作为复杂性研究的新途径,探讨了元胞自动机在“数字油田”中的应用并做了复杂性分析。     

元胞自动机可逆性研究

元胞自动机是对复杂适应系统建模的重要理论工具。可逆性是元胞自动机的一个重要属性,是模拟物理可逆空间的必要条件。本文介绍元胞自动机的基本概念、可逆性和可计算性,并介绍一维可逆元胞自动机可计算的证明思路。