{"title":"Probabilistic Authentication with Very Lightweight Short Hash","authors":"Pekka Jäppinen","doi":"10.1109/CIS.2012.127","DOIUrl":"https://doi.org/10.1109/CIS.2012.127","url":null,"abstract":"As the communication capabilities are implemented in ever smaller devices with less and less computational capabilities and limited energy source, there is a need for lightweight cryptographic solutions. In this paper we describe lightweight solution for probabilistic authentication of computationally restricted devices. The solution relies on 4-bit lightweight hash, generated with help of substitution box of DESL. The security and weight of the described solutions are evaluated.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121626444","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":"Class Assignment Algorithms for Performance Measure of Clustering Algorithms","authors":"Jie Zhang, Xingsi Xue, Yuping Wang","doi":"10.1109/CIS.2012.31","DOIUrl":"https://doi.org/10.1109/CIS.2012.31","url":null,"abstract":"To measure the performance or validity of clustering algorithms, several evaluation values, such as successful rate, successful number and full successful rate are defined. In order to ensure each cluster to at least contain one vector data, and to maximize several proposed evaluation values, two class assignment algorithms are designed. To testify their performance, we employ them to the k-means clustering algorithms.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122196658","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}
Guoxu Zhou, Zhaoshui He, Yu Zhang, Qibin Zhao, A. Cichocki
{"title":"Canonical Polyadic Decomposition: From 3-way to N-Way","authors":"Guoxu Zhou, Zhaoshui He, Yu Zhang, Qibin Zhao, A. Cichocki","doi":"10.1109/CIS.2012.94","DOIUrl":"https://doi.org/10.1109/CIS.2012.94","url":null,"abstract":"Canonical Polyadic (or CANDECOMP/PARAFAC, CP) decompositions are widely applied to analyze high order data, i.e. N-way tensors. Existing CP decomposition methods use alternating least square (ALS) iterations and hence need to compute the inverse of matrices and unfold tensors frequently, which are very time consuming for large-scale data and when N is large. Fortunately, once at least one factor has been correctly estimated, all the remaining factors can be computed efficiently and uniquely by using a series of rank-one approximations. Motivated by this fact, to perform a full N-way CP decomposition, we run 3-way CP decompositions on a sub-tensor to estimate two factors first. Then the remaining factors are estimated via an efficient Khatri-Rao product recovering procedure. In this way the whole ALS iterations with respect to each mode are avoided and the efficiency can be significantly improved. Simulations show that, compared with ALS based CP decomposition methods, the proposed method is more efficient and is easier to escape from local solutions for high order tensors.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115245226","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}
J. Tanskanen, X. Gao, Jing Wang, Ping Guo, J. Hyttinen, V. Dimitrov
{"title":"Experimental Comparison of Geometric, Arithmetic and Harmonic Means for EEG Event Related Potential Detection","authors":"J. Tanskanen, X. Gao, Jing Wang, Ping Guo, J. Hyttinen, V. Dimitrov","doi":"10.1109/CIS.2012.33","DOIUrl":"https://doi.org/10.1109/CIS.2012.33","url":null,"abstract":"In this paper, we experimentally evaluate three different averaging methods for processing of electroencephalogram (EEG) event related potentials (ERPs) measured from scalp in response to repeated stimulus. In ERP applications, arithmetic mean (AM) is normally employed in processing the ERPs prior to ERP detection, whereas also other averaging methods might have beneficial properties. Fast ERP detection is essential, for example, in brain computer interfaces and during spine surgery. Thus, it is of interest to search for methods to aid in detecting ERPs with as few stimulus repetitions as possible. Here, noise reduction properties of AM, geometric mean (GM), and harmonic mean (HM) are demonstrated with simulations, and ERP processing by the three methods is illustrated by processing real visual evoked potentials (VEPs).","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121514003","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":"Text-independent Speaker Identification Using Fisher Discrimination Dictionary Learning Method","authors":"Xia Wang, Qian Yin, Ping Guo","doi":"10.1109/CIS.2012.103","DOIUrl":"https://doi.org/10.1109/CIS.2012.103","url":null,"abstract":"In last decades, text-independent speaker recognition is a hot research topic attracted many researchers. In this paper, we proposed to apply the Fisher discrimination dictionary learning method to identify the text-independent speaker recognition. The feature used in classification is the Gaussian Mixture Model super vector. The proposed method is evaluated with public ally available dataset TIMIT. Experimental results show that the proposed method outperforms the Sparse Representation Classifier used for text-independent speaker recognition in both clean and noisy condition.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114055817","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}
Li Fen, Li Tong, Zhang Chun-rui, Wang Yong, Song Jiang
{"title":"Length Identification of Unknown Data Frame","authors":"Li Fen, Li Tong, Zhang Chun-rui, Wang Yong, Song Jiang","doi":"10.1109/CIS.2012.155","DOIUrl":"https://doi.org/10.1109/CIS.2012.155","url":null,"abstract":"Unknown protocol identification is widely used in the field of network and information security. Most previous researches focus on known protocol identification and analysis of network layer and above. However, the research on unknown protocol is an essential part for ensuring the safety of information system. In this work, a length identification method of unknown data frame is proposed based on characteristic searching of bit stream of unknown protocol, which can analyzes and researches protocols unknown from physical layer to application layer and determines the length of frame effectively. This method can adapt to the identification of unknown communication protocol and is significant to network and information security.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114275330","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":"Fast Static Particle Swarm Optimization Based Feature Selection for Face Detection","authors":"Fan Lei, Yao Lu, Wei Huang, Lujun Yu, Lin-Na Jia","doi":"10.1109/CIS.2012.96","DOIUrl":"https://doi.org/10.1109/CIS.2012.96","url":null,"abstract":"Feature selection only using wrapper method in high-dimensional data space is always time-consuming. A new feature selection method, named fast static particle swarm optimization, is proposed for tackling this problem. It treats the whole initial feature set as a static particle swarm in which no new particle would be generated in high dimensional space, and the proposed method takes filter and wrapper strategy to pick out the most discriminative feature particle subset. Compared with the existing methods, experimental results show that the proposed method is faster than the existing methods in frontal face detection, and the detection error rate is lower than them on average.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125641401","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":"Fault Model Libraries for Safety Analysis and their Ontology-based Reuse","authors":"Juguo Wang, Y. Pu, Guoqi Li","doi":"10.1109/CIS.2012.74","DOIUrl":"https://doi.org/10.1109/CIS.2012.74","url":null,"abstract":"In this paper, we firstly analyze the requirement of building fault model libraries and then clarify programs for building fault model libraries in Simulink. Additionally, we present an ontology-base method for reuse of the fault model libraries. The libraries and its reuse are hopeful to enhance the quality and efficiency of safety analysis of critical systems developed with model-based method.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"13 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114018778","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}
Haifeng Zhang, Zhaohui Zhang, Hongtao Yang, Li Wu, Linao Tang, Qing Zhu, Sen Dong, Maoyuan Qin, Yangjie Lei
{"title":"Real-Time Auto-Focus System Design Based on Climbing Algorithm and its FPGA Implementation","authors":"Haifeng Zhang, Zhaohui Zhang, Hongtao Yang, Li Wu, Linao Tang, Qing Zhu, Sen Dong, Maoyuan Qin, Yangjie Lei","doi":"10.1109/CIS.2012.81","DOIUrl":"https://doi.org/10.1109/CIS.2012.81","url":null,"abstract":"In real-time imaging applications, the auto-focus algorithm and hardware structure must be adapted to the limited resources for fast and accurate real-time auto-focusing. In this paper, to obtain more precision, a new clarity evaluation function base on image's edge energy is proposed. Then, we present the corresponding FPGA hardware implementation which has simple structure. Additionally, utilizing the prior knowledge during the climbing process, a new climbing algorithm for the auto-focus which has the random start point is proposed. The experiment results show the proposed auto-focus algorithm can reduce the steps during the climbing and accelerate the auto-focus speed simultaneously.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114178590","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":"Detecting Spam in Chinese Microblogs - A Study on Sina Weibo","authors":"Lin Liu, Kun Jia","doi":"10.1109/CIS.2012.135","DOIUrl":"https://doi.org/10.1109/CIS.2012.135","url":null,"abstract":"Sina Weibo is the most popular and fast growing microblogging social network in China. However, more and more spam messages are also emerging on Sina Weibo. How to detect these spam is essential for the social network security. While most previous studies attempt to detect the microblogging spam by identifying spammers, in this paper, we want to exam whether we can detect the spam by each single Weibo message, because we notice that more and more spam Weibos are posted by normal users or even popular verified users. We propose a Weibo spam detection method based on machine learning algorithm. In addition, different from most existing microblogging spam detection methods which are based on English microblogs, our method is designed to deal with the features of Chinese microblogs. Our extensive empirical study shows the effectiveness of our approach.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117164474","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}