Related papers: A tight bound on the speed-up through storage for …
We give an $O(k^3 n \log n \min(k,\log^2 n) \log^2(nC))$-time algorithm for computing maximum integer flows in planar graphs with integer arc {\em and vertex} capacities bounded by $C$, and $k$ sources and sinks. This improves by a factor…
We find steady channel flows that are locally optimal for transferring heat from fixed-temperature walls, under the constraint of a fixed rate of viscous dissipation (enstrophy = $Pe^2$), also the power needed to pump the fluid through the…
Our paper presents solutions that can significantly improve the delay performance of putting and retrieving data in and out of cloud storage. We first focus on measuring the delay performance of a very popular cloud storage service Amazon…
With multiple identical unit speed servers, the online problem of scheduling jobs that migrate between two phases, limitedly parallelizable or completely sequential, and choosing their respective speeds to minimize the total flow time is…
This paper firstly show that 2 Dimensional Intelligent Driver Model (Jiang et al., PloS one, 9(4), e94351, 2014) is not able to replicate the synchronized traffic flow. Then we propose an improved model by considering the difference between…
We consider the forced mean curvature flow in 2-d, finite range of dependence and positive random forcing. We prove flatness and existence of effective speed for initially flat propagating fronts. This is the analogue, in random media, of a…
We prove the existence of a weak solution to the compressible Navier--Stokes system with singular pressure that explodes when density achieves its congestion level. This is a quantity whose initial value evolves according to the transport…
We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We…
Lenstra's integer factorization algorithm is asymptotically one of the fastest known algorithms, and is ideally suited for parallel computation. We suggest a way in which the algorithm can be speeded up by the addition of a second phase.…
We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using $\alpha$-\emph{congestion-approximators}: easy-to-compute functions that approximate the congestion required to route single-commodity demands…
The solution h to the Fisher-KPP equation with a steep enough initial condition develops into a front moving at velocity 2, with logarithmic corrections to its position. In this paper we investigate the value h(c t, t) of the solution ahead…
Recent work has shown that leveraging learned predictions can improve the running time of algorithms for bipartite matching and similar combinatorial problems. In this work, we build on this idea to improve the performance of the widely…
A bicriteria approximation algorithm is presented for the unrooted traveling repairman problem, realizing increased profit in return for increased speedup of repairman motion. The algorithm generalizes previous results from the case in…
We consider a sequence of single-server queueing models operating under a service policy that incorporates batches into processor sharing: arriving jobs build up behind a gate while waiting to begin service, while jobs in front of the gate…
In generalized malleable scheduling, jobs can be allocated and processed simultaneously on multiple machines so as to reduce the overall makespan of the schedule. The required processing time for each job is determined by the joint…
Recent numerical work has shown that high-speed confined granular flows down inclines exhibit a rich variety of flow patterns, including dense unidirectional flows, flows with longitudinal vortices and supported flows characterized by a…
In the federated scheduling approaches in multiprocessor systems, a task either 1) is restricted to execute sequentially on a single processor or 2) has exclusive access to the assigned processors. There have been several positive results…
In this work we introduce $\nu^2$-Flows, an extension of the $\nu$-Flows method to final states containing multiple neutrinos. The architecture can natively scale for all combinations of object types and multiplicities in the final state…
We give two results for multicommodity flows in the $d$-dimensional hypercube ${Q}^d$ with independent random edge capacities distributed like $C$ where $\Pr[C>0]>1/2$. Firstly, with high probability as $d \rightarrow \infty$, the network…
In stars and planets natural processes heat convective flows in the bulk of a convective region rather than at hard boundaries. By characterizing how convective dynamics are determined by the strength of an internal heating source we can…