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.
41960488
Global Exponential Stability of Non-autonomous Neural Networks with Variable Delay
The aim of this work is to discuss the exponential stability of the non-autonomous neural networks with delay. By applying the generalized Halanay inequality and Lyapunov second method, several sufficient conditions are obtained ensuring the global exponential stability of the non-autonomous neural networks. Some previous results are improved and extended in this paper. In the end, a example is also given for illustration.
27173246
Stochastic Lotka-Volterra Competitive Systems with Variable Delay
In this paper we reveal that the environmental noise will not only suppress a potential population explosion in the stochastic Lotka-Volterra competitive systems with variable delay, but also make the solutions to be stochastically ultimately bounded. To reveal these interesting facts, we stochastically perturb the Lotka-Volterra competitive systems with variable delay ẋ(t)=diag(x1(t),...,xn(t))[b+Ax(t−δ(t))] into the Ito form dx(t)=diag(x1(t),...,xn(t))[b+Ax(t−δ(t))]dt+σx(t)dw(t) and show that although the solution to the original delay systems may explode to infinity in a finite time, with probability one that of the associated stochastic delay systems do not. We also show that the stochastic systems will be stochastically ultimately bounded without any additional conditions on the matrix A.
17992421
Asymptotic behavior of stochastic Cohen-Grossberg neural networks with variable delays
Using Chebyshev inequality and nonnegative semi-martingale convergence theorem, the paper investigates asymptotic behavior of stochastic Cohen-Grossberg neural networks with delay by constructing suitable Lyapunov functional. Algebraic criteria are given for stochastic ultimate bounded and almost exponential stability. The result in the paper extend the main conclusion. In the end, examples are given to verify 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.
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.
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.
11028073
The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking)
Abstract Let τ be the 2-cycle (1 2) and σ the n-cycle (12 … n). These two cycles generate the symmetric group Sn. Let Gn denote the directed Cayley graph Cay(τ, σ: Sn). Based on erroneous computer calculations, Nijenhuis and Wilf (1975, p. 238; 1978, p. 288) give as an exercise to show that G5 does not have a Hamiltonian path. To the contrary, we show that G5 is Hamiltonian. Furthermore, we show that G6 has a Hamilton path. Our results illustrate how a little theory and some good luck can save a lot of time in backtracking searches.
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.
32545163
Access Protocol with Efficient Slot Reuse in WDM Metro Ring
This letter provides a scalable slotted ring network architecture with nodes using one fixed transmitter, one tunable transmitter and multiple fixed receivers. Furthermore, the novel access protocol with efficient slot reuse is proposed. Theoretical analysis and simulation results show that protocol can achieve high node throughput and low queuing delay.
5277394
Cone-beam reconstruction for Micro-CT
X-ray micro-CT has been a focus in the CT/Micro-CT Lab, the University of Iowa. In this paper, some recent progress we made on cone-beam micro-CT is described. First, we address approximation reconstruction using Feldkamp-type algorithms with multiple X-ray sources and displaced detector configurations. Then, we explain three types of artifacts associated with exact reconstruction in the Grangeat framework. Finally, we report the convergence of a generalized block-iterative Landweber scheme. Representative images from simulation and experiments are also given.