Increased Resting State Network Connectivity in Synesthesia: Evidence for a Neural Basis of Synesthetic Consistency

Studying individual differences in conscious awareness can potentially lend fundamental insights into the neural bases of binding mechanisms and consciousness (Cohen Kadosh and Henik, 2007). Partly for this reason, considerable attention has been devoted to the neural mechanisms underlying grapheme–color synesthesia, a healthy condition involving atypical brain activation and the concurrent experience of color photisms in response to letters, numbers, and words. For instance, the letter C printed in black on a white background may elicit a yellow color photism that is perceived to be spatially colocalized with the inducing stimulus or internally in the “mind's eye” as, for instance, a visual image. Synesthetic experiences are involuntary, idiosyncratic, and consistent over time (Rouw et al., 2011). To date, neuroimaging research on synesthesia has focused on brain areas activated during the experience of synesthesia and associated structural brain differences. However, activity patterns of the synesthetic brain at rest remain largely unexplored. Moreover, the neural correlates of synesthetic consistency, the hallmark characteristic of synesthesia, remain elusive.

Effectiveness of non-steroidal anti-inflammatory drugs for the treatment of pain in knee and hip osteoarthritis: a network meta-analysis.

BACKGROUND Non-steroidal anti-inflammatory drugs (NSAIDs) are the backbone of osteoarthritis pain management. We aimed to assess the effectiveness of different preparations and doses of NSAIDs on osteoarthritis pain in a network meta-analysis. METHODS For this network meta-analysis, we considered randomised trials comparing any of the following interventions: NSAIDs, paracetamol, or placebo, for the treatment of osteoarthritis pain. We searched the Cochrane Central Register of Controlled Trials (CENTRAL) and the reference lists of relevant articles for trials published between Jan 1, 1980, and Feb 24, 2015, with at least 100 patients per group. The prespecified primary and secondary outcomes were pain and physical function, and were extracted in duplicate for up to seven timepoints after the start of treatment. We used an extension of multivariable Bayesian random effects models for mixed multiple treatment comparisons with a random effect at the level of trials. For the primary analysis, a random walk of first order was used to account for multiple follow-up outcome data within a trial. Preparations that used different total daily dose were considered separately in the analysis. To assess a potential dose-response relation, we used preparation-specific covariates assuming linearity on log relative dose. FINDINGS We identified 8973 manuscripts from our search, of which 74 randomised trials with a total of 58 556 patients were included in this analysis. 23 nodes concerning seven different NSAIDs or paracetamol with specific daily dose of administration or placebo were considered. All preparations, irrespective of dose, improved point estimates of pain symptoms when compared with placebo. For six interventions (diclofenac 150 mg/day, etoricoxib 30 mg/day, 60 mg/day, and 90 mg/day, and rofecoxib 25 mg/day and 50 mg/day), the probability that the difference to placebo is at or below a prespecified minimum clinically important effect for pain reduction (effect size [ES] -0·37) was at least 95%. Among maximally approved daily doses, diclofenac 150 mg/day (ES -0·57, 95% credibility interval [CrI] -0·69 to -0·46) and etoricoxib 60 mg/day (ES -0·58, -0·73 to -0·43) had the highest probability to be the best intervention, both with 100% probability to reach the minimum clinically important difference. Treatment effects increased as drug dose increased, but corresponding tests for a linear dose effect were significant only for celecoxib (p=0·030), diclofenac (p=0·031), and naproxen (p=0·026). We found no evidence that treatment effects varied over the duration of treatment. Model fit was good, and between-trial heterogeneity and inconsistency were low in all analyses. All trials were deemed to have a low risk of bias for blinding of patients. Effect estimates did not change in sensitivity analyses with two additional statistical models and accounting for methodological quality criteria in meta-regression analysis. INTERPRETATION On the basis of the available data, we see no role for single-agent paracetamol for the treatment of patients with osteoarthritis irrespective of dose. We provide sound evidence that diclofenac 150 mg/day is the most effective NSAID available at present, in terms of improving both pain and function. Nevertheless, in view of the safety profile of these drugs, physicians need to consider our results together with all known safety information when selecting the preparation and dose for individual patients. FUNDING Swiss National Science Foundation (grant number 405340-104762) and Arco Foundation, Switzerland.

