Skip to main content

VISUALIZACION Y EXPLORACION BASADA EN FLUJOS Y ANALITICA DE BIG DATA ESPACIAL

PID2019-105221RB-C41

•
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 de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2019
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDADE DA CORUÑA

Resultados relacionados

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

Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

Accessible routes integrating data from multiple sources

  • Luaces, Miguel R.
  • Fisteus, Jesús A.
  • Sánchez Fernández, Luis
  • Munoz Organero, Mario
  • Balado Frías, Jesús
  • Díaz Vilariño, Lucía
  • Lorenzo Cimadevila, Henrique Remixio
Providing citizens with the ability to move around in an accessible way is a requirement for all cities today. However, modeling city infrastructures so that accessible routes can be computed is a challenge because it involves collecting information from multiple, large-scale and heterogeneous data sources. In this paper, we propose and validate the architecture of an information system that creates an accessibility data model for cities by ingesting data from different types of sources and provides an application that can be used by people with different abilities to compute accessible routes. The article describes the processes that allow building a network of pedestrian infrastructures from the OpenStreetMap information (i.e., sidewalks and pedestrian crossings), improving the network with information extracted obtained from mobile-sensed LiDAR data (i.e., ramps, steps, and pedestrian crossings), detecting obstacles using volunteered information collected from the hardware sensors of the mobile devices of the citizens (i.e., ramps and steps), and detecting accessibility problems with software sensors in social networks (i.e., Twitter). The information system is validated through its application in a case study in the city of Vigo (Spain)., Ministerio de Economía, Industria y Competitividad | Ref. TIN2016-77158-C4-1-R, Ministerio de Economía, Industria y Competitividad | Ref. TIN2016-77158- C4-2-R, Ministerio de Economía, Industria y Competitividad | Ref. TIN2016-77158-C4-3-R, Agencia Estatal de Investigación | Ref. PID2019-105221RB-C41, Agencia Estatal de Investigación | Ref. PID2019-105221RB-C43, Agencia Estatal de Investigación | Ref. PID2019-105221RB-C44, Xunta de Galicia | Ref. ED431C 2017/58, Xunta de Galicia | Ref. IN852A 2018/14, Xunta de Galicia | Ref. ED431G 2019/01, Xunta de Galicia | Ref. ED481B-2019-061, Xunta de Galicia | Ref. ED481D 2019/020
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

ViQUF: De Novo Viral Quasispecies Reconstruction Using Unitig-Based Flow Networks

  • Freire, Borja
  • Ladra, Susana
  • Paramá, José R.
  • Salmela, Leena
This is the Accepted manuscript os the article; This version of the article has been accepted for publication, after peer review. The Version of Record is available online at: https://doi.org/10.1109/TCBB.2022.3190282., ViQUF is freely available at: https://github.com/borjaf696/ViQUF., [Abstract] During viral infection, intrahost mutation and recombination can lead to significant evolution, resulting in a population of viruses that harbor multiple haplotypes. The task of reconstructing these haplotypes from short-read sequencing data is called viral quasispecies assembly, and it can be categorized as a multiassembly problem. We consider the de novo version of the problem, where no reference is available. We present ViQUF, a de novo viral quasispecies assembler that addresses haplotype assembly and quantification. ViQUF obtains a first draft of the assembly graph from a de Bruijn graph. Then, solving a min-cost flow over a flow network built for each pair of adjacent vertices based on their paired-end information creates an approximate paired assembly graph with suggested frequency values as edge labels, which is the first frequency estimation. Then, original haplotypes are obtained through a greedy path reconstruction guided by a min-cost flow solution in the approximate paired assembly graph . ViQUF outputs the contigs with their frequency estimations. Results on real and simulated data show that ViQUF is at least four times faster using at most half of the memory than previous methods, while maintaining, and in some cases outperforming, the high quality of assembly and frequency estimation of overlap graph-based methodologies, which are known to be more accurate but slower than the de Bruijn graph-based approaches., This work has received funding from the EU H2020 under the Marie Sklodowska-Curie [GA 690941]. We wish to acknowledge the support received from the Centro de Investigación de Galicia “CITIC”, funded by Xunta de Galicia and the European Union (European Regional Development Fund- Galicia 2014-2020 Program), by grant ED431G 2019/01. This work was also supported by Xunta de Galicia/FEDER-UE under Grants [ED431C 2021/53; IG240.2020.1.185; IN852A 2018/14]; Ministerio de Ciencia e Innovación under Grants [TIN2016-78011-C4-1-R; FPU17/02742; PID2019-105221RB-C41; PID2020-114635RBI00]; and the Academy of Finland [grants 308030 and 323233 (LS)]. The authors also thank David Posada for his advice on viral evolution., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IG240.2020.1.185, Xunta de Galicia; IN852A 2018/14, Finlandia. Academy of Finland; 308030, Finlandia. Academy of Finland; 323233, https://github.com/borjaf696/ViQUF
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Space/time-efficient RDF stores based on circular suffix sorting

  • Brisaboa, Nieves R.
  • Cerdeira-Pena, Ana
  • Bernardo, Guillermo de
  • Fariña, Antonio
  • Navarro, Gonzalo
