Raman spectroscopy of newberyite Mg(PO3OH)•3H2O – a cave mineral

Newberyite Mg(PO3OH)•3H2O is a mineral found in caves such as from Moorba cave, Jurien Bay, Western Australia, the Skipton Lava tubes (SW of Ballarat, Victoria, Australia) and in the Petrogale Cave (Madura , Eucla, Western Australia). Because these minerals contain oxyanions, hydroxyl units and water, the minerals lend themselves to spectroscopic analysis. Raman spectroscopy can investigate the complex paragenetic relationships existing between a number of ‘cave’ minerals. The intense sharp band at 982 cm-1 is assigned to the PO43- ν1 symmetric stretching mode. Low intensity Raman bands at 1152, 1263 and 1277 cm-1 are assigned to the PO43- ν3 antisymmetric stretching vibrations. Raman bands at 497 and 552 cm-1 are attributed to the PO43- ν4 bending modes. An intense Raman band for newberyite at 398 cm-1 with a shoulder band at 413 cm-1 is assigned to the PO43- ν2 bending modes. The values for the OH stretching vibrations provide hydrogen bond distances of 2.728Å (3267 cm-1), 2.781Å (3374cm-1), 2.868Å (3479 cm-1), and 2.918Å (3515 cm-1). Such hydrogen bond distances are typical of secondary minerals. Estimates of the hydrogen-bond distances have been made from the position of the OH stretching vibrations and show a wide range in both strong and weak bonds.

Fault diagnosis of induction motor based on decision trees and adaptive neuro-fuzzy inference

This paper presents a fault diagnosis method based on adaptive neuro-fuzzy inference system (ANFIS) in combination with decision trees. Classification and regression tree (CART) which is one of the decision tree methods is used as a feature selection procedure to select pertinent features from data set. The crisp rules obtained from the decision tree are then converted to fuzzy if-then rules that are employed to identify the structure of ANFIS classifier. The hybrid of back-propagation and least squares algorithm are utilized to tune the parameters of the membership functions. In order to evaluate the proposed algorithm, the data sets obtained from vibration signals and current signals of the induction motors are used. The results indicate that the CART–ANFIS model has potential for fault diagnosis of induction motors.

Seeing the Wood for the Trees: A Critical Evaluation of Methods to Estimate the Parameters of Stochastic Differential Equations

Maximum-likelihood estimates of the parameters of stochastic differential equations are consistent and asymptotically efficient, but unfortunately difficult to obtain if a closed-form expression for the transitional probability density function of the process is not available. As a result, a large number of competing estimation procedures have been proposed. This article provides a critical evaluation of the various estimation techniques. Special attention is given to the ease of implementation and comparative performance of the procedures when estimating the parameters of the Cox–Ingersoll–Ross and Ornstein–Uhlenbeck equations respectively.

Networks as a novel tool for studying team ball sports as complex social systems

This paper describes and evaluates the novel utility of network methods for understanding human interpersonal interactions within social neurobiological systems such as sports teams. We show how collective system networks are supported by the sum of interpersonal interactions that emerge from the activity of system agents (such as players in a sports team). To test this idea we trialled the methodology in analyses of intra-team collective behaviours in the team sport of water polo. We observed that the number of interactions between team members resulted in varied intra-team coordination patterns of play, differentiating between successful and unsuccessful performance outcomes. Future research on small-world networks methodologies needs to formalize measures of node connections in analyses of collective behaviours in sports teams, to verify whether a high frequency of interactions is needed between players in order to achieve competitive performance outcomes.

The contribution of maize cropping in the Midwest USA to global warming: A regional estimate

Agricultural soils emit about 50% of the global flux of N2O attributable to human influence, mostly in response to nitrogen fertilizer use. Recent evidence that the relationship between N2O fluxes and N-fertilizer additions to cereal maize are non-linear provides an opportunity to estimate regional N2O fluxes based on estimates of N application rates rather than as a simple percentage of N inputs as used by the Intergovernmental Panel on Climate Change (IPCC). We combined a simple empirical model of N2O production with the SOCRATES soil carbon dynamics model to estimate N2O and other sources of Global Warming Potential (GWP) from cereal maize across 19,000 cropland polygons in the North Central Region (NCR) of the US over the period 1964–2005. Results indicate that the loading of greenhouse gases to the atmosphere from cereal maize production in the NCR was 1.7 Gt CO2e, with an average 268 t CO2e produced per tonne of grain. From 1970 until 2005, GHG emissions per unit product declined on average by 2.8 t CO2e ha−1 annum−1, coinciding with a stabilisation in N application rate and consistent increases in grain yield from the mid-1970’s. Nitrous oxide production from N fertilizer inputs represented 59% of these emissions, soil C decline (0–30 cm) represented 11% of total emissions, with the remaining 30% (517 Mt) from the combustion of fuel associated with farm operations. Of the 126 Mt of N fertilizer applied to cereal maize from 1964 to 2005, we estimate that 2.2 Mt N was emitted as N2O when using a non-linear response model, equivalent to 1.75% of the applied N.

Controlling chaos? The value and the challenges of applying complexity theory to project management