Contributions to Bayesian network learning with applications to neuroscience

Neuronal morphology is a key feature in the study of brain circuits, as it is highly related to information processing and functional identification. Neuronal morphology affects the process of integration of inputs from other neurons and determines the neurons which receive the output of the neurons. Different parts of the neurons can operate semi-independently according to the spatial location of the synaptic connections. As a result, there is considerable interest in the analysis of the microanatomy of nervous cells since it constitutes an excellent tool for better understanding cortical function. However, the morphologies, molecular features and electrophysiological properties of neuronal cells are extremely variable. Except for some special cases, this variability makes it hard to find a set of features that unambiguously define a neuronal type. In addition, there are distinct types of neurons in particular regions of the brain. This morphological variability makes the analysis and modeling of neuronal morphology a challenge. Uncertainty is a key feature in many complex real-world problems. Probability theory provides a framework for modeling and reasoning with uncertainty. Probabilistic graphical models combine statistical theory and graph theory to provide a tool for managing domains with uncertainty. In particular, we focus on Bayesian networks, the most commonly used probabilistic graphical model. In this dissertation, we design new methods for learning Bayesian networks and apply them to the problem of modeling and analyzing morphological data from neurons. The morphology of a neuron can be quantified using a number of measurements, e.g., the length of the dendrites and the axon, the number of bifurcations, the direction of the dendrites and the axon, etc. These measurements can be modeled as discrete or continuous data. The continuous data can be linear (e.g., the length or the width of a dendrite) or directional (e.g., the direction of the axon). These data may follow complex probability distributions and may not fit any known parametric distribution. Modeling this kind of problems using hybrid Bayesian networks with discrete, linear and directional variables poses a number of challenges regarding learning from data, inference, etc. In this dissertation, we propose a method for modeling and simulating basal dendritic trees from pyramidal neurons using Bayesian networks to capture the interactions between the variables in the problem domain. A complete set of variables is measured from the dendrites, and a learning algorithm is applied to find the structure and estimate the parameters of the probability distributions included in the Bayesian networks. Then, a simulation algorithm is used to build the virtual dendrites by sampling values from the Bayesian networks, and a thorough evaluation is performed to show the model’s ability to generate realistic dendrites. In this first approach, the variables are discretized so that discrete Bayesian networks can be learned and simulated. Then, we address the problem of learning hybrid Bayesian networks with different kinds of variables. Mixtures of polynomials have been proposed as a way of representing probability densities in hybrid Bayesian networks. We present a method for learning mixtures of polynomials approximations of one-dimensional, multidimensional and conditional probability densities from data. The method is based on basis spline interpolation, where a density is approximated as a linear combination of basis splines. The proposed algorithms are evaluated using artificial datasets. We also use the proposed methods as a non-parametric density estimation technique in Bayesian network classifiers. Next, we address the problem of including directional data in Bayesian networks. These data have some special properties that rule out the use of classical statistics. Therefore, different distributions and statistics, such as the univariate von Mises and the multivariate von Mises–Fisher distributions, should be used to deal with this kind of information. In particular, we extend the naive Bayes classifier to the case where the conditional probability distributions of the predictive variables given the class follow either of these distributions. We consider the simple scenario, where only directional predictive variables are used, and the hybrid case, where discrete, Gaussian and directional distributions are mixed. The classifier decision functions and their decision surfaces are studied at length. Artificial examples are used to illustrate the behavior of the classifiers. The proposed classifiers are empirically evaluated over real datasets. We also study the problem of interneuron classification. An extensive group of experts is asked to classify a set of neurons according to their most prominent anatomical features. A web application is developed to retrieve the experts’ classifications. We compute agreement measures to analyze the consensus between the experts when classifying the neurons. Using Bayesian networks and clustering algorithms on the resulting data, we investigate the suitability of the anatomical terms and neuron types commonly used in the literature. Additionally, we apply supervised learning approaches to automatically classify interneurons using the values of their morphological measurements. Then, a methodology for building a model which captures the opinions of all the experts is presented. First, one Bayesian network is learned for each expert, and we propose an algorithm for clustering Bayesian networks corresponding to experts with similar behaviors. Then, a Bayesian network which represents the opinions of each group of experts is induced. Finally, a consensus Bayesian multinet which models the opinions of the whole group of experts is built. A thorough analysis of the consensus model identifies different behaviors between the experts when classifying the interneurons in the experiment. A set of characterizing morphological traits for the neuronal types can be defined by performing inference in the Bayesian multinet. These findings are used to validate the model and to gain some insights into neuron morphology. Finally, we study a classification problem where the true class label of the training instances is not known. Instead, a set of class labels is available for each instance. This is inspired by the neuron classification problem, where a group of experts is asked to individually provide a class label for each instance. We propose a novel approach for learning Bayesian networks using count vectors which represent the number of experts who selected each class label for each instance. These Bayesian networks are evaluated using artificial datasets from supervised learning problems. Resumen La morfología neuronal es una característica clave en el estudio de los circuitos cerebrales, ya que está altamente relacionada con el procesado de información y con los roles funcionales. La morfología neuronal afecta al proceso de integración de las señales de entrada y determina las neuronas que reciben las salidas de otras neuronas. Las diferentes partes de la neurona pueden operar de forma semi-independiente de acuerdo a la localización espacial de las conexiones sinápticas. Por tanto, existe un interés considerable en el análisis de la microanatomía de las células nerviosas, ya que constituye una excelente herramienta para comprender mejor el funcionamiento de la corteza cerebral. Sin embargo, las propiedades morfológicas, moleculares y electrofisiológicas de las células neuronales son extremadamente variables. Excepto en algunos casos especiales, esta variabilidad morfológica dificulta la definición de un conjunto de características que distingan claramente un tipo neuronal. Además, existen diferentes tipos de neuronas en regiones particulares del cerebro. La variabilidad neuronal hace que el análisis y el modelado de la morfología neuronal sean un importante reto científico. La incertidumbre es una propiedad clave en muchos problemas reales. La teoría de la probabilidad proporciona un marco para modelar y razonar bajo incertidumbre. Los modelos gráficos probabilísticos combinan la teoría estadística y la teoría de grafos con el objetivo de proporcionar una herramienta con la que trabajar bajo incertidumbre. En particular, nos centraremos en las redes bayesianas, el modelo más utilizado dentro de los modelos gráficos probabilísticos. En esta tesis hemos diseñado nuevos métodos para aprender redes bayesianas, inspirados por y aplicados al problema del modelado y análisis de datos morfológicos de neuronas. La morfología de una neurona puede ser cuantificada usando una serie de medidas, por ejemplo, la longitud de las dendritas y el axón, el número de bifurcaciones, la dirección de las dendritas y el axón, etc. Estas medidas pueden ser modeladas como datos continuos o discretos. A su vez, los datos continuos pueden ser lineales (por ejemplo, la longitud o la anchura de una dendrita) o direccionales (por ejemplo, la dirección del axón). Estos datos pueden llegar a seguir distribuciones de probabilidad muy complejas y pueden no ajustarse a ninguna distribución paramétrica conocida. El modelado de este tipo de problemas con redes bayesianas híbridas incluyendo variables discretas, lineales y direccionales presenta una serie de retos en relación al aprendizaje a partir de datos, la inferencia, etc. En esta tesis se propone un método para modelar y simular árboles dendríticos basales de neuronas piramidales usando redes bayesianas para capturar las interacciones entre las variables del problema. Para ello, se mide un amplio conjunto de variables de las dendritas y se aplica un algoritmo de aprendizaje con el que se aprende la estructura y se estiman los parámetros de las distribuciones de probabilidad que constituyen las redes bayesianas. Después, se usa un algoritmo de simulación para construir dendritas virtuales mediante el muestreo de valores de las redes bayesianas. Finalmente, se lleva a cabo una profunda evaluaci ón para verificar la capacidad del modelo a la hora de generar dendritas realistas. En esta primera aproximación, las variables fueron discretizadas para poder aprender y muestrear las redes bayesianas. A continuación, se aborda el problema del aprendizaje de redes bayesianas con diferentes tipos de variables. Las mixturas de polinomios constituyen un método para representar densidades de probabilidad en redes bayesianas híbridas. Presentamos un método para aprender aproximaciones de densidades unidimensionales, multidimensionales y condicionales a partir de datos utilizando mixturas de polinomios. El método se basa en interpolación con splines, que aproxima una densidad como una combinación lineal de splines. Los algoritmos propuestos se evalúan utilizando bases de datos artificiales. Además, las mixturas de polinomios son utilizadas como un método no paramétrico de estimación de densidades para clasificadores basados en redes bayesianas. Después, se estudia el problema de incluir información direccional en redes bayesianas. Este tipo de datos presenta una serie de características especiales que impiden el uso de las técnicas estadísticas clásicas. Por ello, para manejar este tipo de información se deben usar estadísticos y distribuciones de probabilidad específicos, como la distribución univariante von Mises y la distribución multivariante von Mises–Fisher. En concreto, en esta tesis extendemos el clasificador naive Bayes al caso en el que las distribuciones de probabilidad condicionada de las variables predictoras dada la clase siguen alguna de estas distribuciones. Se estudia el caso base, en el que sólo se utilizan variables direccionales, y el caso híbrido, en el que variables discretas, lineales y direccionales aparecen mezcladas. También se estudian los clasificadores desde un punto de vista teórico, derivando sus funciones de decisión y las superficies de decisión asociadas. El comportamiento de los clasificadores se ilustra utilizando bases de datos artificiales. Además, los clasificadores son evaluados empíricamente utilizando bases de datos reales. También se estudia el problema de la clasificación de interneuronas. Desarrollamos una aplicación web que permite a un grupo de expertos clasificar un conjunto de neuronas de acuerdo a sus características morfológicas más destacadas. Se utilizan medidas de concordancia para analizar el consenso entre los expertos a la hora de clasificar las neuronas. Se investiga la idoneidad de los términos anatómicos y de los tipos neuronales utilizados frecuentemente en la literatura a través del análisis de redes bayesianas y la aplicación de algoritmos de clustering. Además, se aplican técnicas de aprendizaje supervisado con el objetivo de clasificar de forma automática las interneuronas a partir de sus valores morfológicos. A continuación, se presenta una metodología para construir un modelo que captura las opiniones de todos los expertos. Primero, se genera una red bayesiana para cada experto y se propone un algoritmo para agrupar las redes bayesianas que se corresponden con expertos con comportamientos similares. Después, se induce una red bayesiana que modela la opinión de cada grupo de expertos. Por último, se construye una multired bayesiana que modela las opiniones del conjunto completo de expertos. El análisis del modelo consensuado permite identificar diferentes comportamientos entre los expertos a la hora de clasificar las neuronas. Además, permite extraer un conjunto de características morfológicas relevantes para cada uno de los tipos neuronales mediante inferencia con la multired bayesiana. Estos descubrimientos se utilizan para validar el modelo y constituyen información relevante acerca de la morfología neuronal. Por último, se estudia un problema de clasificación en el que la etiqueta de clase de los datos de entrenamiento es incierta. En cambio, disponemos de un conjunto de etiquetas para cada instancia. Este problema está inspirado en el problema de la clasificación de neuronas, en el que un grupo de expertos proporciona una etiqueta de clase para cada instancia de manera individual. Se propone un método para aprender redes bayesianas utilizando vectores de cuentas, que representan el número de expertos que seleccionan cada etiqueta de clase para cada instancia. Estas redes bayesianas se evalúan utilizando bases de datos artificiales de problemas de aprendizaje supervisado.

