• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.711-725
• /
• 2013

A heuristic with multi-byte suffix matching plays an important role in real pattern matching algorithms. By skipping many characters at a time in the process of comparing a given pattern with the text, the pattern matching algorithm based on a heuristic with multi-byte suffix matching shows a faster average search time than algorithms based on deterministic finite automata. Based on various experimental results and simulations, the previous works show that the pattern matching algorithms with multi-byte suffix matching performs well. However, there have been limited studies on the mathematical model for analyzing the performance in a standard manner. In this paper, we propose a new probabilistic model, which evaluates the performance of a heuristic with multi-byte suffix matching in an average-case search. When the theoretical analysis results and experimental results were compared, the proposed probabilistic model was found to be sufficient for evaluating the performance of a heuristic with suffix matching in the real pattern matching algorithms.

• 디지털산업정보학회논문지
• /
• 제9권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.

• 대한산업공학회지
• /
• 제14권1호
• /
• pp.73-82
• /
• 1988

This research is concerned with production scheduling for FMS (Flexible Manufacturing System) which consists of machine centers served by cycle conveyor. The objective of the research is to develop and evaluate scheduling procedures to minimize the mean flow time. An optimal algorithm called SCTF (Shortest Circle Time First) is proposed when the conveyor runs at minimum possible speed (CS=1) and a heuristic algorithm called SCTJMF (Shortest Cycle Time and Job Matching Algorithm) is suggested when the conveyor runs at double speed (CS=2). The evaluation of the heuristic algorithm was implemented by comparison with the optimal algorithm for 112 experimentations for CS=1 and random schedule. The results showed that the proposed heuristic algorithm provides better solution that can be regarded noticeable when compared with SCTF algorithm and random scheduling.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권11호
• /
• pp.5203-5217
• /
• 2018

In order to increase the capacity and improve the spectrum efficiency of wireless communication systems, this paper proposes a rate-based two-sided many-to-one matching game algorithm for energy-harvesting small cells with non-orthogonal multiple access (NOMA) in heterogeneous cellular networks (HCN). First, we use a heuristic clustering based channel allocation algorithm to assign channels to small cells and manage the interference. Then, aiming at addressing the user access problem, this issue is modeled as a many-to-one matching game with the rate as its utility. Finally, considering externality in the matching game, we propose an algorithm that involves swap-matchings to find the optimal matching and to prove its stability. Simulation results show that this algorithm outperforms the comparing algorithm in efficiency and rate, in addition to improving the spectrum efficiency.

• 한국공간정보시스템학회:학술대회논문집
• /
• 한국공간정보시스템학회 2005년도 GIS/RS 공동 춘계학술대회
• /
• pp.345-349
• /
• 2005

Massive amount of satellite image processing such asglobal/continental-level analysis and monitoring requires automated and speedy georegistration. There could be two major automated approaches: (1) rigid mathematical modeling using sensor model and ephemeris data; (2) heuristic co-registration approach with respect to existing reference image. In case of ETM+, the accuracy of the first approach is known as RMSE 250m, which is far below requested accuracy level for most of satellite image processing. On the other hands, the second approach is to find identical points between new image and reference image and use heuristic regression model for registration. The latter shows better accuracy but has problems with expensive computation. To improve efficiency of the coregistration approach, the author proposed a pre-qualified matching algorithm which is composed of feature extraction with canny operator and area matching algorithm with correlation coefficient. Throughout the pre-qualification approach, the computation time was significantly improved and make the registration accuracy is improved. A prototype was implemented and tested with the proposed algorithm. The performance test of 14 TM/ETM+ images in the U.S. showed: (1) average RMSE error of the approach was 0.47 dependent upon terrain and features; (2) the number average matching points were over 15,000; (3) the time complexity was 12 min per image with 3.2GHz Intel Pentium 4 and 1G Ram.

• 전자공학회논문지B
• /
• 제30B권7호
• /
• pp.59-69
• /
• 1993

