Experimental Verification of Decoherence-Free Subspaces

Using spontaneous parametric down-conversion, we produce polarization-entangled states of two photons and characterize them using two-photon tomography to measure the density matrix. A controllable decoherence is imposed on the states by passing the photons through thick, adjustable birefringent elements. When the system is subject to collective decoherence, one particular entangled state is seen to be decoherence-free, as predicted by theory. Such decoherence-free systems may have an important role for the future of quantum computation and information processing.

Health and safety issues in contemporary dental practice

Under current workplace health and safety legislation, the owners and managers of a dental practice have a legal responsibility to provide staff with a safe working environment. In this article, the emphasis will be on four common areas of risk: posture when seated, handling scalpel blades, flooring and lighting.

International tourists and road safety in Australia: developing a national research and management programme

Motor vehicle crashes are the leading cause of injury death for international tourists. This makes road safety an important issue for tourism authorities. Unfortunately, as it is in other areas of tourist health, the common response from the travel and tourism industry is to remain silent about this problem and to leave any mishaps in the hands of insurers. At the same time, but for different reasons, international tourists are not usually targeted for road safety initiatives by transport authorities. Given that there are considerable 'hidden' costs associated with international tourists and motor vehicle crashes, the topic should be of concern to both tourism and transport groups. This paper examines issues concerned with driving in unfamiliar surroundings for international visitors in Australia, and proposes a national research and management programme to guide policy and planning in the area. (C) 1999 Elsevier Science Ltd. All rights reserved.

Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.