{"title":"An Improved Clustering Algorithm Based on Ant Colony Approach","authors":"Zhang Tao, Xiaodong Lv, Zh. Zaixu","doi":"10.1109/CIS.WORKSHOPS.2007.78","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.78","url":null,"abstract":"Ant colony algorithm is a kind of evolutionary algorithm with global optimization quality to deal with discrete problem. Clustering analysis is an important part in data mining community. Traditional clustering algorithm is slow of the convergence and sensitive to the initial value and preset classed in large scale data set. The ant colony algorithm was applied in aggregation analysis for the first time in this paper. A new clustering algorithm was presented based on the ant colony algorithm. This algorithm has quality of essential parallel, quick convergence and high effectiveness. The experimental result shows that it is about 10% higher than the c-means method in effectiveness.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125260086","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":"Improving the Non-dominate Sorting Genetic Algorithm for Multi-objective Optimization","authors":"V. S. Ghomsheh, M.A. Khanehsar, M. Teshnehlab","doi":"10.1109/CIS.WORKSHOPS.2007.192","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.192","url":null,"abstract":"The non-dominate sorting genetic algorithmic-II (NSGA-II) is a relatively recent technique for finding or approximating the Pareto-optimal set for multi-objective optimization problems. In different studies NSGA-II has shown good performance in comparison to other multi-objective evolutionary algorithms (Deb et al., 2002). In this paper an improved version which is named Niching-NSGA-II (n-NSGA-II) is proposed. This algorithm uses new method after non-dominate sorting procedure for keeping diversity. The comparison of n-NSGA-II with NSGA-II and other methods on ZDT test problems yields promising results.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114002899","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":"Association Rules Mining Using Multi-objective Coevolutionary Algorithm","authors":"Jian Hu, Yang-Li Xiang","doi":"10.1109/CIS.WORKSHOPS.2007.22","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.22","url":null,"abstract":"Association rule mining can be considered as a multi-objective problem, rather than as a single objective one. To enhance the correlation degree and comprehensibility of association rule, two new measures, including statistical correlation and comprehensibility, as objection functions are proposed in this paper. Their calculating formulas and primary characteristics are given. Association rule mining is generally solved by lexicographic order method. On the basis of discussing the weakness of above method, a new coevolutionary algorithm is put forward in this paper to solve multi-objective optimization problem of association rule. Three coevolutionary operators are designed and the mining algorithm is realized in this paper. According to experimentation, the algorithm has been found suitable for association rule mining of large databases.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131126967","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":"Sparseness Points Cloud Data Surface Reconstruction Based on Radial Basis Function Neural Network (RBFNN) and Simulated Annealing Arithmetic","authors":"Xue-mei Wu, Gui-xian Li, Wei-min Zhao","doi":"10.1109/CIS.WORKSHOPS.2007.110","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.110","url":null,"abstract":"A novel neural network arithmetic was employed in sparseness points cloud data surface interpolation and reconstruction. Radial basis function neural network and simulated annealing arithmetic was combined. The new arithmetic can approach any nonlinear function by arbitrary precision, and also keep the network from getting into local minimum. Global optimization feature of simulated annealing was employed to adjust the network weights. MATLAB program was compiled, experiments on sparseness points cloud data have been done employing this arithmetic, the result shows that this arithmetic can efficiently approach the surface with 10-4 mm error precision, and also the learning speed is quick and reconstruction surface is smooth. Different methods have been employed to do surface reconstruction in comparison, the sum squared error is 6.7times10-8 mm employing the algorithmic proposed in the paper, the one is 1.34times10-6 mm with same parameters employing radial basis function neural network. Backpropagation learning algorithm network does not converge until 3500 iterative procedure.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131214482","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":"Multi-secret Sharing Threshold Visual Cryptography Scheme","authors":"Bin Yu, Xiaohui Xu, Liguo Fang","doi":"10.1109/CIS.WORKSHOPS.2007.206","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.206","url":null,"abstract":"Original VCS can only share a secret image at a time. When we want to share more secret images, we need to preserve a number of shares which increase our burden. Based on (k, n)-VCS and (k-1, k-1)-VCS, we propose a multi-secret sharing threshold VCS that a participant only preserves a share to share more than one secret and expands the scope of application.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"75 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131898456","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 Multi-constraint QoS Routing Protocol with Route-Request Selection Based on Mobile Predicting in MANET","authors":"Jin Lian, La-yuan Li, Xiao-yan Zhu","doi":"10.1109/CIS.WORKSHOPS.2007.165","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.165","url":null,"abstract":"Due to the dynamic nature of the network topology and restricted resources, the stable routing based on quality of service (QoS) in mobile ad hoc network (MANET) is a challenging task. QoS requirement with uncertain parameters has become a very important research issue in MANET. The paper presents a multi-constraint QoS routing protocol with route-request selection based on mobile predicting (QRRSMP). The QRRSMP is the scalable routing algorithm whose control overhead should be under control to keep up with increasing offered load. In this algorithm, the goal is to construct a stable QoS routing path and reduce the number of route-request (RREQ) packet by forwarding or discarding RREQ packets. Simulation results show that the proposed approach reduces the control overhead and provides the QoS routing stability in dynamic mobile networks.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114202512","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}
Liu Zhuang, Huang Yuan-fei, Jian Wei-guang, Zhou Jiang-bo, Guo He-qing
{"title":"Solving Fuzzy QoS Constraint Satisfaction Technique for Web Service Selection","authors":"Liu Zhuang, Huang Yuan-fei, Jian Wei-guang, Zhou Jiang-bo, Guo He-qing","doi":"10.1109/CIS.WORKSHOPS.2007.53","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.53","url":null,"abstract":"In global Web services selection, it involves to multi-objectives optimization and tradeoffs of diversified QoS criteria, therefore a suitable genetic algorithm is proposed to tackle the service selection problem. Since the QoS criteria are not always explicit and usually containing of fuzzy element, So this paper focuses on the relation between constraint satisfaction of fuzzy QoS criteria optimization and fitness evolution in multi-objective Web services selection and how to adjust the fuzzy QoS criteria of individual to fit for the evolution of population.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126431145","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":"Cooperative Algorithm for Multi-agent Foraging Task Based on Modified Hawk-Dove Game","authors":"Yuehai Wang, Jie Liu, Wei Meng","doi":"10.1109/CIS.WORKSHOPS.2007.119","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.119","url":null,"abstract":"Multi-agent foraging is a popular benchmark to verify the effectiveness of different cooperation algorithm. Markov game based approaches were wildly used although they could not select consistent equilibrium for the group. Using evolutionarily stable strategy as optimal solution, we build a modified hawk-dove game model to simulate the interaction between agents, and then proposed a ponder-replicator algorithm to find certain consistent maximal reward equilibrium for the group. The simulation verified the efficiency of the proposed algorithm.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125937236","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}
Tian-Junfeng, Jiao-Hongqiang, Lijiang Ning, Liu Tao
{"title":"Double Secret Keys and Double Random Numbers Authentication Scheme","authors":"Tian-Junfeng, Jiao-Hongqiang, Lijiang Ning, Liu Tao","doi":"10.1109/CIS.WORKSHOPS.2007.73","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.73","url":null,"abstract":"This paper presents the mutual authentication scheme based on bilinear pairings with the deployment of smart card. We propose a novel technique of using double secret keys and double random numbers for preventing forgery attack in authentication process. It enhances the security of the authentication system and accomplishes the mutual authentication safely between user and remote system. Finally, we provide the validity attestation of the scheme and the analysis of its security and compute complexity.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129392945","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":"Fuzzy Partition Based Curvelets and Wavelets Denoise Algorithm","authors":"Naizhang Feng, Liyong Ma, Yi Shen","doi":"10.1109/CIS.WORKSHOPS.2007.10","DOIUrl":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.10","url":null,"abstract":"Curvelets denoise approach has been proposed to obtain high quality result images recently. But artifacts often appear in the result images after applying curvelets denoise approach. A fuzzy partition based denoise algorithm was proposed to suppress the artifacts employing result images of curvelets and hidden Markov tree based wavelets denoise approaches. After fuzzy partition was applied to the image support, the local properties of the fuzzy windows were estimated. Image fusion was applied to the curvelets and wavelets result images where the weights were decided by the local properties. Experimental results demonstrated that the algorithm improved the visual quality of result images efficiently and suppressed the artifacts in result images evidently.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129575911","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}