• Journal of the Korea Society of Computer and Information
• /
• v.15 no.2
• /
• pp.19-26
• /
• 2010

The Windows registry is a hierarchical database where the configuration data of a system or application programs is stored. In this paper, we presented and implemented a registry virtualization algorithm and measured its performance. The registry virtualization algorithm presented in the paper is called Copy-One-level On Write-Open(COOWO) that is a modified version of general Copy On Whte(COW) method to make it suitable for registry virtualization. In this paper, we implemented the proposed algorithm as a dynamically loadable library in Windows and applied it to many Windows application programs. This paper is meaningful since we described a registry virtualization algorithm in detail in situation where we can not find papers that describe the registry virtualization in detail, and we could find the performance of the algorithm can be used in the real applications.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.595-604
• /
• 2002

In this paper, we designed the encryption algorithm which protects ciphertext from deciphering solve the problem that it can pass the incorrect meaning. The algorithm checks the error of ciphertext during deciphering, and then if there are some errors of more than one bit. It stops the deciphering sequence and it doesn't pass any contents to receiver by removing the deciphering contents which was already done. The experiment compared with DES algorithm that is representative algorithm of secret key. As the result of experiment, the part that error bit was included with was deciphered to one that was different from plaintext, but it showed 100% decipher_rate. by the algorithm showed decipher_rate of 0% with deciphering through the error check.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.395-398
• /
• 2002

본 논문에서는 ‘다목적 함수 최적화 문제(Multi-objective Optimization Problem MOP)’를 풀기 위하여 유전자 알고리즘을 진화적 게임 이론 적용시킨 ‘내쉬 유전자 알고리즘(Nash GA)’과 본 논문에서 새로이 제안하는 공진화 알고리즘의 구조를 설명하고 이 두 알고리즘의 결과를 시뮬레이션을 통하여 비교 검토함으로써 ‘진화적 게임 이론(Evolutionary Game Theory : EGT)’의 두 가지 아이디어 -‘내쉬의 균형(Equilibrium)’과 ‘진화적 안정전략(Evolutionary Stable Strategy . ESS)’-에 기반한 최적화 알고리즘들이 다목적 함수 문제의 최적해를 탐색할 수 있음을 확인한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.163-164
• /
• 2015

In order to decode the bar code image binarization process is indispensable. The traditional binarization method is a global threshold binarization and local threshold binarization. Global threshold binarization method using a single threshold. In some cases there is a blur, or if the brightness is different from the bar code image. Therefore, binary pattern information is not retained. Local threshold method is binaized pattern information is maintained but processing speed is slow than global threshold binarization. The algorithm for solving this problem, there is modified binary algorithm. In this paper, we proposed hardware IP implemented by Vivado of modified binary algorithm.

• Journal of Broadcast Engineering
• /
• v.25 no.1
• /
• pp.36-47
• /
• 2020

The improved belief-propagation-based algorithms, such as normalized min-sum algorithm (NMSA) or offset min-sum algorithm (OMSA), are widely used to decode LDPC(Low-Density Parity-Check) codes because they are less computationally complex and work well even at low SNR(Signal-to-Noise Ratio). However, these algorithms work well only when an appropriate normalization factor or offset value is used. A new method that uses a CMD(Check Node Message Distribution) chart and least-square method, which has been recently proposed, has advantages on computational complexity over other approaches to get optimal coefficients. Furthermore, this method can be used to derive coefficients for each iteration. In this paper, we apply this method and propose an algorithm to derive a combination of normalization factor and offset value for a combined normalized and offset min-sum algorithm to further improve the decoding of LDPC codes. Simulations on the next-generation broadcasting standards, ATSC 3.0 LDPC codes, prove that a combined normalized and offset min-sum algorithm which takes the proposed coefficients as correction coefficients shows the best BER performance among other decoding algorithms.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.177-178
• /
• 2009

일반적으로 센서 네트워크는 라우팅 트리를 구축한 후에 시간 동기화를 수행한다. 이로 인하여 시간 동기화가 늦어지고 교환하는 패킷이 증가하여 에너지를 많이 소모하는 문제를 유발한다. 본 논문에서는 한 번의 플러딩 과정으로 라우팅 트리를 구축하고 시간 동기화를 이와 동시에 수행하는 알고리즘을 제안한다. 시뮬레이션에 의하여 제안하는 알고리즘은 기존의 동기화 알고리즘인 TPSN과 동등한 수준의 정확도를 보이면서 동기화 속도 및 에너지 소모 면에서 우수하다는 것을 입증하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7C
• /
• pp.562-568
• /
• 2008

This paper proposes the scheme which obtain the coefficients of TDL filter and two normalization algorithms among methods which get solution of equivalent Wiener-Hopf Equation in Gram-Schmidt algorithm. Compared to the conventional NLMS algorithm, normalizes with sum of power of inputs, the presented algorithms normalize using sums of eigenvalues. Using computer simulation, we perform an system identification in an unstable environment where two poles are located in near position outside unit circle. Consequently, the proposed algorithms get the coefficients of TDL filter in Gram-Schmidt algorithm recursively and show better convergence performance than conventional NLMS algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.467-471
• /
• 2005

본 논문에서는 명암도 변화 및 윤곽선 추적 알고리즘과 개선된 오류 역전파 알고리즘을 이용한 차량 번호판 인식 방법을 제안한다. 비영업용 차량 영상을 대상으로 차량 번호판 영역을 추출하기 위해 명암도 변화 특성을 이용하여 차량 번호판 영역을 추출한다. 추출된 차량 번호판 영역에 반복 이진화 방법을 적용하여 차량 번호판의 영역을 이진화하고, 이진화된 차량 번호판 영역에 대해서 윤곽선 추적 알고리즘을 적용하여 개별 코드를 추출한다. 추출된 개별 코드 인식은 일반화된 델타 학습 방법에 Delta-bar-Delta 알고리즘을 적용하여 학습률을 동적으로 조정하는 개선된 오류 역전파 알고리즘을 적용한다. 제안된 방법의 인식 성능을 평가하기 위하여 실제 비영업용 차량 번호판에 적용한 결과, 기존의 차량 번호판 인식 방법보다 효율적인 것을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9A
• /
• pp.749-757
• /
• 2011

In this paper, we propose a robust And-Or tree-based Luby transform encoded symbol packetization algorithm to minimize the quality degradation of video streaming service caused by packet losses over wireless network. To achieve this goal, the relationship among Luby transform encoded symbols are analyzed by using And-Or tree, and the proposed packetization algorithm is designed to minimize packet loss effects by reducing the dependency among packets conveying Luby transform encoded symbols. Finally, experimental results are provided to show the performance of the proposed algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.3-4
• /
• 2008

본 논문에서 k-means 군집화 알고리즘을 효율적으로 적용하는 방법을 제안했다. 제안하는 알고리즘의 특징을 속도 향상을 위해 예측 데이터를 이용한 것이다. 군집화 알고리즘의 각 단계에서 군집을 변경할 데이터만 최인접 군집을 계산함으로써 계산 시간을 줄일 수 있었다. 제안하는 알고리즘의 성능 비교를 위해서 KMHybrid 와 비교했다. 제안하는 알고리즘은 데이터의 차원이 큰 경우에 KMHybrid 보다 높은 속도 향상을 보였다.