• Journal of KIISE:Software and Applications
• /
• 제34권6호
• /
• pp.519-529
• /
• 2007

In this paper, we investigate the use of fuzzy rules for efficient intrusion detection. We use evolutionary algorithm to optimize the set of fuzzy rules for intrusion detection by constructing fuzzy decision trees. For efficient execution of evolutionary algorithm we use supervised clustering to generate an initial set of membership functions for fuzzy rules. In our method both performance and complexity of fuzzy rules (or fuzzy decision trees) are taken into account in fitness evaluation. We also use evaluation with data partition, membership degree caching and zero-pruning to reduce time for construction and evaluation of fuzzy decision trees. For performance evaluation, we experimented with our method over the intrusion detection data of KDD'99 Cup, and confirmed that our method outperformed the existing methods. Compared with the KDD'99 Cup winner, the accuracy was increased by 1.54% while the cost was reduced by 20.8%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제28권12B호
• /
• pp.1066-1080
• /
• 2003

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase 1, every border node periodically pre-computes the QoS distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independet of the QoS request from an application. In Phase II, distributed graph construction algorithm is performed to model the network as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.

• Journal of the Korea Society of Computer and Information
• /
• 제17권2호
• /
• pp.49-57
• /
• 2012

Conventional fuzzy c-means (FCM) algorithms have achieved a good clustering performance. However, they do not fully utilize the spatial information in the image and this results in lower clustering performance for images that have low contrast, vague boundaries, and noises. To overcome this issue, we propose an enhanced spatial fuzzy c-means (ESFCM) algorithm that takes into account the influence of neighboring pixels on the center pixel by assigning weights to the neighbors in a $3{\times}3$ square window. To evaluate between the proposed ESFCM and various FCM based segmentation algorithms, we utilized clustering validity functions such as partition coefficient ($V_{pc}$), partition entropy ($V_{pe}$), and Xie-Bdni function ($V_{xb}$). Experimental results show that the proposed ESFCM outperforms other FCM based algorithms in terms of clustering validity functions.

• The Journal of the Korea Contents Association
• /
• 제21권7호
• /
• pp.164-170
• /
• 2021

In VLSI design, partitioning is a task of clustering objects into groups so that a given objective circuit is optimized. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for partitioning include the Kernighan-Lin algorithm, Fiduccia-Mattheyses heuristic and simulated annealing. In this paper, we propose a adapted genetic algorithm searching solution space for the circuit partitioning problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of implementation. As a result, it was found that an adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.

• Journal of the Semiconductor & Display Technology
• /
• 제15권1호
• /
• pp.27-32
• /
• 2016

A new lane detection algorithm is proposed for the analysis of DNA fingerprints from a polymerase chain reaction (PCR) gel electrophoresis image. Although several research results have been previously reported, it is still challenging to extract lanes precisely from images having abrupt background brightness difference and bent lanes. We propose an edge based algorithm for calculating the average lane width and lane cycle. Our method adopts sub-pixel algorithm for extracting rising-edges and falling edges precisely and estimates the lane width and cycle by using k-means clustering algorithm. To handle the curved lanes, we partition the gel image into small portions, and track the lane centers in each partitioned image. 32 gel images including 534 lanes are used to evaluate the performance of our method. Experimental results show that our method is robust to images having background difference and bent lanes without any preprocessing.

• The Journal of Information Technology
• /
• 제4권4호
• /
• pp.65-72
• /
• 2001

This paper investigates the Performance of MSA l (group partition based reservation scheduling algorithm) and MSA ll (group based reservation scheduling algorithm) for multicast service in single-hop WDM networks. Simulation results show that MSA l produces lower mean packet delay than MSA ll when the channel resource is sufficient. However, when the channel resource is limited, MSA ll produces lower mean packet delay than MSA I when traffic load is heavy.

• Journal of the Korean Society for Precision Engineering
• /
• 제21권4호
• /
• pp.202-209
• /
• 2004

Quality control is essential to the final product in BGA-type PCB fabrication. So, many automatic vision systems have been developed to achieve speedy, low cost and high quality inspection. A multiple threshold selection algorithm is a very important technique for machine vision based inspection. In this paper, an inspected image is modeled by using fuzzy sets and then the parameters of specified membership functions are estimated to be in maximum fuzzy entropy with the probability of the fuzzy sets, using the exhausted search method. Fuzzy c-partitions with the estimated parameters are automatically generated, and then multiple thresholds are selected as the crossover points of the fuzzy sets that form the estimated fuzzy partitions. Several experiments related to flip chip BGA images show that the proposed algorithm outperforms previous ones using both entropy and variance, and also can be successfully applied to AVI systems.

• Korean Journal of Mathematics
• /
• 제23권3호
• /
• pp.427-438
• /
• 2015

The Schensted algorithm first described by Robinson [5] is a remarkable combinatorial correspondence associated with the theory of symmetric functions. $Sch{\ddot{u}}tzenberger's$ jeu de taquin[10] can be used to give alternative descriptions of both P- and Q-tableaux of the Schensted algorithm as well as the ordinary and dual Knuth relations. In this paper we describe the jeu de taquin on shifted rim hook tableaux using the switching rule, which shows that the sum of the weights of the shifted rim hook tableaux of a given shape and content does not depend on the order of the content if content parts are all odd.

• Proceedings of the KSRS Conference
• /
• 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
• /
• pp.111-114
• /
• 2004

Object-based segmentation is the first essential step for image processing applications. Recently, SAR (Synthetic Aperture Radar) segmentation techniques have been developed, however not enough to preserve the significant information contained in the small regions of the images. The proposed method is to partition an SAR image into homogeneous regions by using a fuzzy hit-or-miss operator with an inherent spatial transformation, which endows to preserve the small regions. In our algorithm, an iterative segmentation technique is formulated as a consequential process. Then, each time in iterating, hypothesis testing is used to evaluate the quality of the segmented regions with a homogeneity index. The segmentation algorithm is unsupervised and employed few parameters, most of which can be calculated from the input data. This comparative study indicates that the new iterative segmentation algorithm provides acceptable results as seen in the tested examples of satellite images.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• 제33A권7호
• /
• pp.261-268
• /
• 1996

Hardware-software codesign becomes improtant to effectively sagisfy perfomrance goals, because designers can trade-off in the way hardware and software components work teogether to exhibit a specified behavior. In this paper, a hardware-software pratitioning algorithm is presetned, in which the system behavioral description containing a mixture of hardware and software components is partitioned into hardware part and software part. The partitioning algorithm tries to minimize the given cost function under constraints on hardware resources or latency. Recursive moving of operations between the hardware and software parts is used to find a near optimum partition and the list scheduling approach is used to estimate the hardware area and latency. Since memory may take substantial protion of the hardware part, memory cost is included in sthe hardware cost. Experimental resutls show that our algorithm is effective.