Relating Crevassing to Non-Linear Strain in the Floating Part of Jakobshavn Isbrae, West Greenland

Jakobshavn Isbrae is a major ice stream that drains the west-central Greenland ice sheet and becomes afloat in Jakobshavn Isfiord (69degreesN, 49degreesW), where it has maintained the world's fastest-known sustained velocity and calving rate (7 km a(-1)) for at least four decades. The floating portion is approximately 12 km long and 6 km wide. Surface elevations and motion vectors were determined photogrammetrically for about 500 crevasses on the floating ice, and adjacent grounded ice, using aerial photographs obtained 2 weeks apart in July 1985. Surface strain rates were computed from a mesh of 399 quadrilateral elements having velocity measurements at each corner. It is shown that heavy crevassing of floating ice invalidates the assumptions of linear strain theory that (i) surface strain in the floating ice is homogeneous in both space and time, (ii) the squares and products of strain components are nil, and (iii) first- and second-order rotation components are small compared to strain components. Therefore, strain rates and rotation rates were also computed using non-linear strain theory. The percentage difference between computed linear and non-linear second invariants of strain rate per element were greatest (mostly in the range 40-70%) where crevassing is greatest. Isopleths of strain rate parallel and transverse to flow and elevation isopleths relate crevassing to known and inferred pinning points.

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.