Following ref [1], a classical upper bound for quantum entropy is identified and illustrated, 0 ≤ Sq ≤ ln(eσ/ 2~), involving the variance σ in phase space of the classical limit distribution of a given system. A fortiori, this further bounds the corresponding information-theoretical generalizations of the quantum entropy proposed by Rényi.

Analysis of the temperatures and areas of Io’s thermal anomalies yields an upper bound on the total heat flow. An extended distribution function allows an assessment of the heat flow from undetected, cooler (but larger) anomalies and predicts a limiting temperature of 90–95 K for the surface. This value is in agreement with measured Voyager infrared interferometer spectrometer and Galileo Photo...

Service-oriented Architectures (SOA) facilitate the dynamic and seamless integration of services offered by different service providers which in addition can be located in different trust domains. Especially for business integration scenarios, Federated Identity Management emerged as a possibility to propagate identity information as security assertions across company borders in order to secure...

In 1970, J. Folkman proved that for a given integer r and a graph G of order n there exists a graph H with the same clique number as G such that every r coloring of vertices of H yields at least one monochromatic copy of G. His proof gives no good bound on the order of graph H, i.e. the order of H is bounded by an iterated power function. A related problem was studied by Luczak, Ruciński and Ur...

We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1/α) up to a polynomial factor, where α = ln(m/n) + O(ln lnm) and n, m are respectively the number of variables and the number of clauses in the input formula. This bound is asymptotically better than the previously best ...

It is clear that the number of distinct representations of a number n as the sum of two primes is at most the number of primes in the interval [n/2, n-2]. We show that 210 is the largest value of n for which this upper bound is attained.

Exploitation of the NP hard, mixed μ problem structure provides a polynomial time algorithm that approximates μ with usually reasonable answers. When the problem is extended to the skew μ problem an extension of the existing method to the skew μ formulation is required. The focus of this paper is to extend the μ upper bound derivation to the skew μ upper bound and show its direct computation by...

In this work, we introduce the Minimum Trilateration Problem, the problem of placing distance measuring guards in a polygon in order to locate points in the interior. We provide the first non-trivial bounds on trilaterating simple polygons, by showing that b 8N 9 c guards suffice for any non-degenerate polygon of N sides, and present an O(N logN) algorithm for the corresponding placement. We al...

In the Bayesian framework, predictions for a regression problem are expressed in terms of a distribution of output values. The mode of this distribution corresponds to the most probable output, while the uncertainty associated with the predictions can conveniently be expressed in terms of error bars. In this paper we consider the evaluation of error bars in the context of the class of generaliz...