The Ninth International Conference on Mobile Data Management (mdm 2008)最新文献

筛选
英文 中文
Follow Me, Follow You - Spatiotemporal Community Context Modeling and Adaptation for Mobile Information Systems Follow Me, Follow You——面向移动信息系统的时空社区语境建模与适应
The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.30
Yiwei Cao, R. Klamma, Min Hou, M. Jarke
{"title":"Follow Me, Follow You - Spatiotemporal Community Context Modeling and Adaptation for Mobile Information Systems","authors":"Yiwei Cao, R. Klamma, Min Hou, M. Jarke","doi":"10.1109/MDM.2008.30","DOIUrl":"https://doi.org/10.1109/MDM.2008.30","url":null,"abstract":"Nowadays various mobile platforms from PDA, smart phones to iPhones can deliver road warriors or trippers much mobile information. However, most mobile applications are lacking the \"social intelligence\" of real companionship. One reason is that community context and spatiotemporal context information are not well taken into consideration. In this paper we propose an ontology-based context model using OWL/RDF. With the enhanced interoperability substantial context information can be expressed and reasoned across systems. Based on the context model and the middleware Context-Aware Adaptation Service (CAAS), we introduce a mobile tourist guide as proof- of-concept that provides users context-aware information. We employ the MPEG-7 and MPEG-21 metadata standards to realize multimedia adaptation to device preferences. The evaluation result proves the feasibility of the context model and shows the easy extensibility of CAAS.","PeriodicalId":365750,"journal":{"name":"The Ninth International Conference on Mobile Data Management (mdm 2008)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124856011","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}
引用次数: 24
Road Network Based Adaptive Query Evaluation in VANET 基于道路网的VANET自适应查询评价
The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.28
Jun Gao, Jinsong Han, Dongqing Yang, Tengjiao Wang
{"title":"Road Network Based Adaptive Query Evaluation in VANET","authors":"Jun Gao, Jinsong Han, Dongqing Yang, Tengjiao Wang","doi":"10.1109/MDM.2008.28","DOIUrl":"https://doi.org/10.1109/MDM.2008.28","url":null,"abstract":"In the Vehicle Ad-hoc NETwork (VANET), moving vehicles organize into a mobile wireless Ad-hoc network to share online traffic information. Each vehicle can issue a declarative query for aggregating the traffic information from others in order to facilitate the navigation and avoid traffic jam. Existing query methods suffer from high latency, incomplete results, and large messages due to the movement of the vehicles in VANET. In this paper, we propose an adaptive query evaluation method based on the road network. In order to overcome the problems incurred by the movement, a relative static query evaluation plan is constructed based on the road network, and each vehicle can participate in the query evaluation plan autonomously. We also introduce control messages to notify the changed location of the query originator to other vehicles involved in the evaluation plan. In addition, we propose an one time message transferring based results collecting method to reduce the message cost. The optimization over the multiple queries is also discussed to reduce the messages further. We evaluate the performance of our method by extensive simulations. Experimental results show that our method can provide complete results within a short response time and small traffic overhead.","PeriodicalId":365750,"journal":{"name":"The Ninth International Conference on Mobile Data Management (mdm 2008)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132083238","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}
引用次数: 9
Mobile Data Overlay (MDO): A Data Placement Paradigm for Mobile Applications 移动数据覆盖(MDO):移动应用的数据放置范例
The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-27 DOI: 10.1109/MDM.2008.41
Yun Huang, N. Venkatasubramanian
{"title":"Mobile Data Overlay (MDO): A Data Placement Paradigm for Mobile Applications","authors":"Yun Huang, N. Venkatasubramanian","doi":"10.1109/MDM.2008.41","DOIUrl":"https://doi.org/10.1109/MDM.2008.41","url":null,"abstract":"This paper addresses the issue of proxy-based data placement for mobile applications. The key idea is to use aggregated information about mobile users and their data request patterns to determine when, how frequently and how much data to be replicated on proxies. Specifically, we introduce a novel representation, mobile data overlay (MDO) that captures aggregated mobile data access patterns. The underlying representation of the MDO utilizes an interval tree-based data structure in supporting efficient spatio-temporal operations on mobile data access information. We develop intelligent MDO reconfiguration (ReC-MDO) techniques that help determine proper granularity of data replication operation (i.e. appropriate segmentation of each data object) by extracting spatio-temporal locality of mobile data access patterns. The ReC-MDO approach effectively balances tradeoffs between replication cost and data access cost in making mobile data placement decisions on proxies. Through extensive experimentation, we demonstrate the superiority of our techniques over several popular data placement strategies.","PeriodicalId":365750,"journal":{"name":"The Ninth International Conference on Mobile Data Management (mdm 2008)","volume":"59 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125565867","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
Efficient Cost-Based Tracking of Scheduled Vehicle Journeys 高效的基于成本的车辆行程跟踪
The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-01 DOI: 10.1109/MDM.2008.22
Dalia Tiesyte, Christian S. Jensen
{"title":"Efficient Cost-Based Tracking of Scheduled Vehicle Journeys","authors":"Dalia Tiesyte, Christian S. Jensen","doi":"10.1109/MDM.2008.22","DOIUrl":"https://doi.org/10.1109/MDM.2008.22","url":null,"abstract":"Applications in areas such as logistics, cargo delivery, and collective transport involve the management of fleets of vehicles that are expected to travel along known routes according to schedules. There is a fundamental need by the infrastructure surrounding the vehicles to know the actual status of the vehicles. Since the vehicles deviate from their schedules due to road construction, accidents, and other unexpected conditions, it is necessary for the vehicles to communicate with the infrastructure. Frequent updates introduce high communication costs, and server-side updates easily become a bottleneck. This paper presents techniques that enable the tracking of vehicle positions and arrival times at scheduled stops with little communication, while still offering the desired accuracy to the infrastructure of the status of the vehicles. Experimental results with real GPS data from buses show that the proposed techniques are capable of reducing the number of updates significantly compared to a state-of-the art approach where vehicles issue updates at pre-defined positions along their routes.","PeriodicalId":365750,"journal":{"name":"The Ninth International Conference on Mobile Data Management (mdm 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129099161","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}
引用次数: 8
Continuous Reverse k-Nearest-Neighbor Monitoring 连续反向k近邻监测
The Ninth International Conference on Mobile Data Management (mdm 2008) Pub Date : 2008-04-01 DOI: 10.1109/MDM.2008.31
Wei Wu, Fei Yang, C. Chan, K. Tan
{"title":"Continuous Reverse k-Nearest-Neighbor Monitoring","authors":"Wei Wu, Fei Yang, C. Chan, K. Tan","doi":"10.1109/MDM.2008.31","DOIUrl":"https://doi.org/10.1109/MDM.2008.31","url":null,"abstract":"The processing of a Continuous Reverse k-Nearest-Neighbor (CRkNN) query on moving objects can be divided into two sub tasks: continuous filter, and continuous refinement. The algorithms for the two tasks can be completely independent. Existing CRkNN solutions employ Continuous k-Nearest-Neighbor (CkNN) queries for both continuous filter and continuous refinement. We analyze the CkNN based solution and point out that when k > 1 the refinement cost becomes the system bottleneck. We propose a new continuous refinement method called CRange-k. In CRange- k, we transform the continuous verification problem into a Continuous Range-k query, which is also defined in this paper, and process it efficiently. Experimental study shows that the CRkNN solution based on our CRange-k refinement method is more efficient and scalable than the state-of-the- art CRkNN solution.","PeriodicalId":365750,"journal":{"name":"The Ninth International Conference on Mobile Data Management (mdm 2008)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125638488","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}
引用次数: 58
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学术官方微信