• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.99-104
• /
• 2000

In this paper, as a digital watermark we propose to use a chaotic sequence instead of the conventional Gaussian sequence. It is relatively easy to generate the chaotic sequence and is very sensitive to the change of initial value. The chaotic sequence adopted in this paper is a modified version of logistic map to give the sequence distribution of Chebyshev map. In the experiments, we applied the Gaussian sequence and chaotic sequence to wavelet coefficients of images to compare the similarity distribution. The results show that, as id the DCT-based watermarking system, the chaotic sequence is robust for various signal processing attacks, Moreover, the similarity variance is smaller than the Gaussian sequence for iterative experiments. It also shows a better performance for compression errors than the Gaussian sequence.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.21-29
• /
• 2001

We show that image make converts of multiplex resolution using wavelet transform algorithm. To evaluate the robustness. we have measured comparison or similarity using various sequences which is inserted important coefficient of middle frequency band. The wavelet transform is advantage that it has a special quality of frequency domain and a special quality of spatial domain. Watermark is used pseudo random number, gaussian sequence, chaos sequence and sobel sequence. As result of experiments, it is to certify that The chaos sequence similarity is higher than other sequence. So the chaos sequence will be used for watermark sequence.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.248-256
• /
• 2004

Woerner had suggested an asynchronous trellis-coded DS/CDMA system based on a multi-sequence signaling, biorthogonal sequence, which is superior to single sequence signaling, such as M-ary PSK, due to their better cross-correlation properties. This paper analyzes and compares system performance between OPSM, a recently-presented multi-sequence signaling scheme, and biorthogonal sequence signaling. Interuser interference moments of the two schemes are derived and compared which verifies that OPSM, having smaller signature sequences per symbol than biorthogonal signaling, reduces cross-correlation. Numerical results compare the power and spectral efficiency of asynchronous trellis-coded DS/CDMA systems based on multi-sequence signaling.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.39-42
• /
• 2001

본 논문에서는 시계열 데이터베이스에서 서브시퀀스 매칭을 효과적으로 처리하는 방안에 관하여 논의한다. 먼저, 서브시퀀스 매칭의 후처리 과정에서 발생하는 기존 기법의 문제점을 지적하고, 이를 해결할 수 있는 최적의 기법을 제안하였다. 제안된 기법은 이진 트리 내에 후보 시퀀스에 대한 정보를 삽입해 둠으로써 같은 시퀀스에 속하는 후보 윈도우들과 같은 서브시퀀스에 속하는 후보 윈도우들을 연속적으로 처리하는 방식을 사용한다. 이 결과, 디스크 액세스와 서브시퀀스 비교의 측면에서 중복 작업을 완전히 제거할 수 있다. 제안된 기법의 성능 개선 효과를 검증하기 위하여 실제 주식 데이터를 위한 성능 평가를 수행하였다. 실험 결과에 의하면, 제안된 기법은 기존의 기법과 비교하여 전체적으로 55배에서 156배까지의 성능 개선 효과가 있는 것으로 나타났다.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.355-358
• /
• 2001

본 논문에서는 객체의 움직임에 의한 모양 변화를 표현하기 위하여 MPEG-7 에 제안된 모양 시퀀스 기술자(Shape Sequence Descriptor)에 대하여 설명하고, 모양 시퀀스 기술자 추출에 필요한 Shape Variation Map 생성을 위한 두 가지 방법을 비교하였다. 기존의 방법은 물체의 평균 적인 모양에 가중치를 두어 생성되며, 새로운 방법은 물체의 움직임에 의해 변화되는 부분에 더 가중치를 두는 방법으로 생성된다. 또한 최종적으로 사용되는 특징 값으로 Zernike moment를 이용하는 방법과 ART(Angular Radial Transform)을 이용하는 방법을 비교하여 모양 시퀀스 검색을 위한 가장 효율적인 방법을 제안하였다.

• 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.

• Proceedings of the KIPE Conference
• /
• 2013.11a
• /
• pp.46-47
• /
• 2013

