Related papers: A tight bound on the speed-up through storage for …
The sliced-Wasserstein flow is an evolution equation where a probability density evolves in time, advected by a velocity field computed as the average among directions in the unit sphere of the optimal transport displacements from its 1D…
We propose a framework for speeding up maximum flow computation by using predictions. A prediction is a flow, i.e., an assignment of non-negative flow values to edges, which satisfies the flow conservation property, but does not necessarily…
Space complexity is a critical factor in various computational models, including streaming, parallel/distributed computing, and communication complexity. We study the space complexity of the minimum-cost flow problem, a generalization of…
A coflow is a collection of parallel flows belonging to the same job. It has the all-or-nothing property: a coflow is not complete until the completion of all its constituent flows. In this paper, we focus on optimizing \emph{coflow-level…
Empirical observations in marine ecosystems have suggested a balance of biological and advection time scales as a possible explanation of species coexistence. To characterise this scenario, we measure the time to fixation in neutrally…
This paper analyzes the use of variable speed limits to optimize travel time reliability for commuters. The investigation focuses on a traffic corridor with a bottleneck subject to the capacity drop phenomenon. The optimization criterion is…
We investigate the influence of fluid flows on the propagation of chemical fronts arising in FKPP type models. We develop an asymptotic theory for the front speed in a cellular flow in the limit of small molecular diffusivity and fast…
The central problem in the physics of immiscible two-phase flow in porous media is to find a proper description of the flow at scales large enough so that the medium may be regarded as a continuum: the scale-up problem. So far, the only…
Motivated by scheduling in Geo-distributed data analysis, we propose a target location problem for multi-commodity flow (LoMuF for short). Given commodities to be sent from their resources, LoMuF aims at locating their targets so that the…
Location Routing is a fundamental planning problem in logistics, in which strategic location decisions on the placement of facilities (depots, distribution centers, warehouses etc.) are taken based on accurate estimates of operational…
We numerically examine the flow and clogging of particles driven through asymmetric funnel arrays when the commensurability ratio of the number of particles per plaquette is varied. The particle-particle interactions are modeled with a soft…
This note proves an upper bound for the fluctuations of a second-class particle in the totally asymmetric simple exclusion process. The proof needs a lower tail estimate for the last-passage growth model associated with the exclusion…
We present an efficient and parsimonious algorithm to solve mixed initial/final-value problems. The algorithm optimally limits the memory storage and the computational time requirements: with respect to a simple forward integration, the…
A centralized coded caching system, consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link, is considered. It is assumed that each user is equipped with a local cache memory with…
Flows over time have received substantial attention from both an optimization and (more recently) a game-theoretic perspective. In this model, each arc has an associated delay for traversing the arc, and a bound on the rate of flow entering…
We give an $\widetilde{O}({m^{3/2 - 1/762} \log (U+W))}$ time algorithm for minimum cost flow with capacities bounded by $U$ and costs bounded by $W$. For sparse graphs with general capacities, this is the first algorithm to improve over…
Coded multicasting has been shown to improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link. However, the schemes that have been shown to achieve order-optimal perfor- mance…
We report experiments on the deformation and transport of an elastic fiber in a viscous cellular flow, namely a lattice of counter-rotative vortices. We show that the fiber can buckle when approaching a stagnation point. By tuning either…
Previous work on solute transport with sorption in Poiseuille flow has reached contradictory conclusions. Some have concluded that sorption increases mean solute transport velocity and decreases dispersion relative to a tracer, while others…
We investigate spreading properties of solutions of a large class of two-component reaction-diffusion systems, including prey-predator systems as a special case. By spreading properties we mean the long time behaviour of solution fronts…