A contribuição da informática para o desenvolvimento sustentável: o exemplo do conceito de grid computing

Este trabalho foi realizado sob orientação do Prof. António Brandão Moniz para a disciplina “Factores Sociais da Inovação” do Mestrado Engenharia Informática realizado na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa (Portugal)

Aplicação informática para o estudo da viabilidade técnico-económica de uma habitação sustentável

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Energias Renováveis – Conversão Eléctrica e Utilização Sustentáveis

Segurança informática: a perspectiva da Nato

O problema da Segurança da Informação em ambientes informatizados tem vindo a crescer significativamente. Porém, verifica-se existirem diferentes perspectivas e abordagens à questão da Segurança Informática, raramente concordantes, nem mesmo no essencial, verificando-se alguma dificuldade em estabelecer um conjunto de pressupostos teóricos que permitam estruturar a análise da realidade. Estas questões, preocupam os organismos ligados à Defesa, nomeadamente no âmbito da NATO, que tem vindo a divulgar uma série de documentos, não classificados, relativamente à sua perspectiva sobre o assunto, enunciando requisitos de segurança com vista a estabelecer padrões de orientação para os construtores de hardware e software de modo a que, após certificação, possam vir a ser usados militarmente.

Desenvolvimento de uma ferramenta informática para avaliação económica de implementação de microgeração fotovoltaica em edifícios

Dissertação para obtenção do Grau de Mestre em Energias Renováveis – Conversão Eléctrica e Utilização Sustentável

Sinonímia, polissemia, homonímia em manuais, gramáticas e dicionários escolares para o desenvolvimento da competência lexical

Dissertação apresentada para cumprimento dos requisitos necessários à obtenção do grau de Doutor em Linguística – Especialidade de Lexicologia, Lexicografia e Terminologia.

Dicionários e estudos linguísticos do português medieval. Um projecto de equipa

O tema destes Encontros Literdisciplinares da FCSH-UNL - A Ciência na Universidade - sugere que seja feito o enquadramento, embora muito resumidamente, da investigação que vou apresentar na unidade de investigação em que vem sendo desenvolvida - o Centro de Lingüística da Universidade Nova de Lisboa - CLUNL. A entrada da Lingüística na Universidade Nova tem uma história quase tão longa como a própria instituição, e o actual Centro de Lingüística resulta da restruturação recente do Centro de Estudos Comparados de Línguas e Literaturas Modemas, criado por decisão do Senado da Universidade com o apoio da então Junta Nacional de Investigação Científica e Tecnológica - JNICT, pouco tempo apôs a criação, em 1977, da Faculdade de Ciências Sociais e Humanas da Universidade Nova de Lisboa. No seu início, pretendia-se que o Centro reunisse a investigação literária e lingüística dos docentes do Departamento de Línguas e Literaturas Modemas existente na altura, o qual reunia as línguas românicas e germânicas, as literaturas e a lingüística. Porém, do mesmo modo que o Departamento se dividiu em cinco, do Centro foram saindo vários grupos ao longo dos anos, até que, há apenas um ano, se concretizou a separação do gmpo de Lingüística do gmpo que restava das Literaturas, dando origem ao Centro de Lingüística e a dois outros Centros de Literatura, um de Estudos Anglo-Portugueses e o outro de Estudos Portugueses.

Ensino de informática básica a deficientes visuais em regime e-learning em Cabo Verde

Trabalho de Projecto apresentado para cumprimento dos requisitos necessários à obtenção do grau de Mestre em Gestão de Sistemas de E-Learning

Integração de um Modelo de Aprendizagem em Blended-Learning no Curso de Informática Educativa, do Instituto Superior de Ciências da Educação da Huíla

Trabalho de Projecto apresentado para cumprimento dos requisitos necessários à obtenção do grau de Mestre em Gestão de Sistema de E-learning

Concurrent tabling

