Search results for "Bounds"
showing 10 items of 298 documents
Neutrinoless double beta decay in the dualized standard model
2001
The Dualized Standard Model offers a {\it raison d'\^etre} for 3 fermion generations and an explanation for their distinctive mass and mixing patterns, reproducing to a reasonable accuracy the empirical mixing matrix and mass spectrum for both quarks and leptons in terms of just a few parameters. With its parameters thus fixed, the result is a highly predictive framework. In particular, it is shown that it gives explicit parameter-free predictions for neutrinoless double beta decays. For $^{76}Ge$, it predicts a half-life of $10^{28}-10^{30}$ years, which satisfies the present experimental lower bound of $1.8 \times 10^{25}$ years.
First lattice calculation of the B-meson binding and kinetic energies
1995
We present the first lattice calculation of the B-meson binding energy $\labar$ and of the kinetic energy $-\lambda_1/2 m_Q$ of the heavy-quark inside the pseudoscalar B-meson. This calculation has required the non-perturbative subtraction of the power divergences present in matrix elements of the Lagrangian operator $\bar h D_4 h$ and of the kinetic energy operator $\bar h \vec D^2 h$. The non-perturbative renormalisation of the relevant operators has been implemented by imposing suitable renormalisation conditions on quark matrix elements, in the Landau gauge. Our numerical results have been obtained from several independent numerical simulations at $\beta=6.0$ and $6.2$, and using, for t…
Resolvent Estimates Near the Boundary of the Range of the Symbol
2019
The purpose of this chapter is to give quite explicit bounds on the resolvent near the boundary of Σ(p) (or more generally, near certain “generic boundary-like” points.) The result is due (up to a small generalization) to Montrieux (Estimation de resolvante et construction de quasimode pres du bord du pseudospectre, 2013) and improves earlier results by Martinet (Sur les proprietes spectrales d’operateurs nonautoadjoints provenant de la mecanique des fluides, 2009) about upper and lower bounds for the norm of the resolvent of the complex Airy operator, which has empty spectrum (Almog, SIAM J Math Anal 40:824–850, 2008). There are more results about upper bounds, and some of them will be rec…
Exact Response Time Analysis of Hierarchical Fixed-Priority Scheduling
2009
Hierarchical scheduling has recently been used to provide temporal isolation to embedded virtualised systems. Response time analysis is a common way to derive a schedulability test for these systems. This paper points out that response time analysis for hierarchical fixed-priority scheduling found in the literature is only exact for tasks of the highest priority domain. For the rest of the tasks is an upper bound. In our work, we provide the exact analysis and we compare it with previously published works.
Adiabatic evolution for systems with infinitely many eigenvalue crossings
1998
International audience; We formulate an adiabatic theorem adapted to models that present an instantaneous eigenvalue experiencing an infinite number of crossings with the rest of the spectrum. We give an upper bound on the leading correction terms with respect to the adiabatic limit. The result requires only differentiability of the considered projector, and some geometric hypothesis on the local behavior of the eigenvalues at the crossings.
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…
Iterated Conditionals, Trivalent Logics, and Conditional Random Quantities
2022
We consider some notions of iterated conditionals by checking the validity of some desirable basic logical and probabilistic properties, which are valid for simple conditionals. We consider de Finetti’s notion of conditional as a three-valued object and as a conditional random quantity in the betting framework. We recall the notions of conjunction and disjunction among conditionals in selected trivalent logics. Then, we analyze the two notions of iterated conditional introduced by Calabrese and de Finetti, respectively. We show that the compound probability theorem and other basic properties are not preserved by these objects, by also computing some probability propagation rules. Then, for …