INESC-ID

About: INESC-ID is a nonprofit organization based out in Lisbon, Portugal. It is known for research contribution in the topics: Computer science & Context (language use). The organization has 932 authors who have published 2618 publications receiving 37658 citations.

Towards a General and Extensible Phrase-Extraction Algorithm

Abstract: Phrase-based systems deeply depend on the quality of their phrase tables and therefore, the process of phrase extraction is always a fundamental step. In this paper we present a general and extensible phrase extraction algorithm, where we have highlighted several control points. The instantiation of these control points allows the simulation of previous approaches, as in each one of these points different strategies/heuristics can be tested. We show how previous approaches fit in this algorithm, compare several of them and, in addition, we propose alternative heuristics, showing their impact on the final translation results. Considering two different test scenarios from the IWSLT 2010 competition (BTEC, Fr-En and DIALOG, Cn-En), we have obtained an improvement in the results of 2.4 and 2.8 BLEU points, respectively.

RNS Arithmetic Units for Modulo {2^n+-k}

Abstract: Recently new Residue Number Systems (RNS) moduli sets have been proposed in order to increase the dynamic range and reduce the width of channels, therefore, reducing the processing time and further exploiting the carry-free characteristic of the modular arithmetic. In this paper we propose improved units for addition, subtraction, and multiplication in RNS for modulo {2^n+-k}. With this work, the somewhat disregarded field of RNS unit design is covered, encouraging the development of moduli sets with channels other than the traditional {2^n}, {2^n+-1} modulo. In order to evaluate the performance of the proposed structures, they are compared with the well known units for modulo {2^n}, {2^n+-1}, and {2^n+-3}. These structures allow to implement generic units for modulo {2^n+-k}, in the case of modular multiplication it is achieved the same critical path delay and merely 4% of increase on area resources, when compared with the dedicated structure presented in the state-of-art for modulo {2^n+-3}.

Stylometric relevance-feedback towards a hybrid book recommendation algorithm

Abstract: Reading is an important activity for individuals. Content-based recommendation systems are, typically, used to recommend scientific papers or news, where search is driven by topic. Literary reading or reading for leisure differs from scientific reading, because users search books not only for their topic but also by author or writing style. Choosing a new book to read can be tricky and recommendation systems can make it easy by selecting books that the user will like. In this paper we study recommendation through writing style and the influence of negative examples in user preferences. Our experiments were conducted in a hybrid set-up that combines a collaborative filtering algorithm with stylometric relevance feedback. Using the LitRec data set, we demonstrate that writing style influences book selection; that book content, characterized with writing style, can be used to improve collaborative filtering results; and that negative examples do not improve final predictions.

Development of CMS-Based Web-Applications Using a Model-Driven Approach

Abstract: The emerging Model-Driven Engineering paradigm advocates the use of models as first-class citizens in the software development process, while artifacts such as documentation and source-code can be quickly produced from those models by using automated transformations. One of the many types of deployment platforms that can potentially benefit from such model-driven approaches are Content Management Systems, as these approaches can significantly accelerate the development of new web-applications and features, as well as simplify their maintenance. This work proposes the creation of a model-driven approach for the development of web-applications based on Content Management Systems. This approach is based on the creation of two modeling languages (which are situated at different levels of abstraction, and are used to both quickly model a web-application and provide a common ground for the creation of additional languages), and a mechanism for the processing of models specified using those languages. The current results of this work so far are the development of a Content Management System that effectively supports web-applications of medium complexity, and the creation of a reference case study that will be used to validate this work.

Temporal Logic Patterns for Querying Qualitative Models of Genetic Regulatory Networks

Abstract: Formal verification based on model checking provides a powerful technology to query qualitative models of dynamical systems. The application of model-checking approaches is hampered, however, by the difficulty for non-expert users to formulate appropriate questions in temporal logic. In order to deal with this problem, we propose the use of patterns, that is, high-level query templates capturing recurring questions which can be automatically translated to temporal logic. We develop a set of patterns for the analysis of qualitative models of genetic regulatory networks, which are sufficiently generic though to be useful in other application domains. The applicability of the patterns has been investigated by the analysis of a model of the network of global regulators controlling the carbon starvation response in Escherichia coli.