This version of the article has been accepted for publication, after peer review and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s11227-022-04890-w, [Abstract]: The resource description framework (RDF) has gained popularity as a format for the standardized publication and exchange of information in the Web of Data. In this paper, we introduce RDFCSA, a compressed representation of RDF datasets that in addition supports efficient querying. RDFCSA regards the triples of the RDF store as short circular strings and applies suffix sorting on those strings, so that triple-pattern queries reduce to prefix searching on the string set. The RDF store is then represented compactly using a compressed suffix array (CSA), a proved technology in text indexing that efficiently supports prefix searches. Our experiments show that RDFCSA is competitive with state-of-the-art alternatives. It compresses the raw data to 60% of its size, close to the most compact alternatives. While most alternatives perform better in some kinds of triple-patterns than in others, RDFCSA features fast and consistent query times, a few microseconds per result in all cases. This enables efficiently supporting join queries by using either merge- or chaining-join strategies over the triple patterns coupled with some specific optimizations such as variable filling. Our experiments on binary joins show that RDFCSA is faster than the alternatives in most cases., Funding for the Spanish group: projects funded by MCIN/ AEI/10.13039/501100011033: PDC2021-121239-C31 (FLATCITY-POC)-“NextGenerationEU”/PRTR; PDC2021-120917-C21 (SIGTRANS)-“NextGenerationEU”/PRTR; PID2020-114635RB-I00 (EXTRACompact); PID2019-105221RB-C41 (MAGIST); PID2021-122554OB-C33 (OASSIS-UDC); and TED2021-129245B-C21 (PLAGEMIS-UDC); grant ED431C 2021/53 (GRC) funded by GAIN/Xunta de Galicia; and grant ED431G 2019/01 (CSI) funded by Xunta de Galicia, FEDER Galicia 2014-2020 80%, SXU 20%; Gonzalo Navarro is partially funded by Fondecyt 1-200038, and by ANID - Millennium Science Initiative Program - Code ICN17 002., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431G 2019/01, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1-200038., Chile. Agencia National de Investigación y Desarrollo; ICN17_002
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Deep Learning Models for Real-Life Human Activity Recognition From Smartphone Sensor Data

  • García-González, Daniel
  • Rivero, Daniel
  • Fernández-Blanco, Enrique
  • Rodríguez Luaces, Miguel
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, Data availability: The original complete dataset, as well as some of the scripts used to preprocess its data, can be found online at http://lbd.udc.es/research/real-life-HAR-dataset. Likewise, these have also been uploaded to Mendeley Data (https://data.mendeley.com/datasets/3xm88g6m6d/2). In addition, the code used for the entire data preparation and experimentation in this work is available online at http://gitlab.lbd.org.es/dgarcia/deep-learning-models-har, [Abstract]: Nowadays, the field of human activity recognition (HAR) is a remarkably hot topic within the scientific community. Given the low cost, ease of use and high accuracy of the sensors from different wearable devices and smartphones, more and more researchers are opting to do their bit in this area. However, until very recently, all the work carried out in this field was done in laboratory conditions, with very few similarities with our daily lives. This paper will focus on this new trend of integrating all the knowledge acquired so far into a real-life environment. Thus, a dataset already published following this philosophy was used. In this way, this work aims to be able to identify the different actions studied there. In order to perform this classification, this paper explores new designs and architectures for models inspired by the ones which have yielded the best results in the literature. More specifically, different configurations of Convolutional Neural Networks (CNN) and Long-Short Term Memory (LSTM) have been tested, but on real-life conditions instead of laboratory ones. It is worth mentioning that the hybrid models formed from these techniques yielded the best results, with a peak accuracy of 94.80% on the dataset used., This research was partially funded by MCIN/AEI/10.13039/501100011033, NextGenerationEU/PRTR, FLATCITY-POC, Spain [grant number PDC2021-121239-C31]; MCIN/AEI/10.13039/501100011033 MAGIST, Spain [grant number PID2019-105221RB-C41]; Xunta de Galicia/FEDER-UE, Spain [grant numbers ED431G 2019/01, ED481A 2020/003, ED431C 2022/46, ED431C 2018/49 and ED431C 2021/53]. Funding for open access charge: Universidade da Coruña/CISUG ., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED481A 2020/003, Xunta de Galicia; ED431C 2022/46, Xunta de Galicia; ED431C 2018/49, Xunta de Galicia; ED431C 2021/53
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Faster compressed quadtrees

  • Bernardo, Guillermo de
  • Gagie, Travis
  • Ladra, Susana
  • Navarro, Gonzalo
  • Seco, Diego
