http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Pseudoaneurysm of the splenic artery
Radu Dumitru,Ana Carbunaru,Mugur Grasu,Mihai Toma,Mihnea Ionescu,Traian Dumitrascu 한국간담췌외과학회 2016 Annals of hepato-biliary-pancreatic surgery Vol.20 No.4
Delayed post-pancreatectomy hemorrhage (PPH) is a relatively uncommon, but feared, complication after pancreaticoduodenectomy (PD). A splenic artery pseudoaneurysm is a rare cause of delayed PPH after a PD. This paper describes the case of a patient with PD used to treat a distal bile duct cholangiocarcinoma complicated with a clinically significant pancreatic fistula and secondary intraabdominal abscess. Computed tomography-guided drainage of the abscess was performed with an apparently favourable outcome; the patient was discharged on postoperative day (POD) 35 and the abdominal drains were removed on POD 50. On POD 80, the patient was readmitted for a severe digestive hemorrhage. Computed tomography revealed a pseudoaneurysm of the splenic artery with a subsequent hematoma formation. Immediately, an angiography was performed and coils were successfully mounted. This case illustrates the rare possibility of the development of a splenic artery pseudoaneurysm with severe delayed PPH after PD complicated with a clinically significant pancreatic fistula, even after the patient was discharged from the hospital. An interventional radiology approach represents the first treatment option in hemodynamically stable patients with high success rates.
THE POWER OF PROGRAMMED GRAMMARS WITH GRAPHS FROM VARIOUS CLASSES
Barbaiani, Madalina,Bibire, Cristina,Dassow, Jurgen,Delaney, Aidan,Fazekas, Szilard,Ionescu, Mihai,Liu, Guangwu,Lodhi, Atif,Nagy, Benedek 한국전산응용수학회 2006 Journal of applied mathematics & informatics Vol.22 No.1
Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain that Eulerian, Hamiltonian, planar and bipartite graphs and regular graphs of degree at least three are pr-universal in that sense that any language which can be generated by programmed grammars (with erasing rules and without appearance checking) can be obtained by programmed grammars where the underlying graph belongs to the given special class of graphs, whereas complete graphs, regular graphs of degree 2 and backbone graphs lead to proper subfamilies of the family of programmed languages.
The power of programmed grammars with graphs from various classes
Madalina Barbaiani,Cristina Bibire,J urgen Dassow,Aidan Delaney,Szilard Fazekas,Mihai Ionescu,Guangwu Liu,Atif Lodhi,Benedek Nagy 한국전산응용수학회 2006 Journal of applied mathematics & informatics Vol.22 No.1-2
Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs re- stricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain that Eulerian, Hamil- tonian, planar and bipartite graphs and regular graphs of degree at least three are pr-universal in that sense that any language which can be gener- ated by programmed grammars (with erasing rules and without appearance checking) can be obtained by programmed grammars where the underly- ing graph belongs to the given special class of graphs, whereas complete graphs, regular graphs of degree 2 and backbone graphs lead to proper subfamilies of the family of programmed languages.