• 전기학회논문지
• /
• 제59권2호
• /
• pp.407-410
• /
• 2010

This paper presents an advanced load allocation algorithm in Direct Load Control(DLC) system. It is important to aggregate a various demand side resource which is surely controllable at the peak power time for a successful DLC system. Previous load allocation algorithm appropriate for DLC system is based on interchanged information, but, this algorithm can not derive optimal solutions. In this paper, we develop the optimal algorithm and the new load allocation algorithm in polynomial time. The simulation results show that the proposed heuristic algorithm for DLC system is very effective.

• 한국통신학회논문지
• /
• 제27권2B호
• /
• pp.171-177
• /
• 2002

본 논문에서는 최근 장거리 초고속 광통신 시스템에 있어서 해결해야 할 문제로 대두되고 있는 편광모드분산 (PMD) 보상 시스템에 적용할 수 있는 새로운 방식의 편광상태(SOP) 추적 알고리즘에 대해 소개하였다. 새로운 SOP 추적 알고리즘은 본 연구팀에서 기존에 발표한 SOP 추적 알고리즘과 마찬가지로 헤테로다인 코히어런트 수신 방식을 근거로 하고 있으나 기존의 방법과는 달리 수시로 변하는 입력 신호의 SOP에 관계없이 항상 단 세 번만의 측정을 필요로 하기 때문에 동작 시간이 항상 일정하며 속도가 매우 빠른 장점이 있다. 이러한 특성은 매우 안정적이고 빠른 SOP 추적을 요하는 PMD 보상 시스템에 효과적으로 적용될 수 있다.

• 제어로봇시스템학회논문지
• /
• 제18권6호
• /
• pp.579-583
• /
• 2012

The purpose of this paper is to suggest IDE (Incremental Displacement Estimation) algorithm for the previously proposed visually servoed paired structured light system. The system is composed of two sides facing with each other, each with one or two lasers with a 2-DOF manipulator, a camera, and a screen. The 6-DOF displacement between two sides can be estimated by calculating the positions of the projected laser beams and rotation angles of the manipulators. In the previous study, Newton-Raphson or EKF (Extended Kalman Filter) has been used as an estimation algorithm. Although the various experimental tests have validated the performance of the system and estimation algorithms, the computation time is relatively long since aforementioned algorithms are iterative methods. Therefore, in this paper, a non-iterative incremental displacement estimation algorithm which updates the previously estimated displacement with a difference of the previous and the current observed data is introduced. To verify the performance of the algorithm, experimental tests have been performed. The results show that the proposed non-iterative algorithm estimates the displacement with the same level of accuracy compared to the EKF with multiple iterations with significantly less computation time.

• ETRI Journal
• /
• 제32권3호
• /
• pp.380-389
• /
• 2010

This paper presents a new edge-protection algorithm and its very large scale integration (VLSI) architecture for block artifact reduction. Unlike previous approaches using block classification, our algorithm utilizes pixel classification to categorize each pixel into one of two classes, namely smooth region and edge region, which are described by the edge-protection maps. Based on these maps, a two-step adaptive filter which includes offset filtering and edge-preserving filtering is used to remove block artifacts. A pipelined VLSI architecture of the proposed deblocking algorithm for HD video processing is also presented in this paper. A memory-reduced architecture for a block buffer is used to optimize memory usage. The architecture of the proposed deblocking filter is verified on FPGA Cyclone II and implemented using the ANAM 0.25 ${\mu}m$ CMOS cell library. Our experimental results show that our proposed algorithm effectively reduces block artifacts while preserving the details. The PSNR performance of our algorithm using pixel classification is better than that of previous algorithms using block classification.

• 한국컴퓨터정보학회논문지
• /
• 제15권1호
• /
• pp.61-69
• /
• 2010

로봇이 동작하는 환경을 완벽하게 커버리지 하기 위해서는 전체환경 지도를 가지고 있어야 한다. 그러나 대부분의 기존 커버리지 알고리즘은 로봇이 동작하기 전 사전에 생성된 지도가 있어야 동작 한다. 이런 이유로 기존의 커버리지 알고리즘은 미지의 환경에 바로 적용할 수 없는 문제를 가지고 있다. 미지의 환경에서 로봇이 모든 영역을 커버리지 하기위해서는 로봇스스로 환경 지도를 생성할 수 있어야한다. 본 논문에서는 SLAM 알고리즘을 통합하여 미지의 환경에서 로봇이 환경 지도를 생성하며 생성된 지도를 기반으로 커버리지를 수행하는 DmaxCoverage 알고리즘을 제안한다. 시뮬레이션 실험을 통해서 DmaxCoverage 알고리즘이 기존의 커버리지 알고리즘에 비해서 효율적임을 증명하였다.

• 전기학회논문지
• /
• 제60권6호
• /
• pp.1225-1228
• /
• 2011

This paper presents an advanced energy saving algorithm in building. It is important to aggregate a various demand side resource which is controllable on demand response environment. Previous demand side algorithm for building is restricted on peak power. In this paper, we suggest duty cycle algorithm for AHU on demand response to reduce the quantity of building power consumption. The test results show that the proposed algorithm is very effective.

• Communications for Statistical Applications and Methods
• /
• 제7권1호
• /
• pp.357-370
• /
• 2000

This study has adapted a genetic algorithm for an optimal design for the first time. the models that was used a simulation are the first and second order response surfaces model, Using an genetic algorithm in D-opimal it is more efficient than previous algorithms to get an object function. Not like other algorithm without any restrictions like troublesome about the initial solution not falling into a local optimal solution it's the most suitable algorithm.

• 산업경영시스템학회지
• /
• 제20권43호
• /
• pp.287-297
• /
• 1997

This research is concerned with operation control problem for an automated manufacturing system which consists of two machine centers and a single automatic guided vehicle. The objective is to develop and evaluate heuristic scheduling procedures that minimize maximum completion time to be included travel time of AGV. A new heuristic algorithm is proposed and a numerical example illustrates the proposed algorithm. The heuristic algorithm is implemented for various cases by SLAM II. The results show that the proposed algorithm provides better solutions than the previous algorithms.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2003년도 추계공동학술대회
• /
• pp.621-626
• /
• 2003

Mining association rules in web log files can be divided into two steps: 1) discovering frequent item sets in web data; 2) extracting association rules from the frequent item sets found in the previous step. This paper suggests an algorithm for finding frequent item sets efficiently The essence of the proposed algorithm is to transform transaction data files into matrix format. Our experimental results show that the suggested algorithm outperforms the Apriori algorithm, which is widely used to discover frequent item sets, in terms of scan frequency and execution time.

• 말소리와 음성과학
• /
• 제6권2호
• /
• pp.29-34
• /
• 2014

In the Vector Taylor Series (VTS)-based noisy speech recognition methods, Hidden Markov Models (HMM) are usually trained with clean speech. However, better performance is expected by training the HMM with noisy speech. In a previous study, we could find that Minimum Mean Square Error (MMSE) estimation of the training noisy speech in the log-spectrum domain produce improved recognition results, but since the proposed algorithm was done in the log-spectrum domain, it could not be used for the HMM adaptation. In this paper, we modify the previous algorithm to derive a novel mathematical relation between test and training noisy speech in the cepstrum domain and the mean and covariance of the Multi-condition TRaining (MTR) trained noisy speech HMM are adapted. In the noisy speech recognition experiments on the Aurora 2 database, the proposed method produced 10.6% of relative improvement in Word Error Rates (WERs) over the MTR method while the previous MMSE estimation of the training noisy speech produced 4.3% of relative improvement, which shows the superiority of the proposed method.