Jornadas y Congresos US

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

Esta comunidad recoge las actas de los congresos celebrados en la Universidad de Sevilla u organizados por la misma.

This community collects the acts of the congresses held at the Universidad de Sevilla or organized by it.

Examinar

Mostrando 1 - 20 de 36

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 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 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.
A Membrane Computing Model for Ballistic Depositions
(Fénix Editora, 2007) Graciani Díaz, Carmen; 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
Ballistic Deposition was proposed by Vold and Sutherland as a model for colloidal aggregation. These early works were later extended to simulate the process of vapor deposition. In general, Ballistic Deposition models involve (d + 1)-dimensional particles which rain down sequentially at random onto a d-dimensional substrate; when a particle arrives on the existing agglomeration of deposited particles, it sticks to the rst particle it contacts, which may result in lateral growth. In this paper we present a rst P system model for Ballistic Deposition with d = 1.
A P System Modeling an Ecosystem Related to the Bearded Vulture
(Fénix Editora, 2008) Cardona, Mónica; Colomer, M. Angels; Pérez Jiménez, Mario de Jesús; Sanuy, Delfí; Margalida, Antoni; 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
The Bearded Vulture is one of the rarest raptors in Europe and it is an endangered species. In this paper, we present a model of an ecosystem related with the Bearded Vulture which is located in the Catalan Pyrenees, by using P systems. The population dynamics constituted by the Bearded Vulture (that feeds almost exclusively on bones) and other five subfamilies that provide the bones they feed on, is studied. P systems provide a high level computational modeling framework which integrates the structural and dynamical aspects of ecosystems in a comprehensive and relevant way. P systems explicitly represent the discrete character of the components of an ecosystem by using rewriting rules on multisets of objects which represent individuals of the population and bones. The inherent stochasticity and uncertainty in ecosystems is captured by using probabilistic strategies. In order to give an experimental validation of the P system designed, we have constructed a simulator that allows us to analyze the evolution of the ecosystem with different initial conditions.
A Software Tool for Dealing with Spiking Neural P Systems
(Fénix Editora, 2007) Ramírez Martínez, Daniel; 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; Junta de Andalucía; Universidad de Sevilla. TIC193: Computación Natural
Software simulators for P system are nowadays the main tool to carry out experiments in the eld of Membrane Computing. Although the simulation of a P system is a quite complex task, current simulators have been successfully used for pedagogical purposes and also as assistant tools for researchers. In this paper we present a rst software tool for dealing with Spiking Neural P Systems. This tool outputs the transition diagram of a given system in a step-by-step mode. The code is modular and exible enough to be adapted for further research tasks.
Actuaciones dentro del plan de recuperación de una raza autóctona en peligro de extinción: la raza ovina churra lebrijana. Caracteres cualitativos externos y faneróptica
(Junta de Andalucía. Consejería de Agricultura y Pesca., 2007) Romero Falcón, Francisco; Siles, A.; Juárez Dávila, Manuel María; Alcalde Aldea, María Jesús; Valera Córdoba, María Mercedes; Peña Blanco, Francisco; Molina, A.; Universidad de Sevilla. Departamento de Ciencias Agroforestales; Ministerio de Educación y Ciencia (MEC). España
La raza ovina Churra Lebrijana se localiza en la Sierra Norte de Sevilla y Sierra de Aracena y Picos de Aroche. En la actualidad, se encuentra en grave peligro de extinción, contando con no más de 200 efectivos repartidos en dos explotaciones. Ante la necesidad de abordar la llevanza del Libro Genealógico de la raza, previa concesión, por los organismos administrativos pertinentes, se están llevando a cabo una serie de actuaciones, encuadradas en un proyecto INIA, con la finalidad de preservarla. En este sentido, se han obtenido un total de 23 variables cualitativas correspondientes a las regiones de la cabeza, tronco, mamas y extremidades, así como caracteres de índole faneróptica. Se han controlado un total de 22 ejemplares (16 hembras y el total de sementales de la raza), localizados en dos explotaciones de Andalucía. Para sentar las bases que permitan recuperar y conservar la raza, es necesario realizar un análisis previo que determine la variabilidad de los caracteres analizados a fin de poder encuadrar /discriminar aquellos animales que se ajusten o no al patrón racial propuesto.
An Approach to the Degree of Parallelism in P Systems
(Fénix Editora, 2006) 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; Universidad de Sevilla. TIC193: Computación Natural
In the literature, several designs of P systems were used for performing the same task. The use of different techniques or even different P system models makes it very difficult to compare these designs. In this paper, we introduce a new criterion for such a comparison: the degree of parallelism of a P system. To this aim, we define the labeled dependency graph associated with a P system, and we use this new concept for proving some results concerning the maximum number of applications of rules in a single step along the computation of a P system.
Cell-like Versus Tissue-like P Systems by Means of Sevilla Carpets
(Fénix Editora, 2009) Díaz Pernil, Daniel; Gallego Ortiz, Pilar; 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; Universidad de Sevilla. Departamento de Matemática Aplicada I; Ministerio de Educación y Ciencia (MEC). España; Junta de Andalucía; Universidad de Sevilla. TIC193: Computación Natural; Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
Sevilla Carpets are a handy tool for comparing computations performed by different systems solving the same problem. Such Sevilla Carpets provide on one hand quantitative information through parameters such as Weight, Surface and Average weight, and on the other hand they also provide a fast glimpse on the complexity of the computation thanks to their graphical representation. Up to now, Sevilla Carpets were only used on Cell-like P systems. In this paper we present a first comparison by means of Sevilla Carpets of the computations of three P systems (designed within different models), all of them solving the same instance of the Subset Sum problem. Two of these solutions use Cell-like P systems with active membranes, while the third one uses Tissue-like P systems with cell division.
Characterizing the Aperiodicity of Irreducible Markov Chains by Using P Systems
(Fénix Editora, 2009) Cardona, Mónica; Colomer, M. Angels; 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
It is well known that any irreducible and aperiodic Markov chain has exactly one stationary distribution, and for any arbitrary initial distribution, the sequence of distributions at time n converges to the stationary distribution, that is, the Markov chain is approaching equilibrium as n ! 1. In this paper, a characterization of the aperiodicity in existential terms of some state is given. At the same time, a P system with external output is associated with any irreducible Markov chain. The designed system provides the aperiodicity of that Markov chain and spends a polynomial amount of resources with respect to the size of the input. A formal verification of this solution is presented and a comparative analysis with respect to another known solution is described.
Characterizing Tractability by Tissue-Like P Systems
(Fénix Editora, 2009) Gutiérrez Escudero, Rosa; Pérez Jiménez, Mario de Jesús; Rius Font, Miquel; 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
In the framework of cell–like membrane systems it is well known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP–complete problems. Nonetheless, it may be sufficient to create an exponential number of membranes in polynomial time. In the framework of recognizer polarizationless P systems with active membranes, the construction of an exponential workspace expressed in terms of number of membranes and objects may not suffice to efficiently solve computationally hard problems. In this paper we study the computational efficiency of recognizer tissue P systems with communication (symport/antiport) rules and division rules. Some results have been already obtained in this direction: (a) using communication rules and forbidding division rules, only tractable problems can be efficiently solved; (b) using communication rules with length three and division rules, NP–complete problems can be efficiently solved. In this paper we show that the allowed length of communication rules plays a relevant role from the efficiency point of view of the systems.
Computing Backwards with P Systems
(Fénix Editora, 2009) 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
Searching all the configurations C′ such that produce a given configuration C, or, in other words, computing backwards in Membrane Computing is an extremely hard task. The current approximations are based in heavy hand-made calculus by considering the specific features of the given configuration. In this paper we present a general method for characterizing all the configurations C′ such that produce a given configuration C in transition P systems without cooperation and without dissolution.
DCBA: Simulating Population Dynamics P Systems with Proportional Object Distribution
(Fénix Editora, 2012) Martínez del Amor, Miguel Ángel; Pérez Hurtado de Mendoza, Ignacio; García Quismondo, Manuel; Macías Ramos, Luis Felipe; Valencia Cabrera, Luis; Romero Jiménez, Álvaro; Graciani Díaz, Carmen; Riscos Núñez, Agustín; Colomer, M. Angels; Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Junta de Andalucía; Ministerio de Educación y Ciencia (MEC). España; Universidad de Sevilla. TIC193: Computación Natural
Population Dynamics P systems refer to a formal framework for ecological modelling. The semantics of the model associates probabilities to rules, but at the same time, the model is based on P systems, so the rules are applied in a maximally parallel way. Since the success of the rst model using this framework [5], initially called multienvironment probabilistic P systems, several simulation algorithms have been de ned in order to better reproduce the behaviour of the ecosystems with the models. BBB and DNDP are previous attempts, which de ne blocks of rules having the same left-hand side, but do not de ne a deterministic behaviour when di erent rules are competing for the same resources. That is, di erent blocks of rules present in their lefthand side common objects, being applicable at the same time. In this paper, we introduce a new simulation algorithm, called DCBA, which performs a proportional distribution of resources.
Efficiency of Tissue P Systems with Cell Separation
(Fénix Editora, 2009) 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 Educación y Ciencia (MEC). España; Junta de Andalucía; Universidad de Sevilla. TIC193: Computación Natural
The most investigated variants of P systems in the last years are cell-like models, especially in terms of efficiency. Recently, different new models of tissue-like (symport/antiport) P systems have received important attention. This paper presents a new class of tissue P systems with cell separation, where cell separation can generate new workspace. Its efficiency is investigated, specifically, (a) only tractable problem can be efficiently solved by using cell separation and communication rules with length at most 1, and (b) an efficient (uniform) solution to SAT problem by using cell separation and communication rules with length at most 6 is presented. Further research topics and open problems are discussed, too.
Fractals and P Systems
(Fénix Editora, 2006) 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; Universidad de Sevilla. TIC193: Computación Natural
In this paper we show that the massive parallelism, the synchronous appli- cation of the rules, and the discrete nature of their computation, among other features, lead us to consider P systems as natural tools for dealing with fractals. Several examples of fractals encoded by P systems are presented and we wonder about using P systems as a new tool for representing and simulating the fractal nature of tumors.
Graphics and P Systems: Experiments with JPLANT
(Fénix Editora, 2008) Rivero Gil, Elena; 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
The hand-made graphical representation of the configuration of a P system becomes a hard task when the number of membranes and objects increases. In this paper we present a new software tool, called JPLANT, for computing and representing the evolution of a P system model with membrane creation.We also present some experiments performed with JPLANT and point out new lines for the research in computer graphics with membrane systems.
Handling Markov Chains with Membrane Computing
(Fénix Editora, 2006) Cardona, Mónica; Colomer, M. Angels; Pérez Jiménez, Mario de Jesús; Zaragoza, Alba; 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
In this paper we approach the problem of computing the n–th power of the transition matrix of an arbitrary Markov chain through membrane computing. The proposed solution is described in a semi–uniform way in the framework of P systems with external output. The amount of resources required in the construction is polynomial in the number of states of the Markov chain and in the power. The time of execution is linear in the power and is independent of the number of states involved in the Markov chain.
On String Languages Generated by Spiking Neural P Systems
(Fénix Editora, 2006) Chen, Haiming; Freund, Rudolf; Ionescu, Mihai; Paun, Gheorghe; 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; Universidad de Sevilla. TIC193: Computación Natural
We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated by that system. Although the work of spiking neural P systems is rather restricted (and this is illustrated by the fact that very simple languages cannot be generated in this framework), regular languages are inverse-morphic images of languages of finite spiking neural P systems, and recursively enumerable languages are projections of inverse-morphic images of languages generated by spiking neural P systems.
P System Based Model of an Ecosystem of the Scavenger Birds
(Fénix Editora, 2009) Cardona, Mónica; Colomer, M. Angels; Margalida, Antoni; Pérez Hurtado de Mendoza, Ignacio; Pérez Jiménez, Mario de Jesús; Sanuy, Delfí; 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
The Bearded Vulture (Gypaetus Barbatus) is an endangered species in Europe that feeds almost exclusively on bone remains provided by wild and domestic ungulates. In, we presented a P system in order to study the evolution of these species in the Pyrenees (NE Spain). Here, we present a new model that overcomes some limitations of the previous work incorporating other scavenger species (predatory) and additional prey species that provide food for the scavenger intraguild and interact with the Bearded Vulture in the ecosystem. After the validation, the new model can be a useful tool for the study of the evolution and management of the ecosystem. P systems provide a high level computational modelling framework which integrates the structural and dynamical aspects of ecosystems in a compressive and relevant way. The inherent stochasticity and uncertainty in ecosystems is captured by using probabilistic strategies.
P-Lingua 2.0: New Features and First Applications
(Fénix Editora, 2009) García Quismondo, Manuel; Gutiérrez Escudero, Rosa; Pérez Hurtado de Mendoza, Ignacio; 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
P-Lingua is a programming language for membrane computing. It was rst presented in Edinburgh, during the Ninth Workshop on Membrane Computing (WMC9). In this paper, the models, simulators and formats included in P-Lingua in version 2.0 are explained. We focus on the stochastic model, associated simulators and updated features. Finally, we present two new applications based on P-Lingua 2.0: a tool for describing and simulating ecosystems and a framework (currently under development) for P systems design.

Examinar

Examinando Jornadas y Congresos US por Agencia financiadora "Ministerio de Educación y Ciencia (MEC). España"