Room temperature magnetic quantum cellular automata

All computers process information electronically. A processing method based on magnetism is reported here, in which networks of interacting submicrometer magnetic dots are used to perform logic operations and propagate information at room temperature. The logic states are signaled by the magnetization direction of the single-domain magnetic dots; the dots couple to their nearest neighbors through magnetostatic interactions. Magnetic solitons carry information through the networks, and an applied oscillating magnetic field feeds energy into the system and serves as a clock. These networks offer a several thousandfold increase in integration density and a hundredfold reduction in power dissipation over current microelectronic technology.

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.

Two-dimensional Cartesian air-gap element (CAGE) for dynamic finite-element modeling of electrical machines with a flat air gap

This paper extends the air-gap element (AGE) to enable the modeling of flat air gaps. AGE is a macroelement originally proposed by Abdel-Razek et al.for modeling annular air gaps in electrical machines. The paper presents the theory of the new macroelement and explains its implementation within a time-stepped finite-element (FE) code. It validates the solution produced by the new macroelement by comparing it with that obtained by using an FE mesh with a discretized air gap. It then applies the model to determine the open-circuit electromotive force of an axial-flux permanent-magnet machine and compares the results with measurements.

Language model combination and adaptation using weighted finite state transducers

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.

Probabilistic inference for fast learning in control

A novel framework is provided for very fast model-based reinforcement learning in continuous state and action spaces. It requires probabilistic models that explicitly characterize their levels of condence. Within the framework, exible, non-parametric models are used to describe the world based on previously collected experience. It demonstrates learning on the cart-pole problem in a setting where very limited prior knowledge about the task has been provided. Learning progressed rapidly, and a good policy found after only a small number of iterations.