Related papers: A tight bound on the speed-up through storage for …
The Max-Flow Min-Cut theorem is the classical duality result for the Max-Flow problem, which considers flow of a single commodity. We study a multiple commodity generalization of Max-Flow in which flows are composed of real-valued k-vectors…
The traditional multi-commodity flow problem assumes a given flow network in which multiple commodities are to be maximally routed in response to given demands. This paper considers the multi-commodity flow network-design problem: given a…
We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a…
An upper bound is derived for $\Delta$ for a cold dilute fluid of equal amounts of two species of fermion in the unitary regime $k_f a \to \infty$ (where $k_f$ is the Fermi momentum and $a$ the scattering length, and $\Delta$ is a pairing…
Fluidity, the ability of liquids to flow, is the key property distinguishing liquids from solids. This fluidity is set by the mobile transit atoms moving from one quasi-equilibrium point to the next. The nature of this transit motion is…
Partitioned multiprocessor scheduling has been widely accepted in academia and industry to statically assign and partition real-time tasks onto identical multiprocessor systems. This paper studies fixed-priority partitioned multiprocessor…
Since the development of efficient linear program solvers in the 80s, all major improvements for solving multi-commodity flows to high accuracy came from improvements to general linear program solvers. This differs from the single commodity…
We report measurements in a 2-dimensional, gravity-driven, collisional, granular flow of the normal force delivered to the wall and of particle velocity at several points in the flow. The wall force and the flow velocity are negatively…
The lattice Boltzmann method with enhanced collisions and rest particles is used to calculate the flow in a two-dimensional lid-driven cavity. The abilitity of this method to compute the velocity and the pressure of an incompressible fluid…
Consider a passive scalar which is advected by an incompressible flow $u$ and has small molecular diffusivity $\kappa$. Previous results show that if $u$ is exponentially mixing and $C^1$, then the dissipation time is $O(|\log \kappa|^2)$.…
We study the computational complexity of scheduling jobs on a single speed-scalable processor with the objective of capturing the trade-off between the (weighted) flow time and the energy consumption. This trade-off has been extensively…
Speed-robust scheduling is the following two-stage problem of scheduling $n$ jobs on $m$ uniformly related machines. In the first stage, the algorithm receives the value of $m$ and the processing times of $n$ jobs; it has to partition the…
We consider the coflow scheduling problem in the non-clairvoyant setting, assuming that flow sizes are realized on-line according to given probability distributions. The goal is to minimize the weighted average completion time of coflows in…
Scaling and mechanism of the propagation speed of turbulent fronts in pipe flow with the Reynolds number has been a long-standing problem in the past decades. Here, we derive an explicit scaling law of the upstream front speed, which…
We study KPP pulsating front speed-up and effective diffusivity enhancement by general periodic incompressible flows. We prove the existence of and determine the limits $c^*(A)/A$ and $D(A)/A^2$ as $A\to\infty$, where $c^*(A)$ is the…
We introduce the concept of low-step multi-commodity flow emulators for any undirected, capacitated graph. At a high level, these emulators contain approximate multi-commodity flows whose paths contain a small number of edges, shattering…
We show that the interparticle friction coefficient significantly influences the flow and jamming behavior of granular materials exiting through the orifice of a two-dimensional silo in the presence of another orifice located in its…
Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application contexts, e.g., secure networking, a meaningful matching…
Future architectures designed to deliver exascale performance motivate the need for novel algorithmic changes in order to fully exploit their capabilities. In this paper, the performance of several numerical algorithms, characterised by…
We study the duration of "high-flow states" in freeway traffic, defined as the time periods for which traffic flows exceed a given flow threshold. Our empirical data are surprisingly well represented by a power law. Moreover, the power law…