19 results on '"Riscos-Núñez, Agustín"'
Search Results
2. Seeking computational efficiency boundaries: the Păun’s conjecture
- Author
-
Orellana-Martín, David and Riscos-Núñez, Agustín
- Published
- 2020
- Full Text
- View/download PDF
3. A New Strategy to Improve the Performance of PDP-Systems Simulators
- Author
-
Graciani, Carmen, Martínez-del-Amor, Miguel A., Riscos-Núñez, Agustín, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Rozenberg, Grzegorz, editor, Salomaa, Arto, editor, Sempere, José M., editor, and Zandron, Claudio, editor
- Published
- 2015
- Full Text
- View/download PDF
4. The role of integral membrane proteins in computational complexity theory
- Author
-
Orellana-Martín, David, Martínez-del-Amor, Miguel Á., Valencia-Cabrera, Luis, Riscos-Núñez, Agustín, and Pérez-Jiménez, Mario J.
- Published
- 2018
- Full Text
- View/download PDF
5. A software tool for generating graphics by means of P systems
- Author
-
Rivero-Gil, Elena, Gutiérrez-Naranjo, Miguel Á., Romero-Jiménez, Álvaro, and Riscos-Núñez, Agustín
- Published
- 2011
- Full Text
- View/download PDF
6. On GPU-Oriented P Systems
- Author
-
Martínez del Amor, Miguel Ángel, Orellana Martín, David, Riscos Núñez, Agustín, Pérez Jiménez, Mario de Jesús, Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial, and Universidad de Sevilla. TIC193: Computación Natural
- Subjects
P systems ,GPU ,Parallelism ,simulation - Abstract
Ministerio de Economía, Industria y Competitividad TIN2017-89842-P
- Published
- 2018
7. A Survey of Parallel Simulation of P Systems with GPUs
- Author
-
Martínez del Amor, Miguel Ángel, Riscos Núñez, Agustín, Pérez Jiménez, Mario de Jesús, Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial, and Universidad de Sevilla. TIC193 : Computación Natural
- Subjects
Parallel Computing ,P systems ,Membrane computing ,CUDA ,GPU computing - Abstract
P system simulators become essential for model verification and validation, since they reproduce the semantics of the models in an automatic way. For this reason, in the literature, many authors have proposed several simulation tools. However, in order to handle large instances in an efficient way, parallel simulators come into play. High Performance Computing is a research branch that brings efficient tools for scien- tific purposes. For decades, many parallel platforms and architectures have been designed, with the goal of accelerating compute-demanding applications. But it was 10 years ago, that this field was revolutionized with the dawn of GPU computing through CUDA. This technology allowed programmers to run general-purpose parallel code in GPUs, harnessing in a simplified manner the large amount of processors within a GPU. Many authors have chosen this technology for accelerating the simulation of their P system models. Recently, this topic has captured the attention of more researchers. Therefore, in this paper we survey the related work on GPU-based simulators for P systems, and its evolution over the time until today
- Published
- 2017
8. Sevilla Carpets Revisited: Enriching the Membrane Computing Toolbox.
- Author
-
Orellana-Martín, David, Graciani, Carmen, Macías-Ramos, Luis-Felipe, Martínez-del-Amor, Miguel Ángel, Riscos-Núñez, Agustín, Romero-Jiménez, Álvaro, and Valencia-Cabrera, Luis
- Subjects
TOOLBOXES ,COMPUTATIONAL complexity ,GRAPHICS processing units ,SUBSET selection ,PROBLEM solving - Abstract
Sevilla carpets have already been used to compare different 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 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 in this context, and a script that allows to generate them automatically from P-Lingua files. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
9. A Rete-based Algorithm for Rule Selection in P Systems.
- Author
-
GRACIANI, CARMEN, GUTIÉRREZ-NARANJO, MIGUEL Á., PÉREZ-HURTADO, IGNACIO, RISCOS-NÚÑEZ, AGUSTÍN, and ROMERO-JIMÉNEZ, ÁLVARO
- Subjects
BIOLOGICAL membrane models ,ALGORITHMS ,GRAPHIC methods ,SIMULATION methods & models ,SIMULATION software ,BIOLOGICAL interfaces ,MEMBRANE potential - Abstract
The Rete algorithm is a well-known pattern matching algorithm con-ceived to make rule-based production system implementations more efficient. It builds a directed acyclic graph, representing higher-level rule sets, that allows the implementation to avoid checking each step the applicability of all the rules. Instead, only those affected by a change in the collection of facts are checked. In this paper we study how the underlying ideas of this algorithm can be adapted to improve the design of computational simulators within the framework of Membrane Com-puting. [ABSTRACT FROM AUTHOR]
- Published
- 2013
10. A formalization of membrane systems with dynamically evolving structures.
- Author
-
Freund, Rudolf, Pérez-Hurtado, Ignacio, Riscos-Núñez, Agustín, and Verlan, Sergey
- Subjects
COMPUTER systems ,EXISTENCE theorems ,COMPARATIVE studies ,EXTENSION (Logic) ,COMPUTER networks - Abstract
This article introduces a general formalism/framework flexible enough to cover descriptions of different variants of P systems having a dynamic membrane structure. Our framework can be useful for the precise definition of new variants of P systems with a dynamic structure and for the comparison of existing definitions as well as for their extension. We give a detailed definition of the formalism and we present some examples of how to translate several existing variants of P systems with a dynamic structure. [ABSTRACT FROM PUBLISHER]
- Published
- 2013
- Full Text
- View/download PDF
11. P Systems Computing the Period of Irreducible Markov Chains.
- Author
-
Cardona-Roca, Mónica, Colomer-Cugat, M. Ángels, Riscos-Núñez, Agustín, and Rius-Font, Miquel
- Subjects
MARKOV processes ,IRREDUCIBLE polynomials ,APERIODICITY ,COMPUTERS ,SOCIAL sciences ,COMPARATIVE studies - Abstract
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 → ∞. 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 comparative analysis with respect to another known solution is described. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
12. Membrane division, restricted membrane creation and object complexity in P systems.
- Author
-
Alhazov, Artiom, Freund, Rudolf, and Riscos-Núñez, Agustín
- Subjects
RECURSIVELY enumerable sets ,VECTOR analysis ,MATHEMATICAL programming ,SIGNS & symbols ,MATRICES (Mathematics) - Abstract
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursively enumerable sets of vectors of non-negative integers, even when no region (except the environment) contains more than one object of the same kind. We show here that they generate all recursively enumerable languages, and that two membrane labels are sufficient (the same result holds for accepting all recursively enumerable vectors of non-negative integers). Moreover, at most two objects are present inside the system at any time in the generative case. We then prove that 10+m symbols are sufficient to generate any recursively enumerable language over m symbols. P systems with active membranes without polarizations are known to generate all recursively enumerable sets of vectors of non-negative integers. We show that they generate all recursively enumerable languages; four starting membranes with three labels or seven starting membranes with two labels are sufficient. P systems with active membranes and two polarizations are known to generate/accept all recursively enumerable sets of vectors of non-negative integers, using only rules of rewriting and sending objects out. We show that accepting can be done by deterministic systems. Finally, we show that P systems with restricted membrane creation (the newly created membrane can only be of the same kind as the parent one) generate at least matrix languages, even when having at most one object in the configuration (except the environment). We conclude by presenting a summary of the main results obtained in this paper and a list of open questions. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
13. A Framework for Complexity Classes in Membrane Computing.
- Author
-
Riscos-Núñez, Agustín
- Subjects
COMPUTER interfaces ,COMPUTATIONAL complexity ,PARALLEL computers ,MATHEMATICAL models ,SYSTEM analysis ,COMPUTER science - Abstract
Abstract: The purpose of the present work is to give a general idea about the existing results and open problems concerning the study of complexity classes within the membrane computing framework. To this aim, membrane systems (seen as computing devices) are briefly introduced, providing the basic definition and summarizing the key ideas, trying to cover the various approaches that are under investigation in this area – of course, special attention is paid to the study of complexity classes. The paper concludes with some final remarks that hint the reasons why this field (as well as other unconventional models of computation) is attracting the attention of a growing community. [Copyright &y& Elsevier]
- Published
- 2009
- Full Text
- View/download PDF
14. On the degree of parallelism in membrane systems
- Author
-
Gutiérrez-Naranjo, Miguel A., Pérez-Jiménez, Mario J., and Riscos-Núñez, Agustín
- Subjects
- *
BIOLOGICAL membranes , *GRAPHIC methods , *COMPUTER science , *MATHEMATICAL models - Abstract
Abstract: In the literature, several designs of P systems might be found 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. With this aim, we define the labelled 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 through the computation of a P system. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
15. A Look at the Descriptional Complexity of SNQ P Systems
- Author
-
Păun, Andrei, Bîlbîe, Florin-Daniel, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Graciani, Carmen, editor, Riscos-Núñez, Agustín, editor, Păun, Gheorghe, editor, Rozenberg, Grzegorz, editor, and Salomaa, Arto, editor
- Published
- 2018
- Full Text
- View/download PDF
16. MAREX: A general purpose hardware architecture for membrane computing.
- Author
-
Cascado-Caballero, Daniel, Diaz-del-Rio, Fernando, Cagigas-Muñiz, Daniel, Rios-Navarro, Antonio, Guisado-Lizar, Jose-Luis, Pérez-Hurtado, Ignacio, and Riscos-Núñez, Agustín
- Subjects
- *
LOGIC circuits , *PARALLEL computers , *PARALLEL processing , *HARDWARE - Abstract
Membrane computing is an unconventional computing paradigm that has gained much attention in recent decades because of its massively parallel character and its usefulness to build models of complex systems. However, until now, there was no generic hardware implementation of P systems. Computational frameworks to execute P systems up to this day rely on the simulation of the parallel working mechanisms of P systems by inherently sequential algorithms. Such algorithms can then be implemented as is or can be parallelized, up to a certain point, to run on parallel computers. However, this is not as efficient as a dedicated parallel hardware implementation. There have been ad hoc implementations of particular P systems for parallel hardware, but they lack to be problem-generic or they are not scalable enough to implement large P systems. In this paper, a first intrinsically parallel hardware architecture to implement generic P system models is introduced. It is designed to be straightforwardly implemented in programmable logic circuits like FPGAs. The feasibility and correct execution of our architecture has been verified by means of a simulator, and several simulation results for different P system examples have been analysed to foresee the pros and cons of this design. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
17. Dendrite P systems.
- Author
-
Peng, Hong, Bao, Tingting, Luo, Xiaohui, Wang, Jun, Song, Xiaoxiao, Riscos-Núñez, Agustín, and Pérez-Jiménez, Mario J.
- Subjects
- *
DENDRITES , *NEURONS - Abstract
It was recently found that dendrites are not just a passive channel. They can perform mixed computation of analog and digital signals, and therefore can be abstracted as information processors. Moreover, dendrites possess a feedback mechanism. Motivated by these computational and feedback characteristics, this article proposes a new variant of neural-like P systems, dendrite P (DeP) systems, where neurons simulate the computational function of dendrites and perform a firing–storing process instead of the storing–firing process in spiking neural P (SNP) systems. Moreover, the behavior of the neurons is characterized by dendrite rules that are abstracted by two characteristics of dendrites. Different from the usual firing rules in SNP systems, the firing of a dendrite rule is controlled by the states of the corresponding source neurons. Therefore, DeP systems can provide a collaborative control capability for neurons. We discuss the computational power of DeP systems. In particular, it is proven that DeP systems are Turing-universal number generating/accepting devices. Moreover, we construct a small universal DeP system consisting of 115 neurons for computing functions. • We consider dendrites as information processors. • We propose a new model, dendrite P systems (DeP systems, in short). • We prove that DeP systems are Turing-universal number generating/accepting devices. • We construct a small universal DeP system of 115 neurons for computing functions. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
18. Dynamic threshold neural P systems.
- Author
-
Peng, Hong, Wang, Jun, Pérez-Jiménez, Mario J., and Riscos-Núñez, Agustín
- Subjects
- *
ARTIFICIAL neural networks , *NEUROMORPHICS , *NEURAL circuitry , *ACTION potentials , *ALGORITHMS - Abstract
Abstract Pulse coupled neural networks (PCNN, for short) are models abstracting the synchronization behavior observed experimentally for the cortical neurons in the visual cortex of a cat's brain, and the intersecting cortical model is a simplified version of the PCNN model. Membrane computing (MC) is a kind computation paradigm abstracted from the structure and functioning of biological cells that provide models working in cell-like mode, neural-like mode and tissue-like mode. Inspired from intersecting cortical model, this paper proposes a new kind of neural-like P systems, called dynamic threshold neural P systems (for short, DTNP systems). DTNP systems can be represented as a directed graph, where nodes are dynamic threshold neurons while arcs denote synaptic connections of these neurons. DTNP systems provide a kind of parallel computing models, they have two data units (feeding input unit and dynamic threshold unit) and the neuron firing mechanism is implemented by using a dynamic threshold mechanism. The Turing universality of DTNP systems as number accepting/generating devices is established. In addition, an universal DTNP system having 109 neurons for computing functions is constructed. Highlights • We propose a dynamic threshold neural P systems, inspired from intersecting cortical model. • We prove that Turing universality of dynamic threshold neural P systems as number accepting/generating devices. • We construct an universal dynamic threshold neural P system having 109 neurons for computing functions. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
19. The framework of P systems applied to solve optimal watermarking problem.
- Author
-
Peng, Hong, Wang, Jun, Pérez-Jiménez, Mario J., and Riscos-Núñez, Agustín
- Subjects
- *
DIGITAL watermarking , *PARALLEL programs (Computer programs) , *PARAMETER estimation , *SIMULATION methods & models , *CELL membranes , *INFORMATION sharing - Abstract
Abstract: Membrane computing (known as P systems) is a novel class of distributed parallel computing models inspired by the structure and functioning of living cells and organs, and its application to the real-world problems has become a hot topic in recent years. This paper discusses an interesting open problem in digital watermarking domain, optimal watermarking problem, and proposes a new optimal image watermarking method under the framework of P systems. A special membrane structure is designed and its cells as parallel computing units are used to find the optimal watermarking parameters for image blocks. Some cells use the position-velocity model to evolve watermarking parameters of image blocks, while another cell evaluates the objects in the system. In addition to the evolution rules, communication rules are used to exchange and share information between the cells. Simulation experiments on large image set compare the proposed framework with other existing watermarking methods and demonstrate its superiority. [Copyright &y& Elsevier]
- Published
- 2014
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.