Search results for "lower bound"
showing 9 items of 269 documents
Fractal Weyl law for open quantum chaotic maps
2014
We study the semiclassical quantization of Poincar\'e maps arising in scattering problems with fractal hyperbolic trapped sets. The main application is the proof of a fractal Weyl upper bound for the number of resonances/scattering poles in small domains near the real axis. This result encompasses the case of several convex (hard) obstacles satisfying a no-eclipse condition.
Joint Optimization of Sensor Selection and Routing for Distributed Estimation in Wireless Sensor Networks
2014
Avances recientes en redes inalámbricos de sensores (WSNs, Wireless Sensor Networks) han posibilitado que pequeños sensores, baratos y con recursos limitados tanto en sensado, comunicación, como en computación, sean desplegados a gran escala. En consecuencia, las WSNs pueden ofrecer diversos servicios en importantes aplicaciones para la sociedad. Entre las varias restricciones que aparecen en el diseño de WSNs, tales como la limitación en energía disponible, procesamiento y memoria, la limitación en energía es muy importante ya que en muchas aplicaciones (ej., monitorización remota de diferentes entornos, edificios administrativos, monitoreo del hábitat, los incendios forestales, la atenció…
On the performance of hybrid-ARQ with code combining over double rayleigh fading channels
2011
In this paper, we study the performance of hybrid automatic repeat request (HARQ) with code combining (CC) over double Rayleigh channels. This channel can be utilized to model the fading envelope of vehicle-to-vehicle (V2V) channels. We derive analytical solutions for the characteristic quantities of double Rayleigh channels, such as the outage probability, the ergodic capacity, and the bit error probability (BEP). Moreover, we study the performance of HARQ with CC. Our analysis focuses on information theoretic aspects of HARQ with CC. closed-form analytical approximations are derived for the e-outage capacity, the average number of transmissions, and the average transmission rate of HARQ w…
Lower bound limit analysis by bem: Convex optimization problem and incremental approach
2013
Abstract The lower bound limit approach of the classical plasticity theory is rephrased using the Multidomain Symmetric Galerkin Boundary Element Method, under conditions of plane and initial strains, ideal plasticity and associated flow rule. The new formulation couples a multidomain procedure with nonlinear programming techniques and defines the self-equilibrium stress field by an equation involving all the substructures (bem-elements) of the discretized system. The analysis is performed in a canonical form as a convex optimization problem with quadratic constraints, in terms of discrete variables, and implemented using the Karnak.sGbem code coupled with the optimization toolbox by MatLab…
Expectation Damages and Bilateral Cooperative Investments
2012
We examine the efficiency of the standard breach remedy expectation damages in a setting where the buyer invests cooperatively and the seller invests both cooperatively and selfishly. Contracts may specify a required quality level and an upper bound to the seller's coordination costs. We find that it is optimal to write an augmented Cadillac contract in which quality is stipulated such that it cannot be met with positive probability together with a very low price. Thus, the seller becomes a residual claimant and the coordination-cost threshold can be used to balance the incentives of the buyer.
Uniformization of two-dimensional metric surfaces
2014
We establish uniformization results for metric spaces that are homeomorphic to the Euclidean plane or sphere and have locally finite Hausdorff 2-measure. Applying the geometric definition of quasiconformality, we give a necessary and sufficient condition for such spaces to be QC equivalent to the Euclidean plane, disk, or sphere. Moreover, we show that if such a QC parametrization exists, then the dilatation can be bounded by 2. As an application, we show that the Euclidean upper bound for measures of balls is a sufficient condition for the existence of a 2-QC parametrization. This result gives a new approach to the Bonk-Kleiner theorem on parametrizations of Ahlfors 2-regular spheres by qu…
The Car Resequencing Problem with Pull-Off Tables
2011
AbstractThe car sequencing problem determines sequences of different car models launched down a mixed- model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this problem in a resequencing context, where a given number of buffers (denoted as pull-off tables) is available for rearranging a stirred sequence. The problem is formalized and suited solution procedures are developed. A lower bound and a dominance rule are introduced which both reduce the running time of our graph approach. Finally, a real-world resequencing setting is investigated.
Prediction of the next value of a function
1981
The following model of inductive inference is considered. Arbitrary set tau = {tau_1, tau_2, ..., tau_n} of n total functions N->N is fixed. A "black box" outputs the values f(0), f(1), ..., f(m), ... of some function f from the set tau. Processing these values by some algorithm (a strategy) we try to predict f(m+1) from f(0), f(1), ..., f(m). Upper and lower bounds for average error numbers are obtained for prediction by using deterministic and probabilistic strategies.
On the Amount of Nonconstructivity in Learning Recursive Functions
2011
Nonconstructive proofs are a powerful mechanism in mathematics. Furthermore, nonconstructive computations by various types of machines and automata have been considered by e.g., Karp and Lipton [17] and Freivalds [11]. They allow to regard more complicated algorithms from the viewpoint of much more primitive computational devices. The amount of nonconstructivity is a quantitative characterization of the distance between types of computational devices with respect to solving a specific problem. In the present paper, the amount of nonconstructivity in learning of recursive functions is studied. Different learning types are compared with respect to the amount of nonconstructivity needed to lea…