Available evidence does not support routine administration of antipyretics to reduce duration of fever or illness

Commentary on : Carey JV. Literature review : should antipyretic therapies routinely be administered to patients with [corrected] fever? J Clin Nurs 2010;19:2377–93.

Elicitator : a user-friendly, interactive tool to support scenario-based elicitation of expert knowledge

Expert elicitation is the process of determining what expert knowledge is relevant to support a quantitative analysis and then eliciting this information in a form that supports analysis or decision-making. The credibility of the overall analysis, therefore, relies on the credibility of the elicited knowledge. This, in turn, is determined by the rigor of the design and execution of the elicitation methodology, as well as by its clear communication to ensure transparency and repeatability. It is difficult to establish rigor when the elicitation methods are not documented, as often occurs in ecological research. In this chapter, we describe software that can be combined with a well-structured elicitation process to improve the rigor of expert elicitation and documentation of the results

Building support for learning within a Doctor of Education programme

Professional doctorates were introduced in the 1990s for practitioners to research ‘real-world’ problems relevant to their respective workplace communities and contexts. An array of difficulties faces professional doctoral students as they transition from professionals to practitioner researchers. This study sought to understand the learning journey of a cohort of students at an Australian university and to assess whether the cohort approach provided the necessary support for students to reach their scholarly destinations. Throughout the first 18 months of the programme, focus group interviews and surveys were conducted to gauge students’ experiences and to evaluate developments for support within the programme. Utilising a socio-cultural perspective helped identify and explain the importance of shared practice in fostering learning, the development of academic and researcher identities, and the role of communities of practice. Challenges of managing time and overcoming the professional and academe divide were facilitated by the evolving developments of the programme.

The changing face of practice for developing perception : action skill in cricket

The use of bowling machines is common practice in cricket. In an ideal world all batters would face real bowlers in practice sessions, but this is not always possible, for many reasons. The clear advantage of using bowling machines is that they alleviate the workload required from bowlers (Dennis, Finch & Farhart, 2005) and provide relatively consistent and accurate ball delivery which may not be otherwise available to many young batters. Anecdotal evidence suggests that many, if not most of the world’s greatest players use these methods within their training schedules. For example, Australian internationals, Michael Hussey and Matthew Hayden extensively used bowling machines (Hussey & Sygall, 2007). Bowling machines enable batsmen to practice for long periods, developing their endurance and concentration. However, despite these obvious benefits, in recent times the use of bowling machines has been questioned by sport scientists, coaches, ex- players and commentators. For example, Hussey’s batting coach comments “…we never went near a bowling machine in [Michael’s] first couple of years, I think there’s something to that …” (Hussey & Sygall, 2007, p. 119). This chapter will discuss the efficacy of using bowling machines with reference to research findings, before reporting new evidence that provides support for an alternative, innovative and possibly more representative practice design. Finally, the chapter will provide advice for coaches on the implications of this research, including a case study approach to demonstrate the practical use of such a design.

Semantic modeling method for configurable enterprise information systems

