• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.557-559
• /
• 2000

본 논문에서는 기존의 정렬 알고리즘의 성능을 향상시키기 위하여 정보블록 전처리알고리즘(IBPA)이라는 전처리 알고리즘을 제안한다. IBPA는 정렬된 리스트(list)에 있는 데이터에 관한 정보를 생성하고, 생성된 정보를 이용하여 각 데이터를 재배치하며, 실제적인 정렬은 기존의 정렬 알고리즘을 그대로 이용하여 이루어진다. IBPA의 성능을 측정해본 결과, 2백만개의 랜덤데이터를 정렬한 경우, O(N2)의 평균시간복잡도를 갖는 정렬알고리즘의 0.003%, O(NlogN)의 평균시간복잡도를 갖는 정렬알고리즘의 52%, 그리고 O(N)의 평균시간복잡도를 갖는 정렬알고리즘의 89%정도의 비교회수만으로도 정렬할 수 있음을 보여주었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06b
• /
• pp.482-486
• /
• 2007

본 논문은 기존의 O-tree 표현법을 이용한 플로어플랜 알고리즘의 결점을 보완한 새로운 알고리즘을 제안한다. 기존의 방법에선 플로어플랜의 변형을 처리하는 과정에서 몇 가지 변형을 간과하기 때문에 좋은 해를 놓치는 경우가 발생한다. 본 논문에서는 기존의 방법을 수정하여 변형을 처리하는 과정에서 블록이 들어갈 수 있는 모든 위치를 고려하였다. 그 결과 MCNC 밴치마크 회로를 이용한 실험에서 총면적이 이전의 방법에 비해 평균 3% 개선되었다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.2
• /
• pp.9-22
• /
• 2004

This paper presents a parallel genetic algorithm for the Multi-disk data allocation problem an NP-complete problem. This problem is to find a method to distribute a Binary Cartesian Product File on disk-arrays to maximize parallel disk I/O accesses. A Sequential Genetic Algorithm(SGA), DAGA, has been proposed and showed the superiority to the other proposed methods, but it has been observed that DAGA consumes considerably lengthy simulation time. In this paper, a parallel version of DAGA(ParaDAGA) is proposed. The ParaDAGA is a 2-dimension torus-based Parallel Genetic Algorithm(PGA) and it is based on a distributed population structure. The ParaDAGA has been implemented on the parallel computer simulated on a single processor platform. Through the simulation, we study the impact of varying ParaDAGA parameters and compare the quality of solution derived by ParaDAGA and DAGA. Comparing the quality of solutions, ParaDAGA is superior to DAGA in all cases of configurations in less simulation time.

• Journal of Sensor Science and Technology
• /
• v.27 no.3
• /
• pp.192-198
• /
• 2018

Pulse oximetry is a non-invasive method for monitoring how much oxygenated hemoglobin is present in the blood. The principle of pulse oximetry is based on the red infrared light adsorption characteristics of oxygenated and deoxygenated hemoglobin. Even through the convenience of a pulse oximeter, its weak signal-to-noise ratio against motion artifacts and low perfusion makes it difficult to be accepted by execs devices. Several researchers have suggested the use of an adaptive noise cancellation (ANC) algorithm. They have demonstrated that ANC is feasible for reducing the effects of motion artifacts. Masimo Corporation developed a discrete saturation transformation (DST) algorithm that uses a reference signal and ANC. In commercial devices, it is very hard to escape it because Masimo's patents are very powerful and a better method is yet to be developed. This study proposes a new method that can measure noise saturation as well as accurate oxygen saturation from signals with high motion artifacts without using ANC and DST. The proposed algorithm can extract a normal signal without noise from a signal with motion artifacts. The reference signal from a pulse oximeter simulator was used for the evaluation of our proposed algorithm and achieved good results.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.313-315
• /
• 2005

In a power system, an out-of-step condition causes a variety of risk such as serious damage to system elements, tripping of loads and generators, mal-operation of relays, etc. Therefore, it is very important to detect the out-of-step condition and take a proper measure. Several out-of-step detection methods have been employed in relays until now Mo,;t common method used for an out-of-step detection is based on the transition time through the blocking impedance area in R-X diagram. Also, the R-R dot out-of- step relay, the out-of-step prediction method and the adaptive out-of-step relay using the equal area criterion (EAC) and Global Positioning Satellite (GPS) technology have been developed. This paper presents the out-of-step detection algorithm using the time variation of the complex power. The complex power is calculated and the mechanical power of the generator is estimated by using the electrical power, and then the out-of-step detection algorithm, which is based on the complex Power and the estimated mechanical power, is presented. This algorithm, may detect the instant when the generator angle passes the Unstable Equilibrium Point (UEP). The proposed out-of-step algorithm is verified and tested by using Alternative Transient Program/Electromagnetic Transient Program (ATP/EMTP) MODELS.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.36-40
• /
• 2003

A number of embedded wavelet image coding methods have been Proposed since the introduction of EZW(Embedded Zerotree Wavelet) algorithm. A common characteristic of these methods is that they use fundamental ideas found in the EZW algorithm. Especially, one of these methods is the SPIHT(Set Partitioning in Hierarchy Trees) algorithm, which became very popular since it was able to achieve equal or better performance than EZW without having to use an arithmetic encoder. The SPIHT algorithm is computationally very simple, but even so it provides excellent numerical and visual results. But the evaluation of its time complexity is no more than the relative result of experimental comparisons and the strict time complexity analysis wasn't taken until now. In this paper, we analyze strictly the processing time complexity of SPIHT algorithm and prove that the time complexity for one bit-plane processing is O( nlog $_2$n) in worst case.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.3
• /
• pp.193-199
• /
• 2019

