http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
당뇨병성 신경인성 방광 환자에서 동시에 발생한 기종성 신우신염, 요관염, 방광염
조용기 ( Jo Yong Gi ),이우철 ( Lee U Cheol ),김경환 ( Kim Gyeong Hwan ),차재문 ( Cha Jae Mun ),박세영 ( Park Se Yeong ),강현구 ( Kang Hyeon Gu ),이현재 ( Lee Hyeon Jae ) 대한신장학회 2004 Kidney Research and Clinical Practice Vol.23 No.3
Since the first case was known by Kelly and MacCallum in 1898, gas-forming bacterial infection of the urinary tract has been reported infrequently. This disease occurs more frequently in diabetics or women, and is mainly caused by aerobic Gram negative bacteria, most commonly E. coli. Although the pathogenesis of gas formation in this disease is still poorly understood, glucose fermentation by the causative bacteria has been considered as the main mechanism. In the literature, the majority of cases reported were emphysematous pyelonephritis and/or emphysematous cystitis, together or separately. But simultaneous development of emphysematous infection of kidney, ureter and bladder has been reported very rarely and no case has been reported yet in Korea. We report a case of emphysematous pyelonephritis, ureteritis, and cystitis which occurred simultaneously in 35-year-old female patient with diabetic renal failure and neurogenic bladder. (Korean J Nephrol 2004;23(3):492-495)
주상연 ( Sang Yeon Joo ),조태정 ( Tae Jeong Cho ),차재문 ( Jae Mun Cha ),양진호 ( Jin Ho Yang ),권영근 ( Yung Keun Kwon ) 한국정보처리학회 2012 정보처리학회논문지. 컴퓨터 및 통신시스템 Vol.1 No.2
An economic ship routing means to sail a ship with a goal of minimizing the fuel consumption by utilizing weather forecast information, and various such systems have been recently studied. For a successful economic ship routing system, an efficient algorithm is needed to search an optimal geographical path, and most of the previous systems were approaching to that problem through a minimal static-cost path search algorithm based on the Dijkstra algorithm. To apply that kind of search algorithm, the cost of every edge assigned with the estimated fuel consumption should be constant. However, that assumption is not practical at all considering that the actual fuel consumption is determined by the weather condition when the ship will pass the edge. To overcome such a limitation, we propose a new optimal ship routing system based on a minimal dynamic-cost path search algorithm by properly modifying the Dijkstra algorithm. In addition, we propose a method which efficiently reduces the search space by using the A* algorithm to decrease the running time. We compared our system with the shortest path-based sailing method over ten testing routes and observed that the former reduced the estimated fuel consumption than the latter by 2.36% on average and the maximum 4.82% with little difference of estimated time of arrival.