Business practices vary from one company to another and business practices often need to be changed due to changes of business environments. To satisfy different business practices, enterprise systems need to be customized. To keep up with ongoing business practice changes, enterprise systems need to be adapted. Because of rigidity and complexity, the customization and adaption of enterprise systems often takes excessive time with potential failures and budget shortfall. Moreover, enterprise systems often drag business behind because they cannot be rapidly adapted to support business practice changes. Extensive literature has addressed this issue by identifying success or failure factors, implementation approaches, and project management strategies. Those efforts were aimed at learning lessons from post implementation experiences to help future projects. This research looks into this issue from a different angle. It attempts to address this issue by delivering a systematic method for developing flexible enterprise systems which can be easily tailored for different business practices or rapidly adapted when business practices change. First, this research examines the role of system models in the context of enterprise system development; and the relationship of system models with software programs in the contexts of computer aided software engineering (CASE), model driven architecture (MDA) and workflow management system (WfMS). Then, by applying the analogical reasoning method, this research initiates a concept of model driven enterprise systems. The novelty of model driven enterprise systems is that it extracts system models from software programs and makes system models able to stay independent of software programs. In the paradigm of model driven enterprise systems, system models act as instructors to guide and control the behavior of software programs. Software programs function by interpreting instructions in system models. This mechanism exposes the opportunity to tailor such a system by changing system models. To make this true, system models should be represented in a language which can be easily understood by human beings and can also be effectively interpreted by computers. In this research, various semantic representations are investigated to support model driven enterprise systems. The significance of this research is 1) the transplantation of the successful structure for flexibility in modern machines and WfMS to enterprise systems; and 2) the advancement of MDA by extending the role of system models from guiding system development to controlling system behaviors. This research contributes to the area relevant to enterprise systems from three perspectives: 1) a new paradigm of enterprise systems, in which enterprise systems consist of two essential elements: system models and software programs. These two elements are loosely coupled and can exist independently; 2) semantic representations, which can effectively represent business entities, entity relationships, business logic and information processing logic in a semantic manner. Semantic representations are the key enabling techniques of model driven enterprise systems; and 3) a brand new role of system models; traditionally the role of system models is to guide developers to write system source code. This research promotes the role of system models to control the behaviors of enterprise.

Structured Telephone Support or Telemonitoring Programs for Patients with Chronic Heart Failure

Background: Specialised disease management programmes for chronic heart failure (CHF) improve survival, quality of life and reduce healthcare utilisation. The overall efficacy of structured telephone support or telemonitoring as an individual component of a CHF disease management strategy remains inconclusive. Objectives: To review randomised controlled trials (RCTs) of structured telephone support or telemonitoring compared to standard practice for patients with CHF in order to quantify the effects of these interventions over and above usual care for these patients. Search strategy: Databases (the Cochrane Central Register of Controlled Trials (CENTRAL), Database of Abstracts of Reviews of Effects (DARE) and Health Technology Assessment Database (HTA) on The Cochrane Library, MEDLINE, EMBASE, CINAHL, AMED and Science Citation Index Expanded and Conference Citation Index on ISI Web of Knowledge) and various search engines were searched from 2006 to November 2008 to update a previously published non-Cochrane review. Bibliographies of relevant studies and systematic reviews and abstract conference proceedings were handsearched. No language limits were applied. Selection criteria: Only peer reviewed, published RCTs comparing structured telephone support or telemonitoring to usual care of CHF patients were included. Unpublished abstract data was included in sensitivity analyses. The intervention or usual care could not include a home visit or more than the usual (four to six weeks) clinic follow-up. Data collection and analysis: Data were presented as risk ratio (RR) with 95% confidence intervals (CI). Primary outcomes included all-cause mortality, all-cause and CHF-related hospitalisations which were meta-analysed using fixed effects models. Other outcomes included length of stay, quality of life, acceptability and cost and these were described and tabulated. Main results: Twenty-five studies and five published abstracts were included. Of the 25 full peer-reviewed studies meta-analysed, 16 evaluated structured telephone support (5613 participants), 11 evaluated telemonitoring (2710 participants), and two tested both interventions (included in counts). Telemonitoring reduced all-cause mortality (RR 0.66, 95% CI 0.54 to 0.81, P < 0.0001) with structured telephone support demonstrating a non-significant positive effect (RR 0.88, 95% CI 0.76 to 1.01, P = 0.08). Both structured telephone support (RR 0.77, 95% CI 0.68 to 0.87, P < 0.0001) and telemonitoring (RR 0.79, 95% CI 0.67 to 0.94, P = 0.008) reduced CHF-related hospitalisations. For both interventions, several studies improved quality of life, reduced healthcare costs and were acceptable to patients. Improvements in prescribing, patient knowledge and self-care, and New York Heart Association (NYHA) functional class were observed. Authors' conclusions: Structured telephone support and telemonitoring are effective in reducing the risk of all-cause mortality and CHF-related hospitalisations in patients with CHF; they improve quality of life, reduce costs, and evidence-based prescribing.

Employer-based support for registered nurses undertaking postgraduate study via distance education

