BOLTZMANN MACHINES FOR SPEECH RECOGNITION.

Boltzmann machines offer a new and exciting approach to automatic speech recognition, and provide a rigorous mathematical formalism for parallel computing arrays. In this paper we briefly summarize Boltzmann machine theory, and present results showing their ability to recognize both static and time-varying speech patterns. A machine with 2000 units was able to distinguish between the 11 steady-state vowels in English with an accuracy of 85%. The stability of the learning algorithm and methods of preprocessing and coding speech data before feeding it to the machine are also discussed. A new type of unit called a carry input unit, which involves a type of state-feedback, was developed for the processing of time-varying patterns and this was tested on a few short sentences. Use is made of the implications of recent work into associative memory, and the modelling of neural arrays to suggest a good configuration of Boltzmann machines for this sort of pattern recognition.

Validation of a lattice Boltzmann model for gas-solid reactions with experiments

A lattice Boltzmann method is used to model gas-solid reactions where the composition of both the gas and solid phase changes with time, while the boundary between phases remains fixed. The flow of the bulk gas phase is treated using a multiple relaxation time MRT D3Q19 model; the dilute reactant is treated as a passive scalar using a single relaxation time BGK D3Q7 model with distinct inter- and intraparticle diffusivities. A first-order reaction is incorporated by modifying the method of Sullivan et al. [13] to include the conversion of a solid reactant. The detailed computational model is able to capture the multiscale physics encountered in reactor systems. Specifically, the model reproduced steady state analytical solutions for the reaction of a porous catalyst sphere (pore scale) and empirical solutions for mass transfer to the surface of a sphere at Re=10 (particle scale). Excellent quantitative agreement between the model and experiments for the transient reduction of a single, porous sphere of Fe 2O 3 to Fe 3O 4 in CO at 1023K and 10 5Pa is demonstrated. Model solutions for the reduction of a packed bed of Fe 2O 3 (reactor scale) at identical conditions approached those of experiments after 25 s, but required prohibitively long processor times. The presented lattice Boltzmann model resolved successfully mass transport at the pore, particle and reactor scales and highlights the relevance of LB methods for modelling convection, diffusion and reaction physics. © 2012 Elsevier Inc.

On the theorem of Reichert

This paper reworks and amplifies Reichert's proof of his theorem (1969) which asserts that any impedance function of a one-port electrical network which can be realised with two reactive elements and an arbitrary number of resistors can be realised with two reactive elements and three resistors. © 2012 Elsevier B.V. All rights reserved.

Uniform stability of a particle approximation of the optimal filter derivative

Sequential Monte Carlo methods, also known as particle methods, are a widely used set of computational tools for inference in non-linear non-Gaussian state-space models. In many applications it may be necessary to compute the sensitivity, or derivative, of the optimal filter with respect to the static parameters of the state-space model; for instance, in order to obtain maximum likelihood model parameters of interest, or to compute the optimal controller in an optimal control problem. In Poyiadjis et al. [2011] an original particle algorithm to compute the filter derivative was proposed and it was shown using numerical examples that the particle estimate was numerically stable in the sense that it did not deteriorate over time. In this paper we substantiate this claim with a detailed theoretical study. Lp bounds and a central limit theorem for this particle approximation of the filter derivative are presented. It is further shown that under mixing conditions these Lp bounds and the asymptotic variance characterized by the central limit theorem are uniformly bounded with respect to the time index. We demon- strate the performance predicted by theory with several numerical examples. We also use the particle approximation of the filter derivative to perform online maximum likelihood parameter estimation for a stochastic volatility model.

Projective Limit Random Probabilities on Polish Spaces

A pivotal problem in Bayesian nonparametrics is the construction of prior distributions on the space M(V) of probability measures on a given domain V. In principle, such distributions on the infinite-dimensional space M(V) can be constructed from their finite-dimensional marginals---the most prominent example being the construction of the Dirichlet process from finite-dimensional Dirichlet distributions. This approach is both intuitive and applicable to the construction of arbitrary distributions on M(V), but also hamstrung by a number of technical difficulties. We show how these difficulties can be resolved if the domain V is a Polish topological space, and give a representation theorem directly applicable to the construction of any probability distribution on M(V) whose first moment measure is well-defined. The proof draws on a projective limit theorem of Bochner, and on properties of set functions on Polish spaces to establish countable additivity of the resulting random probabilities.