发布求助
文献互助 智能选刊 最新文献

Proceedings of the 17th International Conference on Distributed Computing and Networking最新文献

筛选
英文 中文
An enhanced automated system for evaluating harsh driving using smartphone sensors 使用智能手机传感器评估恶劣驾驶的增强型自动化系统
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2849555
Avik Ghose, A. Chowdhury, Vivek Chandel, T. Banerjee, T. Chakravarty
{"title":"An enhanced automated system for evaluating harsh driving using smartphone sensors","authors":"Avik Ghose, A. Chowdhury, Vivek Chandel, T. Banerjee, T. Chakravarty","doi":"10.1145/2833312.2849555","DOIUrl":"https://doi.org/10.1145/2833312.2849555","url":null,"abstract":"In this paper we propose an IoT based framework for driving style assessment using the driver owned smartphone as sensing platform. The GPS and the inertial sensors, embedded in the phone are used to continually sample measurements of position, speed and acceleration for the moving vehicle. The required computation is segregated between the phone and a remote server. We present the fusion algorithm which offers accurate estimation of velocity, thereby acceleration and position. To obviate the need for human intervention, an adaptive process in multi-sensor fusion is implemented. Since, the user is not expected to keep the phone in a predefined position and orientation (with respect to the vehicle's longitudinal motion), an automated orientation correction module is essential and is described here.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134012576","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}
引用次数: 16
D8-tree: a de-normalized approach for multidimensional data analysis on key-value databases D8-tree:用于键值数据库上多维数据分析的非规范化方法
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833314
C. Cugnasco, Y. Becerra, J. Torres, E. Ayguadé
{"title":"D8-tree: a de-normalized approach for multidimensional data analysis on key-value databases","authors":"C. Cugnasco, Y. Becerra, J. Torres, E. Ayguadé","doi":"10.1145/2833312.2833314","DOIUrl":"https://doi.org/10.1145/2833312.2833314","url":null,"abstract":"The shift to more parallel and distributed computer architectures changed how data is managed consequently giving birth to a new generation of software products, namely NoSQL. These products offer a scalable and reliable solution for \"Big Data\", but none of them solves the problem of analyzing and visualizing multidimensional data. There are solutions for scaling analytic workloads, for creating distributed databases and for indexing multidimensional data, but there is no single solution that points to all three goals together. We propose the D8-tree, a De-normalized Octa-tree index that supports all three goals. It works with both analytical and data-thinning queries on multidimensional data ensuring, at the same time, low latency and a linear scalability. We have implemented a D8-tree prototype, and we compared it with PostGIS on a set of queries required by an in-house HPC application. We found the D8-tree outperforming PostGIS in all tested queries, with a performance gain up to 47 times.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114559871","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
Mapping workflow resource requests for bandwidth efficiency in data centers 映射工作流资源请求，提高数据中心的带宽效率
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833448
Vishal Girisagar, Tram Truong Huu, G. Mohan
{"title":"Mapping workflow resource requests for bandwidth efficiency in data centers","authors":"Vishal Girisagar, Tram Truong Huu, G. Mohan","doi":"10.1145/2833312.2833448","DOIUrl":"https://doi.org/10.1145/2833312.2833448","url":null,"abstract":"Representing a large class of coarse-grained distributed applications, workflows require large computing and bandwidth resources for their execution. With specific resource requirements due to data precedence and time disjointness among workflow tasks, mapping workflow resource requests in data centers is a challenging problem for cloud providers. While existing approaches only focus on satisfying computing resources and ignore the impact of mapping on bandwidth usage, we consider both computing and network resources to improve bandwidth efficiency in data centers while guaranteeing the performance of users' applications. We first formulate an integer programming optimization model for the mapping problem that minimizes the bandwidth allocated to workflows. We then develop two algorithms namely Critical Path Workflow Mapping (CPWM) and Edge Priority Workflow Mapping (EPWM) to solve this problem. We evaluate CPWM and EPWM through comprehensive simulations. The results show that CPWM and EPWM significantly reduce the bandwidth allocated for a workflow request by up to 66% for random workflows and 80% for realisticapplication workflows compared to baseline algorithms.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130784648","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
BluePark: tracking parking and un-parking events in indoor garages BluePark:跟踪室内车库的停车和不停车事件
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833458
Sonia Soubam, Dipyaman Banerjee, Vinayak Naik, D. Chakraborty
{"title":"BluePark: tracking parking and un-parking events in indoor garages","authors":"Sonia Soubam, Dipyaman Banerjee, Vinayak Naik, D. Chakraborty","doi":"10.1145/2833312.2833458","DOIUrl":"https://doi.org/10.1145/2833312.2833458","url":null,"abstract":"Finding a parking spot in a busy indoor parking lot is a daunting task. Retracing a parked vehicle can be equally frustrating. We present BluePark, a collaborative sensing mechanism using smartphone sensors to solve these problems in real-time, without any input from user. We propose a novel technique of combining accelerometer and WiFi data to detect and localize parking and un-parking events in indoor parking lot. We validate our approach at the basement parking of a popular shopping mall. The proposed method outperforms Google Activity Recognition API by 20% in detecting drive state in indoor parking lot. Our experiments show 100% precision and recall for parking and un-parking detection events at low accelerometer sampling rate of 15Hz, irrespective of phone?s position. It has a low detection latency of 20s with probability of 0.9 and good location accuracy of 10m.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128066519","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
A predictive retransmission scheme for cooperative routing in intermittently connected sensor networks 间歇连接传感器网络中协同路由的预测重传方案
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833456
M. Rajib, A. Nasipuri
{"title":"A predictive retransmission scheme for cooperative routing in intermittently connected sensor networks","authors":"M. Rajib, A. Nasipuri","doi":"10.1145/2833312.2833456","DOIUrl":"https://doi.org/10.1145/2833312.2833456","url":null,"abstract":"We consider energy harvesting sensor networks that are characterized by intermittent connectivity between sensor nodes due to random sleep and wake cycles caused by sporadic availability of energy sources. A retransmission strategy is developed that probabilistically predicts the best transmission interval between successive retransmissions in order to maximize the likelihood of successful packet delivery. We utilize this strategy for a cooperative routing approach to further improve the delay performance in such intermittently connected networks. An analytical model is formulated to study the delay characteristics of the proposed retransmission scheme. The performance of the proposed protocol in a multi-hop environment is evaluated through simulations. Results show that the retransmission scheme can provide significant performance improvements when compared to existing approaches.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133908949","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
Layered security for storage at the edge: on decentralized multi-factor access control 边缘存储的分层安全性:基于分散的多因素访问控制
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833452
Ertem Esiner, Anwitaman Datta
{"title":"Layered security for storage at the edge: on decentralized multi-factor access control","authors":"Ertem Esiner, Anwitaman Datta","doi":"10.1145/2833312.2833452","DOIUrl":"https://doi.org/10.1145/2833312.2833452","url":null,"abstract":"In this paper we propose a protocol that allows end-users in a decentralized setup (without requiring any trusted third party) to protect data shipped to remote servers using two factors - knowledge (passwords) and possession (a time based one time password generation for authentication) that is portable. The protocol also supports revocation and recreation of a new possession factor if the older possession factor is compromised, provided the legitimate owner still has a copy of the possession factor. Furthermore, akin to some other recent works, our approach naturally protects the outsourced data from the storage servers themselves, by application of encryption and dispersal of information across multiple servers. We also extend the basic protocol to demonstrate how collaboration can be supported even while the stored content is encrypted, and where each collaborator is still restrained from accessing the data through a multi-factor access mechanism. Such techniques achieving layered security is crucial to (opportunistically) harness storage resources from untrusted entities.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127079668","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
String matching query verification on cloud-hosted databases 云托管数据库上的字符串匹配查询验证
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833326
F. Riaz-ud-Din, R. Doss, Wanlei Zhou
{"title":"String matching query verification on cloud-hosted databases","authors":"F. Riaz-ud-Din, R. Doss, Wanlei Zhou","doi":"10.1145/2833312.2833326","DOIUrl":"https://doi.org/10.1145/2833312.2833326","url":null,"abstract":"Database query verification schemes attempt to provide authenticity, completeness, and freshness guarantees for queries executed on untrusted cloud servers. A number of such schemes currently exist in the literature, allowing query verification for queries that are based on matching whole values (such as numbers, dates, etc.) or for queries based on keyword matching. However, there is a notable gap in the research with regard to query verification schemes for pattern-matching queries. Our contribution here is to provide such a verification scheme that provides correctness guarantees for pattern-matching queries executed on the cloud. We describe a trivial scheme, âŸżand show how it does not provide completeness guarantees, and then proceed to describe our scheme based on efficient primitives such as cryptographic hashing and Merkle hash trees along with suffix arrays. We also provide experimental results based on a working prototype to show the practicality of our scheme.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127160305","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
Privacy, security, risk, and trust concerns in e-commerce 电子商务中的隐私、安全、风险和信任问题
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2850445
Ghadeer Neama, Rana W. Alaskar, Mohammad A. Alkandari
{"title":"Privacy, security, risk, and trust concerns in e-commerce","authors":"Ghadeer Neama, Rana W. Alaskar, Mohammad A. Alkandari","doi":"10.1145/2833312.2850445","DOIUrl":"https://doi.org/10.1145/2833312.2850445","url":null,"abstract":"Electronic commerce has increased dramatically in recent years, because of the revolution in information technology. The services provided by e-commerce companies could be affected by several factors such as privacy, security, trusts and perceived risks. In this paper, we propose a preliminary theoretical model that investigates the relationship between privacy, security concerns, and perceived risks, and how it would relate to customers' level of trust in e-commerce. A survey that involves 100 participants has been conducted and analyzed testing a number of hypotheses focused on studying the attributes of each factor, and its effect on the perceived risks associated with unexpected situations. The results of this research study show that a positive relationship exists between the perceived risks and some of the privacy attributes such as control and notice. A positive relationship also exists between the perceived risks and some of the security attributes such as confidentially and integrity. Further, the study demonstrates a positive relationship between perceived risks and customers' level of trust.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134072791","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
On analyzing geotagged tweets for location-based patterns 基于位置模式的地理标记推文分析
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2849571
Philips Kokoh Prasetyo, Palakorn Achananuparp, Ee-Peng Lim
{"title":"On analyzing geotagged tweets for location-based patterns","authors":"Philips Kokoh Prasetyo, Palakorn Achananuparp, Ee-Peng Lim","doi":"10.1145/2833312.2849571","DOIUrl":"https://doi.org/10.1145/2833312.2849571","url":null,"abstract":"Geotagged social media is becoming highly popular as social media access is now made very easy through a wide range of mobile apps which automatically detect and augment social media posts with geo-locations. In this paper, we analyze two kinds of location-based patterns. The first is the association between location attributes and the locations of user tweets. The second is location association pattern which comprises a pair of locations that are co-visited by users. We demonstrate that through tracking the Twitter data of Singapore-based users, we are able to reveal association between users tweeting from school locations and the school type as well as the competitiveness of schools. We also discover location association patterns which involve schools and shopping malls. With these location-based patterns offering interesting insights about the visit behaviors of school and shopping mall users, we further develop an online visual application called Urbanatics to explore the location association patterns making use of both chord diagram and map visualization.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132992923","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
A communication-efficient leader election algorithm in partially synchronous systems prone to crash-recovery and omission failures 部分同步系统中易于崩溃恢复和遗漏故障的通信高效领导者选举算法
Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833444
Christian Fernández-Campusano, M. Larrea, Roberto Cortiñas, M. Raynal
{"title":"A communication-efficient leader election algorithm in partially synchronous systems prone to crash-recovery and omission failures","authors":"Christian Fernández-Campusano, M. Larrea, Roberto Cortiñas, M. Raynal","doi":"10.1145/2833312.2833444","DOIUrl":"https://doi.org/10.1145/2833312.2833444","url":null,"abstract":"Leader election is a key service for many dependable distributed systems. It eases the consistent management of replicas in current highly available computing scenarios. This paper presents a new leader election algorithm for crash-recovery and omission environments, in order to support fault-tolerant agreement protocols, e.g., Paxos. As a novelty with respect to previous works, our algorithm tolerates the occurrence of both crash-recoveries and message omissions to any process during some finite but unknown time, assuming that eventually a majority of processes in the system remains up forever and stops omitting messages among them. Also, the proposed algorithm does not rely on stable storage and is communication-efficient, i.e., eventually each process of the well-connected majority communicates only with the elected leader.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133159221","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
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信