Accountability Analysis of Electronic Commerce Protocols by Finite Automaton Model

The accountability of electronic commerce protocols is an important aspect to insures security of electronic transaction. This paper proposes to use Finite Automaton (FA) model as a new kind of framework to analyze the transaction protocols in the application of electronic commerce. Key words finite automaton - electronic commerce - nonrepudiation - information security CLC number TP 393. 08 Foundation item: Supported by the National Natural Science Foundation of China (66973034, 90104005, 60373087)Biography: Xie Xiao-yao (1952-), male, Professor, Ph. D candidate, research direction: information security.

Simulation of isothermal precision extrusion of NiTi shape memory alloy pipe coupling by combining finite element method with cellular automaton

In order to present the microstructures of dynamic recrystallization(DRX) in different deformation zones of hot extruded NiTi shape memory alloy(SMA) pipe coupling,a simulation approach combining finite element method(FEM) with cellular automaton(CA) was developed and the relationship between the macroscopic field variables and the microscopic internal variables was established.The results show that there exists a great distinction among the microstructures in different zones of pipe coupling because deformation histories of these regions are diverse.Large plastic deformation may result in fine recrystallized grains,whereas the recrystallized grains may grow very substantially if there is a rigid translation during the deformation,even if the final plastic strain is very large.As a consequence,the deformation history has a significant influence on the evolution path of the DRX as well as the final microstructures of the DRX,including the morphology,the mean grain size and the recrystallization fraction.

Dynamical Properties of Additive Cellular Automata over Finite Abelian Groups

Some dynamical properties were discussed for additive cellular automata(CA)over finite abelian groups.These properties include surjection,ergodicity,sensitivity to initial conditions and positive expansivity.Some necessary and sufficient conditions of determining ergodicity and sensitivity of the above additive CA were presented,respectively.A necessary condition for the positive expansivity of the above additive CA was given.The positive expansivity was proved to be preserved under the shift mappings for the general CA.The discussion was mainly based on the structure theorem of the finite abelian groups and the matrix associated with the global rule of the additive CA over the finite abelian p-groups.

Finite State Automaton for Food Traceability

To model the operation of food traceability, features of food supply chain are studied. The aim of the paper is to build an abstract model of food traceability, and to gain better understanding of food traceability and food safety. Based on the analysis of consumers＇ behavior of searching for traceability information, a finite state automaton for food traceability is presented by using automata theory. The states of the food supply chain are represented by a state transition diagram. The automaton in this paper simulates the entire food supply chain and provides a theoretical basis for the behavior description and structural design of a food traceability system.

Brain as an Emergent Finite Automaton: A Theory and Three Theorems

This paper models a biological brain—excluding motivation (e.g., emotions)—as a Finite Automaton in Developmental Network (FA-in-DN), but such an FA emerges incrementally in DN. In artificial intelligence (AI), there are two major schools: symbolic and connectionist. Weng 2011 [1] proposed three major properties of the Developmental Network (DN) which bridged the two schools: 1) From any complex FA that demonstrates human knowledge through its sequence of the symbolic inputs-outputs, a Developmental Program (DP) incrementally develops an emergent FA itself inside through naturally emerging image patterns of the symbolic inputs-outputs of the FA. The DN learning from the FA is incremental, immediate and error-free;2) After learning the FA, if the DN freezes its learning but runs, it generalizes optimally for infinitely many inputs and actions based on the neuron’s inner-product distance, state equivalence, and the principle of maximum likelihood;3) After learning the FA, if the DN continues to learn and run, it “thinks” optimally in the sense of maximum likelihood conditioned on its limited computational resource and its limited past experience. This paper gives an overview of the FA-in-DN brain theory and presents the three major theorems and their proofs.

Simulation of solidification microstructure of Fe-6.5%Si alloy using cellular automaton-finite element method

3D microstructures of Fe–6.5%Si(mass fraction) alloys prepared under different cooling conditions were simulated via finite element-cellular automaton(CAFE) method. The simulated results were compared to experimental results and found to be in accordance. Variations in the temperature field and solid-liquid region, which plays important roles in determining solidification structures, were also examined under various cooling conditions. The proposed model was utilized to determine the effects of Gaussian distribution parameters to find that the lower the mean undercooling, the higher the equiaxed crystal zone ratio; also, the larger the maximum nucleation density, the smaller the grain size. The influence of superheat on solidification structure and columnar to equiaxed transition(CET) in the cast ingot was also investigated to find that decrease in superheat from 52 K to 20 K causes the equiaxed crystal zone ratio to increase from 58.13% to 65.6%, the mean gain radius to decrease from 2.102 mm to 1.871 mm, and the CET to occur ahead of schedule. To this effect, low superheat casting is beneficial to obtain finer equiaxed gains and higher equiaxed dendrite zone ratio in Fe–6.5%Si alloy cast ingots.

1-Way Multihead Quantum Finite State Automata

