| 书目名称 | Unconventional Computation and Natural Computation | | 副标题 | 13th International C | | 编辑 | Oscar H. Ibarra,Lila Kari,Steffen Kopecki | | 视频video | http://file.papertrans.cn/942/941198/941198.mp4 | | 丛书名称 | Lecture Notes in Computer Science | | 图书封面 |  | | 描述 | This book constitutes the refereed proceedings of the 13th International Conference on Unconventional Computation and Natural Computation, UCNC 2014, held in London, ON, Canada, in July 2014. The 31 revised full papers were carefully reviewed and selected from 79 submissions. The papers cover a wide range of topics including among others molecular, quantum, optical and chaos computing as well as neural computation, evolutionary computation, swarm intelligence and computational neuroscience. | | 出版日期 | Conference proceedings 2014 | | 关键词 | amorphous computing; ant algorithms; artificial immune systems; artificial life; cellular (in vivo) comp | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-319-08123-6 | | isbn_softcover | 978-3-319-08122-9 | | isbn_ebook | 978-3-319-08123-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer International Publishing Switzerland 2014 |
| 1 |
Front Matter |
|
|
Abstract
|
| 2 |
,Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Comp |
Artiom Alhazov,Rudolf Freund,Yurii Rogozhin |
|
Abstract
A hybrid network of evolutionary processors (HNEP) is a graph where each node is associated with a special rewriting system called an evolutionary processor, an input filter, and an output filter. Each evolutionary processor is given a finite set of one type of point mutations (insertion, deletion or a substitution of a symbol) which can be applied to certain positions in a string. An HNEP rewrites the strings in the nodes and then re-distributes them according to a filter-based communication protocol; the filters are defined by certain variants of random-context conditions. HNEPs can be considered both as languages generating devices (GHNEPs) and language accepting devices (AHNEPs); most previous approaches treated the accepting and generating cases separately. For both cases, in this paper we improve previous results by showing that five nodes are sufficient to accept (AHNEPs) or generate (GHNEPs) any recursively enumerable language by showing the more general result that any partial recursive relation can be computed by an HNEP with (at most) five nodes.
|
| 3 |
,Learning Two-Input Linear and Nonlinear Analog Functions with a Simple Chemical System, |
Peter Banda,Christof Teuscher |
|
Abstract
The current biochemical information processing systems behave in a pre-determined manner because all features are defined during the design phase. To make such unconventional computing systems reusable and programmable for biomedical applications, adaptation, learning, and self-modification based on external stimuli would be highly desirable. However, so far, it has been too challenging to implement these in wet chemistries. In this paper we extend the chemical perceptron, a model previously proposed by the authors, to function as an analog instead of a binary system. The new analog asymmetric signal perceptron learns through feedback and supports Michaelis-Menten kinetics. The results show that our perceptron is able to learn linear and nonlinear (quadratic) functions of two inputs. To the best of our knowledge, it is the first simulated chemical system capable of doing so. The small number of species and reactions and their simplicity allows for a mapping to an actual wet implementation using DNA-strand displacement or deoxyribozymes. Our results are an important step toward actual biochemical systems that can learn and adapt.
|
| 4 |
,Scaled Tree Fractals Do not Strictly Self-assemble, |
Kimberly Barth,David Furcy,Scott M. Summers,Paul Totzke |
|
Abstract
In this paper, we show that any scaled-up version of any discrete self-similar . fractal does not strictly self-assemble, at any temperature, in Winfree’s abstract Tile Assembly Model.
|
| 5 |
,GUBS a Language for Synthetic Biology: Specification and Compilation, |
Adrien Basso-Blandin,Franck Delaplace |
|
Abstract
The field of synthetic biology is looking forward principles and tools to make the biological devices inter-operable and programmable with, as long-term goal, the design of . synthetic genome [14]..In this endeavour, computer-aided-design (CAD) environments play a central role by providing the required features to engineer systems: specification, analysis, and tuning [9,17,20,12]. Scaling up the complexity of devices necessitates to harness the development of CAD environments based on an automatic conversion of the design specification into DNA sequences, like compilers for programming languages..Currently, domain specific languages for synthetic biology mainly address the design of structure, namely the biological component assembly, where programming relates to DNA sequence description. Although the structural description is an indispensable step in the design-to-manufacture chain and provide an accurate description of devices, the required size of program for sequence description likely makes the task error-prone and infeasible..In this context, high level programming language for synthetic biology is announced as a key milestone for the second wave of synthetic biology to overc
|
| 6 |
,Modeling Syntactic Complexity with P Systems: A Preview, |
Gemma Bel Enguix,Benedek Nagy |
|
Abstract
Membrane systems have been applied to several branches of linguistics, taking advantage of their possibilities when describing contexts and environments. However, not much research has been performed in the field of modeling syntax. The paper introduces a preliminary approach to syntactic complexity using the basic operations of membranes.
|
| 7 |
,Simulating Cancer Growth Using Cellular Automata to Detect Combination Drug Targets, |
Jenna Butler,Frances Mackay,Colin Denniston,Mark Daley |
|
Abstract
Cancer treatment is a fragmented and varied process, as “cancer” is really hundreds of different diseases. The “hallmarks of cancer” were proposed by Hanahan and Weinberg in 2000 and gave a framework for viewing cancer as a single disease - one where cells have acquired ten properties that are common to almost all cancers, allowing them to grow uncontrollably and ravage the body. We used a cellular automata model of tumour growth paired with lattice Boltzmann methods modelling oxygen flow to simulate combination drugs targeted at knocking out pairs of hallmarks. We found that knocking out some pairs of cancer-enabling hallmarks did not prevent tumour formation, while other pairs significantly prevent cancer from growing beyond a few cells (p=0.0004 using Wilcoxon signed-rank adjusted with Bonferroni for multiple comparisons). This is not what would be expected from models of knocking out the hallmarks individually, as many pairs did not have an additive effect but either had no effect or a multiplicative one. We propose that targeting certain pairs of cancer hallmarks, specifically cancer’s ability to induce blood vessel development paired with another cancer hallmark, could prove
|
| 8 |
,Towards an MP Model for B Lymphocytes Maturation, |
Alberto Castellini,Giuditta Franco,Vincenzo Manca,Riccardo Ortolani,Antonio Vella |
|
Abstract
A first dynamical model is given to explain maturation steps of B limphocytic cells in human body, based on Metabolic P systems with genetic regression of regulation maps. In humans, B cell development constitutes the steps that lead to B cell commitment and to expression of surface immunoglobulin, which is essential for B cell survival and function. Mature and fully functional B cells population (CD19+) include phenotypically and functionally different subgroups which persist during all stages of B-cell maturation. Quantities of eight different subgroups of B cells, identified by presence or absence of given receptors, were measured in about six thousands patients of all ages. Here we present a long work of preparation and analysis of (ex-vivo) data, and a preliminary model to explain the eight statistically refined time series, which opened up interesting questions about network inference and methodologies to analyze cross sectional data.
|
| 9 |
,Pseudo-inversion on Formal Languages, |
Da-Jung Cho,Yo-Sub Han,Shin-Dong Kang,Hwee Kim,Sang-Ki Ko,Kai Salomaa |
|
Abstract
We consider the pseudo-inversion operation inspired by a biological event as a result of the partial inversion. We define the pseudo-inversion of a string . = . to consist of all strings ...., where . ≠ . and consider the operation from a formal language theoretic viewpoint. We show that regular languages are closed under the pseudo-inversion operation whereas context-free languages are not. Furthermore, we consider the iterated pseudo-inversion operation and establish the basic properties. Finally, we introduce the pseudo-inversion-freeness and examine closure properties and decidability problems for regular and context-free languages. We establish that pseudo-inversion-freeness is decidable in polynomial time for regular languages and undecidable for context-free languages.
|
| 10 |
,Reverse-Engineering Nonlinear Analog Circuits with Evolutionary Computation, |
Theodore W. Cornforth,Hod Lipson |
|
Abstract
The design of analog circuits by hand is a difficult task, and many successful approaches to automating this design process based on evolutionary computation have been proposed. The fitness evaluations necessary to evolve linear analog circuits are relatively straightforward. However, this is not the case for nonlinear analog circuits, especially for the most general class of design tasks: reverse-engineering an arbitrary nonlinear ‘black box’ circuit. Here, we investigate different approaches to fitness evaluations in this setting. Results show that an incremental algorithm outperforms naive approaches, and that it is possible to evolve robust nonlinear analog circuits with time-domain output behavior that closely matches that of black box circuits for any time-domain input.
|
| 11 |
,Steps toward Developing an Artificial Cell Signaling Model Applied to Distributed Fault Detection, |
Dipankar Dasgupta,Guilherme Costa Silva |
|
Abstract
Cell signaling mechanism provides robust immune response and protects our body from a wide variety of pathogens. This work attempts to develop an artificial signaling model inspired by biological signaling process and derived abstractions. In this paper, we described various aspects of immune cell signaling and their integration towards a system-level response. Based on these abstractions, we synthesized a simple artificial cell signaling model in order to solve fault detection with the objective to provide early detection of faulty system components, as well as the overall analysis of the distributed system.
|
| 12 |
,Dynamic Adaptive Neural Network Array, |
Mark E. Dean,Catherine D. Schuman,J. Douglas Birdwell |
|
Abstract
We present the design-scheme and physical implementation for a Dynamic Adaptive Neural Network Array (DANNA) based upon the work by Schuman and Birdwell [1,2] and using a programmable array of elements constructed with a Field Programmable Gate Array (FPGA). The aim of this paper is to demonstrate how a single programmable neuromorphic element can be designed to support the primary components of a dynamic and adaptive neural network, e.g. a neuron and a synapse, and be replicated across a FPGA to yield a reasonably large programmable DANNA of up to 10,000 neurons and synapses. We describe element programmability, how the dynamic components of a neuron and synapse are supported, and the structure used to support the monitoring and control interface. Finally, we present initial results from simulations of the hardware, the projected performance of the array elements and the physical implementation of a DANNA on a Xilinx FPGA.
|
| 13 |
,Producibility in Hierarchical Self-assembly, |
David Doty |
|
Abstract
Three results are shown on producibility in the hierarchical model of tile self-assembly. It is shown that a simple greedy polynomial-time strategy decides whether an assembly . is producible. The algorithm can be optimized to use .(|.| log. |.|) time. Cannon, Demaine, Demaine, Eisenstat, Patitz, Schweller, Summers, and Winslow [4] showed that the problem of deciding if an assembly . is the unique producible terminal assembly of a tile system . can be solved in . time for the special case of noncooperative “temperature 1” systems. It is shown that this can be improved to . time. Finally, it is shown that if two assemblies are producible, and if they can be overlapped consistently – i.e., if the positions that they share have the same tile type in each assembly – then their union is also producible.
|
| 14 |
,Unconventional Arithmetic: A System for Computation Using Action Potentials, |
Jonathan Edwards,Simon O’Keefe,William D. Henderson |
|
Abstract
This paper examines a scheme to perform arithmetic and logic computation using time delays inspired by neuronal Action Potentials. The method is reliant on a simple abstraction which utilises very little logical infrastructure, in fact, the only requirements necessary to carry out computation are a binary channel, a clock, and a rudimentary instruction look-up table..The conclusions are that the method is viable for all forms of arithmetic and logical computation including comparison, however one practical aspect that hinders a full move to a time delay based architecture is the inability to perform random memory access without waiting for the data to recirculate.
|
| 15 |
,Reservoir Computing Approach to Robust Computation Using Unreliable Nanoscale Networks, |
Alireza Goudarzi,Matthew R. Lakin,Darko Stefanovic |
|
Abstract
As we approach the physical limits of CMOS technology, advances in materials science and nanotechnology are making available a variety of unconventional computing substrates that can potentially replace top-down-designed silicon-based computing devices. Inherent stochasticity in the fabrication process and nanometer scale of these substrates inevitably lead to design variations, defects, faults, and noise in the resulting devices. A key challenge is how to harness such devices to perform robust computation. We propose reservoir computing as a solution. In reservoir computing, computation takes place by translating the dynamics of an excited medium, called a reservoir, into a desired output. This approach eliminates the need for external control and redundancy, and the programming is done using a closed-form regression problem on the output, which also allows concurrent programming using a single device. Using a theoretical model, we show that both regular and irregular reservoirs are intrinsically robust to structural noise as they perform computation.
|
| 16 |
,On DNA-Based Gellular Automata, |
Masami Hagiya,Shaoyu Wang,Ibuki Kawamata,Satoshi Murata,Teijiro Isokawa,Ferdinand Peper,Katsunobu Im |
|
Abstract
We propose the notion of gellular automata and their possible implementations using DNA-based gels. Gellular automata are a kind of cellular automaton in which cells in space are separated by gel materials. Each cell contains a solution with designed chemical reactions whose products dissolve or construct gel walls separating the cells. We first introduce the notion of gellular automata and their computational models. We then give examples of gellular automata and show that computational universality is achieved through the implementation of rotary elements by gellular automata. We finally examine general strategies for implementing gellular automata using DNA-based gels and report results of preliminary experiments.
|
| 17 |
,Doubles and Negatives are Positive (in Self-assembly), |
Jacob Hendricks,Matthew J. Patitz,Trent A. Rogers |
|
Abstract
In the abstract Tile Assembly Model (aTAM), the phenome-non of cooperation occurs when the attachment of a new tile to a growing assembly requires it to bind to more than one tile already in the assembly. Often referred to as “temperature-2” systems, those which employ cooperation are known to be quite powerful (i.e. they are computationally universal and can build an enormous variety of shapes and structures). Conversely, aTAM systems which do not enforce cooperative behavior, a.k.a. “temperature-1” systems, are conjectured to be relatively very weak, likely to be unable to perform complex computations or algorithmically direct the process of self-assembly. Nonetheless, a variety of models based on slight modifications to the aTAM have been developed in which temperature-1 systems are in fact capable of Turing universal computation through a restricted notion of cooperation. Despite that power, though, several of those models have previously been proven to be unable to perform or simulate the stronger form of cooperation exhibited by temperature-2 aTAM systems..In this paper, we first prove that another model in which temperature-1 systems are computationally universal, namely the
|
| 18 |
,On String Languages Generated by Sequential Spiking Neural P Systems Based on Maximum Spike Number, |
Keqin Jiang,Yuzhou Zhang,Linqiang Pan |
|
Abstract
Spiking neural P systems (SN P systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. In this work, we consider SN P systems with the restriction: at each step the neuron with the maximum number of spikes among the neurons that can spike will fire (if there is a tie for the maximum number of spikes stored in the active neurons, only one of the neurons containing the maximum is chosen non-deterministically). We investigate the computational power of such sequential SN P systems that are used as language generators. We prove that recursively enumerable languages can be characterized as projections of inverse-morphic images of languages generated by that sequential SN P systems. The relationships of the languages generated by these sequential SN P systems with finite and regular languages are also investigated.
|
| 19 |
,Languages Associated with Crystallographic Symmetry, |
Nataša Jonoska,Mile Krajcevski,Gregory McColm |
|
Abstract
We establish a relationship between periodic graphs representing crystallographic structures and an infinite hierarchy of intersection languages ., . = 0,1,2,…, within the intersection classes of deterministic context-free languages. We introduce a class of counter machines that accept these languages, where the machines with . counters recognize the class .. Each language in . is an intersection of . languages in .. We prove that there is a one-to-one correspondence between sets of walks starting and ending in the same unit of a .-dimensional periodic (di)graph and the class of languages in ..
|
| 20 |
,An Energy-Efficient Computing Approach by Filling the Connectome Gap, |
Yasunao Katayama,Toshiyuki Yamane,Daiju Nakano |
|
Abstract
This paper presents an energy-efficient neuromorphic computing approach by filling the connectome gap between algorithm, brain, and VLSI. The gap exists in structural features such as the average number of synaptic connections per neural node as well as in dimensional features. We argue that the energy dissipation in complex computing tasks is more predominantly bounded by the control processes that synchronize and redirect both computing processes and data rather than the computing processes themselves. Therefore, it is crucial to fill the connectome gap and to avoid excessive interactions of the computing process and data with the control processes when achieving energy-efficient computing for large-scale cognitive computing tasks. The use of freespace optics is proposed as a means to efficiently handle sparse but still heavily entangled connections.
|
|
|
|Archiver|手机版|小黑屋|
派博传思国际
( 京公网安备110108008328)
GMT+8, 2025-8-13 21:23
发表于 2025-3-21 19:10:53
