{"title":"An image encryption algorithm based on DNA sequence addition operation","authors":"Qiang Zhang, Ling Guo, Xianglian Xue, Xiaopeng Wei","doi":"10.1109/BICTA.2009.5338151","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338151","url":null,"abstract":"A new image encryption algorithm based on DNA sequence addition operation is presented. First, a DNA sequence matrix is obtained by encoding the original image. Second, divide the DNA sequence matrix into some equal blocks and use DNA sequence addition operation to add these blocks. Thirdly, carry out DNA sequence complement operation for the result of added matrix by using two Logistic maps. At last, decoding the DNA sequence matrix from the third step, we will get the encrypted image. The simulation experimental results and security analysis show that our algorithm not only can get good encryption effect, but also can resist exhaustive attack, statistical attack and differential attack.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125190079","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 nonlinear grade estimation method based on Wavelet Neural Network","authors":"Li Xiao-li, Xie Yu-ling, Li Li-hong, Guo Qin-jin","doi":"10.1109/BICTA.2009.5338156","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338156","url":null,"abstract":"Grade estimation is one of the most complicated aspects in mining. Its complexity originates from scientific uncertainty. This paper introduces a nonlinear Wavelet Neural Network (WNN) approach to the problem of ore grade estimation. The nonlinear WNN method combing the properties of the wavelet transform and the advantages of Artificial Neural Networks (ANN) provide fast and reliable ore grade estimation, with minimum assumptions and minimum requirements for modeling skills. The WNN grade estimation method has been tested on a number of real deposits. The result shows that the WNN has advantages of rapid training, generality and accuracy grade estimation approach. It can provide with a very fast and robust alternative to the existing time-consuming methodologies for ore grade estimation.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123302340","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":"Orthogonal locality discriminant embedding for document classification","authors":"Ziqiang Wang, Xia Sun","doi":"10.1109/BICTA.2009.5338132","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338132","url":null,"abstract":"Dimensionality reduction algorithms, which try to reduce the dimensionality of data and to enhance the discriminant information, are of paramount importance in document classification. In this paper, a novel dimensionality reduction algorithm called orthogonal locality discriminant embedding (OLDE) is proposed to address these problems. The OLDE algorithm effectively combines the idea of local discriminant embedding (LDE) and orthogonal basis functions, which utilizes both the local manifold structure and label information to enhance discriminative power. Extensive experiments on three document databases show the effectiveness of the proposed OLDE algorithm.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129643862","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":"Application of Rough Set and Support Vector Machine in competency assessment","authors":"Huizhen Liu, Shangping Dai, Hong Jiang","doi":"10.1109/BICTA.2009.5338100","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338100","url":null,"abstract":"Rough Set (RS) and Support Vector Machine(SVM) have gradually been becoming hot spots in the territory of artificial intelligence, machine learning and data mining research. In this paper, RS and SVM theories have been discussed, a new hybrid RS-SVM model was proposed based on the attribute reduction of RS and the classification principles of SVM, which has been analyzed its possibility of application in competency assessment and has been applied in competency assessment. Firstly, the attribute reduction of RS has been applied as preprocessor to delete redundant attributes and conflicting objects without losing efficient information. Then, an SVM classification model is built to make a forecast. Finally, compared the RS-SVM model with neural network model or grade regression model. Empirical results shown that RS-SVM model obtains good classification performance, and it highly reduces the complexity in the process of SVM classification and prevents the over-fit of training model in a certain extent.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128057740","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":"Design and performance evaluation of golden interleaving schemes for BICM-ID","authors":"X. Zou, Weiyan Liu, B. Liu","doi":"10.1109/BICTA.2009.5338072","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338072","url":null,"abstract":"Bit-interleaved coded modulation with iterative decoding (BICM-ID) is suitable for the next-generation wireless communication systems. BICM-ID is a bandwidth efficient transmission scheme. And the high performance of BICM-ID depends on the interleaver design. This paper focuses on the design of golden based interleaving schemes in BICM-ID systems. It shows that the golden interleaver and the dithered golden interleaver are not good for BICM-ID when the signal to noise ratio (SNR) is low. While the golden-chaotic interleaver has better performance than the golden and dithered golden interleaver and it also outperforms the random interleaver which is usually used in a BICM-ID system. The effect of the design parameter on the performance of the dithered golden interleaver and the golden-chaotic interleaver is also discussed in the paper. Performance analysis based on the normalized dispersion is provided in the paper and the accuracy of the dispersion analysis is verified by simulation results both in the additive white Gaussian noise (AWGN) channel and Rayleigh fading channels.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128119241","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}
Huo Xiao-jiang, Liu Zhong-jing, Huang Xun-cheng, Luo Yun-feng
{"title":"Decision analysis for purchase risks of the purchaser in the four trading markets under the electricity market framework","authors":"Huo Xiao-jiang, Liu Zhong-jing, Huang Xun-cheng, Luo Yun-feng","doi":"10.1109/BICTA.2009.5338065","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338065","url":null,"abstract":"This paper mainly illustrates that electricity purchasers face the decision of electricity purchase and the issues of risk managements in the four trading markets under the framework of the electricity markets. The restrictions and non-restriction purchase/sale of two purchasing electricity models are set up by means of Variance measuring risk under the framework of the electricity market. Meanwhile, in the paper, it also proposes several feasible algorithms to minimize risks for the electricity purchaser by guaranteeing their return.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128140449","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 molecular computing model for 3-coloring graph problem based on circular DNA branch migration","authors":"Zhang Cheng, Yang Jing, Xu Jin","doi":"10.1109/BICTA.2009.5338094","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338094","url":null,"abstract":"A 3-coloring graph problem, one of the NP-problems, has been solved using the method of circular DNA displacement. The whole computing process is based on single circular DNA branch migrations just in a few tubes. For this computing model, two features are circular DNA and rather lower experimental complexity. Moreover, the key methods in this model include displacements of circular ssDNA (single strand DNA) and backtracking deletion algorithm. By repeating of DNA displacements, the correct solutions will be found after computing processes. For a 3-coloring graph problem with n vertices, using this algorithm, the time and space complexity both are 0(n2) at most. During the computing course, an effective DNA strand displacement and exclusive sequence recognition ensure the accuracy of computing results. This model demonstrates circular DNA may have more applications in molecular computing.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131311625","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":"On the lower bounds of DNA word sets for DNA computing","authors":"Bin Wang, Qiang Zhang, Xiaopeng Wei","doi":"10.1109/BICTA.2009.5338069","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338069","url":null,"abstract":"DNA computing is a new research field, which has been paid attention to by more and more experts with the DNA computing bringing the flying development of Mathematics, Computer Science and other subjects. Because the DNA coding could decrease the emergence of false negative and false positive, it affects the reliability and the accuracy of DNA computing. In the DNA coding, DNA word sets could provide the best and effective DNA sequences which are used in DNA computing to improve the reliability and accuracy of biochemical reaction. However, there are no entire and exact values which satisfy combinational constraints, which induce many problems in DNA coding. For this reason, in this paper, we use the dynamic genetic algorithm to improve lower bounds of DNA word sets which satisfy combinational constraints. By comparing our experimental results with previous researchful work, the results improve the lower bounds and further shorten the value range of DNA word sets.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114437020","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":"General nucleic acid sequence design using implicit enumeration","authors":"Zhang Kai, Qiang Li, Z. Ming, Xu Jin","doi":"10.1109/BICTA.2009.5338080","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338080","url":null,"abstract":"The design of DNA and RNA sequences is an important area of research in fields such as gene microarrays, gene chips, medical diagnostic, and biomolecular computing. These nucleic acid molecules must satisfy several combinatorial, thermodynamic and secondary structure constraints, which aim to avoid undesired hybridizations and make the molecular experiment more reliable. In this paper, we formulate the DNA sequence design as a multiobjective optimization problem and solving it using implicit enumeration search approach. To heuristically search for good strand sets, our algorithm considers groups of solutions together. If any partial solution violates any constraint, all completion of this partial solution should be excluded from further consideration which accelerate the convergent of our algorithm. Finally, the performance of our algorithm is compared with other sequence design methods, and the results show that the implicit enumeration algorithm outperforms in DNA sequences quality, quantity and efficiency.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125446911","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":"Government control, diversification and corporate performance","authors":"Tao Wang, Xuefeng Li","doi":"10.1109/BICTA.2009.5338092","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338092","url":null,"abstract":"In this paper, we have analyzed the relationship among government control, diversification and corporate performance. The investigation has been performed using panel data procedure for a sample of 320 Chinese companies listed on the Shanghai Stock Exchange during the period from 2001 to 2006. We find that, diversification under government control has negative influence on firm performance, while the relationship between specialization under government control and performance is not statistically significant. This suggests that diversification under government control should decrease corporate performance.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126094688","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}