Allen Interval Algebra introduces a set of operators, which describe any possible temporal association between two valid time intervals. The requirement of Allen operators for complete temporal knowledge goes against the monotonic knowledge generation sequence, which is witnessed in observation driven fields like stratigraphy. In such cases, incomplete temporal information yields a disjunctive ...

It was mentioned by Kolmogorov (1968, IEEE Trans. Inform. Theory 14, 662 664) that the properties of algorithmic complexity and Shannon entropy are similar. We investigate one aspect of this similarity. Namely, we are interested in linear inequalities that are valid for Shannon entropy and for Kolmogorov complexity. It turns out that (1) all linear inequalities that are valid for Kolmogorov com...

We prove the Hijazi inequality, an estimate for Dirac eigenvalues, for complete manifolds of finite volume. Under some additional assumptions on the dimension and the scalar curvature, this inequality is also valid for elements of the essential spectrum. This allows to prove the conformal version of the Hijazi inequality on conformally parabolic manifolds if the spin analog to the Yamabe invari...

The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality has been presented in this current paper. Such type of facets plays an important role in set covering set partitioning, matroidal-intersection vertex- packing, generalized assignment and other combinatorial problems. Strong covers for facets of Knapsack ploytope has been developed in the first pa...

In recent years, branch-and-cut algorithms have become firmly established as the most effective method for solving generic mixed integer linear programs (MIPs). Methods for automatically generating inequalities valid for the convex hull of solutions to such MIPs are a critical element of branch-and-cut. This paper examines the nature of the so-called separation problem, which is that of generat...

Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, the problem is more acute for two reasons. First, conventional techniques are designed for the optimization of joins with equality predicates, rather than the inequality predicates prevalent in valid-time queries. Seco...

We provide yet another proof of the Otto-Villani theorem from the log Sobolev inequality to the Talagrand transportation cost inequality valid in arbitrary metric measure spaces. The argument relies on the recent development [2] identifying gradient flows in Hilbert space and in Wassertein space, emphasizing one key step as precisely the root of the Otto-Villani theorem. The approach does not r...

The following is the classical Hermite-Hadamard inequality [4, 5]: f ( a+ b 2 ) ≤ 1 b− a (S) ∫ b a f(x)dμ ≤ f(a) + f(b) 2 . which provides estimates of the mean value of a convex function f on [a, b] where μ is the Lebesgue measure on R. This inequality in general, is not valid in the fuzzy context. In this paper, we find necessary and sufficient conditions of Hermite-Hadamard type inequality f...

Let ugi the unique solutions of an elliptic variational inequality with second member gi (i = 1, 2). We establish necessary and sufficient conditions for the convex combination tug1 + (1 − t)ug2 , to be equal to the unique solution of the same elliptic variational inequality with second member tg1 + (1− t)g2. We also give some examples where this property is valid.

Scales of equivalent weight characterizations for the Hardy type inequality with general measures are proved. The conditions are valid in the case of indices 0 < q < p <∞, p > 1. We also include a reduction theorem for transferring a three-measure Hardy inequality to the case with two measures. © 2007 Elsevier Inc. All rights reserved.