• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.380-382
• /
• 2018

사이버 물리 시스템의 발달은 네트워크 기반 제어 시스템을 다양한 형태로 진화시키고 있다. 네트워크에서는 전송 지연과 전송 오류에 의해서 다양한 불규칙한 지연이 발생하고 지연에 강인한 제어기 설계가 요구되고 있다. 마코프 프로세서를 따르는 지연을 갖는 제어 시스템에서 제어기를 설계할 때에 많이 사용되는 모델중에 하나가 확장된 상태 벡터를 기반으로 한 마코프 점프 선형 시스템 모델이다. 본 연구에서는 이 모델을 이용하여 리아푸노프 안전성 조건으로부터 유도되는 선형 행렬 부등식의 안정성 조건으로부터 저복잡도를 가지고 제어기를 유도하는 직관적 방법을 제안한다. 제안된 알고리즘은 모의 실험을 통해서 성능을 확인하였으나, 직관적 방법 구조상에서 제한 조건의 수가 자유 변수의 수보다 많은 이유 때문에 성능이 배우 제한적임을 확인하였고, 이를 개선하기 위한 향후 연구가 요청됨을 확인하였다.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.4
• /
• pp.29-37
• /
• 2004

This paper provides a reliable H$_{\infty}$ state feedback controller design method for delayed singular systems with actuator failures occurred within the prescribed subset. The sufficient condition for the existence of a reliable H$_{\infty}$ controller and the controller design method are presented by linear matrix inequality(LMI), singular value decomposition, Schur complements, and changes of variables. The proposed controller guarantees not only asymptotic stability but also H$_{\infty}$ norm bound in spite of existence of actuator failures. Since the obtained sufficient condition can be expressed as an LMI fen all variables can be calculated simultaneously. Moreover, the controller design method can be extended to the problem of robust reliable H$_{\infty}$ controller design method for singular systems with parameter uncertainties, time-varying delay, and actuator failures. A numerical example is given to illustrate the validity of the result.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.5A
• /
• pp.861-872
• /
• 2006

The element free Galerkin method is extended by the local partition of unity method to model the cohesive cracks in two dimensional continuum. The shape function of a particle whose domain of influence is completely cut by a crack is enriched by the step enrichment function. If the domain of influence contains a crack tip inside, it is enriched by a branch enrichment function which does not have the LEFM stress singularity. The discrete equations are obtained directly from the standard Galerkin method since the enrichment is only for the displacement field, which satisfies the local partition of unity. Because only particles whose domains of influence are influenced by a crack are enriched, the system matrix is still sparse so that the increase of the computational cost is minimized. The condition for crack growth in dynamic problems is obtained from the material instability; when the acoustic tensor loses the positive definiteness, a cohesive crack is inserted to the point so as to change the continuum to a discontiuum. The crack speed is naturally obtained from the criterion. It is found that this method is more accurate and converges faster than the classical meshless methods which are based on the visibility concept. In this paper, several well-known static and dynamic problems were solved to verify the method.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.3
• /
• pp.191-199
• /
• 2020

Currently, studies on the estimation algorithm based on compressive sensing are actively underway, but to the best of our knowledge, no study on the performance of the Sparse Spectrum Fitting (SpSF) algorithm in nonuniform sensor arrays has been made. This paper deals with the derivation of the compressive sensing based covariance fitting algorithm extended to the frequency domain. In addition, it shows the performance of directon-of-arrival estimation of the frequency domain SpSF algorithm in non-uniform linear sensor array system and the sensor array failure situation.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.4
• /
• pp.1-11
• /
• 2004

Numerical analyses on the aerodynamic characteristics of a counter rotating axial flow fan were conducted for the development of an axial type in-line duct fan. The counter rotating fan has a front rotor and a rear rotor which are counter rotating each other. Blade design of the counter rotating fan was done by extension of design method for axial flow fan which consists of rotor and stator blades. Through flow analysis was performed using matrix method which is applied for flow fields prediction of compressors or turbines. Aerodynamic characteristics and characteristic curves of the counter rotating fan were analyzed by expansion of the frequency domain panel method with duct modeling. Pressure losses were higher at leading edge and hub region of rotor blades. Characteristic curve of the counter rotating fan was overpredicted without consideration of viscous effect.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.5
• /
• pp.411-420
• /
• 2009

