• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.93-101
• /
• 2010

In this paper we generate Gold-sequence by using M-sequence which is made by two primitive polynomial of GF(2). Generally M-sequence is generated by linear feedback shift register code generator. Here we show that this matrix of appropriate permutation has Hadamard matrix property. This matrix proves that Gold-sequence through two M-sequence and additive matrix of one column has one of major properties of Hadamard matrix, orthogonal. and this matrix show another property that multiplication with one matrix and transpose matrix of this matrix have the result of unit matrix. Also M-sequence which is made by linear feedback shift register gets Hadamard matrix property mentioned above by adding matrices of one column and one row. And high-speed conversion is possible through L-matrix and the S-matrix.

• Korean Journal of Plant Tissue Culture
• /
• v.27 no.1
• /
• pp.39-45
• /
• 2000

Two maize transposable elements, immobilized Ac (iAc) and Ds, have been introduced into the genome of a diploid potato clone (Solanum tuberosum Group Phureja clone 1.22). The iAc is a modified Ac that is supposed to be unable to transpose but is expected to trans-activate the transposition of a Ds that is unable to transpose by itself. When the leaf and stem explants of in vitro shoots of the clone 1.22 were inoculated with Agrobacterium tumefaciens strains harboring binary vectors containing the iAc and the Ds, calli were formed from the explants on media containing 50 mg/L of kanamycin, and shoots were regenerated from the calli. The regenerated shoots formed roots when cultured on media containing 100 mg/L of kanamycin, whereas untransformed shoots did not form roots on the same media. The PCR amplification of the DNA's from the transgenic plants confirmed that the iAc and the Ds elements were introduced into the potato genome of 1.22.

• The Journal of the Convergence on Culture Technology
• /
• v.8 no.4
• /
• pp.415-422
• /
• 2022

The heterogeneous Onju citrus genes (A=20.57, C=32.71, G=30.01, U=16.71%) and coffee genes (A=20.66, C=31.76, G=30.187, U=16.71%) have the same genetic ratio of 95% or more. It is known that gene compatibility is generally not possible with this group. However, it can be grafted if the conditions of Chargaff rule and Shannon Entropy are met with gene functional-similarity of more than 95%, and it becomes a new breed of Coffrange. We calculated the world's first BCJM matrix for DNA-RNA and published it in US patents and international journals. All animals and viruses are similar to human genes. Based on this, it was announced in June in the British matrix textbook by solving the genetic characteristics of COVID-19 and the human body. In plants, it is treated with BCJM-Transposon treatment, a technique that easily changes gene location. Simulation predicted that the matrix could be successful with Cut & Paste and Transpose.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.3
• /
• pp.135-142
• /
• 2011

Unlike using the sequence-based representation for a chromosome in previous genetic algorithms for Bayesian structure learning, we proposed a matrix representation-based genetic algorithm. Since a good chromosome representation helps us to develop efficient genetic operators that maintain a functional link between parents and their offspring, we represent a chromosome as a matrix that is a general and intuitive data structure for a directed acyclic graph(DAG), Bayesian network structure. This matrix-based genetic algorithm enables us to develop genetic operators more efficient for structuring Bayesian network: a probability matrix and a transpose-based mutation operator to inherit a structure with the correct edge direction and enhance the diversity of the offspring. To show the outstanding performance of the proposed method, we analyzed the performance between two well-known genetic algorithms and the proposed method using two Bayesian network scoring measures.

• Journal of electromagnetic engineering and science
• /
• v.7 no.1
• /
• pp.17-27
• /
• 2007

Jacket matrices which are defined to be $n{\times}n$ matrices $A=(a_{jk})$ over a field F with the property $AA^+=nI_n$ where $A^+$ is the transpose matrix of elements inverse of A,i.e., $A^+=(a_{kj}^-)$, was introduced by Lee in 1984 and are used for signal processing and coding theory, which generalized the Hadamard matrices and Center Weighted Hadamard matrices. In this paper, some properties and constructions of Jacket matrices are extensively investigated and small orders of Jacket matrices are characterized, also present the full rate and the 1/2 code rate complex orthogonal space time code with full diversity.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.433-446
• /
• 1999

Let G denote either of the groups $GL_2(q)$ or $SL_2(q)$. The mapping $theta$ sending a matrix to its transpose-inverse is an auto-mophism of G and therefore we can form the group $G^+$ = G.<$theta$>. In this paper conjugacy classes of elements in $G^+$ -G are found. These classes are closely related to the congruence classes of invert-ible matrices in G.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.10-11
• /
• 2014

In a 2-dimensional (2D) Discrete Cosine Transform (DCT) hardware, a significant fraction of the total hardware area is contributed by the combinational logic used to perform 1-dimensional (2D) transform. The size of the non-combinational logic i.e. the transpose memory is dictated by the size of the largest transform supported. Hence, the optimization of hardware area is performed mainly for 1D-transform combinational logic. This paper demonstrates the use of Multiple Constant Multiplication (MCM) algorithm to reduce the combinational logic area. Partial optimizations are also described for the cases where the direct use of MCM algorithm doesn't meet the timing constraint. Experimental results show that 46% improvement in gate count is achieved for 32 point 1D DCT transform logic after using MCM optimization.

• Journal of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.439-453
• /
• 1996

In R. McKenzie[12], it is shown that the cardinality of the lattice variety is $2^\aleph_0$ and K. Baker[1] contains the stronger result that M, the variety of all modular lattices, has $2^\aleph_0$ subvarieties. It follows that there exists a variety of modular lattices that is not finitely based. In fact, K. Baker[2] gave an example of such a variety. And it was proved by K. Baker [2] and B. Jonsson [8] that join of two finitely based lattice varieties is not always finitely based. K. Baker[2] gave an explicit example of case of nonmodular lattice variety. Then it is proposed whether the join of two finitely based varieties if finitely based under certain conditions. The answer to the question is not affirmative.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.1017-1031
• /
• 2016

Let R be a commutative ring with the non-zero identity and n be a natural number. ${\Gamma}^n_R$ is a simple graph with $R^n{\setminus}\{0\}$ as the vertex set and two distinct vertices X and Y in $R^n$ are adjacent if and only if there exists an $n{\times}n$ lower triangular matrix A over R whose entries on the main diagonal are non-zero such that $AX^t=Y^t$ or $AY^t=X^t$, where, for a matrix B, $B^t$ is the matrix transpose of B. ${\Gamma}^n_R$ is a generalization of Cayley graph. Let $T_n(R)$ denote the $n{\times}n$ upper triangular matrix ring over R. In this paper, for an arbitrary ring R, we investigate the properties of the graph ${\Gamma}^n_{T_n(R)}$.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.2001-2011
• /
• 2013

Cho and Kim [4] have introduced the concept of the competition index of a digraph. Similarly, the competition index of an $n{\times}n$ Boolean matrix A is the smallest positive integer q such that $A^{q+i}(A^T)^{q+i}=A^{q+r+i}(A^T)^{q+r+i}$ for some positive integer r and every nonnegative integer i, where $A^T$ denotes the transpose of A. In this paper, we study the upper bound of the competition index of a Boolean matrix. Using the concept of Boolean rank, we determine the upper bound of the competition index of a nearly reducible Boolean matrix.