Ric1p and the Ypt6p GTPase Function in a Common Pathway Required for Localization of Trans-Golgi Network Membrane Proteins

In Saccharomyces cerevisiae, clathrin is necessary for localization of trans-Golgi network (TGN) membrane proteins, a process that involves cycling of TGN proteins between the TGN and endosomes. To characterize further TGN protein localization, we applied a screen for mutations that cause severe growth defects in combination with a temperature-sensitive clathrin heavy chain. This screen yielded a mutant allele of RIC1. Cells carrying a deletion of RIC1 (ric1Δ) mislocalize TGN membrane proteins Kex2p and Vps10p to the vacuole. Delivery to the vacuole occurs in ric1Δ cells also harboring end3Δ to block endocytosis, indicative of a defect in retrieval to the TGN rather than sorting to endosomes. SYS1, originally discovered as a multicopy suppressor of defects caused by the absence of the Rab GTPase YPT6, was identified as a multicopy suppressor of ric1Δ. Further comparison of ric1Δ and ypt6Δ cells demonstrated identical phenotypes. Multicopy plasmids expressing v-SNAREs Gos1p or Ykt6p, but not other v- and t-SNAREs, partially suppressed phenotypes of ric1Δ and ypt6Δ cells. SLY1–20, a dominant activator of the cis-Golgi network t-SNARE Sed5p, also functioned as a multicopy suppressor. Because Gos1p and Ykt6p interact with Sed5p, these results raise the possibility that TGN membrane protein localization requires Ric1p- and Ypt6p-dependent retrieval to the cis-Golgi network.

