A logical approach to multilevel security of probabilistic systems

Summary. We set out a modal logic for reasoning about multilevel security of probabilistic systems. This logic contains expressions for time, probability, and knowledge. Making use of the Halpern-Tuttle framework for reasoning about knowledge and probability, we give a semantics for our logic and prove it is sound. We give two syntactic definitions of perfect multilevel security and show that their semantic interpretations are equivalent to earlier, independently motivated characterizations. We also discuss the relation between these characterizations of security and between their usefulness in security analysis.     

A rotor lamination design for surface permanent magnet retention athigh speeds

A major problem in the design and manufacturing of surface mounted permanent magnet machines is reliably holding the permanent magnets in place at high speeds. This paper evaluates a unique rotor lamination design for a high pole number, permanent magnet alternator. This buried magnet design, which is capable of reliably holding the permanent magnets in place at high speeds, offers both easier and cheaper assembly when compared with the methods currently used in surface mounted permanent magnet machines. Finite element analysis is used to compare the buried magnet design with equivalent surface mounted designs and shows that the performance of the alternator is not significantly affected by the iron over the magnets. Experimental results from a prototype alternator further corroborate the FEA and show that the design is capable of operating at high speeds with no other means of magnet retention. In addition, an improvement in the buried magnet design which can reduce the lamination complexity is suggested and examined     

Anonymous connections and onion routing

Onion routing is an infrastructure for private communication over a public network. It provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. Onion routing's anonymous connections are bidirectional, near real-time, and can be used anywhere a socket connection can be used. Any identifying information must be in the data stream carried over an anonymous connection. An onion is a data structure that is treated as the destination address by onion routers; thus, it is used to establish an anonymous connection. Onions themselves appear different to each onion router as well as to network observers. The same goes for data carried over the connections they establish. Proxy-aware applications, such as Web browsers and e-mail clients, require no modification to use onion routing, and do so through a series of proxies. A prototype onion routing network is running between our lab and other sites. This paper describes anonymous connections and their implementation using onion routing. This paper also describes several application proxies for onion routing, as well as configurations of onion routing networks     

Temporarily hidden bit commitment and lottery applications

This paper describes various types of commitment functions that maintain a secret for a predictable time delay or until a moderate and predictable amount of computation has occurred. The properties we set out for such functions are based on their usefulness for various applications, such as publicly verifiable lotteries, rather than for cryptologic investigation of the functions. In these lotteries, winners are chosen fairly using only internal information. Since all this information may be published (even before the lottery closes), anyone can do the calculation and therefore verify that the winner was chosen correctly. Since the calculation uses a delaying or similar function, neither ticket purchasers nor the lottery organizer can take advantage of this information. We describe several such lotteries and the security requirements they satisfy, assuming that functions with the properties we state are used.     

A further attempt to differentiate violent from nonviolent offenders by means of a battery of psychological tests.

30 male Ss who had been convicted of violent offenses and 30 convicted on nonviolent offenses (mean ages 17.5 and 17.4 yrs, respectively) were administered the WAIS, Buss-Durkee Hostility Inventory (BDHI), the Hostility and Direction of Hostility Questionnaire, and the Eysenck Personality Questionnaire. Only 6 of the dependent variables differentiated between the 2 groups at or beyond the .05 level of significance. They were Information, Comprehension, Verbal IQ, Object Assembly, Full Scale IQ, and Assault. With the exception of Assault (a BDHI subscale), all the variables come from the WAIS. There were no significant differences between the 2 groups on S. B. Eysenck and H. J. Eysenck's (1975) personality dimensions of extraversion, neuroticism, and psychoticism. (French abstract) (27 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Two decades of doctorates in psychology: A comparison with national trends.

Summarizes data collected by the National Research Council on the production of doctorates from US universities, 1960–1981. Included are data on demographic trends, primary source of financial support for graduate study, and employment and study plans following receipt of the doctorate. Data for psychology are contrasted with those for the physical sciences, engineering, life sciences, social sciences, humanities, and education. There are considerable differences among fields on nearly every variable studied, and among the special characteristics of psychology are a continued growth in the production of doctorates, a high percentage of female doctorate recipients, a reliance on own resources as the primary support for graduate study, a decrease in planned academic employment, and an increase in plans for employment in industry/business and nonprofit settings. (3 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)