Towards a web-based progressive handwriting recognition environment for mathematical problem solving

The emergence of pen-based mobile devices such as PDAs and tablet PCs provides a new way to input mathematical expressions to computer by using handwriting which is much more natural and efficient for entering mathematics. This paper proposes a web-based handwriting mathematics system, called WebMath, for supporting mathematical problem solving. The proposed WebMath system is based on client-server architecture. It comprises four major components: a standard web server, handwriting mathematical expression editor, computation engine and web browser with Ajax-based communicator. The handwriting mathematical expression editor adopts a progressive recognition approach for dynamic recognition of handwritten mathematical expressions. The computation engine supports mathematical functions such as algebraic simplification and factorization, and integration and differentiation. The web browser provides a user-friendly interface for accessing the system using advanced Ajax-based communication. In this paper, we describe the different components of the WebMath system and its performance analysis.

A Bayesian approach to on-line learning

Online learning is discussed from the viewpoint of Bayesian statistical inference. By replacing the true posterior distribution with a simpler parametric distribution, one can define an online algorithm by a repetition of two steps: An update of the approximate posterior, when a new example arrives, and an optimal projection into the parametric family. Choosing this family to be Gaussian, we show that the algorithm achieves asymptotic efficiency. An application to learning in single layer neural networks is given.

Estimating parameters in stochastic systems:a variational Bayesian approach

This work is concerned with approximate inference in dynamical systems, from a variational Bayesian perspective. When modelling real world dynamical systems, stochastic differential equations appear as a natural choice, mainly because of their ability to model the noise of the system by adding a variation of some stochastic process to the deterministic dynamics. Hence, inference in such processes has drawn much attention. Here a new extended framework is derived that is based on a local polynomial approximation of a recently proposed variational Bayesian algorithm. The paper begins by showing that the new extension of this variational algorithm can be used for state estimation (smoothing) and converges to the original algorithm. However, the main focus is on estimating the (hyper-) parameters of these systems (i.e. drift parameters and diffusion coefficients). The new approach is validated on a range of different systems which vary in dimensionality and non-linearity. These are the Ornstein–Uhlenbeck process, the exact likelihood of which can be computed analytically, the univariate and highly non-linear, stochastic double well and the multivariate chaotic stochastic Lorenz ’63 (3D model). As a special case the algorithm is also applied to the 40 dimensional stochastic Lorenz ’96 system. In our investigation we compare this new approach with a variety of other well known methods, such as the hybrid Monte Carlo, dual unscented Kalman filter, full weak-constraint 4D-Var algorithm and analyse empirically their asymptotic behaviour as a function of observation density or length of time window increases. In particular we show that we are able to estimate parameters in both the drift (deterministic) and the diffusion (stochastic) part of the model evolution equations using our new methods.

Progressive structural analysis for dynamic recognition of on-line handwritten mathematical expressions

Structural analysis in handwritten mathematical expressions focuses on interpreting the recognized symbols using geometrical information such as relative sizes and positions of the symbols. Most existing approaches rely on hand-crafted grammar rules to identify semantic relationships among the recognized mathematical symbols. They could easily fail when writing errors occurred. Moreover, they assume the availability of the whole mathematical expression before being able to analyze the semantic information of the expression. To tackle these problems, we propose a progressive structural analysis (PSA) approach for dynamic recognition of handwritten mathematical expressions. The proposed PSA approach is able to provide analysis result immediately after each written input symbol. This has an advantage that users are able to detect any recognition errors immediately and correct only the mis-recognized symbols rather than the whole expression. Experiments conducted on 57 most commonly used mathematical expressions have shown that the PSA approach is able to achieve very good performance results.

Control of cascaded DC-DC converter based hybrid battery energy storage systems - Part II:Lyapunov approach

A cascaded DC-DC boost converter is one of the ways to integrate hybrid battery types within a grid-tie inverter. Due to the presence of different battery parameters within the system such as, state-of-charge and/or capacity, a module based distributed power sharing strategy may be used. To implement this sharing strategy, the desired control reference for each module voltage/current control loop needs to be dynamically varied according to these battery parameters. This can cause stability problem within the cascaded converters due to relative battery parameter variations when using the conventional PI control approach. This paper proposes a new control method based on Lyapunov Functions to eliminate this issue. The proposed solution provides a global asymptotic stability at a module level avoiding any instability issue due to parameter variations. A detailed analysis and design of the nonlinear control structure are presented under the distributed sharing control. At last thorough experimental investigations are shown to prove the effectiveness of the proposed control under grid-tie conditions.

Lattice approach to the dynamics of the DPSK-encoded soliton trains

We study the dynamical properties of the RZ-DPSK encoded sequences, focusing on the instabilities in the soliton train leading to the distortions of the information transmitted. The problem is reformulated within the framework of complex Toda chain model which allows one to carry out the simplified description of the optical soliton dynamics. We elucidate how the bit composition of the pattern affects the initial (linear) stage of the train dynamics and explain the general mechanisms of the appearance of unstable collective soliton modes. Then we discuss the nonlinear regime using asymptotic properties of the pulse stream at large propagation distances and analyze the dynamical behavior of the train classifying different scenarios for the pattern instabilities. Both approaches are based on the machinery of Hermitian and non-Hermitian lattice analysis. © 2010 IEEE.