Skip to main content

PENSAMIENTO COMPUTACIONAL E INGENIERIA DEL RENDIMIENTO PARA APLICACIONES DE CIENCIAS DE LA VIDA Y MEDIOAMBIENTALES - UDL

TIN2014-53234-C2-2-R

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
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 2014
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSIDAD DE LLEIDA

Resultados relacionados

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

Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Computer-assisted initial diagnosis of rare diseases

  • Alves, Rui
  • Piñol, Marc
  • Vilaplana Mayoral, Jordi
  • Teixidó Torrelles, Ivan
  • Cruz, Joaquim
  • Comas, Jorge
  • Vilaprinyo Terré, Ester
  • Sorribas Tello, Albert
  • Solsona Tehàs, Francesc
Introduction. Most documented rare diseases have genetic origin. Because of their low individual frequency, an initial diagnosis based on phenotypic symptoms is not always easy, as practitioners might never have been exposed to patients suffering from the relevant disease. It is thus important to develop tools that facilitate symptom-based initial diagnosis of rare diseases by clinicians. In this work we aimed at developing a computational approach to aid in that initial diagnosis. We also aimed at implementing this approach in a user friendly web prototype. We call this tool Rare Disease Discovery. Finally, we also aimed at testing the performance of the prototype. Methods. Rare Disease Discovery uses the publicly available ORPHANET data set of association between rare diseases and their symptoms to automatically predict the most likely rare diseases based on a patient’s symptoms. We apply the method to retrospectively diagnose a cohort of 187 rare disease patients with confirmed diagnosis. Subsequently we test the precision, sensitivity, and global performance of the system under different scenarios by running large scale Monte Carlo simulations. All settings account for situations where absent and/or unrelated symptoms are considered in the diagnosis. Results. We find that this expert system has high diagnostic precision (≥80%) and sensitivity (≥99%), and is robust to both absent and unrelated symptoms. Discussion. The Rare Disease Discovery prediction engine appears to provide a fast and robust method for initial assisted differential diagnosis of rare diseases. We coupled this engine with a user-friendly web interface and it can be freely accessed at http://disease-discovery.udl.cat/. The code and most current database for the whole project can be downloaded from https://github.com/Wrrzag/DiseaseDiscovery/tree/no_classifiers., This work was partially supported by the MEyC under contracts TIN2014-53234-C2- 2-R, TIN2011-28689-C02-02 and BFU2010-17704 and by Universitat de Lleida and Departament de Ciències Mèdiques Bàsiques with bridge grants to RA. The authors are members of the research groups 2014-SGR163 and 2014-SGR243, funded by the Generalitat de Catalunya.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

PPCAS: Implementation of a Probabilistic Pairwise Model for Consistency-Based Multiple Alignment in Apache Spark

  • Lladós Segura, Jordi
  • Guirado Fernández, Fernando
  • Cores Prado, Fernando
Large-scale data processing techniques, currently known as Big-Data, are used to manage the huge amount of data that are generated by sequencers. Although these techniques have significant advantages, few biological applications have adopted them. In the Bioinformatic scientific area, Multiple Sequence Alignment (MSA) tools are widely applied for evolution and phylogenetic analysis, homology and domain structure prediction. Highly-rated MSA tools, such as MAFFT, ProbCons and T-Coffee (TC), use the probabilistic consistency as a prior step to the progressive alignment stage in order to improve the final accuracy. In this paper, a novel approach named PPCAS (Probabilistic Pairwise model for Consistency-based multiple alignment in Apache Spark) is presented. PPCAS is based on the MapReduce processing paradigm in order to enable large datasets to be processed with the aim of improving the performance and scalability of the original algorithm., This work was supported by the MEyC-Spain [contract TIN2014-53234-C2-2-R].
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Using convolutional neural networks for classification of malware represented as images

  • Gibert Llauradó, Daniel
  • Mateu Piñol, Carles
  • Planes Cid, Jordi
  • Vicens, Ramon
