Map Calculus in GIS: a proposal and demonstration

This paper provides a new representation for fields (continuous surfaces) in Geographical Information Systems (GIS), based on the notion of spatial functions and their combinations. Following Tomlin's (1990) Map Algebra, the term 'Map Calculus' is used for this new representation. In Map Calculus, GIS layers are stored as functions, and new layers can be created by combinations of other functions. This paper explains the principles of Map Calculus and demonstrates the creation of function-based layers and their supporting management mechanism. The proposal is based on Church's (1941) Lambda Calculus and elements of functional computer languages (such as Lisp or Scheme)

Integral Bases for the Universal Enveloping Algebras of Map Algebras

Given a finite-dimensional, complex simple Lie algebra we exhibit an integral form for the universal enveloping algebra of its map algebra, and an explicit integral basis for this integral form. We also produce explicit commutation formulas in the universal enveloping algebras of the map algebras of sl_2 that allow us to write certain elements in Poincare-Birkhoff-Witt order.Comment: 20 page

Extensions and block decompositions for finite-dimensional representations of equivariant map algebras

Suppose a finite group acts on a scheme $X$ and a finite-dimensional Lie algebra $\mathfrak{g}$. The associated equivariant map algebra is the Lie algebra of equivariant regular maps from $X$ to $\mathfrak{g}$. The irreducible finite-dimensional representations of these algebras were classified in previous work with P. Senesi, where it was shown that they are all tensor products of evaluation representations and one-dimensional representations. In the current paper, we describe the extensions between irreducible finite-dimensional representations of an equivariant map algebra in the case that $X$ is an affine scheme of finite type and $\mathfrak{g}$ is reductive. This allows us to also describe explicitly the blocks of the category of finite-dimensional representations in terms of spectral characters, whose definition we extend to this general setting. Applying our results to the case of generalized current algebras (the case where the group acting is trivial), we recover known results but with very different proofs. For (twisted) loop algebras, we recover known results on block decompositions (again with very different proofs) and new explicit formulas for extensions. Finally, specializing our results to the case of (twisted) multiloop algebras and generalized Onsager algebras yields previously unknown results on both extensions and block decompositions.Comment: 41 pages; v2: minor corrections, formatting changed to match published versio

Multi-agent simulation: new approaches to exploring space-time dynamics in GIS

As part of the long term quest to develop more disaggregate, temporally dynamic models of spatial behaviour, micro-simulation has evolved to the point where the actions of many individuals can be computed. These multi-agent systems/simulation(MAS) models are a consequence of much better micro data, more powerful and user-friendly computer environments often based on parallel processing, and the generally recognised need in spatial science for modelling temporal process. In this paper, we develop a series of multi-agent models which operate in cellular space.These demonstrate the well-known principle that local action can give rise to global pattern but also how such pattern emerges as the consequence of positive feedback and learned behaviour. We first summarise the way cellular representation is important in adding new process functionality to GIS, and the way this is effected through ideas from cellular automata (CA) modelling. We then outline the key ideas of multi-agent simulation and this sets the scene for three applications to problems involving the use of agents to explore geographic space. We first illustrate how agents can be programmed to search route networks, finding shortest routes in adhoc as well as structured ways equivalent to the operation of the Bellman-Dijkstra algorithm. We then demonstrate how the agent-based approach can be used to simulate the dynamics of water flow, implying that such models can be used to effectively model the evolution of river systems. Finally we show how agents can detect the geometric properties of space, generating powerful results that are notpossible using conventional geometry, and we illustrate these ideas by computing the visual fields or isovists associated with different viewpoints within the Tate Gallery.Our forays into MAS are all based on developing reactive agent models with minimal interaction and we conclude with suggestions for how these models might incorporate cognition, planning, and stronger positive feedbacks between agents