Modelo generalista de páginas Web para motores de pesquisa com interface 3D

Web tornou-se uma ferramenta indispensável para a sociedade moderna. A capacidade de aceder a enormes quantidades de informação, disponível em praticamente todo o mundo, é uma grande vantagem para as nossas vidas. No entanto, a quantidade avassaladora de informação disponível torna-se um problema, que é o de encontrar a informação que precisamos no meio de muita informação irrelevante. Para nos ajudar nesta tarefa, foram criados poderosos motores de pesquisa online, que esquadrinham a Web à procura dos melhores resultados, segundo os seus critérios, para os dados que precisamos. Actualmente, os motores de pesquisa em voga, usam um formato de apresentação de resultados simples, que consiste apenas numa caixa de texto para o utilizador inserir as palavras-chave sobre o tema que quer pesquisar e os resultados são dispostos sobre uma lista de hiperligações ordenada pela relevância que o motor atribui a cada resultado. Porém, existem outras formas de apresentar resultados. Uma das alternativas é apresentar os resultados sobre interfaces em 3 dimensões. É nestes tipos de sistemas que este trabalho vai incidir, os motores de pesquisa com interfaces em 3 dimensões. O problema é que as páginas Web não estão preparadas para serem consumidas por este tipo de motores de pesquisa. Para resolver este problema foi construído um modelo generalista para páginas Web, que consegue alimentar os requisitos das diversas variantes destes motores de pesquisa. Foi também desenvolvido um protótipo de instanciação automático, que recolhe as informações necessárias das páginas Web e preenche o modelo.

Glucose-6-Phosphate dehydrogenase deficiency in children from 0 to 14 years hospitalized at the Pediatric Hospital David Bernardino, Luanda, Angola

The Glucose-6-phosphate dehydrogenase (G6PD) deficiency is the most common enzymatic defect in the world. The most common clinical manifestations are acute hemolytic anemia associated with drugs, infections, neonatal jaundice and hemolytic non-spherocytic chronic anemia. The main aim of this study was to determine the frequency of major genetic variants of G6PD leading to enzyme deficiency in children from 0 to 14 years at a Pediatric Hospital in Luanda, Angola. A cross-sectional and descriptive analytical study covered a total of 194 children aged from 0 to 14 years, of both genders and hospitalized at the Pediatric Hospital David Bernardino, Luanda between November and December, 2011. The G202A, A376G and C563T mutations of the G6PD gene were determined by real-time PCR with Taqman probes. The disabled A-/A- genotype was detected in 10 girls (10.9%). Among the boys, 21 (20.6%) presented the genotype A-. Considering all the samples, the A- variant was observed in 22.4% of cases. The Mediterranean mutation was not detected in the Angolan sample. Furthermore, no association was found between genotype and anemia, nutritional state and mucosa color. A significant association, however, was observed with jaundice. Based on the results obtained, there is a clear need to identify those with the disabled genotype in the Angolan population in order to avoid cases of drug-induced anemia, particularly in the treatment of malaria, so prevalent in Angola.

Quantificação do valor ambiental em edifícios: estudo de um caso prático

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Civil

New insights on integer-programming models for the kidney exchange problem

In recent years several countries have set up policies that allow exchange of kidneys between two or more incompatible patient–donor pairs. These policies lead to what is commonly known as kidney exchange programs. The underlying optimization problems can be formulated as integer programming models. Previously proposed models for kidney exchange programs have exponential numbers of constraints or variables, which makes them fairly difficult to solve when the problem size is large. In this work we propose two compact formulations for the problem, explain how these formulations can be adapted to address some problem variants, and provide results on the dominance of some models over others. Finally we present a systematic comparison between our models and two previously proposed ones via thorough computational analysis. Results show that compact formulations have advantages over non-compact ones when the problem size is large.

Application-specific modified particle swarm optimization for energy resource scheduling considering vehicle-to-grid

