The land assembly problem revisited

As in the standard land assembly problem, a developer wants to buy two adjacent blocks of land belonging to two different owners. The value of the two blocks of land to the developer is greater than the sum of the individual values of the blocks for each owner. Unlike the land assembly literature, however, our focus is on the incentive that each lot owner has to delay the start of negotiations, rather than on the public goods nature of the problem. An incentive for delay exists, for example, when owners perceive that being last to sell will allow them to capture a larger share of the joint surplus from the development. We show that competition at point of sale can cause equilibrium delay, and that cooperation at point of sale will eliminate delay. This suggests that strategic delay is another source for the inefficient allocation of land, in addition to the public-good type externality pointed out by Grossman and Hart [Bell Journal of Economics 11 (1980) 42] and O'Flaherty [Regional Science and Urban Economics 24 (1994) 287]. (C) 2004 Elsevier B.V. All rights reserved.

Teen Triple P: A universal approach to reducing risk factors for behavioural and emotional problems in adolescents at the transition to high school

Teen Triple P is a multilevel system of intervention that is designed to provide parents with specific strategies to promote the positive development of their teenage children as they make the transition into high school and through puberty. The program is based on a combination of education about the developmental needs of adolescents, skills training to improve communication and problem-solving, plus specific modules to deal with common problems encountered by parents and adolescents that can escalate into major conflict and violence. It is designed to increase the engagement of parents of adolescent and pre-adolescent children by providing them with easy access to evidencebased parenting advice and support. This paper presents data collected as part of a survey of over 1400 students in first year high school at 9 Brisbane schools. The survey instrument was constructed to obtain students' reports about behaviour which is known to be associated with their health and wellbeing, and also on the extent to which their parents promoted or discouraged such behaviour at home, at school, and in their social and recreational activities in the wider community. Selected data from the survey were extracted and presented to parents at a series of parenting seminars held at the schools to promote appropriate parenting of teenagers. The objectives were to provide parents with accurate data about teenagers' behaviour, and about teenagers' reports of how they perceived their parents' behaviour. Normative data on parent and teenager behaviour will be presented from the survey as well as psychometric data relating to the reliability and validity of this new measure. Implications of this strategy for increasing parent engagement in parenting programs that aim to reduce behavioural and emotional problems in adolescents will be discussed.

A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

Mild myocardial infarction - A classification problem in epidemiologic studies

In studies assessing the trends in coronary events, such as the World Health Organization (WHO) MONICA Project (multinational MONItoring of trends and determinants of CArdiovascular disease), the main emphasis has been on coronary deaths and non-fatal definite myocardial infarctions (MI). It is, however, possible that the proportion of milder MIs may be increasing because of improvements in treatment and reductions in levels of risk factors. We used the MI register data of the WHO MONICA Project to investigate several definitions for mild non-fatal MIs that would be applicable in various settings and could be used to assess trends in milder coronary events. Of 38 populations participating in the WHO MONICA MI register study, more than half registered a sufficiently wide spectrum of events that it was possible to identify subsets of milder cases. The event rates and case fatality rates of MI are clearly dependent on the spectrum of non-fatal MIs, which are included. On clinical grounds we propose that the original MONICA category ''non-fatal possible MI'' could bt:divided into two groups: ''non fatal probable MI'' and ''prolonged chest pain.'' Non-fatal probable MIs are cases, which in addition to ''typical symptoms'' have electrocardiogram (EGG) or enzyme changes suggesting cardiac ischemia, but not severe enough to fulfil the criteria for non-fatal definite MI In more than half of the MONICA Collaborating Centers, the registration of MI covers these milder events reasonably well. Proportions of non-fatal probable MIs vary less between populations than do proportions of non fatal possible MIs. Also rates of non-fatal probable MI are somewhat more highly correlated with rates of fatal events and non-fatal definite MI. These findings support the validity of the category of non-fatal probable MI. In each center the increase in event rates and the decrease in case-fatality due to the inclusion of non-fatal probable MI was lar er for women than men. For the WHO MONICA Project and other epidemiological studies the proposed category of non-fatal probable MIs can be used for assessing trends in rates of milder MI. Copyright (C) 1997 Elsevier Science Inc.