This study presents an extended finite difference method based on moving least squares(MLS) method for solving potential problems with interfacial boundary. The approximation constructed from the MLS Taylor polynomial is modified by inserting of wedge functions for the interface modeling. Governing equations are node-wisely discretized without involving element or grid; immersion of interfacial condition into the approximation circumvents numerical difficulties owing to geometrical modeling of interface. Interface modeling introduces no additional unknowns in the system of equations but makes the system overdetermined. So, the numbers of unknowns and equations are equalized by the symmetrization of the stiffness matrix. Increase in computational effort is the trade-off for ease of interface modeling. Numerical results clearly show that the developed numerical scheme sharply describes the wedge behavior as well as jumps and efficiently and accurately solves potential problems with interface.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.109-117
• /
• 2013

Polar codes are the first provable error correcting code achieving the symmetric channel capacity in a wide case of binary input discrete memoryless channel(BI-DMC). However, finite length polar codes have an error floor problem with successive-cancellation list(SCL) decoder. From previous works, we can solve this problem by concatenating CRC(Cyclic Redundancy Check) codes. In this paper we propose to make polar codes having extended-minimum distance from original polar codes without outer codes using correlation with generate matrix of polar codes and that of RM(Reed-Muller) codes. And we compare performance of proposed polar codes with that of polar codes concatenating CRC codes.

• Journal of Astronomy and Space Sciences
• /
• v.20 no.1
• /
• pp.21-28
• /
• 2003

In case that we independently obtain orbital informations about the low earth satellites of foreign countries using radar systems, we develop the orbit determination algorithm for this purpose using a SGP4 model with an analytical orbit model and the extended Kalman filter with a real-time processing method. When the state vector is Keplerian orbital elements, singularity problems happen to compute partial derivative with respect to inclination and eccentricity orbit elements. To cope with this problem, we set state vector osculating to mean equinox and true equator cartesian elements with coordinate transformation. The state transition matrix and the covariance matrix are numerically computed using a SGP4 model. Observational measurements are the type of azimuth, elevation and range, filter process to each measurement in a lump. After analyzing performance of the developed orbit determination algorithm using TOPEX/POSEIDON POE(precision 0.bit Ephemeris), its position error has about 1 km. To be similar to performance of NORAD system that has up to 3km position accuracy during 7 days need to radar system performance that have accuracy within 0.1 degree for azimuth and elevation and 50m for range.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.98-107
• /
• 2007

For high-dimensional pattern recognition, such as face classification, the small number of training samples leads to the Small Sample Size problem when the number of pattern samples is smaller than the number of dimensionality. Recently, various LDA-extensions have been developed, including LDA, PCA+LDA, and Direct-LDA, to address the problem. This paper proposes a method of improving the classification efficiency by increasing the number of (sub)-classes through pre-clustering a training set prior to the execution of Direct-LDA. In LDA (or Direct-LDA), since the number of classes of the training set puts a limit to the dimensionality to be reduced, it is increased to the number of sub-classes that is obtained through clustering so that the classification performance of LDA-extensions can be improved. In other words, the eigen space of the training set consists of the range space and the null space, and the dimensionality of the range space increases as the number of classes increases. Therefore, when constructing the transformation matrix, through minimizing the null space, the loss of discriminatve information resulted from this space can be minimized. Experimental results for the artificial data of X-OR samples as well as the bench mark face databases of AT&T and Yale demonstrate that the classification efficiency of the proposed method could be improved.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.143-154
• /
• 2003

There is a growing trend in developing system for distributed mobile system that supports services - job flow management, video conference, replicated data management and resource allocation. Supporting these services, applications have to use causally ordered message delivery. Previous proposals that provide causally ordered message delivery have problems such as communication overhead, message delaying, scalability, computing overload of mobile host. In this paper, we proposed efficient protocol for causally ordered message delivery using the methods that MSS maintains dependency information matrix between MSS and MH, Piggybacking dependency information about each immediate predecessor message. Proposed algorithm, when compared with previous proposals, provides a low message overhead, and low probability of unnecessary inhibition in delivering messages. Also, it consider resource restriction of MH and low bandwidth of wireless communication by computing most of algorithm at MSS, and reduce processing delay by executing causally ordered message delivery a unit of MH.