基于知识发现的因果自动机

随着社会的发展,人们对因果关系的研究越来越受到重视,但到目前为止基本都是从现有的知识中寻找因果关系,存在无法发现更深层次的关系和规律的缺陷。为此,我们利用有限自动机可以精确地刻画软件系统或其子系统的行为的特性,从有限自动机入手,运用知识发现的方法,针对需要解决的问题挖掘出更深层次的因果关系和规律,将知识发现理论与因果关系的研究有机结合,较系统地形成因果关系的理论和方法,建立因果状态空间,形成基于知识发现的因果自动机的初步理论框架,以解决和发现不同形态下的因果关系。     

A new parallel-by-cell approach to undistorted data compression based on cellular automaton and genetic algorithm

In this paper,a new parallel-by-cell approach to the undistorted data compression based on cellular automaton and genetic algorithm is presented.The local compression rules in a cellular automaton are obtained by using a gnetic evolutionary algorithm.The correctness of the hyper-parallel compression,the time complexity,and the relevant symbolic dynamic behaviour are discussed.In comparison with other traditional sequential or small-scale parallel methods for undistorted data compression,the proposed approcah shows much higher real-time performance,better suitability and feasibility for the systolic hardware implementation.     

构造标定自动机实现数字图像的Freeman链编码标定

图像的Freeman链编码是对图像边界的描述,这种链编码给我们图形一些基本特征,正在被广泛地应用到图像处理和图像识别中。本文给出了二值图像区域的标定方法。对于八近邻的图像,分别建立了一组最小的完备图。利用图像标定的基本图,为二值图像边界的识别构造了一个自动机,自动机的输出就是Freeman链编码,为二值图像区域的标定提供了一个有效算法。     

Finite automaton intrusion tolerance system model based on Markov

To ensure that the system could still provide normal service for legitimate users when the LAN being invaded,a finite automaton intrusion tolerance model was designed.Based on Markov’s theory,the state transformation relationship of the service provided by the system by establishing the state transition probability matrix was described,quantified the transition state and found the key nodes in the system.The maintenance of key nodes could enhance the tolerance of the system and improve the reliability of the service.Experimental comparison shows that this model not only has strong intrusion tolerance,but also has obvious advantages in the integrity of the security system when it is invaded.     

基于细胞自动机的菌落识别的研究

本文介绍使用细胞自动机的方法,对菌落的二值图像进行识别的研究。实验证明这种方法能够判别被检查菌落图像与样本库中样本的一致性,并且可以判断它们的相似度,从而达到较好的识别效果。该方法对提高我国食品安全、食品卫生的水平具有重要意义。     

Game level layout generation using evolved cellular automata

Design of level layouts typically involves the production of a set of levels which are different, yet display a consistent style based on the purpose of a particular level. In this paper, a new approach to the generation of unique level layouts, based on a target set of attributes, is presented. These attributes, which are learned automatically from an example layout, are used for the off-line evolution of a set of cellular automata rules. These rules can then be used for the real-time generation of level layouts that meet the target parameters. The approach is demonstrated on a set of maze-like level layouts. Results are presented to show the effect of various CA parameters and rule representation.     

Fast construction of space‐optimized recursive automaton

Finite‐state automata are important components in information retrieval and natural language processing software. A recursive automaton is the most compact representation of the acyclic deterministic finite‐state automata. It is based on merging not only the equivalent states but also the identical substructures in an automaton. The LZ trie variant is the state‐of‐the‐art in automata compression regarding space, but the time needed for its construction was, until now, quadratic, which has made it impractical for large inputs. In this paper, we present the first algorithm for LZ trie construction that runs in effectively linear time thereby making it an attractive choice for finite‐state automata implementation. We achieve this goal by adding a new functionality to the enhanced suffix array data structure. We present two variants of the construction procedure – an optimal method regarding the final size and a method that sacrifices some compression for low intermediate memory usage. We have made the implementation of our algorithms available in an open source software package LzLex.Copyright © 2014 John Wiley & Sons, Ltd.     

Some remarks on recognizable treeseries

Let K be a commutative ring, Σ a finite ranked alphabet and T _Σ the set of trees over Σ. We show that for any recognizable treeseries S:T → K having finite range and any subset A of K, the forest of all trees t ? T _Σ such that the corresponding coefficient (s, t) belongs to Ais recognizable.

In the case _Σ collapses to a monadic alphabet, we refind an analogous result concerning rational wordseries due to Schutzenberger [11] and Sontag [12]. Some applications are also given.     

某埋头弹机枪自动机结构设计与动力学分析

为提高大口径埋头弹机枪的射击速度,设计一种导气式自动机.以某12.7 mm埋头弹机枪为研究对象,采用升降弹膛实现开闭锁动作,对自动机的结构进行设计,利用ADAMS建立埋头弹机枪的虚拟样机模型,通过仿真获得自动机运动特性参数.仿真结果证明了该自动机结构的可行性,为大口径埋头弹机枪的设计提供一种参考方案.