Pasar al contenido principal

Resultados relacionados

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

RUC. Repositorio da Universidade da Coruña
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

An Efficient Representation of Enriched Temporal Trajectories

  • Brisaboa, Nieves R.
  • Fariña, Antonio
  • Otero-González, Diego
  • Varela Rodeiro, Tirso
[Abstract] We present a novel representation of enriched trajectories of a mobile workforce management system. In this system, employees are tracked during their working day and both their routes and the tasks performed at each time instant are recorded. Our proposal tackles the representation of this information paying special attention to the space footprint without neglecting query time. We performed experiments using real and synthetic datasets where we show the compression effectiveness as well as the efficiency at query time. Our results showed that our proposal yields promising results in terms of the space needed to represent both users’ locations and activities while performing access queries to the original data within microseconds., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; IG240.2020.1.185, Xunta de Galicia; IN852A 2018/14, Partially funded by the CITIC research center funded by Xunta/FEDER-UE 2014-2020 Program, grant ED431G 2019/01. MICIU (PGE/ERDF) [Datos 4.0: TIN2016-78011-C4-1-R; STEPS: RTC-2017-5908-7; BIZDEVOPS: RTI2018-098309-B-C32]. IGAPE/Xunta (FEDER-UE) 2014-2020 [IG240.2020.1.185]. Xunta/GAIN (ERDF) [GEMA: IN852A 2018/14] and by FPI Program [BES-2017-081390]., https://www.scitepress.org/ProceedingsDetails.aspx?ID=H6opWeZtwKs=&t=1
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Augmented Thresholds for MONI

  • Martínez-Guardiola, César
  • Brown, Nathaniel K.
  • Silva-Coira, Fernando
  • Köppl, Dominik
  • Gagie, Travis
  • Ladra, Susana
© 2023 IEEE. This version of the article has been accepted for publication, after peer review. 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 Version of Record is available online at: https://doi.org/10.1109/DCC55655.2023.00035, [Abstract]: MONI (Rossi et al., 2022) can store a pangenomic dataset T in small space and later, given a pattern P, quickly find the maximal exact matches (MEMs) of P with respect to T. In this paper we consider its one-pass version (Boucher et al., 2021), whose query times are dominated in our experiments by longest common extension (LCE) queries. We show how a small modification lets us avoid most of these queries which significantly speeds up MONI in practice while only slightly increasing its size., CMG, FSC and SL supported by CITIC, as Research Center accredited by Galician University System, funded by “Consellería de Cultura, Educación e Universidade from Xunta de Galicia”, supported 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/ERDF under Grant [ED431C 2021/53]; GAIN/ERDF under Grant [IN852D 2021/3];Ministe-rio de Ciencia e Innovación MCIN/AEI/10.13039/501100011033 and “NextGenerationEU”/PRTR under Grants [TED2021-129245B-C21; PID2020-114635RB-I00; PDC2021-121239-C31; PID2019-105221RB-C41; RTI-2018-098309-B-C32]. NKB and TG supported by National Institutes of Health (NIH) NIAID (grant no. HG011392), the National Science Foundation NSF IIBR (grant no. 2029552) and the Natural Science and Engineering Research Council (NSERC) Discovery Grant (grant no. RGPIN-07185-2020) and a CGS-M scholarship. DK was supported by JSPS KAKENHI Grant Numbers JP22H03551, JP21K17701, and JP21H05847., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IN852D 2021/3, United States. National Institute of Allergy and Infectious Diseases; HG011392, United States. National Science Foundation; 2029552, Canada. Natural Science and Engineering Research Council; RGPIN-07185-2020, Japan Society for the Promotion of Science; JP22H03551, Japan Society for the Promotion of Science; JP21K17701, Japan Society for the Promotion of Science; JP21H05847
RUC. Repositorio da Universidade da Coruña
Publicación 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
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

Semantrix: A Compressed Semantic Matrix

  • Brisaboa, Nieves R.
  • Fariña, Antonio
  • Navarro, Gonzalo
  • Varela Rodeiro, Tirso
