No description available.

The goal of this thesis is to study and model the Diel Vertical Migration (DVM) pattern using machine learning methods. We choose an Almost Periodic Function as the mathematical model and fit the monthly averaged migration data into a 5-term Fourier series whose coefficients and frequency are functions of time. The resulting function captures the general characteristics of the DVM pattern whose period is similar yet undergoes gradual changes over time. Further correlation analyses show that the monthly averaged distribution of zooplankton and various environmental factors are strongly correlated. Therefore, we adjust the function so that the coefficients and frequency are functions of environmental factors. Besides, we also examine the pattern on finer time scales using classification algorithms. We build classifiers which predict zooplankton existence at different depths based on a set of environmental measurements. Experiments demonstrate that both of the above methods are valid in modeling the DVM pattern.

No description available.

Thesis (M App Sci) -- University of South Australia, 1992

Thesis (M.App.Sc. (Physio))--University of South Australia, 1998.

Thesis (M.S.)--University of Delaware, 2008. / Principal faculty advisor: Thomas Ilvento, Dept. of Food & Resource Economics. Includes bibliographical references.

Thesis (Ph. D.)--University of Washington, 2004. / Vita. Includes bibliographical references (p. 91-94).

Thesis (M.A.)--University of Wyoming, 2008. / Title from PDF title page (viewed on Mar. 23, 2010). Includes bibliographical references (p. 93-94).

For nearly three centuries mathematicians have been interested in polygons which simultaneously circumscribe and inscribe quadrics. They have shown in many contexts (real, complex, non-euclidean, higher dimensional, etc.) that such polygons may be ``rotated'' while maintaining their circum-inscribed quality. Of particular interest has been conditions on the quadrics which guarantee the existence of such polygons. In 1854 Arthur Cayley provided conditions for closure general to polygons of any size in the complex projective plane. We show that under suitable circumstances the curve, defined by Cayley's conditions, on a fibration of Jacobians over the space of families of quadrics is a reducible curve, particularly in genus two. We may infer additional information about points of finite order on the Jacobians based on the component of the reducible curve in which they lie. Using this information we are able to accomplish two tasks. First we provide sufficient closure conditions for Poncelet's Great Theorem in which each vertex of the polygon lies on a distinct quadric. Next, for a polygon circum-inscribed in quadrics in ℙ^3, we provide additional sufficient conditions for closure beyond what mathematicians had previously believed to be necessary and sufficient.

Let K be a non-standard fractal Koch curve with contraction factor α. Assume α is of the form α = 2+1/m for some m ∈ N and that K is embedded in a larger domain Ω. Further suppose that u is any Hölder continuous function on K. Then for each such m ∈ N and iteration n ≥ 0, we construct a bounded linear operator Πn which extends u from the prefractal Koch curve Kn into the whole of Ω. Unfortunately, our sequence of extension functions Πnu are not bounded in norm in the limit because the upper bound is a strictly increasing function of n; this prevents us from demonstrating uniform convergence in the limit.