Nonverbal Learning Disability explained : the link to shunted hydrocephalus

A Nonverbal Learning Disability is believed to be caused by damage, disorder or destruction of neuronal white matter in the brain’s right hemisphere and may be seen in persons experiencing a wide range of neurological diseases such as hydrocephalus and other types of brain injury (Harnadek & Rourke 1994). This article probes the relationship between shunted hydrocephalus and Nonverbal Learning Disability. Description of hydrocephalus and intelligence associated with hydrocephalus concludes with explication of the ‘final common pathway’ that links residual damage caused by the hydrocephalic condition to a Nonverbal Learning Disability (Rourke & Del Dotto 1994, p. 37). The paper seeks to assist teachers, teacher aides, psychologists, guidance officers, support workers, parents and disability service providers whose role is to understand and advocate for individuals with shunted hydrocephalus and spina bifida.

Multivariate Markov Process Models for the transmission of methicillin-resistant Staphylococcus Aureus in a hospital ward

Methicillin-resistant Staphylococcus Aureus (MRSA) is a pathogen that continues to be of major concern in hospitals. We develop models and computational schemes based on observed weekly incidence data to estimate MRSA transmission parameters. We extend the deterministic model of McBryde, Pettitt, and McElwain (2007, Journal of Theoretical Biology 245, 470–481) involving an underlying population of MRSA colonized patients and health-care workers that describes, among other processes, transmission between uncolonized patients and colonized health-care workers and vice versa. We develop new bivariate and trivariate Markov models to include incidence so that estimated transmission rates can be based directly on new colonizations rather than indirectly on prevalence. Imperfect sensitivity of pathogen detection is modeled using a hidden Markov process. The advantages of our approach include (i) a discrete valued assumption for the number of colonized health-care workers, (ii) two transmission parameters can be incorporated into the likelihood, (iii) the likelihood depends on the number of new cases to improve precision of inference, (iv) individual patient records are not required, and (v) the possibility of imperfect detection of colonization is incorporated. We compare our approach with that used by McBryde et al. (2007) based on an approximation that eliminates the health-care workers from the model, uses Markov chain Monte Carlo and individual patient data. We apply these models to MRSA colonization data collected in a small intensive care unit at the Princess Alexandra Hospital, Brisbane, Australia.

The organisational gender diversity-performance link : does industry type matter?

Research on workforce diversity gained momentum in the 1990s. However, empirical findings to date on the link between gender diversity and performance have been inconsistent. Based on contrasting theories, this paper proposes a positive linear and a negative linear prediction of the gender diversity-performance relationship. The paper also proposes that industry type (services vs. manufacturing) moderates the gender diversity-performance relationship such that the relationship will be positive in service organisations and negative in manufacturing organisations. The results show partial support for the positive linear gender diversity-performance relationship and for the moderating effect of industry type. The study contributes to the field of diversity by showing that workforce gender diversity can have a different impact on organisational performance in different industries.

Independent review of ACT Corrective Services Alexander Maconochie Centre [Interim Report]

Under a Services Agreement dated 16th April 2010 the Australian Capital Territory (ACT) engaged Knowledge Consulting Pty Ltd to conduct an independent review of operations at the Alexander Maconochie Centre (AMC) in the ACT. The Review was commissioned following a motion passed in the ACT Legislative Assembly as follows: “That this Assembly: (1) notes: (a) concerns regarding the operation of the AMC; (b) the unanimous findings of the Standing Committee on Justice and Community Safety report, Inquiry into the delay in the commencement of operations at the Alexander Maconochie Centre; and (c) the Government’s intention to have a review into the operation of the AMC after its first year of operation; and (2) calls on the Government to: (a) commission an independent reviewer to conduct the one year review into the AMC; (b) ensure that the review be open and transparent and public, and include input from community and non-government groups with an interest or involvement in the AMC, including on the terms of reference for the review; (c) ensure the review is completed in a timely manner and be tabled in the Legislative Assembly immediately upon completion; and (d) report upon the progress of the review in August 2010;”

