2013 Ninth International Conference on Computational Intelligence and Security最新文献_第3页

A Decision Making Model Based on Fuzzy Relation Equations Constraints and Its Algorithm 基于模糊关系方程约束的决策模型及其算法

2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.77

Jinquan Li, Yongchuan Wen

引用次数: 1

Differential Evolution Based Parameters Selection for Support Vector Machine 基于差分进化的支持向量机参数选择

2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.67

Li Jun, Ding Lixin, Xing Ying

引用次数: 6

A Key Management Scheme between Body Sensor Networks and the Base Station 一种人体传感器网络与基站之间的密钥管理方案

2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.162

Huawei Zhao, M. Shu, Jing Qin, Jiankun Hu

引用次数: 1

2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.23

Yuqiang Chen, Xuanzi Hu, G. Ye

引用次数: 2

A Greedy Search Algorithm for Resolving the Lowermost C Threshold in SVM Classification 一种求解SVM分类中最小C阈值的贪心搜索算法

2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.47

Huichuan Duan, Naiwen Liu

{"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}

引用次数: 4

Efficient Genetic Algorithm for High-Dimensional Function Optimization 高维函数优化的高效遗传算法

2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.60

Qifeng Lin, W. Liu, Hongxin Peng, Yuxing Chen

引用次数: 3

Enhancing Trust Evaluation Using Intrusion Sensitivity in Collaborative Intrusion Detection Networks: Feasibility and Challenges 协同入侵检测网络中利用入侵敏感性增强信任评估:可行性与挑战

2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.115

Wenjuan Li, Yuxin Meng, Lam-for Kwok

{"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}

引用次数: 52

Research and Realization of Coordinate Conversion in Radar Video Display 雷达视频显示中坐标转换的研究与实现

2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.65

Liu Baiping, Liu Dan

引用次数: 5

A Fusion Algorithm Based on Position Difference Filtering and Least Squares Estimate for Dynamic Scene Matching 基于位置差分滤波和最小二乘估计的动态场景匹配融合算法

2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.88

Zhaohui Xia, Jianyong Wang, Xiaogang Yang

引用次数: 0

Analysis of Success Rate of Attacking Knapsacks from JUNA Cryptosystem by LLL Lattice Basis Reduction 基于LLL格基约简的JUNA密码系统背包攻击成功率分析

2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.102

Tong Li, Shenghui Su

{"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}

引用次数: 8