Glottal flow waveforms estimated by inverse filtering acoustic speech pressure signals were compared to glottal area functions obtained by digital high-speed imaging of the vocal fold vibration. Speech data consisted of breathy, normal and pressed phonations produced by two male and one female subjects. The results yield both qualitative and quantitative information about the relationship betwe...

1. The average cost of a directed cycle is AvgCost(C) = ω(C) /t = e∈C ω(e) /t. (v) denote the minimum length of a walk with exactly k edges, ending at v. So, for each v, we have d 0 (v) = 0 and d k+1 (v) = min e=(u→v)∈E d k (u) + ω(e) .

We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network simplex algorithms for the standard and fo...

A short proof of a difficult theorem of P.D. Seymour on grafts with the max-flow min-cut property is given.

In this article, we devise two dual based methods for obtaining very good solution to a single stage un-capacitated minimum cost flow problem. These methods are an improvement to the methods already developed by Sharma and Saxena [1]. We further develop a method to extract a very good primal solution from a given dual solution. We later demonstrate the efficacies and the significance of these m...

The paper presents a dynamic solution method for dynamic minimum parametric networks flow. The solution method solves the problem for a special parametric dynamic network with linear lower bound functions of a single parameter. Instead directly work on the original network, the method implements a labelling algorithm in the parametric dynamic residual network and uses quickest paths from the so...

This article considers a two-player strategic game for network routing under link disruptions. Player 1 (defender) routes flow through a network to maximize her value of effective flow while facing transportation costs. Player 2 (attacker) simultaneously disrupts one or more links to maximize her value of lost flow but also faces cost of disrupting links. Linear programming duality in zero-sum ...