Pasar al contenido principal

ETIQUETADO DE TRAYECTORIAS DE OBJETOS MOVILES PARA SU EXPLOTACION EFICIENTE EN RDF DATA CUBE COMPRIMIDO

TIN2015-69951-R

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2015
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Dirección General de Investigación Científica y Técnica
Centro beneficiario UNIVERSIDADE DA CORUÑA
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

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

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

Dv2v: A Dynamic Variable-to-Variable Compressor

  • Brisaboa, Nieves R.
  • Fariña, Antonio
  • Gómez-Brandón, Adrián
  • Navarro, Gonzalo
  • Varela Rodeiro, Tirso
The congress was held in Snowbird, Utah, USA. March 26-29, 2019, [Abstract]: We present D-v2v, a new dynamic (one-pass) variable-to-variable compressor. Variable-to-variable compression aims at using a modeler that gathers variable-length input symbols and a variable-length statistical coder that assigns shorter codewords to the more frequent symbols. In D-v2v, we process the input text word-wise to gather variable-length symbols that can be either terminals (new words) or non-terminals, subsequences of words seen before in the input text. Those input symbols are set in a vocabulary that is kept sorted by frequency. Therefore, those symbols can be easily encoded with dense codes. Our D-v2v permits real-time transmission of data, i.e. compression/transmission can begin as soon as data become available. Our experiments show thatD-v2vis able to overcome the compression ratios of the v2vDC, the state-of-the-art semi-static variable-to-variable compressor, and to almost reach p7zip values. It also draws a competitive performance at both compression and decompression., 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 MINECO-AEI/FEDER-UE [ETOME-RDFD3: TIN2015-69951-R, Datos 4.0: TIN2016-78011-C4- 1-R]; by MINECO-CDTI/FEDER-UE [INNTERCONECTA: uForest ITC-20161074]; by FPI Program [BES-2017-081390] (T.V.R.); and by FPU Program [FPU16/02914] (A.G.B.).
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 Artículo científico (JournalArticle)

Optimization in Sanger sequencing

  • Carpente, Luisa
  • Cerdeira-Pena, Ana
  • Lorenzo Freire, Silvia
  • Saavedra Places, Ángeles
© 2019. 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 Carpente, L., Cerdeira-Pena, A., Lorenzo-Freire, S., Places, Á.S., 2019. Optimization in Sanger sequencing. Computers & Operations Research 109, 250–262 has been accepted for publication in Computers & Operations Research. The Version of Record is available online at https://doi.org/10.1016/j.cor.2019.05.011, [Abstract]: The main objective of this paper is to solve the optimization problem that is associated with the classification of DNA samples in PCR plates for Sanger sequencing. To achieve this goal, we design an integer linear programming model. Given that the real instances involve the classification of thousands of samples and the linear model can only be solved for small instances, the paper includes a heuristic to cope with bigger problems. The heuristic algorithm is based on the simulated annealing technique. This algorithm obtains satisfactory solutions to the problem in a short amount of time. It has been tested with real data and yields improved results compared to some commercial software typically used in (clinical) laboratories. Moreover, the algorithm has already been implemented in the laboratory and is being successfully used., This work has been supported by MINECO: MTM2014-53395-C3-1-P, MINECO: MTM2017-87197-C3-1-P, Xunta de Galicia/FEDER-UE ERDF: ED431C-2016-015, Xunta de Galicia/FEDER-UE ERDF: ED431G/01, FEDER-UE ESF, Xunta de Galicia Conecta Peme-2014: IN852A-2014/9, Xunta de Galicia/FEDER-UE CSI: ED431G/01, Xunta de Galicia/FEDER-UE GRC: ED431C 2017/58, MINECO-CDTI/FEDER-UE CIEN LPS-BIGGER: IDI-20141259, MINECO-CDTI/FEDER-UE INNTERCONECTA uForest: ITC-20161074, MINECO-AEI/FEDER-UE eDSalud: RTC-2016-5143-1, MINECO-AEI/FEDER-UE Datos 4.0: TIN2016-78011-C4-1-R and MINECO-AEI/FEDER-UE ETOME-RDFD3: TIN2015-69951-R., Xunta de Galicia; ED431C-2016-015, Xunta de Galicia; ED431G/01, Xunta de Galicia; ED431G/01, Xunta de Galicia; ED431C 2017/58, Xunta de Galicia; IN852A-2014/9
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 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