Pasar al contenido principal

DESARROLLO Y ESTUDIO DE ALGORITMOS PARA BUSQUEDA DEL MEJOR MODELO ECONOMETRICO EN PROBLEMAS DE CIENCIAS DE LA SALUD

TIN2016-80565-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2016
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD MIGUEL HERNANDEZ DE ELCHE

Resultados relacionados

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

RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Exploiting Heterogeneous Parallelism on Hybrid Metaheuristics for Vector Autoregression Models

  • Cuenca, Javier
  • Cutillas-Lozano, José-Matías
  • Giménez, Domingo
  • Pérez-Bernabeu, Alberto
  • López-Espín, José J.
  • Pérez-Bernabeu, Alberto|||/items/8ceace32-7574-474b-9456-6fcc4eb4d550
In the last years, the huge amount of data available in many disciplines makes the mathematical modeling, and, more concretely, econometric models, a very important technique to explain those data. One of the most used of those econometric techniques is the Vector Autoregression Models (VAR) which are multi-equation models that linearly describe the interactions and behavior of a group of variables by using their past. Traditionally, Ordinary Least Squares and Maximum likelihood estimators have been used in the estimation of VAR models. These techniques are consistent and asymptotically efficient under ideal conditions of the data and the identification problem. Otherwise, these techniques would yield inconsistent parameter estimations. This paper considers the estimation of a VAR model by minimizing the difference between the dependent variables in a certain time, and the expression of their own past and the exogenous variables of the model (in this case denoted as VARX model). The solution of this optimization problem is approached through hybrid metaheuristics. The high computational cost due to the huge amount of data makes it necessary to exploit High-Performance Computing for the acceleration of methods to obtain the models. The parameterized, parallel implementation of the metaheuristics and the matrix formulation ease the simultaneous exploitation of parallelism for groups of hybrid metaheuristics. Multilevel and heterogeneous parallelism are exploited in multicore CPU plus multiGPU nodes, with the optimum combination of the different parallelism parameters depending on the particular metaheuristic and the problem it is applied to.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

1/n Turbo codes from linear system point of view

  • Herranz, Victoria
  • Napp, Diego
  • Perea, Carmen
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
The performance of turbo codes at the error floor region is largely determined by the effective free distance, which corresponds to the minimum Hamming weight among all codeword sequences generated by input sequences of weight two. In this paper, we study turbo codes of dimension one obtained from the concatenation of two equal codes and present an upper bound on the effective free distance of a turbo code with these parameters defined over any finite field. We do that making use of the so-called (A, B, C, D) state-space representations of convolutional codes and restrict to the case where A is invertible. A particular construction, from a linear systems point of view, of a recursive systematic convolutional code of rate 1/n so that the effective free distance of the corresponding turbo code attains this upper bound is also presented.