• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1188-1195
• /
• 2006

This paper presents an efficient design method of 2-D state-space digital filter based on an improved branch-and -bound algorithm. The resultant 2-D state-space digital filters whose coefficients are represented as the sum of two power-of-two terms, are attractive for high-speed operation and simple implementation. The feasibility of the proposed method is demonstrated by several experiments. The results show that the approximation error and group delay characteristic of the resultant filters are similar to those of the digital filters which designed in the continuous coefficient space.

• The Proceedings of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.2 no.4
• /
• pp.62-69
• /
• 1988

선형 시스템에 대한 Lyapunov 함수의 구성법은 잘 알려져 있으나, 비선형 시스템의 Lyapunov 함수 구성법은 아직 체계화되어 있지 못하다. 따라서, 본 논문에서는, 비선형 시스템의 안전도 해석을 위하여, 종래의 정상상태 부근에서 Taylor 전개에 의한 선형화 기법에 의존하지 않고, 비선형 시스템을 나타내는 상태공간의 활동성 모델로부터, 비선형성을 나타내는 항을 분리하여, 특수행렬변환시킴으로서, 선형 시스템의 Lyapunov 함수 구성법을 살린, 행렬다항식형 Lyapunov 함수를 구성하고, 이를 유도전동기의 안전도 해석에 적용시켰다. 그 결과, 구해진 안정영역은, 선형화에 의한 것보다는 훨씬 넓은 초공간으로 표현되는 유도전동기의 점근안정영역이 되었다.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.15 no.6
• /
• pp.82-88
• /
• 2001

This paper considers the problem of the identification of the time invariant parameters of distributed systems. In general, the parameters are identified by using the CBPOM(Conventional Block Pulse Operational Matrices), but in this paper, the parameters ard identified by using the EBPOMS(Extended Block Pulse Operational Matrices) which can reduce the burden of operation md the volume of error caused by matrices multiplication. The simulation cloves the effectiveness of the proposed method.

• Journal of KIISE:Information Networking
• /
• v.27 no.4
• /
• pp.531-543
• /
• 2000

본 논문에서는 ATM PNN망에서 경로 배정을 위해 필요로하는 링크상태 정보를 효율적으로 집단화하는 방법을 제시한다. 이 방법은 집단화할 동료 그룹을 효율적으로 집단화하는 방법을 제시한다. 이방법은 집단화할 동료그룹의 경계노드들을 셔플넷의 노드들로 사상시킴으로써 표현해야 할 링크의 수를 완전 그물망 방법의 $N_2$에서 pN(p는 정수 N는 경계노드수)으로 줄인다 이는 공간 복잡도가 O(N)인 신장트리(spanning tree)방법에서 필요로 하는 링크의 수와 비슷하지만 신장 트리방법과는 달리 비대칭망(asymmetric network)에서 사용할 수 있다는 것이 큰 장접이다. 모의 실험결과 셔플넷 방법은 pNro의 링크만을 표현하면서도 상태 정보의 정확성은 완전 그물망 방법에 근접함을 알 수 있었다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.1 no.2 s.2
• /
• pp.105-112
• /
• 1993

The conventional method for solving transportation problems were mainly based on numerical methods, where the understanding of outputs is not easy. Some difficulties come from the seperation of three key steps-the preparation of input for transportation traffic simulation, and model output interpretation. GSIS can help to eliminate some of thoses difficulties by combining graphics, database, and transportation plaining models. As pilot study, this study shows an application of Geovision GSIS to TRANPLAN transportation planning model that is based on four-step travel demand forecasting procedure. Accrued benefits and procedure are presented.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.6A
• /
• pp.1001-1011
• /
• 2006

It is a general agreement that exact statistical solutions can be found by a Monte Carlo technique. Due to difficulties, however, in the numerical generation of random fields, which satisfy not only the probabilistic distribution but the spectral characteristics as well, it is recognized as relatively difficult to find an exact response variability of a structural response. In this study, recognizing that the random field assumes a constant over the domain under consideration when the correlation distance tends to infinity, a semi-theoretical solution of response variability is proposed for general structures. In this procedure, the probability density function is directly used. It is particularly noteworthy that the proposed methodology provides response variability for virtually any type of probability density function, and has capability of considering correlations between multiple random variables.

• Proceedings of the Korean Institute of Industrial Safety Conference
• /
• 2001.11a
• /
• pp.25-30
• /
• 2001

엔진이나 콤프레셔 등과 같은 기기 진동의 동특성은 불규칙적으로 변동하는 성분을 갖는 랜덤 프로세스로 그것을 수학적으로 명확히 기술하는 것은 어렵다/sup 1)/. 하지만 통계학적인 입장에서 시계열 데이터를 보면 시계열 데이터가 확률변수로서 각각의 모집단에 속한다. 따라서 이 점에 주목하여 시계열의 확률적인 특징을 추출하는 것으로, 각각의 시계열 데이터를 확률공간으로 구별하는 것이 가능하다면 시계열 데이터에 의해 표현되어진 상태의 식별가능하다는 이론이 성립된다/sup 2)/.(중략)

• Journal of KIISE:Software and Applications
• /
• v.37 no.5
• /
• pp.363-369
• /
• 2010

Demonstration-based learning has the advantage that a user can easily teach his/her robot new task knowledge just by demonstrating directly how to perform the task. However, many previous demonstration-based learning techniques used a kind of attribute-value vector model to represent their state spaces and policies. Due to the limitation of this model, they suffered from both low efficiency of the learning process and low reusability of the learned policy. In this paper, we present a new demonstration-based learning method, in which the relational model is adopted in place of the attribute-value model. Applying the relational instance-based learning to the training examples extracted from the records of the user demonstrations, the method derives a relational instance-based policy which can be easily utilized for other similar tasks in the same domain. A relational policy maps a context, represented as a pair of (state, goal), to a corresponding action to be executed. In this paper, we give a detail explanation of our demonstration-based relational policy learning method, and then analyze the effectiveness of our learning method through some experiments using a robot simulator.

• The Journal of the Korea Contents Association
• /
• v.7 no.2
• /
• pp.117-124
• /
• 2007

This paper describes methodology that enables animators to create the facial expression animations and to control the facial expressions in real-time by reusing motion capture datas. In order to achieve this, we fix a facial expression state expression method to express facial states based on facial motion data. In addition, by distributing facial expressions into intuitive space using LLE algorithm, it is possible to create the animations or to control the expressions in real-time from facial expression space using user interface. In this paper, approximately 2400 facial expression frames are used to generate facial expression space. In addition, by navigating facial expression space projected on the 2-dimensional plane, it is possible to create the animations or to control the expressions of 3-dimensional avatars in real-time by selecting a series of expressions from facial expression space. In order to distribute approximately 2400 facial expression data into intuitional space, there is need to represents the state of each expressions from facial expression frames. In order to achieve this, the distance matrix that presents the distances between pairs of feature points on the faces, is used. In order to distribute this datas, LLE algorithm is used for visualization in 2-dimensional plane. Animators are told to control facial expressions or to create animations when using the user interface of this system. This paper evaluates the results of the experiment.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.6
• /
• pp.768-773
• /
• 2010

This paper presents the performance verification of the optimal state feedback controller via inverted pendulum systems. The proposed method generates the optimal control inputs satisfying both the constrained input and the performance specification. In addition, it reduces the steady-state error by adopting the integral control technique. In order to verify the performance of the proposed method, we apply both the proposed method and the general state feedback control to an inverted pendulum, CEM-IP-01 in the experiment.