What Limits Bacterial Production in the Suboxic Region of Permanently Ice-Covered Lake Bonney, Antarctica?

Bacterial production assays (thymidine incorporation rates) were used to evaluate the activity of heterotrophic bacteria at the chemocline region in both the East (ELB) and West (WLB) Lobes of permanently ice-covered Lake Bonney, in the Taylor Valley of Antarctica. The magnitude of activity varied dramatically within the depth interval of 1 to 2 m from moderate to very low levels below the chemocline, especially in the East Lobe, where chemical distributions indicate the absence of a normally functioning nitrogen cycle. Several parameters (e.g. addition of nutrients or chelators, dilution) were manipulated in incubation experiments in order to identify factors that would enhance activity in the suboxic deep waters of the East Lobe. Activity, in terms of thymidine incorporation, was consistently detected in the deep-water communities, implying that, although the water may be 'toxic', the cells remain viable. None of the treatments resulted in consistent enhancement of thymidine incorporation rates in samples from below the chemocline. Bacterial populations above the chemocline appear to be phosphorus-limited. The nature of the limitation, toxicity or inhibition that limits bacterial activity in the suboxic waters has not been identified.

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.