Previous literature has focused on the need for support of undergraduate nursing students during clinical placements. Little is known about the support provided by employers for registered nurses (RNs) who pursue further education. This study sought to identify and describe the types, levels and perceived need for support in the workplace for RNs as they undertake further postgraduate nursing study by distance education (DE).Using an exploratory descriptive design a self-report questionnaire was distributed to a convenient sample of 270 RNs working in one acute care public hospital in Tasmania, Australia.92 questionnaires (response rate 34%) were returned with 26 (28%) reporting being currently enrolled in further study by DE and a further 50 (54)% of RNs planning future study. Results revealed that 100% of participants with a Masters degree completed this by DE. There were differences between the support sought by RNs to that offered by employers, and 16 (34%) who had done or were currently doing DE study, received no support to undertake DE. There was an overwhelming desire by RNs for support; 87 (94%), with a majority believing some support should be mandatory 76 (83%).This study may encourage employers to introduce structured support systems that will actively assist nurses to pursue further study. © 2010.

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.

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.

Decision support to green technology implementation on Australian university campuses

As the societal awareness on sustainability is gaining momentum worldwide, the higher education sector is expected to take the lead in education, research and the promotion of sustainable development. Universities have the diversity of skills and knowledge to explore new concepts and issues, the academic freedom to offer unbiased observations, and the capacity to engage in experimentation for solutions. There is a global trend that universities have realized and responded to sustainability challenge. By adopting green technologies, buildings on university campuses have the potential to offer highly productive and green environments for a quality learning experience for students, while minimising environmental impacts. Despite the potential benefits and metaphorical link to sustainability, few universities have moved towards implementing Green Roof and Living Wall on campuses widely, which have had more successful applications in commercial and residential buildings. Few past research efforts have examined the fundamental barriers to the implementation of sustainable projects on campuses from organizational level. To address this deficiency, an on-going research project is undertaken by Queensland University of Technology in Australia. The research is aimed at developing a comprehensive framework to facilitate better decision making for the promotion of Green Roof and Living Wall application on campuses. It will explore and highlight organizational factors as well as investigate and emphasize project delivery issues. Also, the critical technical indicators for Green Roof and Living Wall implementation will be identified. The expected outcome of this research has the potential to enhance Green Roof and Living Wall delivery in Australian universities, as a vital step towards realizing sustainability in higher education sectors.

Multiview point cloud kernels for semisupervised learning [Lecture Notes]

In semisupervised learning (SSL), a predictive model is learn from a collection of labeled data and a typically much larger collection of unlabeled data. These paper presented a framework called multi-view point cloud regularization (MVPCR), which unifies and generalizes several semisupervised kernel methods that are based on data-dependent regularization in reproducing kernel Hilbert spaces (RKHSs). Special cases of MVPCR include coregularized least squares (CoRLS), manifold regularization (MR), and graph-based SSL. An accompanying theorem shows how to reduce any MVPCR problem to standard supervised learning with a new multi-view kernel.

Classification with a reject option using a hinge loss

We consider the problem of binary classification where the classifier can, for a particular cost, choose not to classify an observation. Just as in the conventional classification problem, minimization of the sample average of the cost is a difficult optimization problem. As an alternative, we propose the optimization of a certain convex loss function φ, analogous to the hinge loss used in support vector machines (SVMs). Its convexity ensures that the sample average of this surrogate loss can be efficiently minimized. We study its statistical properties. We show that minimizing the expected surrogate loss—the φ-risk—also minimizes the risk. We also study the rate at which the φ-risk approaches its minimum value. We show that fast rates are possible when the conditional probability P(Y=1|X) is unlikely to be close to certain critical values.

Sparseness vs estimating conditional probabilities : some asymptotic results

One of the nice properties of kernel classifiers such as SVMs is that they often produce sparse solutions. However, the decision functions of these classifiers cannot always be used to estimate the conditional probability of the class label. We investigate the relationship between these two properties and show that these are intimately related: sparseness does not occur when the conditional probabilities can be unambiguously estimated. We consider a family of convex loss functions and derive sharp asymptotic results for the fraction of data that becomes support vectors. This enables us to characterize the exact trade-off between sparseness and the ability to estimate conditional probabilities for these loss functions.

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.