BWMC2014. Brainstorming Week on Membrane Computing (12th. 2014. Sevilla)

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

Examinar

Mostrando 1 - 20 de 26

Twelfth Brainstorming Week on Membrane Computing Sevilla, February 3-7, 2014: RGNC REPORT 1/2014
(Fénix Editora, 2014) Macías Ramos, Luis Felipe; Martínez del Amor, Miguel Ángel; Paun, Gheorghe; Riscos Núñez, Agustín; Valencia Cabrera, Luis; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Research Group on Natural Computing; Universidad de Sevilla. TIC193: Computación Naturalo
The Stochastic Loss of Spikes in Spiking Neural P Systems: Design and Implementation of Reliable Arithmetic Circuits
(Fénix Editora, 2014) Xu, Zihan; Cavaliere, Matteo; An, Pei; Vrudhula, Sarma; Cao, Yu
Spiking neural P systems (in short, SN P systems) have been introduced as computing devices inspired by the structure and functioning of neural cells. The presence of unreliable components in SN P systems can be considered in many di erent aspects. In this paper we focus on two types of unreliability: the stochastic delays of the spiking rules and the stochastic loss of spikes. We propose the implementation of elementary SN P systems with DRAM-based CMOS circuits that are able to cope with these two forms of unreliability in an e cient way. The constructed bio-inspired circuits can be used to encode basic arithmetic modules.
Application of Weighted Fuzzy Reasoning Spiking Neural P Systems to Fault Diagnosis in Traction Power Supply Systems of High-speed Railways
(Fénix Editora, 2014) Wang, Tao; Zhang, Gexiang; Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Economía y Competitividad (MINECO). España; Universidad de Sevilla. TIC193: Computación Natural
This paper discusses the application of weighted fuzzy reasoning spiking neu- ral P systems (WFRSN P systems) to fault diagnosis in traction power supply systems (TPSSs) of China high-speed railways. Four types of neurons are considered in WFRSN P systems to make them suitable for expressing status information of protective relays and circuit breakers, and a weighted matrix-based reasoning algorithm (WMBRA) is intro- duced to fulfill the reasoning based on the status information to obtain fault confidence levels of faulty sections. Fault diagnosis production rules in TPSSs and their WFRSN P system models are proposed to show how to use WFRSN P systems to describe different kinds of fault information. Building processes of fault diagnosis models for sections and fault region identification of feeding sections, and parameter setting of the models are described in detail. Case studies including normal power supply and over zone feeding show the effectiveness of the presented method.
Membrane Clustering: A Novel Clustering Algorithm under Membrane Computing
(Fénix Editora, 2014) Peng, Hong; Zhang, Jiarong; Wang, Jun; Wang, Tao; Pérez Jiménez, Mario de Jesús; Riscos Núñez, Agustín; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
Membrane computing (known as P systems) is a class of distributed parallel computing models, this paper presents a novel algorithm under membrane computing for solving the data clustering problem, called as membrane clustering algorithm. The clustering algorithm is based on a tissue-like P system with a loop structure of cells. The objects of the cells express the candidate cluster centers and are evolved by the evolution rules. Based on the loop membrane structure, the communication rules realize a local neighborhood topology, which helps the co-evolution of the objects and improves the diversity of objects in the system. The tissue-like P system can effectively search for the optimal clustering partition with the help of its parallel computing advantage. The proposed clustering algorithm is evaluated on four artificial data sets and six real-life data sets. Experimental results show that the proposed clustering algorithm is superior or competitive to classical k-means algorithm and several evolutionary clustering algorithms recently reported in the literature.
Four (Somewhat Nonstandard) Research Topics
(Fénix Editora, 2014) Paun, Gheorghe; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
Four research directions are suggested, dealing with the following four main ideas: computing along the axon (up to now, this topic was only preliminarily investi- gated), using pre-computed resources in order to solve computationally hard problems, considering in P systems both objects \of matter" and \of anti-matter" (which annihilate each other when meet), and considering the distance (naturally de ned in a membrane structure of a given type) as a support of information.
On Parallel Array P Systems
(Fénix Editora, 2014) Pan, Linqiang; Paun, Gheorghe; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
We further investigate the parallel array P systems recently introduced by K.G. Subramanian, P. Isawasan, I. Venkat, and L. Pan. We rst make explicit several classes of parallel array P systems (with one or more axioms, with total or maximal parallelism, with rules of various types). In this context, some results from the above mentioned paper by Subramanian et al. are improved. A series of open problems are formulated.
Revisiting Sevilla Carpets: A New Tool for the P-Lingua Era
(Fénix Editora, 2014) Orellana Martín, David; Graciani Díaz, Carmen; Martínez del Amor, Miguel Ángel; Riscos Núñez, Agustín; Valencia Cabrera, Luis; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Economía y Competitividad (MINECO). España; Universidad de Sevilla. TIC193: Computación Natural
Sevilla Carpets have already been used to compare di erent solutions of the Subset Sum problem: either designed in the framework of P systems with active membranes (both in the case of membrane division and membrane creation), and also another one in the framework of tissue-like P systems with cell division. Recently, the degree of parallelism and other descriptive complexity details have been found to be relevant when designing parallel simulators running on GPUs. We present here a new way to use the information provided by Sevilla carpets, and a script that allows to generate them automatically from P-Lingua les.
Extending SNP Systems Asynchronous Simulation Modes in P-Lingua
(Fénix Editora, 2014) Macías Ramos, Luis Felipe; Song, Tao; Pan, Linqiang; Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Ciencia e Innovación (MICIN). España; Universidad de Sevilla. TIC193: Computación Natural
Spiking neural P systems (SN P systems for short) is a developing field within the P systems world. Inspired by the neurophysiological structure of the brain, these systems have been subjected to many extensions in recent years, many of them intended to “somewhat” incorporate more and more features inspired by the functioning of the living neural cells. Although when first introduced in SN P systems were considered to work in synchronous mode, it became clear that considering nonsynchronized systems would be rather natural both from both from a mathematical and neuro-biological point of view. Asynchronous variants of these systems were introduced in, setting up a scenario where even if a neuron had enabled rules ready to fire, such rules non-deterministically could be not applied. Once new theoretical variants are defined, providing simulation software tools enables experimental study and validation of the proposed models. One more than promising developing branch comprises the use of parallel architectures, concretely GPUs, that provide efficient implementations. One drawback of this approach, due to the inherent constraints of the GPUs programming model, is a relatively long development cycle to extend existing variants. At the expense of sacrificing efficiency for expressivity, other alternatives involving sequential approaches can be considered. Within this trend, P–Lingua offers the high flexibility of the Java programming language as well as a general acceptance within the Membrane computing community. P–Lingua affords a standard language for the definition of P systems. Part of the same software project, pLinguaCore library provides particular implementations of parsers and simulators for the models specified in P–Lingua. Support for simulating SN P systems in P–Lingua was introduced in. In that version all (synchronous and asynchronous) “working modes” considered in were implemented. Since then, new asynchronous variants have appeared. In this paper we present a brand new extension of P–Lingua related to asynchronous SN P systems, in order to incorporate simulation capabilities for limited asynchronous SN P systems, introduced in, and asynchronous SN P systems with local introduced respectively in
Constant-Space P Systems with Active Membranes
(Fénix Editora, 2014) Leporati, Alberto; Manzoni, Luca; Mauri, Giancarlo; Porreca, Antonio E.; Zandron, Claudio
We continue the investigation of the computational power of space- constrained P systems. We show that only a constant amount of space is needed in order to simulate a polynomial-space bounded Turing machine. Due to this result, we propose an alternative de nition of space complexity for P systems, where the amount of information contained in individual objects and membrane labels is also taken into ac- count. Finally, we prove that, when less than a logarithmic number of membrane labels is available, moving the input objects around the membrane structure without rewriting them is not enough to even distinguish inputs of the same length.
P Colony Robot Controller
(Fénix Editora, 2014) Langer, Miroslav; Cienciala, Ludek; Ciencialová, Lucie; Perdek, Michal; Smolka, Vladimír
P colonies were introduced in 2004 (see [7]) as an abstract computing device composed of independent single membrane agents, reactively acting and evolving in a shared environment. Each agent is equip with set of rules which are structured into simple programs. We use this very simple symbol processing computational device to build complex robot controllers. Moreover, we group agents into the modules (see [1]). Each module fulfils particular function. This allows us to easily extend our controller or change its function without rebuilding whole P colony. In this paper we introduce simple controller for passing the maze using right-hand rule.
Conventional Verification for Unconventional Computing: a Genetic XOR Gate Example
(Fénix Editora, 2014) Konur, Savas; Gheorgue, Marian; Dragomir, Ciprian; Ipate, Florentin; Krasnogor, Natalio
As unconventional computation matures and non-standard programming frameworks are demonstrated, the need for formal veri cation will become more prevalent. This is so because \programming" in unconventional substrates is di cult. In this paper we show how conventional veri cation tools can be used to verify unconventional programs implementing a logical XOR gate.
Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques
(Fénix Editora, 2014) Gazdag, Zsolt; Gutiérrez Naranjo, Miguel Ángel; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Economía y Competitividad (MINECO). España; Universidad de Sevilla. TIC193: Computación Natural
In Membrane Computing, the solution of a decision problem X belonging to the complexity class P via a polynomially uniform family of recognizer P systems is trivial, since the polynomial encoding of the input can involve the solution of the problem. The design of such solution has one membrane, two objects, two rules and one computation step. Stricto sensu, it is a solution in the framework of Membrane Computing, but it does not use Membrane Computing strategies. In this paper, we present three designs of uniform families of P systems that solve the decision problem STCON by using Membrane Computing strategies (pure Membrane Computing techniques): P systems with membrane creation, P systems with active membranes with dissolution and without polarizations and P systems with active membranes without dissolution and with polarizations. Since STCON is NL-complete, such designs are constructive proofs of the belonging of NL to PMCMC, PMCAM0 +d and PMCAM+
Probabilistic Guarded P Systems, A Formal Definition
(Fénix Editora, 2014) García Quismondo, Manuel; Martínez del Amor, Miguel Ángel; Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Economía y Competitividad (MINECO). España; Junta de Andalucía; Universidad de Sevilla. TIC193: Computación Natural
In this paper, we extend the general framework of Multienvironment P systems, which is a formal framework for modelling the dynamics of population biology. The extension is made by a new variant within the probabilistic approach, called Probabilistic Guarded P systems (in short, PGP systems).We provide a formal de nition, a simulation algorithm to capture the dynamics, and a survey of the associated software.
P Systems with Anti-Matter
(Fénix Editora, 2014) Freund, Rudolf; Paun, Gheorghe; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
After a short introduction to the area of membrane computing (a branch of natural computing), we introduce the concept of anti-matter in membrane computing. First we consider spiking neural P systems with anti-spikes, and then we show the power of anti-matter in cell-like P systems. As expected, the use of anti-matter objects and especially of matter/anti-matter annihilation rules, turns out to be rather powerful: computational completeness of P systems with anti-matter is obtained immediately, even without using catalysts. Finally, some open problems are formulated, too.
Antimatter as a Frontier of Tractability in Membrane Computing
(Fénix Editora, 2014) Díaz Pernil, Daniel; Peña Cantillana, Francisco; Gutiérrez Naranjo, Miguel Ángel; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII); Ministerio de Economía y Competitividad (MINECO). España; Universidad de Sevilla. TIC193: Computación Natural; Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
It is well known that the polynomial complexity class of recognizer polarizationless P systems with active membranes, without dissolution and with division for elementary and non-elementary membranes is exactly the complexity class P (see [6], Th. 2). In this paper, we prove that if such P system model is endowed with antimatter and annihilation rules, then NP problems can be solved. In this way, antimatter is a frontier of tractability in Membrane Computing.
Self-constructing Recognizer P Systems
(Fénix Editora, 2014) Díaz Pernil, Daniel; Peña Cantillana, Francisco; Gutiérrez Naranjo, Miguel Ángel; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII); Ministerio de Economía y Competitividad (MINECO). España; Universidad de Sevilla. TIC193: Computación Natural; Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
Usually, the changes produced in the membrane structure of a P system are considered side effects. The output of the computation is encoded as a multiset placed in a specific region and the membrane structure in the halting configuration is not considered important. In this paper we explore P systems where the target of the computation is the construction of a new membrane structure according its set of rules. The new membrane structure can be considered as the initial one of a new self-constructed P system. We focus on the self-construction of recognizer P systems and illustrates the definition with a study of the self-construction P systems working as decision trees for solving Machine Learning decision problems.
Scalable Grid-Based Implementation for Membrane Computing
(Fénix Editora, 2014) Ciobanu, Gabriel
We first present the formal semantics of a parallel rule-based formalism inspired by biological cells, and then provide a faithful parallel implementation of this computational model by using GridGain and taking care of various synchronization issues. Synchronization is achieved by using barriers and preconditions; both refer to the fact that a membrane can apply its rules only after it has received signals from the other related membranes. We develop a scalable parallel implementation using the MapReduce paradigm in GridGain which allows the splitting of a task into multiple subtasks, the parallel execution of these subtasks in parallel and the aggregation of the partial results into a single, final result. This implementation is very close to the formal description of this parallel model of membrane systems, a model which is computationally equivalent to Turing machines and able to provide polynomial solutions to NP-complete problems.
Towards P Colonies Processing Strings
(Fénix Editora, 2014) Cienciala, Ludek; Ciencialová, Lucie; Csuhaj Varjú, Erzsébet
In this paper we introduce and study P colonies where the environment is given as a string. These variants of P colonies, called Automaton-like P systems or APCol systems, behave like automata: during functioning, the agents change their own states and process the symbols of the string. After introducing the concept of APCol systems, we examine their computational power. It is shown that the family of languages accepted by jumping nite automata is properly included in the family of languages accepted by APCol systems with one agent, and it is proved that any recursively enumerable language can be obtained as a projection of a language accepted by an Automaton-like P colony with two agents.
The Reduction Problem in CUDA and Its Simulation with P Systems
(Fénix Editora, 2014) Ceterchi, Rodica; Martínez del Amor, Miguel Ángel; 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
We introduce P systems with dynamic communication graphs which simu- late the functioning of the CUDA architecture when solving the parallel reduction prob- lem.
Describing Membrane Computations with a Chemical Calculus
(Fénix Editora, 2014) Battyányi, Péter; Vaszil, György
Membrane systems are nature motivated computational models inspired by certain basic features of biological cells and their membranes. They are examples of the chemical computational paradigm which describes computation in terms of chemical solutions where molecules interact according to rules de ning their reaction capabilities. Chemical models can be presented by rewriting systems based on multiset manipulations, and they are usually given as a kind of chemical calculus which might also allow nondeterministic and non-sequential computations. Here we study membrane systems from the point of view of the chemical computing paradigm and show how computations of membrane systems can be described by such a chemical calculus.

Examinar

Envíos recientes