Given a large edge-weighted network G with k terminal vertices, we wish to compress it and store, using little memory, the value of the minimum cut (or equivalently, maximum flow) between every bipartition of terminals. One appealing methodology to implement a compression of G is to construct a mimicking network : a small network G′ with the same k terminals, in which the minimum cut value betw...

This article investigates discrete-time matrix-weighted consensus of multi-agent networks over undirected and connected graphs. We first present protocols for the agents in common symmetric matrix weights with possibly different update rates switching network topologies. A special type non-symmetric matrix-weights that can render several control scenarios such as ones scaled/rotated updates aff...

We consider the online scheduling problem of minimizing total weighted flow time plus energy on a processor that can scale its speed dynamically between 0 and some maximum speed T . In the past few years this problem has been studied extensively under the clairvoyant setting, which requires the size of a job to be known when it is released [1, 4, 5, 8, 12, 15, 16, 17]. For the non-clairvoyant s...

The transport of real-time data flows over wireless channels can be optimized by cross-layer schedulers which serve the different users dependent on their traffic load and channel state. This paper investigates the delay performance of a two-stage cross-layer scheduler which has been designed to meet the above requirements. The well-known Weighted Fair Queuing Scheduler can tramsmit packets wit...

We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single machine with minimizing the weighted total flow time, provided that processing time of a job can take on any real value from the given closed interval. It is assumed that job processing time is unknown random variable before the actual occurrence of this time, where probability distribution of such ...

nowadays, the environmental impact of transportation project and, especially air pollution impacts, are major concerns in evaluating transportation projects. based on this concern, beside definition of traditional objective functions like total travel time and total investment cost, different type of environmental related function is considered as objective function in urban network design. in ...

time–area method is one of the most widely applied techniques of watershed routing, and can be potentially used as a distributed model. in this paper, a fundamental flaw in the arrangement of subareas in the original time-area histogram is identified for one-dimensional flow. this is conducted on the basis of comparing time-area hydrograph with that of the kinematic wave theorem. accordingly, a...

The flow complex was introduced recently as a data structure on a finite number of points in . The flow complex is a two dimensional simplicial complex that turned out to be useful for modeling applications like surface reconstruction. In order to apply the flow complex to tasks in bio-geometric modeling an extension to weighted points is needed. Here we report on an algorithm to compute the we...

We study online scheduling of jobs to minimize the flow time and stretch on parallel machines. We consider algorithms that are given extra resources so as to compensate for the lack of future information. Recent results show that a modest increase in machine speed can provide very competitive performance; in particular, using O(1) times faster machines, the algorithm SRPT (shortest remaining pr...