Cognitive assessment of topological movement Patterns and direction turns: An influence of scale

Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.

Design and implementation of 3D buildings integration for a Webgl-Based Virtual Globe: a case study of Valencian Cadastre and Fide Building Mode

Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.

Multipath inter-domain policy routing

Dissertação submetida para a obtenção do grau de Doutor em Engenharia Electrotécnica e de Computadores

Multipath policy routing in packet switched networks

Dissertação apresentada para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Maintaining the correctness of transactional memory programs

Dissertação para obtenção do Grau de Doutor em Engenharia Informática

Comparative analysis of multicriteria decision making methods

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores

Three essays on game theory and bargaining

A PhD Dissertation, presented as part of the requirements for the Degree of Doctor of Philosophy from the NOVA - School of Business and Economics

Planning and verification of multipath routing protocols

Conventionally the problem of the best path in a network refers to the shortest path problem. However, for the vast majority of networks present nowadays this solution has some limitations which directly affect their proper functioning, as well as an inefficient use of their potentialities. Problems at the level of large networks where graphs of high complexity are commonly present as well as the appearing of new services and their respective requirements, are intrinsically related to the inability of this solution. In order to overcome the needs present in these networks, a new approach to the problem of the best path must be explored. One solution that has aroused more interest in the scientific community considers the use of multiple paths between two network nodes, where they can all now be considered as the best path between those nodes. Therefore, the routing will be discontinued only by minimizing one metric, where only one path between nodes is chosen, and shall be made by the selection of one of many paths, thereby allowing the use of a greater diversity of the present paths (obviously, if the network consents). The establishment of multi-path routing in a given network has several advantages for its operation. Its use may well improve the distribution of network traffic, improve recovery time to failure, or it can still offer a greater control of the network by its administrator. These factors still have greater relevance when networks have large dimensions, as well as when their constitution is of high complexity, such as the Internet, where multiple networks managed by different entities are interconnected. A large part of the growing need to use multipath protocols is associated to the routing made based on policies. Therefore, paths with different characteristics can be considered with equal level of preference, and thus be part of the solution for the best way problem. To perform multi-path routing using protocols based only on the destination address has some limitations but it is possible. Concepts of graph theory of algebraic structures can be used to describe how the routes are calculated and classified, enabling to model the routing problem. This thesis studies and analyzes multi-path routing protocols from the known literature and derives a new algebraic condition which allows the correct operation of these protocols without any network restriction. It also develops a range of software tools that allows the planning and the respective verification/validation of new protocols models according to the study made.

Prevalence of Chagas disease in blood donors at the Uberaba Regional Blood Center, Brazil, from 1995 to 2009

INTRODUCTION: A retrospective study was conducted to assess the occurrence of blood donations that were ineligible due to Chagas disease infection from 1995 to 2009 at the Uberaba Regional Blood Center (HRU), Brazil, verify the tendency of this ineligibility, and describe the epidemiologic profile of the donors. METHODS: Retrospective studies of serological ineligibility due to Chagas disease, statistical analysis by means of the chi-square test and odds ratio, study of the tendencies using a dispersion graph and the linear correlation coefficient (r) were performed. RESULTS: In the period under study, a 0.2% serum prevalence of ineligibility due to Chagas disease was found, with a significant drop in ineligible donations from 2001 to 2009. Among the serum positive-donors, there was a significant predominance among those aged 30 years or above and non-single individuals. CONCLUSIONS: The results show a rate of occurrence that is lower than that described in literature, as well as a progressive drop during the 15 years under assessment. Such results are a consequence of systematic combat of the vector since the 70s and the progressive and consistent increase of returning donors, resulting in a drop of the contamination risk factor by means of blood transfusion and in the improvement of the quality of hemotherapy practices in the HRU.

Concurrency detection on finish-to-start activity precedence networks

We explore the finish-to-start precedence relations of project activities used in scheduling problems. From these relations, we devise a method to identify groups of activities that could execute concurrently, i.e. activities in the same group can all execute in parallel. The method derives a new set of relations to describe the concurrency. Then, it is represented by an undirected graph and the maximal cliques problem identifies the groups. We provide a running example with a project from our previous studies in resource constrained project cost minimization together with an example application on the concurrency detection method: the evaluation of the resource stress.

Palinologia holocênica do testemunho Bom Jesus, margem leste da ilha do Marajó, Pará, Amazônia

A porção superior (1,25m) do testemunho de sondagem Bom Jesus (TBJ), coletado no limite campo-mangue da Fazenda Bom Jesus, município de Soure, ilha do Marajó, Pará, Brasil, foi estudada através de análise palinológica de alta resolução objetivando a determinação da composição, abundância e diversidade de tipos polínicos bioindicadores de modificações na paleovegetação durante o Holoceno. 16 amostras sedimentares de 2cm³ foram tratadas de acordo com metodologia padrão em palinologia. Os programas Tilia e Tilia Graph foram utilizados para a construção dos diagramas palinológicos de abundância e concentração. A base do testemunho foi datada por 14C em 2730 ± 40 anos A.P. Foram definidas três zonas palinológicas. A presença de pólen de Rhizophora com abundância máxima de 88% apontou dominância de mangue ao longo de todo o testemunho sedimentar. Variações recorrentes na hidrodinâmica da baía do Marajó, caracterizadas por pulsos erosivos de curto período, parecem ter provocado redução na dominância de mangue. O incremento na abundância de tipos polínicos bioindicadores de campo inundável associados a elementos de restinga e floresta, evidenciam a migração do campo inundável sobre o manguezal. Os dados indicam correlação com outros registros polínicos holocênicos de transgressão marinha para a costa norte amazônica no Holoceno Superior.

Column-based databases: estudo exploratório no âmbito das bases de dados NoSQL

Dissertação de mestrado integrado em Engenharia e Gestão de Sistemas de Informação

Document-based databases: estudo comparativo no âmbito das bases de dados NoSql

Dissertação de mestrado integrado em Engenharia e Gestão de Sistemas de Informação

From software extensions to product lines of dataflow programs

Abstract Dataflow programs are widely used. Each program is a directed graph where nodes are computations and edges indicate the flow of data. In prior work, we reverse-engineered legacy dataflow programs by deriving their optimized implementations from a simple specification graph using graph transformations called refinements and optimizations. In MDE-speak, our derivations were PIM-to-PSM mappings. In this paper, we show how extensions complement refinements, optimizations, and PIM-to-PSM derivations to make the process of reverse engineering complex legacy dataflow programs tractable. We explain how optional functionality in transformations can be encoded, thereby enabling us to encode product lines of transformations as well as product lines of dataflow programs. We describe the implementation of extensions in the ReFlO tool and present two non-trivial case studies as evidence of our work’s generality

As restrições à liberdade de testar

Dissertação de mestrado em Direito das Crianças, Família e Sucessões