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.
27820093
A Modified Projection Neural Network for Linear Variational Inequalities and Quadratic Optimization Problems
Variational inequalities provide us with a tool to study a wide class of optimization arising in pure and applied sciences. In the paper,we present a neural network for solving linear variational inequalities and quadratic optimization by using a projection techniques. We also consider the global uniqueness of the solution of the neural network as well as the convergence of the modified projection neural network. Our results present a significant improvement of previously known projection methods for solving variational inequalities and related optimization problems. Two simulation examples are provided to show the effectiveness of the approach and applicability of the proposed criteria.
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.
18835292
HUX: handling updates in XML
We demonstrate HUX (Handling Updates in XML) which provides a reliable and efficient solution for the XML view update problem. Given an update over an XML view, our U-Filter subsytem first determines whether the update is translatable or not by examining potential conflicts in both schema and data. If an update is determined to be translatable, our U-Translator subsystem searches potential translations and finds a "good" one. Our demonstration illustrates the working, as well as the performance, of the two sub-systems within HUX for different application scenarios.
1715622
Spatial domain wavelet design for feature preservation in computational data sets
High-fidelity wavelet transforms can facilitate visualization and analysis of large scientific data sets. However, it is important that salient characteristics of the original features be preserved under the transformation. We present a set of filter design axioms in the spatial domain which ensure that certain feature characteristics are preserved from scale to scale and that the resulting filters correspond to wavelet transforms admitting in-place implementation. We demonstrate how the axioms can be used to design linear feature-preserving filters that are optimal in the sense that they are closest in L2 to the ideal low pass filter. We are particularly interested in linear wavelet transforms for large data sets generated by computational fluid dynamics simulations. Our effort is different from classical filter design approaches which focus solely on performance in the frequency domain. Results are included that demonstrate the feature-preservation characteristics of our filters
15784053
Quantitative steganalysis of binary images
We propose a quantitative steganalysis method to detect hidden information embedded by flipping pixels along boundaries in binary images. We model steganographic embedding as an additive noise process and use compression rate as a distinguishing statistic that aids in discriminating between stego-images and cover-images. We specifically use the JBIG 2 binary image compression algorithm to derive a quantitative relation between compression rate and embedding rate. Based on this relationship, a practical steganalysis technique is proposed by examining the change of compression rate as embedding rate increases. Experiments conducted show that the proposed technique can reliably detect a steganographic embedding process that flips boundary pixels. Furthermore, it can estimate embedding rate with reasonable accuracy.
8684612
Steganalysis of boundary-based steganography using autoregressive model of digital boundaries
In this paper, we present a novel technique for the steganalysis of digital documents, when the secret message is embedded along the boundaries of text characters or other symbols in the documents. The proposed technique uses an auto-regressive model to detect marked documents, as well as to estimate the relative length of the embedded messages. Experimental results demonstrate the effectiveness and accuracy of the proposed technique