• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1989.10a
• /
• pp.137-138
• /
• 1989

• Journal of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.859-869
• /
• 1997

It is shown that for $A_{k, m}$ a k-homogeneous $C^*$-algebra over $S^{2n - 1} \times S^1$ such that no non-trivial matrix algebra can be factored out of $A_{k, m}$ and $A_{k, m} \otimes M_l(C)$ has a non-trivial bundle structure for any positive integer l, we construct an $A_{k, m^-} C(S^{2n - 1} \times S^1) \otimes M_k(C)$-equivalence bimodule to show that every k-homogeneous $C^*$-algebra over $S^{2n - 1} \times S^1)$. Moreover, we prove that the tensor product of the k-homogeneous $C^*$-algebra $A_{k, m}$ with a UHF-algebra of type $p^\infty$ has the tribial bundle structure if and only if the set of prime factors of k is a subset of the set of prime factors of pp.

• Journal of Korean Society for Quality Management
• /
• v.20 no.1
• /
• pp.11-21
• /
• 1992

The Purpose of this paper contribute to design the multistate Markov process for the reliability of a system when the transition-rates of each unit depend on the current state of the system. The system transition-rate matrix has the form of the kronecker sum of transition rate matrices for the units, is analyzed and investigated. As a result, the system which has the state-dependent units is detaily analyzed and introduced by the approach of an algorithm for the system transition-rate matrix based on the kronecker algebra.

• Industrial Engineering and Management Systems
• /
• v.3 no.1
• /
• pp.1-11
• /
• 2004

This paper proposes a new algorithm for determining an optimal control input for production systems. In many production systems, completion time should be planned within the due dates by taking into account precedence constraints and processing times. To solve this problem, the max-plus algebra is an effective approach. The max-plus algebra is an algebraic system in which the max operation is addition and the plus operation is multiplication, and similar operation rules to conventional algebra are followed. Utilizing the max-plus algebra, constraints of the system are expressed in an analogous way to the state-space description in modern control theory. Nevertheless, the formulation of a system is currently performed manually, which is very inefficient when applied to practical systems. Hence, in this paper, we propose a new algorithm for deriving a state-space description and determining an optimal control input with several constraint matrices and parameter vectors. Furthermore, the effectiveness of this proposed algorithm is verified through execution examples.

• Bulletin of the Korean Mathematical Society
• /
• v.22 no.1
• /
• pp.63-63
• /
• 1985

• Journal of the Korean Mathematical Society
• /
• v.42 no.6
• /
• pp.1287-1309
• /
• 2005

A key exchange protocol using commutative subalge-bras of a full matrix algebra is considered. The security of the protocol depends on the difficulty of solving matrix equations XRY = T, with given matrices R and T. We give a polynomial time algorithm to solve XRY = T for the choice of certain types of subalgebras. We also compare the efficiency of the protocol with the Diffie-Hellman key exchange protocol on the key computation time and the key size.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.380-392
• /
• 2000

This paper proposes a qualitative reasoning approach for the spatial configuration of mechanisms that could be applied in the early phase of the conceptual design. The spatial configuration problem addressed in this paper involves the relative direction and position between the input and output motion, and the orientation of the constituent primitive mechanisms of a mechanism. The knowledge of spatial configuration of a primitive mechanism is represented in a matrix form called spatial configuration matrix. This matrix provides a compact and convenient representation scheme for the spatial knowledge, and facilitates the manipulation of the relevant spatial knowledge. Using this spatial knowledge of the constituent primitive mechanisms, the overall configuration of a mechanism is described and identified by a spatial configuration state matrix. This matrix is obtained by using a qualitative reasoning method based on sign algebra and is used to represent the qualitative behavior of the mechanism. The matrix-based representation scheme allows handling the involved spatial knowledge simultaneously and the proposed reasoning method enables the designer to predict the spatial behavior of a mechanism without knowing specific dimension of the components of the mechanism.

• Communications of Mathematical Education
• /
• v.26 no.4
• /
• pp.351-362
• /
• 2012

Until the 1950s, linear algebra was considered only as one of abstract and advanced mathematics subject among in graduate mathematics courses, mainly dealing with module in algebra. Since the 1960s, it has been a main subject in undergraduate mathematics education because matrices has been used all over. In Korea, it was considered as a course only for mathematics major students until 1980s. However, now it is a subject for all undergraduate students including natural science, engineering, social science since 1990s. In this paper, we investigate the early history of linear algebra and its development from a historical perspective and mathematicians who made contributions. Secondly, we explain why linear algebra became so popular in college mathematics education in the late 20th century. Contributions of Chinese and H. Grassmann will be extensively examined with many newly discovered facts.

• Journal of the Chungcheong Mathematical Society
• /
• v.21 no.1
• /
• pp.57-60
• /
• 2008

Let $U(sp_4)$ be the universal enveloping algebra of the symplectic Lie algebra $sp_4$. Then the restricted dual $U(sp_4)^{\circ}$ becomes a Poisson Hopf algebra with the Sklyanin Poisson bracket determined by the standard classical r-matrix. Here we illustrate a method to obtain the Lie bialgebra from a Poisson bialgebra $U(sp_4)^{\circ}$.

• Korean Journal of Mathematics
• /
• v.12 no.1
• /
• pp.23-32
• /
• 2004

Let (B, $m_B$, ${\kappa}$) be a maximal commutative ${\kappa}$-subalgebra of a matrix algebra $M_n(\kappa)$. We will construct a maximal commutative ${\kappa}$-subalgebra (R, $m$, ${\kappa}$) of $M_n+3(\kappa)$ from the algebra B such that the algebra R has dimension greater than the dimension of B by 3. Moreover, we will show a $C_i$-construction doesn't imply a $C^3_2$-construction for $i=1,2$.