航空流网络解构与空域资源动态配置研究——以京-成空中廊道为例

空中廊道作为一种新型航空流组织与空域资源分配方式,是一种复杂的航空流网络,解析其结构特征并评估其结构性能是实现空域资源动态配置的前提。该文通过构建网格时空图方法,以京—成空中廊道为例进行航空流网络解构研究,包括基于航迹簇的网络构型、流量时空波动与航空流聚合分化三方面,据此提出空域资源动态配置方案。研究结论如下:1)以多种邻近阈值指示航迹交叉角度持续增大,检测出航空流网络存在平行流、交叉流、全覆盖流和半覆盖流4种构型,基于其占比和特征的显著差异性提出并行扩容调整方案;2)以高频数网格点状或短线状集中分布指示流量时空波动,检测出航空流网络存在两个不同内涵的时间高峰、以距离中值区为近似对称轴的空间高峰以及在区段间漂移的时空交互高峰,进而提出时间错峰调整方案;3)以网格属性指示聚合分化点的分布,检测出航空流网络阶梯递减、高值集聚和叠合特征,相应提出动态快速分化分流调整方案。     

Mapping landslide susceptibility from small datasets: A case study in the Pays de Herve (E Belgium)

A landslide susceptibility map is proposed for the Pays de Herve (E Belgium), where large landslides affect Cretaceous clay outcrop areas. Based on a Bayesian approach, this GIS-supported probabilistic map identifies the areas most susceptible to deep landslides. The database is comprised of the source areas of ten pre-existing landslides (i.e. a sample of 154 grid cells) and of six environmental data layers, namely lithology, proximity to active faults, slope angle and aspect, elevation and distance to the nearest valley-floor. A 30-m-resolution DEM from the Belgian National Geographical Institute is used for the analysis. Owing to the small size of the sample, a special cross-validation procedure of the susceptibility map is performed, which uses in an iterative way each of the landslides to test the predictive power of the map derived from the other landslides. Four different sets of variables are used to produce four susceptibility maps, whose prediction curves are compared. While the prediction rates associated with the models not involving the “proximity to active fault” criterion are comparable to those of the models considering this variable, strong weaknesses inherent in the fault data on which the latter rely suggest that the final susceptibility map should be based on a model that excludes any reference to fault. This highlights the difference between a triggering factor and determining factors, and in the same time broadens the scope of the produced map. A single reactivated slide is also used to test the possibility of predicting future reactivation of existing landslides in the area. Finally, the need for geomorphological control over the mathematical treatment is underlined in order to obtain realistic prediction maps.     

The Domestication of Ginseng

Many students enter classes with a very Orientalist mental map of the region usually called the Middle East. This is understandable considering the information and images of the region that pervade our media landscape. In an effort to teach student how to critically examine media sources themselves, the author utilizes a blog format for student participation and discussion. The article describes how the geographic imaginations of the students involved became more nuanced through the process of finding, analyzing, and critiquing various media sources in a small online community.     

Mental Mapping: A Lesson That Creates Itself

Abstract

Mental image and place-preference maps of college students in Florida were created through a two-part lesson. The patterns revealed by these maps were linked to students' life experiences, census data on migration and income, and similar studies conducted in other states. Students prefer states with established migration links to Florida and better income/job opportunities. Because the maps could not be created without their input, students were wholly engaged in a lesson that uses concepts in population geography and cartography to fulfill several national geography standards.     

Books,Places, Regions—A Natural Blend

Abstract

Children love books, and through carefully chosen ones geographic concepts can be conveyed. Books are good resources—great background material for describing a place, emphasizing the culture of a region, highlighting a geographical issue, or clarifying where a place is in the world. This article explains how literature encourages geographic thinking, builds geographic skills, and develops lasting mental maps of places and regions.     

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.     

Designing sound in cybercartography: from structured cinematic narratives to unpredictable sound/image interactions

In this paper we draw on the analysis of sound in film theory in order to explore the potential that sound offers cybercartography. We first argue that the theoretical body developed in film studies is highly relevant to the study of sound/image relationships in mapmaking. We then build on this argument to develop experimental animated and interactive sound maps for the Cybercartographic Atlas of Antarctica that further explore the potential of sound for integrating emotional, cultural and political dimensions in cartography. These maps have been designed to recreate cinematic soundscapes, to provide contrapuntal perspectives on the cartographic image and to generate an aural identity of the atlas. As part of this experimental mapping, an innovative sound infrastructure is being developed to allow complex sound designs to be transmitted over the Internet as part of atlas content. Through this infrastructure the user can select as well as contribute his own sounds. The overall cartographic message is becoming less predictable, thus opening new perspectives on the way we design, interact with, and modify sounded maps over the Internet.     

Finding shortest paths on real road networks: the case for A*

The problem of identifying the shortest path along a road network is a fundamental problem in network analysis, ranging from route guidance in a navigation system to solving spatial allocation problems. Since this type of problem is solved so frequently, it is important to craft an approach that is as efficient as possible. Based upon past research, it is generally accepted that several efficient implementations of the Dijkstra algorithm are the fastest at optimally solving the ‘one‐to‐one’ shortest path problem (Cherkassky et al. 1996 Cherkassky, B. V., Goldberg, A. V. and Radzik, T. 1996. Shortest paths algorithms: theory and experimental evaluation.. Mathematical Programming: Series A and B, 73: 129–174. [Crossref], [Web of Science ®] , [Google Scholar]). We show that the most efficient state‐of‐the‐art implementations of Dijkstra can be improved by taking advantage of network properties associated with GIS‐sourced data. The results of this paper, derived from tests of different algorithmic approaches on real road networks, will be extremely valuable for application developers and researchers in the GIS community.     

北京地区土壤背景值图的编制

本文对北京地区土壤背景值匿的编制进行了全面、系统的总结。编制土壤背景值图的基础资料有302十样点的无素测定值和运用计算机制图和因素分析法揭露的元素区域分布规律。土壤背景值图是采用分级统计图的形式。其制图单元：山区以母岩，平原地区以成土母质类型和土壤质地作为划分依据；背景值的数量分级采用显著性检验分级法。