Skip to main content

VELOCITY: PROCESADO EFICIENTE DE BIG DATA ESPACIO-TEMPORAL PARA FLATCITY

TIN2016-77158-C4-3-R

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

Resultados relacionados

Resultados totales (Incluyendo duplicados): 14
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 Contribución de congreso (ConferenceOutput)

Introducing a Human Activity Recognition Dataset Gathered on Real-Life Conditions

  • García-González, Daniel
  • Fernández-Blanco, Enrique
  • Rivero, Daniel
  • Rodríguez Luaces, Miguel
Cursos e Congresos, C-155, [Abstract] Human activity recognition (HAR) has garnered significant scientific interest in recent years. The widespread use of smartphones enabled convenient and cost-effective data collection, eliminating the need for additional wearables. Given that, this paper introduces a novel HAR dataset in which participants had freedom in choosing smartphone orientation and placement during activities, ensuring data variability. It also includes contributions from diverse individuals, reflecting unique smartphone usage habits. Moreover, it comprises measurements from accelerometer, gyroscope, magnetometer, and GPS, corresponding to one of four activities: inactive, active, walking, or driving. Unlike other datasets, the collected data in this study were obtained from smartphones used in real-life scenarios, This work was funded by CITIC is funded by the Xunta de Galicia through the collaboration agreement between the Consellería de Cultura, Educación, Formación Profesional e Universidades and the Galician universities for the reinforcement of the research centres of the Galician University System (CIGUS), Xunta de Galicia/FEDER-UE (ConectaPeme, GEMA: IN852A 2018/14), MINECO-AEI/FEDER-UE (Flatcity: TIN2016-77158-C4-3-R) and Xunta de Galicia/FEDER-UE (AXUDAS PARA A CONSOLIDACION E ESTRUTURACION DE UNIDADES DE INVESTIGACION COMPETITIVAS.GRC: ED431C 2017/58 and ED431C 2018/49)., Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; ED431C 2018/49
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Developing Web-based Geographic Information Systems with a DSL: Proposal and Case Study

  • Alvarado, Suilen H.
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
This is a pre-copyedited, author-produced version of an article accepted for publication in Journal of Web Engineering, following peer review. The version of record of the article is available online at: : https://doi.org/10.13052/jwe1540-9589.1923., [Abstract]: In this paper, we present a declarative domain-specific language (DSL) for the development of Geographic Information Systems (GIS). GIS applications manage information with a spatial component, usually in the form of points, lines, polygons, or variants of these basic data types, in domains where the spatial information plays a central role. They provide the user with different functionalities on different application domains, but they are usually developed according to a common architecture and using a common set of technologies. Hence, they share a significant number of elements that make some aspects of their development quite repetitive. Our DSL allows developers to specify the entities, geographic layers, and maps of the applications using a declarative language. Then, the specification is transformed into a working GIS application. We present the language, its implementation, and a case study on two sample projects that allowed us to evaluate the resulting software, paying special attention to the savings in the development effort., Partially funded by: Xunta de Galicia FEDER-UE CSI grants: ED431C 2017/58 (Grupo de Referencia Competitiva), and IN852A 2018/14 (ConectaPeme, project GEMA); Ministerio de Economía-AEI FEDER-UE grants: Datos 4.0 (TIN2016-78011-c4-1-R), and Flatcity (TIN2016-77158-C4-3-R); and Ministerio de Ciencia e Innovación-AEI FEDER-UE grant BIZDEVOPS (RTI2018-098309-B-C32)., Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; IN852A 2018/14
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Towards a Compact Representation of Temporal Rasters

  • Cerdeira-Pena, Ana
  • Bernardo, Guillermo de
  • Fariña, Antonio
  • Paramá, José R.
  • Silva-Coira, Fernando
