• Kyungpook Mathematical Journal
• /
• v.19 no.1
• /
• pp.127-134
• /
• 1979

A (0,1) matrix is acyclic if it does not have a permutation matrix of order 2 as a submatrix. A bipartite tournament is acyclic if and only if its adjacency matrix is acyclic. The concepts of (maximal) order of cyclicity of a matrix and a bipartite tournament are introduced and studied.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.157-161
• /
• 2015

A new block low-density parity-check (Block-LDPC) code based on quadratic permutation polynomials (QPPs) is proposed. The parity-check matrix of the Block-LDPC code is composed of a group of permutation submatrices that correspond to QPPs. The scheme provides a large range of implementable LDPC codes. Indeed, the most popular quasi-cyclic LDPC (QC-LDPC) codes are just a subset of this scheme. Simulation results indicate that the proposed scheme can offer similar error performance and implementation complexity as the popular QC-LDPC codes.

• 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.

• Journal of the Korean Statistical Society
• /
• v.9 no.1
• /
• pp.1-12
• /
• 1980

A parallel flats faraction for the $3^n$ factorial experiment is symbolically written as $At = C(r\timesf)$ where $A(r\timesn)$ is of rank r. The A-matrix partitions the nonnegligible effects into $(3^{n-r}-1)/2+1$ alias sets. The $U_i$ effects in the i-th alias set are related pairwise by elements from $S_3$, the symmetric group on three symbols. For each alias set the f flats produce an $f \times u_i$ alias componet permutation matrices (ACPM) with elements from $S_3$. All the information concerning the relationships among levels of the effects is contained in the ACPM.

• Structural Engineering and Mechanics
• /
• v.69 no.1
• /
• pp.105-120
• /
• 2019

In this paper, a new efficient method for structural modal reanalysis is proposed, which can handle large finite element (FE) models requiring frequent design modifications. The global FE model is divided into a residual part not to be modified and a target part to be modified. Then, an automated matrix permutation and substructuring algorithm is applied to these parts independently. The reduced model for the residual part is calculated and saved in the initial analysis, and the target part is reduced repeatedly, whenever design modifications occur. Then, the reduced model for the target part is assembled with that of the residual part already saved; thus, the final reduced model corresponding to the new design is obtained easily and rapidly. Here, the formulation of the proposed method is derived in detail, and its computational efficiency and reanalysis ability are demonstrated through several engineering problems, including a topological modification.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.2
• /
• pp.381-394
• /
• 2016

Graphical model represents conditional dependencies between variables as a graph with nodes and edges. It is widely used in various fields including physics, economics, and biology to describe complex association. Conditional dependencies can be estimated from a inverse covariance matrix, where zero off-diagonal elements denote conditional independence of corresponding variables. This paper proposes a efficient BCDR (block coordinate descent with random permutation) algorithm using graphics processing units and random permutation for the CONCORD (convex correlation selection method) based on the BCD (block coordinate descent) algorithm, which estimates a inverse covariance matrix based on pseudo-likelihood. We conduct numerical studies for two network structures to demonstrate the efficiency of the proposed algorithm for the CONCORD in terms of computation times.

• Communications of the Korean Mathematical Society
• /
• v.10 no.1
• /
• pp.15-21
• /
• 1995

• Communications of the Korean Mathematical Society
• /
• v.28 no.1
• /
• pp.1-9
• /
• 2013

We consider the sets of matrix ordered pairs which satisfy extremal properties with respect to Boolean rank inequalities of matrices over nonbinary Boolean algebra. We characterize linear operators that preserve these sets of matrix ordered pairs as the form of $T(X)=PXP^T$ with some permutation matrix P.

• Journal of the Korean Statistical Society
• /
• v.12 no.2
• /
• pp.61-68
• /
• 1983

A parallel flats fraction for the $3^n$ factorial experiment is defined as the union of flats, ${t$\mid$At=C_i(mod 3)}, i=1,2,\cdot,f$, in EG(n,3) and is symbolically written as At=C where A is of rank r. The A matrix partitions the effects into u+1 alias sets where $u=(3^{n-r}-1)/2$. For each alias set the f flats produce an alias component permutation matrix (ACPM) with elements from $S_3$. In this paper, a detection vector of the ACPM was constructed for each combination of k or fewer two-factor interactions. Also the relationship between the detection vectors has been shown.

• Kyungpook Mathematical Journal
• /
• v.53 no.3
• /
• pp.479-495
• /
• 2013

Taking the weighted geometric mean [11] on the cone of positive definite matrix, we propose an iterative mean algorithm involving weighted arithmetic and geometric means of $n$-positive definite matrices which is a weighted version of Carlson mean presented by Lee and Lim [13]. We show that each sequence of the weigthed Carlson iterative mean algorithm has a common limit and the common limit of satisfies weighted multidimensional versions of all properties like permutation symmetry, concavity, monotonicity, homogeneity, congruence invariancy, duality, mean inequalities.