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 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.

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.

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.

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.

Numerical simulation of 3D-microstructures in solidification processes based on the CAFE method

It was analyzed that the finite element-cellular automaton （CAFE） method was used to simulate 3D-microstructures in solidification processes. Based on this method, the 3D-microstructure of 9SMn28 free-cutting steel was simulated in solidification processes and the simulation results are consistent with the experimental ones. In addition, the effects of Gaussian distribution parameters were also studied. The simulation results show that the higher the mean undercooling, the larger the columnar dendrite zones, and the larger the maximum nucleation density, the smaller the size of grains. The larger the standard deviation, the less the number of minimum grains is. However, the uniformity degree decreases first, and then increases gradually.

Study on seismic numerical model on the Chinese mainland and its vicinity

This paper presents the stress incremental rate of each element by using finite element numerical simulation way.Combined with the practical continent boundary condition and medium parameters, this paper applies the stress increment rate to the more practical modified cell automaton model according to the cell automaton principle. The paper preliminarily gives the more practical seismic space-time repeated evolutive maps, and compares the imitative seismic energy release with the real seismic energy release. It is thought that this model has its advantageover the old one whether in the seismic imitative characteristics or in the comparison with the realsituation and is more practical model.

R_aR_b Transformation of Compound Finite Automata over Commutative Rings

Some results on RaRb transformation of compound finite automata over finite field are generalized to the case of commutative rings. Properties of RaRb transformation are discussed and applied to the inversion problem for compound finite automata.

Decomposing a Kind of Weakly Invertible Finite Automata with Delay 2

Some properties of a finite automaton composed of two weakly invertible finite automata with delay 1 are given, where each of those two automata has the output set of each state with the same size. And for a weakly invertible finite automaton M with delay 2 satisfying the properties mentioned in this paper, two weakly invertible finite automata with delay 1 are constructed such that M is equivalent to a sub-finite-automaton of the composition of those two. So a method to decompose this a kind of weakly invertible finite automata with delay 2 is presented.

Self-injective rings and linear (weak) inverses of linear finite automata over rings

LetR be a finite commutative ring with identity and τ be a nonnegative integer. In studying linear finite automata, one of the basic problems is how to characterize the class of rings which have the property that every (weakly) invertible linear finite automaton ? with delay τ over R has a linear finite automaton ?′ over R which is a (weak) inverse with delay τ of ?. The rings and linear finite automata are studied by means of modules and it is proved that *-rings are equivalent to self-injective rings, and the unsolved problem (for τ=0) is solved. Moreover, a further problem of how to characterize the class of rings which have the property that every invertible with delay τ linear finite automaton ? overR has a linear finite automaton ?′ over R which is an inverse with delay τ′ for some τ′?τ is studied and solved.