Schistosoma mansoni: resistência cutânea em camundongos portadores de infecção primária

No presente trabalho avaliou-se a resistência cutânea de camundongos ao Schistosoma mansoni, usándose a orelha como sítio de infecção e de recuperação de esquistossômulos através da incubação de seus fragmentos em recipiente posto em contacto com Elac tamponado com Hepes. Essa técnica mostrou-se eficiente na discriminação do número de esquistossômulos recuperados de camundongos normais e de camundongos previamente infectados (camundongos imunes), quando comparada à técnica de recuperação de parasitas através da digestão da pele em meio contendo colagenase. Através dessa técnica, verificou-se que camundongos imunes reduzem o parasitismo do primeiro ao sétimo dia após a reinfecção (42 a 46%). Essa resistência foi observada em portadores de infecção bissexuada (6.* a 15.ª semanas) e unissexuada (33.* e 34.ª semanas) e em linhagens isogênicas (C57 BL/10, CBA e Fj do cruzamento CBA x DBA/2) e não isogênica (Swiss). Revelándose apropriadas ao estudo da resistência anti-esquistossomótica que se manifesta ao nível da pele, sugere-se que orelhas possam ser utilizadas como via de infecção em experimentos que visem analisar os fatores que participam da imunidade de camundongos ao S. mansoni.

A stratigraphic framework for the Miocene from the lower Tagus Basin (Lisbon, Setúbal Península, Portugal) Depositional sequences, biostratigraphy and isotopic ages

Rev. Soc. Geol. España, 12(1), ano 1999

Cytomegalovirus and other herpesviruses infections in heart and bone marrow transplant recipients

From January 1988 to January 1989 all the heart transplant and bone marrow recipients at the Instituto do Coração of the Hospital das Clínicas of the University of São Paulo Medical School were studied for the incidence and morbidity associated with herpesviruses infections after transplantation. Five bone marrow and 5 heart transplant recipients were followed for a mean of 4.2 months post-transplantation. All the patients were seropositive for cytomegalovirus (CMV) before admission and 80% experienced one or more recurrences during the observation period. Of the 12 episodes of CMV infection, that were identified in this study, 83% were accompanied by clinical or laboratory abnormalities. However, there was only one case of severe disease. The overall incidence of infection for herpes simplex (HSV) was 50%. Although most of HSV reactivations were oral or genital, one case of HSV hepatitis occurred. One of the 6 episodes of HSV infections that were treated with acyclovir showed an unsatisfactory response and was successfully managed with ganciclovir. All the individuals had anti-varicella zoster virus antibodies, but none of them developed infection. The study emphasizes the importance of active diagnostic surveillance of herpesvirus infections in transplant patients. Both CMV and HSV reactivations showed high incidence and important morbidity and thus, deserve prophylactic therapy.

Catalytic activity of a benzoyl hydrazone based dimeric dicopper(II) complex in catechol and alcohol oxidation reactions

The benzoyl hydrazone based dimeric dicopper(II) complex [Cu2(R)(CH3O)(NO3)]2(CH3O)2 (R-Cu2+), recently reported by us, catalyzes the aerobic oxidation of catechols (catechol (S1), 3,5- itertiarybutylcatechol (S2) and 3-nitrocatechol (S3)) to the corresponding quinones (catecholase like activity), as shown by UV–Vis absorption spectroscopy in methanol/HEPES buffer (pH 8.2) medium at 25 C. The highest activity is observed for the substituted catechol (S2) with the electron donor tertiary butyl group, resulting in a turnover frequency (TOF) value of 1.13 103 h1. The complex R-Cu2+ also exhibits a good catalytic activity in the oxidation (without added solvent) of 1-phenylethanol to acetophenone by But OOH under low power (10 W) microwave (MW) irradiation. 2014 Elsevier B.V. All rights reserved.

Parallel GPU architecture for hyperspectral unmixing based on augmented Lagrangian method

