Periodontal and dental health and oral self-care among adults with diabetes mellitus.

ABSTRACT Bakhshandeh, Soheila. Periodontal and dental health and oral self-care among adults with diabetes mellitus. Department of Oral Public Health, Institute of Dentistry, Faculty of Medicine, University of Helsinki, Helsinki, Finland. 2011. 49 pp. ISBN 978-952-10-7193-5(paperback). The aim of the present study was to assess oral health and treatment needs among Iranian adults with diabetes according to socio-demographic status, oral hygiene, diabetes related factors, and to investigate the relation between these determinants and oral health. Moreover, the effect of an educational oral health promotion intervention on their oral health and periodontal treatment needs was studied. The target population comprised adults with diabetes in Tehran, Iran. 299 dentate patients with diabetes, who were regular attendants to a diabetic clinic, were selected as the study subjects. Data collection was performed through a clinical dental examination and self-administered structured questionnaire. The questionnaire covered information of the subject s social background, medical history, oral health behaviour and smoking. The clinical dental examinations covered the registration of caries experience (DMFT), community periodontal index (CPI) and plaque index (PI). The intervention provided the adults with diabetes dental health education through a booklet. Reduction in periodontal treatment needs one year after the baseline examination was used as the main outcome. A high prevalence of periodontal pockets among the study population was found; 52% of the participants had periodontal pockets with a pocket depth of 4 to 5 mm and 35% had periodontal pockets with pocket depth of 6 mm or more. The mean of the DMFT index was 12.9 (SD=6.1), being dominated by filled teeth (mean 6.5) and missing teeth (mean 5.0). Oral self-care among adults with diabetes was inadequate and poor oral hygiene was observed in more than 80% of the subjects. The educational oral health promotion decreased periodontal treatment needs more in the study groups than in the control group. The poor periodontal health, poor oral hygiene and insufficient oral self-care observed in this study call for oral health promotion among adult with diabetes. An educational intervention showed that it is possible to promote oral health behaviour and to reduce periodontal treatment needs among adults with diabetes. The simplicity of the model used in this study allows it to be integrated to diabetes programmes in particular in countries with a developing health care system.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

A self-assembled, luminescent europium cholate hydrogel: a novel approach towards lanthanide sensitization

We propose a new self-assembly based strategy for the design of novel lanthanide based luminescent materials. In this approach a europium hydrogel is prepared and sensitization is achieved by doping the gel with pyrene in a non-coordinated fashion.

Optimisation problems in wireless sensor networks

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating–dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating–dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs – these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating–dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

Analysing local algorithms in location-aware quasi-unit-disk graphs

A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unit-disk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based on network decompositions guided by a rectangular tiling of the plane. The algorithms are applied to matching, independent set, graph colouring, vertex cover, and dominating set. We also study local algorithms on quasi-UDGs, which are a popular generalisation of UDGs, aimed at more realistic modelling of communication between the network nodes. Analysing the local algorithms on quasi-UDGs allows one to assume that the nodes know their coordinates only approximately, up to an additive error. Despite the localisation error, the quality of the solution to problems on quasi-UDGs remains the same as for the case of UDGs with perfect location awareness. We analyse the increase in the local horizon that comes along with moving from UDGs to quasi-UDGs.

Metabolome based reaction graphs of M.tuberculosis and M.leprae: A comparative network analysis

Background. Several types of networks, such as transcriptional, metabolic or protein-protein interaction networks of various organisms have been constructed, that have provided a variety of insights into metabolism and regulation. Here, we seek to exploit the reaction-based networks of three organisms for comparative genomics. We use concepts from spectral graph theory to systematically determine how differences in basic metabolism of organisms are reflected at the systems level and in the overall topological structures of their metabolic networks. Methodology/Principal Findings. Metabolome-based reaction networks of Mycobacterium tuberculosis, Mycobacterium leprae and Escherichia coli have been constructed based on the KEGG LIGAND database, followed by graph spectral analysis of the network to identify hubs as well as the sub-clustering of reactions. The shortest and alternate paths in the reaction networks have also been examined. Sub-cluster profiling demonstrates that reactions of the mycolic acid pathway in mycobacteria form a tightly connected sub-cluster. Identification of hubs reveals reactions involving glutamate to be central to mycobacterial metabolism, and pyruvate to be at the centre of the E. coli metabolome. The analysis of shortest paths between reactions has revealed several paths that are shorter than well established pathways. Conclusions. We conclude that severe downsizing of the leprae genome has not significantly altered the global structure of its reaction network but has reduced the total number of alternate paths between its reactions while keeping the shortest paths between them intact. The hubs in the mycobacterial networks that are absent in the human metabolome can be explored as potential drug targets. This work demonstrates the usefulness of constructing metabolome based networks of organisms and the feasibility of their analyses through graph spectral methods. The insights obtained from such studies provide a broad overview of the similarities and differences between organisms, taking comparative genomics studies to a higher dimension.

