The behaviour of the voice source characteristics in connected speech was studied. Voice source parameters were obtained by automatic inverse filtering, followed by automatic fitting of the LF-model to the data. Consistent relations between voice source parameters and prosody were observed.

The famous Padberg–Rao separation algorithm for b-matching polyhedra can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time in the uncapacitated case, and in O(|V ||E|2 log (|V |2/|E|)) time in the capacitated case. We give a new and simple algorithm for the capacitated case which can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time.

1389 with u(w; s) = jwj1u(^ w; s) where ^ w = w=jwj1. For any w 2 R 2 and s 2 f0; 1g; jz(w;s)j 1 6jwj 1. We now turn our attention to signals w(k) 2 l n 1 and w(t) 2 L n 1 , and to distinguish them from vectors in R n we will use boldface type.

In this paper design of reduced order switching function for a discrete-time uncertain nonminimum phase system in special coordinate basis form is proposed. The sliding mode control with this method guarantees the asymptotic stability of all states of system in presence matched disturbance. This problem is further extended to the tracking problem of discrete time uncertain nonminimum phase syst...

We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variables. We show that the longest of these minimum-weight paths has about α logn edges where α ≈ 3.5911 is the unique solution of the equation α logα − α = 1. This answers a question left open by Janson [8].