We study the two-dimensional traffic of cellular automata using computer simulation. We propose two type of decentralized cooperation strategies, which are called stepping aside (CS-SA) and choosing alternative routes...We study the two-dimensional traffic of cellular automata using computer simulation. We propose two type of decentralized cooperation strategies, which are called stepping aside (CS-SA) and choosing alternative routes (CS-CAR) respectively. We introduce them into an existing two-dimensional cellular automata (CA) model. CS-SA is designed to prohibit a kind of ping-pong jump when two objects standing together try to move in opposite directions. CS-CAR is designed to change the solution of conflict in parallel update. CS-CAR encourages the objects involved in parallel conflicts choose their alternative routes instead of waiting. We also combine the two cooperation strategies (CS-SA-CAR) to test their combined effects. It is found that the system keeps on a partial jam phase with nonzero velocity and flow until the density reaches one. The ratios of the ping-pong jump and the waiting objects involved in conflict are decreased obviously, especially at the free phase. And the average flow is improved by the three cooperation strategies. Although the average travel time is lengthened a bit by CS-CAR, it is shorten by CS-SA and CS-SA-CAR. In addition, we discuss the advantage and applicability of decentralized cooperation modeling.展开更多
A new framework has been developed to express variant and invariant properties of functions operating on a binary vector space.This framework allows for manipulation of dynamic logic using basic operations and permuta...A new framework has been developed to express variant and invariant properties of functions operating on a binary vector space.This framework allows for manipulation of dynamic logic using basic operations and permutations.Novel representations of binary functional spaces are presented.Current ideas of binary functional spaces are extended and additional conditions are added to describe new function representation schemes:F code and C code.Sizes of the proposed functional space representation schemes were determined.It was found that the complete representation for any set of functions operating on a binary sequence of numbers is larger than previously thought.The complete representation can only be described using a structure having a space of size 2^(2n)×2^(n)!for any given space of functions acting on a binary sequence of length n.The framework,along with the proposed coding schemes provides a foundational theory of variant and invariant logic in software and electricelectronic technology and engineering,and has uses in the analysis of the stability of rule-based,dynamic binary systems such as cellular automata.展开更多
基金Supported by the National Natural Science Foundation of China under Grant No. 61103093the National High-Tech Research and Development Plan of China (863) under Grant No. 2011AA010502
文摘We study the two-dimensional traffic of cellular automata using computer simulation. We propose two type of decentralized cooperation strategies, which are called stepping aside (CS-SA) and choosing alternative routes (CS-CAR) respectively. We introduce them into an existing two-dimensional cellular automata (CA) model. CS-SA is designed to prohibit a kind of ping-pong jump when two objects standing together try to move in opposite directions. CS-CAR is designed to change the solution of conflict in parallel update. CS-CAR encourages the objects involved in parallel conflicts choose their alternative routes instead of waiting. We also combine the two cooperation strategies (CS-SA-CAR) to test their combined effects. It is found that the system keeps on a partial jam phase with nonzero velocity and flow until the density reaches one. The ratios of the ping-pong jump and the waiting objects involved in conflict are decreased obviously, especially at the free phase. And the average flow is improved by the three cooperation strategies. Although the average travel time is lengthened a bit by CS-CAR, it is shorten by CS-SA and CS-SA-CAR. In addition, we discuss the advantage and applicability of decentralized cooperation modeling.
基金This work was supported in part by Information Security Professional Education System Constructions from Yunnan University,and Yunnan Education Organization and Writing Environment in Conjugate Systems Kunming Ltd.Co.
文摘A new framework has been developed to express variant and invariant properties of functions operating on a binary vector space.This framework allows for manipulation of dynamic logic using basic operations and permutations.Novel representations of binary functional spaces are presented.Current ideas of binary functional spaces are extended and additional conditions are added to describe new function representation schemes:F code and C code.Sizes of the proposed functional space representation schemes were determined.It was found that the complete representation for any set of functions operating on a binary sequence of numbers is larger than previously thought.The complete representation can only be described using a structure having a space of size 2^(2n)×2^(n)!for any given space of functions acting on a binary sequence of length n.The framework,along with the proposed coding schemes provides a foundational theory of variant and invariant logic in software and electricelectronic technology and engineering,and has uses in the analysis of the stability of rule-based,dynamic binary systems such as cellular automata.
