We discuss the existence of solutions with oblique asymptotes to a class of second order nonlinear ordinary differential equations by means of Lyapunov functions. The approach is new in this field and allows for simpler proofs of general results regarding Emden-Fowler like equations.

We present the notion of asymptotically non-terminating initial variable values for linear loop programs. Those values are directly associated to initial variable values for which the corresponding program does not terminate. Our theoretical contributions provide us with powerful computational methods for automatically generating sets of asymptotically non-terminating initial variable values. S...

We show that a class of linear nonconvolution discrete Volterra equations has asymptotically periodic solutions. We also examine an example for which the calculations can be done explicitly. The results are established using theorems on the boundedness and convergence to a finite limit of solutions of linear discrete Volterra equations.

A vital extension to partial least squares (PLS) path modeling is introduced: consistency. While maintaining all the strengths of PLS, the consistent version provides two key improvements. Path coefficients, parameters of simultaneous equations, construct correlations, and indicator loadings are estimated consistently. The global goodness-of-fit of the structural model can also now be assessed,...

Ruichang Pei1, 2 1 Center for Nonlinear Studies, Northwest University, Xi’an 710069, China 2 Department of Mathematics, Tianshui Normal University, Tianshui 741001, China Correspondence should be addressed to Ruichang Pei, [email protected] Received 26 February 2010; Revised 2 April 2010; Accepted 22 April 2010 Academic Editor: Kanishka Perera Copyright q 2010 Ruichang Pei. This is an open access ...

We study the minimum distance of binary error correcting codes from the following perspectives: • The problem of deriving bounds on the minimum distance of a code given constraints on the computational complexity of its encoder. • The minimum distance of linear codes that are symmetric in the sense of being invariant under the action of a group on the bits of the codewords. • The derandomizatio...

In this paper we establish the existence of multiple solutions for the semilinear elliptic problem (1.1) −∆u = g(x, u) in Ω, u = 0 on ∂Ω, where Ω ⊂ RN is a bounded domain with smooth boundary ∂Ω, a function g: Ω×R→ R is of class C1 such that g(x, 0) = 0 and which is asymptotically linear at infinity. We considered both cases, resonant and nonresonant. We use critical groups to distinguish the c...

The paper considers the problem of distributed adaptive linear parameter estimation in multi-agent inference networks. Local sensing model information is only partially available at the agents and inter-agent communication is assumed to be unpredictable. The paper develops a generic mixed time-scale stochastic procedure consisting of simultaneous distributed learning and estimation, in which th...