Theodore S. Switzer, Sean F. Keenan, Kevin A. Thompson
et al.
Abstract Objective Since 2010, three spatially disjunct reef fish video surveys have provided fishery-independent data critical to the assessment and management of reef fishes in the Gulf of Mexico. Although analytical approaches have recently been developed to integrate data from these surveys into a single measure of relative abundance and size composition, a more parsimonious approach would be to integrate survey efforts under a single Gulf-wide survey design. Accordingly, we conducted a retrospective analysis of historical video- and habitat-mapping data to develop a novel stratified random sampling design for conducting surveys of natural and artificial reef habitats. Methods We conducted a series of classification and regression tree analyses to delineate both spatial and habitat strata, and conducted simulations to assess the performance of an optimized survey design. Result Spatially, classification and regression tree results identified three depth strata (10–25 m, >25–50 m, >50–180 m) and three regional strata (north-central Gulf, Big Bend, southwest Florida) in the eastern Gulf. For both natural and artificial reefs, habitat strata were delineated based on a combination of relative relief (low, medium, high) and size of the individual reef feature, although reef scale differed markedly between natural (<100 m2, 100–1000 m2, >1000 m2) and artificial habitats (<25 m2, 25–100 m2, >100 m2). To optimize effort among sampling strata, effort was allocated proportionally based on a combination of habitat availability and managed-species richness for each stratum. Simulation results indicated that relative median biases were <10% and relative median absolute deviations <30% on estimates of abundance for most species examined on natural reefs under the optimal design, except Greater Amberjack Seriola dumerili. These measures of bias and imprecision were similar or higher for most species simulated using simple random and stratified random survey designs. Estimated relative median bias and relative median absolute deviations were notably higher for artificial reef surveys. Conclusion Based on these results, survey efforts were integrated as the Gulf Fishery Independent Survey of Habitat and Ecosystem Resources (G-FISHER) in 2020.
We show that bounded-error affine finite automata recognize uncountably many (and so some non-Turing recognizable) languages when using real-valued transitions.
We describe Hilbert's spacefilling curve in several different ways: as an automatic sequence of directions,as a regular and synchronized sequence of coordinates of lattice points encountered, and as an automatic bitmap image.
This is a brief note on the lower bound of bimachines. Particularly, we report that there is a class of functional transducers with $O(n)$ states that do not admit a bimachine with fewer than $Θ(2^n)$ states.
This paper describes a construction of supermartingales realized as automatic functions. A capital of supermartingales is represented using automatic capital groups~(ACG). Properties of these automatic supermartingales are then studied. Automatic supermartingales induce a notion of random infinite binary sequence. We show that the class of random sequences coincide with that of disjunctive sequences.
We introduce here the notion of syntactic lattice algebra which is an analogy of the syntactic monoid and of the syntactic semiring. We present a unified approach to get those three structures.
We characterize the finite sets S of words such that that the iterated shuffle of S is co-finite and we give some bounds on the length of a longest word not in the iterated shuffle of S.
In this paper we propose a research programme for getting structural characterisations for 2-dimensional languages generated by self-assembling tiles. This is part of a larger programme on getting a formal foundation of parallel, interactive, distributed systems.
Automata operating on general graphs have been introduced by virtue of graphoids. In this paper we construct a graph automaton that recognizes $k$-colorable graphs.
In this paper we study the word problem of groups corresponding to tessellations of the hyperbolic plane. In particular using the Fibonacci technology developed by the second author we show that groups corresponding to the pentagrid or the heptagrid are not automatic.
This paper summarizes the fundamental expressiveness, closure, and decidability properties of various finite-state automata classes with multiple input tapes. It also includes an original algorithm for the intersection of one-way nondeterministic finite-state automata.
We resolve an open question by determining matching (asymptotic) upper and lower bounds on the state complexity of the operation that sends a language L to (c(L*))*, where c() denotes complement.