用宏微观耦合模型模拟铝合金凝固过程

用一种宏微观耦合模型对Al-2．5Si在金属型中的凝固情况进行了模拟。该模型结合改进的元胞自动机模型与有限差分法，考虑了温度场、浓度场和微观生长过程。该改进的元胞自动机模型与经典元胞自动机相比较，不仅考虑了温度场扩散，而且考虑了溶质在液相中的扩散、界面曲率和溶质富集对枝晶尖端过冷度的影响。在宏微观耦合模型中采用大小两套网格分别进行宏观温度场和微观组织演变的计算。在3种不同的浇注温度下得到了3种典型的柱状晶向等轴晶转变的图形。考虑边界条件后的模拟结果发现等轴晶的形核情况与理论分析有所差别。     

Structural Presburger digit vector automata

The least significant digit first decomposition of integer vectors into words of digit vectors provides a natural way for representing sets of integer vectors by automata. In this paper, the minimal automata representing Presburger sets are proved structurally Presburger: automata obtained by moving the initial state and replacing the accepting condition represent Presburger sets.     

An axiom system for sequence-based specification

This paper establishes an axiomatic foundation and a representation theorem for the rigorous, constructive process, called sequence-based specification, of deriving precise specifications from ordinary (informal) statements of functional requirements. The representation theorem targets a special class of Mealy state machines, and algorithms are presented for converting from the set of sequences that define the specification to the equivalent Mealy machine, and vice versa. Since its inception, sequence-based specification has been effectively used in a variety of real applications, with gains reported in quality and productivity. This paper establishes the mathematical foundation independently of the process itself.     

Computing maximal-exponent factors in an overlap-free word

The exponent of a word is the quotient of its length over its smallest period. The exponent and the period of a word can be computed in time proportional to the word length. We design an algorithm to compute the maximal exponent of all factors of an overlap-free word. Our algorithm runs in linear-time on a fixed-size alphabet, while a naive solution of the question would run in cubic time. The solution for non-overlap-free words derives from algorithms to compute all maximal repetitions, also called runs, occurring in the word.We also show there is a linear number of occurrences of maximal-exponent factors in an overlap-free word. Their maximal number lies between 0.66n and 2.25n in a word of length n. The algorithm can additionally locate all of them in linear time.     

有穷自动机的多媒体教学系统设计

利用多媒体技术的优势,采用多媒体课件制作工具Flash 8.0软件,将图形、动画和影视等多种媒体的素材溶于编译原理课程的教学课件中,形成富有特色的多媒体教学课件;学生通过系统能够进行自主学习,提高对形式语义、有穷自动机等抽象内容的学习兴趣、增强课堂教学效果。设计了该有穷自动机多媒体教学系统,既可在课堂上演示,也可在课后由学生自主观摩,以增强对编译原理课程的学习效果。     

Learning type PID control system using input dependence reinforcement scheme

PID control has widely used in the field of process control and a lot of methods have been used to design PID parameters. When the characteristic values of a controlled object are changed due to a change over the years or disturbance, the skilled operators observe the feature of the controlled responses and adjust the PID parameters using their knowledge and know-how, and a lot of labors are required to do it. In this research, we design a learning type PID control system using the stochastic automaton with learning function, namely learning automaton, which can autonomously adjust the control parameters updating the state transition probability using relative amount of controlled error. We show the effectiveness of the proposed learning type PID control system by simulations. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

参数化和生成式风景园林设计 以清华建筑学院研究生设计课程作业为例

复杂系统和非线性科学将世界看作是由大量个体相互联系组成的动态系统。基于计算机技术的参数化和生成式设计方法在这种新的科学体系和世界观的影响下产生。风景园林作为自然生态系统的一部分,具备了复杂系统的特征,因此,在设计中运用参数化和生成式设计方法具有其独特的合理性和意义。针对这一议题进行了分析,并以研究生设计课的学生作品为例,展示了在参数化和生成式风景园林设计理念和方法上的最新的教学成果。     

元胞自动机方法模拟枝晶演变过程的分析与研究

利用传统的元胞自动机方法摸拟了基于溶质扩散控制界面生长机制的枝晶演变和显微偏析。模拟结果显示这种方法可以显示出枝晶形貌和显微偏析，同时可以再现凝固过程中的再辉现象。在模拟的过程中发现模拟的枝晶尖端半径与理论计算的枝晶尖端半径符合较好，但模拟结果也显示出一些波动，通过分析发现导致波动的原因是元胞自动机方法的规则将连续的枝晶生长模型割裂成离散跳跃的生长方式，因此不可避免地产生模拟结果波动。     

AUTONOMOUS PLANNING UNDER UNCERTAINTY: PLANNING MODELS

This paper presents a system-theoretic approach to the general problem of autonomous planning under uncertainty. The autonomous planning problem involves an automaton (an autonomous machine) which interacts with an environment via a set of unreliable control and sensing operations. The task assigned to the automaton is to plan and execute a sequence of control and sensing operations which changes the state of the environment in a desirable way.

The paper introduces the concept of an Uncertainty Machine which models the propagation of the information from the environment to the automaton during the execution of the plans. Based on the concept of an uncertainty machine, mathematical expressions are presented for the active-sensing, the passive-sensing and the control (sensorless) entropies of an arbitrary execution instance. These entropies are shown to be useful measures of the automaton's ability to utilize its control and sensing resources in reducing its uncertainty.

In a companion paper,⁷ the concept of an uncertainty machine is utilized to synthesize strategies which enable the automaton to actively explore the environment.