24 research outputs found

    A road map for designing and implementing a biological monitoring program

    Get PDF
    Designing and implementing natural resource monitoring is a challenging endeavor undertaken by many agencies, NGOs, and citizen groups worldwide. Yet many monitoring programs fail to deliver useful information for a variety of administrative (staffing, documentation, and funding) or technical (sampling design and data analysis) reasons. Programs risk failure if they lack a clear motivating problem or question, explicit objectives linked to this problem or question, and a comprehensive conceptual model of the system under study. Designers must consider what “success” looks like from a resource management perspective, how desired outcomes translate to appropriate attributes to monitor, and how they will be measured. All such efforts should be filtered through the question “Why is this important?” Failing to address these considerations will produce a program that fails to deliver the desired information. We addressed these issues through creation of a “road map” for designing and implementing a monitoring program, synthesizing multiple aspects of a monitoring program into a single, overarching framework. The road map emphasizes linkages among core decisions to ensure alignment of all components, from problem framing through technical details of data collection and analysis, to program administration. Following this framework will help avoid common pitfalls, keep projects on track and budgets realistic, and aid in program evaluations. The road map has proved useful for monitoring by individuals and teams, those planning new monitoring, and those reviewing existing monitoring and for staff with a wide range of technical and scientific skills

    Fault-induced seismic anisotropy by hydration in subducting oceanic plates

    No full text
    International audienceThe variation of elastic- wave velocities as a function of the direction of propagation through the Earth's interior is a widely documented phenomenon called seismic anisotropy. The geometry and amount of seismic anisotropy is generally estimated by measuring shearwave splitting, which consists of determining the polarization direction of the fast shear- wave component and the time delay between the fast and slow, orthogonally polarized, waves. In subduction zones, the teleseismic fast shear- wave component is oriented generally parallel to the strike of the trench(1), although a few exceptions have been reported (Cascadia(2) and restricted areas of South America(3,4)). The interpretation of shear- wave splitting above subduction zones has been controversial and none of the inferred models seems to be sufficiently complete to explain the entire range of anisotropic patterns registered worldwide(1). Here we show that the amount and the geometry of seismic anisotropies measured in the forearc regions of subduction zones strongly depend on the preferred orientation of hydrated faults in the subducting oceanic plate. The anisotropy originates from the crystallographic preferred orientation of highly anisotropic hydrous minerals (serpentine and talc) formed along steeply dipping faults and from the larger- scale vertical layering consisting of dry and hydrated crust - mantle sections whose spacing is several times smaller than teleseismic wavelengths. Fault orientations and estimated delay times are consistent with the observed shear- wave splitting patterns in most subduction zones

    Feedback Set Problems

    No full text
    . This paper is a short survey of feedback set problems. It will be published in Encyclopedia of Optimization, Kluwer Academic Publishers, 2000. 1. INTRODUCTION In recent years feedback set problems have been the subject of growing interest. They have found applications in many fields, including deadlock prevention [89], program verification [78], and Bayesian inference [2]. Therefore, it is natural that in the past few years there have been intensive efforts on exact and approximation algorithms for these kinds of problems. Exact algorithms have been proposed for solving the problems restricted to special classes of graphs as well as several approximation algorithms with provable bounds for the cases that are not known to be polynomially solvable. The most general feedback set problem consists in finding a minimum-weight (or minimum cardinality) set of vertices (arcs) that meets all cycles in a collection C of cycles in a graph (G,w), where w is a nonnegative function defined on th..
    corecore