Beyond the epsilon band: polygonal modeling of gradation/uncertainty in area-class maps

A spatial modeling technique is proposed to represent boundary uncertainty or gradation on area-class maps using a simple polygon tessellation with designated zones of indeterminacy or transition zones. The transition zone can be conceptualized as a dual of the epsilon band, but is more flexible and allows for a wide range of polygonal configurations, including polygons with sinuous boundaries, spurs, three-way transition zones, and null polygons. The model is specified using the medial axis to capture the general shape characteristics of a transition zone. Graph theoretic representation of an extended version of the medial axis captures key junctions in both shape and classification and is used to identify well-formed transition zones that can be logically and unambiguously handled by the model. A multivariate classification surface is specified by first defining degrees or probabilities of membership at every point on the medial axis and transition zone boundary. Degrees or probabilities of membership at all other points are defined by linear interpolation. The technique is illustrated with an example of a complex transition zone, and a simple isoline representation that can be derived from the model is presented. The proposed modeling technique promises to facilitate expert characterization of soil formations, ecological systems, and other types of areal units where gradation and/or boundary uncertainty are prevalent.     

A new algorithm for distance cartogram construction

A distance cartogram is a diagram that visualizes the proximity indices between points in a network, such as time–distances between cities. The Euclidean distances between the points on the distance cartogram represent the given proximity indices. This is a useful visualization tool for the level of service of transport, e.g. difference in the level of service between regions or points in a network and its improvement in the course of time. The two previously proposed methods—multidimensional scaling (MDS) and network time–space mapping—have certain advantages and disadvantages. However, we observe that these methods are essentially the same, and the merits of both these methods can be combined to formulate a generalized solution. In this study, we first formulate the time–space mapping problem, which includes the key features of both of the above stated methods, and propose a generalized solution. We then apply this solution to the time–distances of Japan's railway networks to confirm its applicability.     

Measuring the significance of a divide to local drainage patterns

This article presents a framework for estimating a new topographic attribute derived from digital elevation models (DEMs) called maximum branch length (B _max). Branch length is defined as the distance travelled along a flow path initiated at one grid cell to the confluence with the flow path passing through a second cell. B _max is the longest branch length measured for a grid cell and its eight neighbours. The index provides a physically meaningful method for assessing the relative significance of drainage divides to the dispersion of materials and energy across a landscape, that is, it is a measure of ‘divide size’. B _max is particularly useful for studying divide network structure, for mapping drainage divides, and in landform classification applications. Sensitivity analyses were performed to evaluate the robustness of estimates of B _max to the algorithm used to estimate flow lengths and the prevalence of edge effects resulting from inadequate DEM extent. The findings suggest that the index is insensitive to the specific flow algorithm used but that edge effects can result in significant underestimation along major divides. Edge contamination can, however, be avoided by using an appropriately extensive DEM.     

A Voronoi neighborhood-based search heuristic for distance/capacity constrained very large vehicle routing problems

Local search heuristics for very large-scale vehicle routing problems (VRPs) have made remarkable advances in recent years. However, few local search heuristics have focused on the use of the spatial neighborhood in Voronoi diagrams to improve local searches. Based on the concept of a k-ring shaped Voronoi neighbor, we propose a Voronoi spatial neighborhood-based search heuristic and algorithm to solve very large-scale VRPs. In this algorithm, k-ring Voronoi neighbors of a customer are limited to building and updating local routings, and rearranging local routings with improper links. This algorithm was evaluated using four sets of benchmark tests for 200–8683 customers. Solutions were compared with specific examples in the literature, such as the one-depot VRP. This algorithm produced better solutions than some of the best-known benchmark VRP solutions and requires less computational time. The algorithm outperformed previous methods used to solve very large-scale, real-world distance constrained capacitated VRP.     

高校“地图学”课程思政元素挖掘与课堂融入

