Inner bounds for the spectrum of quasinormal operators

A linear operator in a separable Hilbert space is called a quasinormal one if it is a sum of a normal operator and a compact one. In the paper, bounds for the spectrum of quasinormal operators are established. In addition, the lower estimate for the spectral radius is derived. Under some restrictions, that estimate improves the well-known results. Applications to integral operators and matrices are discussed. Our results are new even in the finite-dimensional case.

     

On the Bavrin Integro-Differential Operators and Their Applications to Solution of Functional Equations

We construct a multiplicative group structure in the class of integro-differential operators specific for a polydisk which was introduced by I. I. Bavrin. We indicate two applications of these operators to solution of functional equations.     

Computational analysis of native and modified oligofructosides

This paper presents a quantum chemical calculation of native (2–7 fructoside residues) and chemically modified (2–4 fructoside residues) levan molecule models. A levan modification was carried out by oxidation and the following reduction or hyrdazonation of the fructoside rings. The conformational particularity and reaction ability was studied for the native and for the modified levan molecules.     

Cold compaction of ceramic powder: Computational analysis of the effect of pressing method and die shape

This paper deals with a computational analysis of the influence of the pressing method and part geometry on the final density distribution in the cold compaction process of ceramic alumina powders. The analysis is based on the explicit finite-element model proposed and validated in a previous study. The mechanical behavior of the processing material is described using a multisurface elastoplastic model, the modified Drucker-Prager/Cap model Published in Prikladnaya Mekhanika, Vol. 43, No. 10, pp. 129–134, October 2007.     

Direct and inverse estimates for a new family of linear positive operators

In the present paper we introduce a new family of linear positive operators and study some direct and inverse results in simultaneous approximation.     

Decentralized iterative learning control for a class of large scale interconnected dynamical systems

The problem of decentralized iterative learning control for a class of large scale interconnected dynamical systems is considered. In this paper, it is assumed that the considered large scale dynamical systems are linear time-varying, and the interconnections between each subsystem are unknown. For such a class of uncertain large scale interconnected dynamical systems, a method is presented whereby a class of decentralized local iterative learning control schemes is constructed. It is also shown that under some given conditions, the constructed decentralized local iterative learning controllers can guarantee the asymptotic convergence of the local output error between the given desired local output and the actual local output of each subsystem through the iterative learning process. Finally, as a numerical example, the system coupled by two inverted pendulums is given to illustrate the application of the proposed decentralized iterative learning control schemes.     

Delay-dependent stochastic stability of delayed Hopfield neural networks with Markovian jump parameters

In this paper, the problem of stochastic stability for a class of time-delay Hopfield neural networks with Markovian jump parameters is investigated. The jumping parameters are modeled as a continuous-time, discrete-state Markov process. Without assuming the boundedness, monotonicity and differentiability of the activation functions, some results for delay-dependent stochastic stability criteria for the Markovian jumping Hopfield neural networks (MJDHNNs) with time-delay are developed. We establish that the sufficient conditions can be essentially solved in terms of linear matrix inequalities.     

Possible spectroscopic manifestation of the angular group induced bond alteration (AGIBA) effect in toluene

The most obvious consequence of the concept of aromaticity is the common confidence that in aromatic compounds, bond lengths do not alternate and are between typical to the single and double ones. However, in 1994, performing crystal structure investigations of substituted pyridines and their salts, Krygowski and co‐workers have discovered a very surprising angular group induced bond alteration (AGIBA) effect: It appears that some angular substituents, like methoxy or nitrozo groups, can induce bond alternation in aromatic rings. Crystal studies do not allow one to operate with liquids that are more common in organic chemistry. This paper presents the first possible evidence of spectroscopic manifestations of the AGIBA effect. Raman spectra of the liquid toluene are analyzed. It is found that instead of being single, the line corresponding to the ring breathing vibrations is clearly split by 1.0–1.4 cm^?1, thus indicating the presence of two (cis‐ and trans‐) AGIBA isomers. The energy difference between these isomers estimated in temperature dependent Raman studies is found equal to 6.68 kJ mol^?1. The low‐wavenumber line therefore corresponds to the cis‐AGIBA isomer and the high‐wavenumber line to the trans‐AGIBA isomer stabilized by the AGIBA effect. Copyright © 2007 John Wiley & Sons, Ltd.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007