关于复模态参数的冗余性

生成仿真传递函数是考核模态识别算法和评估模态分析软件的不可缺少的环节．比较可行的3种计算方案表明:若选择将传递函数表示为复模态参数的展开式,则可以自由设定仿真模态的特性,如密频、大阻尼和复模态;然而,即使采用这种格式也不能随意设置一组复模态振型,因为这种格式的表观参数个数大于物理参数个数;故而,若对应的物理参数有意义,那么复模态参数必须满足一组约束关系．通过分析复模态系统的特征值问题,和复模态参数反演物理参数的方程式,给出了复模态参数间的一组非线性冗余约束．讨论了实模态、无阻尼和不完全模态等特殊情形的冗余约束具体形式与独立参数的个数,值得注意的是,对于实模态系统,冗余约束自动满足．给出冗余约束在传递函数矩阵和一列传递函数上的等价形式．这些结果有助于产生仿真传递函数,实施优化型识别算法,以及评估识别结果;还可用来评价残余模态和识别完整性．     

Cellular Automata (CA) for Simulations of Complex Geothermal Reservoirs

The exploitation of geothermal power is a renewable energy source with great potential in future. But the exploration and development of deep geothermal energy is connected with high cost and risk. These require a reliable functionality of geological heat exchanger. However the geothermal reservoirs are really complicated as phenomena and concrete downhole data are not completely discovered at present. In order to simulate them, complex modelings combined with different time scale are necessary. Recently, the cellular automata (CA) method is being developed and widely used for solving many complex problems in different fields. Here we introduced CA method combined with Navier-Stoke equation and heat transfer; the domains of reservoirs are initially discretized into many lattice cells. The different cell type and their physical properties (e.g. water cell, porous cell, etc.) are introduced. Thermodynamically correct computation and computing fluid flow in different formations are performed. The paper will give some computational results, showing the efficiency and accuracy of this method, in order to complete the phenomena of complex geothermal problem. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Robust Metaheuristic Algorithm for Redundancy Optimization in Large-Scale Complex Systems

Based upon the general tabu search methodology, this paper develops a robust metaheuristic algorithm for the redundancy optimization in large-scale complex system reliability that performs a rigorous search of the “attractive” feasible space and is capable of escaping from a local solution. An illustrative example is provided and extensive computational results are reported on two test problems from the literature (Aggarwal, 1976; Shi, 1987) and also on randomly generated large-scale instances of complex systems with up to 200 components. The computational results indicate that the proposed metaheuristic algorithm possesses a superior robustness and efficiency for solving the class of hard optimization problems studied in this paper.     

Evolution Theory,Periodic Particles,and Solitons in Cellular Automata

A theory for soliton automata is developed and applied to the analysis and prediction of patterns in their behavior. A complete characterization and method of construction of 1-periodic particles is given. A general evolution theorem (GET) is obtained which provides significant information for a state in terms of preceding states. Application of this theorem yields several interesting results predicting periodicity and solitonic collisions. The GET explains and is based on a fundamental property of soliton automata, observed and analyzed in this paper, namely that pieces of information are lost on the left and reappear on the right.     

Automata and Square Complexes

We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method we give examples of free groups and of Kazhdan groups which are generated by the different states of one finite (bi-reversible) automaton. We also reprove the theorem of Macedońska, Nekrashevych, Sushchansky, on the connection between bi-reversible automata and the commensurator of a regular tree.     

Z-自动机与分划逻辑

本文分解Ｚ 自动机成为ω 自动机偶的复合；建立了Ｚ的Ｌ（ＭＰ）理论，利用Ｚ 自动机的技巧证明了Ｚ的Ｌ（ＭＰ）理论的可判定性．作为应用，证明了有限状态过程的正确性问题是可判定的．     

最大乘积型Fuzzy文法与自动机

本文对提出的最大乘积型Ｆｕｚｚｙ文法与最大乘积型Ｆｕｚｚｙ自动机的关系作了详细讨论，得出了两个重要的结论。即：由给定的最大乘积型Ｆｕｚｚｙ正规文法可构造一个最大乘积型Ｆｕｚｚｙ自动机使得二者接受的语言集相同，反之亦然。从而达到自动识别语言的目的。     

模糊剩余自动机

在[0,1]格值区间上引入了模糊剩余自动机(FRFA)的概念:若一个模糊自动机(FFA)的每一个状态都定义了其接受语言的一个剩余语言,则称为模糊剩余自动机.讨论了模糊剩余自动机的一些性质以及模糊自动机的消去与饱和运算.在定义既约模糊剩余语言的基础上定义了标准模糊剩余自动机,并给出了构造方法.证明了一个模糊正则语言对应的标准FRFA即为识别这个语言的最小状态FFA,此研究为模糊自动机的状态最小化研究提供了另一种研究思路.     

