Skip to main content

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

TIN2016-80565-R

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos I+D+i Retos de Investigación
Call year 2016
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD MIGUEL HERNANDEZ DE ELCHE

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Enhancing the context-aware FOREX market simulation using a parallel elastic network model

  • Contreras, Antonio V.
  • Llanes, Antonio
  • Herrera, Francisco J.
  • Navarro, Sergio
  • López-Espin, Jose J.
  • Cecilia-Canales, José María|||0000-0001-5648-214X
[EN] Foreign exchange (FOREX) market is a decentralized global marketplace in which different participants, such as international banks, companies or investors, can buy, sell, exchange and speculate on currencies. This market is considered to be the largest financial market in the world in terms of trading volume. Indeed, the just-in-time price prediction for a currency pair exchange rate (e.g., EUR/USD) provides valuable information for companies and investors as they can take different actions to improve their business. The trading volume in the FOREX market is huge, disperses, in continuous operations (24 h except weekends), and the context significantly affects the exchange rates. This paper introduces a context-aware algorithm to model the behavior of the FOREX Market, called parallel elastic network model (PENM). This algorithm is inspired by natural procedures like the behavior of macromolecules in dissolution. The main results of this work include the possibility to represent the market evolution of up to 21 currency pair, being all connected, thus emulating the real-world FOREX market behavior. Moreover, because the computational needs required are highly costly as the number of currency pairs increases, a hybrid parallelization using several shared memory and message passing algorithms studied on distributed cluster is evaluated to achieve a high-throughput algorithm that answers the real-time constraints of the FOREX market. The PENM is also compared with a vector autoregressive (VAR) model using both a classical statistical measure and a profitability measure. Specifically, the results indicate that PENM outperforms VAR models in terms of quality, achieving up to 930xspeed-up factor compared to traditional R codes using in this field., This work was jointly supported by the Fundación Séneca (Agencia Regional de Ciencia y Tecnología, Región de Murcia) under Grant 20813/PI/18 and by the Spanish MEC and European Commission FEDER under Grants TIN2016-78799-P and TIN2016-80565-R (AEI/FEDER, UE).
RUA. Repositorio Institucional de la Universidad de Alicante
Publication 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
Publication 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.