Mirella Moro

Followers

Following

Public Views

Interests

Uploads

Papers by Mirella Moro

Collaboration recommendation on academic social networks

In the academic context, scientific research works are often performed through collaboration and ... more In the academic context, scientific research works are often performed through collaboration and cooperation between researchers and research groups. Researchers work in various subjects and in several research areas. Identifying new partners to execute joint research and analyzing the level of cooperation of the current partners can be very complex tasks. Recommendation of new collaborations may be a valuable tool for reinforcing and discovering such partners. This paper presents an innovative approach to recommend ...

Global Awareness for Computing Educators and Scholars

Proceedings of the 49th ACM Technical Symposium on Computer Science Education

Mulheres na Computação: Análises por Sub-Áreas

Anais do Women in Information Technology (WIT)

Este artigo apresenta a presença feminina nas sub-áreas da Computação brasileira a partir da part... more

Download

Modelo temporal de versões

Resumo : Esse trabalho apresenta uma alternativa para a união de dados temporais e um modelo de v... more Resumo : Esse trabalho apresenta uma alternativa para a união de dados temporais e um modelo de versões. O resultado, o Modelo Temporal de Versões-TVM, armazena as versões de objetos e, para cada versão, o histórico dos valores de seus atributos e relacionamentos dinâmicos. O TVM é ideal para modelar sistemas que evoluem no tempo e que necessitam gerenciar alternativas de projeto como versões. Uma interface para modelar as classes no Modelo também é apresentada.

Download

Mapeamento de consultas do modelo TF-ORM para consultas SQL

UFRGS). O TF-ORM (Temporal Functionality in Objects with Roles Model) é um modelo de dados tempor... more UFRGS). O TF-ORM (Temporal Functionality in Objects with Roles Model) é um modelo de dados temporal orientado a objetos que utiliza o conceito de papéis para representar os diferentes comportamentos dos mesmos. Como não existe um SGBD para o TF-ORM, optou-se por fazer o mapeamento do modelo para um BD relacional comercial. Tendo-se esse mapeamento pronto, o próximo passo é permitir que o usuário faça consultas TF-ORM sobre o BD. Assim como o modelo, a consulta também deve ser traduzida para uma linguagem que permita sua execução sobre um BD relacional. A linguagem escolhida foi o SQL (Strutuctured Query Language) por ser uma linguagem muito conhecida e aceita pela maioria dos BDs relacionais. Esse trabalho tem por objetivo implementar uma ferramenta que realize o mapeamento de consultas textuais do TF-ORM para SQL. A interface apresenta uma área onde o usuário escreve a consulta TF-ORM e outra área para visualizar a tradução em SQL, a qual será gravada num arquivo de extensão .SQL. A área de edição é similar a um editor de texto, com as funções principais de edição: cortar, colar, localizar, imprimir, etc. A consulta também pode ser carregada de um arquivo de qualquer tipo, a princípio um arquivo texto. Após o mapeamento entre as consultas, o usuário ainda tem a opção de executá-la sobre a base de dados desejada. A implementação da ferramenta está sendo feita com a utilização do ambiente de programação Delphi 3.0 Professional e do banco de dados relacional Sybase SQL Anywhere 5.0 (CNPq).

Download

Automatically Generating Structured Queries in XML Keyword Search

techniques for discovery of Web services based on searching service descriptions provided in WSDL... more techniques for discovery of Web services based on searching service descriptions provided in WSDL. XML-Mining Track Investigating structured document mining, especially the classification and clustering of semi-structured documents. The aim of the INEX 2010 workshop is to bring together researchers in the field of XML IR who participated in the INEX 2010 campaign. During the past year participating organizations contributed to the building of a large-scale XML test collection by creating topics, performing retrieval runs and providing relevance assessments. The workshop concludes the results of this large-scale effort, summarizes and addresses encountered issues and devises a work plan for the future evaluation of XML retrieval systems. All INEX tracks start from having available suitable text collections. We gratefully acknowledge the data made available by: Amazon and LibraryThing (Interactive Track), New Zealand Ministry for Culture and Heritage (Te Ara, Link-the-Wiki Track), Microsoft Research (Book Track), the Internet Movie Database (Data Centric Track), and the Wikimedia Foundation (Adhoc, Relevance Feedback, and XML-Mining Track). Finally, INEX is run for, but especially by, the participants. It is a result of tracks and tasks suggested by participants, topics created by particants, systems built by participants, and relevance judgments provided by participants. So the main thank you goes each of these individuals!