Hyperspectral imaging has become one of the main topics in remote sensing applications, which comprise hundreds of spectral bands at different (almost contiguous) wavelength channels over the same area generating large data volumes comprising several GBs per flight. This high spectral resolution can be used for object detection and for discriminate between different objects based on their spectral characteristics. One of the main problems involved in hyperspectral analysis is the presence of mixed pixels, which arise when the spacial resolution of the sensor is not able to separate spectrally distinct materials. Spectral unmixing is one of the most important task for hyperspectral data exploitation. However, the unmixing algorithms can be computationally very expensive, and even high power consuming, which compromises the use in applications under on-board constraints. In recent years, graphics processing units (GPUs) have evolved into highly parallel and programmable systems. Specifically, several hyperspectral imaging algorithms have shown to be able to benefit from this hardware taking advantage of the extremely high floating-point processing performance, compact size, huge memory bandwidth, and relatively low cost of these units, which make them appealing for onboard data processing. In this paper, we propose a parallel implementation of an augmented Lagragian based method for unsupervised hyperspectral linear unmixing on GPUs using CUDA. The method called simplex identification via split augmented Lagrangian (SISAL) aims to identify the endmembers of a scene, i.e., is able to unmix hyperspectral data sets in which the pure pixel assumption is violated. The efficient implementation of SISAL method presented in this work exploits the GPU architecture at low level, using shared memory and coalesced accesses to memory.

Fast unsupervised technique for extraction of endmembers spectra from hyperspectral data

One of the most challenging task underlying many hyperspectral imagery applications is the linear unmixing. The key to linear unmixing is to find the set of reference substances, also called endmembers, that are representative of a given scene. This paper presents the vertex component analysis (VCA) a new method to unmix linear mixtures of hyperspectral sources. The algorithm is unsupervised and exploits a simple geometric fact: endmembers are vertices of a simplex. The algorithm complexity, measured in floating points operations, is O (n), where n is the sample size. The effectiveness of the proposed scheme is illustrated using simulated data.

Parallel hyperspectral unmixing method via split augmented lagrangian on GPU

One of the main problems of hyperspectral data analysis is the presence of mixed pixels due to the low spatial resolution of such images. Linear spectral unmixing aims at inferring pure spectral signatures and their fractions at each pixel of the scene. The huge data volumes acquired by hyperspectral sensors put stringent requirements on processing and unmixing methods. This letter proposes an efficient implementation of the method called simplex identification via split augmented Lagrangian (SISAL) which exploits the graphics processing unit (GPU) architecture at low level using Compute Unified Device Architecture. SISAL aims to identify the endmembers of a scene, i.e., is able to unmix hyperspectral data sets in which the pure pixel assumption is violated. The proposed implementation is performed in a pixel-by-pixel fashion using coalesced accesses to memory and exploiting shared memory to store temporary data. Furthermore, the kernels have been optimized to minimize the threads divergence, therefore achieving high GPU occupancy. The experimental results obtained for the simulated and real hyperspectral data sets reveal speedups up to 49 times, which demonstrates that the GPU implementation can significantly accelerate the method's execution over big data sets while maintaining the methods accuracy.

Unmixing hyperspectral data: independent and dependent component analysis