The intersection problem for K_4-e designs

A G-design of order n is a pair (P,B) where P is the vertex set of the complete graph K-n and B is an edge-disjoint decomposition of K-n into copies of the simple graph G. Following design terminology, we call these copies ''blocks''. Here K-4 - e denotes the complete graph K-4 with one edge removed. It is well-known that a K-4 - e design of order n exists if and only if n = 0 or 1 (mod 5), n greater than or equal to 6. The intersection problem here asks for which k is it possible to find two K-4 - e designs (P,B-1) and (P,B-2) of order n, with \B-1 boolean AND B-2\ = k, that is, with precisely k common blocks. Here we completely solve this intersection problem for K-4 - e designs.

Orofacial granulomatosis: A diagnostic problem for the unwary and a management dilemma. Case reports

Orofacial granulomatosis is a condition that, may be difficult to diagnose for those unfamiliar with the entity. This paper describes two cases and addresses the presentation, pathogenesis and treatment. The clinical recognition of his condition is important as is the subsequent investigation by an appropriate specialist. Management of patients needs to take into account the results of further investigations, the patient's expectations, and the severity of the condition.

Simulated-annealing-based genetic algorithm for modeling the optical constants of solids

We propose a simulated-annealing-based genetic algorithm for solving model parameter estimation problems. The algorithm incorporates advantages of both genetic algorithms and simulated annealing. Tests on computer-generated synthetic data that closely resemble optical constants of a metal were performed to compare the efficiency of plain genetic algorithms against the simulated-annealing-based genetic algorithms. These tests assess the ability of the algorithms to and the global minimum and the accuracy of values obtained for model parameters. Finally, the algorithm with the best performance is used to fit the model dielectric function to data for platinum and aluminum. (C) 1997 Optical Society of America.

Genetic algorithms for continuous optimization problems - a concept of parameter-space size adjustment

The concept of parameter-space size adjustment is pn,posed in order to enable successful application of genetic algorithms to continuous optimization problems. Performance of genetic algorithms with six different combinations of selection and reproduction mechanisms, with and without parameter-space size adjustment, were severely tested on eleven multiminima test functions. An algorithm with the best performance was employed for the determination of the model parameters of the optical constants of Pt, Ni and Cr.

A defense of backwards in time causation models in quantum mechanics

This paper offers a defense of backwards in time causation models in quantum mechanics. Particular attention is given to Cramer's transactional account, which is shown to have the threefold virtue of solving the Bell problem, explaining the complex conjugate aspect of the quantum mechanical formalism, and explaining various quantum mysteries such as Schrodinger's cat. The question is therefore asked, why has this model not received more attention from physicists and philosophers? One objection given by physicists in assessing Cramer's theory was that it is not testable. This paper seeks to answer this concern by utilizing an argument that backwards causation models entail a fork theory of causal direction. From the backwards causation model together with the fork theory one can deduce empirical predictions. Finally, the objection that this strategy is questionable because of its appeal to philosophy is deflected.

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.

Guiding intellectual and personal growth across educational contexts

This book recognizes the importance of cooperative learning, in contrast to the traditional classroom, as an effective approach to learning. Its coverage of the subject ranges across the educational spectrum, from pre-school years to university, and offers a fresh perspective on a topic that has gained increasing interest worldwide. With contributions from an international panel of leading experts in the field, this engaging text succeeds in providing key insights, linking the theories that underpin the study of group dynamics to their practical application in the classroom. It presents a comprehensive overview of this alternative educative approach, illustrating how cooperative learning experiences can promote socialisation and friendships, and facilitate learning. The editors assemble a range of well-researched essays, covering such aspects as: * The importance of teacher and student interaction * Small group, virtual and non-virtual teaching environments * Assessment practices for measuring the outcomes of individual and group progress * The effect of cooperative learning on relationships amongst students with diverse cultural, social and learning needs. Illustrated with practical examples throughout, this book will be a crucial read for teacher educators, educational psychologists, student teachers, academics and researchers who want to realize the significant potential of cooperative learning in all educational settings.