801 resultados para Labeling hierarchical clustering
Resumo:
Gene clustering is a useful exploratory technique to group together genes with similar expression levels under distinct cell cycle phases or distinct conditions. It helps the biologist to identify potentially meaningful relationships between genes. In this study, we propose a clustering method based on multivariate normal mixture models, where the number of clusters is predicted via sequential hypothesis tests: at each step, the method considers a mixture model of m components (m = 2 in the first step) and tests if in fact it should be m - 1. If the hypothesis is rejected, m is increased and a new test is carried out. The method continues (increasing m) until the hypothesis is accepted. The theoretical core of the method is the full Bayesian significance test, an intuitive Bayesian approach, which needs no model complexity penalization nor positive probabilities for sharp hypotheses. Numerical experiments were based on a cDNA microarray dataset consisting of expression levels of 205 genes belonging to four functional categories, for 10 distinct strains of Saccharomyces cerevisiae. To analyze the method's sensitivity to data dimension, we performed principal components analysis on the original dataset and predicted the number of classes using 2 to 10 principal components. Compared to Mclust (model-based clustering), our method shows more consistent results.
Resumo:
Biological neuronal networks constitute a special class of dynamical systems, as they are formed by individual geometrical components, namely the neurons. In the existing literature, relatively little attention has been given to the influence of neuron shape on the overall connectivity and dynamics of the emerging networks. The current work addresses this issue by considering simplified neuronal shapes consisting of circular regions (soma/axons) with spokes (dendrites). Networks are grown by placing these patterns randomly in the two-dimensional (2D) plane and establishing connections whenever a piece of dendrite falls inside an axon. Several topological and dynamical properties of the resulting graph are measured, including the degree distribution, clustering coefficients, symmetry of connections, size of the largest connected component, as well as three hierarchical measurements of the local topology. By varying the number of processes of the individual basic patterns, we can quantify relationships between the individual neuronal shape and the topological and dynamical features of the networks. Integrate-and-fire dynamics on these networks is also investigated with respect to transient activation from a source node, indicating that long-range connections play an important role in the propagation of avalanches.
Resumo:
This work shows the application of the analytic hierarchy process (AHP) in the full cost accounting (FCA) within the integrated resource planning (IRP) process. For this purpose, a pioneer case was developed and different energy solutions of supply and demand for a metropolitan airport (Congonhas) were considered [Moreira, E.M., 2005. Modelamento energetico para o desenvolvimento limpo de aeroporto metropolitano baseado na filosofia do PIR-O caso da metropole de Sao Paulo. Dissertacao de mestrado, GEPEA/USP]. These solutions were compared and analyzed utilizing the software solution ""Decision Lens"" that implements the AHP. The final part of this work has a classification of resources that can be considered to be the initial target as energy resources, thus facilitating the restraints of the IRP of the airport and setting parameters aiming at sustainable development. (C) 2007 Elsevier Ltd. All rights reserved.
Resumo:
A chemotaxonomic analysis is described of a database containing various types of compounds from the Heliantheae tribe (Asteraceae) using Self-Organizing Maps (SOM). The numbers of occurrences of 9 chemical classes in different taxa of the tribe were used as variables. The study shows that SOM applied to chemical data can contribute to differentiate genera, subtribes, and groups of subtribes (subtribe branches), as well as to tribal and subtribal classifications of Heliantheae, exhibiting a high hit percentage comparable to that of an expert performance, and in agreement with the previous tribe classification proposed by Stuessy.
Resumo:
Recent efforts in the characterization of air-water flows properties have included some clustering process analysis. A cluster of bubbles is defined as a group of two or more bubbles, with a distinct separation from other bubbles before and after the cluster. The present paper compares the results of clustering processes two hydraulic structures. That is, a large-size dropshaft and a hydraulic jump in a rectangular horizontal channel. The comparison highlighted some significant differences in clustering production and structures. Both dropshaft and hydraulic jump flows are complex turbulent shear flows, and some clustering index may provide some measure of the bubble-turbulence interactions and associated energy dissipation.
Resumo:
The high-affinity receptors for human granulocyte-macrophage colony-stimulating factor (GM-CSF), interleukin-1 (IL-3), and IL-5 are heterodimeric complexes consisting of cytokine-specific alpha subunits and a common signal-transducing beta subunit (h beta c). We have previously demonstrated the oncogenic potential of this group of receptors by identifying constitutively activating point mutations in the extracellular and transmembrane domains of h beta c. We report here a comprehensive screen of the entire h beta c molecule that has led to the identification of additional constitutive point mutations by virtue of their ability to confer factor independence on murine FDC-P1 cells. These mutations were clustered exclusively in a central region of h beta c that encompasses the extracellular membrane-proximal domain, transmembrane domain, and membrane-proximal region of the cytoplasmic domain. Interestingly, most h beta c mutants exhibited cell type-specific constitutive activity, with only two transmembrane domain mutants able to confer factor independence on both murine FDC-P1 and BAF-B03 cells. Examination of the biochemical properties of these mutants in FDC-P1 cells indicated that MAP kinase (ERK1/2), STAT, and JAK2 signaling molecules were constitutively activated. In contrast, only some of the mutant beta subunits were constitutively tyrosine phosphorylated. Taken together; these results highlight key regions involved in h beta c activation, dissociate h beta c tyrosine phosphorylation from MAP kinase and STAT activation, and suggest the involvement of distinct mechanisms by which proliferative signals can be generated by h beta c. (C) 1998 by The American Society of Hematology.
Resumo:
The pentadentate H(3)bhci [1,3,5-trideoxy-1,3-bis((2-hydroxybenzyl)amino)-cis-inistol] and its bifunctionalized analogue H(3)bhci-glu-H [1,3,5-trideoxy-1,3-bis((2-hydroxybenzyl)amino)-5-glutaramido-cis-inositol] were synthesized, and their coordination chemistry was investigated with inactive rhenium, with no carrier added Re-188 and with carrier added Re-186. The neutral Re(V) complexes [ReO-(bhci)] and [ReO(bhci-glu-H)] are formed in good yields starting from [ReOCl3(P(C6H5)(3))(2)] or in quantitative yield directly from [(ReO4)-Re-186/188](-) in aqueous solution by reduction with Sn(II) or Sn(0). The X-ray structures of [ReO(bhci)] and [ReO(bhci-glu-H)] were elucidated revealing pentadentate side on coordination of the ligands to the Re=O core. The basic cyclohexane frame adopts a chair form in the case of [ReO(bhci)] and a twisted boat form in the case of [ReO(bhci-glu-H)]. [ReO(bhci)] crystallizes in the monoclinic space group C2/c with a = 27.425(3), b = 14.185(1), c = 19.047(2) Angstrom, and beta = 103.64(2)degrees and [ReO(bhci-glu-H)] in the monoclinic space group P2(1)/c with a = 13.056(3), b = 10.180(1), c = 22.378(5) Angstrom and beta = 98.205(9)degrees Both Re-188 complexes are stable in human serum for at least 3 days without decomposition. After injection into mice, [ReO(bhci-glu)](-) is readily excreted through the intestines, while [ReO(bhci)] is excreted by intestines, liver, and the kidneys. TLC investigations of the urine showed exclusively the complexes [ReO(bhci-glu-H)] and [ReO(bhci)], respectively, and no decomposition products. For derivatization of antibodies, the carboxylic group of [ReO(bhci-glu-H)] was activated with N-hydroxysuccinimide, which required unusually vigorous reaction conditions (heating). The anti colon cancer antibody mAb-35 [IgG and F(ab')(2) fragment] was labeled with [(ReO)-Re-186/188(bhci-glu)] to a specific activity of up to 1.5 mCi/mg (55 MBq/mg) with full retention of immunoreactivity. Labeling yields followed pseudo-first-order kinetics in antibody concentration with the ratio of rates between aminolysis and hydrolysis being about 2. Biodistributions of Re-186-labeled intact mAb-35 as well as of its F(ab')(2) fragment in tumor-bearing nude mice revealed good uptake by the tumor with only low accumulation of radioactivity in normal tissue.
Resumo:
Examples from the Murray-Darling basin in Australia are used to illustrate different methods of disaggregation of reconnaissance-scale maps. One approach for disaggregation revolves around the de-convolution of the soil-landscape paradigm elaborated during a soil survey. The descriptions of soil ma units and block diagrams in a soil survey report detail soil-landscape relationships or soil toposequences that can be used to disaggregate map units into component landscape elements. Toposequences can be visualised on a computer by combining soil maps with digital elevation data. Expert knowledge or statistics can be used to implement the disaggregation. Use of a restructuring element and k-means clustering are illustrated. Another approach to disaggregation uses training areas to develop rules to extrapolate detailed mapping into other, larger areas where detailed mapping is unavailable. A two-level decision tree example is presented. At one level, the decision tree method is used to capture mapping rules from the training area; at another level, it is used to define the domain over which those rules can be extrapolated. (C) 2001 Elsevier Science B.V. All rights reserved.
Resumo:
We analyze the influence of time-, firm-, industry- and country-level determinants of capital structure. First, we apply hierarchical linear modeling in order to assess the relative importance of those levels. We find that time and firm levels explain 78% of firm leverage. Second, we include random intercepts and random coefficients in order to analyze the direct and indirect influences of firm/industry/country characteristics on firm leverage. We document several important indirect influences of variables at industry and country-levels on firm determinants of leverage, as well as several structural differences in the financial behavior between firms of developed and emerging countries. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
This study aims to elaborate a hierarchical risk scale (HRS) of agricultural and cattle breeding activities and to classify the main agricultural crops and cattle breeding activities according to their risk levels. The research is characterized as exploratory and quantitative and was based on previous risk assessment (MARKOWITZ, 1952) and capital cost calculation (SHARPE, 1964) work for other business segments. The calculations on agricultural and cattle breeding data were processed for the period from 2000 to 2006. The used methods considers simplifications and adaptations needed to achieve the proposed objective. The final result, pioneering and embryonic, provides support to improve the management of these activities that are so essential to produce food for society.
Resumo:
A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature. (C) 2009 Elsevier Ltd. All rights reserved.