Search results for "upper"
showing 10 items of 987 documents
Drowned Landscapes: The Rediscovered Archaeological Heritage of the Mosul Dam Reservoir
2023
Like natural catastrophes or armed conflicts, resource extraction projects herald the alteration or destruction of natural and cultural landscapes alike. Dam construction is a major threat to cultural heritage in Western Asian archaeology. One event may result in obliterating hundreds of sites, most of which never reappear or do so only sporadically following cyclical water fluctuation. Destruction of sites remains ongoing, necessitating constant assessment of damage and the establishment of strategies of documentation and maintenance. This paper proposes a new paradigm for future safeguarding and, more widely, a new tool for managing contiguous terrestrial and lacustrine cultural zones. It…
New results for finding common neighborhoods in massive graphs in the data stream model
2008
AbstractWe consider the problem of finding pairs of vertices that share large common neighborhoods in massive graphs. We give lower bounds for randomized, two-sided error algorithms that solve this problem in the data-stream model of computation. Our results correct and improve those of Buchsbaum, Giancarlo, and Westbrook [On finding common neighborhoods in massive graphs, Theoretical Computer Science, 299 (1–3) 707–718 (2004)]
GLOBAL DELAY TIME FOR GENERAL DISTRIBUTED NETWORKS WITH APPLICATIONS TO TIMING ANALYSIS OF DIGITAL MOS INTEGRATED CIRCUITS
1989
We consider here a general nerwork composed by n‐distributed parameters lines (with telegraph‐equations models) and m‐capacitors, all connected by a resistive multiport. An asymptotic stability property drives us to define and evaluate a global parameter (“λ‐delay time”) which describes the speed of signals propagation through the network. Because of its simplicity of calculation and its tightness, the given upper bound of the λ‐delay time is useful in timing analysis of MOS integrated chips.
Early Antecedents of School Burnout in Upper Secondary Education : A Five-year Longitudinal Study
2020
AbstractSchool burnout symptoms are prevalent among upper secondary education students, but thus far, very little is known about the background of these symptoms. The present study examined the extent to which school burnout symptoms (i.e., exhaustion and cynicism) among upper secondary education students have their roots in primary and lower secondary school and whether early antecedents of school burnout symptoms could be identified. The sample consisted of 1544 Finnish students followed up four times (Time1–Time 4) from the end of primary school (T1; mean age 12.74 and range 11.71–14.20) to the first year of upper secondary education (T4; mean age 16.66 and range 15.55–18.39). The result…
A Unifying Framework for Perturbative Exponential Factorizations
2021
We propose a framework where Fer and Wilcox expansions for the solution of differential equations are derived from two particular choices for the initial transformation that seeds the product expansion. In this scheme, intermediate expansions can also be envisaged. Recurrence formulas are developed. A new lower bound for the convergence of theWilcox expansion is provided, as well as some applications of the results. In particular, two examples are worked out up to a high order of approximation to illustrate the behavior of the Wilcox expansion.
Geometry and analysis of Dirichlet forms (II)
2014
Abstract Given a regular, strongly local Dirichlet form E , under assumption that the lower bound of the Ricci curvature of Bakry–Emery, the local doubling and local Poincare inequalities are satisfied, we obtain that: (i) the intrinsic differential and distance structures of E coincide; (ii) the Cheeger energy functional Ch d E is a quadratic norm. This shows that (ii) is necessary for the Riemannian Ricci curvature defined by Ambrosio–Gigli–Savare to be bounded from below. This together with some recent results of Ambrosio–Gigli–Savare yields that the heat flow gives a gradient flow of Boltzman–Shannon entropy under the above assumptions. We also obtain an improvement on Kuwada's duality …
On Boundary Value Problems for ϕ-Laplacian on the Semi-Infinite Interval
2017
The Dirichlet problem and the problem with functional boundary condition for ϕ-Laplacian on the semi-infinite interval are studied as well as solutions between the lower and upper functions.
On t-covers in finite projective spaces
1979
A t-cover of the finite projective space PG(d,q) is a setS of t-dimensional subspaces such that any point of PG(d,q) is contained in at least one element ofS. In Theorem 1 a lower bound for the cardinality of a t-coverS in PG(d,q) is obtained and in Theorem 2 it is shown that this bound is best possible for all positive integers t,d and for any prime-power q.
On the type of partial t-spreads in finite projective spaces
1985
AbstractA partial t-spread in a projective space P is a set of mutually skew t-dimensional subspaces of P. In this paper, we deal with the question, how many elements of a partial spread L can be contained in a given d-dimensional subspace of P. Our main results run as follows. If any d-dimensional subspace of P contains at least one element of L, then the dimension of P has the upper bound d−1+(d/t). The same conclusion holds, if no d-dimensional subspace contains precisely one element of L. If any d-dimensional subspace has the same number m>0 of elements of L, then L is necessarily a total t-spread. Finally, the ‘type’ of the so-called geometric t-spreads is determined explicitely.
Sensitivity Versus Certificate Complexity of Boolean Functions
2016
Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been notoriously hard to obtain even exponential bounds. Since block sensitivity is known to be polynomially related to certificate complexity, an equivalent of proving this conjecture would be showing that the certificate complexity is polynomially related to sensitivity. Previously, it has been shown that $$bsf \le Cf \le 2^{sf-1} sf - sf-1$$. In this work, we give a better upper bound of $$bsf \le Cf \le \max \left 2^{sf-1}\left sf-\frac{1}{3}\right , sf\right $…