Muntés Mulero, Víctor
Total activity: 78
Research group
DAMA-UPC - Data Management Group
Department
Department of Computer Architecture
School
Barcelona School of Informatics (FIB)
E-mail
victor.muntesestudiant.upc.edu
Contact details
UPC directory Open in new window

Graphic summary
  • Show / hide key
  • Information


Scientific and technological production
  •  

1 to 50 of 78 results
  • Access to the full text
    Context-aware machine translation for software localization  Open access

     Muntés Mulero, Víctor; Paladini Adell, Patricia; España Bonet, Cristina; Màrquez Villodre, Lluís
    Conference of the European Association for Machine Translation
    p. 77-80
    Presentation's date: 2012-05-28
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Software localization requires translating short text strings appearing in user interfaces (UI) into several languages. These strings are usually unrelated to the other strings in the UI. Due to the lack of semantic context, many ambiguity problems cannot be solved during translation. However, UI are composed of several visual components to which text strings are associated. Although this association might be very valuable for word disambiguation, it has not been exploited. In this paper, we present the problem of lack of context awareness for UI localization, providing real examples and identifying the main research challenges.

  • Efficient graph management based on bitmap indices

     Martinez Bazan, Norbert; Muntés Mulero, Víctor; Gómez Villamor, S.; Dominguez Sala, David; Aguila Lorente, Miguel Angel; Larriba Pey, Josep
    International Database Engineering and Applications Symposium
    p. 110-119
    DOI: 10.1145/2351476.2351489
    Presentation's date: 2012
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    The increasing amount of graph like data from social networks, science and the web has grown an interest in analyzing the relationships between different entities. New specialized solutions in the form of graph databases, which are generic and able to adapt to any schema as an alternative to RDBMS, have appeared to manage attributed multigraphs efficiently. In this paper, we describe the internals of DEX graph database, which is based on a representation of the graph and its attributes as maps and bitmap structures that can be loaded and unloaded efficiently from memory. We also present the internal operations used in DEX to manipulate these structures. We show that by using these structures, DEX scales to graphs with billions of vertices and edges with very limited memory requirements. Finally, we compare our graph-oriented approach to other approaches showing that our system is better suited for out-of-core typical graph-like operations.

  • Access to the full text
    Hybrid tables for speeding-up data accesses in hybrid database management systems  Open access

     Guisado Gamez, Joan; Wolski, Antoni; Zuzarte, Calisto; Larriba Pey, Josep; Muntés Mulero, Víctor
    Jornadas de Ingeniería del Software y Bases de Datos
    Presentation's date: 2011-09-06
    Presentation of work at congresses

    Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

  • Introducció als computadors (A): col·lecció de problemes

     Navarro Guerrero, Juan Jose; Muntés Mulero, Víctor; Cruz Diaz, Josep-llorenç; Palomar Perez, Oscar; Sanchez Castaño, Friman; Solé Simó, Marc
    Date of publication: 2011-02
    Book

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Genetic query optimization for large databases

     Muntés Mulero, Víctor
    Date of publication: 2011-01-11
    Book

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    Hybrid in-memory and on-disk tables for speeding-up table accesses  Open access

     Guisado Gamez, Joan; Wolski, Antoni; Zuzarte, Calisto; Larriba Pey, Josep; Muntés Mulero, Víctor
    International Conference on Database and Expert Systems Applications
    p. 231-240
    Presentation's date: 2010-08-30
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Main memory database management systems have become essential for response-time-bounded applications, such as those in telecommunications systems or Internet, where users frequently access a table in order to get information or check whether an element exists, and require the response to be as fast as possible. Continuous data growth is making it unafordable to keep entire relations in memory and some commercial applications provide two different engines to handle data in-memory and on-disk separately. However, these systems assign each table to one of these engines, forcing large relations to be kept on secondary storage. In this paper we present TwinS|a hybrid database management system that allows managing hybrid tables, i.e. tables partially managed by both engines. Our objective is twofold: first, to allow large tables that do not fit in the memory to partially benefit from in-memory management techniques and, second, to provide a way to discard unnecessary accesses to both memory and disk. Overall, we show that we can reduce response time when accessing a large table in the database. All our experiments have been run on a dual-engine DBMS: IBM-SolidDB .

  • Access to the full text
    Overlapping community search for social networks  Open access

     Padrol Sureda, Arnau; Perarnau Llobet, Guillem; Pfeifle, Julian Thoralf; Muntés Mulero, Víctor
    IEEE International Conference on Data Engineering
    p. 992-995
    DOI: 10.1109/ICDE.2010.5447860
    Presentation's date: 2010-03
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes, real-world datasets suggest the presence of overlapping communities. We present OCA, a novel algorithm to detect overlapped communities in large data graphs. It outperforms previous proposals in terms of execution time, and efficiently handles large graphs containing more than 108 nodes and edges.

  • Desemantization for numerical microdata anonymization

     Pont Tuset, Jordi; Nin Guerrero, Jordi; Medrano Gracia, Pau; Larriba Pey, Josep; Muntés Mulero, Víctor
    Date of publication: 2010
    Book chapter

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    The design of cryptographic and security protocols for new scenarios and applications can be computationally expensive. Examples of these can be sensor or mobile ad-hoc networks where thousands of nodes can be involved. In such cases, the aid of an automated tool generating protocols for a predefined problem can be of great utility. This work uses the genetic algorithms (GA) techniques for the automatic design of security networked protocols. When using GA for optimizing protocols two aspects are critical: the genome definition and the evaluation function. We discuss how security protocols can be represented as binary strings and can be interpreted as security protocols; moreover we define several basic criteria for evaluating security protocols. Finally, we present the software we developed for generating secure communications protocols and show some examples and obtained results.

  • Exploiting Pipeline Interruptions for Efficient Memory Allocation

     Muntés Mulero, Víctor
    XIV Jornadas de Ingeniería del Software y Bases de Datos
    Presentation's date: 2009-09-08
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Access to the full text
    Búsqueda de comunidades en grafos grandes mediante configuraciones implícitas de vectores  Open access

     Muntés Mulero, Víctor; Padrol Sureda, Arnau; Perarnau Llobet, Guillem; Pfeifle, Julian Thoralf
    Encuentros de Geometría Computacional
    p. 173-180
    Presentation's date: 2009-06-29
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Presentamos el algoritmo OCA para buscar comunidades solapadas en grafos grandes, como por ejemplo la Wikipedia con 1,6×107 nodos y 1,8×108 aristas. OCA se basa en la búsqueda iterativa de subconjuntos localmente óptimos para una función objetivo, representando los subconjuntos como vectores suma de una configuración virtual de vectores. Analizamos el comportamiento de dos funciones objetivo, la Laplaciana asociada a la longitud del vector suma, y la conductividad.

  • Laboratorio de Introducción a los Computadores: funcionamiento y dificultades docentes

     Navarro Guerrero, Juan Jose; Cruz Diaz, Josep-llorenç; Faúndez Zanuy, Marcos; Gonzalez Tallada, Marc; Manso Cortes, Oscar; Muntés Mulero, Víctor; Palomar Perez, Oscar; Rodero Castro, Ivan; Sanchez Castaño, Friman; Solé Simó, Marc
    Jornades de Docència del Departament d'Arquitectura de Computadors
    p. 1-20
    Presentation's date: 2009-02
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Privacy and anonymization for very large datasets

     Muntés Mulero, Víctor; Nin Guerrero, Jordi
    ACM International Conference on Information and Knowledge Management
    p. 2117-2118
    DOI: /doi.acm.org/10.1145/1645953.1646333
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • CONTINUACIÓN DE LA CREACIÓN DE UN SISTEMA DE ANALISIS DE LA INVESTIGACIÓN EN ESPAÑA, TIN2007-30380

     Dominguez Sala, David; Martinez Bazan, Norbert; Pau Fernandez, Raquel; Muntés Mulero, Víctor; Gomez Villamor, Sergio; Larriba Pey, Josep
    Competitive project

     Share

  • 9th Business Ideas Competition of the Department of Innovation, Universities and Industry of the Generalitat de Catalunya

     Muntés Mulero, Víctor; Larriba Pey, Josep; Martinez Bazan, Norbert; Baleta Ferrer, Pedro
    Award or recognition

     Share

  • IBM CAS Faculty Award 2009

     Muntés Mulero, Víctor
    Award or recognition

     Share

  • Exploiting Pipeline Interruptions for Efficient Memory Allocation

     Aguilar, Josep; Mohammad, Jalali; Sharpe, Dave; Muntés Mulero, Víctor
    ACM International Conference on Information and Knowledge Management
    p. 639-648
    Presentation's date: 2008-10-26
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Improving microaggregation for complex record anonymization

     Pont Tuset, Jordi; Nin Guerrero, Jordi; Medrano Gracia, Pau; Larriba Pey, Josep; Muntés Mulero, Víctor
    International Conference on Modeling Decisions for Artificial Intelligence
    p. 215-226
    DOI: 10.1007/978-3-540-88269-5_20
    Presentation's date: 2008-10-31
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Microaggregation is one of the most commonly employed microdata protection methods. This method builds clusters of at least k original records and replaces the records in each cluster with the centroid of the cluster. Usually, when records are complex, i.e., the number of attributes of the data set is large, this data set is split into smaller blocks of attributes and microaggregation is applied to each block, successively and independently. In this way, the information loss when collapsing several values to the centroid of their group is reduced, at the cost of losing the k-anonymity property when at least two attributes of different blocks are known by the intruder. In this work, we present a new microaggregation method called One dimension microaggregation (Mic1D − κ). This method gathers all the values of the data set into a single sorted vector, independently of the attribute they belong to. Then, it microaggregates all the mixed values together. Our experiments show that, using real data, our proposal obtains lower disclosure risk than previous approaches whereas the information loss is preserved.

  • Parallelizing record linkage for disclosure risk assessment

     Guisado Gamez, Joan; Prat Perez, Arnau; Nin Guerrero, Jordi; Muntés Mulero, Víctor; Larriba Pey, Josep
    Privacy in Statistical Databases
    p. 190-202
    DOI: 10.1007/978-3-540-87471-3_16
    Presentation's date: 2008-09-25
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Niveles de competencia y evaluación continua en Introducción a los Computadores

     Navarro Guerrero, Juan Jose; Solé Simó, Marc; Palomar Perez, Oscar; Cruz Diaz, Josep-llorenç; Muntés Mulero, Víctor; Sanchez Castaño, Friman; Martorell Bofill, Xavier
    Jornades de Docència del Departament d'Arquitectura de Computadors
    p. 1-11
    Presentation's date: 2008-02
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • ONN the use of neural networks for data privacy

     Pont Tuset, Jordi; Medrano Gracia, Pau; Nin Guerrero, Jordi; Larriba Pey, Josep; Muntés Mulero, Víctor
    International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)
    p. 634-645
    DOI: 10.1007/978-3-540-77566-9_55
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Semantic blocking for record linkage

     Nin Guerrero, Jordi; Muntés Mulero, Víctor; Martinez Bazan, Norbert; Larriba Pey, Josep
    International Conference of the Catalan Association for Artificial Intelligence
    p. 141-149
    Presentation's date: 2007-10-25
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • DEX: High Performance Exploration on Large Graphs for Information Retrieval

     Martinez Bazan, Norbert; Muntés Mulero, Víctor; Gomez Villamor, Sergio; Nin, J; Sánchez, Marcelo; Larriba Pey, Josep
    Date: 2007-08
    Report

     Share Reference managers Reference managers Open in new window

  • Genetic optimization for large join queries

     Muntés Mulero, Víctor
    Department of Computer Architecture, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • Introducción a los Computadores: una asignatura en el EEES

     Navarro Guerrero, Juan Jose; Cruz Diaz, Josep-llorenç; Muntés Mulero, Víctor; Palomar Perez, Oscar; Sanchez Castaño, Friman; Solé Simó, Marc
    Jornades de Docència del Departament d'Arquitectura de Computadors
    p. 1-16
    Presentation's date: 2007-02
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    Parameter determination of ONN (Ordered Neural Networks)  Open access

     Pont Tuset, Jordi; Medrano Gracia, Pau; Nin Guerrero, Jordi; Larriba Pey, Josep; Muntés Mulero, Víctor
    Date: 2007
    Report

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    The need for data privacy motivates the development of new methods that allow to protect data minimizing the disclosure risk without losing information. In this paper, we propose a new protection method for numerical data called Ordered Neural Networks (ONN) method. ONN presents a new way to protect data based on the use of Artificial Neural Networks (ANN). ONN combines the use of ANN with a new strategy for preprocessing data consisting in the vectorization, sorting and partitioning of all the values in the attributes to be protected in the data set. We also present an statistical analysis that allows to understand the most important parameters affecting the quality of our method, and we show that it is possible to find a good configuration for these parameters. Finally, we compare our method to the best methods presented in the literature, using data provided by the US Census Bureau. Our experiments show that ONN outperforms the previous methods proposed in the literature, proving that the use of ANNs in these situations is convenient to protect the data efficiently without losing the statistical properties of the set.

    Postprint (author’s final draft)

  • Ordered Data Set Vectorization for Linear Regression on Data Privacy

     Medrano, Pau; Jordi, Pont; Jordi, Nin; Muntés Mulero, Víctor
    4th International Conference on Modeling Decisions for Artificial Intelligence MDAI 2007
    p. 361-372
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Access to the full text
    Increasing polynomial regression complexity for data anonymization  Open access

     Nin Guerrero, Jordi; Pont Tuset, Jordi; Medrano Gracia, Pau; Larriba Pey, Josep; Muntés Mulero, Víctor
    International Conference on Intelligent Pervasive Computing
    p. 29-34
    DOI: 10.1109/IPC.2007.103
    Presentation's date: 2007
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Pervasive computing and the increasing networking needs usually demand from publishing data without revealing sensible information. Among several data protection methods proposed in the literature, those based on linear regression are widely used for numerical data. However, no attempts have been made to study the effect of using more complex polynomial regression methods. In this paper, we present PoROP-k, a family of anonymizing methods able to protect a data set using polynomial regressions. We show that PoROP-k not only reduces the loss of information, but it also obtains a better level of protection compared to previous proposals based on linear regressions.

  • Improving Quality and Convergence of Genetic Query Optimizers

     Muntés Mulero, Víctor; Lafon Gracia, Nestor; Aguilar Saborit, Josep; Larriba Pey, Josep
    12th International Conference on Database Systems for Advanced Applications DASFAA 2007
    p. 6-17
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Anonymizing data via polynomial regression

     Nin Guerrero, Jordi; Pont Tuset, Jordi; Medrano Gracia, Pau; Larriba Pey, Josep; Muntés Mulero, Víctor
    Simposio en Ingeniería de Sistemas y Automática en Bioingeniería
    p. 19-26
    Presentation's date: 2007
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • DEX: High-performance exploration on large graphs for information retrieval

     Martinez Bazan, Norbert; Muntés Mulero, Víctor; Gomez Villamor, Sergio; Nin Guerrero, Jordi; Sánchez Martínez, Mario; Larriba Pey, Josep
    ACM International Conference on Information and Knowledge Management
    p. 573-582
    DOI: /doi.acm.org/10.1145/1321440.1321521
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Link and graph analysis tools are important devices to boost the richness of information retrieval systems. Internet and the existing social networking portals are just a couple of situations where the use of these tools would be beneficial and enriching for the users and the analysts. However, the need for integrating different data sources and, even more important, the need for high performance generic tools, is at odds with the continuously growing size and number of data repositories. In this paper we propose and evaluate DEX, a high performance graph database querying system that allows for the integration of multiple data sources. DEX makes graph querying possible in different flavors, including link analysis, social network analysis, pattern recognition and keyword search. The richness of DEX shows up in the experiments that we carried out on the Internet Movie Database(IMDb). Through a variety of these complex analytical queries, DEX shows to be a generic and efficient tool on large graph databases.

  • Access to the full text
    On the use of semantic blocking techniques for data cleansing and integration  Open access

     Nin Guerrero, Jordi; Muntés Mulero, Víctor; Martinez Bazan, Norbert; Larriba Pey, Josep
    International Database Engineering and Applications Symposium
    p. 190-198
    DOI: 10.1109/IDEAS.2007.4318104
    Presentation's date: 2007
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Record Linkage (RL) is an important component of data cleansing and integration. For years, many efforts have focused on improving the performance of the RL process, either by reducing the number of record comparisons or by reducing the number of attribute comparisons, which reduces the computational time, but very often decreases the quality of the results. However, the real bottleneck of RL is the post-process, where the results have to be reviewed by experts that decide which pairs or groups of records are real links and which are false hits. In this paper, we show that exploiting the relationships (e.g. foreign key) established between one or more data sources, makes it possible to find a new sort of semantic blocking method that improves the number of hits and reduces the amount of review effort.

  • Parameterizing a Genetic Optimizer

     Muntés Mulero, Víctor
    17th International Conference on Database and Expert Systems Applications. (DEXA 2006)
    Presentation's date: 2006-09-04
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • IOAgent: A Parallel I/O Workload Generator

     Muntés Mulero, Víctor
    Euro-Par
    Presentation's date: 2006-08-28
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Modelling genetic methods for data search strategies with ANOVA

     Muntés Mulero, Víctor
    21st International Workshop on Statistical Modelling (IWSM'2006)
    Presentation's date: 2006-07-03
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • analyzing the Genetic Operations of an Evolutionary Query Optimizer

     Muntés Mulero, Víctor
    23rd British National Conference on Databases (BNCOD 23)
    Presentation's date: 2006-07-18
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • CGO: A Sound Genetic Optimizer for Cyclic Query Graphs

     Muntés Mulero, Víctor
    International Conference on Computational Science
    Presentation's date: 2006-05-28
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • CGO: A Sound Genetic Optimizer for Cyclic Query Graphs

     Muntés Mulero, Víctor
    International Conference on Computational Science
    Presentation's date: 2006-05-28
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Parameterizing a Genetic Optimizer for Star Join Queries

     Muntés Mulero, Víctor; Larriba Pey, Josep; Aguilar Saborit, Josep; Zuzarte, C; Pérez, M
    Date: 2006-03
    Report

     Share Reference managers Reference managers Open in new window

  • IO Agent: A Parallel I/O Workload Generator

     Gomez Villamor, Sergio; Muntés Mulero, Víctor; Perez Casany, Marta; John, Tran; Steve, Rees; Larriba Pey, Josep
    Euro-Par
    p. 4-14
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Parameterizing a Genetic Optimizer

     Muntés Mulero, Víctor; Perez Casany, Marta; Aguilar Saborit, Josep; Carlisto, Zuzarte; Larriba Pey, Josep
    17th International Conference on Database and Expert Systems Applications. (DEXA 2006)
    p. 707-717
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Intensive Crossovers. Improving quality in a Genetic Qyert Optimizer

     Muntés Mulero, Víctor; Aguilar Saborit, Josep; Calisto, Zuzarte; Larriba Pey, Josep
    XI Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2006)
    p. 131-140
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • CGO: A Sound Genetic Optimizer for Cyclic Query Graphs

     Muntés Mulero, Víctor; Aguilar Saborit, Josep; Calisto, Zuzarte; Larriba Pey, Josep
    International Conference on Computational Science
    p. 156-163
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • An inside anlaysis of a genetic - programming based optimizer

     Muntés Mulero, Víctor; Aguilar Saborit, Josep; Larriba Pey, Josep
    10th International Database Engineering and Applications Symposium (IDEAS'06)
    p. 249-255
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Analyzing the Genetic Operations of an Evolutionary Query Optimizer

     Muntés Mulero, Víctor; Aguilar Saborit, Josep; Calisto, Zuzarte; Volker, Markl; Larriba Pey, Josep
    23rd British National Conference on Databases (BNCOD 23)
    p. 240-244
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Modelling genetic methods for data search strategies with ANOVA

     Muntés Mulero, Víctor; Perez Casany, Marta; Aguilar Saborit, Josep; Larriba Pey, Josep
    21st International Workshop on Statistical Modelling (IWSM'2006)
    p. 393-400
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • An IO-based Cost Model for the Carquinyoli Genetic Optimizer

     Muntés Mulero, Víctor; Larriba Pey, Josep; Aguilar Saborit, Josep; Zuzarte, C
    Date: 2005-12
    Report

     Share Reference managers Reference managers Open in new window

  • IOAgent: Leveraging the Application Analysis of Workload Effects

     Muntés Mulero, Víctor; Larriba Pey, Josep
    Date: 2005-11
    Report

     Share Reference managers Reference managers Open in new window

  • Ad-hoc Star Hash Join Processing in Cluster Architectures

     Muntés Mulero, Víctor
    Data Warehousing and Knowledge Discovery: 7th International Conference
    Presentation's date: 2005-08-22
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Ad-hoc star join processing in Clusters of SMP

     Muntés Mulero, Víctor; Larriba Pey, Josep
    Date: 2005-04
    Report

     Share Reference managers Reference managers Open in new window