二元弱可逆有限自动机延迟步数的分解

本文考虑二元严格延迟τ步弱可逆有限自动机Ｍ的延迟步数的分解问题。首先证明如果Ｍ强连通且所有状态的延迟步数不小于τ－１，则Ｍ一定能分解为一个延迟０步弱可逆有限自动机和一个τ阶延迟元。然后证明如果Ｍ所有状态延迟步数均不小于ｍ，那么Ｍ可以分解为一个严格延τ－ｍ步弱可逆有限自动机和一个ｍ阶延迟元。最后考虑了Ｍ可分解为一个严格延迟τ－１步和一个严格延迟１步弱可逆有限自动机的条件。     

弱可逆有限自动机的分解

有限自动机公开钥密码体制的提出进一步激励了有限自动机可逆性的研究．在有限自动机公开钥密码体制中首次提出了自动机化合的概念．易知,两个弱可逆有限自动机的化合仍然是一个弱可逆有限自动机并且它的延迟步数不大于前两个有限自动机延迟步数之和．然而,另一方面,如何将一个弱可逆有限自动机分解为两个弱可逆有限自动机的化合却是一个非常困难的问题．该文主要考虑了一类n元严格延迟τ步弱可逆有限自动机M的延迟步数的分解问题．给出了一类特殊的n元弱可逆有限自动机分解的条件和结果．首先证明了如果对M中的每个状态s有T（s,τ）枝等,则M可分解为τ个延迟1步弱可逆有限自动机的化合．然后证明了M可分解为一个τ—m步弱可逆有限自动机和m阶延迟元的充要条件是对M中的每个状态s有T（s,m）枝等．     

弱可逆拟(r,r)阶存贮线性有限自动机的分解

通过对延迟r步弱可逆拟(r,r)阶存贮线性有限自动机输出权的研究,得出对延迟r步弱可逆拟(r,r)阶存贮线性有限自动机的任意一个状态,它的长r的输出权都是1;任何一个n元拟(r,r)阶存贮线性有限自动机M延迟r步弱可逆的充分必要条件是M都可以分解为一个延迟0步弱可逆有限自动机M0和一个延迟r步弱可逆拟(0,r)阶存贮线性有限自动机M1。     

分解弱可逆有限自动机的两个结果

研究弱可逆有限自动机的分解可以为分析有限自动机公开钥密码体制的安全性提供一种重要途径．从输出权的角度研究了n元延迟τ步弱可逆有限自动机M的分解问题,首先证明了其可分解为一个延迟0步弱可逆有限自动机和一个τ阶延迟元当且仅当M的所有状态的长τ输出权为1．其次,在获得一类不可分解出延迟元的弱可逆有限自动机的基础上,构造出一个反例,否定回答了鲍丰在1993年提出的一个公开问题．同时给出了二元严格延迟τ步强连通弱可逆有限自动机可分解为一个严格延迟τ—1步弱可逆有限自动机和一个严格延迟1步弱可逆有限自动机的一个充分条件．     

关于弱可逆线性有限自动机的弱逆的结构

本文研究的主要问题是:对给定延迟τ步弱可逆线性有限自动机M,求出M的所有延迟τ步弱逆线性有限自动机。解决的办法是:首先求出所有M的延迟τ步弱逆的传输函数矩阵,然后对每个传输函数矩降,求出以它为传输函数矩阵的所有M的延迟τ步弱逆。     

环上线性有限自动机的可逆性的一些结果

本文证明了有单位元的有限交换环R上任何延迟t步(弱)可逆线性有限自动机皆有延迟t步线性(弱)逆的充分必要条件是环R满足条件: x(Ax=0→bx=0)→y(b=yA)我们还证明了对任何有单有限交换环R,R上输入、输出维数相同的延迟t步(弱)可逆线性有限自动机具有延迟t步线性(弱)逆.     

关于二元延迟3步前馈逆有限自动机的结构

前馈逆有限自动机的结构是有限自动机可逆性理论中的基本问题.对延迟步数≥3的前馈逆结构的刻划,则是一个长期的未解决问题.研究了二元延迟3步前馈逆有限自动机的结构.对于自治有限自动机M_a的状态图为圈的二元延迟3步弱可逆半输入存储有限自动机C(M_af ),给出了其长3极小输出权分别为1,2,8三种情形下结构的一种刻画.由于C(M_af )延迟3步弱可逆当且仅当它是延迟3步弱逆,因此,得到了二元延迟3步前馈逆有限自动机结构的一种部分刻画.     

拟（h,k）存贮有限自动机的可逆性

