RANKL expression is differentially modulated by TLR2 and TLR4 signaling in fibroblasts and osteoblasts

Resident, non-immune cells express various pattern-recognition receptors and produce inflammatory cytokines in response to microbial antigens, during the innate immune response. Alveolar bone resorption is the hallmark of destructive periodontitis and it is caused by the host response to bacteria and their mediators present on the biofilm. The balance between the expression levels of receptor activator of nuclear factorkappa B ligand (RANKL) and osteoprotegerin (OPG) is pivotal for osteoclast differentiation and activity and has been implicated in the progression of bone loss in periodontitis. To assess the contribution of resident cells to the bone resorption mediated by innate immune signaling, we stimulated fibroblasts and osteoblastic cells with LPS from. Escherichia coli (TLR4 agonist), Porphyromonas gingivalis (TLR2 and -4 agonist), and interleukin-1 beta (as a control for cytokine signaling through Toll/IL-1receptor domain) in time-response experiments. Expression of RANKL and OPG mRNA was studied by RT-PCR, whereas the production of RANKL protein and the activation of p38 MAPK and NF-kB signaling pathways were analyzed by western blot. We used biochemical inhibitors to assess the relative contribution of p38 MAPK and NF-kB signaling to the expression of RANKL and OPG induced by TLR2, -4 and IL1β in these cells. Both p38 MAPK and NFkB pathways were activated by these stimuli in fibroblasts and osteoblasts, but the kinetics of this activation varied in each cell type and with the nature of the stimulation. E. coli LPS was a stronger inducer of RANKL mRNA in fibroblasts, whereas LPS from P. gingivalis downregulated RANKL mRNA in periodontal ligament cells but increased its expression in osteoblasts. IL-1β induced RANKL in both cell types and without a marked effect on OPG expression. p38 MAPK was more relevant than NF-kB for the expression of RANKL and OPG in these cell types.

Interleukin-18 increases TLR4 and mannose receptor expression and modulates cytokine production in human monocytes

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Paracoccidioides brasiliensis interferes on dendritic cells maturation by inhibiting PGE(2) production

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Learning kernels for support vector machines with polynomial powers of sigmoid

In the pattern recognition research field, Support Vector Machines (SVM) have been an effectiveness tool for classification purposes, being successively employed in many applications. The SVM input data is transformed into a high dimensional space using some kernel functions where linear separation is more likely. However, there are some computational drawbacks associated to SVM. One of them is the computational burden required to find out the more adequate parameters for the kernel mapping considering each non-linearly separable input data space, which reflects the performance of SVM. This paper introduces the Polynomial Powers of Sigmoid for SVM kernel mapping, and it shows their advantages over well-known kernel functions using real and synthetic datasets.

Uso de Redes Neurais ARTMAP Nebulosas para a classificação de padrões em sinais ECoG relacionados ao movimento dos dedos

Pós-graduação em Engenharia Elétrica - FEIS

Preliminary diagnosis of ophtalmological diseases through machine learning techniques

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Análise de formas planas em imagens digitais

Given the widespread use of computers, the visual pattern recognition task has been automated in order to address the huge amount of available digital images. Many applications use image processing techniques as well as feature extraction and visual pattern recognition algorithms in order to identify people, to make the disease diagnosis process easier, to classify objects, etc. based on digital images. Among the features that can be extracted and analyzed from images is the shape of objects or regions. In some cases, shape is the unique feature that can be extracted with a relatively high accuracy from the image. In this work we present some of most important shape analysis methods and compare their performance when applied on three well-known shape image databases. Finally, we propose the development of a new shape descriptor based on the Hough Transform.

Papel dos receptores TLR2 e TLR4 na produção de citocinas em pacientes chagásicos crônicos

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Detecção de impressões digitais fraudulentas utilizando padrões mapeados localmente em multiescala

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Algoritmos de aprendizado semi-supervisionado baseados em grafos aplicados na bioinformática

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Processamento e análise de vídeos utilizando Floresta de Caminhos Ótimos

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Processamento e análise de vídeos utilizando Floresta de Caminhos Ótimos

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Color texture analysis based on fractal descriptors

Color texture classification is an important step in image segmentation and recognition. The color information is especially important in textures of natural scenes, such as leaves surfaces, terrains models, etc. In this paper, we propose a novel approach based on the fractal dimension for color texture analysis. The proposed approach investigates the complexity in R, G and B color channels to characterize a texture sample. We also propose to study all channels in combination, taking into consideration the correlations between them. Both these approaches use the volumetric version of the Bouligand-Minkowski Fractal Dimension method. The results show a advantage of the proposed method over other color texture analysis methods. (C) 2011 Elsevier Ltd. All rights reserved.

Complex networks analysis of language complexity

Methods from statistical physics, such as those involving complex networks, have been increasingly used in the quantitative analysis of linguistic phenomena. In this paper, we represented pieces of text with different levels of simplification in co-occurrence networks and found that topological regularity correlated negatively with textual complexity. Furthermore, in less complex texts the distance between concepts, represented as nodes, tended to decrease. The complex networks metrics were treated with multivariate pattern recognition techniques, which allowed us to distinguish between original texts and their simplified versions. For each original text, two simplified versions were generated manually with increasing number of simplification operations. As expected, distinction was easier for the strongly simplified versions, where the most relevant metrics were node strength, shortest paths and diversity. Also, the discrimination of complex texts was improved with higher hierarchical network metrics, thus pointing to the usefulness of considering wider contexts around the concepts. Though the accuracy rate in the distinction was not as high as in methods using deep linguistic knowledge, the complex network approach is still useful for a rapid screening of texts whenever assessing complexity is essential to guarantee accessibility to readers with limited reading ability. Copyright (c) EPLA, 2012

A complex networks approach for data clustering

This work proposes a method for data clustering based on complex networks theory. A data set is represented as a network by considering different metrics to establish the connection between each pair of objects. The clusters are obtained by taking into account five community detection algorithms. The network-based clustering approach is applied in two real-world databases and two sets of artificially generated data. The obtained results suggest that the exponential of the Minkowski distance is the most suitable metric to quantify the similarities between pairs of objects. In addition, the community identification method based on the greedy optimization provides the best cluster solution. We compare the network-based clustering approach with some traditional clustering algorithms and verify that it provides the lowest classification error rate. (C) 2012 Elsevier B.V. All rights reserved.