• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.322-326
• /
• 2003

In this paper, we establish a new robust $H_{\infty}$ performance condition for uncertain discrete-time systems with convex polytopic uncertainties. We express the condition as a set of linear matrix inequalities (LMIs), which are used to check stability and $H_{\infty}$ disturbance attenuation level by a parameter-dependent Lyapunov matrix. We show that the new condition provides less conservative result than the existing ones which use single Lyapunov matrix. We also show that the robust $H_{\infty}$ state feedback design problem for such uncertain discrete-time systems can be easily dealt with using the approach. The key point in this paper is to propose a kind of decoupling between the Lyapunov matrix and the system matrices in the parameter-dependent matrix inequality by introducing one new matrix variable.

• Structural Engineering and Mechanics
• /
• v.1 no.1
• /
• pp.119-135
• /
• 1993

The paper presents a generalized optimal active control algorithm for earthquake-resistant structures. The study included the weighting matrix configuration, stability, and time-delays for achieving control effectiveness and optimum solution. The sensitivity of various time-delays in the optimal solution is investigated for which the stability regions are determined. A simplified method for reducing the influence of time-delay on dynamic response is proposed. Numerical examples illustrate that the proposed optimal control algorithm is advantageous over others currently in vogue. Its feedback control law is independent of the time increment, and its weighting matrix can be flexibly selected and adjusted at any time during the operation of the control system. The examples also show that the weighting matrix based on pole placement approach is superior to other weighting matrix configurations for its self-adjustable control effectiveness. Using the time-delay correction method can significantly reduce the influence of time-delays on both structural response and required control force.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.7
• /
• pp.577-582
• /
• 2013

In this paper Legendre wavelets are used to approximate the solutions of linear time-invariant system. The Legendre wavelet and its integral operational matrix are presented and an efficient algorithm to solve the Sylvester matrix equation is proposed. The algorithm is based on the decomposition of the Sylvester matrix equation and the preorder traversal algorithm. Using the special structure of the Legendre wavelet's integral operational matrix, the full order Sylvester matrix equation can be solved in terms of the solutions of pure algebraic matrix equations, which reduce the computation time remarkably. Finally a numerical example is illustrated to demonstrate the validity of the proposed algorithm.

• Journal of the Korean Home Economics Association
• /
• v.47 no.8
• /
• pp.13-24
• /
• 2009

This study investigated college students' time management behavior and time satisfaction according to the use of the time-matrix. Data were collected from 400 college students in Seoul by a self-administered questionnaire. Collected data were subjected to descriptive and comparative statistical analyses using the software SPSS(version 12.0). The conclusions of this study were as follows; 1. The use of time-matrix was categorized into 4 task groups: (1) not urgent but important, (2) urgent but notimportant, (3) neither urgent nor important, (4) urgent and important. 2. Time-management-behavior of planning was categorized into 3 components: standard setting, reality overlapping and implementing into 3 components(i.e., checking, adjusting, facilitating condition). 3. In all domains except overlapping, 'not urgent but importance' was the most popular managerial behavior. 4. However, 'neither urgent nor important' was voted the most popular in terms of managerial satisfaction. This study provides useful knowledge on managerial time-use categorization. Furthermore also contributes towards the knowledge base of time-managerial behaviors and dispels stereotypical-thinking that only bing busy all the time using is an indication of good time management behavior. Finally, this study advocates use of the time-matrix to achieve efficient time management.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1991.11a
• /
• pp.40-48
• /
• 1991

McEliece 공개키 암호체계에 대한 새로운 암호해독적 공격이 제시되어진다. 기존의 암호해독 algorithm이 exponential-time의 complexity를 가지는 반면, 본고에서 제시되어지는 algorithm은 polynomial-time의 complexity를 가진다. 모든 linear codes에는 systematic generator matrix가 존재한다는 사실이 본 연구의 동기가 된다. Public generator matrix로부터, 암호해독에 사용되어질 수 있는 새로운 trapdoor generator matrix가 Gauss-Jordan Elimination의 역할을 하는 일련의 transformation matrix multiplication을 통해 도출되어진다. 제시되어지는 algorithm의 계산상의 complexity는 주로 systematic trapdoor generator matrix를 도출하기 위해 사용되는 binary matrix multiplication에 기인한다. Systematic generator matrix로부터 쉽게 도출되어지는 parity-check matrix를 통해서 인위적 오류의 수정을 위한 Decoding이 이루어진다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.6
• /
• pp.647-655
• /
• 1999

