• Journal of Astronomy and Space Sciences
• /
• v.25 no.3
• /
• pp.255-266
• /
• 2008

The current paper presents application of a new analytic solution in general relative motion to spacecraft formation flying in an elliptic orbit. The calculus of variations is used to analytically find optimal trajectories and controls for the given problem. The inverse of the fundamental matrix associated with the dynamic equations is not required for the solution in the current study. It is verified that the optimal thrust vector is a function of the fundamental matrix of the given state equations. The cost function and the state vector during the reconfiguration can be analytically obtained as well. The results predict the form of optimal solutions in advance without having to solve the problem. Numerical simulation shows the brevity and the accuracy of the general analytic solutions developed in the current paper.

• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.219-224
• /
• 2017

This paper is to introduce an application of face recognition algorithm in parallel. We have experiments of 25 images with different motions and simulated the image recognitions; grouping of the image vectors, image normalization, calculating average image vectors, etc. We also discuss an analysis of the related eigen-image vectors and a parallel algorithm. To develop the parallel algorithm, we propose a new type of initial matrices for eigenvalue problem. If A is a symmetric matrix, initial matrices for eigen value problem are investigated: the "optimal" one, which minimize ${\parallel}C-A{\parallel}_F$ and the "super optimal", which minimize ${\parallel}I-C^{-1}A{\parallel}_F$. In this paper, we present a general new approach to the design of an initial matrices to solving eigenvalue problem based on the new optimal investigating C with preserving the characteristic of the given matrix A. Fast all resulting can be inverted via fast transform algorithms with O(N log N) operations.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.6
• /
• pp.347-353
• /
• 2003

In models of imperfect competition of deregulated electricity markets, the key task is to find the Nash equilibrium(NE). The approaches for finding the NE have had two major bottlenecks: computation of mixed strategy equilibrium and treatment of multi-player games. This paper proposes a payoff matrix approach that resolves these bottlenecks. The proposed method can efficiently find a mixed strategy equilibrium in a multi-player game. The formulation of the m condition for a three-player game is introduced and a basic computation scheme of solving nonlinear equalities and checking inequalities is proposed. In order to relieve the inevitable burden of searching the subspace of payoffs, several techniques are adopted in this paper. Two example application problems arising from electricity markets and involving a Cournot and a Bertrand model, respectively, are investigated for verifying the proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.461-466
• /
• 1989

This paper describes some properties of a discrete algebraic Riccati equation and its application to $H^{\infty}$ control design. The conditions, under which an input weighting matrix can be found for a negative output weighting matrix in order that a solution P for a discrete algebraic equation may exist, are suggested in case of a stable A. This result is applied to a $H^{\infty}$ controller design for the special case of nonsingular B. It is based on a state feedback control law whose objective is to reduce the effect of input disterbances below a prespecified level. This law requires the solution of a modified algebraic Riccati equation, which provides an method for the $H^{\infty}$ optimization control problem approximately.ly.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.9 no.2
• /
• pp.75-79
• /
• 2009

A system-on-a-chip communication architecture has a significant impact on the performance and power consumption of modern multi-processors system-on-chips (MPSoCs). However, customization of such architecture for a specific application requires the exploration of a large design space. Thus, system designers need tools to rapidly explore and evaluate communication architectures. In this paper we present the method for application-specific low-power bus architecture synthesis at system-level. Our paper has two contributions. First, we build a bus power model of AMBA AXI bus communication architecture. Second, we incorporate this power model into a low-power architecture exploration algorithm that enables system designers to rapidly explore the target bus architecture. The proposed exploration algorithm reduces power consumption by 20.1% compared to a maximally connected reduced matrix, and the area is also reduced by 20.2% compared to the maximally connected reduced matrix.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.6
• /
• pp.228-234
• /
• 2002

This paper proposes a real-time application of rationalized Haar transform which is based on the local rationalized Haar transform, local operational matrix and local delay operational matrix. This approach let a general sampling time be used by introducing a scaling factor. In the existing method of orthogonal functions, a major disadvantage is that process signals need to be recorded prior to obtaining their expansions. This paper proposes a novel method of rationalized Haar transform to overcome this shortcoming. And the proposed method is suitable for the analysis of linear systems. The proposed method is expected to the applicable to the adaptive control which demanded to the real-time applications.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.20 no.6
• /
• pp.553-563
• /
• 2008

If an arbitrary topography is approximated to a number of vertical steps, both variational approximation and eigenfunction expansion method can be used to compute linear wave transformation over the bottom. In this study a scatterer method associated with variational approximation is proposed to calculate reflection and transmission coefficients. Present method may be shown to be more simple and direct than the successive-application-matrix method by O'Hare and Davies. And Several numerical examples are given which are in good agreement with existing results.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.6
• /
• pp.187-195
• /
• 2009

Recently, with the development of ubiquitous computing, the study and development about context awareness models is required for the application of ubiquitous environment. This paper presents the design and implementation of a matrix based context awareness model for vehicle environment. The matrix construction method using 5W1H and CAM (Context Awareness Model) expression is proposed for context awareness modeling. The system with the proposed model is implemented by Zigbee modules for the recognition of individual identification and position and a navigator for current spatial and temporal information of GPS. The result of experiments shows that the proposed model is available.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.9
• /
• pp.1081-1087
• /
• 1999

Load Flow calulation methods can usually be divided into Gauss-Seidel method, Newton-Raphson method and decoupled method. Load flow calculation is a basic on-line or off-line process for power system planning. operation, control and state analysis. These days Newton-Raphson method is mainly used since it shows remarkable convergence characteristics. It, however, needs considerable calculation time in construction and calculation of inverse Jacobian matrix. In addition to that, Newton-Raphson method tends to fail to converge when system loading is heavy and system has a large R/X ratio. In this paper, matrix equation is used to make algebraic expression and then to slove load flow equation and to modify above defects. And it preserve P-Q bus part of Jacobian matrix to shorten computing time. Application of mentioned algorithm to 14 bus, 39 bus, 118 bus systems led to identical results and the same numbers of iteration obtained by Newton-Raphson method. The effect of computing time reduction showed about 28% , 30% , at each case of 39 bus, 118 bus system.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.8 no.4
• /
• pp.33-39
• /
• 1988

The objective of this paper is to adjust precise traverse nets by matrix analysis. As the result of this paper, In positioning by Traverse nets adjustment, the application of matrix analysis improved the accuracy. And also, the difference between adjustment values of rigorous-method and those of approximate-method appears to be within the mean square errors(0.4 mm~0.9 mm), therefore, the efficiency of approximate-method was proved.