• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.102-107
• /
• 2007

Since the Matrix Pencil (MP) method can be performed to estimate multiple DOAs by using only single snapshot, this method is suitable for short data length or when the environment is dynamic. As the number of array increases, the computational load increases due to complex number computation. This paper presents an approach based on a unitary matrix pencil (MP) algorithm to reduce the computational load. Unitary transformation for the MP method has been suggested and formulated successfully. The computer simulation shows that the error rate of proposed method agree with that of MP for different SNR values.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.198-203
• /
• 2001

This study is about controlled impurities, which make metal alloys, especially AC4CH alloy that is made by restraining 0.2% Fe and Aluminum to make a matrix material. A metal matrix composite is produced using the squeeze casting method. The first step in the squeeze casting method is to add some organic binder including aluminum borate whisker into the matrix. After the fabrication of a metal matrix composite, each is individually appended to an inanimate binder such as $SiO_2,\;Al_2O_3$, and $TiO_2$. Through experiments the mechanical property changes were investigated between the metal matrix composite and AC4CH alloy. This study proves the superiority of the mechanical property of a metal matrix composites over AC4CH according to the previous tests and results that were mentioned above. One excellent property of matrix material composites is the infiltrated $TiO_2$ reinforcement. This material is a good substitute for the existing materials that are used in the development of industries today.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2634-2648
• /
• 2020

In this paper, an adaptive sparse singular value decomposition (ASSVD) algorithm is proposed to estimate the signal matrix when only one data matrix is observed and there is high dimensional white noise, in which we assume that the signal matrix is low-rank and has sparse singular vectors, i.e. it is a simultaneously low-rank and sparse matrix. It is a structured matrix since the non-zero entries are confined on some small blocks. The proposed algorithm estimates the singular values and vectors separable by exploring the structure of singular vectors, in which the recent developments in Random Matrix Theory known as anisotropic Marchenko-Pastur law are used. And then we prove that when the signal is strong in the sense that the signal to noise ratio is above some threshold, our estimator is consistent and outperforms over many state-of-the-art algorithms. Moreover, our estimator is adaptive to the data set and does not require the variance of the noise to be known or estimated. Numerical simulations indicate that ASSVD still works well when the signal matrix is not very sparse.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1145-1148
• /
• 2003

We show the mixed finite element method which induces solutions that has the same order of errors for both the gradient of the solution and the solution itself. The technique to construct an efficient reusable matrix is suggested. Two families of mixed finite element methods are introduced with an automatic generating technique for matrix with my order of basis. The generated matrix by this technique has more accurate values and is a sparse matrix. This new technique is applied to solve a minimal surface problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2468-2483
• /
• 2017

The construction of completely random sensing matrices of Compressive Sensing requires a large number of random numbers while that of deterministic sensing operators often needs complex mathematical operations. Thus both of them have difficulty in acquiring large signals efficiently. This paper focuses on the enhancement of the practicability of the structurally random matrices and proposes a semi-deterministic sensing matrix called Partial Kronecker product of Identity and Hadamard (PKIH) matrix. The proposed matrix can be viewed as a sub matrix of a well-structured, sparse, and orthogonal matrix. Only the row index is selected at random and the positions of the entries of each row are determined by a deterministic sequence. Therefore, the PKIH significantly decreases the requirement of random numbers, which has a complex generating algorithm, in matrix construction and further reduces the complexity of sampling. Besides, in order to process large signals, the corresponding fast sampling algorithm is developed, which can be easily parallelized and realized in hardware. Simulation results illustrate that the proposed sensing matrix maintains almost the same performance but with at least 50% less random numbers comparing with the popular sampling matrices. Meanwhile, it saved roughly 15%-35% processing time in comparison to that of the SRM matrices.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.4 no.3
• /
• pp.313-321
• /
• 2012

Vibration analysis of a thin-walled structure can be performed with a consistent mass matrix determined by the shape functions of all degrees of freedom (d.o.f.) used for construction of conventional stiffness matrix, or with a lumped mass matrix. In similar way stability of a structure can be analysed with consistent geometric stiffness matrix or geometric stiffness matrix with lumped buckling load, related only to the rotational d.o.f. Recently, the simplified mass matrix is constructed employing shape functions of in-plane displacements for plate deflection. In this paper the same approach is used for construction of simplified geometric stiffness matrix. Beam element, and triangular and rectangular plate element are considered. Application of the new geometric stiffness is illustrated in the case of simply supported beam and square plate. The same problems are solved with consistent and lumped geometric stiffness matrix, and the obtained results are compared with the analytical solution. Also, a combination of simplified and lumped geometric stiffness matrix is analysed in order to increase accuracy of stability analysis.

• Restorative Dentistry and Endodontics
• /
• v.25 no.4
• /
• pp.536-542
• /
• 2000

