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

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.

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.

Multiple sequence alignment correction using constraints

Trabalho apresentado no âmbito do European Master in Computational Logics, como requisito parcial para obtenção do grau de Mestre em Computational Logics

Declarative approach to data extraction of web pages

Thesis submitted to Faculdade de Ciências e Tecnologia of the Universidade Nova de Lisboa, in partial fulfilment of the requirements for the degree of Master in Computer Science

Estimation of infection rate in epidemic models with multiple populations

Dissertação para obtenção do Grau de Mestre em Matemática e Aplicações Especialização em Actuariado, Estatística e Investigação Operacional

Natural antioxidants extraction and their incorporation into model pharmaceutical systems

Dissertation to obtain a Master Degree in Biotechnology

Single operation multiple data - paralelismo de dados ao nível da sub-rotina

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

Modeling assembly program with constraints. A contribution to WCET problem

Dissertação para obtenção do Grau de Mestre em Lógica Computacional

Linear amplification with multiple nonlinear devices

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

Algorithms for information extraction and signal annotation on long-term biosignals using clustering techniques

Dissertação para obtenção do Grau de Mestre em Engenharia Biomédica

Desenvolvimento de um ensaio de hibridação múltipla (MHA-MULTIPLE REGION HYBRIDIZATION ASSAY) para identificação presumível de vírus da imunodeficiência humana do tipo 1 (HIV-1) dos subtipos B, G e de formas recombinantes CRF14_BG e CRF02_AG circulantes em Portugal

A maioria dos métodos utilizados na caracterização genética do HIV-1 baseia-se na análise de regiões específicas do genoma viral, fornecendo informação parcial sobre o mesmo e, por consequência, revelando-se inadequados para a identificação de vírus recombinantes. O único método que permite uma caracterização integral do genoma viral passa pela sua sequenciação completa. No entanto, este é um método dispendioso, laborioso e de difícil implementação quando se pretende a análise de elevados números de amostras. Como alternativa a este último, o conjunto de métodos genericamente designados de MHA (Multiple Region Hybridization Assay) baseiam-se na amplificação, por PCR em tempo-real, de várias regiões ao longo do genoma viral e na sua caracterização com sondas específicas (TaqMan). Tendo este modelo por base, o objectivo deste estudo foi o desenvolvimento de um ensaio de hibridação múltipla (MHABG0214) passível de ser aplicado ao estudo de um elevado número de amostras. Este método foi desenvolvido tendo como objectivo a genotipagem as estirpes circulantes dominantes na epidemia Portuguesa, nomeadamente os subtipos B, G e formas genéticas recombinantes CRF02_AG e CRF14_BG. Com base em alinhamentos de sequências de referência de genoma completo, delinearam-se primers universais e subtipo-específicos para a amplificação de diversas regiões codificantes distribuídas ao longo do genoma do HIV-1 (Gag, Protease, Transcriptase Reversa, Integrase, Rev, Gp120 e Gp41). A optimização foi efectuada, inicialmente, para um conjunto de amostras de referência e seguidamente avaliada num conjunto de 50 amostras clínicas. O MHABG0214 foi implementado numa estratégia de PCR em tempo-real, numa detecção dependente de SYBR® Green I para todas as regiões ou, como alternativa, usando sondas TaqMan (Gp41). Apresentamos ainda uma estratégia em que a análise de resultados se baseia, simplesmente, numa abordagem usando PCR/gel de agarose convencional. Estas abordagens constituem ferramentas úteis na identificação das estirpes de HIV-1 em Portugal.

Portuguese Ministers, 1851-1999: Social Background and Paths to Power

Disponível em: http://193.136.113.6/Opac/Pages/Search/Results.aspx?SearchText=UID=bb8aa8d5-c6b6-466a-81bb-fe8a67693cee&DataBase=10449_UNLFCSH

Valorization of pumpkin residue by supercritical extraction of added-value compounds

Dissertação para a obtenção do Grau de Mestre em Engenharia Química e Bioquímica

A knowledge-based framework to facilitate E-training implementation

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