Light cola drink is less erosive than the regular one: An in situ/ex vivo study

Objective: This in situ/ex vivo study assessed the erosive potential of a light cola drink when compared to a regular one. Methods: During 2 experimental 14-days crossover phases, eight volunteers wore palatal devices with 2 human enamel blocks. The groups under study were: group light, erosive challenge with light cola drink and group regular, erosive challenge with regular cola drink. During 14 days, erosive challenges were performed extraorally 3X/day. In each challenge, the device was immersed in 150 ml of light cola (group light) or regular cola (group regular) for 5 min. Erosion was analysed by surface profilometry (mu m) and surface microhardness change (%SMH). The data were statistically analyzed using paired t test (p<0.05). Results: Group light (0.6 +/- 0.2 mu m) showed significantly lesser wear than group regular (3.1 +/- 1.0 mu m). There was no significant difference between the groups for the %SMH (group light -63.9 +/- 13.9 and group regular -78.5 +/- 12.7). Conclusions: The data suggest that the light cola drink is less erosive than the regular one. (C) 2008 Elsevier Ltd. All rights reserved.

An in situ/ex vivo comparison of the ability of regular and light colas to induce enamel wear when erosion is combined with abrasion

Objective: To evaluate whether the type of cola drink (regular or diet) could influence the wear of enamel subjected to erosion followed by brushing abrasion, Method and !Materials: Ten volunteers wore intraoral devices that each had eight bovine enamel blocks divided into four groups; ER, erosion with regular cola; EAR, erosion with regular cola plus abrasion; EL, erosion with light cola; and EAL, erosion with light cola plus abrasion, Each day for 1 week, half of each device was immersed in regular cola for 5 minutes, Then, two blocks were brushed using a fluoridated toothpaste and electric toothbrush for 30 seconds four times daily, Immediately after, the other half of the device was subjected to the same procedure using a light cola, The pH, calcium, phosphorus, and fluoride concentrations of the colas were analyzed using standard procedures, Enamel alterations were measured by profilometry. Data were tested using two-way ANOVA and Bonferroni test (P < .05), Results: Regarding chemical characteristics, light cola presented pH 3.0, 13.7 mg Ca/L, 15.5 mg P/L, and 0.31 mg F/L, while regular cola had pH 2.6, 32.1 mg Ca/L, 1:8.1 mg P/L, and 0.26 mg F/L, The light cola promoted less enamel loss (EL, 0.36 pm; EAL, 0.39 pm) than its regular counterpart (ER, 0.72 pm; EAR, 0.95 pm) for both conditions, There was not a significant difference (P > .05) between erosion and erosion plus abrasion for light cola, However, for regular cola, erosion plus abrasion resulted in higher enamel loss than erosion alone,.nclusion: The data suggest that light cola promoted less enamel wear even when erosion was followed by brushing abrasion, (Quintessence Int 2011;42:xxx-xx)()

Physical and sensory properties of regular and reduced-fat pound cakes with added amaranth flour

