• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 A
• /
• pp.510-512
• /
• 2005

This paper introduces the development of automatic system for estimation of digital relay performance. We have developed an automatic estimation system "HRV2004(Himap Relay function Verifier 2004)" for digital relay in 2004 and it has been verified in the field for one years. This paper describes the development details and field experience of HRV2004. HRV2004 can perform a series of jobs required for the relay testing in one environment and could handle most of all models of protective relay currently produced by Hyundai Heavy Industries. The functionality of this program consists of GUI of relay setting for beginner, fault record analysis and relay performance estimation. The core of this system is an automatic reporting of estimation test. If user is only click a button for relay estimation and one will received testing report to deliver customer. Additional benefit is fast response than the manual estimation. For example, the manual estimation takes spending 6 hours but this system is about 15 minutes.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2007년도 춘계학술발표대회
• /
• pp.1205-1208
• /
• 2007

모바일 애드혹 네트워크는 기존의 셀룰러 네트워크와는 달리 고정된 기지국이 존재하지 않고 모바일 노드들만으로 구성된 네트워크이다. 모바일 애드혹 네트워크의 각각의 노드들은 제한된 자원과 한정된 용량을 가진 배터리로 동작한다. 만일 이 배터리를 모두 소모하게 된다면 중간 노드들이 다운이 되고, 결과적으로 전체 네트워크가 단절되는 문제가 발생할 수 있다. 기존의 전송 전력을 고려하여 경로를 설정하는 기법인 CLUSTERPOW는 노드 간에 연결되는 전송 전력을 최소화함으로써 데이터 전송 시 소비되는 전력을 줄이고자 하였다. 그러나 이 기법은 proactive 방식의 라우팅 프로토콜에는 적합하나 reactive 방식의 라우팅 프로토콜에는 적합하지 않다. 따라서 본 논문에서는 reactive 방식의 특성에 맞는 전송 전력 설정 기법인 FSRS(Fast Search Reverse Setting) 기법을 제안하였다. FSRS 기법은 reactive 방식에서 사용하는 컨트롤 패킷 플라딩을 사용한 경로 설정에서의 오버헤드를 줄이고자 클러스터 간 플라딩을 통해 목적지 노드를 빠르게 찾고 한정된 클러스터 간 경로를 통해 전송 전력을 고려한 세부적인 경로를 설정한다. FSRS 기법은 기존의 CLUSTERPOW 기법과 마찬가지로 효율적인 전송 전력으로 경로를 설정하였으며 또한 네트워크 생존 시간을 CLUSTERPOW보다 평균 43% 연장시켰다.

• 제어로봇시스템학회논문지
• /
• 제21권9호
• /
• pp.807-810
• /
• 2015

In this paper, a finite impulse response(FIR) fixed-lag smoother is proposed for discrete-time nonlinear systems. If the actual state trajectory is sufficiently close to the nominal state trajectory, the nonlinear system model can be divided into two parts: The error-state model and the nominal model. The error state can be estimated by adapting the optimal time-varying FIR smoother to the error-state model, and the nominal state can be obtained directly from the nominal trajectory model. Moreover, in order to obtain more robust estimates, the linearization errors are considered as a linear function of the estimation errors. Since the proposed estimator has an FIR structure, the proposed smoother can be expected to have better estimation performance than the IIR-structured estimators in terms of robustness and fast convergence. Additionally the proposed method can give a more general solution than the optimal FIR filtering approach, since the optimal FIR smoother is reduced to the optimal FIR filter by setting the fixed-lag size as zero. To illustrate the performance of the proposed method, simulation results are presented by comparing the method with an optimal FIR filtering approach and linearized Kalman filter.

• 대한조선학회논문집
• /
• 제53권4호
• /
• pp.275-281
• /
• 2016

One of the most important things for quality to meet ship-production schedule is an accuracy control. A ship is assembled by welding through whole production process, so it is important that loss by correction will not happen as much as possible by using some engineering skills like reverse design, reverse setting and margin for thermal shrinkage. These efforts are a quite effective in fabrication stages, but not in erection stages. If a ship block which consists of common steel is exposed to directional solar radiation, its dimensional accuracy will change high as time by its thermal expansion coefficient. Therefore, the measuring work would be often done at dawn or evening even with having a very accurate device. In this study, an FE analysis method is developed to solve this problem. It can change measured data affected by solar thermal distortion to ones not, even though ship-block is measured at an arbitrary time. It will use the time when measuring, the direction of block and the weather record by satellites. It is confirmed by a comparison between measured data of a ship-block and the result by suggested analysis method. Furthermore, a pre-processing system is also developed for fast application of the suggested analysis method.

• 한국세라믹학회지
• /
• 제48권6호
• /
• pp.504-509
• /
• 2011

In this study, the effect of superplasticizers on the dispersibility and hydration properties of cement with silica fume were investigated. Superplasticizers are used Naphthalene type, Ligno-sulfate type and polycarboxylate type. Compared with plastic viscosity of cement paste without superplasticizers(Plain), plastic viscosity of cement paste with superplasticizers are reduced and yield stress of cement pastes with each superplasticizer is increased rather than Plain. And then, plastic viscosity of cement paste with Naphthalene type superplasticizer was the least of all types. Compared with other two types, setting and hydration of cement paste with Polycarboxylate type(PC) superplasticizer is very fast. At compressive strength after 3-day, PC is higher than other two types, But, compressive strength of after 7-day and 28-day, PC is smaller than other two types.