Presented at the 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018., This version of the conference paper (book chapter) 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/978-3-030-00479-8_10, [Abstract]: Big research efforts have been devoted to efficiently manage spatio-temporal data. However, most works focused on vectorial data, and much less, on raster data. This work presents a new representation for raster data that evolve along time named Temporal . It faces the two main issues that arise when dealing with spatio-temporal data: the space consumption and the query response times. It extends a compact data structure for raster data in order to manage time and thus, it is possible to query it directly in compressed form, instead of the classical approach that requires a complete decompression before any manipulation. In addition, in the same compressed space, the new data structure includes two indexes: a spatial index and an index on the values of the cells, thus becoming a self-index for raster data., Funded in part by European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 690941 (project BIRDS); by Xunta de Galicia/FEDER-UE [CSI: ED431G/01 and GRC: ED431C 2017/58]; by MINECO-AEI/FEDER-UE [Datos 4.0: TIN2016-78011-C4-1-R; Velocity: TIN2016-77158-C4-3-R; and ETOME-RDFD3: TIN2015-69951-R]; and by MINECO-CDTI/FEDER-UE [INNTERCONECTA: uForest ITC-20161074]., Xunta de Galicia; ED431G/01, Xunta de Galicia; ED431C 2017/58
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Efficient Processing of Raster and Vector Data

  • Silva-Coira, Fernando
  • Paramá, José R.
  • Ladra, Susana
  • López, Juan R.
  • Gutiérrez, Gilberto
[Abstract] In this work, we propose a framework to store and manage spatial data, which includes new efficient algorithms to perform operations accepting as input a raster dataset and a vector dataset. More concretely, we present algorithms for solving a spatial join between a raster and a vector dataset imposing a restriction on the values of the cells of the raster; and an algorithm for retrieving K objects of a vector dataset that overlap cells of a raster dataset, such that the K objects are those overlapping the highest (or lowest) cell values among all objects. The raster data is stored using a compact data structure, which can directly manipulate compressed data without the need for prior decompression. This leads to better running times and lower memory consumption. In our experimental evaluation comparing our solution to other baselines, we obtain the best space/time trade-offs., This work has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 690941; from the Ministerio de Ciencia, Innovación y Universidades (PGE and ERDF) grant numbers TIN2016-78011-C4-1-R; TIN2016-77158 C4-3-R; RTC-2017-5908-7; from Xunta de Galicia (co-founded with ERDF) grant numbers ED431C 2017/58; ED431G/01; IN852A 2018/14; and University of Bío-Bío grant numbers 192119 2/R; 195119 GI/VC, Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; ED431G/01, Xunta de Galicia; IN852A 2018/14, Universidad del Bío-Bío (Chile); 192119 2/R, Universidad del Bío-Bío (Chile); 195119 GI/VC
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

A Public Domain Dataset for Real-Life Human Activity Recognition Using Smartphone Sensors

  • García-González, Daniel
  • Rivero, Daniel
  • Fernández-Blanco, Enrique
  • Rodríguez Luaces, Miguel
[Abstract] In recent years, human activity recognition has become a hot topic inside the scientific community. The reason to be under the spotlight is its direct application in multiple domains, like healthcare or fitness. Additionally, the current worldwide use of smartphones makes it particularly easy to get this kind of data from people in a non-intrusive and cheaper way, without the need for other wearables. In this paper, we introduce our orientation-independent, placement-independent and subject-independent human activity recognition dataset. The information in this dataset is the measurements from the accelerometer, gyroscope, magnetometer, and GPS of the smartphone. Additionally, each measure is associated with one of the four possible registered activities: inactive, active, walking and driving. This work also proposes asupport vector machine (SVM) model to perform some preliminary experiments on the dataset. Considering that this dataset was taken from smartphones in their actual use, unlike other datasets, the development of a good model on such data is an open problem and a challenge for researchers. By doing so, we would be able to close the gap between the model and a real-life application., This research was partially funded by Xunta de Galicia/FEDER-UE (ConectaPeme, GEMA: IN852A 2018/14), MINECO-AEI/FEDER-UE (Flatcity: TIN2016-77158-C4-3-R) and Xunta de Galicia/FEDER-UE (AXUDAS PARA A CONSOLIDACION E ESTRUTURACION DE UNIDADES DE INVESTIGACION COMPETITIVAS.GRC: ED431C 2017/58 and ED431C 2018/49), Xunta de Galicia; IN852A 2018/14, Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; ED431C 2018/49
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)