The number of malicious files detected every year are counted by millions. One of the main reasons for these high volumes of different files is the fact that, in order to evade detection, malware authors add mutation. This means that malicious files belonging to the same family, with the same malicious behavior, are constantly modified or obfuscated using several techniques, in such a way that they look like different files. In order to be effective in analyzing and classifying such large amounts of files, we need to be able to categorize them into groups and identify their respective families on the basis of their behavior. In this paper, malicious software is visualized as gray scale images since its ability to capture minor changes while retaining the global structure helps to detect variations. Motivated by the visual similarity between malware samples of the same family, we propose a file agnostic deep learning approach for malware categorization to efficiently group malicious software into families based on a set of discriminant patterns extracted from their visualization as images. The suitability of our approach is evaluated against two benchmarks: the MalImg dataset and the Microsoft Malware Classification Challenge dataset. Experimental comparison demonstrates its superior performance with respect to state-of-the-art techniques., Acknowledgements We would like to thank the Blueliv Labs team, especially Daniel Solís, and Àngel Puigventós for their support and the feedback provided during the development of this work. This work has been partially funded by the Spanish MICINN Projects TIN2014- 53234-C2-2-R, TIN2015-71799-C2-2-P and by AGAUR DI-2016-091.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

FingerScanner: Embedding a Fingerprint Scanner in a Raspberry Pi

  • Sapes, Jordi
  • Solsona Tehàs, Francesc
Nowadays, researchers are paying increasing attention to embedding systems. Cost reduction has lead to an increase in the number of platforms supporting the operating system Linux, jointly with the Raspberry Pi motherboard. Thus, embedding devices on Raspberry-Linux systems is a goal in order to make competitive commercial products. This paper presents a low-cost fingerprint recognition system embedded into a Raspberry Pi with Linux, This work was supported by the MEyC under contracts TIN2011-28689-C02-02 and TIN2014-53234-C2-2-R. The authors are members of the research group 2014-SGR163, funded by the Generalitat de Catalunya. Besides, this research was partly supported by the European Union FEDER (CAPAP-H5network TIN2014-53522-REDT).
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

TControl: A mobile app to follow up tobacco-quitting patients

  • Pifarré Montalà, Marc
  • Carrera Peruga, Adrián
  • Vilaplana Mayoral, Jordi
  • Cuadrado, Josep
  • Solsona, Sara
  • Abella i Pons, Francesc
  • Solsona Tehàs, Francesc
  • Alves, Rui
Background and Objective Tobacco smoking is a major risk factor for a wide range of respiratory and circulatory diseases in active and passive smokers. Well-designed campaigns are raising awareness to the problem and an increasing number of smokers seeks medical assistance to quit their habit. In this context, there is the need to develop mHealth Apps that assist and manage large smoke quitting programs in efficient and economic ways. Objectives Our main objective is to develop an efficient and free mHealth app that facilitates the management of, and assistance to, people who want to quit smoking. As secondary objectives, our research also aims at estimating the economic effect of deploying that App in the public health system. Methods Using JAVA and XML we develop and deploy a new free mHealth App for Android, called TControl (Tobacco-quitting Control). We deploy the App at the Tobacco Unit of the Santa Maria Hospital in Lleida and determine its stability by following the crashes of the App. We also use a survey to test usability of the app and differences in aptitude for using the App in a sample of 31 patients. Finally, we use mathematical models to estimate the economic effect of deploying TControl in the Catalan public health system. Results TControl keeps track of the smoke-quitting users, tracking their status, interpreting it, and offering advice and psychological support messages. The App also provides a bidirectional communication channel between patients and clinicians via mobile text messages. Additionally, registered patients have the option to interchange experiences with each other by chat. The App was found to be stable and to have high performances during startup and message sending. Our results suggest that age and gender have no statistically significant effect on patient aptitude for using TControl. Finally, we estimate that TControl could reduce costs for the Catalan public health system (CPHS) by up to € 400M in 10 years. Conclusions TControl is a stable and well behaved App, typically operating near optimal performance. It can be used independent of age and gender, and its wide implementation could decrease costs for the public health system., This work was supported by the Ministerio de Economía y Competitividad under contracts TIN2011-28689-C02-02 and TIN2014-53234-C2-2-R. The authors are members of the research group 2014-SGR163, funded by the Generalitat de Catalunya. Besides, this research is partly supported by the European Union FEDER (CAPAP-H5 network TIN2014-53522-REDT).
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Blacklist muti-objective genetic algorithm for energy saving in heterogeneous environments

  • Gabaldon Ponsa, Eloi
  • Lérida Monsó, Josep Lluís
  • Guirado Fernández, Fernando
  • Planes Cid, Jordi
Reducing energy consumption in large-scale computing facilities has become a major concern in recent years. Most of the techniques have focused on determining the computing requirements based on load predictions and thus turning unnecessary nodes on and off. Nevertheless, once the available resources have been configured, new opportunities arise for reducing energy consumption by providing optimal matching of parallel applications to the available computing nodes. Current research in scheduling has concentrated on not only optimizing the energy consumed by the processors but also optimizing the makespan, i.e., job completion time. The large number of heterogeneous computing nodes and variability of application-tasks are factors that make the scheduling an NP-Hard problem. Our aim in this paper is a multi-objective genetic algorithm based on a weighted blacklist able to generate scheduling decisions that globally optimizes the energy consumption and the makespan., This research is partly supported by the European Union FEDER (CAPAP-H5 network TIN2014-53522-REDT) and MEyC-Spain under contract TIN2014-53234-C2-2-R and TIN2015- 71799-C2-2-P.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