The n-tuple network: coping with sub-optimality

The subject of this thesis is the n-tuple net.work (RAMnet). The major advantage of RAMnets is their speed and the simplicity with which they can be implemented in parallel hardware. On the other hand, this method is not a universal approximator and the training procedure does not involve the minimisation of a cost function. Hence RAMnets are potentially sub-optimal. It is important to understand the source of this sub-optimality and to develop the analytical tools that allow us to quantify the generalisation cost of using this model for any given data. We view RAMnets as classifiers and function approximators and try to determine how critical their lack of' universality and optimality is. In order to understand better the inherent. restrictions of the model, we review RAMnets showing their relationship to a number of well established general models such as: Associative Memories, Kamerva's Sparse Distributed Memory, Radial Basis Functions, General Regression Networks and Bayesian Classifiers. We then benchmark binary RAMnet. model against 23 other algorithms using real-world data from the StatLog Project. This large scale experimental study indicates that RAMnets are often capable of delivering results which are competitive with those obtained by more sophisticated, computationally expensive rnodels. The Frequency Weighted version is also benchmarked and shown to perform worse than the binary RAMnet for large values of the tuple size n. We demonstrate that the main issues in the Frequency Weighted RAMnets is adequate probability estimation and propose Good-Turing estimates in place of the more commonly used :Maximum Likelihood estimates. Having established the viability of the method numerically, we focus on providillg an analytical framework that allows us to quantify the generalisation cost of RAMnets for a given datasetL. For the classification network we provide a semi-quantitative argument which is based on the notion of Tuple distance. It gives a good indication of whether the network will fail for the given data. A rigorous Bayesian framework with Gaussian process prior assumptions is given for the regression n-tuple net. We show how to calculate the generalisation cost of this net and verify the results numerically for one dimensional noisy interpolation problems. We conclude that the n-tuple method of classification based on memorisation of random features can be a powerful alternative to slower cost driven models. The speed of the method is at the expense of its optimality. RAMnets will fail for certain datasets but the cases when they do so are relatively easy to determine with the analytical tools we provide.