Non-contractible non-edges in 2-connected graphs

Any pair of non-adjacent vertices forms a non-edge in a graph. Contraction of a non-edge merges two non-adjacent vertices into a single vertex such that the edges incident on the non-adjacent vertices are now incident on the merged vertex. In this paper, we consider simple connected graphs, hence parallel edges are removed after contraction. The minimum number of nodes whose removal disconnects the graph is the connectivity of the graph. We say a graph is k-connected, if its connectivity is k. A non-edge in a k-connected graph is contractible if its contraction does not result in a graph of lower connectivity. Otherwise the non-edge is non-contractible. We focus our study on non-contractible non-edges in 2-connected graphs. We show that cycles are the only 2-connected graphs in which every non-edge is non-contractible. (C) 2010 Elsevier B.V. All rights reserved.

Ruthenium-Oxygen Coordination-Driven Self-Assembly of a Ru-8(II) Incomplete Prism: Synthesis, Structure, and Shape-Selective Molecular Recognition Study

Coordination-driven self-assembly of 1,3,5-benzenetricarboxylate (tma; 1) and oxalato-bridged p-cymeneruthenium(II) building block Ru-2(mu-eta(4)-C2O4)(MeOH)(2)(eta(6)-p-cymene)(2)](O3SCF3)(2) (2) affords an unusual octanuclear incomplete prism Ru-8(eta(6)-p-cymene)(8)(tma)(2)(mu-eta(4)-C2O4)(2)(OMe)(4)](O3SCF3)( 2) (3), which exhibits a remarkable shape-selective binding affinity for neutral phenolic compounds via hydrogen-bonding interactions (p-cymene = p-(PrC6H4Me)-Pr-i). Such a binding was confirmed by single-crystal X-ray diffraction analysis using 1,3,5-trihydroxybenzene as an analyte.

Compression of Weighted Graphs

We propose to compress weighted graphs (networks), motivated by the observation that large networks of social, biological, or other relations can be complex to handle and visualize. In the process also known as graph simplication, nodes and (unweighted) edges are grouped to supernodes and superedges, respectively, to obtain a smaller graph. We propose models and algorithms for weighted graphs. The interpretation (i.e. decompression) of a compressed, weighted graph is that a pair of original nodes is connected by an edge if their supernodes are connected by one, and that the weight of an edge is approximated to be the weight of the superedge. The compression problem now consists of choosing supernodes, superedges, and superedge weights so that the approximation error is minimized while the amount of compression is maximized. In this paper, we formulate this task as the 'simple weighted graph compression problem'. We then propose a much wider class of tasks under the name of 'generalized weighted graph compression problem'. The generalized task extends the optimization to preserve longer-range connectivities between nodes, not just individual edge weights. We study the properties of these problems and propose a range of algorithms to solve them, with dierent balances between complexity and quality of the result. We evaluate the problems and algorithms experimentally on real networks. The results indicate that weighted graphs can be compressed efficiently with relatively little compression error.

A Thermodynamic Proposal for the Exposition of Critically and other Subtle Features in Self-Deflagrating Ammonium Perchlorate Systems

