AN OPTIMIZED GLOBAL SYNCHRONIZATION ON SDDCN
Journal Title: Indian Journal of Computer Science and Engineering - Year 2010, Vol 1, Issue 4
Abstract
The complex networks have been gaining increasing research attention because of their potential applications in many real-world systems from a variety of fields such as biology, social systems, linguistic networks, and technological systems. In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discrete time stochastic complex networks with randomly occurred nonlinearities (RONs) and time delays. The discrete-time complex networks under consideration are subject to: 1) stochastic nonlinearities that occur according to the Bernoulli distributed white noise sequences; 2) stochastic disturbances that enter the coupling term, the delayed coupling term as well as the overall network; and 3) time delays that include both the discrete and distributed ones. Note that the newly introduced RONs and the multiple stochastic disturbances can better reflect the dynamical behaviors of coupled complex networks whose information transmission process is affected by a noisy environment. By constructing a novel Lyapunov-like matrix functional, the idea of delay fractioning is applied to deal with the addressed synchronization analysis problem. By employing a combination of the linear matrix inequality (LMI) techniques, the free-weighting matrix method and stochastic analysis theories, several delay-dependent sufficient conditions are obtained which ensure the asymptotic synchronization in the mean square sense for the discrete-time stochastic complex networks with time delays. The criteria derived are characterized in terms of LMIs whose solution can be solved by utilizing the standard numerical software. While these solvers are significantly faster than classical convex optimization algorithms, it should be kept in mind that the complexity of LMI computations remains higher than that of solving, say, a Riccati equation. For instance, problems with a thousand design variables typically take over an hour on today’s workstations. However, this thesis proposes LMI optimization technique to solve this problem. The advantage of the proposed approach is that resulting stability criterion can be used efficiently via existing numerical convex optimization algorithms such as the interior-point algorithms for solving LMIs
Authors and Affiliations
T. SANTHA , M. SHARANYA
Keywords
Related Articles
- EP ID EP139835
- DOI -
- Views 120
- Downloads 0
A STUDY ON DIFFERENT FEATURE EXTRACTION TECHNIQUES FOR LESION IDENTIFICATION IN MRI BREAST IMAGES
This study discusses the different feature extraction techniques for lesion identification in Dynamic Contrast Enhancement - Magnetic Resonance Imaging (DCE - MRI) of Breast. In DCE- MRI, kinetic feature extraction is a...
A FREQUENT DOCUMENT MINING ALGORITHM WITH CLUSTERING
Now days, finding the association rule from large number of item-set become very popular issue in the field of data mining. To determine the association rule researchers implemented a lot of algorithms and techniques. FP...
APPLICABILITY OF CLOUD COMPUTING IN ACADEMIA
The Indian Education sector has seen a tremendous rise in the field of higher education which has led to the demand for the automation of education sector at all the levels in order to cater to the need of information of...
AN OPTICAL NEURAL NETWORK MODEL FOR MINING FREQUENT ITEMSETS IN LARGE DATABASES
This paper proposes a model for mining frequent patterns in large databases by implementing Optical Neural Networks. The whole database is scanned only once and stored as a matrix. The frequent patterns are then mined fr...
MSA AGENT FOR MULTIMEDIA APPLICATIONS
The MSA Agent is the software developed to design rectangular and U slotted micro strip antenna. It is applied for the various applications such as satellite communications, UHF applications. Within the multimedia freque...