• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.87-94
• /
• 2005

Pattern matching is one of critical parts of Network Intrusion Prevention Systems (NIPS) and computationally intensive. To handle a large number of attack signature fattens increasing everyday, a network intrusion prevention system requires a multi pattern matching method that can meet the line speed of packet transfer. In this paper, we analyze Snort, a widely used open source network intrusion prevention/detection system, and its pattern matching characteristics. A multi pattern matching method for NIPS should efficiently handle a large number of patterns with a wide range of pattern lengths and case insensitive patterns matches. It should also be able to process multiple input characters in parallel. We propose a multi pattern matching hardware accelerator based on Shift-OR pattern matching algorithm. We evaluate the performance of the pattern matching accelerator under various assumptions. The performance evaluation shows that the pattern matching accelerator can be more than 80 times faster than the fastest software multi-pattern matching method used in Snort.

• Journal of KIISE:Software and Applications
• /
• v.34 no.7
• /
• pp.585-594
• /
• 2007

The back propagation algorithm took a long time to learn the input patterns and was difficult to train the additional or repeated learning patterns. So Aleksander proposed the binary neural network which could overcome the disadvantages of BP Network. But it had the limitation of repeated learning and was impossible to extract a generalized pattern. In this paper, we proposed a dynamic 3 dimensional Neuro System which was consisted of a learning network which was based on weightless neural network and a feedback module which could accumulate the characteristic. The proposed system was enable to train additional and repeated patterns. Also it could be produced a generalized pattern by putting a proper threshold into each learning-net's discriminator which was resulted from learning procedures. And then we reused the generalized pattern to elevate the recognition rate. In the last processing step to decide right category, we used maximum response detector. We experimented using the MNIST database of NIST and got 99.3% of right recognition rate for training data.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.163-174
• /
• 2006

In distributed wireless sensor network, it is difficult to transmit and analyze the entire stream data depending on limited networks, power and processor. Therefore it is suitable to use alternative stream data processing after classifying the continuous stream data. We propose a classification framework for continuous multivariate stream data. The proposed approach works in two steps. In the preprocessing step, it takes input as a sliding window of multivariate stream data and discretizes the data in the window into a string of symbols that characterize the signal changes. In the classification step, it uses a standard text classification algorithm to classify the discretized data in the window. We evaluated both supervised and unsupervised classification algorithms. For supervised, we tested Bayesian classifier and SVM, and for unsupervised, we tested Jaccard, TFIDF Jaro and Jaro Winkler. In our experiments, SVM and TFIDF outperformed other classification methods. In particular, we observed that classification accuracy is improved when the correlation of attributes is also considered along with the n-gram tokens of symbols.

• Journal of Korean Society of Rural Planning
• /
• v.11 no.1 s.26
• /
• pp.1-8
• /
• 2005

The purpose of this study is to develop a simulation model of rural road path for infrastructure of green-tourism and public service in rural areas. This study makes an objective function for moving cost minimization considering car travel time according to road characteristics, which can route the optimal shortest road paths between the center places and all rear villages, based on GIS coverages of road-village network for connecting between center places and rural villages as input data of the model. In order to verify the model algorithm, a homogeneous hexagonal network, assuming distribution of villages with same population density and equal distance between neighborhood villages on a level plane area, was tested to simulate the optimal paths between the selected center nodes and the other rear nodes, so that the test showed reasonable shortest paths and road intensity defined in this study. The model was also applied to the actual rural area, Ucheon-myun, which is located on Hoengsung-gun, Kangwon-do, with 72 rural villages, a center village (Uhang, 1st center place) in the area, a county conte. (Hoengsung-eup, 2nd center place), and a city (Wonju, 3rd center place), as upper settlement system. The three kinds of conte. place, Uhang, Hoengsung-eup, and Wonju, were considered as center places of three scenarios to simulate the optimal shortest paths between the centers and rural villages, respectively. The simulation results on the road-village network with road information about pavement and width of road show that several spans having high intensity of road are more important that the others, while some road spans have low intensity of road.

• Journal of Korea Water Resources Association
• /
• v.36 no.1
• /
• pp.117-128
• /
• 2003

