In this paper, we consider the inverse spanning tree problem. Given an undirected graph Go = (Ni, AO) with n nodes, mn arcs, an arc cost vector c, and a spanning tree T, the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T is a minimum spanning tree with respect to the cost vector d and the cost of perturbation given by Id c = L(l j) Aldij ciil is minimu...

The security performance problems of broadcast channel with an eavesdropper (BCE) have been studied for many years in the field of communication. Many articles have given the meaningful results. However, almost no consequent of an outer bound on BCE has been given by previous work, especially, no significant results has been given. So this paper proposes and proves an outer bound of BCE by usin...

Abstract – In the visual systems of mammals, visual scenes are analyzed in parallel by separate channels. Information concerning visual motion is mainly analyzed through the occipitoparietal pathway. In area MST of the pathway, there are cells that respond selectively to specific motions of a large area of the visual field, such as rotation, expansion and contraction. Many of these cells are re...

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...

The pull-push hybrid P2P streaming, as an emerging and promising approach, has achieved some success in delivering live video traffic. The substream scheduling problem is a key design issue in a hybrid system. In this paper, we propose a max-flow model for unifying this sub-stream scheduling problem. We find that the sub-stream scheduling problem in GridMedia, CoolStreaming+ and LStreaming can ...

In this paper the method for the minimum cost flow determining in fuzzy dynamic network with nonzero lower flow bounds is proposed. Considered method takes into account fuzzy nature of networks’ parameters and deals with fuzzy arc flow bounds, fuzzy transmission costs. Fuzzy arc flow bounds, costs and transit times can vary depending on the flow departure time. The method allows introducing the...

Given an instance of the minimum cost flow problem, the corresponding inverse problem is to modify the arc costs as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. In this article, we study this inverse problem in that the modifications are measured by the weighted bottleneck-type Hamming distance. We present a new efficient algorithm ...

MINIMUM COST FLOW PROBLEM WITH ARBITRARY COSTS A. Sedeño-Noda, C. González-Martín, S. Alonso Departamento de Estadística, Investigación Operativa y Computación (DEIOC) Universidad de La Laguna, 38271 La Laguna, Tenerife (Spain). Abstract We address the undirected minimum cost flow problem with arbitrary arcs costs. The optimal solutions for this problem is characterized proving that the flow of...

Performance of cooperative diversity schemes at Low Signal to Noise Ratios (LSNR) was recently studied by Avestimehr et. al. [1] who emphasized the importance of diversity gain over multiplexing gain at low SNRs. It has also been pointed out that continuous energy transfer to the channel is necessary for achieving the max-flow min-cut bound at LSNR. Motivated by this we propose the use of Selec...