首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
As an important spatiotemporal simulation approach and an effective tool for developing and examining spatial optimization strategies (e.g., land allocation and planning), geospatial cellular automata (CA) models often require multiple data layers and consist of complicated algorithms in order to deal with the complex dynamic processes of interest and the intricate relationships and interactions between the processes and their driving factors. Also, massive amount of data may be used in CA simulations as high-resolution geospatial and non-spatial data are widely available. Thus, geospatial CA models can be both computationally intensive and data intensive, demanding extensive length of computing time and vast memory space. Based on a hybrid parallelism that combines processes with discrete memory and threads with global memory, we developed a parallel geospatial CA model for urban growth simulation over the heterogeneous computer architecture composed of multiple central processing units (CPUs) and graphics processing units (GPUs). Experiments with the datasets of California showed that the overall computing time for a 50-year simulation dropped from 13,647 seconds on a single CPU to 32 seconds using 64 GPU/CPU nodes. We conclude that the hybrid parallelism of geospatial CA over the emerging heterogeneous computer architectures provides scalable solutions to enabling complex simulations and optimizations with massive amount of data that were previously infeasible, sometimes impossible, using individual computing approaches.  相似文献   

2.
Hot crime areas are always targeted for police patrol to deter crimes. While much research has studied the distribution patterns of hot crime areas, research on the spatial distribution of crime within hot crime areas remains limited. Using burglary records in a large Chinese city, the ‘hottest’ place with the highest crime density was located using two spatial temporal kernel density estimation methods. The results indicated that the majority of crime within hot crime areas was concentrated within a small area distant from the hot area's center. These results provide a micro view of crime distribution within hot crime areas. Our analysis indicates that the results will not be affected by the methods adopted in identification of hot areas. This research is expected to improve the efficiency of police patrols.  相似文献   

3.
4.
Street profile analysis is a new method for analyzing temporal and spatial crime patterns along major roadways in metropolitan areas. This crime mapping technique allows for the identification of crime patterns along these street segments. These are linear spaces where aggregate crime patterns merge with crime attractors/generators and human movement to demonstrate how directionality is embedded in city infrastructures. Visually presenting the interplay between these criminological concepts and land use can improve police crime management strategies. This research presents how this crime mapping technique can be applied to a major roadway in Burnaby, Canada. This technique is contrasted with other crime mapping methods to demonstrate the utility of this approach when analyzing the rate and velocity of crime patterns overtime and in space.  相似文献   

5.
Spatiotemporal co-occurrence patterns (STCOPs) are subsets of Boolean features whose instances frequently co-occur in both space and time. The detection of STCOPs is crucial to the investigation of the spatiotemporal interactions among different features. However, prevalent STCOPs reported by available methods do not necessarily indicate the statistically significant dependence among different features, which is likely to result in highly erroneous assessments in practice. To improve the reliability of results, this paper develops a statistical method to detect STCOPs and discern their statistical significance. The proposed method detects STCOPs against the null hypothesis that the spatiotemporal distributions of different features are independent of each other. To construct the null hypothesis, suitable spatiotemporal point-process models considering spatiotemporal autocorrelation are employed to model the distributions of different features. The performance of the proposed statistical method is assessed by synthetic experiments and a case study aimed at identifying crime patterns among multiple crime types in Portland City. The experimental results demonstrate that the proposed method is more effective for detecting meaningful STCOPs than the available alternative methods.  相似文献   

6.
Agent-based models (ABM) allow for the bottom-up simulation of dynamics in complex adaptive spatial systems through the explicit representation of pattern–process interactions. This bottom-up simulation, however, has been identified as both data- and computing-intensive. While cyberinfrastrucutre provides such support for intensive computation, the appropriate management and use of cyberinfrastructure (CI)-enabled computing resources for ABM raise a challenging and intriguing issue. To gain insight into this issue, in this article we present a service-oriented simulation framework that supports spatially explicit agent-based modeling within a CI environment. This framework is designed at three levels: intermodel, intrasimulation, and individual. Functionalities at these levels are encapsulated into services, each of which is an assembly of new or existing services. Services at the intermodel and intrasimulation levels are suitable for generic ABM; individual-level services are designed specifically for modeling intelligent agents. The service-oriented simulation framework enables the integration of domain-specific functionalities for ABM and allows access to high-performance and distributed computing resources to perform simulation tasks that are often computationally intensive. We used a case study to investigate the utility of the framework in enabling agent-based modeling within a CI environment. We conducted experiments using supercomputing resources on the TeraGrid – a key element of the US CI. It is indicated that the service-oriented framework facilitates the leverage of CI-enabled resources for computationally intensive agent-based modeling.  相似文献   

