Volume 8, Number 4, 2011
This paper proposes an adaptive synchronization problem for the master and slave structure of linear systems with nonlinear perturbations and mixed time-varying delays comprising different discrete and distributed time delays. Using an appropriate Lyapunov-Krasovskii functional, some delay-dependent sufficient conditions and an adaptation law including the master-slave parameters are established for designing a delayed synchronization law in terms of linear matrix inequalities(LMIs). The time-varying controller guarantees the H synchronization of the two coupled master and slave systems regardless of their initial states. Particularly, it is shown that the synchronization speed can be controlled by adjusting the updated gain of the synchronization signal. Two numerical examples are given to demonstrate the effectiveness of the method.
In this paper, we present a new sufficient condition for absolute stability of Lure system with two additive time-varying delay components. This criterion is expressed as a set of linear matrix inequalities (LMIs), which can be readily tested by using standard numerical software. We use this new criterion to stabilize a class of nonlinear time-delay systems. Some numerical examples are given to illustrate the applicability of the results using standard numerical software.
An adaptive iterative learning control scheme is presented for a class of strict-feedback nonlinear time-delay systems, with unknown nonlinearly parameterised and time-varying disturbed functions of known periods. Radial basis function neural network and Fourier series expansion (FSE) are combined into a new function approximator to model each suitable disturbed function in systems. The requirement of the traditional iterative learning control algorithm on the nonlinear functions (such as global Lipschitz condition) is relaxed. Furthermore, by using appropriate Lyapunov-Krasovskii functionals, all signs in the closed loop system are guaranteed to be semiglobally uniformly ultimately bounded, and the output of the system is proved to converge to the desired trajectory. A simulation example is provided to illustrate the effectiveness of the control scheme.
This paper presents a new algorithm for de-noising global positioning system (GPS) and inertial navigation system (INS) data and estimates the INS error using wavelet multi-resolution analysis algorithm (WMRA)-based genetic algorithm (GA) with a well-designed structure appropriate for practical and real time implementations because of its very short training time and elevated accuracy. Different techniques have been implemented to de-noise and estimate the INS and GPS errors. Wavelet de-noising is one of the most exploited techniques that have been recently used to increase the precision and reliability of the integrated GPS/INS navigation system. To ameliorate the WMRA algorithm, GA was exploited to optimize the wavelet parameters so as to determine the best wavelet filter, thresholding selection rule (TSR), and the optimum level of decomposition (LOD). This results in increasing the robustness of the WMRA algorithm to estimate the INS error. The proposed intelligent technique has overcome the drawbacks of the tedious selection for WMRA algorithm parameters. Finally, the proposed method improved the stability and reliability of the estimated INS error using real field test data.
In this paper, a consensus algorithm of multi-agent second-order dynamical systems with nonsymmetric interconnection and heterogeneous delays is studied. With the hypothesis of directed weighted topology graph with a globally reachable node, decentralized consensus condition is obtained by applying generalized Nyquist criterion. For the systems with both communication and input delays, it is shown that the consensus condition is dependent on input delays but independent of communication delays.
A squirrel cage induction generator (SCIG) offers many advantages for wind energy conversion systems but suffers from poor voltage regulation under varying operating conditions. The value of excitation capacitance Cexct is very crucial for the self-excitation and voltage build-up as well as voltage regulation in SCIG. Precise calculation of the value of Cexct is, therefore, of considerable practical importance. Most of the existing calculation methods make use of the steady-state model of the SCIG in conjunction with some numerical iterative method to determine the minimum value of Cexct. But this results in over estimation, leading to poor transient dynamics. This paper presents a novel method, which can precisely calculate the value of Cexct by taking into account the behavior of the magnetizing inductance during saturation. Interval analysis has been used to solve the equations. In the proposed method, a range of magnetizing inductance values in the saturation region are included in the calculation of Cexct, required for the self-excitation of a 3- induction generator. Mathematical analysis to derive the basic equation and application of interval method is presented. The method also yields the magnetizing inductance value in the saturation region which corresponds to an optimum Cexct(min)
Some wafer fabrication processes performed by cluster tools require revisiting. With wafer revisiting, a cluster tool is very difficult to be scheduled due to a large number of possible schedules for the revisiting process. Atomic layer deposition (ALD) is a typical process with wafer revisiting that should be performed by cluster tools. This paper discusses the scheduling problem of single-arm cluster tools for the ALD process. In scheduling such a system, the most difficult part is to schedule the revisiting process such that the cycle time is minimized. Thus, this paper studies the revisiting process of ALD with revisiting times k = 3, 4, and 5, and analytical expressions are obtained to calculate the cycle time for the k possible schedules. Then, the schedule with the minimal cycle time is the optimal one. In this way, the scheduling problem of such a revisiting process becomes very simple and this is a significant improvement in scheduling cluster tools with wafer revisiting. Illustrative example is presented to show the application of the proposed method.
In this paper, we investigate the control problem of autonomous bay parking system. We choose a referenced parking lot and define a suitable parking spot based on some measurements at various places. A kinetic model is set up for the convenience of analysis and simulation. The pose of the car during the parking procedure can be determined by the initial pose, the backward speed, and the steering angle of the wheel. Then, both a fuzzy speed controller and a fuzzy steering controller are designed for the bay parking. Finally, simulation results show the effectiveness of our designed controllers.
This paper presents a symmetric cooperation strategy for cooperative relay networks with multiple users. The multi-user symmetric cooperation model and the relay selection algorithm are proposed. Then, the time slot allocation problem is cast into a bargaining problem, and the optimal time slot allocation solution is obtained by Nash bargaining solution (NBS). Moreover, we also consider the implementations of the cooperation strategy, i.e., the grouping and admission control algorithm. Simulation results show that users can obtain larger rates under the symmetric cooperation strategy than the non-cooperative case.
This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes (mQN) model. In this model, expressions are derived to calculate two performance metrics, namely, the queue node and system utilization factors. In order to demonstrate the flexibility and effectiveness of the mQN model in analyzing the performance of an mQN network router, two scenarios are performed. These scenarios investigated the variation of queue nodes and system utilization factors against queue nodes dropping probability for various system sizes and packets arrival routing probabilities. The performed scenarios demonstrated that the mQN analytical model is more flexible and effective when compared with experimental tests and computer simulations in assessing the performance of an mQN network router.
This paper is concerned with the robust H filter problem for networked environments, which are subject to both transmission delay and packet dropouts randomly. By employing random series which have Bernoulli distributions taking value of 0 or 1, the data transmission model is obtained. Based on state augmentation and stochastic theory, the sufficient condition for robust stability with H constraints is derived for the filtering error system. The robust filter is designed in terms of feasibility of one certain linear matrix inequality (LMI), which is formed by adopting matrix congruence transformations. A numerical example is given to show the effectiveness of the proposed filtering method.
Writable XOR executable (WX) and address space layout randomisation (ASLR) have elevated the understanding necessary to perpetrate buffer overflow exploits. However, they have not proved to be a panacea[1-3], and so other mechanisms, such as stack guards and prelinking, have been introduced. In this paper, we show that host-based protection still does not offer a complete solution. To demonstrate the protection inadequacies, we perform an over the network brute force return-to-libc attack against a preforking concurrent server to gain remote access to a shell. The attack defeats host protection including WX and ASLR. We then demonstrate that deploying a network intrusion detection systems (NIDS) with appropriate signatures can detect this attack efficiently.
In this paper, we first investigate input passivity and output passivity for a class of impulsive complex networks with time-varying delays. By constructing suitable Lyapunov functionals, some input passivity and output passivity conditions are derived for the impulsive complex networks. Finally, an example is given to show the effectiveness of the proposed criteria.
In this correspondence paper, an equivalent stability criterion with minimal number of linear matrix inequality (LMI) variables is presented for a delay-dependent stability criterion reported recently in the International Journal of Automation and Computing for a class of linear discrete-time systems with additive time delays. The reported stability criterion for the additive time-delay systems has more number of matrix variables in the LMI and, hence, demand additional computational burden. The proposed equivalent stability criterion, unlike the reported one, does not involve free-weighing matrices and encompass only the matrix variables that are associated in the Lyapunov-Krasovskii functional, making the criterion mathematically less complex and computationally more effective.