{"title":"An Improved Genetic Algorithm for Job Shop Scheduling Problem","authors":"Qing-dao-er-ji Ren, Yuping Wang, Xiaojing Si","doi":"10.1109/CIS.2010.32","DOIUrl":"https://doi.org/10.1109/CIS.2010.32","url":null,"abstract":"Job shop scheduling problem is a typical NP-hard problem. In this paper, new designed crossover and mutation operators based on the characteristic of the job shop problem itself are specifically designed. Based on these, an improved genetic algorithm is proposed. The computer simulations are made on a set of benchmark problems and the results indicate the effectiveness of the proposed algorithm.","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":"115146344","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 Application of Dominant-Recessive Diploid Codes in MOGA","authors":"Na Li, Qing-dao-er-ji Ren","doi":"10.1109/CIS.2010.41","DOIUrl":"https://doi.org/10.1109/CIS.2010.41","url":null,"abstract":"When solving an optimal problem, different encoding method has an important effect on the performance of multi-objective genetic algorithm. This paper breaks the traditional binary coding ideas, introduces a new dominant-recessive diploid codes which applied in the MOGA. we analyses the impact on solution space by the binary multi-objective genetic algorithm and dominant-recessive diploid codes multi-objective genetic algorithm, which is operated by three basic operators of tournament selection, two-point crossing, and the basic bit mutation. Furthermore, by using the Numerical experiments of three Classic multi-objective optimization test functions, this algorithms and the efficient binary multi-objective algorithms named niched pare to genetic algorithms are compared. From the solution, we know that this paper’s algorithm is obviously superiors to the niched pare to genetic algorithm about the distribution, convergence of solution and the capability of anti-prematurity. Thus, it is interpreted that the algorithm is feasible from the aspects of theoretic analysis and numerical experiments, and the pare to solutions can be came to.","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":"124406944","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 Based Robust Video Hash Algorithm","authors":"Yue-nan Li","doi":"10.1109/CIS.2010.100","DOIUrl":"https://doi.org/10.1109/CIS.2010.100","url":null,"abstract":"A simple and efficient energy based robust video hash algorithm is presented. The energy relationships of transform coefficients are extracted with secrete keys for hash construction. Experimental results show that the algorithm outperforms state-of-the-art ones in terms of robustness. Hash comparisons also show that the algorithm is collision resistant.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"18 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":"121785291","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":"New CCA-Secure Proxy Re-encryption Scheme without Random Oracles","authors":"Xu An Wang, Ping Wei, Minqing Zhang","doi":"10.1109/CIS.2010.87","DOIUrl":"https://doi.org/10.1109/CIS.2010.87","url":null,"abstract":"Proxy re-encryption PRE) allows a ciphertext computed under Alice’s public key to be transformed to thos which can be decrypted by Bob. In PKC’08, Libert an Vergnaud proposed the ?rst unidirectional RCCA-secure PRE scheme in the standard model. They left the open problem of constructing unidirectional CCA-secure PRE scheme in the standard model open. Until recently, this open problem was solved by Weng et al. and Shao et al. independently. In this paper, based on Shao et al.’s proposal, we give a new efficient CCA-secure PRE scheme without random oracles and prove its security.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"17 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":"121203458","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":"Image Denoising Using Nonseparable Wavelet and SURE-LET","authors":"W. Zeng, Xiubao Jiang, Zhengquan Xu, Long Zhou","doi":"10.1109/CIS.2010.153","DOIUrl":"https://doi.org/10.1109/CIS.2010.153","url":null,"abstract":"In this paper, we present a novel method to image denoising using non-separable wavelet based SURE-LET approach. Unlike conventional separable wavelet filter banks that limit the ability in capturing directional information, non-separable wavelet filter banks contain the basis elements oriented at a variety of directions which are able to capture different detail information. Using SURE-LET makes it needless to hypothesize a statistical model for the noiseless image. Besides, SURE-LET denoising algorithm merely amounts to solving linear system of equations, which is obviously fast and efficient. Experimental results on several test images are compared with separable wavelet based denoising techniques, the competitive results show that the non-separable wavelet based SURE-LET method is effective.","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":"126080837","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 Approach of ACARS Data Encryption and Authentication","authors":"Meng Yue, Xiaofeng Wu","doi":"10.1109/CIS.2010.127","DOIUrl":"https://doi.org/10.1109/CIS.2010.127","url":null,"abstract":"With the increasing number of aircraft, the airlines and civil aviation organization are relying on ACARS (Aircraft Communications Addressing and Report System) for air traffic and control. Unfortunately, automated information exchange between aircraft and ground entity also increase the system vulnerability and may severely impacts the safety of a flight. This paper introduce a End-to-End architecture which employ message encryption and authentication to protect the security between aircraft and airlines and thus permit ACARS data link messages to be exchanged in a secure manner.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"84 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":"126191232","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 Swarm Intelligence Algorithm Based on Boundary Mutation","authors":"Hongwei Lin, Yuping Wang, Cai Dai","doi":"10.1109/CIS.2010.48","DOIUrl":"https://doi.org/10.1109/CIS.2010.48","url":null,"abstract":"In this paper, a new swarm intelligence algorithm called SIA for global optimization is proposed. Each individual in population is firstly projected onto the boundary of the search space in order to extend the region of the global search. Secondly, a probability of generating new individual is computed based on the function values of the individual, its corresponding boundary point and the best individual in the current population, then the new individual which is the variation of the individual is produced. These two steps are repeated until all individuals in the current population are processed. Then a new population is generated. The numerical experiments have indicated the efficiency of the proposed algorithm.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"30 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":"123775241","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}
Xiuyu Wang, Xingwu Jiang, Xiaogang Dong, Qing-huai Liu
{"title":"Existence of the Solution for General Complementarity Problems","authors":"Xiuyu Wang, Xingwu Jiang, Xiaogang Dong, Qing-huai Liu","doi":"10.1109/CIS.2010.52","DOIUrl":"https://doi.org/10.1109/CIS.2010.52","url":null,"abstract":"In this paper, we study the following general Complementarity problem, We use Poineare-Bohn’s homotopy invariance theorem of degree to derive an alternative theorem. Based on this result, a sufficiently condition is established to assure the existence and boundedness of solution curve.","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":"130343740","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 Fast HITON_PC Algorithm","authors":"Wei Yang","doi":"10.1109/CIS.2010.17","DOIUrl":"https://doi.org/10.1109/CIS.2010.17","url":null,"abstract":"The HITON_PC algorithm which is a state-of-the-art local causal discovery algorithm can deal with a dataset with a very small sample-to-variable ratio efficiently. But it cannot perform inefficiently on a dataset with a very large sample. To address this problem, a fast HITON_PC algorithm is presented which uses a new yet simple search strategy from high order to low order to improve the efficiency of HITON-PC. Experimental results show our fast HITON_PC outperforms the HITON_PC algorithm. Moreover, we also apply the new search strategy to MMPC algorithm. Our method also is superior to MMPC.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"5 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":"127943893","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":"Efficient and Secure Authentication Protocol for VANET","authors":"Hui Liu, Hui Li, Zhanxin Ma","doi":"10.1109/CIS.2010.120","DOIUrl":"https://doi.org/10.1109/CIS.2010.120","url":null,"abstract":"VANET is very important for improving traffic safety and efficiency. So the messages in VANET must be trustworthy and disseminated very fast. In this paper, an efficient and secure scheme is proposed for VANET messages authentication, group signature is used for the messages from private vehicles and identity-based signature for public vehicles and RSU, further more, it employs batch message-processing techniques to accelerate the verification. Quantitative comparison determination is explored for handling conflicting information. Extensive simulation is conducted to confirm the efficiency of the scheme in various application scenarios. The results show that the scheme is better than other similar programs.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"4 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":"121776247","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}