http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
요골 두 아탈구와 동반된 상완골 내 상과 골절 : 1예 보고 A Case Report
이한용,유기원,정진영,송주현,고해석,강용구,손문익 대한골절학회 2003 대한골절학회지 Vol.16 No.2
주관절 손산 중 상완골 내 상과 골절은 단독으로 혹은 주관절 탈구와 동반되어 발생하는 것이 일반적이다. 저자들은 15세 남자 환자의 좌측 요골 두 아탈구가 동반된 상완골 내 상과 골절을 경험하였다. 도수 정복을 시도하였으나 요골 두 아탈구의 정복을 얻을 수 없어 관혈적 정복술로 치료하엿다. 6개월추시 결과 후휴증이 없는 정상적인 관절 상태를 확인할 수 있었다. 연령, 원인 , 손상 기전으로 분석해 보면 이 동반 손상은 발생하기 매우 어렵고, 문헌 탐색 결과 현재까지 동일한 증례를 찾아볼 수 없었으므로 보고하는 바이다. It has been known that fracture of medial epicondylar apophysis of distal humerus may be isolated of associated with elbow deslocations. We have experienced a case which medial epicondylar fracture of the distal humerus was associated with subluxation of the radial head. Initially, we had tried reduction of subluxated radial head by closed method, but failed. Finally open reduction gad been performed. At 6 month after open reduction, clinical and radiological result were excellent. As it is difficult for those associated injuries to occur simultaneously and the similar cases never have been reported yet, we would like to present this case with a review of the literature.
Enhanced Cores Based Tree for Many-to-Many IP Multicasting
Seok Joo Koh,Shin Gak Kang,박기식 에스케이텔레콤 (주) 2001 Telecommunications Review Vol.11 No.3
In this paper, we propose a simple and practical scheme for many-to-many IP multicasting. The proposed scheme is based on the core based tree (CBT) protocol, and designed to enhance the CBT in terms of tree cost and traffic concentration. In the scheme, each group user is simply connected to the nearest core router in the network. Each core router forwards the source traffic to the network via the pre-configured backbone core tree spanning all the core routers in the network. To ensure that the backbone core tree keeps only the core routers with active group users, the core routers that have no downstream users are removed from the backbone core tree. The experimental results show that the proposed scheme significantly improves the existing CBT scheme in terms of tree cost and traffic concentration.
Koh, Young Jun,Koh, Bong Ihn,Kim, Honsoul,Joo, Hyung Joon,Jin, Ho Kyoung,Jeon, Jongwook,Choi, Chulhee,Lee, Dong Hun,Chung, Jin Ho,Cho, Chung-Hyun,Park, Won Seok,Ryu, Ji-Kan,Suh, Jun Kyu,Koh, Gou Young Ovid Technologies Wolters Kluwer -American Heart A 2011 Arteriosclerosis, thrombosis, and vascular biology Vol.31 No.5
Multicast Handover Agents for Fast Handover in Wireless Multicast Networks
Seok Joo Koh,Gohar, M IEEE 2010 IEEE communications letters Vol.14 No.7
<P>This Letter addresses the fast handover in wireless multicast networks. The existing multicast handover scheme tends to induce unnecessary data transmissions and large handover delay during handover. We propose a Multicast Handover Agent (MHA), which is used to support fast handover and to reduce unnecessary data transmission. In the proposed scheme, each MHA has a cache to maintain a list of active mobile nodes per multicast group, which is used to support the fast leave. The MHA also performs the fast join with its neighboring MHA during handover. By numerical analysis, it is shown that the proposed MHA scheme can give smaller handover delays compared to the existing multicast handover scheme.</P>
Minimizing Cost and Delay in Shared Multicast Trees
Koh, Seok-Joo,Yi, Jong-Hwa,Hahm, Jin-Ho,Chin, Byoung-Moon,Park, Chee-Hang Electronics and Telecommunications Research Instit 2000 ETRI Journal Vol.22 No.1
Existing tree construction mechanisms are classified into source-based trees and center-based trees. The source-based trees produce a source-rooted tree with a low delay. However, for the applications with multiple senders, the management overheads for routing tables and resource reservations are too high. The center-based trees are easy to implement and manage, but a priori configuration of candidate center nodes is required, and the optimization mature such as tree cost and delay is not considered. In this paper, we propose a new multicast tree building algorithm. The proposal algorithm basically builds a non-center based shared tree. In particular, any center node is not pre-configured. In the purposed algorithm, a multicast node among current tree nodes is suitably assigned to each incoming user: Such a node is selected in a fashion that tree cost and the maximum end-to-end delay on the tree are jointly minimized. The existing and proposed algorithms are compared by experiments. In the simulation results, it is shown that the proposed algorithm approximately provides the cost saving of 30% and the delay saving of 10%, compared to the existing approaches. In conclusion, we see that the cost and delay aspects for multicast trees can be improved at the cost of additional computations.
Configuration of ACK Trees for Multicast Transport Protocols
Koh, Seok-Joo,Kim, Eun-Sook,Park, Ju-Young,Kang, Shin-Gak,Park, Ki-Shik,Park, Chee-Hang Electronics and Telecommunications Research Instit 2001 ETRI Journal Vol.23 No.3
For scalable multicast transport, one of the promising approaches is to employ a control tree known as acknowledgement (ACK) tree which can be used to convey information on reliability and session status from receivers to a root sender. The existing tree configuration has focused on a 'bottom-up' scheme in which ACK trees grow from leaf receivers toward a root sender. This paper proposes an alternative 'top-down' configuration where an ACK tree begins at the root sender and gradually expands by including non-tree nodes into the tree in a stepwise manner. The proposed scheme is simple and practical to implement along with multicast transport protocols. It is also employed as a tree configuration in the Enhanced Communications Transport Protocol, which has been standardized in the ITU-T and ISO/IEC JTC1. From experimental simulations, we see that the top-down scheme provides advantages over the existing bottom-up one in terms of the number of control messages required for tree configuration and the number of tree levels.