©2023 Elsevier B.V. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/byncnd/ 4.0/. This version of the article has been accepted for publication in Future Generation Computer Systems. The Version of Record is available online at https:// doi.org/10.1016/j.jcss.2022.09.001, Versión aceptada, An early partial version of this paper appeared in Proc. of the Data Compression Conference 2015., [Abstract]: Real-world point sets tend to be clustered, so using a machine word for each point is wasteful. In this paper we first show how a compact representation of quadtrees using O(1) bits per node can break this bound on clustered point sets, while offering efficient range searches. We then describe a new compact quadtree representation based on heavy-path decompositions, which supports queries faster than previous compact structures. We present experimental evidence showing that our structure is competitive in practice., Partially funded by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 690941. GdB and SL funded by MCIN/AEI/10.13039/501100011033 [grants PID2020-114635RB-I00 (EXTRACompact), PID2019-105221RB-C41 (MAGIST)], by MCIN/AEI/10.13039/501100011033, “NextGenerationEU/PRTR” [grants PDC2021-120917-C21 (SIGTRANS) , PDC2021-121239-C31 (FLATCITY-POC)], by GAIN/Xunta de Galicia [grant ED431C 2017/53 (GRC) ], and also supported by the Centro de Investigación de Galicia “CITIC”, funded by Xunta de Galicia , FEDER Galicia 2014-2020 80%, SXU 20% [grant ED431G 2019/01 (CSI) ]. TG funded by NSERC Discovery Grant RGPIN-07185-2020. GN and DS funded by ANID - Millennium Science Initiative Program - Code ICN17_002 , Chile. GN funded by FONDECYT Grant 1-200038 , Chile., Xunta de Galicia; ED431C 2017/53, Xunta de Galicia; ED431G 2019/01, Natural Sciences and Engineering Research Council of Canada; RGPIN-07185-2020, Chile. Agencia Nacional de Investigación y Desarrollo; ICN17_002, Chile. Comisión Nacional de Investigación Científica y Tecnológica; 1-200038
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Development of Digital Libraries with Software Product Line Engineering

  • Ramos-Vidal, Delfina
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
[Abstract]: Digital Libraries have become popular nowadays since important libraries all over the world started distributing their collections online, properly classified, and, in many cases, with access to the digital version of the resource. These programs have been beneficial to the general population as well as research groups in fields such as language and literature. Nonetheless, since their creation is a time-consuming and costly process, small organizations are forced to rely on obsolete or poorly designed software. However, most of the features, including the data model, are shared by this type of system, with minor variations depending on the type of resources to be handled. This article presents a Software Product Line (SPL) for the semi-automatic generation of Digital Libraries (DL). Our SPL allows developers to specify which DL features are required, which will define the data model variation and the generated source code. The specification is then transformed into a fully functional DL application with the specified features that is ready for deployment. We present the feature model, the SPL implementation, and a case study on three sample projects that enabled us to evaluate the resulting software, with a focus on development effort savings., Partially funded by: Xunta de Galicia GRC: ED431C 2021/53; MICIU/FEDER-UE, MAGIST: PID2019-105221RBC41; MICIU/FEDER-UE, EXTRACompact: PID2020-114635RB-I00; MIC IU/FEDER-UE BIZDEVOPSGLOBAL: RTI-2018-098309-B-C32; Xunta de Galicia/FEDER-UE, ConectaPeme, GEMA: IN852A 2018/14; MICIU/FEDER-UE, Red Aracne-Nodus, RED2018-102755-T; CITIC research centre funded by XUNTA and EU through the European Regional Development Fund- Galicia 2014–2020 Program, grant ED431G 2019/01., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IN852A 2018/14, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Accessible Routes Integrating Data from Multiple Sources

  • Rodríguez Luaces, Miguel
  • Arias Fisteus, Jesús
  • Sánchez-Fernández, Luis
  • Muñoz-Organero, Mario
  • Balado, Jesús
  • Díaz-Vilariño, Lucía
  • Lorenzo, Henrique
