We compare two multicommodity ow problems, the maximum sum of ow, and the maximum concurrent ow. We show that, for a given graph and a given set of k commodities with speci ed demands, if the minimum capacity of a multicut is approximated by the maximum sum of ow within a factor of , for any subset of commodities, then the minimum cut ratio is approximated by the maximum concurrent ow within a ...

In this study three different prominence and speech melody related effects on voice quality were studied using an inverse filtering based method. The hypothesis that prominence as a function of sentence and word stress is signaled with more pressed voice quality was tested. The results indicated discrepancies in the parameterization results, and the original hypothesis could not be confirmed. I...

Can arise from fast and slow responses of opposite sign: G(s) = 1 s + 1 − 2 s + 5 = 3 − s (s + 1)(s + 5) .

We prove that in an undirected graph there are at most O(n 2) cuts of size strictly less than 3=2 of the size of the minimum cut.