A delay-dependent LMI approach to dynamics analysis of discrete-time recurrent neural networks with time-varying delays

This is the post print version of the article. The official published version can be obtained from the link below - Copyright 2007 Elsevier Ltd.In this Letter, the analysis problem for the existence and stability of periodic solutions is investigated for a class of general discrete-time recurrent neural networks with time-varying delays. For the neural networks under study, a generalized activation function is considered, and the traditional assumptions on the boundedness, monotony and differentiability of the activation functions are removed. By employing the latest free-weighting matrix method, an appropriate Lyapunov–Krasovskii functional is constructed and several sufficient conditions are established to ensure the existence, uniqueness, and globally exponential stability of the periodic solution for the addressed neural network. The conditions are dependent on both the lower bound and upper bound of the time-varying time delays. Furthermore, the conditions are expressed in terms of the linear matrix inequalities (LMIs), which can be checked numerically using the effective LMI toolbox in MATLAB. Two simulation examples are given to show the effectiveness and less conservatism of the proposed criteria.This work was supported in part by the National Natural Science Foundation of China under Grant 50608072, an International Joint Project sponsored by the Royal Society of the UK and the National Natural Science Foundation of China, and the Alexander von Humboldt Foundation of Germany

Symbol error rate analysis for M-QAM modulated physical-layer network coding with phase errors

Recent theoretical studies of physical-layer network coding (PNC) show much interest on high-level modulation, such as M-ary quadrature amplitude modulation (M-QAM), and most related works are based on the assumption of phase synchrony. The possible presence of synchronization error and channel estimation error highlight the demand of analyzing the symbol error rate (SER) performance of PNC under different phase errors. Assuming synchronization and a general constellation mapping method, which maps the superposed signal into a set of M coded symbols, in this paper, we analytically derive the SER for M-QAM modulated PNC under different phase errors. We obtain an approximation of SER for general M-QAM modulations, as well as exact SER for quadrature phase-shift keying (QPSK), i.e. 4-QAM. Afterwards, theoretical results are verified by Monte Carlo simulations. The results in this paper can be used as benchmarks for designing practical systems supporting PNC. © 2012 IEEE

Integrate the GM(1,1) and Verhulst models to predict software stage effort

This is the author's accepted manuscript. The final published article is available from the link below. Copyright @ 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.Software effort prediction clearly plays a crucial role in software project management. In keeping with more dynamic approaches to software development, it is not sufficient to only predict the whole-project effort at an early stage. Rather, the project manager must also dynamically predict the effort of different stages or activities during the software development process. This can assist the project manager to reestimate effort and adjust the project plan, thus avoiding effort or schedule overruns. This paper presents a method for software physical time stage-effort prediction based on grey models GM(1,1) and Verhulst. This method establishes models dynamically according to particular types of stage-effort sequences, and can adapt to particular development methodologies automatically by using a novel grey feedback mechanism. We evaluate the proposed method with a large-scale real-world software engineering dataset, and compare it with the linear regression method and the Kalman filter method, revealing that accuracy has been improved by at least 28% and 50%, respectively. The results indicate that the method can be effective and has considerable potential. We believe that stage predictions could be a useful complement to whole-project effort prediction methods.National Natural Science Foundation of China and the Hi-Tech Research and Development Program of Chin

New Terms for the Compact Form of Electroweak Chiral Lagrangian

The compact form of the electroweak chiral Lagrangian is a reformulation of its original form and is expressed in terms of chiral rotated electroweak gauge fields, which is crucial for relating the information of underlying theories to the coefficients of the low-energy effective Lagrangian. However the compact form obtained in previous works is not complete. In this letter we add several new chiral invariant terms to it and discuss the contributions of these terms to the original electroweak chiral Lagrangian.Comment: 3 pages, references adde