Inference of Viral Quasispecies With a Paired de Bruijn Graph

  • Freire, Borja
  • Ladra, Susana
  • Paramá, José R.
  • Salmela, Leena
This is a pre-copyedited, author-produced version of an article accepted for publication in Bioinformatics, published by Oxford University Press, following peer review. The version of record of the article is available online at: https://doi.org/10.1093/bioinformatics/btaa782., viaDBG is implemented in C++ and it is publicly available at https://bitbucket.org/bfreirec1/viadbg. All datasets used in this article are publicly available at https://bitbucket.org/bfreirec1/data-viadbg/., Supplementary data are available at Bioinformatics online., [Abstract] Motivation: RNA viruses exhibit a high mutation rate and thus they exist in infected cells as a population of closely related strains called viral quasispecies. The viral quasispecies assembly problem asks to characterize the quasispecies present in a sample from high-throughput sequencing data. We study the de novo version of the problem, where reference sequences of the quasispecies are not available. Current methods for assembling viral quasispecies are either based on overlap graphs or on de Bruijn graphs. Overlap graph-based methods tend to be accurate but slow, whereas de Bruijn graph-based methods are fast but less accurate. Results: We present viaDBG, which is a fast and accurate de Bruijn graph-based tool for de novo assembly of viral quasispecies. We first iteratively correct sequencing errors in the reads, which allows us to use large k-mers in the de Bruijn graph. To incorporate the paired-end information in the graph, we also adapt the paired de Bruijn graph for viral quasispecies assembly. These features enable the use of long-range information in contig construction without compromising the speed of de Bruijn graph-based approaches. Our experimental results show that viaDBG is both accurate and fast, whereas previous methods are either fast or accurate but not both. In particular, viaDBG has comparable or better accuracy than SAVAGE, while being at least nine times faster. Furthermore, the speed of viaDBG is comparable to PEHaplo but viaDBG is able to retrieve also low abundance quasispecies, which are often missed by PEHaplo. Availability and implementation: viaDBG is implemented in C++ and it is publicly available at https://bitbucket.org/bfreirec1/viadbg. All datasets used in this article are publicly available at https://bitbucket.org/bfreirec1/data-viadbg/. Supplementary information: Supplementary data are available at Bioinformatics online., This work was supported by EU H2020 MSCA RISE BIRDS: 690941; MCIU [TIN2016-78011-C4-1-R; TIN2016-77158-C4-3-R; FPU17/02742; RTC-2017-5908-7]; Xunta de Galicia [ED431C 2017/58; ED431G/01; IN848D-2017-2350417; IN852A 2018/14]; and from Academy of Finland [308030 and 314170]., Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; ED431G/01, Xunta de Galicia; IN848D-2017-2350417, Xunta de Galicia; IN852A 2018/14, Finlandia. Academy of Finland; 308030, Finlandia. Academy of Finland; 314170, https://bitbucket.org/bfreirec1/viadbg, https://bitbucket.org/bfreirec1/data-viadbg/
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

An Action Research for Improving the Sustainability Assessment Framework Instruments

  • Condori Fernández, Nelly
  • Lago, Patricia
  • Rodríguez Luaces, Miguel
  • Saavedra Places, Ángeles
