初等元胞自动机的界面设计及稳定性分析

建立了所有规则下的初等元胞自动机的可视化模型及界面,设计了用于判断初等元胞自动机稳定性的应用程序,并可直接计算得到演化类型及周期.在此基础上,模拟得到了不同元胞数m,随机产生的不同的初始状态,不同规则数R以及各种边界条件下初等元胞自动机的演化结果,并分析了以上因素对稳定性的影响.结果表明:元胞数m,初始状态,规则数R以及边界条件,均对初等元胞自动机的演化类型,演化周期产生较大影响.充分反映了元胞自动机的复杂性.模型从模拟的角度出发,为元胞自动机的复杂性研究提供了一个简单的、可视的计算机仿真工具,并可为复杂的理论推导提供参考或验证.     

基于元胞自动机的交通流计算机模拟

元胞自动机是把复杂系统量化为简单的个体,在元胞自动机模型中.空间、时间都被离散化,每一个相互作用的单元仅为有限的状态.以元胞自动机理论为基础,把车辆在路段上交通流中运动的变化规律表述为元胞自动机的演化规则,建立了基于元胞自动机理论的交通流模拟模型,标定了元胞长度和最大速度等参数,分析了元胞变换的原则;详细探讨了元胞自动机在道路交通模拟中的应用,设计出了交通元胞自动机的结构,分析了交通元胞自动机所采取的状态变换原则,建立了一维(单车道)交通流模拟模型;并利用C语言编程实现模拟.模拟结果符合实际交通流的特点.     

基于Matlab的元胞自动机的仿真设计

元胞自动机不仅是理论计算机科学领域的一个重要的计算模型 ,而且可视为一无限维的离散动力系统 ,被广泛应用于自然科学和社会科学各领域的复杂性的研究中 ,是一个重要的研究方法和工具。该文以Matlab为开发工具 ,开发了元胞自动机的可视模型 ,为其在各个领域的复杂性研究提供了一个简易、可行的计算机仿真工具。     

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

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

交通元胞自动机计算机模拟模型的研究

主要介绍了元胞自动机的基本理论,分析了元胞变换的原则;详细探讨了元胞自动机在道路交通模拟中的应用,设计出了交通元胞自动机的结构,分析了交通元胞自动机所采取的状态变换原则,建立了一维（单车道）交通流模拟模型;论述了元胞自动机的发展及在道路交通模拟中的研究前景。     

基于摩尔奇偶型的元胞自动机演化模型

由于元胞自动机的理论基础较为薄弱,对元胞自动机的演化规则的研究和分析是个倍受关注的挑战问题.在奇偶元胞自动机的基础上,提出了一种摩尔奇偶型的元胞自动机演化模型,通过大量的计算机仿真实验,证实PCA与MPCA在演化过程中均具有一定的演化基元、演化框架和演化周期规律.提供了研究元胞自动机演化规则的新思路,并进一步将提出的演...     

基于CA的离散粒子系统仿真和显示研究

综合考虑计算的效率,根据真实存在的离散粒子系统的特点,进行元胞自动机模型的建立和规则设计,并以一个三维螺旋空间为例进行仿真和分析。实例表明,该方法在三维复杂空间中运行,元胞自动机模型能定性地体现粒子之间的碰撞和摩擦现象。该方法可以用于动态显示三维离散粒子系统的演化过程,计算效率优于传统的离散单元法.     

求解非线性方程组的元胞自动机方法及其全局收敛性证明

为了求得非线性方程组所有精确解,根据元胞自动机的特点构造了求解非线性方程组的全局收敛算法。在该算法中,将非线性方程组解的理论搜索空间划分为离散搜索空间,将离散搜索空间定义为元胞空间;离散搜索空间的每个点就是一个元胞,而一个元胞对应着非线性方程组的一个试探解;元胞的状态由其空间位置及位置修正量构成。将元胞空间划分为若干个非空子集,所有元胞的状态从一个非空子集转移到另一个非空子集的状态演化过程实现了元胞空间对理论搜索空间的搜索。在元胞状态演化过程中,元胞从一个状态转移到另一个状态的状态转移概率可以计算出来;元胞演化过程中的每个状态对应于有限Markov链上的一个状态。利用可归约随机矩阵的稳定性条件证明了该算法具有全局收敛性。仿真实例表明该算法是高效的。     

基于元胞自动机的软件架构设计

探讨元胞自动机思想在软件架构设计领域内的应用。通过元胞抽象(Form、Controls、Operate、Process、Verify)和规则定义(显示加载规则、交互调用规则、提交卸载规则),构造出离散的可循环迭代的平行运算体系,实现普适各类业务的通用的软件架构设计。     

元胞遗传算法演化规则的研究*

