Molecular analysis of the dengue virus type 1 and 2 in Brazil based on sequences of the genomic envelope-nonstructural protein 1 junction region

The genomic sequences of the Envelope-Non-Structural protein 1 junction region (E/NS1) of 84 DEN-1 and 22 DEN-2 isolates from Brazil were determined. Most of these strains were isolated in the period from 1995 to 2001 in endemic and regions of recent dengue transmission in São Paulo State. Sequence data for DEN-1 and DEN-2 utilized in phylogenetic and split decomposition analyses also include sequences deposited in GenBank from different regions of Brazil and of the world. Phylogenetic analyses were done using both maximum likelihood and Bayesian approaches. Results for both DEN-1 and DEN-2 data are ambiguous, and support for most tree bipartitions are generally poor, suggesting that E/NS1 region does not contain enough information for recovering phylogenetic relationships among DEN-1 and DEN-2 sequences used in this study. The network graph generated in the split decomposition analysis of DEN-1 does not show evidence of grouping sequences according to country, region and clades. While the network for DEN-2 also shows ambiguities among DEN-2 sequences, it suggests that Brazilian sequences may belong to distinct subtypes of genotype III.

Geomecânica aplicada à estabilidade de explorações mineiras bench and fill: o caso do jazigo de Feitais, Minas de Aljustrel

Este trabalho pretende abordar a importância de um estudo geomecânico no apoio à otimização e estabilidade de explorações subterrâneas por subníveis, com criação de bancadas e posterior enchimento. O presente envolveu um estudo geológico-geotécnico em quinze galerias situadas a muro, teto e corpo da mineralização com o levantamento das características mais relevantes do maciço rochoso para aplicação das classificações geomecânicas, englobando uma amostragem de mais de 1780 descontinuidades, obtendo um modelo cartográfico subterrâneo com um panorama geral da qualidade do maciço rochoso intercetado pelas escavações nas diferentes zonas. Os dados dos levantamentos de campo levaram à criação de uma base de dados com a aplicação das classificações geomecânicas Q-System, RMR e GSI, por galeria e, em seguida, por zona, com proposta de classe de sustimento a aplicar em cada local, pelo ábaco de Barton, em conjunto com a determinação de parâmetros geomecânicos fundamentais ao refinamento do conhecimento geológico-geotécnico das unidades litológicas em estudo. Na parte final, focando a localização da massa mineralizada de Feitais é efetuada uma abordagem relativa à estabilidade das cavidades geradas pelo desmonte em bancada entre subníveis, com respetivo dimensionamento das larguras admissíveis, em condições de segurança, através da relação entre o número de estabilidade e raio hidráulico, pelo método do gráfico de estabilidade. Com esta metodologia de caracterização geológico geotécnica, é pretendido efetuar um ponto de partida à criação de um modelo geomecânico comportamental do jazigo de Feitais, Mina de Aljustrel, contando com um processo inicial de apoio ao planeamento mineiro aplicado ao método de desmonte em bancada e posterior enchimento por subníveis, atuando nos parâmetros de estabilidade e apoio à extração, favorecendo assim a segurança das operações de trabalho em conjunto com um apoio de otimização da extração.

Predictivity Strength of the Spatial Variability of Phenanthrene Sorption Across Two Sandy Loam Fields

Sorption is commonly agreed to be the major process underlying the transport and fate of polycyclic aromatic hydrocarbons (PAHs) in soils. However, there is still a scarcity of studies focusing on spatial variability at the field scale in particular. In order to investigate the variation in the field of phenanthrene sorption, bulk topsoil samples were taken in a 15 × 15-m grid from the plough layer in two sandy loam fields with different texture and organic carbon (OC) contents (140 samples in total). Batch experiments were performed using the adsorption method. Values for the partition coefficient K d (L kg−1) and the organic carbon partition coefficient K OC (L kg−1) agreed with the most frequently used models for PAH partitioning, as OC revealed a higher affinity for sorption. More complex models using different OC compartments, such as non-complexed organic carbon (NCOC) and complexed organic carbon (COC) separately, performed better than single K OC models, particularly for a subset including samples with Dexter n < 10 and OC <0.04 kg kg−1. The selected threshold revealed that K OC-based models proved to be applicable for more organic fields, while two-component models proved to be more accurate for the prediction of K d and retardation factor (R) for less organic soils. Moreover, OC did not fully reflect the changes in phenanthrene retardation in the field with lower OC content (Faardrup). Bulk density and available water content influenced the phenanthrene transport mechanism phenomenon.