最大乘积型Fuzzy上下无关文法与下推自动机

在文献[1]的基础上,讨论了最大乘积型Fuzzy上下文无关文法与最大乘积型Fuzzy下推自动机的关系,即:由给定的最大乘积型Fuzzy上下文无关文法可构造一个最大乘积型Fuzzy下推自动机使得二者接受的语言集相同,反之亦然。从而达到自动识别语言的目的。     

Automata on ordinals and automaticity of linear orders

We investigate structures recognizable by finite state automata with an input tape of length a limit ordinal. At limits, the set of states which appear unboundedly often before the limit are mapped to a limit state. We describe a method for proving non-automaticity and apply this to determine the optimal bounds for the ranks of linear orders recognized by such automata.     

The Equivalence of the DFA and OFA Automate

ＴｈｅＥｑｕｉｖａｌｅｎｃｅ　ｏｆｔｈｅＰＦＡａｎｄＯＦＡＡｕｔｏｍａｔａＴｈｅＥｑｕｉｖａｌｅｎｃｅｏｆｔｈｅＰＦＡａｎｄＯＦＡＡｕｔｏｍａｔａ￥／／ＬｉＧｕｏｃａｉａｎｄＷａｎｇＣｈｕａｎｈｏｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，...     

A Finite Field Framework for Modeling,Analysis and Control of Finite State Automata

In this paper, we address the modeling, analysis and control of finite state automata, which represent a standard class of discrete event systems. As opposed to graph theoretical methods, we consider an algebraic framework that resides on the finite field <formula form="inline">${\Op F}_2$</formula> which is defined on a set of two elements with the operations addition and multiplication, both carried out modulo 2. The key characteristic of the model is its functional completeness in the sense that it is capable of describing most of the finite state automata in use, including non-deterministic and partially defined automata. Starting from a graphical representation of an automaton and applying techniques from Boolean algebra, we derive the transition relation of our finite field model. For cases in which the transition relation is linear, we develop means for treating the main issues in the analysis of the cyclic behavior of automata. This involves the computation of the elementary divisor polynomials of the system dynamics, and the periods of these polynomials, which are shown to completely determine the cyclic structure of the state space of the underlying linear system. Dealing with non-autonomous linear systems with inputs, we use the notion of feedback in order to specify a desired cyclic behavior of the automaton in the closed loop. The computation of an appropriate state feedback is achieved by introducing an image domain and adopting the well-established polynomial matrix method to linear discrete systems over the finite field <formula form="inline">${\Op F}_2$</formula>. Examples illustrate the main steps of our method.     

Automata and logics over finitely varying functions

We extend some of the classical connections between automata and logic due to Büchi (1960) [5] and McNaughton and Papert (1971) [12] to languages of finitely varying functions or “signals”. In particular, we introduce a natural class of automata for generating finitely varying functions called ’s, and show that it coincides in terms of language definability with a natural monadic second-order logic interpreted over finitely varying functions Rabinovich (2002) [15]. We also identify a “counter-free” subclass of ’s which characterise the first-order definable languages of finitely varying functions. Our proofs mainly factor through the classical results for word languages. These results have applications in automata characterisations for continuously interpreted real-time logics like Metric Temporal Logic (MTL) Chevalier et al. (2006, 2007) [6] and [7].     

格值模糊有限自动机的同态

引入了格值模糊有限自动机的(强)同态的概念,研究了它们的相关性质,得出了同态基本定理。给出了A上容许关系及强同态的核的概念,研究了它们相关性质。     

概率有限自动机的代数性质

研究了概率有限自动机的同态(弱同态)、有效划分等代数性质.首先,提出了完全的、不可约的概率有限自动机,概率有限自动机的并积等概念.然后,讨论了两个概率有限自动机的级联积、圈积、并积的有效划分与其因子的有效划分之间的关系,证明了在一定条件下两个概率有限自动机的级联积(并积)的商概率有限自动机与其因子的商概率有限自动机的级联积(并积)是相等的.最后,得到了概率有限自动机的极大有效划分的一个刻画.     

直觉模糊有限自动机的乘积

给出了直觉模糊有限自动机的广义直积、级联积和圈积及覆盖的定义,讨论了直觉模糊有限自动机在同构意义下级联积和圈积满足结合性以及各种乘积之间的覆盖关系。     

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.