• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.4
• /
• pp.389-405
• /
• 1999

본 논문에서는 상호 연결망의 노드를 행렬로 표현하고 행렬연산을 이용하여 에지를 정의한 새로운 상호 연결망으로 행렬-스타 그래프를 제안한다. 행렬-스타 그래프는 널리 알려진 스타 그래프를 일반화한 그래프이다. 먼저, 행렬-스타 그래프의 노드를 2 $\times$ n 행렬로 표현한 행렬-스타 그래프 MS2,n 에 대하여 주요 망 척도인 분지수, 연결도, 확장성, 대칭성, 리우팅 ,지름 방송등을 분석한다. 다음으로, 행렬-스타 그래프 MS2,n의 노드를 2차원과 3차원으로 일반화한 행렬-스타 그래크 MSk,n과 MS k,n,p를 정의하고 행렬-스타그래프 MSk,n,p 의 라우팅 알고리즘과 지름을 분석한다. 상호연결망의 중요 망 척도중 하나는 망 비용이고 상호연결망의 망 비용은 그 연결망의 분지수와 지름의 곱으로 정의된다. star 그래프는 다른 상호 연결망보다 작은 망 비용을 갖는다. 최근에 제안된 Macro-Star 그래픈 star 그래프에 비해 상대적으로 망 비용이 작은 값을 갖는 연결망이다. (n2)!개의 노드를 갖는 행렬-스타 그래프 MSk,k,k(k={{{{ `^{ 3} SQRT { n$^2$} }}}} )와 ((n-1)2 + 1)!개의 노드를 갖는 Macro-Star 그래프 MS(n-1, n-1)의 망 비용은 행렬-스타그래프 MSk,k,k(k={{{{ `^{ 3} SQRT { n$^2$} }}}})는 O(n2,7)이고, Macro-Star 그래프 MS(n-1 , n-1)은 O(n3) 이다. 이는 행렬-스타 그래프가 스타 그래프와 Macro-Star 그래프보다 망비용이 우수함을 의미한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6C
• /
• pp.523-529
• /
• 2010

We propose a very low complexity lattice reduction (LR) algorithm for MIMO detection in time varying channels. The proposed scheme reduces the complexity by performing LR in a block-wise manner. The proposed scheme takes advantage of the temporal correlation of the channel matrices in a block and its impact on the unimodular matrices during LR process. From this, the proposed scheme can skip a number of redundant LR processes for consecutive channel matrices and performs a single LR in a block. The simulation results investigated in this letter reveal that the proposed detection scheme requires only 43.4% multiplications and 17.3% divisions of LLL-LR and only 50.2% multiplications and 68.2% divisions of the conventional adaptive LR with almost no performance degradation.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.141-149
• /
• 2006

In this paper, we introduce an improved algorithm for computing matrix triple product that commonly arises in primal-dual optimization method. In computing $P=AHA^{t}$, we devise a single pass algorithm that exploits the block diagonal structure of the matrix H. This one-phase scheme requires fewer floating point operations and roughly half the memory of the generic two-phase algorithm, where the product is computed in two steps, computing first $Q=HA^{t}$ and then P=AQ. The one-phase scheme achieved speed-up of 2.04 on Intel Itanium II platform over the two-phase scheme. Based on memory latency and modeled cache miss rates, the performance improvement was evaluated through performance modeling. Our research has impact on performance tuning study of complex sparse matrix operations, while most of the previous work focused on performance tuning of basic operations.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.2
• /
• pp.409-422
• /
• 2013

For stability design and P-${\Delta}$ analysis of steel frames with semi-rigid connections, the explicit form of the exact tangential stiffness matrix of a generalized semi-rigid frame element having rotational and translational connections is firstly derived using the stability functions. And its elastic and geometric stiffness matrix is consistently obtained by Taylor series expansion. Next depending on connection types of semi-rigidity, the corresponding tangential stiffness matrices are degenerated based on penalty method and static condensation technique. And then numerical procedures for determination of effective buckling lengths of generalized semi-rigid frames members and P-${\Delta}$ and shortly addressed. Finally three numerical examples are presented to demonstrate the validity and accuracy of the proposed method. Particularly the minimum braced frames and coupled buckling modes of the corresponding frames are investigated.

• The Korean Journal of Applied Statistics
• /
• v.26 no.6
• /
• pp.999-1007
• /
• 2013

