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.

Response of a First-Order Stream in Maine to Short-Term In-Stream Acidification

An experimental short-term acidification with HCl at a first-order stream in central Maine, USA was used to study processes controlling the changes in stream chemistry and to assess the ability of stream substrate to buffer pH. The streambed exerted a strong buffering capacity against pH change by ion exchange during the 6-hour acidification. Streambed substrates had substantial cation and anion exchange capacity in the pH range of 4.1 to 6.5. The ion exchange for cations and SO42- were rapid and reversible. The speed of release of cations from stream substrates was Na1+ > Ca2+ > Mg2+ > Aln+ > Be2+, perhaps relating to charge density of these cations. Ca2+ desorption dominated neutralisation of excess H+ for the first 2 hr. As the reservoir of exchangeable Ca diminished, desorption land possibly dissolution) of Al3+ became the dominant neutralising mechanism. The exchangeable land possibly soluble) reservoir of Al was not depleted during the 6-hour acidification. Sulphate adsorption during the acidification reduced the concentration of SO42- in stream water by as much as 20 mu eq L-1 (from 70 mu eq L-1). Desorption of SO42- and adsorption of base cat ions after the artificial acidification resulted in a prolongation of the pH depression. The streambed had the capacity to buffer stream water chemistry significantly during an acidifying event affecting the entire upstream catchment.