2 resultados para Filtered SVD

em DigitalCommons - The University of Maine Research


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissolved organic matter (DOM) dynamics during storm events has received considerable attention in forested watersheds, but the extent to which storms impart rapid changes in DOM concentration and composition in highly disturbed agricultural watersheds remains poorly understood. In this study, we used identical in situ optical sensors for DOM fluorescence (FDOM) with and without filtration to continuously evaluate surface water DOM dynamics in a 415 km(2) agricultural watershed over a 4 week period containing a short-duration rainfall event. Peak turbidity preceded peak discharge by 4 h and increased by over 2 orders of magnitude, while the peak filtered FDOM lagged behind peak turbidity by 15 h. FDOM values reported using the filtered in situ fluorometer increased nearly fourfold and were highly correlated with dissolved organic carbon (DOC) concentrations (r(2) = 0.97), providing a highly resolved proxy for DOC throughout the study period. Discrete optical properties including specific UV absorbance (SUVA(254)), spectral slope (S(290-350)), and fluorescence index (FI) were also strongly correlated with in situ FDOM and indicate a shift toward aromatic, high molecular weight DOM from terrestrially derived sources during the storm. The lag of the peak in FDOM behind peak discharge presumably reflects the draining of watershed soils from natural and agricultural landscapes. Field and experimental evidence showed that unfiltered FDOM measurements underestimated filtered FDOM concentrations by up to similar to 60% at particle concentrations typical of many riverine systems during hydrologic events. Together, laboratory and in situ data provide insights into the timing and magnitude of changes in DOM quantity and quality during storm events in an agricultural watershed, and indicate the need for sample filtration in systems with moderate to high suspended sediment loads.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

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.