Informática

URI permanente para esta comunidadhttps://hdl.handle.net/11441/33181

Examinar

Mostrando 1 - 20 de 600

14th Brainstorming Week on Membrane Computing
(Fénix, 2016) Moreno Valero, Laura
14th Brainstorming Week on Membrane Computing Sevilla, February 1 - 5, 2016 : RGNC Report 1/2016
(Fénix, 2016) Graciani Díaz, Carmen; Orellana Martín, David; Riscos Núñez, Agustín; Romero Jiménez, Álvaro; 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 Natural
15th Brainstorming Week on Membrane Computing Sevilla, January 31 - February 3, 2017, RGNC REPORT 1/2017 Research Group on Natural Computing Sevilla University
(Fenix Editora, 2017) Graciani Díaz, Carmen; 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 Natural
2006 Research Topics in Membrane Computing
(Fénix Editora, 2006) Paun, Gheorghe; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIN193: Computación Natural
This is a list of research topics prepared on the occasion of the Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February 3, 2006 (hence the title). The selection is subjective, the presentation is informal (in most cases, the precise formulation of the question to investigate is already part of the research task), the bibliographical information is partial (giving only a starting point for searching the literature; as usual, for a complete bibliography the reader should refer to
2D P Colonies and Modelling of Liquid Flow Over the Earth's Surface
(Fénix Editora, 2013) Cienciala, Ludek; Ciencialová, Lucie; Langer, Miroslav
We continue the investigation of 2D P colonies introduced in [1], a class of abstract computing devices composed of independent agents, acting and evolving in a shared 2D environment where the agents are located. Agents have limited information about the contents of the environment where they can move in four directions.
A Bibliography of Spiking Neural P Systems
(Fénix Editora, 2009) Paun, Gheorghe; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
A Biological Perspective on Sorting with P Systems
(Fénix Editora, 2008) Ardelean, Ioan I.; Ceterchi, Rodica; Tomescu, Alexandru Ioan
The aim of this contribution is to argue that the processes occurring in biological membranes in bacteria are also important as natural examples of communication between membranes, which, in the formal framework of P systems, leads (among other things) to simulations of sorting operations.
A Case Study in (Mem)Brane Computation: Generating {n2 | n 1}
(Fénix Editora, 2006) Busi, Nadia; Gutiérrez Naranjo, Miguel Ángel; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Educación y Ciencia (MEC). España; Universidad de Sevilla. TIC193: Computación Natural
The aim of this paper is to start an investigation and a comparison of the expressiveness of the two most relevant formalisms inspired by membranes interactions, namely, P systems and Brane Calculi. We compare the two formalisms w.r.t. their ability to act as language generators. In particular, we show different ways of generating the set L = {n2 | n 1} in P systems and in Brane Calculi.
A Cellular Sudoku Solver
(Fénix Editora, 2010) Díaz Pernil, Daniel; Fernández Márquez, Carlos M.; García Quismondo, Manuel; Gutiérrez Naranjo, 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
Sudoku is a very popular puzzle which consists on placing several numbers in a squared grid according to some simple rules. In this paper we present an efficient family of P systems which solve sudoku puzzles of any order verifying a specific property. The solution is searched by using a simple human-style method. If the sudoku cannot be solved by using this strategy, the P system detects this drawback and then the computations stops and returns No. Otherwise, the P system encodes the solution and returns Yes in the last computation step.
A Cellular Way to Obtain Homology Groups in Binary 2D Images
(Fénix Editora, 2010) Díaz Pernil, Daniel; Gutiérrez Naranjo, Miguel Ángel; Real Jurado, Pedro; Sánchez Canales, Vanesa; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII); Universidad de Sevilla. TIC193: Computación Natural; Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
In this paper we present a P systems-based solution for the Homology Groups of Binary 2D Image (HGB2I) Problem, a classical problem in Homology Theory. To this aim, we present a family of P systems which solves all the instances of the problem in the framework of Tissue-like P systems with catalysts. This new framework combines the membrane structure and symport-antiport communication rules of tissue-like P systems with the power of catalysts and inhibitors.
A Characterization of PSPACE with Antimatter and Membrane Creation
(Fénix Editora, 2015) 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
The use of negative information provides a new tool for exploring the limits of P systems as computational devices. In this paper we prove that the combination of antimatter and annihilation rules (based on the annihilation of physical particles and antiparticles) and membrane creation (based on autopoiesis) provides a P system model able to solve PSPACE-complete problems. Namely, we provide a uniform family of P system in such P system model which solves the satis ability problem for quanti ed Boolean formulas (QSAT). In the second part of the paper, we prove that all the decision problems which can be solved with this P system model belong to the complexity class PSPACE, so this P system model characterises PSPACE.
A Class of P Automata for Characterizing Context-free Languages
(Fénix Editora, 2006) Vaszil, György
We present a characterization of context-free languages in terms of a restricted class of P automata (P systems accepting strings of symbols using symport/antiport communication rules). The characterization is based on the form of the rules used by the system.
A CLIPS Simulator for Recognizer P Systems with Active Membranes
(Fénix Editora, 2004) Pérez Jiménez, Mario de Jesús; Romero Campero, Francisco José; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Ciencia y Tecnología (MCYT). España; Universidad de Sevilla. TIC193: Computación Natural
In this paper we propose a new way to represent recognizer P systems with active membranes based on Production Systems techniques. This representation allows us to express the set of rules and the configurations in each step of the evolution as facts in a knowledge base. We provide a CLIPS program to simulate the evolutions of this variant of P systems.
A First Model for Hebbian Learning with Spiking Neural P Systems
(Fénix Editora, 2008) Gutiérrez Naranjo, 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 Educación y Ciencia (MEC). España; Junta de Andalucía; Universidad de Sevilla. TIC193: Computación Natural
Spiking neural P systems and artificial neural networks are computational devices which share a biological inspiration based on the transmission of information among neurons. In this paper we present a first model for Hebbian learning in the framework of Spiking Neural P systems by using concepts borrowed from neuroscience and artificial neural network theory.
A Formal Framework for Clock-free Networks of Cells
(Fénix Editora, 2012) Ivanov, Sergiu
A Formal Framework for P Systems with Dynamic Structure
(Fénix Editora, 2012) Freund, Rudolf; Pérez Hurtado de Mendoza, Ignacio; Riscos Núñez, Agustín; Verlan, Sergey; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
This article introduces a formalism/framework able to describe different variants of P systems having a dynamic structure. This framework can be useful for the definition of new variants of P systems with dynamic structure, for the comparison of existing definitions as well as for their extension. We give a precise definition of the formalism and show how existing variants of P systems with dynamic structure can be translated to it.
A GPU Simulation for Evolution-Communication P Systems with Energy Having no Antiport Rules
(Fénix Editora, 2013) Bangalan, Zylynn F.; Soriano, Krizia Ann N.; Juayong, Richelle Ann B.; Cabarle, Francis George C.; Adorna, Henry N.; Martínez del Amor, Miguel Ángel; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Junta de Andalucía; Ministerio de Ciencia e Innovación (MICIN). España; Universidad de Sevilla. TIC193: Computación Natural
Evolution-Communication P system with energy (ECPe systems) is a cell- like variant P system which establishes a dependence between evolution and communi- cation through special objects, called `energy,' produced during evolution and utilized during communication. This paper presents our initial progress and e orts on the im- plementation and simulation of ECPe systems using Graphics Processing Units (GPUs). Our implementation uses matrix representation and operations presented in a previous work. Speci cally, an implementation of computations on ECPe systems without antiport rules is discussed.
A Java Simulator for Basic Transition P Systems
(Fénix Editora, 2004) Nepomuceno Chamorro, Isabel de los Ángeles; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
In this paper, a software tool (called SimCM, from Spanish Sim- ulador de Computaci¶on con Membranas) for handling P systems is presented. The program can simulate basic transition P Systems where dissolution of membranes and priority rules are allowed. This is a ¯rst step to cross the border between simulations and distributed implementations that capture the parallelism existing in this model.
A Kernel P System
(Fénix Editora, 2012) Gheorgue, Marian; Ipate, Florentin; Dragomir, Ciprian
A basic P system, called kernel P system (kP system for short), covering features of different P systems introduced and studied so far is defined and discussed. It is a relatively low level specification system aiming to cover features exhibited by most of the problems modelled so far using P system formalisms. A small set of rules and specific strategies to run the system step by step are presented. Some preliminary results regarding the relationships between kP systems and other classes of P systems, like neural-like P systems and P systems with active membranes, are presented. Examples illustrating the behaviour of kP systems or showing how a sorting algorithm is modelled with various classes of P systems are provided. Further developments of this class of P systems are finally briefly discussed.
A Linear Solution for Subset Sum Problem with Tissue P Systems with Cell Division
(Fénix Editora, 2007) Díaz Pernil, Daniel; Gutiérrez Naranjo, Miguel Ángel; 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; Ministerio de Educación y Ciencia (MEC). España; Junta de Andalucía; Universidad de Sevilla. TIC193: Computación Natural
Tissue P systems are a computing model in the framework of Membrane Computing where the tree-like membrane structure is replaced by a general graph. Recently, it has been shown that endowing these P systems with cell division, NP-complete problems can be solved in polynomial time. In this paper we present a solution to the Subset Sum problem via a family of such devices, and we also include the formal verification of such solution. This is the first solution to a numerical NP-complete problem by using tissue P systems with cell division.

Examinar

Examinando Informática por Título