Local complexity of Delone sets and crystallinity

This paper characterizes when a Delone set X in R-n is an ideal crystal in terms of restrictions on the number of its local patches of a given size or on the heterogeneity of their distribution. For a Delone set X, let N-X (T) count the number of translation-inequivalent patches of radius T in X and let M-X (T) be the minimum radius such that every closed ball of radius M-X(T) contains the center of a patch of every one of these kinds. We show that for each of these functions there is a gap in the spectrum of possible growth rates between being bounded and having linear growth, and that having sufficiently slow linear growth is equivalent to X being an ideal crystal. Explicitly, for N-X (T), if R is the covering radius of X then either N-X (T) is bounded or N-X (T) greater than or equal to T/2R for all T > 0. The constant 1/2R in this bound is best possible in all dimensions. For M-X(T), either M-X(T) is bounded or M-X(T) greater than or equal to T/3 for all T > 0. Examples show that the constant 1/3 in this bound cannot be replaced by any number exceeding 1/2. We also show that every aperiodic Delone set X has M-X(T) greater than or equal to c(n)T for all T > 0, for a certain constant c(n) which depends on the dimension n of X and is > 1/3 when n > 1.

Child welfare workers' use of theory in working with physical child abuse: Implications for professional supervision

This article examines child welfare workers' understanding of physical child abuse and the Implications for those supervising these workers. The article Is based on the results of a study that involved In-depth Interviews and focus groups with statutory child welfare workers. Analysis revealed that workers' understanding of physical child abuse embodied a wide range of ideas that were generally consistent with existing literature. The study highlights the value and utility of a reflective approach In stimulating and making explicit the theoretical underpinnings of child welfare workers practice. Specific Implications for professional supervision are addressed.

Exact theory of sedimentation equilibrium made useful

The exact description of the thermodynamics of solutions has been used to describe, without approximation, the distribution of all the components of an incompressible solution in a centrifuge cell at sedimentation equilibrium. Thermodynamic parameters describing the interactions between solute components of known molar mass can be obtained by direct analysis of the experimental data. Interpretation of the measured thermodynamic parameters in terms of molecular interactions requires that an arbitrary distinction be made between nonassociative forces, like hard-sphere volume-exclusion and mean-field electrostatic repulsion or attraction, and specific short-range forces of association that give rise to the formation of molecular aggregates. Provided the former can be accounted for adequately, the effects of the latter can be elucidated in the form of good estimates of the equilibrium constants for the reactions of aggregation.

A refinement calculus for logic programs

Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and refinement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.

Theory of mind and peer acceptance in preschool children

Two studies tested the hypothesis that preschool children's theory of mind ability is related to their levels of peer acceptance. In Study 1, 78 children between the ages of 4 and 6 provided peer nominations that allowed determination of social preference and social impact scores, and classification in one of five peer status groups (following Coie & Dodge, 1983). Children were also tested on five different theory of mind tasks. The results showed that theory of mind scores were significantly related to social preference scores in a subsample of children who were over 5 years old. Further, popular children were found to score higher on theory of mind tasks than children classified as rejected. Study 2 replicated and extended the first study with a new sample of 87 4- to 6-year-old children. Study 2 included measures of peer acceptance, theory of mind ability and verbal intelligence, as well as teacher ratings of prosocial and aggressive behaviours. The results of Study 2 showed that for the total group of children, prosocial behaviour was the best predictor of social preference scores. When the Study 2 sample was split into older and younger children, theory of mind ability was found to be the best predictor of social preference scores for the older children (over age 5), while aggressive and prosocial behaviours were the best predictors of peer acceptance in the younger children. Overall, the pattern of results suggests that the impact of theory of mind ability on peer acceptance is modest but increases with children's age.

Ab initio modelling of basal plane oxidation of graphenes and implications for modelling char combustion

Ab initio calculations have been performed to determine the energetics of oxygen atoms adsorbed onto graphene planes and the possible reaction path extracting carbon atorns in the form of carbon monoxide. Front the energetics it is confirmed that this reaction path will not significantly contribute to the gasification of well ordered carbonaceous chars. Modelling results which explore this limit Lire presented. (C) 2002 Elsevier Science Ltd, All rights reserved.

Participation and older people: Meaning, theory and practice

Increasing older people's participation in society is important in ageing policies worldwide. There is a need to understand the challenges for health professionals of transforming policy on participation into liberating social change practices on the ground. This paper explores the meaning, theory and practice of participation. It uses the example of a work in progress project that has attempted to address structural barriers to older people's participation within an Australian aged care facility, to illustrate theoretical and practice principles surrounding participation.

