• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.5
• /
• pp.429-434
• /
• 2013

This paper proposes a CPSO (Cooperative Particle Swarm Optimization)-based MPC (Model Predictive Control) scheme to deal with formation control problem of multiple nonholonomic mobile robots. In a distributed MPC framework, each robot needs to optimize control input sequence over a finite prediction horizon considering control inputs of the other robots where their cost functions are coupled by the state variables of the neighboring robots. In order to optimize the control input sequence, a CPSO algorithm is adopted and modified to fit into the formation control problem. Experiments are performed on a group of nonholonomic mobile robots to demonstrate the effectiveness of the proposed CPSO-based MPC for multi-robot formation.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.552-562
• /
• 1997

This paper proposes a formal method on confromance testing for INAP(AIN) test sequence generation by optimization technique.In order to implement and prove the dffectiveness of the proposed method,we specify the SRSM of INAP protocol SRF in SDL and generate I/O FSM by using our S/W tool. We generate an opti-mal test sequence by applying our method our method to this reference I/O FSM. We prove experimentally that the length of the generated test sequence by our method is more effective and shorter(i.e 32% improved)than the one geverated by UIO method,and estimate that The test coverage space of our test sequence is larger that of UIO method.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.12
• /
• pp.579-586
• /
• 2021

Time series forecasting refers to predicting future time information based on past time information. Accurately predicting future information is crucial because it is used for establishing strategies or making policy decisions in various fields. Recently, a transformer model has been mainly studied for a time series prediction model. However, the existing transformer model has a limitation in that it has an auto-regressive structure in which the output result is input again when the prediction sequence is output. This limitation causes a problem in that accuracy is lowered when predicting a distant time point. This paper proposes a sequential decoding model focusing on the style transformation technique to handle these problems and make more precise time series forecasting. The proposed model has a structure in which the contents of past data are extracted from the transformer-encoder and reflected in the style-based decoder to generate the predictive sequence. Unlike the decoder structure of the conventional auto-regressive transformer, this structure has the advantage of being able to more accurately predict information from a distant view because the prediction sequence is output all at once. As a result of conducting a prediction experiment with various time series datasets with different data characteristics, it was shown that the model presented in this paper has better prediction accuracy than other existing time series prediction models.

• Journal of Broadcast Engineering
• /
• v.24 no.1
• /
• pp.48-57
• /
• 2019

The purpose of this study is to understand the intention of the inquirer from the single text type question in Goal-oriented dialogue. Goal-Oriented Dialogue system means a dialogue system that satisfies the user's specific needs via text or voice. The intention analysis process is a step of analysing the user's intention of inquiry prior to the answer generation, and has a great influence on the performance of the entire Goal-Oriented Dialogue system. The proposed model was used for a daily chemical products domain and Korean text data related to the domain was used. The analysis is divided into a speech-act which means independent on a specific field concept-sequence and which means depend on a specific field. We propose a classification method using the word embedding model and the CNN as a method for analyzing speech-act and concept-sequence. The semantic information of the word is abstracted through the word embedding model, and concept-sequence and speech-act classification are performed through the CNN based on the semantic information of the abstract word.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.923-930
• /
• 2006

In this paper we design the system test model for the weapon system embedded software based on the Time Factor Method(TFM) considering time factors and suggest the results through the case study. For doing this, we discuss the features, system tests and the object-oriented model based UML notations of the weapon system embedded software. And we give a test method considering time factors, a measuring method to time factors, and a test case selection algorithm as an approach to the TFM for designing the system test model. The TFM based system test model consists of three factors (X, Y, Z) in the weapon system embedded software. With this model, we can extract test cases through the selection algorithm for a maximum time path in 'X', identify the objects related to the Sequence Diagram in 'Y' and measure the execution time of each objects which is identified by the Timing Diagram in 'Z' Also, we present the method of extracting the system test cases by applying the proposed system test model to the 'Multi-function missile defense system'.

• Korean Journal of Poultry Science
• /
• v.44 no.2
• /
• pp.103-111
• /
• 2017

