Results 41 to 50 of about 13,257,834 (322)

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 quadratic lower bound for subset sums [PDF]

open access: yes, 2006
Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A.
Bojan Mohar   +4 more
core   +5 more sources

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

An Evaluation of Mathematical Programming and Lower-Bound Methods for Hybrid Flow Shop Problems With a Makespan Criterion

open access: yesIEEE Access, 2023
This paper considers the hybrid flow shop scheduling problem, where jobs are processed in $m$ stages with the same route of the stage. Each stage has identical parallel machines for processing jobs.
Yarong Chen, Ya-Chih Tsai, Fuh-Der Chou
doaj   +1 more source

Capacity lower bound for the Ising perceptron [PDF]

open access: yesProbability theory and related fields, 2018
We consider the Ising perceptron with gaussian disorder, which is equivalent to the discrete cube {−1,+1}N intersected by M random half-spaces. The perceptron’s capacity is the largest integer MN for which the intersection is nonempty.
Jian Ding, Nike Sun
semanticscholar   +1 more source

A Lower Bound for Sampling Disjoint Sets [PDF]

open access: yes, 2019
Suppose Alice and Bob each start with private randomness and no other input, and they wish to engage in a protocol in which Alice ends up with a set x subseteq[n] and Bob ends up with a set y subseteq[n], such that (x,y) is uniformly distributed over all
, Watson, Thomas
core   +1 more source

Is there a zero lower bound? The effects of negative policy rates on banks and firms

open access: yesJournal of Financial Economics, 2019
Exploiting confidential data from the euro area, we show that sound banks pass negative rates on to their corporate depositors without experiencing a contraction in funding and that the tendency to charge negative rates becomes stronger as policy rates ...
Carlo Altavilla   +3 more
semanticscholar   +1 more source

On the Empirical (Ir)Relevance of the Zero Lower Bound Constraint

open access: yesNBER macroeconomics annual, 2019
We evaluate the hypothesis that the zero lower bound (ZLB) constraint was, in practice, irrelevant during the recent ZLB episode experienced by the US economy (the 2009Q1–2015Q4 period).
Davide Debortoli   +2 more
semanticscholar   +1 more source

A lower bound to the thermal diffusivity of insulators [PDF]

open access: yesJournal of Physics: Condensed Matter, 2019
It has been known for decades that thermal conductivity of insulating crystals becomes proportional to the inverse of temperature when the latter is comparable to, or higher than, the Debye temperature. This behavior has been understood as resulting from
Kamran Behnia, A. Kapitulnik
semanticscholar   +1 more source

New Query Lower Bounds for Submodular Function Minimization [PDF]

open access: yes, 2019
We consider submodular function minimization in the oracle model: given black-box access to a submodular set function $f:2^{[n]}\rightarrow \mathbb{R}$, find an element of $\arg\min_S \{f(S)\}$ using as few queries to $f(\cdot)$ as possible. State-of-the-
Graur, Andrei   +3 more
core   +2 more sources

Home - About - Disclaimer - Privacy