• The Korean Journal of Applied Statistics
• /
• v.24 no.2
• /
• pp.373-381
• /
• 2011

This paper discusses how to get the sums of squares due to treatment factors when Type I Analysis is used by projections for the analysis of data under the assumption of a two-way ANOVA model. The suggested method does not need to calculate the residual sums of squares for the calculation of sums of squares. There-fore, the calculation is easier and faster than classical ANOVA methods. It also discusses how eigenvectors and eigenvalues of the projection matrices can be used to get the calculation of sums of squares. An example is given to illustrate the calculation procedure by projections for unbalanced data.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1105-1112
• /
• 2020

One-dimensional 3-neighborhood Cellular Automata (CA)-based pseudo-random number generators are widely applied in generating test patterns to evaluate system performance and generating key sequence generators in cryptographic systems. In this paper, in order to design a CA-based key sequence generator that can generate more complex and confusing sequences, we study a one-dimensional symmetric 5-neighborhood CA that expands to five neighbors affecting the state transition of each cell. In particular, we propose an n-cell one-dimensional symmetric 5-neighborhood CA synthesis algorithm using the algebraic method that uses the Krylov matrix and the one-dimensional 90/150 CA synthesis algorithm proposed by Cho et al. [6].

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1462-1470
• /
• 2003

According to the necessity about information security as well as the advance of IT system and the spread of the Internet, a variety of cryptography algorithms are being developed and put to practical use. In addition the technique about cryptography attack also is advanced, and the algorithms which are strong against its attack are being studied. If the linear transformation matrix in the block cipher algorithm such as Substitution Permutation Networks(SPN) produces the Maximum Distance Separable(MDS) code, it has strong characteristics against the differential attack and linear attack. In this paper, we propose a new algorithm which cm estimate that the linear transformation matrix produces the MDS code. The elements of input code of linear transformation matrix over GF$({2_n})$ can be interpreted as variables. One of variables is transformed as an algebraic formula with the other variables, with applying the formula to the matrix the variables are eliminated one by one. If the number of variables is 1 and the all of coefficient of variable is non zero, then the linear transformation matrix produces the MDS code. The proposed algorithm reduces the calculation time greatly by diminishing the number of multiply and reciprocal operation compared with the conventional algorithm which is designed to know whether the every square submatrix is nonsingular.

• Review of KIISC
• /
• v.5 no.4
• /
• pp.5-13
• /
• 1995

본 논문에서는 디지탈 이동통신 시스템을 위해 제시된 기존의 세션 키 분배 및 가입자 인증 프로토콜을 소개하고, 선형대수에 기반을 둔 새로운 프로토콜의 제안 및 이의 안전성을 분석한다. 기존의 제안된 프로토콜이 단말기의 하드웨어적 제약성을 고려하여 작은 지수를 이용하는 RSA시스템이나 Modular Squqres Root 기법을 공개키 암호 체계에 기반을 둔 유한 체 상의 행렬과 벡터의 곱 계산이라는 측면에서 디지탈 이동통신 시스템에 적합한 방식이다.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.15 no.6
• /
• pp.82-88
• /
• 2001

This paper considers the problem of the identification of the time invariant parameters of distributed systems. In general, the parameters are identified by using the CBPOM(Conventional Block Pulse Operational Matrices), but in this paper, the parameters ard identified by using the EBPOMS(Extended Block Pulse Operational Matrices) which can reduce the burden of operation md the volume of error caused by matrices multiplication. The simulation cloves the effectiveness of the proposed method.

• The Korean Journal of Applied Statistics
• /
• v.8 no.1
• /
• pp.51-60
• /
• 1995

Given an $n \times p$ data matrix, if we add the $p_s$ variables somewhat different nature than the p variables to this matrix, we have a new $n \times (p+p_s)$ data matrix. Because of these $p_s$ variables, the traditional principal component analysis can't provide its efficient results. In this study, to improve this problem we review the supplementary principal component analysis putting $p_s$ variables to supplementary variable. This technique is based on the algebraic and geometric aspects of the traditional principal component analysis. So we provide a type of statistical data analysis for the records of eight teams and fourteen fields of the 1982-1992 Korean Pro Baseball Data based on the supplementary principal component analysis and the traditional principal component analysis. And we compare the their results.

• Journal of Broadcast Engineering
• /
• v.18 no.4
• /
• pp.609-618
• /
• 2013

This paper proposes a fast image segmentation method that gives high segmentation performance as graph-cut based methods. Graph-cut based image segmentation methods show high segmentation performance, however, the computational complexity is high to solve a computationally-intensive eigen-system. This is because solving eigen-system depends on the size of square matrix obtained from similarities between all pairs of pixels in the input image. Therefore, the proposed method uses the small-size square matrix, which is obtained from all the similarities among regions obtained by segmenting locally an image into several regions by graph-based method. Experimental results show that the proposed multi-scale image segmentation method using the algebraic multi-grid shows higher performance than existing methods.

• Journal of the Korea Society for Simulation
• /
• v.28 no.3
• /
• pp.65-74
• /
• 2019

For many years, it has been widely studied on fork-join production systems but there is not much literature focusing on the finite buffer(s) of either individuals or shared, and generally distributed processing times. Usually, it is difficult to handle finite buffer(s) through a standard queueing theoretical approach. In this study, by using the max-plus algebraic approach we studied buffer-shared fork-join production systems with general processing times. However, because it cannot provide proper computational ways for performance measures, we developed simulation models using @RISK software and the expressions derived from max-plus algebra. From the simulation experiments, we compared some properties on waiting time with respect to a buffer capacity under two blocking policies: BBS (Blocking Before Service) and BAS (Blocking After Service).

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.34 no.3
• /
• pp.151-157
• /
• 2021

This paper is devoted to a convergence study of the nonlocal integral operator in peridynamics. The implicit formulation can be an efficient approach to obtain the static/quasi-static solution of crack propagation problems. Implicit methods require constly large-matrix operations. Therefore, convergence is important for improving computational efficiency. When the radial influence function is utilized in the nonlocal integral equation, the fractional Laplacian integral equation is obtained. It has been mathematically proved that the condition number of the system matrix is affected by the order of the radial influence function and nonlocal horizon size. We formulate the static crack problem with peridynamics and utilize Newton-Raphson methods with a preconditioned conjugate gradient scheme to solve this nonlinear stationary system. The convergence behavior and the computational time for solving the implicit algebraic system have been studied with respect to the order of the radial influence function and nonlocal horizon size.

• Journal of the Korean School Mathematics Society
• /
• v.13 no.3
• /
• pp.357-379
• /
• 2010

There are many studies about the method of trying leveled class because we say the Excellence of Education after high school's Equalization Policy. After the leveled c1ass, Ministry of Education, Science and Tech. announced the induction of leveled classes' evaluation in 2008, it is called that students take classes adapted to their levels. This study illustrates criteria of forming evaluation, it composes leveled assessment tests referenced by Gibb's evaluation effects & Cotton's evaluation principles. Before anything else, this study induced contents of studies which is emphasized the structure rather than the arithmetic that is based on Foucault' s analysis of mathematics' class and examination & MacGregor's point of algebra. Since then we made leveled assessment tests which made by students' Question. And then, In this study, we modified evaluation tests appropriately by criteria of evaluation and analysing the result.