Tumor necrosis factor-alpha-308G/A single nucleotide polymorphism and red-complex periodontopathogens are independently associated with increased levels of tumor necrosis factor-alpha in diseased periodontal tissues

Background and Objective: Inflammatory cytokines such as tumor necrosis factor-alpha are involved in the pathogenesis of periodontal diseases. A high between-subject variation in the level of tumor necrosis factor-alpha mRNA has been verified, which may be a result of genetic polymorphisms and/or the presence of periodontopathogens such as Porphyromonas gingivalis, Tannerella forsythia, Treponema denticola (called the red complex) and Aggregatibacter actinomycetemcomitans. In this study, we investigated the effect of the tumor necrosis factor-alpha (TNFA) -308G/A gene polymorphism and of periodontopathogens on the tumor necrosis factor-alpha levels in the periodontal tissues of nonsmoking patients with chronic periodontitis (n = 127) and in control subjects (n = 177). Material and Methods: The TNFA-308G/A single nucleotide polymorphism was investigated using polymerase chain reaction-restriction fragment length polymorphism analysis, whereas the tumor necrosis factor-alpha levels and the periodontopathogen load were determined using real-time polymerase chain reaction. Results: No statistically significant differences were found in the frequency of the TNFA-308 single nucleotide polymorphism in control and chronic periodontitis groups, in spite of the higher frequency of the A allele in the chronic periodontitis group. The concomitant analyses of genotypes and periodontopathogens demonstrated that TNFA-308 GA/AA genotypes and the red-complex periodontopathogens were independently associated with increased levels of tumor necrosis factor-alpha in periodontal tissues, and no additive effect was seen when both factors were present. P. gingivalis, T. forsythia and T. denticola counts were positively correlated with the level of tumor necrosis factor-alpha. TNFA-308 genotypes were not associated with the periodontopathogen detection odds or with the bacterial load. Conclusion: Our results demonstrate that the TNFA-308 A allele and red-complex periodontopathogens are independently associated with increased levels of tumor necrosis factor-alpha in diseased tissues of nonsmoking chronic periodontitis patients and consequently are potentially involved in determining the disease outcome.

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.

C(k)-solvability near the characteristic set for a class of planar complex vector fields of infinite type

This paper deals with semi-global C(k)-solvability of complex vector fields of the form L = partial derivative/partial derivative t + x(r) (a(x) + ib(x))partial derivative/partial derivative x, r >= 1, defined on Omega(epsilon) = (-epsilon, epsilon) x S(1), epsilon > 0, where a and b are C(infinity) real-valued functions in (-epsilon, epsilon). It is shown that the interplay between the order of vanishing of the functions a and b at x = 0 influences the C(k)-solvability at Sigma = {0} x S(1). When r = 1, it is permitted that the functions a and b of L depend on the x and t variables, that is, L = partial derivative/partial derivative t + x(a(x, t) + ib(x, t))partial derivative/partial derivative x, where (x, t) is an element of Omega(epsilon).

Nonexistence of global solutions for a class of complex vector fields on two-torus

The goal of this paper is study the global solvability of a class of complex vector fields of the special form L = partial derivative/partial derivative t + (a + ib)(x)partial derivative/partial derivative x, a, b epsilon C(infinity) (S(1) ; R), defined on two-torus T(2) congruent to R(2)/2 pi Z(2). The kernel of transpose operator L is described and the solvability near the characteristic set is also studied. (c) 2008 Elsevier Inc. All rights reserved.

Gevrey solvability near the characteristic set for a class of planar complex vector fields of infinite type

We study the Gevrey solvability of a class of complex vector fields, defined on Omega(epsilon) = (-epsilon, epsilon) x S(1), given by L = partial derivative/partial derivative t + (a(x) + ib(x))partial derivative/partial derivative x, b not equivalent to 0, near the characteristic set Sigma = {0} x S(1). We show that the interplay between the order of vanishing of the functions a and b at x = 0 plays a role in the Gevrey solvability. (C) 2008 Elsevier Inc. All rights reserved.

The competing roles of extensional viscosity and normal stress differences in complex flows of elastic liquids

