Jian Mao, Yan Zhang, Xiandong Xu, Jianwei Liu, Tao Wei
Distributed storage is a scheme to store data in networked storage services, which is the basis of popular cloud storage solutions. Although this scheme has huge benefits in reducing maintenance and operation cost, it has several security concerns. Among them, malicious file deletion by the storage providers is a top concern. In this paper, we develop a novel error-tolerant solution, ET-DME, to effectively detect malicious file deletion behaviors in distributed storage services. Our approach prevents malicious servers from forging evidence to bypass data auditing test. In addition, our approach does not limit the number of challenges made by the client. Our approach also has low computation and communication overhead.
{"title":"ET-DMD: An Error-Tolerant Scheme to Detect Malicious File Deletion on Distributed Storage","authors":"Jian Mao, Yan Zhang, Xiandong Xu, Jianwei Liu, Tao Wei","doi":"10.1109/iNCoS.2012.67","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.67","url":null,"abstract":"Distributed storage is a scheme to store data in networked storage services, which is the basis of popular cloud storage solutions. Although this scheme has huge benefits in reducing maintenance and operation cost, it has several security concerns. Among them, malicious file deletion by the storage providers is a top concern. In this paper, we develop a novel error-tolerant solution, ET-DME, to effectively detect malicious file deletion behaviors in distributed storage services. Our approach prevents malicious servers from forging evidence to bypass data auditing test. In addition, our approach does not limit the number of challenges made by the client. Our approach also has low computation and communication overhead.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131031945","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}
Research in the field of Second Language Acquisition has repeatedly highlighted the importance of conversational interactions between students working together in small groups. Particularly, peer dialogue can play a vital role in intellectual development and language acquisition. Thus, we argue that the use of a conversational agent, designed to advance peer interaction and cognitive activity, would enhance learning outcomes related to language learning. In this work, we describe the design of a web-based collaborative system that utilizes a configurable conversational agent, which facilitates and triggers the learners' discussion. We also present an exploratory case study that was conducted in an English language school. Our analysis indicates a positive effect regarding the usability and user acceptance of the system.
{"title":"Using a Conversational Agent for Promoting Collaborative Language Learning","authors":"Stergios Tegos, S. Demetriadis, T. Tsiatsos","doi":"10.1109/iNCoS.2012.105","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.105","url":null,"abstract":"Research in the field of Second Language Acquisition has repeatedly highlighted the importance of conversational interactions between students working together in small groups. Particularly, peer dialogue can play a vital role in intellectual development and language acquisition. Thus, we argue that the use of a conversational agent, designed to advance peer interaction and cognitive activity, would enhance learning outcomes related to language learning. In this work, we describe the design of a web-based collaborative system that utilizes a configurable conversational agent, which facilitates and triggers the learners' discussion. We also present an exploratory case study that was conducted in an English language school. Our analysis indicates a positive effect regarding the usability and user acceptance of the system.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130782244","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}
Data mining has been well-studied in academia and widely applied to many fields. As a significant mining means, clustering algorithm has been successfully used in facility location, image categorization and bioinformatics. K-means and affinity propagation (AP) are two effective clustering algorithms, in which the former has involved in privacy preserving data mining, but the latter does not. Considering the unparalleled advantages of AP over k-means, we firstly propose a secure scheme for AP clustering in this paper. Our scheme runs over a partitioned database that different parties contain different attributes for a common set of entities. This scheme guarantees no disclosure of parties' private information by means of the cryptographic tools which have been successfully applied in privacy preserving k-means clustering. The final result for each party is the assignment of each entity, but gives nothing about the attributes held by other parties. In the end, we make a brief security discussion under the semi-honest model and analyze the communication cost to show that our scheme does have good performance.
{"title":"Privacy-Preserving Affinity Propagation Clustering over Vertically Partitioned Data","authors":"Xiao-yan Zhu, Mo-meng Liu, Min Xie","doi":"10.1109/iNCoS.2012.71","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.71","url":null,"abstract":"Data mining has been well-studied in academia and widely applied to many fields. As a significant mining means, clustering algorithm has been successfully used in facility location, image categorization and bioinformatics. K-means and affinity propagation (AP) are two effective clustering algorithms, in which the former has involved in privacy preserving data mining, but the latter does not. Considering the unparalleled advantages of AP over k-means, we firstly propose a secure scheme for AP clustering in this paper. Our scheme runs over a partitioned database that different parties contain different attributes for a common set of entities. This scheme guarantees no disclosure of parties' private information by means of the cryptographic tools which have been successfully applied in privacy preserving k-means clustering. The final result for each party is the assignment of each entity, but gives nothing about the attributes held by other parties. In the end, we make a brief security discussion under the semi-honest model and analyze the communication cost to show that our scheme does have good performance.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127546151","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}
Traian-Lucian Militaru, G. Suciu, G. Todoran, A. Florescu, V. Poenaru, Laurentiu Nae, C. Cernat
This paper proposes a prototype of a rule based expert system running over cloud, showing the advantages compared with traditional expert systems and also how to avoid any problems that may arise in such an environment of use.
{"title":"Rule Based Expert Systems Running over the Cloud","authors":"Traian-Lucian Militaru, G. Suciu, G. Todoran, A. Florescu, V. Poenaru, Laurentiu Nae, C. Cernat","doi":"10.1109/iNCoS.2012.93","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.93","url":null,"abstract":"This paper proposes a prototype of a rule based expert system running over cloud, showing the advantages compared with traditional expert systems and also how to avoid any problems that may arise in such an environment of use.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115557984","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}
We present a novel unsupervised learning method for human action categories from video sequences using Latent Dirichlet Markov Clustering (LDMC). Video sequences are represented by a novel "bag-of-words" representation, where each frame corresponds to a "word". The algorithm automatically learns the probability distributions of the words and the intermediate topics corresponding to human action categories, and correlates actions over time. This is achieved by using Latent Dirichlet Markov Clustering (LDMC). Our approach builds on Hidden Markov Models (HMMs) and Latent Dirichlet Allocation (LDA), and overcomes their drawbacks on accuracy, robustness and computational efficiency. A collapsed Gibbs sampler is derived for offline learning with unlabeled training data, and significantly, a new approximation to online Bayesian inference is formulated to enable human action classification in new video data online in real-time. The strength of this mothod is demonstrated by unsupervised learning of human action categories and detecting irregular actions in different datasets.
{"title":"Unsupervised Human Action Categorization Using Latent Dirichlet Markov Clustering","authors":"Xudong Zhu, Hui Li","doi":"10.1109/iNCoS.2012.114","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.114","url":null,"abstract":"We present a novel unsupervised learning method for human action categories from video sequences using Latent Dirichlet Markov Clustering (LDMC). Video sequences are represented by a novel \"bag-of-words\" representation, where each frame corresponds to a \"word\". The algorithm automatically learns the probability distributions of the words and the intermediate topics corresponding to human action categories, and correlates actions over time. This is achieved by using Latent Dirichlet Markov Clustering (LDMC). Our approach builds on Hidden Markov Models (HMMs) and Latent Dirichlet Allocation (LDA), and overcomes their drawbacks on accuracy, robustness and computational efficiency. A collapsed Gibbs sampler is derived for offline learning with unlabeled training data, and significantly, a new approximation to online Bayesian inference is formulated to enable human action classification in new video data online in real-time. The strength of this mothod is demonstrated by unsupervised learning of human action categories and detecting irregular actions in different datasets.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114440478","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}
We propose a scheme for non-delegatable strong designated verifier signature. The scheme is based on pairings, and utilizes an OR proof technique and a method of ensuring the integrity of a signature. In a standard model, the unforgeability property of the scheme is reducible to a computational Co-Diffie-Hellman problem. The scheme is perfect non-transferable, and its properties of privacy of signer's identity and non-delegatability are reducible to the correctness of two variants of a knowledge of exponent assumption.
{"title":"A Non-delegatable Strong Designated Verifier Signature without Random Oracles","authors":"Haibo Tian, Zhengtao Jiang, Yi Liu, Baodian Wei","doi":"10.1109/iNCoS.2012.85","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.85","url":null,"abstract":"We propose a scheme for non-delegatable strong designated verifier signature. The scheme is based on pairings, and utilizes an OR proof technique and a method of ensuring the integrity of a signature. In a standard model, the unforgeability property of the scheme is reducible to a computational Co-Diffie-Hellman problem. The scheme is perfect non-transferable, and its properties of privacy of signer's identity and non-delegatability are reducible to the correctness of two variants of a knowledge of exponent assumption.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126448604","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}
Physical-layer network coding (PNC) employs interactive communication among neighbor nodes by using a proper modulation-and-demodulation technique to improve the communication ability. Most traditional routing protocols in wireless network are designed to reduce or avoid signal interference but do not have the merit of the physical-layer network coding. As a result, the throughout of network can hardly be improved. In this paper we propose a routing protocol based on physical-layer network coding by introducing cross layer coordinated strategy for clustered wireless multi-hop network. Our approach can achieve better improvement of network throughput by comparing with non-coding and other existing network coding strategies.
{"title":"Physical-Layer Network Coding and Connected Dominating Set Based Routing Protocol in Wireless Multi-hop Network","authors":"Li Xu, Penggui Pan, Xiaoding Wang, Wei Wu","doi":"10.1109/iNCoS.2012.38","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.38","url":null,"abstract":"Physical-layer network coding (PNC) employs interactive communication among neighbor nodes by using a proper modulation-and-demodulation technique to improve the communication ability. Most traditional routing protocols in wireless network are designed to reduce or avoid signal interference but do not have the merit of the physical-layer network coding. As a result, the throughout of network can hardly be improved. In this paper we propose a routing protocol based on physical-layer network coding by introducing cross layer coordinated strategy for clustered wireless multi-hop network. Our approach can achieve better improvement of network throughput by comparing with non-coding and other existing network coding strategies.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133946745","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}
Jacob Wilschrey, Cristian Rusu, Iván Mercado, R. Inostroza, Cristhy Jiménez Granizo
The paper presents the development of a virtual drums prototype, based on natural interaction, trough a Kinect device. Results of early tests are encouraging, but the prototype can definitively be improved. The project aims to serve as basis for future developments, and several projects are already undergoing at the School of Informatics Engineering of the Pontifical Catholic University of Valparaiso -- Chile.
{"title":"Virtual Drums Based on Natural Interaction","authors":"Jacob Wilschrey, Cristian Rusu, Iván Mercado, R. Inostroza, Cristhy Jiménez Granizo","doi":"10.1109/iNCoS.2012.78","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.78","url":null,"abstract":"The paper presents the development of a virtual drums prototype, based on natural interaction, trough a Kinect device. Results of early tests are encouraging, but the prototype can definitively be improved. The project aims to serve as basis for future developments, and several projects are already undergoing at the School of Informatics Engineering of the Pontifical Catholic University of Valparaiso -- Chile.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131321354","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}
D. Akoumianakis, Giannis Milolidakis, P. Gnagnarella, A. Misotti, N. Bessis
The present work is concerned with a particular type of online collaborative engagements, namely the management of e-Health campaigns and online intervention studies. In order to establish the baseline, the paper critically reviews prominent tactics facilitated by Social Networking Services (SNS) and social web sites and contrasts them against the specific requirements of targeted online e-Health campaigns and intervention studies. Based on this analysis, the paper describes a web-based system that accommodates functionality and services to enable expert-patient collaboration and co-engagement in building online campaigns and conducting intervention studies. The value and benefits of this approach are illustrated using a case study of cancer patients searching for online nutritional support and collaborating with healthcare providers and other patients.
{"title":"Networking Tactics for Online eHealth Campaigns and Intervention Studies: Preliminary Results from a Case Study on Nutritional Support for Cancer Patients","authors":"D. Akoumianakis, Giannis Milolidakis, P. Gnagnarella, A. Misotti, N. Bessis","doi":"10.1109/iNCoS.2012.23","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.23","url":null,"abstract":"The present work is concerned with a particular type of online collaborative engagements, namely the management of e-Health campaigns and online intervention studies. In order to establish the baseline, the paper critically reviews prominent tactics facilitated by Social Networking Services (SNS) and social web sites and contrasts them against the specific requirements of targeted online e-Health campaigns and intervention studies. Based on this analysis, the paper describes a web-based system that accommodates functionality and services to enable expert-patient collaboration and co-engagement in building online campaigns and conducting intervention studies. The value and benefits of this approach are illustrated using a case study of cancer patients searching for online nutritional support and collaborating with healthcare providers and other patients.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128068213","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}
Work on designing and implementing a patient-centric, personal health record cloud platform based on open-source Indivo X system. We adopt cipher text-policy attribute-based encryption to provide privacy protection and fine-grained access control.
{"title":"Implementing a Personal Health Record Cloud Platform Using Ciphertext-Policy Attribute-Based Encryption","authors":"Chang-ji Wang, Xuan Liu, Wentao Li","doi":"10.1109/iNCoS.2012.65","DOIUrl":"https://doi.org/10.1109/iNCoS.2012.65","url":null,"abstract":"Work on designing and implementing a patient-centric, personal health record cloud platform based on open-source Indivo X system. We adopt cipher text-policy attribute-based encryption to provide privacy protection and fine-grained access control.","PeriodicalId":287478,"journal":{"name":"2012 Fourth International Conference on Intelligent Networking and Collaborative Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133146509","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：