• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.3
• /
• pp.301-307
• /
• 1998

이 논문에서는 다항식 서로소 인수로 표시되는 위너-호프 제어기의 계산상의 어려움을 극복하기 위하여 상태공간 변수 공식이 개발되었다. 위너-호프 인수 행렬을 이용하여 주어진 다항식 서로소 인수로부터 안정 유리행렬의 서로소 인수를 구하였으며 이 결과를 이용하여 위너-호프 제어기의 공식을 유리행렬의 서로소 인수로 표현한 후 이를 이용하여 상태공간 계수를 구하였다.

• Journal of KIISE:Software and Applications
• /
• v.34 no.4
• /
• pp.368-376
• /
• 2007

How to represent the search space is as important as which search algorithm to use for finding natural-looking paths for moving NPC (non-player character) in computer games. Recently, various state space representation methods which have been developed for computer games are being used while A* algorithm dominates as the preferred search algorithm. These representation methods show some drawbacks such as the size of state space is too large, there is no guarantee for optimality, the path found is not natural-looking, and the generation of nodes and links is not automatic by depending on a level designer. In this paper the requirements for natural-looking paths are introduced and to find paths satisfying these requirements, the use of the generalized visibility graphs which is the extended version of the visibility graph in Robotics is proposed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1463-1480
• /
• 2014

It is well known that sparse code is effective for feature extraction of face recognition, especially sparse mode can be learned in the kernel space, and obtain better performance. Some recent algorithms made use of single kernel in the sparse mode, but this didn't make full use of the kernel information. The key issue is how to select the suitable kernel weights, and combine the selected kernels. In this paper, we propose a novel multiple kernel sparse representation based classification for face recognition (MKSRC), which performs sparse code and dictionary learning in the multiple kernel space. Initially, several possible kernels are combined and the sparse coefficient is computed, then the kernel weights can be obtained by the sparse coefficient. Finally convergence makes the kernel weights optimal. The experiments results show that our algorithm outperforms other state-of-the-art algorithms and demonstrate the promising performance of the proposed algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2709-2729
• /
• 2016

Representation based classification, kernel method and sparse representation have received much attention in the field of face recognition. In this paper, we proposed an improved kernel principal component analysis method based on sparse representation to improve the accuracy and robustness for face recognition. First, the distances between the test sample and all training samples in kernel space are estimated based on collaborative representation. Second, S training samples with the smallest distances are selected, and Kernel Principal Component Analysis (KPCA) is used to extract the features that are exploited for classification. The proposed method implements the sparse representation under ℓ₂ regularization and performs feature extraction twice to improve the robustness. Also, we investigate the relationship between the accuracy and the sparseness coefficient, the relationship between the accuracy and the dimensionality respectively. The comparative experiments are conducted on the ORL, the GT and the UMIST face database. The experimental results show that the proposed method is more effective and robust than several state-of-the-art methods including Sparse Representation based Classification (SRC), Collaborative Representation based Classification (CRC), KCRC and Two Phase Test samples Sparse Representation (TPTSR).

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.2
• /
• pp.1-7
• /
• 2019

This paper presents CTP (Compact Translation Page), a compact representation of translation pages, for page mapping-based flash translation layers to improve RAM utilization and reduce the response time of solid state drives. CTP can store translation information twice in a translation page and the total number of translation pages stored in flash is reduced to half. Therefore, CTP halves the RAM size of the directory of translation pages and uses the saved RAM space for translation cache. CTP shows the best response time when compared to existing page mapping-based flash translation layers.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.17 no.1
• /
• pp.9-16
• /
• 2009

The analysis of an aircraft flight dynamics is recently very convenient because of the introduction of state-space method and a well-developed package software. The representation of a dynamic system is described as a simple form of matrix calculation and the unique form of model is available for the linear or nonlinear, time variant or time invariant, mono variable or multi variable system with state-space method. And this analysis can be simplified with the specific functions of a package software and it is very simplified to execute the simulation of the dynamic characteristics for an aircraft model with an interactive graphical treatment. The purpose of this study is to develope an educational flight simulator for the students who need to analyze the dynamic characteristics of an aircraft that is primarily to execute the simulation for the analysis of the transient response and frequency response of an aircraft stability. Furthermore the dynamic characteristics of an aircraft motion is set up as dynamical animation tool for the control response on 3-axis motions of an aircraft.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.3
• /
• pp.813-829
• /
• 2022

In multi-view subspace clustering, how to integrate the complementary information between perspectives to construct a unified representation is a critical problem. In the existing works, the unified representation is usually constructed in the original data space. However, when the data representation in each view is very diverse, the unified representation derived directly in the original data domain may lead to a huge information loss. To address this issue, different to the existing works, inspired by the latest revelation that the data across all perspectives have a very similar or close spectral block structure, we try to construct the unified representation in the spectral embedding domain. In this way, the complementary information across all perspectives can be fused into a unified representation with little information loss, since the spectral block structure from all views shares high consistency. In addition, to capture the global structure of data on each view with high accuracy and robustness both, we propose a novel low-rank approximation via the tight lower bound on the rank function. Finally, experimental results prove that, the proposed method has the effectiveness and robustness at the same time, compared with the state-of-art approaches.

• Journal of Positioning, Navigation, and Timing
• /
• v.11 no.4
• /
• pp.263-268
• /
• 2022

Precise Point Positioning-Real Time Kinematic (PPP-RTK) is a high accuracy positioning method that combines RTK and PPP to overcome the limitations on service coverage of RTK and convergence time of PPP. PPP-RTK provides correction data in the form of State Space Representation (SSR), unlike RTK, which provides measurement-based Observation Space Representation (OSR). Due to this, PPP-RTK has an advantage that it can transmit less data than RTK. So, recently, several techniques for PPP-RTK have been proposed. However, in order to utilize PPP-RTK techniques, performance analysis of these in a real environment is essential. In this paper, we implement the local network PPP-RTK and analyze the positioning performance according to the distance within 100 km from the reference station in Korea. As results of experiment, the horizontal and vertical 95% errors of local network PPP-RTK were 6.25 cm and 5.86 cm or less, respectively.

• 전기의세계
• /
• v.21 no.6
• /
• pp.9-16
• /
• 1972

This work intends to study the machine dynamics in the state-space approah and to formulate the operating characteristics of a namplidyne generator, with balanced control field winding and an auxiliary feedback winding for compensating purpose. In the derivation of the dynamic equation, investigations on the demagnetization effects are accentuated, based on the magnetic interlinks between windings of the machine. From the machine dynamic relation obtained, a state-variable representation of the machine dynamics is approached in the first part of this work.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1996.10a
• /
• pp.255-259
• /
• 1996

This paper presents active vibration control of a rotating cantilevered beam using piezoceramic actuators. A governing equation of motion is obtained by the Hamilton's principle and expressed in the state space representation. Subsequently, an H$_{\infty}$ control which is robust to system uncertainties is synthesized through the loop shaping design procedure. Computer simulations for the steady-state vibration control are undertaken in order to demonstrate the effectiveness and robustness of the proposed control methodology..y.