{"title":"DNA solution based on triangle subgraph to the vertex cover problem","authors":"Aili Han","doi":"10.1109/BICTA.2010.5645328","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645328","url":null,"abstract":"DNA solution based on triangle subgraph to the vertex cover problem is given by means of an improved polynomial transformation from the vertex cover problem to the Hamiltonian circle problem. For an instance of the vertex cover problem, construct the triangle subgraph of each edge, which has 3 vertices and 3 edges instead of 4 vertices and 4 edges. And then link the triangle subgraphs of the edges incident to one vertex to form one sub path, and link the start and end points of each subpath to each selection vertex. Thus, the instance of the vertex cover problem is converted to that of the Hamiltonian circle problem, and DNA solution based on triangle subgraph to the vertex cover problem is given by means of the improved polynomial transformation.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134201146","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}
Ignacio Pérez-Hurtado, Luis Valencia-Cabrera, M. Pérez-Jiménez, M. A. Colomer, A. Riscos-Núñez
{"title":"MeCoSim: A general purpose software tool for simulating biological phenomena by means of P systems","authors":"Ignacio Pérez-Hurtado, Luis Valencia-Cabrera, M. Pérez-Jiménez, M. A. Colomer, A. Riscos-Núñez","doi":"10.1109/BICTA.2010.5645199","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645199","url":null,"abstract":"In recent years, the increasing importance of the computational systems biology is leading to an impressive growth of the knowledge of several real-life phenomena. In this framework, membrane computing is an emergent branch within natural computing that has been succesfully used to model biological phenomena. The study of these phenomena usually requires the execution of virtual experiments using mechanisms of simulation, implying the development of ad-hoc tools to simulate. However, the advance of the research is demanding general solutions to avoid the necessity of custom software developments for each matter of study, when there are some common problems to resolve. MeCoSim (Membrane Computing Simulator) is a first step in this direction providing the users a customizable application to generate custom simulators based on membrane computing by simply writing a configuration file.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131748973","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":"Notice of Violation of IEEE Publication PrinciplesBio-inspired automatic shape formation for swarms of self-reconfigurable modular robots","authors":"Ki-Won Yeom","doi":"10.1109/BICTA.2010.5645171","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645171","url":null,"abstract":"We present a bio-inspired, self-reconfiguration approach to automatically building user-specified, three-dimensional structures from modular units. In this paper we focus on providing the ability for a multitude of simplistic mobile robots to self-organize their relative positions, thereby, allowing them to arrange into a variety of spatial configurations. We introduce a new mobile molecular robot with polymer or triad interactions acting among individual molecules, taking the responsibilities for embodying its structure and determining where further units can legally be attached and detached. We design a hybrid mechanism for the shape formation. The attachment and detachment of each robot is realized by morphogenetic properties of molecular cells, and the shape formation is controlled by cellular automata. Development of morphological features such as the formation of fine particles, cracks in particles, hollow particles, good or poor replication of the original catalyst particle shape, and the evolution of the porous structure of polymer particle are used as illustrative examples.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125598723","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 finite termination mehrotra-type predictor-corrector algorithm for Semidefinite Optimization","authors":"Mingwang Zhang, Huaping Chen, Weihua Li","doi":"10.1109/BICTA.2010.5645134","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645134","url":null,"abstract":"Mehrotra-type predictor-corrector algorithm is one of the most remarkable interior-point methods for linear optimization, and it is also the base of many interior-point methods software packages. This paper presents an extension of the recent variant of Mehrotra's predictor-corrector algorithm that was proposed by Salahi (2007) for linear optimization problems. Based on the NT direction as Newton search direction, the finite termination of the algorithm for Semidefinite Optimization is proved, that is analogous to the linear case.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133930417","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}
Jianbin Xiong, Zhenkun Li, Luqiao Fan, Dongping Liu
{"title":"Improved depth first algorithm and its application in information retrieval","authors":"Jianbin Xiong, Zhenkun Li, Luqiao Fan, Dongping Liu","doi":"10.1109/BICTA.2010.5645357","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645357","url":null,"abstract":"With the rapid growth of the network information, how to search the relative information in the web becomes a new challenge. The algorithm of search engine is the key to search on web accurately and rapidly, and the research of search engine algorithm is still a hot issue of Web-search. The standard depth-first algorithm has some insufficient that include dead circulation and low recall-precision. It provides a developed depth-first algorithm to improve the recall-precision and accuracy of search, and use it to search in small and medium-sized websites.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122397105","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":"Petri net models and non linear genetic diseases","authors":"P. Glory, N. David, J. D. Emerald","doi":"10.1109/BICTA.2010.5645278","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645278","url":null,"abstract":"Understanding how an individual genetic make-up influences their risk of diseases, is a problem of paramount importance. Although machine-learning techniques are unable to uncover the relationships between genotype and disease, we can still build the best biochemical model automatically with the help of methods that identify the DNA sequence variations in human populations that cause genetic diseases. In this paper, we study Petri net model that is bio chemically plausible to a certain degree, that it may reveal characteristics of the actual biochemical pathways in humans that can aid understanding of the disease.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127646472","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":"Prediction of chaotic time series of neural network and an improved algorithm","authors":"Xin Yin, Ye Zhou, Yi-gang He, Haixia Zhang","doi":"10.1109/BICTA.2010.5645079","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645079","url":null,"abstract":"This paper mainly proposes a neural networks model with hybrid algorithm, named HAENN (Hybrid Algorithm Elman Neural Network). This model is based on Elman neural network, using an improved algorithm instead the standard BP training algorithm. This improved algorithm is combined Particle Swarm Optimization algorithm with Simulated Annealing's idea, which has faster convergence speed and better solution quality. In this paper, The Mackey-Glass chaotic time series and the Henon series are used for testing and imitating. The results indicate that by using this model can get faster convergence speed, better stability, higher the precision of prediction, and stronger adjustability.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121449082","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 non-degenerate 2D graphical representation and numerical characterization of DNA sequences","authors":"Shaohong Zhong, Yachun Liu, Renfa Li, Lili Pan","doi":"10.1109/BICTA.2010.5645339","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645339","url":null,"abstract":"Some 2-D and 3-D graphical representation of DNA sequences have been given by Nandy, Leong and Mogenthaler, and Randic et al., which give visual characterizations of DNA sequences, and a number of different approaches have been developed to date on numerically characterizing DNA sequences, but application of such method to practical problems still remains a formidable task. In this paper, we presented a novel graphical representation of DNA sequences by taking four special vectors in 2D Cartesian coordinate system to represent the four nucleic acid bases in DNA sequences, so that a DNA sequence is denoted on a plane by a directed walk. The comparison between sequences thus becomes one between the corresponding graphs. With a so-generated graphical representation of DNA, some numerical descriptors to discriminate gene sequences on the basis of distribution patterns are considered. The designed program can plot quickly not only the graphical representation of DNA sequence, but also calculate out the values of the normalized mean moments and other numerical parameters. The preliminary results in this paper show that the novel 2D graphical representation and the selected set of DNA numerical descriptors are able to discriminate between conserved mammalian gene sequences.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129166994","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":"Wavelet analysis based sparse LS-SVR for time series data","authors":"F. Chen, Dali Wei, Yongning Tang","doi":"10.1109/BICTA.2010.5645219","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645219","url":null,"abstract":"Due to the performances of low computational cost and excellent generalization capability, Least squares support vector regression (LS-SVR) has been successfully applied to function estimation and forecasting problems. However, in comparison to SVR, LS-SVR loses the sparseness and has worse robustness for large training samples. In this paper, a sparse LSSVR is proposed for the regression of large time series data. The signal features are extracted by using the multi-scale decomposition and wavelet denoising for training sample set. Based on the reconstructed signal, the importance of training samples is determined and the sparseness is imposed to LS-SVR. The typical benchmark functions are employed to evaluate our proposed algorithm. The experimental results show this algorithm can not only reduce the number of training samples significantly, but also eliminate noise interference.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128464622","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":"Analysis of protein sequence similarity","authors":"Yusen Zhang, Xiangtian Yu","doi":"10.1109/BICTA.2010.5645085","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645085","url":null,"abstract":"This paper proposes a novel method for analyzing similarities of protein sequences based on features generated from the hydropathy properties of amino acid sequences. At first using the hydropathy characteristics, the protein sequences are converted into fixed-dimensional feature vectors. Based on these feature vectors, we analyze nine ND5 proteins and construct a phylogenic tree as an application. The phylogeny obtained is generally consistent with the phylogenic tree constructed by MEGA4 software. The experimental results show the utility of our approach.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"414 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115917778","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}