• 한국군사과학기술학회지
• /
• 제2권2호
• /
• pp.131-139
• /
• 1999

An easy and efficient method is proposed for a computation of reliability of preprocessing filters in the fire control system when the sensor data are frequently unreliable depending on the operation environment. It computes state transition probability matrix after modeling filter states as a Markov process, and computing false alarm and detection probability of each filter state under the given sensor failure probability. It shows that two important indices such as distributed state probability and error variance can be derived easily for a reliability assessment of the given sensor fusion system.

• Communications for Statistical Applications and Methods
• /
• 제29권6호
• /
• pp.721-733
• /
• 2022

In this paper we compare parameter estimation by Grassmann manifold optimization and sequential candidate set algorithm in a structured principal fitted component (PFC) model. The structured PFC model extends the form of the covariance matrix of a random error to relieve the limits that occur due to too simple form of the matrix. However, unlike other PFC models, structured PFC model does not have a closed form for parameter estimation in dimension reduction which signals the need of numerical computation. The numerical computation can be done through Grassmann manifold optimization and sequential candidate set algorithm. We conducted numerical studies to compare the two methods by computing the results of sequential dimension testing and trace correlation values where we can compare the performance in determining dimension and estimating the basis. We could conclude that Grassmann manifold optimization outperforms sequential candidate set algorithm in dimension determination, while sequential candidate set algorithm is better in basis estimation when conducting dimension reduction. We also applied the methods in real data which derived the same result.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1991년도 춘계학술대회
• /
• pp.5-7
• /
• 1991

We have developed an efficient and robust image reconstruction algorithm for static impedance imaging. This improved Newton-Raphson method produced more accurate images by reducing the undesirable effects of the ill-conditioned Hessian matrix. We found that our electrical impedance tomography (EIT) system could produce two-dimensional static images from a physical phantom with 7% spatial resolution at the center and 5% at the periphery. Static EIT image reconstruction requires a large amount of computation. In order to overcome the limitations on reducing the computation time by algorithmic approaches, we implemented the improved Newton-Raphson algorithm on a parallel computer system and showed that the parallel computation could reduce the computation time from hours to minutes.

• 대한수학회보
• /
• 제41권1호
• /
• pp.125-135
• /
• 2004

