Flucytosine + fluconazole association in the treatment of a murine experimental model of cryptococcosis

The efficacy of flucytosine (5-FC) and fluconazole (FLU) association in the treatment of a murine experimental model of cryptococcosis, was evaluated. Seven groups of 10 Balb C mice each, were intraperitoneally inoculated with 10(7) cells of Cryptococcus neoformans. Six groups were allocated to receive 5-FC (300 mg/kg) and FLU (16 mg/ kg), either combined and individually, by daily gavage beginning 5 days after the infection, for 2 and 4 weeks. One group received distilled water and was used as control. The evaluation of treatments was based on: survival time; macroscopic examination of brain, lungs, liver and spleen at autopsy; presence of capsulated yeasts in microscopic examination of wet preparations of these organs and cultures of brain homogenate. 5-FC and FLU, individually or combined, significantly prolonged the survival time of the treated animals with respect to the control group (p<0.01). Animals treated for 4 weeks survived significantly longer than those treated for 2 weeks (p<0.01). No significant differences between the animals treated with 5-FC and FLU combined or separately were observed in the survival time and morphological parameters. The association of 5-FC and FLU does not seem to be more effective than 5-FC or FLU alone, in the treatment of this experimental model of cryptococcosis.

Iberian peninsula ecosystem carbon fluxes: a model-data integration study

Dissertação apresentada para obtenção do Grau de Doutor em Engenharia do Ambiente pela Universidade Nova de Lisboa,Faculdade de Ciências e Tecnologia

An integer programming model for the minimum interval graph completion problem

The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a supergraph H = ( V, E ∪ F ) that is an interval graph, while adding the least number of edges |F| . We present an integer programming formulation for solving the minimum interval graph completion problem recurring to a characteri- zation of interval graphs that produces a linear ordering of the maximal cliques of the solution graph.

A mathematical model for supermarket order picking

Order picking consists in retrieving products from storage locations to satisfy independent orders from multiple customers. It is generally recognized as one of the most significant activities in a warehouse (Koster et al, 2007). In fact, order picking accounts up to 50% (Frazelle, 2001) or even 80% (Van den Berg, 1999) of the total warehouse operating costs. The critical issue in today’s business environment is to simultaneously reduce the cost and increase the speed of order picking. In this paper, we address the order picking process in one of the Portuguese largest companies in the grocery business. This problem was proposed at the 92nd European Study Group with Industry (ESGI92). In this setting, each operator steers a trolley on the shop floor in order to select items for multiple customers. The objective is to improve their grocery e-commerce and bring it up to the level of the best international practices. In particular, the company wants to improve the routing tasks in order to decrease distances. For this purpose, a mathematical model for a faster open shop picking was developed. In this paper, we describe the problem, our proposed solution as well as some preliminary results and conclusions.