본 논문에서는 6 직렬 연결된 ITER VS 컨버터의 시퀀스 제어 비교 해석에 대하여 서술하였다. 소자의 가용성이나 크기등의 한계로 인하여 여러개의 싸이리스터 정류기를 직렬로 연결하게 되는데 이때 각각의 컨버터를 제어하는 방식에 따라 출력전압과 유효 무효전력의 값이 변하게 된다. 본 논문에서는 ${\alpha}_{min}$, ${\alpha}_{max}$, 중복값에 대하여 시퀀스제어를 사용하지 않을 경우와 2개조 3대와 1개조 6대로 시퀀스 제어를 하였을 때를 비교하였다. 모든 경우에서 출력전압인 $V_d$의 값은 동일하지만 무효전력은 시퀀스 제어를 할 경우 각각 22%, 27%감소 하였으며, 6대 싸이리스터 정류기들의 점호각 ${\alpha}$의 변화를 최소화하는 스위칭 방법을 제안하였다.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.9
• /
• pp.363-372
• /
• 2019

A sequence refers to data in which the order exists on the two items, and purchase transaction data in which the products purchased by one customer are listed is one of the representative sequence data. In general, all goods have a product taxonomy, such as category/ sub-category/ sub-sub category, and if they are similar to each other, they are classified into the same category according to their characteristics. Therefore, in this paper, we not only consider the purchase order of products to compare two purchase transaction sequences, but also calculate their similarity by giving a higher score if they are in the same category in spite of their difference. Especially, in order to choose the best similarity measure that directly affects the calculation performance of the purchase transaction sequences, we have compared the performance of three representative similarity measures, the Levenshtein distance, dynamic time warping distance, and the Needleman-Wunsch similarity. We have extended the existing methods to take into account the product taxonomy. For conventional similarity measures, the comparison of goods in two sequences is calculated by simply assigning a value of 0 or 1 according to whether or not the product is matched. However, the proposed method is subdivided to have a value between 0 and 1 using the product taxonomy tree to give a different degree of relevance between the two products, even if they are different products. Through experiments, we have confirmed that the proposed method was measured the similarity more accurately than the previous method. Furthermore, we have confirmed that dynamic time warping distance was the most suitable measure because it considered the degree of association of the product in the sequence and showed good performance for two sequences with different lengths.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.4
• /
• pp.325-332
• /
• 2017

In this paper, a survey of test sequence generation methods for testing the conformance of a protocol implementation to its specification is presented. The best known methods proposed in the literature are called transition tour, distinguishing sequence, characterizing sequence, and unique input/output sequence. Also, several variants of the above methods are introduced. Applications of these methods to the finite state machine model are discussed. Then, comparative analysis of the methods is made in terms of test sequence length. Finally, conclusions are given as follows. The T-method produces the shortest test sequence, but it has the worst fault coverage. The W-method tends to produce excessively long test sequences even though its fault coverage is complete. The problem with the DS-method is that a distinguishing sequence may not exist. The UIO-method is more widely applicable, but it does not provide the same fault coverage as the DS-method.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.555-560
• /
• 2002

Subsequence matching, which consists of index searching and post-processing steps, is an operation that finds those subsequences whose changing patterns are similar to that of a given query sequence from a time-series database. This paper discusses optimization of post-processing for subsequence matching. The common problem occurred in post-processing of previous methods is to compare the candidate subsequence with the query sequence for discarding false alarms whenever each candidate subsequence appears during index searching. This makes a sequence containing candidate subsequences to be accessed multiple times from disk, and also have a candidate subsequence to be compared with the query sequence multiple times. These redundancies cause the performance of subsequence matching to degrade seriously. In this paper, we propose a new optimal method for resolving the problem. The proposed method stores ail the candidate subsequences returned by index searching into a binary search tree, and performs post-processing in a batch fashion after finishing the index searching. By this method, we are able to completely eliminate the redundancies mentioned above. For verifying the performance improvement effect of the proposed method, we perform extensive experiments using a real-life stock data set. The results reveal that the proposed method achieves 55 times to 156 times speedup over the previous methods.