On the Performance of MaxSAT and MinSAT Solvers on 2SAT-MaxOnes

  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Fernàndez Camon, César
  • Mateu Piñol, Carles
  • Planes Cid, Jordi
We analyze and compare two solvers for Boolean optimization problems: WMaxSatz, a solver for Partial MaxSAT, and MinSatz, a solver for Partial MinSAT. Both MaxSAT and MinSAT are similar, but previous results indicate that when solving optimization problems using both solvers, the performance is quite different on some cases. For getting insights about the differences in the performance of the two solvers, we analyze their behaviour when solving 2SAT-MaxOnes problem instances, given that 2SAT-MaxOnes is probably the most simple, but NP-hard, optimization problem we can solve with them. The analysis is based first on the study of the bounds computed by both algorithms on some particular 2SAT-MaxOnes instances, characterized by the presence of certain particular structures. We find that the fraction of positive literals in the clauses is an important factor regarding the quality of the bounds computed by the algorithms. Then, we also study the importance of this factor on the typical case complexity of Random-p 2SAT-MaxOnes, a variant of the problem where instances are randomly generated with a probability p of having positive literals in the clauses. For the case p=0, the performance results indicate a clear advantage of MinSatz with respect to WMaxSatz, but as we consider positive values of p WMaxSatz starts to show a better performance, although at the same time the typical complexity of Random-p 2SAT-MaxOnes decreases as p increases. We also study the typical value of the bound computed by the two algorithms on these sets of instances, showing that the behaviour is consistent with our analysis of the bounds computed on the particular instances we studied first.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Weighted argumentation for analysis of discussions in twitter

  • Alsinet, Teresa
  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Fernàndez Camon, César
  • Mateu Piñol, Carles
  • Planes Cid, Jordi
Twitter has become a widely used social network to discuss ideas about many domains. This leads to a growing interest in understanding what are the major accepted or rejected opinions in different domains by social network users. At the same time, checking what are the topics that produce the most controversial discussions among users can be a good tool to discover topics that can be divisive, what can be useful, e.g., for policy makers. With the aim to automatically discover such information from Twitter discussions, we present an analysis system based on Valued Abstract Argumentation to model and reason about the accepted and rejected opinions. We consider different schemes to weight the opinions of Twitter users, such that we can tune the relevance of opinions considering different information sources from the social network. Towards having a fully automatic system, we also design a relation labeling system for discovering the relation between opinions. Regarding the underlying acceptability semantics, we use ideal semantics to compute accepted/rejected opinions. We define two measures over sets of accepted and rejected opinions to quantify the most controversial discussions. In order to validate our system, we analyze different real Twitter discussions from the political domain. The results show that different weighting schemes produce different sets of socially accepted opinions and that the controversy measures can reveal significant differences between discussions., This work has been partially funded by the Spanish MICINN Projects TIN2014- 53234-C2-2-R, TIN2015-71799-C2-2-P and ENE2015-64117-C5-1-R. The authors would like to thank anonymous reviewers for providing helpful comments to improve the paper.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Performance and usability tradeoff in a cluster display wall

  • Arroyo Campos, Ismael
  • Giné, Francesc
  • Roig Mateu, Concepció
  • Granollers i Saltiveri, Toni
Cluster-based display walls provide cost-effective and scalable display infrastructures with high resolution and large display area, making them suitable for a wide range of high-resolution applications. As a consequence, a wide offer of new cluster display-wall platforms together with their software frameworks have been proposed. Their performance and the satisfaction of their users have aroused the interest of some researchers. This work is focused on the Liquid Galaxy cluster display wall originally built to run Google Earth to create an immersive experience for the users. In this paper, the Liquid Galaxy is benchmarked running Google Earth, as a representative interactive application with high performance requirements, in different configurations and environments, to test the satisfaction, effectiveness and efficiency. Thus, we wish to know how users react to the system performance. In order to do so, we use a performance metric defined in previous research to relate the performance of the system with the user’s perception. Taking into account the trend of this metric in the experimentation, we model the behavior of the system in a way that the performance for any given visualization cluster running Google Earth could be predicted by using a reference system., This work was supported by the MEyC under contracts TIN2014-53234-C2-2-R and TIN2017-84553-C2-2-R.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Scalable Consistency in T-Coffee Through Apache Spark and Cassandra Database

  • Lladós Segura, Jordi
  • Cores Prado, Fernando
  • Guirado Fernández, Fernando
