Skip to main content

Natural Computing OnlineFirst articles


A binary monkey search algorithm variation for solving the set covering problem

In complexity theory, there is a widely studied grouping of optimization problems that belongs to the non-deterministic polynomial-time hard set. One of them is the set covering problem, known as one of Karp’s 21 $${\mathscr {NP}}$$ NP -complete …

Broderick Crawford, Ricardo Soto, Rodrigo Olivares, Gabriel Embry, Diego Flores, Wenceslao Palma, Carlos Castro, Fernando Paredes, José-Miguel Rubio


Integrated probability multi-search and solution acceptance rule-based artificial bee colony optimization scheme for web service composition

Web service composition is considered as the hottest and potential research area in the domain of Service Oriented Architecture since the users focus on Quality of Service (QoS) and transaction properties included in the integration of services.

N. Arunachalam, A. Amuthan


Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations

This work is a thoughtful extension of the ideas sketched in Montalva et al. (AUTOMATA 2017 exploratory papers proceedings, 2017), aiming at classifying elementary cellular automata (ECA) according to their maximal one-step sensitivity to changes …

Kévin Perrot, Marco Montalva-Medel, Pedro P. B. de Oliveira, Eurico L. P. Ruivo


Self-assembly of 3-D structures using 2-D folding tiles

Self-assembly is a process which is ubiquitous in natural, especially biological systems. It occurs when groups of relatively simple components spontaneously combine to form more complex structures. While such systems have inspired a large amount …

Jérôme Durand-Lose, Jacob Hendricks, Matthew J. Patitz, Ian Perkins, Michael Sharp


UCNC 2018 special issue editorial

Susan Stepney, Sergey Verlan


Concurrency in Boolean networks

Boolean networks (BNs) are widely used to model the qualitative dynamics of biological systems. Besides the logical rules determining the evolution of each component with respect to the state of its regulators, the scheduling of component updates …

Thomas Chatain, Stefan Haar, Juraj Kolčák, Loïc Paulevé, Aalok Thakkar


Bionic vision system and its application in license plate recognition

Conventional computer vision systems detect object after super-resolution (SR) or image reconstruction of the whole image, which is not an economical manner. By imitating the visual system of human beings, we proposed the bionic vision system …

Zhenjie Yao, Weidong Yi


Cooperative search method for multiple AUVs based on target clustering and path optimization

A search method for uncertain targets using multiple autonomous underwater vehicles (AUVs) is studied. To improve search efficiency, a cooperative search method based on target clustering and path optimization is proposed to reduce reactive …

Haifeng Ling, Tao Zhu, Weixiong He, Zhanliang Zhang, Hongchuan Luo

01.06.2019 Open Access

Sequentializing cellular automata

We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be written as a …

Jarkko Kari, Ville Salo, Thomas Worsch


Computational completeness of simple semi-conditional insertion–deletion systems of degree (2,1)

Insertion–deletion (or ins–del for short) systems are simple models of bio-inspired computing. They are well studied in formal language theory, especially regarding their computational completeness. This concerns the question if all recursively …

Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman



Matthew Cook, Turlough Neary


A class of discrete dynamical systems with properties of both cellular automata and L-systems

We introduce and explore a type of discrete dynamic system inheriting some properties of both cellular automata (CA) and L-systems. Originally suggested by Jean Della Dora, and thus called DEM-systems after him and the two current authors, these …

Roderick Edwards, Aude Maignan


Perturbations and phase transitions in swarm optimization algorithms

Natural systems often exhibit chaotic behavior in their space-time evolution. Systems transiting between chaos and order manifest a potential to compute, as shown with cellular automata and artificial neural networks. We demonstrate that swarm …

Tomáš Vantuch, Ivan Zelinka, Andrew Adamatzky, Norbert Marwan


Optimal staged self-assembly of linear assemblies

We analyze the complexity of building linear assemblies, sets of linear assemblies, and $${\mathcal{O}}(1)$$ O ( 1 ) -scale general shapes in the staged tile assembly model. For systems with at most b bins and t tile types, we prove that the …

Cameron Chalk, Eric Martinez, Robert Schweller, Luis Vega, Andrew Winslow, Tim Wylie

24.04.2019 Open Access

The alchemy of computation: designing with the unknown

Modern computers allow a methodical search of possibly billions of experiments and the exploitation of interactions that are not known in advance. This enables a bottom-up process of design by assembling or configuring systems and testing the …

Julian Francis Miller


Quantum information processing in the neighborhood of a black hole

Using an imperfectly prepared state, we show that in relativistic settings, the evolution of a massive spin-1/2 particle violates many standard assumptions made in quantum information theory, including complete positivity. Unlike other recent …

Tanner Crowder, Marco Lanzagorta


Molecular computing for Markov chains

In this paper, it is presented a methodology for implementing arbitrarily constructed time-homogenous Markov chains with biochemical systems. Not only discrete but also continuous-time Markov chains are allowed to be computed. By employing …

Chuan Zhang, Ziyuan Shen, Wei Wei, Jing Zhao, Zaichen Zhang, Xiaohu You


Adaptive CCR-ELM with variable-length brain storm optimization algorithm for class-imbalance learning

Class-specific cost regulation extreme learning machine (CCR-ELM) can effectively deal with the class imbalance problems. However, its key parameters, including the number of hidden nodes, the input weights, the biases and the tradeoff factors are …

Jian Cheng, Jingjing Chen, Yi-nan Guo, Shi Cheng, Linkai Yang, Pei Zhang


A proposal of quantum data representation to improve the discrimination power

This work proposes a quantum representation for improvement of data discrimination power, transforming a non linearly separable problem into a linearly separable problem. This methodology proposed here can be naturally employed as data …

Rosilda B. de Sousa, Emeson J. S. Pereira, Marina P. Cipolletti, Tiago A. E. Ferreira


Generation and robustness of Boolean networks to model Clostridium difficile infection

One of the more common healthcare associated infection is Chronic diarrhea. This disease is caused by the bacterium Clostridium difficile which alters the normal composition of the human gut flora. The most successful therapy against this …

Dante Travisany, Eric Goles, Mauricio Latorre, María-Paz Cortés, Alejandro Maass