[Abstract] In the last years, software engineering researchers have defined sustainability as a quality requirement of software, but not enough effort has been devoted to develop new methods/techniques to support the analysis and assessment of software sustainability. In this study, we present the Sustainability Assessment Framework (SAF) that consists of two instruments: the software sustainability–quality model, and the architectural decision map. Then, we use participatory and technical action research in close collaboration with the software industry to validate the SAF regarding its applicability in specific cases. The unit of analysis of our study is a family of software products (Geographic Information System- and Mobile-based Workforce Management Systems) that aim to address sustainability goals (e.g., efficient collection of dead animals to mitigate social and environmental sustainability risks). The results show that the sustainability–quality model integrated with the architectural decision maps can be used to identify sustainability–quality requirements as design concerns because most of its quality attributes (QAs) have been either addressed in the software project or acknowledged as relevant (i.e., creating awareness on the relevance of the multidimensional sustainability nature of certain QAs). Moreover, the action–research method has been helpful to enrich the sustainability–quality model, by identifying missing QAs (e.g., regulation compliance, data privacy). Finally, the architectural decision maps have been found as useful to guide software architects/designers in their decision-making process., This work has received partial support by Xunta de Galicia/FEDER-UE CSI (ED431G/01, ED431C 2017/58); Xunta de Galicia/FEDER-UE, ConectaPeme, GEMA (IN852A 2018/14); MINECO-AEI/FEDER-UE with the projects: Datos 4.0 (TIN2016-78011-C4-1-R), BIZDEVOPS (RTI2018-098309-B-C32), FLATCITY (TIN2016-77158-C4-3-R.); and FONDECYT with the Kusisqa project (014-2019-FONDECYTBM-INC.INV), Xunta de Galicia; ED431G/01, Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; IN852A 2018/14, Gobierno de Chile; 014-2019-FONDECYTBM-INC.INV
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Compact Representations of Event Sequences

  • Brisaboa, Nieves R.
  • Bernardo, Guillermo de
  • Navarro, Gonzalo
  • Seco, Diego
  • Varela Rodeiro, Tirso
The congress was held in Snowbird, Utah, USA. 27-30 March 2018, [Abstract]: We introduce a new technique for the efficient management of large sequences of multi-dimensional data, which takes advantage of regularities that arise in real-world datasets and supports different types of aggregation queries. More importantly, our representation is flexible in the sense that the relevant dimensions and queries may be used to guide the construction process, easily providing a space-time tradeoff depending on the relevant queries in the domain. We provide two alternative representations for sequences of multidimensional data and describe the techniques to efficiently store the datasets and to perform aggregation queries over the compressed representation. We perform experimental evaluation on realistic datasets, showing the space efficiency and query capabilities of our proposal., Funded in part by European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 690941. NB, GdB and TR supported by: CDTI, MINECO grant ITC-20151247; MINECO grants TIN2016-78011-C4-1-R, TIN2016-77158-C4-3-R and TIN2013-46238-C4-3-R; and Xunta de Galicia grant ED431C 2017/58 GRC. DS supported by: MINECO (PGE and FEDER) grants TIN2016-77158-C4-3-R and TIN2013-46801-C4-3-R, and Fondecyt-Conicyt grant number 1170497. GN supported by Basal Funds FB0001, Conicyt, Chile., Xunta de Galicia; ED431C 2017/58 GRC, Chile. Comisión Nacional de Investigación Científica y Tecnológica; 1170497
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Revisiting Compact RDF Stores Based on k2-Trees

  • Brisaboa, Nieves R.
  • Cerdeira-Pena, Ana
  • Bernardo, Guillermo de
  • Fariña, Antonio
