地理学研究范式的思考

地理学主要关注陆地表层自然和人文要素的空间分异规律研究,针对这一复杂系统的不同问题应该选择不同的研究方式。本文在思考以往地理学研究方式的基础上,将地理学研究范式概括为：地理经验科学研究范式、地理实证科学研究范式、地理系统科学研究范式和地理大数据研究范式。对不同地理科学问题应选取不同的范式加以研究,对有些复杂科学问题应采用多种研究范式加以解决。     

面向"数字城市"多源数据的空间数据立方体空间度量研究

叙述了面向“数字城市”多源数据的空间数据立方体空间度量的基本定义;描述了空间度量的聚集概念,并结合具体的图例阐述了点状、线状、面状空间度量的聚集过程;解释了空间数据立方体维上钻、维下翻、维层次上钻、维层次下翻的空间度量聚集操作基本原理。     

云南松根系对土壤牵引效应测试系统的设计与实现

目前在野外对云南松根系与土壤的机械效庆的研究，由于测试研究受多种因数的影响，开展研究困难较大，研究精度也受到一定程度的影响，这对较深入的描述根系与土壤相互作用的机械效应带来一定的困难。本文基于这一实际，设计了能在室内和野外进行实时测试分析的测试系统，并配套了支持PCMCIA插槽的DAQP－12型模数转换（A／D）卡，以及直流电供电的QT－300型调理装置。结合所配套的硬件，利用Visual C在Windows95/98平台编写了软件，经过实际试验测试，系统各项性能能够满足云南松根系对土壤的机械效应研究的测试分析要求。     

土地规划的自然过程基础与大数据时代的方法探索

随着城市化与工业化程度不断加深,产业空间结构不断重组,导致土地供需矛盾日益突出,国土资源无序开发日益严重,因而优化国土资源空间格局,成为生态文明建设的首要任务。同时,科学合理配置土地资源对土地规划提出了更高要求,传统土地规划方法有待改革。在基于尊重自然、顺应自然的开发理念下,总结土地自然过程基础对土地规划的影响,实现“山水路林田生命共同体”的协调规划发展。其次,“大数据”时代的来临,云计算、空间数据整合、云分析等技术对土地规划方法提供新的技术支撑;最后,针对土地规划数据特殊性、移动用户终端的广泛性,提出应创建土地规划云服务平台,使土地规划实现数据集成管理和更新,从而提高土地规划质量。     

面向问题的空间应用表达与实现

讨论空间应用的一种面向问题的表达方法与实现机制。为解决空间应用的描述问题,在建立时空一体化空间数据模型基础上,定义了对SQL进行扩展的时空复合查询语言,实现了对空间应用问题的非过程化描述;研究复杂空间应用的表达问题,讨论时空复合查询语言的限制,并在语言中引入流机制,通过空间应用问题的组合实现更为复杂的空间应用,并支持空间数据分布式计算;最后给出若干空间应用实例及其面向问题的表达。     

A method for checking the quality of geographic metadata based on ISO 19157

With recent advances in remote sensing, location-based services and other related technologies, the production of geospatial information has exponentially increased in the last decades. Furthermore, to facilitate discovery and efficient access to such information, spatial data infrastructures were promoted and standardized, with a consideration that metadata are essential to describing data and services. Standardization bodies such as the International Organization for Standardization have defined well-known metadata models such as ISO 19115. However, current metadata assets exhibit heterogeneous quality levels because they are created by different producers with different perspectives. To address quality-related concerns, several initiatives attempted to define a common framework and test the suitability of metadata through automatic controls. Nevertheless, these controls are focused on interoperability by testing the format of metadata and a set of controlled elements. In this paper, we propose a methodology of testing the quality of metadata by considering aspects other than interoperability. The proposal adapts ISO 19157 to the metadata case and has been applied to a corpus of the Spanish Spatial Data Infrastructure. The results demonstrate that our quality check helps determine different types of errors for all metadata elements and can be almost completely automated to enhance the significance of metadata.     

The Reliability of Using the Iterative Proportional Fitting Procedure*

This paper demonstrates the utility of the iterative proportional fitting procedure (IPF) in generating disaggregated spatial data from aggregated data and evaluates the performance of the procedure. Estimates of individual level data created by IPF using data of equal-interval categories are reliable, but the performance of the estimation can be improved by increasing sample size. The improvement usually is enough to offset the increase in error created by other factors. If the two variables defining the cross-classification have a significant interaction effect and the number of categories in each variable is larger than two, then IPF is preferred over an independent model.     

A modified binary space partitioning tree for geographic information systems

We present a reactive data structure, that is, a spatial data structure with detail levels. The two properties, spatial organization and detail levels, are the basis for a geographic information system (GIS) with a multi-scale database. A reactive data structure is a novel type of data structure catering to multiple detail levels with rapid responses to spatial queries. It is presented here as a modification of the binary space partitioning tree that includes the levels of detail. This tree is one of the few spatial data structures that does not organize space in a rectangular manner. A prototype system has been implemented. An important result of this implementation is that it shows that binary space partitioning trees of real maps have O(n) storage space complexity in contrast to the theoretical worst case O(n² ), with n the number of line segments in the map.