The quail (Coturnix japonica) has been used as a model animal in many research fields and its application is still expanding in other fields. Compared to the chicken, the quail is quicker to reach sexually maturity, has short generation intervals, is easy to handle, requires less space and feed, and is sturdy. In addition, it produces many eggs and the research tools developed for chicken can be applied directly to quail or with some modifications. Due to recent advances in next-generation sequencing, abundant sequence data for the quail genome and transcripts have been generated. These sequence data are valuable sources for studying functional genomics using quail, which is one of the model animal used to investigate gene function and networks. Although there are some obstacles to be removed, the quail is the best optimized model to study the functional genomics of poultry. In many research fields, functional genomics study using the quail model will provide the best opportunity to understand the phenomena and principles of life. We review why, among many other birds, the quail is the best model for studying poultry functional genomics.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.395-408
• /
• 2004

A conjunctive Boolean text query refers to a query that searches for tort documents containing all of the specified keywords, and is the most frequently used query form in information retrieval systems. Typically, the query specifies a long list of keywords for better precision, and in this case, the order of keyword processing has a significant impact on the query speed. Currently known approaches to this ordering are based on heuristics and, therefore, cannot guarantee an optimal ordering. We can use a systematic approach by leveraging a database query processing algorithm like the dynamic programming, but it is not suitable for a text query with a typically long list of keywords because of the algorithm's exponential run-time (Ο(n2$^{n-1}$)) for n keywords. Considering these problems, we propose a new approach based on a property called the join sequence separability. This property states that the optimal join sequence is separable into two subsequences of different join methods under a certain condition on the joined relations, and this property enables us to find a globally optimal join sequence in Ο(n2$^{n-1}$). In this paper we describe the property formally, present an optimization algorithm based on the property, prove that the algorithm finds an optimal join sequence, and validate our approach through simulation using an analytic cost model. Comparison with the heuristic text query optimization approaches shows a maximum of 100 times faster query processing, and comparison with the dynamic programming approach shows exponentially faster query optimization (e.g., 600 times for a 10-keyword query).

• KIISE Transactions on Computing Practices
• /
• v.23 no.5
• /
• pp.316-321
• /
• 2017

We analyze the online Hangul handwriting recognition problem (HHR) and present solutions based on recurrent neural networks. The solutions are organized according to the three kinds of sequence labeling problem - sequence classifications, segment classification, and temporal classification, with additional consideration of the structural constitution of Hangul characters. We present a stacked gated recurrent unit (GRU) based model as the natural HHR solution in the sequence classification level. The proposed model shows 86.2% accuracy for recognizing 2350 Hangul characters and 98.2% accuracy for recognizing the six types of Hangul characters. We show that the type recognizing model successfully follows the type change as strokes are sequentially written. These results show the potential for RNN models to learn high-level structural information from sequential data.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.92-103
• /
• 2010

In this paper, a method for the recognition of dynamic hand gestures in various backgrounds using Dynamic Space Time Warping(DSTW) algorithm is proposed. The existing method using DSTW algorithm compares multiple candidate hand regions detected from every frame of the query sequence with the model sequences in terms of the time. However the existing method can not exactly recognize the models because a false path can be generated from the candidates including not-hand regions such as background, elbow, and so on. In order to solve this problem, in this paper, we use the invariant moments extracted from the candidate regions of hand and compare the similarity of invariant moments among candidate regions. The similarity is utilized as a weight and the corresponding value is applied to the matching cost between the model sequence and the query sequence. Experimental results have shown that the proposed method can recognize the dynamic hand gestures in the various backgrounds. Moreover, the recognition rate has been improved by 13%, compared with the existing method.

• Water for future
• /
• v.14 no.2
• /
• pp.63-69
• /
• 1981

This Study is aimed at optimal sequencing of water supply projects for water demand from the application in water resources field of dynamic programming because a minimum present cost strategy for investment in water supply projects plays an important part of installation of some projects. In analysis, the relationships of the future water demand and numerous possible independent projects that are expected to meet water requirements up to some future data in Daegu city were used and future water demand were estimated from the exponential function method, the method used by the Water Works Bureau of Daegu City government which is a kind of geometric progression method and the mean value of these two methods. The results showed that the optimal sequencing of water supply projects using Dynamic Programming was reasonable and the changing of the estimation method of future water demand made a difference among optimal sequence of projects while the changing of annual rate of interest had influenced on present value cost only. In general, the best sequence for constructing the seven projects was the order of D-E-G-F-C-B-A, with the corresponding period for 33-38 years.