• Journal of the Korean Society for Library and Information Science
• /
• v.52 no.4
• /
• pp.91-110
• /
• 2018

We proposed a video summarization algorithm based on an ERP (Event Related Potentials)-based topic relevance model, a MMR (Maximal Marginal Relevance), and discriminant analysis to generate a semantically meaningful video skim. We then conducted implicit and explicit evaluations to evaluate our proposed ERP/MMR-based method. The results showed that in the implicit and explicit evaluations, the average scores of the ERP / MMR methods were statistically higher than the average score of the SBD (Shot Boundary Detection) method used as a competitive baseline, respectively. However, there was no statistically significant difference between the average score of ERP/MMR (${\lambda}=0.6$) method and that of ERP/MMR (${\lambda}=1.0$) method in both assessments.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.159-164
• /
• 2004

In the previous researches, tree comparison methods are almost studied in comparing weighted or labeled tree(decorated tree). But in this paper, we propose a tree comparison and similarity evaluation algorithm can be applied to comparison of two normal trees. The algorithm converts two trees into node string using unparser, evaluates similarity and finally return similarity value from 0.0 to 1.0. In the experiment part of this paper, we visually presented matched nodes and unmatched nodes between two trees. By using this tree similarity algorithm, we can not only evaluate similarity between two specific programs or documents but also detect duplicated code.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.963-972
• /
• 1997

In imformation retrival, query reformulation algorithms construct querise from a set of intial input and feedback documents, and retrieval performance cna be varied by different sets of input documents. In this study, we developed a criterion for measuring the performance sensitivity of query reformulation algorithms to unput sets. In addition, we also propose a way of mesuring the changes in retrived area, (CIRA) during qucry reformulation. We cimpared CIRAs of query refromulation algorithms (i.e., query tree, DNF method, and Dillon's method) using three test sets:the CACM, CISI, and Medlars. In the experiments, the query tree showed the highest decreasing CIRA during refirmulations, which means the fastest convergence rate to an output set. For sensitivity analysis, the query tree sored the highest sensitivity to different input sets even though its differences to the tther algorithms are very small.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2555-2562
• /
• 2009

The algorithm that is proposed in this paper defined a probability function to count connection process and connection-end process to apply TRW algorithm to voice network. Set threshold to evaluate the algorithm that is proposed, Based on the type of connection attack traffic changing the probability to measure the effectiveness of the algorithm, and Attack packets based on the speed of attack detection time was measured. At the result of evaluation, proposed algorithm shows that DDoS attack starts at 10 packets per a second and it detects the attack after 1.2 seconds from the start. Moreover, it shows that the algorithm detects the attack in 0.5 second if the packets were 20 per a second.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.867-874
• /
• 2004

K-Means algorithm is a non-hierarchical (plat) and reassignment techniques and iterates algorithm steps on the basis of K cluster centroids until the clustering results converge into K clusters. In its nature, K-Means algorithm has characteristics which make different results depending on the initial and new centroids. In this paper, we propose the modified K-Means algorithm which improves the initial and new centroids decision methodologies. By evaluating the performance of two algorithms using the 16 weighting scheme of SMART system, the modified algorithm showed $20{\%}$ better results on recall and F-measure than those of K-Means algorithm, and the document clustering results are quite improved.

• Journal of The Korean Association of Information Education
• /
• v.2 no.2
• /
• pp.252-259
• /
• 1998

Vehicle navigation systems employ a certain route planning algorithm that provides the shortest path between the starting point and the destination point. The performance of a given route planning algorithm is measured through the degree of optimal route selection and the time cost to complete searching an optimal path. In this paper, various route planning algorithms are evaluated through computer simulation based on a real digital map database. Among those algorithms evaluated in this paper, the Modified Bi-directional A${\ast}$ algorithm is found to be the best algorithm for use in vehicle navigation systems.

• The Journal of the Acoustical Society of Korea
• /
• v.37 no.6
• /
• pp.457-467
• /
• 2018

This paper presents performance comparison of several high-resolution frequency estimation algorithms for pure real tone signal. Algorithms are DFT (Discrete Fourier Transform - for reference purpose), Jacobsen, Candan, reassignment and Cedron. Each algorithm is evaluated under various experimental conditions, e.g., different SNR (Signal to Noise Ratio), window function and window length and performance is compared in the perspective of bias, MSE (Mean Square-Error) and variance. Experimental results indicate that Cedron algorithms works well in the most cases. For actual usage in the engineering problem, each algorithm needs additional analysis and modification.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.45-54
• /
• 2009

This study was developed the metallic plate for bone fixation in the neurosurgery and general surgery and plates has a finn place in bone operating and treatment. The plates can be realized to bending strength and stiffness for strength estimation. Maximum point of bending curves has a bending point(P) with maximum load which to applied nearly 0.2% offset displacement. The device's sizing has a ${\Phi}13$ and ${\Phi}18$, and algorithm of strength estimation compared a plate(${\Phi}13$, ${\Phi}18$, ${\Phi}13-{\Phi}18$). The bending strength of the curved metallic plate has to evaluate maximum of a 311N, 387N, 410N, 474N. When a displacement preserve with a load, tensile stress through to press a plate is 274N, 324N, 382N, 394N. The algorithm of strength estimation can be used to support estimation of bending strength and stiffness. Their tool bring to settlement in the new basic algorithm for evidence with varied adjustment.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.851-862
• /
• 2004

RFID(Radio frequency IDentification) is a technology that automatically identifies objects containing the electronic tags by using radio wave. The multi-tag identification problem is the core issue in the RFID and could be resolved by the anti-collision algorithm. However, most of the existing anti-collision algorithms have a problem of heavy implementation cost and low performance. In this paper. we propose a new tree based memoryless anti-collision algorithm called a collision tracking tree algorithm and presents its performance evaluation results obtained by simulation. The Collision Tracking Tree algorithm proves itself the capability of an identification rate of 749 tags per second and the performance evaluation results also show that the proposed algorithm outperforms the other two existing tree-based memoryless algorithms, i.e., the tree-walking algorithm and the query tree algorithm about 49 and 2.4 times respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.9
• /
• pp.1193-1201
• /
• 2020

Cell planning, which determines the cell structure for location management of mobile terminals in mobile communications, has been dealt with as an important research task to determine network performance. Among the factors influencing the cell structure planning in mobile communication, the signal cost for location management plays the most important role. In this paper, we propose an optimization algorithm that minimizes the location management cost of all the cells used to plan the cell structure in the network with reporting cell structure in mobile communication. The proposed algorithm uses a Tabu search algorithm, which is a meta-heuristic algorithm, and the proposed algorithm proposes a new neighborhood generation method to obtain a result close to the optimal solution. In order to evaluate the performance of the proposed algorithm, the simulation was performed in terms of location management cost and algorithm execution time. The evaluation results show that the proposed algorithm outperforms the existing genetic algorithm and simulated annealing.