• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.956-967
• /
• 2010

Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. In this paper, a new algorithm for multiple string matching is proposed. This proposed algorithm is based on the canonical Aho-Corasick algorithm and it utilizes a bidirectional and parallel processing structure to accelerate the matching speed. The proposed string matching algorithm was implemented and patched into Snort for experimental evaluation. Comparing with the canonical Aho-Corasick algorithm, the proposed algorithm has gained much improvement on the matching speed, especially in detecting multiple keywords within a long input text string.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.05a
• /
• pp.520-525
• /
• 2003

The determination of unknown parameters in rotating machinery is a difficult task and optimization techniques represent an alternative technique for parameter identification. The Simulated Annealing(SA) and Genetic Algorithm(GA) are powerful global optimization algorithm. This paper proposes new hybrid algorithm which combined GA with SA and local search algorithm for the purpose of parameter identification. Numerical examples are also presented to verify the efficiency of proposed algorithm. And, this paper presents the general methodology based on hybrid algorithm to identify unknown bearing parameters of flexible rotors using measured unbalance responses. Numerical examples are used to ilustrate the methodology used, which is then validated experimentally.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.225-228
• /
• 2004

This paper presents a hybrid decimal division algorithm to improve division speed. In a binary number system, non-restoring algorithm has a smaller number of operations than restoring algorithm. In decimal number system, however, the number of operations differs with respect to quotient values. Since one digit ranges 0 to 9 in decimal, the proposed hybrid algorithm employ either non-restoring or restoring algorithm on each digit to reduce iterative operations. The selection of the algorithm is based on the remainder values. The proposed algorithm improves computation speed substantially over conventional algorithms by decreasing the number of operations.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.4
• /
• pp.537-544
• /
• 2013

This paper proposes a recursive localized Normalized Mutual Information(NMI) algorithm to overcome shortcomings of the conventional NMI algorithm and the localized NMI algorithm which proposed before. The localized NMI algorithm divides images into few fixed size segments and applies NMI algorithm to each segments. By extension, the proposed algorithm uses variable size segments using its characteristic. Dividing each segment recursively, the algorithm selects a suitable segment size and improves a performance of the image registration. Experimental result shows the performance of the proposed algorithm.

• Journal of Fisheries and Marine Sciences Education
• /
• v.23 no.1
• /
• pp.105-115
• /
• 2011

Education is focused on how to nurture creative problem-solving skills talent in rapidly changing information society. The algorithm education of computer science is effective in improvement of students' logical thinking and problem solving capability. However, the algorithm education is very difficult to teach in elementary students level. Because it is difficult to understand abstract characteristic of algorithm. Therefore we developed educational contents based on the principle of the algorithm for improve students' logical thinking and problem-solving capability in this study. And educational contents contain interesting elements of the game. So, students will be interested in algorithm learning and participate actively through developed educational contents. Furthermore, students' creative problem-solving capability may improve through algorithm learning.

• Proceedings of the KSRS Conference
• /
• v.1
• /
• pp.200-203
• /
• 2006

Cloud detection algorithm is being developed as major one of the 16 baseline products of CMDPS (COMS Meteorological Data Processing System), which is under development for the real-time application of data will be observed from COMS Meteorological Imager. For cloud detection from satellite data, we studied two different algorithms. One is threshold technique based algorithm, which is traditionally used, and another is artificial neural network model. MPEF scene analysis algorithm is the basic idea of threshold cloud detection algorithm, and some modifications are conducted for COMS. For the neural network, we selected MLP with back-propagation algorithm. Prototype software of each algorithm was completed and evaluated by using the MTSAT-1R and GOES-9 data. Currently the software codes are standardized using Fortran90 language. For the preparation as an operational algorithm, we will setup the validation strategy and tune up the algorithm continuously. This paper shows the outline of the two cloud detection algorithm and preliminary test result of both algorithms.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.7 s.178
• /
• pp.1661-1672
• /
• 2000

An immune system has powerful abilities such as memory, recognition and learning how to respond to invading antigens, and has been applied to many engineering algorithms in recent year. In this pap er, the combined optimization algorithm (Immune- Genetic Algorithm: IGA) is proposed for multi-optimization problems by introducing the capability of the immune system that controls the proliferation of clones to the genetic algorithm. The optimizing ability of the proposed combined algorithm is identified by comparing the result of optimization with simple genetic algorithm for two dimensional multi-peak function which have many local optimums. Also the new combined algorithm is applied to minimize the total weight of the shaft and the transmitted forces at the bearings. The inner diameter oil the shaft and the bearing stiffness are chosen as the design variables. The dynamic characteristics are determined by applying the generalized FEM. The results show that the combined algorithm and reduce both the weight of the shaft and the transmitted forces at the bearing with dynamic conatriants.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.117-124
• /
• 2001

At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.222-228
• /
• 2004

This paper describes a new adaptive algorithm which can reduce the required computation quantities in the adaptive filter. The proposed adaptive algorithm uses only the signs of the normalized input signal rather than the input signals when coefficients of the filter are adapted. By doing so, there is no need for the multiplications and divisions which are mostly responsible for the computation quantities. To analyze the convergence characteristics of the proposed algorithm, the condition and speed of the convergence are derived mathematically. Also, we simulate an echo canceller adopting this algorithm and compare the performances of convergence for this algorithm with the ones for the other algorithm. As the results of simulations, it is proved that the echo canceller adopting this algorithm shows almost the same performances of convergence as the echo canceller adopting the SIA algorithm.

• Journal of KIISE:Software and Applications
• /
• v.31 no.12
• /
• pp.1628-1636
• /
• 2004

Data compression techniques have been studied for decades because they saved space and time to reduce costs. The Lempel-Ziv 77 (LZ77) is a dictionary-based, lossless compression algorithm. The dictionary size of the LZ77 algorithm is fixed, and the performance of the algorithm is highly dependent on its dictionary size. In this paper, we suggest a dynamic LZ77 algorithm that changes its dictionary size during compression, and also we suggest a genetic algorithm to evolve the dictionary-resizing strategies. The suggested algorithm outperformed the original version up to about 16%.