• Journal of the Korea Society of Computer and Information
• /
• v.25 no.2
• /
• pp.123-131
• /
• 2020

The text ranking algorithm is a representative method for keyword extraction, and its importance is emphasized highly. In this paper, we compare the performance of recent research and experiments with TF-IDF, SMART, INQUERY and CCA algorithms, which are used in text ranking algorithm.. After explaining each algorithm, we compare the performance of each algorithm based on the data collected from news and Twitter. Experimental results show that all of four algorithms can extract specific words from news data equally. However, in the case of Twitter, CCA has the best performance to extract specific words, and INQUERY shows the worst performance. We also analyze the accuracy of the algorithm through six comparison metrics. The experimental results present that CCA shows the best accuracy in the news data. In case of Twitter, TF-IDF and CCA show similar performance and demonstrate good performance.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.11 no.6
• /
• pp.183-189
• /
• 2003

The study of the automotive noise reduction has been concentrated on the reduction of the automotive engine noise because the engine noise is the major cause of automotive noise. However, many studies of automotive engine noise led to the interest of the noise reduction of the exhaust and intake system. Recently, the active control method is used to reduce the noise of an automotive exhaust and intake system. It is mostly used the LMS(Least-Mean-Square) algorithm as an algorithm of active control because the LMS algorithm can easily obtain the complex transfer function in real-time. Especially, Filtered-X LMS (FXLMS) algorithm is applied to an Active Noise Control system. However, the convergence performance of LMS algorithm went bad when the FXLMS algorithm was applied to an active control of the induction noise under rapidly accelerated driving conditions. So, in order to solve this problem, the modified FXLMS algorithm is proposed. In this study, the improvement of the control performance using the modified FXLMS algorithm under rapidly and suddenly accelerated driving conditions was identified. Also, the performance of an active control using the LMS algorithm under rapidly accelerated driving conditions was evaluated through the theoretical derivation using a chirp signal to have similar characteristics with the induction noise signal.

• International Journal of Contents
• /
• v.2 no.1
• /
• pp.34-38
• /
• 2006

In this paper, an overview of anti-collision algorithm for RFID system of a standard EPC Class1 protocol is presented, and the binslotted dynamic search algorithm (BDS) based upon the slotted ALOHA and binary tree procedure is proposed and analyzed. Also, the performance is evaluated as comparing the BDS algorithm with the standard bin-slotted algorithm (BSA) through the simulation program. The performance of the proposed BDS algorithm is improved by dynamically identifying the collided-bit position and the collided bins stored in the stack of the reader. As the results, the number of request command that a reader send to tags in the reader s interrogation zone and the total recognition time are decreased to 59% as compared with BSA algorithm. Therefore, the tag identification performance is fairly improved by resolving a collision problem using the proposed BDS algorithm.

• Journal of the Korea Safety Management & Science
• /
• v.14 no.1
• /
• pp.167-177
• /
• 2012

In this paper, we raised the performance of heuristic algorithm to assign job to workers in parallel line inspection process without sequence. In previous research, we developed the heuristic algorithm. But the heuristic algorithm can't find optimal solution perfectly. In order to solve this problem, we proposed new method to make initial solution called FN(First Next) method and combined the new FN method and old FE method using previous heuristic algorithm. Experiments of assigning job are performed to evaluate performance of this FE+FN heuristic algorithm. The result shows that the FE+FN heuristic algorithm can find the optimal solution to assign job to workers evenly in many type of cases. Especially, in case there are optimal solutions, this heuristic algorithm can find the optimal solution perfectly.

• The Journal of Information Technology
• /
• v.2 no.1
• /
• pp.103-113
• /
• 1999

In this paper, we propose th soft decision-directed sto-and-go algorithm combining a concept of the stop-and-go algorithm with soft decision-directed algorithm. The proposed algorithm has an enhanced equalization performance according to using the more confidential error signal than two algorithms. By computer simulation, it is confirmed that the proposed algorithm has the performance superiority in terms of residual ISI and convergence speed compared with the adaptive blind equalization algorithm of CMA, Modified CMA(MCMA), Stop-and Go algorithm and simplified 50ft decision-directed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1296-1309
• /
• 2023

