• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.6
• /
• pp.431-441
• /
• 2003

This paper presents the design of 32 bit microprocessor for a sequence control using a field programmable gate array(FPGA). The microprocessor was designed by a VHDL with top down method, the program memory was separated from the data memory for high speed execution of sequence instructions. Therefore it was possible that sequence instructions could be operated at the same time during the instruction fetch cycle. In order to reduce the instruction decoding time and the interface time of the data memory interface, an instruction code size was implemented by 32 bits. And the real time debug operation was implemented for easeful debugging the designed processor with a single step run, PC break point run, data memory break point run. Also in this designed microprocessor, pulse instructions, step controllers, master controllers, BM and BCD type arithmetic instructions, barrel shift instructions were implemented for sequence logic control. The FPGA was synthesized under a Xilinx's Foundation 4.2i Project Manager using a V600EHQ240 which contains 600,000 gates. Finally simulation and experiment were successfully performed respectively. For showing good performance, the designed microprocessor for the sequence logic control was compared with the H8S/2148 microprocessor which contained many bit instructions for sequence logic control. The designed processor for the sequence logic showed good performance.

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

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.06a
• /
• pp.109-110
• /
• 2017

파노라마 영상은 $360^{\circ}$ 방향의 모든 경치를 담는 기법을 말한다. 파노라마 영상은 전문적 기술자들이 여러 영상을 정합하여 제작되었지만, 기술이 점차 발전하여 현재는 일반 사용자들도 스마트 폰을 이용하여 손쉽게 파노라마 영상을 제작할 수 있다. 하지만 이는 파노라마 정지영상에 한해있으며 아직까지 파노라마 동영상은 제작에 있어서 기술적 어려움이 있다. 최근 들어서 파노라마 동영상 제작을 위한 여러 동영상 간의 시간축 동기화는 연구되었는데 연속되는 프레임들을 하나의 시퀀스로 묶어 시퀀스 단위로 키포인트 및 디스크립터를 추출 및 비교를 통해 동영상 간의 시간축을 동기화시키는 방향으로 나갔다. 하지만 동영상 시퀀스 간의 간격이 좁아 중복되는 데이터의 양이 많아 디스크립터 비교 연산 시간이 오래 걸리고, 동영상 간의 시퀀스 단위만으로 비교하기 인해 프레임 단위의 정확한 시간축 동기화에 어려움이 있었다. 본 논문에서는 이전 연구의 단점을 개선하여 여러 동영상 간의 시간축을 하나로 동기화시키는 기술을 최적화하는 방법을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.10A
• /
• pp.1794-1801
• /
• 2001

다중 반송파 변조의 일종인 OFDM(Orthogonal Frequency Division Multiplexing) 방식은 기존의 주파수 분할 다중화 기법에 각 부 채널들 사이의 직교성까지 보장함으로써 사용 주파수 효율을 극대화시킬 수 있는 방식이다. 그러나 주파수 비 선택적 다중경로 채널에서 높은 데이터 율을 갖는 OFDM 신호의 전송은 주파수 영역에서 인접 심벌간 간섭과 동일한 형태를 갖는 승산성 왜곡에 의해 영향을 받는다. 본 논문에서는 결정 궤환 시퀀스 등화기를 OFDM 시스템에 적용하여 신호를 등화하고, 등화를 통하여 주파수 영역에서의 인접 심벌간 간섭을 보상하는 방법을 제안한다. 결정 궤환 시퀀스 등화를 이용하여 최우 시퀀스 등화가 갖는 복잡도를 크게 줄이면서 주파수 오프셋이 추정될 수 있음을 설명하고 모의 실험을 통해 OFDM 시스템의 성능 개선을 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.4-6
• /
• 2002

네트워크의 광역화와 새로운 공격 유형의 발생으로 침입 탐지 시스템에서 새로운 시퀀스의 추가나 침입탐지 모델 구축의 수동적인 접근부분이 문제가 되고 있다. 특히 기존의 침입탐지 시스템들은 대량의 네트워크 하부구조를 가진 네트워크 정보를 수집 및 분석하는데 있어 각각 전담 시스템들이 담당하고 있다. 따라서 침입탐지 시스템에서 증가하는 많은 양의 감사데이터를 분석하여 다양한 공격 유형들에 대해서 능동적으로 대처할 수 있도록 하는 것이 필요하다. 최근, 침입 탐지 시스템에 데이터 마이닝 기법을 적용하여 능동적인 침입탐지시스템을 구축하고자 하는 연구들이 활발히 이루어지고 있다. 이 논문에서는 대량의 감사 데이터를 정확하고 효율적으로 분석하기 위한 마이닝 시스템을 설계하고 구현한다. 감사데이터는 트랜잭션데이터베이스와는 다른 특성을 가지는 데이터이므로 이를 고려한 마이닝 시스템을 설계하였다. 구현된 마이닝 시스템은 연관규칙 기법을 이용하여 감사데이터 속성간의 연관성을 탐사하고, 빈발 에피소드 기법을 적용하여 주어진 시간 내에서 상호 연관성 있게 발생한 이벤트들을 모음으로써 연속적인 시간간격 내에서 빈번하게 발생하는 사건들의 발견과 알려진 사건에서 시퀀스의 행동을 예측하거나 기술할 수 있는 규칙을 생성한 수 있다. 감사데이터의 마이닝 결과 생성된 규칙들은 능동적인 보안정책을 구축하는데 활용필 수 있다. 또한 데이터양의 감소로 침입 탐지시간을 최소화하는데도 기여한 것이다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.7
• /
• pp.857-865
• /
• 2020

