• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.505-511
• /
• 2007

In this paper, we examine the Markov chain $\{X_k,\;N_k;\;k=0,\;1,...$. We show that the marginal steady state distribution of Xk is discrete phase type. The implication of this result is that the queue length distribution of phase type for large number of examples where this Markov chain is applicable and shows a queueing application by matrix geometric methods.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.22 no.2
• /
• pp.20-34
• /
• 2004

최근 외신을 통해서 보도된 원숭이를 이용한 BCI (Brain-Computer Interface) 실험에 관한 보도 (Carmena et al., 2003)나 배우 Keanu Reeves가 세 편에 걸쳐서 열연한 영화 Matrix를 통해서나 뇌-컴퓨터 접속이라는 주제가 대중적으로 많은 인기를 끌고 있다. 배우 KeanuReeves는 1995년에도 Fox 영화사에서 제작된 Jonny Mnemonic Superbit Collection(국내 소개명 코드명J)라는 영화에서 뇌-컴퓨터접속기술을 소개한 바 있는데 그리 큰 인길르 끌지는 못하였다가 최근 몇 년간에 걸친 Matrix 쓰리즈에서 뇌-컴퓨터 접속기술을 범대중적으로 소개하는데 성공하였다.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.5 no.2
• /
• pp.85-89
• /
• 1987

The large sparse matrix problems arise in many applications areas, such as structural analysis, network analysis. In dealing with such sparse systems proper preprogramming techniques such as permuting rows and columns simultaneously, will be needed in order to reduce the number of arithmetic operations and storage spaces.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.3
• /
• pp.633-644
• /
• 2004

Exponentially Weighted Moving Average(EWMA) control chart for variance-covariance matrix of several quality characteristics based on accumulate-combine approach has proposed. Numerical computations show that multivariate EWMA chart based on accumulate-combine approach is more efficient than corresponding multivariate EWMA chart based on combine-accumulate approach.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.288-294
• /
• 2008

Motivated by the fact that upper solution bounds for the continuous Lyapunov equation are valid under some very restrictive conditions, an attempt is made to extend the set of Hurwitz matrices for which such bounds are applicable. It is shown that the matrix set for which solution bounds are available is only a subset of another stable matrices set. This helps to loosen the validity restriction. The new bounds are illustrated by examples.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.341-344
• /
• 2001

We propose a novel method to simplify the computational load of ILSP algorithm for CDMA environment. Since this method processes the block matrix by a vector sequentially, the complex matrix computation ran be avoided. The performance of the algorithm is verified by computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.5 no.1
• /
• pp.60-69
• /
• 1980

The computerized analysis of complicated circuits requires large memory capacity and considerable length of time. In order to enhance the efficiency of memory capacity and the executing time, Sparse Matrix is applied to the solution of simultaneous equations required for the analysis of amplification circuit. The optimization Subroutine, FMFP is utilized for the decision of optimum element parameters of an equalizer amplifier.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.3
• /
• pp.349-354
• /
• 2007

This paper considers the problem of designing static output feedback controllers for nonlinear systems represented by Takagi-Sugeno (T-S) fuzzy models. Based on linear matrix inequality technique, a new method is developed for designing fuzzy stabilizing controllers via static output feedback. Furthermore, the result is also extended to $H_{\infty}$ control. Examples are given to illustrate the effectiveness of the proposed methods.

• Information and Communications Magazine
• /
• v.7 no.3
• /
• pp.27-34
• /
• 1990

The $(L,\psi)$ feature description on the binary boundary air craft image is introduced of classifying 3-D object (aircraft) identification. Three types for associative matrix memories are employed and tested for their classification performance. The fast association involved in these memories can be implemented using a parallel optical matrix-vector operation. Two associative memories are based on pseudoinverse solutions and the third one is interoduced as a paralell version of a nearest-neighbor classifier. Detailed simulation results for each associative processor are provided.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.6
• /
• pp.1251-1256
• /
• 2011

Consider a p-variate ($p{\geq}4$) normal distribution with mean ${\theta}$ and identity covariance matrix. Using a simple property of noncentral chi square distribution, the generalized Bayes estimators dominating the Lindley estimator under quadratic loss are given based on the methods of Brown, Brewster and Zidek for estimating a normal variance. This result can be extended the cases where covariance matrix is completely unknown or ${\Sigma}={\sigma}^2I$ for an unknown scalar ${\sigma}^2$.