This paper presents a modified Particle Swarm Optimization (PSO) methodology to solve the problem of energy resources management with high penetration of distributed generation and Electric Vehicles (EVs) with gridable capability (V2G). The objective of the day-ahead scheduling problem in this work is to minimize operation costs, namely energy costs, regarding he management of these resources in the smart grid context. The modifications applied to the PSO aimed to improve its adequacy to solve the mentioned problem. The proposed Application Specific Modified Particle Swarm Optimization (ASMPSO) includes an intelligent mechanism to adjust velocity limits during the search process, as well as self-parameterization of PSO parameters making it more user-independent. It presents better robustness and convergence characteristics compared with the tested PSO variants as well as better constraint handling. This enables its use for addressing real world large-scale problems in much shorter times than the deterministic methods, providing system operators with adequate decision support and achieving efficient resource scheduling, even when a significant number of alternative scenarios should be considered. The paper includes two realistic case studies with different penetration of gridable vehicles (1000 and 2000). The proposed methodology is about 2600 times faster than Mixed-Integer Non-Linear Programming (MINLP) reference technique, reducing the time required from 25 h to 36 s for the scenario with 2000 vehicles, with about one percent of difference in the objective function cost value.

Nonmonotone hybrid tabu search for inequalities and equalities: an experimental study

The main goal of this paper is to analyze the behavior of nonmono- tone hybrid tabu search approaches when solving systems of nonlinear inequalities and equalities through the global optimization of an appro- priate merit function. The algorithm combines global and local searches and uses a nonmonotone reduction of the merit function to choose the local search. Relaxing the condition aims to call the local search more often and reduces the overall computational e ort. Two variants of a perturbed pattern search method are implemented as local search. An experimental study involving a variety of problems available in the lit- erature is presented.

Regulation of histone H2A.Z expression is mediated by sirtuin 1 in prostate cancer

Histone variants seem to play a major role in gene expression regulation. In prostate cancer, H2A.Z and its acetylated form are implicated in oncogenes’ upregulation. SIRT1, which may act either as tumor suppressor or oncogene, reduces H2A.Z levels in cardiomyocytes, via proteasome-mediated degradation, and this mechanism might be impaired in prostate cancer cells due to sirtuin 1 downregulation. Thus, we aimed to characterize the mechanisms underlying H2A.Z and SIRT1 deregulation in prostate carcinogenesis and how they interact. We found that H2AFZ and SIRT1 were up- and downregulated, respectively, at transcript level in primary prostate cancer and high-grade prostatic intraepithelial neoplasia compared to normal prostatic tissues. Induced SIRT1 overexpression in prostate cancer cell lines resulted in almost complete absence of H2A.Z. Inhibition of mTOR had a modest effect on H2A.Z levels, but proteasome inhibition prevented the marked reduction of H2A.Z due to sirtuin 1 overexpression. Prostate cancer cells exposed to epigenetic modifying drugs trichostatin A, alone or combined with 5-aza-2’-deoxycytidine, increased H2AFZ transcript, although with a concomitant decrease in protein levels. Conversely, SIRT1 transcript and protein levels increased after exposure. ChIP revealed an increase of activation marks within the TSS region for both genes. Remarkably, inhibition of sirtuin 1 with nicotinamide, increased H2A.Z levels, whereas activation of sirtuin 1 by resveratrol led to an abrupt decrease in H2A.Z. Finally, protein-ligation assay showed that exposure to epigenetic modifying drugs fostered the interaction between sirtuin 1 and H2A.Z. We concluded that sirtuin 1 and H2A.Z deregulation in prostate cancer are reciprocally related. Epigenetic mechanisms, mostly histone post-translational modifications, are likely involved and impair sirtuin 1-mediated downregulation of H2A.Z via proteasome-mediated degradation. Epigenetic modifying drugs in conjunction with enzymatic modulators are able to restore the normal functions of sirtuin 1 and might constitute relevant tools for targeted therapy of prostate cancer patients

Diagnóstico de avarias em máquinas rotativas utilizando a análise de órbitas

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Mecânica Perfil Manutenção e Produção

Extending fixed task-priority schedulability by interference limitation

While the earliest deadline first algorithm is known to be optimal as a uniprocessor scheduling policy, the implementation comes at a cost in terms of complexity. Fixed taskpriority algorithms on the other hand have lower complexity but higher likelihood of task sets being declared unschedulable, when compared to earliest deadline first (EDF). Various attempts have been undertaken to increase the chances of proving a task set schedulable with similar low complexity. In some cases, this was achieved by modifying applications to limit preemptions, at the cost of flexibility. In this work, we explore several variants of a concept to limit interference by locking down the ready queue at certain instances. The aim is to increase the prospects of schedulability of a given task system, without compromising on complexity or flexibility, when compared to the regular fixed task-priority algorithm. As a final contribution, a new preemption threshold assignment algorithm is provided which is less complex and more straightforward than the previous method available in the literature.

