Correlation of the in vitro antifungal drug susceptibility with the in vivo activity of fluconazole in a murine model of cerebral infection caused by Cryptococcus gattii

Forty Cryptococcus gattii strains were submitted to antifungal susceptibility testing with fluconazole, itraconazole, amphotericin B and terbinafine. The minimum inhibitory concentration (MIC) ranges were 0.5-64.0 for fluconazole, < 0.015-0.25 for itraconazole, 0.015-0.5 for amphotericin B and 0.062-2.0 for terbinafine. A bioassay for the quantitation of fluconazole in murine brain tissue was developed. Swiss mice received daily injections of the antifungal, and their brains were withdrawn at different times over the 14-day study period. The drug concentrations varied from 12.98 to 44.60 mu g/mL. This assay was used to evaluate the therapy with fluconazole in a model of infection caused by C. gattii. Swiss mice were infected intracranially and treated with fluconazole for 7, 10 or 14 days. The treatment reduced the fungal burden, but an increase in fungal growth was observed on day 14. The MIC for fluconazole against sequential isolates was 16 mu g/mL, except for the isolates obtained from animals treated for 14 days (MIC = 64 mu g/mL). The quantitation of cytokines revealed a predominance of IFN-gamma and IL-12 in the non-treated group and elevation of IL-4 and IL-10 in the treated group. Our data revealed the possibility of acquired resistance during the antifungal drug therapy.

Selecting salient objects in real scenes: An oscillatory correlation model

Attention is a critical mechanism for visual scene analysis. By means of attention, it is possible to break down the analysis of a complex scene to the analysis of its parts through a selection process. Empirical studies demonstrate that attentional selection is conducted on visual objects as a whole. We present a neurocomputational model of object-based selection in the framework of oscillatory correlation. By segmenting an input scene and integrating the segments with their conspicuity obtained from a saliency map, the model selects salient objects rather than salient locations. The proposed system is composed of three modules: a saliency map providing saliency values of image locations, image segmentation for breaking the input scene into a set of objects, and object selection which allows one of the objects of the scene to be selected at a time. This object selection system has been applied to real gray-level and color images and the simulation results show the effectiveness of the system. (C) 2010 Elsevier Ltd. All rights reserved.

Investigation of a new GRASP-based clustering algorithm applied to biological data

A large amount of biological data has been produced in the last years. Important knowledge can be extracted from these data by the use of data analysis techniques. Clustering plays an important role in data analysis, by organizing similar objects from a dataset into meaningful groups. Several clustering algorithms have been proposed in the literature. However, each algorithm has its bias, being more adequate for particular datasets. This paper presents a mathematical formulation to support the creation of consistent clusters for biological data. Moreover. it shows a clustering algorithm to solve this formulation that uses GRASP (Greedy Randomized Adaptive Search Procedure). We compared the proposed algorithm with three known other algorithms. The proposed algorithm presented the best clustering results confirmed statistically. (C) 2009 Elsevier Ltd. All rights reserved.

Infeasibility handling in genetic algorithm using nested domains for production planning

In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained problems is often a very difficult task. Various strategies have been applied to deal with infeasible solutions throughout the search. We propose a new scheme of classifying individuals based on nested domains to determine the solutions according to the level of infeasibility, which in our case represents bands of additional production hours (overtime). Within each band, individuals are just differentiated by their fitness function. As iterations are conducted, the widths of the bands are dynamically adjusted to improve the convergence of the individuals into the feasible domain. The numerical experiments on highly capacitated instances show the effectiveness of this computational tractable approach to guide the search toward the feasible domain. Our approach outperforms other state-of-the-art approaches and commercial solvers. (C) 2009 Elsevier Ltd. All rights reserved.