• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1989년도 추계학술발표회 발표논문초록집; 이화여자대학교, 서울; 23 Sep. 1989
• /
• pp.137-138
• /
• 1989

• 대한수학회지
• /
• 제34권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.

• 품질경영학회지
• /
• 제20권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
• /
• 제3권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.

• 대한수학회보
• /
• 제22권1호
• /
• pp.63-63
• /
• 1985

• 대한수학회지
• /
• 제42권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.

• 한국CDE학회논문집
• /
• 제5권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.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제26권4호
• /
• pp.351-362
• /
• 2012

행렬 및 벡터공간을 다루는 선형대수학은 사회의 복잡한 현상을 선형화 과정을 거쳐 선형연립방정식이라는 단순한 형태의 수학 문제로 바꾼 후 실제로 해결하는 데 결정적으로 기여한다. 이와 같은 이유로 20세기 중반까지 추상적인 고등수학 과목으로만 여겨지던 선형대수학이 현재는 자연-공학-사회계열 분야 학생의 대부분이 배우는 기본 교과목이 되었다. 본 연구에서는 초기 선형대수학의 발전에 기여한 중국, 일본, 그리고 서양의 수학자들에 대하여 다룬다. 선형대수학은 <산수서>, <구장산술>, 세키 고와, 뫼비우스, 그라스만 실베스터, 케일리 등을 거치면서 비선형적으로 발전해왔다. 우리는 새로 발굴한 내용을 중심으로 초기 선형대수학의 발전과정을 소개한다.

• 충청수학회지
• /
• 제21권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
• /
• 제12권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$.