On a synchronization queue with two finite buffers

In this paper, we consider a synchronization queue (or synchronization node) consisting of two buffers with finite capacities. One stream of tokens arriving at the system forms a Poisson process and the other forms a PH-renewal process. The tokens are held in the buffers until one is available from each flow, and then a group-token is instantaneously released as a synchronized departure. We show that the output stream of a synchronization queue is a Markov renewal process, and that the time between consecutive departures has a phase type distribution. Thus, we obtain the throughput of this synchronization queue and the loss probabilities of each type of tokens. Moreover, we consider an extended synchronization model with two Poisson streams where a departing group-token consists of several tokens in each buffer. This revised version was published online in June 2006 with corrections to the Cover Date.     

Synchronization of neural networks based on parameter identification and via output or state coupling

For neural networks with all the parameters unknown, we focus on the global robust synchronization between two coupled neural networks with time-varying delay that are linearly and unidirectionally coupled. First, we use Lyapunov functionals to establish general theoretical conditions for designing the coupling matrix. Neither symmetry nor negative (positive) definiteness of the coupling matrix are required; under less restrictive conditions, the two coupled chaotic neural networks can achieve global robust synchronization regardless of their initial states. Second, by employing the invariance principle of functional differential equations, a simple, analytical, and rigorous adaptive feedback scheme is proposed for the robust synchronization of almost all kinds of coupled neural networks with time-varying delay based on the parameter identification of uncertain delayed neural networks. Finally, numerical simulations validate the effectiveness and feasibility of the proposed technique.     

On parallel asynchronous high-order solutions of parabolic PDEs

In achieving significant speed-up on parallel machines, a major obstacle is the overhead associated with synchronizing the concurrent processes. This paper presents high-orderparallel asynchronous schemes, which are schemes that are specifically designed to minimize the associated synchronization overhead of a parallel machine in solving parabolic PDEs. They are asynchronous in the sense that each processor is allowed to advance at its own speed. Thus, these schemes are suitable for single (or multi) user shared memory or (message passing) MIMD multiprocessors. Our approach is demonstrated for the solution of the multidimensional heat equation, of which we present a spatial second-order Parametric Asynchronous Finite-Difference (PAFD) scheme. The well-known synchronous schemes are obtained as its special cases. This is a generalization and expansion of the results in [5] and [7]. The consistency, stability and convergence of this scheme are investigated in detail. Numerical tests show that although PAFD provides the desired order of accuracy, its efficiency is inadequate when performed on each grid point.In an alternative approach that uses domain decomposition, the problem domain is divided among the processors. Each processor computes its subdomain mostly independently, while the PAFD scheme provides the solutions at the subdomains' boundaries. We use high-order finite-difference implicit scheme within each subdomain and determine the values at subdomains' boundaries by the PAFD scheme. Moreover, in order to allow larger time-step, we use remote neighbors' values rather than those of the immediate neighbors. Numerical tests show that this approach provides high efficiency and in the case which uses remote neighbors' values an almost linear speedup is achieved. Schemes similar to the PAFD can be developed for other types of equations [3].This research was supported by the fund for promotion of research at the Technion.     

一类非光滑Chua’s电路的同步控制

本文研究两个带x|x|非线性项的Chua’s电路的全局指数同步和全局同步的控制问题.证明这两个系统在未加控制时不可能同步,但设计不同的控制器可以实现这两个系统的全局指数同步和全局同步.     

Constructions of optimal difference systems of sets

Difference systems of sets (DSSs) are combinatorial configurations which were introduced in 1971 by Levenstein for the construction of codes for synchronization. In this paper, we present two kinds of constructions of difference systems of sets by using disjoint difference families and a special type of difference sets, respectively. As a consequence, new infinite classes of optimal DSSs are obtained.     

一类不确定混沌系统的自适应同步

讨论了混沌系统的同步问题 .对一类不确定混沌系统 ,提出了一个新的自适应同步方法 ,可使响应系统在自适应控制器的控制下 ,实现与不确定混沌系统的同步 .最后给出了一个设计实例 .     

Global exponential synchronization of nonlinear time-delay Lur’e systems via delayed impulsive control

This paper is concerned with the global exponential synchronization problem of two identical nonlinear time-delay Lur’e systems via delayed impulsive control. Some novel impulsive synchronization criteria are obtained by introducing a discontinuous Lyapunov function and by using the Lyapunov–Razumikhin technique, which are expressed in forms of linear matrix inequalities. The derived criteria reveal the effects of impulsive input delays and impulsive intervals on the stability of synchronization error systems. Then, sufficient conditions on the existence of a delayed impulsive controller are derived by employing these newly-obtained synchronization criteria. Additionally, some synchronization criteria for two identical time-delay Lur’e systems with impulsive effects are presented by using delayed continuous feedback control. The synchronization criteria via delayed continuous feedback control can deal with the case when the impulsive control strategy fails to synchronize two identical impulsive time-delay Lur’e systems. Three numerical examples are provided to illustrate the efficiency of the obtained results.     

Optimal coordination of directional over-current relays using informative differential evolution algorithm

Growing interconnection in distribution system creates new problem for protection engineers. Particularly the design of overcurrent relay coordination in such system is an independent area of research. With the availability of new artificial based optimization algorithm relay coordination research gain a new momentum. Well established artificial based optimization algorithm such as genetic and particle swam optimization are successfully applied for such applications. This paper discusses the application of informative differential evolution algorithm with self adaptive re-clustering technique for selection of TDS and PSM for optimal coordination of directional overcurrent relays. Both continuous as well as discrete version of informative differential evolution algorithm are used for optimization of relay setting. Proper combination of backup relays for each primary relay are identified by using LINKNET graph theory approach. Coordination of directional overcurrent is developed for 9 bus and IEEE 30 bus distribution systems. The aim of problem is to minimize the total operating time of primary relays and eliminate the miscoordination among the primary and backup relay pairs. Discrete types of settings for electromechanical types of relay are also discussed in this paper. Moreover, the relay coordination problem is modified for providing optimal coordination time interval between 0.2 and 0.8 s among all primary and backup relays pairs. The results are compared with hybrid of genetic algorithm – nonlinear programming and sequential quadratic programming. Digsilient power factory software is used for verification of result.     

继承异常的一种解决方法

继承异常用来描述在并发面向对象语言中继承与并发的冲突．对继承异常做了系统的分析，给出一种新的分类．提出在一并发对象中将同步部分与顺序部分分离，生成两个对象，通过将同步代码放入一单独对象，将继承过程分为顺序部分和同步部分，这种分离大大地减少了继承异常的发生．     

混沌系统的非线性连续预测变结构控制与同步

在连续时间混沌系统的控制与同步问题统一处理的基础上,给出一种可实现两个相同或不同连续时间混沌系统的控制与同步的预测变结构控制方法.其控制器由针对对象标称非线性模型设计的连续预测控制器和针对对象不确定性设计的滑模变结构控制器组成.所提出的方案具有变结构控制鲁棒性强的优点,实现了系统对参考信号的追踪控制.数值仿真表明了本方法的有效性 关键词： 混沌同步 预测控制 滑模 变结构 鲁棒性