In this paper, based on the soft cancellation (SCAN) bit-flipping (SCAN-BF) algorithm, a generalized SCAN bit-flipping (GSCAN-BF-Ω) decoding algorithm is carried out, where Ω represents the number of bits flipped or corrected at the same time. GSCAN-BF-Ω algorithm corrects the prior information of the code bits and flips the prior information of the unreliable information bits simultaneously to improve the block error rate (BLER) performance. Then, a joint threshold scheme for the GSCAN-BF-2 decoding algorithm is proposed to reduce the average decoding complexity by considering both the bit channel quality and the reliability of the coded bits. Simulation results show that the GSCAN-BF-Ω decoding algorithm reduces the average decoding latency while getting performance gains compared to the common multiple SCAN bit-flipping decoding algorithm. And the GSCAN-BF-2 decoding algorithm with the joint threshold reduces the average decoding latency further by approximately 50% with only a slight performance loss compared to the GSCAN-BF-2 decoding algorithm.

• Journal of electromagnetic engineering and science
• /
• v.11 no.4
• /
• pp.250-256
• /
• 2011

This paper applies a compressed algorithm to improve the spectrum sensing performance of cognitive radio technology. At the fusion center, the recovery error in the analog to information converter (AIC) when reconstructing the transmit signal from the received time-discrete signal causes degradation of the detection performance. Therefore, we propose a subspace pursuit (SP) algorithm to reduce the recovery error and thereby enhance the detection performance. In this study, we employ a wide-band, low SNR, distributed compressed sensing regime to analyze and evaluate the proposed approach. Simulations are provided to demonstrate the performance of the proposed algorithm.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.135-141
• /
• 2013

String matching is one of the key algorithms in network security and many areas could be benefit from a faster string matching algorithm. Based on the most efficient string matching algorithm in sual applications, the Boyer-Moore (BM) algorithm, a novel algorithm called RQS is proposed. RQS utilizes an improved bad character heuristic to achieve bigger shift value area and an enhanced good suffix heuristic to dramatically improve the worst case performance. The two heuristics combined with a novel determinant condition to switch between them enable RQS achieve a higher performance than BM both under normal and worst case situation. The experimental results reveal that RQS appears efficient than BM many times in worst case, and the longer the pattern, the bigger the performance improvement. The performance of RQS is 7.57~36.34% higher than BM in English text searching, 16.26~26.18% higher than BM in uniformly random text searching, and 9.77% higher than BM in the real world Snort pattern set searching.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.369-371
• /
• 2006

The AIS(Automatic Identification System) has to be developed SOTDMA(Self-Organized Time Division Multiple Access) Algorithm which is important on wireless communication method because It is based on ITU(International Telecommunication Union) M.1371-1 of the international standard therefore, we need to develop a performance evaluation simulator efficiently to develop and analyze SOTDMA Algorithm. This paper shows the method of designing it. The SOTDMA Algorithm driving state verifies the performance evaluation simulator by IEC(International Electrotechnical Commission) 61993-2. After verifying results the performance evaluation simulator is correctly satisfied with IEC 61993-2. So we expect that it helps not only the AIS technology developed but also verify new SOTDMA Algorithm.

• Journal of the Korea Society for Simulation
• /
• v.3 no.1
• /
• pp.89-98
• /
• 1994

In this paper, a criteria for selecting an appropriate load redistribution algorithm is devised so that a fault-tolerance distributed system can operte at its optimal efficience. To present the guideline for selecting redistributing algorithms, simulation models of fault-tolerant system including redistribution algorithms are developed using SLAM II. The job arrival rate, service rate, failure and repair rate of nodes, and communication delay time due to load migration are used as parameters of simulation. The result of simulation shows that the job arrival rate and the failure rate of nodes are not deciding factors in affecting the relative efficiency of algorithms. Algorithm B shows relatively a consistent performance under various environments, although its performance is between those of other algorithms. If the communication delay time is longer than average job processing time, the performance of algorithm B is better than others. If the repair rate is relatively small or communication delay time is longer than service time, algorithm A leads to good performance. But in opposite environments, algorithm C is superior to other algorithms.