Related papers: Uncapacitated Flow-based Extended Formulations
Optimal power flow problems (OPFs) are mathematical programs used to determine how to distribute power over networks subject to network operation constraints and the physics of power flows. In this work, we take the view of treating an OPF…
In this paper we present a mathematical analysis for a steady-state laminar boundary layer flow, governed by the Ostwald-de Wael power-law model of an incompressible non- Newtonian fluid past a semi-infinite power-law stretched flat plate…
Aggregations of flexible loads can provide several power system services through demand response programs, for example load shifting and curtailment. The capabilities of demand response should therefore be represented in system operators'…
This two-part paper details a theory of solvability for the power flow equations in lossless power networks. In Part I, we derive a new formulation of the lossless power flow equations, which we term the fixed-point power flow. The model is…
Asymptotic expansions are derived for Gegenbauer (ultraspherical) polynomials for large order $n$ that are uniformly valid for unbounded complex values of the argument $z$, including the real interval $0 \leq z \leq 1$ in which the zeros in…
We study a quantity called discrete layered entropy, which approximates the Shannon entropy within a logarithmic gap. Compared to the Shannon entropy, the discrete layered entropy is piecewise linear, approximates the expected length of the…
This paper introduces a new method to build linear flows, by taking the exponential of a linear transformation. This linear transformation does not need to be invertible itself, and the exponential has the following desirable properties: it…
Turbulent flows, ubiquitous in nature and engineering, comprise fluctuations over a wide range of spatial and temporal scales. While flows with fluctuations in thermodynamic variables are much more common, much less is known about these…
Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how well a polytope is approximated by the use of sparse valid…
A new eigenvalue analysis is developed and applied to the circular cylinder laminar flow configuration to investigate the various mechanisms at play in the nonlinear saturation of perturbations yielding to limit cycles for supercritical…
The power flow equations are fundamental to power system planning, analysis, and control. However, the inherent non-linearity and non-convexity of these equations present formidable obstacles in problem-solving processes. To mitigate these…
Constructions of metrics with special holonomy by methods of exterior differential systems are reviewed and the interpretations of these construction as `flows' on hypersurface geometries are considered. It is shown that these hypersurface…
We derive continuity equation and exact expression for flow probability density in a space with arbitrary deformed algebra leading to minimal length. In coordinate representation the flow probability density is presented as infinite series…
Enhanced diffusion, which describes the accelerated spread of passive scalars due to the interaction between advection and molecular diffusion, has been extensively studied in simplified geometries, such as uniform shear and radial flows.…
Accurate polyp segmentation remains challenging due to irregular lesion morphologies, ambiguous boundaries, and heterogeneous imaging conditions. While U-Net variants excel at local feature fusion, they often lack explicit mechanisms to…
The flow polytope $\mathcal{F}_{\widetilde{G}}$ is the set of nonnegative unit flows on the graph $\widetilde{G}$. The subdivision algebra of flow polytopes prescribes a way to dissect a flow polytope $\mathcal{F}_{\widetilde{G}}$ into…
While normalizing flows have led to significant advances in modeling high-dimensional continuous distributions, their applicability to discrete distributions remains unknown. In this paper, we show that flows can in fact be extended to…
We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members. This result directly implies a known lower bound on…
We study polytopes defined by inequalities of the form $\sum_{i\in I} z_{i}\leq 1$ for $I\subseteq [d]$ and nonnegative $z_i$ where the inequalities can be reordered into a matrix inequality involving a column-convex $\{0,1\}$-matrix. These…
Network coding (NC), when combined with multipath routing, enables a linear programming (LP) formulation for a multi-source multicast with intra-session network coding (MISNC) problem. However, it is still hard to solve using conventional…