This paper presents a method for code generation of UML sequence diagrams based on message patterns. In the sequence diagrams, it is shown that messages are some types of forms typically. This paper classifies according to type as three patterns, and construct meta-information for code generation analysing structural infomation for each patterns. The meta-message of structural information (MetaMessage) is stored in the MetaMessage datastore and the meta-method information from the MetaMessage is stored in the MetaMethod datastore. And then, the structural information of MetaClass and MetaObject is constructed in each datastore too. For each pattern, this paper presents a method for code generation based on the meta information of message patterns and the syntax of target progamming language. Also, branching and looping that has been seldom handled integratedly in the previous works are handled as same as the basic patterns by classifying the branching pattern and the looping pattern for code generation integratedly.

• Journal of Convergence for Information Technology
• /
• v.12 no.2
• /
• pp.47-53
• /
• 2022

Recently, with the change of the intelligent security paradigm, study to apply various information generated from various information security systems to AI-based anomaly detection is increasing. Therefore, in this study, in order to convert log-like time series data into a vector, which is a numerical feature, the CBOW and Skip-gram inference methods of deep learning-based Word2Vec model and statistical method based on the coincidence frequency were used to transform the published ADFA system call data. In relation to this, an experiment was carried out through conversion into various embedding vectors considering the dimension of vector, the length of sequence, and the window size. In addition, the performance of the embedding methods used as well as the detection performance were compared and evaluated through GRU-based anomaly detection model using vectors generated by the embedding model as an input. Compared to the statistical model, it was confirmed that the Skip-gram maintains more stable performance without biasing a specific window size or sequence length, and is more effective in making each event of sequence data into an embedding vector.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.201-213
• /
• 2006

A time-series database is a set of time-series data sequences, each of which is a list of changing values of the object in a given period of time. Subsequence matching is an operation that searches for such data subsequences whose changing patterns are similar to a query sequence from a time-series database. This paper addresses a performance issue of time-series subsequence matching. First, we quantitatively examine the performance degradation caused by the window size effect, and then show that the performance of subsequence matching with a single index is not satisfactory in real applications. We argue that index interpolation is fairly useful to resolve this problem. The index interpolation performs subsequence matching by selecting the most appropriate one from multiple indexes built on windows of their inherent sizes. For index interpolation, we first decide the sites of windows for multiple indexes to be built. In this paper, we solve the problem of selecting optimal window sizes in the perspective of physical database design. For this, given a set of query sequences to be peformed in a target time-series database and a set of window sizes for building multiple indexes, we devise a formula that estimates the cost of all the subsequence matchings. Based on this formula, we propose an algorithm that determines the optimal window sizes for maximizing the performance of entire subsequence matchings. We formally Prove the optimality as well as the effectiveness of the algorithm. Finally, we perform a series of extensive experiments with a real-life stock data set and a large volume of a synthetic data set. The results reveal that the proposed approach improves the previous one by 1.5 to 7.8 times.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.630-637
• /
• 2003

This paper proposed a new watermarking algorithm using chaotic sequence instead of conventional M-sequence for protecting copyright to the author. Robustness and security is very important for watermarking process. We use multi-threshold value according to the human visual system for improving robustness of watermarking to each subband images coefficient differently after wavelet transform. And then, we embedded watermark image to original image by multi-watermark weights which are made by random sequence generator. We detect watermark image from the difference data which is made from each wavelet subband images. We also simulate the efficiency from the various possible attacks. Chaotic sequence is better than M-sequence, because the one is very easy to make sequence and the chaotic sequence is changed easy according to the initial value. So, the chaotic sequence has the better security than the conventional M-sequence.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.586-590
• /
• 2010

In this paper we formally define the linear detrending subsequence matching and propose its efficient index-based solution. To this end, we first present the notion of LD-windows. We eliminate the linear trend from a subsequence rather than each window itself and obtain LD-windows by dividing the subsequence into windows. Using the LD-windows we present a lower bounding theorem of the index-based solution and formally prove its correctness. Based on this lower bounding theorem, we then propose the index building and subsequence matching algorithms, respectively. Finally, we show the superiority of our index- based solution through experiments.