在Conway提出的“生命游戏”规则的基础上,为提高生命繁殖和生存的概率,通过改变周围邻居元胞的状态提出一种改进的演化规则。实验证明,结合元胞自动机的遗传算法,加入改进的演化规则后,用于求解复杂多峰函数优化问题获得了较好的效果。     

Some results about the chaotic behavior of cellular automata

We study the behavior of cellular automata (CA for short) in the Cantor, Besicovitch and Weyl topologies. We solve an open problem about the existence of transitive CA in the Besicovitch topology. The proof of this result has some interest of its own since it is obtained by using Kolmogorov complexity. To our knowledge it is the first result about discrete dynamical systems obtained using Kolmogorov complexity. We also prove that in the Besicovitch topology every CA has either a unique periodic point (thus a fixed point) or an uncountable set of periodic points. This result underlines the fact that CA have a great degree of stability; it may be considered a further step towards the understanding of CA periodic behavior.Moreover, we prove that in the Besicovitch topology there is a special set of configurations, the set of Toeplitz configurations, that plays a role similar to that of spatially periodic configurations in the Cantor topology, that is, it is dense and has a central role in the study of surjectivity and injectivity. Finally, it is shown that the set of spatially quasi-periodic configurations is not dense in the Weyl topology.     

Developing an artificial retina by evolutionary cellular automata and self-organizing neural networks

Retinas are very important for human beings to get information about their environment. In this paper, we propose a new method to build artificial retinas which have many features similar to real ones. We use evolutionary cellular automata to extract some basic characteristics of objects, and use self-organizing neural networks to distinguish different objects. The results indicate a way to get computer vision by artificial life. This work was presented, in part, at the Third International Symposium on Artificial Life and Robotics, Oita, Japan, Janaury 19–21, 1998     

移动元胞自动机的个体化网络舆情聚类模型与仿真

为了研究舆情个体的个性对现实环境下网络舆情传播和演化的影响以及舆情个体“类聚”现象,采用元胞自动机理论的建模方法,将一定网格空间的个体抽象为带有情感倾向度的元胞,设定离散值的意见倾向度。此外,定义元胞的个体特性：坚定性权重[βij],个体影响权重[λij]。为了模拟舆情个体可以通过不同途径参与舆情事件,定义了一种新的移动规则,在边界周期条件下的元胞空间,实现了每个元胞与空间内的所有元胞的信息交流。实验结果表明：舆情演化到最后会呈现稳定状态,舆情个体的不同个性会影响稳态收敛的速度快慢;当个体特性取中间值时,系统最有可能出现意见群体意见归一现象。     

Evolutionary automata—comparison of automaton behavior and Restle's learning model

It is an interesting problem, in order to gain a better understanding of human behavior, to find mechanisms that have the same learning ability as living things. Many learning machines have been proposed. Such mechanisms, however, increase their adaptive ability by following a fixed and quantitative routine, whereas variable and qualitative processes often play an important part in nature. In this paper, we propose automata which are dominated by variable and qualitative processes, and these automata are called evolutionary automata. Moreover, through the comparison of their behavior with that of a psychological model proposed by Restle, it is shown that the evolutionary automata provide a suitable model of human learning.     

广义人工生命的科学基础(I):工程技术基础

根据广义人工生命研究的特点,作者把系统论、控制论、信息论、人工智能、元胞自动机、L-系统、遗传算法、进化策略、进化规划、耗散结构理论、协同学、突变论、混沌、分形、转基因技术、克隆技术等的研究成果视为人工生命研究的主要科学基础。文章力求对元胞自动机、L-系统、遗传算法、进化策略、进化规划、耗散结构理论、协同学、突变论、混沌、分形和它们与人工生命的关系做系统而扼要的评述,为人工生命研究提供方便。     

细胞自动机置换群加密技术研究

1.引言信息技术的发展对信息安全提出了更高的要求,并使得作为信息安全核心的加密技术及其实现变得越来越复杂。所以,人们开始探索简化加密系统实现的新方法,以满足现代信息技术发展对全方位多层次信息安全的要求。1948年,Von Neumann在研究具有自组织特性的系统时引入了细胞自动机的概念,后经S.Wolfram对其结构进行简化,从而极大地推动了细胞自动机理论及其应用的发展。细胞自动机具有组成单元的简单性、单元之间作用的局部性和信息处理的高度     

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.     

Stochastic automated search methods in cellular automata: the discovery of tens of thousands of glider guns

This paper deals with the spontaneous emergence of glider guns in cellular automata. An evolutionary search for glider guns with different parameters is described and other search techniques are also presented to provide a benchmark. We demonstrate the spontaneous emergence of an important number of novel glider guns discovered by an evolutionary algorithm. An automatic process to identify guns leads to a classification of glider guns that takes into account the number of emitted gliders of a specific type. We also show it is possible to discover guns for many other types of gliders. Significantly, all the found automata can be candidate to an automatic search for collision-based universal cellular automata simulating Turing machines in their space-time dynamics using gliders and glider guns.