[Abstract] Providing citizens with the ability to move around in an accessible way is a requirement for all cities today. However, modeling city infrastructures so that accessible routes can be computed is a challenge because it involves collecting information from multiple, large-scale and heterogeneous data sources. In this paper, we propose and validate the architecture of an information system that creates an accessibility data model for cities by ingesting data from different types of sources and provides an application that can be used by people with different abilities to compute accessible routes. The article describes the processes that allow building a network of pedestrian infrastructures from the OpenStreetMap information (i.e., sidewalks and pedestrian crossings), improving the network with information extracted obtained from mobile-sensed LiDAR data (i.e., ramps, steps, and pedestrian crossings), detecting obstacles using volunteered information collected from the hardware sensors of the mobile devices of the citizens (i.e., ramps and steps), and detecting accessibility problems with software sensors in social networks (i.e., Twitter). The information system is validated through its application in a case study in the city of Vigo (Spain)., This work was supported in part by the project Friendly barrierLess AdapTable City (FLATCity) (Ministerio de Ciencia, innovación y Universidades/ERDF, EU) funded by the Spanish Agencia Estatal de Investigación (AEI, doi 10.13039/501100011033), and in part by the European Regional Development Fund (ERDF), under Grants TIN2016-77158-C4-1-R, TIN2016-77158-C4-2-R and TIN2016-77158-C4-3-R. This work was also supported in part by the project Massive Geospatial Data Storage and Processing for Intelligent and Sustainable Urban Transportation (MaGIST), funded by the Spanish Agencia Estatal de Investigación (AEI, doi 10.13039/501100011033) under grants PID2019-105221RB-C41, PID2019-105221RB-C43 and PID2019-105221RB-C44. The research of Miguel R. Luaces was also partially founded by: Xunta de Galicia/FEDER-UE GRC: ED431C 2017/58 and Xunta de Galicia/FEDER-UE, ConectaPeme, GEMA: IN852A 2018/14. Miguel R. Luaces also wishes to acknowledge the support received from the Centro de Investigación de Galicia “CITIC”, funded by Xunta de Galicia and the European Union (European Regional Development Fund- Galicia 2014-2020 Program), by grant ED431G 2019/01. Jesús Balado and Lucía Díaz-Vilariño would like to thank to the Xunta de Galicia given through human resources grants ED481B-2019-061 and ED481D 2019/020, respectively, Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; IN852A 2018/14, Xunta de Galicia; ED481B-2019-061, Xunta de Galicia; ED481D2019/020, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Space-Efficient Representations of Raster Time Series

  • Silva-Coira, Fernando
  • Paramá, José R.
  • Bernardo, Guillermo de
  • Seco, Diego
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract] Raster time series, a.k.a. temporal rasters, are collections of rasters covering the same region at consecutive timestamps. These data have been used in many different applications ranging from weather forecast systems to monitoring of forest degradation or soil contamination. Many different sensors are generating this type of data, which makes such analyses possible, but also challenges the technological capacity to store and retrieve the data. In this work, we propose a space-efficient representation of raster time series that is based on Compact Data Structures (CDS). Our method uses a strategy of snapshots and logs to represent the data, in which both components are represented using CDS. We study two variants of this strategy, one with regular sampling and another one based on a heuristic that determines at which timestamps should the snapshots be created to reduce the space redundancy. We perform a comprehensive experimental evaluation using real datasets. The results show that the proposed strategy is competitive in space with alternatives based on pure data compression, while providing much more efficient query times for different types of queries., The data used in this study were acquired as part of the mission of NASA’s Earth Science Division and archived and distributed by the Goddard Earth Sciences (GES) Data and Information Services Center (DISC). Funding: CITIC, as Research Center accredited by Galician University System, is funded by “Consellería de Cultura, Educación e Universidade from Xunta de Galicia”, supported in an 80% through ERDF Funds, ERDF Operational Programme Galicia 2014-2020, and the remaining 20% by “Secretaría Xeral de Universidades” (Grant ED431G 2019/01). This work was also supported by Xunta de Galicia/FEDER-UE under Grants [IG240.2020.1.185; IN852A 2018/14]; Ministerio de Ciencia, Innovación y Universidades under Grants [TIN2016-78011-C4-1-R; RTC-2017-5908-7; PID2019- 105221RB-C41/AEI/10.13039/501100011033]; ANID - Millennium Science Initiative Program - Code ICN17_002; Programa Iberoamericano de Ciencia y Tecnología para el Desarrollo (CYTED) [Grant No. 519RT0579], Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; IG240.2020.1.185, Xunta de Galicia; IN852A 2018/14, Chile. Agencia Nacional de Investigación y Desarrollo; ICN17_002
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Map algebra on raster datasets represented by compact data structures

  • Silva-Coira, Fernando
  • Paramá, José R.
  • Ladra, Susana
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract]: The increase in the size of data repositories has forced the design of new computing paradigms to be able to process large volumes of data in a reasonable amount of time. One of them is in-memory computing, which advocates storing all the data in main memory to avoid the disk I/O bottleneck. Compression is one of the key technologies for this approach. For raster data, a compact data structure, called (Formula presented.) -raster, have been recently been proposed. It compresses raster maps while still supporting fast retrieval of a given datum or a portion of the data directly from the compressed data. (Formula presented.) -raster's original work introduced several queries in which it was superior to competitors. However, to be used as the basis of an in-memory system for raster data, it is mandatory to demonstrate its efficiency when performing more complex operations such as the map algebra operators. In this work, we present the algorithms to run a set of these operators directly on (Formula presented.) -raster without a decompression procedure., This work was supported by the National Natural Science Foundation of China (Grant Nos. 31171944, 31640068), Anhui Provincial Natural Science Foundation (Grant No. 2019B319), Earmarked Fund for Anhui Science and Technology Major Project (202003b06020016). Information CITIC, Ministerio de Ciencia e Innovación, Grant/Award Numbers: PID2020-114635RB-I00; PDC2021-120917-C21; PDC2021-121239-C31; PID2019-105221RB-C41; TED2021-129245-C21; Xunta de Galicia, Grant/Award Numbers: ED431C 2021/53; IN852D 2021/3 (CO3)This work was partially supported by CITIC, CITIC is funded by the Xunta de Galicia through the collaboration agreement between the Department of Culture, Education, Vocational Training and Universities and the Galician universities for the reinforcement of the research centers of the Galician University System (CIGUS). IN852D 2021/3(CO3): partially funded by UE, (ERDF), GAIN, convocatoria Conecta COVID. GRC: ED431C 2021/53: partially funded by GAIN/Xunta de Galicia. TED2021-129245B-C21; PDC2021-121239-C31; PDC2021-120917-C21: partially funded by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR. PID2020-114635RB-I00; PID2019-105221RB-C41: partially funded by MCIN/AEI/10.13039/501100011033. Funding for open access charge: Universidadeda Coruña/CISUG., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IN852D 2021/3 (CO3), National Natural Science Foundation of China; 31171944, National Natural Science Foundation of China; 31640068, Anhui Provincial Natural Science Foundation; 2019B319
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

New machine learning approaches for real-life human activity recognition using smartphone sensor-based data

  • García-González, Daniel
  • Rivero, Daniel
  • Fernández-Blanco, Enrique
  • Rodríguez Luaces, Miguel