Next-generation sequencing, also known as high-throughput sequencing, has increased the volume of genetic data processed by sequencers. In the bioinformatic scientific area, highly rated multiple sequence alignment tools, such as MAFFT, ProbCons, and T-Coffee (TC), use the probabilistic consistency as a prior step to the progressive alignment stage to improve the final accuracy. However, such methods are severely limited by the memory required to store the consistency information. Big data processing and persistence techniques are used to manage and store the huge amount of information that is generated. Although these techniques have significant advantages, few biological applications have adopted them. In this article, a novel approach named big data tree-based consistency objective function for alignment evaluation (BDT-Coffee) is presented. BDT-Coffee is based on the integration of consistency information through Cassandra database in TC, previously generated by the MapReduce processing paradigm, to enable large data sets to be processed with the aim of improving the performance and scalability of the original algorithm., This work has been supported by the MEyC-Spain under contract Nos. TIN2014-53234-C2- 2-R and TIN2017-84553-C2-2-R.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

An argumentative approach for discovering relevant opinions in Twitter with probabilistic valued relationships

  • Alsinet, Teresa
  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Fernàndez Camon, César
  • Mateu Piñol, Carles
  • Planes Cid, Jordi
Twitter is one of the most widely used social networks when it comes to sharing and criticizing relevant news and events. In order to understand the major opinions accepted and rejected in different domains by Twitter users, in a recent work we developed an analysis system based on valued abstract argumentation to model and reason about the social acceptance of tweets, considering different information sources from the social network. Given a Twitter discussion, the system outputs the set of accepted tweets from the discussion, considering two kinds of relationship between tweets: criticism and support. In this paper, we introduce and investigate a natural extension of the system, in which relationships between tweets are associated with a probability value, indicating the uncertainty that the relationships hold. An important element in our system is the notion of an uncertainty threshold, which characterizes how much uncertainty on probability values we are willing to tolerate: given an uncertainty threshold $\alpha$, we reject criticism and support relationships with probability below $\alpha$. We also extend our analysis system by incorporating support propagation when computing the social relevance of tweets. To this end, we extend the abstract argumentation framework with a new valuation function that propagates the support between tweets by taking into account not only the social relevance of tweets but also the probability that the support relationship holds, provided that it is above the specified uncertainty threshold $\alpha$. In order to test these new extensions, we analyze different Twitter discussions from the political domain. Our analysis shows that the social support of the accepted tweets is typically much stronger than the one for the rejected tweets. Also, the set of accepted tweets seems to be very stable with respect to changes to the social support of the tweets, and therefore even when considering support propagation we mainly observe differences in such set when using the more permissive probability thresholds., This work was partially funded by the Spanish MICINN Projects TIN2014-53234-C2-2- R, TIN2015-71799-C2-2-P and ENE2015-64117-C5-1- R. This research article has received a grant for its linguistic revision from the Language Institute of the University of Lleida (2017 call). The authors would like to thank anonymous reviewers for providing helpful comments to improve the paper.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Optimization of Consistency-Based Multiple Sequence Alignment using Big Data technologies

  • Lladós Segura, Jordi
  • Cores Prado, Fernando
  • Guirado Fernández, Fernando
With the advent of new high-throughput next-generation sequencing technologies, the volume of genetic data processed has increased significantly. It is becoming essential for these applications to achieve large-scale alignments with thousands of sequences or even whole genomes. However, all current MSA tools have exhibited scalability issues when the number of sequences increases. The main drawback of these methods is that errors made in early pairwise alignments are propagated to the nal result, a ecting the accuracy of the global alignment. The use of consistency information enables the nal result to be improved and makes it more stable from the accuracy point of view. However, such methods are severely limited by the memory required to store the consistency information. Authors in a previous work analyzed the structure and distribution of the data stored in the constraint library and demonstrated that it could be possible to reduce it without loosing accuracy and thus it is possible to increase the number of sequences to be aligned. However, the execution time for obtaining the constraint library for a bigger number of sequences also increases greatly. In the present paper, the authors apply Big Data technologies to take advantage of the high degree of parallelism provided by the MapReduce paradigm in order to reduce considerably the library calculation time. Moreover, Big Data infrastructure provides a distributed storage system to improve the library scalability and machine-learning algorithms to enhance the consistency selection policies., This work has been supported by the MEyC-Spain under contract TIN2014-53234-C2-2-R, TIN2017-84553-C2-2-R and TIN2016-81840-REDT.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