主要研究拟（h,k）阶存贮有限自动机的延迟k步与k＋1步弱可逆性,以及它的弱逆,得到了拟（h,k）阶存贮有限自动机的延迟k步与k＋1步弱可逆的充分必要条件,并且通过所得结果可以比较简便地构造出延迟k步与k＋1步弱可逆拟（h,k）阶存贮有限自动机的延迟k步与k＋1步弱逆。     

拟(h,k)存贮有限自动机的可逆性

主要研究拟(h,k)阶存贮有限自动机的延迟k步与k+1步弱可逆性,以及它的弱逆,得到了拟(h,k)阶存贮有限自动机的延迟k步与k+1步弱可逆的充分必要条件,并且通过所得结果可以比较简便地构造出延迟k步与k+1步弱可逆拟(h,k)阶存贮有限自动机的延迟k步与k+1步弱逆.     

弱可逆线性有限自动机的一种分解

讨论有限自动机的分解有助于分析弱可逆有限自动机的结构和求解弱逆.首先证明了弱同构的弱可逆有限自动机具有相似的分解形式;接着考虑了一类特殊的弱可逆线性有限自动机的分解,从状态输出权的角度刻画了该分解存在的一个充分条件;然后把这种分解形式推广到了一般的弱可逆线性有限自动机上,即:延迟τ步弱可逆线性有限自动机分解成延迟0步弱可逆有限自动机和一种特殊的有限自动机MD,并得到了分解存在的充要条件;最后,用输出序列的代数性质来刻画其中的充分条件,并把它转化成了一个矩阵的秩的计算.这种分解形式并不局限于n元弱可逆有限自动机,而且分解条件也比较简单,仅与输出序列的性质有关.     

一类异步多速率采样控制系统的近似问题

本文提出了一类异步多速率采样控制系统．针对这类非周期异步多速率系统分析、设 计困难这一问题，研究了其闭环系统性能关于采样器、保持器时间延迟的连续性问题．结果 表明，其闭环系统性能是采样器、保持器时间延迟的连续函数．据此连续性，在少许改变系 统性能的前提下，可以以任意给定精度将非周期异步多速率系统转变成周期异步多速率系统 ，再应用已有方法对其进行处理．     

一种基于大规模网络分解和协调的WSNs MAC协议

针对树状拓扑的大规模传感器网络中存在的节点能量和传输效率问题,提出了一种基于大规模网络分解和协调的无线传感器网络(WSNs)MAC协议。该协议在路由信息的基础上对网络进行再一次分解,并采用了与之相适应的节点接入算法。实验结果表明:该协议总体能耗低、传达率高且具有一定的自适应性,同时网络时延并没有因为分层而增加。该协议对大规模无线传感器网络有良好的适用性。     

金字塔结构逻辑运用二值脉冲对简单图形处理

本文根据元胞自动机模型划分方法, 将二维图像分解为2×2矩阵单元结构. 提出了几种逻辑运算式, 用以分类由黑白二值点构成的2×2矩阵图形. 通过CNN神经网络的多层结构形式, 分析了金字塔结构逻辑在相似的组合形式下, 对二值图形边缘检测和池化的功能. 通过同步脉冲形式能将灰度图像, 分解为多个时间维度的二值图形, 方便多层金字塔逻辑运算处理. 分析了如何采用延时继电器使金字塔结构逻辑具有记忆的特性. 讨论了3×3输入金字塔模型, 在不规律脉冲情况下, 通过逻辑运算对线性交点检测的可能.     

Stabilization of remote control systems with unknown time varying delays by LMI techniques

In this paper, the stabilization of one class of remote control systems with unknown time varying delays is analysed and discussed using LMI techniques. A discrete time state space model under a static control law for remote control systems is first introduced based on some assumptions on the uncertain term. The time delay is unknown, time varying, and can be decomposed into two parts: one fixed part which is unknown and is an integer multiple of the sampling time; the other part which is randomly varying but bounded by one sampling time. Static controller designs based on delay dependent stability conditions are presented. This system is then extended to a more general case when the randomly varying part of the time delay is not limited to one sampling time. The derivative of the time delay is not limited to be bounded. Hence, the contributions are as follow: (i) for a given controller, we can use these stability criteria to test stability of the resulted system; (ii) we can design a remote controller to stabilize an unstable system. Finally, simulation examples are presented to show the effectiveness of the proposed method and to demonstrate remote stabilization of open loop unstable systems.     

Predictor-based control of linear systems with large and variable measurement delays

