In this paper, a new decision making model based on fuzzy relation equations is presented. Some properties of this model are obtained. Based on these properties, we show that the decision making problem can be solved in polynomial time. An optimal polynomial time algorithm is proposed for this kind of optimization problem. Numerical examples are provided to illustrate our algorithms.
{"title":"A Decision Making Model Based on Fuzzy Relation Equations Constraints and Its Algorithm","authors":"Jinquan Li, Yongchuan Wen","doi":"10.1109/CIS.2013.77","DOIUrl":"https://doi.org/10.1109/CIS.2013.77","url":null,"abstract":"In this paper, a new decision making model based on fuzzy relation equations is presented. Some properties of this model are obtained. Based on these properties, we show that the decision making problem can be solved in polynomial time. An optimal polynomial time algorithm is proposed for this kind of optimization problem. Numerical examples are provided to illustrate our algorithms.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133306083","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}
This paper addresses the problem of SVM parameter optimization. The authors propose an SVM classification system based on differential evolution(DE) to improve the generalization performance of the SVM classifier. For this purpose, the authors have optimized the SVM classifier design by searching for the best value of the parameters that tune its discriminant function. The experiments are conducted on the basis of benchmark dataset. The obtained results clearly confirm the superiority of the DE-SVM approach compared to default parameters SVM classifier and suggest that further substantial improvements in terms of classification accuracy can be achieved by the proposed DE-SVM classification system.
{"title":"Differential Evolution Based Parameters Selection for Support Vector Machine","authors":"Li Jun, Ding Lixin, Xing Ying","doi":"10.1109/CIS.2013.67","DOIUrl":"https://doi.org/10.1109/CIS.2013.67","url":null,"abstract":"This paper addresses the problem of SVM parameter optimization. The authors propose an SVM classification system based on differential evolution(DE) to improve the generalization performance of the SVM classifier. For this purpose, the authors have optimized the SVM classifier design by searching for the best value of the parameters that tune its discriminant function. The experiments are conducted on the basis of benchmark dataset. The obtained results clearly confirm the superiority of the DE-SVM approach compared to default parameters SVM classifier and suggest that further substantial improvements in terms of classification accuracy can be achieved by the proposed DE-SVM classification system.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115197867","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 general application scenarios, physiological signals collected by body sensor networks will be delivered to a base station in the medical center for further processing. In this process, the communication between body sensor networks and the base station should be protected for individual's privacy. However, many existing related researches ignored the security requirement in the communication, or merely mentioned that traditional secure mechanisms schemes can be used to secure the communication. In the paper, we applied the Tree Parity Machine model and biometric data extracted from physiological signals to construct a new key management scheme for securing the communication. Analyses show that the new key management scheme has superiority in terms of efficiency and security.
{"title":"A Key Management Scheme between Body Sensor Networks and the Base Station","authors":"Huawei Zhao, M. Shu, Jing Qin, Jiankun Hu","doi":"10.1109/CIS.2013.162","DOIUrl":"https://doi.org/10.1109/CIS.2013.162","url":null,"abstract":"In general application scenarios, physiological signals collected by body sensor networks will be delivered to a base station in the medical center for further processing. In this process, the communication between body sensor networks and the base station should be protected for individual's privacy. However, many existing related researches ignored the security requirement in the communication, or merely mentioned that traditional secure mechanisms schemes can be used to secure the communication. In the paper, we applied the Tree Parity Machine model and biometric data extracted from physiological signals to construct a new key management scheme for securing the communication. Analyses show that the new key management scheme has superiority in terms of efficiency and security.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114860938","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}
Related Vehicle Routing Problem is another form of Vehicle Routing Problem. RVRP also belongs to NP-Hard, The research based on single distribution center RVRP with road capacity dynamic constraint. Road capacity factor shows as a road condition coefficient, then added it into the objective function. To build a model of single distribution center and single vehicle type RVRP with soft time windows and dynamic constraint. The simulated result shows that the self-adapting chaos genetic algorithm is flexible and feasible to solve this kind of model.
{"title":"Research on Related Vehicle Routing Problem for Single Distribution Centre Based on Dynamic Constraint","authors":"Yuqiang Chen, Xuanzi Hu, G. Ye","doi":"10.1109/CIS.2013.23","DOIUrl":"https://doi.org/10.1109/CIS.2013.23","url":null,"abstract":"Related Vehicle Routing Problem is another form of Vehicle Routing Problem. RVRP also belongs to NP-Hard, The research based on single distribution center RVRP with road capacity dynamic constraint. Road capacity factor shows as a road condition coefficient, then added it into the objective function. To build a model of single distribution center and single vehicle type RVRP with soft time windows and dynamic constraint. The simulated result shows that the self-adapting chaos genetic algorithm is flexible and feasible to solve this kind of model.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115277676","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, the authors present a greedy search algorithm that solves the SVM classification (SVC) problem at the lowermost C end. By combining the SVC asymptotic behavior with empirical results, it can be sure that at sufficiently small cost, a threshold C0, all the minority samples becomes support vectors each with Lagrange multiplier C0, and equal number of majority samples will become support vectors whose Lagrange multipliers are also C0. With this evidence, SVC is transformed into a C-independent combinatorial optimization problem. Taking all the minority inputs as initial support vectors, a greedy algorithm is devised to choose majority class support vectors one by one each with minimal increase to the objective function in its turn. The greedy nature of the algorithm enables finding out the majority support vectors that near or at the majority margin. By taking the found majority support vectors initially and applying the algorithm to the minority class conversely, the support vectors that near the decision boundary are also resolved. Applying linear least squares fitting to both the majority margin and decision boundary, C0 is obtained as a function of kernel parameters. Experimental results show that the proposed algorithm can find C0 almost perfectly.
{"title":"A Greedy Search Algorithm for Resolving the Lowermost C Threshold in SVM Classification","authors":"Huichuan Duan, Naiwen Liu","doi":"10.1109/CIS.2013.47","DOIUrl":"https://doi.org/10.1109/CIS.2013.47","url":null,"abstract":"In this paper, the authors present a greedy search algorithm that solves the SVM classification (SVC) problem at the lowermost C end. By combining the SVC asymptotic behavior with empirical results, it can be sure that at sufficiently small cost, a threshold C0, all the minority samples becomes support vectors each with Lagrange multiplier C0, and equal number of majority samples will become support vectors whose Lagrange multipliers are also C0. With this evidence, SVC is transformed into a C-independent combinatorial optimization problem. Taking all the minority inputs as initial support vectors, a greedy algorithm is devised to choose majority class support vectors one by one each with minimal increase to the objective function in its turn. The greedy nature of the algorithm enables finding out the majority support vectors that near or at the majority margin. By taking the found majority support vectors initially and applying the algorithm to the minority class conversely, the support vectors that near the decision boundary are also resolved. Applying linear least squares fitting to both the majority margin and decision boundary, C0 is obtained as a function of kernel parameters. Experimental results show that the proposed algorithm can find C0 almost perfectly.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128435134","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}
An Efficient Genetic Algorithm(EGA) proposed in this paper was aiming to high-dimensional function optimization. To generate multiple diverse solutions and to strengthen local search ability, the new subspace crossover and timely mutation operators improved by us will be used in EGA. The combination of the new operators allow the integration of randomization and elite solutions analysis to achieve a balance of stability and diversification to further improve the quality of solutions in the case of high-dimensional functions. Standard GA and PRPDPGA proposed already were compared in simulation. Computational studies of benchmark by testing optimization functions suggest that the proposed algorithm was able to quickly achieve good solutions while avoiding being trapped in premature convergence.
{"title":"Efficient Genetic Algorithm for High-Dimensional Function Optimization","authors":"Qifeng Lin, W. Liu, Hongxin Peng, Yuxing Chen","doi":"10.1109/CIS.2013.60","DOIUrl":"https://doi.org/10.1109/CIS.2013.60","url":null,"abstract":"An Efficient Genetic Algorithm(EGA) proposed in this paper was aiming to high-dimensional function optimization. To generate multiple diverse solutions and to strengthen local search ability, the new subspace crossover and timely mutation operators improved by us will be used in EGA. The combination of the new operators allow the integration of randomization and elite solutions analysis to achieve a balance of stability and diversification to further improve the quality of solutions in the case of high-dimensional functions. Standard GA and PRPDPGA proposed already were compared in simulation. Computational studies of benchmark by testing optimization functions suggest that the proposed algorithm was able to quickly achieve good solutions while avoiding being trapped in premature convergence.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130869205","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}
Intrusion detection systems (IDSs) have been widely deployed in computers and networks to identify a variety of attacks. But network intrusions are now becoming more and more sophisticated to detect, thus, collaborative intrusion detection networks (CIDNs) have been proposed which enables an IDS to collect information and learn experience from other IDS nodes. By maintaining interactions among a set of IDS nodes, a CIDN is expected to be more powerful in detecting some complicated attacks such as denial-of-service (DoS) than a single IDS. In real deployment, we identify that each IDS may have different levels of sensitivity in detecting different types of intrusions (i.e., based on their own signatures and settings). In this paper, we therefore define a notion of intrusion sensitivity and investigate the feasibility of using it to evaluate the trustworthiness of an IDS node. In addition, we describe several challenges when using this notion in practice. In the evaluation, the experimental results indicate that the use of intrusion sensitivity is feasible and encouraging to enhance the accuracy of detecting malicious nodes.
{"title":"Enhancing Trust Evaluation Using Intrusion Sensitivity in Collaborative Intrusion Detection Networks: Feasibility and Challenges","authors":"Wenjuan Li, Yuxin Meng, Lam-for Kwok","doi":"10.1109/CIS.2013.115","DOIUrl":"https://doi.org/10.1109/CIS.2013.115","url":null,"abstract":"Intrusion detection systems (IDSs) have been widely deployed in computers and networks to identify a variety of attacks. But network intrusions are now becoming more and more sophisticated to detect, thus, collaborative intrusion detection networks (CIDNs) have been proposed which enables an IDS to collect information and learn experience from other IDS nodes. By maintaining interactions among a set of IDS nodes, a CIDN is expected to be more powerful in detecting some complicated attacks such as denial-of-service (DoS) than a single IDS. In real deployment, we identify that each IDS may have different levels of sensitivity in detecting different types of intrusions (i.e., based on their own signatures and settings). In this paper, we therefore define a notion of intrusion sensitivity and investigate the feasibility of using it to evaluate the trustworthiness of an IDS node. In addition, we describe several challenges when using this notion in practice. In the evaluation, the experimental results indicate that the use of intrusion sensitivity is feasible and encouraging to enhance the accuracy of detecting malicious nodes.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121618925","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}
Polar coordinates-orthogonal coordinates conversion needs to be solved in radar PPI signal displaying. Traditional coordinate conversion needs a large deal of calculation and high standard of computer main frequency and memory, and can not meet requirement of real-time processing of system. In this paper we propose a new look-up table increment method, to create a two-dimensional array whose indexes are azimuth and distance in polar coordinates and whose content is composed of corresponding rectangular coordinate points, which has not only high-speed calculation but also high display accuracy.
{"title":"Research and Realization of Coordinate Conversion in Radar Video Display","authors":"Liu Baiping, Liu Dan","doi":"10.1109/CIS.2013.65","DOIUrl":"https://doi.org/10.1109/CIS.2013.65","url":null,"abstract":"Polar coordinates-orthogonal coordinates conversion needs to be solved in radar PPI signal displaying. Traditional coordinate conversion needs a large deal of calculation and high standard of computer main frequency and memory, and can not meet requirement of real-time processing of system. In this paper we propose a new look-up table increment method, to create a two-dimensional array whose indexes are azimuth and distance in polar coordinates and whose content is composed of corresponding rectangular coordinate points, which has not only high-speed calculation but also high display accuracy.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122437618","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}
For scene matching navigation system, a new fusion algorithm based on Position Difference Filtering (PDF) and Least Squares Estimate (LSE) for dynamic scene matching is proposed to enhance the reliability and matching precision. After the matching results fusion problems for aircraft dynamic scene matching navigation system being analyzed, PDF method is presented to filter the mismatching points and LSE method is adopted to optimum parameter estimation according to the error characteristic of matching position point sequence, then the mismatching points are estimated and the matching position are predicted. It can be seen from the simulation experimental results that the proposed algorithm is feasible and available to eliminate random matching disturbance and the mismatching points for dynamic scene matching navigation system.
{"title":"A Fusion Algorithm Based on Position Difference Filtering and Least Squares Estimate for Dynamic Scene Matching","authors":"Zhaohui Xia, Jianyong Wang, Xiaogang Yang","doi":"10.1109/CIS.2013.88","DOIUrl":"https://doi.org/10.1109/CIS.2013.88","url":null,"abstract":"For scene matching navigation system, a new fusion algorithm based on Position Difference Filtering (PDF) and Least Squares Estimate (LSE) for dynamic scene matching is proposed to enhance the reliability and matching precision. After the matching results fusion problems for aircraft dynamic scene matching navigation system being analyzed, PDF method is presented to filter the mismatching points and LSE method is adopted to optimum parameter estimation according to the error characteristic of matching position point sequence, then the mismatching points are estimated and the matching position are predicted. It can be seen from the simulation experimental results that the proposed algorithm is feasible and available to eliminate random matching disturbance and the mismatching points for dynamic scene matching navigation system.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126094698","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}
The JUNA cryptosystem is a new kind of multivariable public-key cryptosystem, which is evolved from REESSE1+. The security of a JUNA or REESSE1+ plaintext is based on the anomalous subset product problem (ASPP). An ASPP can be transformed to a special subset sum problem (SSP), and such a SSP is an anomalous subset sum problem (ASSP). An ASSP from REESSE1+ is of low-density, and one from JUNA is of high-density. The LLL lattice basis reduction algorithm can solve low-density SSPs in polynomial time, and also it probably solves low-density ASSPs. However, the density of a knapsack deriving from a high-density ASSP can be larger than 1, and LLL lattice reduction could hardly break such a knapsack. In this paper, on the basis of our previous work, we design and conduct experiments of attacking ASSP knapsacks by LLL lattice basis reduction, and then analyze the experimental data. Our experiments show that the success rate varies with the density and length of a knapsack, and it is almost 0 when the density is larger than 1. Hence we can conclude that the JUNA cryptosystem can resist LLL lattice basis reduction. Our experimental data in the paper provides the factual basis for our further research on the security of JUNA.
{"title":"Analysis of Success Rate of Attacking Knapsacks from JUNA Cryptosystem by LLL Lattice Basis Reduction","authors":"Tong Li, Shenghui Su","doi":"10.1109/CIS.2013.102","DOIUrl":"https://doi.org/10.1109/CIS.2013.102","url":null,"abstract":"The JUNA cryptosystem is a new kind of multivariable public-key cryptosystem, which is evolved from REESSE1+. The security of a JUNA or REESSE1+ plaintext is based on the anomalous subset product problem (ASPP). An ASPP can be transformed to a special subset sum problem (SSP), and such a SSP is an anomalous subset sum problem (ASSP). An ASSP from REESSE1+ is of low-density, and one from JUNA is of high-density. The LLL lattice basis reduction algorithm can solve low-density SSPs in polynomial time, and also it probably solves low-density ASSPs. However, the density of a knapsack deriving from a high-density ASSP can be larger than 1, and LLL lattice reduction could hardly break such a knapsack. In this paper, on the basis of our previous work, we design and conduct experiments of attacking ASSP knapsacks by LLL lattice basis reduction, and then analyze the experimental data. Our experiments show that the success rate varies with the density and length of a knapsack, and it is almost 0 when the density is larger than 1. Hence we can conclude that the JUNA cryptosystem can resist LLL lattice basis reduction. Our experimental data in the paper provides the factual basis for our further research on the security of JUNA.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127828399","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
扫码关注我们
求助内容：
应助结果提醒方式：