My WebLink
|
Help
|
About
|
Sign Out
Home
Browse
Search
WSP11570
CWCB
>
Water Supply Protection
>
Backfile
>
11000-11999
>
WSP11570
Metadata
Thumbnails
Annotations
Entry Properties
Last modified
1/26/2010 3:18:03 PM
Creation date
10/12/2006 5:03:24 AM
Metadata
Fields
Template:
Water Supply Protection
File Number
8111.807
Description
Arkansas River Compact Administration - Stream Gage Evaluation
Basin
Arkansas
Date
1/1/1980
Author
USGS
Title
Cost-Effective Stream Gaging Strategies for the Lower Colorado River
Water Supply Pro - Doc Type
Publication
There are no annotations on this page.
Document management portal powered by Laserfiche WebLink 9 © 1998-2015
Laserfiche.
All rights reserved.
/
130
PDF
Print
Pages to print
Enter page numbers and/or page ranges separated by commas. For example, 1,3,5-12.
After downloading, print the document using a PDF reader (e.g. Adobe Reader).
Show annotations
View images
View plain text
<br />I <br /> <br />The third step is to define the uncertainty in annual mean discharge <br /> <br /> <br />I <br /> <br />I <br /> <br />as a function of the number of visits for each of the stream gage1. This <br /> <br />I <br />I <br /> <br />step is discussed in detail in a subsequent section of this report. <br /> <br />The final step is to use all of the above to determine the number of <br /> <br />times, N., that each of the NR routes is used during a year such that (1) <br />1- <br />the budget for the network is not exceeded, (2) the minimum number of <br /> <br />I <br /> <br />visits to each station is made, and (3) the total uncertainty in the network <br /> <br />I <br /> <br />is minimum. Figure 2 presents this step in the form of a mathematical <br /> <br />program. <br /> <br />I <br /> <br />In its simplest form the function relating uncertainty at a stream gage <br /> <br />to the number of visits to the gage is <br /> <br />I <br /> <br />I <br /> <br />2 <br />cr. <br />$ .(M.) ~ dl-1 (1) <br />J J J'j <br /> <br />where cr.2 is the variance of an independent series of streamflows that <br />J <br /> <br />I <br /> <br />comprise the annual streamflow record and M. is the number of visits. In <br />J <br /> <br />the real world streamflows are not independent in time; the streamflow at <br /> <br />I <br /> <br />one instant gives a good indication of what streamflow will be one minute <br /> <br />I <br /> <br />later and maybe even a day or a week hence. Accounting for the temporal <br /> <br />dependence of streamflow results in a form of~.(M.) that is more complex <br />J J <br /> <br />I <br /> <br />than equation 1, but uncertainty is still inversely related to the number of <br /> <br />visits to the station. This inverse relation, which is nonlinear, precludes <br /> <br />I <br /> <br />the use of classical operations research techniques such as integer programming <br /> <br />I <br /> <br />(Wagner, 1969) to solve for the best set of decisions, N*, on how often to use <br /> <br />each of the stream gaging routes. Therefore, a direct-search technique was <br /> <br />I <br /> <br />used to specify the values of N* that met all of the criteria described in <br /> <br /> <br />figure 2. <br /> <br />Figure 3 presents) a tabular layout of the problem. <br />, <br />I <br /> <br />Each of the <br /> <br />I <br /> <br />10 <br /> <br />I <br /> <br />I <br />I <br />i <br />r <br />
The URL can be used to link to this page
Your browser does not support the video tag.