http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
M-Doped TiO<sub>2</sub> (M=Co, Cr, Fe)의 제조 : 전자 밴드구조-(1)
배상원,김현규,지상민,장점석,정의덕,홍석준,이재성,Bae, Sang-Won,Kim, Hyun-Gyu,Ji, Sang-Min,Jang, Jum-Suk,Jeong, Euh-Duck,Hong, Suk-Joon,Lee, Jae-Sung 한국세라믹학회 2006 한국세라믹학회지 Vol.43 No.1
The electronic band structures of Metal-doped titanium dioxide, M-doped $TiO_2$ (M=Co, Cr, Fe), have been studied by using XRD, UV-vis diffuse reflectance spectrometer and FP-LAPW (Full-Potential Linearized Augmented-Plane-Wave) method. The UV-vis of M-doped $TiO_2$ (M=Co, Cr, Fe) showed two absorption edges; the main edge due to the titanium dioxide at 387 nm and a shoulder due to the doped metals at around 560 nm. The band gap energies of Co, Cr and Fe-doped $TiO_2$ calculated by FP-LAPW method were 2.6, 2.0, and 2.5 eV, respectively. The theoretically calculated band gap energy of $TiO_2$ by using FP-LAPW method was the same as experimental results. FP-LAPW method will be useful for fabrication and development of photo catalysts working under visible light.
모든 색을 커버하는 최소 두께 직사각형 고리를 계산하는 알고리즘
배상원(Sang Won Bae) Korean Institute of Information Scientists and Eng 2017 정보과학회논문지 Vol.44 No.3
In this paper, we present an algorithm that computes a minimum-width color spanning axis-parallel rectangular annulus. A rectangular annulus is a closed region between a rectangle and its offset, and it is thus bounded by two rectangles called its outer and inner rectangles. The width of a rectangular annulus is determined by the distance between its outer and inner rectangles. Given n points in the plane each of which has one of the prescribed k colors, we call a rectangular annulus color spanning if it contains at least one point for each of the k colors. Prior to this work, there was no known exact algorithm that computes a minimum-width color-spanning rectangular annulus. Our algorithm is the first to solve this problem and it runs efficiently in O(n-k)³nlogn) time.
천연경신에 (天然更新) 의한 소나무 유령임분의 (幼齡林分) 구조와 무육방법 (撫育方法)
배상원 ( Sang Won Bae ) 한국산림과학회 1994 한국산림과학회지 Vol.83 No.1
This study is performed to consider the fitness of natural regenerating method and tending methods used now by surveying the stand structure and regenerating states of the 9 natural regenerated Pinus densiflora stands in Kangwon province. As a special consideration, it deals with the tending methods on the seedlings of Pinus densiflora and broad-leaved tree(Quercus mongolica) under competition. By the consideration on the number of trees, growing capacity and stand structures of Pinus densiflora stands, it reveals that Pinus densiflora is in the inferior in numbers at the competition to the broad-leaved species, and it could not occupy the stands as the dominant species if the stands were not tended. It is estimated that natural regeneration of Pinus densiflora stands by the clearcutting or seed tree system could not achieved due to the abundance of ground vegetation. Short-term shelter-wood system or strip stand method may be proposed as a successful method of natural regeneration. As the visible tending method for seedlings, the method which apply the mixed forest in group of Pinus densjlora and Querczes mongolica different by the growing capacity and distribution characteristics is better thaw the one which tend the Pinus densiflora only.
L₁ Shortest Paths with Isothetic Roads
배상원(Sang Won Bae),김재훈(Jae-Hoon Kim),좌경룡(Kyung-Yong Chwa) 한국정보과학회 2005 한국정보과학회 학술발표논문집 Vol.32 No.2
We present a nearly optimal (O(v min(v; n)n log n) time and O(n) space) algorithm that constructs a shortest path map with n isothetic roads of speed º under the L₁ metric. The algorithm uses the continuous Dijkstra method and its efficiency is based on a new geometric insight; the minimum in-degree of any nearest neighbor graph for points with roads of speed v is Θ(v min(v, n)), which is first shown in this paper. Also, this algorithm naturally extends to the multi-source case so that the Voronoi diagram for m sites can be computed in O(v min(v, n)(n + m) log(n + m)) time and O(n + m) space, which is also nearly optimal.
배상원(Sang Won Bae),좌경룡(Kyung-Yong Chwa) 한국정보과학회 2004 한국정보과학회 학술발표논문집 Vol.31 No.2Ⅰ
본 논문에서는 L₁평면상에 도로망이 주어져 있어서 여행자들이 그 도로들을 이용하여 더욱 빠르게 이동할 수 있는 가정하에서 가장 기초적인 기하 문제중에 하나인 두 점 사이의 최단 경로를 찾는 문제를 다룬다. 이 때, 두 점 사이의 거리는 L₁거리가 아닌 주어진 도로들을 이용하여 두 점 사이를 이동할 때 필요한 최소시간으로 측정한다. 단순한 평면상에서의 최단경로와는 달리 도로망이 설치되어 있는 경우는 그것을 해결하기가 일반적으로 쉽지 않다. 본 논문에서는 도로망이 있는 평면에 대한 깊은 관찰과 이해를 통해 도로망이 설치되어 있는 L₁평면상에서의 최단경로 문제를 해결하는 효율적인 알고리즘을 제시한다. 덧붙여, 본 논문에서 제시하는 문제 해결 방법은 L₁평면 뿐만 아니라 유클리드 평면에도 어렵지 않게 적용할 수 있으며 보로노이 다이어그램으로의 일반화도 간단하다.