Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems最新文献

筛选
英文 中文
GeoSpark: a cluster computing framework for processing large-scale spatial data GeoSpark:用于处理大规模空间数据的集群计算框架
Jia Yu, Jinxuan Wu, Mohamed Sarwat
{"title":"GeoSpark: a cluster computing framework for processing large-scale spatial data","authors":"Jia Yu, Jinxuan Wu, Mohamed Sarwat","doi":"10.1145/2820783.2820860","DOIUrl":"https://doi.org/10.1145/2820783.2820860","url":null,"abstract":"This paper introduces GeoSpark an in-memory cluster computing framework for processing large-scale spatial data. GeoSpark consists of three layers: Apache Spark Layer, Spatial RDD Layer and Spatial Query Processing Layer. Apache Spark Layer provides basic Spark functionalities that include loading / storing data to disk as well as regular RDD operations. Spatial RDD Layer consists of three novel Spatial Resilient Distributed Datasets (SRDDs) which extend regular Apache Spark RDDs to support geometrical and spatial objects. GeoSpark provides a geometrical operations library that accesses Spatial RDDs to perform basic geometrical operations (e.g., Overlap, Intersect). System users can leverage the newly defined SRDDs to effectively develop spatial data processing programs in Spark. The Spatial Query Processing Layer efficiently executes spatial query processing algorithms (e.g., Spatial Range, Join, KNN query) on SRDDs. GeoSpark also allows users to create a spatial index (e.g., R-tree, Quad-tree) that boosts spatial data processing performance in each SRDD partition. Preliminary experiments show that GeoSpark achieves better run time performance than its Hadoop-based counterparts (e.g., SpatialHadoop).","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134050776","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}
引用次数: 338
Optimal mobile facility localization 最优移动设施定位
A. K. M. M. R. Khan, L. Kulik, E. Tanin, T. Hashem
{"title":"Optimal mobile facility localization","authors":"A. K. M. M. R. Khan, L. Kulik, E. Tanin, T. Hashem","doi":"10.1145/2820783.2820862","DOIUrl":"https://doi.org/10.1145/2820783.2820862","url":null,"abstract":"We introduce a new type of spatial query, Optimal Accessible Location (OAL) query. When a set of paths is provided the query finds the best location from a set of locations that has the optimal accessibility from these paths. OAL queries have many applications such as the selection of the optimal location for a mobile facility such as a food truck or selection of a venue for an event. We exploit geometric properties and develop pruning techniques to eliminate unrelated path segments as well as locations. Our experimental results demonstrate that we provide a readily deployable solution for real-life applications.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130587010","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}
引用次数: 3
Video route 视频的路线
Tobias Emrich, Olivia Hofer, A. Kolb, Johannes Niedermayer, Nepumuk Seiler, Michael Weiler
{"title":"Video route","authors":"Tobias Emrich, Olivia Hofer, A. Kolb, Johannes Niedermayer, Nepumuk Seiler, Michael Weiler","doi":"10.1145/2820783.2820793","DOIUrl":"https://doi.org/10.1145/2820783.2820793","url":null,"abstract":"The always increasing number of videos on the internet yield data for novel quite useful multimedial service applications, but finding videos best satisfying the users need is becoming challenging. At the same time, new video collection platforms allow to upload videos enriched with positional metadata when recorded with a GPS-enabled device such as a smartphone. These platforms can thus go beyond the prevalent keyword search and instead take advantage from the positional metadata of videos, e.g., to find videos recorded in a certain area. This information, however allows for much more interesting queries. In this paper we present Video Route which allows a user to specify a target route (query) and obtain an approximation of the target route that is piecewise composed of subtrajectories derived from a set of given trajectories. Our approach is aimed at high approximation accuracy while keeping the number of composed subtrajectories low.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132582847","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}
引用次数: 1
Designing an on-line ride-sharing system 设计一个在线拼车系统
Blerim Cici, A. Markopoulou, Nikolaos Laoutaris
{"title":"Designing an on-line ride-sharing system","authors":"Blerim Cici, A. Markopoulou, Nikolaos Laoutaris","doi":"10.1145/2820783.2820850","DOIUrl":"https://doi.org/10.1145/2820783.2820850","url":null,"abstract":"Ride-sharing systems have the potential to match travelers with similar itineraries and time schedules, and to bring significant benefits to individual users and the city as a whole. However, this is a challenging task, since users' requests are not known in advance and they become available a few minutes before departure. In this paper, we design an online ride sharing system, where drivers and passengers send their requests for a ride in advance, possibly on a short notice. Our design is efficient and optimal. This is achieved by dividing the system into two components: the constraint satisfier and the matching module. The constraint satisfier takes as input the spatio-temporal constraints of drivers and passengers and provides feasible (driver, passenger) pairs in real time, and the matching module takes as input the feasible pairs and provides a maximum cardinality matching of drivers and passengers. Our preliminary evaluation shows that the constraint satisfier can resolve the most expensive queries (matching of passenger to en-route drivers) in 2 seconds (on average), while the matching module can achieve a matching ratio of 78% when the offline upper-bound is 80%.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125904168","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}
引用次数: 26
Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems 第23届SIGSPATIAL国际地理信息系统进展会议论文集
Mohamed H. Ali, Y. Huang, Michael Gertz, M. Renz, Jagan Sankaranarayanan
{"title":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","authors":"Mohamed H. Ali, Y. Huang, Michael Gertz, M. Renz, Jagan Sankaranarayanan","doi":"10.1145/2820783","DOIUrl":"https://doi.org/10.1145/2820783","url":null,"abstract":"This is the proceedings of the 23rd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL 2015), held in Seattle, Washington, USA, November 3--6, 2015. This conference is the twenty-third edition in a series of symposia and workshops that began in 1993 with the aim of promoting interdisciplinary discussions among researchers, developers, users, and practitioners and fostering research in all aspects of geographic information systems, especially in relation to novel systems based on geospatial data and knowledge. The conference provides a forum for original research contributions covering all conceptual, design, and implementation aspects of geospatial data ranging from applications, user interfaces, and visualization to data storage, query processing, indexing and data mining. The conference is the premier annual event of the ACM Special Interest Group on Spatial Information (ACM SIGSPATIAL).","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127151400","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}
引用次数: 3
Querying historical maps as a unified, structured, and linked spatiotemporal source: vision paper 查询历史地图作为一个统一的,结构化的,和链接的时空来源:视觉论文
Yao-Yi Chiang
{"title":"Querying historical maps as a unified, structured, and linked spatiotemporal source: vision paper","authors":"Yao-Yi Chiang","doi":"10.1145/2820783.2820887","DOIUrl":"https://doi.org/10.1145/2820783.2820887","url":null,"abstract":"Historical spatiotemporal datasets are important for a variety of studies such as cancer and environmental epidemiology, urbanization, and landscape ecology. However, existing data sources typically contain only contemporary datasets. Historical maps hold a great deal of detailed geographic information at various times in the past. Yet, finding relevant maps is difficult and the map content are not machine-readable. I envision a map processing, modeling, linking, and publishing framework that allows querying historical map collections as a unified and structured spatiotemporal source in which individual geographic phenomena (extracted from maps) are modeled with semantic descriptions and linked to other data sources (e.g., DBpedia). This framework will make it possible to efficiently study historical spatiotemporal datasets on a large scale. Realizing such a framework poses significant research challenges in multiple fields in computer science including digital map processing, data integration, and the Semantic Web technologies, and other disciplines such as spatial, earth, social, and health sciences. Tackling these challenges will not only advance research in computer science but also present a unique opportunity for interdisciplinary research.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127263948","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}
引用次数: 12
MigrO: a plug-in for the analysis of individual mobility behavior based on the stay region model MigrO:基于停留区域模型分析个人移动行为的插件
M. Damiani, H. Issa, Giuseppe Fotino, F. Hachem, N. Ranc, F. Cagnacci
{"title":"MigrO: a plug-in for the analysis of individual mobility behavior based on the stay region model","authors":"M. Damiani, H. Issa, Giuseppe Fotino, F. Hachem, N. Ranc, F. Cagnacci","doi":"10.1145/2820783.2820794","DOIUrl":"https://doi.org/10.1145/2820783.2820794","url":null,"abstract":"We present MigrO, a clustering environment for the extraction of individual mobility patterns from GPS trajectories, relying on the notion of stay region [1]. A stay region is an 'attractive' area where the moving object resides for a period, possibly experiencing arbitrarily long periods of absence, before moving to a more attractive stay region. The core component is the SeqScan algorithm for the extraction of temporally ordered sequences of stay regions grounded on the notion of presence. An additional set of functionalities support trajectory pre-processing and clustering evaluation. MigrO is developed as plug-in for the open-source QuantumGIS system thus can exploit the rich set of functionalities of the hosting system, offering a formidable platform for the analysis of the mobility behavior. In this demonstration, we present MigrO at work in two case studies, both from the domain of animal ecology, illustrating two kinds of behavior, the migratory behavior and the exploratory behavior of two species of animals.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128850646","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}
引用次数: 7
Find the butterfly: a social media based arterial incidents detection and causality analysis system 寻找蝴蝶:基于社交媒体的动脉事件检测和因果分析系统
Kaiqun Fu, Weisheng Zhong, Chang-Tien Lu, Arnold P. Boedihardjo
{"title":"Find the butterfly: a social media based arterial incidents detection and causality analysis system","authors":"Kaiqun Fu, Weisheng Zhong, Chang-Tien Lu, Arnold P. Boedihardjo","doi":"10.1145/2820783.2820797","DOIUrl":"https://doi.org/10.1145/2820783.2820797","url":null,"abstract":"Traditional statistical analysis on speed, volume, and occupancy has dominated the field of Arterial Incident Management Study (AIMS). However, few previous works have focused on investigating into the causality of the incidents. In this paper, we present ButterFly, a social media based arterial incident detection and analysis system. The proposed system is dedicated to identify the traffic incident from a novel perspective and discover causalities between traffic incidents. The main functionalities of the proposed system include: 1) Traffic incident detection based on userinput social media contents, 2) Transportation incidents storyline generation, and 3) Traffic incidents causalities analysis and visualization. We demonstrate the system by considering the Washington DC area as our experimental environment. ButterFly is targeted to provide effective and convenient real-time and historical traffic incidents analysis interfaces for transportation management agencies and academies. Our proposed system, integrated with multiple social media resources, can greatly broaden the visions for traffic incidents analysis.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126314031","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}
引用次数: 3
Towards distributed convoy pattern mining 面向分布式护航模式挖掘
F. Orakzai, T. Devogele, T. Calders
{"title":"Towards distributed convoy pattern mining","authors":"F. Orakzai, T. Devogele, T. Calders","doi":"10.1145/2820783.2820840","DOIUrl":"https://doi.org/10.1145/2820783.2820840","url":null,"abstract":"Mining movement data to reveal interesting behavioral patterns has gained attention in recent years. One such pattern is the convoy pattern which consists of at least m objects moving together for at least k consecutive time instants where m and k are user-defined parameters. Existing algorithms for detecting convoy patterns, however do not scale to real-life dataset sizes. Therefore a distributed algorithm for convoy mining is inevitable. In this paper, we discuss the problem of convoy mining and analyze different data partitioning strategies to pave the way for a generic distributed convoy pattern mining algorithm.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121019666","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
Detecting urban black holes based on human mobility data 基于人类移动数据探测城市黑洞
Liang Hong, Yu Zheng, Duncan Yung, Jingbo Shang, Lei Zou
{"title":"Detecting urban black holes based on human mobility data","authors":"Liang Hong, Yu Zheng, Duncan Yung, Jingbo Shang, Lei Zou","doi":"10.1145/2820783.2820811","DOIUrl":"https://doi.org/10.1145/2820783.2820811","url":null,"abstract":"Many types of human mobility data, such as flows of taxicabs, card swiping data of subways, bike trip data and Call Details Records (CDR), can be modeled by a Spatio-Temporal Graph (STG). STG is a directed graph in which vertices and edges are associated with spatio-temporal properties (e.g. the traffic flow on a road and the geospatial location of an intersection). In this paper, we instantly detect interesting phenomena, entitled black holes and volcanos, from an STG. Specifically, a black hole is a subgraph (of an STG) that has the overall inflow greater than the overall outflow by a threshold, while a volcano is a subgraph with the overall outflow greater than the overall inflow by a threshold (detecting volcanos from an STG is proved to be equivalent to the detection of black holes). The online detection of black holes/volcanos can timely reflect anomalous events, such as disasters, catastrophic accidents, and therefore help keep public safety. The patterns of black holes/volcanos and the relations between them reveal human mobility patterns in a city, thus help formulate a better city planning or improve a system's operation efficiency. Based on a well-designed STG index, we propose a two-step black hole detection algorithm: The first step identifies a set of candidate grid cells to start from; the second step expands an initial edge in a candidate cell to a black hole and prunes other candidate cells after a black hole is detected. Then, we adapt this detection algorithm to a continuous black hole detection scenario. We evaluate our method based on Beijing taxicab data and the bike trip data in New York, finding urban anomalies and human mobility patterns.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121122342","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}
引用次数: 74
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书