Marcos R. Vieira, Luciano Barbosa, Matthias Kormaksson, B. Zadrozny
{"title":"USapiens: A System for Urban Trajectory Data Analytics","authors":"Marcos R. Vieira, Luciano Barbosa, Matthias Kormaksson, B. Zadrozny","doi":"10.1109/MDM.2015.35","DOIUrl":"https://doi.org/10.1109/MDM.2015.35","url":null,"abstract":"In the past few years a growing number of cities have started monitoring the position of public transportation vehicles using GPS devices. In this paper, we focus on a particularly important urban dataset: GPS bus data. Buses are valuable sensors and information associated with buses can provide unprecedented insight into many different aspects of city's life, from human behavior to mobility patterns. But analyzing these large urban datasets presents many challenges. Urban datasets are complex, containing location and temporal components in addition that they are commonly released in their raw format. Furthermore, urban datasets may have noisy and missing data, locations gathered in a low sampling rate and not mapped to the underlying road network, among other issues which makes it difficult for citizens, administrators and developers to get insights. In this paper, we present a system, called USapiens, for analyzing large urban trajectory data. We first describe the architecture of the proposed system for pre-processing and analyzing urban trajectory data. We then detail five use cases we build using very large GPS dataset obtained from buses operating in the city of Rio de Janeiro to get insights into various aspects of public transportation in the city.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132455238","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}
Guang-yao Jin, Julia Deng, Tung Nguyen, Pan Gao, M. Wooster, S. Qari
{"title":"Efficient Cloud-Based Real-Time Geo-Information Delivery for Mobile Users","authors":"Guang-yao Jin, Julia Deng, Tung Nguyen, Pan Gao, M. Wooster, S. Qari","doi":"10.1109/MDM.2015.22","DOIUrl":"https://doi.org/10.1109/MDM.2015.22","url":null,"abstract":"The increasing popularity of smart mobile devices enables a widespread use of Location Based Services (LBS). LBSs require real-time processing of frequent updating data (i.e., Streams), and return customized results to mobile users based on their own locations. The mobile environment brings additional design and development considerations to LBS applications, such as real-time awareness, energy efficiency, and privacy preservation. In a recent project, we worked on the Emergency Medical Service as an example LBS application, and developed a Cloud-based LBS prototype, named as Early Alert System (EARS), to deliver real-time emergency vehicle's information to smart mobile devices based on their geo-proximity. EARS leverages Cloud-based stream processing systems to address the real-time stream processing needs, and also develops effective methods to conserve energy consumption and preserve user privacy. EARS is an efficient approach to deliver real-time geo-information from the Cloud to mobile users, and can be easily generalized to other LBS applications in the mobile environment.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133171752","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}
M. Pavan, Stefano Mizzaro, Ivan Scagnetto, A. Beggiato
{"title":"Finding Important Locations: A Feature-Based Approach","authors":"M. Pavan, Stefano Mizzaro, Ivan Scagnetto, A. Beggiato","doi":"10.1109/MDM.2015.11","DOIUrl":"https://doi.org/10.1109/MDM.2015.11","url":null,"abstract":"We propose a novel approach to address the problem of the recognition of important locations. Our method is organised in two phases: first, a set of candidate stay points is identified by exploiting some state-of-the-art algorithms to filter the GPS-logs, then, the candidate stay points are mapped onto a feature space having as dimensions the area underlying the stay point, its intensity (the time spent in a location) and its frequency (the number of total visits). We conjecture that the features space allows to model aspects/measures that are more semantically related to users and better suited to reason about their similarities and differences than, e.g., Latitude, longitude, and timestamp. An experimental evaluation on the GeoLife public dataset confirms the effectiveness of our approach.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116159050","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}
Theodoros Anagnostopoulos, A. Zaslavsky, A. Medvedev, Sergei Khoruzhnicov
{"title":"Top -- k Query Based Dynamic Scheduling for IoT-enabled Smart City Waste Collection","authors":"Theodoros Anagnostopoulos, A. Zaslavsky, A. Medvedev, Sergei Khoruzhnicov","doi":"10.1109/MDM.2015.25","DOIUrl":"https://doi.org/10.1109/MDM.2015.25","url":null,"abstract":"Smart Cities are being designed and built for comfortable human habitation. Among services that Smart Cities will offer is the environmentally-friendly waste/garbage collection and processing. In this paper, we motivate and propose an Internet of Things (IoT) enabled system architecture to achieve dynamic waste collection and delivery to processing plants or special garbage tips. In the past, waste collection was treated in a rather static manner using classical operations research approach. As proposed in this paper, nowadays, with the proliferation of sensors and actuators, as well as reliable and ubiquitous mobile communications, the Internet of Things (IoT) enables dynamic solutions aimed at optimizing the garbage truck fleet size, collection routes and prioritized waste pick-up. We propose a top -- k query based dynamic scheduling model to address the challenges of near real-time scheduling driven by sensor data streams. An Android app along with a user-friendly GUI is developed and presented in order to prove feasibility and evaluate a waste collection scenario using experimental data. Finally, the proposed models are evaluated on synthetic and real data from the city municipality of St. Petersburg, Russia. The models demonstrate consistency and correctness.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121662472","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}
Anirban Mondal, Tridib Mukherjee, Amandeep Chugh, Atul Singh, D. Chander
{"title":"Efficient and Scalable Spatial Retrieval of Resident Involvement Information in City Events","authors":"Anirban Mondal, Tridib Mukherjee, Amandeep Chugh, Atul Singh, D. Chander","doi":"10.1109/MDM.2015.47","DOIUrl":"https://doi.org/10.1109/MDM.2015.47","url":null,"abstract":"Information about resident involvement in reporting various city-related events (e.g., Potholes, traffic jams) via mobile apps is critical to key stakeholders for effective city management. While existing efforts have primarily focused on event data collection in space, they are not capable of performing efficient retrieval of information about resident involvement in event reporting across different spatial regions and at different spatial granularities. Hence, this work makes the following contributions. First, we present CRIS, a scalable system for efficient retrieval of resident involvement and event information across different spatial regions and at varying spatial granularities. Second, we propose the euR-tree, a novel R-tree-based index augmented with (a) a hash-based array for indexing events in space, and (b) fixed-length arrays for indexing resident involvement information in reporting events in space. The euR-tree is integrated into CRIS to realize efficient retrieval. Third, our performance study indicates that the euR-tree is indeed effective in performing such retrieval with reduced query response times and disk I/Os.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121230884","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}
{"title":"A Framework for Healthcare Everywhere: BMI Prediction Using Kinect and Data Mining Techniques on Mobiles","authors":"Chih-Hua Tai, Daw-Tung Lin","doi":"10.1109/MDM.2015.40","DOIUrl":"https://doi.org/10.1109/MDM.2015.40","url":null,"abstract":"Recently, health-care has become a popular issue. Having a good physique is also commonly regarded as important for being healthy. For evaluating our body status, the Body Mass Index (BMI) is a widely used indicator. However, calculating BMI is inconvenient and requires the physical measuring of people's weights and heights. In this paper, we are interested in building a mobile-based BMI prediction system using Kinect and data mining techniques so that everybody can easily monitor their BMI everywhere by taking a snapshot of their face. The rationale behind this is the intuition that there is a correlation between the shape of one's face and one's BMI values, which people often act on when noticing a friend has either gained or lost weight. Through the evaluations of 50 volunteers, we show that the rules for training BMI prediction match with people's common intuitions.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126365329","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}
{"title":"How to Deal with Third Party Apps in a Privacy System -- The PMP Gatekeeper --","authors":"Christoph Stach","doi":"10.1109/MDM.2015.17","DOIUrl":"https://doi.org/10.1109/MDM.2015.17","url":null,"abstract":"Nowadays, mobile devices collect a lot of private information. Therefore every vendor of a mobile platform has to provide a sufficient mechanism to secure this data. Android pursues a strategy to pass full control (and thus full responsibility) over any private data to the user. However, the Android Permission System is not sufficient for that purpose. Various third party approaches try to enhance the Android privacy policy model. Nevertheless, these approaches have to solve the problem of how to deal with Legacy Apps, i.e., Apps that do not collaborate with an enhanced privacy policy model. In this paper, we analyze various alternative privacy systems and discuss different approaches of how to deal with Legacy Apps. Based on our findings, we introduce the so-called PMP Gatekeeper, a best of breed approach dealing with Legacy Apps for the Privacy Management Platform (PMP). The PMP Gatekeeper classifies apps and deals with each class appropriately. So the user can adjust privacy settings for every kind of app. With our prototype we show, that the PMP in combination with the PMP Gatekeeper becomes a holistic privacy system. Although our prototype is for Android, our realization approach can be applied to other application platforms in order to offer a satisfying privacy system.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126578779","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}
{"title":"Decentralized Collaborative Editing Platform","authors":"Mumtaz Ahmad, Abdessamad Imine","doi":"10.1109/MDM.2015.26","DOIUrl":"https://doi.org/10.1109/MDM.2015.26","url":null,"abstract":"We aim to designe decentralized collaborative editing system. Keeping in mind that such system becoming more complex and care taking, we take in account some important properties like out-of-order execution of concurrent operations and data convergence. In this paper, we introduce a novel linear data structure based on unique identifier scheme for indexed communication. These identifiers are still real numbers with a specific controlled pattern of precision. This noval scheme preserves data convergence, provides good performance and avoids overheads as compared to other available approaches. We test our approach by performing experiments and we implemented our idea successfully.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126119034","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}
{"title":"A Mixed Breadth-Depth First Search Strategy for Sequenced Group Trip Planning Queries","authors":"E. Ahmadi, M. Nascimento","doi":"10.1109/MDM.2015.49","DOIUrl":"https://doi.org/10.1109/MDM.2015.49","url":null,"abstract":"We study Sequenced Group Trip Planning Queries (SGTPQs). Consider a road network where some vertices represent Points of interest (POIs) and each POI belongs to exactly one Category of Interest (COI), e.g., A COI can be \"Restaurants\" and each POI in this COI is a specific instance of a restaurant. Given a group of users, each starting from a (possibly distinct) source location and going ultimately to a (possibly distinct) destination, as well as a ordered sequence of COIs, the SGTPQ finds, for each user, the route from his/her source location to his/her destination such that all users go through the same POIs, each one belonging to the specified sequence of COIs, while minimizing the total distance travelled by all users in the group. Different from previous work which investigated SGTPQs in Euclidean distance, we focus on SGTPQs in the more realistic case of road networks. The only existing algorithm for processing SGTPQs which may be also applicable in road networks, named IA, suffers from two drawbacks: it is not able to produce optimal answers and is computationally expensive. The first contribution of this paper is a small modification to IA, so that it can provide optimal solutions. The second and main contribution is a new approach, called Progressive Group Neighbour Exploration (PGNE) that delivers the optimal solution while being more efficient than IA. Our extensive experiments based on real and synthetic datasets show that PGNE is always faster than the modified IA and, in particular, typically twice as fast with respect to the number of users in the group travelling together, an important parameter for this type of query.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117331141","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}
{"title":"Differentially Private Real-Time Data Release over Infinite Trajectory Streams","authors":"Yang Cao, Masatoshi Yoshikawa","doi":"10.1109/MDM.2015.15","DOIUrl":"https://doi.org/10.1109/MDM.2015.15","url":null,"abstract":"Recent emerging mobile and wearable technologies make it easy to collect personal spatiotemporal data such as activity trajectories in daily life. Releasing real-time statistics over trajectory streams produced by crowds of people is expected to be valuable for both academia and business, answering questions such as \"How many people are in Central Station now?\" However, analyzing these raw data will entail risks of compromising individual privacy. ϵ-Differential Privacy has emerged as a de facto standard for private statistics publishing because of its guarantee of being rigorous and mathematically provable. Since user trajectories will be generated infinitely, it is difficult to protect every trajectory under ϵ-differential privacy. To this end, we propose a flexible privacy model of ℓ-trajectory privacy to ensure every length of ℓ trajectories under protection of ϵ-differential privacy. Then we hierarchically design algorithms to satisfy ℓ-trajectory privacy. Experiments using four real-life datasets show that our proposed algorithms are effective and efficient.","PeriodicalId":187331,"journal":{"name":"2015 16th IEEE International Conference on Mobile Data Management","volume":"82 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114059505","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}