One of the intriguing and fundamental algorithmic graph problems is the computation of the strongly connected components of a directed graph G. In this paper we first introduce a simple procedure for determining the location of the nonzero elements occurring in $B^{-1}$ without fully inverting B, where EB\;{\equiv}\;(b_{ij)\;and\;B^T$ are diagonally dominant matrices with $b_{ii}\;>\;0$ for all i and $b_{ij}\;{\leq}\;0$, for $i\;{\neq}\;j$, and then, as an application, show that all of the strongly connected components of a directed graph G can be recognized by the location of the nonzero elements occurring in the matrix $C(G)\;=\;(D\;-\;A(G))^{-1}$. Here A(G) is an adjacency matrix of G and D is an arbitrary scalar matrix such that (D - A(G)) becomes a diagonally dominant matrix.

• 한국데이타베이스학회:학술대회논문집
• /
• 한국데이타베이스학회 1999년도 춘계공동학술대회: 지식경영과 지식공학
• /
• pp.353-359
• /
• 1999

We present a matrix-based inference algorithm suitable for electronic commerce applications. For this purpose, an Extended AND-OR Graph (EAOG) was developed with the intention that fast inference process is enabled within the electronic commerce situations. The proposed EAOG inference mechanism has the following three characteristics. 1. Real-time inference: The EAOG inference mechanism is suitable for the real-time inference because its computational mechanism is based on matrix computation. 2. Matrix operation: All the subjective knowledge is delineated in a matrix form. so that inference process can proceed based on the matrix operation which is computationally efficient. 3. Bi-directional inference: Traditional inference method of expert systems is based on either forward chaining or backward chaining which is mutually exclusive in terms of logical process and computational efficiency. However, the proposed EAOG inference mechanism is generically bi-directional without loss of both speed and efficiency. We have proved the validity of our approach with several propositions and an illustrative EC example.

• 한국공간구조학회논문집
• /
• 제2권1호
• /
• pp.75-84
• /
• 2002

In this study, the 'force density method' for shape finding of cable net structures is presented. This concept is based on the force-length ratios or force densities which are defined for each branch of the net structures. This method renders a simple linear 'analytical form finding' possible. If the free choice of the force densities is restricted by further condition, the linear method is extended to a nonlinear one. The nonlinear one can be applied to the detailed computation of networks. In this paper, the general inverse matrix is introduced to solve the nonlinear equilibrium equation including Jacobian matrix which is rectangular matrix. Several examples for linear and nonlinear analysis applied additional constraints are presented. It is shown that the force density method is suitable for form finding of cable net and the general inverse matrix can be applied to solve the nonlinear equation without Lagrangian factors.

• 한국통신학회논문지
• /
• 제17권7호
• /
• pp.739-748
• /
• 1992

스트라이프 구조를 이용하여 대형 스파스 선형 방정식을 해석하는 CGM 반복 씨스톨릭 알고리즘을 제시하고, 이를 씨스톨릭 어레이로 구현했다. 메트릭스 A를 상삼각 행렬과 대각선행렬, 하삼각 행렬로 나누어서 이들이 별개의 선형 어레이에 의해서 병행적으로 실행되도록 했다. 따라서 1개의 선형 어레이를 사용했을 때보다도 실행시간이 대략 1/2로 단축되며, 스트라이프 구조를 이용하므로서 불규칙하게 분포된 스파스메트릭스의 연산을 효율적으로 할 수 있다.

• 대한전자공학회논문지
• /
• 제16권5호
• /
• pp.18-26
• /
• 1979

본 논문에서는 algebraic matrix Lyapunov equations과 a1gebraic matrix Riccati equations에 관하여 잘 알려져 있는 중요한 결과를 확장한다. 본 연구는 Matrix 미분 방정식에서 양단 경계조건이 존재하는 문제를 다루며 여기에서 얻어지는 결과는 기존하고 있는 결과를 포함하게 된다. 특히 선형 시스템이 periodic feedback gain control로 안정화되는 필요충분조건을 구하며, two-point boundary Riccati equations의 해를 쉽게 구하는 반복 계산방법을 제시한다. 또한 interalwise reeceding horizon을 이용한 새로운 periodic feedback gain control이 시스템을 안전화시켜줌을 보여준다.

• 충청수학회지
• /
• 제23권4호
• /
• pp.663-677
• /
• 2010

We investigate efficient method for the computation of resultant and discriminant of polynomials. The aim of this paper is to provide not only those values but also visual structure from elementary matrix calculation.

• 한국정보처리학회논문지
• /
• 제2권3호
• /
• pp.390-396
• /
• 1995

컴퓨터 그래픽스의 응용 분야 특히, CAD나 애니메이션 분야에서는 하나의 물체를 다른 시점에서 또는 시점은 고정하고 다른 각도로 바라본 형태를 디스플레이 할 수 있어야 한다. 그러기 위해서는 어떤 물체를 임의의 축에 관하여 임의의 각도 만큼 회 전 이동시키는 회전 이동 변환이 필요하다. 3차원 그래픽스 응용에서는 많은 변환이 필요하며, 하나의 물체는 보통 많은 꼭지점들로 구성되어서 가능한한 빠른 속도로 회 전 이동 좌표를 구하는 것이 중요한 문제이다. 본 논문에서는 3차원 그래픽스에서 필 요한 변환중 많은 연산 횟수로 인하여 계산 시간이 문제가 되는 임의의 축에 관한 회 전 이동 변환 행렬을 빠르게 계산하는 효율적인 알고리즘을 제안하고, 이를 PC- 486DX2-50상에서 구현하여 기존의 계산 방법과 결과의 계산속도를 비교함으로써 알고 리즘의 유용성을 보인다.