Postshutdown cooling requirements of tungsten water-moderated nuclear rocket

Postshutdown cooling requirements of tungsten water moderated nuclear rocket engine

Scheduling language and algorithm development study. Volume 2, phase 2: Introduction to plans programming

A user guide for the Programming Language for Allocation and Network Scheduling (PLANS) is presented. Information is included for the construction of PLANS programs. The basic philosophy of PLANS is discussed, and access and update reference techniques are described along with the use of tree structures

Translational energy dependence of cross sections for reactions of OH− (H2O) n with CO2 and SO2

This is the publisher's version, also available electronically from http://scitation.aip.org/content/aip/journal/jcp/80/10/10.1063/1.446510.A tandem mass spectrometer has been used to measure cross sections for reactions of the solvated negative ions OH−(H2O) n , where 0≤n≤3, with the neutral molecules CO2 and SO2 over the range of reactant translational energy 0.15–25.0 eV (LAB). The reactions observed include solvent switching, collisional dissociation, and charge transfer. The exoergic solvent switching reactions are very rapid, having cross sections which exceed a hundred square Angstroms at low energies. These cross sections decrease approximately as (energy)−0.5 up to 1 eV and then decrease much more rapidly at higher collision energies. Estimates of bond dissociation energies for the cluster ions are derived from the measured translational energy thresholds for the endothermic collisional dissociationreactions

Relating two standard notions of secrecy

Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s should never be disclosed while equivalence-based secrecy states that two executions of a protocol with distinct instances for s should be indistinguishable to an attacker. Although the second formulation ensures a higher level of security and is closer to cryptographic notions of secrecy, decidability results and automatic tools have mainly focused on the first definition so far. This paper initiates a systematic investigation of the situations where syntactic secrecy entails strong secrecy. We show that in the passive case, reachability-based secrecy actually implies equivalence-based secrecy for digital signatures, symmetric and asymmetric encryption provided that the primitives are probabilistic. For active adversaries, we provide sufficient (and rather tight) conditions on the protocol for this implication to hold.Comment: 29 pages, published in LMC

Improving the use of equational constraints in cylindrical algebraic decomposition

When building a cylindrical algebraic decomposition (CAD) savings can be made in the presence of an equational constraint (EC): an equation logically implied by a formula. The present paper is concerned with how to use multiple ECs, propagating those in the input throughout the projection set. We improve on the approach of McCallum in ISSAC 2001 by using the reduced projection theory to make savings in the lifting phase (both to the polynomials we lift with and the cells lifted over). We demonstrate the benefits with worked examples and a complexity analysis

Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers

We prove decidability of univariate real algebra extended with predicates for rational and integer powers, i.e., $(x^n \in \mathbb{Q})$ and $(x^n \in \mathbb{Z})$. Our decision procedure combines computation over real algebraic cells with the rational root theorem and witness construction via algebraic number density arguments.Comment: To appear in CADE-25: 25th International Conference on Automated Deduction, 2015. Proceedings to be published by Springer-Verla

Graduate Education in Agricultural Communication: The Need and Role

Is there a meed for graduate studies in agricultural communication

Scheduling language and algorithm development study. Volume 3, phase 2: As-built specifications for the prototype language and module library

Detailed specifications of the prototype language and module library are presented. The user guide to the translator writing system is included

Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols

We define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of principals and the current global state of the session. Hereby, we can describe the operational semantics of principals and of an intruder in a simple and modular way. Furthermore, using proof theoretic tools like the analysis of permutability of rules, we are able to find efficient proof strategies that we prove complete for special classes of security protocols including Needham-Schroeder. Based on the results of this preliminary analysis, we have implemented a Prolog meta-interpreter which allows for rapid prototyping and for checking safety properties of security protocols, and we have applied it for finding error traces and proving correctness of practical examples

Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains

A new algorithm to compute cylindrical algebraic decompositions (CADs) is presented, building on two recent advances. Firstly, the output is truth table invariant (a TTICAD) meaning given formulae have constant truth value on each cell of the decomposition. Secondly, the computation uses regular chains theory to first build a cylindrical decomposition of complex space (CCD) incrementally by polynomial. Significant modification of the regular chains technology was used to achieve the more sophisticated invariance criteria. Experimental results on an implementation in the RegularChains Library for Maple verify that combining these advances gives an algorithm superior to its individual components and competitive with the state of the art