The role of androgens in fetal growth: observational study in two genetic models of disordered androgen signalling.

OBJECTIVE: To examine the role of androgens on birth weight in genetic models of altered androgen signalling. SETTING: Cambridge Disorders of Sex Development (DSD) database and the Swedish national screening programme for congenital adrenal hyperplasia (CAH). PATIENTS: (1) 29 girls with XY karyotype and mutation positive complete androgen insensitivity syndrome (CAIS); (2) 43 girls and 30 boys with genotype confirmed CAH. MAIN OUTCOME MEASURES: Birth weight, birth weight-for-gestational-age (birth weight standard deviation score (SDS)) calculated by comparison with national references. RESULTS: Mean birth weight SDS in CAIS XY infants was higher than the reference for girls (mean, 95% CI: 0.4, 0.1 to 0.7; p=0.02) and was similar to the national reference for boys (0.1, -0.2 to 0.4). Birth weight SDS in CAH girls was similar to the national reference for girls (0.0, -0.2 to 0.2) and did not vary by severity of gene mutation. Birth weight SDS in CAH boys was also similar to the national reference for boys (0.2, -0.2 to 0.6). CONCLUSION: CAIS XY infants have a birth weight distribution similar to normal male infants and birth weight is not increased in infants with CAH. Alterations in androgen signalling have little impact on birth weight. Sex dimorphism in birth size is unrelated to prenatal androgen exposure.

Probabilistic graphical models for semi-supervised traffic classification

Traffic classification using machine learning continues to be an active research area. The majority of work in this area uses off-the-shelf machine learning tools and treats them as black-box classifiers. This approach turns all the modelling complexity into a feature selection problem. In this paper, we build a problem-specific solution to the traffic classification problem by designing a custom probabilistic graphical model. Graphical models are a modular framework to design classifiers which incorporate domain-specific knowledge. More specifically, our solution introduces semi-supervised learning which means we learn from both labelled and unlabelled traffic flows. We show that our solution performs competitively compared to previous approaches while using less data and simpler features. Copyright © 2010 ACM.

Models and algorithms for detection and tracking of coordinated groups

In this paper, we describe models and algorithms for detection and tracking of group and individual targets. We develop two novel group dynamical models, within a continuous time setting, that aim to mimic behavioural properties of groups. We also describe two possible ways of modeling interactions between closely using Markov Random Field (MRF) and repulsive forces. These can be combined together with a group structure transition model to create realistic evolving group models. We use a Markov Chain Monte Carlo (MCMC)-Particles Algorithm to perform sequential inference. Computer simulations demonstrate the ability of the algorithm to detect and track targets within groups, as well as infer the correct group structure over time. ©2008 IEEE.

Models and algorithms for tracking of maneuvering objects using variable rate particle filters

Standard algorithms in tracking and other state-space models assume identical and synchronous sampling rates for the state and measurement processes. However, real trajectories of objects are typically characterized by prolonged smooth sections, with sharp, but infrequent, changes. Thus, a more parsimonious representation of a target trajectory may be obtained by direct modeling of maneuver times in the state process, independently from the observation times. This is achieved by assuming the state arrival times to follow a random process, typically specified as Markovian, so that state points may be allocated along the trajectory according to the degree of variation observed. The resulting variable dimension state inference problem is solved by developing an efficient variable rate particle filtering algorithm to recursively update the posterior distribution of the state sequence as new data becomes available. The methodology is quite general and can be applied across many models where dynamic model uncertainty occurs on-line. Specific models are proposed for the dynamics of a moving object under internal forcing, expressed in terms of the intrinsic dynamics of the object. The performance of the algorithms with these dynamical models is demonstrated on several challenging maneuvering target tracking problems in clutter. © 2006 IEEE.

Exploiting Chinese character models to improve speech recognition performance

The Chinese language is based on characters which are syllabic in nature. Since languages have syllabotactic rules which govern the construction of syllables and their allowed sequences, Chinese character sequence models can be used as a first level approximation of allowed syllable sequences. N-gram character sequence models were trained on 4.3 billion characters. Characters are used as a first level recognition unit with multiple pronunciations per character. For comparison the CU-HTK Mandarin word based system was used to recognize words which were then converted to character sequences. The character only system error rates for one best recognition were slightly worse than word based character recognition. However combining the two systems using log-linear combination gives better results than either system separately. An equally weighted combination gave consistent CER gains of 0.1-0.2% absolute over the word based standard system. Copyright © 2009 ISCA.

Models for acoustic propagation through turbofan exhaust flows-lined ducts

Turbomachinery noise radiating into the rearward arc is an important problem. This noise is scattered by the trailing edges of the nacelle and the jet exhaust, and interacts with the shear layers between the external flow, bypass stream and jet, en route to the far field. In the past a range of relevant model problems involving semi-infinite cylinders have been solved. However, one limitation of these previous solutions is that they do not allow for the jet nozzle protruding a finite distance beyond the end of the nacelle (or in certain configurations being buried a finite distance upstream). With this in mind, we have used the matrix Wiener-Hopf technique to allow precisely this finite nacelle-jet nozzle separation to be included. We have previously reported results for the case of hard-walled ducts, which requires factorisation of a 2 × 2 matrix. In this paper we extend this work by allowing one of the duct walls, in this case the outer wall of the jet pipe, to be acoustically lined. This results in the need to factorise a 3 × 3 matrix, which is completed by use of a combination of pole-removal and Pad́e approximant techniques. Sample results are presented, investigating in particular the effects of exit plane stagger and liner impedance. Here we take the mean flow to be zero, but extension to nonzero Mach numbers in the core and bypass flow has also been completed. Copyright © 2009 by Nigel Peake & Ben Veitch.

Dasher - A data entry interface using continuous gestures and language models

Existing devices for communicating information to computers are bulky, slow to use, or unreliable. Dasher is a new interface incorporating language modelling and driven by continuous two-dimensional gestures, e.g. a mouse, touchscreen, or eye-tracker. Tests have shown that this device can be used to enter text at a rate of up to 34 words per minute, compared with typical ten-finger keyboard typing of 40-60 words per minute. Although the interface is slower than a conventional keyboard, it is small and simple, and could be used on personal data assistants and by motion-impaired computer users.

Parameter Estimation for Hidden Markov Models with Intractable Likelihoods

Approximate Bayesian computation (ABC) is a popular technique for analysing data for complex models where the likelihood function is intractable. It involves using simulation from the model to approximate the likelihood, with this approximate likelihood then being used to construct an approximate posterior. In this paper, we consider methods that estimate the parameters by maximizing the approximate likelihood used in ABC. We give a theoretical analysis of the asymptotic properties of the resulting estimator. In particular, we derive results analogous to those of consistency and asymptotic normality for standard maximum likelihood estimation. We also discuss how sequential Monte Carlo methods provide a natural method for implementing our likelihood-based ABC procedures.