Xingjun Zhang, Endong Wang, Long Xin, Zhongyuan Wu, W. Dong, Xiaoshe Dong
The kernel-level Root kit brings operating system mortal security risk. The existing detection methods, which are based on host environment, have limitations such as high Root kit privileges, weak isolation capacity. If the detected system, which may includes Root kit, and the detection system are resided on guest and host environment respectively, those limitations can be resolved. The paper proposed a method of Root kit detection based on KVM (Kernel-based Virtual Machine) by using virtualization technology. This method adopts guest memory protection mechanism, which is based on protection of host page tables and trusted code segments, for static kernel code and data. As for dynamically allocated code and data in heap space, this method introduces integrity checking mechanism, which is based on threshold triggering of calling sequences of monitored functions. The experimental results showed that this method can prevent static code or data from Root kit attacking effectively, and also detect attacks to dynamically allocated code or data quickly.
{"title":"KVM-based Detection of Rootkit Attacks","authors":"Xingjun Zhang, Endong Wang, Long Xin, Zhongyuan Wu, W. Dong, Xiaoshe Dong","doi":"10.1109/INCoS.2011.111","DOIUrl":"https://doi.org/10.1109/INCoS.2011.111","url":null,"abstract":"The kernel-level Root kit brings operating system mortal security risk. The existing detection methods, which are based on host environment, have limitations such as high Root kit privileges, weak isolation capacity. If the detected system, which may includes Root kit, and the detection system are resided on guest and host environment respectively, those limitations can be resolved. The paper proposed a method of Root kit detection based on KVM (Kernel-based Virtual Machine) by using virtualization technology. This method adopts guest memory protection mechanism, which is based on protection of host page tables and trusted code segments, for static kernel code and data. As for dynamically allocated code and data in heap space, this method introduces integrity checking mechanism, which is based on threshold triggering of calling sequences of monitored functions. The experimental results showed that this method can prevent static code or data from Root kit attacking effectively, and also detect attacks to dynamically allocated code or data quickly.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126538670","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}
Pub Date : 2011-11-30DOI: 10.1504/IJKL.2012.051685
Burasakorn Yoosooka, V. Wuwongse
This paper proposes a new approach to automatic retrieval of Learning Objects (LOs) from local or external LO repositories via Linked Open Data (LOD) principles. This approach dynamically selects the most appropriate LOs for an individual learning package in an adaptive e-Learning system based on the use of LO metadata, learner profiles, ontologies, and LOD principles. The approach has been designed to interlink the domain ontology with external open knowledge in the LOD cloud. SPARQL endpoints for datasets in the LOD cloud are also provided for instructors and learners to discover their desired LOs. Moreover, commonly known vocabularies such as Dublin Core (DC), IEEE Learning Object Metadata (IEEE LOM), Web Ontology Language (OWL), and Resource Description Framework (RDF) are employed to represent metadata and to link it with external LO repositories as well as DBpedia, the central hub of the LOD cloud. By using these techniques, the LOs and external knowledge can be exchangeable, shareable, and interoperable, resulting in an enhanced access to better learning resources. Based on the proposed approach, a prototype system has been developed and evaluated. It has been discovered that the system has yielded positive effects in terms of the learners' satisfaction.
{"title":"Linked Open Data for Learning Object Discovery: Adaptive e-Learning Systems","authors":"Burasakorn Yoosooka, V. Wuwongse","doi":"10.1504/IJKL.2012.051685","DOIUrl":"https://doi.org/10.1504/IJKL.2012.051685","url":null,"abstract":"This paper proposes a new approach to automatic retrieval of Learning Objects (LOs) from local or external LO repositories via Linked Open Data (LOD) principles. This approach dynamically selects the most appropriate LOs for an individual learning package in an adaptive e-Learning system based on the use of LO metadata, learner profiles, ontologies, and LOD principles. The approach has been designed to interlink the domain ontology with external open knowledge in the LOD cloud. SPARQL endpoints for datasets in the LOD cloud are also provided for instructors and learners to discover their desired LOs. Moreover, commonly known vocabularies such as Dublin Core (DC), IEEE Learning Object Metadata (IEEE LOM), Web Ontology Language (OWL), and Resource Description Framework (RDF) are employed to represent metadata and to link it with external LO repositories as well as DBpedia, the central hub of the LOD cloud. By using these techniques, the LOs and external knowledge can be exchangeable, shareable, and interoperable, resulting in an enhanced access to better learning resources. Based on the proposed approach, a prototype system has been developed and evaluated. It has been discovered that the system has yielded positive effects in terms of the learners' satisfaction.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131209054","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}
Dan Cao, Bao-kang Zhao, Xiaofeng Wang, Jinshu Su, Guofei Ji
Attribute-based signature (ABS) is a new cryptographic primitive, in which a signer can sign a message with his attributes, and the verifier can only known whether the signer owns attributes satisfying his policy. Moreover, the signature cannot be forged by any user not having attributes satisfying the policy. ABS has many applications, such as anonymous authentication, and attribute-based messaging systems. But these applications may require a user to obtain attributes from different authorities, which calls for a multi-authority ABS scheme. In addition, multiple authorities can distribute the trust to all authorities, instead of concerning on a single attribute authority. In this paper, we propose a multi-authority ABS scheme, supporting complex policies, expressing AND, OR, and threshold conditions. We use a central authority to assure the usability of attribute keys a user getting from different attribute authorities. To prevent collusion attacks, we adopt a unique global identity (GID) for a user to bind his attribute keys and identity together. And a secret key from the central authority help the verification be independent of the user's identity. So our scheme can fit the requirements of real applications, and also distribute the trust to all authorities in the system.
{"title":"Multi-authority Attribute-Based Signature","authors":"Dan Cao, Bao-kang Zhao, Xiaofeng Wang, Jinshu Su, Guofei Ji","doi":"10.1109/INCoS.2011.122","DOIUrl":"https://doi.org/10.1109/INCoS.2011.122","url":null,"abstract":"Attribute-based signature (ABS) is a new cryptographic primitive, in which a signer can sign a message with his attributes, and the verifier can only known whether the signer owns attributes satisfying his policy. Moreover, the signature cannot be forged by any user not having attributes satisfying the policy. ABS has many applications, such as anonymous authentication, and attribute-based messaging systems. But these applications may require a user to obtain attributes from different authorities, which calls for a multi-authority ABS scheme. In addition, multiple authorities can distribute the trust to all authorities, instead of concerning on a single attribute authority. In this paper, we propose a multi-authority ABS scheme, supporting complex policies, expressing AND, OR, and threshold conditions. We use a central authority to assure the usability of attribute keys a user getting from different attribute authorities. To prevent collusion attacks, we adopt a unique global identity (GID) for a user to bind his attribute keys and identity together. And a secret key from the central authority help the verification be independent of the user's identity. So our scheme can fit the requirements of real applications, and also distribute the trust to all authorities in the system.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132345403","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}
Zhitu Su, Chun-hui Sun, Hui Li, Jianfeng Ma, K. Fan
In pairing-based cryptography, Miller's algorithm plays a key role in the calculation of pairing. Currently, most of the optimizations of Miller's algorithm are of serial structure. In this paper, we propose a parallel method for efficiently computing pairing. Our method can be applied to super singular elliptic curves and ordinary elliptic curves which are suitable for pairing-based cryptography. Compared with general version of Miller's algorithm, our method has a gain of around 50.0%.
{"title":"Fast Parallel Computation of Tate Pairing","authors":"Zhitu Su, Chun-hui Sun, Hui Li, Jianfeng Ma, K. Fan","doi":"10.1109/INCoS.2011.93","DOIUrl":"https://doi.org/10.1109/INCoS.2011.93","url":null,"abstract":"In pairing-based cryptography, Miller's algorithm plays a key role in the calculation of pairing. Currently, most of the optimizations of Miller's algorithm are of serial structure. In this paper, we propose a parallel method for efficiently computing pairing. Our method can be applied to super singular elliptic curves and ordinary elliptic curves which are suitable for pairing-based cryptography. Compared with general version of Miller's algorithm, our method has a gain of around 50.0%.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134389075","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}
S. T. Marín, N. Bessis, M. R. Martínez-Torres, Florian Franc, F. Barrero, F. Xhafa
For several decades, academics around the world have been collaborating with the view to support the development of their research domain. Having said that, the majority of scientific and technological policies try to encourage the creation of strong inter-related research groups in order to improve the efficiency of research outcomes and subsequently research funding allocation. In this paper, we attempt to highlight and thus, to demonstrate how these collaborative networks are developing in practice. To achieve this, we have developed an automated tool for extracting data about joint article publications and analyzing them from the perspective of social network analysis. In this case study, we have limited data from works published in 2010 by England academic and research institutions. The outcomes of this work can help policy makers in realising the current status of research collaborative networks in England.
{"title":"An Exploratory Social Network Analysis of Academic Research Networks","authors":"S. T. Marín, N. Bessis, M. R. Martínez-Torres, Florian Franc, F. Barrero, F. Xhafa","doi":"10.1109/INCOS.2011.49","DOIUrl":"https://doi.org/10.1109/INCOS.2011.49","url":null,"abstract":"For several decades, academics around the world have been collaborating with the view to support the development of their research domain. Having said that, the majority of scientific and technological policies try to encourage the creation of strong inter-related research groups in order to improve the efficiency of research outcomes and subsequently research funding allocation. In this paper, we attempt to highlight and thus, to demonstrate how these collaborative networks are developing in practice. To achieve this, we have developed an automated tool for extracting data about joint article publications and analyzing them from the perspective of social network analysis. In this case study, we have limited data from works published in 2010 by England academic and research institutions. The outcomes of this work can help policy makers in realising the current status of research collaborative networks in England.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134314146","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}
This paper has presented acquiring method for agents' actions using Ant Colony Optimization (ACO) in multi-agent system. ACO is one of powerful meta-heuristics algorithms and some researchers have reported the effectiveness of some applications with the algorithm [1-4]. I have developed fire brigade agents using proposed method in RoboCup rescue simulation system. The final goal of this research is an achievement of co-operations for hetero-agent in multi-agent systems. Then this research for implementation for fire brigade agents in my team is the first step of this goal.
{"title":"Introduction of Acquiring Method for Agents' Actions with Simple Ant Colony Optimization in RoboCup Rescue Simulation System","authors":"Hisayuki Sasaoka","doi":"10.1109/INCoS.2011.105","DOIUrl":"https://doi.org/10.1109/INCoS.2011.105","url":null,"abstract":"This paper has presented acquiring method for agents' actions using Ant Colony Optimization (ACO) in multi-agent system. ACO is one of powerful meta-heuristics algorithms and some researchers have reported the effectiveness of some applications with the algorithm [1-4]. I have developed fire brigade agents using proposed method in RoboCup rescue simulation system. The final goal of this research is an achievement of co-operations for hetero-agent in multi-agent systems. Then this research for implementation for fire brigade agents in my team is the first step of this goal.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133941459","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}
Identity requirements in information systems can be satisfied by the integration of biometric technologies with cryptography algorithms. In this field, one of the most important areas is the generation of strong cryptographic keys produced from many kinds of biometrics. This paper describes some solutions within this scope focusing on an efficient approach to generating cryptographic keys from visual patterns containing personal information. Generated cryptographic key may be identified by user features, and used by particular persons. In particular, key generation using palm images and coronary vessels will be presented.
{"title":"Image Based Crypto-biometric Key Generation","authors":"M. Ogiela, L. Ogiela","doi":"10.1109/INCoS.2011.102","DOIUrl":"https://doi.org/10.1109/INCoS.2011.102","url":null,"abstract":"Identity requirements in information systems can be satisfied by the integration of biometric technologies with cryptography algorithms. In this field, one of the most important areas is the generation of strong cryptographic keys produced from many kinds of biometrics. This paper describes some solutions within this scope focusing on an efficient approach to generating cryptographic keys from visual patterns containing personal information. Generated cryptographic key may be identified by user features, and used by particular persons. In particular, key generation using palm images and coronary vessels will be presented.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114688571","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}
Most of traditional studies on information recommendation systems aim at recommending highly satisfactory information in a one-time or small number of uses of a system or service, and never take it into account that the user would feel tired of the same system or service after they have used it many times over. This study has modeled the human nature of being tired of the same thing and enabled the measurement of the degree of such boredom. This time, the study has implemented an information recommendation system that has features to (1) visualize the degree of the user's boredom and (2) recommend information that can reduce it. Then, an evaluation experiment was conducted using a system developed. The result of an evaluation experiment shows that the@system@can get the user less bored and more satisfied when used continuously.
{"title":"A Study on Information Recommendation Systems for Continuous Use","authors":"H. Shoji, Hiroo Inamura, A. Ogino","doi":"10.1109/INCoS.2011.40","DOIUrl":"https://doi.org/10.1109/INCoS.2011.40","url":null,"abstract":"Most of traditional studies on information recommendation systems aim at recommending highly satisfactory information in a one-time or small number of uses of a system or service, and never take it into account that the user would feel tired of the same system or service after they have used it many times over. This study has modeled the human nature of being tired of the same thing and enabled the measurement of the degree of such boredom. This time, the study has implemented an information recommendation system that has features to (1) visualize the degree of the user's boredom and (2) recommend information that can reduce it. Then, an evaluation experiment was conducted using a system developed. The result of an evaluation experiment shows that the@system@can get the user less bored and more satisfied when used continuously.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116703879","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}
Tsuneo Kagawa, Hideki Kudo, S. Tanoue, H. Kiyosue, H. Mori, Hiroaki Nishino, K. Utsumiya
Recently, Computer Aided Diagnosis (CAD) has become one of the most important for medical activity. The more exact and various CAD become, the larger amount of medical images are provided. Furthermore, these images becomes high definition. Radiologists have to cost their time and efforts to investigate these medical images. It is strongly required to reduce their burden without debasing the quality of imaging diagnosis. In this paper, we propose the technique to generate sound information based on the image features and discuss their effects for diagnosis. Generating sound effects helps for attention rousing and the fatigue reduction for medical imaging diagnosis.
{"title":"Development of Medical Imaging Diagnosis Support System with Sound Effects","authors":"Tsuneo Kagawa, Hideki Kudo, S. Tanoue, H. Kiyosue, H. Mori, Hiroaki Nishino, K. Utsumiya","doi":"10.1109/INCoS.2011.75","DOIUrl":"https://doi.org/10.1109/INCoS.2011.75","url":null,"abstract":"Recently, Computer Aided Diagnosis (CAD) has become one of the most important for medical activity. The more exact and various CAD become, the larger amount of medical images are provided. Furthermore, these images becomes high definition. Radiologists have to cost their time and efforts to investigate these medical images. It is strongly required to reduce their burden without debasing the quality of imaging diagnosis. In this paper, we propose the technique to generate sound information based on the image features and discuss their effects for diagnosis. Generating sound effects helps for attention rousing and the fatigue reduction for medical imaging diagnosis.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121714242","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}
On-line collaborative learning is a mature research field that benefits from collaborative activities which can increase learning efficacy. However, collaborative learning approaches are still not beneficial in every e-learning experience because they require people's presence and collaboration is many times difficult to achieve. It is remarkable that collaborative learning resources still suffer from endemic problems, such as the lack of authentic interactivity, user empowerment, social identity and challenge, thus having a negative effect in learner motivation and engagement. To overcome these and other limitations and deficiencies, we propose a new type of learning object named Complex Collaborative Learning Objects to support the virtualization of collaborative sessions with the aim to leverage the knowledge elicited during live sessions of collaborative learning, which are augmented with author-generated information, in order to produce interactive and attractive resources to be played by learners. In order to improve social engagement, during the CC-LO execution, a VCS is animated so learners can observe how avatars discuss and collaborate, how discussion threads grow and how knowledge is been constructed, refined and consolidated. Furthermore, learners can interact with the CC-LO to modify some parameters observing the consequences and assessing their understanding. The research reported in this paper is currently undertaken within a FP7 European project called ALICE.
{"title":"CC-LO: A New Type of Learning Object for the Virtualization of Live Collaborative Sessions","authors":"S. Caballé, N. Mora, I. Dunwell, D. Gañán","doi":"10.1109/INCOS.2011.59","DOIUrl":"https://doi.org/10.1109/INCOS.2011.59","url":null,"abstract":"On-line collaborative learning is a mature research field that benefits from collaborative activities which can increase learning efficacy. However, collaborative learning approaches are still not beneficial in every e-learning experience because they require people's presence and collaboration is many times difficult to achieve. It is remarkable that collaborative learning resources still suffer from endemic problems, such as the lack of authentic interactivity, user empowerment, social identity and challenge, thus having a negative effect in learner motivation and engagement. To overcome these and other limitations and deficiencies, we propose a new type of learning object named Complex Collaborative Learning Objects to support the virtualization of collaborative sessions with the aim to leverage the knowledge elicited during live sessions of collaborative learning, which are augmented with author-generated information, in order to produce interactive and attractive resources to be played by learners. In order to improve social engagement, during the CC-LO execution, a VCS is animated so learners can observe how avatars discuss and collaborate, how discussion threads grow and how knowledge is been constructed, refined and consolidated. Furthermore, learners can interact with the CC-LO to modify some parameters observing the consequences and assessing their understanding. The research reported in this paper is currently undertaken within a FP7 European project called ALICE.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128344954","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
扫码关注我们
求助内容：
应助结果提醒方式：