高校专业课的课程思政建设是高校思想政治工作的基本载体。“地图学”是测绘工程、遥感科学与技术、地理信息科学、地理科学等本科专业的基础课,在测绘、地理等学科的课程思政建设中具有基础性地位。本文依据教学实践,归纳了地图学课程中与课程思政相结合的知识点,并介绍了在教学中如何巧妙、潜移默化地融入思政元素,在地图学课程教学过程中做到能力培养和素质提升共同进步。     

不同地形特征下云南沿边村寨农户生计资产研究

依据英国国际发展署(DFID)提出的可持续生计分析框架为指导,选取与农户生计资产密切相关的评价因子,建立农户生计资本评价指标体系,对云南省25个沿边县域中具有不同地形特征的64个村寨生计资本进行了测算、对比和分析。研究发现,研究区生计资本总体水平偏低,不同地形特征下村寨间生计资本差异性较大,生计资本不平衡,针对不同的生计脆弱性,提出如下讨论:(1)人力资本上,着重加强和巩固教育和培训力度;(2)金融资本、社会资本上,加大农业现代化水平的投资力度,加大加强农业合作组织的建设;(3)物质资本上,建议增加对农业基础设施和信息媒体的建设;(4)在自然资本的脆弱性上,要在可持续性利用的基础上,大力发展循环经济。     

Pre-processing of data-driven river flow forecasting models by singular value decomposition (SVD) technique

ABSTRACT

An appropriate streamflow forecasting method is a prerequisite for implementation of efficient water resources management in the water-limited, arid regions that occupy much of Iran. In the current research, monthly streamflow forecasting was combined with three data-driven methods based on large input datasets involving 11 precipitation stations, a natural streamflow, and four climate indices through a long period. The major challenges of rainfall–runoff modelling are generally attributed to complex interacting processes, the large number of variables, and strong nonlinearity. The sensitivity of data-driven methods to the dimension of input/output datasets would be another challenge, so large datasets should be compressed into independently standardized principal components. In this study, three pre-processing techniques were applied: singular value decomposition (SVD) provided more efficient forecasts in comparison to principal component analysis (PCA) and average values of inputs in all networks. Among the data-driven methods, the multi-layer perceptron (MLP) with 1-month lag-time outperformed radial basis and fuzzy-based networks. In general, an increase in monthly lag-time of streamflow forecasting resulted in a decline in forecasting accuracy. The results reveal that SVD was highly effective in pre-processing of data-driven evaluations.     

基于数据库存储方案的高性能瓦片地图服务研究

实时渲染与网络传输是影响WebGIS性能的两大因素,瓦片技术是改进系统性能的最佳选择,它通过对地图数据预先渲染、切片,有效减轻服务器处理压力,减少网络负载和响应延迟,但瓦片数据量庞大,磁盘存储碎片化,影响IO性能,数据可迁移性差,无论是数据备份、迁移或是恢复都耗时漫长。该文设计实现了一种新的基于文件数据库的瓦片存储方案,并将分布式缓存系统Memcached作为缓存支持集成在方案中,不仅克服了传统瓦片储存的缺陷,还在性能方面取得了优异的表现,是构建高性能瓦片地图服务的有益尝试。     

数字城市晕渲地势电子地图制作技术研究

阐述了数字城市晕渲地势电子地图的制作流程,对基于DEM的晕渲底图制作及在ArcGIS环境下进行电子地图配置过程进行了详细的分析和论述,为晕渲地势电子地图制作提供了完整的技术路线及解决方案。     

专题地图色彩的智能设计

为提高专题地图色彩设计的智能化水平,结合专题地图制图的实际需求,给出了一种专题地图色彩智能设计算法;其基本思路为以设计者的配色期望、色彩情感数据库和色彩协调理论为基础,采用粒子群算法进行配色方案的选取,借助孟.斯宾瑟的美度公式对配色方案进行进一步优化,进而得出专题地图智能设色的最优方案。