Results 11  20
of
3,109
Antimonotonous quadratic forms and partially ordered sets
"... Let P be a bounded set in ndimensional space Rn, f(x1,...,xn) = f(x) (x ∈ Rn) be a continuous function. By the second Weierstrass theorem ( [1], s. 163) inf{f(P)} ( = inf f(x)) is reached. We will call a function f Pfaithful, if inf{f(P)} is not reached P on P \ P and inf{f(P)}> 0 (i. e. f is ..."
Abstract
 Add to MetaCart
Let P be a bounded set in ndimensional space Rn, f(x1,...,xn) = f(x) (x ∈ Rn) be a continuous function. By the second Weierstrass theorem ( [1], s. 163) inf{f(P)} ( = inf f(x)) is reached. We will call a function f Pfaithful, if inf{f(P)} is not reached P on P \ P and inf{f(P)}> 0 (i. e. f is positive on P). Remark that if n = 1, P = (a, b), then it is necessary for Pfaithfulness that a function is not monotonous. Further we will suppose that P = Pn = {(x1,...,xn)  0 < xi ≤ 1, i = 1, n, x1 + · · · + xn = 1}. If n> 1 then xi < 1, i = 1, n. Then P = {(x1,...,xn)0 ≤ xi ≤ 1, i = 1, n, x1 +... + xn = 1}. In this case the Pfaithfullness f is essentially connected with behavior of function on the hyperplane Hn = {(x1,...,xn)  x1 + · · · + xn = 0}. For differentiable function f put C − (f) = {h ∈ Hn \ {0}  ∂f (h) ≤ 0, i = 1, n}, ∂xi C +(f) = {h ∈ Hn \ {0}  ∂f ∂xi (h) ≥ 0, i = 1, n}, C(f) = C+ (f) ∪ C − (f). A function f is
Subtyping recursive types
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1993
"... We investigate the interactions of subtyping and recursive types, in a simply typed λcalculus. The two fundamental questions here are whether two (recursive) types are in the subtype relation, and whether a term has a type. To address the first question, we relate various definitions of type equiva ..."
Abstract

Cited by 330 (8 self)
 Add to MetaCart
We investigate the interactions of subtyping and recursive types, in a simply typed λcalculus. The two fundamental questions here are whether two (recursive) types are in the subtype relation, and whether a term has a type. To address the first question, we relate various definitions of type equivalence and subtyping that are induced by a model, an ordering on infinite trees, an algorithm, and a set of type rules. We show soundness and completeness between the rules, the algorithm, and the tree semantics. We also prove soundness and a restricted form of completeness for the model. To address the second question, we show that to every pair of types in the subtype relation we can associate a term whose denotation is the uniquely determined coercion map between the two types. Moreover, we derive an algorithm that, when given a term with implicit coercions, can infer its least
Bifold constraintbased mining by simultaneous monotone and antimonotone checking
 In The fifth IEEE International Conference on Data Mining (ICDM’05
, 2005
"... Mining for frequent itemsets can generate an overwhelming number of patterns, often exceeding the size of the original transactional database. One way to deal with this issue is to set filters and interestingness measures. Others advocate the use of constraints to apply to the patterns, either on th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
the opportunity to exploit those constraints. In this paper we propose an approach that allows the efficient mining of frequent itemsets patterns, while pushing simultaneously both monotone and antimonotone constraints during and at different strategic stages of the mining process. Our implementation shows a
DISTRIBUTION FREE BOUNDS FOR SPREAD OPTIONS AND MARKET IMPLIED ANTIMONOTONICITY GAP
"... Abstract. We derive in closed form distribution free bounds and optimal hedging strategies for spread options. Upper bounds are obtained when the spread option’s joint distribution is constrained by the prices of traded options with all available strikes of a given maturity. The difference between t ..."
Abstract
 Add to MetaCart
the upper bound and the market price is a useful new measure of codependence, we refer to as the market implied antimonotonicity gap. I.
Min, Max and PTIME AntiMonotonic Overlap Graph Measures
"... The central task in graph mining is to find subgraphs, called patterns that occur frequently in either a collection of graphs, or in one large graph. Especially in the singlegraph setting, the notion of frequency, however, is not at all ..."
Abstract
 Add to MetaCart
The central task in graph mining is to find subgraphs, called patterns that occur frequently in either a collection of graphs, or in one large graph. Especially in the singlegraph setting, the notion of frequency, however, is not at all
Logic Programming and Negation: A Survey
 JOURNAL OF LOGIC PROGRAMMING
, 1994
"... We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the prooftheoretic and modeltheoretic issues and the relationships between them. ..."
Abstract

Cited by 274 (8 self)
 Add to MetaCart
We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the prooftheoretic and modeltheoretic issues and the relationships between them.
On antimonotone frequency measures for extracting sequential patterns from a single verylarge data sequence
 In Proceedings of the First International Workshop on Knowledge Discovery in Data Streams, in conjunction with ECML/PKDD
, 2004
"... In this paper, we propose a novel frequency measure, called the total frequency, for counting multiple occurrences of a sequential pattern in a verylong single data sequence. The total frequency satisfies the antimonotonicity property, and makes it possible to count up pattern occurrences without ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper, we propose a novel frequency measure, called the total frequency, for counting multiple occurrences of a sequential pattern in a verylong single data sequence. The total frequency satisfies the antimonotonicity property, and makes it possible to count up pattern occurrences without
A Hierarchy of Authentication Specifications
, 1997
"... Many security protocols have the aim of authenticating one agent to another. Yet there is no clear consensus in the academic literature about precisely what “authentication” means. In this paper we suggest that the appropriate authentication requirement will depend upon the use to which the protocol ..."
Abstract

Cited by 240 (5 self)
 Add to MetaCart
Many security protocols have the aim of authenticating one agent to another. Yet there is no clear consensus in the academic literature about precisely what “authentication” means. In this paper we suggest that the appropriate authentication requirement will depend upon the use to which the protocol is put, and identify several possible definitions of “authentication”. We formalize each definition using the process algebra CSP, use this formalism to study their relative strengths, and show how the model checker FDR can be used to test whether a system running the protocol meets such a specification. 1
ISSN: 1955611XAnticomonotone random variables and Antimonotone risk aversion ∗
, 2010
"... This paper focuses on the study of decision making under risk. We, first, recall some modelfree definitions of risk aversion and increase in risk. We propose a new form of behavior under risk that we call antimonotone risk aversion (hereafter referred to as ARA) related to the concept of anticomo ..."
Abstract
 Add to MetaCart
This paper focuses on the study of decision making under risk. We, first, recall some modelfree definitions of risk aversion and increase in risk. We propose a new form of behavior under risk that we call antimonotone risk aversion (hereafter referred to as ARA) related to the concept of anti
Results 11  20
of
3,109