Financiado para publicar en acceso aberto. Universidade da Coruña/CISUG, [Abstract]: In recent years, mainly due to the application of smartphones in this area, research in human activity recognition (HAR) has shown a continuous and steady growth. Thanks to its wide range of sensors, its size, its ease of use, its low price and its applicability in many other fields, it is a highly attractive option for researchers. However, the vast majority of studies carried out so far focus on laboratory settings, outside of a real-life environment. In this work, unlike in other papers, progress was sought on the latter point. To do so, a dataset already published for this purpose was used. This dataset was collected using the sensors of the smartphones of different individuals in their daily life, with almost total freedom. To exploit these data, numerous experiments were carried out with various machine learning techniques and each of them with different hyperparameters. These experiments proved that, in this case, tree-based models, such as Random Forest, outperform the rest. The final result shows an enormous improvement in the accuracy of the best model found to date for this purpose, from 74.39% to 92.97%., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED481A 2020/003, Xunta de Galicia; ED431C 2022/46, Xunta de Galicia; ED431C 2018/49, Xunta de Galicia; ED431C 2021/53, This research was partially funded by MCIN/AEI/10.13039/ 501100011033, NextGenerationEU/PRTR, FLATCITY-POC , Spain [grant number P DC2021-121239-C31]; MCIN/AEI/10.13039/ 501100011033 MAGIST, Spain [grant number P ID2019-105221RB-C41]; Xunta de Galicia/FEDER-UE, Spain [grant numbers ED431G 2019/01 , ED481A 2020/003 , ED431C 2022/46 , ED431C 2018/49 and ED431C 2021/53 ]. Funding for open access charge: Universidade da Coruña/CISUG.
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Memory-Efficient Assembly Using Flye

  • Freire, Borja
  • Ladra, Susana
  • Paramá, José R.
This is the Accepted manuscript os the article; This version of the article has been accepted for publication, after peer review. The Version of Record is available online at: https://doi.org/10.1109/TCBB.2021.3108843 ., [Abstract]: In the past decade, next-generation sequencing (NGS) enabled the generation of genomic data in a cost-effective, high-throughput manner. The most recent third-generation sequencing technologies produce longer reads; however, their error rates are much higher, which complicates the assembly process. This generates time- and space- demanding long-read assemblers. Moreover, the advances in these technologies have allowed portable and real-time DNA sequencing, enabling in-field analysis. In these scenarios, it becomes crucial to have more efficient solutions that can be executed in computers or mobile devices with minimum hardware requirements. We re-implemented an existing assembler devoted for long reads, more concretely Flye, using compressed data structures. We then compare our version with the original software using real datasets, and evaluate their performance in terms of memory requirements, execution speed, and energy consumption. The assembly results are not affected, as the core of the algorithm is maintained, but the usage of advanced compact data structures leads to improvements in memory consumption that range from 22% to 47% less space, and in the processing time, which range from being on a par up to decreases of 25%. These improvements also cause reductions in energy consumption of around 3–8%, with some datasets obtaining decreases up to 26%., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; IG240.2020.1.185, Xunta de Galicia; IN852A 2018/14, This research has received funding from: the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie [grant agreement No 690941]; CITIC Research Center, funded by “Consellería de Cultura, Educaci ón e Universidade from Xunta de Galicia”, supported in an 80% through ERDF Funds, ERDF Operational Programme Galicia 2014-2020, and the remaining 20% by “Secretaría Xeral de Universidades” (Grant ED431G 2019/01); Xunta de Galicia/FEDER-UE under Grants [IG240.2020.1.185; IN852A 2018/14] and Ministerio de Ciencia e Innovación under Grants [TIN2016-78011-C4-1-R; PID2019-105221RB-C41; PID2020-114635RB- I00; FPU17/02742].
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

A practical succinct dynamic graph representation

  • Coimbra, Miguel E.
  • Hrotkó, Joana
  • Francisco, Alexandre P.
  • Russo, Luís M.S.
  • Bernardo, Guillermo de
  • Ladra, Susana
  • Navarro, Gonzalo
