发布求助
文献互助 智能选刊 最新文献

2013 Ninth International Conference on Computational Intelligence and Security最新文献

筛选
英文 中文
The Cutting Circle Method and Romberg Algorithm 切圆法和Romberg算法
2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.84
Feng Tianxiang
{"title":"The Cutting Circle Method and Romberg Algorithm","authors":"Feng Tianxiang","doi":"10.1109/CIS.2013.84","DOIUrl":"https://doi.org/10.1109/CIS.2013.84","url":null,"abstract":"Using the cutting circle method to calculate the value of π was firstly proposed by the Chinese mathematician Liu Hui in Three Kingdoms Era, around the third century AD. Two hundred years later, the Northern and Southern mathematician Zu got a comparative accurate approximation of π by using this method. This paper analyzed Liu Hui's cutting circle method and pointed out that it is essentially a combination of the cutting circle method and an acceleration technology. And this method can deal with several rough initial data to achieve a good acceleration effect after appropriately adjust the combination coefficients. Finally, the Romberg algorithm is used to combine with Liu Hui's cutting circle method to calculate the value of π, and find that only four initial data can be calculated to obtain a relatively accurate approximation of π.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"11 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":"122083656","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}
引用次数: 0
NISLVMP: Improved Virtual Machine-Based Software Protection NISLVMP:改进的基于虚拟机的软件保护
2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.107
Huaijun Wang, Dingyi Fang, Guanghui Li, Xiaoyan Yin, Bo Zhang, Y. Gu
{"title":"NISLVMP: Improved Virtual Machine-Based Software Protection","authors":"Huaijun Wang, Dingyi Fang, Guanghui Li, Xiaoyan Yin, Bo Zhang, Y. Gu","doi":"10.1109/CIS.2013.107","DOIUrl":"https://doi.org/10.1109/CIS.2013.107","url":null,"abstract":"The VM (Virtual Machine)-based software protection technique provides an effective solution to protect software, making it extremely difficult to analyze and crack. This technique has become the research focus of software protection. In this paper, we introduce the general design ideas of this technique. However, there exist some vulnerabilities in the design. We introduce these vulnerabilities in detail and come up with some improvements to mitigate them. We design and develop a VM-based protection system, named NISLVMP, and carry out some experiments with it. The results show that the improvements are effective.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"826 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":"117177992","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}
引用次数: 12
A New Evolutionary Algorithm for Portfolio Optimization and Its Application 一种新的投资组合优化进化算法及其应用
2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.24
Weijia Wang, Jie Hu
{"title":"A New Evolutionary Algorithm for Portfolio Optimization and Its Application","authors":"Weijia Wang, Jie Hu","doi":"10.1109/CIS.2013.24","DOIUrl":"https://doi.org/10.1109/CIS.2013.24","url":null,"abstract":"Value-at-Risk (VaR) and Conditional Value-at-Risk (CVaR) are two of the most widely used and important risk measures in financial risk management models. Because VaR and CVaR portfolio optimization models are often nonlinear and non-convex optimization models, traditional optimization methods usually can not get their global optimal solutions, instead, they often get a local optimal solution. In this paper, the uniform design is integrated into evolutionary algorithm to enhance the search ability of the evolutionary algorithm. The resulted algorithm will has a strong search ability and has more possibility to get the global optimal solution. Based on this idea, a new evolutionary algorithm is proposed for VaR and CVaR optimization models. Computer simulations on ten randomly chosen stocks from Shenzhen Stock Exchange in China are conducted and the analysis to the results is given. The experiment results indicate the proposed algorithm is efficient.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"17 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":"121551523","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}
引用次数: 2
Analysis and Improvement of an Efficient and Secure Key Agreement Protocol 一种高效安全的密钥协商协议的分析与改进
2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.117
Jiyun Yang, Rui Zhang, D. Xiao
{"title":"Analysis and Improvement of an Efficient and Secure Key Agreement Protocol","authors":"Jiyun Yang, Rui Zhang, D. Xiao","doi":"10.1109/CIS.2013.117","DOIUrl":"https://doi.org/10.1109/CIS.2013.117","url":null,"abstract":"Improperly chosen parameters will lead to short period distribution of sequences generated by Chebyshev maps over finite fields ZN. However, in a key agreement protocol proposed by Yoon, et al. there is no consideration given to the avoidance of short period distribution. Based on the theory of period distribution the protocol is broken with other information gained from the key establishment process. In this paper, the protocol of Yoon, et al. is broken and improved by getting rid of unnecessary information and encrypting sensitive information, which makes the protocol more secure.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"61 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":"127636334","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}
引用次数: 2
The Research of Stock Predictive Model Based on the Combination of CART and DBSCAN 基于CART与DBSCAN相结合的股票预测模型研究
2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.40
Yibu Ma
{"title":"The Research of Stock Predictive Model Based on the Combination of CART and DBSCAN","authors":"Yibu Ma","doi":"10.1109/CIS.2013.40","DOIUrl":"https://doi.org/10.1109/CIS.2013.40","url":null,"abstract":"Along with the development of electronic and intelligence in the world's stock market advances, the accumulation of the stock data grows larger over time. It is of great concern on the ways to find the hidden rules of information in the mass of data. Given the background above, this paper explores the methods of data mining by using the combination of Decision tree algorithm and Clustering algorithm. In addition, this paper accomplishes stock forecasting by combining CART algorithm and DBSCAN algorithm to build a predictive model with good applicability through a large number of experiments for parameter testing. According to the works above, the predictive model has a high accuracy and provides a scientific theory supporting the investment decisions.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"35 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":"114480072","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}
引用次数: 5
An Improved Apriori Algorithm Based on Features 基于特征的改进Apriori算法
2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.33
Jun Yang, Zhonghua Li, Wei Xiang, Luxin Xiao
{"title":"An Improved Apriori Algorithm Based on Features","authors":"Jun Yang, Zhonghua Li, Wei Xiang, Luxin Xiao","doi":"10.1109/CIS.2013.33","DOIUrl":"https://doi.org/10.1109/CIS.2013.33","url":null,"abstract":"In the traditional Apriori algorithm, all the database transaction items are equally important. However, in fact, in order to discover more reasonable association rules, different items should be given different importance. In this paper, an improved algorithm based on Apriori algorithm is proposed, in which every transaction item has its own feature(s) to carry more information. With adding feature(s) to these items, when mining the association rules, just those transaction data with same feature(s) will be scanned and computed. Studies and analysis in book recommendation system show that it takes less time cost and gets more reasonable association rules by using the improved algorithm.","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":"126659929","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
An Intelligent Algorithm for the (1,2,2)-Generalized Knight's Tour Problem (1,2,2)-广义Knight漫游问题的一种智能算法
2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.129
Sen Bai, Guibin Zhu, Jian Huang
{"title":"An Intelligent Algorithm for the (1,2,2)-Generalized Knight's Tour Problem","authors":"Sen Bai, Guibin Zhu, Jian Huang","doi":"10.1109/CIS.2013.129","DOIUrl":"https://doi.org/10.1109/CIS.2013.129","url":null,"abstract":"In [Discrete Applied Mathematics 158(2010)1727-1731], we proved that the 3×4q×4p (where q≥2 and p≥2 are integer) chessboard admits a closed (1, 2, 2)-generalized knight's tour (GKT). In this paper, we prove that a chessboard of size L×4q×4p with L≥3 and L≠4, q≥2 and p≥2 must contain a closed (1, 2, 2)-GKT. Next, an intelligent algorithm based on the proved Lemma and Theorem is proposed to find closed (1, 2, 2)-GKT on L×4q×4p chessboard. The proposed algorithms for constructing structured (1, 2, 2)-GKT Hamiltonian cycle on L×4q×4p chessboard can readily be implemented in intelligence. Finally, the GKT Hamiltonian cycle is applied to video encryption, and simulation experimental results show that the GKT scrambling is suitable for perceptual video encryption.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"117 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":"117264208","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}
引用次数: 6
A Kind of Hilbert Boundary Value Problem for Generalized Analytic Functions in Clifford Analysis Clifford分析中一类广义解析函数的Hilbert边值问题
2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.172
Zhongwei Si, Liang Wang, X. Zhong, Xin-Lei Feng, Lina Liang
{"title":"A Kind of Hilbert Boundary Value Problem for Generalized Analytic Functions in Clifford Analysis","authors":"Zhongwei Si, Liang Wang, X. Zhong, Xin-Lei Feng, Lina Liang","doi":"10.1109/CIS.2013.172","DOIUrl":"https://doi.org/10.1109/CIS.2013.172","url":null,"abstract":"Let R_0, n be the real Clifford algebra generated by e_1, e_2, cdots, e_n satisfying e_ie_j+e_je_i=-2 delta_ij for i, j=1, 2, cdots, n. e_0 is the unit element. In this paper, we first give the kernel function for the generalized analytic function. Further, a kind of Hilbert Boundary Value Problem for generalized analytic functions in R^n+1_+ will be investigated and the solution is obtained.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"16 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":"129355351","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}
引用次数: 0
Diversifying Plant Image Retrieval with Dimensionality Reduction 基于降维的多样化植物图像检索
2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.97
Sheng-Ping Zhu, Jixiang Du, C. Zhai, Zhong-Qiu Zhao
{"title":"Diversifying Plant Image Retrieval with Dimensionality Reduction","authors":"Sheng-Ping Zhu, Jixiang Du, C. Zhai, Zhong-Qiu Zhao","doi":"10.1109/CIS.2013.97","DOIUrl":"https://doi.org/10.1109/CIS.2013.97","url":null,"abstract":"In recent years, content-based image retrieval achieved continuous development, but in the previous studies, only the relevance is cared in retrieval system, so many duplicate or near duplicate documents retrieved in response to a query and cannot satisfy the users. To solve this problem, we propose the Content-based Diversifying Plant Image Retrieval in this paper. In order to make the retrieval results have relevance and diversity, we extract plant image feature and use the relevance feedback technique based of SVM and the AP clustering algorithm. To accelerate retrieval, we use maximum variance projection (MVP) for dimensionality reduction. Experimental results show that our approach can achieve good performance.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"71 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":"117348152","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}
引用次数: 0
Harmonic Detection of Power System Based on SVD and EMD 基于SVD和EMD的电力系统谐波检测
2013 Ninth International Conference on Computational Intelligence and Security Pub Date : 2013-12-14 DOI: 10.1109/CIS.2013.46
Wei Wang, Zeng-li Liu, Chen Lin, Weiwei Sha
{"title":"Harmonic Detection of Power System Based on SVD and EMD","authors":"Wei Wang, Zeng-li Liu, Chen Lin, Weiwei Sha","doi":"10.1109/CIS.2013.46","DOIUrl":"https://doi.org/10.1109/CIS.2013.46","url":null,"abstract":"It is greatly significant to detect harmonic accurately and effectively for improving the quality of electric energy in the power system. Actually, much noise exists in signal besides harmonics, inter-harmonics, so the key is how to detect harmonic signals from the complex power system. According to the analysis of harmonic and noise, a new method is proposed in the paper to detect harmonic based on the Empirical Mode Decomposition (EMD) combination with the Singular Value Decomposition (SVD). Applications of three cases into the harmonic wave detecting show that the EMD based on SVD successfully conquers mode aliasing caused by noise. It is effective to detect amplitude and frequency of harmonics from complex signals of power system, proves that the algorithm could effectively and accurately detect harmonic signal.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"33 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":"133341720","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
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信