TControl: A mobile app to follow up tobacco-quitting patients

  • Pifarré Montalà, Marc
  • Carrera Peruga, Adrián
  • Vilaplana Mayoral, Jordi
  • Cuadrado, Josep
  • Solsona, Sara
  • Abella i Pons, Francesc
  • Solsona Tehàs, Francesc
  • Alves, Rui
Background and Objective Tobacco smoking is a major risk factor for a wide range of respiratory and circulatory diseases in active and passive smokers. Well-designed campaigns are raising awareness to the problem and an increasing number of smokers seeks medical assistance to quit their habit. In this context, there is the need to develop mHealth Apps that assist and manage large smoke quitting programs in efficient and economic ways. Objectives Our main objective is to develop an efficient and free mHealth app that facilitates the management of, and assistance to, people who want to quit smoking. As secondary objectives, our research also aims at estimating the economic effect of deploying that App in the public health system. Methods Using JAVA and XML we develop and deploy a new free mHealth App for Android, called TControl (Tobacco-quitting Control). We deploy the App at the Tobacco Unit of the Santa Maria Hospital in Lleida and determine its stability by following the crashes of the App. We also use a survey to test usability of the app and differences in aptitude for using the App in a sample of 31 patients. Finally, we use mathematical models to estimate the economic effect of deploying TControl in the Catalan public health system. Results TControl keeps track of the smoke-quitting users, tracking their status, interpreting it, and offering advice and psychological support messages. The App also provides a bidirectional communication channel between patients and clinicians via mobile text messages. Additionally, registered patients have the option to interchange experiences with each other by chat. The App was found to be stable and to have high performances during startup and message sending. Our results suggest that age and gender have no statistically significant effect on patient aptitude for using TControl. Finally, we estimate that TControl could reduce costs for the Catalan public health system (CPHS) by up to € 400M in 10 years. Conclusions TControl is a stable and well behaved App, typically operating near optimal performance. It can be used independent of age and gender, and its wide implementation could decrease costs for the public health system., This work was supported by the Ministerio de Economía y Competitividad under contracts TIN2011-28689-C02-02 and TIN2014-53234-C2-2-R. The authors are members of the research group 2014-SGR163, funded by the Generalitat de Catalunya. Besides, this research is partly supported by the European Union FEDER (CAPAP-H5 network TIN2014-53522-REDT).
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Scalable Consistency in T-Coffee Through Apache Spark and Cassandra Database

  • Lladós Segura, Jordi
  • Cores Prado, Fernando
  • Guirado Fernández, Fernando
Next-generation sequencing, also known as high-throughput sequencing, has increased the volume of genetic data processed by sequencers. In the bioinformatic scientific area, highly rated multiple sequence alignment tools, such as MAFFT, ProbCons, and T-Coffee (TC), use the probabilistic consistency as a prior step to the progressive alignment stage to improve the final accuracy. However, such methods are severely limited by the memory required to store the consistency information. Big data processing and persistence techniques are used to manage and store the huge amount of information that is generated. Although these techniques have significant advantages, few biological applications have adopted them. In this article, a novel approach named big data tree-based consistency objective function for alignment evaluation (BDT-Coffee) is presented. BDT-Coffee is based on the integration of consistency information through Cassandra database in TC, previously generated by the MapReduce processing paradigm, to enable large data sets to be processed with the aim of improving the performance and scalability of the original algorithm., This work has been supported by the MEyC-Spain under contract Nos. TIN2014-53234-C2- 2-R and TIN2017-84553-C2-2-R.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

PPCAS: Implementation of a Probabilistic Pairwise Model for Consistency-Based Multiple Alignment in Apache Spark

  • Lladós Segura, Jordi
  • Guirado Fernández, Fernando
  • Cores Prado, Fernando
Large-scale data processing techniques, currently known as Big-Data, are used to manage the huge amount of data that are generated by sequencers. Although these techniques have significant advantages, few biological applications have adopted them. In the Bioinformatic scientific area, Multiple Sequence Alignment (MSA) tools are widely applied for evolution and phylogenetic analysis, homology and domain structure prediction. Highly-rated MSA tools, such as MAFFT, ProbCons and T-Coffee (TC), use the probabilistic consistency as a prior step to the progressive alignment stage in order to improve the final accuracy. In this paper, a novel approach named PPCAS (Probabilistic Pairwise model for Consistency-based multiple alignment in Apache Spark) is presented. PPCAS is based on the MapReduce processing paradigm in order to enable large datasets to be processed with the aim of improving the performance and scalability of the original algorithm., This work was supported by the MEyC-Spain [contract TIN2014-53234-C2-2-R].
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

