12,985 research outputs found

    Metabolic Syndrome among Type-2 Diabetic Patients in Benghazi-Libya: A pilot study

    Get PDF
    ABSTRACTBackground: Metabolic syndrome is a cluster of three out of five conditions that are due to hyperinsulinemia: abdominal obesity, atherogenic dyslipidemia (high triglycerides and/or low HDL),elevated blood pressure, and elevated plasma glucose. The syndrome is highly prevalent in patients with type-2 diabetes mellitus and often precedes the onset of hyperglycemia. It has been shown thatmetabolic syndrome is an independent clinical indicator of macro- and microvascular complications in diabetics. Aim and objectives: the aim of this pilot study was to estimate the frequency andcharacteristics of metabolic syndrome among type-2 diabetic patients in Benghazi. Patients and methods: This cross-sectional study involved 99 randomly selected adult patients with type-2diabetes mellitus. The patients were interviewed and examined, and their lipid profiles were checked 9-12 hours after overnight fasting. Metabolic syndrome was defined according to the criteria of the National Cholesterol Education Program (NCEP) Adult Treatment Panel III (ATP III) and of the International Diabetes Federation (IDF). Results: About 92% of the patients had the metabolicsyndrome according to ATP III criteria and 80.8% according to IDF criteria. Females were more affected, males with metabolic syndrome were significantly older, and females were significantly moreobese. No significant difference was observed between males and females regarding waistcircumference, HDL level and triglyceride level. The commonest and most important component ofmetabolic syndrome in the study group was low HDL. Conclusion: Metabolic syndrome is common among Libyans with type-2 diabetes mellitus, and it is significantly more common in females thanmales. The most significant predictor of metabolic syndrome in type-2 diabetic patients in Benghazi is low HDL

    Weakly- and Semi-Supervised Panoptic Segmentation

    Full text link
    We present a weakly supervised model that jointly performs both semantic- and instance-segmentation -- a particularly relevant problem given the substantial cost of obtaining pixel-perfect annotation for these tasks. In contrast to many popular instance segmentation approaches based on object detectors, our method does not predict any overlapping instances. Moreover, we are able to segment both "thing" and "stuff" classes, and thus explain all the pixels in the image. "Thing" classes are weakly-supervised with bounding boxes, and "stuff" with image-level tags. We obtain state-of-the-art results on Pascal VOC, for both full and weak supervision (which achieves about 95% of fully-supervised performance). Furthermore, we present the first weakly-supervised results on Cityscapes for both semantic- and instance-segmentation. Finally, we use our weakly supervised framework to analyse the relationship between annotation quality and predictive performance, which is of interest to dataset creators.Comment: ECCV 2018. The first two authors contributed equall

    Thermal Giant Gravitons

    Full text link
    We study the giant graviton solution as the AdS_5 X S^5 background is heated up to finite temperature. The analysis employs the thermal brane probe technique based on the blackfold approach. We focus mainly on the thermal giant graviton corresponding to a thermal D3-brane probe wrapped on an S^3 moving on the S^5 of the background at finite temperature. We find several interesting new effects, including that the thermal giant graviton has a minimal possible value for the angular momentum and correspondingly also a minimal possible radius of the S^3. We compute the free energy of the thermal giant graviton in the low temperature regime, which potentially could be compared to that of a thermal state on the gauge theory side. Moreover, we analyze the space of solutions and stability of the thermal giant graviton and find that, in parallel with the extremal case, there are two available solutions for a given temperature and angular momentum, one stable and one unstable. In order to write down the equations of motion, action and conserved charges for the thermal giant graviton we present a slight generalization of the blackfold formalism for charged black branes. Finally, we also briefly consider the thermal giant graviton moving in the AdS_5 part.Comment: v1: 32 pages + 11 pages appendices, 13 figures, v2: typos fixed in Sec.2 and other misprints, references adde

    Self-assembled 2D Free-Standing Janus Nanosheets with Single-Layer Thickness

    Get PDF
    We report the thermodynamically controlled growth of solution-processable and free-standing nanosheets via peptide assembly in two dimensions. By taking advantage of self-sorting between peptide β-strands and hydrocarbon chains, we have demonstrated the formation of Janus 2D structures with single-layer thickness, which enable a predetermined surface heterofunctionalization. A controlled 2D-to-1D morphological transition was achieved by subtly adjusting the intermolecular forces. These nanosheets provide an ideal substrate for the engineering of guest components (e.g., proteins and nanoparticles), where enhanced enzyme activity was observed. We anticipate that sequence-specific programmed peptides will offer promise as design elements for 2D assemblies with face-selective functionalization

    To VBAC or Not to VBAC

    Get PDF
    Catherine Spong discusses new research in PLoS Medicine that sheds more light on the risks of uterine rupture for women attempting a trial of labor following previous cesarean section

    Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2

    Full text link
    Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial effort has been dedicated to deciding whether a given graph has a square root that belongs to a particular graph class. There are both polynomial-time solvable and NP-complete cases, depending on the graph class. We contribute with new results in this direction. Given an arbitrary input graph G, we give polynomial-time algorithms to decide whether G has an outerplanar square root, and whether G has a square root that is of pathwidth at most 2
    corecore