In Australia are people born in other countries at higher risk of road trauma than locally born people?

This study examined whether people born in other countries had higher rates of death and hospitalization due to road crashes than people born in Australia. Data on deaths that occurred in the whole of Australia between 1994 and 1997 and hospitalizations that occurred in the state of New South Wales, Australia, between I July 1995 and 30 June 1997 due to road crashes were analyzed. The rates of death and hospitalization, adjusted for age and area of residence, were calculated using population data from the 1996 Australian census. The study categorized people born in other countries according to the language (English speaking, non-English speaking) and the road convention (left-hand side, right-hand side) of their country of birth. Australia has the left-hand side driving convention. The study found that drivers born in other countries had rates of death or hospitalization due to road trauma equal to or below those of Australian born drivers. In contrast, pedestrians born in other countries, especially older pedestrians had higher rates of death and hospitalization due to road crashes. Pedestrians aged 60 years or more born in non-English speaking countries where traffic travels on the right-hand side of the road had risks about twice those of Australian born pedestrians in the same age group. (C) 2003 Elsevier Ltd. All rights reserved.

Adaptation on the commons

This paper seeks to understand how software systems and organisations co-evolve in practice and how order emerges in the overall environment. Using a metaphor of timetable as a commons, we analyse the introduction of a novel academic scheduling system to demonstrate how Complex Adaptive Systems theory provides insight into the adaptive behaviour of the various actors and how their action is both a response to and a driver of co-evolution within the engagement.

A family of perfect hashing methods

Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal perfect hash functions, and we identify the one with minimum constants. Members of the family generate a hash function in two steps. First a special kind of function into an r-graph is computed probabilistically. Then this function is refined deterministically to a minimal perfect hash function. We give strong theoretical evidence that the first step uses linear random time. The second step runs in linear deterministic time. The family not only has theoretical importance, but also offers the fastest known method for generating perfect hash functions.

MDA-based re-engineering with Object-Z

This paper describes a practical application of MDA and reverse engineering based on a domain-specific modelling language. A well defined metamodel of a domain-specific language is useful for verification and validation of associated tools. We apply this approach to SIFA, a security analysis tool. SIFA has evolved as requirements have changed, and it has no metamodel. Hence, testing SIFA’s correctness is difficult. We introduce a formal metamodelling approach to develop a well-defined metamodel of the domain. Initially, we develop a domain model in EMF by reverse engineering the SIFA implementation. Then we transform EMF to Object-Z using model transformation. Finally, we complete the Object-Z model by specifying system behavior. The outcome is a well-defined metamodel that precisely describes the domain and the security properties that it analyses. It also provides a reliable basis for testing the current SIFA implementation and forward engineering its successor.