• Proceedings of the KIEE Conference
• /
• 2006.07c
• /
• pp.1693-1694
• /
• 2006

Reliable frequency estimation is important for active power control, load shedding and generator protection. Thereby, frequency estimation is researched and some algorithms is proposed. This paper analyzed strength and weakness of each algorithms through comparative analysis of frequency estimation. Used algorithms are Zero Crossing detection, Discrete Fourier Transformation, Least Error Squares.

• Journal of IKEEE
• /
• v.2 no.2 s.3
• /
• pp.247-254
• /
• 1998

This paper presents a performance study of two LU decomposition algorithms on two massively parallel SIMD machines: the 16K processor MasPar MP-1 and the 4K processor MasPar MP-2. The paper presents experimental results and an analysis of the algorithms to explain the results. While the blocked and the nonblocked algorithms for LU decomposition have been studied individually by others, we compare the two algorithms and identify the tradeoffs between them. Our analysis of the blocked algorithm shows how the block size affects the interprocessor communication cost and the memory read/write overhead. The analysis in this paper is useful to determine an optimum block size for the blocked algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.67-80
• /
• 2000

Symbiotic evolutionary algorithms, also called cooperative coevolutionary algorithms, are stochastic search algorithms that imitate the biological coevolution process through symbiotic interactions. In the algorithms, the fitness evaluation of an individual required first selecting symbiotic partners of the individual. Several partner selection strategies are provided. The goal of this study is to analyze how much partnering strategies can influence the performance of the algorithms. With two types of test-bed problems: the NKC model and the binary string covering problem, extensive experiments are carried out to compare the performance of partnering strategies, using the analysis of variance. The experimental results indicate that there does not exist statistically significant difference in their performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6A
• /
• pp.538-546
• /
• 2010

This paper presents an overview of position-based routing algorithms. We analyze performances of routing algorithms such as Hybrid Opportunistic Forwarding (HOF), Opportunistic multi-hop routing (ExOR), Location based Geocasting and Forwarding (LGF), and Greedy Forwarding in nearest with forward Progress (GFP) routing algorithms to find the best one in terms of packet error rate and throughput efficiency over effects of fading and noise variance in wireless networks. The analyses in closed form expressions are confirmed by the simulation results, which fully agree to analysis results. Additionally, the simulation results indicate significant differences among algorithms when varying the average SNR or the number of relays.

• Journal of the Korea Society for Simulation
• /
• v.2 no.1
• /
• pp.91-106
• /
• 1993

Load sharing in distributed systems improves systems performance. Research in the field has been focused on steady state performance for load sharing algorithms. However, transient characteristics of such algorithms may be important in a distributed system in which workload for some node is changing. Simulation is the only means to analyze such characteristics. This paper presents a simulation-based analysis of the transient characteristics of four load sharing algorithms ; forward probing, reverse probing, symmetric probing, and multi-threshold symmetric probing algorithms. Discrete event system models for execution of the algorithms in a distributed system has been developed in a SIMSCRIOT II.5 environment. Simulation results indicate that the MSYM algorithm shows the shortest response time in the transient period.

• Journal of KSNVE
• /
• v.9 no.1
• /
• pp.163-173
• /
• 1999

Precise and reasonable modelling is necessary and indispensable to the analysis of dynamic characteristics of mechanical structures. Also. the effective prediction of the change of modal properties due to the variation of design parameters is required especially for the application of finite element method to the structural dynamics problems. To meet those necessity and requirement, three model updating algorithms are proposed for finite element methods. Those algorithms are based on sensitivity analysis of the modal data obtained from experimental modal analysis(EMA) and analytical modal analysis(AMA). The adapted sensitivity analysis methods of the algorithms are 1)eigensensitivity(EGNS) method. 2)frequency response function sensitivity(FRFS) method. 3)sensitivity based element-by-element method (SBEEM), Singular value decomposition(SVD) is used for performing eigenanalysis and parameter estimation in the updating process. Those algorithms are applied to finite element of a plate and the updating capability of each algorithm is compared in terms of accuracy. reliability and stability of the updating process. It is shown that the model updating method using frequency response function is superior to the other methods in view of various updating capabilities.

• Genomics & Informatics
• /
• v.1 no.2
• /
• pp.87-93
• /
• 2003

DNA microarray is currently the most prominent tool for investigating large-scale gene expression data. Different algorithms for measuring gene expression levels from scanned images of microarray experiments may significantly impact the following steps of functional genomic analyses. $Affymetrix^{(R)}$ recently introduced high-density microarrays and new statistical algorithms in Microarray Suit (MAS) version 5.0$^{(R)}$. Very high correlations (0.92 - 0.97) between the new algorithms and the old algorithms (MAS 4.0) across several species and conditions were reported. We found that the column-wise array correlations had a tendency to be much higher than the row-wise gene correlations, which may be much more meaningful in the following higher-order data analyses including clustering and pattern analyses. In this paper, not only the detailed comparison of the two sets of algorithms is illustrated, but the impact of the introducing new algorithms on the further clustering analysis of microarray data and of possible pitfalls in mixing the old and the new algorithms were also described.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.907-910
• /
• 1998

In this paper, we present a comparative performance analysis of several blocking artifact reduction algorithms. For the performance analysis, we propose a block boundary region classification algorithm which classifies each horizontal and vertical block boundary into four regions using brightness change near the block boundary. The PSNR performance of each algorithm is compared. The MSE according to each block boundary region is also compared. Experimental results show that the wavelet transform based blocking artifact reduction algorithms have better performance over the other methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.1
• /
• pp.42-45
• /
• 2017

In this letter, we present an experimental comparative study of background subtraction algorithms for soccer video analysis. We investigated five different background subtraction algorithms under the same experimental setup. For the quantitative comparison, we employed the precision, recall, and F-measure. We believe that this comprehensive comparative study serves as a reference point and guide for developers and practitioners in choosing an appropriate background subtraction algorithm adopted for building intelligent soccer video analysis systems.

• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.164-168
• /
• 2023

As our community has become increasingly dependent on technology, security has become a bigger concern, which makes it more important and challenging than ever. security can be enhanced with encryption as described in this paper by combining RC6 symmetric cryptographic algorithms with RSA asymmetric algorithms, as well as the Vigenère cipher, to help manage weaknesses of RC6 algorithms by utilizing the speed, security, and effectiveness of asymmetric algorithms with the effectiveness of symmetric algorithm items as well as introducing classical algorithms, which add additional confusion to the decryption process. An analysis of the proposed encryption speed and throughput has been conducted in comparison to a variety of well-known algorithms to demonstrate the effectiveness of each algorithm.