The development of high spatial resolution airborne and spaceborne sensors has improved the capability of ground-based data collection in the fields of agriculture, geography, geology, mineral identification, detection [2, 3], and classification [4–8]. The signal read by the sensor from a given spatial element of resolution and at a given spectral band is a mixing of components originated by the constituent substances, termed endmembers, located at that element of resolution. This chapter addresses hyperspectral unmixing, which is the decomposition of the pixel spectra into a collection of constituent spectra, or spectral signatures, and their corresponding fractional abundances indicating the proportion of each endmember present in the pixel [9, 10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. The linear mixing model holds when the mixing scale is macroscopic [13]. The nonlinear model holds when the mixing scale is microscopic (i.e., intimate mixtures) [14, 15]. The linear model assumes negligible interaction among distinct endmembers [16, 17]. The nonlinear model assumes that incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [18]. Under the linear mixing model and assuming that the number of endmembers and their spectral signatures are known, hyperspectral unmixing is a linear problem, which can be addressed, for example, under the maximum likelihood setup [19], the constrained least-squares approach [20], the spectral signature matching [21], the spectral angle mapper [22], and the subspace projection methods [20, 23, 24]. Orthogonal subspace projection [23] reduces the data dimensionality, suppresses undesired spectral signatures, and detects the presence of a spectral signature of interest. The basic concept is to project each pixel onto a subspace that is orthogonal to the undesired signatures. As shown in Settle [19], the orthogonal subspace projection technique is equivalent to the maximum likelihood estimator. This projection technique was extended by three unconstrained least-squares approaches [24] (signature space orthogonal projection, oblique subspace projection, target signature space orthogonal projection). Other works using maximum a posteriori probability (MAP) framework [25] and projection pursuit [26, 27] have also been applied to hyperspectral data. In most cases the number of endmembers and their signatures are not known. Independent component analysis (ICA) is an unsupervised source separation process that has been applied with success to blind source separation, to feature extraction, and to unsupervised recognition [28, 29]. ICA consists in finding a linear decomposition of observed data yielding statistically independent components. Given that hyperspectral data are, in given circumstances, linear mixtures, ICA comes to mind as a possible tool to unmix this class of data. In fact, the application of ICA to hyperspectral data has been proposed in reference 30, where endmember signatures are treated as sources and the mixing matrix is composed by the abundance fractions, and in references 9, 25, and 31–38, where sources are the abundance fractions of each endmember. In the first approach, we face two problems: (1) The number of samples are limited to the number of channels and (2) the process of pixel selection, playing the role of mixed sources, is not straightforward. In the second approach, ICA is based on the assumption of mutually independent sources, which is not the case of hyperspectral data, since the sum of the abundance fractions is constant, implying dependence among abundances. This dependence compromises ICA applicability to hyperspectral images. In addition, hyperspectral data are immersed in noise, which degrades the ICA performance. IFA [39] was introduced as a method for recovering independent hidden sources from their observed noisy mixtures. IFA implements two steps. First, source densities and noise covariance are estimated from the observed data by maximum likelihood. Second, sources are reconstructed by an optimal nonlinear estimator. Although IFA is a well-suited technique to unmix independent sources under noisy observations, the dependence among abundance fractions in hyperspectral imagery compromises, as in the ICA case, the IFA performance. Considering the linear mixing model, hyperspectral observations are in a simplex whose vertices correspond to the endmembers. Several approaches [40–43] have exploited this geometric feature of hyperspectral mixtures [42]. Minimum volume transform (MVT) algorithm [43] determines the simplex of minimum volume containing the data. The MVT-type approaches are complex from the computational point of view. Usually, these algorithms first find the convex hull defined by the observed data and then fit a minimum volume simplex to it. Aiming at a lower computational complexity, some algorithms such as the vertex component analysis (VCA) [44], the pixel purity index (PPI) [42], and the N-FINDR [45] still find the minimum volume simplex containing the data cloud, but they assume the presence in the data of at least one pure pixel of each endmember. This is a strong requisite that may not hold in some data sets. In any case, these algorithms find the set of most pure pixels in the data. Hyperspectral sensors collects spatial images over many narrow contiguous bands, yielding large amounts of data. For this reason, very often, the processing of hyperspectral data, included unmixing, is preceded by a dimensionality reduction step to reduce computational complexity and to improve the signal-to-noise ratio (SNR). Principal component analysis (PCA) [46], maximum noise fraction (MNF) [47], and singular value decomposition (SVD) [48] are three well-known projection techniques widely used in remote sensing in general and in unmixing in particular. The newly introduced method [49] exploits the structure of hyperspectral mixtures, namely the fact that spectral vectors are nonnegative. The computational complexity associated with these techniques is an obstacle to real-time implementations. To overcome this problem, band selection [50] and non-statistical [51] algorithms have been introduced. This chapter addresses hyperspectral data source dependence and its impact on ICA and IFA performances. The study consider simulated and real data and is based on mutual information minimization. Hyperspectral observations are described by a generative model. This model takes into account the degradation mechanisms normally found in hyperspectral applications—namely, signature variability [52–54], abundance constraints, topography modulation, and system noise. The computation of mutual information is based on fitting mixtures of Gaussians (MOG) to data. The MOG parameters (number of components, means, covariances, and weights) are inferred using the minimum description length (MDL) based algorithm [55]. We study the behavior of the mutual information as a function of the unmixing matrix. The conclusion is that the unmixing matrix minimizing the mutual information might be very far from the true one. Nevertheless, some abundance fractions might be well separated, mainly in the presence of strong signature variability, a large number of endmembers, and high SNR. We end this chapter by sketching a new methodology to blindly unmix hyperspectral data, where abundance fractions are modeled as a mixture of Dirichlet sources. This model enforces positivity and constant sum sources (full additivity) constraints. The mixing matrix is inferred by an expectation-maximization (EM)-type algorithm. This approach is in the vein of references 39 and 56, replacing independent sources represented by MOG with mixture of Dirichlet sources. Compared with the geometric-based approaches, the advantage of this model is that there is no need to have pure pixels in the observations. The chapter is organized as follows. Section 6.2 presents a spectral radiance model and formulates the spectral unmixing as a linear problem accounting for abundance constraints, signature variability, topography modulation, and system noise. Section 6.3 presents a brief resume of ICA and IFA algorithms. Section 6.4 illustrates the performance of IFA and of some well-known ICA algorithms with experimental data. Section 6.5 studies the ICA and IFA limitations in unmixing hyperspectral data. Section 6.6 presents results of ICA based on real data. Section 6.7 describes the new blind unmixing scheme and some illustrative examples. Section 6.8 concludes with some remarks.

Hyperspectral imagery framework for unmixing and dimensionality estimation

In hyperspectral imagery a pixel typically consists mixture of spectral signatures of reference substances, also called endmembers. Linear spectral mixture analysis, or linear unmixing, aims at estimating the number of endmembers, their spectral signatures, and their abundance fractions. This paper proposes a framework for hyperpsectral unmixing. A blind method (SISAL) is used for the estimation of the unknown endmember signature and their abundance fractions. This method solve a non-convex problem by a sequence of augmented Lagrangian optimizations, where the positivity constraints, forcing the spectral vectors to belong to the convex hull of the endmember signatures, are replaced by soft constraints. The proposed framework simultaneously estimates the number of endmembers present in the hyperspectral image by an algorithm based on the minimum description length (MDL) principle. Experimental results on both synthetic and real hyperspectral data demonstrate the effectiveness of the proposed algorithm.

Vertex component analysis: a geometric-based approach to unmix hyperspectral data

Hyperspectral remote sensing exploits the electromagnetic scattering patterns of the different materials at specific wavelengths [2, 3]. Hyperspectral sensors have been developed to sample the scattered portion of the electromagnetic spectrum extending from the visible region through the near-infrared and mid-infrared, in hundreds of narrow contiguous bands [4, 5]. The number and variety of potential civilian and military applications of hyperspectral remote sensing is enormous [6, 7]. Very often, the resolution cell corresponding to a single pixel in an image contains several substances (endmembers) [4]. In this situation, the scattered energy is a mixing of the endmember spectra. A challenging task underlying many hyperspectral imagery applications is then decomposing a mixed pixel into a collection of reflectance spectra, called endmember signatures, and the corresponding abundance fractions [8–10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. Linear mixing model holds approximately when the mixing scale is macroscopic [13] and there is negligible interaction among distinct endmembers [3, 14]. If, however, the mixing scale is microscopic (or intimate mixtures) [15, 16] and the incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [17], the linear model is no longer accurate. Linear spectral unmixing has been intensively researched in the last years [9, 10, 12, 18–21]. It considers that a mixed pixel is a linear combination of endmember signatures weighted by the correspondent abundance fractions. Under this model, and assuming that the number of substances and their reflectance spectra are known, hyperspectral unmixing is a linear problem for which many solutions have been proposed (e.g., maximum likelihood estimation [8], spectral signature matching [22], spectral angle mapper [23], subspace projection methods [24,25], and constrained least squares [26]). In most cases, the number of substances and their reflectances are not known and, then, hyperspectral unmixing falls into the class of blind source separation problems [27]. Independent component analysis (ICA) has recently been proposed as a tool to blindly unmix hyperspectral data [28–31]. ICA is based on the assumption of mutually independent sources (abundance fractions), which is not the case of hyperspectral data, since the sum of abundance fractions is constant, implying statistical dependence among them. This dependence compromises ICA applicability to hyperspectral images as shown in Refs. [21, 32]. In fact, ICA finds the endmember signatures by multiplying the spectral vectors with an unmixing matrix, which minimizes the mutual information among sources. If sources are independent, ICA provides the correct unmixing, since the minimum of the mutual information is obtained only when sources are independent. This is no longer true for dependent abundance fractions. Nevertheless, some endmembers may be approximately unmixed. These aspects are addressed in Ref. [33]. Under the linear mixing model, the observations from a scene are in a simplex whose vertices correspond to the endmembers. Several approaches [34–36] have exploited this geometric feature of hyperspectral mixtures [35]. Minimum volume transform (MVT) algorithm [36] determines the simplex of minimum volume containing the data. The method presented in Ref. [37] is also of MVT type but, by introducing the notion of bundles, it takes into account the endmember variability usually present in hyperspectral mixtures. The MVT type approaches are complex from the computational point of view. Usually, these algorithms find in the first place the convex hull defined by the observed data and then fit a minimum volume simplex to it. For example, the gift wrapping algorithm [38] computes the convex hull of n data points in a d-dimensional space with a computational complexity of O(nbd=2cþ1), where bxc is the highest integer lower or equal than x and n is the number of samples. The complexity of the method presented in Ref. [37] is even higher, since the temperature of the simulated annealing algorithm used shall follow a log( ) law [39] to assure convergence (in probability) to the desired solution. Aiming at a lower computational complexity, some algorithms such as the pixel purity index (PPI) [35] and the N-FINDR [40] still find the minimum volume simplex containing the data cloud, but they assume the presence of at least one pure pixel of each endmember in the data. This is a strong requisite that may not hold in some data sets. In any case, these algorithms find the set of most pure pixels in the data. PPI algorithm uses the minimum noise fraction (MNF) [41] as a preprocessing step to reduce dimensionality and to improve the signal-to-noise ratio (SNR). The algorithm then projects every spectral vector onto skewers (large number of random vectors) [35, 42,43]. The points corresponding to extremes, for each skewer direction, are stored. A cumulative account records the number of times each pixel (i.e., a given spectral vector) is found to be an extreme. The pixels with the highest scores are the purest ones. N-FINDR algorithm [40] is based on the fact that in p spectral dimensions, the p-volume defined by a simplex formed by the purest pixels is larger than any other volume defined by any other combination of pixels. This algorithm finds the set of pixels defining the largest volume by inflating a simplex inside the data. ORA SIS [44, 45] is a hyperspectral framework developed by the U.S. Naval Research Laboratory consisting of several algorithms organized in six modules: exemplar selector, adaptative learner, demixer, knowledge base or spectral library, and spatial postrocessor. The first step consists in flat-fielding the spectra. Next, the exemplar selection module is used to select spectral vectors that best represent the smaller convex cone containing the data. The other pixels are rejected when the spectral angle distance (SAD) is less than a given thresh old. The procedure finds the basis for a subspace of a lower dimension using a modified Gram–Schmidt orthogonalizati on. The selected vectors are then projected onto this subspace and a simplex is found by an MV T pro cess. ORA SIS is oriented to real-time target detection from uncrewed air vehicles using hyperspectral data [46]. In this chapter we develop a new algorithm to unmix linear mixtures of endmember spectra. First, the algorithm determines the number of endmembers and the signal subspace using a newly developed concept [47, 48]. Second, the algorithm extracts the most pure pixels present in the data. Unlike other methods, this algorithm is completely automatic and unsupervised. To estimate the number of endmembers and the signal subspace in hyperspectral linear mixtures, the proposed scheme begins by estimating sign al and noise correlation matrices. The latter is based on multiple regression theory. The signal subspace is then identified by selectin g the set of signal eigenvalue s that best represents the data, in the least-square sense [48,49 ], we note, however, that VCA works with projected and with unprojected data. The extraction of the end members exploits two facts: (1) the endmembers are the vertices of a simplex and (2) the affine transformation of a simplex is also a simplex. As PPI and N-FIND R algorithms, VCA also assumes the presence of pure pixels in the data. The algorithm iteratively projects data on to a direction orthogonal to the subspace spanned by the endmembers already determined. The new end member signature corresponds to the extreme of the projection. The algorithm iterates until all end members are exhausted. VCA performs much better than PPI and better than or comparable to N-FI NDR; yet it has a computational complexity between on e and two orders of magnitude lower than N-FINDR. The chapter is structure d as follows. Section 19.2 describes the fundamentals of the proposed method. Section 19.3 and Section 19.4 evaluate the proposed algorithm using simulated and real data, respectively. Section 19.5 presents some concluding remarks.

Blind hyperspectral unmixing

Hyperspectral unmixing methods aim at the decomposition of a hyperspectral image into a collection endmember signatures, i.e., the radiance or reflectance of the materials present in the scene, and the correspondent abundance fractions at each pixel in the image. This paper introduces a new unmixing method termed dependent component analysis (DECA). This method is blind and fully automatic and it overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical based approaches. DECA is based on the linear mixture model, i.e., each pixel is a linear mixture of the endmembers signatures weighted by the correspondent abundance fractions. These abundances are modeled as mixtures of Dirichlet densities, thus enforcing the non-negativity and constant sum constraints, imposed by the acquisition process. The endmembers signatures are inferred by a generalized expectation-maximization (GEM) type algorithm. The paper illustrates the effectiveness of DECA on synthetic and real hyperspectral images.

Fast unsupervised extraction of endmembers spectra from hyperspectral data

Linear unmixing decomposes an hyperspectral image into a collection of re ectance spectra, called endmember signatures, and a set corresponding abundance fractions from the respective spatial coverage. This paper introduces vertex component analysis, an unsupervised algorithm to unmix linear mixtures of hyperpsectral data. VCA exploits the fact that endmembers occupy vertices of a simplex, and assumes the presence of pure pixels in data. VCA performance is illustrated using simulated and real data. VCA competes with state-of-the-art methods with much lower computational complexity.

Estimação de superfícies tridimensionais com modelos activos

Esta comunicação aborda a estimação da superfície de objectos a partir de um conjunto de pontos tridimensionais usando modelos activos. Propõe-se, uma extensão da Classe Unificada desenvolvida por Abrantes e Marques. A superfície é discretizada usando dois tipos de redes: redes de malha rectangular e redes Simplex. A Classe Unificada baseia-se no cálculo dos centróides dos dados na vizinhança de amostras pré-definidas da superfície deformável. Os pontos da superfície são atraídos na direcção dos centróides. O artigo revê os conceitos básicos de modelamento activo de superfícies, a Classe Unificada e as redes Simplex. Os modelos descritos são testados usando dados sintéticos e reais obtidos a partir de imagens ecográficas e de ressonância magnética.

Desenvolvimento de Anticorpos Plásticos para um Biomarcador do Cancro

O trabalho descrito compreende o desenvolvimento de um anticorpo plástico (MIP, do inglês Molecularly Imprinted Polymer) para o antigénio carcinoembrionário (CEA, do inglês Carcinoembriogenic Antigen) e a sua aplicação na construção de dispositivos portáteis, de tamanho reduzido e de baixo custo, tendo em vista a monitorização deste biomarcador do cancro do colo-retal em contexto Point-of-Care (POC). O anticorpo plástico foi obtido por tecnologia de impressão molecular orientada, baseada em eletropolimerização sobre uma superfície condutora de vidro recoberto por FTO. De uma forma geral, o processo foi iniciado pela electropolimerização de anilina sobre o vidro, seguindo-se a ligação por adsorção do biomarcador (CEA) ao filme de polianilina, com ou sem monómeros carregados positivamente (Cloreto de vinilbenziltrimetilamónio, VB). A última fase consistiu na electropolimerização de o-fenilenodiamina (oPD) sobre a superfície, seguindo-se a remoção da proteína por clivagem de ligações peptídicas, com o auxílio de tripsina. A eficiência da impressão do biomarcador CEA no material polimérico foi controlada pela preparação de um material análogo, NIP (do inglês, Non-Imprinted Polymer), no qual nem a proteína nem o monómero VB estavam presentes. Os materiais obtidos foram caracterizados quimicamente por técnicas de Infravermelho com Transformada de Fourier (FTIR, do inglês, Fourier Transform Infrared Spectroscopy) e microscopia confocal de Raman. Os materiais sensores preparados foram entretanto incluídos em membranas poliméricas de Poli(cloreto de vinilo) (PVC) plastificado, para construção de sensores (biomiméticos) seletivos a CEA, tendo-se avaliado a resposta analítica em diferentes meios. Obteve-se uma boa resposta potenciométrica em solução tampão de Ácido 4-(2-hidroxietil)piperazina-1-etanosulfónico (HEPES), a pH 4,4, com uma membrana seletiva baseada em MIP preparada com o monómero carregado VB. O limite de deteção foi menor do que 42 pg/mL, observando-se um comportamento linear (versus o logaritmo da concentração) até 625 pg/mL, com um declive aniónico igual a -61,9 mV/década e r2>0,9974. O comportamento analítico dos sensores biomiméticos foi ainda avaliado em urina, tendo em vista a sua aplicação na análise de CEA em urina. Neste caso, o limite de deteção foi menor do que 38 pg/mL, para uma resposta linear até 625 pg/mL, com um declive de -38,4 mV/década e r2> 0,991. De uma forma geral, a aplicação experimental dos sensores biomiméticos evidenciou respostas exatas, sugerindo que os biossensores desenvolvidos prossigam estudos adicionais tendo em vista a sua aplicação em amostras de indivíduos doentes.

Development of Secondary Resistance to Fluconazole in Cryptococcus neoformans Isolated from a Patient with AIDS

Cryptococcus neoformans is the fifth most common opportunistic agent of infection in patients with AIDS in the USA, exceeded only by Candida species, Pneumocystis carinii, cytomegalovirus and Mycobacterium avium1, 2, 6, 10, 11. In Brazil is the sixth, exceeded by Candida species, P. carinii, Mycobacterium species, Toxoplasma gondii, and herpes simplex virus (AIDS, Boletim Epidemiológico, set/nov 96, Ministério da Saúde, Brasil). During 30 years, the treatment of C. neoformans meningitis was based on the use of amphotericin B with or without flucytosine13. Nowadays, with the immunodepression caused by human immunodeficiency virus (HIV) infection and the availability of new antifungal drugs as the triazoles, the concept related to cure and relapses of cryptococcosis has been altered7, 20. Patients are treated with amphotericin B with or without flucytosine as initial therapy, but maintenance therapy is always necessary in AIDS patients with C. neoformans infections