22084654
An LMI-Based Approach to the Global Stability of Bidirectional Associative Memory Neural Networks with Variable Delay
Based on the linear matrix inequality (LMI), new sufficient conditions on the global exponential stability and asymptotic stability of bidirectional associative memory neural networks with variable delay are presented, and exponential converging velocity index is estimated. Furthermore, the results in this paper are less conservative than the ones reported so far in the literature. One example is given to illustrate the feasibility of our main results.
22450251
Finite-Time Boundedness Analysis of Uncertain CGNNs with Multiple Delays
The problem of finite-time boundedness(FTB) for a class of Cohen-Grossberg neural networks(CGNNs) with multiple delays and parameter perturbations is analyzed in this paper By way of extending the concept of FTB for time delay system and constructing a suitable Lyapunov function and using linear matrix inequality(LMI) technique, some delay-dependent criteria are derived to guarantee FTB for uncertain and certain CGNNs with multiple delays Meanwhile, an algorithm is also presented Finally, simulation examples are given to demonstrate the effectiveness of the conclusion.
2869717
Global Exponential Stability of Cohen-Grossberg Neural Networks with Time-Varying Delays and Continuously Distributed Delays
In this paper, we investigate the global exponential stability for a class of Cohen-Grossberg neural networks (CGNN) with time-varying delays and continuously distributed delays. CGNN herein is a general neural networks model which includes some well-known neural networks as its special cases. Firstly, applying the homeomorphism theory, we establish the new sufficient condition of existence and uniqueness of the equilibrium point to CGNN. Then, the sufficient criteria of global exponential stability of CGNN, which are easy to verify, are given by M-matrix. Our results imply and generalize some existed ones in previous literature. Furthermore, it is convenient to estimate the exponential convergence rates of the neural networks by using the criteria. Compared with the previous methods, our method does not resort to any Lyapunov functions or functionals. Finally, a example is given to illustrate the effective of our results.
38454938
A Generalized LMI-Based Approach to the Global Exponential Stability of Recurrent Neural Networks with Delay
A new theoretical result on the global exponential stability of recurrent neural networks with delay is presented. It should be noted that the activation functions of recurrent neural network do not require to be bounded. The presented criterion, which has the attractive feature of possessing the structure of linear matrix inequality (LMI), is a generalization and improvement over some previous criteria. A example is given to illustrate our results.
22663495
Improved Results on Solving Quadratic Programming Problems with Delayed Neural Network
In this paper, in terms of a linear matrix inequality (LMI), using a delayed Lagrangian network to solve quadratic programming problems, sufficient conditions on delay-dependent and delay-independent are given to guarantee the globally exponential stability of the delayed neural network at the optimal solution. In addition, exponential convergence rate is estimated by the equation in the paper. Furthermore, the results in this paper improved the ones reported in the existing literatures and the proposed sufficient condition can be checked easily by solving LMI. Two simulation examples are provided to show the effectiveness of the approach and applicability of the proposed criteria.
206588770
Stochastic High-Order Hopfield Neural Networks
In 1984 Hopfield showed that the time evolution of a symmetric Hopfield neural networks are a motion in state space that seeks out minima in the energy function (i.e., equilibrium point set of Hopfield neural networks). Because high-order Hopfield neural networks have more extensive applications than Hopfield neural networks, and have been discussed on the convergence of the networks. In practice, a neural network is often subject to environmental noise. It is therefore useful and interesting to find out whether the high-order neural network system still approacher some limit set under stochastic perturbation. In this paper, we will give a number of useful bounds for the noise intensity under which the stochastic high-order neural network will approach its limit set. Our result cancels the requirement of symmetry of the connection weight matrix and includes the classic result on Hopfield neural networks, which is a special case of stochastic high-order Hopfield neural networks. In the end, A example is given to verify the effective of our results.
35446973
Convergence of iterative algorithms for image reconstruction
We introduce a general iterative scheme for image reconstruction based on Landweber's method. Within our configuration, the block-iterative (BI) version can be formulated from its simultaneous version easily, and vice versa. This provides the mechanism to formulate new algorithms from known algorithms. It can be shown that some of the widely used iterative algorithms, such as the ART, SART, Cimmino's Algorithm and recently designed DWE and CAV, are special examples of the general scheme or its BI version. By applying the convergence results of the general scheme, the corresponding convergence in the consistent or inconsistent cases, for the block-iterative or simultaneous versions, of those specific algorithms can be established under mild conditions on the relaxation parameters.
13273751
Robust Document Image Authentication
In this paper, we propose a novel method for robust document image authentication. In the proposed method, characters and symbols on a binary document are first grouped into different classes based on k-means clustering in the feature space. Labels are then assigned to the different classes. An ordered sequence of labels formed from the characters and symbols on the document is then used to compute a digital signature. This is achieved by using a cryptographic hash function and a secret key. The computed signature can be appended at the end of an electronic document file, or printed on a hardcopy document in the form of a bar code. Using this method, we will be able to detect any intentional content alteration to the document, but at the same time tolerate moderate amount of noise introduced by printing, scanning, and photocopying of the document. Experimental results demonstrate the effectiveness of the proposed approach.
3242735
Feature Mining Paradigms for Scientific Data
Numerical simulation is replacing experimentation as a means to gain insight into complex physical phenomena. Analyzing the data produced by such simulations is extremely challenging, given the enormous sizes of the datasets involved. In order to make efficient progress, analyzing such data must advance from current techniques that only visualize static images of the data, to novel techniques that can mine, track, and visualize the important features in the data. In this paper, we present our research on a unified framework that addresses this critical challenge in two science domains: computational fluid dynamics and molecular dynamics. We offer a systematic approach to detect the significant features in both domains, characterize and track them, and formulate hypotheses with regard to their complex evolution. Our framework includes two paradigms for feature mining, and the choice of one over the other, for a given application, can be determined based on local or global influence of relevant features in the data.
992437
Iterative MIMO Channel Estimation for Next Generation Wireless Systems
The combination of multiple-input multiple-output (MIMO) technology and orthogonal frequency division multiplexing (OFDM) has been considered as an attractive solution for the next generation wireless communication networks. In comparison with single-input single-output (SISO) systems, channel estimation in the MIMO scenario becomes more challenging, owing to the increased number of independent transmitter-receiver links to be estimated. In this paper, we introduce an enhanced iterative channel estimation method, which is capable of providing genetically optimized channel information for uplink multi-user MIMO OFDM receivers, approaching the optimal benchmark arrangement utilizing perfect channel knowledge. The effectiveness of the proposed scheme is demonstrated by a range of numerical results under realistic scenarios.
26953688
Determining the hamilton-connectedness of certain vertex-transitive graphs
Abstract Faber and Moore have proposed a class of vertex-transitive digraphs as a model of directed inconnection networks. These networks have attractive degree versus diameter properties. We show that these digraphs are Hamiltonian and provide necessary and sufficient conditions for the existence of a Hamilton path between any two vertices. Particular cases of these digraphs are the right rotation Cayley digraphs Cay ( X n : S n where X n is the set of right rotations (1 2 s i −1 i) for i=2,3,…,n . Another class of vertex-transitive graphs that have been proposed as models of inconnection networks are the arrangement graphs introduced by Day and Tripathi. They have the same vertex set as the Faber–Moore digraphs. We prove that arrangement graphs are Hamilton-connected.