A new unequal DC link voltage configuration for a single phase multilevel converter to reduce low order harmonics

Multilevel converters are used in high power and high voltage applications due to their attractive benefits in generating high quality output voltage. Increasing the number of voltage levels can lead to a reduction in lower order harmonics. Various modulation and control techniques are introduced for multilevel converters like Space Vector Modulation (SVM), Sinusoidal Pulse Width Modulation (SPWM) and Harmonic Elimination (HE) methods. Multilevel converters may have a DC link with equal or unequal DC voltages. In this paper a new modulation technique based on harmonic elimination method is proposed for those multilevel converters that have unequal DC link voltages. This new technique has better effect on output voltage quality and less Total Harmonic Distortion (THD) than other modulation techniques. In order to verify the proposed modulation technique, MATLAB simulations are carried out for a single-phase diode-clamped inverter.

Maintenance strategy optimization using a continuous-state partially observable semi-Markov decision process

Due to the limitation of current condition monitoring technologies, the estimates of asset health states may contain some uncertainties. A maintenance strategy ignoring this uncertainty of asset health state can cause additional costs or downtime. The partially observable Markov decision process (POMDP) is a commonly used approach to derive optimal maintenance strategies when asset health inspections are imperfect. However, existing applications of the POMDP to maintenance decision-making largely adopt the discrete time and state assumptions. The discrete-time assumption requires the health state transitions and maintenance activities only happen at discrete epochs, which cannot model the failure time accurately and is not cost-effective. The discrete health state assumption, on the other hand, may not be elaborate enough to improve the effectiveness of maintenance. To address these limitations, this paper proposes a continuous state partially observable semi-Markov decision process (POSMDP). An algorithm that combines the Monte Carlo-based density projection method and the policy iteration is developed to solve the POSMDP. Different types of maintenance activities (i.e., inspections, replacement, and imperfect maintenance) are considered in this paper. The next maintenance action and the corresponding waiting durations are optimized jointly to minimize the long-run expected cost per unit time and availability. The result of simulation studies shows that the proposed maintenance optimization approach is more cost-effective than maintenance strategies derived by another two approximate methods, when regular inspection intervals are adopted. The simulation study also shows that the maintenance cost can be further reduced by developing maintenance strategies with state-dependent maintenance intervals using the POSMDP. In addition, during the simulation studies the proposed POSMDP shows the ability to adopt a cost-effective strategy structure when multiple types of maintenance activities are involved.

The link between belongingness and depressive symptoms: An exploration in the workplace interpersonal context

Interpersonal factors are crucial to a deepened understanding of depression. Belongingness, also referred to as connectedness, has been established as a strong risk/protective factor for depressive symptoms. To elucidate this link it may be beneficial to investigate the relative importance of specific psychosocial contexts as belongingness foci. Here we investigate the construct of workplace belongingness. Employees at a disability services organisation (N = 125) completed measures of depressive symptoms, anxiety symptoms, workplace belongingness and organisational commitment. Psychometric analyses, including Horn's parallel analyses, indicate that workplace belongingness is a unitary, robust and measurable construct. Correlational data indicate a substantial relationship with depressive symptoms (r = −.54) and anxiety symptoms (r = −.39). The difference between these correlations was statistically significant, supporting the particular importance of belongingness cognitions to the etiology of depression. Multiple regression analyses support the hypothesis that workplace belongingness mediates the relationship between affective organisational commitment and depressive symptoms. It is likely that workplaces have the potential to foster environments that are intrinsically less depressogenic by facilitating workplace belongingness. From a clinical perspective, cognitions regarding the workplace psychosocial context appear to be highly salient to individual psychological health, and hence warrant substantial attention.

A Python package for Bayesian estimation using Markov Chain Monte Carlo

