Delay-dependent robust stability analysis for Markovian jumping stochastic Cohen–Grossberg neural networks with discrete interval and distributed time-varying delays

In this paper, the global asymptotical stability analysis problem is considered for a class of Markovian jumping stochastic Cohen–Grossberg neural networks (CGNNs) with discrete interval and distributed delays. The parameter uncertainties are assumed to be norm bounded and the discrete delay is assumed to be time-varying and belong to a given interval, which means that the lower and upper bounds of interval time-varying delays are available. An alternative delay-dependent stability analysis result is established based on the linear matrix inequality (LMI) technique, which can easily be checked by utilizing the numerically efficient Matlab LMI toolbox. Neither system transformation nor free weight matrix via Newton–Leibniz formula is required. Two numerical examples are provided to show that the proposed results significantly improve the allowable upper and lower bounds of delays over some existing results in the literature.     

Feedback synchronization of the fractional order reverse butterfly-shaped chaotic system and its application to digital cryptography

In this paper, the stability conditions and chaotic behaviors of new different fractional orders of reverse butterfly-shaped dynamical system are analytically and numerically investigated. Designing an appropriate feedback controller, the fractional order chaotic system is synchronized. Applying the synchronized fractional order systems in digital cryptography, a well secured key system is obtained. The numerical simulations are given to validate the correctness of the proposed synchronized fractional order chaotic systems and proposed key system.     

Solution to an open problem: a characterization of conditionally cancellative t-subnorms

In this work we solve an open problem of U. H?hle (Klement et?al. Fuzzy Sets Syst 145:471–479, 2004, Problem 11). We show that the solution gives a characterization of all conditionally cancellative t-subnorms. Further, we give an equivalence condition under which a conditionally cancellative t-subnorm has 1 as its neutral element and hence show that conditionally cancellative t-subnorms whose natural negations are strong are, in fact, t-norms.     

Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations

Given a simple undirected graph, the problem of finding a maximum subset of vertices satisfying a nontrivial, interesting property Π that is hereditary on induced subgraphs, is known to be NP-hard. Many well-known graph properties meet the above conditions, making the problem widely applicable. This paper proposes a general purpose exact algorithmic framework to solve this problem and investigates key algorithm design and implementation issues that are helpful in tailoring the general framework for specific graph properties. The performance of the algorithms so derived for the maximum s-plex and the maximum s-defective clique problems, which arise in network-based data mining applications, is assessed through a computational study.     

2-Join decomposition lattices

In this paper we characterize principal element lattices and Dedekind domains in terms of 2-join decomposition lattices. Received March 2, 1999; accepted in final form July 10, 2000.     

Delay-probability-distribution-dependent stability of uncertain stochastic genetic regulatory networks with mixed time-varying delays: An LMI approach

This paper investigates the delay-probability-distribution-dependent stability problem of uncertain stochastic genetic regulatory networks (SGRNs) with mixed time-varying delays. The information of the probability distribution of the time-delay is considered and transformed into parameter matrices of the transferred SGRNs model. Based on the Lyapunov–Krasovskii functional and stochastic analysis approach, a delay-probability-distribution-dependent sufficient condition is obtained in the linear matrix inequality (LMI) form such that delayed SGRNs are robustly globally asymptotically stable in the mean square for all admissible uncertainties. Finally a numerical example is given to illustrate the effectiveness of our theoretical results.     

Polyaniline film formation in hexadecyl trimethyl ammonium bromide admicelles on hydrous zirconia surface

Formation of a thin polyaniline film on hydrous zirconia (ZrO2) surface was carried out using adsorbed surfactant bilayers on ZrO2 as reaction sites. Aniline was adsolubilized in hexadecyltrimethylammonium bromide (HDTAB) admicelles formed on the surface of ZrO2 by adsorption. Subsequent polymerization of the adsolubilized aniline monomer showed effective conversion of aniline to polyaniline. The formation of the polyaniline coated ZrO2 has been confirmed by UV-visible spectroscopy, FT-IR spectroscopy, and conductivity measurements. Various parameters involved during the adsorption process were studied. Selection of pH 9.0 as the pH of all experimental feed solutions was governed by the knowledge of point of zero charge (PZC) of ZrO2. Effect of aniline concentration on HDTAB adsorption was studied and it was observed that increase in aniline concentration decreased the amount of HDTAB adsorbed on ZrO2. Addition of salt (0.05 M NaCl) in the feed solution increased HDTAB adsorption and drastically reduced the effect of aniline concentration on HDTAB adsorption.     

Lagrangian finite element method for the analysis of two-dimensional sloshing problems

A new version of a numerical algorithm for the Lagrangian treatment of incompressible fluid flows with free surfaces is developed. The novel features of the present method are the adoptions of the Lagrangian finite element method and the velocity correction technique. The use of the velocity correction approach makes the computational scheme extremely simple in algorithmic structure. Hence, the present method is particularly attractive for large-scale problems. The techniques discussed here are applied to some two-dimensional sloshing problems, which may indicate the versatility and effectiveness of the present method.