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":null,"pages":null},"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":null,"pages":null},"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":null,"pages":null},"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}
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":null,"pages":null},"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}
In this paper, we propose an experimental implementation of activity recognition feature on the activity information gathering system named ALKAN. In this experiment, we develop activity recognition algorithm using machine learning on server system, and port it onto client system on mobile phone. We also confirmed the feasibility of real-time activity recognition with actual mobile phone.
{"title":"Implementation of Activity Recognition from Accelerometers on Mobile Phones","authors":"Go Hirakawa, T. Nwe, Yuichi Hattori, Sozo Inoue","doi":"10.1109/INCoS.2011.103","DOIUrl":"https://doi.org/10.1109/INCoS.2011.103","url":null,"abstract":"In this paper, we propose an experimental implementation of activity recognition feature on the activity information gathering system named ALKAN. In this experiment, we develop activity recognition algorithm using machine learning on server system, and port it onto client system on mobile phone. We also confirmed the feasibility of real-time activity recognition with actual mobile phone.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113972553","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}
Achieving network connectivity and user coverage are among the most important objectives in Wireless Mesh Networks (WMNs). These objectives are formulated as optimization problems, which unfortunately cannot be solved to optimality due to their computational hardness nature. Heuristic methods have thus been considered for such optimization problem aiming to compute near optimal solutions in reasonable amount of time. One family of heuristic methods known for their efficiency is that of local search algorithms. The methods in this family explore the solution space through a path of solutions, visited during the search process. Among methods of this family, Tabu Search (TS) has shown its superiority due to advanced mechanisms to overcome getting stuck into local optima. In this paper we present the implementation and evaluation of TS for the problem of mesh router node placement in WMNs, formulated as a bi-objective optimization problem. The optimization model consists in the maximization of the size of the giant component in the mesh routers network (for measuring network connectivity) and that of user coverage. The experimental evaluation showed the efficiency of TS in solving a variety of problem instances generated using different distributions for the mesh client nodes in WMNs.
{"title":"A Tabu Search Algorithm for Efficient Node Placement in Wireless Mesh Networks","authors":"F. Xhafa, C. Sánchez, Admir Barolli, M. Takizawa","doi":"10.1109/INCOS.2011.44","DOIUrl":"https://doi.org/10.1109/INCOS.2011.44","url":null,"abstract":"Achieving network connectivity and user coverage are among the most important objectives in Wireless Mesh Networks (WMNs). These objectives are formulated as optimization problems, which unfortunately cannot be solved to optimality due to their computational hardness nature. Heuristic methods have thus been considered for such optimization problem aiming to compute near optimal solutions in reasonable amount of time. One family of heuristic methods known for their efficiency is that of local search algorithms. The methods in this family explore the solution space through a path of solutions, visited during the search process. Among methods of this family, Tabu Search (TS) has shown its superiority due to advanced mechanisms to overcome getting stuck into local optima. In this paper we present the implementation and evaluation of TS for the problem of mesh router node placement in WMNs, formulated as a bi-objective optimization problem. The optimization model consists in the maximization of the size of the giant component in the mesh routers network (for measuring network connectivity) and that of user coverage. The experimental evaluation showed the efficiency of TS in solving a variety of problem instances generated using different distributions for the mesh client nodes in WMNs.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129664386","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}
In order to practically examine a new type of class, in which cooperative learning is taken into consideration, we designed and built a classroom. This classroom, in which furniture and a flexible ICT basis are both designed reconfigurable, supports much more complex interactions between learners than in a traditional classroom. Two months' observation of the activities in the classroom shows that many aspects of the reconfigurations have encouraged complex interactions within cooperative learning.
{"title":"Design and Implementation of a Dynamic Reconfigurable Classroom for Cooperative Learning","authors":"Hideki Kondo, H. Narahara","doi":"10.1109/INCoS.2011.72","DOIUrl":"https://doi.org/10.1109/INCoS.2011.72","url":null,"abstract":"In order to practically examine a new type of class, in which cooperative learning is taken into consideration, we designed and built a classroom. This classroom, in which furniture and a flexible ICT basis are both designed reconfigurable, supports much more complex interactions between learners than in a traditional classroom. Two months' observation of the activities in the classroom shows that many aspects of the reconfigurations have encouraged complex interactions within cooperative learning.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128063572","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}
In this paper we propose a model of the evolution of a market with linear utilities in the presence of both local and global social interactions. In the scenario considered, there is a market consisting of buyers and divisible goods. In consecutive time periods, the decision of a buyer is affected by the consumption plan of his neighbors and by a global signal, the distribution of actions of all agents. Moreover, we assume that the market prices and the allocation of the goods are stabilized by the law of supply and demand. We simulate the model, along with a market equilibria algorithm, and we investigate the long time behavior of the system. Specifically, we analyze the distribution of the prices and the market share of the products, when the configuration of the network is Erdos-Renyi and Scale-free graph. The experimental results show that the long time behavior of the system is not always static. The long time states depict a periodic pattern and are sensitive to a) the initial agents' beliefs, b) the weights that each agent assigns to the local and the global factor respectively and c)the degree distribution of the nodes in the network.
{"title":"Diffusion in Social Networks and Market Stability","authors":"Nikos Salamanos, Dimitris Konstantopoulos","doi":"10.1109/INCoS.2011.76","DOIUrl":"https://doi.org/10.1109/INCoS.2011.76","url":null,"abstract":"In this paper we propose a model of the evolution of a market with linear utilities in the presence of both local and global social interactions. In the scenario considered, there is a market consisting of buyers and divisible goods. In consecutive time periods, the decision of a buyer is affected by the consumption plan of his neighbors and by a global signal, the distribution of actions of all agents. Moreover, we assume that the market prices and the allocation of the goods are stabilized by the law of supply and demand. We simulate the model, along with a market equilibria algorithm, and we investigate the long time behavior of the system. Specifically, we analyze the distribution of the prices and the market share of the products, when the configuration of the network is Erdos-Renyi and Scale-free graph. The experimental results show that the long time behavior of the system is not always static. The long time states depict a periodic pattern and are sensitive to a) the initial agents' beliefs, b) the weights that each agent assigns to the local and the global factor respectively and c)the degree distribution of the nodes in the network.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130603000","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":null,"pages":null},"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}
Kwangjin Bae, Sungjin Kim, Yongoo Lee, I. You, Kangbin Yim, Taeho Son
Recently, several severe cyber attacks to commercial networks and their systems have been found more frequently compared to the last half decade. According to the analysis results from the experts, most of the attacks had similar approach to reach their goal: compromising the web server and bridging to the storage server instead of direct penetrating through the firewalls within the intranet. Because web servers are usually easier to compromise than other insiders in the server farm, this unwanted approach would be common for hackers. This means that the servers in the secured server farm became unsafe and the storage server has no exception. Because of the reason, this paper introduces the concept of the secondary backup and proposes a consequent framework.
{"title":"Insider Threats are Getting Worse within Industries: Isolated Secondary Backup Required","authors":"Kwangjin Bae, Sungjin Kim, Yongoo Lee, I. You, Kangbin Yim, Taeho Son","doi":"10.1109/INCoS.2011.165","DOIUrl":"https://doi.org/10.1109/INCoS.2011.165","url":null,"abstract":"Recently, several severe cyber attacks to commercial networks and their systems have been found more frequently compared to the last half decade. According to the analysis results from the experts, most of the attacks had similar approach to reach their goal: compromising the web server and bridging to the storage server instead of direct penetrating through the firewalls within the intranet. Because web servers are usually easier to compromise than other insiders in the server farm, this unwanted approach would be common for hackers. This means that the servers in the secured server farm became unsafe and the storage server has no exception. Because of the reason, this paper introduces the concept of the secondary backup and proposes a consequent framework.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126007190","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
扫码关注我们
求助内容：
应助结果提醒方式：