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}
Shuigui Huang, Wenwen Han, Xirong Que, Wendong Wang
The orientation of sentiment words plays an important role in the sentiment analysis, but existing methods have difficulty in classifying the orientation of Chinese words, especially for the newly emerged words in Internet. Most approaches are mining the association between sentiment words and seed words using the big corpora and manually labeled seed words with definite orientation. But less work has ever focused on the efficient seed words selection. As we observed, emoticons, which are widely used on social network because of the simplicity and visualization, are good indicators for sentiment orientation. Thus this paper proposes the sentiment word model based on emoticons, which built orientation model of sentiment words with the orientation of emoticons, and train the model with the SVM classifier. Meanwhile, this work proposes a high efficient way to automatically classify the orientation of emoticons. Experiments show the precision rate of emoticon classification could reach 93.6%, and that of sentiment words classification could be 81.5%.
{"title":"Polarity Identification of Sentiment Words Based on Emoticons","authors":"Shuigui Huang, Wenwen Han, Xirong Que, Wendong Wang","doi":"10.1109/CIS.2013.35","DOIUrl":"https://doi.org/10.1109/CIS.2013.35","url":null,"abstract":"The orientation of sentiment words plays an important role in the sentiment analysis, but existing methods have difficulty in classifying the orientation of Chinese words, especially for the newly emerged words in Internet. Most approaches are mining the association between sentiment words and seed words using the big corpora and manually labeled seed words with definite orientation. But less work has ever focused on the efficient seed words selection. As we observed, emoticons, which are widely used on social network because of the simplicity and visualization, are good indicators for sentiment orientation. Thus this paper proposes the sentiment word model based on emoticons, which built orientation model of sentiment words with the orientation of emoticons, and train the model with the SVM classifier. Meanwhile, this work proposes a high efficient way to automatically classify the orientation of emoticons. Experiments show the precision rate of emoticon classification could reach 93.6%, and that of sentiment words classification could be 81.5%.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"30 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":"128156012","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}
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}
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}
In order to emphasize features in flow textures while preserving the orientation of flows in 2D fields, a new method to generate flow textures with non-uniform streamlets is proposed in this paper. In the method, a control grid is built and divided into different regions that reflect the complexity of the underlying flow field. The resulting regions are then used to control to the distribution of droplets and the corresponding calculation of streamlets involved in OLIC. By this means, streamlets are dense around salient flow features, while in other areas they are sparse. The disparity of streamlets highlights features in flow fields. Test results show that our method can achieve pleasing visual effect. It is flexible and superior to the original OLIC.
{"title":"Feature Emphasized OLIC for 2D Flow Visualization","authors":"Beichen Liu, Wenyao Zhang, Y. Wang, Yuezhu Pei","doi":"10.1109/CIS.2013.139","DOIUrl":"https://doi.org/10.1109/CIS.2013.139","url":null,"abstract":"In order to emphasize features in flow textures while preserving the orientation of flows in 2D fields, a new method to generate flow textures with non-uniform streamlets is proposed in this paper. In the method, a control grid is built and divided into different regions that reflect the complexity of the underlying flow field. The resulting regions are then used to control to the distribution of droplets and the corresponding calculation of streamlets involved in OLIC. By this means, streamlets are dense around salient flow features, while in other areas they are sparse. The disparity of streamlets highlights features in flow fields. Test results show that our method can achieve pleasing visual effect. It is flexible and superior to the original OLIC.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"77 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":"127535085","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}
A differential-algebraic equations (DAEs) model for solving convex quadratic programming (CQP) is studied in this paper. By using Frisch's logarithmic barrier function, the DAEs model is established and the corresponding relationships of the solutions to the proposed DAEs with the CQP problems is analyzed in details here. All the results shows that this new model is different from traditional optimization algorithms which tries to find optimal solutions by the classical discrete iterated sequence points as well as different from neural network method based on the ODEs which tries to find the optimal solutions by tracking trajectories of a set of ordinary differential equation systems. It is well-known that different numerical schemes to DAEs algorithm can lead to new algorithms or some classical iterated algorithms, for instance, the path-following interior point algorithm could be conducted by a scheme of the proposed DAEs algorithm. So, in this aspect, the conventional interior point method can be viewed as a special case of the new DAEs method. Hence, this DAEs model provides a promising alternative approach for solving convex quadratic programming problems.
{"title":"Differential-Algebraic Equations Model for Quadratic Programming","authors":"Ya-juan Yang, Quan-ju Zhang","doi":"10.1109/CIS.2013.41","DOIUrl":"https://doi.org/10.1109/CIS.2013.41","url":null,"abstract":"A differential-algebraic equations (DAEs) model for solving convex quadratic programming (CQP) is studied in this paper. By using Frisch's logarithmic barrier function, the DAEs model is established and the corresponding relationships of the solutions to the proposed DAEs with the CQP problems is analyzed in details here. All the results shows that this new model is different from traditional optimization algorithms which tries to find optimal solutions by the classical discrete iterated sequence points as well as different from neural network method based on the ODEs which tries to find the optimal solutions by tracking trajectories of a set of ordinary differential equation systems. It is well-known that different numerical schemes to DAEs algorithm can lead to new algorithms or some classical iterated algorithms, for instance, the path-following interior point algorithm could be conducted by a scheme of the proposed DAEs algorithm. So, in this aspect, the conventional interior point method can be viewed as a special case of the new DAEs method. Hence, this DAEs model provides a promising alternative approach for solving convex quadratic programming problems.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"60 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":"122369684","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}
With development of SOA, the complex problem can be solved by combining available individual services and ordering them to best suit user's requirements. Web services composition is widely used to business environment. With the features of inherent autonomy and heterogeneity for component Web services it is difficult to predict the behaviors of the overall composite service. Therefore, transactional properties and non-functional quality of service (QoS) properties are crucial for selecting the web services to take part in the composition. Transactional properties ensure reliability of composite Web service, and QoS properties can identify the best candidate web services from a set of functionally-equivalent services. In this paper we define a Colored Petri Net (CPN) model which involves transactional properties of Web services in the composition process. To ensure reliable and correct execution, unfolding processes of the CPN are followed. The execution of transactional composition Web service (TCWS) is formalized by CPN properties.
{"title":"A Petri Net Approach to Reliable Execution for Web Service Composition","authors":"Liping Chen, Guojun Zhang","doi":"10.1109/CIS.2013.29","DOIUrl":"https://doi.org/10.1109/CIS.2013.29","url":null,"abstract":"With development of SOA, the complex problem can be solved by combining available individual services and ordering them to best suit user's requirements. Web services composition is widely used to business environment. With the features of inherent autonomy and heterogeneity for component Web services it is difficult to predict the behaviors of the overall composite service. Therefore, transactional properties and non-functional quality of service (QoS) properties are crucial for selecting the web services to take part in the composition. Transactional properties ensure reliability of composite Web service, and QoS properties can identify the best candidate web services from a set of functionally-equivalent services. In this paper we define a Colored Petri Net (CPN) model which involves transactional properties of Web services in the composition process. To ensure reliable and correct execution, unfolding processes of the CPN are followed. The execution of transactional composition Web service (TCWS) is formalized by CPN properties.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"91 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":"122899488","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}
Lizhuo Liu, Lili Xie, Chenglong Hao, Xinhua Zheng, Bing Sun
A dynamic friction model which can be used in the aircraft anti-skid braking system is introduced. On one hand, this model has similiar steady-state characteristics compared with the static friction model, on the other hand, it captures transient characteristics of the tire and the runway in emergency braking control. Dynamics and characteristics of the tire and the runway are analyzed, the PID+PBM control law is designed in the aircraft braking system. Simulation results show that this dynamic model is feasible and effective, and the proposed model is accurate for description of the tire and the runway. It is a theoretical basis for the study and design of high performance aircraft anti-skid braking system.
{"title":"Analyzing of Dynamic Friction Model for the Tire and the Runway","authors":"Lizhuo Liu, Lili Xie, Chenglong Hao, Xinhua Zheng, Bing Sun","doi":"10.1109/CIS.2013.173","DOIUrl":"https://doi.org/10.1109/CIS.2013.173","url":null,"abstract":"A dynamic friction model which can be used in the aircraft anti-skid braking system is introduced. On one hand, this model has similiar steady-state characteristics compared with the static friction model, on the other hand, it captures transient characteristics of the tire and the runway in emergency braking control. Dynamics and characteristics of the tire and the runway are analyzed, the PID+PBM control law is designed in the aircraft braking system. Simulation results show that this dynamic model is feasible and effective, and the proposed model is accurate for description of the tire and the runway. It is a theoretical basis for the study and design of high performance aircraft anti-skid braking system.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"27 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":"128488868","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
扫码关注我们
求助内容：
应助结果提醒方式：