971 resultados para gabriel graph
Resumo:
Objective: This study evaluated ultra-structural dentine changes at the apical stop after CO(2) laser irradiation used during biomechanical preparation. Background: Most studies evaluating the sealing efficiency of CO(2) lasers have been carried out after apical root canal resections and retro-filling procedures. Methods: Sixty human canines were prepared with #1 to #6 Largo burs. The apical stops were established at 1 mm (n = 30) and 2 mm (n = 30) from the apex. Final irrigation was performed with 1% NaOCl and 15% EDTA followed by 20 ml of distilled and deionized water. Specimens were subdivided into three subgroups (n = 10 for each stop distance): GI-no radiation (n = 20); GII-3W potency (n = 20), GIII-5W potency (n = 20). After preparation, specimens were evaluated by scanning electron microscopy, with ultra-structural changes classified according to a scoring system based on six qualitatively different outcomes. Results: Statistical analysis using the Mann-Whitney test confirmed more intense results for the specimens irradiated at 5 W potency than at 3 W (p<0.0001). The Kruskal-Wallis test indicated that when using the same potencies (3 or 5 W) at 1 and 2 mm from the apex, there were no statistically significant differences in ultra-structural changes. Conclusions: Our results showed that ultra-structural changes ranged from smear layer removal to dentine fusion. As laser potency was increased from 3 to 5 W, ultra-structural changes included extensive fused lava-like areas sealing the apical foramen.
Resumo:
Objective: The purpose of this in vitro study was to investigate using the scanning electron microscope (SEM) the ultrastructural morphological changes of the radicular dentine surface after irradiation with 980-nm diode laser energy at different parameters and angles of incidence. Background Data: There have been limited reports on the effects of diode laser irradiation at 980 nm on radicular dentin morphology. Materials and Methods: Seventy-two maxillary canines were sectioned and roots were biomechanically prepared using K3 rotary instruments. The teeth were irrigated with 2 mL of distilled water between files and final irrigation was performed with 10 mL of distilled water. The teeth were then randomly divided into five groups (n = 8 each) according to their diode laser parameters: Group 1: no irradiation (control); group 2: 1.5 W/continuous wave (CW) emission (the manufacturer's parameters); group 3: 1.5 W/100 Hz; group 4: 3 W/CW; and group 5: 3 W/100 Hz. Laser energy was applied with helicoid movements (parallel to the canal walls) for 20 sec. Eight additional teeth for each group were endodontically prepared and split longitudinally and irradiation was applied perpendicularly to the root surface. Results: Statistical analysis showed no difference between the root canal thirds irradiated with the 980-nm diode laser, and similar results between the parameters 1.5 W/CW and 3 W/100 Hz (p > 0.05). Conclusion: When considering different output powers and delivery modes our results showed that changes varied from smear layer removal to dentine fusion.
Resumo:
Mycoplasma suis, the causative agent of porcine infectious anemia, has never been cultured in vitro and mechanisms by which it causes disease are poorly understood. Thus, the objective herein was to use whole genome sequencing and analysis of M. suis to define pathogenicity mechanisms and biochemical pathways. M. suis was harvested from the blood of an experimentally infected pig. Following DNA extraction and construction of a paired end library, whole-genome sequencing was performed using GS-FLX (454) and Titanium chemistry. Reads on paired-end constructs were assembled using GS De Novo Assembler and gaps closed by primer walking; assembly was validated by PFGE. Glimmer and Manatee Annotation Engine were used to predict and annotate protein-coding sequences (CDS). The M. suis genome consists of a single, 742,431 bp chromosome with low G+C content of 31.1%. A total of 844 CDS, 3 single copies, unlinked rRNA genes and 32 tRNAs were identified. Gene homologies and GC skew graph show that M. suis has a typical Mollicutes oriC. The predicted metabolic pathway is concise, showing evidence of adaptation to blood environment. M. suis is a glycolytic species, obtaining energy through sugars fermentation and ATP-synthase. The pentose-phosphate pathway, metabolism of cofactors and vitamins, pyruvate dehydrogenase and NAD(+) kinase are missing. Thus, ribose, NADH, NADPH and coenzyme A are possibly essential for its growth. M. suis can generate purines from hypoxanthine, which is secreted by RBCs, and cytidine nucleotides from uracil. Toxins orthologs were not identified. We suggest that M. suis may cause disease by scavenging and competing for host nutrients, leading to decreased life-span of RBCs. In summary, genome analysis shows that M. suis is dependent on host cell metabolism and this characteristic is likely to be linked to its pathogenicity. The prediction of essential nutrients will aid the development of in vitro cultivation systems.
Resumo:
The extracts from the root, bark and seed of Garcinia kola are currently used in traditional medicine in Nigeria. The aim of this study was to evaluate the inhibitory activity of crude extracts of G. kola on Fusobacterium nucleatum isolated from the oral cavity. Methanol and aqueous extracts were prepared from the seed and the minimal inhibitory concentration was evaluated by the agar dilution method, using a Wilkins-Chalgren agar supplemented with horse blood (5%), hemin (5 mu g/ml) and menadione (1 mu g/ml). Antimicrobial activity of plant extracts on microbial biofilms was determined in microtiter plates. The seed of G. kola demonstrated significant inhibitory action on F. nucleatum isolates at a concentration of 1.25 and 12.5 mg/ml for amoxicillin resistant strain. It was able to inhibit the microbial biofilm formed by the association of F. nucleatum with Porphyromonas gingivalis ATCC 33277, Aggregatibacter actinomycetemcomitans ATCC 33384 and Prevotella intermedia ATCC 2564 at a concentration of 25 mg/ml. The in-vitro inhibitory effect of G. kola on F. nucleatum population suggests a potential role for its use in oral hygiene.
Resumo:
This article evaluates social implications of the ""SIGA"" Health Care Information System (HIS) in a public health care organization in the city of Sao Paulo. The evaluation was performed by means of an in-depth case study with patients and staff of a public health care organization, using qualitative and quantitative data. On the one hand, the system had consequences perceived as positive such as improved convenience and democratization of specialized treatment for patients and improvements in work organization. On the other hand, negative outcomes were reported, like difficulties faced by employees due to little familiarity with IT and an increase in the time needed to schedule appointments. Results show the ambiguity of the implications of HIS in developing countries, emphasizing the need for a more nuanced view of the evaluation of failures and successes and the importance of social contextual factors.
Resumo:
Gas aggregation is a well known method used to produce clusters of different materials with good size control, reduced dispersion, and precise stoichiometry. The cost of these systems is relatively high and they are generally dedicated apparatuses. Furthermore, the usual sample production speed of these systems is not as fast as physical vapor deposition devices posing a problem when thick samples are needed. In this paper we describe the development of a multipurpose gas aggregation system constructed as an adaptation to a magnetron sputtering system. The cost of this adaptation is negligible and its installation and operation are both remarkably simple. The gas flow for flux in the range of 60-130 SCCM (SCCM denotes cubic centimeter per minute at STP) is able to completely collimate all the sputtered material, producing spherical nanoparticles. Co nanoparticles were produced and characterized using electron microscopy techniques and Rutherford back-scattering analysis. The size of the particles is around 10 nm with around 75 nm/min of deposition rate at the center of a Gaussian profile nanoparticle beam.
Resumo:
We investigate a conjecture on the cover times of planar graphs by means of large Monte Carlo simulations. The conjecture states that the cover time tau (G(N)) of a planar graph G(N) of N vertices and maximal degree d is lower bounded by tau (G(N)) >= C(d)N(lnN)(2) with C(d) = (d/4 pi) tan(pi/d), with equality holding for some geometries. We tested this conjecture on the regular honeycomb (d = 3), regular square (d = 4), regular elongated triangular (d = 5), and regular triangular (d = 6) lattices, as well as on the nonregular Union Jack lattice (d(min) = 4, d(max) = 8). Indeed, the Monte Carlo data suggest that the rigorous lower bound may hold as an equality for most of these lattices, with an interesting issue in the case of the Union Jack lattice. The data for the honeycomb lattice, however, violate the bound with the conjectured constant. The empirical probability distribution function of the cover time for the square lattice is also briefly presented, since very little is known about cover time probability distribution functions in general.
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:
With each directed acyclic graph (this includes some D-dimensional lattices) one can associate some Abelian algebras that we call directed Abelian algebras (DAAs). On each site of the graph one attaches a generator of the algebra. These algebras depend on several parameters and are semisimple. Using any DAA, one can define a family of Hamiltonians which give the continuous time evolution of a stochastic process. The calculation of the spectra and ground-state wave functions (stationary state probability distributions) is an easy algebraic exercise. If one considers D-dimensional lattices and chooses Hamiltonians linear in the generators, in finite-size scaling the Hamiltonian spectrum is gapless with a critical dynamic exponent z=D. One possible application of the DAA is to sandpile models. In the paper we present this application, considering one- and two-dimensional lattices. In the one-dimensional case, when the DAA conserves the number of particles, the avalanches belong to the random walker universality class (critical exponent sigma(tau)=3/2). We study the local density of particles inside large avalanches, showing a depletion of particles at the source of the avalanche and an enrichment at its end. In two dimensions we did extensive Monte-Carlo simulations and found sigma(tau)=1.780 +/- 0.005.
Resumo:
In the crystal of the title compound, C(17)H(16)N(2), molecules are linked by C-H center dot center dot center dot N hydrogen bonds, forming rings of graph-set motifs R(2)(1) (6) and R(2)(2) (10). The title molecule is close to planar, with a dihedral angle between the aromatic rings of 0.6 (1)degrees. Torsion angles confirm a conformational trans structure.
Resumo:
In the title compound, C10H6ClNO2, the dihedral angle between the benzene and maleimide rings is 47.54 (9)degrees. Molecules form centrosymmetric dimers through C-H center dot center dot center dot O hydrogen bonds, resulting in rings of graph- set motif R2 2(8) and chains in the [100] direction. Molecules are also linked by C-H center dot center dot center dot Cl hydrogen bonds along [001]. In this same direction, molecules are connected to other neighbouring molecules by C-H center dot center dot center dot O hydrogen bonds, forming edge- fused R-4(4)(24) rings.
Resumo:
A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-restricted ratio is the infimum, over simple planar graphs H, of the ratio of the number of edges in a maximum k-restricted structure subgraph of H to the number edges of H. We prove that, as k tends to infinity, the planar k-restricted ratio tends to 1/2. The same result holds for the weighted version. Our results are based on analyzing the analogous ratios for outerplanar and weighted outerplanar graphs. Here both ratios tend to 1 as k goes to infinity, and we provide good estimates of the rates of convergence, showing that they differ in the weighted from the unweighted case.
Resumo:
An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).
Resumo:
Efficient automatic protein classification is of central importance in genomic annotation. As an independent way to check the reliability of the classification, we propose a statistical approach to test if two sets of protein domain sequences coming from two families of the Pfam database are significantly different. We model protein sequences as realizations of Variable Length Markov Chains (VLMC) and we use the context trees as a signature of each protein family. Our approach is based on a Kolmogorov-Smirnov-type goodness-of-fit test proposed by Balding et at. [Limit theorems for sequences of random trees (2008), DOI: 10.1007/s11749-008-0092-z]. The test statistic is a supremum over the space of trees of a function of the two samples; its computation grows, in principle, exponentially fast with the maximal number of nodes of the potential trees. We show how to transform this problem into a max-flow over a related graph which can be solved using a Ford-Fulkerson algorithm in polynomial time on that number. We apply the test to 10 randomly chosen protein domain families from the seed of Pfam-A database (high quality, manually curated families). The test shows that the distributions of context trees coming from different families are significantly different. We emphasize that this is a novel mathematical approach to validate the automatic clustering of sequences in any context. We also study the performance of the test via simulations on Galton-Watson related processes.
Resumo:
Consider a discrete locally finite subset Gamma of R(d) and the cornplete graph (Gamma, E), with vertices Gamma and edges E. We consider Gibbs measures on the set of sub-graphs with vertices Gamma and edges E` subset of E. The Gibbs interaction acts between open edges having a vertex in common. We study percolation properties of the Gibbs distribution of the graph ensemble. The main results concern percolation properties of the open edges in two cases: (a) when Gamma is sampled from a homogeneous Poisson process; and (b) for a fixed Gamma with sufficiently sparse points. (c) 2010 American Institute of Physics. [doi:10.1063/1.3514605]