Outliers Resistant Learning Algorithm for Radial-basis-fuzzy-wavelet-neural Network in Stomach Acute Injury Diagnosis Tasks

In this paper an outliers resistant learning algorithm for the radial-basis-fuzzy-wavelet-neural network based on R. Welsh criterion is proposed. Suggested learning algorithm under consideration allows the signals processing in presence of significant noise level and outliers. The robust learning algorithm efficiency is investigated and confirmed by the number of experiments including medical applications.

Ultrastructural basis and function of iridescent blue colour of fruits in Elaeocarpus

Iridescent colour, caused by physical effects (thin-film interference, diffraction and Tyndall scattering), is relatively common in animals but exceedingly rare among plants1. Some benthic marine algae produce blue to violet iridescence2,3, and the upper leaf surfaces of a few vascular plants from the shady environments of humid tropical forests are iridescent blue4–6. Blue fruit colour has been assumed to be caused by anthocyanins7. A survey of such fruits (26 species in 18 genera) in Costa Rica, India, Florida and Malaysia, showed this to be the case, except for the iridescent colour in fruits of Elaeocarpus angustifolius Blume (Elaeocarpaceae). There I show that the colour is caused by a remarkable structure in the epidermis, and provide evidence for its selective advantage.

Understanding the genetic basis of phenotype variability in individuals with neurocognitive disorders