©2022 Elsevier B.V. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/byncnd/ 4.0/. This version of the article has been accepted for publication in Future Generation Computer Systems. The Version of Record is available online at https:// doi.org/10.1016/j.ic.2021.104862, [Abstract]: We address the problem of representing dynamic graphs using k2-trees. The k2-tree data structure is one of the succinct data structures proposed for representing static graphs, and binary relations in general. It relies on compact representations of bit vectors. Hence, by relying on compact representations of dynamic bit vectors, we can also represent dynamic graphs. However, this approach suffers of a well known bottleneck in compressed dynamic indexing. In this paper we present a k2-tree based implementation which follows instead the ideas by Munro et al. (PODS 2015) to circumvent this bottleneck. We present two dynamic graph k2-tree implementations, one as a standalone implementation and another as a C++ library. The library includes efficient edge and neighbourhood iterators, as well as some illustrative algorithms. Our experimental results show that these implementations are competitive in practice., This work was supported by the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie [grant agreement No. 690941 ], namely while the first, third and fourth authors were visiting either the University of Chile or Enxenio SL. This work was partially funded by Fundação para a Ciência e a Tecnologia (FCT) [grants PTDC/CCI-BIO/29676/2017, PTDC/CPO-CPO/28495/2017, CMUP-ERI/TIC/0046/2014, UIDB/50021/2020 ], by MCIN-AEI/10.13039/501100011033 (PGE and ERDF) [grants RTC-2017-5908-7, PID2019-105221RB-C41, PID2020-114635RB-I00 ], by MCIN-AEI “NextGenerationEU”/PRTR [grants PDC2021-120917-C21, PDC2021-121239-C31 ], by Xunta de Galicia /GAIN (co-funded by ERDF) [grant ED431C 2021/53 ], and by ANID - Millennium Science Initiative Program - Code ICN17_002 . We also wish to acknowledge the support received from the Centro de Investigación de Galicia “CITIC”, funded by Xunta de Galicia , FEDER Galicia 2014-2020 80%, SXU 20% [grant ED431G 2019/01 ]., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431G 2019/01, Portugal. Fundação para a Ciência e a Tecnologia; PTDC/CCI-BIO/29676/2017, Portugal. Fundação para a Ciência e a Tecnologia; PTDC/CPO-CPO/28495/2017, Portugal. Fundação para a Ciência e a Tecnologia; CMUP-ERI/TIC/0046/2014, Portugal. Fundação para a Ciência e a Tecnologia; UIDB/50021/2020, Chile. Agencia Nacional de Investigacion y Desarrollo; ICN17_002
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Classic Distance Join Queries Using Compact Data Structures

  • Bernardo, Guillermo de
  • Penabad, Miguel R.
  • Corral, Antonio
  • Brisaboa, Nieves R.
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract] Distance-based Join Queries (DJQs) have multiple applications in spatial databases, Geographic Information Systems, and other areas. The 𝐾 Closest Pairs Query (𝐾CPQ) and the 𝜀 Distance Join Query (𝜀DJQ) are well-known DJQs that have been widely studied and can be solved using plane-sweep techniques, which are efficient but must keep the whole datasets in main memory. In this work, we propose DJQ algorithms that work with data represented using a 𝑘2-tree, a compact data structure for binary grids. Our algorithms solve 𝐾CPQ and 𝜀DJQ queries, as well as several window-constrained variants, taking advantage of the indexing capabilities of 𝑘2-trees to efficiently answer queries without the need to decompress the data. Our experimental evaluation with large datasets shows that 𝑘2-tree algorithms are up to 5 times faster than plane-sweep algorithms in 𝐾CPQ, and 5–30 times faster in 𝜀DJQ. In variants that are window-constrained, our algorithms are competitive in most scenarios and faster for large windows. Additionally, our algorithms are not very affected by the distribution of the data and yield much more predictable query times, showing up to 30 times smaller variance in query times than plane sweep, depending on the location of the query window., Guillermo de Bernardo, Miguel R. Penabad and Nieves R. Brisaboa are partially funded by MCIN/AEI/10.13039/501100011033 and EU/ERDF A way of making Europe [PID2021-122554OB-C33 (OASSIS)]; by MCIN/AEI/10.13039/501100011033 [PID2020-114635RB-I00 (EXTRACompact), PID2019-105221RB-C41 (MAGIST)]; by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR [TED2021-129245B-C21 (PLAGEMIS), PDC2021-121239-C31 (FLATCITY-POC), PDC2021-120917-C21 (SIGTRANS)]; and by GAIN/Xunta de Galicia [ED431C 2021/53]. CITIC is funded by the Xunta de Galicia through the collaboration agreement between the Department of Culture, Education, Vocational Training and Universities and the Galician universities for the reinforcement of the research centers of the Galician University System (CIGUS) [ED431G 2019/01 (CSI)]. The work by Antonio Corral was partially funded by the EU ERDF and the Andalusian Government (Spain) under the project UrbanITA (ref. PY20_00809) and grant PID2021-124124OB-I00 funded by the Spanish Government MCIN/AEI/10.13039/501100011033 and the “ERDF A way of making Europe”. Funding for open access charge: Universidade da Coruña/CISUG., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Compressed and queryable self-indexes for RDF archives

  • Cerdeira-Pena, Ana
  • Bernardo, Guillermo de
  • Fariña, Antonio
  • Fernández, Javier D.
  • Martínez-Prieto, Miguel A.
This version of the article has been accepted for publication, after peer review and is subject to Knowledge and Information Systems , but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s10115-023-01967-7, [Abstract]: RDF compression and querying are consolidated topics in the Web of Data, with a plethora of solutions to efficiently store and query static datasets. However, as RDF data changes along time, it becomes necessary to keep different versions of RDF datasets, in what is called an RDF archive. For large RDF datasets, naive techniques to store these versions lead to significant scalability problems. In this paper, we present v-RDF-SI, one of the first RDF archiving solutions that aim at joining both compression and fast querying. In v-RDF-SI, we extend existing RDF representations based on compact data structures to provide efficient support of version-based queries in compressed space. We present two implementations of v-RDF-SI, named v-RDFCSA and v-HDT, based, respectively, on RDFCSA (an RDF self-index) and HDT (a W3C-supported compressed RDF representation). We experimentally evaluate v-RDF-SI over a public benchmark named BEAR, showing that v-RDF-SI drastically reduces space requirements, being up to 40 times smaller than the baselines provided by BEAR, and 4 times smaller than alternatives based on compact data structures, while yielding significantly faster query times in most cases. On average, the fastest variants of v-RDF-SI outperform the alternatives by almost an order of magnitude., The first three co-authors are members of the CITIC, which, as Research Center accredited by the Galician University System, is funded by Consellería de Cultura, Educación e Universidades from Xunta de Galicia, supported in an 80% through ERDF Funds, ERDF Operational Programme Galicia 2014–2020, and the remaining 20% by Secretaría Xeral de Universidades [Grant ED431G 2019/01]. The Spanish group is also funded by Xunta de Galicia/FEDER-UE [ED431C 2021/53]; by MICINN [Magist: PID2019-105221RB-C41; FLATCity-POC: PDC2021-121239-C31; SIGTRANS: PDC2021-120917-C21; EXTRA-Compact: PID2020-114635RB-I00; PID2019-105221RB-C41]; by MCIU-AEI/FEDER-UE [BIZDEVOPS: RTI2018-098309-B-C32]; and by Xunta de Galicia/Igape/IG240.2020.1.185., Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

