Numerical simulation of microstructure formation ofAZ91 using mCA method

A stochastic model for simulating the microstructure formation of Mg alloy AZ91 during solidification was developed based on the finite element method（FEM） for macroscopic model of heat transfer calculation and a modified Cellular Automaton （mCA） for microscopic modeling of nucleation, growth of crystal. In this model, the effect of solute redistribution, interface curvature and preferred orientation was considered. A numerical simulation was developed with C＋＋ program language. The computation was carded out to understand the effect of varying processing parameters, such as nucleation parameters and heat transfer coefficient, on the microstructure formation of AZ91. The result of simulation was displayed on screen.     

基于元胞自动机的交通枢纽内人群疏散效率研究

利用元胞自动机仿真不同出口位置和不同内部布局下交通枢纽内人员的疏散情况,通过制定合适的人员行走规则,对交通枢纽内人员疏散进行仿真分析。结果表明,正面中央开口时人员的疏散效率最高,此时由于人员相对于出口大概呈对称分布,人员对过道的利用率达到最高;和正面边缘开口相比,出口位置设置在侧面更好,以减少行人在行走过程中方向的变化从而减少疏散时间。当在侧面开口时,在靠近出口墙壁处设置过道可以提高人群的疏散效率,并且适当地增加过道数目,可以对疏散人群起到分流的作用,从而对人群的疏散也很有利。     

十字路口处长车交通状态相图

如今,相图被广泛用于交通科学领域的研究,取得了重要成果。根据理论分析和计算机模拟,本文构建了十字路口处交通流量相图。该相图是由五个基本区域构成的,本文分析并推导出每个区域的具体流量公式。在周期边界条件下,采用确定性 Fukui－Ishibashi元胞自动机交通模型进行数值模拟,其模拟结果与理论分析精确一致。     

元胞自动机方法在枝晶生长模拟中的应用

尽管大量关于枝晶生长模拟的研究都使用了相场方法,但近年来元胞自动机(CA)方法在枝晶生长模拟方面也取得了很大进展.介绍了CA方法模拟枝晶生长的原理和模型,评述了CA方法在枝晶模拟方面的发展历程,指出了存在的问题的和进一步研究的方向.     

基于场景的车载设备测试用例自动生成方法研究

列控车载子系统是确保列车的安全运行的关键设备,对车载子系统进行测试是保证功能实现与系统规范一致性的重要手段。针对传统手工测试用例生成的效率低、耗时长、工作量繁杂、可重用性低等缺陷,提出一种基于场景的车载系统测试用例自动生成方法,依据CTCS-3级列控系统技术规范构造车载子系统场景树模型,由实时系统测试用例自动生成工具Co Ver对列车运行模式转换自动机网模型生成基于场景的测试用例,并由运行模式最小重复度选择算法生成全模式覆盖的测试序列。结论证明,基于场景自动生成的测试用例能够覆盖全部车载模式,并提高了模式转换测试序列生成效率。     

有穷自动机的Linux多点触摸屏中间件设计

多点触摸屏的应用程序开发是当前的研究热点.Linux multi-touch (MT)协议是Linux输入子系统的一个标准协议,定义了多点触摸设备驱动程序的数据传输规范,有着广泛的使用范围.识别和处理多点触摸屏驱动程序的数据是多点触摸屏应用最基本的功能.本文采用有穷自动机的思想,设计了一个可以识别符合Linux multi-touch协议规范数据的多点触摸屏中间件.中间件提供外部接口供应用程序使用,可以减少程序开发人员的重复工作,提高开发效率.     

A generalization of the Curtis–Hedlund theorem

Let A be a set and let G be a group, and equip A^G with its prodiscrete uniform structure. Let τ:A^G→A^G be a map. We prove that τ is a cellular automaton if and only if τ is uniformly continuous and G-equivariant. We also give an example showing that a continuous and G-equivariant map τ:A^G→A^G may fail to be a cellular automaton when the alphabet set A is infinite.     

边界跟踪自动机与围线树结构的生成算法

定义八近邻图像的边界跟踪自动机,利用自动机跟踪图像所有区域边界,自动机的输出为边界的顶点链码,在自动机跟踪所有边界的同时生成围线的树结构.跟踪算法复杂度是线性的,能跟踪任意复杂图像区域.     

Bionic autonomous learning control of a two-wheeled self-balancing flexible robot

This paper presents an OCPA (operant conditioning probabilistic automaton) bionic autonomous learning system based on Skinner’s operant conditioning theory for solving the balance control problem of a two-wheeled flexible robot. The OCPA learning system consists of two stages: in the first stage, an operant action is selected stochastically from a set of operant actions and then used as the input of the control system; in the second stage, the learning system gathers the orientation information of the system and uses it for optimization until achieves control target. At the same time, the size of the operant action set can be automatically reduced during the learning process for avoiding little probability event. Theory analysis is made for the designed OCPA learning system in the paper, which theoretically proves the convergence of operant conditioning learning mechanism in OCPA learning system, namely the operant action entropy will converge to minimum with the learning process. And then OCPA learning system is applied to posture balanced control of two-wheeled flexible self-balanced robots. Robot does not have posutre balanced skill in initial state and the selecting probability of each operant in operant sets is equal. With the learning proceeding, the selected probabilities of optimal operant gradually tend to one and the operant action entropy gradually tends to minimum, and so robot gradually learned the posture balanced skill.     

巨型多不确定串匹配完全自动机及其快速生成算法

在串匹配搜索中,字符串常常采用U-不确定串、V-不确定串及其结合的U-V-不确定串.如何识别巨量U-不确定字符串、V-不确定字符串和U-V-不确定字符串,以及两个和两个以上U-V-不确定字符串的交错情况的串匹配,是没有遗漏地检测有害信息的关键问题.本文提出一个快速检测巨量U-不确定字符串、巨量V-不确定字符串和巨量U-V-不确定字符串的多串匹配完全自动机及其快速生成方法,包括两个和两个以上不确定字符串相互交错的情况;并且给出V-不确定字符串的完全自动机的最大并行台数,指出通常正则表达式匹配可能出现相似连接和交错情况的两种遗漏,指出如果没有从整体的角度对U-不确定串中的字符子串集进行两两不相交化及无同源后续奇点化的处理,结果就可能出现错误或者增加状态数目.