Search results for "Bounds"
showing 8 items of 298 documents
Searches for lepton number violation and resonances in K± → πμμ decays
2017
The NA48/2 experiment at CERN collected a large sample of charged kaon decays to final states with multiple charged particles in 2003–2004. A new upper limit on the rate of the lepton number violating decay K±→π∓μ±μ± is reported: B(K±→π∓μ±μ±)<8.6×10−11 at 90% CL. Searches for two-body resonances X in K±→πμμ decays (such as heavy neutral leptons N4 and inflatons χ ) are also presented. In the absence of signals, upper limits are set on the products of branching fractions B(K±→μ±N4)B(N4→πμ) and B(K±→π±X)B(X→μ+μ−) for ranges of assumed resonance masses and lifetimes. The limits are in the (10−11,10−9) range for resonance lifetimes below 100 ps.
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…
Phenomenology of non-standard neutrino interactions
2016
Today neutrino physics is in a privileged position within the fascinating field of particle physics. From the discovery of neutrino oscillations by Super-Kamiokande in 1998, the door to physics beyond the Standard Model (SM in what follows) has been opened. This fact implies that neutrinos have to be massive in opposition to the Standard Model assumption. However, this is not a surprise completely, but it was already hinted from theoretical and experimental observations in the two decades prior to the discovery of the oscillatory phenomenon, as neutrino masses included in unification models or the observed deficit of the atmospheric and solar neutrino fluxes. As a consequence of this new pa…
Guaranteed error bounds and local indicators for adaptive solvers using stabilised space-time IgA approximations to parabolic problems
2019
The paper is concerned with space–time IgA approximations to parabolic initial–boundary value problems. We deduce guaranteed and fully computable error bounds adapted to special features of such type of approximations and investigate their efficiency. The derivation of error estimates is based on the analysis of the corresponding integral identity and exploits purely functional arguments in the maximal parabolic regularity setting. The estimates are valid for any approximation from the admissible (energy) class and do not contain mesh-dependent constants. They provide computable and fully guaranteed error bounds for the norms arising in stabilised space–time approximations. Furthermore, a p…
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…