In this paper, a stochastic polynomial tone model is presented for tone modeling in continuous mandarin speech. In this model, the pitch contour is described by a stochastic trajectory. The mean trajectory is represented by a polynomial function of normalized time while the variance is time varying. After that, an effective training and recognition algorithm is developed respectively. Also the ...

This paper deals with a generalized impact angle control guidance law with terminal acceleration constraint, which is called the Time-to-go Polynomial Guidance (TPG). The guidance command of TPG is initially assumed as a polynomial form of tgo, and then the coefficients of this polynomial function are designed to satisfy the terminal impact angle and zero miss-distance constraints. TPG presents...

Continuous-time Markov chains are used to model systems in which transitions between states as well as the time the system spends in each state are random. Many computational problems related to such chains have been solved, including determining state distributions as a function of time, parameter estimation, and control. However, the problem of inferring most likely trajectories, where a traj...

Tissue deformation in ultrasound imaging is an inevitable phenomenon and poses challenges to the development of many techniques related to ultrasound image registration, including multimodal image fusion, freehand three-dimensional ultrasound, and quantitative measurement of tissue geometry. In this thesis, a novel trajectory-based method to correct tissue deformation in ultrasound B-mode imagi...

This paper presents a new method of multi-frame speech coding based upon polynomial approximation of speech feature trajectories incorporating multiple sensor signals from microphones, accelerometer, electro-glottograph, and microradar. The trajectory polynomial approximation exploits the inter-frame information redundancy encountered in natural speech. The trajectory method is applicable to fe...

In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle trajectory, and computes by permuting particles. Whereas topological quantum computation requires anyons, permutational quantum computation can be performed ...

We study universal stability of directed and undirected graphs in the adversarial queuing model for static packet routing. In this setting, packets are injected in some edge and have to traverse a predefined path before leaving the system. Restrictions on the allowed packet trajectory provide a way to analyze stability under different packet trajectories. We consider five packet trajectories, t...

The two control design methods for stabilizing discrete time systems are based on the notion of exact linearization with diffemorphism and feedback. On the one hand, the first method consists in developing a polynomial control law based on the exact linearization approach. This approach was developed by considering the concept of relative degree. On the other hand, the second method is based on...

This study considers the problem of generating optimal, kino-dynamic-feasible, and obstacle-free trajectories for a quadrotor through indoor environments. We explore methods to overcome challenges faced by quadrotors settings due their higher-order vehicle dynamics, relatively limited free spaces environment, challenging optimization constraints. In this research, we propose complete pipeline p...