http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A Border Line-Based Pruning Scheme for Shortest Path Computations
( Jinkyu Park ),( Daejin Moon ),( Eenjun Hwang ) 한국인터넷정보학회 2010 KSII Transactions on Internet and Information Syst Vol.4 No.5
With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, A* algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.
Compressed memory swap for QoS of virtualized embedded systems
Jeaho Hwang,Jinkyu Jeong,Hwanju Kim,Jeonghwan Choi,Joonwon Lee IEEE 2012 IEEE transactions on consumer electronics Vol.58 No.3
<P>Virtualization has recently drawn attraction in smart consumer electronics as a way of completely isolating the main applications, which are in charge of the primary functionality of a device, from untrusted third-party applications. In a virtualized embedded device, flexible memory management is required to run multiple VMs efficiently on resource-constrained hardware. This paper presents an in-memory compressed swap device (CSW) for the virtualized consumer electronics environment. It swaps out only the memory of third-party applications in response to memory pressure on the main applications, to ensure its quality of service. To this end, CSW collaborates with memory ballooning, which is a scheme for dynamic memory partitioning between VMs. By compressing the swapped out memory pages, CSW can effectively provide memory to the main applications while preserving the availability of thirdparty applications. We implemented our scheme in a Xenbased virtualized system that has limited resources similar to conventional consumer electronics devices. The evaluation results show that CSW successfully provides memory to the main VM with a reasonable cost, while the third-party applications are not killed.</P>
실험반응조를 이용한 하수관에서의 재포기현상 재현 가능성에 관한 연구
황환국(Hwankook Hwang),민상윤(Sangyun Min),조진규(Jinkyu Cho) 한국지반환경공학회 2014 한국지반환경공학회논문집 Vol.15 No.8
하수관 내에서의 하수와 미생물의 반응에 대한 실험은 이미 매설된 하수관에 적용할 경우 실험조건의 변화가 제한적이며 실험시간에도 한계가 있다. 본 연구에서는 이러한 하수관 내에서의 하수와 미생물의 반응에 대하여 DO를 제한 조건으로 설정하였을 경우, 실험실 내에서 실험반응조를 통해 재현하는 방법에 대하여 연구하였다. 하수관 내에서의 DO 농도는 기상 중의 산소가 하수 내로 이동하는 재포기현상에 의해 조절된다. 이러한 현상을 이용하여 임의로 실험반응조에서 하수관 내의 유하조건을 조절하고 재포기현상을 재현하여 유하조건과 재포기계수와의 상관관계를 얻을 수 있으며, 교반강도(속도경사)에 따른 재포기계수와 하수관거에서의 유하조건에 따른 재포기계수의 상관관계를 통해 동일한 재포기계수 값을 갖는 교반강도와 유하조건을 설정할 수 있다. 이러한 결과를 통해 재포기계수를 제한인자로 설정하여 실험을 실시할 경우 하수관거에서의 상황을 실험반응조를 통해 재현할수가 있었다. The microorganism decomposition experiment of sewage in the underground sewer has the limit of experiment condition and time. The way to reproduce the microorganism decomposition in the underground sewer was studied using batch reactor setting up the DO as a limiting condition. The DO concentration in the sewer is controlled by reaeration. It is possible to obtain correlation between flow condition and reaeration coefficient through the reproduction of reaeration phenomenon by controlling the flow condition in the sewer using this phenomenon. And it is possible to set the flow condition and agitation intensity (velocity gradient) that has the same reaeration coefficient using the correlation between the reaeration coefficient with the flow condition and reaeration coefficient with the agitation intensity. The circumstances in the sewer system was reproduced using batch reactor setting up the DO as a limiting condition from these results.
Face Recognition based on Non-intrusive 3-D Face Modeling System
Joongrock Kim,Sunjin Yu,Jinkyu Hwang,Sooyeon Kim,Sangyoun Lee 대한전자공학회 2009 ITC-CSCC :International Technical Conference on Ci Vol.2009 No.7
This paper proposes a nonintrusive three-dimensional (3-D) face data acquisition and face recognition system. Although a two-dimensional (2-D) face recognition system can achieve a reliable recognition rate, its performance can be degraded by illumination and pose variation. To eliminate these factors in 2-D face recognition, 3-D face recognition which uses 3-D face data has received much attention. To acquire accurate 3-D face data, we develop the nonintrusive 3-D face acquisition system consisting of a stereo vision system and an invisible 850 nm near-infrared line laser. By using 3-D face data, 2.5-D face recognition is performed to verify the recognition performance. The experiment results show the reconstructed 3-D face data consisting of about 30,000 3-D points and the recognition rate is 96%.
김우원(Woowon Kim),황진규(Jinkyu Hwang),이상윤(Sangyoun Lee) 한국방송·미디어공학회 2011 한국방송공학회 학술발표대회 논문집 Vol.2011 No.7
얼굴의 각도와 위치는 많은 정보를 포함하고 있어 다양한 분야에서 응용이 가능하다. 본 논문에서는 하나의 2 차원 영상만으로 사람 얼굴의 3 차원 각도와 위치를 파악하는 시스템을 제안한다. 얼굴 특징 점 검출 기술, 포즈 판정 기술, 오류 안정화 기술 등을 단계별로 설명하며, 비디오 데이터베이스를 통한 실험으로 시스템의 성능을 분석하였다. 오류는 5 도 안팎의 적은 수치이며 개인용 컴퓨터에서 실시간 수행이 가능하다.
Pose-invariant Face Recognition
Sunjin Yu,Joongrock Kim,Jinkyu Hwang,Sangyoun Lee 대한전자공학회 2008 ICEIC:International Conference on Electronics, Inf Vol.1 No.1
Pose-variation problem, there are various approaches for a 3D face recognition system which is able to use depth information. However, this created another head-pose estimation problem in terms of normalizing the 3D face data. This paper presents a pose-invariant face recognition system using an iterative feature-based 3D head pose-estimation. The proposed method uses 2D information with the AAM(Active Appearance Model) and 3D information with a 3D facial normal vector for a 3D face data. In order to verify the performance of the proposed method, we decompose rotational properties of 3D face database using the proposed iterative 3D head pose-estimation method and design two different experiments. Experimental results show that the proposed method is robust against pose variation.