A Compact Representation of Indoor Trajectories

  • Fariña, Antonio
  • Gutiérrez-Asorey, Pablo
  • Ladra, Susana
  • Penabad, Miguel R.
  • Varela Rodeiro, Tirso
[Abstract]: We present a system that combines indoor positioning with a compression algorithm for trajectories in the context of a nursing home. Our aim is to gather and effectively represent the location of the residents and caregivers along time, while allowing for efficient access to those data. We briefly show the system architecture that enables the automatic tracking of user’s movements and consequently the gathering of their locations. Then, we present indRep, our compact representation to handle positioning data using grammar-based compression, and provide two basic operations that enable pseudo-random access to the data. Finally, we include experiments that show that indRep is competitive with well-know general-purpose compressors in terms of compression effectiveness and also provides fast access to the compressed data. We expect both features would enable exploitation functionalities even in computers with rather low computational resources., Partially funded by the CITIC research center funded by Xunta/FEDER-UE 2014-2020 Program, grant ED431G 2019/01. MICIU(PGE/ERDF) [MaGIST: PID2019-105221RB-C41; Datos 4.0: TIN2016-78011-C4-1- R; STEPS: RTC-2017-5908-7; BIZDEVOPS: RTI2018-098309-B-C32]. MICINN(PGE/ERDF) [EXTRA-Compact: PID2020-114635RB-I00]. Xunta/GAIN(ERDF) [CEDCOVID: COV20/00604; GRC: ED431C 2021/53] and by FPI Program [BES-2017-081390]., Xunta de Galicia: ED431G 2019/01, Xunta de Galicia: ED431C 2021/53
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Fed-mRMR: A lossless federated feature selection method

  • Hermo González, Jorge
  • Bolón-Canedo, Verónica
  • Ladra, Susana
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, Implementation can be found at: https://github.com/jorgehermo9/fed-mrmr, [Abstract]: Feature selection has become a mandatory task in data mining, due to the overwhelming amount of features in Big Data problems. To handle this high-dimensional data and avoid the well-known curse of dimensionality, we need to pre-select an optimal subset of features to reduce redundant computations. Federated learning is a machine learning technique based on training an algorithm over many decentralized edge devices holding local rather than global data on a centralized server. Application of this technique is extending to fields such as self-driving cars, medicine and health, and Industry 4.0, where data privacy is compulsory. Feature selection through federated learning is a complicated task since suboptimal features calculated by feature selection methods may be different in heterogeneous datasets from different nodes. In this paper, we propose a lossless federated version of the classic minimum redundancy maximum relevance (mRMR) feature selection algorithm, called federated mRMR (fed-mRMR), which, without losing any effectiveness of the original mRMR method, is applicable to federated learning approaches and capable of dealing with data that are not independent and identically distributed (non-IID data). Implementation can be found at: https://github.com/jorgehermo9/fed-mrmr, This work was supported by CITIC, a Research Center accredited by the Galician University System, funded by the Xunta de Galicia Consellería de Cultura, Educación e Universidade, supported 80% by ERDF/FEDER funds (Operational Programme Information Sciences 669 (2024) 120609 14 J. Hermo, V. Bolón-Canedo and S. Ladra Galicia 2014-2020) and 20% by the Xunta de Galicia Secretaría Xeral de Universidades (Grant ED431G 2019/01). It was also partially funded by the Xunta de Galicia and ERDF/FEDER (Grants ED431C 2021/53; ED431C 2022/44), the Spanish Ministerio de Ciencia e Innovación (MCIN/AEI/10.13039/501100011033) and NextGenerationEU/PRTR (Grants PDC2021-121239-C31; PID2019-105221RB-C41; PID2019-109238GB-C22; PID2022-141027NB-C2; TED2021-130599A-I00; TSI-100925-2023-1). A department collaboration grant awarded by Universidade de A Coruña also supported this research., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; ED431C 2022/44
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Combining Multiple Granularity Variability in a Software Product Line Approach for Web Engineering

  • Horcas Aguilera, José Miguel
  • Cortiñas, Alejandro
  • Fuentes, Lidia
  • Rodríguez Luaces, Miguel
