Search results for " Lower"
showing 10 items of 378 documents
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.
A combined approach of SGBEM and conic quadratic optimization for limit analysis
2011
The static approach to evaluate the limit multiplier directly was rephrased using the Symmetric Galerkin Boundary Element Method (SGBEM) for multidomain type problems [1,2]. The present formulation couples SGBEM multidomain procedure with nonlinear optimization techniques, making use of the self-equilibrium stress equation [3-5]. This equation connects the stresses at the Gauss points of each substructure (bem-e) to plastic strains through a self-stress matrix computed in all the bem-elements of the discretized system. The analysis was performed by means of a conic quadratic optimization problem, in terms of discrete variables, and implemented using Karnak.sGbem code [6] coupled with MathLa…
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) ).
Hydraulic kinetics of the graft union in different Olea europaea L. scion/rootstock combinations
2007
The hydraulic resistance of young olive trees grafted on rootstocks with contrasting size-controlling potential was measured 30, 90, 360 and 480 days after grafting. Olive (Olea europaea L.) clones inducing plant vigorous growth (Leccino ‘Minerva’, LM) or dwarfing (Leccino ‘Dwarf’, LD) were studied in different scion/rootstock combinations (LD/LD, LD/LM, LM/LD, LM/LM). Plants growing on LD root systems developed lower leaf surface areas (about 50% less) than plants grafted on LM rootstocks. Graft union represented the largest fraction (up to 85%) of whole-plant hydraulic resistance 30 days after grafting, and still represented an important fraction of it 2 months later (40–55%). Four-hundre…
Assessment of student engagement among junior high school students and associations with self-esteem, burnout, and academic achievement
2016
Journal for educational research online 8 (2016) 2, S. 136-157
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…
Monopoles and dualities in 3d N=2 quivers
2021
Seiberg-like dualities in 2+1d quiver gauge theories with 4 supercharges are investigated. We consider quivers made of various combinations of classical gauge groups U(N), Sp(N), SO(N) and SU(N). Our main focus is the mapping of the supersymmetric monopole operators across the dual theories. There is a simple general rule that encodes the mapping of the monopoles upon dualizing a single node. This rule dictates the mapping of all the monopoles which are not dressed by baryonic operators. We also study more general situations involving baryons and baryon-monopoles, focussing on three examples: SU−Sp, SO−SO and SO−Sp quivers.