The congress was held in Snowbird, Utah, USA. March 24-27, 2020, [Abstract]: We present a compact data structure to represent both the duration and length of homogeneous segments of trajectories from moving objects in a way that, as a data warehouse, it allows us to efficiently answer cumulative queries. The division of trajectories into relevant segments has been studied in the literature under the topic of Trajectory Segmentation. In this paper, we design a data structure to compactly represent them and the algorithms to answer the more relevant queries. We experimentally evaluate our proposal in the real context of an enterprise with mobile workers (truck drivers) where we aim at analyzing the time they spend in different activities. To test our proposal under higher stress conditions we generated a huge amount of synthetic realistic trajectories and evaluated our system with those data to have a good idea about its space needs and its efficiency when answering different types of queries., Funded in part by European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 690941 (project BIRDS). G.N. is funded by the Millennium Institute for Foundational Research on Data (IMFD), Chile. The Spanish group is funded by Xunta de Galicia/FEDER-UE [CSI: ED431G/01 and GRC: ED431C 2017/58]; by Xunta de Galicia/GAIN [IN848D-2017-2350417]; by Xunta de Galicia Conecta-Peme 2018 [Gema: IN852A 2018/14]; by MCIU-AEI/ FEDER-UE [ETOME-RDFD3: TIN2015-69951-R, Datos 4.0: TIN2016- 78011-C4-1-R, BIZDEVOPS: RTI2018-098309-B-C32]; and by FPI Program [BES-2017-081390] (T.V.R.)., Xunta de Galicia; ED431G/01, Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; IN848D-2017-2350417, Xunta de Galicia; IN852A 2018/14
RUC. Repositorio da Universidade da Coruña
Publicación Contribución de congreso (ConferenceOutput)

Efficient Multiscale Representations for Geographical Objects

  • Brisaboa, Nieves R.
  • Cortiñas, Alejandro
  • Gutiérrez-Asorey, Pablo
  • Varela Rodeiro, Tirso
  • Rodríguez Luaces, Miguel
The congress was held in Constance, Germany, April 28–29, [Abstract]: Maps need different representations of the same cartographic object in order to display it at several scale levels. When a user zooms in, the object should depict every detail as it is the main focus on the map. On the contrary, when the user zooms out, there is no need to display every single detail of the object as most would become as small as to be invisible. A common technique to speed up the display process is storing several representations for the same object at different scales. However, this technique raises redundancy, and therefore it increases space usage. This work aims at suppressing that redundancy by introducing four alternatives that use a unique representation for each cartographic object while still being able to retrieve simplified versions of them depending on the requested scale., This work was supported by the CITIC research center funded by Xunta/FEDER-UE 2014–2020 Program grant ED431G 2019/01. Partially funded by MCIU-AEI/ FEDER-UE [BIZDEVOPS: RTI2018-098309-B-C32]; by MICINN (PGE/ERDF) [EXTRA-Compact: PID2020-114635RB-I00; MAGIST: PID2019-105221RB-C41; SIGTRANS-UDC: PDC2021-120917-C21; FLATCITY-POC: PDC2021-121239-C31]; by Xunta de Galicia/FEDER-UE [GRC: ED431C 2021/53], Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Improved structures to solve aggregated queries for trips over public transportation networks

  • Brisaboa, Nieves R.
  • Fariña, Antonio
  • Galaktionov, Daniil
  • Varela Rodeiro, Tirso
  • Rodríguez, M. Andrea
