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 67

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 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 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 Membrane-Inspired Evolutionary Algorithm with a Population P System and its Application to Distribution System Recon guration
(Fénix Editora, 2012) Zhang, Gexiang; Gutiérrez Naranjo, Miguel Ángel; Qin, Yanhui; Gheorgue, Marian; 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
This paper develops a membrane-inspired evolutionary algorithm, PSMA, which is designed by using a population P system and a quantum-inspired evolutionary algorithm (QIEA). We use a population P system with three cells to organize three types of QIEAs, where communications between cells are performed at the level of genes, instead of the level of individuals reported in the existing membrane algorithms in the literature. Knapsack problems are applied to discuss the parameter setting and to test the effectiveness of PSMA. Experimental results show that PSMA is superior to four representative QIEAs and our previous work with respect to the quality of solutions and the elapsed time. We also use PSMA to solve the optimal distribution system reconfiguration problem in power systems for minimizing the power loss.
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.
An Optimal Frontier of the Efficiency of Tissue P Systems with Cell Division
(Fénix Editora, 2012) Porreca, Antonio E.; Murphy, Niall; 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; Junta de Andalucía; Universidad de Sevilla. TIC193: Computación Natural
In the framework of tissue P systems with cell division, the length of communication rules provides a frontier for the tractability of decision problems. On the one hand, the limitation on the efficiency of tissue P systems with cell division and communication rules of length 1 has been established. On the other hand, polynomial time solutions to NP–complete problems by using families of tissue P systems with cell division and communication rules of length at most 3 has been provided. In this paper, we improve the previous result by showing that the HAM-CYCLE problem can be solved in polynomial time by a family of tissue P systems with cell division by using communication rules with length at most 2. Hence, a new tractability boundary is given: passing from 1 to 2 amounts to passing from non–efficiency to efficiency, assuming that P ̸= NP.
Análisis "cluster" de los flujos laborales y políticas activas de empleo
(Universidad de Sevilla, 2013) Álvarez de Toledo Saavedra, Pablo; Núñez Hernández, Fernando; Usabiaga Ibáñez, Carlos; Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I; Junta de Andalucía
Este trabajo aborda la aplicación de una metodología de “clusters” a la información disponible sobre las colocaciones registradas en las oficinas públicas de empleo andaluzas (Servicio Andaluz de Empleo, SAE) entre enero de 2007 y diciembre de 2010. Dicha metodología permite dividir al mercado de trabajo en clusters (o mercados de trabajo locales homogéneos) mediante el agrupamiento de segmentos laborales definidos según el municipio, el grupo de ocupación y el sector de actividad tanto del puesto cubierto como del trabajador que lo cubre. Esta segmentación del mercado de trabajo se ajusta a la forma en que describen el emparejamiento los modelos teóricos actuales sobre el desempleo de búsqueda. Los desempleados que pertenecen a un determinado cluster tienen mayores opciones de encontrar empleo si buscan dentro de su cluster, ya que dicho cluster se basa precisamente en las experiencias exitosas de empleo de otros trabajadores con similares características. Pensamos que esta metodología puede constituir una poderosa herramienta de información para los servicios públicos de empleo, por cuanto permite proporcionar a cada buscador de empleo información precisa e individualizada sobre su entorno laboral más propicio
Analysing Gene Networks with PDP Systems. Arabidopsis thaliana, a Case Study
(Fénix Editora, 2013) Valencia Cabrera, Luis; García Quismondo, Manuel; Pérez Jiménez, Mario de Jesús; Su, Yansen; Yu, Hui; Pan, Linqiang; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Ciencia e Innovación (MICIN). España; Junta de Andalucía; Universidad de Sevilla. TIC193: Computación Natural
Gene Regulatory Networks (GRNs) are a useful tool for biologists to understand the interactions among genes in living organisms. A special kind of GRNs known as Logic Networks (LNs) has been recently introduced. These networks consider that the state of one or more genes can in uence another one. In a previous work, we proposed a Membrane Computing model which simulates the dynamics of LNs by drawing on the improved LAPP algorithm. In this paper we provide a case study for our LN model on a network which regulates the circadian rhythms of long{term studied plant Arabidopsis thaliana. We outline the software tools employed and propose a methodology for analysing LNs on our Membrane Computing model. At the end of the paper, some conclusions and future work are included.
Asynchronous Spiking Neural P Systems with Local Synchronization
(Fénix Editora, 2012) Song, Tao; Pan, Linqiang; Paun, Gheorghe; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Junta de Andalucía; Universidad de Sevilla. TIC193: Computación Natural
Spiking neural P systems (SN P systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. Asynchronous SN P systems are non-synchronized systems, where the use of spik- ing rules (even if they are enabled by the contents of neurons) is not obligatory. In this paper, with a biological inspiration (in order to achieve some speci c biological func- tioning, neurons from the same functioning motif or community work synchronously to cooperate with each other), we introduce the notion of local synchronization into asyn- chronous SN P systems. The computation power of asynchronous SN P systems with local synchronization is investigated. Such systems consisting of general neurons (resp. unbounded neurons) and using standard spiking rules are proved to be universal. Asyn- chronous SN P systems with local synchronization consisting of bounded neurons and using standard spiking rules characterize the semilinear sets of natural numbers. These results show that the local synchronization is useful, it provides some \programming capacity" useful for achieving a desired computational power.
Bridging Membrane and Reaction Systems - Further Results and Research Topics
(Fénix Editora, 2013) Paun, Gheorghe; Pérez Jiménez, Mario de Jesús; Rozenberg, Grzegorz; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Junta de Andalucía; Universidad de Sevilla. TIC193: Computación Natural
This paper continues an investigation into bridging two research areas con- cerned with natural computing: membrane computing and reaction systems. More specif- ically, the paper considers a transfer of two assumptions/axioms of reaction systems, non- permanency and the threshold assumption, into the framework of membrane computing. It is proved that: SN P systems with non-permanency of spikes assumption charac- terize the semilinear sets of numbers, and symport/antiport P systems with threshold assumption (translated as ! multiplicity of objects) can solve SAT in polynomial time. Also, several open research problems are stated.
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.
Counting Cells with Tissue-like P Systems
(Fénix Editora, 2012) Ardelean, Ioan I.; Díaz Pernil, Daniel; Gutiérrez Naranjo, Miguel Ángel; Peña Cantillana, Francisco; Reina Molina, Raúl; Sarchizian, Iris; 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 Ciencia e Innovación (MICIN). España; Junta de Andalucía; Universidad de Sevilla. TIC193: Computación Natural; Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
Counting the number of cells obtained in an experiment is crucial in many areas in Biology. Nonetheless, this is usually performed by hand by the researcher due the intrinsic difficulty of the task. In this paper, we present a set of techniques for counting cells inspired in the treatment of Digital Images via tissue-like P systems with promoters.
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.
Diferencias en motivaciones y enfoques de aprendizaje de estudiantes universitarios en carreras vocacionalmente distintas
(2013) Arquero Montaño, José Luis; Fernández Polvillo, Carmen; Universidad de Sevilla. Departamento de Contabilidad y Economía Financiera; Buitrago Esquinas, Eva María; Sánchez Franco, Manuel Jesús; Junta de Andalucía
Los retos del EEES requieren del cambio a un modelo centrado en el estudiante en el que estén implicados activamente en su proceso de aprendizaje. Como consecuencia, el profesorado está implantando innovaciones exitosas en otras áreas de conocimiento o contextos. Determinadas características del alumnado son clave para determinar la transferibilidad y sostenibilidad de las innovaciones Los objetivos de este trabajo son estudiar las motivaciones y los enfoques de aprendizaje de alumnos universitarios en carreras de componente vocacional distinto y comprobar la existencia de diferencias según el área y de relaciones entre el enfoque adoptado y el tipo de motivación usando el N-SPQ 3f y la escala EME. Los resultados indican que existen diferencias significativas en ambas características, presentando los alumnos de Enfermería perfiles más acordes con los requerimientos del EEES.
dP Automata versus Right-Linear Simple Matrix Grammars
(Fénix Editora, 2011) Paun, Gheorghe; 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; Universidad de Sevilla. TIC193: Computación Natural
We consider dP automata with the input string distributed in an arbitrary (hence not necessary balanced) way, and we investigate their language accepting power, both in the case when a bound there is on the number of objects present inside the system and in the general case. The relation with right-linear simple matrix grammars is useful in this respect. Some research topics and open problems are also formulated.

Examinar

Examinando Jornadas y Congresos US por Agencia financiadora "Junta de Andalucía"