Atmospheric transport and diffusion models have been developed by the Environmental Technology Section (ETS) of the Savannah River Technology Center to calculate the location and concentration of toxic or radioactive materials during an accidental release at the Savannah River Site (SRS). The output from these models has been used to support initial on-site and off-site emergency response activities such as protective action decision making and field monitoring coordination. These atmospheric transport and diffusion models have been incorporated into an automated computer-based system called the (Weather Information and Display) System and linked to real-time meteorological and radiological monitoring instruments to provide timely information for these emergency response activities (Hunter, 1990). This study will compare two of the WIND System annospheric models, PUFF/PLUME and 2DPUF, with a select group of MATS experiments and examine the results in detail to determine the performance of the models. Additional results from this study can be found in Fast et al. (1991).

Atmospheric transport and diffusion models have been developed by the Environmental Technology Section (ETS) of the Savannah River Technology Center to calculate the location and concentration of toxic or radioactive materials during an accidental release at the Savannah River Site (SRS). The output from these models has been used to support initial on-site and off-site emergency response activities such as protective action decision making and field monitoring coordination. These atmospheric transport and diffusion models have been incorporated into an automated computer-based system called the (Weather Information and Display) System and linked to real-time meteorological and radiological monitoring instruments to provide timely information for these emergency response activities (Hunter, 1990). This study will compare two of the WIND System annospheric models, PUFF/PLUME and 2DPUF, with a select group of MATS experiments and examine the results in detail to determine the performance of the models. Additional results from this study can be found in Fast et al. (1991).

A complete edge-weighted directed graph on vertices 1,2,...,n that assigns cost c(i,j) to the edge (i,j) is called Monge if its edge costs form a Monge array, i.e., for all i < k and j < l, c[i, j]+c[k,l]{le} < c[i,l]+c[k,j]. One reason Monge graphs are interesting is that shortest paths can be computed quite quickly in such graphs. In particular, Wilber showed that the shortest path from vertex 1 to vertex n of a Monge graph can be computed in O(n) time, and Aggarwal, Klawe, Moran, Shor, and Wilber showed that the shortest d-edge 1-to-n path (i.e., the shortest path among all 1-to-n paths with exactly d edges) can be computed in O(dn) time. This paper`s contribution is a new algorithm for the latter problem. Assuming 0 {le} c[i,j] {le} U and c[i,j + 1] + c[i + 1,j] {minus} c[i,j] {minus} c[i + 1, j + 1] {ge} L > 0 for all i and j, our algorithm runs in O(n(1 + 1g(U/L))) time. Thus, when d {much_gt} 1 + 1g(U/L), our algorithm represents a significant improvement over Aggarwal et al.`s O(dn)-time algorithm. We also present several applications of our algorithm; they include length-limited Huffman coding, finding the …