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.     

Terrain complexity and uncertainties in grid‐based digital terrain analysis

The objective of this research is to study the relationship between terrain complexity and terrain analysis results from grid‐based digital elevation models (DEMs). The impact of terrain complexity represented by terrain steepness and orientation on derived parameters such as slope and aspect has been analysed. Experiments have been conducted to quantify the uncertainties created by digital terrain analysis algorithms. The test results show that (a) the RMSE of derived slope and aspect is negatively correlated with slope steepness; (b) the RMSE of derived aspect is more sensitive to terrain complexity than that of derived slope; and (c) the uncertainties in derived slope and aspect tend to be found in flatter areas, and decrease with increasing terrain complexity. The study shows that although primary surface parameters can be well defined mathematically, the implementation of those mathematical models in a GIS environment may generate considerable uncertainties related to terrain complexity. In general, when terrain is rugged with steep slopes, the uncertainty of derived parameters is quite minimal. While in flatter areas, the DEM‐based derivatives, particularly the aspect, may contain a great amount of uncertainty, causing significant limitation in applying the analytical results.     

Measuring complexity in OGC web services XML schemas: pragmatic use and solutions

The use of standards in the geospatial domain, such as those defined by the Open Geospatial Consortium (OGC), for exchanging data has brought a great deal of interoperability upon which systems can be built in a reliable way. Unfortunately, these standards are becoming increasingly complex, making their implementation an arduous task. The use of appropriate software metrics can be very useful to quantify different properties of the standards that ultimately may suggest different solutions to deal with problems related to their complexity. In this regard, we present in this article an attempt to measure the complexity of the schemas associated with the OGC implementation specifications. We use a comprehensive set of metrics to provide a multidimensional view of this complexity. These metrics can be used to evaluate the impact of design decisions, study the evolution of schemas, and so on. We also present and evaluate different solutions that could be applied to overcome some of the problems associated with the complexity of the schemas.     

Accelerating agent-based computation of complex urban systems

Despite its popularity, agent-based modeling is limited by serious barriers that constrain its usefulness as an exploratory tool. In particular, there is a paucity of systematic approaches for extracting coarse-grained, system-level information as it emerges in direct simulation. This is particularly problematic for agent-based models (ABMs) of complex urban systems in which macroscopic phenomena, such as sprawl, may manifest themselves coarsely from bottom-up dynamics among diverse agent-actors interacting across scales. Often these connections are not known, but treating them is nevertheless crucial in enabling prediction, in supporting decisions, and in facilitating the design, control, and optimization of urban systems. In this article, we describe and implement a metasimulation scheme for extracting macroscopic information from local dynamics of agent-based simulation, which allows acceleration of coarse-scale computing and which may also serve as a precursor to handle emergence in complex urban simulation. We compare direct ABM simulation, population-level equation solutions, and coarse projective integration. We apply the scheme to the simulation of urban sprawl from local drivers of urbanization, urban growth, and population dynamics. Numerical examples of the three approaches are provided to compare their accuracy and efficiency. We find that our metasimulation scheme can significantly accelerate complex urban simulations while maintaining faithful representation of the original model.     

How much physical complexity is needed to model flood inundation?

Two‐dimensional flood inundation models are widely used tools for flood hazard mapping and an essential component of statutory flood risk management guidelines in many countries. Yet, we still do not know how much physical complexity a flood inundation model needs for a given problem. Here, three two‐dimensional explicit hydraulic models, which can be broadly defined as simulating diffusive, inertial or shallow water waves, have been benchmarked using test cases from a recent Environment Agency for England and Wales study, where results from industry models are also available. To ensure consistency, the three models were written in the same code and share subroutines for all but the momentum (flow) and time‐stepping calculations. The diffusive type model required much longer simulation times than the other models, whilst the inertia model was the quickest. For flows that vary gradually in time, differences in simulated velocities and depths due to physical complexity were within 10% of the simulations from a range of industry models. Therefore, for flows that vary gradually in time, it appears unnecessary to solve the full two‐dimensional shallow water equations. As expected, however, the simpler models were unable to simulate supercritical flows accurately. Finally, implications of the results for future model benchmarking studies are discussed in light of a number of subtle factors that were found to cause significant differences in simulations relative to the choice of model. Copyright © 2011 John Wiley & Sons, Ltd.     

Fully coupled simulation of a hydraulic fracture interacting with natural fractures with a hybrid discrete‐continuum method

A hybrid discrete‐continuum numerical scheme is developed to study the behavior of a hydraulic fracture crossing natural fractures. The fully coupled hybrid scheme utilizes a discrete element model for an inner domain, within which the hydraulic fracture propagates and interacts with natural fractures. The inner domain is embedded in an outer continuum domain that is implemented to extend the length of the hydraulic fracture and to better approximate the boundary effects. The fracture is identified to propagate initially in the viscosity‐dominated regime, and the numerical scheme is calibrated by using the theoretical plane strain hydraulic fracture solution. The simulation results for orthogonal crossing indicate three fundamental crossing scenarios, which occur for various stress ratios and friction coefficients of the natural fracture: (i) no crossing, that is, the hydraulic fracture is arrested by the natural fracture and makes a T‐shape intersection; (ii) offset crossing, that is, the hydraulic fracture crosses the natural fracture with an offset; and (iii) direct crossing, that is, the hydraulic fracture directly crosses the natural fracture without diversion. Each crossing scenario is associated with a distinct net pressure history. Additionally, the effects of strength contrast and stiffness contrast of rock materials and intersection angle between the hydraulic fracture and the natural fracture are also investigated. The simulations also illustrate that the level of fracturing complexity increases as the number and extent of the natural fractures increase. As a result, we can conclude that complex hydraulic fracture propagation patterns occur because of complicated crossing behavior during the stimulation of naturally fractured reservoirs. Copyright © 2017 John Wiley & Sons, Ltd.     

分形地形复杂度研究

利用VC++6.0与OpenGL开发了1个地形分析程序,分别实现了2种地形复杂度描述方法.基于分形几何学的思想,对栅格DEM进行地形分析,得出的实验地区地表分维值,比传统地表粗糙度分析方法得出的地表粗糙度值能更好地表现地形变化的连续性和空间相关性.实验表明,地表分维值能够很好地反映地形变化特征,可作为栅格DEM地形复杂...     

浅析大兴安岭中南段多金属成矿航磁异常特征

大兴安岭作为在古亚洲洋构造～成矿域基础上发展起来的北方造山带, 具有多块体拼合增生造山的典型特征,中生代、新生代又受到多种成矿地质作用的改造和叠加, 成矿条件十分优越,具备了大规模成矿的条件和潜力.这里在充分研究大兴安岭中南段地质构造、航磁特征的基础上,对航磁异常进行综合解释,寻找与成矿密切相关的中酸性岩体及其隐伏岩体...     

一种基于Dijkstra并行线程算法的研究与实现

针对传统Dijkstra算法运行效率的问题,提出了一种基于传统Dijkstra并行线程的算法,该算法动态地将交通网络进行子网分割。通过实验测试了不同网络节点数量和弧段数量下传统Dijkstra算法和本文算法运行时间,实验结果表明本文算法能够缩减网络节点搜索空间,降低算法的时间复杂度,提高算法的运行效率。