Results 11 to 20 of about 153,624 (281)
Cryptographic properties of monotone Boolean functions
We prove various results on monotone Boolean functions. In particular, we prove a conjecture proposed recently, stating that there are no monotone bent Boolean functions.
Carlet Claude +3 more
doaj +2 more sources
Estimating Smooth Monotone Functions
Summary Many situations call for a smooth strictly monotone function f of arbitrary flexibility. The family of functions defined by the differential equation D 2 f =w Df, where w is an unconstrained coefficient function comprises the strictly monotone twice differentiable functions. The solution to this equation is f = C 0 + C 1 D −
openaire +4 more sources
Around Operator Monotone Functions [PDF]
We show that the symmetrized product $AB+BA$ of two positive operators $A$ and $B$ is positive if and only if $f(A+B)\leq f(A)+f(B)$ for all non-negative operator monotone functions $f$ on $[0,\infty)$ and deduce an operator inequality. We also give a necessary and sufficient condition for that the composition $f\circ g$ of an operator convex function $
Moslehian, Mohammad Sal, Najafi, Hamed
openaire +3 more sources
Chebyshev Weighted Type Integral Inequality in Fuzzy and Abstract Spaces [PDF]
In this paper, we express and prove Chebyshev weighted type inequality for fuzzy integrals and in abstract spaces where the functions are strictly monotone functions. Furthermore, we have shown our results for n-th strictly monotone functions.
Bayaz Daraby, Zahra Vaezi
doaj +1 more source
A Unifying Hierarchy of Valuations with Complements and Substitutes [PDF]
We introduce a new hierarchy over monotone set functions, that we refer to as $\mathcal{MPH}$ (Maximum over Positive Hypergraphs). Levels of the hierarchy correspond to the degree of complementarity in a given function. The highest level of the hierarchy,
Feige, Uriel +5 more
core +1 more source
We study n-monotone functionals, which constitute a generalisation of n-monotone set functions. We investigate their relation to the concepts of exactness and natural extension, which generalise the notions of coherence and natural extension in the behavioural theory of imprecise probabilities. We improve upon a number of results in the literature, and
de Cooman, Gert +2 more
openaire +4 more sources
A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a "qualified" subset of parties can efficiently reconstruct the secret while any "unqualified" subset ...
A. Beimel +20 more
core +4 more sources
Hardy-Littlewood theorem for series with general monotone coefficients
In this work we study trigonometric series with general monotone coefficients. Also, we consider Lqϕ ( Lq ) space. In particular, when ϕ ( t ) ≡ 1 the space Lqϕ ( Lq ) coincides with Lq .
S. Bitimkhan
doaj +1 more source
The log-normal, log-logistic and Weibull distributions are commonly utilized to model survival data. Unimodal (or non-monotone) failure rate functions are modeled using the log-normal and the log-logistic families, whereas monotone failure rate functions
Abdisalam Hassan Muse +5 more
doaj +1 more source
CONVEXIFICATION OF STRICTLY MONOTONE FUNCTIONS
This paper presents the theory that guarantees the convexication of a strictly monotone function. We proves a theorem and two corollaries for convexication of strictly monotones functions twice continuously differentiable, then the generalization of ...
Jenny Rojas Jerónimo +1 more
doaj +1 more source

