𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient search procedures for extreme pollutant values

✍ Scribed by Don Casey; Peter N. Nemetz; Dean Uyeno


Book ID
104755222
Publisher
Springer
Year
1985
Tongue
English
Weight
631 KB
Volume
5
Category
Article
ISSN
0167-6369

No coin nor oath required. For personal study only.

✦ Synopsis


Extreme pollutant values are of great interest in water quality monitoring because of their frequent toxicological significance. The principal barrier to the detection of these values, however, is the cost of extensive and comprehensive monitoring. This paper demonstrates an efficient method to determine the maximum sample measurement from a finite set of sequential samples without explicitly testing them all. It is assumed that the process of sample measurement is distinct from collection and has higher costs. It is further assumed that the measurements have high positive autocorrelation.

A methodology is presented based on a common industrial testing procedure referred to as composite samplingthe physical pooling or compositing of a set of sequential samples before measurement. A method known as primary first order compositing (PFOC) was found to be superior to the traditional technique of random sampling, particularly if small composite sizes are utilized.


πŸ“œ SIMILAR VOLUMES


Epcot: An efficient procedure for colori
✍ N. Dubois; D. de Werra πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 707 KB

We present an exact procedure for coloring the nodes of s graph with as few colors as possible. The problem o~ deciding whether an arbitrary graph can be colored with k colars is NP-complete. The procedure is based ms an implicit enumm'&tion technique. At some stsgrs of the algorithm heuristic metho

An efficient tabu search procedure for t
✍ Erik Rolland; David A. Schilling; John R. Current πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 944 KB

In this paper we present a new solution heuristic for the p-Median Problem. The algorithm is based on tabu search principles, and uses short term and long term memory, as well as strategic oscillation and random tabu list sizes. Our proposed procedure is compared with two other move heuristics: a we