The ant colony system is introduced and a new algorithm for TSP is presented. This algorithm is a distributed parallel algorithm with a new state transition rule and new global updating rule.

A frame of designing communication protocol interface based on multi-agent technology is proposed, in which by use of production rule the standard of communication protocol is expressed as a rule base of communication protocol that the agent can understand, then this rule base is transformed into internal state transition rule base of protocol agent, thus the purpose of implementing this protocol standard is achieved.

fifthly, it studies the relationship between the formal language state transition rule (STR) and the modeling tools colored Petri net (CPN), and the character of P invariant.

A random generator is used with this distribution as the state transition rule to choose the next point to move to,and pheromone is updated by adjusting parameters of the distribution according to the transitions of ant colony.

Based on the state transition rule, the local updating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the least-cost quality of service (QoS) unicast routing.

One final modification must be made to the state transition rule.

Non-uniform CA differ from their uniform counterpart in the state transition rule diversity exhibited by the non-uniform ones.

A new concept of noninterference based on subject's actions and views is presented in this paper, and then a complete secure information flow model based on the new concept is described. In the model, operations of computer systems are assumed to have only two access modes, i. e. read and write, therefore two state transition rules of systems are defined according to these modes. The proof about security of the model is given finally. This model has two significant features: it can be used to analyze security...

A new concept of noninterference based on subject's actions and views is presented in this paper, and then a complete secure information flow model based on the new concept is described. In the model, operations of computer systems are assumed to have only two access modes, i. e. read and write, therefore two state transition rules of systems are defined according to these modes. The proof about security of the model is given finally. This model has two significant features: it can be used to analyze security of systems, and it is able to support multiple security policies.

The ant colony system is introduced and a new algorithm for TSP is presented. This algorithm is a distributed parallel algorithm with a new state transition rule and new global updating rule. Experiment results demonstrate that the algorithm is powerful and effective.

WT5BZ]In order to have the cutting tool complete the specific pocket machining efficiently within given boundaries, the existence problem of the intersection between the trimmed offset and Voronoi polygon based on the object oriented Voronoi diagram theory were studied. At the same time, the intersection number determination lemma is also studied in this paper with bottleneck. According to the intersection state transition rule, we present the offset generating and the optimal tool path planning algorithm...

WT5BZ]In order to have the cutting tool complete the specific pocket machining efficiently within given boundaries, the existence problem of the intersection between the trimmed offset and Voronoi polygon based on the object oriented Voronoi diagram theory were studied. At the same time, the intersection number determination lemma is also studied in this paper with bottleneck. According to the intersection state transition rule, we present the offset generating and the optimal tool path planning algorithm for pocket machining in linear time with three stacks: Tstack,Istack and Pstack. The above algorithms have been applied to NC machining successfully. And the feasibility and efficiency are fully verified.