임상에서 점차 Mineral Trioxide Aggregate (MTA)에 대한 우수성이 소개되면서, apical matrix로의 사용은 주목할 만하다 할 수 있다. 본 연구의 목적은 개방형근관에서 MTA가 apical matrix로 사용될 때의 치근단 밀폐효과를 알아 보고, 근관충전의 시기와 matrix의 두께가 치근단 밀폐에 미치는 영향을 치근단 미세누출의 측면과 matrix탈락빈도의 측면에서 관찰하고자 하는 것이다. 개방형 근관을 재현하고자 45개의 발거된 단근치에 #90크기로 근단공을 형성하였고, 투명레진등을 이용하여 치근단 병소를 갖는 치조골을 재현한 후, 4개의 실험 군과 1개의 대조 군으로 분류하였다. A군: 2mm두께의 MTA matrix 형성후, 열연화된 Gutta-percha와 AH26 sealer를 이용하여 즉시 근관충전. B군: 2mm 두께의 MTA matrix 형성후, A군과 같은 방법으로 24시간 후 근관충전. C군: 4mm 두께의 MTA matrix 형성후, A군과 같은 방법으로 즉시 근관충전. D군: 4mm 두께의 MTA matrix 형성후, A군과 같은 방법으로 24시간 후 근관충전. 대조군: matrix를 사용하지 않고 열연화된 Gutta-percha와 AH26 sealer를 이용하여 근관충전하였다. Matrix의 탈락이 있는 경우 기록하고 완전 수세 후 다시 시행하였다. 색소침투정도의 평가를 위해 methylene blue에 치아를 48시간 침수시킨 후 협설로 양분하였다. 각 시편들을 고배율 현미경 관찰 후 비디오촬영 하였고, digitalized image analysing program을 이용하여 두명의 관찰자가 누출의 정도를 평가한 후, One-way ANOVA로 통계적 유의성을 검증하여 다음과 같은 결과를 얻었다. 1. Matrix를 사용한 실험 군이 matrix를 사용하지 않은 대조 군에 비해 유의성 있게 낮은 누출을 보였다(p<0.05). 그러나 근관충전시기와 matrix의 두께를 달리한 실험군 내에서는 누출에 유의성 있는 차이가 나타나지 않았다. 2. 모든 실험군에서 gutta-percha를 이용한 근관충전의 시기에 matrix탈락 및 gutta-percha의 압출은 발생하지 않았다.

• Journal of the Korea Convergence Society
• /
• v.4 no.3
• /
• pp.27-33
• /
• 2013

Conventional bar code has the appearance of line bars and spaces, called as one-dimensional bar code. In contrast, the information in two-dimensional bar code is represented by either a small, rectangular or square with the types of mosaic and Braille. The two-dimensional bar code is much more efficient than one-dimensional bar code because it can allow to store and express large amounts of data in a small space and so far there is also a little information about decoding the Data Matrix in base 256 mode. According to the ISO international standards, there are four kinds of bar code: QR code, Data Matrix, PDF417, and Maxi code. In this paper, among them, we focus on describing the basic concepts of Data Matrix in base 256 mode, how to encode and decode them, and how to organize them in detail. In addition, Data Matrix can be organized efficiently depending on the modes of numeric, alphanumeric characters, and binary system and expecially, we focus on describing how to decode the Data Matrix code by four modes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2A
• /
• pp.116-123
• /
• 2002

The jacket matrix is based on the Walsh-Hadamard matrix and an extension of it. While elements of the Walsh-Hadamard matrix are +1, or -1, those of the Jacket matrix are ${\pm}$1 and ${\pm}$$\omega$, which is $\omega$, which is ${\pm}$j and ${\pm}$2$\sub$n/. This matrix has weights in the center part of the matrix and its size is 1/4 of Hadamard matrix, and it has also two parts, sigh and weight. In this paper, instead of the conventional Jacket matrix where the weight is imposed by force, a simple Jacket sequence generation method is proposed. The Jacket sequence is generated by AND and Exclusive-OR operations between the binary indices bits of row and those of column. The weight is imposed on the element by when the product of each Exclusive-OR operations of significant upper two binary index bits of a row and column is 1. Each part of the Jacket matrix can be represented by jacket sequence using row and column binary index bits. Using Distributed Arithmetic (DA), we present a VLSI architecture of the Fast Jacket transform is presented. The Jacket matrix is able to be applied to cryptography, the information theory and complex spreading jacket QPSK modulation for WCDMA.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.6 no.2
• /
• pp.28-33
• /
• 1988

The objective of this work is to study the sue of precise triangulation nets by matrix analysis in adjusting coordinates. Results of this work show that matrix analysis has many advantages, namely in terms of accuracy and efficiency. In addition to this, comparison of adjusted vlues by two different methods, a Rigorous Method and an Approximate Method, show that differences in adjusted coordinates are 1-2 mm within the mean square error. This proves that the Approximate Method has sufficient accuracy in the practical application.