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.

Learning the kernel matrix with semidefinite programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive semidefinite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space - classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semidefinite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -using the labeled part of the data one can learn an embedding also for the unlabeled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method for learning the 2-norm soft margin parameter in support vector machines, solving an important open problem.

Hybrid-Game Strategies for multi-objective design optimization in engineering

A number of Game Strategies (GS) have been developed in past decades. They have been used in the fields of economics, engineering, computer science and biology due to their efficiency in solving design optimization problems. In addition, research in multi-objective (MO) and multidisciplinary design optimization (MDO) has focused on developing robust and efficient optimization methods to produce a set of high quality solutions with low computational cost. In this paper, two optimization techniques are considered; the first optimization method uses multi-fidelity hierarchical Pareto optimality. The second optimization method uses the combination of two Game Strategies; Nash-equilibrium and Pareto optimality. The paper shows how Game Strategies can be hybridised and coupled to Multi-Objective Evolutionary Algorithms (MOEA) to accelerate convergence speed and to produce a set of high quality solutions. Numerical results obtained from both optimization methods are compared in terms of computational expense and model quality. The benefits of using Hybrid-Game Strategies are clearly demonstrated

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.

Learning the Kernel Matrix with Semi-Definite Programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive definite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space -- classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semi-definite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -- using the labelled part of the data one can learn an embedding also for the unlabelled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method to learn the 2-norm soft margin parameter in support vector machines, solving another important open problem. Finally, the novel approach presented in the paper is supported by positive empirical results.

Association of inducible nitric oxide synthase with asthma severity, total serum immunoglobulin E and blood eosinophil levels

Background Nitric oxide is released by immune, epithelial and endothelial cells, and plays an important part in the pathophysiology of asthma. Objective To investigate the association of inducible nitric oxide synthases (iNOS) gene repeat polymorphisms with asthma. Methods 230 families with asthma (842 individuals) were recruited to identify and establish the genetic association of iNOS repeats with asthma and associated phenotypes. Serum nitric oxide levels in selected individuals were measured and correlated with specific genotypes. Multiple logistic regression analysis was performed to determine the effect of age and sex. Results A total of four repeats—a (CCTTT)n promoter repeat, a novel intron 2 (GT)n repeat (BV680047), an intron 4 (GT)n repeat (AFM311ZB1) and an intron 5 (CA)n repeat (D17S1878)—were identified and genotyped. A significant transmission distortion to the probands with asthma was seen for allele 3 of the AFM311ZB1 gene (p = 0.006). This allele was also found to be significantly associated with percentage blood eosinophils (p<0.001) and asthma severity (p = 0.04). Moreover, it was functionally correlated with high serum nitric oxide levels (p = 0.006). Similarly, the promoter repeat was found to be associated with serum total immunoglobulin (Ig)E (p = 0.028). Individuals carrying allele 4 of this repeat have high serum IgE (p<0.001) and nitric oxide levels (p = 0.03). Conclusion This is the first study to identify the repeat polymorphisms in the iNOS gene that are associated with severity of asthma and eosinophils. The functional relevance of the associated alleles with serum nitric oxide levels was also shown. Therefore, these results could be valuable in elucidating the role of nitric oxide in asthma pathogenesis.

Multi-objective optimisation of bijective s-boxes

In this paper we investigate the heuristic construction of bijective s-boxes that satisfy a wide range of cryptographic criteria including algebraic complexity, high nonlinearity, low autocorrelation and have none of the known weaknesses including linear structures, fixed points or linear redundancy. We demonstrate that the power mappings can be evolved (by iterated mutation operators alone) to generate bijective s-boxes with the best known tradeoffs among the considered criteria. The s-boxes found are suitable for use directly in modern encryption algorithms.

Nursing Sans Frontieres: A Three Year Case Study of Multi-State Registration of Support Nursing Practice Using Information Technology

Objective: To highlight the registration issues for nurses who wish to practice nationally, particularly those practicing within the telehealth sector. Design: As part of a national clinical research study, applications were made to every state and territory for mutual recognition of nursing registration and fee waiver for telenursing cross boarder practice for a period of three years. These processes are described using a case study approach. Outcome: The aim of this case study was to achieve registration in every state and territory of Australia without paying multiple fees by using mutual recognition provisions and the cross-border fee waiver policy of the nurse regulatory authorities in order to practice telenursing. Results: Mutual recognition and fee waiver for cross-border practice was granted unconditionally in two states: Victoria (Vic) and Tasmania (Tas), and one territory: the Northern Territory (NT). The remainder of the Australian states and territories would only grant temporary registration for the period of the project or not at all, due to policy restrictions or nurse regulatory authority (NRA) Board decisions. As a consequence of gaining fee waiver the annual cost of registration was a maximum of $145 per annum as opposed to the potential $959 for initial registration and $625 for annual renewal. Conclusions: Having eight individual nurses Acts and NRAs for a population of 265,000 nurses would clearly indicate a case for over regulation in this country. The structure of regulation of nursing in Australia is a barrier to the changing and evolving role of nurses in the 21st century and a significant factor when considering workforce planning.