Pub Date : 2004-09-13DOI: 10.1007/978-3-540-30220-9_8
A. Ko, H. Lau, T. Lau
{"title":"An Immuno Control Framework for Decentralized Mechatronic Control","authors":"A. Ko, H. Lau, T. Lau","doi":"10.1007/978-3-540-30220-9_8","DOIUrl":"https://doi.org/10.1007/978-3-540-30220-9_8","url":null,"abstract":"","PeriodicalId":54937,"journal":{"name":"International Journal of Unconventional Computing","volume":"1 1","pages":"91-105"},"PeriodicalIF":1.7,"publicationDate":"2004-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91042008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-09-13DOI: 10.1007/978-3-540-30220-9_28
Slavisa Sarafijanovic, J. Boudec
{"title":"An Artificial Immune System for Misbehavior Detection in Mobile Ad-Hoc Networks with Virtual Thymus, Clustering, Danger Signal and Memory Detectors","authors":"Slavisa Sarafijanovic, J. Boudec","doi":"10.1007/978-3-540-30220-9_28","DOIUrl":"https://doi.org/10.1007/978-3-540-30220-9_28","url":null,"abstract":"","PeriodicalId":54937,"journal":{"name":"International Journal of Unconventional Computing","volume":"115 1","pages":"221-254"},"PeriodicalIF":1.7,"publicationDate":"2004-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79365887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Biomolecular Computation(BMC) is computation at the molecular scale, using biotechnology engineering techniques. Most proposed methods for BMC used distributed (molecular) parallelism (DP); where operations are executed in parallel on large numbers of distinct molecules. BMC done exclusively by DP requires that the computation execute sequentially within any given molecule (though done in parallel for multiple molecules). In contrast, local parallelism (LP) allows operations to be executed in parallel on each given molecule. Winfree, et al [W96, WYS96]) proposed an innovative method for LPBMC, that of computation by unmediated self-assembly of 2D arrays of DNA molecules, applying known domino tiling techniques (see Buchi [B62], Berger [B66], Robinson [R71], and Lewis and Papadimitriou [LP81]) in combination with the DNA self-assembly techniques of Seeman et al [SZC94]. We develop improved techniques to more fully exploit the potential power of LP-BMC. we propose a refined step-wise assembly method, which provides control of the assembly in distinct steps. Step-wise assembly may increase the likelihood of success of assembly, decrese the number of tiles required, and provide additional control of the assembly process. The assembly depth is the number of stages of assembly required and the assembly size is the number of tiles required. We also introduce the assembly frame, a rigid nanostructure which binds the input DNA strands in place on its boundaries and constrains the shape of the assembly. Our main results are LP-BMC algorithms for some fundamental problems that form the basis of many parallel computations. For these problems we decrease the assembly size to linear in the input size and and significantly decrease the assembly depth. We give LP-BMC algorithms with linear assembly size and logarithmic assembly depth, for the parallel prefix computation problems, which include integer addition, subtraction, multiplication by a constant number, finite state automata simulation, and ∗A preliminary version of this paper appeared in Proc. DNA-Based Computers, III: University of Pennsylvania, June 23-26, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, H. Rubin and D. H. Wood, editors. American Mathematical Society, Providence, RI, vol. 48, 1999, pp. 217-254. †Department of Computer Science, Duke University, Durham, NC , USA and Adjunct, King Abdulaziz University (KAU), Jeddah, Saudi Arabia
生物分子计算(BMC)是利用生物技术工程技术在分子尺度上进行的计算。大多数提出的BMC方法采用分布式(分子)并行(DP);对大量不同的分子并行执行操作。仅由DP完成的BMC要求在任何给定的分子中依次执行计算(尽管对多个分子并行执行)。相反，局部并行(LP)允许在每个给定分子上并行执行操作。Winfree等[W96, WYS96])提出了一种LPBMC的创新方法，即利用已知的多米诺骨牌平铺技术(参见Buchi [B62]， Berger [B66]， Robinson [R71]， and Lewis and Papadimitriou [LP81])结合Seeman等[SZC94]的DNA自组装技术，通过DNA分子二维阵列的无介导自组装进行计算。我们开发改进的技术，以更充分地利用LP-BMC的潜在力量。我们提出了一种改进的分步装配方法，它提供了不同步骤的装配控制。分步装配可以增加装配成功的可能性，减少所需瓷砖的数量，并提供对装配过程的额外控制。装配深度是所需装配阶段的数量，装配尺寸是所需瓷砖的数量。我们还介绍了组装框架，这是一种刚性纳米结构，可以将输入DNA链固定在其边界上，并限制组装的形状。我们的主要成果是LP-BMC算法的一些基本问题，形成了许多并行计算的基础。针对这些问题，我们将装配尺寸减小到输入尺寸的线性，并显著减小装配深度。我们给出线性装配尺寸和对数装配深度的LP-BMC算法，用于并行前缀计算问题，包括整数加法、减法、常数乘法、有限状态自动机模拟和*。本文的初步版本发表在Proc. DNA-Based Computers, III: University of Pennsylvania, 1997年6月23-26日。离散数学和理论计算机科学中的DIMACS系列，H. Rubin和D. H. Wood，编辑。美国数学学会，普罗维登斯，RI, vol. 48, 1999, pp. 217-254。†美国北卡罗来纳州达勒姆杜克大学计算机科学系和沙特阿拉伯吉达阿卜杜勒阿齐兹国王大学(KAU)附属系
{"title":"Local Parallel Biomolecular Computation","authors":"J. Reif","doi":"10.1090/dimacs/048/17","DOIUrl":"https://doi.org/10.1090/dimacs/048/17","url":null,"abstract":"Biomolecular Computation(BMC) is computation at the molecular scale, using biotechnology engineering techniques. Most proposed methods for BMC used distributed (molecular) parallelism (DP); where operations are executed in parallel on large numbers of distinct molecules. BMC done exclusively by DP requires that the computation execute sequentially within any given molecule (though done in parallel for multiple molecules). In contrast, local parallelism (LP) allows operations to be executed in parallel on each given molecule. Winfree, et al [W96, WYS96]) proposed an innovative method for LPBMC, that of computation by unmediated self-assembly of 2D arrays of DNA molecules, applying known domino tiling techniques (see Buchi [B62], Berger [B66], Robinson [R71], and Lewis and Papadimitriou [LP81]) in combination with the DNA self-assembly techniques of Seeman et al [SZC94]. We develop improved techniques to more fully exploit the potential power of LP-BMC. we propose a refined step-wise assembly method, which provides control of the assembly in distinct steps. Step-wise assembly may increase the likelihood of success of assembly, decrese the number of tiles required, and provide additional control of the assembly process. The assembly depth is the number of stages of assembly required and the assembly size is the number of tiles required. We also introduce the assembly frame, a rigid nanostructure which binds the input DNA strands in place on its boundaries and constrains the shape of the assembly. Our main results are LP-BMC algorithms for some fundamental problems that form the basis of many parallel computations. For these problems we decrease the assembly size to linear in the input size and and significantly decrease the assembly depth. We give LP-BMC algorithms with linear assembly size and logarithmic assembly depth, for the parallel prefix computation problems, which include integer addition, subtraction, multiplication by a constant number, finite state automata simulation, and ∗A preliminary version of this paper appeared in Proc. DNA-Based Computers, III: University of Pennsylvania, June 23-26, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, H. Rubin and D. H. Wood, editors. American Mathematical Society, Providence, RI, vol. 48, 1999, pp. 217-254. †Department of Computer Science, Duke University, Durham, NC , USA and Adjunct, King Abdulaziz University (KAU), Jeddah, Saudi Arabia","PeriodicalId":54937,"journal":{"name":"International Journal of Unconventional Computing","volume":"68 1","pages":"217-254"},"PeriodicalIF":1.7,"publicationDate":"1997-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76210727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In 2121 humans finally took control of the last aspect of their lives in the face of which they had so far remained helpless. I am speaking of time. Time, which had always dominated and regulated our day to day existence, is no longer our master. Today, we can travel backward in time and we can travel forward in time. We can go to the past and visit our ancestors. We can go to the future and meet our descendents. Time has lost its grip on our destiny. Free from time’s tyranny we can do amazing things. The range of possibilities is unfathomable. The consequences are far reaching. Information and computation are the richer.
{"title":"Time: The Final Frontier","authors":"S. Akl","doi":"10.2307/j.ctv6gqq4n.14","DOIUrl":"https://doi.org/10.2307/j.ctv6gqq4n.14","url":null,"abstract":"In 2121 humans finally took control of the last aspect of their lives in the face of which they had so far remained helpless. I am speaking of time. Time, which had always dominated and regulated our day to day existence, is no longer our master. Today, we can travel backward in time and we can travel forward in time. We can go to the past and visit our ancestors. We can go to the future and meet our descendents. Time has lost its grip on our destiny. Free from time’s tyranny we can do amazing things. The range of possibilities is unfathomable. The consequences are far reaching. Information and computation are the richer.","PeriodicalId":54937,"journal":{"name":"International Journal of Unconventional Computing","volume":"32 1","pages":"273-281"},"PeriodicalIF":1.7,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81543111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：