Thesis (Ph.D.)--University of Washington, 2016-06

Urinary Tract Infection In Renal Transplant Recipients: Incidence, Risk Factors, And Impact On Graft Function.

Urinary tract infection (UTI) is the most common infection posttransplant. However, the risk factors for and the impact of UTIs remain controversial. The aim of this study was to identify the incidence of posttransplant UTIs in a series of renal transplant recipients from deceased donors. Secondary objectives were to identify: (1) the most frequent infectious agents; (2) risk factors related to donor; (3) risk factors related to recipients; and (4) impact of UTI on graft function. This was a retrospective analysis of medical records from renal transplant patients from January to December 2010. Local ethics committee approved the protocol. The incidence of UTI in this series was 34.2%. Risk factors for UTI were older age, (independent of gender), biopsy-proven acute rejection episodes, and kidneys from deceased donors (United Network for Organ Sharing criteria). For female patients, the number of pretransplant pregnancies was an additional risk factor. Recurrent UTI was observed in 44% of patients from the UTI group. The most common infectious agents were Escherichia coli and Klebsiella pneumoniae, for both isolated and recurrent UTI. No difference in renal graft function or immunosuppressive therapy was observed between groups after the 1-year follow-up. In this series, older age, previous pregnancy, kidneys from expanded criteria donors, and biopsy-proven acute rejection episodes were risk factors for posttransplant UTI. Recurrence of UTI was observed in 44%, with no negative impact on graft function or survival.

Kinase Inhibitor Profile For Human Nek1, Nek6, And Nek7 And Analysis Of The Structural Basis For Inhibitor Specificity.

Human Neks are a conserved protein kinase family related to cell cycle progression and cell division and are considered potential drug targets for the treatment of cancer and other pathologies. We screened the activation loop mutant kinases hNek1 and hNek2, wild-type hNek7, and five hNek6 variants in different activation/phosphorylation statesand compared them against 85 compounds using thermal shift denaturation. We identified three compounds with significant Tm shifts: JNK Inhibitor II for hNek1(Δ262-1258)-(T162A), Isogranulatimide for hNek6(S206A), andGSK-3 Inhibitor XIII for hNek7wt. Each one of these compounds was also validated by reducing the kinases activity by at least 25%. The binding sites for these compounds were identified by in silico docking at the ATP-binding site of the respective hNeks. Potential inhibitors were first screened by thermal shift assays, had their efficiency tested by a kinase assay, and were finally analyzed by molecular docking. Our findings corroborate the idea of ATP-competitive inhibition for hNek1 and hNek6 and suggest a novel non-competitive inhibition for hNek7 in regard to GSK-3 Inhibitor XIII. Our results demonstrate that our approach is useful for finding promising general and specific hNekscandidate inhibitors, which may also function as scaffolds to design more potent and selective inhibitors.

O lazer e a residência secundária em Angra dos Reis-RJ = : The leisure and the second homes in Angra dos Reis, RJ

Universidade Estadual de Campinas . Faculdade de Educação Física

AtPIN: Arabidopsis thaliana Protein Interaction Network

Background: Protein-protein interactions (PPIs) constitute one of the most crucial conditions to sustain life in living organisms. To study PPI in Arabidopsis thaliana we have developed AtPIN, a database and web interface for searching and building interaction networks based on publicly available protein-protein interaction datasets. Description: All interactions were divided into experimentally demonstrated or predicted. The PPIs in the AtPIN database present a cellular compartment classification (C(3)) which divides the PPI into 4 classes according to its interaction evidence and subcellular localization. It has been shown in the literature that a pair of genuine interacting proteins are generally expected to have a common cellular role and proteins that have common interaction partners have a high chance of sharing a common function. In AtPIN, due to its integrative profile, the reliability index for a reported PPI can be postulated in terms of the proportion of interaction partners that two proteins have in common. For this, we implement the Functional Similarity Weight (FSW) calculation for all first level interactions present in AtPIN database. In order to identify target proteins of cytosolic glutamyl-tRNA synthetase (Cyt-gluRS) (AT5G26710) we combined two approaches, AtPIN search and yeast two-hybrid screening. Interestingly, the proteins glutamine synthetase (AT5G35630), a disease resistance protein (AT3G50950) and a zinc finger protein (AT5G24930), which has been predicted as target proteins for Cyt-gluRS by AtPIN, were also detected in the experimental screening. Conclusions: AtPIN is a friendly and easy-to-use tool that aggregates information on Arabidopsis thaliana PPIs, ontology, and sub-cellular localization, and might be a useful and reliable strategy to map protein-protein interactions in Arabidopsis. AtPIN can be accessed at http://bioinfo.esalq.usp.br/atpin.

