Construction of living cellular automata using the Physarum plasmodium

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.     

基于GPU的元胞自动机熔岩流动模拟

为解决基于元胞自动机进行熔岩流动模拟的计算效率问题,提出一种应用在元胞自动机上的GPU并行计算方法。将元胞自动机中每一个方形网格映射到GPU的一个逻辑计算单元上,通过并行计算,提高模拟的效率,解决传统串行计算方法的不足,使模拟达到实时性。模拟结果表明,在元胞自动机的物理模型理论基础上,用GPU并行计算进行加速,在模拟效果和时间效率上均取得了良好的效果。     

Fault tolerance in cellular automata at high fault rates

A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply remembering a bit in the presence of faults, and that is the case we treat in this paper. We are concerned with the degree (the number of neighboring cells on which the state transition function depends) needed to achieve fault tolerance when the fault rate is high (nearly 1/2). We consider both the traditional transient fault model (where faults occur independently in time and space) and a recently introduced combined fault model which also includes manufacturing faults (which occur independently in space, but which affect cells for all time). We also consider both a purely probabilistic fault model (in which the states of cells are perturbed at exactly the fault rate) and an adversarial model (in which the occurrence of a fault gives control of the state to an omniscient adversary). We show that there are cellular automata that can tolerate a fault rate 1/2−ξ (with ξ>0) with degree O((1/ξ²)log(1/ξ)), even with adversarial combined faults. The simplest such automata are based on infinite regular trees, but our results also apply to other structures (such as hyperbolic tessellations) that contain infinite regular trees. We also obtain a lower bound of Ω(1/ξ²), even with only purely probabilistic transient faults.     

Interference automata

We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate the increase in power, in terms of language recognition, of a classical Deterministic Finite Automaton (DFA) when endowed with the facility of interference. The question is in the spirit of Two-Way Finite Automata With Quantum and Classical States (2QCFA) [A. Ambainis, J. Watrous, Two-way finite automata with quantum and classical states, Theoret. Comput. Sci. 287 (1) (2002) 299–311] wherein the classical DFA is augmented with a quantum component of constant size. We test the power of 2OIA against the languages mentioned in the above paper. We give efficient 2OIA algorithms to recognize languages for which 2QCFA machines have been shown to exist, as well as languages whose status vis-a-vis 2QCFA has been posed as open questions. Having a DFA as a component, it trivially recognizes regular languages. We show that our model can recognize all languages recognized by 1-way deterministic blind counter automata. Finally we show the existence of a language that cannot be recognized by a 2OIA but which can be recognized by an O(n³)$O\left(n^3\right)$ space Turing machine.     

Optimal infinite scheduling for multi-priced timed automata

This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features. A precise definition is then given of what constitutes optimal infinite behaviours for this class of models. We subsequently show that the derivation of optimal non-terminating schedules for such double-priced timed automata is computable. This is done by a reduction of the problem to the determination of optimal mean-cycles in finite graphs with weighted edges. This reduction is obtained by introducing the so-called corner-point abstraction, a powerful abstraction technique of which we show that it preserves optimal schedules. This work has been mostly done while visiting CISS at Aalborg University in Denmark and has been supported by CISS and by ACI Cortos, a program of the French Ministry of Research.     

采用动态邻域扩展算法的非一致CA低功耗确定TPG

针对确定内建自测试向量发生器设计中常存在着对冗余向量依赖,导致测试应用时间增长,并产生额外的测试功耗等问题,提出一种新的低功耗确定测试向量发生器的综合算法.该向量发生器采用非一致细胞自动机的结构实现,利用基于模拟退火的动态邻域扩展算法寻找优化的细胞自动机的拓扑连接关系.对标准组合电路仿真实验的结果表明,所综合出的向量发生器可有效地产生给定的低功耗确定向量集,并且不影响原有的故障覆盖率和测试时间.     

基于无秩树自动机的信息抽取技术研究

针对目前基于网页结构的信息抽取方法的缺陷,提出了一种基于无秩树自动机的信息抽取技术,其核心思想是通过将结构化(半结构化)文档转换成无秩树,然后利用(k,l)-contextual树构造样本自动机,依据树自动机接收和拒绝状态来对网页进行数据的抽取.该方法充分利用结构,依托树自动机将传统的以单一结构途径的信息抽取方法与文法推理原则相结合,得到信息抽取规则.实验结果表明,该方法与同类抽取方法相比在准确率、召回率以及抽取所需时间上均有所提高.     

Active XML文档安全重写判定算法

研究了AXML文档安全重写判定问题,即判定给定AXML文档通过触发其包含的服务调用生成的文档集合是否能够全部重写为符合目标模式的文档实例.基于树自动机理论,定义了用于抽象AXML文档的树自动机--ATA机(AXML treeautomata),ATA机等价于给定AXML文档通过触发其包含的服务调用所能生成的文档集合.基于ATA机,提出一个AXML文档安全重写判定算法,表明了该算法的正确性及有效性.     

基于元胞自动机的股票价格宏观变化的研究

为了研究股票价格在宏观上的变化趋势以及产生这些变化的主要因素.提出了一种新的基于元胞自动机的模型分析股票价格宏观变化,构建了新的股票价格变化规则以及新的股票交易量的变化模型,假设了两大类影响股票价格宏观变化趋势的肉素,同时也细化了股票交易量的函数.模拟了当影响因素都利好,影响因素都利空以及影响因素利好利空交替出现的情况下,股票价格在宏观上的变化情况.仿真结果在一定程度上模拟了股票价格的宏观变化情况和股票价格变化的波动壤集性,说明了假设的两大类因素的合理性以及演化模型的正确性.     

一种基于受限网络的移动对象索引

为了有效地支持城市交通网络中移动对象的过去、现在和将来的轨迹查询,在基于模拟预测的位置表示模型基础上,提出了一种两层R树加上一个表结构的复合索引结构AUC(Adaptive Unit Compounding).根据城市交通网的特征,采用了一种带有环形交叉口的元胞自动机模型模拟移动对象的将来轨迹,并用线性回归和圆弧曲线拟合分别得到对象在规则路段和交叉口的轨迹预测方程;根据移动对象的运动特性,采用了一种新的自适应单元(AU)作为索引结构的基本单位.实验表明,AUC索引的查询和更新性能都要优于TPR树和TB树.