Energy-aware Task Allocation onto Unrelated Heterogeneous Multicore Platform for Mixed Criticality Systems

Presented at Work in Progress Session, IEEE Real-Time Systems Symposium (RTSS 2015). 1 to 4, Dec, 2015. San Antonio, U.S.A..

Cutting path as a rural postman problem

The Rural Postman Problem (RPP) is a particular Arc Routing Problem (ARP) which consists of determining a minimum cost circuit on a graph so that a given subset of required edges is traversed. The RPP is an NP-hard problem with significant real-life applications. This paper introduces an original approach based on Memetic Algorithms - the MARP algorithm - to solve the RPP and, also deals with an interesting Industrial Application, which focuses on the path optimization for component cutting operations. Memetic Algorithms are a class of Metaheuristics which may be seen as a population strategy that involves cooperation and competition processes between population elements and integrates “social knowledge”, using a local search procedure. The MARP algorithm is tested with different groups of instances and the results are compared with those gathered from other publications. MARP is also used in the context of various real-life applications.

High prevalence and association of HIV-1 non-B subtype with specific sexual transmission risk among antiretroviral naïve patients in Porto Alegre, RS, Brazil

In South Brazil the circulation of two HIV-1 subtypes with different characteristics represents an important scenario for the study of the impact of HIV-1 diversity on the evolution of the HIV-1 epidemic and AIDS disease. HIV-1 B, the predominant variant in industrialized countries and HIV-1 C, the most prevalent subtype in areas with rapid epidemic growth, are implicated in most infections. We evaluated blood samples from 128 antiretroviral (ARV) naïve patients recruited at entry to the largest HIV outpatient service in Porto Alegre. Based on partial pol region sequencing, HIV-1 C was observed in 29%, HIV-1 B in 22.6% and, the recently identified CRF31_BC, in 23.4% of 128 volunteers. Other variants were HIV-1 F in 10% and other mosaics in 5.5%. In order to evaluate the association of socio-behavioral characteristics and HIV-1 subtypes, interviews and laboratory evaluation were performed at entry. Our data suggest an established epidemic of the three major variants, without any evidence of partitioning in either of the subgroups analyzed. However, anal sex practices were associated with subtype B, which could indicate a greater transmissibility of non-B variants by vaginal intercourse. This study provides baseline information for epidemiologic surveillance of the changes of the molecular characteristics of HIV-1 epidemics in this region.

Tutor Inteligente para o Ensino em Medicina

O objectivo deste trabalho consistiu no desenvolvimento de um protótipo que possibilita a adaptação do conteúdo disponibilizado de acordo com as características pessoais e psicológicas do aluno, aplicado no ensino da Medicina, nomeadamente na componente de Desenho de Estudos da disciplina de Introdução à Medicina. Para o protótipo desenvolvido foi definida uma arquitectura constituída por três componentes: um Modelo de Aluno que engloba as características pessoais e psicológicas do aluno, um Modelo de Domínio constituído por um grafo de conceitos e um Modelo Pedagógico formado pelas regras de adaptação e mecanismos de interação utilizados para obter uma solução adaptativa. Os diferentes componentes desenvolvidos para este protótipo permitem que este apresente as seguintes funcionalidades: Acesso ao conceito adequado, tendo em consideração o nível de conhecimento do aluno; Visualização de conte udos adequados ao estilo de aprendizagem do aluno; Adaptação do percurso do aluno de acordo com os resultados obtidos; Atualização das preferências de aprendizagem, com base no comportamento demonstrado pelo aluno na interação com o sistema. A primeira versão da ferramenta j a foi implementada. No entanto ainda será realizada a avaliação do protótipo em ambiente de aprendizagem, com a maior brevidade possível.

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

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.

Clustering barotrauma patients in ICU–A data mining based approach using ventilator variables

Lecture Notes in Computer Science, 9273