• Proceedings of the Optical Society of Korea Conference
• /
• 1990.02a
• /
• pp.87-90
• /
• 1990

We compare the reflectivity spectrum and phase change of Bragg reflectors obtained by the matrix method and the coupled wave method. We show that the results obtained by the two methods agree well generally and the discrepancy between the results obtained by the two methods increases as the fractional refractive index difference between adjacent layers increases and/or the absorption loss increases, due to the approximations inherent in the coupled wave method for the analysis of multiple dielectric layers.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.5.1-5
• /
• 2003

In this paper, we study the convergence of relaxed multisplitting and relaxed nonstationary two-stage multisplitting methods associated with a multisplitting which is obtained from the ILU factorizations for solving a linear system whose coefficient matrix is an H-matrix. Also, parallel performance results of relaxed nonstaionary two-stage multisplitting method using ILU factorizations as inner splittings on the IBM p690 supercomputer are provided to analyze theoretical results.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2002.08a
• /
• pp.963-968
• /
• 2002

This paper will review the driving methods and issues of driving circuitry for passive matrix organic electro-luminescent displays(PM-OELDs). And it will shows the proposed one-chip and two-chip solution for driving the PM-OELDs and also the pixel structure and driving methods of active matrix (AM-OELDs). We will discuss the proper applications of OELDs with its power consumption by comparison with that of LCD.

• Proceedings of the Safety Management and Science Conference
• /
• 2006.11a
• /
• pp.427-435
• /
• 2006

We study on the consistency of AHP. It is research that extend of SAW methods by [1]. For tools that measure judgment of inconsistency eigenvector methods, we research consistency that introduced consistency ratio by Saaty. in general, the higher consistence of compare matrix the bigger error within matrix. In this paper, we use the AHP for the optimal decision making. By this method, we have optimal decision making numenical example which three models of any domestic motors companies.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.203-211
• /
• 2016

The genetic code is a key to bio-informatics and to a science of biological self-organizing on the whole. Modern science faces the necessity of understanding and systematically explaining mysterious features of ensembles of molecular structures of the genetic code. This paper is devoted to symmetrical analysis for genetic systems. Mathematical theories of noise-immunity coding and discrete signal processing are based on Jacket matrix methods of representation and analysis of information. Both of the RNA and Jacket Matrix property also have the Element(Block) - wise Inverse Matrices. These matrix methods, which are connected closely with relations of symmetry, are borrowed for a matrix analysis of ensembles of molecular elements of the genetic code. This method is presented for its simplicity and the clarity with which it decomposes a Jacket Matrix in terms of the genetic RNA Codon.

• Journal of Engineering Education Research
• /
• v.15 no.1
• /
• pp.61-71
• /
• 2012

The core issue of ethical problem solving in engineering is to understand what exactly happened and to define its nature. Problems often arise mostly in morally complex situations. Traditional philosophical theories usually focus on extreme conflicts of interest and suggest moral theory-centered problem solving methods. However, these methods are not only difficult to specifically apply to real situations, but also are likely to fail to deal with actual moral issues in engineering fields. This study aims to develop more desirable ethical problem solving methods, based on STS (Science and Technology Studies) and engineering ethics combined. First, we have examined the engineering ethics with implications of an STS perspective, then have analyzed traditional ethical problem solving methods in a critical point of view. This study will suggest a new ethical problem solving method named Matrix Guide, based upon those analyses. Specifically, this study classifies four stages of problem definition, analysis, solving, and feedback. Here, we focus on how to combine technological and non-technological factors in each stage, when we are facing morally complex situations in engineering sectors.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1623-1629
• /
• 2022

Matrix multiplication is a fundamental operation widely used in science and engineering. There is an approximate matrix multiplication method as a way to reduce the amount of computation of matrix multiplication. Approximate matrix multiplication determines an appropriate probability distribution for selecting columns and rows of matrices, and performs approximate matrix multiplication by selecting columns and rows of matrices according to this distribution. Probability distributions are generated by considering both matrices A and B participating in matrix multiplication. In this paper, we propose a method to generate a probability distribution that selects columns and rows of matrices to be used for approximate matrix multiplication, targeting only matrix A. Approximate matrix multiplication was performed on 1000×1000 ~ 5000×5000 matrices using existing and proposed methods. The approximate matrix multiplication applying the proposed method compared to the conventional method has been shown to be closer to the original matrix multiplication result, averaging 0.02% to 2.34%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.471-485
• /
• 2023

As data sharing increases explosively, such information encoded in QR code is completely public as private messages are not securely protected. This paper proposes a new 'PROMISE' framework for hiding information based on the QR code projection matrix by using image segmentation without modifying the essential QR code characteristics. Projection matrix mapping, matrix scrambling, fusion image segmentation and steganography with SEL(secret embedding logic) are part of the PROMISE framework. The QR code could be mapped to determine the segmentation site of the fusion image as a binary information matrix. To further protect the site information, matrix scrambling could be adopted after the mapping phase. Image segmentation is then performed on the fusion image and the SEL module is applied to embed the secret message into the fusion image. Matrix transformation and SEL parameters should be uploaded to the server as the secret key for authorized users to decode the private message. And it was possible to further obtain the private message hidden by the framework we proposed. Experimental findings show that when compared to some traditional information hiding methods, better anti-detection performance, greater secret key space and lower complexity could be obtained in our work.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.2991-3007
• /
• 2022

Two dimensional locality preserving projections (2D-LPP) is an improved algorithm of 2D image to solve the small sample size (SSS) problems which locality preserving projections (LPP) meets. It's able to find the low dimension manifold mapping that not only preserves local information but also detects manifold embedded in original data spaces. However, 2D-LPP is simple and elegant. So, inspired by the comparison experiments between two dimensional linear discriminant analysis (2D-LDA) and linear discriminant analysis (LDA) which indicated that matrix based methods don't always perform better even when training samples are limited, we surmise 2D-LPP may meet the same limitation as 2D-LDA and propose a novel matrix exponential method to enhance the performance of 2D-LPP. 2D-MELPP is equivalent to employing distance diffusion mapping to transform original images into a new space, and margins between labels are broadened, which is beneficial for solving classification problems. Nonetheless, the computational time complexity of 2D-MELPP is extremely high. In this paper, we replace some of matrix multiplications with multiple multiplications to save the memory cost and provide an efficient way for solving 2D-MELPP. We test it on public databases: random 3D data set, ORL, AR face database and Polyu Palmprint database and compare it with other 2D methods like 2D-LDA, 2D-LPP and 1D methods like LPP and exponential locality preserving projections (ELPP), finding it outperforms than others in recognition accuracy. We also compare different dimensions of projection vector and record the cost time on the ORL, AR face database and Polyu Palmprint database. The experiment results above proves that our advanced algorithm has a better performance on 3 independent public databases.

• Communications for Statistical Applications and Methods
• /
• v.5 no.2
• /
• pp.531-538
• /
• 1998

This paper first examines the skewness of Wishart distribution, using Tracy and Sultan(1993)'s results. Second, it investigates the variance-covariance matrix of random matrix $S_Y=YY'$ which has a non-central Wishart distribution. Third, it proposes the exact form of the third moment of the random matrix with non-central Wishart distribution.