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.

Sequential Monte Carlo computation of the score and observed information matrix in state-space models with application to parameter estimation

Sequential Monte Carlo (SMC) methods are popular computational tools for Bayesian inference in non-linear non-Gaussian state-space models. For this class of models, we propose SMC algorithms to compute the score vector and observed information matrix recursively in time. We propose two different SMC implementations, one with computational complexity $\mathcal{O}(N)$ and the other with complexity $\mathcal{O}(N^{2})$ where $N$ is the number of importance sampling draws. Although cheaper, the performance of the $\mathcal{O}(N)$ method degrades quickly in time as it inherently relies on the SMC approximation of a sequence of probability distributions whose dimension is increasing linearly with time. In particular, even under strong \textit{mixing} assumptions, the variance of the estimates computed with the $\mathcal{O}(N)$ method increases at least quadratically in time. The $\mathcal{O}(N^{2})$ is a non-standard SMC implementation that does not suffer from this rapid degrade. We then show how both methods can be used to perform batch and recursive parameter estimation.

System combination and score normalization for spoken term detection

Spoken content in languages of emerging importance needs to be searchable to provide access to the underlying information. In this paper, we investigate the problem of extending data fusion methodologies from Information Retrieval for Spoken Term Detection on low-resource languages in the framework of the IARPA Babel program. We describe a number of alternative methods improving keyword search performance. We apply these methods to Cantonese, a language that presents some new issues in terms of reduced resources and shorter query lengths. First, we show score normalization methodology that improves in average by 20% keyword search performance. Second, we show that properly combining the outputs of diverse ASR systems performs 14% better than the best normalized ASR system. © 2013 IEEE.

Efficient decoding with generative score-spaces using the expectation semiring

State-of-the-art speech recognisers are usually based on hidden Markov models (HMMs). They model a hidden symbol sequence with a Markov process, with the observations independent given that sequence. These assumptions yield efficient algorithms, but limit the power of the model. An alternative model that allows a wide range of features, including word- and phone-level features, is a log-linear model. To handle, for example, word-level variable-length features, the original feature vectors must be segmented into words. Thus, decoding must find the optimal combination of segmentation of the utterance into words and word sequence. Features must therefore be extracted for each possible segment of audio. For many types of features, this becomes slow. In this paper, long-span features are derived from the likelihoods of word HMMs. Derivatives of the log-likelihoods, which break the Markov assumption, are appended. Previously, decoding with this model took cubic time in the length of the sequence, and longer for higher-order derivatives. This paper shows how to decode in quadratic time. © 2013 IEEE.