The sum of wheat flour and corn starch was replaced by 10, 20, or 30% whole amaranth flour in both conventional (C) and reduced fat (RF) pound cakes. and the effects on physical and sensory properties of the cakes were investigated. RF presented 33% fat reduction. The increasing amaranth levels darkened crust and crumb of cakes, which decreased color acceptability. Fresh amaranth-containing cakes had similar texture characteristics to (he controls, evaluated both instrumentally and sensorially. Sensory evaluation revealed that replacement by 30% amaranth flour decreased C cakes overall acceptability scores, clue to its lower specific volume and darker color. Amaranth flour levels had no significant effect on overall acceptability of RF cakes. Hence, the sum of wheat flour and corn starch could be successfully replaced by up to 20% amaranth flour in C and up to 30% in RF pound cakes without negatively affecting sensory quality in fresh cakes. Moisture losses for all the cakes were similar, approximate to 1% per day during storage. After six days of storage, both C and RF amaranth-containing cakes had higher hardness and chewiness values than control cakes. Further experiments involving sensory evaluation during storage are necessary to determine the exact limit of amaranth flour replacement.

Upregulation of gp91(phox) Subunit of NAD(P)H Oxidase Contributes to Erectile Dysfunction Caused by Long-term Nitric Oxide Inhibition in Rats: Reversion by Regular Physical Training

OBJECTIVES To test the hypothesis that glyco protein 91phox (gp91(phox)) subunit of nicotinamide adenine dinucleotide phosphate [NAD(P) H] oxidase is a fundamental target for physical activity to ameliorate erectile dysfunction (ED). Vascular risk factors are reported to contribute to ED. Regular physical exercise prevents cardiovascular diseases by increasing nitric oxide (NO) production and/or decreasing NO inactivation. METHODS Male Wistar rats received the NO synthesis inhibitor N(omega)-nitro-L-arginine methyl ester (L-NAME) for 4 weeks, after which animals were submitted to a run training program for another 4 weeks. Erectile functions were evaluated by in vitro cavernosal relaxations and intracavernous pressure measurements. Expressions of gp91(phox) subunit and neuronal nitric oxidase synthase in erectile tissue, as well as superoxide dismutase activity and nitrite/nitrate (NO(x)) levels were determined. RESULTS The in vitro acetylcholine-and electrical field stimulation-induced cavernosal relaxations, as well as the increases in intracavernous pressure were markedly reduced in sedentary rats treated with L-NAME. Run training significantly restored the impaired cavernosal relaxations. No alterations in the neuronal nitric oxidase synthase protein expression (and its variant penile neuronal nitric oxidase synthase) were detected. A reduction of NO(x) levels and superoxide dismutase activity was observed in L-NAME-treated animals, which was significantly reversed by physical training. Gene expression of subunit gp91(phox) was enhanced by approximately 2-fold in erectile tissue of L-NAME-treated rats, and that was restored to basal levels by run training. CONCLUSIONS Our study shows that ED seen after long-term L-NAME treatment is associated with gp91(phox) subunit upregulation and decreased NO bioavailability. Exercise training reverses the increased oxidative stress in NO-deficient rats, ameliorating the ED. UROLOGY 75: 961-967, 2010. (C) 2009 Elsevier Inc.

Texture analysis using graphs generated by deterministic partially self-avoiding walks

Texture is one of the most important visual attributes for image analysis. It has been widely used in image analysis and pattern recognition. A partially self-avoiding deterministic walk has recently been proposed as an approach for texture analysis with promising results. This approach uses walkers (called tourists) to exploit the gray scale image contexts in several levels. Here, we present an approach to generate graphs out of the trajectories produced by the tourist walks. The generated graphs embody important characteristics related to tourist transitivity in the image. Computed from these graphs, the statistical position (degree mean) and dispersion (entropy of two vertices with the same degree) measures are used as texture descriptors. A comparison with traditional texture analysis methods is performed to illustrate the high performance of this novel approach. (C) 2011 Elsevier Ltd. All rights reserved.

Modularity and robustness of bone networks

Cortical bones, essential for mechanical support and structure in many animals, involve a large number of canals organized in intricate fashion. By using state-of-the art image analysis and computer graphics, the 3D reconstruction of a whole bone (phalange) of a young chicken was obtained and represented in terms of a complex network where each canal was associated to an edge and every confluence of three or more canals yielded a respective node. The representation of the bone canal structure as a complex network has allowed several methods to be applied in order to characterize and analyze the canal system organization and the robustness. First, the distribution of the node degrees (i.e. the number of canals connected to each node) confirmed previous indications that bone canal networks follow a power law, and therefore present some highly connected nodes (hubs). The bone network was also found to be partitioned into communities or modules, i.e. groups of nodes which are more intensely connected to one another than with the rest of the network. We verified that each community exhibited distinct topological properties that are possibly linked with their specific function. In order to better understand the organization of the bone network, its resilience to two types of failures (random attack and cascaded failures) was also quantified comparatively to randomized and regular counterparts. The results indicate that the modular structure improves the robustness of the bone network when compared to a regular network with the same average degree and number of nodes. The effects of disease processes (e. g., osteoporosis) and mutations in genes (e.g., BMP4) that occur at the molecular level can now be investigated at the mesoscopic level by using network based approaches.

Structural matching of 2D electrophoresis gels using deformed graphs

2D electrophoresis is a well-known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation and the goal is to perform a differential analysis between pairs of images to study changes in protein content. It is thus necessary to register two images by finding spot correspondences. Although it may seem a simple task, generally, the manual processing of this kind of images is very cumbersome, especially when strong variations between corresponding sets of spots are expected (e.g. strong non-linear deformations and outliers). In order to solve this problem, this paper proposes a new quadratic assignment formulation together with a correspondence estimation algorithm based on graph matching which takes into account the structural information between the detected spots. Each image is represented by a graph and the task is to find a maximum common subgraph. Successful experimental results using real data are presented, including an extensive comparative performance evaluation with ground-truth data. (C) 2010 Elsevier B.V. All rights reserved.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

Let M = (V, E, A) be a mixed graph with vertex set V, edge set E and arc set A. A cycle cover of M is a family C = {C(1), ... , C(k)} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is Sigma(k)(i=1) vertical bar C(i)vertical bar. The minimum cycle cover problem is the following: given a strongly connected mixed graph M without bridges, find a cycle cover of M with weight as small as possible. The Chinese postman problem is: given a strongly connected mixed graph M, find a minimum length closed walk using all edges and arcs of M. These problems are NP-hard. We show that they can be solved in polynomial time if M has bounded tree-width. (C) 2008 Elsevier B.V. All rights reserved.

Algorithms for Maximum Independent Set in Convex Bipartite Graphs

A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v. V, the neighbors of v are consecutive in W. We describe both a sequential and a BSP/CGM algorithm to find a maximum independent set in a convex bipartite graph. The sequential algorithm improves over the running time of the previously known algorithm and the BSP/CGM algorithm is a parallel version of the sequential one. The complexity of the algorithms does not depend on |W|.

Packing triangles in low degree graphs and indifference graphs

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + epsilon, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2(1) (1989) 68-72]. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs. (C) 2007 Elsevier B.V. All rights reserved.

