Computer applications in underground mining systems : final report : prepared for Office of Coal Research, Dept. of Interior ... /

"Period of performance: September, l968- December, 1973."

Solving triangular systems on a parallel computer /

Includes bibliographical references.

The brief encounter review : an investigation in graphic computer-based medical record reporting systems /

Bibliography: p. 85.

Process design and cost estimating algorithms for the computer assisted procedure for design and evaluation of wastewater treatment systems (CAPDET) /

"PB 82-190455."

A preliminary study of commuter rail systems by analytical models and computer simulation.

"The results of a research project undertaken by the Department of Industrial Engineering and Administration of the Cornell University College of Engineering under a summer grant [1963] from the New York State Office of Transportation."

Sizing distributed systems : overview and recommendations /

"Issued May 1980."

Documentation of computer programs and automated data systems : proceedings of a symposium held at the National Bureau of Standards, Gaithersburg, MD, October 12, 1976 /

Mode of access: Internet.

Computer-based national information systems : technology and public policy issues, summary.

"OTA-CIT-147"--P. 4 of cover.

Engineering design handbook : computer aided design of mechanical systems.

Cover title.

On the distributed compression of quantum information

The problem of distributed compression for correlated quantum sources is considered. The classical version of this problem was solved by Slepian and Wolf, who showed that distributed compression could take full advantage of redundancy in the local sources created by the presence of correlations. Here it is shown that, in general, this is not the case for quantum sources, by proving a lower bound on the rate sum for irreducible sources of product states which is stronger than the one given by a naive application of Slepian-Wolf. Nonetheless, strategies taking advantage of correlation do exist for some special classes of quantum sources. For example, Devetak and Winter demonstrated the existence of such a strategy when one of the sources is classical. Optimal nontrivial strategies for a different extreme, sources of Bell states, are presented here. In addition, it is explained how distributed compression is connected to other problems in quantum information theory, including information-disturbance questions, entanglement distillation and quantum error correction.

Agent-based distributed software verification

Despite decades of research, the takeup of formal methods for developing provably correct software in industry remains slow. One reason for this is the high cost of proof construction, an activity that, due to the complexity of the required proofs, is typically carried out using interactive theorem provers. In this paper we propose an agent-oriented architecture for interactive theorem proving with the aim of reducing the user interactions (and thus the cost) of constructing software verification proofs. We describe a prototype implementation of our architecture and discuss its application to a small, but non-trivial case study.

Methods for conflict resolution in policy-based management systems

While developments in distributed object computing environments, such as the Common Object Request Broker Architecture (CORBA) [17] and the Telecommunication Intelligent Network Architecture (TINA) [16], have enabled interoperability between domains in large open distributed systems, managing the resources within such systems has become an increasingly complex task. This challenge has been considered for several years within the distributed systems management research community and policy-based management has recently emerged as a promising solution. Large evolving enterprises present a significant challenge for policy-based management partly due to the requirement to support both mutual transparency and individual autonomy between domains [2], but also because the fluidity and complexity of interactions occurring within such environments requires an ability to cope with the coexistence of multiple, potentially inconsistent policies. This paper discusses the need of providing both dynamic (run-time) and static (compile-time) conflict detection and resolution for policies in such systems and builds on our earlier conflict detection work [7, 8] to introduce the methods for conflict resolution in large open distributed systems.