Cheng Chen, Wei Song, Jia-cai Zhang, Zhiping Hu, He Xu
{"title":"An Adaptive Feature Extraction Method for Motor-Imagery BCI Systems","authors":"Cheng Chen, Wei Song, Jia-cai Zhang, Zhiping Hu, He Xu","doi":"10.1109/CIS.2010.66","DOIUrl":"https://doi.org/10.1109/CIS.2010.66","url":null,"abstract":"Recently, the research on Brain-Computer Interface (BCI) technology has achieved great progress, and the BCI system based on Motor Imagery (MI) has been intensively studied in many labs. The essential part of signal processing in BCI is how to extract the MI features in electroencephalographic (EEG) and recognize the MI task accurately. One challenge lies in that EEG signals are non-stationary, whose features vary with time. The traditional methods often don’t perform well in BCI, because it does not capture the change of EEG automatically. In this paper, an improved adaptive common spatial patterns (ACSP) method is proposed to adapt to the change of EEG. We test our method for adaptive feature extraction with data from BCI motor imagery experiment, and the efficacy is evaluated by the feature classification accuracy with a support vector machine (SVM) classifier. The results show the effectiveness of the improved adaptive algorithm.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129741990","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}
{"title":"Motion Segmentation Using Central Distance Features and Low-Pass Filter","authors":"Shu-Juan Peng","doi":"10.1109/CIS.2010.54","DOIUrl":"https://doi.org/10.1109/CIS.2010.54","url":null,"abstract":"The motion segmentation is to divide the original motion sequence into several motion fragments with specific semantic, which plays an important role in the motion compression, motion classification, motion synthesis. This paper presents a motion segmentation algorithm based on the central distance features and low-pass filter for the human motion capture data. The proposed approach mainly includes three steps. Firstly, a set of central distance features from the center joint ROOT to limbs was extracted, and those features were divided into the upper and lower limbs norms. Then, PCA method was used to get the one dimension principal component, which can better represent the original motion. Furthermore, the low-pass filter is utilized to get the denoising signal. Consequently, the segmental points set can be obtained. Experimental results show the promising performance of our algorithm.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125865039","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}
{"title":"Prediction Discrete Data Used BP Network Based on AGO","authors":"Xuejun Gao, Zhenyou Wang","doi":"10.1109/CIS.2010.53","DOIUrl":"https://doi.org/10.1109/CIS.2010.53","url":null,"abstract":"A method for prediction discrete data is presented in this article. In order to forecast the discrete data, the experiment that use the GM (1,1) and BP networks to predict discrete data are respectively executed, we found that AGO operation in the GM method can effectively reduce randomness of the discrete data, so AGO operation is applied into the BP network method. According to the result of the simulation experiment, we have obtained more significantly and effectively results than BP network with no used AGO operation. It is explained that BP network can effectively forecast the discrete data with AGO operation.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128111607","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}
{"title":"An Approach to Maximum Lifetime Multicast Delivery in Wireless Ad-Hoc Networks","authors":"Dingde Jiang, Xingwei Wang, Zhengzheng Xu, Zhenhua Chen","doi":"10.1109/CIS.2010.134","DOIUrl":"https://doi.org/10.1109/CIS.2010.134","url":null,"abstract":"The wireless ad-hoc networks do not rely on any infrastructure, which comes at the cost of finite and usually unreplenishable power supplies. It has been an area of intense research how to perform effectively maximum lifetime multicast delivery. This paper presents a new method for this problem, called the Directional Reception Two-step Reconstruction (DRTR). Firstly, based on conventional ad-hoc networks, network model of directional reception is built in order to establish the maximum lifetime multicast tree. Secondly, combined with the link weights defined according to this model, DRTR exploit several strategies to constructs multicast tree satisfied with the end-to-end maximum lifetime. Simulation results show that DRTR can establish quickly the needed multicast tree and is very promising.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127147105","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}
{"title":"Game Analysis of Non-trusted Threshold Authentication Scheme","authors":"Jie Wang, Yongquan Cai","doi":"10.1109/CIS.2010.104","DOIUrl":"https://doi.org/10.1109/CIS.2010.104","url":null,"abstract":"In traditional identity authentication system the user certificate is distributed by the certification center as a user authentication credentials, but this certification system has a lot of deficiencies, it is not safe. Aiming at the weakness of existing schemes, we propose a threshold authentication scheme without trusted center’s participation. The certificate is issued by the group members together. A punishment mechanism is presented and incorporated into the scheme. The program is divided into five stages, and at each stage of the program we analyze its security with game theory. The result indicates that the scheme is a robust and secure.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130690892","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}
{"title":"A New Evolutionary Algorithm Based on Simplex Crossover and PSO Mutation for Constrained Optimization Problems","authors":"Yifan Hu","doi":"10.1109/CIS.2010.38","DOIUrl":"https://doi.org/10.1109/CIS.2010.38","url":null,"abstract":"A new approach is presented to handle constraints optimization using evolutionary algorithms in this paper. First, we present a specific varying fitness function technique, this technique incorporates the problem’s constraints into the fitness function in a dynamic way. The resulting varying fitness function facilitates the EA search. On one hand, The new fitness function without any parameters can properly evaluate not only feasible solution, but also infeasible one, on other hand, the information of the best solution in the current population is also concerned in fitness function, which make search more efficient. Meanwhile, a new crossover operator based on simplex crossover operator and a new PSO mutation operator is also proposed, and both the operators utilize the information of good individuals in the current populations so they can produce high quality offspring. Based on these, a new evolutionary algorithm for constrained optimization problems is proposed. The simulations are made on five widely used benchmark problems, and the results indicate the proposed algorithm is effective","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134098073","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}
Tomer Shimshon, Robert Moskovitch, L. Rokach, Y. Elovici
{"title":"Continuous Verification Using Keystroke Dynamics","authors":"Tomer Shimshon, Robert Moskovitch, L. Rokach, Y. Elovici","doi":"10.1109/CIS.2010.95","DOIUrl":"https://doi.org/10.1109/CIS.2010.95","url":null,"abstract":"Traditionally user authentication is based on a username and password. However, a logged station is still vulnerable to imposters when the user leaves her computer without logging-off. Keystroke dynamics methods can be useful for continuously verifying a user once the authentication process has successfully ended. However, current methods require long sessions and significant amounts of keystrokes to reliably verify users. We propose a new method that compactly represents the keystroke patterns by joining similar pairs of consecutive keystrokes. This automatically created representation reduces the session size required for inducing the user's verification model. The proposed method was evaluated on 21 legitimate users and 165 attackers. The results were encouraging and suggest that the detection performance of the proposed method is better than that of existing methods. Specifically we attained a false acceptance rate (FAR) of 3.47% and false rejection rate (FRR) of 0% using only 250 keystrokes.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132248024","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}
{"title":"An Efficient Semantic Similarity Search on XML Documents","authors":"Li Sheng en, Lv Qiang, Song Ling, L. Yuejun","doi":"10.1109/CIS.2010.26","DOIUrl":"https://doi.org/10.1109/CIS.2010.26","url":null,"abstract":"In this paper, we study the use of XML path query to search an XML fragment in a collection of XML documents. We present efficient techniques that are able to employ bit-slice bloom-filtered signature file as filter and investigate an approach that are able to measure semantic similarity between the query and the XML document in the collection by considering their structures and contents. A ranked list of XML fragments is generated as the search results. By using a set of path queries on a variety of XML documents, the experiments show that the precision and efficiency of the results perform better than ever.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130957236","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}
{"title":"Asymmetric Group Key Agreement with Traitor Traceability","authors":"Xiufeng Zhao, D. Wei, Hao Wang","doi":"10.1109/CIS.2010.81","DOIUrl":"https://doi.org/10.1109/CIS.2010.81","url":null,"abstract":"Recently, the notion of asymmetric group key agreement (ASGKA) was introduced, in which the group members merely negotiate a common encryption key which is accessible to any entity, but they hold respective secret decryption keys. In this paper, we propose an ASGKA protocol with traitor traceability. The new scheme achieves most of known security attributes, such as session key secrecy, known-key secrecy and forward secrecy. In addition, the protocol can provide traitor traceability.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114971359","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}
{"title":"Ship 3D Collaborate Design Integration System Research","authors":"Shao-juan Su, Yin-dong Liu, Xiao-Ming Liu","doi":"10.1109/CIS.2010.137","DOIUrl":"https://doi.org/10.1109/CIS.2010.137","url":null,"abstract":"With development of information technology, traditional serial design process has not need the requirements of ship design. At first the characteristics of modern ship design and need for parallel collaborative design are analyzed. By analyzing the characteristics of 3D CAD software (Solid Works) and PDM system (Wind chill), integrated model and key technologies of the system is discussed. On the basis system integration platform through the middleware interface (Workgroup Manager for Solid Works) are built. Then ship 3D design is brought into project management. Carry on ships 3D collaborate design through key technologies such as document management and workflow management. This idea can solve information isolation problem between CAD system and PDM system and avoid unnecessary repeat works, as the same time improve the efficiency of ship design.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123782655","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}