New insight into phase change memories

The switching mechanism in phase change memories was described on the basis of minimum switching unit: the commuton. A commuton is a minimum cluster of atoms that supports a reversible phase change from high to low electrical conduction state and back under the influence of an external signal. The switching process in a phase change chalcogenide film was modeled using two dimensional cellular automata approach. A system of 50 × 50 cells, each cell containing a commuton, was simulated. In the particular case of Ge₂Sb₂Te₅ (investigated here) this system corresponds to a 30 × 30 nm area. The formation of the percolation path as a function of phase change induced in commutons explains the switching phenomenon. The influence of the percent of defects in the material on the percolation threshold has been studied.     

基于改进元胞自动机的数字保密通信方案

为了提高现有混沌保密通信系统的加解密速度和安全性,提出了一种新的即时同步流密码数字保密通信方案,在该方案中利用改进元胞自动机进行加密,并采用扩展密钥技术和置乱技术.数值模拟结果表明:该方案能产生随机性很好的流密码,并且具有较高的加解密速度和非常高的抗破译能力.     

房间出口位置及内部布局对疏散效率的影响研究

利用先前建立的元胞自动机人员疏散模型,考虑教室类房间内过道区域的影响因素,调整行人转移概率的计算规则,分析了教室不同出口位置、教室内不同布局情况下的疏散效率.结果表明,正对教室过道的出口对疏散是很有利的,教室正面边缘开口和侧面开口相比,宜在侧面开口,以减少行人运动过程中方向的变化,而教室正面中央开口虽然疏散效率最高,但这样的开口不现实;另外,当教室侧面开口时,紧靠出口墙壁侧的过道是必要的,当教室总容量不变时,应优先考虑过道分布的设计,过道的数目和单个过道宽度相比,过道数目对疏散效率的影响更显著,过道数量较多时,疏散效率较高.本文有望为教室内部布局和出口设置,以及影剧院、体育馆看台等类似建筑内座椅和过道的分布设计提供建议.     

Opinion evolution based on cellular automata rules in small world networks

In this paper,we apply cellular automata rules,which can be given by a truth table,to human memory.We design each memory as a tracking survey mode that keeps the most recent three opinions.Each cellular automata rule,as a personal mechanism,gives the final ruling in one time period based on the data stored in one’s memory.The key focus of the paper is to research the evolution of people’s attitudes to the same question.Based on a great deal of empirical observations from computer simulations,all the rules can be classified into 20 groups.We highlight the fact that the phenomenon shown by some rules belonging to the same group will be altered within several steps by other rules in different groups.It is truly amazing that,compared with the last hundreds of presidential voting in America,the eras of important events in America’s history coincide with the simulation results obtained by our model.     

Block Transformation of Hybrid Cellular Automata

By introducing a sequence-block transformation and vector-block transformation, we explore the dynamical properties of hybrid cellular automation (HCA) and hybrid cellular automation with memory (HCAM) in the framework of symbolic dynamics. As the local evolution rules of HCA and HCAM are not-uniform, the new uniform cellular automata (CAs) with multiple states are constructed by specifical the block transformations. Furthermore, because the new CA rules are topologically conjugate with the originals, the complex dynamics of the HCA and HCAM rules can be investigated via the new CA rules.     

Stability in cellular neural networks with a piecewise constant argument

In this paper, by using the concept of differential equations with piecewise constant arguments of generalized type [1], [2], [3] and [4], a model of cellular neural networks (CNNs) [5] and [6] is developed. The Lyapunov-Razumikhin technique is applied to find sufficient conditions for the uniform asymptotic stability of equilibria. Global exponential stability is investigated by means of Lyapunov functions. An example with numerical simulations is worked out to illustrate the results.     

Solving a minimum-power covering problem with overlap constraint for cellular network design

We consider a type of covering problem in cellular networks. Given the locations of base stations, the problem amounts to determining cell coverage at minimum cost in terms of the power usage. Overlap between adjacent cells is required in order to support handover. The problem we consider is NP-hard. We present integer linear models and study the strengths of their continuous relaxations. Preprocessing is used to reduce problem size and tighten the models. Moreover, we design a tabu search algorithm for finding near-optimal solutions effectively and time-efficiently. We report computational results for both synthesized instances and networks originating from real planning scenarios. The results show that one of the integer models leads to tight bounds, and the tabu search algorithm generates high-quality solutions for large instances in short computing time.     

基于员工行为差异的元胞自动机演化模拟与机制设计

提出了企业员工的正行为、零行为和负行为概念,分析了员工中不同行为间的相互影响.对传统元胞自动机方法进行了改进,建立了基于员工传播性和保持性的元胞自动机模型,并对员工不同的初始比例、不同的行为传播性和保持性以及企业不同奖励和惩罚性政策下的员工行为演化进行了模拟,得到了一些合理和有益的结论,并对不同情形下的人员管理提供了针对性建议.     

A Monte Carlo study of ant traffic in a uni-directional trail

In this study, we aim to investigate ant traffic in the uni-directional ant trail. We consider two types of ants moving in the trail: one of which smells well and the other does not. The theoretical base of the study is similar to that of the Nagel–Schreckenberg (NaSch) model, but we do not use the exclusion rule, the asymmetrical exclusion rule is employed instead. Ants are placed on the trail as mixed. By keeping the number of ‘poor-smelling ants’ constant, the traffic in the trail is studied as a function of the number of “good-smelling” ants and the evaporation rate probability of pheromone f$f$. The fundamental physical quantities, i.e., mean speed V$V$ and flux F$F$, interestingly show non-monotonic density dependence for some values of f$f$ at some densities.