Immunological Basis for the Gender Differences in Murine Paracoccidioides brasiliensis Infection

This study aimed to investigate the immunological mechanisms involved in the gender distinct incidence of paracoccidioidomycosis (pcm), an endemic systemic mycosis in Latin America, which is at least 10 times more frequent in men than in women. Then, we compared the immune response of male and female mice to Paracoccidioides brasiliensis infection, as well as the influence in the gender differences exerted by paracoccin, a P. brasiliensis component with carbohydrate recognition property. High production of Th1 cytokines and T-bet expression have been detected in the paracoccin stimulated cultures of spleen cells from infected female mice. In contrast, in similar experimental conditions, cells from infected males produced higher levels of the Th2 cytokines and expressed GATA-3. Macrophages from male and female mice when stimulated with paracoccin displayed similar phagocytic capability, while fungicidal activity was two times more efficiently performed by macrophages from female mice, a fact that was associated with 50% higher levels of nitric oxide production. In order to evaluate the role of sexual hormones in the observed gender distinction, we have utilized mice that have been submitted to gonadectomy followed by inverse hormonal reconstitution. Spleen cells derived from castrated males reconstituted with estradiol have produced higher levels of IFN-gamma (1291+/-15 pg/mL) and lower levels of IL-10 (494+/-38 pg/mL), than normal male in response to paracoccin stimulus. In contrast, spleen cells from castrated female mice that had been treated with testosterone produced more IL-10 (1284+/-36 pg/mL) and less IFN-gamma (587614 pg/mL) than cells from normal female. In conclusion, our results reveal that the sexual hormones had a profound effect on the biology of immune cells, and estradiol favours protective responses to P. brasiliensis infection. In addition, fungal components, such as paracoccin, may provide additional support to the gender dimorphic immunity that marks P. brasiliensis infection.

Fossil groups in the Millennium Simulation Evolution of the brightest galaxies

Aims. We create a catalogue of simulated fossil groups and study their properties, in particular the merging histories of their first-ranked galaxies. We compare the simulated fossil group properties with those of both simulated non-fossil and observed fossil groups. Methods. Using simulations and a mock galaxy catalogue, we searched for massive (>5 x 10(13) h(-1) M-circle dot) fossil groups in the Millennium Simulation Galaxy Catalogue. In addition, we attempted to identify observed fossil groups in the Sloan Digital Sky Survey Data Release 6 using identical selection criteria. Results. Our predictions on the basis of the simulation data are: (a) fossil groups comprise about 5.5% of the total population of groups/clusters with masses larger than 5 x 10(13) h(-1) M-circle dot. This fraction is consistent with the fraction of fossil groups identified in the SDSS, after all observational biases have been taken into account; (b) about 88% of the dominant central objects in fossil groups are elliptical galaxies that have a median R-band absolute magnitude of similar to-23.5-5 log h, which is typical of the observed fossil groups known in the literature; (c) first-ranked galaxies of systems with M > 5 x 10(13) h(-1) M-circle dot, regardless of whether they are either fossil or non-fossil, are mainly formed by gas-poor mergers; (d) although fossil groups, in general, assembled most of their virial masses at higher redshifts in comparison with non-fossil groups, first-ranked galaxies in fossil groups merged later, i.e. at lower redshifts, compared with their non-fossil-group counterparts. Conclusions. We therefore expect to observe a number of luminous galaxies in the centres of fossil groups that show signs of a recent major merger.