Some new inequalities related to Jensen and Ostrowski inequalities for general Lebesgue integral are obtained. Applications for $f$-divergence measure are provided as well.

We begin by discussing linear discrete time-invariant i/s/o (input/state/output) systems that satisfy certain ‘energy’ inequalities. These inequalities involve a quadratic storage function in the state space induced by a positive self-adjoint operator H that may be unbounded and have an unbounded inverse, and also a quadratic supply rate in the combined i/o (input/output) space. The three most ...

1. Benzeval M, Judge K, Whitehead M. Tackling inequalities in health. An agenda for action. London: King’s Fund; 1995. 2. Ben-Shlomo Y, Marmot M. Policy options for managing health inequalities in industrial and post-industrial countries. En: Strickland SS, Shetty PS, editors. Human biology and social inequality. Cambridge: Cambridge University Press; 1998. p. 308-30. 3. Acheson D, Barker D, Ch...

Many problems and applications can be naturally modelled and solved using constraints with more than two variables Such n ary constraints in particular arithmetic constraints are provided by many nite domain constraint programming systems The best known worst case time complexity of existing algorithms GAC schema for enforcing arc consistency on general CSPs is O ed where d is the size of domai...

For any l > 0, we present an algorithm which takes as input a semi-algebraic set, S, defined by P1 ≤ 0, . . . , Ps ≤ 0, where each Pi ∈ R[X1, . . . ,Xk ] has degree ≤ 2, and computes the top l Betti numbers of S, bk−1(S), . . . , bk−l(S), in polynomial time. The complexity of the algorithm, stated more precisely, is ∑l+2 i=0 ( s i ) k2 O(min(l,s)) . For fixed l, the complexity of the algorithm ...

‎in this paper‎, ‎we introduce and study a class of generalized vector quasi-equilibrium problem‎, ‎which includes many vector equilibrium problems‎, ‎equilibrium problems‎, ‎vector variational inequalities and variational inequalities as special cases‎. ‎using one person game theorems‎, ‎the concept of escaping sequences and without convexity assumptions‎, ‎we prove some existence results for ...

We define a new class of functions, connected to the classical Laguerre-P\'{o}lya class, which we call shifted class. Recent work Griffin, Ono, Rolen, and Zagier shows that Riemann Xi function is in this prove being equivalent Taylor coefficients, once shifted, degree $d$ multiplier sequence for every $d$, coefficients satisfying all higher T\'{u}ran inequalities. This mirrors result P\'{o}lya ...

we establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. a corresponding novel neural network model, which is globally convergent and stable in the sense of lyapunov, is proposed. both theoretical and numerical approaches are considered. numerical simulations for three constrained nonlinear optimization problems are giv...

It is shown that under suitable regularity conditions, differential entropy is O( √ n)-Lipschitz as a function of probability distributions on R with respect to the quadratic Wasserstein distance. Under similar conditions, (discrete) Shannon entropy is shown to be O(n)-Lipschitz in distributions over the product space with respect to Ornstein’s d̄-distance (Wasserstein distance corresponding to ...

Digital straight lines can be charactarized by Rosenfeld's chord property as well as Hung's evenness property. Both properties can be formulated in terms of linear inequalities. Because linear inequalities can be veriied by the predicates of a Gamba perceptron, this leads in a straightforward manner to the design of perceptrons that can recognize digital straight lines. In this paper we will di...