Markov chain Monte Carlo (MCMC) estimation provides a solution to the complex integration problems that are faced in the Bayesian analysis of statistical problems. The implementation of MCMC algorithms is, however, code intensive and time consuming. We have developed a Python package, which is called PyMCMC, that aids in the construction of MCMC samplers and helps to substantially reduce the likelihood of coding error, as well as aid in the minimisation of repetitive code. PyMCMC contains classes for Gibbs, Metropolis Hastings, independent Metropolis Hastings, random walk Metropolis Hastings, orientational bias Monte Carlo and slice samplers as well as specific modules for common models such as a module for Bayesian regression analysis. PyMCMC is straightforward to optimise, taking advantage of the Python libraries Numpy and Scipy, as well as being readily extensible with C or Fortran.

The link between age, career goals, and adaptive development for work-related learning among local government employees

More recently, lifespan development psychology models of adaptive development have been applied to the workforce to investigate ageing worker and lifespan issues. The current study uses the Learning and Development Survey (LDS) to investigate employee selection and engagement of learning and development goals and opportunities and constraints for learning at work in relation to demographics and career goals. It was found that mature age was associated with perceptions of preferential treatment of younger workers with respect to learning and development. Age was also correlated with several career goals. Findings suggest that younger workers’ learning and development options are better catered for in the workplace. Mature aged workers may compensate for unequal learning opportunities at work by studying for an educational qualification or seeking alternate job opportunities. The desire for a higher level job within the organization or educational qualification was linked to engagement in learning and development goals at work. It is suggested that an understanding of employee perceptions in the workplace in relation to goals and activities may be important in designing strategies to retain workers.

Bounded parameter Markov Decision Processes with average reward criterion

Bounded parameter Markov Decision Processes (BMDPs) address the issue of dealing with uncertainty in the parameters of a Markov Decision Process (MDP). Unlike the case of an MDP, the notion of an optimal policy for a BMDP is not entirely straightforward. We consider two notions of optimality based on optimistic and pessimistic criteria. These have been analyzed for discounted BMDPs. Here we provide results for average reward BMDPs. We establish a fundamental relationship between the discounted and the average reward problems, prove the existence of Blackwell optimal policies and, for both notions of optimality, derive algorithms that converge to the optimal value function.

Multitask learning with expert advice

We consider the problem of prediction with expert advice in the setting where a forecaster is presented with several online prediction tasks. Instead of competing against the best expert separately on each task, we assume the tasks are related, and thus we expect that a few experts will perform well on the entire set of tasks. That is, our forecaster would like, on each task, to compete against the best expert chosen from a small set of experts. While we describe the “ideal” algorithm and its performance bound, we show that the computation required for this algorithm is as hard as computation of a matrix permanent. We present an efficient algorithm based on mixing priors, and prove a bound that is nearly as good for the sequential task presentation case. We also consider a harder case where the task may change arbitrarily from round to round, and we develop an efficient approximate randomized algorithm based on Markov chain Monte Carlo techniques.

Exponentiated gradient algorithms for conditional random fields and max-margin Markov Networks

Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of parameters in these models is therefore an important problem, and becomes a key factor when learning from very large data sets. This paper describes exponentiated gradient (EG) algorithms for training such models, where EG updates are applied to the convex dual of either the log-linear or max-margin objective function; the dual in both the log-linear and max-margin cases corresponds to minimizing a convex function with simplex constraints. We study both batch and online variants of the algorithm, and provide rates of convergence for both cases. In the max-margin case, O(1/ε) EG updates are required to reach a given accuracy ε in the dual; in contrast, for log-linear models only O(log(1/ε)) updates are required. For both the max-margin and log-linear cases, our bounds suggest that the online EG algorithm requires a factor of n less computation to reach a desired accuracy than the batch EG algorithm, where n is the number of training examples. Our experiments confirm that the online algorithms are much faster than the batch algorithms in practice. We describe how the EG updates factor in a convenient way for structured prediction problems, allowing the algorithms to be efficiently applied to problems such as sequence learning or natural language parsing. We perform extensive evaluation of the algorithms, comparing them to L-BFGS and stochastic gradient descent for log-linear models, and to SVM-Struct for max-margin models. The algorithms are applied to a multi-class problem as well as to a more complex large-scale parsing task. In all these settings, the EG algorithms presented here outperform the other methods.