7.
8.
Police databases hold a large amount of crime data that could be used to inform us about current and future crime trends and patterns. Predictive analysis aims to optimize the use of these data to anticipate criminal events. It utilizes specific statistical methods to predict the likelihood of new crime events at small spatiotemporal units of analysis. The aim of this study is to investigate the potential of applying predictive analysis in an urban context. To this end, the available crime data for three types of crime (home burglary, street robbery, and battery) are spatially aggregated to grids of 200 by 200 m and retrospectively analyzed. An ensemble model is applied, synthesizing the results of a logistic regression and neural network model, resulting in bi-weekly predictions for 2014, based on crime data from the previous three years. Temporally disaggregated (day versus night predictions) monthly predictions are also made. The quality of the predictions is evaluated based on the following criteria: direct hit rate (proportion of incidents correctly predicted), precision (proportion of correct predictions versus the total number of predictions), and prediction index (ratio of direct hit rate versus proportion of total area predicted as high risk). Results indicate that it is possible to attain functional predictions by applying predictive analysis to grid-level crime data. The monthly predictions with a distinction between day and night produce better results overall than the bi-weekly predictions, indicating that the temporal resolution can have an important impact on the prediction performance.  相似文献   

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

10.
ABSTRACT

Accurate crime prediction can help allocate police resources for crime reduction and prevention. There are two popular approaches to predict criminal activities: one is based on historical crime, and the other is based on environmental variables correlated with criminal patterns. Previous research on geo-statistical modeling mainly considered one type of data in space-time domain, and few sought to blend multi-source data. In this research, we proposed a spatio-temporal Cokriging algorithm to integrate historical crime data and urban transitional zones for more accurate crime prediction. Time-series historical crime data were used as the primary variable, while urban transitional zones identified from the VIIRS nightlight imagery were used as the secondary co-variable. The algorithm has been applied to predict weekly-based street crime and hotspots in Cincinnati, Ohio. Statistical tests and Predictive Accuracy Index (PAI) and Predictive Efficiency Index (PEI) tests were used to validate predictions in comparison with those of the control group without using the co-variable. The validation results demonstrate that the proposed algorithm with historical crime data and urban transitional zones increased the correlation coefficient by 5.4% for weekdays and by 12.3% for weekends in statistical tests, and gained higher hit rates measured by PAI/PEI in the hotspots test.  相似文献   

11.
犯罪预测对于制定警务策略、实施犯罪防控具有重要意义。机器学习和核密度是2类主流犯罪热点预测方法,然而目前还鲜有研究对这2类方法在不同时间周期下的犯罪预测效果进行系统比较,本文试图对此进行补充。本文以2013-2016年5月的公共盗窃犯罪历史数据作为输入,分别对比了在接下来2周、1个月、2个月、3个月4个不同时间周期随机森林方法与基于时空邻近性的核密度方法的犯罪热点预测效果,结果发现:在各时间周期上,随机森林分类热点预测方法的面积和案件量命中率均比时空核密度方法准确性高;并且2种方法均能有效地识别犯罪热点中的高发区域,其中在较小范围较短时间内随机森林识别热点中的高发区效率更高,而在较大范围较长时间周期上时空核密度方法识别高发区更优。  相似文献   

12.
犯罪出行是犯罪地理学的重要研究议题,在犯罪防控、侦破等警务实践中具有突出的技术贡献。受制于研究数据的限制,中国犯罪出行实证研究较为缺乏。论文研究了2010—2016年长春市南关区扒窃犯罪出行的空间模式与影响因素,并指出:① 2010—2016年长春市南关区扒窃犯罪出行平均距离为5.74 km,存在明显的空间衰减效应,空间模式为就近掠夺,在距离犯罪者居住地2 km处出现犯罪缓冲区。② 南关区扒窃犯罪高发区与犯罪群体主要聚居地在空间上呈现重叠,该区域犯罪以就近掠夺的空间模式为主。③ 回归模型验证了犯罪者人口属性中性别、户籍地、是否就业和具有前科劣迹、涉案金额、犯罪地点所属类型对于出行距离的显著影响,其中户籍地变量为理解转型期中国大城市犯罪行为具有一定意义。  相似文献   

