Correspondence On the Similarity of the Entropy Power Inequality The preceeding equations allow the entropy power inequality and the Brunn-Minkowski Inequality to be rewritten in the equivalent form (4) where X' and Y' are independent normal variables with corresponding entropies H(X') = H(X) and H(Y') = H(Y). Verification of this restatement follows from the use of (1) to show that Abstract-Th...

We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ordered set of possibly infinite labeled trees. The nonstructural ordering on trees is the one introduced by Amadio and Cardelli for subtyping with recursive types. The structural ordering compares only trees with common shape. A ...

In recent years, symbolic and constraint-solving techniques have been making major advances and are continually being deployed in new business and engineering applications. A major push behind this trend has been the development and deployment of sophisticated methods that are able to comprehend and evaluate important sub-classes of symbolic problems (such as those in polynomial, linear inequal...

This work is supported by the National Natural Science Foundations of China (69974035, 60025308), Excellent Youth Teacher for Teaching and Research Award Foundation in Institutions of Higher Learning of China and the Natural Science Key Foundation of Zhejiang Province (ZD9905). Abstract In this paper the Petri net (PN) with weighted inhibitor arc is exploited to solve the forbidden state proble...

We present a constraint analysis methodology for Linear Matrix Inequality (LMI) constraints. If the constraint set is found to be feasible we search for a minimal representation; otherwise, we search for an irreducible infeasible system. The work is based on the solution of a set covering problem where each row corresponds to a sample point and is determined by constraint satisfaction at the sa...

The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they often have a computational advantage over alternatives that have been proposed for solving the same problem and that this makes them successful in many real-world applications. This is supported by experimental evidence provided in this paper on problems of various sizes (up...

In this paper, a Stieltjes integral approximation method for uncertain variational inequality problem (UVIP) is studied. Firstly, variables are introduced on the basis of inequality. Since based nonadditive measures, there usually no density function. Secondly, expected value model UVIP established after discretized by integral. Furthermore, gap function constructed to transform into an constra...

We investigate in this paper the generalized trust region subproblem (GTRS) of minimizing a general quadratic objective function subject to a general quadratic inequality constraint. By applying a simultaneous block diagonalization approach, we obtain a congruent canonical form for the symmetric matrices in both the objective and constraint functions. By exploiting the block separability of the...

Inspired by previous work of Kusner and Bauer-Kuwert, we prove a strict inequality between the Willmore energies two surfaces their connected sum in context isoperimetric constraints. Building on Keller-Mondino-Rivi\`ere, our leads to existence minimisers for constrained problem every genus, provided minimal energy lies strictly below $8\pi$. Besides geometric interest, such minimisation has be...