The objectives of this study are to develop the total maximum daily loads simulation system, TOLOS that is capable of estimating annual nonpoint source pollution from small watersheds, to monitor the hydrology and water quality of the Balkan HP#6 watershed, and to validate TOLOS with the field data. TOLOS consists of three subsystems: the input data processor based on a geographic information system, the models, and the post processor. Land use pattern at the tested watershed was classified from the Landsat TM data using the artificial neutral network model that adopts an error back propagation algorithm. Paddy field components were added to SWAT model to simulate water balance at irrigated paddy blocks. SWAT model parameters were obtained from the GIS data base, and additional parameters calibrated with field data. TOLOS was then tested with ungauged conditions. The simulated runoff was reasonably good as compared with the observed data. And simulated water quality parameters appear to be reasonably comparable to the field data.

• Journal of KIISE:Software and Applications
• /
• v.30 no.11
• /
• pp.1015-1024
• /
• 2003

In [1] we proposed a method to generate a test model (GFSM) from a set of scenarios of embedded software. Each scenario describes the interaction sequences for an external input event. Although these external events are generated and accepted alternatively and concurrently by embedded software, we considered only the alternative relations. In this paper, we describe an improved algorithm to generate GFSM from concurrent scenarios, and propose methods to reduce the number of transitions in the GFSM. The first is the synchronous interpretation of message passing instead of asynchronous one considering the real behavior of tasks in embedded software. The others apply the partial order techniques to the GFSM using independent regions. We apply the method to generate a reduced GFSM of embedded software running on a digital TV.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.455-465
• /
• 2009

Suffix trees are widely used in similar sequence matching for DNA. They have several problems such as time consuming, large space usages of disks and memories and data skew, since DNA sequences are very large and do not fit in the main memory. Thus, in the paper, we present a space efficient indexing method called SENoM, allowing us to build trees without merging phases for the partitioned sub trees. The proposed method is constructed in two phases. In the first phase, we partition the suffixes of the input string based on a common variable-length prefix till the number of suffixes is smaller than a threshold. In the second phase, we construct a sub tree based on the disk using the suffix sets, and then write it to the disk. The proposed method, SENoM eliminates complex merging phases. We show experimentally that proposed method is effective as bellows. SENoM reduces the disk usage less than 35% and reduces the memory usage less than 20% compared with TRELLIS algorithm. SENoM is available to query efficiently using the prefix tree even when the length of query sequence is large.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.10
• /
• pp.955-961
• /
• 2010

In this paper, we describe a study of a vehicle detection method based on a Boosting Classifier which uses Histogram of Oriented Gradient (HOG) features and Image Segmentation techniques. An input image is segmented by means of a split and merge algorithm. Then, the two largest segmented regions are removed in order to reduce the search region and speed up processing time. The HOG features are then calculated for each pixel in the search region. In order to detect the vehicle region we used the AdaBoost (adaptive boost) method, which is well known for classifying samples with two classes. To evaluate the performance of the proposed method, 537 training images were used to train and learn the classifier, followed by 500 non-training images to provide the recognition rate. From these experiments we were able to detect the proper image 98.34% of the time for the 500 non-training images. In conclusion, the proposed method can be used for detecting the location of a vehicle in an intelligent vehicle control system.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.2
• /
• pp.57-64
• /
• 2014

Most previous studies of software fault prediction model which determines the fault-proneness of input modules have focused on supervised learning model using training data set. However, Unsupervised learning model is needed in case supervised learning model cannot be applied: either past training data set is not present or even though there exists data set, current project type is changed. Building an unsupervised learning model is extremely difficult that is why only a few studies exist. In this paper, we build unsupervised models using representative clustering algorithms, EM and DBSCAN, that have not been used in prior studies and compare these models with the previous model using K-means algorithm. The results of our study show that the EM model performs slightly better than the K-means model in terms of error rate and these two models significantly outperform the DBSCAN model.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.6
• /
• pp.155-161
• /
• 2021

Gesture recognition analytics through a camera in real time have been widely studied in recent years. Since a small number of features from human joints are extracted, low accuracy of classifying models is get in conventional gesture recognition studies. In this paper, CBAM (Convolutional Block Attention Module) with high accuracy for classifying images is proposed as a classification model and algorithm calculating the angle of joints depending on actions is presented to solve the issues. Employing five exercise gestures images from the fitness posture images provided by AI Hub, the images are applied to the classification model. Important 8-joint angles information for classifying the exercise gestures is extracted from the images by using MediaPipe, a graph-based framework provided by Google. Setting the features as input of the classification model, the classification model is learned. From the simulation results, it is confirmed that the exercise gestures are classified with high accuracy in the proposed model.