目的系统评价化疗患者肺部感染发生率及影响因素。方法计算机检索中国知网、万方、维普、中国生物医学文献数据库、PubMed、Embase、Cochrane Library、Web of Science中有关化疗患者肺部感染影响因素的文献,时限为建库至2025年7月10日...目的系统评价化疗患者肺部感染发生率及影响因素。方法计算机检索中国知网、万方、维普、中国生物医学文献数据库、PubMed、Embase、Cochrane Library、Web of Science中有关化疗患者肺部感染影响因素的文献,时限为建库至2025年7月10日。2名研究者按纳入与排除标准对文献进行独立筛选和质量评价,Meta分析采用Stata 16.0软件。结果纳入23篇文献,其中17篇病例对照研究,6篇队列研究,涉及8800例患者,文献质量评分较高。Meta分析结果显示,肿瘤化疗患者合并肺部感染发生率约为24.4%,其中肺癌19.6%、食管癌14.1%、血液癌44.6%。年龄、年龄≥60岁、吸烟史、合并糖尿病、合并慢性阻塞性肺疾病、肿瘤位置位于胸部中段、肿瘤晚期、化疗周期≥2、联合使用化疗药物、有侵入性操作、放疗时间≥30 d、粒细胞计数减少、低蛋白血症、重度贫血为化疗患者肺部感染的独立危险因素。结论本研究确定了化疗患者肺部感染的14个影响因素,临床工作者应加强评估与护理水平,早期识别高危人群,降低肺部感染发生率。展开更多
The problems of fast determining shortest paths through a polygonal subdivision planar with n vertices are considered in GIS. Distances are measured according to an Euclidean metric. A geographical information system ...The problems of fast determining shortest paths through a polygonal subdivision planar with n vertices are considered in GIS. Distances are measured according to an Euclidean metric. A geographical information system (GIS) has a collection of nearest neighborhood operations and this collection serves as a useful toolbox for spatial analysis. These operations are undertaken through the Voronoi diagrams. This paper presents a novel algorithm that constructs a' shortest route set' with respect to a given source point and a target point by Voronoi diagrams. It will help to improve the efficiency of traditional algorithms, e. g., Djkstra algorithm, on selecting the shortest routes. Moreover, the novel algorithm can check the connectivity in a complex network between the source point and target one.展开更多
文摘The problems of fast determining shortest paths through a polygonal subdivision planar with n vertices are considered in GIS. Distances are measured according to an Euclidean metric. A geographical information system (GIS) has a collection of nearest neighborhood operations and this collection serves as a useful toolbox for spatial analysis. These operations are undertaken through the Voronoi diagrams. This paper presents a novel algorithm that constructs a' shortest route set' with respect to a given source point and a target point by Voronoi diagrams. It will help to improve the efficiency of traditional algorithms, e. g., Djkstra algorithm, on selecting the shortest routes. Moreover, the novel algorithm can check the connectivity in a complex network between the source point and target one.
