Non-current data and geographical information systems A case for data retention

Inter-urban income disparities reflect differences between individual urban localities in the average incomes of their residents. The present paper discusses different ways of visualizing such disparities on thematic maps. The approach we propose is based on the transformation of distances between individual localities and a reference city (e.g. a major population centre of a country) in proportion to the actual differences in the income levels. The general principle of such a transformation is to bring closer to the reference city places with higher incomes, while moving away localities with low income levels. Three alternative approaches to the implementation of this transformation technique are discussed. According to the ‘actual distance’ method, the spatial ‘shift’ of a locality on the map is set proportional to both the relative difference in incomes and the aerial distance between a locality and the reference city. In the ‘proportional increment’ transformation, the distance between a locality and the reference city is adjusted by a parameter whose values are proportional to income disparities between the two. Lastly, according to the ‘concentric circle’ transformation, localities with identical levels of incomes are positioned at a certain distance from the reference city, forming concentric circles around it. Both advantages and disadvantages of these transformation techniques are discussed, and the ‘proportional increment’ method is chosen as the best-performing visualization technique. The performance of this technique is demonstrated using income data for urban localities in Israel in 1991 and 1999. As analysis indicates, the proposed method helps to illustrate both the existing patterns of inter-urban income disparities and their dynamics over time.     

A syllabus for teaching geographical information systems

The problems in teaching a course on geographical information systems in higher education are reviewed and a possible syllabus that will be most relevant to needs in the United Kingdom is suggested. The syllabus is divided into six major sections relating to the context, cartographic and spatial analytical concepts, their realization in a computing environment, operations, applications and institutional issues. A particular feature is an attempt to maintain a rigid distribution between underlying theory which is relatively stable and its more volatile operationalization on computers. The paper results from a symposium held in Leicester (U.K.) late in 1988 that brought together nine specialists in the held.     

An event-based spatiotemporal data model (ESTDM) for temporal analysis of geographical data

Abstract

Representations historically used within GIS assume a world that exists only in the present. Information contained within a spatial database may be added-to or modified over time, but a sense of change or dynamics through time is not maintained. This limitation of current GIS capabilities has recently received substantial attention, given the increasingly urgent need to better understand geographical processes and the cause-and-effect interrelationships between human activities and the environment. Models proposed so-far for the representation of spatiotemporal data are extensions of traditional raster and vector representations that can be seen as location- or feature-based, respectively, and are therefore best organized for performing either location-based or feature-based queries. Neither form is as well-suited for analysing overall temporal relationships of events and patterns of events throughout a geographical area as a temporally-based representation.

In the current paper, a new spatio-temporal data model is proposed that is based on time as its organizational basis, and is thereby intended to facilitate analysis of temporal relationships and patterns of change through time. This model is named the Event-based Spatio Temporal Data Model (ESTDM). It is shown that temporally-based queries relating to locations can be implemented in an efficient and conceptually straightforward manner using ESTDM by describing algorithms for three fundamental temporally-based retrieval tasks based on this model: (1) retrieving location(s) that changed to a given value at a given time, (2) retrieving location(s) that changed to a given value over a given temporal interval, and (3) calculation of the total area that has changed to a given value over a given temporal interval. An empirical comparison of the space efficiency of ESTDM and compressed and uncompressed forms of the ‘snapshot’ model is also given, showing that ESTDM is also a compact representation of spatio-temporal information.     

A GPU-accelerated adaptive kernel density estimation approach for efficient point pattern analysis on spatial big data

