• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.11
• /
• pp.73-82
• /
• 2003

In this paper, a simultaneous buffer insertion and routing method is proposed under the constraints of wire and buffer locations by macro or IP blocks. A new grid graph is proposed to describe the regions in which buffers(or both wires and buffers) are not available. Under this grid we describe a method of constructing a buffeted tree that minimize the maximum source to sink delay. The method is based on the dynamic programming with pruning unnecessary partial solutions. The proposed method improved the slack time of the delay by 19% on the average while using less buffers and similar wire length.

• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.936-946
• /
• 2009

A graph cuts method has recently attracted a lot of attentions for image segmentation, as it can globally minimize energy functions composed of data term that reflects how each pixel fits into prior information for each class and smoothness term that penalizes discontinuities between neighboring pixels. In previous approaches to graph cuts-based automatic image segmentation, GMM(Gaussian mixture models) is generally used, and means and covariance matrixes calculated by EM algorithm were used as prior information for each cluster. However, it is practicable only for clusters with a hyper-spherical or hyper-ellipsoidal shape, as the cluster was represented based on the covariance matrix centered on the mean. For arbitrary-shaped clusters, this paper proposes graph cuts-based image segmentation using mean shift analysis. As a prior information to estimate the data term, we use the set of mean trajectories toward each mode from initial means randomly selected in $L^*u^*{\upsilon}^*$ color space. Since the mean shift procedure requires many computational times, we transform features in continuous feature space into 3D discrete grid, and use 3D kernel based on the first moment in the grid, which are needed to move the means to modes. In the experiments, we investigate the problems of mean shift-based and normalized cuts-based image segmentation methods that are recently popular methods, and the proposed method showed better performance than previous two methods and graph cuts-based automatic image segmentation using GMM on Berkeley segmentation dataset.

• The Journal of the Convergence on Culture Technology
• /
• v.7 no.3
• /
• pp.463-468
• /
• 2021

In this paper, when a refractive index grating and a gain grating were simultaneously present in a DFB laser having a wavelength of 1.55 ㎛, a dielectric film coating was applied so that reflection did not occur on the right mirror surface, so that 𝜌_r=0. In case of 𝛿L>0, the characteristics of the oscillation frequency and oscillation gain were analyzed. When the grating phase of the left mirror surface continues to decrease from 𝜋, the graph lines of each mode gradually shift to the left. In case of 𝜅L=10, the threshold gain of the oscillation mode is the lowest. In this case, the mode selectivity is relatively low. From 𝜅L=0.5 to 𝜅L=6, the mode selectivity and the frequency stability are excellent. In the case of DFB lasers with an anti-reflection coated mirror, the threshold gain of the oscillation mode increases but the mode selectivity is about twice as excellent, compared with DFB lasers of having two cleaved facets.

• Proceeding of EDISON Challenge
• /
• 2012.04a
• /
• pp.65-68
• /
• 2012

본 연구에서는 XFOIL을 사용하여 설계된 30% 두께를 가지며 팁에서의 두께가 코드의 1.5%인 풍력터빈용 에어포일의 공력 특성을 해석하였다. 받음각에 따른 양력 항력 곡선 및 양항비를 XFOIL에서 얻어낸 결과와 EDISON_CFD 해석 결과를 상호 비교 하였다. EDISON_CFD에서의 해석을 위한 격자의 형태를 격자균일성을 생각하여 큰 타원과 작은 타원을 합쳐 만들었다. 수치 기법으로 Roe의 FDS를 선택하여 데이터를 수집하였다. 그 결과로 나타낸 압력계수와 양항비 그래프를 보면 선형 구간에서 양력은 XFOIL 해석 결과와 잘 일치하는 결과를 보여주었다. 그러나 항력에서 약1.5배 정도 EDISON_CFD의 결과가 크게 나옴으로써 양항비의 차이를 보이는 것으로 나타났다. 실속이후에서는 XFOIL의 신뢰도가 떨어지는 경향이 있어 특히 실속이후에서는 CFD의 해석결과가 필요한 것으로 보인다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.4
• /
• pp.99-106
• /
• 2024

The problem of the bridges(Hasjiwokakero, Hasi) puzzle, which connects the bridge(edge) required by the island(vertex) without crossing the horizontal and vertical straight bridges except for the diagonal to form a connected network, is a barren ground for research without any related research. For this problem, there is no algorithm that presents a generalized exponential time brute-force or branch-and-bound method. This paper obtained the initial solution of the lattice graph by drawing a grid without diagonal lines for a given BP, removing unnecessary edges, and supplementing essential bridges. Next, through insufficient island pair path matching, the method of adding insufficient edges to the route and deleting the crossed surplus edges(bridges) was adopted. Applying the proposed algorithm to 24 benchmarking experimental data showed that accurate solutions can be obtained for all problems.

• The Journal of the Convergence on Culture Technology
• /
• v.8 no.5
• /
• pp.483-488
• /
• 2022

In this paper, when a gain grating and a refractive index grating exist simultaneously in a DFB laser diode having a wavelength of 1.55 ㎛, an anti-reflection coating is applied to the right mirror surface so that ρ_r=0. In case of δL<0, the characteristics of the oscillation frequency and oscillation gain have been analyzed. Whenever the phase of the grating on the left side of the mirror continuously decreases by π/2, the δL value of each oscillation mode decreases by about 0.6 to the left of the graph lines of each oscillation mode. The case of the oscillation mode having the lowest threshold gain is the case of κL=10, and in this case, the mode selectivity is relatively low compared to the case of other values of κL. From κL=0.1 to κL=6, the mode selectivity and the frequency stability are excellent. As the mode selectivity is excellent, the frequency stability is excellent. Compared to the case with two cleaved mirrors, the DFB laser diode with anti-reflection coating increases the threshold gain of the oscillation mode by about 2 times, but the mode selectivity becomes about 2 times better.