The literature abounds with descriptions of failures in high-profile projects and a range of initiatives has been generated to enhance project management practice (e.g., Morris, 2006). Estimating from our own research, there are scores of other project failures that are unrecorded. Many of these failures can be explained using existing project management theory; poor risk management, inaccurate estimating, cultures of optimism dominating decision making, stakeholder mismanagement, inadequate timeframes, and so on. Nevertheless, in spite of extensive discussion and analysis of failures and attention to the presumed causes of failure, projects continue to fail in unexpected ways. In the 1990s, three U.S. state departments of motor vehicles (DMV) cancelled major projects due to time and cost overruns and inability to meet project goals (IT-Cortex, 2010). The California DMV failed to revitalize their drivers’ license and registration application process after spending $45 million. The Oregon DMV cancelled their five year, $50 million project to automate their manual, paper-based operation after three years when the estimates grew to $123 million; its duration stretched to eight years or more and the prototype was a complete failure. In 1997, the Washington state DMV cancelled their license application mitigation project because it would have been too big and obsolete by the time it was estimated to be finished. There are countless similar examples of projects that have been abandoned or that have not delivered the requirements.

The constraints-based approach to motor learning : Implications for a non-linear pedagogy in sport and physical education

Recently, a constraints- led approach has been promoted as a framework for understanding how children and adults acquire movement skills for sport and exercise (see Davids, Button & Bennett, 2008; Araújo et al., 2004). The aim of a constraints- led approach is to identify the nature of interacting constraints that influence skill acquisition in learners. In this chapter the main theoretical ideas behind a constraints- led approach are outlined to assist practical applications by sports practitioners and physical educators in a non- linear pedagogy (see Chow et al., 2006, 2007). To achieve this goal, this chapter examines implications for some of the typical challenges facing sport pedagogists and physical educators in the design of learning programmes.

The acquisition and exercise of nephrology nursing expertise : A grounded theory study

Aims and objectives. This purpose of this study was to describe the process of expertise acquisition in nephrology nursing practice. Background. It has been recognized for a number of decades that experts, compared with other practitioners in a number of professions and occupations, are the most knowledgeable and effective, in terms of both the quantity and quality of output. Studies relating to expertise have been undertaken in a range of nursing contexts and specialties; to date, however, none have been undertaken which focus on nephrology nursing. Design. This study, using grounded theory methodology, took place in one renal unit in New South Wales, Australia and involved six non-expert and 11 expert nurses. Methods. Simultaneous data collection and analysis took place using participant observation, semi-structured interviews and review of nursing documentation. Findings. The study revealed a three-stage skills-acquisitive process that was identified as non-expert, experienced non-expert and expert stages. Each stage was typified by four characteristics, which altered during the acquisitive process; these were knowledge, experience, skill and focus. Conclusion. This was the first study to explore nephrology nursing expertise and uncovered new aspects of expertise not documented in the literature and it also made explicit other areas, which had only been previously implied. Relevance to clinical practice. Of significance to nursing, the exercise of expertise is a function of the recognition of expertise by others and it includes the blurring of the normal boundaries of professional practice. © 2006 Blackwell Publishing Ltd.

The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

Sample complexity results from computational learning theory, when applied to neural network learning for pattern classification problems, suggest that for good generalization performance the number of training examples should grow at least linearly with the number of adjustable parameters in the network. Results in this paper show that if a large neural network is used for a pattern classification problem and the learning algorithm finds a network with small weights that has small squared error on the training patterns, then the generalization performance depends on the size of the weights rather than the number of weights. For example, consider a two-layer feedforward network of sigmoid units, in which the sum of the magnitudes of the weights associated with each unit is bounded by A and the input dimension is n. We show that the misclassification probability is no more than a certain error estimate (that is related to squared error on the training set) plus A3 √((log n)/m) (ignoring log A and log m factors), where m is the number of training patterns. This may explain the generalization performance of neural networks, particularly when the number of training examples is considerably smaller than the number of weights. It also supports heuristics (such as weight decay and early stopping) that attempt to keep the weights small during training. The proof techniques appear to be useful for the analysis of other pattern classifiers: when the input domain is a totally bounded metric space, we use the same approach to give upper bounds on misclassification probability for classifiers with decision boundaries that are far from the training examples.

Infinite-horizon policy-gradient estimation

Gradient-based approaches to direct policy search in reinforcement learning have received much recent attention as a means to solve problems of partial observability and to avoid some of the problems associated with policy degradation in value-function methods. In this paper we introduce GPOMDP, a simulation-based algorithm for generating a biased estimate of the gradient of the average reward in Partially Observable Markov Decision Processes (POMDPs) controlled by parameterized stochastic policies. A similar algorithm was proposed by Kimura, Yamamura, and Kobayashi (1995). The algorithm's chief advantages are that it requires storage of only twice the number of policy parameters, uses one free parameter β ∈ [0,1) (which has a natural interpretation in terms of bias-variance trade-off), and requires no knowledge of the underlying state. We prove convergence of GPOMDP, and show how the correct choice of the parameter β is related to the mixing time of the controlled POMDP. We briefly describe extensions of GPOMDP to controlled Markov chains, continuous state, observation and control spaces, multiple-agents, higher-order derivatives, and a version for training stochastic policies with internal states. In a companion paper (Baxter, Bartlett, & Weaver, 2001) we show how the gradient estimates generated by GPOMDP can be used in both a traditional stochastic gradient algorithm and a conjugate-gradient procedure to find local optima of the average reward. ©2001 AI Access Foundation and Morgan Kaufmann Publishers. All rights reserved.