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

筛选
英文 中文
Understanding and modelling information dissemination patterns in vehicle-to-vehicle networks 了解和建模车对车网络中的信息传播模式
J. Ding, Jie Gao, Hui Xiong
{"title":"Understanding and modelling information dissemination patterns in vehicle-to-vehicle networks","authors":"J. Ding, Jie Gao, Hui Xiong","doi":"10.1145/2820783.2820814","DOIUrl":"https://doi.org/10.1145/2820783.2820814","url":null,"abstract":"Advances in wireless communication technology have enabled information exchange opportunities between moving vehicles within proximity. Potentially through such physical contacts a piece of information can diffuse to the entire network. While there has been extensive research on information diffusion in social networks, we do not know much about the spatial patterns in vehicle motion and how such patterns can support information dissemination. To this end, in this paper, we provide a systematic study of three large-scale data sets of taxi GPS traces from three big cities. The study shows the following properties universal of the three data sets: 1) the small world property, that information can be disseminated to almost the entire set of participants, within a very small number of hops; 2) certain physical contacts can be extremely effective in exchanging messages and such effectiveness shows a power law distribution; 3) the lack of hubs, no vehicle behaves as major hubs; removing top 20% nodes that have the highest number of physical contacts does not affect the effectiveness of information dissemination. 4) the information dissemination exhibits strong spatial temporal correlation. Finally, to explain the observations in particular the small world property, we develop mathematical models of the taxi movement patterns such that on graph topologies exhibiting properties of real-world road networks a number of observations can be rigorously proved.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"1 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":"130463228","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}
引用次数: 13
Analytical queries on road networks: an experimental evaluation of two system architectures 道路网络的分析查询:两种系统架构的实验评估
Shangfu Peng, H. Samet
{"title":"Analytical queries on road networks: an experimental evaluation of two system architectures","authors":"Shangfu Peng, H. Samet","doi":"10.1145/2820783.2820806","DOIUrl":"https://doi.org/10.1145/2820783.2820806","url":null,"abstract":"Spatial analytical queries on road networks typically perform hundreds of thousands to several millions of shortest distance computations in the process of producing results. These queries require architectures that can compute a large number of network distances. Two architectures are evaluated on a variety of spatial analytical queries on road networks. The first architecture is a widely used hybrid architecture that uses a database to store spatial datasets, a road network distance computing module, and an analysis tool to tie them together into a single query processing pipeline. The second architecture uses of a distance oracle representation of a road network. This architecture stores the spatial datasets and the distance oracle inside the database, and the query processing is completely handled by the database. A detailed evaluation of the two architectures for a variety of analytical query processing tasks such as region, KNN, distance matrix and trajectory queries is presented and the lessons learned are discussed.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"1 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":"129520761","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}
引用次数: 13
Reverse k-nearest neighbour schedules in time-dependent road networks 时变路网中反向k近邻调度
Felix Borutta, M. Nascimento, Johannes Niedermayer, Peer Kröger
{"title":"Reverse k-nearest neighbour schedules in time-dependent road networks","authors":"Felix Borutta, M. Nascimento, Johannes Niedermayer, Peer Kröger","doi":"10.1145/2820783.2820809","DOIUrl":"https://doi.org/10.1145/2820783.2820809","url":null,"abstract":"Despite the wealth of research published on reverse k-nearest neighbour (RkNN) queries very few attempts have been made to solve the problem in time-dependent networks, i.e., networks where the edge cost varies with time. A typical example of such network is one made of a city's streets. An interesting consequence of such assumption is that set of RkNNs can change over time even if the objects are not moving. We present an efficient algorithm that computes a RkNN schedule for a given time interval, e.g., one day. Once computed, such schedule allows one to find the RkNNs for any point within the given time interval doing a simple table lookup. We experimentally evaluate our novel methods using a straightforward solution, namely computing the RkNN set for every (discrete) instant within a time interval. Our results show that the proposed algorithms are orders of magnitude faster than such baseline approach.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"1 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":"129939003","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}
引用次数: 5
Decentralized human trajectories tracking using hodge decomposition in sensor networks 传感器网络中基于hodge分解的分散人体轨迹跟踪
Xiaotian Yin, Chien-Chun Ni, J. Ding, Wei Han, Dengpan Zhou, Jie Gao, X. Gu
{"title":"Decentralized human trajectories tracking using hodge decomposition in sensor networks","authors":"Xiaotian Yin, Chien-Chun Ni, J. Ding, Wei Han, Dengpan Zhou, Jie Gao, X. Gu","doi":"10.1145/2820783.2820844","DOIUrl":"https://doi.org/10.1145/2820783.2820844","url":null,"abstract":"With the recent development of localization and tracking systems for both indoor and outdoor settings, we consider the problem of analyzing and representing the huge amount of natural trajectories from human movements that we expect to gather in the near future. In this paper we argue the topological representation, which records how a target moves around the natural obstacles in the underlying environment, can be sufficiently descriptive for many applications and efficient enough for both storing, comparing and classifying these natural human trajectories. Technically, the representation uses the homotopy type of the trajectory. By using harmonic one-forms and Hodge decomposition, we pre-process the sensor network with a purely decentralized algorithm such that the homology class of a trajectory can be obtained by a simple integration along the trajectory. This supports real-time classification of trajectories up to the homology accuracy with minimum communication cost. We test the effectiveness of our approach by showing how to classify randomly generated trajectories in a multi-level arts museum layout as well as how to distinguish real world taxi trajectories in a large city.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"12 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":"130813375","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
GeoDa web: enhancing web-based mapping with spatial analytics GeoDa web:通过空间分析增强基于web的地图
Xun Li, L. Anselin, Julia Koschinsky
{"title":"GeoDa web: enhancing web-based mapping with spatial analytics","authors":"Xun Li, L. Anselin, Julia Koschinsky","doi":"10.1145/2820783.2820792","DOIUrl":"https://doi.org/10.1145/2820783.2820792","url":null,"abstract":"Cloud mapping platforms, such as Google Maps, CartoDB, MapZen, and the like have become powerful alternatives to traditional desktop-based mapping and GIS applications. However, unlike their desktop counterparts, web mapping platforms typically do not contain any but the most basic spatial analytical functionality. In this paper, we introduce GeoDa-Web, a cloud mapping platform that integrates spatial analytics and web mapping. The platform enables researchers to retrieve spatial data from the cloud, conduct spatial analysis in the cloud, visualize results using cloud mapping, and publish maps and plots to social media in a user-friendly way. It leverages the code base from the widely used GeoDa desktop software for spatial data exploration and the PySAL Python library of spatial analytical functions. We outline the architecture, discuss the implementation and illustrate the functionality of GeoDa-Web.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"1 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":"134633353","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
Shortest feasible paths with charging stops for battery electric vehicles 纯电动汽车带充电站的最短可行路径
M. Baum, Julian Dibbelt, Andreas Gemsa, D. Wagner, T. Zündorf
{"title":"Shortest feasible paths with charging stops for battery electric vehicles","authors":"M. Baum, Julian Dibbelt, Andreas Gemsa, D. Wagner, T. Zündorf","doi":"10.1145/2820783.2820826","DOIUrl":"https://doi.org/10.1145/2820783.2820826","url":null,"abstract":"We study the problem of minimizing overall trip time for battery electric vehicles (EVs) in road networks. As battery capacity is limited, stops at charging stations may be inevitable. Careful route planning is crucial, since charging stations are scarce and recharging is time-consuming. We extend the Constrained Shortest Path (CSP) problem for EVs with realistic models of charging stops, including varying charging power and battery swapping stations. While the resulting problem is NP-hard, we propose a combination of algorithmic techniques to achieve good performance in practice. Extensive experimental evaluation shows that our approach (CHArge) enables computation of optimal solutions on realistic inputs, even of continental scale. Finally, we investigate heuristic variants of CHArge that derive high-quality routes in well below a second on sensible instances.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"178 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":"133606347","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}
引用次数: 62
Hup-me: inferring and reconciling a timeline of user activity from rich smartphone data Hup-me:从丰富的智能手机数据推断和协调用户活动的时间轴
David Montoya, S. Abiteboul, P. Senellart
{"title":"Hup-me: inferring and reconciling a timeline of user activity from rich smartphone data","authors":"David Montoya, S. Abiteboul, P. Senellart","doi":"10.1145/2820783.2820852","DOIUrl":"https://doi.org/10.1145/2820783.2820852","url":null,"abstract":"We designed a system to infer multimodal itineraries traveled by a user from a combination of smartphone sensor data (e.g., GPS, Wi-Fi, accelerometer) and knowledge of the transport network infrastructure (e.g., road and rail maps, public transportation timetables). The system uses a Transportation network that captures the set of possible paths of this network for the modes, e.g., foot, bicycle, road_vehicle, and rail. This Transportation network is constructed from OpenStreetMap data and public transportation routes published online by transportation agencies in GTFS format. The system infers itineraries from a sequence of smartphone observations in two phases. The first phase uses a dynamic Bayesian network that models the probabilistic relationship between paths in Transportation network and sensor data. The second phase attempts to match portions recognized as road_vehicle or rail with possible public transportation routes of type bus, train, metro, or tram extracted from the GTFS source. We evaluated the performance of our system with data from users traveling over the Paris area who were asked to record data for different trips via an Android application. Itineraries were annotated with modes and public transportation routes taken and we report on the results of the recognition.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"1 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":"129623546","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}
引用次数: 21
TransitTrace: route planning using ambient displays TransitTrace:使用环境显示进行路由规划
M. Marchi, Jakob Eriksson, A. Forbes
{"title":"TransitTrace: route planning using ambient displays","authors":"M. Marchi, Jakob Eriksson, A. Forbes","doi":"10.1145/2820783.2820857","DOIUrl":"https://doi.org/10.1145/2820783.2820857","url":null,"abstract":"Every day, travelers use Public Transport Systems to reach their destinations. Public Transport Authorities generally use passive wayfinding devices, including ambient displays, to provide useful information for travelers, such as the number of vehicles in the vicinity of a stop and their estimated times of arrival. However, due to both the complexity of the transport networks and the lack of sophistication in the design of these displays, the information provided by these devices is limited. We present TransitTrace, a visualization that exploits interaction-free ambient displays to provide travelers with more detailed information and ultimately to help them to navigate the city using a Public Transport System. Specifically, the proposed design makes use of a novel animation strategy to aid travelers in route planning tasks. In this paper, we describe details about the system and visualization design of TransitTrace, as well as its initial implementation using transportation data provided by the City of Chicago.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"22 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":"133745030","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
Efficient algorithms for answering reverse spatial-keyword nearest neighbor queries 回答反向空间关键字最近邻查询的高效算法
Ying Lu, G. Cong, Jiaheng Lu, C. Shahabi
{"title":"Efficient algorithms for answering reverse spatial-keyword nearest neighbor queries","authors":"Ying Lu, G. Cong, Jiaheng Lu, C. Shahabi","doi":"10.1145/2820783.2820873","DOIUrl":"https://doi.org/10.1145/2820783.2820873","url":null,"abstract":"With the proliferation of local services and GPS-enabled mobile phones, reverse spatial-keyword Nearest Neighbor queries are becoming an important type of query. Given a service object (e.g., shop) q as the query, which has a location and a text description, we return customers such that q is one of top-k spatial-keyword relevant service objects for each result customer. Existing algorithms for answering reverse nearest neighbor queries cannot be used for processing reverse spatial-keyword nearest neighbor queries due to the additional text information. To design efficient algorithms, for the first time we theoretically analyze an ideal case, which minimizes the object/index node accesses, for processing reverse spatial-keyword nearest neighbor queries. Under the derived theoretical guidelines, we design novel search algorithms for efficiently answering the queries. Empirical studies show that the proposed algorithms offer scalability and are orders of magnitude faster than existing methods for reverse spatial-keyword nearest neighbor queries.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"59 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":"130070724","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
On map-centric programming environments: vision paper 关于以地图为中心的编程环境:远景论文
Walid G. Aref, Sunil Prabhakar, Jaewoo Shin, Ruby Y. Tahboub, Aya Abdelsalam, Jalaleldeen W. Aref
{"title":"On map-centric programming environments: vision paper","authors":"Walid G. Aref, Sunil Prabhakar, Jaewoo Shin, Ruby Y. Tahboub, Aya Abdelsalam, Jalaleldeen W. Aref","doi":"10.1145/2820783.2820886","DOIUrl":"https://doi.org/10.1145/2820783.2820886","url":null,"abstract":"2D maps and 3D globes can be used as programming toys to help students learn programming in contrast to using robots, visual, or multimedia components in Computer Science I introductory programming courses. This paper studies research challenges related to supporting this concept, and presents one instance of a 2D and 3D map-based programming environment to motivate these challenges.","PeriodicalId":241302,"journal":{"name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"11 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":"115180161","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
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学术官方微信
小红书