• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.577-590
• /
• 2003

The shape-based retrieval is defined as the operation that searches for the (sub) sequences whose shapes are similar to that of a query sequence regardless of their actual element values. In this paper, we propose a similarity model suitable for shape-based retrieval and present an indexing method for supporting the similarity model. The proposed similarity model enables to retrieve similar shapes accurately by providing the combination of various shape-preserving transformations such as normalization, moving average, and time warping. Our indexing method stores every distinct subsequence concisely into the disk-based suffix tree for efficient and adaptive query processing. We allow the user to dynamically choose a similarity model suitable for a given application. More specifically, we allow the user to determine the parameter p of the distance function $L_p$ when submitting a query. The result of extensive experiments revealed that our approach not only successfully finds the subsequences whose shapes are similar to a query shape but also significantly outperforms the sequence search.

• Journal of KIISE:Software and Applications
• /
• v.35 no.5
• /
• pp.306-312
• /
• 2008

In a goal-oriented dialogue, speaker's intention can be approximated by a semantic structure that consists of a pair of a speech act and a concept sequence. Therefore, it is very important to correctly identify the semantic structure of an utterance for implementing an intelligent dialogue system. In this paper, we propose a model to efficiently analyze the semantic structures based on an active teaming method. To reduce the burdens of high-level linguistic analysis, the proposed model only uses morphological features and previous semantic structures as input features. To improve the precisions of semantic structure analysis, the proposed model adopts CRFs(Conditional Random Fields), which show high performances in natural language processing, as an underlying statistical model. In the experiments in a schedule arrangement domain, we found that the proposed model shows similar performances(92.4% in speech act analysis and 89.8% in concept sequence analysis) to the previous models although it uses about a third of training data.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.3
• /
• pp.125-132
• /
• 2022

Sentence compression is a natural language processing task that generates concise sentences that preserves the important meaning of the original sentence. For grammatically appropriate sentence compression, early studies utilized human-defined linguistic rules. Furthermore, while the sequence-to-sequence models perform well on various natural language processing tasks, such as machine translation, there have been studies that utilize it for sentence compression. However, for the linguistic rule-based studies, all rules have to be defined by human, and for the sequence-to-sequence model based studies require a large amount of parallel data for model training. In order to address these challenges, Deleter, a sentence compression model that leverages a pre-trained language model BERT, is proposed. Because the Deleter utilizes perplexity based score computed over BERT to compress sentences, any linguistic rules and parallel dataset is not required for sentence compression. However, because Deleter compresses sentences only considering perplexity, it does not compress sentences by reflecting the linguistic information of the words in the sentences. Furthermore, since the dataset used for pre-learning BERT are far from compressed sentences, there is a problem that this can lad to incorrect sentence compression. In order to address these problems, this paper proposes a method to quantify the importance of linguistic information and reflect it in perplexity-based sentence scoring. Furthermore, by fine-tuning BERT with a corpus of news articles that often contain proper nouns and often omit the unnecessary modifiers, we allow BERT to measure the perplexity appropriate for sentence compression. The evaluations on the English and Korean dataset confirm that the sentence compression performance of sentence-scoring based models can be improved by utilizing the proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.338-342
• /
• 1988

Recently, in sequence control systems, high flexibility and maintenance of control software are required. This is because product life cycles become shorter and control specification must be changed frequently. The authors extend the concept of Safe Petri Net to develop the design and analysis tool for sequence control systems taking the safeness and notation of input/output functions into consideration. Extended Safe Petri Net (S-Net) is proposed as such a new graph model and real time scanning algorithm based on S-Net is developed.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.20 no.4
• /
• pp.305-312
• /
• 2015

In this study, inter-turn short fault models of interior permanent magnet synchronous motors (IPMSM) are developed by adding saliency modeling to surface-mounted permanent magnet motor models. The saliency model is obtained using the deformed flux models based on both fault-winding flux information and inductance variations caused by cross-flux linkages that depend on the distribution of the same phase windings. By assuming the balanced three-phase current injection, we obtain the positive and negative sequence voltages and the fault current in the positive and the negative synchronous reference frames. The output torque model is developed by adding the magnet and the reluctance torque, which are derived from the developed models. To verify the proposed IPMSM model with an inter-turn short fault, finite element method-based simulation and experimental measurement results are presented.

• Korean Chemical Engineering Research
• /
• v.52 no.5
• /
• pp.564-573
• /
• 2014