A first comprehensive investigation on the deflagration of ammonium perchlorate (AP) in the subcritical regime, below the low pressure deflagration limit (LPL, 2.03 MPa) christened as regime I$^{\prime}$, is discussed by using an elegant thermodynamic approach. In this regime, deflagration was effected by augmenting the initial temperature (T$_{0}$) of the AP strand and by adding fuels like aliphatic dicarboxylic acids or polymers like carboxy terminated polybutadiene (CTPB). From this thermodynamic model, considering the dependence of burning rate ($\dot{r}$) on pressure (P) and T$_{0}$, the true condensed (E$_{\text{s,c}}$) and gas phase (E$_{\text{s,g}}$) activation energies, just below and above the surface respectively, have been obtained and the data clearly distinguishes the deflagration mechanisms in regime I$^{\prime}$ and I (2.03-6.08 MPa). Substantial reduction in the E$_{\text{s,c}}$ of regime I$^{\prime}$, compared to that of regime I, is attributed to HClO$_{4}$ catalysed decomposition of AP. HClO$_{4}$ formation, which occurs only in regime I$^{\prime}$, promotes dent formation on the surface as revealed by the reflectance photomicrographs, in contrast to the smooth surface in regime I. The HClO$_{4}$ vapours, in regime I$^{\prime}$, also catalyse the gas phase reactions and thus bring down the E$_{\text{s,g}}$ too. The excess heat transferred on to the surface from the gas phase is used to melt AP and hence E$_{\text{s,c}}$, in regime I, corresponds to the melt AP decomposition. It is consistent with the similar variation observed for both the melt layer thickness and $\dot{r}$ as a function of P. Thermochemical calculations of the surface heat release support the thermodynamic model and reveal that the AP sublimation reduces the required critical exothermicity of 1108.8 kJ kg$^{-1}$ at the surface. It accounts for the AP not sustaining combustion in the subcritical regime I$^{\prime}$. Further support for the model comes from the temperature-time profiles of the combustion train of AP. The gas and condensed phase enthalpies, derived from the profile, give excellent agreement with those computed thermochemically. The $\sigma _{\text{p}}$ expressions derived from this model establish the mechanistic distinction of regime I$^{\prime}$ and I and thus lend support to the thermodynamic model. On comparing the deflagration of strand against powder AP, the proposed thermodynamic model correctly predicts that the total enthalpy of the condensed and gas phases remains unaltered. However, 16% of AP particles undergo buoyant lifting into the gas phase in the `free board region' (FBR) and this renders the demarcation of the true surface difficult. It is found that T$_{\text{s}}$ lies in the FBR and due to this, in regime I$^{\prime}$, the E$_{\text{s,c}}$ of powder AP matches with the E$_{\text{s,g}}$ of the pellet. The model was extended to AP/dicarboxylic acids and AP/CTPB mixture. The condensed ($\Delta $H$_{1}$) and gas phase ($\Delta $H$_{2}$) enthalpies were obtained from the temperature profile analyses which fit well with those computed thermochemically. The $\Delta $H$_{1}$ of the AP/succinic acid mixture was found just at the threshold of sustaining combustion. Indeed the lower homologue malonic acid, as predicted, does not sustain combustion. In vaporizable fuels like sebacic acid the E$_{\text{s,c}}$ in regime I$^{\prime}$, understandably, conforms to the AP decomposition. However, the E$_{\text{s,c}}$ in AP/CTPB system corresponds to the softening of the polymer which covers AP particles to promote extensive condensed phase reactions. The proposed thermodynamic model also satisfactorily explains certain unique features like intermittent, plateau and flameless combustion in AP/ polymeric fuel systems.

A thermodynamic protocol for explaining subcriticality and other subtle features in self-deflagrating solids

A novel universal approach to understand the self-deflagration in solids has been attempted by using basic thermodynamic equation of partial differentiation, where burning mte depends on the initial temperature and pressure of the system. Self-deflagrating solids are rare and are reported only in few compounds like ammonium perchlorate (AP), polystyrene peroxide and tetrazole. This approach has led us to understand the unique characteristics of AP, viz. the existence of low pressure deflagration limit (LPL 20 atm), hitherto not understood sufficiently. This analysis infers that the overall surface activation energy comprises of two components governed by the condensed phase and gas phase processes. The most attractive feature of the model is the identification of a new subcritical regime I' below LPL where AP does not burn. The model is aptly supported by the thermochemical computations and temperature-profile analyses of the combustion train. The thermodynamic model is further corroborated from the kinetic analysis of the high pressure (1-30 atm) DTA thermograms which affords distinct empirical decomposition rate laws in regimes I' and 1 (20-60 atm). Using Fourier-Kirchoff one dimensional heat transfer differential equation, the phase transition thickness and the melt-layer thickness have been computed which conform to the experimental data.

Polarimetric Measurements in a Severe Hailstorm

This study explores the utility of polarimetric measurements for discriminating between hydrometeor types with the emphasis on (a) hail detection and discrimination of its size, (b) measurement of heavy precipitation, (c) identification and quantification of mixed-phase hydrometeors, and (d) discrimination of ice forms. In particular, we examine the specific differential phase, the backscatter differential phase, the correlation coefficient between vertically and horizontally polarized waves, and the differential reflectivity, collected from a storm at close range. Three range–height cross sections are analyzed together with complementary data from a prototype WSR-88D radar. The case is interesting because it demonstrates the complementary nature of these polarimetric measurands. Self-consistency among them allows qualitative and some quantitative discrimination between hydrometeors.