An argumentative approach for discovering relevant opinions in Twitter with probabilistic valued relationships

  • Alsinet, Teresa
  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Fernàndez Camon, César
  • Mateu Piñol, Carles
  • Planes Cid, Jordi
Twitter is one of the most widely used social networks when it comes to sharing and criticizing relevant news and events. In order to understand the major opinions accepted and rejected in different domains by Twitter users, in a recent work we developed an analysis system based on valued abstract argumentation to model and reason about the social acceptance of tweets, considering different information sources from the social network. Given a Twitter discussion, the system outputs the set of accepted tweets from the discussion, considering two kinds of relationship between tweets: criticism and support. In this paper, we introduce and investigate a natural extension of the system, in which relationships between tweets are associated with a probability value, indicating the uncertainty that the relationships hold. An important element in our system is the notion of an uncertainty threshold, which characterizes how much uncertainty on probability values we are willing to tolerate: given an uncertainty threshold $\alpha$, we reject criticism and support relationships with probability below $\alpha$. We also extend our analysis system by incorporating support propagation when computing the social relevance of tweets. To this end, we extend the abstract argumentation framework with a new valuation function that propagates the support between tweets by taking into account not only the social relevance of tweets but also the probability that the support relationship holds, provided that it is above the specified uncertainty threshold $\alpha$. In order to test these new extensions, we analyze different Twitter discussions from the political domain. Our analysis shows that the social support of the accepted tweets is typically much stronger than the one for the rejected tweets. Also, the set of accepted tweets seems to be very stable with respect to changes to the social support of the tweets, and therefore even when considering support propagation we mainly observe differences in such set when using the more permissive probability thresholds., This work was partially funded by the Spanish MICINN Projects TIN2014-53234-C2-2- R, TIN2015-71799-C2-2-P and ENE2015-64117-C5-1- R. This research article has received a grant for its linguistic revision from the Language Institute of the University of Lleida (2017 call). The authors would like to thank anonymous reviewers for providing helpful comments to improve the paper.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

FingerScanner: Embedding a Fingerprint Scanner in a Raspberry Pi

  • Sapes, Jordi
  • Solsona Tehàs, Francesc
Nowadays, researchers are paying increasing attention to embedding systems. Cost reduction has lead to an increase in the number of platforms supporting the operating system Linux, jointly with the Raspberry Pi motherboard. Thus, embedding devices on Raspberry-Linux systems is a goal in order to make competitive commercial products. This paper presents a low-cost fingerprint recognition system embedded into a Raspberry Pi with Linux, This work was supported by the MEyC under contracts TIN2011-28689-C02-02 and TIN2014-53234-C2-2-R. The authors are members of the research group 2014-SGR163, funded by the Generalitat de Catalunya. Besides, this research was partly supported by the European Union FEDER (CAPAP-H5network TIN2014-53522-REDT).
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Computer-assisted initial diagnosis of rare diseases

  • Alves, Rui
  • Piñol, Marc
  • Vilaplana Mayoral, Jordi
  • Teixidó Torrelles, Ivan
  • Cruz, Joaquim
  • Comas, Jorge
  • Vilaprinyo Terré, Ester
  • Sorribas Tello, Albert
  • Solsona Tehàs, Francesc
Introduction. Most documented rare diseases have genetic origin. Because of their low individual frequency, an initial diagnosis based on phenotypic symptoms is not always easy, as practitioners might never have been exposed to patients suffering from the relevant disease. It is thus important to develop tools that facilitate symptom-based initial diagnosis of rare diseases by clinicians. In this work we aimed at developing a computational approach to aid in that initial diagnosis. We also aimed at implementing this approach in a user friendly web prototype. We call this tool Rare Disease Discovery. Finally, we also aimed at testing the performance of the prototype. Methods. Rare Disease Discovery uses the publicly available ORPHANET data set of association between rare diseases and their symptoms to automatically predict the most likely rare diseases based on a patient’s symptoms. We apply the method to retrospectively diagnose a cohort of 187 rare disease patients with confirmed diagnosis. Subsequently we test the precision, sensitivity, and global performance of the system under different scenarios by running large scale Monte Carlo simulations. All settings account for situations where absent and/or unrelated symptoms are considered in the diagnosis. Results. We find that this expert system has high diagnostic precision (≥80%) and sensitivity (≥99%), and is robust to both absent and unrelated symptoms. Discussion. The Rare Disease Discovery prediction engine appears to provide a fast and robust method for initial assisted differential diagnosis of rare diseases. We coupled this engine with a user-friendly web interface and it can be freely accessed at http://disease-discovery.udl.cat/. The code and most current database for the whole project can be downloaded from https://github.com/Wrrzag/DiseaseDiscovery/tree/no_classifiers., This work was partially supported by the MEyC under contracts TIN2014-53234-C2- 2-R, TIN2011-28689-C02-02 and BFU2010-17704 and by Universitat de Lleida and Departament de Ciències Mèdiques Bàsiques with bridge grants to RA. The authors are members of the research groups 2014-SGR163 and 2014-SGR243, funded by the Generalitat de Catalunya.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

