{"title":"The Design Principles for User-centered Remote Data Possession Checking","authors":"Lanxiang Chen, Zhen Peng","doi":"10.1109/CIS.2012.143","DOIUrl":"https://doi.org/10.1109/CIS.2012.143","url":null,"abstract":"As cloud computing can achieve the goal that getting all information resources in a plug-and-play way, it is rising recently. Data Storage as a Service (DaSaaS) is a typical application of cloud computing. It provides data storage services for users. Because of security and reliability, DaSaaS is not widely adopted. When users store their data in the DaSaaS server, they mostly concern about whether the data is intact, whether it can be recovered when there is a failure. This is the goal of remote data possession checking (RDPC) schemes. This paper exploits the design principles for user-centered RDPC schemes. Firstly an overview of RDPC is presented. Then the requirements of users are discussed. According to these requirements, the design principle is presented and a formula to trade off RDPC schemes is provided. They will help designers to design more effective schemes.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"36 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":"115412537","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}
{"title":"A New Plan Recognition Algorithm and its Implementation","authors":"Dan Zhang, Longmei Jie, GuoQiang Shao","doi":"10.1109/CIS.2012.43","DOIUrl":"https://doi.org/10.1109/CIS.2012.43","url":null,"abstract":"In order to efficiently recognize the partially ordered or interleaved, multiple plans, treat the partial observability of the domains and exclude misleading actions, in this paper, we designed a new plan recognition algorithm based on extending and pruning the Explanation Graph and then implemented it using the VC++ programming language. The results of test experiment indicate that the algorithm we presented here can completely accomplish the expected effect. It can not only recognize the plan and goal of the agent being performed efficiently, but also predict the actions the agent will take, and can also exclude the misleading actions.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"139 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":"127380298","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}
{"title":"An Improved File System Synchronous Algorithm","authors":"Qiang Li, Ligu Zhu, Saifeng Zeng, Wenqian Shang","doi":"10.1109/CIS.2012.123","DOIUrl":"https://doi.org/10.1109/CIS.2012.123","url":null,"abstract":"In order to timely synchronize the nodes in unstable network environment and reduce the space overhead of the operation log, we mix the operation transfer-based and state transfer-based synchronous models. In this paper, for file system synchronization, we design an improved file system synchronous algorithm -- the combination of state transform algorithm and operation merge algorithm. The experimental results show that the improved algorithm can completely merge file system changes into updates operation in millisecond. The key to mix the two ways is to unify updating granularity and semantic level, which will be taken by both models. The mixed model can meet the demand of instant response and the less resource-consuming at the same time.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"16 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":"125153486","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}
{"title":"Preference Based Multiobjective Evolutionary Algorithm for Constrained Optimization Problems","authors":"Ning Dong, Fei Wei, Yuping Wang","doi":"10.1109/CIS.2012.23","DOIUrl":"https://doi.org/10.1109/CIS.2012.23","url":null,"abstract":"Constrained optimization problems (COPs) are converted into a bi-objective optimization problem first, and a novel fitness function based on achievement scalarizing function (ASF) is presented. The fitness function adopts the valuable properties of ASF and can measure the merits of individuals by the weighting distance from the ndividuals to the reference point, where the reference point and the weighting vector reflect the preference of decision makers. In the initial stage of the evolution, the main preference should be put in generating more feasible solutions, and in the later stage of the evolution, the main preference should be put in improving the objective function. For this purpose, the proper reference point and weighting vector are chosen adaptively to realize the preference in different evolutionary stages. Then a new preference based multiobjective evolutionary algorithm is proposed based on all these. The numerical experiments for four standard test functions with different characteristic illustrate that the new proposed algorithm is effective and efficient.","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":"125884340","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}
{"title":"Based on Image Salient Features Network Image Retrieval Method","authors":"K. Yan, Ke Feng, Y. Wang, Bo-nian Pan","doi":"10.1109/CIS.2012.72","DOIUrl":"https://doi.org/10.1109/CIS.2012.72","url":null,"abstract":"Traditional image retrieval depends on the images embedded in text messages, text description of the limitations of image content, resulting in low quality of image retrieval. The local information extracted image itself, the use of local features LSH image matching algorithm, memory requirements has led to a linear growth. To overcome these shortcomings, then propose the method of image retrieval which based on the network salient features, by screening out the salient features of the frequent appearance of points, with each image feature point matching vectors to generate histogram matching, the use of its similarity to generate the calculation of PageRank, Adjacency matrix for each image to generate a PageRank score. Experimental results show that the algorithm improves the network image retrieval efficiency and accuracy.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"33 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":"115993048","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}
X. Gao, Ying Wu, Xiaolei Wang, Xianlin Huang, K. Zenger, Xiaofeng Wang
{"title":"A Modified PSO Method Based on Cultural Algorithm and Quantum Computing","authors":"X. Gao, Ying Wu, Xiaolei Wang, Xianlin Huang, K. Zenger, Xiaofeng Wang","doi":"10.1109/CIS.2012.10","DOIUrl":"https://doi.org/10.1109/CIS.2012.10","url":null,"abstract":"A novel Cultural Quantum-behaved Particle Swarm Optimization algorithm (CQPSO) is proposed in this paper to improve the performance of the Quantum-behaved PSO (QPSO). The cultural framework is embedded in our QPSO, and the knowledge stored in the belief space can guide the evolution of the QPSO. A total of 15 high-dimensional and multi-modal functions as well as an optimal pressure vessel design problem are employed to investigate the proposed algorithm. Numerical simulations results demonstrate that the CQPSO can indeed outperform the QPSO.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"136 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":"116719406","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}
{"title":"A Novel Blind Evaluation Method on Image Scrambling Degree","authors":"Congli Wang, Zhibin Chen, Mingxi Xue, Chao Zhang","doi":"10.1109/CIS.2012.146","DOIUrl":"https://doi.org/10.1109/CIS.2012.146","url":null,"abstract":"Most of the algorithms for evaluating image scrambling degree depend on the plain image and they cannot achieve blind evaluation. This paper indicates that the ideal scrambled image is similar to the uniform noise in spatial domain, advances a definition of ideal image scrambling which is independent of the plain image and designs a new evaluating index. In frequency domain, the gray relational degree, which is between mean sequence of scrambling image's FFT (Fast Fourier Transform) block and referential sequence, is calculated by gray relation analysis (GRA). Then a blind evaluation approach which combines the approaches of spatial and frequency domains together is presented. Experimental results show that this approach can be operated without depending on the knowledge of plain image and is in good agreement with human vision system (HVS). So this approach can achieve the goal of blind evaluation objectively and possesses high practicality.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"115 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":"116726792","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}
Xue Dongliang, Wu Xiaolong, Gao Yun-wei, Song Ying, Tian Xinhui, L. Zhaopeng
{"title":"TrustVP: Construction and Evolution of Trusted Chain on Virtualization Computing Platform","authors":"Xue Dongliang, Wu Xiaolong, Gao Yun-wei, Song Ying, Tian Xinhui, L. Zhaopeng","doi":"10.1109/CIS.2012.145","DOIUrl":"https://doi.org/10.1109/CIS.2012.145","url":null,"abstract":"Trusted chain technology provides a good opportunity to guarantee software and data integrities on cloud computing platforms. However, trusted chain on current virtualization computing platforms expose some problems, such as non-continuous, difficult to evolve or customize, insecure to transmit for remote attestation. To address these issues, this paper proposes a new approach to construct, protect and update the trusted chain on virtualization computing platform. This approach constructs a complete trusted chain based on full-virtualization technology, ensures the security of the chain by using the seal and unseals features of Trusted Platform Module (TPM), and proposes an algorithm called TPRTM to update the chain. We also describe architecture and a prototype system implementation that can solve the problems mentioned above on current platform. Experimental results show that our method can guarantee the integrities of all customizable programs on the trusted chain while incurring only 2.23% performance degradation. Furthermore, the system has been deployed in a large-scale communication enterprise and the results reveal that our system is safe, stable, and easy to use.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"57 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":"117024321","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}
{"title":"Energy Efficient and Cluster Based Routing Protocol for WSN","authors":"Hairong Zhao, Wuneng Zhou, Yan Gao","doi":"10.1109/CIS.2012.32","DOIUrl":"https://doi.org/10.1109/CIS.2012.32","url":null,"abstract":"Due to the limitation of energy, the router protocol of wireless sensor network (WSN) must minimize energy consumption to extend the network lifetime. By analyzing the hierarchical routing low energy adaptive clustering hierarchy (LEACH) in WSN, a protocol is proposed to improve of setting up cluster and data transmission route. A timer is introduced to make sure of electing the optimal sensor node as cluster head in process of setting up cluster. During data transmission, using single hop and multi-hop hybrid routing to communicate can utilize energy more effectively and evenly. A simulation example is provided to demonstrate the usefulness of the algorithm which extended the network lifetime and reduced energy consumption greatly compared to LEACH algorithm.","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":"129849651","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}
Zhao Er-dun, Qi Yong-qiang, Xiang Xing-Xing, Chen Yi
{"title":"A Data Placement Strategy Based on Genetic Algorithm for Scientific Workflows","authors":"Zhao Er-dun, Qi Yong-qiang, Xiang Xing-Xing, Chen Yi","doi":"10.1109/CIS.2012.40","DOIUrl":"https://doi.org/10.1109/CIS.2012.40","url":null,"abstract":"The data placement strategy is an important issue in the scientific workflows which is devoted to reducing the data movements while placing datasets in a few data centers according to the data centers' storage capacity and the data dependency. The data placement is proved to be a NP hard problem, and several methods for this problem like K-means clustering algorithm are presented in the literatures. K-means clustering algorithm can reduce the number of data movements very well, but it may result that the datasets will be concentrated to few data centers, and so the loads of data centers greatly deviate from each other. The paper proposes a data placement strategy based on heuristic genetic algorithm to reduce data movements among the data centers while balancing the loads of data centers. The simulation results show that the proposed algorithm can effectively reduce data movements and balance the load of data centers.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"54 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":"124626379","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}