In this paper I propose an algorithm of linear time complexity for NP-complete Maximum Independent Set (MIS) problem. Based on the basic property of the MIS, which forbids mutually adjoining vertices, the proposed algorithm derives the solution by repeatedly selecting vertices in the ascending order of their degree, given that the degree remains constant when vertices ${\nu}$ of the minimum degree ${\delta}(G)$ are selected and incidental edges deleted in a graph of n vertices. When applied to 22 graphs, the proposed algorithm could obtain the MIS visually yet effortlessly. The proposed linear MIS algorithm of time complexity O(n) always executes ${\alpha}(G)$ times, the cardinality of the MIS, and thus could be applied as a general algorithm to the MIS problem.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.95-102
• /
• 2022

This paper proposed a linear time algorithm for a three-partition problem(TPP) in which a polynomial time algorithm is not known as NP-complete. This paper proposes a backtracking method that improves the problems of not being able to obtain a solution of the MM method using the sum of max-min values and third numbers, which are known polynomial algorithms in the past. In addition, the problem of MM applying the backtracking method was improved. The proposed algorithm partition the descending ordered set S into three and assigned to the forward, backward, and best-fit allocation method with maximum margin, and found an optimal solution for 50.00%, which is 5 out of 10 data in initial allocation phase. The remaining five data also showed performance to find the optimal solution by exchanging numbers between surplus boxes and shortage boxes at least once and up to seven times. The proposed algorithm that performs simple allocation and exchange optimization with less O(k) linear time performance complexity than the three-partition m=n/3 data, and it was shown that there could be a polynomial time algorithm in which TPP is a P-problem, not NP-complete.

• The Journal of Korean Society for Radiation Therapy
• /
• v.26 no.1
• /
• pp.107-114
• /
• 2014

Purpose : The purpose of this study is evaluation for the applicability of O-MAR(Metal artifact Reduction for Orthopedic Implants)(ver. 3.6.0, Philips, Netherlands) in head & neck radiation treatment planning CT with metal artifact created by dental implant. Materials and Methods : All of the in this study's CT images were scanned by Brilliance Big Bore CT(Philips, Netherlands) at 120kVp, 2mm sliced and Metal artifact reduced by O-MAR. To compare the original and reconstructed CT images worked on RTPS(Eclipse ver 10.0.42, Varian, USA). In order to test the basic performance of the O-MAR, The phantom was made to create metal artifact by dental implant and other phantoms used for without artifact images. To measure a difference of HU in with artifact images and without artifact images, homogeneous phantom and inhomogeneous phantoms were used with cerrobend rods. Each of images were compared a difference of HU in ROIs. And also, 1 case of patient's original CT image applied O-MAR and density corrected CT were evaluated for dose distributions with SNC Patient(Sun Nuclear Co., USA). Results : In cases of head&neck phantom, the difference of dose distibution is appeared 99.8% gamma passing rate(criteria 2 mm / 2%) between original and CT images applied O-MAR. And 98.5% appeared in patient case, among original CT, O-MAR and density corrected CT. The difference of total dose distribution is less than 2% that appeared both phantom and patient case study. Though the dose deviations are little, there are still matters to discuss that the dose deviations are concentrated so locally. In this study, The quality of all images applied O-MAR was improved. Unexpectedly, Increase of max. HU was founded in air cavity of the O-MAR images compare to cavity of the original images and wrong corrections were appeared, too. Conclusion : The result of study assuming restrained case of O-MAR adapted to near skin and low density area, it appeared image distortion and artifact correction simultaneously. In O-MAR CT, air cavity area even turned tissue HU by wrong correction was founded, too. Consequentially, It seems O-MAR algorithm is not perfect to distinguish air cavity and photon starvation artifact. Nevertheless, the differences of HU and dose distribution are not a huge that is not suitable for clinical use. And there are more advantages in clinic for improved quality of CT images and DRRs, precision of contouring OARs or tumors and correcting artifact area. So original and O-MAR CT must be used together in clinic for more accurate treatment plan.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.2
• /
• pp.76-82
• /
• 2001

This paper presents a approach for a service restoration and optimal reconfiguration of distribution network using Genetic algorithm(GA) and Tabu search(TS) method. Restoration and reconfiguration problems in distribution network are difficult to solve in short times, because distribution network supplies power for customers combined with many tie-line switches and sectionalizing switches. Furthermore, the solutions of these problems have to satisfy radial operation conditions and reliability indices. To overcome these time consuming and sub-optimal problem characteristics, this paper applied Genetic-Tabu algorithm. The Genetic-Tabu algorithm is a Tabu search combined with Genetic algorithm to complement the weak points of each algorithm. The case studies with 7 bus distribution network showed that not the loss reduction but also the reliability cost should be considered to achieve the economic service restoration and reconfiguration in the distribution network. The results of suggested Genetic-Tabu algorithm and simple Genetic algorithm are compared in the case study also.