Single turn peptide alpha helices with exceptional stability in water

Cyclic pentapepticles are not known to exist in a-helical conformations. CD and NMR spectra show that specific 20-membered cyclic pentapepticles, Ac-(cyclo-1,5) [KxxxD]-NH2 and Ac-(cyclo-2,6)R[KxxxD]-NH2, are highly a-helical structures in water and independent of concentration, TFE, denaturants, and proteases. These are the smallest a-helical peptides in water.

A pragmatic 2 × 2 × 2 factorial cluster randomized controlled trial of educational outreach visiting and case conferencing in palliative care—methodology of the Palliative Care Trial [ISRCTN 81117481]

The demand for palliative care is increasing, yet there are few data on the best models of care nor well-validated interventions that translate current evidence into clinical practice. Supporting multidisciplinary patient-centered palliative care while successfully conducting a large clinical trial is a challenge. The Palliative Care Trial (PCT) is a pragmatic 2 x 2 x 2 factorial cluster randomized controlled trial that tests the ability of educational outreach visiting and case conferencing to improve patient-based outcomes such as performance status and pain intensity. Four hundred sixty-one consenting patients and their general practitioners (GPs) were randomized to the following: (1) GP educational outreach visiting versus usual care, (2) Structured patient and caregiver educational outreach visiting versus usual care and (3) A coordinated palliative care model of case conferencing versus the standard model of palliative care in Adelaide, South Australia (3:1 randomization). Main outcome measures included patient functional status over time, pain intensity, and resource utilization. Participants were followed longitudinally until death or November 30, 2004. The interventions are aimed at translating current evidence into clinical practice and there was particular attention in the trial's design to addressing common pitfalls for clinical studies in palliative care. Given the need for evidence about optimal interventions and service delivery models that improve the care of people with life-limiting illness, the results of this rigorous, high quality clinical trial will inform practice. Initial results are expected in mid 2005. (c) 2005 Elsevier Inc. All rights reserved.

Australian political discourse: Pronominal choice in campaign speeches

The intention behind language used by candidates during an election campaign is to persuade voters to vote for a particular political party. Fundamental to the political arena is construction of identity, group membership and ways of talking about self, others, and the polarizing categories of 'us' and 'them'. This paper will investigate the pragmatics of pronominal choice and the way in which politicians construct and convey their own identities and those of their political opponents within political speeches. Taking six speeches by John Howard and Mark Latham across the course of the 2004 federal election campaign, I look at the ways in which pronominal choice indicates a shifting scope of reference to creat pragmatic effects and serve political functions.

Atomic Latin squares of order eleven

A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists of a single cycle for every i j. A Latin square is atomic if all of its conjugates are pan-Hamiltonian. We give a complete enumeration of atomic squares for order 11, the smallest order for which there are examples distinct from the cyclic group. We find that there are seven main classes, including the three that were previously known. A perfect 1-factorization of a graph is a decomposition of that graph into matchings such that the union of any two matchings is a Hamiltonian cycle. Each pan-Hamiltonian Latin square of order n describes a perfect 1-factorization of Kn,n, and vice versa. Perfect 1-factorizations of Kn,n can be constructed from a perfect 1-factorization of Kn+1. Six of the seven main classes of atomic squares of order 11 can be obtained in this way. For each atomic square of order 11, we find the largest set of Mutually Orthogonal Latin Squares (MOLS) involving that square. We discuss algorithms for counting orthogonal mates, and discover the number of orthogonal mates possessed by the cyclic squares of orders up to 11 and by Parker's famous turn-square. We find that the number of atomic orthogonal mates possessed by a Latin square is not a main class invariant. We also define a new sort of Latin square, called a pairing square, which is mapped to its transpose by an involution acting on the symbols. We show that pairing squares are often orthogonal mates for symmetric Latin squares. Finally, we discover connections between our atomic squares and Franklin's diagonally cyclic self-orthogonal squares, and we correct a theorem of Longyear which uses tactical representations to identify self-orthogonal Latin squares in the same main class as a given Latin square.