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

2012 Eighth International Conference on Computational Intelligence and Security最新文献

筛选
英文 中文
Parallelization and Optimization of Molecular Dynamics Simulation on Many Integrated Core 多集成核分子动力学模拟的并行化与优化
2012 Eighth International Conference on Computational Intelligence and Security Pub Date : 2012-11-17 DOI: 10.1109/CIS.2012.54
Qian Yin, Ruiyi Luo, Ping Guo
{"title":"Parallelization and Optimization of Molecular Dynamics Simulation on Many Integrated Core","authors":"Qian Yin, Ruiyi Luo, Ping Guo","doi":"10.1109/CIS.2012.54","DOIUrl":"https://doi.org/10.1109/CIS.2012.54","url":null,"abstract":"Molecular dynamics (MD) simulations are useful in various areas. In this paper, we parallelize and optimize the grid-based MD algorithm on Many Integrated Core (MIC) Architecture. To get full play of the hardware and accelerate computation of MD simulation, we design the parallel structure using multi-threads with OpenMP. Also, various or method such as Array Notification, intrinsic and so on are used to vectorize the application according to the character of MIC for a higher performance. Due that multi-core is also a trendy of CPU and High Performance Computing, our method can be followed by other similar applications and provide a more choice.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123131301","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}
引用次数: 1
Cluster Synchronization of Complex Networks with Non-delayed and Delayed Coupling under Pinning Control 钉住控制下非延迟和延迟耦合复杂网络的集群同步
2012 Eighth International Conference on Computational Intelligence and Security Pub Date : 2012-11-17 DOI: 10.1109/CIS.2012.45
Ze Tang, Jianwen Feng, Yi Zhao
{"title":"Cluster Synchronization of Complex Networks with Non-delayed and Delayed Coupling under Pinning Control","authors":"Ze Tang, Jianwen Feng, Yi Zhao","doi":"10.1109/CIS.2012.45","DOIUrl":"https://doi.org/10.1109/CIS.2012.45","url":null,"abstract":"In this paper, we focus on the cluster synchronization problem of a general network with non-delayed and delayed coupling. Based on the linear negative feedback control scheme, we use the Lyapunov stability theorem and linear matrix inequality (LMI) to obtain sufficient conditions which guarantee the realization of the cluster synchronization pattern for all initial values. Besides, numerical simulation is also given to support the validity of our theoretical results.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115395052","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
New Bounds of the Nordhaus-Gaddum Type of the Laplacian Matrix of Graphs 图的拉普拉斯矩阵的Nordhaus-Gaddum型的新界
2012 Eighth International Conference on Computational Intelligence and Security Pub Date : 2012-11-17 DOI: 10.1109/CIS.2012.98
Tianfei Wang, Bin Li, Jin Zou, Feng Sun, Zhihe Zhang
{"title":"New Bounds of the Nordhaus-Gaddum Type of the Laplacian Matrix of Graphs","authors":"Tianfei Wang, Bin Li, Jin Zou, Feng Sun, Zhihe Zhang","doi":"10.1109/CIS.2012.98","DOIUrl":"https://doi.org/10.1109/CIS.2012.98","url":null,"abstract":"The Laplacian matrix is the difference of the diagonal matrix of vertex degrees and the adjacency matrix of a graph G. In this paper, we first give two sharp upper bounds for the radius of the Laplacian spectrum of G in terms of the edge number, the vertex number, the largest degree, the second largest degree and the smallest degree of G by applying non-negative matrix theory and graph theory. Then, two upper bounds of the NordhausGaddum type are obtained for the sum of Laplacian spectral radius of a connected graph and its connected complement. Moreover, we determine all extremal graphs which achieve these upper bounds. Finally, one numerical example illustrate that our results are better than the existing results in some sense.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125271407","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
Robust Image Hash Function Based on Polar Harmonic Transforms and Feature Selection 基于极调和变换和特征选择的鲁棒图像哈希函数
2012 Eighth International Conference on Computational Intelligence and Security Pub Date : 2012-11-17 DOI: 10.1109/CIS.2012.100
Yue-nan Li
{"title":"Robust Image Hash Function Based on Polar Harmonic Transforms and Feature Selection","authors":"Yue-nan Li","doi":"10.1109/CIS.2012.100","DOIUrl":"https://doi.org/10.1109/CIS.2012.100","url":null,"abstract":"Robust hashing aims at representing the perceptual essence of media data in a compact manner, and it has been widely applied in content identification, copyright protection, content authentication, etc. In this paper, a robust hashing algorithm is proposed by incorporating the polar harmonic transforms and feature selection. The proposed hashing algorithm starts by preprocessing, where morphological operations are employed to disclose the principle structures of the input image. The polar harmonic transforms, which have shown promising results in pattern classification, are then exploited to produce candidate features for hash computation. In order to select the most robust and discriminative features, feature selections are applied on the candidate feature set via boosting algorithm. The hash string is finally generated by randomly permuting the quantization indexes of selected features. Experimental results reveal that the proposed work is both distortion-resistent and discriminative, and it can achieve higher content identification accuracy than the comparative algorithm.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121231620","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}
引用次数: 7
A Weak Filled Function Algorithm for Unconstrained Searching Optimization 无约束搜索优化的弱填充函数算法
2012 Eighth International Conference on Computational Intelligence and Security Pub Date : 2012-11-17 DOI: 10.1109/CIS.2012.15
Guiyu Li, Jiongcheng Li, Henghui Xiao, S. Ding
{"title":"A Weak Filled Function Algorithm for Unconstrained Searching Optimization","authors":"Guiyu Li, Jiongcheng Li, Henghui Xiao, S. Ding","doi":"10.1109/CIS.2012.15","DOIUrl":"https://doi.org/10.1109/CIS.2012.15","url":null,"abstract":"Aiming at the optimization algorithm, weak filled function method is proposed and which with simple form is constructed. The restriction of this method is weaker than the known filled function method, thus it is easier to construct function and solve algorithm. The weak filled function method is feasible through the theoretical analysis, and the global minimum of simulation example can be obtained in its interval. The results indicate that weak filled function method is an effective method.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121284790","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
TV OS-SART with Fractional Order Integral Filtering 带有分数阶积分滤波的TV OS-SART
2012 Eighth International Conference on Computational Intelligence and Security Pub Date : 2012-11-17 DOI: 10.1109/CIS.2012.37
Ji Dong-Jiang, He Wen-zhang, Zou Xiao-bing
{"title":"TV OS-SART with Fractional Order Integral Filtering","authors":"Ji Dong-Jiang, He Wen-zhang, Zou Xiao-bing","doi":"10.1109/CIS.2012.37","DOIUrl":"https://doi.org/10.1109/CIS.2012.37","url":null,"abstract":"Computed tomography (CT) is widely used in industrial nondestructive testing (NDT). The projection data of CT usually contain serious noises. In this situation, compared with conventional filtered back projection (FBP), total variation ordered subsets simultaneous algebraic reconstruction technique (TV-OS-SART) is a better reconstruction method. However, image noise will increase after some iterations while the image quality does not meet the requirement. In order to improve the quality of reconstructed image, for three dimensional cone-beam CT, a total variation ordered subsets simultaneous iterative reconstruction algorithm with fractional order integral is researched. Experimental results show that the proposed method has faster convergence speed.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116162224","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
One-round Tripartite Authenticated Batch-Keys Agreement Protocol from Paring 来自Paring的一轮三方认证批处理密钥协议
2012 Eighth International Conference on Computational Intelligence and Security Pub Date : 2012-11-17 DOI: 10.1109/CIS.2012.118
Wei Gao, Zhenyou Wang
{"title":"One-round Tripartite Authenticated Batch-Keys Agreement Protocol from Paring","authors":"Wei Gao, Zhenyou Wang","doi":"10.1109/CIS.2012.118","DOIUrl":"https://doi.org/10.1109/CIS.2012.118","url":null,"abstract":"This paper presents a one-round tripartite authenticated key agreement protocol based on certification from Weil pairing. 27 different authenticated keys can be shared in a single run of the protocol. Their properties of security and efficiency are discussed.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126237686","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}
引用次数: 1
Security Analysis of Several Chosen Ciphertext Secure Group-oriented Encryption Schemes 几种选定的面向密文安全组的加密方案的安全性分析
2012 Eighth International Conference on Computational Intelligence and Security Pub Date : 2012-11-17 DOI: 10.1109/CIS.2012.120
Xu An Wang, Jinting Nie, Wei Wang
{"title":"Security Analysis of Several Chosen Ciphertext Secure Group-oriented Encryption Schemes","authors":"Xu An Wang, Jinting Nie, Wei Wang","doi":"10.1109/CIS.2012.120","DOIUrl":"https://doi.org/10.1109/CIS.2012.120","url":null,"abstract":"In Journal of Systems Engineering and Electronics, Maet al. proposed a broadcast group-oriented encryption secure against chosen cipher text attack scheme, later they proposed several other chosen cipher text secure group-oriented encryption schemes, based on this scheme, they also proposed a group-based proxy re-encryption scheme secure against chosen cipher text attack. However, in this paper we will show that these schemes are not chosen cipher text secure.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127049519","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}
引用次数: 1
A Niching Harmony Search Method for Multi-modal Optimization 一种多模态优化的小生境和谐搜索方法
2012 Eighth International Conference on Computational Intelligence and Security Pub Date : 2012-11-17 DOI: 10.1109/CIS.2012.13
X. Gao, Xiaolei Wang, K. Zenger, Xiaofeng Wang
{"title":"A Niching Harmony Search Method for Multi-modal Optimization","authors":"X. Gao, Xiaolei Wang, K. Zenger, Xiaofeng Wang","doi":"10.1109/CIS.2012.13","DOIUrl":"https://doi.org/10.1109/CIS.2012.13","url":null,"abstract":"The Harmony Search (HS) method is an emerging meta-heuristic optimization algorithm. However, it is generally not so efficient in dealing with multi-modal optimization problems, in which instead of only a single optimum, multiple optima need to be found. In our paper, a novel HS method based on the niching technique (deterministic crowding), n-HS, is proposed and studied to overcome this shortcoming. A total of eight typical multi-modal optimization functions are used to demonstrate that the n-HS can successfully locate most of the global and local optima.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130382478","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}
引用次数: 1
Differential Evolution Algorithm for the Optimization of the Vehicle Routing Problem in Logistics 物流车辆路径优化的差分进化算法
2012 Eighth International Conference on Computational Intelligence and Security Pub Date : 2012-11-17 DOI: 10.1109/CIS.2012.19
Huan Xu, Jiechang Wen
{"title":"Differential Evolution Algorithm for the Optimization of the Vehicle Routing Problem in Logistics","authors":"Huan Xu, Jiechang Wen","doi":"10.1109/CIS.2012.19","DOIUrl":"https://doi.org/10.1109/CIS.2012.19","url":null,"abstract":"The unidirectional logistics distribution vehicle routing problem with no time windows is considered. It contains the vehicle capacity restriction, the longest distance restriction and the full loaded vehicle. The solution must ensure the non-full loaded factor is the least and the total distance is the shortest. A multi-objective optimization mathematical model for the problem is established. And the differential evolution algorithm is proposed for this problem. The optimal solutions to the model are obtained by selecting the appropriate encoding method. The results of simulation show that the differential evolution algorithm is an effective way for solving the vehicle routing problem.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133315904","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}
引用次数: 14
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信