Thesis (M.A.)--West Virginia University, 2003. / Title from document title page. Document formatted into pages; contains vii, 56 p. : ill. (some col.), maps (some col.). Vita. Includes abstract. Includes bibliographical references (p. 50-55).

Thesis (Ph. D.)--University of Hong Kong, 1989.

Thesis (Ph. D.)--University of Hong Kong, 1988.

ITC/USA 2012 Conference Proceedings / The Forty-Eighth Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2012 / Town and Country Resort & Convention Center, San Diego, California / This paper discusses the current development of all-in-one telemetry displays. This system provides a self-configuring environment utilizing common telemetry display objects that setup and deploy. Often range display systems require frequent revision to reason with changing requirements. The display is rendered accordingly as a strip-chart equivalent or other element, per requirements from a flight safety officer for example. Our reusable code system approach is based on a novel abstraction of the display elements. The approach may be deployed beyond the decommutation stage as is typically done or interface directly to a plug in software decommutator. This system's plug-and-play functionality facilitates rapid deployment of interoperable Department of Defense (DOD) range displays and recorders.

An algorithm which adopts a moving cone approach but is guided by maximal network flow principles is developed. This study argues that from a network flow point of view, the re-allocation problem is a major obstacle to prevent a simulation oriented pit design algorithm from reaching the optimum solution. A simulation oriented pit design algorithm can not resolve the re-allocation problem entirely without explicit definition of predecessors and successors. In order to preserve the advantages of moving cone algorithm and to improve the moving cone algorithm, the new algorithm trys to avoid the re-allocation situations. Theoretical proof indicates that the new algorithm can consistently generate higher profit than the popular moving cone algorithm. A case study indicates that the new algorithm improved over the moving cone algorithm (1% more profit). Also, the difference between the new algorithm and the rigorous Lerchs-Grossmann algorithm in terms of generated profit is very insignificant (0.015% less). The new algorithm is only 2.08 times slower than the extremely fast moving cone algorithm. This study also presents a multi-period 0-1 programming mine sequencing model. Once pushbacks are generated and the materials between a series of cutoffs are available for each bench of every pushback, the model can quickly answer, period by period, what is the best (maximum or minimum) that can be expected on any one of these four items: mineral contents, ore tonnages, waste tonnages and stripping ratios. This answer is based on a selected cutoff and considers the production capacity defined by the ore tonnage, the desired stripping ratio and the precedence constraints among benches and pushbacks. The maximization of mineral contents is suggested to be the direct mine sequencing objective when it is permissible. Suggestions also are provided on how to reduce the number of decision variables and how to reduce the number of precedence constraints. A case study reveals that the model is fast and operational. The maximization of mineral contents increases the average grades in early planning periods.

published_or_final_version / Civil and Structural Engineering / Doctoral / Doctor of Philosophy

published_or_final_version / Civil and Structural Engineering / Doctoral / Doctor of Philosophy

This second volume, Southern Paiute History and Place Names, draws upon historical accounts, diaries, and oral histories to document Southern Paiute occupation and use of the Arizona Strip from the time of European and Euro-American contact until the middle of the twentieth century. It also includes Paiute names for 148 places on and in the vicinity of the Arizona Strip. These names were culled from written sources, matched where possible with a current official name (recorded in the United States Geological Survey Place Names database), and translated. All names were reviewed by a team of Paiute elders in the presence of a linguist and two ethnographers. Also included are stories related to some of the named places. The stories were taken from both archival sources and oral history interviews.

This file contains a sample of photographs taken during the Arizona Strip Landscapes and Place Name Study(2003-2004). The photographs in this slideshow provide the viewer with an overview of places visited and resources examined during this study.

This presentation is was given at the Great Basin Conference in 2004 in Las Vegas, Nevada. This talk presents key findings from the 2005 report: Yanawant: Paiute Places and Landscapes in the Arizona Strip Volume One of the Arizona Strip Landscapes and Place Name Study (Stoffle et al. 2005). This talk focuses on pilgrimage trails in the Arizona Strip.