Sparse partition universal graphs for graphs of bounded degree

In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Delta. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N(2-1/Delta)log(1/Delta)N) edges, with N = [B`n] for some constant B` that depends only on Delta. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Delta is O(n(2-1/Delta)log(1/Delta)n) Our approach is based on random graphs; in fact, we show that the classical Erdos-Renyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Delta. The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed. (C) 2011 Elsevier Inc. All rights reserved.

Asymmetric Ramsey Properties of Random Graphs Involving Cliques

Consider the following problem: Forgiven graphs G and F(1),..., F(k), find a coloring of the edges of G with k colors such that G does not contain F; in color i. Rodl and Rucinski studied this problem for the random graph G,,, in the symmetric case when k is fixed and F(1) = ... = F(k) = F. They proved that such a coloring exists asymptotically almost surely (a.a.s.) provided that p <= bn(-beta) for some constants b = b(F,k) and beta = beta(F). This result is essentially best possible because for p >= Bn(-beta), where B = B(F, k) is a large constant, such an edge-coloring does not exist. Kohayakawa and Kreuter conjectured a threshold function n(-beta(F1,..., Fk)) for arbitrary F(1), ..., F(k). In this article we address the case when F(1),..., F(k) are cliques of different sizes and propose an algorithm that a.a.s. finds a valid k-edge-coloring of G(n,p) with p <= bn(-beta) for some constant b = b(F(1),..., F(k)), where beta = beta(F(1),..., F(k)) as conjectured. With a few exceptions, this algorithm also works in the general symmetric case. We also show that there exists a constant B = B(F,,..., Fk) such that for p >= Bn(-beta) the random graph G(n,p) a.a.s. does not have a valid k-edge-coloring provided the so-called KLR-conjecture holds. (C) 2008 Wiley Periodicals, Inc. Random Struct. Alg., 34, 419-453, 2009

The disk-percolation model on graphs

We study a long-range percolation model whose dynamics describe the spreading of an infection on an infinite graph. We obtain a sufficient condition for phase transition and prove all upper bound for the critical parameter of spherically symmetric trees. (C) 2008 Elsevier B.V. All rights reserved.