For linear time-varying systems described by the triple (A(t),B(t),C(t)) where A(t),B(t),C(t) are the system, the input, and the output matrices, respectively, we propose concepts for measures of modal and gross controllability /observability. We introduce a differential algebraic eigenbvalue theory for linear time-varying systems to calculate the PD-eigenvalues and left and right PD-eigenvectors of the system matrix A(t) which will be used to derive the concepts for the measures. The time-dependent angle between the left PD-eigenvectors of the system matrix A(t) and the columns of the input matrix B(t), and the magnitude of the each element of the input matrix B(t) are used to propose the modal controllability measure. Similarly, the time-dependent angle between the right PD-eigenvectors of the system matrix A(t) and the rows of the output matrix C(t) are used to propose the madal observability measure. Gross measure of controllability of a mode from all inputs and its gross measure of observability in all outputs for the linear time-varying systems are also proposed. Numerical examples are presented to illustrate the proposed concepts.

• Korean Journal of Materials Research
• /
• v.28 no.12
• /
• pp.691-695
• /
• 2018

In this study, we investigate the recycling of aluminum-based metal matrix composites(AMCs) embedded with SiC particulates. The microstructure of the AMCs is characterized by X-ray diffraction and scanning electron microscopy. The possibility of recycling the composite scrap is attempted from the melted alloy and SiC particulates by re-melting, holding and solidification in crucibles. The recovery percentage of the matrix alloy is calculated after a number of holding times, 0, 5, 10, 15, 20, 25 and 30 minutes and for different particulate sizes and weight fractions in the Al matrix. The results show that the recovery percentage of the matrix alloy, as well as the time required for maximum recovery of the matrix, is dependent on the size and weight fraction of SiC particulates. In addition, the percentage recovery increases with particulate size but drops with the particulate fraction in the matrix. The time to reach maximum recovery falls rapidly with an increase in particulate size and fraction.

• Journal of Mechanical Science and Technology
• /
• v.15 no.8
• /
• pp.1090-1096
• /
• 2001

In this paper, new methods for efficiently solving linear acceleration equations of multibody dynamic simulation exploiting sparsity for real-time simulation are presented. The coefficient matrix of the equations tends to have a large number of zero entries according to the relative joint coordinate numbering. By adequate joint coordinate numbering, the matrix has minimum off-diagonal terms and a block pattern of non-zero entries and can be solved efficiently. The proposed methods, using sparse Cholesky method and recursive block mass matrix method, take advantages of both the special structure and the sparsity of the coefficient matrix to reduce computation time. The first method solves the η$\times$η sparse coefficient matrix for the accelerations, where η denotes the number of relative coordinates. In the second method, for vehicle dynamic simulation, simple manipulations bring the original problem of dimension η$\times$η to an equivalent problem of dimension 6$\times$6 to be solved for the accelerations of a vehicle chassis. For vehicle dynamic simulation, the proposed solution methods are proved to be more efficient than the classical approaches using reduced Lagrangian multiplier method. With the methods computation time for real-time vehicle dynamic simulation can be reduced up to 14 per cent compared to the classical approach.

• Journal of the Korea Society for Simulation
• /
• v.11 no.4
• /
• pp.57-68
• /
• 2002

The analysis of the cyclic scheduling problem in FMS using the transitive matrix has been proposed. Since the transitive matrix may explain all the relations between the places and transitions, we propose an algorithm to get good solution after slicing off some subnets from the original net based on machines operations. For analyzing the schedule problem, we considered two time functions such as produce time and waiting time using the P-invariant. In addition, we are shown the effectiveness of proposed algorithm after comparing with unfolding algorithms.

• Proceedings of the IEEK Conference
• /
• 2001.06e
• /
• pp.29-32
• /
• 2001

This paper presents matrix inequality conditions for H$_2$optimal control of linear time-invariant descriptor systems in continuous and discrete time cases, respectively. First, the necessary and sufficient condition for H$_2$control and H$_2$controller design method are expressed in terms of LMls(linear matrix inequalities) with no equality constraints in continuous time case. Next, the sufficient condition for H$_2$control and H$_2$controller design method are proposed by matrix inequality approach in discrete time case. A numerical example is given in each case.