Particulate Backscattering Ratio at Leo 15 and Its Use to Study Particle Composition and Distribution

Particulate scattering and backscattering are two quantities that have traditionally been used to quantify in situ particulate concentration. The ratio of the backscattering by particles to total scattering by particles (the particulate backscattering ratio) is weakly dependent on concentration and therefore provides us with information on the characteristics of the particulate material, such as the index of refraction. The index of refraction is an indicator of the bulk particulate composition, as inorganic minerals have high indices of refraction relative to oceanic organic particles such as phytoplankton and detrital material that typically have a high water content. We use measurements collected near the Rutgers University Long-term Ecosystem Observatory in 15 m of water in the Mid-Atlantic Bight to examine application of the backscattering ratio. Using four different instruments, the HOBILabs Hydroscat-6, the WETLabs ac-9 and EcoVSF, and a prototype VSF meter, three estimates of the ratio of the particulate backscattering ratio were obtained and found to compare well. This is remarkable because these are new instruments with large differences in design and calibration. The backscattering ratio is used to map different types of particles in the nearshore region, suggesting that it may act as a tracer of water movement. We find a significant relationship between the backscattering ratio and the ratio of chlorophyll to beam attenuation. This implies that these more traditional measurements may be used to identify when phytoplankton or inorganic particles dominate. In addition, it provides an independent confirmation of the link between the backscattering ratio and the bulk composition of particles.

A Mathematical Model for Simplifying Representations of Objects in a Geographic Information System

The study of operations on representations of objects is well documented in the realm of spatial engineering. However, the mathematical structure and formal proof of these operational phenomena are not thoroughly explored. Other works have often focused on query-based models that seek to order classes and instances of objects in the form of semantic hierarchies or graphs. In some models, nodes of graphs represent objects and are connected by edges that represent different types of coarsening operators. This work, however, studies how the coarsening operator "simplification" can manipulate partitions of finite sets, independent from objects and their attributes. Partitions that are "simplified first have a collection of elements filtered (removed), and then the remaining partition is amalgamated (some sub-collections are unified). Simplification has many interesting mathematical properties. A finite composition of simplifications can also be accomplished with some single simplification. Also, if one partition is a simplification of the other, the simplified partition is defined to be less than the other partition according to the simp relation. This relation is shown to be a partial-order relation based on simplification. Collections of partitions can not only be proven to have a partial- order structure, but also have a lattice structure and are complete. In regard to a geographic information system (GIs), partitions related to subsets of attribute domains for objects are called views. Objects belong to different views based whether or not their attribute values lie in the underlying view domain. Given a particular view, objects with their attribute n-tuple codings contained in the view are part of the actualization set on views, and objects are labeled according to the particular subset of the view in which their coding lies. Though the scope of the work does not mainly focus on queries related directly to geographic objects, it provides verification for the existence of particular views in a system with this underlying structure. Given a finite attribute domain, one can say with mathematical certainty that different views of objects are partially ordered by simplification, and every collection of views has a greatest lower bound and least upper bound, which provides the validity for exploring queries in this regard.