In the past few years Tabling has emerged as a powerful logic programming model. The integration of concurrent features into the implementation of Tabling systems is demanded by need to use recently developed tabling applications within distributed systems, where a process has to respond concurrently to several requests. The support for sharing of tables among the concurrent threads of a Tabling process is a desirable feature, to allow one of Tabling’s virtues, the re-use of computations by other threads and to allow efficient usage of available memory. However, the incremental completion of tables which are evaluated concurrently is not a trivial problem. In this dissertation we describe the integration of concurrency mechanisms, by the way of multi-threading, in a state of the art Tabling and Prolog system, XSB. We begin by reviewing the main concepts for a formal description of tabled computations, called SLG resolution and for the implementation of Tabling under the SLG-WAM, the abstract machine supported by XSB. We describe the different scheduling strategies provided by XSB and introduce some new properties of local scheduling, a scheduling strategy for SLG resolution. We proceed to describe our implementation work by describing the process of integrating multi-threading in a Prolog system supporting Tabling, without addressing the problem of shared tables. We describe the trade-offs and implementation decisions involved. We then describe an optimistic algorithm for the concurrent sharing of completed tables, Shared Completed Tables, which allows the sharing of tables without incurring in deadlocks, under local scheduling. This method relies on the execution properties of local scheduling and includes full support for negation. We provide a theoretical framework and discuss the implementation’s correctness and complexity. After that, we describe amethod for the sharing of tables among threads that allows parallelism in the computation of inter-dependent subgoals, which we name Concurrent Completion. We informally argue for the correctness of Concurrent Completion. We give detailed performance measurements of the multi-threaded XSB systems over a variety of machines and operating systems, for both the Shared Completed Tables and the Concurrent Completion implementations. We focus our measurements inthe overhead over the sequential engine and the scalability of the system. We finish with a comparison of XSB with other multi-threaded Prolog systems and we compare our approach to concurrent tabling with parallel and distributed methods for the evaluation of tabling. Finally, we identify future research directions.

Extraction automatique d´associations lexicales à partir de corpora

The automatic acquisition of lexical associations from corpora is a crucial issue for Natural Language Processing. A lexical association is a recurrent combination of words that co-occur together more often than expected by chance in a given domain. In fact, lexical associations define linguistic phenomena such as idiomes, collocations or compound words. Due to the fact that the sense of a lexical association is not compositionnal, their identification is fundamental for the realization of analysis and synthesis that take into account all the subtilities of the language. In this report, we introduce a new statistically-based architecture that extracts from naturally occurring texts contiguous and non contiguous. For that purpose, three new concepts have been defined : the positional N-gram models, the Mutual Expectation and the GenLocalMaxs algorithm. Thus, the initial text is fisrtly transformed in a set of positionnal N-grams i.e ordered vectors of simple lexical units. Then, an association measure, the Mutual Expectation, evaluates the degree of cohesion of each positional N-grams based on the identification of local maximum values of Mutual Expectation. Great efforts have also been carried out to evaluate our metodology. For that purpose, we have proposed the normalisation of five well-known association measures and shown that both the Mutual Expectation and the GenLocalMaxs algorithm evidence significant improvements comparing to existent metodologies.

Pattern operators for grid

The definition and programming of distributed applications has become a major research issue due to the increasing availability of (large scale) distributed platforms and the requirements posed by the economical globalization. However, such a task requires a huge effort due to the complexity of the distributed environments: large amount of users may communicate and share information across different authority domains; moreover, the “execution environment” or “computations” are dynamic since the number of users and the computational infrastructure change in time. Grid environments, in particular, promise to be an answer to deal with such complexity, by providing high performance execution support to large amount of users, and resource sharing across different organizations. Nevertheless, programming in Grid environments is still a difficult task. There is a lack of high level programming paradigms and support tools that may guide the application developer and allow reusability of state-of-the-art solutions. Specifically, the main goal of the work presented in this thesis is to contribute to the simplification of the development cycle of applications for Grid environments by bringing structure and flexibility to three stages of that cycle through a commonmodel. The stages are: the design phase, the execution phase, and the reconfiguration phase. The common model is based on the manipulation of patterns through pattern operators, and the division of both patterns and operators into two categories, namely structural and behavioural. Moreover, both structural and behavioural patterns are first class entities at each of the aforesaid stages. At the design phase, patterns can be manipulated like other first class entities such as components. This allows a more structured way to build applications by reusing and composing state-of-the-art patterns. At the execution phase, patterns are units of execution control: it is possible, for example, to start or stop and to resume the execution of a pattern as a single entity. At the reconfiguration phase, patterns can also be manipulated as single entities with the additional advantage that it is possible to perform a structural reconfiguration while keeping some of the behavioural constraints, and vice-versa. For example, it is possible to replace a behavioural pattern, which was applied to some structural pattern, with another behavioural pattern. In this thesis, besides the proposal of the methodology for distributed application development, as sketched above, a definition of a relevant set of pattern operators was made. The methodology and the expressivity of the pattern operators were assessed through the development of several representative distributed applications. To support this validation, a prototype was designed and implemented, encompassing some relevant patterns and a significant part of the patterns operators defined. This prototype was based in the Triana environment; Triana supports the development and deployment of distributed applications in the Grid through a dataflow-based programming model. Additionally, this thesis also presents the analysis of a mapping of some operators for execution control onto the Distributed Resource Management Application API (DRMAA). This assessment confirmed the suitability of the proposed model, as well as the generality and flexibility of the defined pattern operators

Aspect-oriented domain analysis

Dissertação de Mestrado em Engenharia Informática

Integrating early aspects with goal-oriented requirements engineering

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Informática

Extracção de unigramas relevantes

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Informática