1-way multihead quantum finite state automata (1QFA(k)) can be thought of modified version of 1-way quantum finite state automata (1QFA) and k-letter quantum finite state automata (k-letter QFA) respectively. It has been shown by Moore and Crutchfield as well as Konadacs and Watrous that 1QFA can’t accept all regular language. In this paper, we show different language recognizing capabilities of our model 1-way multihead QFAs. New results presented in this paper are the following ones: 1) We show that newly introduced 1-way 2-head quantum finite state automaton (1QFA(2)) structure can accept all unary regular languages. 2) A language which can’t be accepted by 1-way deterministic 2-head finite state automaton (1DFA((2)) can be accepted by 1QFA(2) with bounded error. 3) 1QFA(2) is more powerful than 1-way reversible 2-head finite state automaton (1RMFA(2)) with respect to recognition of language.

Xgadget:基于动静结合的二进制Gadget搜索

代码复用技术一直以来都是软件安全研究领域的热点,ROP(return-oriented programming)、JOP(jump-oriented programming)和DOP(data-oriented programming)技术是典型代表。Gadget搜索是代码复用的基础,针对现有静态搜索算法存在支持的Gadget类型不多,不能同时搜索动态链接库等问题,提出了基于动静结合的二进制Gadget搜索方法,基于此开发了搜索工具Xgadget。利用动态映像级插桩,对所有函数进行反汇编;设计了Token级和指令级有穷自动机,实现了基于自动机的静态搜索算法;在五款应用程序中对其进行了测试与评估。实验结果表明,算法支持ROP、JOP、DOP等多种Gadget类型的搜索,能够同时对目标程序动态链接库进行搜索,搜索数量是ROPgadget的12.5倍,单位指令搜索时间较之降低32.1%。算法为不同需求的代码复用提供更为广泛的支持,且输出结果是二进制Gadget,后续复用更直接,有利于代码复用自动化利用。

基于局部乱序事件排序的复杂事件匹配方法

为处理乱序事件流上的复杂事件匹配问题,减少排序开销,在非确定有限状态自动机的基础上提出解析查询指导排序策略和匹配结果反馈排序策略。根据查询内容对事件流进行分解过滤,得到查询所需的子事件流,设计基于堆排序的子事件流合并算法。通过匹配过程中自动机的状态,设计算法对自动机状态转移相关的事件实例进行排序。在股票数据集上进行实验,验证了提出方法相较于现有方法在匹配性能上有显著提升。

On Some Properties of Graph of Prefix Code

We investigate decomposition of codes and finite languages. A prime decomposition is a decomposition of a code or languages into a concatenation of nontrivial prime codes or languages. A code is prime if it cannot be decomposed into at least two nontrivial codes as the same for the languages. In the paper, a linear time algorithm is designed, which finds the prime decomposition. If codes or finite languages are presented as given by its minimal deterministic automaton, then from the point of view of abstract algebra and graph theory, this automaton has special properties. The study was conducted using system for computational Discrete Algebra GAP. .

ɑFA:一种基于非信任字符比较的高性能正则表达式匹配算法

正则表达式匹配技术在数据治理、解析提取和深度包检测方面有着重大应用价值。然而,由于其在通用平台上的匹配性能较低,无法满足实际环境下数据实时处理的应用需求,限制了其在高性能数据处理领域的应用范围。针对当前正则表达式匹配性能较低的问题,提出一种基于非信任字符比较的高性能正则表达式匹配算法,称之为ɑFA。该算法通过每次判断连续的若干个字符是否属于最常被访问状态的非信任字符集,获取无需通过DFA匹配可直接跳过的字符数,减少字符匹配过程中访问内存DFA状态转移表的次数,从而实现字符匹配的加速处理。实验结果表明,ɑFA算法可获得相比于原始DFA匹配算法约为1.05~7.58倍的性能加速比。

一种基于免疫学的信息安全威胁预警方法

为提升信息安全威胁预警准确度和事件响应速度,模拟生物免疫系统组织、结构、功能及识别自我排除非己等机制,提出一种信息安全威胁预警方法。首先部署入侵检测节点,设置关联规则;接着刻画信息系统正常行为轨迹,设置数据流转区域及路径规则,运用马尔科夫链、有限状态自动机等算法,设置数据流转时空规则;然后围绕资产脆弱性及中观态势,设置预警攻击向量。入侵与已设置规则匹配时,及时预警或处置威胁。实践表明,该方法可有效降低人员的技能依赖,提升人员的事件响应速度,具有一定推广价值。

Numerical simulation of solidification morphologies of Cu-0.6Cr casting alloy using modified cellular automaton model

The purpose of this study is to predict the morphologies in the solidification process for Cu-0.6Cr(mass fraction,%)alloy by vacuum continuous casting(VCC)and verify its accuracy by the observed experimental results.In numerical simulation aspect, finite difference(FD)method and modified cellular automaton(MCA)model were used to simulate the macro-temperature field, micro-concentration field,nucleation and grain growth of Cu-0.6Cr alloy using real data from actual casting operations.From the observed casting experiment,the preliminary grain morphologies are the directional columnar grains by the VCC process.The solidification morphologies by MCAFD model are in agreement with the result of actual casting experiment well.

