We present a very simple, cryptographic, Byzantine-agreement protocol that, with n = 3t + 1 players, t of which are malicious, halts in expected 9 rounds.

Lewbel and Pendakur (2008) develop the idea of implicit Marshallian demands. Implicit Marshallian demand systems allow the incorporation of both unobserved preference heterogeneity and complex Engel curves into consumer demand analysis, circumventing the standard problems associated with combining rationality with either (or both) unobserved heterogeneity and high rank in demand. They also deve...

The infinite matrices in Witten’s vertex are easy to diagonalize. It just requires some SL(2,R) lore plus a Watson-Sommerfeld transformation. We calculate the eigenvalues of all Neumann matrices for all scale dimensions s, both for matter and ghosts, including fractional s which we use to regulate the difficult s = 0 limit. We find that s = 1 eigenfunctions just acquire a p term, and x gets rep...

Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memory system, a powerful tool for concurrency control, serving as the basis for solutions to coordination problems such as mutual exclusion, `-exclusion, randomized consensus, and multi-writer multi-reader atomic registers. Solutions to these problems all use an \unbounded numbe...

In the late seventies, Pnueli suggested that functional properties of reactive systems be formally expressed in temporal logic. In order that model checking such a logic be possible, it must have sufficient expressive power, its semantics must be formally defined in a rigorous way, and the complexity of model checking it must be well understood and reasonable. In order to allow widespread adopt...

A comprehensive graphical analysis approach to perform data exploration utilizing the latest capabilities available in SAS systems are presented here. This ® practical approach integrates graphical analysis tools available in SAS systems and provides step-wise instructions to perform data exploration quickly without writing SAS program statements or using menu interface by running the SAS macro...

Several concise formulations of mathematical induction are presented and proven equivalent. The formulations are expressed in variable-free relation algebra and thus are in terms of relations only, without mentioning the related objects. It is shown that the induction principle in this form lends itself very well for use in calculational proofs. As a non-trivial example a proof of a generalisat...

The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems is reduced, involves complementation. For automata on finite words, which correspond to safety properties, complementation involves determinization. The 2 blow-up that is caused by the subset constru...

This is a short book, 207 pages excluding the index, and is ideal for health professionals who wish to learn about or improve their skills in clinical evidence and critical appraisal. The reader can use the book like a critical appraisal course manual working through each chapter consecutively. Alternatively for the person with some knowledge of clinical evidence methodology and critical apprai...