Download

Semantic Search over XML Document Streams

A large number of web data sources, such as blogs, news sites and podcast hosts, are currently di... more A large number of web data sources, such as blogs, news sites and podcast hosts, are currently disseminating their content in the form of streaming XML documents. The variability and heterogeneity of those sources make the employment of traditional querying schemes, which are based on structured query languages, cumbersome for the end user (those languages require precise knowledge of the underlying schema of each queried data source in order to be able to formulate meaningful queries). On the other hand, keyword search provides an alternative retrieval paradigm that is both simple and effective. Its importance for XML retrieval is well established and many specialized XML search engines have already appeared. Those engines support semantic search over XML documents within persistent environments, in which XML documents are permanently stored and can be indexed for efficient retrieval. Nevertheless, to the best of our knowledge, there is currently no published work that focuses on a streaming environment. In this paper, we attempt to fill this gap and study the problem of semantic keyword search over streaming XML documents. In particular, we build on previous work on semantic search over stored XML documents and propose a retrieval language that is simple and enables semantic search over XML documents. We then devise novel, online query processing algorithms that can answer semantic search queries over streaming XML data.

Download

A Temporal Versions Model for Time- Evolving Systems Specification

Seke, 2001

Abstract This work presents an alternative for the union of temporal data and a version model The... more Abstract This work presents an alternative for the union of temporal data and a version model The result, the Temporal Versions Model, is able to store object versions and, for each version, the history of its dynamic properties values TVM is ideal for modeling time - evolving systems that need to manage design alternatives as versions One of the main

2011 WISM Keynote - Academic Social Networks

Download

Cooperative authorship social network

This paper introduces a set of challenges for developing a dissemination service over a Web colla... more This paper introduces a set of challenges for developing a dissemination service over a Web collaborative network. We define specific metrics for working on a co-authorship research social network. As a case study, we build such a network using those metrics and compare it to a manually built one. Specifically, once we build a collaborative network and verify its quality, the overall effectiveness of the dissemination services will also be improved.

Download

Tree-Pattern Queries on a Lightweight XML Processor

Proceedings of the 31st International Conference on Very Large Data Bases, 2005

Popular XML languages, like XPath, use "treepattern" queries to select nodes based on their struc... more Popular XML languages, like XPath, use "treepattern" queries to select nodes based on their structural characteristics. While many processing methods have already been proposed for such queries, none of them has found its way to any of the existing "lightweight" XML engines (i.e. engines without optimization modules). The main reason is the lack of a systematic comparison of query methods under a common storage model. In this work, we aim to fill this gap and answer two important questions: what the relative similarities and important differences among the tree-pattern query methods are, and if there is a prominent method among them in terms of effectiveness and robustness that an XML processor should support. For the first question, we propose a novel classification of the methods according to their matching process. We then describe a common storage model and demonstrate that the access pattern of each class conforms or can be adapted to conform to this model. Finally, we perform an experimental evaluation to compare their relative performance. Based on the evaluation results, we conclude that the family of holistic processing methods, which provides performance guarantees, is the most robust alternative for such an environment.

Download

Mapping Network Relationships from Spatial Database Schemas to GML Documents

Journal of Information and Data Management, 2011

Adding time to an object-oriented versions models

Lecture Notes in Computer Science, 2001

Ferramenta de apoio à especificação de classes do modelo temporal de versões

Temporal Influence in Collaborators Recommendation on Social Networks

Download

Early Profile Pruning on XML-aware Publish/Subscribe Systems

Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

