http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Colorectal Cancer Screening—Who, How, and When?
Roisin Bevan,Matthew D Rutter 대한소화기내시경학회 2018 Clinical Endoscopy Vol.51 No.1
Colorectal cancer (CRC) is the third most common cancer worldwide. It is amenable to screening as it occurs in premalignant,latent, early, and curable stages. PubMed, Cochrane Database of Systematic Reviews, and national and international CRC screeningguidelines were searched for CRC screening methods, populations, and timing. CRC screening can use direct or indirect tests, deliveredopportunistically or via organized programs. Most CRCs are diagnosed after 60 years of age; most screening programs apply toindividuals 50–75 years of age. Screening may reduce disease-specific mortality by detecting CRC in earlier stages, and CRC incidenceby detecting premalignant polyps, which can subsequently be removed. In randomized controlled trials (RCTs) guaiac fecal occult bloodtesting (gFOBt) was found to reduce CRC mortality by 13%–33%. Fecal immunochemical testing (FIT) has no RCT data comparing itto no screening, but is superior to gFOBt. Flexible sigmoidoscopy (FS) trials demonstrated an 18% reduction in CRC incidence and a28% reduction in CRC mortality. Currently, RCT evidence for colonoscopy screening is scarce. Although not yet corroborated by RCTs,it is likely that colonoscopy is the best screening modality for an individual. From a population perspective, organized programs aresuperior to opportunistic screening. However, no nation can offer organized population-wide colonoscopy screening. Thus, organizedprograms using cheaper modalities, such as FS/FIT, can be tailored to budget and capacity.
Bae, Sang Won,Baffier, Jean-Francois,Chun, Jinhee,Eades, Peter,Eickmeyer, Kord,Grilli, Luca,Hong, Seok-Hee,Korman, Matias,Montecchiani, Fabrizio,Rutter, Ignaz,Tó,th, Csaba D. Elsevier 2018 Theoretical computer science Vol.745 No.-
<P><B>Abstract</B></P> <P>We introduce the family of <I>k-gap-planar graphs</I> for k ≥ 0 , i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most <I>k</I> of its crossings. This definition is motivated by applications in edge casing, as a <I>k</I>-gap-planar graph can be drawn crossing-free after introducing at most <I>k</I> local gaps per edge. We present results on the maximum density of <I>k</I>-gap-planar graphs, their relationship to other classes of beyond-planar graphs, characterization of <I>k</I>-gap-planar complete graphs, and the computational complexity of recognizing <I>k</I>-gap-planar graphs.</P>