Pasar al contenido principal

REDES DE PROCESADORES BIO-INSPIRADOS: RESULTADOS TEORICOS, IMPLEMENTACION HARDWARE/BIOWARE, DESARROLLO SOFTWARE Y SOLUCION PARA APLICACIONES

TIN2011-28260-C03-01

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2011
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 6
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Capítulo o parte de un libro (BookPart)

Structural graph extraction from images

  • Gallego-Sánchez, Antonio-Javier
  • Calera Rubio, Jorge
  • López Rodríguez, Damián|||0000-0003-3633-3862
We present three new algorithms to model images with graph primitives. Our main goal is to propose algorithms that could lead to a broader use of graphs, especially in pattern recognition tasks. The first method considers the q-tree representation and the neighbourhood of regions. We also propose a method which, given any region of a q-tree, finds its neighbour regions. The second algorithm reduces the image to a structural grid. This grid is postprocessed in order to obtain a directed acyclic graph. The last method takes into account the skeleton of an image to build the graph. It is a natural generalization of similar works on trees [8, 12]. Experiments show encouraging results and prove the usefulness of the proposed models in more advanced tasks, such as syntactic pattern recognition tasks., This work is partially supported by Spanish MICINN (contract TIN2011-28260-C03-01, contract TIN2009-14205-C04-C1) and CONSOLIDER-INGENIO 2010 (contract CSD2007-00018)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Polynomial characteristic sets for DFA identification

  • García Gómez, Pedro
  • López Rodríguez, Damián|||0000-0003-3633-3862
  • Vázquez-de-Parga Andrade, Manuel
[EN] We study the order in Grammatical Inference algorithms, and its influence on the polynomial (with respect to the data) identification of languages. This work is motivated by recent results on the polynomial convergence of data-driven grammatical inference algorithms. In this paper, we prove a sufficient condition that assures the existence of a characteristic sample whose size is polynomial with respect to the minimum DFA of the target language. © 2012 Elsevier B.V. All rights reserved., Work partially supported by the Spanish Ministerio de Economia y Competitividad under research project TIN2011-28260-C03-01 and Universidad Politecnica de Valencia grant PAID-2019-06-2011.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Networks of Bio-inspired Processors

  • Arroyo Montoro, Fernando
  • Castellanos, Juan
  • Mitrana, Víctor
  • Santos, Eugenio
  • Sempere Luna, José María|||0000-0003-2393-9224
[EN] The goal of this work is twofold. Firstly, we propose a uniform view of three types of accepting networks of bio-inspired processors: networks of evolutionary processors, networks of splicing processors and networks of genetic processors. And, secondly, we survey some features of these networks: computational power, computational and descriptional complexity, the existence of universal networks, eciency as problem solvers and the relationships among them., Work partially supported by the Spanish Ministry of Science and Innovation under coordinated research project TIN2011-28260-C03-00 and research projects TIN2011-28260-C03-01, TIN2011-28260-C03-02 and TIN2011-28260-C03-03
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A polynomial double reversal minimization algorithm for deterministic finite automata

  • Vázquez-de-Parga Andrade, Manuel
  • López Rodríguez, Damián|||0000-0003-3633-3862
  • García Gómez, Pedro
We here propose a polynomial-time deterministic finite automaton minimization algorithm directly derived from Brzozowski’s double reversal algorithm. To do so, we take into account the framework by Brzozowski and Tamm, to propose an atomization algorithm that allows us to achieve polynomial time complexity., Work partially supported by the Spanish Ministerio de Economia y Competitividad under research project TIN2011-28260-C03-01.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Inference of k-Testable Directed Acyclic Graph Languages

  • López Rodríguez, Damián|||0000-0003-3633-3862
  • Calera Rubio, Jorge
  • Gallego-Sánchez, Antonio-Javier
In this paper, we tackle the task of graph language learning. We first extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. Second, we propose a graph automata model for directed acyclic graph languages. This graph automata model is used to propose a grammatical inference algorithm to learn the class of directed acyclic k-testable in the strict sense graph languages. The algorithm runs in polynomial time and identifies this class of languages from positive data., Damián López is partially supported by the Spanish Ministerio de Economía y Competitividad under research project TIN2011-28260-C03-01. Jorge Calera-Rubio and Antonio-Javier Gallego-Sánchez thank the Spanish CICyT for partial support of this work through project TIN2009-14205-C04-01, the IST Programme of the European Community, under the PASCAL Network of Excellence, IST-2002-506778, and the program CONSOLIDER INGENIO2010 (CSD2007-00018).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Accepting networks of genetic processors are computationally complete

  • Campos Frances, Marcelino
  • Sempere Luna, José María|||0000-0003-2393-9224
We propose a computational model that is inspired by genetic operations over strings such as mutation and crossover. The model, Accepting Network of Genetic Processors, is highly related to previously proposed ones such as Networks of Evolutionary Processors and Networks of Splicing Processors. These models are complete computational models inspired by DNA evolution and recombination. Here, we prove that the proposed model is computationally complete (it is equivalent to the Turing machine). Hence, it can accept any recursively enumerable language. In addition, we relate the proposed model with (parallel) Genetic Algorithms or Evolutionary Programs and we set these techniques as decision problem solvers. © 2012 Elsevier B.V. All rights reserved., Work partially supported by the Spanish Ministry of Science and Innovation under coordinated research project TIN2011-28260-C03-00 and research project TIN2011-28260-C03-01.