13.
Research within the geography of crime and spatial criminology literature most often show that crime is highly concentrated in particular places. Moreover, a subset of this literature has shown that the spatial patterns of these concentrations are different across crime types. This raises questions regarding the appropriateness of aggregating crime types (property and violent crime, for example) when the underlying spatial pattern is of interest. In this paper, using crime data from Campinas, Brazil, we investigate the crime concentrations and the similarities among different crime types across space. Similar to some recent research in another context, we find that crime is highly concentrated in Campinas but the ability to aggregate similar crime types at the street segment level is not generalizability when compared to a North American context.  相似文献   

14.
街头抢劫者前犯罪经历对其后作案地选择的影响   总被引:1,自引:0,他引:1  
作案地选择是犯罪地理学的研究主题。已有的重复作案地选择的研究表明,犯罪者“前案件”作案地选择对他们“后案件”作案地选择具有影响,但以往研究关注的是先前的犯罪时间和地点对其后续作案地选择的影响,仍未检验犯罪者在“前案件”中犯罪经历的具体作用。因此,论文以中国东南沿海ZG市为例,利用街头抢劫者的抓捕数据和混合Logit模型,聚焦探析街头抢劫者先前的个体犯罪经历对他们随后的作案地选择的影响。研究发现:街头抢劫者在“前案件”中的犯罪间隔、犯罪出行和当场被捕等个体犯罪经历对其“后案件”作案地选择具有强烈的影响,即“前后案件”的犯罪间隔越临近、“前案件”犯罪出行距离越短,以及“前案件”未当场被捕,则大大增加了街头抢劫者返回到先前抢劫区域再次犯罪的可能性。并通过警察访谈和结合理论分析,发现“前案件”未当场被捕是由犯罪者当场被捕的恐惧感、警察特殊的干预方式,以及社会凝聚力和犯罪防控的相互作用而形成。研究结论可为警务部门的“事前防控”与“主动处置”提供一定的参考。  相似文献   

15.
柳林  吴林琳  张春霞  宋广文 《地理研究》2022,41(11):2851-2865
近年来,以盗窃为代表的接触型犯罪和以电信网络诈骗为代表的非接触型犯罪均呈多发态势,严重影响社会治安稳定。已有研究对不同类型犯罪分布模式的时空稳定性关注仍不够,且未能提出不同类型犯罪的空间联合防控策略。本文以ZG市HT区为例,以社区为分析单元,运用核密度估计、时空跃迁测度法等方法,对比分析2017年盗窃犯罪和电信网络诈骗犯罪的时空分布特征及其空间分布模式的月度稳定性,并从犯罪防控角度改进时空跃迁测度法,结合二阶聚类法识别两类犯罪联合防控空间类型。研究发现:① 两类犯罪时空稳定性差异大,盗窃犯罪的空间分布模式稳定,月度变化小;而电信网络诈骗犯罪空间稳定性整体波动起伏大,月度变化较大;② 识别出两类犯罪的四种联合防控空间类型,分别是“两类犯罪无需防控社区”“两类犯罪邻域防控社区”“盗窃犯罪热点防控、电信网络诈骗犯罪无需防控社区”“盗窃犯罪连片防控、电信网络诈骗综合防控社区”。该研究有助于了解接触型犯罪和非接触型犯罪时空特征的共性和差异性,给警务联合防控提供决策支持。  相似文献   

