Results 31 to 40 of about 58,381 (161)
Bounds of non-monotone complexity for the multi-valued logic functions
The non-monotone complexity of realization of k-valued logic functions by circuits in a special basis was investigated. The basis consists of elements of two types: the first type comprises all monotone functions (with respect to the order 0 < 1 < 2
V.V. Kochergin, A.V. Mikhailovich
doaj +1 more source
Upper and lower bounds of solutions for fractional integral equations [PDF]
n this paper we consider the integral equation of fractional order in sense of Riemann-Liouville operator um(t) = a(t) Iα [b(t)u(t)]+f(t) with m ≥ 1, t ∈ [0, T], T < ∞ and 0< α
Rabha W. Ibrahim, Shaher Momani
doaj
NEW UPPER AND LOWER BOUNDS LINE OF SIGHT PATH LOSS MODELS FOR MOBILE PROPAGATION IN BUILDINGS
This paper proposes a method to predict line-of-sight (LOS) path loss in buildings. We performed measurements in two different type of buildings at a frequency of 1.8 GHz and propose new upper and lower bounds path loss models which depend on max and min
Supachai Phaiboon +2 more
doaj +1 more source
Optimal consumption and portfolio selection with lower and upper bounds on consumption
We investigate the optimal consumption and investment problem with lower and upper bounds on consumption constraints. We derive closed-form solutions by means of the dynamic programming approach.
Kum-Hwan Roh, Yong Hyun Shin
doaj +1 more source
On the Achievable Stabilization Delay Margin for Linear Plants with Time-Varying Delays
The paper contributes to stabilization problems of linear systems subject to time-varying delays. Drawing upon small gain criteria and robust analysis techniques, upper and lower bounds on the largest allowable time-varying delay are developed by using ...
Jing Zhu
doaj +1 more source
Tight bounds for the median of a gamma distribution.
The median of a standard gamma distribution, as a function of its shape parameter k, has no known representation in terms of elementary functions. In this work we prove the tightest upper and lower bounds of the form 2-1/k(A + k): an upper bound with A =
Richard F Lyon
doaj +1 more source
Multiple Packing: Lower and Upper Bounds
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set $\mathcal{C}$ of points in $ \mathbb{R}^n $ such that any point in $ \mathbb{R}^n $ lies in the intersection of ...
Zhang, Yihan, Vatedka, Shashank
openaire +2 more sources
A new sequence related to the Euler–Mascheroni constant
In this paper, we provide a new quicker sequence convergent to the Euler–Mascheroni constant using an approximation of Padé type. Our sequence has a relatively simple form and higher speed of convergence.
Shanhe Wu, Gabriel Bercu
doaj +1 more source
An Upper Bound on the Error Induced by Saddlepoint Approximations—Applications to Information Theory
This paper introduces an upper bound on the absolute difference between: ( a ) the cumulative distribution function (CDF) of the sum of a finite number of independent and identically distributed random variables with finite absolute third moment;
Dadja Anade +3 more
doaj +1 more source
Upper and Lower Bounds of Born Approximation, I [PDF]
The properties of three dimensional Born approximation are investigated along similar lines as Part 1. Relations between one dimensional and three dimensional Born approximations are elucidated . . We also compare the convergence radii for both approximations for typical examples.
openaire +3 more sources

