Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems最新文献

筛选
英文 中文
GeoTrend: spatial trending queries on real-time microblogs GeoTrend:实时微博上的空间趋势查询
A. Magdy, Ahmed M. Aly, M. Mokbel, S. Elnikety, Yuxiong He, Suman Nath, Walid G. Aref
{"title":"GeoTrend: spatial trending queries on real-time microblogs","authors":"A. Magdy, Ahmed M. Aly, M. Mokbel, S. Elnikety, Yuxiong He, Suman Nath, Walid G. Aref","doi":"10.1145/2996913.2996986","DOIUrl":"https://doi.org/10.1145/2996913.2996986","url":null,"abstract":"This paper presents GeoTrend; a system for scalable support of spatial trend discovery on recent microblogs, e.g., tweets and online reviews, that come in real time. GeoTrend is distinguished from existing techniques in three aspects: (1) It discovers trends in arbitrary spatial regions, e.g., city blocks. (2) It supports trending measures that effectively capture trending items under a variety of definitions that suit different applications. (3) It promotes recent microblogs as first-class citizens and optimizes its system components to digest a continuous flow of fast data in main-memory while removing old data efficiently. GeoTrend queries are top-k queries that discover the most trending k keywords that are posted within an arbitrary spatial region and during the last T time units. To support its queries efficiently, GeoTrend employs an in-memory spatial index that is able to efficiently digest incoming data and expire data that is beyond the last T time units. The index also materializes top-k keywords in different spatial regions so that incoming queries can be processed with low latency. In case of peak times, a main-memory optimization technique is employed to shed less important data, so that the system still sustains high query accuracy with limited memory resources. Experimental results based on real Twitter feed and Bing Mobile spatial search queries show the scalability of GeoTrend to support arrival rates of up to 50,000 microblog/second, average query latency of 3 milli-seconds, and at least 90+% query accuracy even under limited memory resources.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"14 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80028767","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
Spatio-temporal modeling of the topology of swarm behavior with persistence landscapes 基于持续性景观的蜂群行为拓扑的时空建模
P. Corcoran, Christopher B. Jones
{"title":"Spatio-temporal modeling of the topology of swarm behavior with persistence landscapes","authors":"P. Corcoran, Christopher B. Jones","doi":"10.1145/2996913.2996949","DOIUrl":"https://doi.org/10.1145/2996913.2996949","url":null,"abstract":"We propose a method for modeling the topology of swarm behavior in a manner which facilitates the application of machine learning techniques such as clustering. This is achieved by modeling the persistence of topological features, such as connected components and holes, of the swarm with respect to time using zig-zag persistent homology. The output of this model is subsequently transformed into a representation known as a persistence landscape. This representation forms a vector space and therefore facilitates the application of machine learning techniques. The proposed model is validated using a real data set corresponding to a swarm of 300 fish. We demonstrate that it may be used to perform clustering of swarm behavior with respect to topological features.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"10 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79057679","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
Immersive tangible geospatial modeling 沉浸式有形地理空间建模
Payam Tabrizian, A. Petrasova, B. Harmon, V. Petras, H. Mitásová, R. Meentemeyer
{"title":"Immersive tangible geospatial modeling","authors":"Payam Tabrizian, A. Petrasova, B. Harmon, V. Petras, H. Mitásová, R. Meentemeyer","doi":"10.1145/2996913.2996950","DOIUrl":"https://doi.org/10.1145/2996913.2996950","url":null,"abstract":"Tangible Landscape is a tangible interface for geographic information systems (GIS). It interactively couples physical and digital models of a landscape so that users can intuitively explore, model, and analyze geospatial data in a collaborative environment. Conceptually Tangible Landscape lets users hold a GIS in their hands so that they can feel the shape of the topography, naturally sculpt new landforms, and interact with simulations like water flow. Since it only affords a bird's-eye view of the landscape, we coupled it with an immersive virtual environment so that users can virtually walk around the modeled landscape and visualize it at a human-scale. Now as users shape topography, draw trees, define viewpoints, or route a walkthrough, they can see the results on the projection-augmented model, rendered on a display, or rendered on a head-mounted display. In this paper we present the Tangible Landscape Immersive Extension, describe its physical setup and software architecture, and demonstrate its features with a case study.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"75 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80664204","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}
引用次数: 14
A traffic flow approach to early detection of gathering events 一种用于早期检测聚集事件的交通流方法
Xun Zhou, Amin Vahedian Khezerlou, A. Liu, M. Shafiq, Fan Zhang
{"title":"A traffic flow approach to early detection of gathering events","authors":"Xun Zhou, Amin Vahedian Khezerlou, A. Liu, M. Shafiq, Fan Zhang","doi":"10.1145/2996913.2996998","DOIUrl":"https://doi.org/10.1145/2996913.2996998","url":null,"abstract":"Given a spatial field and the traffic flow between neighboring locations, the early detection of gathering events (edge) problem aims to discover and localize a set of most likely gathering events. It is important for city planners to identify emerging gathering events which might cause public safety or sustainability concerns. However, it is challenging to solve the edge problem due to numerous candidate gathering footprints in a spatial field and the non-trivial task to balance pattern quality and computational efficiency. Prior solutions to model the edge problem lack the ability to describe the dynamic flow of traffic and the potential gathering destinations because they rely on static or undirected footprints. In contrast, in this paper, we model the footprint of a gathering event as a Gathering directed acyclic Graph (G-Graph), where the root of the G-Graph is the potential destination and the directed edges represent the most likely paths traffic takes to move towards the destination. We also proposed an efficient algorithm called SmartEdge to discover the most likely non-overlapping G-Graphs in the given spatial field. Our analysis shows that the proposed G-Graph model and the SmartEdge algorithm have the ability to efficiently and effectively capture important gathering events from real-world human mobility data. Our experimental evaluations show that SmartEdge saves 50% computation time over the baseline algorithm.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"2015 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82618484","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}
引用次数: 31
Mining city-wide encounters in real-time 实时挖掘全市范围内的遭遇
Anthony Quattrone, L. Kulik, E. Tanin
{"title":"Mining city-wide encounters in real-time","authors":"Anthony Quattrone, L. Kulik, E. Tanin","doi":"10.1145/2996913.2996995","DOIUrl":"https://doi.org/10.1145/2996913.2996995","url":null,"abstract":"Recent advancements in data mining coupled with the ubiquity of mobile devices has led to the possibility of mining for events in real-time. We introduce the problem of mining for an individual's encounters. As people travel, they may have encounters with one another. We are interested in detecting the encounters of traveling individuals at the exact moment in which each of them occur. A simple solution is to use a nearest neighbor search to return potential encounters, this results in slow query response times. To mine for encounters in real-time, we introduce a new algorithm that is efficient in capturing encounters by exploiting the observation that just the neighbors in a defined proximity needs to be maintained. Our evaluation demonstrates that our proposed method mines for encounters for millions of individuals in a city area within milliseconds.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88586673","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
Implementing data-dependent triangulations with higher order Delaunay triangulations 用高阶Delaunay三角剖分实现依赖数据的三角剖分
Natalia Rodríguez, Rodrigo I. Silveira
{"title":"Implementing data-dependent triangulations with higher order Delaunay triangulations","authors":"Natalia Rodríguez, Rodrigo I. Silveira","doi":"10.1145/2996913.2996958","DOIUrl":"https://doi.org/10.1145/2996913.2996958","url":null,"abstract":"The Delaunay triangulation is the standard choice for building triangulated irregular networks (TINs) to represent terrain surfaces. However, the Delaunay triangulation is based only on the 2D coordinates of the data points, ignoring their elevation. It has long been recognized that sometimes it may be beneficial to use other, non-Delaunay, criteria to build TINs. Data-dependent triangulations were introduced decades ago to address this. However, they are rarely used in practice, mostly because the optimization of data- dependent criteria often results in triangulations with many thin and elongated triangles. Recently, in the field of computational geometry, higher order Delaunay triangulations (HODTs) were introduced, trying to tackle both issues at the same time-data-dependent criteria and good triangle shape. Nevertheless, most previous studies about them have been limited to theoretical aspects. In this work we present the first extensive experimental study on the practical use of HODTs, as a tool to build data-dependent TINs. We present experiments with two USGS terrains that show that HODTs can give significant improvements over the Delaunay triangulation for the criteria identified as most important for data-dependent triangulations. The resulting triangulations have data-dependent values comparable to those obtained with pure data-dependent approaches, without compromising the shape of the triangles, and are faster to compute.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"27 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84464266","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
An online localization method for a subway train utilizing the barometer on a smartphone 利用智能手机上的气压计进行地铁列车在线定位的方法
S. Hyuga, Masaki Ito, M. Iwai, K. Sezaki
{"title":"An online localization method for a subway train utilizing the barometer on a smartphone","authors":"S. Hyuga, Masaki Ito, M. Iwai, K. Sezaki","doi":"10.1145/2996913.2996999","DOIUrl":"https://doi.org/10.1145/2996913.2996999","url":null,"abstract":"Knowing the location of a train is necessary for the development of useful services for train passengers. However, popular localization methods such as GPS and Wi-Fi are not accurate, especially on a subway. This paper proposes an online algorithm for localization on a subway using only a barometer. We estimate the motion state from the change of elevation, then estimate the last station stopped at using the similarity of a series of elevations recorded when the train stopped to the actual elevations of the stations. We evaluated the proposed method using data from the subway in Tokyo. We also developed a mobile application to demonstrate the proposed method.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89775322","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}
引用次数: 4
Automatic detection and matching of geospatial properties in transportation data sources (demo paper) 交通数据源中地理空间属性的自动检测和匹配(演示文件)
A. Masri, K. Zeitouni, Zoubida Kedad, Bertrand Leroy
{"title":"Automatic detection and matching of geospatial properties in transportation data sources (demo paper)","authors":"A. Masri, K. Zeitouni, Zoubida Kedad, Bertrand Leroy","doi":"10.1145/2996913.2996959","DOIUrl":"https://doi.org/10.1145/2996913.2996959","url":null,"abstract":"Integrating transportation data is a key issue to provide passengers with optimized and more suitable trips that combines multiple transportation modes. Current integration solutions in the transportation domain mostly rely on experts knowledge and manual matching tasks. Besides, existing automatic matching solutions do not exploit the geospatial features of the data. This demo introduces an instance based system to identify geospatial properties and match transportation points of transfers using geocoding services as mediators.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73762677","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
Pyspatiotemporalgeom: a python library for spatiotemporal types and operations Pyspatiotemporalgeom:一个用于时空类型和操作的python库
Mark McKenney, Niharika Nyalakonda, Jarrod McEvers, Mitchell Shipton
{"title":"Pyspatiotemporalgeom: a python library for spatiotemporal types and operations","authors":"Mark McKenney, Niharika Nyalakonda, Jarrod McEvers, Mitchell Shipton","doi":"10.1145/2996913.2996973","DOIUrl":"https://doi.org/10.1145/2996913.2996973","url":null,"abstract":"The Pyspatiotemporalgeom library is a pure-python library implementing spatial data types, spatiotemporal data types for moving regions, and operations to create and analyze those types. The library is available on the Python Package Index (PyPI) and has been downloaded over 18,000 times since its release. In this paper, we demonstrate mechanisms to create random spatial data and perform operations over them. We then show how to create moving regions from existing data, and demonstrate aggregate operations over moving regions.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"45 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73695617","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}
引用次数: 2
CDO: extremely high-throughput road distance computations on city road networks CDO:在城市道路网络上进行极高吞吐量的道路距离计算
Shangfu Peng, H. Samet
{"title":"CDO: extremely high-throughput road distance computations on city road networks","authors":"Shangfu Peng, H. Samet","doi":"10.1145/2996913.2996921","DOIUrl":"https://doi.org/10.1145/2996913.2996921","url":null,"abstract":"Some analytic queries on road networks, usually concentrating in a local area spanning several cities, need a high-throughput solution such as performing millions of shortest distance computations per second. However, most existing solutions achieve less than 5, 000 shortest distance computations per second per machine even with multi-threads. We demonstrate a solution, termed City Distance Oracles (CDO), using our previously developed ε-distance oracle to achieve as many as 7 million shortest distance computations per second per commodity machine on a city road network, i.e., 10K × 10K origin-distance (OD) matrix can be finished in 14 seconds.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"82 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76111647","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
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学术官方微信