Simulation of Ground-Water Flow in the Cedar River Alluvial Aquifer Flow System, Cedar Rapids, Iowa Scientific

The Cedar River alluvial aquifer is the primary source of municipal water in the Cedar Rapids, Iowa, area. Since 1992, the U.S. Geological Survey, in cooperation with the City of Cedar Rapids, has investigated the hydrogeology and water quality of the Cedar River alluvial aquifer. This report describes a detailed analysis of the ground-water flow system in the alluvial aquifer, particularly near well field areas. The ground-water flow system in the Cedar Rapids area consists of two main components, the unconsolidated Quaternary deposits and the underlying carbonate bedrock that has a variable fracture density. Quaternary deposits consist of eolian sand, loess, alluvium, and glacial till. Devonian and Silurian bedrock aquifers overlie the Maquoketa Shale (Formation) of Ordovician age, a regional confining unit. Ground-water and surface-water data were collected during the study to better define the hydrogeology of the Cedar River alluvial aquifer and Devonian and Silurian aquifers. Stream stage and discharge, ground-water levels, and estimates of aquifer hydraulic properties were used to develop a conceptual ground-water flow model and to construct and calibrate a model of the flow system. This model was used to quantify the movement of water between the various components of the alluvial aquifer flow system and provide an improved understanding of the hydrology of the alluvial aquifer.

Hydrogeologic Setting and Ground-Water Flow Simulations of the Eastern High Plains Regional Study Area, Nebraska

The transport of anthropogenic and natural contaminants to public-supply wells was evaluated in a part of the High Plains aquifer near York, Nebraska, as part of the U.S. Geological Survey National Water-Quality Assessment Program. The aquifer in the Eastern High Plains regional study area is composed of Quaternary alluvial deposits typical of the High Plains aquifer in eastern Nebraska and Kansas, is an important water source for agricultural irrigation and public water supply, and is susceptible and vulnerable to contamination. A six-layer, steady-state ground-water flow model of the High Plains aquifer near York, Nebraska, was constructed and calibrated to average conditions for the time period from 1997 to 2001. The calibrated model and advective particle-tracking simulations were used to compute areas contributing recharge and travel times from recharge areas to selected public-supply wells. Model results indicate recharge from agricultural irrigation return flow and precipitation (about 89 percent of inflow) provides most of the ground-water inflow, whereas the majority of ground-water discharge is to pumping wells (about 78 percent of outflow). Particle-tracking results indicate areas contributing recharge to public-supply wells extend northwest because of the natural ground-water gradient from the northwest to the southeast across the study area. Particle-tracking simulations indicate most ground-water travel times from areas contributing recharge range from 20 to more than 100 years but that some ground water, especially that in the lower confined unit, originates at the upgradient model boundary instead of at the water table in the study area and has travel times of thousands of years.

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time solvable while integer versions are NP-complete. However, exact algorithms to solve the fractional MF problems have high computational complexity. Therefore approximation algorithms to solve the fractional MF problems have been explored in the literature to reduce their computational complexity. Using these approximation algorithms and the randomized rounding technique, polynomial time approximation algorithms have been explored in the literature. In the design of high-speed networks, such as optical wavelength division multiplexing (WDM) networks, providing survivability carries great significance. Survivability is the ability of the network to recover from failures. It further increases the complexity of network design and presents network designers with more formidable challenges. In this work we formulate the survivable versions of the MF problems. We build approximation algorithms for the survivable multicommodity flow (SMF) problems based on the framework of the approximation algorithms for the MF problems presented in [1] and [2]. We discuss applications of the SMF problems to solve survivable routing in capacitated networks.