Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems最新文献_第10页

On Spatial Joins in MapReduce 关于MapReduce中的空间连接

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2017-11-07 DOI: 10.1145/3139958.3139967

Ibrahim Sabek, M. Mokbel

引用次数: 16

Spatio-Temporal Reference Frames as Geographic Objects 作为地理对象的时空参考框架

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2017-11-01 DOI: 10.1145/3139958.3139983

Andrew J. Simmons, Rajesh Vasa

引用次数: 0

Characterizing Driving Context from Driver Behavior 从驾驶员行为刻画驾驶环境

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2017-10-13 DOI: 10.1145/3139958.3139992

Sobhan Moosavi, Behrooz Omidvar-Tehrani, R. B. Craig, Arnab Nandi, R. Ramnath

引用次数: 15

GUIDES: Geospatial Urban Infrastructure Data Engineering Solutions 指南:地理空间城市基础设施数据工程解决方案

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2017-10-11 DOI: 10.1145/3139958.3139968

B. Balasubramani, Omar Belingheri, Eric S. Boria, I. Cruz, S. Derrible, Michael D. Siciliano

{"title":"GUIDES: Geospatial Urban Infrastructure Data Engineering Solutions","authors":"B. Balasubramani, Omar Belingheri, Eric S. Boria, I. Cruz, S. Derrible, Michael D. Siciliano","doi":"10.1145/3139958.3139968","DOIUrl":"https://doi.org/10.1145/3139958.3139968","url":null,"abstract":"As the underground infrastructure systems of cities age, maintenance and repair become an increasing concern. Cities face difficulties in planning maintenance, predicting and responding to infrastructure related issues, and in realizing their vision to be a smart city due to their incomplete understanding of the existing state of the infrastructure. Only few cities have accurate and complete digital information on their underground infrastructure (e.g., electricity, water, natural gas) systems, which poses problems to those planning and performing construction projects. To address these issues, we introduce GUIDES as a new data conversion and management framework for urban underground infrastructure systems that enable city administrators, workers, and contractors along with the general public and other users to query digitized and integrated data to make smarter decisions. This demo paper presents the GUIDES architecture and describes two of its central components: (i) mapping of underground infrastructure systems, and (ii) integration of heterogeneous geospatial data.","PeriodicalId":270649,"journal":{"name":"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114453855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Crossing Patterns in Nonplanar Road Networks 非平面道路网中的交叉模式

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2017-09-18 DOI: 10.1145/3139958.3139999

D. Eppstein, Siddharth Gupta

引用次数: 30

Bayesian approach to Spatio-temporally Consistent Simulation of Daily Monsoon Rainfall over India 印度日季风降水时空一致模拟的贝叶斯方法

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2017-09-01 DOI: 10.1145/3139958.3139975

Adway Mitra

{"title":"Bayesian approach to Spatio-temporally Consistent Simulation of Daily Monsoon Rainfall over India","authors":"Adway Mitra","doi":"10.1145/3139958.3139975","DOIUrl":"https://doi.org/10.1145/3139958.3139975","url":null,"abstract":"Simulation of rainfall over a region for long time-sequences can be very useful for planning and policy-making, especially in India where the economy is heavily reliant on monsoon rainfall. However, such simulations should be able to preserve known spatial and temporal characteristics of rainfall over India. General Circulation Models (GCMs) are unable to do so, and various rainfall generators designed by hydrologists using stochastic processes like Gaussian Processes are also difficult to apply over the highly diverse landscape of India. In this paper, we explore a series of Bayesian models based on conditional distributions of latent variables that describe weather conditions at specific locations and over the whole country. During parameter estimation from observed data, we use spatio-temporal smoothing using Markov Random Field so that the parameters learnt are spatially and temporally coherent. Also, we use a nonparametric spatial clustering based on Chinese Restaurant Process to identify homogeneous regions, which are utilized by some of the proposed models to improve spatial correlations of the simulated rainfall. The models are able to simulate daily rainfall across India for years, and can also utilize contextual information for conditional simulation. We use two datasets of different spatial resolutions over India, and focus on the period 2000--2015. We consider metrics to study the spatio-temporal properties of the simulations by the models, and compare them with the observed data to evaluate the strengths and weaknesses of the models.","PeriodicalId":270649,"journal":{"name":"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132129708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Answering Spatial Multiple-Set Intersection Queries Using 2-3 Cuckoo Hash-Filters 利用2-3个杜鹃哈希过滤器回答空间多集交集查询

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2017-08-29 DOI: 10.1145/3139958.3140021

M. Goodrich

引用次数: 1

Defining Equitable Geographic Districts in Road Networks via Stable Matching 通过稳定匹配定义道路网中公平的地理区域

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2017-06-29 DOI: 10.1145/3139958.3140015

D. Eppstein, M. Goodrich, Doruk Korkmaz, Nil Mamano

{"title":"Defining Equitable Geographic Districts in Road Networks via Stable Matching","authors":"D. Eppstein, M. Goodrich, Doruk Korkmaz, Nil Mamano","doi":"10.1145/3139958.3140015","DOIUrl":"https://doi.org/10.1145/3139958.3140015","url":null,"abstract":"We introduce a novel method for defining geographic districts in road networks using stable matching. In this approach, each geographic district is defined in terms of a center, which identifies a location of interest, such as a post office or polling place, and all other network vertices must be labeled with the center to which they are associated. We focus on defining geographic districts that are equitable, in that every district has the same number of vertices and the assignment is stable in terms of geographic distance. That is, there is no unassigned vertex-center pair such that both would prefer each other over their current assignments. We solve this problem using a version of the classic stable matching problem, called symmetric stable matching, in which the preferences of the elements in both sets obey a certain symmetry. We show that, for a planar graph or road network with n nodes and k centers, the problem can be solved in O(n √ n log n) time, which improves upon the O(nk) runtime of using the classic Gale--Shapley stable matching algorithm when k is large. Finally, we provide experimental results on road networks for these algorithms and a heuristic algorithm that performs better than the Gale--Shapley algorithm for any range of values of k.","PeriodicalId":270649,"journal":{"name":"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125302398","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11

Large-Scale Mapping of Human Activity using Geo-Tagged Videos 使用地理标记视频的大规模人类活动制图

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2017-06-24 DOI: 10.1145/3139958.3140055

Yi Zhu, Sen Liu, S. Newsam

引用次数: 8

The Optimal Route and Stops for a Group of Users in a Road Network 路网中一组用户的最优路线和站点

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2017-06-23 DOI: 10.1145/3139958.3140061

Radi Muhammad Reza, Mohammed Eunus Ali, M. A. Cheema

{"title":"The Optimal Route and Stops for a Group of Users in a Road Network","authors":"Radi Muhammad Reza, Mohammed Eunus Ali, M. A. Cheema","doi":"10.1145/3139958.3140061","DOIUrl":"https://doi.org/10.1145/3139958.3140061","url":null,"abstract":"The rise of innovative transportation services and the recent breakthrough in the development of autonomous vehicles have stimulated the research on collective travel planning problems such as ride-sharing, carpooling, and on-demand vehicle routing in recent years. In this paper, we introduce several optimization problems to recommend a suitable route and stops of a vehicle, in a road network, for a group of users intending to travel collectively. The goal of each problem is to minimize the aggregate cost of the individual travelers' paths and the shared route under various constraints. First, we introduce the optimal end-stops (OES) query that finds a pair of pick-up-and-drop-off locations such that the sum of the distance between these locations and the total distance traveled by the travelers from their start locations to the pick-up location and from the drop-off location to their end locations is minimized. We propose a polynomial-time fast algorithm for the OES query by utilizing the path-coherence property of road networks. Second, we formulate the optimal route and intermediate stops (ORIS) query to find a set of intermediate stops for the vehicle such that the sum of the total distance traveled by the vehicle and the total distance traveled by the travelers from their start locations to one of the stops and to their end locations from one of the stops is minimized. We propose a novel near-optimal polynomial-time-and-space heuristic algorithm for the ORIS query that performs reasonably well in practice. We also analyze several variants of this problem. Finally, we perform extensive experiments to demonstrate the efficiency and efficacy of our algorithms.","PeriodicalId":270649,"journal":{"name":"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116298454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6