This research shows several types of moving pictures from the data: 1) the word cloud of Korean texts, 2) the heat map of n ${\times}$ p matrices, 3) the moving image of p ${\times}$ p scatterplot matrix, 4) the local projective display of k clusters (Huh and Lee, 2012). Moving pictures may reveal the hidden information and beauty of the datasets and ignite the curiosity of information consumers. Video files are attached.

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1173-1183
• /
• 2006

Matrix-star, Pancake, and RFM graphs have such a good property of Star graph and a lower network cost than Hypercube. Matrix-star graph has Star graph as a basic module and the node symmetry, the maximum fault tolerance, and the hierarchical decomposition property. Also it is an interconnection network that improves the network cost against Star graph. In this paper, we propose a method to embed among Matrix-star Pancake, and RFM graphs using the edge definition of graphs. We prove that Matrix-star $MS_{2,n}$ can be embedded into Pancake $P_{2n}$ with dilation 4, expansion 1, and $RFM_{n}$ graphs can be embedded into Pancake $P_{n}$ with dilation 2. Also, we show that Matrix-star $MS_{2,n}$ can be embedded into the $RFM_{2n}$ with average dilation 3.

• Computational Structural Engineering
• /
• v.9 no.1
• /
• pp.33-45
• /
• 1996

A general stiffener element which includes transverse shear deformation is formulated using the p-version finite element method. Hierarchic C/sup o/-shape functions, derived from Integrals of Legendre polynomials, are used to define the assembled stiffness matrix of the stiffener with respect to the local reference frame is transformed to the plate reference system by applying the appropriate transformation matrices in order to insure compatibility of displacements at the junction of the stiffener and plate. The transformation matrices which account for the orientation and the eccentricity effects of the stiffener with respect to the plate reference axes are used to find local behavior at the junction of the stiffener and the relative contributions of the plate and stiffener to the strength of the composite system. The results obtained by the p-version finite element method are comared with the results in literatures, especially those by the h-version finite element analysis program, MICROFEAP-II.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.32 no.1
• /
• pp.45-54
• /
• 2019

The damage detection method using the extended Kalman filter(EKF) technique has been continuously used since EKF can estimation the responses of the damaged building structure and the stiffness of the structure. However, in the use of EKF, the requirement of setting the initial paramters P, Q, and R has caused the divergence and instability of the state vector, and various researches have been conducted to determine theses parameters. In this paper, adaptive extended Kalman filter(AEKF) method is proposed to solve the problem of setting the values of P, Q, and R, which are important parameters determining the convergence performance of the EKF state vector. By using the AEKF method proposed in this study, the P, Q, and R parameters are updated every k steps. The proposed algorithm is applied for the estimation of stiffness and the damage detection of 3-DOF problem. Based of the verification, it can be found that the selection process for the values of P, Q, and R can improve the convergence performance of EKF.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.1_2
• /
• pp.64-72
• /
• 2001

이 논문은 행렬 탐색 방법을 이용하여 평면상의 η개의 점에 대한 모든 L$_{p}$, 1$\leq$P$\leq$$\infty$ 거리의 양방향 각도제한 근접 점 문제를 0(nlogn) 시간에 계산하는 알고리즘을 고안한다. 이 방법은 최적의 시간 복잡도를 가지며 궤적추적 법을 쓰지 않기 때문에 수치오차가 적으며 구현이 용이하고 실용적이다.

• The Korean Journal of Applied Statistics
• /
• v.4 no.1
• /
• pp.1-11
• /
• 1991

It is of great interest to consider the homogeniety of covariance matrices in MANOVA of discriminant analysis. If we lock at the problem of testing hypothesis, H : $\Sigma_1 = \Sigma_2$ from an invariance point of view where $\Sigma_i$ are the covariance matrix of two independent p-variate distribution, the testing problem is invariant under the group of nonsingular transformations and the hypothesis becomes H : $\delta_1 = \delta_2 = \cdots = \delta_p = 1$ where $\delta = (\delta_1, \delta_2, \cdots, \delta_p)$ is a vector of latent roots of $\Sigma$. Bias-corrected estimators of eigenvalues and sampling distribution of the test statistics proposed are obtained. Pooled-bootstrap method also considered for Bartlett's modified likelihood ratio statistics.