On the Performance of MaxSAT and MinSAT Solvers on 2SAT-MaxOnes

  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Fernàndez Camon, César
  • Mateu Piñol, Carles
  • Planes Cid, Jordi
We analyze and compare two solvers for Boolean optimization problems: WMaxSatz, a solver for Partial MaxSAT, and MinSatz, a solver for Partial MinSAT. Both MaxSAT and MinSAT are similar, but previous results indicate that when solving optimization problems using both solvers, the performance is quite different on some cases. For getting insights about the differences in the performance of the two solvers, we analyze their behaviour when solving 2SAT-MaxOnes problem instances, given that 2SAT-MaxOnes is probably the most simple, but NP-hard, optimization problem we can solve with them. The analysis is based first on the study of the bounds computed by both algorithms on some particular 2SAT-MaxOnes instances, characterized by the presence of certain particular structures. We find that the fraction of positive literals in the clauses is an important factor regarding the quality of the bounds computed by the algorithms. Then, we also study the importance of this factor on the typical case complexity of Random-p 2SAT-MaxOnes, a variant of the problem where instances are randomly generated with a probability p of having positive literals in the clauses. For the case p=0, the performance results indicate a clear advantage of MinSatz with respect to WMaxSatz, but as we consider positive values of p WMaxSatz starts to show a better performance, although at the same time the typical complexity of Random-p 2SAT-MaxOnes decreases as p increases. We also study the typical value of the bound computed by the two algorithms on these sets of instances, showing that the behaviour is consistent with our analysis of the bounds computed on the particular instances we studied first.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Using convolutional neural networks for classification of malware represented as images

  • Gibert Llauradó, Daniel
  • Mateu Piñol, Carles
  • Planes Cid, Jordi
  • Vicens, Ramon
The number of malicious files detected every year are counted by millions. One of the main reasons for these high volumes of different files is the fact that, in order to evade detection, malware authors add mutation. This means that malicious files belonging to the same family, with the same malicious behavior, are constantly modified or obfuscated using several techniques, in such a way that they look like different files. In order to be effective in analyzing and classifying such large amounts of files, we need to be able to categorize them into groups and identify their respective families on the basis of their behavior. In this paper, malicious software is visualized as gray scale images since its ability to capture minor changes while retaining the global structure helps to detect variations. Motivated by the visual similarity between malware samples of the same family, we propose a file agnostic deep learning approach for malware categorization to efficiently group malicious software into families based on a set of discriminant patterns extracted from their visualization as images. The suitability of our approach is evaluated against two benchmarks: the MalImg dataset and the Microsoft Malware Classification Challenge dataset. Experimental comparison demonstrates its superior performance with respect to state-of-the-art techniques., Acknowledgements We would like to thank the Blueliv Labs team, especially Daniel Solís, and Àngel Puigventós for their support and the feedback provided during the development of this work. This work has been partially funded by the Spanish MICINN Projects TIN2014- 53234-C2-2-R, TIN2015-71799-C2-2-P and by AGAUR DI-2016-091.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Weighted argumentation for analysis of discussions in twitter

  • Alsinet, Teresa
  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Fernàndez Camon, César
  • Mateu Piñol, Carles
  • Planes Cid, Jordi
