898 resultados para Simultaneous optimization
Resumo:
OBJECTIVE: To evaluate the prevalence of the urinary excretion of BKV and JCV in HIV-infected patients without neurological symptoms. METHODS: Urine samples from HIV-infected patients without neurological symptoms were tested for JC virus and BK virus by PCR. Samples were screened for the presence of polyomavirus with sets of primers complementary to the early region of JCV and BKV genome (AgT). The presence of JC virus or BK virus were confirmed by two other PCR assays using sets of primers complementary to the VP1 gene of each virus. Analysis of the data was performed by the Kruskal-Wallis test for numerical data and Pearson or Yates for categorical variables. RESULTS: A total of 75 patients were included in the study. The overall prevalence of polyomavirus DNA urinary shedding was 67/75 (89.3%). Only BKV DNA was detected in 14/75 (18.7%) urine samples, and only JCV DNA was detected in 11/75 (14.7%) samples. Both BKV and JCV DNA were present in 42/75 (56.0%) samples. CONCLUSION: In this study we found high rates of excretion of JCV, BKV, and simultaneous excretion in HIV+ patients. Also these results differ from the others available on the literature.
Resumo:
Dissertação para obtenção do Grau de Doutor em Engenharia Química, especialidade de Engenharia Bioquímica
Resumo:
Dissertação para obtenção do Grau de Mestre em Engenharia Química e Bioquímica
Resumo:
A Work Project, presented as part of the requirements for the Award of a Masters Degree in Finance from the NOVA – School of Business and Economics
Resumo:
Tese apresentada para obtenção do Grau de Doutor em Engenharia Civil na especialidade de Reabilitação do Património Edificado, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia
Resumo:
A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics
Resumo:
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
Resumo:
Dissertação para obtenção do Grau de Mestre em Biotecnologia
Resumo:
Dissertação para obtenção do Grau de Doutor em Engenharia Electrotécnica e de Computadores
Resumo:
Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores
Resumo:
A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics
Resumo:
A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics
Resumo:
Optimization of the RAPD reaction for characterizing Salmonella enterica serovar Typhi strains was studied in order to ensure the reproducibility and the discriminatory power of this technique. Eight Salmonella serovar Typhi strains isolated from various regions in Brazil were examined for the fragment patterns produced using different concentrations of DNA template, primer, MgCl2 and Taq DNA polymerase. Using two different low stringency thermal cycle profiles, the RAPD fingerprints obtained were compared. A set of sixteen primers was evaluated for their ability to produce a high number of distinct fragments. We found that variations associated to all of the tested parameters modified the fingerprinting patterns. For the strains of Salmonella enterica serovar Typhi used in this experiment, we have defined a set of conditions for RAPD-PCR reaction, which result in a simple, fast and reproducible typing method.
Resumo:
Dissertação para obtenção do Grau de Mestre em Engenharia Informática
Resumo:
Optimization is a very important field for getting the best possible value for the optimization function. Continuous optimization is optimization over real intervals. There are many global and local search techniques. Global search techniques try to get the global optima of the optimization problem. However, local search techniques are used more since they try to find a local minimal solution within an area of the search space. In Continuous Constraint Satisfaction Problems (CCSP)s, constraints are viewed as relations between variables, and the computations are supported by interval analysis. The continuous constraint programming framework provides branch-and-prune algorithms for covering sets of solutions for the constraints with sets of interval boxes which are the Cartesian product of intervals. These algorithms begin with an initial crude cover of the feasible space (the Cartesian product of the initial variable domains) which is recursively refined by interleaving pruning and branching steps until a stopping criterion is satisfied. In this work, we try to find a convenient way to use the advantages in CCSP branchand- prune with local search of global optimization applied locally over each pruned branch of the CCSP. We apply local search techniques of continuous optimization over the pruned boxes outputted by the CCSP techniques. We mainly use steepest descent technique with different characteristics such as penalty calculation and step length. We implement two main different local search algorithms. We use “Procure”, which is a constraint reasoning and global optimization framework, to implement our techniques, then we produce and introduce our results over a set of benchmarks.