{"title":"An Algorithm of Dynamic Associate Rule Based on Sliding Windows","authors":"Z. Meng, Baosheng Shao, M. Jiang","doi":"10.1109/CIS.2010.18","DOIUrl":"https://doi.org/10.1109/CIS.2010.18","url":null,"abstract":"It is well-known that the traditional association rules with time can’t be found out in many algorithms. First, according to concept of dynamic association rules, this paper analyzes the disadvantages of traditional association rules. Then, the concepts of dynamic association rules based on sliding windows and the definition of time vector representation of dynamic association rules are put forward. So, the dynamic association rules can measure out how association rules change over time. Next, a kind of algorithm to mine dynamic association rules on sliding window is proposed. Finally, numerical experiments show that the proposed algorithm is efficient for finding out dynamic association rules with time.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"89 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":"124854346","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":"Tool Wear Detection Based on Wavelet Packet and BP Neural Network","authors":"Y. Qin, L. Guo, Jian Wang","doi":"10.1109/CIS.2010.14","DOIUrl":"https://doi.org/10.1109/CIS.2010.14","url":null,"abstract":"Based on wavelet packet decomposition and the BP neural network of pattern recognition theory, this article puts forward the theory that can identify the different tool wear conditions during the cutting process, and thus we can use this theory to forecast the tool breakage accurately. The main thinking of this article is that decomposing tool acoustic emission signal by using wavelet packet to get spectrum coefficient as eigenvector, and then putting it into the BP neural network to be trained in order to accomplish the final pattern recognition of tool wear conditions by making use of BP algorithm. By testing the samples of well-trained network, it is proved that the BP neural network constructed has good generalization ability which can identify tool conditions accurately.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"58 2 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":"116568923","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 Kind of Vector Space Representation Model Based on Semantic in the Field of English Standard Information","authors":"Shibin Xiao, Zhu Shi, Kun Liu, Xueqiang Lv","doi":"10.1109/CIS.2010.133","DOIUrl":"https://doi.org/10.1109/CIS.2010.133","url":null,"abstract":"Through the Study of English semantic similarity, based on the previous, we designed the method of calculating English semantic similarity by Word Net. We proposed a vector space representation model of English standard information based on semantic similarity and applied the model on text clustering. This model resolves the problem of semantic correlation between the characteristics which is ignored by vector space model and reduces the semantic loss of practical application systems. Finally, by the experimentation we prove that this method improve the accuracy of text clustering.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"371 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":"121755541","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":"Dynamic Fluzzy Clustering Algorithm for Web Documents Mining","authors":"Qi Luo","doi":"10.1109/CIS.2010.21","DOIUrl":"https://doi.org/10.1109/CIS.2010.21","url":null,"abstract":"This paper first studies the methods of web documents mining and text clustering, and summaries the fuzzy clustering algorithms and similarity measure functions, then proposes a modified similarity function which can solve the problems of feature selection and feature extraction in high-dimensional space. Finally, this paper puts forward to a dynamic fluzzy clustering algorithm(DCFCM) by combining the proposed similarity function with approximated C-mediods. The experiments show that DCFCM can effectively improve he precision of web documents clustering, the method is feasible in web documents mining.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"3 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":"127586997","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 Fully Anonymous Identity-Based Signcryption Scheme in the Standard Model","authors":"Hao Wang, Qiuliang Xu, Han Jiang, Xiufeng Zhao","doi":"10.1109/CIS.2010.86","DOIUrl":"https://doi.org/10.1109/CIS.2010.86","url":null,"abstract":"Anonymity of user is an important property in the cryptographic protocol, to protect the privacy of the participants. In this paper, we propose a new primitive, fully anonymous signcryption, which provide anonymity of both sender and receiver along with the advantage of traditional ring signcryption (only provides anonymity of sender) scheme. We also construct a fully anonymous identity-based signcryption scheme in the standard model. The proposed scheme satisfies the semantic security, unforgeability and full anonymity.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"24 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":"115718869","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":"Correlation Power Analysis Against Stream Cipher MICKEY v2","authors":"Junrong Liu, Dawu Gu, Zheng Guo","doi":"10.1109/CIS.2010.75","DOIUrl":"https://doi.org/10.1109/CIS.2010.75","url":null,"abstract":"In this paper we discuss correlation power analysis attack against stream cipher MICKEY v2. In such attacks, we use Hamming-Distance model to simulate the power consumption. Hamming-Distance model is a more accurate description to power consumption than other models such as Hamming-Weight, bit model etc. Generally, Hamming-Distance model is used to map the transitions that occur at the cells’ outputs of a CMOS circuit to the values of power consumption. In our attacks, we propose the Hamming-Distance model based on internal nodes of XOR gates considering that the basic structure of MICKEY v2 is a two-input and a three-input XOR gate. We simulate the power which is coming from not only the output of gate but also the internal nodes. This model is more accurate than before ones because we simulate the power consumption of all transistors consumed. Then we designed the attack way to MICKEY v2 by this model. And finally we simulate the result of attacking. The result shows that it needs only few or ten power traces during initialization for us to reveal the secret key by using weakness of MICKEY v2 initialization when resynchronization.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"24 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":"116127170","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":"Capability Simulating Model for Complex Communication Network","authors":"Wang Yu, Xuan Feng","doi":"10.1109/CIS.2010.139","DOIUrl":"https://doi.org/10.1109/CIS.2010.139","url":null,"abstract":"Based on the requirement analysis of capability modeling and simulation, put forward the concept model of complex communication network capability. And built an effects simulating framework, includes topology, traffic, damage, jamming and environment. In addition, give a verified instance.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"30 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":"123431839","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":"Lattice-Based Proxy Signature","authors":"Y. Jiang, Fanyu Kong, Xiuling Ju","doi":"10.1109/CIS.2010.88","DOIUrl":"https://doi.org/10.1109/CIS.2010.88","url":null,"abstract":"Those existing proxy signature schemes are mainly based on the assumed hardness of Big Integer Factoring problem and Discrete Logarithm problem. So they can’t resist quantum attacks. This proxy signature scheme is based on the assumed hardness of some lattice problem, which can resist quantum attack. The key pair of proxy signer was generated using basis delegation technology. Combined with GPV basic signature scheme, the proxy signature scheme was constructed. This scheme is satisfied with all the security property of proxy signature schemes. Based on this scheme, variant lattice-based proxy signature schemes will be designed, such as blind proxy signature, multi-grade proxy signature, and identity-based proxy signature etc.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"28 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":"123530479","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":"Research on Feature Extraction Based on Genetic Algorithm in Text Categorization","authors":"Juan Zou, Jinhua Zheng","doi":"10.1109/CIS.2010.27","DOIUrl":"https://doi.org/10.1109/CIS.2010.27","url":null,"abstract":"Using the superiority of the genetic algorithms solving nonlinear problems which is applied to feature extraction on Text Categorization is proposed in this paper. A synonym problem in text is fully considered by this method during the feature extraction processing, and is processed using the concept of fuzzy set. The membership of synonymous as the fitness function of Genetic Algorithm is carried out by evolutionary computation. Comparison test results show that this method not only can reduce the dimension of feature, but also can improve accuracy ration and recall ratio of classification, the overall performance of the classification system is improved finally, the system is achieved a higher level of automation and the strong portability.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"5 suppl 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":"126149093","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":"Automated Static Code Analysis for Classifying Android Applications Using Machine Learning","authors":"A. Shabtai, Yuval Fledel, Y. Elovici","doi":"10.1109/CIS.2010.77","DOIUrl":"https://doi.org/10.1109/CIS.2010.77","url":null,"abstract":"In this paper we apply Machine Learning (ML) techniques on static features that are extracted from Android's application files for the classification of the files. Features are extracted from Android’s Java byte-code (i.e.,.dex files) and other file types such as XML-files. Our evaluation focused on classifying two types of Android applications: tools and games. Successful differentiation between games and tools is expected to provide positive indication about the ability of such methods to learn and model Android benign applications and potentially detect malware files. The results of an evaluation, performed using a test collection comprising 2,285 Android. apk files, indicate that features, extracted statically from. apk files, coupled with ML classification algorithms can provide good indication about the nature of an Android application without running the application, and may assist in detecting malicious applications. This method can be used for rapid examination of Android. apks and informing of suspicious applications.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"13 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":"129778743","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}