首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 16 毫秒
1.
  相似文献   

2.
合肥经济圈空间关联时空演进研究   总被引：1，自引：1，他引：0  
朱道才  孙家敏  陆林 《地理科学》2017,37(5):738-747
从城市产业角度出发,依据2009~2014年的相关数据,采用城市流和ESDA模型对合肥经济圈空间关联进行分析,揭示空间相互作用的时间演变过程和空间分布。结果表明：① 经济圈形成了较稳定的中心-外围格局,空间结构呈现以合肥为中心圈层式向外辐射状,淮南和六安有望成为次增长极。② 经济圈产业外向功能性不强且出现异化,城市流倾向度呈现明显的等级异质性和不均衡性。③ 经济圈产业外向发展存在显著的空间依赖性,空间自相关符合距离衰减规律。④ 经济圈区域不平衡态势明显,空间关联的时空分异特征明显。应推进区域一体化,加快区域协调发展。  相似文献   

3.
ABSTRACT

Kernel Density Estimation (KDE) is an important approach to analyse spatial distribution of point features and linear features over 2-D planar space. Some network-based KDE methods have been developed in recent years, which focus on estimating density distribution of point events over 1-D network space. However, the existing KDE methods are not appropriate for analysing the distribution characteristics of certain kind of features or events, such as traffic jams, queue at intersections and taxi carrying passenger events. These events occur and distribute in 1-D road network space, and present a continuous linear distribution along network. This paper presents a novel Network Kernel Density Estimation method for Linear features (NKDE-L) to analyse the space–time distribution characteristics of linear features over 1-D network space. We first analyse the density distribution of each linear feature along networks, then estimate the density distribution for the whole network space in terms of the network distance and network topology. In the case study, we apply the NKDE-L to analyse the space–time dynamics of taxis’ pick-up events, with real road network and taxi trace data in Wuhan. Taxis’ pick-up events are defined and extracted as linear events (LE) in this paper. We first conduct a space–time statistics of pick-up LE in different temporal granularities. Then we analyse the space–time density distribution of the pick-up events in the road network using the NKDE-L, and uncover some dynamic patterns of people’s activities and traffic condition. In addition, we compare the NKDE-L with quadrat method and planar KDE. The comparison results prove the advantages of the NKDE-L in analysing spatial distribution patterns of linear features in network space.  相似文献   

4.
Performing point pattern analysis using Ripley’s K function on point events of large size is computationally intensive as it involves massive point-wise comparisons, time-consuming edge effect correction weights calculation, and a large number of simulations. This article presented two strategies to optimize the algorithm for point pattern analysis using Ripley’s K function and utilized cloud computing to further accelerate the optimized algorithm. The first optimization sorted the points on their x and y coordinates and thus narrowed the scope of searching for neighboring points down to a rectangular area around each point in estimating K function. Using the actual study area in computing edge effect correction weights is essential to estimate an unbiased K function, but is very computationally intensive if the study area is of complex shape. The second optimization reused the previously computed weights to avoid repeating expensive weights calculation. The optimized algorithm was then parallelized using Open Multi-Processing (OpenMP) and hybrid Message Passing Interface (MPI)/OpenMP on the cloud computing platform. Performance testing showed that the optimizations effectively accelerated point pattern analysis using K function by a factor of 8 using both the sequential version and the OpenMP-parallel version of the optimized algorithm. While the OpenMP-based parallelization achieved good scalability with respect to the number of CPU cores utilized and the problem size, the hybrid MPI/OpenMP-based parallelization significantly shortened the time for estimating K function and performing simulations by utilizing computing resources on multiple computing nodes. Computational challenge imposed by point pattern analysis tasks on point events of large size involving a large number of simulations can be addressed by utilizing elastic, distributed cloud resources.  相似文献   

5.
The identification of regions is both a computational and conceptual challenge. Even with growing computational power, regionalization algorithms must rely on heuristic approaches in order to find solutions. Therefore, the constraints and evaluation criteria that define a region must be translated into an algorithm that can efficiently and effectively navigate the solution space to find the best solution. One limitation of many existing regionalization algorithms is a requirement that the number of regions be selected a priori. The recently introduced max-p algorithm does not have this requirement, and thus the number of regions is an output of, not an input to, the algorithm. In this paper, we extend the max-p algorithm to allow for greater flexibility in the constraints available to define a feasible region, placing the focus squarely on the multidimensional characteristics of the region. We also modify technical aspects of the algorithm to provide greater flexibility in its ability to search the solution space. Using synthetic spatial and attribute data, we are able to show the algorithm’s broad ability to identify regions in maps of varying complexity. We also conduct a large-scale computational experiment to identify parameter settings that result in the greatest solution accuracy under various scenarios. The rules of thumb identified from the experiment produce maps that correctly assign areas to their ‘true’ region with 94% average accuracy, with nearly 50% of the simulations reaching 100% accuracy.  相似文献   

