BWMC2017: Brainstorming Week on Membrane Computing (15th. 2017. Sevilla)

URI permanente para esta colecciónhttps://hdl.handle.net/11441/55974

Examinar

Mostrando 1 - 3 de 3

Restricted Polarizationless P Systems with Active Membranes: Minimal Cooperation Only Inwards
(Fenix Editora, 2017) Valencia Cabrera, Luis; Orellana Martín, David; Martínez del Amor, Miguel Ángel; Riscos Núñez, Agustín; Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
Membrane computing is a computing paradigm providing a class of distributed parallel computing devices of a biochemical type whose process units represent biological membranes. In the cell-like basic model, a hierarchical membrane structure formally described by a rooted tree is considered. It is well known that families of such systems where the number of membranes can only decrease during a computation (for instance by dissolving membranes), can only solve in polynomial time problems in class P. P systems with active membranes is a variant where membranes play a central role in their dynamics. In the seminal version, membranes have an electrical polarization (positive, negative, or neutral) associated in any instant, and besides being dissolved, they can also replicate by using division rules. These systems are computationally universal, that is, equivalent in power to deterministic Turing machines, and computationally effi cient, that is, able to solve computationally hard problems in polynomial time. If polarizations in membranes are removed and dissolution rules are forbidden, then only problems in class P can be solved in polynomial time by these systems (even in the case when division rules for non-elementary membranes are permitted). In that framework it has been shown that by considering minimal cooperation (left-hand side of such rules consists of at most two symbols) and minimal production (only one object is produced by the application of such rules) in object evolution rules, such systems provide effi cient solutions to NP{complete problems. In this paper, minimal cooperation and minimal production in communication rules instead of object evolution rules is studied, and the computational e fficiency of these systems is obtained in the case where division rules for non-elementary membranes are permitted.
Restricted Polarizationless P Systems with Active Membranes: Minimal Cooperation Only Outwards
(Fenix Editora, 2017) Valencia Cabrera, Luis; Orellana Martín, David; Martínez del Amor, Miguel Ángel; Riscos Núñez, Agustín; Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
Membrane computing is a computing paradigm providing a class of distributed parallel computing devices of a biochemical type whose process units represent biological membranes. In the cell-like basic model, a hierarchical membrane structure formally described by a rooted tree is considered. It is well known that families of such systems where the number of membranes can only decrease during a computation (for instance by dissolving membranes), can only solve in polynomial time problems in class P. P systems with active membranes is a variant where membranes play a central role in their dynamics. In the seminal version, membranes have an electrical polarization (positive, negative, or neutral) associated in any instant, and besides being dissolved, they can also replicate by using division rules. These systems are computationally universal, that is, equivalent in power to deterministic Turing machines, and computationally e fficient, that is, able to solve computationally hard problems in polynomial time. If polarizations in membranes are removed and dissolution rules are forbidden, then only problems in class P can be solved in polynomial time by these systems (even in the case when division rules for non-elementary membranes are permitted). In that framework it has been shown that by considering minimal cooperation (left-hand side of such rules consists of at most two symbols) and minimal production (only one object is produced by the application of such rules) in object evolution rules, such systems provide e cient solutions to NP{complete problems. In this paper, minimal cooperation and minimal production in communication rules instead of object evolution rules is studied, and the computational e fficiency of these systems is obtained in the case where division rules for non-elementary membranes are permitted.
Sparse-matrix Representation of Spiking Neural P Systems for GPUs
(Fenix Editora, 2017) Martínez del Amor, Miguel Ángel; Orellana Martín, David; Cabarle, Francis George C.; Pérez Jiménez, Mario de Jesús; Adorna, Henry N.; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
Current parallel simulation algorithms for Spiking Neural P (SNP) systems are based on a matrix representation. This helps to harness the inherent parallelism in algebraic operations, such as vector-matrix multiplication. Although it has been convenient for the rst parallel simulators running on Graphics Processing Units (GPUs), such as CuSNP, there are some bottlenecks to cope with. For example, matrix representation of SNP systems with a low-connectivity-degree graph lead to sparse matrices, i.e. containing more zeros than actual values. Having to deal with sparse matrices downgrades the performance of the simulators because of wasting memory and time. However, sparse matrices is a known problem on parallel computing with GPUs, and several solutions and algorithms are available in the literature. In this paper, we brie y analyse some of these ideas and apply them to represent some variants of SNP systems. We also conclude which variant better suit a sparse-matrix representation.

Examinar

Examinando BWMC2017: Brainstorming Week on Membrane Computing (15th. 2017. Sevilla) por Autor "Martínez del Amor, Miguel Ángel"