434,394 research outputs found
Characterizing Self-Developing Biological Neural Networks: A First Step Towards their Application To Computing Systems
Carbon nanotubes are often seen as the only alternative technology to silicon
transistors. While they are the most likely short-term one, other longer-term
alternatives should be studied as well. While contemplating biological neurons
as an alternative component may seem preposterous at first sight, significant
recent progress in CMOS-neuron interface suggests this direction may not be
unrealistic; moreover, biological neurons are known to self-assemble into very
large networks capable of complex information processing tasks, something that
has yet to be achieved with other emerging technologies. The first step to
designing computing systems on top of biological neurons is to build an
abstract model of self-assembled biological neural networks, much like computer
architects manipulate abstract models of transistors and circuits. In this
article, we propose a first model of the structure of biological neural
networks. We provide empirical evidence that this model matches the biological
neural networks found in living organisms, and exhibits the small-world graph
structure properties commonly found in many large and self-organized systems,
including biological neural networks. More importantly, we extract the simple
local rules and characteristics governing the growth of such networks, enabling
the development of potentially large but realistic biological neural networks,
as would be needed for complex information processing/computing tasks. Based on
this model, future work will be targeted to understanding the evolution and
learning properties of such networks, and how they can be used to build
computing systems
Spiking Neural P Systems with Addition/Subtraction Computing on Synapses
Spiking neural P systems (SN P systems, for short) are a class of distributed
and parallel computing models inspired from biological spiking neurons. In this paper,
we introduce a variant called SN P systems with addition/subtraction computing on
synapses (CSSN P systems). CSSN P systems are inspired and motivated by the shunting
inhibition of biological synapses, while incorporating ideas from dynamic graphs and
networks. We consider addition and subtraction operations on synapses, and prove that
CSSN P systems are computationally universal as number generators, under a normal
form (i.e. a simplifying set of restrictions)
Biological computing using perfusion anodophile biofilm electrodes (PABE)
This paper presents a theoretical approach to biological computing, using biofilm electrodes by illustrating a simplified Pavlovian learning model. The theory behind this approach was based on empirical data produced from a prototype version of these units, which illustrated high stability. The implementation of this system into the Pavlovian learning model, is one example and possibly a first step in illustrating, and at the same time discovering its potential as a computing processor. © 2007 Old City Publishing, Inc
Parallel computing and molecular dynamics of biological membranes
In this talk I discuss the general question of the portability of Molecular
Dynamics codes for diffusive systems on parallel computers of the APE family.
The intrinsic single precision arithmetics of the today available APE platforms
does not seem to affect the numerical accuracy of the simulations, while the
absence of integer addressing from CPU to individual nodes puts strong
constraints on the possible programming strategies. Liquids can be very
satisfactorily simulated using the "systolic" method. For more complex systems,
like the biological ones at which we are ultimately interested in, the "domain
decomposition" approach is best suited to beat the quadratic growth of the
inter-molecular computational time with the number of elementary components of
the system. The promising perspectives of using this strategy for extensive
simulations of lipid bilayers are briefly reviewed.Comment: 4 pages LaTeX, 2 figures included, espcrc2.sty require
When the path is never shortest: a reality check on shortest path biocomputation
Shortest path problems are a touchstone for evaluating the computing
performance and functional range of novel computing substrates. Much has been
published in recent years regarding the use of biocomputers to solve minimal
path problems such as route optimisation and labyrinth navigation, but their
outputs are typically difficult to reproduce and somewhat abstract in nature,
suggesting that both experimental design and analysis in the field require
standardising. This chapter details laboratory experimental data which probe
the path finding process in two single-celled protistic model organisms,
Physarum polycephalum and Paramecium caudatum, comprising a shortest path
problem and labyrinth navigation, respectively. The results presented
illustrate several of the key difficulties that are encountered in categorising
biological behaviours in the language of computing, including biological
variability, non-halting operations and adverse reactions to experimental
stimuli. It is concluded that neither organism examined are able to efficiently
or reproducibly solve shortest path problems in the specific experimental
conditions that were tested. Data presented are contextualised with biological
theory and design principles for maximising the usefulness of experimental
biocomputer prototypes.Comment: To appear in: Adamatzky, A (Ed.) Shortest path solvers. From software
to wetware. Springer, 201
Autonomic computing architecture for SCADA cyber security
Cognitive computing relates to intelligent computing platforms that are based on the disciplines of artificial intelligence, machine learning, and other innovative technologies. These technologies can be used to design systems that mimic the human brain to learn about their environment and can autonomously predict an impending anomalous situation. IBM first used the term ‘Autonomic Computing’ in 2001 to combat the looming complexity crisis (Ganek and Corbi, 2003). The concept has been inspired by the human biological autonomic system. An autonomic system is self-healing, self-regulating, self-optimising and self-protecting (Ganek and Corbi, 2003). Therefore, the system should be able to protect itself against both malicious attacks and unintended mistakes by the operator
- …