Results 21 to 30 of about 6,618,541 (298)

Lower Bound for Complete (k,n)-arc in PG(3,23) [PDF]

open access: yesBIO Web of Conferences
In this work, we construct a complete (k,n)-arcs in the projective space over Galois field GF(23), we construct the complete (k,n)-arcs by taking the union of some (k.n)-arcs, by using computer program we added some points of index zero, and found all ...
Juma'a Abd Ezalden Mohamed   +1 more
doaj   +1 more source

A Bound of Fast Algebraic Immunity of Constructions With BPR Using a Four-Disjoint-Part Support

open access: yesIEEE Access, 2020
Boolean functions are used for stream cipher ought to be a high fast algebraic immunity (FAI) to effectively against fast algebraic attacks. In the previous research methods, there is no suitable method to gain the FAI of Boolean functions using ...
Kai Xu, Ying Zhang, Jing Wang
doaj   +1 more source

A Lower Bound for the Volatility Swap in the Lognormal SABR Model

open access: yesAxioms, 2023
In the short time to maturity limit, it is proved that for the conditionally lognormal SABR model the zero vanna implied volatility is a lower bound for the volatility swap strike.
Elisa Alòs   +2 more
doaj   +1 more source

Cramér-Rao Lower Bound for Fuzzy-Valued Random Variables

open access: yesAustrian Journal of Statistics, 2016
In some point estimation problems, we may confront imprecise (fuzzy) concepts. One important case is a situation where all observations are fuzzy rather than crisp.
Hamzeh Torabi
doaj   +1 more source

Lower Bounds for Matrix Factorization [PDF]

open access: yescomputational complexity, 2021
We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various incarnations in computer science; the most significant being in the context of lower bounds for algebraic circuits which ...
Kumar, Mrinal, Volk, Ben Lee
openaire   +5 more sources

Uniform bounds on the 1-norm of the inverse of lower triangular Toeplitz matrices [PDF]

open access: yes, 2011
A uniform bound on the 1-norm is given for the inverse of a lower triangular Toeplitz matrix with non-negative monotonically decreasing entries whose limit is zero. The new bound is sharp under certain specified constraints.
J.Y. Yuan   +7 more
core   +4 more sources

Several Functions Originating from Fisher–Rao Geometry of Dirichlet Distributions and Involving Polygamma Functions

open access: yesMathematics, 2023
In this paper, the authors review and survey some results published since 2020 about (complete) monotonicity, inequalities, and their necessary and sufficient conditions for several newly introduced functions involving polygamma functions and originating
Feng Qi, Ravi Prakash Agarwal
doaj   +1 more source

A fully implicit, lower bound, multi-axial solution strategy for direct ratchet boundary evaluation : theoretical development [PDF]

open access: yes, 2013
Ensuring sufficient safety against ratchet is a fundamental requirement in pressure vessel design. Determining the ratchet boundary can prove difficult and computationally expensive when using a full elastic-plastic finite element analysis and a number ...
Jappy, Alan   +2 more
core   +4 more sources

Lower Bound for the First Steklov Eigenvalue

open access: yesRevista de Ciencias, 2014
In this paper we find lower bounds for the first Steklov eigenvalue in Riemannian n-manifolds, n = 2, 3, with non-positive sectional curvature.
Óscar Andrés Montaño
doaj   +1 more source

Average Rate Analysis of Cooperative NOMA Aided Underwater Optical Wireless Systems

open access: yesIEEE Open Journal of the Communications Society, 2021
In this paper, we consider a cooperative non-orthogonal multiple access (NOMA) aided underwater optical wireless system in which the source transmits to two users where the near user serves as a relay node to the far user. Our proposed system consists of
Kapila W. S. Palitharathna   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy