SEM analysis of enamel surface treated by Er : YAG laser: Influence of irradiation distance

Background: Depending on the distance of laser tip to dental surface a specific morphological pattern should be expected. However, there have been limited reports that correlate the Er:YAG irradiation distance with dental morphology. Purpose: To assess the influence of Er:YAG laser irradiation distance on enamel morphology, by means of scanning electron microscopy (SEM). Methods: Sixty human third molars were employed to obtain discs (congruent to 1 mm thick) that were randomly assigned to six groups (n = 10). Five groups received Er:YAG laser irradiation (80 mJ/2 Hz) for 20 s, according to the irradiation distance: 11, 12, 14, 16, or 17 mm. and the control group was treated with 37% phosphoric acid for 15 s. The laser-irradiated discs were bisected. One hemi-disc was separated for superficial analysis without subsequent acid etching, and the other one, received the phosphoric acid for 15 s. Samples were prepared for SEM. Results: Laser irradiation at 11 and 12 min provided an evident ablation of enamel, with evident fissures and some fused areas. At 14, 16 and 17 mm the superficial topography was flatter than in the other distances. The subsequent acid etching on the lased-surface partially removed the disorganized tissue. Conclusions: Er:YAG laser in defocused mode promoted slight morphological alterations and seems more suitable for enamel conditioning than focused irradiation. The application of phosphoric acid on lased-enamel surface, regardless of the irradiation distance, decreased the superficial irregularities.

Shear strength of the bond to primary dentin: influence of Er:YAG laser irradiation distance

The aim of this study was to assess in vitro the influence of Er:YAG laser irradiation distance on the shear strength of the bond between an adhesive restorative system and primary dentin. A total of 60 crowns of primary molars were embedded in acrylic resin and mechanically ground to expose a flat dentin surface and were randomly assigned to six groups (n = 10). The control group was etched with 37% phosphoric acid. The remaining five groups were irradiated (80 mJ, 2 Hz) at different irradiation distances (11, 12, 16, 17 and 20 mm), followed by acid etching. An adhesive agent (Single Bond) was applied to the bonding sites, and resin cylinders (Filtek Z250) were prepared. The shear bond strength tests were performed in a universal testing machine (0.5 mm/min). Data were submitted to statistical analysis using one-way ANOVA and the Kruskal-Wallis test (p < 0.05). The mean shear bond strengths were: 7.32 +/- 3.83, 5.07 +/- 2.62, 6.49 +/- 1.64, 7.71 +/- 0.66, 7.33 +/- 0.02, and 9.65 +/- 2.41 MPa in the control group and the groups irradiated at 11, 12, 16, 17, and 20 mm, respectively. The differences between the bond strengths in groups II and IV and between the bond strengths in groups II and VI were statistically significant (p < 0.05). Increasing the laser irradiation distance resulted in increasing shear strength of the bond to primary dentin.

Craniometric Similarities Within and Between Human Populations in Comparison with Neutral Genetic Data

The statement that pairs of individuals from different populations are often more genetically similar than pairs from the same population is a widespread idea inside and outside the scientific community. Witherspoon et al. [""Genetic similarities within and between human populations,"" Genetics 176:351-359 (2007)] proposed an index called the dissimilarity fraction (omega) to access in a quantitative way the validity of this statement for genetic systems. Witherspoon demonstrated that, as the number of loci increases, omega decreases to a point where, when enough sampling is available, the statement is false. In this study, we applied the dissimilarity fraction to Howells`s craniometric database to establish whether or not similar results are obtained for cranial morphological traits. Although in genetic studies thousands of loci are available, Howells`s database provides no more than 55 metric traits, making the contribution of each variable important. To cope with this limitation, we developed a routine that takes this effect into consideration when calculating. omega Contrary to what was observed for the genetic data, our results show that cranial morphology asymptotically approaches a mean omega of 0.3 and therefore supports the initial statement-that is, that individuals from the same geographic region do not form clear and discrete clusters-further questioning the idea of the existence of discrete biological clusters in the human species. Finally, by assuming that cranial morphology is under an additive polygenetic model, we can say that the population history signal of human craniometric traits presents the same resolution as a neutral genetic system dependent on no more than 20 loci.

Relation of genetic phylogeny and geographical distance of tick-borne encephalitis virus in central Europe

Tick-borne encephalitis virus (TBEV) is the most important arboviral agent causing disease of the central nervous system in central Europe. In this study, 61 TBEV E gene sequences derived from 48 isolates from the Czech Republic, and four isolates and nine TBEV strains detected in ticks from Germany, covering more than half a century from 1954 to 2009, were sequenced and subjected to phylogenetic and Bayesian phylodynamic analysis to determine the phylogeography of TBEV in central Europe. The general Eurasian continental east-to-west pattern of the spread of TBEV was confirmed at the regional level but is interlaced with spreading that arises because of local geography and anthropogenic influence. This spread is reflected by the disease pattern in the Czech Republic that has been observed since 1991. The overall evolutionary rate was estimated to be approximately 8x10(-4) substitutions per nucleotide per year. The analysis of the TBEV E genes of 11 strains isolated at one natural focus in Zd`ar Kaplice proved for the first time that TBEV is indeed subject to local evolution.

Reduced frequency of CD4(+)CD25(HIGH)FOXP3(+) cells and diminished FOXP3 expression in patients with Common Variable Immunodeficiency: A link to autoimmunity?

Common Variable Immunodeficiency (CVID) is a primary immunodeficiency disease characterized by defective immunoglobulin production and often associated with autoimmunity. We used flow cytometry to analyze CD4(+)CD25(HIGH)FOXP3(+) T regulatory (Treg) cells and ask whether perturbations in their frequency in peripheral blood could underlie the high incidence of autoimmune disorders in CVID patients. In this study, we report for the first time that CVID patients with autoimmune disease have a significantly reduced frequency of CD4(+)CD25(HIGH)FOXP3(+) cells in their peripheral blood accompanied by a decreased intensity of FOXP3 expression. Notably, although CVID patients in whom autoimmunity was not diagnosed had a reduced frequency of CD4(+)CD25(HIGH)FOXP3(+) cells, FOXP3 expression levels did not differ from those in healthy controls. In conclusion, these data suggest compromised homeostasis of CD4(+)CD25(HIGH)FOXP3(+) cells in a subset of CVID patients with autoimmunity, and may implicate Treg cells in pathological mechanisms of CVID. (C) 2009 Elsevier Inc. All rights reserved.

Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.

Efficient bulk-loading on dynamic metric access methods

This paper presents a new technique and two algorithms to bulk-load data into multi-way dynamic metric access methods, based on the covering radius of representative elements employed to organize data in hierarchical data structures. The proposed algorithms are sample-based, and they always build a valid and height-balanced tree. We compare the proposed algorithm with existing ones, showing the behavior to bulk-load data into the Slim-tree metric access method. After having identified the worst case of our first algorithm, we describe adequate counteractions in an elegant way creating the second algorithm. Experiments performed to evaluate their performance show that our bulk-loading methods build trees faster than the sequential insertion method regarding construction time, and that it also significantly improves search performance. (C) 2009 Elsevier B.V. All rights reserved.

Least square projection: A fast high-precision multidimensional projection technique and its application to document mapping

The problem of projecting multidimensional data into lower dimensions has been pursued by many researchers due to its potential application to data analyses of various kinds. This paper presents a novel multidimensional projection technique based on least square approximations. The approximations compute the coordinates of a set of projected points based on the coordinates of a reduced number of control points with defined geometry. We name the technique Least Square Projections ( LSP). From an initial projection of the control points, LSP defines the positioning of their neighboring points through a numerical solution that aims at preserving a similarity relationship between the points given by a metric in mD. In order to perform the projection, a small number of distance calculations are necessary, and no repositioning of the points is required to obtain a final solution with satisfactory precision. The results show the capability of the technique to form groups of points by degree of similarity in 2D. We illustrate that capability through its application to mapping collections of textual documents from varied sources, a strategic yet difficult application. LSP is faster and more accurate than other existing high-quality methods, particularly where it was mostly tested, that is, for mapping text sets.

Distinguishing links up to link-homotopy by algebraic methods

In this paper we provide a complete algebraic invariant of link-homotopy, that is, an algebraic invariant that distinguishes two links if and only if they are link-homotopic. The paper establishes a connection between the ""peripheral structures"" approach to link-homotopy taken by Milnor, Levine and others, and the string link action approach taken by Habegger and Lin. (C) 2009 Elsevier B.V. All rights reserved.

Benders, metric and cutset inequalities for multicommodity capacitated network design

Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we compare three sets of inequalities that have been widely used in this context: Benders, metric and cutset inequalities. We show that Benders inequalities associated to extreme rays are metric inequalities. We also show how to strengthen Benders inequalities associated to non-extreme rays to obtain metric inequalities. We show that cutset inequalities are Benders inequalities, but not necessarily metric inequalities. We give a necessary and sufficient condition for a cutset inequality to be a metric inequality. Computational experiments show the effectiveness of strengthening Benders and cutset inequalities to obtain metric inequalities.

Percolation in a network with long-range connections: Implications for cytoskeletal structure and function

Cell shape, signaling, and integrity depend on cytoskeletal organization. In this study we describe the cytoskeleton as a simple network of filamentary proteins (links) anchored by complex protein structures (nodes). The structure of this network is regulated by a distance-dependent probability of link formation as P = p/d(s), where p regulates the network density and s controls how fast the probability for link formation decays with node distance (d). It was previously shown that the regulation of the link lengths is crucial for the mechanical behavior of the cells. Here we examined the ability of the two-dimensional network to percolate (i.e. to have end-to-end connectivity), and found that the percolation threshold depends strongly on s. The system undergoes a transition around s = 2. The percolation threshold of networks with s < 2 decreases with increasing system size L, while the percolation threshold for networks with s > 2 converges to a finite value. We speculate that s < 2 may represent a condition in which cells can accommodate deformation while still preserving their mechanical integrity. Additionally, we measured the length distribution of F-actin filaments from publicly available images of a variety of cell types. In agreement with model predictions, cells originating from more deformable tissues show longer F-actin cytoskeletal filaments. (C) 2008 Elsevier B.V. All rights reserved.

The link between partial melting, granitization and granulite development in central Ribeira Fold Belt, SE Brazil: New evidence from elemental and Sr-Nd isotopic geochemistry

Elemental and Sr-Nd isotopic data on metatexites, diatexites, orthogneisses and charnockites from the central Ribeira Fold Belt indicate that they are LILE-enriched weakly peraluminous granodiorites. Harker and Th-Hf-La correlation trends suggest that these rocks represent a co-genetic sequence, whereas variations on CaO, MnO, Y and HREE for charnockites can be explained by garnet consumption during granulitic metamorphism. Similar REE patterns and isotopic results of epsilon(565)(Nd) = -5.4 to -7.3 and (87)Sr/(86)Sr(565) = 0.706-0.711 for metatexites, diatexites, orthogneisses and charnockites, as well as similar T(DM) ages between 2.0 and 1.5 Ga are consistent with evolution from a relatively homogeneous and enriched common crustal (metasedimentary) protolith. Results suggest a genetic link between metatexites, diatexites, orthogneisses and charnockites and a two-step process for charnockite development: (a) generation of the hydrated igneous protoliths by anatexis of metasedimentary rocks; (b) continuous high-grade metamorphism that transformed the ""S-type granitoids"" (leucosomes and diatexites) into orthogneisses and, as metamorphism and dehydration progressed, into charnockites. (C) 2011 Elsevier Ltd. All rights reserved.

SRTM resample with short distance-low nugget kriging

The shuttle radar topography mission (SRTM), was flow on the space shuttle Endeavour in February 2000, with the objective of acquiring a digital elevation model of all land between 60 degrees north latitude and 56 degrees south latitude, using interferometric synthetic aperture radar (InSAR) techniques. The SRTM data are distributed at horizontal resolution of 1 arc-second (similar to 30m) for areas within the USA and at 3 arc-second (similar to 90m) resolution for the rest of the world. A resolution of 90m can be considered suitable for the small or medium-scale analysis, but it is too coarse for more detailed purposes. One alternative is to interpolate the SRTM data at a finer resolution; it will not increase the level of detail of the original digital elevation model (DEM), but it will lead to a surface where there is the coherence of angular properties (i.e. slope, aspect) between neighbouring pixels, which is an important characteristic when dealing with terrain analysis. This work intents to show how the proper adjustment of variogram and kriging parameters, namely the nugget effect and the maximum distance within which values are used in interpolation, can be set to achieve quality results on resampling SRTM data from 3"" to 1"". We present for a test area in western USA, which includes different adjustment schemes (changes in nugget effect value and in the interpolation radius) and comparisons with the original 1"" model of the area, with the national elevation dataset (NED) DEMs, and with other interpolation methods (splines and inverse distance weighted (IDW)). The basic concepts for using kriging to resample terrain data are: (i) working only with the immediate neighbourhood of the predicted point, due to the high spatial correlation of the topographic surface and omnidirectional behaviour of variogram in short distances; (ii) adding a very small random variation to the coordinates of the points prior to interpolation, to avoid punctual artifacts generated by predicted points with the same location than original data points and; (iii) using a small value of nugget effect, to avoid smoothing that can obliterate terrain features. Drainages derived from the surfaces interpolated by kriging and by splines have a good agreement with streams derived from the 1"" NED, with correct identification of watersheds, even though a few differences occur in the positions of some rivers in flat areas. Although the 1"" surfaces resampled by kriging and splines are very similar, we consider the results produced by kriging as superior, since the spline-interpolated surface still presented some noise and linear artifacts, which were removed by kriging.

Perfect Simulation of a Coupling Achieving the (d)over-bar-distance Between Ordered Pairs of Binary Chains of Infinite Order

We explicitly construct a stationary coupling attaining Ornstein`s (d) over bar -distance between ordered pairs of binary chains of infinite order. Our main tool is a representation of the transition probabilities of the coupled bivariate chain of infinite order as a countable mixture of Markov transition probabilities of increasing order. Under suitable conditions on the loss of memory of the chains, this representation implies that the coupled chain can be represented as a concatenation of i.i.d. sequences of bivariate finite random strings of symbols. The perfect simulation algorithm is based on the fact that we can identify the first regeneration point to the left of the origin almost surely.

Limit theorems for sequences of random trees

We consider a random tree and introduce a metric in the space of trees to define the ""mean tree"" as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and central limit theorems for sequence of independent identically distributed random trees. As application we propose tests to check if two samples of random trees have the same law.