[Abstract] Context: Web engineering involves managing a high diversity of artifacts implemented in different languages and with different levels of granularity. Technological companies usually implement variable artifacts of Software Product Lines (SPLs) using annotations, being reluctant to adopt hybrid, often complex, approaches combining composition and annotations despite their benefits. Objective: This paper proposes a combined approach to support fine and coarse-grained variability for web artifacts. The proposal allows web developers to continue using annotations to handle fine-grained variability for those artifacts whose variability is very difficult to implement with a composition-based approach, but obtaining the advantages of the composition-based approach for the coarse-grained variable artifacts. Methods: A combined approach based on feature modeling that integrates annotations into a generic composition-based approach. We propose the definition of compositional and annotative variation points with custom-defined semantics, which is resolved by a scaffolding-based derivation engine. The approach is evaluated on a real-world web-based SPL by applying a set of variability metrics, as well as discussing its quality criteria in comparison with annotations, compositional, and combined existing approaches. Results: Our approach effectively handles both fine and coarse-grained variability. The mapping between the feature model and the web artifacts promotes the traceability of the features and the uniformity of the variation points regardless of the granularity of the web artifacts. Conclusions: Using well-known techniques of SPLs from an architectural point of view, such as feature modeling, can improve the design and maintenance of variable web artifacts without the need of introducing complex approaches for implementing the underlying variability., The work of the authors from the Universidad de Málaga is supported by the projects Magic P12-TIC1814 (post-doctoral research grant), MEDEA RTI2018-099213-B-I00 (co-financed by FEDER funds), Rhea P18-FR-1081 (MCI/AEI/FEDER, UE), LEIA UMA18-FEDERIA-157, TASOVA MCIU-AEI TIN2017-90644-REDT and, European Union’s H2020 research and innovation program under grant agreement DAEMON 101017109. The work of the authors from the Universidade da Coruña has been funded by MCIN/AEI/10.13039/501100011033, NextGenerationEU/PRTR, FLATCITY-POC: PDC2021-121239-C31 ; MCIN/AEI/10.13039/501100011033 EXTRACompact: PID2020-114635RB-I00 ; GAIN/Xunta de Galicia/ERDF CEDCOVID: COV20/00604 ; Xunta de Galicia/FEDER-UE GRC: ED431C 2021/53 ; MICIU/FEDER-UE BIZDEVOPSGLOBAL: RTI-2018-098309-B-C32 ; MCIN/AEI/10.13039/501100011033 MAGIST: PID2019-105221RB-C41, Junta de Andalucía; P12-TIC-1814, Universidad de Málaga; UMA18-FEDERIA-157, Xunta de Galicia; COV20/00604, Xunta de Galicia; ED431C 2021/53, Junta de Andalucía; P18-FR-1081
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Compact representations of spatial hierarchical structures with support for topological queries

  • Fuentes Sepúlveda, José
  • Gatica, Diego
  • Navarro, Gonzalo
  • Rodríguez, M. Andrea
  • Seco, Diego
©2023 Elsevier B.V. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/byncnd/ 4.0/. This version of the article has been accepted for publication in Future Generation Computer Systems. The Version of Record is available online at https:// doi.org/10.1016/j.ic.2023.105029, [Abstract]: Among different spatial data models, the topological model for spatial regions explicitly represents common boundaries. This model pursues the efficiency of topology-related queries and the elimination of data redundancy. This paper proposes several space-efficient data structures to support access to the topological representation of two-dimensional regions that are organized in a multi-granular or hierarchical structure, such as the political and administrative partition of a country. In the context of these hierarchies, we focus on queries that search for inclusion, disjointness, and adjacency between regions. The proposed structures build upon compact planar graph embeddings, which show to have a good trade-off between space and time., This work was funded by: ANID Millennium Science Initiative Program - Code ICN17_002 ; PAI grant PAI77190038 (1st author); PFCHA/Doctorado Nacional/2020-21201986 (2nd author); FONDECYT Grant 1-200038 (3rd author); CYTED grant 519RT0579 (4th and 5th authors); GRC: ED431C 2021/53 , partially funded by GAIN/Xunta de Galicia (5th author); TED2021-129245B-C21 (PLAGEMIS), PDC2021-120917-C21 (SIGTRANS), PID2020-114635RB-I00 (EXTRACompact) and PID2019-105221RB-C41 (MAGIST), partially funded by MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR (5th author). An early partial version of this paper appeared in Proc. DCC 2021 [1] ., Xunta de Galicia; ED431C 2021/53, Chile. Agencia Nacional de Investigación y Desarrollo; ICN17_002, Chile. Agencia Nacional de Investigación y Desarrollo; PAI77190038, Chile. Ministerio de Educación; PFCHA/Doctorado Nacional/2020-21201986, Chile. Comisión Nacional de Investigación Científica y Tecnológica; 1-200038, Chile. Agencia Nacional de Investigación y Desarrollo; 519RT0579
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Multilevel Modeling of Geographic Information Systems Based on International Standards

  • Alvarado, Suilen H.
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG, [Abstract] Even though different applications based on Geographic Information Systems (GIS) provide different features and functions, they all share a set of common concepts (e.g., spatial data types, operations, services), a common architecture, and a common set of technologies. Furthermore, common structures appear repeatedly in different GIS, although they have to be specialized in specific application domains. Multilevel modeling is an approach to model-driven engineering (MDE) in which the number of metamodel levels is not fixed. This approach aims at solving the limitations of a two-level metamodeling approach, which forces the designer to include all the metamodel elements at the same level. In this paper, we address the application of multilevel modeling to the domain of GIS, and we evaluate its potential benefits. Although we do not present a complete set of models, we present four representative scenarios supported by example models. One of them is based on the standards defined by ISO TC/211 and the Open Geospatial Consortium. The other three are based on the EU INSPIRE Directive (territory administration, spatial networks, and facility management). These scenarios show that multilevel modeling can provide more benefits to GIS modeling than a two-level metamodeling approach., Xunta de Galicia; IN852A 2018/14, Xunta de Galicia; ED431G 2019/01, This work has been partially funded by grants: MICIU/FEDER-UE, MAGIST: PID2019-105221RB-C41; MICIU/FEDER-UEBIZDEVOPSGLOBAL: RTI-2018-098309-B-C32, Xunta de Galicia/FEDER-UE, ConectaPeme, GEMA: IN852A 2018/14; MINECOAEI/FEDER-UE Datos 4.0: TIN2016-78011-C4-1-R; MINECOAEI/FEDER-UE Velocity: TIN2016-77158-C4-3-R; CITIC research center funded by XUNTA and EU through the European Regional Development Fund- Galicia 2014-2020 Program, grant ED431G 2019/01. Funding for open access charge: Universidade da Coruña/CISUG.