Economic optimization of cumene manufacturing process to produce cumene from benzene and propylene was studied. The chosen objective function was the operational profit per year that subtracted capital cost, utility cost, and reactants cost from product revenue and other benefit. The number of design variables of the optimization are 6. Matlab connected to and controlled Unisim Design to calculate operational profit with the given design variables. As the first step of the optimization, design variable points was sampled and operational profit was calculated by using Unisim Design. By using the sampled data, the estimation model to calculate the operational profit was constructed, and the optimization was performed on the estimation model. This study compared second order polynomial and support vector regression as the estimation method. As the sampling method, central composite design was compared with Hammersley sequence sampling. The optimization results showed that support vector regression and Hammersley sequence sampling were superior than second order polynomial and central composite design, respectively. The optimized operational profit was 17.96 MM$ per year, which was 12% higher than 16.04 MM$ of base case.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.23 no.6
• /
• pp.546-552
• /
• 2013

A cantilevered piezoelectric energy harvester(PEH) and an auxiliary mass-spring unit can be integrated into a novel two-degrees-of-freedom PEH where its lowest eigenmode is not an in-phase modes but an out-of-phase mode. This typical behavior was shown to enhance output power considerably compared with its stand-alone counterpart. The objective of this study is to newly develop a continuum-based mathematical model suitable for efficient analysis of the mode-sequence reversed PEH. Once such a mathematical model is available, various physical behaviors can be analytically investigated for better designs. After a new mathematical model is developed, its validity is checked by using ANSYS results, in terms of resonant frequency, open-circuit voltage, and output power with a specified external resistance.

• Journal of KIISE
• /
• v.44 no.11
• /
• pp.1125-1129
• /
• 2017

LSTM(Long Short-term Memory) is a kind of RNN(Recurrent Neural Network) in which a next-state is updated by remembering the previous states. The information of calling a sequence in a malware can be defined as system call function that is called at each time. In this paper, we use calling sequences of system calls in malware codes as input for malware classification to utilize the feature remembering previous states via LSTM. We run an experiment to show that our method can classify malware and measure accuracy by changing the length of system call sequences.

• Annual Conference on Human and Language Technology
• /
• 2020.10a
• /
• pp.167-171
• /
• 2020

문서 요약은 길이가 긴 원본 문서에서 의미를 유지한 채 짧은 문서나 문장을 얻어내는 작업을 의미한다. 딥러닝을 이용한 자연어처리 기술들이 연구됨에 따라 end-to-end 방식의 자연어 생성 모델인 sequence-to-sequence 모델을 문서 요약 생성에 적용하는 방법들이 연구되었다. 본 논문에서는 여러 자연어처리 분야에서 높은 성능을 보이고 있는 BERT 모델을 이용한 자연어 생성 모델에 복사 메커니즘과 강화 학습을 추가한 문서 요약 모델을 제안한다. 복사 메커니즘은 입력 문장의 단어들을 출력 문장에 복사하는 기술로 학습데이터에서 학습되기 힘든 고유 명사 등의 단어들에 대한 성능을 높이는 방법이다. 강화 학습은 정답 단어의 확률을 높이기 위해 학습하는 지도 학습 방법과는 달리 연속적인 단어 생성으로 얻어진 전체 문장의 보상 점수를 높이는 방향으로 학습하여 생성되는 단어 자체보다는 최종 생성된 문장이 더 중요한 자연어 생성 문제에 효과적일 수 있다. 실험결과 기존의 BERT 생성 모델 보다 복사 메커니즘과 강화 학습을 적용한 모델의 Rouge score가 더 높음을 확인 하였다.

• The KIPS Transactions:PartD
• /
• v.17D no.5
• /
• pp.337-346
• /
• 2010

Timing diagram is popularly utilized for the reason of its advantages; it is convenient for timing diagram to describe behavior of system and it is simple for described behaviors to recognize it. Various techniques are needed to test systems described in timing diagram. One of them is a technique to derive the system into a certain condition under which a test case is effective. This paper proposes a technique to automatically generate the test input sequence to reach the condition for systems described in timing diagram. It requires a proper input set which satisfy transition condition restricted by input waveform and timing constraints to generate a test input sequence automatically. To solve the problem, this paper chooses an approach utilizing the linear programming, and solving procedure is as follows: 1) Get a Timing diagram model as an input, and transforms the timing diagram model into a linear programming problem. 2) Solve the linear programming problem using a linear programming tool. 3) Generate test input sequences of a timing diagram model from the solution of linear programming problem. This paper addresses the formal method to drive the linear programming model from a given timing diagram, shows the feasibility of our approach by prove it, and demonstrates the usability of our paper by showing that our implemented tool solves an example of a timing diagram model.