基于动态匹配策略的复杂事件处理方法

复杂事件处理技术是在事件流中检测特定事件模型的分析技术。当前主流的复杂事件匹配方法在查询模式中按照事件连续性严格程度设置了匹配策略约束,这些特定的匹配策略由于设置粒度粗,所以难以根据需求精细调节匹配结果,造成匹配结果的冗余和匹配效率的不足。针对当前主要匹配策略存在的冗余问题,提出基于动态匹配策略的复杂事件处理方法,设计支持动态匹配策略的查询模式及基于查询模式的匹配方法。通过动态调节复杂事件实例的派生约束,实现匹配结果可调节的同时提升匹配性能。在模拟数据集上对方法进行对比实验。实验结果表明,提出方法可以有效调节匹配结果,并提高整体匹配性能。

A measurable refinement method of design and verification for micro-kernel operating systems in communication network

A secure operating system in the communication network can provide the stable working environment,which ensures that the user information is not stolen.The micro-kernel operating system in the communication network retains the core functions in the kernel,and unnecessary tasks are implemented by calling external processes.Due to the small amount of code,the micro-kernel architecture has high reliability and scalability.Taking the microkernel operating system in the communication network prototype VSOS as an example,we employ the objdump tool to disassemble the system source code and get the assembly layer code.On this basis,we apply the Isabelle/HOL,a formal verification tool,to model the system prototype.By referring to the mathematical model of finite automata and taking the process scheduling module as an example,the security verification based on the assembly language layer is developed.Based on the Hoare logic theory,each assembly statement of the module is verified in turn.The verification results show that the scheduling module of VSOS has good functional security,and also show the feasibility of the refinement framework.

面向图数据的结构化正则路径查询方法

正则路径查询是一种应用正则表达式在图数据上进行查询的技术,通常利用有限状态自动机实现查询匹配。现有正则路径查询方法的匹配结果为顶点对的序列,未能充分保留图的结构,为了解决这一问题,提出了一种面向图数据的结构化正则路径查询方法,通过在不同的序列间加以结构化约束,使得查询结果由路径转变为子图。为了实现这一目的,首先定义了一种结构化的正则路径查询语言,并设计了结构化的查询解析以及基于此结构的匹配算法。实验在模拟数据集和真实数据集上进行了测试与分析,验证了网络规模对查询速度的影响,并设置了对照实验。实验结果表明,提出方法能够在保证满足正则表达式约束的前提下实现结构化查询。

A Program Study of the Union of Semilattices on the Set of Subsets of Grids of Waterloo Language

The aim is to study the set of subsets of grids of the Waterloo language from the point of view of abstract algebra and graph theory. The study was conducted using the library for working with transition graphs of nondeterministic finite automata NFALib implemented by one of the authors in C#, as well as statistical methods for analyzing algorithms. The results are regularities obtained when considering semilattices on a set of subsets of grids of the Waterloo language. It follows from the results obtained that the minimum covering automaton equivalent to the Waterloo automaton can be obtained by adding one additional to the minimum covering set of grids. .

基于FSA和重排序的访问控制策略评估方案

针对访问控制策略评估效率问题,提出基于有限状态自动机(finite state automaton,FSA)和重排序的访问控制策略评估方案。以四元组的形式表示策略,构建FSA策略模型检测策略异常,消除策略中的冲突规则以及冗余规则,实现策略评估的前期优化;提出基于重排序的策略评估算法,重排序策略中的规则以及每个规则中的属性-值对(attribute-value pairs,AVP),减少评估访问请求过程中遍历的规则数和属性比较次数。实验结果表明,与传统策略评估引擎相比,该方案检测策略异常效率以及评估效率均有很大提升。

深度包检测中一种高效的正则表达式压缩算法

提出一种基于确定的有穷状态自动机(deterministic finite automaton,简称DFA)的正则表达式压缩算法.首先,定义了膨胀率DR(distending rate)来描述正则表达式的膨胀特性.然后基于DR提出一种分片的算法RECCADR(regular expressions cut and combine algorithm based on DR),有效地选择出导致DFA状态膨胀的片段并隔离,降低了单个正则表达式存储需求.同时,基于正则表达式的组合关系提出一种选择性分群算法REGADR(regular expressions group algorithm based on DR),在可以接受的存储需求总量下,通过选择性分群大幅度减少了状态机的个数,有效地降低了匹配算法的复杂性.

一种基于智能有限自动机的正则表达式匹配算法

本文提出了一种基于智能有限自动机(Smart Finite Automaton,SFA)的正则表达式匹配算法,在XFA的分支迁移边上增加额外的判断操作指令,消除XFA的回退迁移边,避免不必要的状态迁移操作.实验结果表明,SFA提高了正则表达式匹配的时空效率,与XFA相比,在存储空间开销上减少了44.1%,在存储器访问次数上减少了69.1%.