• Journal of Computing Science and Engineering
• /
• 제8권2호
• /
• pp.119-128
• /
• 2014

The appearance of retinal blood vessels is an important diagnostic indicator of serious disease, such as hypertension, diabetes, cardiovascular disease, and stroke. Automatic segmentation of the retinal vasculature is a primary step towards automatic assessment of the retinal blood vessel features. This paper presents an automated method for the enhancement and segmentation of blood vessels in fundus images. To decrease the influence of the optic disk, and emphasize the vessels for each retinal image, a multidirectional morphological top-hat transform with rotating structuring elements is first applied to the background homogenized retinal image. Then, an improved multiscale line detector is presented to produce a vessel response image, and yield the retinal blood vessel tree for each retinal image. Since different line detectors at varying scales have different line responses in the multiscale detector, the line detectors with longer length produce more vessel responses than the ones with shorter length; the improved multiscale detector combines all the responses at different scales by setting different weights for each scale. The methodology is evaluated on two publicly available databases, DRIVE and STARE. Experimental results demonstrate an excellent performance that approximates the average accuracy of a human observer. Moreover, the method is simple, fast, and robust to noise, so it is suitable for being integrated into a computer-assisted diagnostic system for ophthalmic disorders.

• 한국멀티미디어학회논문지
• /
• 제16권5호
• /
• pp.619-628
• /
• 2013

이 논문에서는 CAMshift 알고리즘과 칼만 필터(Kalman filter) 알고리즘을 결합하여 강건하게 개선된 추적모듈에 관해서 기술한다. 물체를 추적할 때 사용되는 CAMshift 알고리즘은 추적과정에서 탐색 윈도우를 설정할 때 물체가 이동하는 방향 및 속도를 고려하지 않는다는 단점이 있었다. 이를 해결하기 위해 칼만 필터 알고리즘을 추가한다면 현재 물체의 위치 및 속도 등의 정보를 바탕으로 다음 순간의 물체 위치를 추정할 수 있게 된다. 이 추정값을 기준으로 CAMshift 추적 시 탐색 윈도우를 재설정함으로써, 기존 CAMshift 알고리즘만으로는 추적이 불가능한 고속 이동물체에 대해서도 보다 정확한 추적이 가능하게 되었다. 또 본 연구에서는 추적 대상의 HSV와 YCrCb 두 색상정보를 동시에 고려함으로써 단일 색정보를 이용하는 검출보다 더 강인한 결과를 얻을 수 있었다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권10호
• /
• pp.582-590
• /
• 2000

A fast optimal path planning algorithm using the analog Cellular Nonlinear Circuits(CNC) is proposed. The analog circuits based optimal path planning is very useful since most of the optimal path planning problems require real time computation. There has already been a previous study to implement the dynamic programming with analog circuits. However, it could not be applied for the practically large size of problems since the algorithm employs the mechanism of reducing its input current/voltage by the amount of cost, which causes outputs of distant cells to become zero. In this study, a subgoal-based dynamic programming algorithm to compute the optimal path is proposed. In the algorithm, the optimal paths are computed regardless of the distance between the starting and the goal points. It finds subgoals starting from the starting point when the output of the starting cell is raised from its initial value. The subgoal is set as the next initial position to find the next subgoal until the final goal is reached. The global optimality of the proposed algorithm is discussed and two different kinds of simulations have been done for the proposed algorithm.

• Journal of Hospice and Palliative Care
• /
• 제15권4호
• /
• pp.188-192
• /
• 2012

Palliative medicine has shown demonstrated benefit for patients with serious illness, their families, and hospital systems. As such, the demand for palliative care services is growing at a fast pace, and health care facilities frequently struggle to develop and implement effective and sustainable methods of providing this care. As with any new system, challenges and barriers naturally exist to instituting palliative care. Undertaking careful assessment, planning, and resource allocation can provide the greatest likelihood of success when developing these novel yet much needed models of care. This summary paper offers a qualitative overview of the potential benefits and the rationale to implement robust palliative care systems. We briefly review the history of palliative medicine in the broadest sense and address several seminal works from the US palliative care literature. Core practices to establish and advance palliative medicine are suggested. Commentary is provided on some of the particular barriers to palliative system development that may need to be addressed in the context of Korean medical culture. Collectively, we hope this overview can contribute to a framework within which such research and development can occur, leading to increasingly effective and sustainable palliative medicine in Korea.

• 한국컴퓨터정보학회논문지
• /
• 제20권7호
• /
• pp.9-16
• /
• 2015

This paper proposes the parallel design of a shot change detection algorithm using frame segmentation and moving blocks. In the proposed approach, the high parallel processing components, such as frame histogram calculation, block histogram calculation, Otsu threshold setting function, frame moving operation, and block histogram comparison, are designed in parallel for NVIDIA GPU. In order to minimize memory access delay time and guarantee fast computation, the output of a GPU kernel becomes the input data of another kernel in a pipeline way using the shared memory of GPU. In addition, the optimal sizes of CUDA processing blocks and threads are estimated through the prior experiments. In the experimental test of the proposed shot change detection algorithm, the detection rate of the GPU based parallel algorithm is the same as that of the CPU based algorithm, but the average of processing time speeds up about 6~8 times.