growth of information and communication technologies has influenced the research trends n speech technologies. This research explains a basic speech segmentation application for Arabic language with the aim to further develop a language tutor. The focus is on rabic as there are standards available which help in obtaining better accuracy. The roblem has been formulated in the form of a number of...

This paper presents a voice activity detection (VAD) scheme that is robust against noise, based on an optimally weighted combination of features. The scheme uses a weighted combination of four conventional VAD features: amplitude level, zero crossing rate, spectral information, and Gaussian mixture model likelihood. This combination in effect selects the optimal method depending on the noise co...

We show that under suitable non-degeneracy conditions, m points and n 2–dimensional algebraic surfaces in R satisfying certain “pseudoflat” requirements can have at most O ( mn + m + n ) incidences, provided that m ≤ n2− for any > 0 (where the implicit constant in the above bound depends on ), or m ≥ n. As a special case, we obtain the Szemerédi-Trotter theorem for 2–planes in R, again provided...

The analysis of crossover interference in many creatures is complicated by the presence of two kinds of crossovers, interfering and noninterfering. In such creatures, the values of the traditional indicators of interference are subject not only to the strength of interference but also to the relative frequencies of crossing over contributed by the two kinds. We formalize the relationship among ...

The best lower bound known on the crossing number of the complete bipartite graph is : cr(Km,n) ≥ (1/5)(m)(m − 1)bn/2cb(n − 1)/2c In this paper we prove that: cr(Km,n) ≥ (1/5)m(m − 1)bn/2cb(n − 1)/2c + 9.9 × 10−6m2n2 for sufficiently large m and n.

The bipartite crossing number of a bipartite graph is the minimum number of crossings of edges when the partitions are placed on two parallel lines and edges are drawn as straigh line segments between the lines. We prove exact results, asymtotics and new upper bounds for the bipartite crossing numbers of 2-dimensional mesh graphs. Especially we show that bcr(P6 × Pn) = 35n − 47, for n ≥ 7.

spo16 mutants in yeast were reported to have reduced map lengths, a high frequency of nondisjunction in the first meiotic division, and essentially unchanged coefficients of coincidence. Were all crossing over in yeast subject to interference, such data would suggest that the "designation" of recombination events to become crossovers is separable from the "implementation" of that crossing over....

We characterize Pfaffian graphs in terms of their drawings in the plane. We generalize the techniques used in the proof of this characterization, and prove a theorem about the numbers of crossings in T -joins in different drawings of a fixed graph. As a corollary we give a new proof of a theorem of Kleitman on the parity of crossings in drawings of K2j+1 and K2j+1,2k+1.