• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.586-594
• /
• 2003

X-Match algorithm is a lossless compression algorithm suitable for hardware implementation owing to its simplicity. It can compress 32 bits per clock cycle and is suitable for real time compression. However, as the bus width increases 64-bit, the compression unit also need to increase. This paper proposes the cooperative parallel X-Match (X-MatchCP) algorithm, which improves the compression speed by performing the two X-Match algorithms in parallel. It searches the all dictionary for two words, combines the compression codes of two words generated by parallel X-Match compression and outputs the combined code while the previous parallel X-Match algorithm searches an individual dictionary. The compression ratio in X-MatchCP is almost the same as in X-Match. X-MatchCP algorithm is described and simulated by Verilog hardware description language.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.357-372
• /
• 2001

In this paper, we present the concept of generalization in constructing windows for subsequence matching and propose a new subsequence matching method. GeneralMatch, based on the generalization. The earlier work of Faloutsos et al.(FRM in short) causes a lot of false alarms due to lack of the point-filtering effect. DualMatch, which has been proposed by the authors, improves performance significantly over FRM by exploiting the point filtering effect, but it has the problem of having a smaller maximum window size (half that FRM) given the minimum query length. GeneralMatch, an improvement of DualMatch, offers advantages of both methods: it can use large windows like FRM and, at the same time, can exploit the point-filtering effect like DualMatch. GeneralMatch divides data sequences into J-sliding windows (generalized sliding windows) and the query sequence into J-disjoint windows (generalized disjoint windows). We formally prove that our GeneralMatch is correct, i.e., it incurs no false dismissal. We also prove that, given the minimum query length, there is a maximum bound of the window size to guarantee correctness of GeneralMatch. We then propose a method of determining the value of J that minimizes the number of page accesses, Experimental results for real stock data show that, for low selectivities ($10^{-6}~10^{-4}$), GeneralMatch improves performance by 114% over DualMatch and by 998% iver FRM on the average; for high selectivities ($10^{-6}~10^{-4}$), by 46% over DualMatch and by 65% over FRM on the average.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.751-754
• /
• 2015

최근 시계열 데이터베이스 기반의 다양한 응용 분야에서 서브시퀀스 매칭(subsequence matching)연구가 활발히 진행되고 있다. FRM과 DualMatch은 효과적인 서브시퀀스 매칭을 위해 처음 제안된 해결책이다. 이후 이들을 일반화한 GeneralMatch가 제안되었으며, 최근에는 GeneralMatch의 이원적 접근법인 DualGMatch가 제안되었다. 본 논문에서는 GeneralMatch와 DualGMath를 비교 분석 하고자 한다. 이를 위해, 먼저 윈도우 구성 관점에서 GeneralMatch와 DualGMatch를 평가한다. 다음으로, 두 해결책을 최대 윈도우 크기 효과와 인덱스 저장 효율 관점에서 이론적으로 비교 분석한다. 마지막으로, 실제 시계열 데이터를 활용하여 GeneralMatch와 DualGMatch의 인덱스 페이지 접근 횟수를 비교한다. 분석 결과, GeneralMatch가 윈도우 크기 효과와 인덱스 저장 효율 측면에서 DualGMatch보다 우수한 것으로 나타났다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.2
• /
• pp.43-46
• /
• 2014

A time-series data is the collection of real numbers over the time intervals. One of the main tasks in time-series data is efficiently to find subsequences similar to a given query sequence. In this paper, we propose an efficient subsequence matching method, which is called Instance-Match (I-Match). I-Match constructs a virtual window in order to reduce false alarms. Through the experiment with real data set and query sets, we show that I-Match improves query processing time by up to 2.95 times and significantly reduces the number of candidates comparing to Dual Match.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.251-260
• /
• 2006

Homology searching on the primary structure (i.e., amino acid arrangement) of protein sequences is an essential part in predicting the functions and evolutionary histories of proteins. However, proteins distant in an evolutionary history do not conserve amino acid residue arrangements, while preserving their structures. Therefore, homology searching on proteins' secondary structure is quite important in finding out distant homology. In this manuscript, we propose an indexing scheme for efficient approximate searching on the secondary structure of protein sequences which can be easily implemented in RDBMS. Exploiting the concept of clustering and lookahead, the proposed indexing scheme processes three types of secondary structure queries (i.e., exact match, range match, and wildcard match) very quickly. To evaluate the performance of the proposed method, we conducted extensive experiments using a set of actual protein sequences. CSI was proved to be faster than the existing indexing methods up to 6.3 times in exact match, 3.3 times in range match, and 1.5 times in wildcard match, respectively.

