115 resultados para state bounding
em Cambridge University Engineering Department Publications Database
Resumo:
In speech recognition systems language model (LMs) are often constructed by training and combining multiple n-gram models. They can be either used to represent different genres or tasks found in diverse text sources, or capture stochastic properties of different linguistic symbol sequences, for example, syllables and words. Unsupervised LM adaptation may also be used to further improve robustness to varying styles or tasks. When using these techniques, extensive software changes are often required. In this paper an alternative and more general approach based on weighted finite state transducers (WFSTs) is investigated for LM combination and adaptation. As it is entirely based on well-defined WFST operations, minimum change to decoding tools is needed. A wide range of LM combination configurations can be flexibly supported. An efficient on-the-fly WFST decoding algorithm is also proposed. Significant error rate gains of 7.3% relative were obtained on a state-of-the-art broadcast audio recognition task using a history dependently adapted multi-level LM modelling both syllable and word sequences. ©2010 IEEE.
Resumo:
The performance of a series of near-UV (∼385 nm) emitting LEDs, consisting of high efficiency InGaN/AlInGaN QWs in the active region, was investigated. Significantly reduced roll-over of efficiency at high current density was found compared to InGaN/GaN LEDs emitting at a similar wavelength. The importance of optical cavity effects in flip-chip geometry devices has also been investigated. The light output was enhanced by more than a factor of 2 when the lightemitting region was located at an anti-node position with respect to a high reflectivity current injection mirror. A power of 0.49 mW into a numerical aperture of 0.5 was obtained for a junction area of 50μm in diameter and a current of 30 mA, corresponding to a radiance of 30 W/cm2/str.
Resumo:
The magnetic moment of square planar melt processed YBa2Cu3O7-δ thick films is observed to scale with the cube of the sample width at 4.2 K, suggesting that current flow on the length scale of the film determines its magnetization at this temperature. A well-defined discontinuity in slope in the scaling data at a sample width corresponding to the average grain size (≈2 mm) implies the coexistence of distinct intra- and inter-grain critical current densities of 1.1 × 105Acm-2 and 0.4 × 105Acm-2 at 1 T and 4.2 K. The presence of a critical state in the films at 4.2T is confirmed by removing the central section from a specimen. The observed change in magnetic moment is in excellent agreement with theory for fields greater than ≈2 T. A critical state is not observed at 77 K which suggests that the grains are only weakly coupled at the higher temperature. © 1994.
Resumo:
Many problems in control and signal processing can be formulated as sequential decision problems for general state space models. However, except for some simple models one cannot obtain analytical solutions and has to resort to approximation. In this thesis, we have investigated problems where Sequential Monte Carlo (SMC) methods can be combined with a gradient based search to provide solutions to online optimisation problems. We summarise the main contributions of the thesis as follows. Chapter 4 focuses on solving the sensor scheduling problem when cast as a controlled Hidden Markov Model. We consider the case in which the state, observation and action spaces are continuous. This general case is important as it is the natural framework for many applications. In sensor scheduling, our aim is to minimise the variance of the estimation error of the hidden state with respect to the action sequence. We present a novel SMC method that uses a stochastic gradient algorithm to find optimal actions. This is in contrast to existing works in the literature that only solve approximations to the original problem. In Chapter 5 we presented how an SMC can be used to solve a risk sensitive control problem. We adopt the use of the Feynman-Kac representation of a controlled Markov chain flow and exploit the properties of the logarithmic Lyapunov exponent, which lead to a policy gradient solution for the parameterised problem. The resulting SMC algorithm follows a similar structure with the Recursive Maximum Likelihood(RML) algorithm for online parameter estimation. In Chapters 6, 7 and 8, dynamic Graphical models were combined with with state space models for the purpose of online decentralised inference. We have concentrated more on the distributed parameter estimation problem using two Maximum Likelihood techniques, namely Recursive Maximum Likelihood (RML) and Expectation Maximization (EM). The resulting algorithms can be interpreted as an extension of the Belief Propagation (BP) algorithm to compute likelihood gradients. In order to design an SMC algorithm, in Chapter 8 uses a nonparametric approximations for Belief Propagation. The algorithms were successfully applied to solve the sensor localisation problem for sensor networks of small and medium size.