Results 1  10
of
43,588
The fundamental properties of natural numbers
 Journal of Formalized Mathematics
, 1989
"... Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1.h ..."
Abstract

Cited by 688 (73 self)
 Add to MetaCart
Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1
An inventory for measuring clinical anxiety: Psychometric properties
 JOURNAL OF CONSULTING AND CLINICAL PSYCHOLOGY
, 1988
"... The development of a 2 litem selfreport inventory for measuring the severity of anxiety in psychiaric populations i described. The initial item pool f86 items was drawn from three preexisting scales: the Anxiety Checklist, the Physician's Desk Reference Checklist, and the Situational Anxiety ..."
Abstract

Cited by 778 (1 self)
 Add to MetaCart
, generalized anxiety disorder, etc.) from nonanxious diagnostic groups (major depression, dysthymic disorder, etc). In addition, the BAI was moderately correlated with the revised Hamilton Anxiety Rating Scale, r(150) =.51, and was only mildly correlated with the revised Hamilton Depression Rating Scale, r
Additivity properties of topological diagonalizations
 J. Symbolic Logic
, 2003
"... Abstract. In a work of Just, Miller, Scheepers and Szeptycki it was asked whether certain diagonalization properties for sequences of open covers are provably closed under taking finite or countable unions. In a recent work, Scheepers proved that one of the properties in question is closed under tak ..."
Abstract

Cited by 19 (15 self)
 Add to MetaCart
Abstract. In a work of Just, Miller, Scheepers and Szeptycki it was asked whether certain diagonalization properties for sequences of open covers are provably closed under taking finite or countable unions. In a recent work, Scheepers proved that one of the properties in question is closed under
A randomized protocol for signing contracts
, 1990
"... Two parties, A and B, want to sign a contract C over a communication network. To do so, they must “simultaneously” exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments in pie ..."
Abstract

Cited by 599 (11 self)
 Add to MetaCart
commit both parties to the contract given that the other party can, is close to zero. This is true even if A and B have vastly different computing powers, and is proved under very weak cryptographic assumptions. Our protocol has the following additional properties: 4 during the procedure the parties
Problems and Results on Additive Properties of . . .
, 1986
"... A very special case of one of the theorems of the authors states as follows: Let 1 < a, < a, <... be an infinite sequence of integers for which all the sums a, + a,, I < i<j, are distinct. Then there are infinitely many integers k for which 2k can be represented in the form a; + a, ..."
Abstract
 Add to MetaCart
A very special case of one of the theorems of the authors states as follows: Let 1 < a, < a, <... be an infinite sequence of integers for which all the sums a, + a,, I < i<j, are distinct. Then there are infinitely many integers k for which 2k can be represented in the form a; + a, but 2k + 1 cannot be represented in this form. Several unsolved problems are stated.
Compositional Model Checking
, 1999
"... We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approac ..."
Abstract

Cited by 3252 (70 self)
 Add to MetaCart
of approach is that local properties are often not preserved at the global level. We present a general framework for using additional interface processes to model the environment for a component. These interface processes are typically much simpler than the full environment of the component. By composing a
Multivariate adaptive regression splines
 The Annals of Statistics
, 1991
"... A new method is presented for flexible regression modeling of high dimensional data. The model takes the form of an expansion in product spline basis functions, where the number of basis functions as well as the parameters associated with each one (product degree and knot locations) are automaticall ..."
Abstract

Cited by 700 (2 self)
 Add to MetaCart
) are automatically determined by the data. This procedure is motivated by the recursive partitioning approach to regression and shares its attractive properties. Unlike recursive partitioning, however, this method produces continuous models with continuous derivatives. It has more power and flexibility to model
A Digital Signature Scheme Secure Against Adaptive ChosenMessage Attacks
, 1995
"... We present a digital signature scheme based on the computational diculty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosenmessage attack: an adversary who receives signatures for messages of his choice (where each message may be chosen in a ..."
Abstract

Cited by 959 (40 self)
 Add to MetaCart
in a way that depends on the signatures of previously chosen messages) can not later forge the signature of even a single additional message. This may be somewhat surprising, since the properties of having forgery being equivalent to factoring and being invulnerable to an adaptive chosenmessage attack
Results 1  10
of
43,588