More Like this
-
Abstract Intermittent streams currently constitute >50% of the global river network, and the number of intermittent streams is expected to increase due to changes in land use and climate. Surface flows are known to expand and contract within the headwater channel network due to changes in the water table driven by climate, often changing seasonally. However, the underlying causes of disconnections and reconnections throughout the stream network remain poorly understood and may reflect subsurface flow capacity. We assess how 3D subsurface flowpaths control local surface flows at Gibson Jack Creek in the Rocky Mountains, Idaho, USA. Water table dynamics, hydraulic gradients, and hyporheic exchange were monitored along a 200‐m section of the stream throughout the seasonal recession in WY2018. Shallow lateral hillslope‐riparian‐stream connectivity was more frequent in transects spanning perennially flowing stream reaches than intermittent reaches. During low‐flow periods, larger losing vertical hydraulic gradients were observed in paired piezometers in intermittent reaches than in adjacent perennial reaches. Contrary to dominant conceptual models, longitudinal measurements of hydrologic exchange in both intermittent and perennial reaches were seasonally variable except for one perennial reach that showed consistent significant gains. Observed drying dynamics, as well as subsurface pathways, were highly variable even over short distances (30 m). Flow probability and subsurface flow capacity at upstream locations can be assessed with an outlet hydrograph and upstream flow measurements. Accurate characterization of subsurface storage, discharge, and connection is critical to understanding the drivers of drying cycles in intermittent streams and their likely responses to future change.
-
We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in m^{1+o(1)} time. Our algorithm builds the flow through a sequence of m^{1+o(1)} approximate undirected minimum-ratio cycles, each of which is computed and processed in amortized m^{o(1)} time using a new dynamic graph data structure. Our framework extends to algorithms running in m^{1+o(1)} time for computing flows that minimize general edge-separable convex functions to high accuracy. This gives almost-linear time algorithms for several problems including entropy-regularized optimal transport, matrix scaling, p-norm flows, and p-norm isotonic regression on arbitrary directed acyclic graphs.more » « less