Multiple analysis of three common genetic alterations associated with thrombophilia

We have previously reported the use of a novel mini-sequencing protocol for detection of the factor V Leiden variant, the first nucleotide change (FNC) technology. This technology is based on a single nucleotide extension of a primer, which is hybridized immediately adjacent to the site of mutation. The extended nucleotide that carries a reporter molecule (fluorescein) has the power to discriminate the genotype at the site of mutation. More recently, the prothrombin 20210 and thermolabile methylene tetrahydrofolate reductase (MTHFR) 677 variants have been identified as possible risk factors associated with thrombophilia. This study describes the use of the FNC technology in a combined assay to detect factor V, prothrombin and MTHFR variants in a population of Australian blood donors, and describes the objective numerical methodology used to determine genotype cut-off values for each genetic variation. Using FNC to test 500 normal blood donors, the incidence of Factor V Leiden was 3.6% (all heterozygous), that of prothrombin 20210 was 2.8% (all heterozygous) and that of MTHFR was 10% (homozygous). The combined FNC technology offers a simple, rapid, automatable DNA-based test for the detection of these three important mutations that are associated with familial thrombophilia. (C) 2000 Lippincott Williams and Wilkins.

Live my work : rural nurses and their multiple perspectives of self

Aim. This paper is a report of a study to explore rural nurses' experiences of mentoring. Background. Mentoring has recently been proposed by governments, advocates and academics as a solution to the problem for retaining rural nurses in the Australian workforce. Action in the form of mentor development workshops has changed the way that some rural nurses now construct supportive relationships as mentoring. Method. A grounded theory design was used with nine rural nurses. Eleven semi-structured interviews were conducted in various states of Australia during 2004-2005. Situational analysis mapping techniques and frame analysis were used in combination with concurrent data generation and analysis and theoretical sampling. Findings. Experienced rural nurses cultivate novices through supportive mentoring relationships. The impetus for such relationships comes from their own histories of living and working in the same community, and this was termed 'live my work'. Rural nurses use multiple perspectives of self in order to manage their interactions with others in their roles as community members, consumers of healthcare services and nurses. Personal strategies adapted to local context constitute the skills that experienced rural nurses pass-on to neophyte rural nurses through mentoring, while at the same time protecting them through troubleshooting and translating local cultural norms. Conclusion. Living and working in the same community creates a set of complex challenges for novice rural nurses that are better faced with a mentor in place. Thus, mentoring has become an integral part of experienced rural nurses' practice to promote staff retention. © 2007 The Authors.

Are the ‘cave’ minerals archerite (K,NH4)H2PO4 and biphosphammite (K,NH4)H2PO4 identical? A molecular structural study

The molecular structure of the mineral archerite ((K,NH4)H2PO4) has been determined and compared with that of biphosphammite ((NH4,K)H2PO4). Raman spectroscopy and infrared spectroscopy has been used to characterise these ‘cave’ minerals. Both minerals originated from the Murra-el-elevyn Cave, Eucla, Western Australia. The mineral is formed by the reaction of the chemicals in bat guano with calcite substrates. Raman and infrared bands are assigned to H2PO4-, OH and NH stretching vibrations. The Raman band at 981 cm-1 is assigned to the HOP stretching vibration. Bands in the 1200 to 1800 cm-1 region are associated with NH4+ bending modes. The molecular structure of the two minerals appear to be very similar, and it is therefore concluded that the two minerals are identical.

The role of cross-functional teams on the alignment between technology innovation effectiveness and operational effectiveness

Organisations are increasingly investing in complex technological innovations, such as enterprise information systems, with the aim of improving the operation of the business, and in this way gaining competitive advantage. However, the implementation of technological innovations tends to have an excessive focus on either technology innovation effectiveness, or the resulting operational effectiveness. Focusing on either one of them is detrimental to long-term performance. Cross-functional teams have been used by many organisations as a way of involving expertise from different functional areas in the implementation of technologies. The role of boundary spanning actors is discussed as they bring a common language to the cross-functional teams. Multiple regression analysis has been used to identify the structural relationships and provide an explanation for the influence of cross-functional teams, technology innovation effectiveness and operational effectiveness in the continuous improvement of operational performance. The findings indicate that cross functional teams have an indirect influence on continuous improvement of operational performance through the alignment between technology innovation effectiveness and operational effectiveness.

Rademacher and Gaussian complexities: Risk bounds and structural results

We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we prove general risk bounds in terms of these complexities. We consider function classes that can be expressed as combinations of functions from basis classes and show how the Rademacher and Gaussian complexities of such a function class can be bounded in terms of the complexity of the basis classes. We give examples of the application of these techniques in finding data-dependent risk bounds for decision trees, neural networks and support vector machines.

A unifying view of multiple kernel learning

Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different formulations of objectives and varying regularization strategies. In this paper we present a unifying optimization criterion for multiple kernel learning and show how existing formulations are subsumed as special cases. We also derive the criterion’s dual representation, which is suitable for general smooth optimization algorithms. Finally, we evaluate multiple kernel learning in this framework analytically using a Rademacher complexity bound on the generalization error and empirically in a set of experiments.

A unifying view of multiple kernel learning

Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different formulations of objectives and varying regularization strategies. In this paper we present a unifying general optimization criterion for multiple kernel learning and show how existing formulations are subsumed as special cases. We also derive the criterion's dual representation, which is suitable for general smooth optimization algorithms. Finally, we evaluate multiple kernel learning in this framework analytically using a Rademacher complexity bound on the generalization error and empirically in a set of experiments.

Matrix regularization techniques for online multitask learning

In this paper we examine the problem of prediction with expert advice in a setup where the learner is presented with a sequence of examples coming from different tasks. In order for the learner to be able to benefit from performing multiple tasks simultaneously, we make assumptions of task relatedness by constraining the comparator to use a lesser number of best experts than the number of tasks. We show how this corresponds naturally to learning under spectral or structural matrix constraints, and propose regularization techniques to enforce the constraints. The regularization techniques proposed here are interesting in their own right and multitask learning is just one application for the ideas. A theoretical analysis of one such regularizer is performed, and a regret bound that shows benefits of this setup is reported.