A weighted Viterbi algorithm (HMM) is proposed and applied in combination with spectral subtraction and Cepstral Mean Normalization to cancel both additive and convolutional noises in speech recognition. The weighted Viterbi approach is compared and used in combination with state duration modelling. The results presented in this paper show that a proper weight on the information provided by sta...

Key Learning Points: 1) Currently the most valuable and practical MpMRI protocol consists of T2WI, DWI and DCE. 2) Significant and additive improvement in the predictive values for prostate cancer detection, especially in the PZ, is achievable when combinations of the imaging strategies are combined. 3) Information from MpMRI can be used to direct and increase the yield from prostate biopsies. ...

the objective of this experiment was to investigate inheritance and gene action for resistance to sunn pest (eurygaster integriceps) and related traits in bread wheat including f1, f2 and backcross generations derived from a cross between line 15 as resistance and line 12 as susceptible parents. parents along with f1, f2, bc1 and bc2 generations were evaluated in a randomized complete block des...

We investigate schemes for achieving service differentiation via weighted end-to-end congestion control mechanisms within the framework of the additive increase/multiplicative decrease (AIMD) principle, and study their performance as instantiations of the TCP protocol. Our first approach considers a class of weighted AIMD algorithms. This approach does not scale well in practice because it lead...

The fuzzy weighted average is widely used to solve hierarchical evaluation problems, including fuzzy consideration for the operations of scoring, weighting and aggregating. Previous works considered the fuzziness of score and weight, and used the additive function to aggregate these weighted scores. This study considers the aggregation operator also as a fuzzy variable, and uses a generalized m...

We present the first polynomial time approximation algorithm for computing short-est paths in weighted three-dimensional domains. Given a polyhedral domain D, con-sisting of n tetrahedra with positive weights, and a real number ε ∈ (0, 1), our algorithmconstructs paths in D from a fixed source vertex to all vertices of D, whose costs areat most 1 + ε times the costs of (weighted...