This paper concerns the problem of the control of linear systems by means of feedback from delayed output, where the delay is known and time-varying. The main advantage of the approach is that it can be applied to systems with any delay bound, i.e. not only small delays. The predictor is based on a combination of finite-dimensional elementary predictors whose number can be suitably chosen to compensate any delay. The single-predictor element is an original proposal, and the class of delays to which the schema can be applied includes, but it is not limited to, continuous delay functions.     

Estimation methods for passage times using one-dependent cycles

The lengths of certain passage-time intervals (random time intervals) in discrete-event stochastic systems correspond to delays in computer, communication, manufacturing, and transportation systems. Simulation is often the only available means for analyzing a sequence of such lengths. It is sometimes possible to obtain meaningful estimates for the limiting average delay indirectly, that is, without measuring lengths of individual passage-time intervals. For general time-average limits of a sequence of delays, however, it is necessary to measure individual lengths and combine them to form point and interval estimates. We consider sequences of delays determined by state transitions of a generalized semi-Markov process and introduce a recursively-generated sequence of realvalued random vectors, called start vectors, to provide the link between the starts and terminations of passage-time intervals. This method of start vectors for measuring delays avoids the need to tag entities in the system. We show that if the generalized semi-Markov process has a recurrent single-state, then the sample paths of any sequence of delays can be decomposed into one-dependent, identically distributed cycles. We then show that an extension of the regenerative method for analysis of simulation output can be used to obtain meaningful point estimates and confidence intervals for time-average limits. This estimation procedure is valid not only when there are no ongoing passage times at any regeneration point but, unlike previous methods, also when the sequence of delays does not inherit regenerative structure. Application of these methods to a manufacturing cell with robots is discussed.     

Delay Dependent Exponential Stability for Fuzzy Recurrent Neural Networks with Interval Time-Varying Delay

In this paper, the problem of delay-dependent exponential stability for fuzzy recurrent neural networks with interval time-varying delay is investigated. The delay interval has been decomposed into multiple non equidistant subintervals, on these interval Lyapunov-Krasovskii functionals (LKFs) are constructed to study stability analysis. Employing these LKFs, an exponential stability criterion is proposed in terms of Linear Matrix Inequalities (LMIs) which can be easily solved by MATLAB LMI toolbox. Numerical example is given to illustrate the effectiveness of the proposed method.     

Transaction decomposition using transaction semantics

Serializability has been widely accepted as the correctness criterion for databases subject to concurrent access. However, in a number of the newer and most challenging application areas, serializable execution may not be feasible.

? Serializable execution is generally implemented using a two-phase locking algorithm that locks items in the database to delay transactions that are in danger of performing in a non-serializable fashion. Such delays are unacceptable in high performance database systems that must process hundreds, and perhaps thousands, of transactions per second and in systems supporting long-running transactions.

? In systems in which data is distributed across a federated database, a global transaction is decomposed into a set of local subtransactions executed at a subset of the sites. Serializable execution in such systems not only incurs a performance penalty, but also requires the component systems to cooperate (for example in a two phase commit protocol), with a resulting loss of site autonomy. In many applications, the component systems either can not or will not agree to the required cooperation.

A number of models have recently been proposed in which transactions are decomposed into smaller, atomic, interleavable steps. These models have the potential for improving performance since locks are released at the end of each step. Models of distributed transactions have also been proposed with the similarity that subtransactions correspond to steps. In most of this work serializability is no longer guaranteed. In this paper we propose a new, application-oriented, correctness criterion that utilizes transaction semantics. We treat transactions as programs whose semantics can be analyzed at design time. The effect of each transaction is specified using pre- and postconditions, and any schedule that preserves these conditions is permissible. Such schedules can produce database states that could not be reached by any serial execution. In addressing the issue of performance, we use transaction semantics to decompose transactions into steps and describe a concurrency control that controls step interleaving in such a way that assertions are preserved. The same model can be used to study the interleaving of subtransactions of concurrent distributed transactions.     

New results of stability analysis for systems with time‐varying delay

This paper studies the problem of stability analysis for continuous‐time systems with time‐varying delay. By developing a delay decomposition approach, the information of the delayed plant states can be taken into full consideration, and new delay‐dependent sufficient stability criteria are obtained in terms of linear matrix inequalities. The merits of the proposed results lie in their less conservatism, which are realized by choosing different Lyapunov matrices in the decomposed integral intervals and estimating the upper bound of some cross term more exactly. Numerical examples are given to illustrate the effectiveness and less conservatism of the proposed method. Copyright © 2009 John Wiley & Sons, Ltd.