In various attempts to relate the behaviour of highly-elastic liquids in complex flows to their rheometrical behaviour, obvious candidates for study have been the variation of shear viscosity with shear rate, the two normal stress differences N(1) and N(2) especially N(1), and the extensional viscosity eta(E). In this paper, we shall be mainly interested in `constant-viscosity` Boger fluids, and, accordingly, we shall limit attention to N(1) and eta(E). We shall concentrate on two important flows - axisymmetric contraction flow and ""splashing"" (particularly that which arises when a liquid drop falls onto the free Surface of the same liquid). Modem numerical techniques are employed to provide the theoretical predictions. It is shown that the two obvious manifestations of viscoelastic rheometrical behaviour can sometimes be opposing influences in determining flow characteristics. Specifically, in an axisymmetric contraction flow, high eta(E) , can retard the flow, whereas high N(1) can have the opposite effect. In the splashing experiment, high eta(E) can certainly reduce the height of the so-called Worthington jet, thus confirming some early suggestions, but, again, other rheometrical influences can also have a role to play and the overall picture may not be as clear as it was once envisaged.

How complex a dynamical network can be?

Positive Lyapunov exponents measure the asymptotic exponential divergence of nearby trajectories of a dynamical system. Not only they quantify how chaotic a dynamical system is, but since their sum is an upper bound for the rate of information production, they also provide a convenient way to quantify the complexity of a dynamical network. We conjecture based on numerical evidences that for a large class of dynamical networks composed by equal nodes, the sum of the positive Lyapunov exponents is bounded by the sum of all the positive Lyapunov exponents of both the synchronization manifold and its transversal directions, the last quantity being in principle easier to compute than the latter. As applications of our conjecture we: (i) show that a dynamical network composed of equal nodes and whose nodes are fully linearly connected produces more information than similar networks but whose nodes are connected with any other possible connecting topology; (ii) show how one can calculate upper bounds for the information production of realistic networks whose nodes have parameter mismatches, randomly chosen: (iii) discuss how to predict the behavior of a large dynamical network by knowing the information provided by a system composed of only two coupled nodes. (C) 2011 Elsevier B.V. All rights reserved.

Confinement and surface effects in B and P doping of silicon nanowires

Several experimental groups have achieved effective n- and p-type doping of silicon nanowires (SiNWs). However, theoretical analyses on ultrathin SiNWs suggest that dopants tend to segregate to their surfaces, where they would combine with defects such as dangling bonds (DB), becoming electronically inactive. Using fully ab initio calculations, we show that the differences in formation energies among surface and core substitutional sites decrease rapidly as the diameters of the wires increase, indicating that the dopants will be uniformly distributed. Moreover, occurrence of the electronically inactive impurity/DB complex rapidly becomes less frequent for NWs of larger diameters. We also show that the high confinement in the ultrathin SiNWs causes the impurity levels to be deeper than in the silicon bulk, but our results indicate that for NWs of diameters larger than approximately 3 nm the impurity levels recover bulk characteristics. Finally, we show that different surfaces will lead to different dopant properties in the gap.

Shape classification using complex network and Multi-scale Fractal Dimension

Shape provides one of the most relevant information about an object. This makes shape one of the most important visual attributes used to characterize objects. This paper introduces a novel approach for shape characterization, which combines modeling shape into a complex network and the analysis of its complexity in a dynamic evolution context. Descriptors computed through this approach show to be efficient in shape characterization, incorporating many characteristics, such as scale and rotation invariant. Experiments using two different shape databases (an artificial shapes database and a leaf shape database) are presented in order to evaluate the method. and its results are compared to traditional shape analysis methods found in literature. (C) 2009 Published by Elsevier B.V.

On the efficiency of data representation on the modeling and characterization of complex networks

Specific choices about how to represent complex networks can have a substantial impact on the execution time required for the respective construction and analysis of those structures. In this work we report a comparison of the effects of representing complex networks statically by adjacency matrices or dynamically by adjacency lists. Three theoretical models of complex networks are considered: two types of Erdos-Renyi as well as the Barabasi-Albert model. We investigated the effect of the different representations with respect to the construction and measurement of several topological properties (i.e. degree, clustering coefficient, shortest path length, and betweenness centrality). We found that different forms of representation generally have a substantial effect on the execution time, with the sparse representation frequently resulting in remarkably superior performance. (C) 2011 Elsevier B.V. All rights reserved.

