3,646 research outputs found

    Convexity-Increasing Morphs of Planar Graphs

    Full text link
    We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of an internally 3-connected graph, we show how to morph the drawing to one with strictly convex faces while maintaining planarity at all times. Our morph is convexity-increasing, meaning that once an angle is convex, it remains convex. We give an efficient algorithm that constructs such a morph as a composition of a linear number of steps where each step either moves vertices along horizontal lines or moves vertices along vertical lines. Moreover, we show that a linear number of steps is worst-case optimal. To obtain our result, we use a well-known technique by Hong and Nagamochi for finding redrawings with convex faces while preserving y-coordinates. Using a variant of Tutte's graph drawing algorithm, we obtain a new proof of Hong and Nagamochi's result which comes with a better running time. This is of independent interest, as Hong and Nagamochi's technique serves as a building block in existing morphing algorithms.Comment: Preliminary version in Proc. WG 201

    1000 nm tunable acousto-optic filter based on photonic crystal fiber

    Get PDF
    Author name used in this publication: W. JinAuthor name used in this publication: J. Ju2007-2008 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

    Planar Drawings of Fixed-Mobile Bigraphs

    Full text link
    A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, together with the edges, must be added to the drawing. We assume that G is planar and study the problem of finding, for a given k >= 0, a planar poly-line drawing of G with at most k bends per edge. In the most general case, we show NP-hardness. For k=0 and under additional constraints on the positions of the fixed or mobile vertices, we either prove that the problem is polynomial-time solvable or prove that it belongs to NP. Finally, we present a polynomial-time testing algorithm for a certain type of "layered" 1-bend drawings

    Deep Lesion Graphs in the Wild: Relationship Learning and Organization of Significant Radiology Image Findings in a Diverse Large-scale Lesion Database

    Full text link
    Radiologists in their daily work routinely find and annotate significant abnormalities on a large number of radiology images. Such abnormalities, or lesions, have collected over years and stored in hospitals' picture archiving and communication systems. However, they are basically unsorted and lack semantic annotations like type and location. In this paper, we aim to organize and explore them by learning a deep feature representation for each lesion. A large-scale and comprehensive dataset, DeepLesion, is introduced for this task. DeepLesion contains bounding boxes and size measurements of over 32K lesions. To model their similarity relationship, we leverage multiple supervision information including types, self-supervised location coordinates and sizes. They require little manual annotation effort but describe useful attributes of the lesions. Then, a triplet network is utilized to learn lesion embeddings with a sequential sampling strategy to depict their hierarchical similarity structure. Experiments show promising qualitative and quantitative results on lesion retrieval, clustering, and classification. The learned embeddings can be further employed to build a lesion graph for various clinically useful applications. We propose algorithms for intra-patient lesion matching and missing annotation mining. Experimental results validate their effectiveness.Comment: Accepted by CVPR2018. DeepLesion url adde

    Impact of visceral fat on skeletal muscle mass and vice versa in a prospective cohort study: The Korean Sarcopenic Obesity Study (KSOS)

    Get PDF
    Objectives: Sarcopenia and visceral obesity have been suggested to aggravate each other, resulting in a vicious cycle. However, evidence based on prospective study is very limited. Our purpose was to investigate whether visceral fat promotes a decrease in skeletal muscle mass and vice versa. Methods: We observed changes in anthropometric and body composition data during a follow-up period of 27.6±2.8 months in 379 Korean men and women (mean age 51.9±14.6 years) from the Korean Sarcopenic Obesity Study (KSOS). Appendicular lean soft tissue (ALST) mass was calculated using dual-energy X-ray absorptiometry, and visceral fat area (VFA) was measured using computed tomography at baseline and follow-up examination. Results: ALST mass significantly decreased, whereas trunk and total fat mass increased in both men and women despite no significant change in weight and body mass index. In particular, women with visceral obesity at baseline had a greater decrease in ALST mass than those without visceral obesity (P=0.001). In multiple linear regression analysis, baseline VFA was an independent negative predictor of the changes in ALST after adjusting for confounding factors including age, gender, life style and body composition parameters, insulin resistance, high sensitivity C-reactive protein and vitamin D levels (P=0.001), whereas the association between baseline ALST mass and changes in VFA was not statistically significant (P=0.555). Conclusions: This longitudinal study showed that visceral obesity was associated with future loss of skeletal muscle mass in Korean adults. These results may provide novel insight into sarcopenic obesity in an aging society

    Properties of Light Flavour Baryons in Hypercentral quark model

    Full text link
    The light flavour baryons are studied within the quark model using the hyper central description of the three-body system. The confinement potential is assumed as hypercentral coulomb plus power potential (hCPPνhCPP_\nu) with power index ν\nu. The masses and magnetic moments of light flavour baryons are computed for different power index, ν\nu starting from 0.5 to 1.5. The predicted masses and magnetic moments are found to attain a saturated value with respect to variation in ν\nu beyond the power index ν>\nu> 1.0. Further we computed transition magnetic moments and radiative decay width of light flavour baryons. The results are in good agreement with known experimental as well as other theoretical models.Comment: Accepted in Pramana J. of Physic

    ITPKC Single Nucleotide Polymorphism Associated with the Kawasaki Disease in a Taiwanese Population

    Get PDF
    Kawasaki disease (KD) is characterized by systemic vasculitis with unknown etiology. Previous studies from Japan indicated that a gene polymorphism of ITPKC (rs28493229) is responsible for susceptibility to KD. We collected DNA samples from 1,531 Taiwanese subjects (341 KD patients and 1,190 controls) for genotyping ITPKC. In this study, no significant association was noted for the ITPKC polymorphism (rs28493229) between the controls and KD patients, although the CC genotype was overrepresented. We further combined our data with previously published case/control KD studies in the Taiwanese population and performed a meta-analysis. A significant association between rs28493229 and KD was found (Odds Ratio:1.36, 95% Confidence Interval 1.12–1.66). Importantly, a significant association was obtained between rs28493229 and KD patients with aneurysm formation (P = 0.001, under the recessive model). Taken together, our results indicated that C-allele of ITPKC SNP rs28493229 is associated with the susceptibility and aneurysm formation in KD patients in a Taiwanese population

    Burden of postinfectious symptoms after acute Dengue, Vietnam.

    Get PDF
    We assessed predominantly pediatric patients in Vietnam with dengue and other febrile illness 3 months after acute illness. Among dengue patients, 47% reported >1 postacute symptom. Most resolved by 3 months, but alopecia and vision problems often persisted. Our findings provide additional evidence on postacute dengue burden and confirm children are affected
    corecore