Presented at the 2020 Data Compression Conference (DCC), Snowbird, UT, USA, 24-27 March 2020, © 2020 IEEE. This version of the paper has been accepted for publication. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The final published paper is available online at: https: https://doi.org/10.1109/DCC47342.2020.00020, [Abstract]: We present a new compact representation to efficiently store and query large RDF datasets in main memory. Our proposal, called BMatrix, is based on the k 2 -tree, a data structure devised to represent binary matrices in a compressed way, and aims at improving the results of previous state-of-the-art alternatives, especially in datasets with a relatively large number of predicates. We introduce our technique, together with some improvements on the basic k 2 -tree that can be applied to our solution in order to boost compression. Experimental results in the flagship RDF dataset DBPedia show that our proposal achieves better compression than existing alternatives, while yielding competitive query times, particularly in the most frequent triple patterns and in queries with unbound predicate, in which we outperform existing solutions, Funded by: MICINN-AEI/FEDER-UE RTI2018-098309-B-C32, Xunta de Galicia/GAIN IN848D-2017-2350417; MICINN-AEI/FEDER-UE RTC-2017-5908-7; Xunta de Galicia/FEDER-UE ED431C 2017/58, ED431G/01, IN852A 2018/14; MINECO-AEI/FEDER-UE TIN2016-78011-C4-1- R, TIN2016-77158-C4-3-R, TIN2015-69951-R; EU H2020 MSCA RISE BIRDS: 690941, Xunta de Galicia; IN848D-2017-2350417, Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; ED431G/01, Xunta de Galicia; IN852A 2018/14
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Compact structure for sparse undirected graphs based on a clique graph partition

  • Glaria, Felipe
  • Hernández, Cecilia
  • Ladra, Susana
  • Navarro, Gonzalo
  • Salinas, Lilian
©2021 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/bync-nd/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.ins.2020.09.010, [Abstract]: Compressing real-world graphs has many benefits such as improving or enabling the visualization in small memory devices, graph query processing, community search, and mining algorithms. This work proposes a novel compact representation for real sparse and clustered undirected graphs. The approach lists all the maximal cliques by using a fast algorithm and defines a clique graph based on its maximal cliques. Further, the method defines a fast and effective heuristic for finding a clique graph partition that avoids the construction of the clique graph. Finally, this partition is used to define a compact representation of the input graph. The experimental evaluation shows that this approach is competitive with the state-of-the-art methods in terms of compression efficiency and access times for neighbor queries, and that it recovers all the maximal cliques faster than using the original graph. Moreover, the approach makes it possible to query maximal cliques, which is useful for community detection., 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]; from the Ministerio de Economía y Competitividad (PGE and ERDF) [Grant Nos. TIN2016-77158-C4-3-R]; from Xunta de Galicia (co-founded with ERDF) [Grant Nos. ED431C 2017/58; ED431G 2019/01]; from the Center for Biotechnology and Bioengineering (CeBiB), Chile; and from the Millennium Institute for Foundational Research on Data (IMFD), Chile., Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; ED431G 2019/01
RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Re-ingeniería y Modernización de la Biblioteca Virtual Galega

  • Ramos-Vidal, Delfina
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
Publicado en Actas de las XXV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2021). Las XXV Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2021) se han celebrado en Málaga del 22 al 24 de septiembre de 2021, como parte de las Jornadas SISTEDES, parte a su vez del VI Congreso Español de Informática (CEDI 20/21)., [Resumen]: La Biblioteca Virtual Galega (BVG) es una biblioteca digital de referencia en literatura gallega de todos los tiempos, para el público general y especialmente para centros de educación de enseñanza obligatoria de la comunidad. Esta plataforma almacena y da acceso a información bibliográfica de autores clásicos y actuales, as+AO0 como información multimedia correspondiente a ediciones digitales de sus obras. En este artículo se presenta el proyecto de re-ingeniería y modernización de esta biblioteca digital (desarrollada en 2002) utilizando una línea de producto software para la generación de bibliotecas digitales desarrollada por investigadores del Laboratorio de Bases de Datos (LBD)., Parcialmente financiado por: MICIU / FEDER-UE: MAGIST (PID2019-105221RB- C41), EXTRACompact (PID2020-114635RB-I00), Red Aracne-Nodus (RED2018- 102755-T), y BIZDEVOPSGLOBAL (RTI-2018-098309-B-C32); Xunta de Galicia / FEDER-UE, ConectaPeme, GEMA (IN852A 2018/14), GRC (ED431C 2017/58); MINECO-AEI / FEDER-UE Datos 4.0 (TIN2016-78011-C4-1-R) y Velocity (TIN2016-77158-C4-3-R); centro de investigación CITIC financiado por la Xunta y la UE a través del Fondo Europeo de Desarrollo Regional - Programa Galicia 2014-2020 (ED431G 2019/01)., Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; IN852A 2018/14
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.