Accessibility in complex networks

This Letter describes a method for the quantification of the diversity of non-linear dynamics in complex networks as a consequence of self-avoiding random walks. The methodology is analyzed in the context of theoretical models and illustrated with respect to the characterization of the accessibility in urban streets. (C) 2008 Elsevier B.V. All rights reserved.

Concentric characterization and classification of complex network nodes: Application to an institutional collaboration network

Differently from theoretical scale-free networks, most real networks present multi-scale behavior, with nodes structured in different types of functional groups and communities. While the majority of approaches for classification of nodes in a complex network has relied on local measurements of the topology/connectivity around each node, valuable information about node functionality can be obtained by concentric (or hierarchical) measurements. This paper extends previous methodologies based on concentric measurements, by studying the possibility of using agglomerative clustering methods, in order to obtain a set of functional groups of nodes, considering particular institutional collaboration network nodes, including various known communities (departments of the University of Sao Paulo). Among the interesting obtained findings, we emphasize the scale-free nature of the network obtained, as well as identification of different patterns of authorship emerging from different areas (e.g. human and exact sciences). Another interesting result concerns the relatively uniform distribution of hubs along concentric levels, contrariwise to the non-uniform pattern found in theoretical scale-free networks such as the BA model. (C) 2008 Elsevier B.V. All rights reserved.

Using metrics from complex networks to evaluate machine translation

Establishing metrics to assess machine translation (MT) systems automatically is now crucial owing to the widespread use of MT over the web. In this study we show that such evaluation can be done by modeling text as complex networks. Specifically, we extend our previous work by employing additional metrics of complex networks, whose results were used as input for machine learning methods and allowed MT texts of distinct qualities to be distinguished. Also shown is that the node-to-node mapping between source and target texts (English-Portuguese and Spanish-Portuguese pairs) can be improved by adding further hierarchical levels for the metrics out-degree, in-degree, hierarchical common degree, cluster coefficient, inter-ring degree, intra-ring degree and convergence ratio. The results presented here amount to a proof-of-principle that the possible capturing of a wider context with the hierarchical levels may be combined with machine learning methods to yield an approach for assessing the quality of MT systems. (C) 2010 Elsevier B.V. All rights reserved.

Characterizing topological and dynamical properties of complex networks without border effects

The properties of complex networks are highly Influenced by border effects frequently found as a consequence of the finite nature of real-world networks as well as network Sampling Therefore, it becomes critical to devise effective means for sound estimation of net work topological and dynamical properties will le avoiding these types of artifacts. In the current work, an algorithm for minimization of border effects is proposed and discussed, and its potential IS Illustrated with respect to two real-world networks. namely bone canals and air transportation (C) 2009 Elsevier B.V. All rights reserved.

Synthesis and structural characterization of a new polymeric zinc(II) complex with thiophene-2-carboxylic acid

A new polymeric zinc(II) complex with thiophene-2-carboxylic acid (-tpc) of composition [Zn2(C20H12O8S4)]n was obtained and structurally characterized by X-ray diffraction, thermal analysis, nuclear magnetic resonance (NMR), and infrared spectroscopies. Upfield shift in the 1H-NMR spectrum is explained by the crystalline structure, which shows the thiophene rings overlapping each other in parallel pairs. The compound crystallizes in the monoclinic system, space group P21/c, with a = 9.7074(4) angstrom, b = 13.5227(3) angstrom, c = 18.9735(7) angstrom, = 95.797(10)degrees, and Z = 4. Three -tpc groups bridge between two Zn(II) ions through oxygens and the fourth one bridges between one of these ions and the third one, symmetry related by a twofold screw axis. This arrangement gives rise to infinite chains along the crystallographic a direction. The metal atoms display an approximate tetrahedral configuration. The complex is insoluble in water, ethanol, and acetone, but soluble in dimethyl sulfoxide.