Minimal forbidden subwords

Motivated by a study of similar problems stated for factors of words, we study forbidden subwords of a language or a word. A procedure for obtaining the set of all words avoiding a given set of subwords is presented. On the other hand, an algorithm for computing the set of minimal forbidden subwords for a word is given. The case of a two-letter alphabet appears to be particularly interesting and it is considered separately.     

Induction in the Timed Interval Calculus

The Timed Interval Calculus, a timed-trace formalism based on set theory, is introduced. It is extended with an induction law and a unit for concatenation, which facilitates the proof of properties over trace histories. The effectiveness of the extended Timed Interval Calculus is demonstrated via a benchmark case study, the mine pump. Specifically, a safety property relating to the operation of a mine shaft is proved, based on an implementation of the mine pump and assumptions about the environment of the mine.     

Synchronization models for multimedia presentation with user participation

This paper addresses the key issue of providingflexible multimedia presentation with user participation and suggests synchronization models that can specify the user participation during the presentation. We study models like the Petrinet-based hypertext model and the object composition Petri nets (OCPN). We suggest adynamic timed Petri nets structure that can model pre-emptions and modifications to the temporal characteristics of the net. This structure can be adopted by the OCPN to facilitate modeling of multimedia synchronization characteristics with dynamic user participation. We show that the suggested enhancements for the dynamic timed Petri nets satisfy all the properties of the Petri net theory. We use the suggested enhancements to model typical scenarios in a multimedia presentation with user inputs.     

Data compression and encryption using cellular automata transforms

A family of basis functions, generated from the evolving states of Cellular Automata (CA), is used to compress and encrypt data. The operations required in encoding and decoding the data are described under the umbrella Cellular Automata Transforms (CAT). There is a huge number of these transform bases. CAT can be used in the way other mathematical transforms (e.g., Fourier, Discrete Cosine, Laplace, Wavelet, etc.) are utilized. In data-compression applications, the rules and pertinent keys used to generate the CA are selected to favor those that yield basis functions with the best information-packing characteristics. On the other hand, for encryption the selection is biased towards those with the tendency to yield an avalanche effect. In the latter case the transform process must be error-free.     

TIC: A timed calculus

TIC is a timed algebraic calculus which combines ideas from asynchronous and synchronous calculi. Time is introduced by assigning explicit time restrictions to the events of an asynchronous calculus. The semantics is defined in an operational way. Interleaving of behaviours is defined in such a way that a proper merge of events in time is achieved. Weak timed bisimulation is also defined. Examples are presented to show the applicability of the calculus to the study of timed behaviours.This work was partially supported by CICYT under the TIC program (MEDAS project)     

时间Petri网与CAGA算法相结合的并行测试研究

在并行测试的研究中对于任务的测试次序一直是个研究重点及难题。用时间Petri网建立关于并行测试系统的模型,并首次用元胞遗传算法(CAGA)对模型中的变迁序列进行搜索,快速得到最好的测试序列。通过仿真结果表明,该算法展示了很好的收敛效果,并且与已有的研究成果相比更具优势。     

CONTROL OF A PULSED LIQUID-LIQUID EXTRACTION COLUMN BASED ON A MULTILEVEL SYSTEM OF AUTOMATA

This paper presents the real-time application of the learning control theory to the control of a chemical pilot plant: a pulsed liquid-liquid extraction column.

The behaviour of an agitated liquid-liquid extraction column can be related to random mechanisms such as the phenomena of droplets breakage and coalescence. Previous studies on hydrodynamic and mass transfer aspects showed that a pulsed liquid-liquid extraction column had an optimal behaviour for operating conditions close to flooding. These results led to choose the following strategy to control the column in its optimal behaviour zone:

- the measure of the conductivity of the liquid medium below the distributor which gives a good information about flooding, is the controlled variable

-the pulse frequency is the control action.

The learning control algorithm is based on a multilevel system of automata which operates in a random environment. By means of an evaluation unit of the performances of the column which generates either penalty (inaction) or reward on the basis of heuristic rules, the automaton chooses a value of the pulse frequency. This approach is essentially connected to artificial intelligence in so far as human knowledge on the plant is included in these rules.

This algorithm has been implemented on a microcomputer for control purposes. The experimental results presented show the good performances of the approach.     

A novel design of 8-bit adder/subtractor by quantum-dot cellular automata

Application of quantum-dot is a promising technology for implementing digital systems at nano-scale. QCA supports the new devices with nanotechnology architecture. This technique works based on electron interactions inside quantum-dots leading to emergence of quantum features and decreasing the problem of future integrated circuits in terms of size. In this paper, we will successfully design, implement and simulate a new full adder based on QCA with the minimum delay, area and complexities. Also, new XOR gates will be presented which are used in 8-bit controllable inverter in QCA. Furthermore, a new 8-bit full adder is designed based on the majority gate in the QCA, with the minimum number of cells and area which combines both designs to implement an 8-bit adder/subtractor in the QCA. This 8-bit adder/subtractor circuit has the minimum delay and complexity. Being potentially pipeline, the QCA technology calculates the maximum operating speed.     

基于实时UML顺序图的物联网交互模型

物联网是一个集计算、通信和控制于一体的智能系统,它通过监控和收集物理进程信息并将这些信息进行计算和分析,最终生成正确的控制指令用以执行,从而使物理环境变得更加安全和可靠。在物联网中,各物体通过网络连接或者本地连接的方式进行交互,这些交互具有时间性和地域性。物联网的建模和验证是物联网研究中一个重要的领域。文中提出一种基于实时UML顺序图的物联网交互模型,该模型将物联网中所有参与交互的物体建模为交互对象,并且通过实时UML顺序图对交互对象间的交互进行建模。使用时间自动机对交互对象的内部状态变化进行建模,以形成对交互模型的补充。最后根据转换规则将交互模型转换为时间自动机的形式以便于验证。通过一个实例,显示了如何具体应用物联网交互模型。进一步提出了物联网系统应该满足的一些性质,并使用UPPAAL模型检测工具对物联网交互模型进行分析和验证。     

小麦植株拓扑结构发生过程的仿真研究

以小麦作物为研究对象,采用小麦植株形态结构的观测分析,提出了由多层次自动机模型、植株拓扑结构数据模型和模型调度算法构成的小麦植株拓扑结构的发生过程仿真方法.多层次自动机模型将小麦植株拓扑结构的发展过程视为生长单元、叶元和器官三个不同层次基本结构的重复、迭代,并以此建立宏状态、子状态和微状态自动机,进行拓扑结构演变过程的控制和形式化描述;植株拓扑结构数据模型基于小麦分枝结构的特征,建立拓扑结构的抽象单元和抽象单元间的关系,实现植株拓扑结构的描述与结构化存储;模型调度算法以多层次自动机为控制机制,进行植株拓扑结构数据的动态更新.在此基础上,采用VC++/OpenGL建立小麦虚拟生长可视化系统,进行了植株拓扑结构发生过程仿真,结果表明,改进方法能够对小麦个体全生育期拓扑结构的演变过程进行准确仿真,与同类仿真方法相比较,具有拓扑发生规律形式化定义易于建模理解、拓扑结构发生仿真控制精确、拓扑控制与描述分离利于改进和扩展等特点,可为虚拟小麦生长研究提供技术支撑.