SAT problem is one of important NP-complete problems with widespread applications. In this paper, a new DNA computing model based on the photoelectric DNA detection platform with magnetic-beads is proposed to solve this problem. Ordinary optical illumination and photodiode of the platform are utilized to turn light intensity into electricity. Compared with the detected photocurrent before hybridization, the signal of DNA hybridization can be distinctly diagnosed by the light intensity changing. With this technique, single base mismatched DNA could be successfully distinguished from perfectly matched DNA sequence, which saves the time of amplifying hybridization signal. This detection platform fits for DNA computing because the magnetic property could easily eliminate unfeasible solutions of problem. The experimental result of a SAT problem, which is solved by DNA computing on this platform, reveals the obvious benefits of this detection platform and its potential to be used to construct a fully automatic DNA computer with photoelectric readout.
{"title":"DNA Computing Model Based on Photoelectric Detection System with Magnetic Beads","authors":"Fei Li, Zheng Li, Jin Xu","doi":"10.1109/BIC-TA.2011.24","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.24","url":null,"abstract":"SAT problem is one of important NP-complete problems with widespread applications. In this paper, a new DNA computing model based on the photoelectric DNA detection platform with magnetic-beads is proposed to solve this problem. Ordinary optical illumination and photodiode of the platform are utilized to turn light intensity into electricity. Compared with the detected photocurrent before hybridization, the signal of DNA hybridization can be distinctly diagnosed by the light intensity changing. With this technique, single base mismatched DNA could be successfully distinguished from perfectly matched DNA sequence, which saves the time of amplifying hybridization signal. This detection platform fits for DNA computing because the magnetic property could easily eliminate unfeasible solutions of problem. The experimental result of a SAT problem, which is solved by DNA computing on this platform, reveals the obvious benefits of this detection platform and its potential to be used to construct a fully automatic DNA computer with photoelectric readout.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115379743","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}
K. Gopalan, Senthil Nathan, H. BhanuTejaC., Ashok Babu Channa, Prateek Saraf
Smart devices and pervasive connectivity have lead to an increase in demand for providing intelligent personalized services that improve user experience. Providing personalized media recommendation services that recommend content relevant to the user is gaining prevalence. In this paper we investigate the use of context capture on the user's devices as a method of learning all the user activity patterns and using these patterns to generate content recommendations. We propose a novel recommendation mechanism based on an evolutionary algorithm that evaluates new content based on multiple objectives. We show by way of simulation, improvements in the provided recommendations compared to traditional methods.
{"title":"A Context Aware Personalized Media Recommendation System: An Adaptive Evolutionary Algorithm Approach","authors":"K. Gopalan, Senthil Nathan, H. BhanuTejaC., Ashok Babu Channa, Prateek Saraf","doi":"10.1109/BIC-TA.2011.4","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.4","url":null,"abstract":"Smart devices and pervasive connectivity have lead to an increase in demand for providing intelligent personalized services that improve user experience. Providing personalized media recommendation services that recommend content relevant to the user is gaining prevalence. In this paper we investigate the use of context capture on the user's devices as a method of learning all the user activity patterns and using these patterns to generate content recommendations. We propose a novel recommendation mechanism based on an evolutionary algorithm that evaluates new content based on multiple objectives. We show by way of simulation, improvements in the provided recommendations compared to traditional methods.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114629785","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}
Splicing system is proposed to model the recombinant behaviour of DNA molecules. This paper introduces the concept of double cross-over splicing in circular arrays. The theoretical result as persistence in circular array splicing give rise to important properties. we obtained recursively enumerable language L for any double cross-over circular array splicing system S.
{"title":"Double Cross - Over Circular Array Splicing","authors":"S. Bharathi, J. Padmashree, K. Thiagarajan","doi":"10.1109/BIC-TA.2011.27","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.27","url":null,"abstract":"Splicing system is proposed to model the recombinant behaviour of DNA molecules. This paper introduces the concept of double cross-over splicing in circular arrays. The theoretical result as persistence in circular array splicing give rise to important properties. we obtained recursively enumerable language L for any double cross-over circular array splicing system S.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114513250","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}
Suriyani Ariffin, R. Mahmod, Azmi Jaafar, M. Ariffin
This paper proposed immune-inspired approaches in designing a new function for cryptographic algorithm named as 3D-AES. The immune systems approaches were selected on the basis of complex features that are desirable for substitution and permutation process to ensure adequate security and confidentiality of the systems in the world of information technology. This paper will identify the correspondences and highlight essential computation elements that can be applied in cryptographic algorithm that satisfies with Shannon's confusion and diffusion properties. The 3D-AES uses components in Advanced Encryption Standard(AES) algorithm and new core components based on immune systems approaches. Cryptographic strength in the context of this paper is related to the ability of the algorithm to produce a random output. The empirical findings are presented and identified that the randomness of the output in the 3D-AES algorithm are comparable with AES algorithm.
{"title":"Immune Systems Approaches for Cryptographic Algorithm","authors":"Suriyani Ariffin, R. Mahmod, Azmi Jaafar, M. Ariffin","doi":"10.1109/BIC-TA.2011.33","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.33","url":null,"abstract":"This paper proposed immune-inspired approaches in designing a new function for cryptographic algorithm named as 3D-AES. The immune systems approaches were selected on the basis of complex features that are desirable for substitution and permutation process to ensure adequate security and confidentiality of the systems in the world of information technology. This paper will identify the correspondences and highlight essential computation elements that can be applied in cryptographic algorithm that satisfies with Shannon's confusion and diffusion properties. The 3D-AES uses components in Advanced Encryption Standard(AES) algorithm and new core components based on immune systems approaches. Cryptographic strength in the context of this paper is related to the ability of the algorithm to produce a random output. The empirical findings are presented and identified that the randomness of the output in the 3D-AES algorithm are comparable with AES algorithm.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116759902","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}
This paper deals with generation of two dimensional arrays and picture patterns using parallel insertion scheme introduced in [9] and Rewriting P systems with conditional communication [6]. Specifically Parallel insertion scheme is incorporated along with conditional communication and the resulting system is studied.
{"title":"Generation of Two Dimensional Arrays Using Parallel Insertion Scheme","authors":"S. Hemalatha, R. Sathya","doi":"10.1109/BIC-TA.2011.38","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.38","url":null,"abstract":"This paper deals with generation of two dimensional arrays and picture patterns using parallel insertion scheme introduced in [9] and Rewriting P systems with conditional communication [6]. Specifically Parallel insertion scheme is incorporated along with conditional communication and the resulting system is studied.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123120744","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}
This paper analyzes the functions of an automated blood cell counter from a clinical pathology laboratory and proposes an application of the data preprocessing phase of the Knowledge Discovery in Databases (KDD) processes such as data cleaning, data selection and data transformation on the blood cell counter data to enhance the quality of the system. The blood cell counter data are subjected to a range test normally to ensure quality and then the tests are repeated manually to ensure correctness of the results. The manual procedure is time consuming and hence it is desired to reduce the number of manual reviews. A delta check is performed in some cases to reduce the number of manual reviews and that involves the previous test results of the same patient for the same test. This paper analyzes various ways of finding the delta values of the tests to reduce the number of manual reviews. Two exceptions to the process are also analyzed in this paper. The first case is to repeat the test even when the test result is normal and the second is not to go for retest even if the test results are abnormal based on the past results of the same patient.
分析了某临床病理实验室的全自动血细胞计数器的功能，提出了将数据库知识发现(Knowledge Discovery in Databases, KDD)过程中的数据预处理阶段，如数据清洗、数据选择和数据转换等应用于血细胞计数器数据，以提高系统的质量。血细胞计数器的数据通常进行范围测试以确保质量，然后手动重复测试以确保结果的正确性。手动过程非常耗时，因此需要减少手动审查的次数。在某些情况下，执行增量检查是为了减少手工检查的次数，这涉及到同一患者的相同测试的先前测试结果。本文分析了寻找测试增量值的各种方法，以减少手工评审的次数。本文还分析了这一过程中的两个例外情况。第一种情况是，即使检查结果正常，也要重复检查;第二种情况是，即使根据同一患者过去的检查结果，检查结果异常，也不要重新检查。
{"title":"Application of Knowledge Discovery in Database to Blood Cell Counter Data to Improve Quality Control in Clinical Pathology","authors":"D. Minnie, S. Srinivasan","doi":"10.1109/BIC-TA.2011.49","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.49","url":null,"abstract":"This paper analyzes the functions of an automated blood cell counter from a clinical pathology laboratory and proposes an application of the data preprocessing phase of the Knowledge Discovery in Databases (KDD) processes such as data cleaning, data selection and data transformation on the blood cell counter data to enhance the quality of the system. The blood cell counter data are subjected to a range test normally to ensure quality and then the tests are repeated manually to ensure correctness of the results. The manual procedure is time consuming and hence it is desired to reduce the number of manual reviews. A delta check is performed in some cases to reduce the number of manual reviews and that involves the previous test results of the same patient for the same test. This paper analyzes various ways of finding the delta values of the tests to reduce the number of manual reviews. Two exceptions to the process are also analyzed in this paper. The first case is to repeat the test even when the test result is normal and the second is not to go for retest even if the test results are abnormal based on the past results of the same patient.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122397774","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}
Sticker systems, a computability model introduced by L. Kari et al. (1998) are language generating devices based on the sticker operation. In this paper, a theoretical study about a new class of P system based on the sticker operation has been presented. Such a system has double stranded sequences with sticky ends as objects and sticker operations as evolution rules in its regions. We compare the language generated by this system with regular languages.
{"title":"P Systems Based on Sticker Operations","authors":"V. Masilamani, A. Venkatesan, D. G. Thomas","doi":"10.1109/BIC-TA.2011.52","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.52","url":null,"abstract":"Sticker systems, a computability model introduced by L. Kari et al. (1998) are language generating devices based on the sticker operation. In this paper, a theoretical study about a new class of P system based on the sticker operation has been presented. Such a system has double stranded sequences with sticky ends as objects and sticker operations as evolution rules in its regions. We compare the language generated by this system with regular languages.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121130325","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}
Motivated by the studies on Watson-Crick finite automata and Watson-Crick L systems, we introduce a generative device known as a Watson-Crick context-free system (WKCFS) making use of a complementarity relation and a context-free type of rewriting on double-stranded strings with the symbols in the string in the lower strand complementary to the symbols of the string in the upper strand. The language generated by a WKCFS is the set of all strings in the upper strands of the double-stranded strings (u, v) generated such that the strings u, v are of the same length and the corresponding symbols in the strings u, v are related by the complementarity relation. We compare the generative power of WKCFS with some families of languages and also certain variants of Watson-Crick finite automata.
{"title":"Context-Free Systems with a Complementarity Relation","authors":"K. Subramanian, Ibrahim Venkat, K. Mahalingam","doi":"10.1109/BIC-TA.2011.28","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.28","url":null,"abstract":"Motivated by the studies on Watson-Crick finite automata and Watson-Crick L systems, we introduce a generative device known as a Watson-Crick context-free system (WKCFS) making use of a complementarity relation and a context-free type of rewriting on double-stranded strings with the symbols in the string in the lower strand complementary to the symbols of the string in the upper strand. The language generated by a WKCFS is the set of all strings in the upper strands of the double-stranded strings (u, v) generated such that the strings u, v are of the same length and the corresponding symbols in the strings u, v are related by the complementarity relation. We compare the generative power of WKCFS with some families of languages and also certain variants of Watson-Crick finite automata.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126792982","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}
In this paper a new system called double splicing on hexagonal arrays is introduced. This system is compared with the other existing systems and the closure properties are studied.
{"title":"Double Hexagonal Array Splicing System","authors":"S. Kalavathy, P. H. Chandra","doi":"10.1109/BIC-TA.2011.25","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.25","url":null,"abstract":"In this paper a new system called double splicing on hexagonal arrays is introduced. This system is compared with the other existing systems and the closure properties are studied.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125854215","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}
Y. Yusof, N. Sarmin, T. E. Goode, M. Mahmud, W. Fong
The first mathematical model of a splicing system that was analyzed in the framework of Formal Language Theory was developed in 1987 by Head. This model consists of a finite alphabet, a finite set of initial strings over the alphabet, and a finite set of rules that act upon the strings by iterated cutting and pasting, generating new strings. In this paper, a new notation for writing rules in a splicing system and a new extension of splicing systems is introduced in order to make the biological process transparent. These are called Yusof-Goode rules, and they are associated with Yusof-Goode splicing systems. Four different classes of splicing systems are discussed: null-context, uniform, simple and SkH systems. Also, counterexamples are given to illustrate relationships between these splicing system classes.
{"title":"An Extension of DNA Splicing System","authors":"Y. Yusof, N. Sarmin, T. E. Goode, M. Mahmud, W. Fong","doi":"10.1109/BIC-TA.2011.67","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.67","url":null,"abstract":"The first mathematical model of a splicing system that was analyzed in the framework of Formal Language Theory was developed in 1987 by Head. This model consists of a finite alphabet, a finite set of initial strings over the alphabet, and a finite set of rules that act upon the strings by iterated cutting and pasting, generating new strings. In this paper, a new notation for writing rules in a splicing system and a new extension of splicing systems is introduced in order to make the biological process transparent. These are called Yusof-Goode rules, and they are associated with Yusof-Goode splicing systems. Four different classes of splicing systems are discussed: null-context, uniform, simple and SkH systems. Also, counterexamples are given to illustrate relationships between these splicing system classes.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122800820","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：