• The Research Journal of the Costume Culture
• /
• v.13 no.5 s.58
• /
• pp.777-789
• /
• 2005

Mix & Match Visual Image, appearing in T-shirt one-point graphics, is a new visual image emerged as a result of several trends: development of cutting-edge machinery and computer programs, various needs of consumers, and an international trend of fusion concept. Thus, a concrete research of Mix & Match Visual Images is demanding. This paper studies one-point graphic, which appeared in the SamsungDesignNet, Interfashion Planning, and firstviewkorea, with a focus on apparel T-shirt of women's wear and casual wear from 2001 to 2004. The study shows that the most preferred independent visual image in Mix & Match Visual Images is a typography, and next is in the order of marks, symbols, geometric diagrams and abstract shapes, animals and plants, characters, materials, and collages. As Mix & Match of independent visual images was mainly combined typography with other independent visual images, we need to develop more Mix & Match Visual Images using various independent visual images's mix and match. Then, T-shirt will be one of the most representative items in Korean fashion trend that enable consumers to express their characters, escaping from the old-fashioned concept that T-shirt is just a T-shirt.

• The Journal of Korean Society for Radiation Therapy
• /
• v.22 no.1
• /
• pp.19-24
• /
• 2010

Purpose: To study the efficacy of marker match with using kilovoltage (KV) X-ray among multiple image guidance that referring tree fiducial marker in radiation therapy for prostate cancer patients. Materials and Methods: KV two-dimantional images (anterior-posterior, right-left) and cone-beam CT volumetric images were acquired after setup for patients with three fiducial markers. Compare the position of the fiducial marker of reference plan computed tomography (CT) and of KV, CBCT images; then decide the shift score of X, Y, and Z. This study executed 5 times on 10 patients and analyzed the shift value. Results: In the radiation therapy using fiducial marker, The function of marker match showed the same direction tendency as the CBCT, and showed X, Y, Z difference of about 0.6, 0.7, and 0.8 (unit: mm). Conclusion: Comparing to this, the result of shift value using 2D marker match showed less than 1.0 mm difference. The function of marker match is considered more useful in time-wise and effective dose rather than CBCT. Therefore, Both methods are used to treat patients for prostate cancer.

• Proceedings of the KSRS Conference
• /
• 1998.09a
• /
• pp.274-279
• /
• 1998

For the accurate generation of DEMs, the determination of match quality in adaptive least square matching algorithm is significantly important. Traditionally, only the degree of convergence of a solution matrix in least squares estimation has been considered for the determination of match quality. It is, however, not enough to determine the true match quality. This paper reports two approaches of match quality determination based on adaptive least square correlation : the conventional if-then logic approaches with scene geometry and correlation as additional quality measures; and, the fuzzy logic approaches. Through these, accurate decision of match quality will minimize the number of blunder and maximize the number of exact match. The proposed methods have been tested on JERS and SPOT images and the results show good performance.

• Proceedings of the Korean Society Of Semiconductor Equipment Technology
• /
• 2005.05a
• /
• pp.188-191
• /
• 2005

본 논문에서는 RF 플라즈마 발생 장치인 RF-Match의 기구적 최적 설계를 제안하였다. RF-Match의 정합소자 구동 기어단의 효율 개선을 위해 베벨기어를 웜기어로 대체 설계하여 백래쉬를 제거하였으며, 정합소자의 고전력 인가로 인한 아크 발생 문제의 해결을 위해 접지를 개선하여 RF-Match의 기구적 성능을 향상 시켰다.

• Journal of the Korean Society for information Management
• /
• v.7 no.1
• /
• pp.79-95
• /
• 1990

A retrieval technique was defined as a technique for comparing the document representations. So this study classified retrieval technique in terms of the charactristics of the retrieved set of documents and the representations that are used. The distinction is whether the set of retrieved documents contains only documents whose representations are an exact match with the query, or a partial match with query. For a partial match, the set of retrieved document will include also those that are an exact match with the query. Boolean-logic as one of the exact match retrieval techniques is in current in most of the large operational information retrieval systems despite of its problems and limitatlons. Partial match as an alternative technique has also various problems. Existing information retrieval systems are successful in aSSisting the user whose needs are well- defined (e.g. Boolean-logic), to retrieve relevant documents but it should be successful in providing retrieval assistance to the browser whose information requirements is ill-defined.