6.
Abstract

This comment aims to further develop James and Brown proposal of framing organic conversions as transformations, referring to “the three spheres of transformation” (practical, political, and personal). Particularly, I address the dynamic interactions between the three spheres during the transformational process, and challenge James and Brown’s emphasis on the political sphere. To this aim, I first make explicit the temporal logic underlying James and Brown’s analysis, which is consistent with other conceptualizations in literature, also giving importance to the political sphere. Then, I mention an alternative approach, highlighting the potentially initiating role of key individuals and farmers’ epiphanies in the transformational process. This makes a strong difference in the narratives that can be made around organic conversions, by shedding light on the personal sphere and the “co-arising” of the three spheres. This proposal raises both methodological and theoretical questions, which can be addressed by introducing insights from quantum theory.  相似文献   

7.
A storage-efficient contour generation method, focusing on planar contours, is developed. Given cartographic elevations on a rectangular lattice, a continuous bivariate function, z = f(x, y), is determined by interpolating the elevation values. Then, we focus on a contour determined by z = constant. The contour curve is partitioned into multiple sections, each of which is exactly or approximately round. Three curvature types are introduced to evaluate the roundness of each section. The area and perimeter of the contour are computed by one-dimensional line integration using Green’s theorem. If the contour is open, it is divided into two curves starting from the same initial point, with the control points advancing in opposite directions. Two types of numerical experiments are performed to validate the effectiveness of the proposed method. One experiment uses an analytically defined elevation function and investigates the number of control points and computation time for a resulting computation error. The second experiment uses actual digital elevation model data of an isolated island in Japan and compares the proposed method with existing ones. Because the algorithm does not require lattice subdivision and the number of control points is drastically reduced, the proposed method is storage efficient.  相似文献   

8.
Abstract

It is widely recognized that stakeholder engagement processes produce advantages, but few studies acknowledge that they also can produce disadvantages. There is a global need to better assess stakeholder engagement processes by defining success and developing new methods to analyze stakeholder participation data. Our method of digitizing and coding stakeholder communications (1) produces a wide range of analyses, (2) tells the story of governance over time, (3) is comparable with other datasets, and (4) can be used wherever public documents exist. We demonstrate the utility of these integrated methods by examining statewide differences in public participation and success rates in Alaska’s Board of Fisheries’ (Board) proposal process. We determine that significantly different participation and success rates across the state indicate the existence of disadvantages and the need for further investigation into the equity, efficiency, and effectiveness of the Board process.  相似文献   

9.
The shoreline of beaches in the lee of coastal salients or man-made structures, usually known as headland-bay beaches, has a distinctive curvature; wave fronts curve as a result of wave diffraction at the headland and in turn cause the shoreline to bend. The ensuing curved planform is of great interest both as a peculiar landform and in the context of engineering projects in which it is necessary to predict how a coastal structure will affect the sandy shoreline in its lee. A number of empirical models have been put forward, each based on a specific equation. A novel approach, based on the application of artificial neural networks, is presented in this work. Unlike the conventional method, no particular equation of the planform is embedded in the model. Instead, it is the model itself that learns about the problem from a series of examples of headland-bay beaches (the training set) and thereafter applies this self-acquired knowledge to other cases (the test set) for validation. Twenty-three headland-bay beaches from around the world were selected, of which sixteen and seven make up the training and test sets, respectively. As there is no well-developed theory for deciding upon the most convenient neural network architecture to deal with a particular data set, an experimental study was conducted in which ten different architectures with one and two hidden neuron layers and five training algorithms – 50 different options combining network architecture and training algorithm – were compared. Each of these options was implemented, trained and tested in order to find the best-performing approach for modelling the planform of headland-bay beaches. Finally, the selected neural network model was compared with a state-of-the-art planform model and was shown to outperform it.  相似文献   

10.
Several algorithms have been proposed to generate a polygonal ‘footprint’ to characterize the shape of a set of points in the plane. One widely used type of footprint is the χ-shape. Based on the Delaunay triangulation (DT), χ-shapes guaranteed to be simple (Jordan) polygons. This paper presents for the first time an incremental χ-shape algorithm, capable of processing point data streams. Our incremental χ-shape algorithm allows both insertion and deletion operations, and can handle streaming individual points and multiple point sets. The experimental results demonstrated that the incremental algorithm is significantly more efficient than the existing, batch χ-shape algorithm for processing a wide variety of point data streams.  相似文献   

