Related papers: Flow Rounding
We consider a routing problem which plays an important role in several applications, primarily in communication network planning and VLSI layout design. The original underlying graph algorithmic task is called Disjoint Paths problem. In…
We examine the effects of a periodically varying flow velocity on the standing and travelling wave patterns formed by the flow-distributed oscillation (FDO) mechanism. In the kinematic (or diffusionless) limit, the phase fronts undergo a…
Streamflow, as a natural phenomenon, is continuous in time and so are the meteorological variables which influence its variability. In practice, it can be of interest to forecast the whole flow curve instead of points (daily or hourly). To…
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work is the first treatment of a natural stochastic variant of the problem where the cost of comparing two elements is a…
Morphing is a long-standing problem in vision and computer graphics, requiring a time-dependent warping for feature alignment and a blending for smooth interpolation. Recently, multilayer perceptrons (MLPs) have been explored as implicit…
In recent years, crowdsourcing, aka human aided computation has emerged as an effective platform for solving problems that are considered complex for machines alone. Using human is time-consuming and costly due to monetary compensations.…
A continuum theory of partially fluidized granular flows is developed. The theory is based on a combination of the equations for the flow velocity and shear stresses coupled with the order parameter equation which describes the transition…
For nice functions, invariant means over integral currents (certain generalized surfaces), can be uniquely defined.
Interpreting RG flows as dynamical systems in the space of couplings we produce a variety of constraints, global (topological) as well as local. These constraints, in turn, rule out some of the proposed RG flows and also predict new phases…
Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem -- the all-or-nothing multicommodity flow (ANF) problem -- in arbitrary directed graphs and in the…
A penalization method for a suitable reformulation of the governing equations as a constrained optimization problem provides accurate numerical simulations for large-amplitude travelling water waves in irrotational flows and in flows with…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…
First we give an introduction to the method of diagonalizing or block-diagonalizing continuously a Hamiltonian and explain how this procedure can be used to analyze the two-dimensional Hubbard model. Then we give a short survey on…
Based on machine learning techniques, we propose a novel method to estimate flow fields using only floating sensor locations. This method does not require either ground-truth velocity fields or governing equations for fluid flows, which is…
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…
Neural Algorithmic Reasoning is an emerging area of machine learning which seeks to infuse algorithmic computation in neural networks, typically by training neural models to approximate steps of classical algorithms. In this context, much…
Clustering problems are fundamental to unsupervised learning. There is an increased emphasis on fairness in machine learning and AI; one representative notion of fairness is that no single demographic group should be over-represented among…
In this paper, we derive a number of interesting properties and extensions of the convex flow problem from the perspective of convex geometry. We show that the sets of allowable flows always can be imbued with a downward closure property,…
Context. A universally accepted definition of what a vortex is has not yet been reached. Therefore, we lack an unambiguous and rigorous method for the identification of vortices in fluid flows. Such a method would be necessary to conduct…
The motivation for this work stems from the problem of scheduling requests for flow at supply points along an automated network of open-water channels. The off-take flows are rigid-profile inputs to the system dynamics. In particular, the…