http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
하악골 골절 환자에 있어 수술후 합병증으로 발생한 골수염의 치험례
윤규호,전인성,신용길,박준호,허남오,방석준 大韓顎顔面成形再建外科學會 1996 Maxillofacial Plastic Reconstructive Surgery Vol.18 No.4
The term osteomyelitis literally means inflammation of bone marrow. It is described as an inflammatory condition of bone primarily engaging the medullary Following circulatory collapse and ischemia, the involved portions of the bone become necrotic. Cellulitis and osteomyelitis are the most frequent complications of fractures of the mandible and maxilla, because there is an abscessed tooth in the line of fracture. Since most fractures are compound fractures, infection may develop because of contact with oral secretions or outside air. The treatment of chronic osteomyelitis is still under debate. Some authors rely on antibiotics alone, while others advocate combination with surgery. But when infection occurs, establish proper drainage and administer antibiotics. Author treated a case of infected mandibular fracture with mandibular osteotomy, sequestrectomy, iliac bone graft and hyperbaric oxygen therapy, who had suffered suppurative osteomyelitis and mandibular nonunion following the open reduction of the mandibular fracture.
요약된 Partitioned-Layer Index : Partitioned-Layer Index의 임의 접근 횟수를 줄이는 Top-k 질의 처리 방법
허준석(Jun-Seok Heo) 한국멀티미디어학회 2010 멀티미디어학회논문지 Vol.13 No.9
Top-k 질의는 데이터베이스에서 사용자가 가장 원하는 k개의 객체를 구하는 질의이다. Top-k 질의를 효율적으로 처리하는 대표적인 연구로 Partitioned-Layer Index (간단히, PL-index) 방법이 있다. PL-index는 데이터베이스를 여러 개의 더 작은 데이터베이스로 분할하고 각 분할된 데이터베이스에 대해 sublayer들의 list (간단히, sub layer List)를 구성한다. 이때, 분할된 데이터베이스에 대해서 top-i 결과가 될 수 있는 객체들을 그 분할된 데이터베이스에 대한 i번째 sublayer로 구성한다. 그리고 주어진 질의에 맞춰 그 sublayer list들을 병합함으로써 질의 결과를 구한다. PL-index는 질의 처리 시 데이터베이스로부터 읽어 들이는 객체의 개수가 매우 작다는 장점을 가지지만, sublayer list들을 병합할 때에 임의 접근(random access)이 많이 발생하기 때문에 디스크 기반의 데이터베이스 환경에서 질의 처리 성능이 저하된다. 이에 본 논문에서는 임의 접근 횟수를 줄임으로써 디스크 기반의 데이터베이스 환경에서 PL-index의 질의 처리 성능을 크게 향상시키는 요약된(Abstracted) Partitioned-Layer Index (간단히, APL-index)를 제안한다. 먼저, PL-index의 각 sublayer를 가상의 (점) 객체로 요약함으로써 sublayer list들을 이러한 점 객체들의 list들(즉, APL-index)로 변형한다. 그리고 APL-index에 대해 질의 처리를 가상으로 수행하여 실제 질의 처리 시 접근할 sublayer를 예측한다. 그리고 예측된 sublayer들을 sublayer list별로 한꺼번에 읽어 들임으로 PL-index에서 발생하는 임의 접근 횟수를 줄인다. 합성 데이터와 실제 데이터에 대한 실험을 통하여 제안한 APL-index가 PL-index의 임의 접근 횟수를 크게 줄일 수 있음을 보인다. Top-k queries return k objects that users most want in the database. The Partitioned-Layer Index (simply, the PL-index) is a representative method for processing the top-k queries efficiently. The PL-index partitions the database into a number of smaller databases, and then, for each partitioned database, constructs a list of sublayers over the partitioned database. Here, the i<SUP>th</SUP> sublayer in the partitioned database has the objects that can be the top-i object in [he partitioned one. To retrieve top-k results, the PL-index merges the sublayer lists depending on the user's query. The PL-index has the advantage of reading a very small number of objects from the database when processing the queries. However, since many random accesses occur in merging the sub layer lists, query performance of the PL-index is not good in environments like disk-based databases. In this paper, we propose the Abstracted Partitioned-Layer Index (simply, the APL-index) that significantly improves the query performance of the PL-index in disk-based environments by reducing the number of random accesses. First, by abstracting each sublayer of the PL-index into a virtual (point) object, we transform the lists of sublayers into those of virtual objects (i.e., the APL-index). Then, we virtually process the given query by using the APL-index and, accordingly, predict sublayers that are to be read when actually processing the query. Next, we read the sublayers predicted from each sub layer list at a time. Accordingly, we reduce the number of random accesses that occur in the PL-index. Experimental results using synthetic and real data sets show that our APL-index proposed can significantly reduce the number of random accesses occurring in the PL-index.
In-depth considerations for better polyelectrolytes as interfacial materials in polymer solar cells
Yeo, Jun-Seok,Kang, Minji,Jung, Yen-Sook,Kang, Rira,Lee, Seung-Hoon,Heo, Youn-Jung,Jin, Sung-Ho,Kim, Dong-Yu,Na, Seok-In Elsevier 2016 Nano energy Vol.21 No.-
<P><B>Abstract</B></P> <P>We perform a comprehensive study to achieve better polyelectrolytes (PEs) as electron-transport layers (ETLs) in polymer solar cells (PSCs). Three well-known PEs – PFN, PEIE, and WPF – are chosen as model systems and investigated with variations in their backbone structures and the state of the amine functionalities on their side chains. Respectively optimized PSCs using the three PEs exhibit different cell-performances, mainly owing to the diode characteristics of built-in potential and recombination strength. To identify how such deviated device-performances correlate with the structural features of PEs, the modulated interfaces of ITO/PEs and PEs/active layer are studied in detail. It is found that conjugated backbones and larger counter-anions on side chains can promote the modulation of ITO work functions (WFs) and that a large amount of protonated amines on PEs is beneficial for junction properties with a subsequent active layer. Additionally, our results indicate that interfacial dipole and electrical doping between the PE and active layer, in addition to WF modulation of the ITO cathode, are important for device efficiency. Accordingly, with the aid of the molecular features of PEIE, PEIE-PSCs exhibit excellent device efficiency and stability compared with PFN- and WPF-PSCs. In the PTB7-th:PC<SUB>71</SUB>BM system, a remarkable power-conversion efficiency of 9.97% is achieved with a single PEIE ETL.</P> <P><B>Highlights</B></P> <P> <UL> <LI> Chemical structure and performance of polyelectrolytes (PEs) in PSCs are correlated. </LI> <LI> Interfacial dipole and doping between PEs and active layer lead to efficient PSCs. </LI> <LI> PEIE-based PSCs have excellent device efficiency and high stability. </LI> <LI> Especially, in the PTB7-th system, encouraging efficiency of 9.97% is achieved. </LI> </UL> </P> <P><B>Graphical abstract</B></P> <P>[DISPLAY OMISSION]</P>
IPv4/IPv6 터널링 환경에 적합한 패킷 필터링 기능 설계 및 구현
허석렬(Seok-Yeol Heo),이완직(Wan-Jik Lee),김경준(Kyung-Jun Kim),정상진(Sang-Jin Jeong),신명기(Myung-Ki Shin),김형준(Hyoung-Jun Kim),한기준(Ki-Jun Han) 한국정보과학회 2006 정보과학회논문지 : 정보통신 Vol.33 No.6
현재의 모든 IPv4망을 향후 단기간 내에 IPv6망으로 대체하는 것은 높은 비용과 기술적인 제약이 예상되며 이런 점 때문에 상당한 기간 동안 IPv4와 IPv6가 공존하게 될 것이다. IPv4와 IPv6가 상호 공존하는 환경에서는 각각의 프로토콜을 기반으로 하는 보안에 문제가 없더라도 연동에 따른 보안 문제가 새롭게 발생한다. 따라서 IPv6로의 효과적인 이전과 정착을 위해서는 IPv4/IPv6 연동과정에서 발생하는 다양한 보안 위협에 대한 분석과 이에 대한 해결 방안이 반드시 필요하다. 본 논문에서는 IPv4/IPv6연동 환경에서 발생할 수 있는 보안 위험요소를 막기 위해 터널링 연동환경에 적합한 패킷 필터링 규칙을 제시하였다. 또한, 제시된 패킷 필터링 규칙을 기반으로 리눅스 시스템의 넷필터(netfilter)와 ip6tables 형태로 터널링 환경에 적합한 패킷 필터링 기능을 설계?구현하였다. 그리고 시험용 테스트베드 터널링 연동환경에서 정상적으로 동작하는 것을 확인하였다. As substituting IPv6 network for all IPv4 network in a short time seems unattainable due to high cost and technical limitation, IPv4 and IPv6 are expected to coexist for a certain period of time. Under the coexisting environment of IPv4 and IPv6, interworking brings a number of extra security considerations even if it may have no security problem for each protocol respectively. Thus, the analysis and solutions for those various attacks toward IPv4/IPv6 interworking-related security are inevitably required for the sake of effective transition and settlement to IPv6. In this paper, we carried out a proper rule of packet filtering for IPv6-in-IPv4 tunneling interworking environment to protect the IPv4/IPv6 interworking-related security attacks. Design and implementation of the packet filtering system suitable for IPv4/IPv6 tunneling environment in the form of Linux netfilter and ip6tables are also shown. Thru this study, the packet filtering system was found operating correctly in the tunneling mechanism.