BWMC2012. Brainstorming Week on Membrane Computing (10th. 2012. Sevilla)

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

Examinar

Mostrando 1 - 20 de 35

Tenth Brainstorming Week on Membrane Computing Sevilla, January 30 - February 3, 2012 Volume II : RGNC REPORT 2/2012
(Fénix Editora, 2012) García Quismondo, Manuel; Macías Ramos, Luis Felipe; Paun, Gheorghe; 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
Tenth Brainstorming Week on Membrane Computing Sevilla, January 30 – February 3, 2012 Volume I : RGNC REPORT 1/2012
(Fénix Editora, 2012) Martínez del Amor, Miguel Ángel; Paun, Gheorghe; Pérez Hurtado de Mendoza, Ignacio; Romero Campero, Francisco José; 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
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.
Modelling Intelligent Energy Distribution Systems by Hyperdag P Systems
(Fénix Editora, 2012) Zafiu, Adrian; Stefan, Cristian
The paper introduces a new model in membrane computing, using the hy- perdag P systems to simulate a complex, feedback-driven energy distribution system. The proposed model is tested within an ad-hoc developed simulator, and the evolution of the system is presented step by step.
Adaptive Fuzzy Spiking Neural P Systems for Fuzzy Inference and Learning
(Fénix Editora, 2012) Wang, Jun; Peng, Hong
Spiking neural P systems (in short, SN P systems) and their variants, in- cluding fuzzy spiking neural P systems (in short, FSN P systems), generally lack learning ability so far. Aiming at this problem, a class of modi ed FSN P systems are proposed in this paper, called adaptive fuzzy spiking neural P systems (in short, AFSN P systems). The AFSN P systems not only can model weighted fuzzy production rules in fuzzy knowl- edge base but also can perform dynamically fuzzy reasoning. It is more important that the AFSN P systems have learning ability like neural networks. Based on neuron's ring mechanisms, a fuzzy reasoning algorithm and a learning algorithm are developed. An example is included to illustrate the learning ability of the AFSN P systems.
A Note on the Probabilistic Evolution for P Systems
(Fénix Editora, 2012) Verlan, Sergey
In this note we propose a method that permits to describe in a uniform man- ner variants of probabilistic/stochastic P systems. We give examples of such a description for existing models of P systems using probabilities.
Implementing Obstacle Avoidance and Follower Behaviors on Koala Robots Using Numerical P Systems
(Fénix Editora, 2012) Vasile, Cristian Ioan; Pavel, Ana Brandusa; Dumitrache, Ioan; Kelemen, Jozef
Membrane controllers have been developed using Numerical P Systems and their extension, Enzymatic Numerical P Systems, for controlling mobile robots like e- puck and Khepera III. In this paper we prove that membrane controllers can be easily adapted for other types of robotic platforms. Therefore, obstacle avoidance and follower behaviors were adapted for Koala robots. The membrane controllers for Koala robots have been tested on real and simulated platforms. Experimental results and performance analysis are presented.
Improving the Universality Results of Enzymatic Numerical P Systems
(Fénix Editora, 2012) Vasile, Cristian Ioan; Pavel, Ana Brandusa; Dumitrache, Ioan
This paper provides the proof that Enzymatic Numerical P Sytems with deterministic, but parallel, execution model are universal, even when the production functions used are polynomials of degree 1. This extends previous known results and provides the optimal case in terms of polynomial degree.
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.
Cell Complexes and Membrane Computing for Thinning 2D and 3D Images
(Fénix Editora, 2012) Reina Molina, Raúl; Díaz Pernil, Daniel; 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); Universidad de Sevilla. TIC193: Computación Natural; Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
In this paper, we show a new example of bridging Algebraic Topology, Membrane Computing and Digital Images. In [24], a new algorithm for thinning multidimensional black and white digital images by using cell complexes was presented. Such cell complexes allow a discrete partition of the space and the algorithm preserves topological and geometrical properties of the image. In this paper, we present a parallel adaptation of such algorithm to P systems, by introducing some concepts of Algebraic Topology in the Membrane Computing framework. The chosen model for the implementation is tissue-like P systems with promoters, inhibitors and priorities.
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.
Improving the Efficiency of Tissue P Systems with Cell Separation
(Fénix Editora, 2012) Pérez Jiménez, Mario de Jesús; Sosík, Petr; 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
Cell fission process consists of the division of a cell into two new cells such that the contents of the initial cell is distributed between the newly created cells. This process is modelled by a new kind of cell separation rules in the framework of Membrane Computing. Specifically, in tissue-like membrane systems, cell separation rules have been considered joint with communication rules of the form symport/antiport. These models are able to create an exponential workspace, expressed in terms of the number of cells, in linear time. On the one hand, an efficient and uniform solution to the SAT problem by using cell separation and communication rules with length at most 8 has been recently given. On the other hand, only tractable problems can be efficiently solved by using cell separation and communication rules with length at most 1. Thus, in the framework of tissue P systems with cell separation, and assuming that P ̸= NP, a first frontier between efficiency and non-efficiency is obtained when passing from communication rules with length 1 to communication rules with length at most 8. In this paper we improve the previous result by showing that the SAT problem can be solved by a family of tissue P systems with cell separation in linear time, by using communication rules with length at most 3. Hence, we provide a new tractability borderline: passing from 1 to 3 amounts to passing from non–efficiency to efficiency, assuming that P ̸= NP.
The Role of the Environment in Tissue P Systems with Cell Division
(Fénix Editora, 2012) Pérez Jiménez, Mario de Jesús; Riscos Núñez, Agustín; Rius Font, Miquel; Romero Campero, Francisco José; 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
Classical tissue P systems with cell division have a special alphabet whose elements appear at the initial configuration of the system in an arbitrary large number of copies. These objects are shared in a distinguished place of the system, called the environment. Besides, the ability of these computing devices to have infinite copies of some objects has been widely exploited in the design of efficient solutions to computationally hard problems. This paper deals with computational aspects of tissue P systems with cell division where there is not an environment having the property mentioned above. Specifically, we establish the relationships between the polynomial complexity class associated with tissue P systems with cell division and with or without environment. As a consequence, we prove that it is not necessary to have infinite copies of some objects at the initial configuration in order to solve NP–complete problems in an efficient way.
Image Thresholding with Cell-like P Systems
(Fénix Editora, 2012) Peng, Hong; Shao, Jie; Li, Bing; Wang, Jun; Pérez Jiménez, Mario de Jesús; Jiang, Yang; Yang, Yufan; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
P systems are a new class of distributed parallel computing models. In this paper, a novel three-level thresholding approach for image segmentation based on celllike P systems is proposed in order to improve the computational efficiency of multilevel thresholding. A cell-like P system with a specially designed membrane structure is developed and an improved evolution mechanism is integrated into the cell-like P system. Due to parallel computing ability and particular mechanism of the cell-like P system, the presented thresholding approach can effectively search the optimal thresholds for threelevel thresholding based on total fuzzy entropy. Experimental results of both qualitative and quantitative comparisons for the proposed approach and GA-based and PSO-based approaches illustrate the applicability and effectiveness.
Languages and P Systems: Recent Developments
(Fénix Editora, 2012) 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
Languages appeared from the very beginning in membrane computing, by their length sets or directly as sets of strings. We briefly recall here this relationship, with some details about certain recent developments. In particular, we discuss the possibility to associate a control word with a computation in a P system. An improvement of a result concerning the control words of spiking neural P systems is given: regular languages can be obtained as control words of such systems with only four neurons (and with usual extended rules: no more spikes are produces than consumed). Several research topics are pointed out.
Two Topics Ahead Membrane Computing
(Fénix Editora, 2012) Obtulowicz, Adam
Two topics from the area of probability theory and randomness challenging membrane computing together with open problems and research proposals are discussed.
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.
Parallel Simulation of Probabilistic P Systems on Multicore Platforms
(Fénix Editora, 2012) Martínez del Amor, Miguel Ángel; Karlin, Ian; Jensen, Rune E.; Pérez Jiménez, Mario de Jesús; Elster, Anne C.; 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
Ecologists need to model ecosystems to predict how they will evolve over time. Since ecosystems are non-deterministic phenomena, they must express the likelihood of events occurring, and measure the uncertainty of their models' predictions. One method well suited to these demands is Population Dynamic P systems (PDP systems, in short), which is a formal framework based on multienvironment probabilistic P systems. In this paper, we show how to parallelize a Population Dynamics P system simulator, used to model biological systems, on multi-core processors, such as the Intel i5 Nehalem and i7 Sandy Bridge. A comparison of three di erent techniques, discuss their strengths and weaknesses, and evaluate their performance on two generations of Intel processors with large memory sub-system di erences is presented. We show that P systems are memory bound computations and future performance optimization e orts should focus on memory tra c reductions. We achieve runtime gains of up to 2.5x by using all the cores of a single socket 4-core Intel i7 built on the Sandy Bridge architecture. From our analysis of these results we identify further ways to improve the runtime of our simulator.
Inverse Dynamical Problems: An Algebraic Formulation Via MP Grammars
(Fénix Editora, 2012) Manca, Vincenzo; Marchetti, Luca
Metabolic P grammars are a particular class of multiset rewriting grammars introduced in the MP systems' theory for modelling metabolic processes. In this paper, a new algebraic formulation of inverse dynamical problems, based on MP grammars and Kronecker product, is given, for further motivating the correctness of the LGSS (Log-gain Stoichiometric Stepwise) algorithm, introduced in 2010s for solving dynamical inverse problems in the MP framework. At the end of the paper, a section is included that introduces the problem of multicollinearity, which could arise during the execution of LGSS, and that de nes an algorithm, based on a hierarchical clustering technique, that solves it in a suitable way.
Towards an Integrated Approach for Model Simulation, Property Extraction and Veri cation of P Systems
(Fénix Editora, 2012) Lefticaru, Raluca; Ipate, Florentin; Valencia Cabrera, Luis; Turcanu, Adrian; Tudose, Cristina; Gheorgue, Marian; Pérez Jiménez, Mario de Jesús; Niculescu, Ionut Mihai; Dragomir, Ciprian; 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
This paper presents an integrated approach for model simulation, property extraction and formal veri cation of P systems, illustrated on a tissue P system with active membranes solving the 3-colouring problem. The paper focuses on this problem and reports the invariants and the properties extracted and veri ed using a series of tools (Daikon, MeCoSim, Maple, Spin, ProB) and languages (P{Lingua, Promela, Event-B). Appropriate tools and integration plugins, which facilitate and even automate the steps involved in the aforementioned approach, have also been developed. The case study chosen is complex (it involves an exponential growth of the number of states through the use of membrane division rules) and the properties obtained are non-trivial.

Examinar

Envíos recientes