This is the Accepted Manuscript. 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.1016/j.ins.2021.10.079., [Abstract]: We address the problem of storing and analyzing large datasets of passenger trips over public transportation networks that are of interest to network administrators trying to balance transportation offers (e.g., frequency of vehicles) according to the historical demand. We exploit the fact that all passenger trips made within the same vehicle share the same trajectories to reduce their redundancy and provide a representation, based on well-known compact data structures, that not only reduces the space requirements of the original passenger’s trajectories but also efficiently supports querying. Our solution uses two complementary representations: T-Matrices which excels at querying the aggregated network load, and TTCTR which represents all passenger trips and aims at counting the trips following a given pattern (i.e., how many passengers started/ended a trip at a given location or moved from a given location to another). In addition, we propose XCTR, a variant of TTCTR, which efficiently answers a wider range of queries at the cost of a moderate performance loss for some queries and some space overhead. Overall, our representation can handle a dataset of ten million trips within approximately 65% of its original size while supporting a wide range of queries in the order of microseconds., This work was supported by the CITIC research center funded by Xunta/FEDER-UE 2014-2020 Program grant ED431G 2019/01. The Spanish group is partially funded by MCIU-AEI/ FEDER-UE [Datos 4.0: TIN2016-78011-C4-1-R, BIZDEVOPS: RTI2018-098309-B-C32, STEPS: RTC-2017-5908-7]; by MICINN (PGE/ERDF) [EXTRACompact: PID2020-114635RB-I00; SIGTRANS-UDC: PDC2021-120917-C21]; by Xunta de Galicia/FEDERUE [CSI: ED431G 2019/01; GRC: ED431C 2021/53; LEMSI: IG240.2020.1.185]; by Xunta de Galicia/GAIN [Innovapeme: IN848D-2017-2350417]; by Xunta de Galicia Conecta-Peme 2018 [Gema: IN852A 2018/14]; and by FPI Program [BES-2017-081390] (T.V.R.). M. A. Rodríguez is partially funded by Millennium Institute for Foundational Research on Data, Millennium Science Initiative Program - Code ICN17 002., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; ED431C 2021/53, Xunta de Galicia; IG240.2020.1.185, Xunta de Galicia; IN848D-2017-2350417, Xunta de Galicia; IN852A 2018/14, Chile. Instituto Milenio Fundamentos de los Datos, IMFD; ICN17 002
RUC. Repositorio da Universidade da Coruña
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación Contribución de congreso (ConferenceOutput)

Improving the Customization of Software Product Lines through the Definition of Local Features

  • Castro, David de
  • Cortiñas, Alejandro
  • Rodríguez Luaces, Miguel
  • Pedreira, Óscar
  • Saavedra Places, Ángeles
Traballo presentado en: SPLC '22: 26th ACM International Systems and Software Product Line Conference, Graz, Austria, September 12 - 16, 2022. © Author | ACM 2022. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in SPLC 2022, https://doi.org/10.1145/3546932.3547006, [Abstract]: Variability in software product lines (SPL) is mostly described with feature models. In basic feature models, the selection of a feature for a particular product determines whether or not the feature is present in the product in a global manner. Even though there are cardinality-based feature models that allow a subset of features to be specified a number of times for each product, it is not possible to customize each instance of the feature with specific details for different elements of the product. Some SPLs integrate model transformations and use domain specific languages to describe elements of the application that cannot be described using features (for example, the definition of the data model for a particular product). In this context, a stakeholder may require some features to be applied to some elements of the data model, but not globally (for example, not every entity in the data model may require an edition form). However, current feature models do not allow the stakeholder to specify this information. In this paper, we propose a solution that solves this problem using domain-specific languages. In addition to defining global features for the entire application, our proposal allows the stakeholder to define local features that are specific to some elements such as parts of the application or specific entities of the data model and, using the DSL to define the product, those local features can be assigned to these elements or entities. This specification of the scope of application of features opens the door to a higher degree of customization of the generated products, thus improving their quality., Partly 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., Xunta de Galicia; COV20/00604, Xunta de Galicia; ED431C 2021/53
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Extending general compact querieable representations to GIS applications

  • Brisaboa, Nieves R.
  • Cerdeira-Pena, Ana
  • Bernardo, Guillermo de
  • Navarro, Gonzalo
  • Pedreira, Óscar
