Displaying similar documents to “Lipschitz modulus in convex semi-infinite optimization via d.c. functions”

Thread algebra for noninterference

Thuy Duong Vu (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

Thread algebra is a semantics for recent object-oriented programming languages [J.A. Bergstra and M.E. Loots, (2002) 125–156; J.A. Bergstra and C.A. Middelburg, (2007)] such as C# and Java. This paper shows that thread algebra provides a process-algebraic framework for reasoning about and classifying various standard notions of noninterference, an important property in secure information flow. We will take the noninterference property given by Volpano  [D. Volpano,...

Coproducts of Ideal Monads

Neil Ghani, Tarmo Uustalu (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

The question of how to combine monads arises naturally in many areas with much recent interest focusing on the coproduct of two monads. In general, the coproduct of arbitrary monads does not always exist. Although a rather general construction was given by Kelly  [ (1980) 1–83], its generality is reflected in its complexity which limits the applicability of this construction. Following our own research [C. Lüth and N. Ghani, (2002) 18–32], and...

Exponential deficiency of convolutions of densities

Iosif Pinelis (2012)

ESAIM: Probability and Statistics

Similarity:

If a probability density () ( ∈ ℝ) is bounded and := ∫e ()d < ∞ for some linear functional and all  ∈ (01), then, for each  ∈ (01) and all large enough , the -fold convolution of the -tilted density p ˜ t := e ()/ is bounded. This is a corollary of a general, “non-i.i.d.” result, which is also shown to enjoy a certain optimality property. Such results and their corollaries stated in terms of the absolute integrability of the corresponding characteristic...

Undecidability of infinite post correspondence problem for instances of size 8

Jing Dong, Qinghui Liu (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

The infinite Post Correspondence Problem (PCP) was shown to be undecidable by Ruohonen (1985) in general. Blondel and Canterini [ (2003) 231–245] showed that PCP is undecidable for domain alphabets of size 105, Halava and Harju [ (2006) 551–557] showed that PCP is undecidable for domain alphabets of size 9. By designing a special coding, we delete a letter from Halava and Harju’s construction. So we prove that PCP is undecidable for domain alphabets of size...