نتایج جستجو برای: mixed monotone property

تعداد نتایج: 387061  

2011
ANDREI GABRIELOV NICOLAI VOROBJOV

A coordinate cone in R n is an intersection of some coordinate hy-perplanes and open coordinate half-spaces. A semi-monotone set is an open bounded subset of R n , definable in an o-minimal structure over the reals, such that its intersection with any translation of any coordinate cone is connected. This can be viewed as a generalization of the convexity property. Semi-monotone sets have a numb...

2009
Stefano Bianchini Daniela Tonon

The Jordan decomposition states that a function f : R → R is of bounded variation if and only if it can be written as the difference of two monotone increasing functions. In this paper we generalize this property to real valued BV functions of many variables, extending naturally the concept of monotone function. Our result is an extension of a result obtained by Alberti, Bianchini and Crippa. A...

2010
M. ŠTĚPNIČKA

Fuzzy interpolation property is among the most important properties of fuzzy inference systems. It has been showed that the normality plus Ruspini condition applying to the antecedent fuzzy sets is a sufficient condition with a high practical impact. Another important property is the monotone behavior of the resulting control function (after a defuzzification) derived from a monotone fuzzy rule...

We introduce a new concept of general $G$-$eta$-monotone operator generalizing the general $(H,eta)$-monotone operator cite{arvar2, arvar1}, general $H-$ monotone operator cite{xiahuang} in Banach spaces, and also generalizing $G$-$eta$-monotone operator cite{zhang}, $(A, eta)$-monotone operator cite{verma2}, $A$-monotone operator cite{verma0}, $(H, eta)$-monotone operator cite{fanghuang}...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2013
Raghav Kulkarni Youming Qiao Xiaoming Sun

For a Boolean function f, let D(f) denote its deterministic decision tree complexity, i.e., minimum number of (adaptive) queries required in worst case in order to determine f. In a classic paper, Rivest and Vuillemin [19] show that any non-constant monotone property P : {0, 1}( n 2) → {0, 1} of n-vertex graphs has D(P) = Ω(n). We extend their result to 3-uniform hypergraphs. In particular, we ...

2003
TZANKO DONCHEV

The notions of relaxed submonotone and relaxed monotone mappings in Banach spaces are introduced and many of their properties are investigated. For example, the Clarke subdifferential of a locally Lipschitz function in a separable Banach space is relaxed submonotone on a residual subset. For example, it is shown that this property need not be valid on the whole space. We prove, under certain hy...

Journal: :Proceedings of the ACM on programming languages 2022

Inferring inductive invariants is one of the main challenges formal verification. The theory abstract interpretation provides a rich framework to devise invariant inference algorithms. One latest breakthroughs in property-directed reachability (PDR), but research community views PDR and as mostly unrelated techniques. This paper shows that, surprisingly, propositional can be formulated an algor...

Journal: :Systems & Control Letters 2012
Alexandre Mauroy Rodolphe Sepulchre

This paper establishes a global contraction property for networks of phase-coupled oscillators characterized by a monotone coupling function. The contraction measure is a total variation distance. The contraction property determines the asymptotic behavior of the network, which is either finite-time synchronization or asymptotic convergence to a splay state.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید