Related papers: A tight bound on the speed-up through storage for …
We investigate a scheduling problem arising from a material handling and processing problem in a production line of an Austrian company building prefabricated house walls. The addressed problem is a permutation flow shop with blocking…
In contrast to the homogeneous superfluid which has only one critical velocity, there exist two critical velocities for a superfluid in a periodic potential. The first one, which we call inside critical velocity, is for a macroscopic…
We consider the problem of maximizing a fractionally subadditive function under a knapsack constraint that grows over time. An incremental solution to this problem is given by an order in which to include the elements of the ground set, and…
This paper deals with the problem of computing, in an online fashion, a maximum benefit multi-commodity flow (\ONMCF), where the flow demands may be bigger than the edge capacities of the network. We present an online, deterministic,…
Rectified flow (Liu et al., 2022; Liu, 2022; Wu et al., 2023) is a method for defining a transport map between two distributions, and enjoys popularity in machine learning, although theoretical results supporting the validity of these…
We perform a numerical study of the reaction efficiency in a closed vessel. Starting with a little spot of product, we compute the time needed to complete the reaction in the container following an advection-reaction-diffusion process.…
In the store-and-forward routing problem, packets have to be routed along given paths such that the arrival time of the latest packet is minimized. A groundbreaking result of Leighton, Maggs and Rao says that this can always be done in time…
The partial differential equations describing immiscible, but soluble, carbon dioxide (CO2) displacement of brine are developed including local mass-transfer effects. Scaling relationships for characteristic time among laboratory and…
This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that are not efficiently…
We use confocal microscopy to directly visualize the spatial fluctuations in fluid flow through a three-dimensional porous medium. We find that the velocity magnitudes and the velocity components both along and transverse to the imposed…
In this paper a novel low-storage method for time-resolved databases is presented. This approach reduces the storage cost of time-resolved databases by storing filtered flow fields that target the large and intermediate scales, while…
Despite intensive research, the physical origin of the speed-up offered by quantum algorithms remains mysterious. No general physical quantity, like, for instance, entanglement, can be singled out as the essential useful resource. Here we…
The stability of two-dimensional Poiseuille flow and plane Couette flow for concentrated suspensions is investigated. Linear stability analysis of the two-phase flow model for both flow geometries shows the existence of a convectively…
The "faster-is-slower" (FIS) effect was first predicted by computer simulations of the egress of pedestrians through a narrow exit [Helbing D, Farkas I J, Vicsek T, Nature 407:487-490 (2000)]. FIS refers to the finding that, under certain…
We revisit the non-preemptive speed-scaling problem, in which a set of jobs have to be executed on a single or a set of parallel speed-scalable processor(s) between their release dates and deadlines so that the energy consumption to be…
We independently assign a non-negative value, as a capacity for the quantity of flows per unit time, with a distribution F to each edge on the Z^d lattice. We consider the maximum flows through the edges of two disjoint sets, that is from a…
A mathematical model for a one-phase change problem (particularly a Stefan problem) with a memory flux, is obtained. The hypothesis that the weighted sum of fluxes back in time is proportional to the gradient of temperature is considered.…
Several works have shown linear speedup is achieved by an asynchronous parallel implementation of stochastic coordinate descent so long as there is not too much parallelism. More specifically, it is known that if all updates are of similar…
Numerous experimental data on the rapid solidification of binary systems exhibit the formation of metastable solid phases with the initial (nominal) chemical composition. This fact is explained by complete solute trapping leading to…
We provide evidence that computing the maximum flow value between every pair of nodes in a directed graph on $n$ nodes, $m$ edges,and capacities in the range $[1..n]$, which we call the All-Pairs Max-Flow problem, cannot be solved in time…