Theoretical and experimental study of flow in annular vaneless diffusers.

SIGLELD:D47089/83 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Order in space: a general formalism for spatial reasoning

In this paper we propose a general approach for reasoning in space. The approach is composed of a set of two general constraints to govern the spatial relationships between objects in space, and two rules to propagate relationships between those objects. The approach is based on a novel representation of the topology of the space as a connected set of components using a structure called adjacency matrix which can capture the topology of objects of different complexity in any space dimension. The formalism is used to explain spatial compositions resulting in indefinite and definite relations and it is shown to be applicable to reasoning in the temporal domain. The main contribution of the formalism is that it provides means for constructing composition tables for objects with arbitrary complexity in any space dimension. A new composition table between spatial objects of different types is presented. A major advantage of the method is that reasoning between objects of any complexity can be achieved in a defined limited number of steps. Hence, the incorporation of spatial reasoning mechanisms in spatial information systems becomes possible

Towards a general theory for modelling qualitative space

Qualitative spatial representation and reasoning are techniques for modeling and manipulating objects and relationships in space. Finding ways for defining the complete and sound (physically plausible) set of relationships between spatial objects is a prerequisite for the development and realization of qualitative representation and reasoning formalisms. Establishing the set of sound relationships is a complicated task especially when complex objects are considered. Hence, current approaches to qualitative representation and reasoning are limited to handling simple spatial objects. In this paper, we introduce a constraint-based approach to qualitative representation of topological relationships by defining a set of general soundness rules. The rules reduce the combinatorial set of relations produced by the method to the complete and physically possible ones. The rules are general and apply to objects of arbitrary complexity and together with the representation and reasoning formalism form a theory for qualitative space

Episodes in space: qualitative representation and reasoning over spatio-temporal objects

There is growing interest in many application domains for the temporal treatment and manipulation of spatially referenced objects. Handling the time dimension in spatial databases can greatly enhance and extend their functionality and usability by offering means of understanding the spatial behaviour in time. Few works, to date, have been directed towards the development of formalisms for representation and reasoning in this domain. In this paper, a new approach is presented for the representation and reasoning over spatio-temporal relationships. The approach is simple and aims to satisfy the requirements of coherency, expressiveness and reasoning power. Consistent behaviours of spatial objects in time are denoted episodes. The topology of the domain is defined by decomposing episodes into representative components and relationships are defined between those components. Spatio-temporal reasoning is achieved by composing the relationships between the object components using constraint networks. New composition tables between simple spatio-temporal regions and between regions and volumes are also derived and used in the reasoning process

SPARQS: a qualitative spatial reasoning engine

In this paper the design and implementation of a general qualitative spatial reasoning engine (SPARQS) is presented. Qualitative treatment of information in large spatial databases is used to complement the quantitative approaches to managing those systems, in particular, it is used for the automatic derivation of implicit spatial relationships and in maintaining the integrity of the database. To be of practical use, composition tables of spatial relationships between different types of objects need to be developed and integrated in those systems. The automatic derivation of such tables is considered to be a major challenge to current reasoning approaches. In this paper, this issue is addressed and a new approach to the automatic derivation of composition tables is presented. The method is founded on a sound set-theoretical approach for the representation and reasoning over arbitrarily shaped objects in space. A reasoning engine tool, SPARQS, has been implemented to demonstrate the validity of the approach. The engine is composed of a basic graphical interface where composition tables between the most common types of spatial objects are built. An advanced interface is also provided, where users are able to describe shapes of arbitrary complexity and to derive the composition of chosen spatial relationships. Examples of the application of the method using different objects and different types of spatial relationships are presented and new composition tables are built using the reasoning engine

A filter flow visual querying language and interface for spatial databases

In this paper a visual approach to querying in spatial databases is presented. A filter flow methodology is used to consistently express different types of queries in these systems. Filters are used to represent operations on the database and pictorial icons are used throughout the language for filters, operators and spatial relations. Different granularities of the relations are presented in a hierarchical fashion for spatial constraints. The language framework and functions are described and examples are used to demonstrate its capabilities in representing different levels of queries, including spatial joins and composite spatial joins. Here, the primary focus is on the query language itself but an overvie

Extracting causal rules from spatio-temporal data

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-23374-1_2This paper is concerned with the problem of detecting causality in spatiotemporal data. In contrast to most previous work on causality, we adopt a logical rather than a probabilistic approach. By defining the logical form of the desired causal rules, the algorithm developed in this paper searches for instances of rules of that form that explain as fully as possible the observations found in a data set. Experiments with synthetic data, where the underlying causal rules are known, show that in many cases the algorithm is able to retrieve close approximations to the rules that generated the data. However, experiments with real data concerning the movement of fish in a large Australian river system reveal significant practical limitations, primarily as a consequence of the coarse granularity of such movement data. In response, instead of focusing on strict causation (where an environmental event initiates a movement event), further experiments focused on perpetuation (where environmental conditions are the drivers of ongoing processes of movement). After retasking to search for a different logical form of rules compatible with perpetuation, our algorithm was able to identify perpetuation rules that explain a significant proportion of the fish movements. For example, approximately one fifth of the detected long-range movements of fish over a period of six years were accounted for by 26 rules taking account of variations in water-level alone.EPSRCAustralian Research Council (ARC) under the Discovery Projects Schem