Questions of belief are essential in analyzing protocols for the authentication of principals in distributed computing systems. In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis; we show how various protocols differ subtly with respect to the required

and metric assumptions are open to question. It has been argued by many authors that dimensional representations are appropriate for certain stimuli (e.g., colors, tones) but not for others. It seems more appropriate to represent faces, countries, or personalities in terms of many qualitative features than

and more a necessity for establishing some order and control in the investment of information systems resources. The cost involved and the success of the business depending increasingly on its information systems require a disciplined approach to the management of those systems. On the assumption

A dense set of single nucleotide polymorphisms (SNP) covering the genome and an efficient method to assess SNP genotypes are expected to be available in the near future. An outstanding question is how to use these technologies efficiently to identify genes affecting liability to complex disorders

or as propaganda to support the status quo. Little has been done recently to determine the representation of intra- versus interracial crime in the crime drama. Also, there is the underlying assumption that may be taken almost a priori by viewers that criminals are more often portrayed as poor and non

All analytical and simulation research on ad hoc wireless networks must necessarily model radio propagation using simplifying assumptions. A growing body of research, however, indicates that the behavior of the protocol stack may depend significantly on these underlying assumptions. The standard

an issue, downstream someplace it will be a much bigger one. How big and how soon? The answers to these questions are what the authors had failed to appreciate. To get a handle on the answers, consider an old friend--- the equation for the average time to access memory, where t c and t m are the cache

code. This, we believe, gives a strong indication that these problems are hard. Our reduction, however, is quantum. Hence, an efficient solution to the learning problem implies a quantum algorithm for SVP and SIVP. A main open question is whether this reduction can be made classical. We also present a

This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a great number of applications, including the famous Netflix Prize and other similar questions in collaborative filtering

The report "Associations with High-Risk Sexual Behavior " in this issue by Steiner and his col-leagues! raises many issues that invite further discussion and exploration. Certainly, with the rise in rates of persons positive for human immuno-deficiency virus (HIV) infection, research on un-derstanding primary prevention of this disease is timely and relevant. Early attempts at research into the behavioral correlates of population groups with dispropor-tionately high HIV positivity rates initially fo-cused on the information base of the population. Since then, several well-documented studies have reported that information by itself is not suffi-cient to prompt behavioral change that protects against HIV exposure.2,3