Twitter has become a widely used social network to discuss ideas about many domains. This leads to a growing interest in understanding what are the major accepted or rejected opinions in different domains by social network users. At the same time, checking what are the topics that produce the most controversial discussions among users can be a good tool to discover topics that can be divisive, what can be useful, e.g., for policy makers. With the aim to automatically discover such information from Twitter discussions, we present an analysis system based on Valued Abstract Argumentation to model and reason about the accepted and rejected opinions. We consider different schemes to weight the opinions of Twitter users, such that we can tune the relevance of opinions considering different information sources from the social network. Towards having a fully automatic system, we also design a relation labeling system for discovering the relation between opinions. Regarding the underlying acceptability semantics, we use ideal semantics to compute accepted/rejected opinions. We define two measures over sets of accepted and rejected opinions to quantify the most controversial discussions. In order to validate our system, we analyze different real Twitter discussions from the political domain. The results show that different weighting schemes produce different sets of socially accepted opinions and that the controversy measures can reveal significant differences between discussions., This work has been partially funded by the Spanish MICINN Projects TIN2014- 53234-C2-2-R, TIN2015-71799-C2-2-P and ENE2015-64117-C5-1-R. The authors would like to thank anonymous reviewers for providing helpful comments to improve the paper.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Optimization of Consistency-Based Multiple Sequence Alignment using Big Data technologies

  • Lladós Segura, Jordi
  • Cores Prado, Fernando
  • Guirado Fernández, Fernando
With the advent of new high-throughput next-generation sequencing technologies, the volume of genetic data processed has increased significantly. It is becoming essential for these applications to achieve large-scale alignments with thousands of sequences or even whole genomes. However, all current MSA tools have exhibited scalability issues when the number of sequences increases. The main drawback of these methods is that errors made in early pairwise alignments are propagated to the nal result, a ecting the accuracy of the global alignment. The use of consistency information enables the nal result to be improved and makes it more stable from the accuracy point of view. However, such methods are severely limited by the memory required to store the consistency information. Authors in a previous work analyzed the structure and distribution of the data stored in the constraint library and demonstrated that it could be possible to reduce it without loosing accuracy and thus it is possible to increase the number of sequences to be aligned. However, the execution time for obtaining the constraint library for a bigger number of sequences also increases greatly. In the present paper, the authors apply Big Data technologies to take advantage of the high degree of parallelism provided by the MapReduce paradigm in order to reduce considerably the library calculation time. Moreover, Big Data infrastructure provides a distributed storage system to improve the library scalability and machine-learning algorithms to enhance the consistency selection policies., This work has been supported by the MEyC-Spain under contract TIN2014-53234-C2-2-R, TIN2017-84553-C2-2-R and TIN2016-81840-REDT.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Blacklist muti-objective genetic algorithm for energy saving in heterogeneous environments

  • Gabaldon Ponsa, Eloi
  • Lérida Monsó, Josep Lluís
  • Guirado Fernández, Fernando
  • Planes Cid, Jordi
Reducing energy consumption in large-scale computing facilities has become a major concern in recent years. Most of the techniques have focused on determining the computing requirements based on load predictions and thus turning unnecessary nodes on and off. Nevertheless, once the available resources have been configured, new opportunities arise for reducing energy consumption by providing optimal matching of parallel applications to the available computing nodes. Current research in scheduling has concentrated on not only optimizing the energy consumed by the processors but also optimizing the makespan, i.e., job completion time. The large number of heterogeneous computing nodes and variability of application-tasks are factors that make the scheduling an NP-Hard problem. Our aim in this paper is a multi-objective genetic algorithm based on a weighted blacklist able to generate scheduling decisions that globally optimizes the energy consumption and the makespan., This research is partly supported by the European Union FEDER (CAPAP-H5 network TIN2014-53522-REDT) and MEyC-Spain under contract TIN2014-53234-C2-2-R and TIN2015- 71799-C2-2-P.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Performance and usability tradeoff in a cluster display wall

  • Arroyo Campos, Ismael
  • Giné, Francesc
  • Roig Mateu, Concepció
  • Granollers i Saltiveri, Toni
Cluster-based display walls provide cost-effective and scalable display infrastructures with high resolution and large display area, making them suitable for a wide range of high-resolution applications. As a consequence, a wide offer of new cluster display-wall platforms together with their software frameworks have been proposed. Their performance and the satisfaction of their users have aroused the interest of some researchers. This work is focused on the Liquid Galaxy cluster display wall originally built to run Google Earth to create an immersive experience for the users. In this paper, the Liquid Galaxy is benchmarked running Google Earth, as a representative interactive application with high performance requirements, in different configurations and environments, to test the satisfaction, effectiveness and efficiency. Thus, we wish to know how users react to the system performance. In order to do so, we use a performance metric defined in previous research to relate the performance of the system with the user’s perception. Taking into account the trend of this metric in the experimentation, we model the behavior of the system in a way that the performance for any given visualization cluster running Google Earth could be predicted by using a reference system., This work was supported by the MEyC under contracts TIN2014-53234-C2-2-R and TIN2017-84553-C2-2-R.