In this paper, a new matching strategy for 3-D object recognition, based on the Surface Normal Images (SNIs), is proposed. The matching strategy using the similarity decision function [9,10] lost the efficiency and the reliability of matching, because all features of models within model base must be compared with the scene object features, and the weights of the attributes of features is given by heuristic manner. However, the proposed matching strategy can solve these problems by using a new approach. In the approach, by searching the model base, a model object whose features are fully matched with the features of sceme object is selected. In this paper, the model base is constructed for the total 26 objects, and systhetic and real range images are used in the test of the system operation. Experimental result is performed to show the possibility that this strategy can be effectively used for the SNI based recognition.

• 정보처리학회논문지D
• /
• 제14D권2호
• /
• pp.145-156
• /
• 2007

최근 웹 문서의 변조의 탐지, 버전 관리 등을 위한 XML/HTML 문서들에 대한 효과적인 실시간 변화탐지 알고리즘의 필요성이 증대하고 있다. 특히 대용량의 XML/HTML 문서들에 대한 실시간 변화탐지 응용들은 최소비용의 편집스크립트를 계산하는 알고리즘 보다는 실시간 처리가 가능한 빠른 휴리스틱 알고리즘들을 필요로 한다. 기존의 휴리스틱 알고리즘들은 실행속도는 빠르나 생성되는 편집스크립트의 질이 만족스럽지 못하다. 본 논문에서는 기존의 알고리즘 XyDiff와 X-tree Diff를 소개하고 이들 알고리즘들의 문제점들을 분석하고 문제점들을 개선한 알고리즘 X-tree Diff+를 제안한다. X-tree Diff+는 실행시간 측면에서 기존 알고리즘들과 유사하나 대응효율성에 기반한 대응과정의 개선을 통해 두 문서 간의 노트들의 대응률을 향상시킨 알고리즘이다.

• 정보화연구
• /
• 제9권4호
• /
• pp.357-363
• /
• 2012

Ontologies are being used in order to define common vocabularies to describe the elements of schemas involved in a particular application. The problem of finding correspondences between ontologies concepts, called ontology matching, consists in the discovery of correspondences between terms of vocabularies (represented by ontologies) used by various applications. The majority of solutions proposed in the literature, despite being fully automatic, has heuristic nature and may produce nonsatisfactory results. The problem intensifies when dealing with large data sources. The goal of this paper is to propose a method for generation and incremental refinement of correspondences between ontologies. The proposed approach uses filtering techniques, as well as user feedback to support the generation and refinement of such matches. For validation purposes, a tool was developed and some experiments were conducted.

• 한국산학기술학회논문지
• /
• 제4권2호
• /
• pp.87-95
• /
• 2003

Dynamic Programming Matching (DPM)은 순차적으로 구성된 문제를 수학적으로 최적화 시키는 기술로서 패턴인시 분야에서 다년간 중요한 역할을 해왔다. 서명인식을 위한 대부분의 실제적 적용에서는 Sakoe and Chiba [9]의 실제구현 버전이 기반이 되어 왔는데, 일반적으로 slope constraint p = 0의 방법이 적용되어 왔다. 이 논문에서는 이 경우에는 전진탐색에 의한 휴리스틱한 방법을 적용한 MDPM이 상당한 처리시간의 단축 뿐만 아니라 약간의 인식능력 향상을 가질 수 있음을 보여준다.

• 정보처리학회논문지B
• /
• 제10B권4호
• /
• pp.451-458
• /
• 2003

Dynamic Programming Matching(DPM)은 순차적으로 구성된 문제를 수학적으로 최적화 시키는 기술로서 패턴인식 분야에서 다년간 중요한 역할을 해왔다. 서명인식을 위한 대부분의 실제적 적용에서는 Sakoe and Chiba [9]의 실제구현 버전이 기반이 되어 왔는데, 일반적으로 slope constraint p = 0의 방법이 적용되어 왔다. 이 논문에서는 이 경우에는 전진탐색에 의한 휴리스틱한 방법을 적용한 MDPM이 상당한 처리 시간의 단축 뿐만 아니라 약간의 인식능력 향상을 가질 수 있음을 보여준다.