目的：探讨SBAR沟通模式对心血管科重症监护病房（ CCU ）转出患者交接中的应用效果。方法选取2012年3月-2013年1月由CCU转至普通病房的268例患者作为研究对象，将患者依照转出序列编号，其中尾数为单号者分入研究组，尾数为双号者分入...目的：探讨SBAR沟通模式对心血管科重症监护病房（ CCU ）转出患者交接中的应用效果。方法选取2012年3月-2013年1月由CCU转至普通病房的268例患者作为研究对象，将患者依照转出序列编号，其中尾数为单号者分入研究组，尾数为双号者分入对照组。对照组给予常规口头交接，研究组采用SBAR沟通模式，利用科室自制的“病区交接记录单”，执行规范的交接流程。比较两组交接工作的连续性、问题发生率、所耗时间及患者和交接双方的满意度。结果研究组顺利交接者95例，交接不畅者29例，未顺利交接者10例，对照组分别为70，39，25例，差异有统计学意义（ u＝3．358， P＜0．01）。研究组使用记录单后管道交接不清者4例、检查标本遗漏者12例、用药错误者20例，护理漏项者18例，分别优于对照组的26，34，37，32例，差异有统计学意义（χ2值分别为18．17，12．70，6．44，4．82；P＜0．05）。对照组平均交接所需时间为（13．20±3．69） min，研究组平均交接所需时间为（8．35±2．18）min，差异有统计学意义（t＝13．1，P＜0．05）。研究组使用SBAR沟通方式后，患者及接收者的满意度明显高于对照组，差异有统计学意义（χ2值分别为12．48，14．83；P＜0．01）。结论运用SBAR沟通模式进行规范的交接，提高了工作效率、护理安全质量及患者满意度。展开更多
Two methods based on a slight modification of the regular traffic assignmentalgorithms are proposed to directly compute turn flows instead of estimating them from link flows orobtaining them by expanding the networks....Two methods based on a slight modification of the regular traffic assignmentalgorithms are proposed to directly compute turn flows instead of estimating them from link flows orobtaining them by expanding the networks. The first one is designed on the path-turn incidencerelationship, and it is similar to the computational procedure of link flows. It applies to thetraffic assignment algorithms that can provide detailed path structures. The second utilizes thelink-turn incidence relationship and the conservation of flow on links, a law deriving from thisrelationship. It is actually an improved version of Dial's logit assignment algorithm. The proposedapproaches can avoid the shortcomings both of the estimation methods, e. g. Furness's model andFrator's model, and of the network-expanding method in precision, stability and computation scale.Finally, they are validated by numerical examples.展开更多
文摘Two methods based on a slight modification of the regular traffic assignmentalgorithms are proposed to directly compute turn flows instead of estimating them from link flows orobtaining them by expanding the networks. The first one is designed on the path-turn incidencerelationship, and it is similar to the computational procedure of link flows. It applies to thetraffic assignment algorithms that can provide detailed path structures. The second utilizes thelink-turn incidence relationship and the conservation of flow on links, a law deriving from thisrelationship. It is actually an improved version of Dial's logit assignment algorithm. The proposedapproaches can avoid the shortcomings both of the estimation methods, e. g. Furness's model andFrator's model, and of the network-expanding method in precision, stability and computation scale.Finally, they are validated by numerical examples.