11.

Experimental variograms are crucial for most geostatistical studies. In kriging, for example, the variography has a direct influence on the interpolation weights. Despite the great importance of variogram estimators in predicting geostatistical features, they are commonly influenced by outliers in the dataset. The effect of some randomly spatially distributed outliers can mask the pattern of the experimental variogram and produce a destructuration effect, implying that the true data spatial continuity cannot be reproduced. In this paper, an algorithm to detect and remove the effect of outliers in experimental variograms using the Mahalanobis distance is proposed. An example of the algorithm’s application is presented, showing that the developed technique is able to satisfactorily detect and remove outliers from a variogram.

  相似文献   

12.
Many techniques have been proposed for visualizing uncertainty in geospatial data. Previous empirical research on the effectiveness of visualizations of geospatial uncertainty has focused primarily on user intuitions rather than objective measures of performance when reasoning under uncertainty. Framed in the context of Google’s blue dot, we examined the effectiveness of four alternative visualizations for representing positional uncertainty when reasoning about self-location data. Our task presents a mobile mapping scenario in which GPS satellite location readings produce location estimates with varying levels of uncertainty. Given a known location and two smartphone estimates of that known location, participants were asked to judge which smartphone produces the better location reading, taking uncertainty into account. We produced visualizations that vary by glyph type (uniform blue circle with border vs. Gaussian fade) and visibility of a centroid dot (visible vs. not visible) to produce the four visualization formats. Participants viewing the uniform blue circle are most likely to respond in accordance with the actual probability density of points sampled from bivariate normal distributions and additionally respond most rapidly. Participants reported a number of simple heuristics on which they based their judgments, and consistency with these heuristics was highly predictive of their judgments.  相似文献   

13.
多边形是GIS研究和应用中使用最频繁的几何对象,该文描述了基于简单要素模型的任意多边形分割算法。从计算几何出发,结合GIS空间数据的特点,将基于简单要素模型的多边形分割算法设计为:1)对多边形及分割线的边界排序,基于扫描线及外包矩形检测查找可能相交的线段,提高相交线段的搜索效率;2)计算交点生成结点信息(包括交点坐标、线号及交点的出入),并存储在独立的单向链表中;3)根据结点链表和原多边形坐标搜索结果多边形。该算法能够分割任意简单多边形(凹凸、曲线边界和带洞的多边形)以及有共享边的多边形。最后在MapGIS7.0平台上,实现了基于简单要素类的多边形分割功能。  相似文献   

14.
刘天宝  陈子叶  陈爽 《地理科学》2022,42(8):1402-1412
利用2015年大连市初中学校多维数据,在分析社会群体间分异状况及其空间表现的基础上,概括了学校的基本类型及其空间分布特征,总结了义务教育校际分异的空间模式。在市域范围内存在4类学校,即成绩较好的城市综合社会群体子女学校;成绩一般的产业工人及一般技术人员子女学校;成绩优异的教师、政府和企事业单位管理者及专业技术人员子女学校;成绩落后但生均教育资源充沛的农村地区学校。4类学校在市域范围内分异明显,形成了从内向外的5个教育圈,即城市中心教育圈、城市郊区教育圈、城市新区教育圈、外围城镇教育圈和外围乡村教育圈。教育资源在教育圈之间呈高低相间分布的特点,教学成绩和学生家庭社会经济地位呈现出从中心向外围逐步降低的特征。  相似文献   

15.
In this paper, we propose a method for predicting the distributions of people’s trajectories on the road network throughout a city. Specifically, we predict the number of people who will move from one area to another, their probable trajectories, and the corresponding likelihoods of those trajectories in the near future, such as within an hour. With this prediction, we will identify the hot road segments where potential traffic jams might occur and reveal the formation of those traffic jams. Accurate predictions of human trajectories at a city level in real time is challenging due to the uncertainty of people’s spatial and temporal mobility patterns, the complexity of a city level’s road network, and the scale of the data. To address these challenges, this paper proposes a method which includes several major components: (1) a model for predicting movements between neighboring areas, which combines both latent and explicit features that may influence the movements; (2) different methods to estimate corresponding flow trajectory distributions in the road network; (3) a MapReduce-based distributed algorithm to simulate large-scale trajectory distributions under real-time constraints. We conducted two case studies with taxi data collected from Beijing and New York City and systematically evaluated our method.  相似文献   

