Matching Items (2)
Filtering by

Clear all filters

151618-Thumbnail Image.png

Implementing rapid assessment of the trail environments of arid regions: indicator development and implementation scenarios

Description
As part of the effort to streamline management efforts in protected areas worldwide and assist accountability reporting, new techniques to help guide conservation goals and monitor progress are needed. Rapid assessment is recognized as a field-level data collection technique, but each rapid assessment index is limited to only the ecoregion…

As part of the effort to streamline management efforts in protected areas worldwide and assist accountability reporting, new techniques to help guide conservation goals and monitor progress are needed. Rapid assessment is recognized as a field-level data collection technique, but each rapid assessment index is limited to only the ecoregion for which it is designed. This dissertation contributes to the existing bodies of conservation monitoring and tourism management literature in four ways: (i.) Indicators are developed for rapid assessment in arid and semi-arid regions, and the processes by which new indicators should be developed is explained; (ii.) Interpolation of surveyed data is explored as a step in the analysis process of a dataset collected through rapid assessment; (iii.) Viewshed is used to explore differences in impacts at two study sites and its underutilization in this context of conservation management is explored; and (iv.) A crowdsourcing tool to distribute the effort of monitoring trail areas is developed and deployed, and the results are used to explore this data collection's usefulness as a management tool.
ContributorsGutbrod, Elyssa (Author) / Dorn, Ronald I. (Thesis advisor) / Cerveny, Niccole (Committee member) / Whitley, David (Committee member) / Wentz, Elizabeth (Committee member) / Arizona State University (Publisher)
Created2013
148057-Thumbnail Image.png

Optimal Sampling for Function Approximation

Description

This thesis project focuses on algorithms that generate good sampling points for function approximation. In one dimension, polynomial interpolation using equispaced points is unstable, with high Oscillations near the endpoints of the interpolated interval. On the other hand, Chebyshev nodes provide both stable and highly accurate points for polynomial…

This thesis project focuses on algorithms that generate good sampling points for function approximation. In one dimension, polynomial interpolation using equispaced points is unstable, with high Oscillations near the endpoints of the interpolated interval. On the other hand, Chebyshev nodes provide both stable and highly accurate points for polynomial interpolation. In higher dimensions, optimal sampling points are unknown. This project addresses this problem by finding algorithms that are robust in various domains for polynomial interpolation and least-squares. To measure the quality of the nodes produced by said algorithms, the Lebesgue constant will be used. In the algorithms, a number of numerical techniques will be used, such as the Gram-Schmidt process and the pivoted-QR process. In addition, concepts such as node density and greedy algorithms will be explored.
ContributorsGuo, Maosheng (Author) / Platte, Rodrigo (Thesis director) / Welfert, Bruno (Committee member) / School of Mathematical and Statistical Sciences (Contributor, Contributor) / Department of Physics (Contributor) / Barrett, The Honors College (Contributor)
Created2021-05