Correlated node behavior poses a great challenge for normal functioning of mobile ad hoc network. The impact could be devastating if the spreading of correlated node behavior will result in network failure. We model correlated node behavior by merging the principle of epidemic model and semi Markov process. Under merging condition, node behavior transition and epidemic model is converge to capt...

Recently, a statistical speech synthesis system based on the hidden Markov model (HMM) has been proposed. In this system, spectrum, excitation, and duration of human speech are modeled simultaneously by context-dependent HMMs and speech parameter vector sequences are generated from the HMMs themselves. This system defines a speech synthesis problem in a generative model framework and solves it ...

In-car infotainment and navigation devices are typical examples where speech based interfaces are successfully applied. While classical applications are monolingual, such as voice commands or monolingual destination input, the trend goes towards multilingual applications. Examples are music player control or multilingual destination input. As soon as more languages are considered the training a...

We investigate two statistical-detection problems, change-point detection and pattern matching in plasma etch endpoint detection. Our approach is based on a segmental semi-Markov model framework. In the change-point detection problem, the changepoint corresponds to state switching in the model. For pattern matching, the pattern is approximated as a sequence of linear segments which are then mod...

In the classical hidden Markov chain (HMC) model we have a hidden chain X , which is a Markov one and an observed chain Y . HMC are widely used; however, in some situations they have to be replaced by the more general “hidden semi-Markov chains” (HSMC), which are particular “triplet Markov chains” (TMC) ) , , ( Y U X T = , where the auxiliary chain U models the semi-Markovianity of X . Otherwis...

We consider an infinite server resequencing queue, where arrivals are generated by jumps of a semi-Markov process and service times depend on the jumps of this process. The stationary distribution of the sojourn time, conditioned on the state of the semi-Markov process, is obtained both for the case of hyperexponential service times and for the case of a Markovian arrival process. For the gener...