{"title":"The Comparison of Two Kinds of Reproduction in Multiobjective Optimization","authors":"Xue-fei Yao, Hai-Lin","doi":"10.1109/CIS.2010.28","DOIUrl":"https://doi.org/10.1109/CIS.2010.28","url":null,"abstract":"Most of constraint handling papers have focused on the selection of individuals by trade-off the feasible and infeasible regions. This paper studies the effect of two kinds of reproduction in constraint multiobjective optimization. It compares a probabilistic model-based multiobjective evolutionary algorithm to a genetic algorithm. They all use a min-max selection strategy as the main frame structure. The comparison with 19 constraint multiobjective optimization testing instances is given in this paper. The comparison of the instances can show us which reproduction should be used to get a better result when facing different cases.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132931246","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 Threshold Signature Scheme to Withstand the Conspiracy Attack","authors":"Jie Wang, Yongquan Cai, Jingyang He","doi":"10.1109/CIS.2010.80","DOIUrl":"https://doi.org/10.1109/CIS.2010.80","url":null,"abstract":"Aiming at the weakness of existing schemes, a new threshold signature scheme to withstand the conspiracy attack is proposed in this paper. In this scheme, any subset of t or more than t members of the group can execute a valid threshold signature on behalf of the whole but can’t construct legal group signature through giving two specific equations contained each other, so this scheme can not only withstand conspiracy attacks effectively, but also provide traceability under the premise of group signature anonymity. In addition, a new conspiracy attack method is designed, which was adopted to test the existing schemes and the new scheme of this paper, the result shows new scheme has higher security than existing ones.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133442955","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":"(2, n) Secret Image Sharing Scheme with Ideal Contrast","authors":"Lin Dong, Daoshun Wang, Min Ku, Yiqi Dai","doi":"10.1109/CIS.2010.97","DOIUrl":"https://doi.org/10.1109/CIS.2010.97","url":null,"abstract":"In this paper, we propose a (2, n) secret image sharing scheme with precise reconstruction for binary, grayscale and color image. In sharing phase, XOR-based secret sharing scheme is utilized and each participant is required to hold a certain number of shares, each having the same size as the secret image. In revealing phase, each two participants can recover the original secret image precisely by just performing simple Boolean operation. The proposed scheme has low computational complexity and can reconstruct the secret image precisely. Experimental results show our scheme is simple and effective.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116191049","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":"Evolutionary Algorithm for Zero-One Constrained Optimization Problems Based on Objective Penalty Function","authors":"Z. Meng, M. Jiang, C. Dang","doi":"10.1109/CIS.2010.36","DOIUrl":"https://doi.org/10.1109/CIS.2010.36","url":null,"abstract":"In many evolutionary algorithms, it is very important way to use penalty function as a fitness function in order to solve many integer optimization problems. In this paper, we first define a new objective penalty function and give its some properties for integer constrained optimization problems. Then, we present an algorithm with global convergence for integer constrained optimization problems in theory. Moreover, based on the objective penalty function, a simple novel evolutionary algorithm to solve the zero-one constrained optimization problems is developed. Finally, numerical results of several examples show that the proposed evolutionary algorithm has a good performance for some zero-one optimization problems.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116221101","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":"Some New Optimal Pairings","authors":"He Shang, Mingqiang Wang","doi":"10.1109/CIS.2010.90","DOIUrl":"https://doi.org/10.1109/CIS.2010.90","url":null,"abstract":"The Ate pairing can be computed efficiently on ordinary elliptic curves with small value of the trace of Frobenius $bf t$. The ${bf Ate_i}$ pairing generalizes the Ate pairing, and can possibly shorten the Miller loop to be as small as ${bf r^{frac{1}{varphi(k)}}}$ on some special pairing-friendly curves with large value of Frobenius $bf t$. However, not all pairing-friendly curves have this property. In this paper, we generalize the ${bf Ate_i}$ pairing further. By our method, we can shorten the the Miller loop to be nearly ${bf r^{frac{1}{varphi(k)}}}$ on some pairing-friendly curves, while the ${bf Ate_i}$ pairing can not reach.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"716 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122001876","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 Digital Watermarking Scheme Used for Authentication of Surveillance Video","authors":"Duanquan Xu, Jiangshan Zhang, Baochuan Pang","doi":"10.1109/CIS.2010.147","DOIUrl":"https://doi.org/10.1109/CIS.2010.147","url":null,"abstract":"Fragile digital watermarking is one of the methods used for authentication of surveillance video. A fragile digital watermarking scheme is proposed, in which the watermark is made up of time information and camera ID, the secret key is generated based on the video feature, the watermark is embedded into the chromatism component of B frames. This watermarking scheme can detect and locate the modification of the video, including frame cut, foreign frame insertion and frame swapping etc. In addition, while the video is played back, the watermark information picked up from the carrier can be displayed on the video, which is a replacement of the traditional OSD (On Screen Display).","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124676578","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":"The Bipanconnectivity and Hamiltonian-Connectivity of Enhanced Hypercube","authors":"L. Yingying, Liu Hong-mei","doi":"10.1109/CIS.2010.105","DOIUrl":"https://doi.org/10.1109/CIS.2010.105","url":null,"abstract":"Enhanced hypercube $Q_{n,k}$ is one of the attractive variant of hypercube. In this paper, we show that the $n$-dimensional enhanced hypercube is bipanconnected when $n$ and $k$ have the same parity. We also show that the $n$-dimensional enhanced hypercube is Hamiltonian-connected when $n$ and $k$ have the different parity.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124876175","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":"Airport Taxi Scheduling Optimization Based on Genetic Algorithm","authors":"Changyou Liu, K. Guo","doi":"10.1109/CIS.2010.50","DOIUrl":"https://doi.org/10.1109/CIS.2010.50","url":null,"abstract":"The increasing development of civil aviation transportation has caused serious congestion, which often results in low efficiency and potential risks of airport surface traffic system. In this paper, a new genetic encoding method different from previous ones is presented to solve the aircraft safe taxiing problems based on an optimization model with three types of conflict restrictions. The simulations are made by using the realistic data of the Chengdu Shuangliu airport and an illustrative example is given to show the validity of our approach by comparison with shortest path algorithm without safety constraint condition.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126191949","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":"Intelligent Digital Photo Management System Using Ontology and SWRL","authors":"Yanmei Chai, Tian Xia, Jian-ming Zhu, Haifeng Li","doi":"10.1109/CIS.2010.11","DOIUrl":"https://doi.org/10.1109/CIS.2010.11","url":null,"abstract":"The number of digital photos in the personal computer is exploding. Existing photo annotation and management systems suffer from some problems (some among them are quite serious), which discussed at the beginning of the full paper. Aiming at these problems, this paper proposed a solution based on ontology. First of all, the Family Album ontology is built to organize the domain knowledge and provide formal, explicit and conceptual annotation. Then we annotate preliminary semantic information for digital photos by automated extraction of semantic concepts from file titles, photo description texts, EXIF metadata and visual features of images etc.. Furthermore, the SWRL (Semantic Web Rule Language) rules are written and executed to extend previous semantic annotations and support knowledge inference. Finally, an Onto Album prototype system is developed for verifying the validity of the proposed approach. Experimental results show that the proposed approach is very effective and promising.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"408 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122790614","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":"Robust Adaptive Neural Control for a Class of Stochastic Nonlinear Systems","authors":"Ruliang Wang, Chaoyang Chen","doi":"10.1109/CIS.2010.117","DOIUrl":"https://doi.org/10.1109/CIS.2010.117","url":null,"abstract":"In this paper, adaptive neural control is investigated for a class of nonlinear stochastic systems with stochastic disturbances and unknown parameters. Under the condition of all system states being available for feedback, by employing the back stepping method, a suitable stochastic control Lyapunov function is then proposed to construct an adaptive neural network state-feedback controller, and unknown parameters are reasonably disposed. It is shown that, the the closed-loop system can be proved to be global asymptotically stable in probability. The simulation results demonstrate the effectiveness of the proposed control scheme.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122849257","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}