Kernel density estimation (KDE) is a classic approach for spatial point pattern analysis. In many applications, KDE with spatially adaptive bandwidths (adaptive KDE) is preferred over KDE with an invariant bandwidth (fixed KDE). However, bandwidths determination for adaptive KDE is extremely computationally intensive, particularly for point pattern analysis tasks of large problem sizes. This computational challenge impedes the application of adaptive KDE to analyze large point data sets, which are common in this big data era. This article presents a graphics processing units (GPUs)-accelerated adaptive KDE algorithm for efficient spatial point pattern analysis on spatial big data. First, optimizations were designed to reduce the algorithmic complexity of the bandwidth determination algorithm for adaptive KDE. The massively parallel computing resources on GPU were then exploited to further speed up the optimized algorithm. Experimental results demonstrated that the proposed optimizations effectively improved the performance by a factor of tens. Compared to the sequential algorithm and an Open Multiprocessing (OpenMP)-based algorithm leveraging multiple central processing unit cores for adaptive KDE, the GPU-enabled algorithm accelerated point pattern analysis tasks by a factor of hundreds and tens, respectively. Additionally, the GPU-accelerated adaptive KDE algorithm scales reasonably well while increasing the size of data sets. Given the significant acceleration brought by the GPU-enabled adaptive KDE algorithm, point pattern analysis with the adaptive KDE approach on large point data sets can be performed efficiently. Point pattern analysis on spatial big data, computationally prohibitive with the sequential algorithm, can be conducted routinely with the GPU-accelerated algorithm. The GPU-accelerated adaptive KDE approach contributes to the geospatial computational toolbox that facilitates geographic knowledge discovery from spatial big data.     

A data model and algorithms for a spatial data marketplace

A data marketplace is a platform that facilitates online data trading. It gives sellers the capabilities of publishing data, defining the price function, the authorization rules and the data contract. It gives customers the capabilities to search for data services, to query for their price, to invoke them and to pay for the usage. As data are more and more emphasized as a payable asset, the need for data marketplaces rises. There is a lack of marketplace proposals for spatial data. This paper contributes to fill-in this gap. We propose a data model for representing the different types of data involved. The logical representation of data is a quadtree, and the physical representation fits into a key-value store. The model is thus logically simple and extensible, and physically scalable and highly available. We discuss price queries in detail and propose evaluation algorithms.     

A scale-explicit model for checking directional consistency in multi-resolution spatial data

Multi-resolution spatial data always contain the inconsistencies of topological, directional, and metric relations due to measurement methods, data acquisition approaches, and map generalization algorithms. Therefore, checking these inconsistencies is critical for maintaining the integrity of multi-resolution or multi-source spatial data. To date, research has focused on the topological consistency, while the directional consistency at different resolutions has been largely overlooked. In this study we developed computation methods to derive the direction relations between coarse spatial objects from the relations between detailed objects. Then, the consistency of direction relations at different resolutions can be evaluated by checking whether the derived relations are compatible with the relations computed from the coarse objects in multi-resolution spatial data. The methods in this study modeled explicitly the scale effects of direction relations induced by the map generalization operator – merging, thus they are efficient for evaluating consistency. The directional consistency is an essential complement to topological and object-based consistencies.     

基于圈层结构的游客活动空间边界提取新方法

准确刻画游客活动空间边界对于优化景区结构、实施界限管控、提高资源利用效益均有重要意义.由于游客行为的复杂性与边界模糊性,利用传统地理边界提取方法难以有效识别游客活动空间边界.基于层次聚类算法优化后的Delaunay三角网进行核密度估计,解决了多尺度下点核密度对空间边界拟合不精确的问题,同时借鉴圈层结构理论,依据游客空间...     

基于电子地图兴趣点的城市建成区边界识别方法

城市建成区边界是认识和研究城市的重要基础性信息,也是落实城市功能空间布局、实施界限管控的前提。但是,以往通过夜间灯光的强度、土地覆被或建筑覆盖率等信息获取城市空间范围的方法,由于受到数据精度和尺度限制,对城市社会经济活动的解释性不强,因而存在较大局限性。电子地图兴趣点（POI）作为城市空间分析的基础数据之一,直观且有效地反映了各类城市要素的集聚状况。本文基于POI与城市空间结构和城市要素空间分布的关联性,提出了一种新的通过POI密度分布来判别城市建成区边界的技术方法。为此,开发了Densi-Graph分析方法,用来分析POI密度等值线的变化趋势,在此基础上对城乡过渡地带的阈值识别的方法进行了理论分析,并讨论了单中心圆结构、双中心“鱼眼型”结构、双中心“子母型”结构等各类城市POI密度等值线的生长规律,证明了Densi-Graph分析方法的适用性。较之以往的城市建成区边界识别方法,这种方法的基础数据更加直观可信,分析结果也更加客观。运用这种方法,本文对全国地级以上城市的建成区边界进行了实证分析,探索了城市建成区边界的阈值及其与城市人口规模、城市所在区域之间的关系。