Membrane computing
View article
Simplified and Yet Turing Universal Spiking Neural P Systems with Communication on Request Open
Spiking neural P systems are a class of third generation neural networks belonging to the framework of membrane computing. Spiking neural P systems with communication on request (SNQ P systems) are a type of spiking neural P system where t…
View article
An Adaptive Optimization Spiking Neural P System for Binary Problems Open
Optimization Spiking Neural P System (OSNPS) is the first membrane computing model to directly derive an approximate solution of combinatorial problems with a specific reference to the 0/1 knapsack problem. OSNPS is composed of a family of…
View article
A Survey of Nature-Inspired Computing Open
Nature-inspired computing is a type of human-designed computing motivated by nature, which is based on the employ of paradigms, mechanisms, and principles underlying natural systems. In this article, a versatile and vigorous bio-inspired b…
View article
P Systems with Active Membranes and Separation Rules Open
The P systems are a class of distributed parallel computing devices
\nof a biochemical type. In this paper, a new de¯nition of separation rules in
\nP systems with active membranes is given. Under the new de¯nition, the
\ne±ciency and univ…
View article
An Overview of Hardware Implementation of Membrane Computing Models Open
The model of membrane computing, also known under the name of P systems, is a bio-inspired large-scale parallel computing paradigm having a good potential for the design of massively parallel algorithms. For its implementation it is very n…
View article
A membrane parallel rapidly-exploring random tree algorithm for robotic motion planning Open
In recent years, incremental sampling-based motion planning algorithms have been widely used to solve robot motion planning problems\n\t\t\t\t in high-dimensional configuration spaces. In particular, the Rapidly-exploring Random Tree (RRT)…
View article
An Improved Apriori Algorithm Based on an Evolution-Communication Tissue-Like P System with Promoters and Inhibitors Open
Apriori algorithm, as a typical frequent itemsets mining method, can help researchers and practitioners discover implicit associations from large amounts of data. In this work, a fast Apriori algorithm, called ECTPPI-Apriori, for processin…
View article
The Computational Complexity of Tissue P Systems with Evolutional Symport/Antiport Rules Open
Tissue P systems with evolutional communication (symport/antiport) rules are computational models inspired by biochemical systems consisting of multiple individuals living and cooperating in a certain environment, where objects can be modi…
View article
UPSimulator: A general P system simulator Open
In membrane computing, researchers have designed various P systems to solve problems, for example, NP-hard problems. The research of verification methods and simulation tools for these P systems is one of the main topics in membrane comput…
View article
Fuzzy Membrane Computing: Theory and Applications Open
Fuzzy membrane computing is a newly developed and promising research direction in the area of membrane computing that aims at exploring the complex in- teraction between membrane computing and fuzzy theory. This paper provides a comprehens…
View article
Spike Neural Network Learning Algorithm Based on an Evolutionary Membrane Algorithm Open
As one of the important artificial intelligence fields, brain-like computing attempts to give machines a higher intelligence level by studying and simulating the cognitive principles of the human brain. Compared with the traditional neural…
View article
Solution to PSPACE‐Complete Problem Using P Systems with Active Membranes with Time‐Freeness Open
P systems with active membranes are powerful parallel natural computing models, which were inspired by cell structure and behavior. Inspired by the parallel processing of biological information and with the idealistic assumption that each …
View article
MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem Open
Since the membrane algorithm was proposed, it has been used for many optimization problems such as, traveling salesman problem, the knapsack problem, and so on. In membrane algorithms, the membranes have two functions: container and compar…
View article
A Cluster Splitting Technique by Hopfield Networks and P Systems on Simplices Open
In this paper we propose a new graph based P system. The main feature of graph P system is that membrane compartments spread on edges as well as on vertices. These two kinds of compartments are topologically connected with certain communic…
View article
MEATSP: A Membrane Evolutionary Algorithm for Solving TSP Open
In recent years, heuristic intelligent algorithms have achieved rapid development in solving combinatorial optimization problems. Travelling salesman problem(TSP) is one of the classical NP-hard problems in combinatorial optimization, and …
View article
DNA Computing: Principle, Construction, and Applications in Intelligent Diagnostics Open
DNA Computing DNA computing can integrate the functions of nucleic acids as biomolecules that recognize biomarkers with their ability to analyze and perform computational functions. In article number 2100051 by Da Han, Weihong Tan, and co-…
View article
Simulation of Rapidly-Exploring Random Trees in Membrane Computing with P-Lingua and Automatic Programming Open
Methods based on Rapidly-exploring Random Trees (RRTs) have been widely used in robotics to solve motion planning problems. On the other hand, in the membrane computing framework, models based on Enzymatic Numerical P systems (ENPS) have b…
View article
Mobile Ambients and P-Systems Open
The mobile ambients and the P-systems are models developed in different areas of computer science, based on very similar concepts and structures. Given their resemblance, we point out how to transfer ideas and results from one framework to…
View article
Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division Open
Membrane computing is a kind of distributed and parallel computing model inspired by a biological cell mechanism. The maximum parallelism of membrane computing improves the computational efficiency of its computational model. In this paper…
View article
Local Synchronization on Asynchronous Tissue P Systems With Symport/Antiport Rules Open
Asynchronous tissue P systems with symport/antiport rules are a class of parallel computing models inspired by cell tissue working in a non-synchronized way, where the use of rules is not obligatory, that is, at a computation step, an enab…
View article
A new P-Lingua toolkit for agile development in membrane computing Open
Membrane computing is a massively parallel and non-deterministic bioinspired computing paradigm whose models are called P systems. Validating and testing such models is a challenge which is being overcome by developing simulators. Regardle…
View article
MEAMCP: A Membrane Evolutionary Algorithm for Solving Maximum Clique Problem Open
The maximum clique problem (MCP) is a classical NP-hard problem in combinatorial optimization, which has important applications in many fields. In this paper, a heuristic algorithm MEAMCP based on Membrane Evolutionary Algorithm (MEA) is p…
View article
QEAM: An Approximate Algorithm Using P Systems with Active Membranes Open
This paper proposes an approximate optimization approach, called QEAM, which combines a P system with active membranes and a quantum-inspired evolutionary algorithm. QEAM uses the hierarchical arrangement of the compartments and developmen…
View article
An asynchronous P system with branch and bound for solving the satisfiability problem Open
Membrane computing, which is a computational model based on cell activity, has considerable attention as one of new paradigms of computations. In the general membrane computing, computationally hard problems have been solved in a polynomia…
View article
A Resolution-Free Parallel Algorithm for Image Edge Detection within the Framework of Enzymatic Numerical P Systems Open
Image edge detection is a fundamental problem in image processing and computer vision, particularly in the area of feature extraction. However, the time complexity increases squarely with the increase of image resolution in conventional se…
View article
An improved DBSCAN algorithm based on cell-like P systems with promoters and inhibitors Open
Density-based spatial clustering of applications with noise (DBSCAN) algorithm can find clusters of arbitrary shape, while the noise points can be removed. Membrane computing is a novel research branch of bio-inspired computing, which seek…
View article
Multi-Agent Decision Making System based on Membrane Computing Open
This paper presents certain results obtained in the domain of applying Membrane Computing models in the modeling and designing of Multi-Agent systems for decision making. The presented results highlight the method of presenting the topolog…
View article
Timed Homeostasis Tissue-Like P Systems With Evolutional Symport/Antiport Rules Open
Tissue-like P systems are a type of distributed parallel computing models inspired by actual biological tissue. In this paper, we consider a new variant of tissue-like P systems, which is called tissue-like P systems with evolutional sympo…
View article
Polarizationless P Systems with Active Membranes: Computational Complexity Aspects Open
P systems with active membranes, in their classical definition, make use of non-cooperative rules only. However, it is well known that in living cells, proteins interact %between themselves among them yielding new products. Inspired by thi…
View article
A Novel Clustering Algorithm Inspired by Membrane Computing Open
P systems are a class of distributed parallel computing models; this paper presents a novel clustering algorithm, which is inspired from mechanism of a tissue‐like P system with a loop structure of cells, called membrane clustering algorit…