Zinc-substituted desulfovibrio gigas desulforedoxins

Protein Science (2002), 11:2464–2470

Multi-criteria optimization manipulator trajectory planning

In the last twenty years genetic algorithms (GAs) were applied in a plethora of fields such as: control, system identification, robotics, planning and scheduling, image processing, and pattern and speech recognition (Bäck et al., 1997). In robotics the problems of trajectory planning, collision avoidance and manipulator structure design considering a single criteria has been solved using several techniques (Alander, 2003). Most engineering applications require the optimization of several criteria simultaneously. Often the problems are complex, include discrete and continuous variables and there is no prior knowledge about the search space. These kind of problems are very more complex, since they consider multiple design criteria simultaneously within the optimization procedure. This is known as a multi-criteria (or multiobjective) optimization, that has been addressed successfully through GAs (Deb, 2001). The overall aim of multi-criteria evolutionary algorithms is to achieve a set of non-dominated optimal solutions known as Pareto front. At the end of the optimization procedure, instead of a single optimal (or near optimal) solution, the decision maker can select a solution from the Pareto front. Some of the key issues in multi-criteria GAs are: i) the number of objectives, ii) to obtain a Pareto front as wide as possible and iii) to achieve a Pareto front uniformly spread. Indeed, multi-objective techniques using GAs have been increasing in relevance as a research area. In 1989, Goldberg suggested the use of a GA to solve multi-objective problems and since then other researchers have been developing new methods, such as the multi-objective genetic algorithm (MOGA) (Fonseca & Fleming, 1995), the non-dominated sorted genetic algorithm (NSGA) (Deb, 2001), and the niched Pareto genetic algorithm (NPGA) (Horn et al., 1994), among several other variants (Coello, 1998). In this work the trajectory planning problem considers: i) robots with 2 and 3 degrees of freedom (dof ), ii) the inclusion of obstacles in the workspace and iii) up to five criteria that are used to qualify the evolving trajectory, namely the: joint traveling distance, joint velocity, end effector / Cartesian distance, end effector / Cartesian velocity and energy involved. These criteria are used to minimize the joint and end effector traveled distance, trajectory ripple and energy required by the manipulator to reach at destination point. Bearing this ideas in mind, the paper addresses the planning of robot trajectories, meaning the development of an algorithm to find a continuous motion that takes the manipulator from a given starting configuration up to a desired end position without colliding with any obstacle in the workspace. The chapter is organized as follows. Section 2 describes the trajectory planning and several approaches proposed in the literature. Section 3 formulates the problem, namely the representation adopted to solve the trajectory planning and the objectives considered in the optimization. Section 4 studies the algorithm convergence. Section 5 studies a 2R manipulator (i.e., a robot with two rotational joints/links) when the optimization trajectory considers two and five objectives. Sections 6 and 7 show the results for the 3R redundant manipulator with five goals and for other complementary experiments are described, respectively. Finally, section 8 draws the main conclusions.

Modified particle swarm optimization for day-ahead distributed energy resources scheduling including vehicle-to-grid

Mestrado em Engenharia Electrotécnica – Sistemas Eléctricos de Energia

CARTO-SOM - Cartogram creation using self-organizing maps

Dissertação apresentada como requisito parcial para obtenção do grau de Mestre em Ciência e Sistemas de Informação Geográfica

Comparative studies of Yersinia pestis outer membrane isolation techniques and their potential use in plague epidemiology

In the present study three techniques for obtaining outer membrane enriched fractions from Yersinia pestis were evaluated. The techniques analysed were: differential solubilization of the cytoplasmic membrane with Sarkosyl or Triton X-100, and centrifugation in sucrose density gradients. The sodium dodecyl-sulfate polyacrylamide gel electrophoresis (SDS-PAGE) of outer membrane isolated by the different methods resulted in similar protein patterns. The measurement of NADH-dehydrogenase and succinate dehydrogenase (inner membrane enzymes) indicated that the outer membrane preparations obtained by the three methods were pure enough for analytical studies. In addition, preliminary evidences on the potential use of outer membrane proteins for the identification of geographic variants of Y. pestis wild isolates are presented.