Search results for "lower bounds"
showing 10 items of 259 documents
Nonsymmetric conical upper density and $k$-porosity
2017
We study how the Hausdorff measure is distributed in nonsymmetric narrow cones in R n \mathbb {R}^n . As an application, we find an upper bound close to n − k n-k for the Hausdorff dimension of sets with large k k -porosity. With k k -porous sets we mean sets which have holes in k k different directions on every small scale.
Upper bound on the communication complexity of private information retrieval
1997
We construct a scheme for private information retrieval with k databases and communication complexity O(n 1/(2k−1) ).
L∞ estimates in optimal mass transportation
2016
We show that in any complete metric space the probability measures μ with compact and connected support are the ones having the property that the optimal transportation distance to any other probability measure ν living on the support of μ is bounded below by a positive function of the L∞ transportation distance between μ and ν. The function giving the lower bound depends only on the lower bound of the μ-measures of balls centered at the support of μ and on the cost function used in the optimal transport. We obtain an essentially sharp form of this function. In the case of strictly convex cost functions we show that a similar estimate holds on the level of optimal transport plans if and onl…
A computational study of several heuristics for the DRPP
1995
The problem of designing a route of minimum length for a postman that starts and finishes at his office and has to deliver the mail along a set of streets in a city is known as the Rural Postman Problem. When the postman has to obey the directions of the streets, we have the directed version of this problem. Finding an exact solution, in the general case, is intractably difficult. Hence, we have implemented three heuristic algorithms for approximately solving this problem and a procedure for obtaining a lower bound to the optimal length. Also, we present numerical experimentations based on a collection of random instances with up to 30 connected components, 240 vertices and 801 arcs. A lowe…
Numerical approach for signal delay in general distributed networks
2003
The authors consider a general network with telegraph equations modelling distributed elements and having, additionally, nonlinear capacitors. A global asymptotic exponential stability of the solution is given. A simple computable upper bound of the delay time is given. Numerical examples illustrate the usefulness of the results. >
Radio k-Labelings for Cartesian Products of Graphs
2005
International audience; Frequency planning consists in allocating frequencies to the transmitters of a cellular network so as to ensure that no pair of transmitters interfere. We study the problem of reducing interference by modeling this by a radio k-labeling problem on graphs: For a graph G and an integer k ≥ 1, a radio k-labeling of G is an assignment f of non negative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two vertices x and y, where dG(x,y) is the distance between x and y in G. The radio k-chromatic number is the minimum of max{f(x)−f(y):x,y ∈ V(G)} over all radio k-labelings f of G. In this paper we present the radio k-labeling for the Cartesian pro…
Consistent shakedown theorems for materials with temperature dependent yield functions
2000
The (elastic) shakedown problem for structures subjected to loads and temperature variations is addressed in the hypothesis of elastic-plastic rate-independent associative material models with temperature-dependent yield functions. Assuming the yield functions convex in the stress/temperature space, a thermodynamically consistent small-deformation thermo-plasticity theory is provided, in which the set of state and evolutive variables includes the temperature and the plastic entropy rate. Within the latter theory the known static (Prager's) and kinematic (König's) shakedown theorems - which hold for yield functions convex in the stress space - are restated in an appropriate consistent format…
A Distribution-Free Two-Sample Equivalence Test Allowing for Tied Observations
1999
A new testing procedure is derived which enables to assess the equivalence of two arbitrary noncontinuous distribution functions from which unrelated samples are taken as the data to be analyzed. The equivalence region is defined to consist of all pairs (F, G) of distribution functions such that for independent X ∼F, Y ∼G the conditional probability of {X > Y} given {X ¬= Y} lies in some short interval around 1/2. The test rejects the null hypothesis of nonequivalence if and only if the standardized distance between the U-statistics estimator of P|X > Y | X ¬= Y] and the center of the equivalence interval (1/2 - e 1 , 1/2 + e 2 ) does not exceed a critical upper bound which has to be comput…
Cotas inferiores para el QAP-Arbol
1985
The Tree-QAP is a special case of the Quadratic Assignment Problem where the flows not equal zero form a tree. No condition is required for the distance matrix. In this paper we present an integer programming formulation for the Tree-QAP. We use this formulation to construct four Lagrangean relaxations that produce several lower bounds for this problem. To solve one of the relaxed problems we present a Dynamic Programming algorithm which is a generalization of the algorithm of this type that gives a lower bound for the Travelling Salesman Problem. A comparison is given between the lower bounds obtained by each ralaxation for examples with size from 12 to 25.
Can the Adaptive Metropolis Algorithm Collapse Without the Covariance Lower Bound?
2011
The Adaptive Metropolis (AM) algorithm is based on the symmetric random-walk Metropolis algorithm. The proposal distribution has the following time-dependent covariance matrix at step $n+1$ \[ S_n = Cov(X_1,...,X_n) + \epsilon I, \] that is, the sample covariance matrix of the history of the chain plus a (small) constant $\epsilon>0$ multiple of the identity matrix $I$. The lower bound on the eigenvalues of $S_n$ induced by the factor $\epsilon I$ is theoretically convenient, but practically cumbersome, as a good value for the parameter $\epsilon$ may not always be easy to choose. This article considers variants of the AM algorithm that do not explicitly bound the eigenvalues of $S_n$ away …