关于顶点链编码的图像区域表示和填充算法

图像区域的表示和显示是图像处理和图像分析、计算机制图和计算机图形学中的重要研究课题.以顶点链编码为基础,提出一种以顶点链编码来表示二值图像的方法,完成了对于图像区域的简单表示.同时着重提出了一种将用以表示二值图像的顶点链编码转化为原二值图像的算法.该算法对表示二值图像区域的顶点链编码点进行记录处理,配对被记录的顶点链编码点,然后运用水平扫描线来填充图像区域,从而将原图像根据顶点链编码完全恢复出来.     

Modeling birdsong learning with a chaotic Elman network

Among passerines, Bengali finches are known to sing extremely complex courtship songs with three hierarchical structures: namely, the element, the chunk, and the syntax. In this work, we theoretically studied the mechanism of the song of Bengali finches in aides to provide a dynamic view of the development of birdsong learning. We first constructed a model of the Elman network with chaotic neurons that successfully learned the supervisor signal defined by a simple finite-state syntax. Second, we focused on the process of individual-specific increases in the complexity of song syntax. We propose a new learning algorithm to produce the intrinsic diversification of song syntax without a supervisor on the basis of the itinerant dynamics of chaotic neural networks and the Hebbian learning rule. The emergence of novel syntax modifying the acquired syntax is demonstrated. This work was presented in part at the 11th International Symposium on Artificial Life and Robotics, Oita, Japan, January 23–25, 2006     

基于非确定有穷自动机的网络入侵容忍系统研究

入侵容忍技术是继防火墙、存取控制、入侵检测技术之后的网络信息安全技术。当一个网络系统遭受非法入侵后，入侵容忍系统仍能厦时自我诊断、恢复和重构，并能为合法用户提供所需的全部或者降级的服务。本文依据非确定性有穷自动机理论，模拟计算机受到攻击时入侵容忍系统的工作过程，为入侵容忍技术的发展提供了一种方法。     

场景驱动的构件行为抽取

如果构件含有冗余的功能,特别是含有用户不想要的功能,则无法被用户正确使用.因此,如何从构件中提取场景规约中所描述的用户想要的行为便是一个亟待解决的问题.给出了解决该问题的一种方法.该方法通过为构件构造一个环境,即极大包含环境,使得场景规约中所描述的所有行为可以从构件中抽取出来,并保留到该构件与其极大包含环境的组合中.同时,构件中的其他行为,即不在场景规约中的行为,被尽可能地舍弃.用接口自动机为构件的行为建模,并将用消息序列图描述的场景规约抽象为一组活动序列.构件的组合描述为接口自动机的乘积.给出了基于场景进行构件行为抽取的相关算法,并用一个实例对文中所述方法进行了说明.     

一种基于DFA的服务行为模型及其应用

本文对Web服务行为描述进行深入分析,在构造web服务自动集成结构基础上,对原有限自动机定义进行语义扩展和候选集扩展,达到准确地描述Web服务间的执行步骤、行为间简单逻辑运算关系和代价选择运算关系目的.完成服务提供商提供服务流与用户期望在该结构下的自动匹配,为web服务自动集成提供了理论依据.     

纯铜在凝固中微观组织演化的模拟

利用连续准瞬时形核模型和CA模型，结合凝固过程中传热、枝晶尖端生长动力学等因素作用，建立了一个二维元胞自动机模型，并根据这个模型模拟了纯铜铸件在凝固过程中形核、生长的微观过程．将模拟结果与实际组织进行比较表明，该模型可以近似地描述纯铜的凝固组织。     

基于广义细胞自动机的网络带宽优化

Nowadays,bandwidth allocation schemes in a TCP/IP or ATM network are congestion avoidance oriented.Few scheme has taken global optimization into account,for global optimization problem can not be easily solved by conventional mathematical method due to the complexity and large-scale of massive information system,such as Internet.We present a novel bandwidth allocation scheme based on generalized cellular automaton (GCA).Firstly we introduce how to map network topology into GCA model,then we propose how cells and macro cells interact in our solution.Our simulation results show the scheme leads to global optimization rapidly.     

Intersection of finitely generated congruences over term algebra

We show that it is decidable for any given ground term rewrite systems R and S if there is a ground term rewrite system U such that ↔_U^*=↔_R^*∩↔_S^*. If the answer is yes, then we can effectively construct such a ground term rewrite system U. In other words, for any given finitely generated congruences ρ and τ over the term algebra, it is decidable if ρ∩τ is a finitely generated congruence. If the answer is yes, then we can effectively construct a ground term rewrite system U such that ↔_U^*=ρ∩τ.     

Language recognition by two-way deterministic pushdown automata

It is proved that any bounded context-free language can be recognized by a two-way deterministic automaton with a finite-rotary counter.Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 177–181, November–December 2004.This revised version was published online in April 2005 with a corrected cover date.     

Generalized Besicovitch and Weyl spaces: Topology, patterns, and sliding block codes

The Besicovitch and Weyl topologies on the space of configurations take a point of view completely different from the usual product topology; as such, the properties of the former are much different from that of the latter. The one-dimensional case has already been the subject of thorough studies; we extend it to greater dimensions, and also to more general groups.