{"title":"伪随机数生成的混合DNA细胞自动机","authors":"G. Sirakoulis","doi":"10.1109/HPCSim.2012.6266918","DOIUrl":null,"url":null,"abstract":"During the last decades, certain research emphasis has been placed on building synthetic molecular machinery from DNA. In specific, biological systems in which individual molecules act, singly and in concert, as specialized machines result are called DNA machines. Recently, Autonomous DNA Turing Machines and DNA Cellular Automata were proposed as cellular computing devices that can serve as reusable, compact computing devices to perform (universal) computation. In this paper, we introduce 1-d Hybrid Autonomous DNA Cellular Automata (HADCA), able to run in parallel different CA rules with certain modifications on their molecular implementation and information flow compared to their origins. Moreover, a HADCA simulator was developed to encourage the possible use of the biological inspired computation tool. Finally, it is shown that a proposed 1-d HADCA can generate high-quality random numbers which can pass the statistical tests of DIEHARD, one of the most well known general test suites for randomness. Consequently, such a HADCA can be efficiently implemented for pseudorandom number generation (PRNG) reasons.","PeriodicalId":428764,"journal":{"name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Hybrid DNA Cellular Automata for pseudorandom number generation\",\"authors\":\"G. Sirakoulis\",\"doi\":\"10.1109/HPCSim.2012.6266918\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"During the last decades, certain research emphasis has been placed on building synthetic molecular machinery from DNA. In specific, biological systems in which individual molecules act, singly and in concert, as specialized machines result are called DNA machines. Recently, Autonomous DNA Turing Machines and DNA Cellular Automata were proposed as cellular computing devices that can serve as reusable, compact computing devices to perform (universal) computation. In this paper, we introduce 1-d Hybrid Autonomous DNA Cellular Automata (HADCA), able to run in parallel different CA rules with certain modifications on their molecular implementation and information flow compared to their origins. Moreover, a HADCA simulator was developed to encourage the possible use of the biological inspired computation tool. Finally, it is shown that a proposed 1-d HADCA can generate high-quality random numbers which can pass the statistical tests of DIEHARD, one of the most well known general test suites for randomness. Consequently, such a HADCA can be efficiently implemented for pseudorandom number generation (PRNG) reasons.\",\"PeriodicalId\":428764,\"journal\":{\"name\":\"2012 International Conference on High Performance Computing & Simulation (HPCS)\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on High Performance Computing & Simulation (HPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPCSim.2012.6266918\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on High Performance Computing & Simulation (HPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPCSim.2012.6266918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hybrid DNA Cellular Automata for pseudorandom number generation
During the last decades, certain research emphasis has been placed on building synthetic molecular machinery from DNA. In specific, biological systems in which individual molecules act, singly and in concert, as specialized machines result are called DNA machines. Recently, Autonomous DNA Turing Machines and DNA Cellular Automata were proposed as cellular computing devices that can serve as reusable, compact computing devices to perform (universal) computation. In this paper, we introduce 1-d Hybrid Autonomous DNA Cellular Automata (HADCA), able to run in parallel different CA rules with certain modifications on their molecular implementation and information flow compared to their origins. Moreover, a HADCA simulator was developed to encourage the possible use of the biological inspired computation tool. Finally, it is shown that a proposed 1-d HADCA can generate high-quality random numbers which can pass the statistical tests of DIEHARD, one of the most well known general test suites for randomness. Consequently, such a HADCA can be efficiently implemented for pseudorandom number generation (PRNG) reasons.