Publish-subscribe applications are an important class of contentbased dissemination systems where... more Publish-subscribe applications are an important class of contentbased dissemination systems where the message transmission is defined by the message content, rather than its destination IP address. With the increasing use of XML as the standard format on many Internet-based applications, XML aware pub-sub applications become necessary. In such systems, the messages (generated by publishers) are encoded as XML documents, and the profiles (defined by subscribers) as XML query statements. As the number of documents and query requests grow, the performance and scalability of the matching phase (i.e. matching of queries to incoming documents) become vital. Current solutions have limited or no flexibility to prune out queries in advance. In this paper, we overcome such limitation by proposing a novel early pruning approach called Bounding-based XML Filtering or BoXFilter. The BoXFilter is based on a new tree-like indexing structure that organizes the queries based on their similarity and provides lower and upper bound estimations needed to prune queries not related to the incoming documents. Our experimental evaluation shows that the early profile pruning approach offers drastic performance improvements over the current state-of-the-art in XML filtering. 1. INTRODUCTION Publish-subscribe applications (or simply pub-sub) are an important class of asynchronous content-based dissemination systems where the message transmission is defined by the message content, rather than its destination IP address. Examples of pub-sub systems include notification websites (such as hotwire.com or ticketmaster.com), where a user can subscribe for events of interest (new deals on their favorite travel destinations, concerts of their favorite artists in their local area etc.) and get automatic notifications when relevant events arrive in the system. Many pub-sub systems have already been proposed with different architectures (centralized within a server [1, 9, 11] or distributed over a network of brokers [5, 8]) but they all follow the same asynchronous event-based communication paradigm. The events are * Research partially supported by UC Micro, Lotus Interworks and NSF IIS-0534781

Download

XML: some papers in a haystack

Acm Sigmod Record, 2009

XML has been explored by both research and industry communities. More than 5500 papers were publi... more XML has been explored by both research and industry communities. More than 5500 papers were published on different aspects of XML. With so many publications, it is hard for someone to decide where to start. Hence, this paper presents some of the research topics on XML, namely: XML on relational databases, query processing, views, data matching, and schema evolution. It then summarizes some (some!) of the most relevant or traditional papers on those subjects.

Download

Value-Aware RoXSum: Effective Message Aggregation for XML-Aware Information Dissemination

Webdb, 2007

Publish/subscribe (or pub/sub) systems perform asynchronous message transmission, from publishers... more Publish/subscribe (or pub/sub) systems perform asynchronous message transmission, from publishers to subscribers, without any of the parties having knowledge of the other. The pub/sub infrastructure manages the delivery of the messages, which is guided by user subscriptions that specify the type of information the subscribers are interested in. Since XML prevails as the standard for information exchange, efficient XML-aware pub/sub systems become necessary. Within that context, we propose VA-RoXSum, a novel message representation scheme that aggregates the content of messages in a space efficient manner. Coupled with specialized processing algorithms that operate on its aggregated content, the VA-RoXSum enables the batch processing of groups of messages and considerably improves the performance of the subscription-guided filtering task. Our preliminary experiments show that a pub/sub infrastructure with VA-RoXSum achieves up to two orders of magnitude faster matching, compared with state-of-the-art alternatives, which operate on the original messages. * Research partially supported by Lotus Interworks and UC Micro.

Download

Lads latin american dissemination system

Using link semantics to recommend collaborations in academic social networks

Proceedings of the 22nd International Conference on World Wide Web - WWW '13 Companion, 2013

ABSTRACT A recent work shows that research groups with well connected academic networks tend to b... more ABSTRACT A recent work shows that research groups with well connected academic networks tend to be more prolific. Hence, recommending collaborations is essential for increasing a group’s connections, then boosting the group research as a collateral advantage. In this work, we propose two new metrics for recommending new collaborations or intensification of existing ones. Each metric considers a social principle (homophily and proximity) that is relevant within the academic context. We also propose new measures for evaluating the recommendations based on social concepts (novelty, diversity and coverage) that have never been used for such a goal. Our experimental evaluation shows that considering our new metrics improves the quality of the recommendations.

Mirella Moro

Uploads

Papers by Mirella Moro

Log In