期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
General anesthesia with endotracheal intubation ensures the quick removal of magnetic foreign bodies:A case report
1
作者 Qi-Fei Tian Ai-Xiang Zhao +3 位作者 ni du Zeng-Juan Wang Ling-Ling Ma Fang-Li Men 《World Journal of Gastrointestinal Endoscopy》 2023年第11期676-680,共5页
BACKGROUND The incidence of ingestion of magnetic foreign bodies in the gastrointestinal tract has been increasing year by year.Due to their strong magnetic attraction,if multiple gastrointestinal foreign bodies enter... BACKGROUND The incidence of ingestion of magnetic foreign bodies in the gastrointestinal tract has been increasing year by year.Due to their strong magnetic attraction,if multiple gastrointestinal foreign bodies enter the small intestine,it can lead to serious complications such as intestinal perforation,necrosis,torsion,and bleeding.Severe cases require surgical intervention.CASE SUMMARY We report a 6-year-old child who accidentally swallowed multiple magnetic balls.Under timely and safe anesthesia,the magnetic balls were quickly removed through gastroscopy before entering the small intestine.CONCLUSION General anesthesia with endotracheal intubation can ensure full anesthesia under the condition of fasting for less than 6 h.In order to prevent magnetic foreign bodies from entering the small intestine,timely and effective measures must be taken to remove the foreign bodies. 展开更多
关键词 Magnetic foreign bodies General anesthesia with endotracheal intubation Magnetic balls ENDOSCOPY Case report
下载PDF
A NEW ROUTING ALGORITHM FOR THE SHUFFLE-EXCHANGE PERMUTATION NETWORK
2
作者 Baoxing CHEN Wenjun XIA ni du 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2006年第4期586-591,共6页
In this paper, a new routing algorithm is given for the shuffle-exchange permutation network (SEPn). The length of the path between any two nodes given by our algorithm is not more than 11/16n^2+O(n), i.e., the d... In this paper, a new routing algorithm is given for the shuffle-exchange permutation network (SEPn). The length of the path between any two nodes given by our algorithm is not more than 11/16n^2+O(n), i.e., the diameter of SEPn is at most 11/16n^2+ O(n). This improves on a 1/8(9n^2- 22n+24) routing algorithm described earlier by S. Latifi and P. K. Srimani. We also show that the diameter of SEPn is more than 1/2n^2-n. 展开更多
关键词 Cayley graph fixed degree routing shuffle-exchange permutation network.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部