© 2020. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/. This version of the article “Brisaboa, N.R., Cerdeira-Pena, A., de Bernardo, G., Navarro, G., Pedreira, Ó., 2020. Extending general compact querieable representations to GIS applications. Information Sciences 506, 196–216” has been accepted for publication in Information Sciences. The Version of Record is available online at https://doi.org/10.1016/j.ins.2019.08.007, [Abstract]: The raster model is commonly used for the representation of images in many domains, and is especially useful in Geographic Information Systems (GIS) to store information about continuous variables of the space (elevation, temperature, etc.). Current representations of raster data are usually designed for external memory or, when stored in main memory, lack efficient query capabilities. In this paper we propose compact representations to efficiently store and query raster datasets in main memory. We present different representations for binary raster data, general raster data and time-evolving raster data. We experimentally compare our proposals with traditional storage mechanisms such as linear quadtrees or compressed GeoTIFF files. Results show that our structures are up to 10 times smaller than classical linear quadtrees, and even comparable in space to non-querieable representations of raster data, while efficiently answering a number of typical queries., Partially funded by: IMFD; Xunta de Galicia/FEDER-UE grants CSI:ED431G/01 and GRC:ED431C 2017/58; Xunta de Galicia/FEDER-UE, ConectaPeme grant GEMA: IN852A 2018/14; Xunta de Galicia/GAIN grant Innovapeme: IN848D-2017-2350417; by MINECO-AEI/FEDER-UE grants Flatcity: TIN2016-77158-C4-3-R, Datos 4.0: TIN2016-78011-C4-1-R and ETOME-RDFD3: TIN2015-69951-R; MICINN-AEI/FEDER-UE grants Steps: RTC-2017-5908-7 and BIZDEVOPS: RTI2018- 098309-B-C32; and EU H2020 MSCA RISE BIRDS: 690941. An early partial version of this article appeared in Proc SPIRE’13. Some parts of this work also appeared in G. de Bernardo’s PhD thesis., Xunta de Galicia; ED431G/01, Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; IN852A-2018/14, Xunta de Galicia; IN848D-2017-2350417
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Efficient and compact representations of some non-canonical prefix-free codes

  • Fariña, Antonio
  • Gagie, Travis
  • Grabowski, Marcin
  • Manzini, Giovanni
  • Navarro, Gonzalo
  • Ordóñez, Alberto
©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/by-nc-nd/4.0/. This version of the article has been accepted for publication in Theoretical Computer Science. The Version of Record is available online at https://doi.org/10.1016/j.tcs.2022.01.010 Versión final de: https://doi.org/10.1007/978-3-319-46049-9_5, [Abstract]: For many kinds of prefix-free codes there are efficient and compact alterna-tives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when we can choose the order in which codewords are assigned to symbols. In this paper we first show how, given a probability distribution over an alphabet of σ symbols, we can store an optimal alphabetic prefix-free code in O(σ lg L) bits such that we can encode and decode any codeword of length  inO (min(, lg L)) time, where L is the maximum codeword length. With O 2L further bits, for any constant  > 0, we can encode and decode O(lg ) time. We then show how to store a nearly optimal alphabetic prefix-free code in o(σ) bits such that we can encode and decode in constant time. We also consider a kind of optimal prefix-free code introduced recently where the codewords’ lengths are non-decreasing if arranged in lexicographic order of their reverses. We reduce their storage space to O(σ lg L) while maintaining encoding and de-coding times in O(). We also show how, with O 2L further bits, we can encode and decode in constant time. All of our results hold in the word-RAM model., This research was carried out in part at University of A Coruña, Spain, while the second author was visiting from the University of Helsinki and the sixth author was a PhD student there. It started at a StringMasters workshop at the Research Center on Information and Communication Technologies (CITIC) of the University of A Coruña. The workshop was funded in part by European Union's Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No 690941 (project BIRDS). The authors thank Nieves Brisaboa and Susana Ladra. The first author was supported by the CITIC research center funded by Xunta de Galicia/FEDER-UE 2014-2020 Program, grant CSI:ED431G 2019/01; by MICIU/FEDER-UE, grant BIZDEVOPSGLOBAL: RTI2018-098309-B-C32; and by Xunta de Galicia/FEDER-UE, ConectaPeme grant GEMA: IN852A 2018/14. The second author was supported by Academy of Finland grants 268324 and 250345 (CoECGR), Fondecyt Grant 1-171058, and NSERC grant RGPIN-07185-2020. The fourth author was supported by PRIN grant 2017WR7SHH, and by the INdAM-GNCS Project 2020 MFAIS- IoT. The fifth author was supported by Fondecyt Grant 1-200038, Basal Funds FB0001, and ANID - Millennium Science Initiative Program - Code ICN17 002, Chile., Xunta de Galicia; ED431G 2019/01, Xunta de Galicia; IN852A 2018/14, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1-171058, Chile. Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt); 1-200038, Canada. Natural Science and Engineering Research Council (NSERC); RGPIN-07185-2020, Italia. Ministero dell'Istruzione, dell'Università e della Ricerca; 2017WR7SHH, Suomen Akatemia; 268324, Suomen Akatemia; 250345, http://hdl.handle.net/2183/18174
RUC. Repositorio da Universidade da Coruña
Publicación 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.