16.
孙阳  姚士谋  张落成 《地理科学》2018,38(6):827-837
在以“空间流”为逻辑的区域空间组织下,借由城际交通与信息网络的全面发展改变着社会经济空间结构的深度与广度,由此产生的“时空压缩”效应大幅度增强城市信息联系,促使现代城市在“空间流”的作用下不断扩展城市网络空间。针对中国在城镇化发展过程中出现的沿海三大城市群：长三角、京津冀以及珠三角城市群,对其进行城市空间网络分析,结果表明：① 公路运输、普通列车、高速列车、信息网络在一定程度上把相互连接的城市转变成为城市空间对外拓展的网络节点,拉近节点城市与周边城市的时空距离,带动城市群区域信息“网络化”结构的形成;② 长三角城市群城市空间网络主要以上海（沪）、南京（宁）核心节点城市构成,北翼网络化程度较高于南翼线性联系程度,其区域联系密度以“沪-宁”“沪-杭”沿线向两侧递减;其城市群城市网络拓展流向主要是以上海→湖州、上海→宁波、上海→泰州、南京→扬州、南京→镇江、南京→无锡、南京→苏州、南京→上海、杭州→宁波等城市流向,呈现典型多中心结构;③ 京津冀城市群城市空间网络主要以北京、天津为核心向外辐射,形成了以廊坊、沧州、承德、张家口等次级城市网络连线。其城市群城市间网络的拓展流向主要是以北京→天津、北京→石家庄、北京→秦皇岛、北京→廊坊、天津→秦皇岛、天津→石家庄等城市流向,呈现典型的双核心结构,这些城市彼此之间呈现复杂网状联系特征,其中,北京-天津-石家庄围成度中心网络的核心圈层,度中心值较低的其他10个城市节点组成外围低密度圈层;④ 珠三角城市群城市空间网络主要以广州、深圳、珠海为核心向外辐射,形成了以佛山、惠州、江门等次级城市网络连线。其城市群城市网络拓展方向主要以广州→深圳、广州→肇庆、广州→东莞、深圳→广州、深圳→东莞、珠海→东莞等城市流向。其中,广东、深圳处于网络的绝对中心位置,广东-深圳-东莞-佛山围成度中心网络的核心圈层,度中心值较低的其他5个城市节点组成外围低密度圈层,多核心网络结构特征显著。  相似文献   

17.
用多角度遥感数据反演混合像元组分温度的可行性分析   总被引：4，自引：0，他引：4  
利用多通道信息反演陆面温度的传统方法,由于通道间信息的高度相关使反演结果的精度难以提高,并且无法得到混合像元中的组分温度。文中以非同温混合像元热红外辐射方向性规律为基础,建立了连续植被类型非同温混合像元热红外辐射模型,用蒙特卡罗方法模拟分析了连续植被的组分有效比辐射率与变量的关系。结果表明:连续植被热辐射亮度值是组分温度Tv、Ts,叶面积指数LAI,叶倾角分布LAD,以及单叶面比辐射率εv(θ)和土壤表面比辐射率εv(θ)的函数。利用先验知识对变量进行分析后表明,6个变量中只有Tv、Ts、LAI、εv(0)需要反演。由于多角度间组分辐射亮度的相关性低,从理论上讲只需要4个角度的辐射亮度观测值就可以解出4个未知量而达到反演组分温度的目的。这4个角度数据除选择垂直方向上辐射亮度数据外,应在30°～50°视角范围内选择另外3个热辐射亮度数据。  相似文献   

18.
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.  相似文献   

19.
  相似文献   

20.
Few studies have been conducted into the use of knowledge transfer for tackling geo-simulation problems. Cellular automata (CA) have proven to be an effective and convenient means of simulating urban dynamics and land-use changes. Gathering the knowledge required to build the CA may be difficult when these models are applied to large areas or long periods. In this paper, we will explore the possibility that the knowledge from previously collected data can be transferred spatially (a different region) and/or temporally (a different period) for implementing urban CA. The domain adaptation of CA is demonstrated by integrating logistic-CA with a knowledge-transfer technique, the TrAdaBoost algorithm. A modification has been made to the TrAdaBoost algorithm by incorporating a dynamicweight-trimming technique. This proposed model, CAtrans, is tested by choosing different periods and study areas in the Pearl River Delta. The ‘Figure of Merit’ measurements in the experiments indicate that CAtrans can yield better simulation results. The variance of traditional logistic-CA is about 2–5 times the variance of CAtrans until the number of new data reaches 30. The experiments have demonstrated that the proposed method can alleviate the sparse data problem using knowledge transfer.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号