We study alternative types of Steiner points (to circumcenters) for computing quality guaranteed Delaunay triangulations in three dimensions. We show through experiments that their effective use results in smaller (in the number of tetrahedra) triangulations than the output of the traditional circumcenter refinement methods.

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...

'What Manchester thinks today, London thinks tomorrow' (19th century saying) This issue is dedicated to Manchester and its celebration of 60 years of academic occupational medicine. As a Mancunian myself I am particularly proud to be writing this editorial and introducing you to a special issue that has seen the people of Manchester respond to another challenge. Whether it is industry, art, mus...

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...