• Journal of Broadcast Engineering
• /
• v.18 no.4
• /
• pp.609-618
• /
• 2013

This paper proposes a fast image segmentation method that gives high segmentation performance as graph-cut based methods. Graph-cut based image segmentation methods show high segmentation performance, however, the computational complexity is high to solve a computationally-intensive eigen-system. This is because solving eigen-system depends on the size of square matrix obtained from similarities between all pairs of pixels in the input image. Therefore, the proposed method uses the small-size square matrix, which is obtained from all the similarities among regions obtained by segmenting locally an image into several regions by graph-based method. Experimental results show that the proposed multi-scale image segmentation method using the algebraic multi-grid shows higher performance than existing methods.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2012.02a
• /
• pp.193-194
• /
• 2012

그래핀(graphene)은 탄소원자가 육각형 벌집 모양 배열의 격자구조를 가지는 원자 한층 두께의 이차원 물질이다. 그래핀은 전도띠(conduction band)와 가전자띠(valence band)가 한 점에서 만나고 에너지와 역격자의 k 벡터가 선형적으로 비례하는 에너지 구조를 가진다. 이로 인해 그래핀은 매우 빠른 전하 이동도를 가지며 원자 한 층의 두께임에도 불구하고 약 2.3%의 빛을 흡수할 수 있으며 자외선 영역부터 적외선 영역까지의 넓은 파장대의 빛을 흡수 할 수 있다. 이와 같은 그래핀의 우월한 성질을 이용하면 광 응답에 고속으로 반응하고 높은 주파수의 광통신에서도 작동 할 수 있는 그래핀 광소자를 제작할 수 있게 된다. 하지만 미래의 고속 그래핀 광소자를 실현하기에 앞서 그래핀의 광응답에 대한 정확한 이해가 필요하다. 그리하여 본 연구에서는 그래핀 광소자를 제작하고 광소자의 광응답 전기적 성질을 분석하여 그래핀의 광응답 특성을 얻어내고자 실험을 진행하였다. 그래핀을 채널 물질로 하고 소스, 드레인, 후면 게이트를 가지는 일반적인 그래핀 전계효과 트랜지스터(field-effect transistor)를 제작하고 채널에 빛을 비추고 비추지 않은 상태에서의 전기적 성질을 측정하고 그 때 얻어진 그래프의 광응답의 원인을 조사하였다. 이 때 얻어지는 $I_D-V_G$ 그래프가 광 조사 시 왼쪽으로 이동하게 되는데 이의 원인을 각 게이트 전압 구간별로 $I_D$-t 그래프를 획득하여 분석하였다. 또한 광원에 펄스를 인가하여 펄스 형태의 광원을 그래핀 전계효과 트랜지스터에 조사시키고 이에 따른 전기적 성질 변화를 관찰하였다 이 때 다양한 게이트 전압이 인가된 상태에서 레이저 펄스 광원에 의한 광전류를 검출하였으며 이를 분석하였다.

• Spatial Information Research
• /
• v.21 no.5
• /
• pp.63-72
• /
• 2013

This paper analyzed the flood propagation characteristics of each flood elevation due to failure of embankment in Muju Namdae Stream using recursive call algorithm. A flood propagation order by the flood elevation was estimated by setting destruction point at Beonggu and Chasan small dam through recursive call algorithm and then, the number of grids of each flood propagation order and accumulated inundation area were calculated. Based on the flood propagation order and the grid size of DEM, flood propagation time could be predicted each flood elevation. As a result, the study could identify the process of flood propagation through distribution characteristic of the flood propagation order obtained from recursive call algorithm, and could provide basic data for protection from flood disaster by selecting the flood vulnerable area through the gradient pattern of the graph for accumulated inundation area each flood propagation order. In addition, the prediction of the flood propagation time for each flood water level using this algorithm helped provide valuable information to calculate the evacuation path and time during the flood season by predicting the flood propagation time of each flood water level.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.286-289
• /
• 2011

VTK와 OSG는 컴퓨터 그래픽스 분야에서 널리 사용되는 오픈 소스 라이브러리이다. VTK는 데이터 가시화에 초점을 맞추어 개발된 라이브러리로 다양한 격자 구조의 수치 데이터를 위한 고수준의 가시화 알고리즘을 제공한다. OSG는 다수의 폴리곤으로 구성된 복잡한 전경을 빠르고 효율적으로 렌더링할 수 있도록 하는 라이브러리로 전경 그래프(scene graph)와 다양한 실시간 렌더링 기술을 제공한다. VTK와 OSG는 서로 다른 목적으로 개발된 라이브러리이기 때문에 어느 한 라이브러리만을 이용해서 대용량의 수치 데이터를 가시화하는 것은 많은 노력을 필요로 한다. 따라서 VTK의 고수준 가시화 알고리즘과 OSG의 실시간 렌더링 기술을 접목하여 대용량 데이터를 빠르게 가시화하고자 하는 시도가 여러 연구 그룹에서 꾸준히 있어왔다. 본 논문에서는 테라 스케일의 거대 용량 수치 데이터를 빠르게 가시화하기 위한 방법으로 병렬 VTK 엔진과 OSG 실시간 렌더링 엔진을 접목한 병렬 가시화 시스템을 제안하고자 한다. 또, 본 논문에서 제안하는 가시화 시스템을 이용해서 실제 테라 스케일 데이터에 적용한 사례를 소개한다.