Branching processes and computational collapse of discretized unimodal mappings

In computer simulations of smooth dynamical systems, the original phase space is replaced by machine arithmetic, which is a finite set. The resulting spatially discretized dynamical systems do not inherit all functional properties of the original systems, such as surjectivity and existence of absolutely continuous invariant measures. This can lead to computational collapse to fixed points or short cycles. The paper studies loss of such properties in spatial discretizations of dynamical systems induced by unimodal mappings of the unit interval. The problem reduces to studying set-valued negative semitrajectories of the discretized system. As the grid is refined, the asymptotic behavior of the cardinality structure of the semitrajectories follows probabilistic laws corresponding to a branching process. The transition probabilities of this process are explicitly calculated. These results are illustrated by the example of the discretized logistic mapping.

Taxonomic theory and the ICF: Foundations for a unified disability athletics classification

Development of a unified classification system to replace four of the systems currently used in disability athletics (i.e., track and field) has been widely advocated. The definition and purpose of classification, underpinned by taxonomic principles and collectively endorsed by relevant disability sport organizations, have not been developed but are required for successful implementation of a unified system. It is posited that the International classification of functioning. disability, and health (ICF), published by the World Health Organization (2001), and current disability athletics systems are, fundamentally, classifications of the functioning and disability associated with health conditions and are highly interrelated. A rationale for basing a unified disability athletics system on ICF is established. Following taxonomic analysis of the current systems, the definition and purpose of a unified disability athletics classification are proposed and discussed. The proposed taxonomic framework and definitions have implications for other disability sport classification systems.

Evaluating two morningness scales with item response theory

Using a student sample (n = 692) and an organization sample (n = 180), we scrutinized two morning-evening orientation scales using item response theory (IRT) methods. We used IRT to compare the measurement precision of the Composite Scale (CS) and the Early/Late Preferences Scale (PS). The CS had slightly higher measurement precision at all ranges of orientations, except for extreme morning and evening orientations for which the PS had slightly higher precision. IRT item-level statistics were also computed to try to understand how morning-orientation items functioned. Items that asked questions about morning activities tended to be more discriminating indicators of morning-orientation than items that asked about evening or peak performance activities. Items that involved unpleasant activities were less frequently endorsed than items that involved neutral or enjoyable activities. Implications for measurement of morning-evening orientation are discussed. (C) 2002 Elsevier Science Ltd. All rights reserved.

Overlarge sets of 2-(11, 5, 2) designs and related configurations

We consider the construction of several configurations, including: • overlarge sets of 2-(11,5,2) designs, that is, partitions of the set of all 5-subsets of a 12-set into 72 2-(11,5,2) designs; • an indecomposable doubly overlarge set of 2-(11,5,2) designs, that is, a partition of two copies of the set of all 5-subsets of a 12-set into 144 2-(11,5,2) designs, such that the 144 designs can be arranged into a 12 × 12 square with interesting row and column properties; • a partition of the Steiner system S(5,6,12) into 12 disjoint 2-(11,6,3) designs arising from the diagonal of the square; • bidistant permutation arrays and generalized Room squares arising from the doubly overlarge set, and their relation to some new strongly regular graphs.

Partitioning sets of triples into small planes

We study partitions of the set of all ((v)(3)) triples chosen from a v-set into pairwise disjoint planes with three points per line. Our partitions may contain copies of PG(2, 2) only (Fano partitions) or copies of AG(2, 3) only (affine partitions) or copies of some planes of each type (mixed partitions). We find necessary conditions for Fano or affine partitions to exist. Such partitions are already known in several cases: Fano partitions for v = 8 and affine partitions for v = 9 or 10. We construct such partitions for several sporadic orders, namely, Fano partitions for v = 14, 16, 22, 23, 28, and an affine partition for v = 18. Using these as starter partitions, we prove that Fano partitions exist for v = 7(n) + 1, 13(n) + 1, 27(n) + 1, and affine partitions for v = 8(n) + 1, 9(n) + 1, 17(n) + 1. In particular, both Fano and affine partitions exist for v = 3(6n) + 1. Using properties of 3-wise balanced designs, we extend these results to show that affine partitions also exist for v = 3(2n). Similarly, mixed partitions are shown to exist for v = 8(n), 9(n), 11(n) + 1.