Rivest and Lampson have recently introduced SDSI, a Simple Distributed Security Infrastructure. One of the important innovations of SDSI is the use of linked local name spaces. This paper suggests a logical explanation of SDSI’s local name spaces, as a complement to the operational explanation given in the SDSI definition.

This paper describes a method for validating specifications written in the CCITT language SDL. The method has been implemented as part of an experimental validation system. With the experimental system we have been able to perform exhaustive analyses of systems with over 250 million reachable composite system states. The practicality of the tool for the analysis of substantial portions of AT&T'...

Status of this Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract The purpose of this document is to provide an overview of the third version of the Internet-standard Management Framework, termed the SNMP version 3 Framework (SNMPv3). This Framework is derived from and builds upon...

We extend the random permutation model to obtain the best linear unbiased estimator of a finite population mean accounting for auxiliary variables under simple random sampling without replacement (SRS) or stratified SRS. The proposed method provides a systematic design-based justification for well-known results involving common estimators derived under minimal assumptions that do not require sp...

Beliefs are a central determinant of behavior. Recent models have assumed that beliefs about or the anticipation of future consumption can have direct utility-consequences. This gives rise to informational preferences, i.e., preferences over the timing and structure of information. Using a novel and purposefully simple set-up, we experimentally test key predictions about preferences for informa...

Little guidance and few methods are available to refine a set of software requirements into an architecture satisfying those requirements. Part of the challenge stems from the fact that requirements and architectures leverage different terms and concepts to capture the artifacts relevant to each. In this paper we will present CBSP, a lightweight approach intended to provide a systematic way of ...

Let Y ∈ ∆2 be Martin-Löf-random. Then there is a promptly simple set A such that for each Martin-Löf-random set Z, Y ≤T A ⊕ Z ⇒ Y ≤T Z. When Y = Ω, one obtains a c.e. non-computable set A which is not weakly Martin-Löf cuppable. That is, for any Martin-Löf-random set Z, if ∅′ ≤T A⊕ Z, then ∅′ ≤T Z.

Multiple orthogonal polynomials are polynomials of one variable that satisfy orthogonality conditions with respect to several measures. They are a very useful extension of orthogonal polynomials and recently received renewed interest because tools have become available to investigate their asymptotic behavior. They appear in rational approximation, number theory, random matrices, integrable sys...