16.
犯罪地理研究与时空行为领域的研究有着共同的理论基础,二者都强调时空间环境与人类行为的相互作用。犯罪行为是人类特殊行为的一种,相关实证前沿已开始重视不同犯罪相关主体(犯罪者、潜在受害者、警察等)时空行为规律的挖掘、日常活动的动态衡量及不同主体行为的交互等方面对犯罪发生的影响;时空行为研究中的活动空间、环境暴露、群体分异、活动交互等维度的成果可拓展至犯罪地理研究。近年来,两大领域的前沿成果不断涌现,但目前仍缺乏从时空行为视角对犯罪地理学研究进行系统梳理,并对两者的融合创新进行深入探讨。为此,本研究在梳理犯罪地理中时空行为的理论基础和评述犯罪者、潜在受害者、警察时空活动对犯罪时空格局的影响研究基础上,基于犯罪地理和时空行为领域的交叉维度构建犯罪时空行为创新研究的框架,尝试推进该交叉领域在理论、方法与应用等方面的发展。  相似文献   

17.
Most existing point-based colocation methods are global measures (e.g., join count statistic, cross K function, and global colocation quotient). Most recently, a local indicator such as the local colocation quotient has been proposed to capture the variability of colocation across areas. Our research advances this line of work by developing a simulation-based statistical test for the local indicator of colocation quotient (LCLQ). The study applies the indicator to examine the association of land use facilities with crime patterns. Moreover, we use the street network distance in addition to the traditional Euclidean distance in defining neighbors because human activities (including facilities and crimes) usually occur along a street network. The method is applied to analyze the colocation of three types of crimes and three categories of facilities in a city in Jiangsu Province, China. The findings demonstrate the value of the proposed method in colocation analysis of crime and facilities and, in general, colocation analysis of point data.  相似文献   

18.
Whilst analysis of crime for tactical and strategic reasons within the criminal justice arena has now become an established need, predictive analysis of crime remains, and probably always will be, a goal to be desired. Opening a window on this over the last 2 decades, prominent research from academia has focused on the phenomenon of repeat victimisation and more recently ‘near repeat’ victimisation, both firmly grounded in the geography of crime. Somewhat limited to the establishment of near repeat behavioural patterns in whole area data, these can be utilised for crime prevention responses on a local scale. Research reported here however, explores the phenomenon through the examination of serial offending by individual offenders to establish if such spatio-temporal patterns are apparent in the spatial behavioural patterns of the individual burglar, and if so how they may be defined and therefore utilised on a micro rather than macro scale. It is hypothesised that offenders' responsible for more than one series of offences will display consistency across their crime series within time and distance parameters for their closest offences in space. Results improve upon current knowledge concerning near repeat offending being the actions of common offenders. Testing of the extracted data indicates that offenders maintain personal boundaries of ‘closeness’ in time and space even when actions are separated by significant time spans, creating stylised behavioural signatures appertaining to their use of and movement through space when offending.  相似文献   

19.
Two common practices in modeling of crime when crime data is available for multiple years are using single-year crime data corresponding to census data and taking the average of crime rate (or count) over multiple years. Current theoretical and empirical literature provides little, if any, rationale in support of either practice. Averaging multiple years is purported to reduce heterogeneity and minimize the measurement error in the year-to-year emergence of crime. However, it is unclear how useful the analysis of averaged and smoothed data is for revealing the relationship between crimes and socio-demographic and economic characteristics of every single year. In order to more clearly understand these two approaches, this paper applies a seemingly unrelated regression model to assess the temporal stability of model parameters. The model accounts for spatial autocorrelation among crime rates and social disorganization variables at the block group level.  相似文献   

20.
Geographically Weighted Regression (GWR) is a widely used tool for exploring spatial heterogeneity of processes over geographic space. GWR computes location-specific parameter estimates, which makes its calibration process computationally intensive. The maximum number of data points that can be handled by current open-source GWR software is approximately 15,000 observations on a standard desktop. In the era of big data, this places a severe limitation on the use of GWR. To overcome this limitation, we propose a highly scalable, open-source FastGWR implementation based on Python and the Message Passing Interface (MPI) that scales to the order of millions of observations. FastGWR optimizes memory usage along with parallelization to boost performance significantly. To illustrate the performance of FastGWR, a hedonic house price model is calibrated on approximately 1.3 million single-family residential properties from a Zillow dataset for the city of Los Angeles, which is the first effort to apply GWR to a dataset of this size. The results show that FastGWR scales linearly as the number of cores within the High-Performance Computing (HPC) environment increases. It also outperforms currently available open-sourced GWR software packages with drastic speed reductions – up to thousands of times faster – on a standard desktop.  相似文献   

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

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