基于系统调用属性的程序行为监控

程序的行为轨迹常采用基于系统调用的程序行为自动机来表示.针对传统的程序行为自动机中控制流和数据流描述的程序行为轨迹准确性较低、获取系统调用上下文时间开销大、无法监控程序运行时相邻系统调用间的程序执行轨迹等问题,提出了基于系统调用属性的程序行为自动机.引入了多个系统调用属性,综合系统调用各属性的偏离程度,对系统调用序列描述的程序行为轨迹进行更准确地监控;提出了基于上下文的系统调用参数策略,检测针对系统调用控制流及数据流的行为轨迹偏离;提出了系统调用时间间距属性,使得通过系统调用及其参数无法监控的相邻系统调用间的程序行为轨迹在一定程度上得到了监控.实验表明基于系统调用属性的程序行为自动机能够更准确地刻画程序行为轨迹,较传统模型有更强的行为偏离检测能力.     

有第二相粒子阻碍的晶粒粗化元胞自动机模拟

采用元胞自动机算法模拟晶粒粗化过程中第二相粒子的阻碍现象。通过CA法,在考虑第二相粒子阻碍的晶粒粗化过程中模拟了其动力学、拓扑学及形态学的演化,并研究了温度及时间对粗化过程的影响。模拟结果显示:考虑第二相粒子,晶粒的粗化动力学指数接近3,而不是2;但是拓扑学特征与理想条件的粗化相同,即晶粒边数为6的晶粒占的比例最大,其次为五边形和七边形,而晶粒边数为3或10的晶粒所占比例很低,约为5%左右;CA法模拟晶粒粗化过程组织形态演化表明,随着保温时间的增加或温度的升高,晶粒平均尺寸在增大。模拟结果与相关文献中的结论相同,表明了本文CA模型的可靠性。     

FSA乘法器的设计与实现

鉴于有限状态机对于具有逻辑顺序和时序规律的事件能有清晰的描述,对传统乘法器设计进行改进。提出一种快速、低功耗的FSA乘法器设计。该设计使用VHDL语言进行实现,并在QuartusⅡ上通过了仿真。仿真结果表明基于状态机的与基于逻辑电路的设计相比,在运算过程中产生的功耗以及运算速度上有较大的改善。     

十字路口处长车交通状态相图

如今,相图被广泛用于交通科学领域的研究,取得了重要成果。根据理论分析和计算机模拟,本文构建了十字路口处交通流量相图。该相图是由五个基本区域构成的,本文分析并推导出每个区域的具体流量公式。在周期边界条件下,采用确定性 Fukui－Ishibashi元胞自动机交通模型进行数值模拟,其模拟结果与理论分析精确一致。     

边界跟踪自动机与围线树结构的生成算法

定义八近邻图像的边界跟踪自动机,利用自动机跟踪图像所有区域边界,自动机的输出为边界的顶点链码,在自动机跟踪所有边界的同时生成围线的树结构.跟踪算法复杂度是线性的,能跟踪任意复杂图像区域.     

Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata

Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata are discussed. The notions of intuitionistic fuzzy recognizer, complete accessible intuitionistic fuzzy recognizer, intuitionistic fuzzy finite automata, deterministic intuitionistic fuzzy finite automata, and intuitionistic fuzzy language are introduced. It is shown that the languages recognized by intuitionistic fuzzy recognizer are regular, and the intuitionistic fuzzy languages recognized by the intuitionistic fuzzy finite automaton and the intuitionistic fuzzy languages recognized by deterministic intuitionistic fuzzy finite automaton are equivalent. This work is supported by National Science Foundation of China (Grant No.10571112), “TRAPOYT” of China and National 973 Foundation Research Program(Grant No.2002CB312200).     

基于有穷自动机的自动信任协商策略

自动信任协商通过协商策略协调协商双方间访问控制策略、信任证的交互披露以逐步建立信任.现有的访问控制策略规则的理论表示缺乏直观性,在分析和构造策略算法时带来不便.本文将有穷自动机形式化定义与自动信任协商相结合,提出一套基于有穷自动机的信任协商定义体系,并构造有穷自动机状态转换图对相应的访问控制策略进行图形化表示,便于分析和构造协商策略.针对积极策略缺乏安全性和谨慎策略缺乏高效性的问题,提出了基于有穷自动机的协商策略,该策略在谨慎策略的基础上加入记忆链结构,以减少协商双方交互次数,提高协商效率.经证明,该策略具备完备性和安全性,并通过仿真实验证明相对于谨慎策略,该策略具备高效性.     

Research on cryptographic properties of a new S-box based on cellular automaton

A new S-box based on cellular automata was found by experiments.The permutation properties of the S-box were analyzed,which proved that the S-box was a permutation only when the size of lattice was 5.Then the relation between the nontrivial difference transition probability of the S-box and the rank of the difference matrix was proved by constructing the difference matrix.And it was proved that the cyclic shift of input differential would not change the corresponding nontrivial differential transition probability,and obtained the sufficient and necessary conditions about the maximum and minimum nontrivial differential transition probabilities when the size of lattice was 5.Then the problem of the difference distribution of the S-box in this situation is completely solved.     

Equivalence of two-dimensional multitape automata

The equivalence of multitape automata with multi-dimensional tapes is considered. Their heads move monotonically in all directions (their backward movement is impossible). The special case when the dimensions of tapes are less than or equal to 2 is proved to be solvable. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 3–10, January–February 2008.