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}
In this paper, we will present a block cipher circuit design against Power Analysis. This design consists of usual masking and hiding method. For XOR, permutation and other linear layer, masking method of protection is used, but for S-box and other non-linear layer, hiding method is used in the reason that masking requires a lot of hardware consumption. We accomplished hardware implementation and Power Analysis in our research, whose test results proved that the design had strong capacity against Power Analysis. 200, 000 curves were extracted in our attack simulation, and the key successfully resisted complete recovery.
{"title":"A Block Cipher Circuit Design against Power Analysis","authors":"Yuxiao Ling, Zheng Guo, Zhimin Zhang, Zhigang Mao, Zeleng Zhuang","doi":"10.1109/CIS.2013.101","DOIUrl":"https://doi.org/10.1109/CIS.2013.101","url":null,"abstract":"In this paper, we will present a block cipher circuit design against Power Analysis. This design consists of usual masking and hiding method. For XOR, permutation and other linear layer, masking method of protection is used, but for S-box and other non-linear layer, hiding method is used in the reason that masking requires a lot of hardware consumption. We accomplished hardware implementation and Power Analysis in our research, whose test results proved that the design had strong capacity against Power Analysis. 200, 000 curves were extracted in our attack simulation, and the key successfully resisted complete recovery.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"5 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":"134324754","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 uses statistical method to analyzing a budget to managing public financial resources, including revenue change, non tax resources, General Operating Fund Revenues, etc.
本文运用统计方法分析了预算对公共财政资源管理的影响，包括收入变化、非税资源、一般营运基金收入等。
{"title":"Managing Public Financial Resources in a Changing World: Analyzing a Budget","authors":"Ziqi Zhu","doi":"10.1109/CIS.2013.180","DOIUrl":"https://doi.org/10.1109/CIS.2013.180","url":null,"abstract":"This paper uses statistical method to analyzing a budget to managing public financial resources, including revenue change, non tax resources, General Operating Fund Revenues, etc.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"36 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":"131341285","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}
Considering the challenges in guaranteeing the reliability of a formal model which is established in according with system requirements specification written in natural language with ambiguities, a novel strategy is proposed to improve the correctness of formal model by separating requirement functions and data structures. Specifically, hybrid automata which can analyze system process symbolically are created to characterize system behaviors before formalization. Secondly, UML models are created to improve the accuracy of system structure. Lastly, an object-oriented formal model is established based on the hybrid automata and UML models.
{"title":"A Strategy to Improve the Reliability of Object-Oriented Formal Models","authors":"Guo Xie, F. Qian, Xinhong Hei","doi":"10.1109/CIS.2013.150","DOIUrl":"https://doi.org/10.1109/CIS.2013.150","url":null,"abstract":"Considering the challenges in guaranteeing the reliability of a formal model which is established in according with system requirements specification written in natural language with ambiguities, a novel strategy is proposed to improve the correctness of formal model by separating requirement functions and data structures. Specifically, hybrid automata which can analyze system process symbolically are created to characterize system behaviors before formalization. Secondly, UML models are created to improve the accuracy of system structure. Lastly, an object-oriented formal model is established based on the hybrid automata and UML models.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"39 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":"133825428","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}
At present there is a wide range of evolutionary algorithms available to researchers and practitioners. Despite the great diversity of these algorithms, virtually all of the algorithms share one feature: they have been manually designed. Can evolutionary algorithms be designed automatically by computer? In this paper, a novel evolutionary algorithm based on automatically designing of genetic operators is presented to address this problem. The resulting algorithm not only explores solutions in the problem space, but also automatically generates genetic operators in the operator space for each generation. In order to verify the performance of the proposed algorithm, comprehensive experiments on 23 well-known benchmark optimization problems are conducted, and the results show that the proposed algorithm can outperform standard Differential Evolution (DE) algorithm.
{"title":"Evolutionary Algorithm Based on Automatically Designing of Genetic Operators","authors":"Dazhi Jiang, Chenfeng Peng, Zhun Fan","doi":"10.1109/CIS.2013.21","DOIUrl":"https://doi.org/10.1109/CIS.2013.21","url":null,"abstract":"At present there is a wide range of evolutionary algorithms available to researchers and practitioners. Despite the great diversity of these algorithms, virtually all of the algorithms share one feature: they have been manually designed. Can evolutionary algorithms be designed automatically by computer? In this paper, a novel evolutionary algorithm based on automatically designing of genetic operators is presented to address this problem. The resulting algorithm not only explores solutions in the problem space, but also automatically generates genetic operators in the operator space for each generation. In order to verify the performance of the proposed algorithm, comprehensive experiments on 23 well-known benchmark optimization problems are conducted, and the results show that the proposed algorithm can outperform standard Differential Evolution (DE) algorithm.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"9 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":"132573801","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 security of the RSA cryptosystem is based on the difficulty of integer factorization. The General Number Field Sieve (GNFS) is one of the state-of-the-art algorithms to solve this problem over 110 digits. The Montgomery Block Lanczos algorithm is often used for solving a large and sparse linear system over GF (2) in the GNFS. AS Graphics Processing Units (GPUs) can provide a significant increase in floating point operations and memory bandwidth over conventional Central Processing Units (CPUs), performing sparse matrix-vector multiplications with these co-processors can decrease the amount of time. In this paper, we will first improve the initialization way of the algorithm to avoid sudden breakdown in the very first stage. Because a very high possibility of failure caused by the random initialization way, we will design a pseudo random way to initialize the algorithm to generate more solutions than traditional Block Lanczos algorithm does. Based on massive research about present sparse matrix storage formats, we will parallelize the improved Block Lanczos algorithm using a newly designed hybrid sparse matrix format on GPUs. Finally, we analyze the cost of our algorithm theoretically. From the results, a speedup can be achieved on GPUs according to related experiments.
{"title":"An Improved Block Lanczos Algorithm to Solve Large and Sparse Matrixes on GPUs","authors":"Wenjuan Ying","doi":"10.1109/CIS.2013.104","DOIUrl":"https://doi.org/10.1109/CIS.2013.104","url":null,"abstract":"The security of the RSA cryptosystem is based on the difficulty of integer factorization. The General Number Field Sieve (GNFS) is one of the state-of-the-art algorithms to solve this problem over 110 digits. The Montgomery Block Lanczos algorithm is often used for solving a large and sparse linear system over GF (2) in the GNFS. AS Graphics Processing Units (GPUs) can provide a significant increase in floating point operations and memory bandwidth over conventional Central Processing Units (CPUs), performing sparse matrix-vector multiplications with these co-processors can decrease the amount of time. In this paper, we will first improve the initialization way of the algorithm to avoid sudden breakdown in the very first stage. Because a very high possibility of failure caused by the random initialization way, we will design a pseudo random way to initialize the algorithm to generate more solutions than traditional Block Lanczos algorithm does. Based on massive research about present sparse matrix storage formats, we will parallelize the improved Block Lanczos algorithm using a newly designed hybrid sparse matrix format on GPUs. Finally, we analyze the cost of our algorithm theoretically. From the results, a speedup can be achieved on GPUs according to related experiments.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"63 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":"133602936","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：