• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.799-812
• /
• 2001

As XML become more popular for encoding data and exchanging format on the web, recent work on processing XML Document in DBMS has been performed. However, there is no formal data model for XML, and there is lack of research on XML algebra for processing complex XML query and even the mediators have many restrictions. Therefore, this paper proposes formal data model and algebra based on directed edge labeled graph for XML query. To implement algebra, not only algorithms of operation for algebra are presented, but also they are implemented using access method and path index based on RDBMS or ORDBMS. In particular, experiments to show the effectiveness of the implemented algebra are performed on XML documents on EST data which are semistructured data.

• Korean Journal of Mathematics
• /
• v.9 no.1
• /
• pp.53-60
• /
• 2001

We study the properties of positivity of matrices and construct useful positive matrices. As an application, we consider a directed graph with matrices such that all the associated matrices related to the positive linear functional are positive.

• Communications of the Korean Mathematical Society
• /
• v.22 no.3
• /
• pp.419-428
• /
• 2007

In this paper, we will investigate the Hessian geometry of the homogeneous domain over the hypersurface given by a function F : $\mathbb{R}^n{\rightarrow}\mathbb{R}$ with ${\mid}{\det}\;DdF\mid=1$.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.672-682
• /
• 1996

In this paper, we propose an algorithm to transform an object calculus into an object algebra. The algorithm translates the calculus expression into an equivalent algebra expression, and it maps the object algebra expression to an object algebra operator graph. This translation algorithm not only generates an efficient access plan of queries, but also proves the equivalent expressiveness of queries.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.118-118
• /
• 1993

We consider a discrete event dynamic system called periodic job shop, where an identical mixture of items called minimal part set(MPS) is repetitively produced in the same processing order and the primary performance measure is the cycle time. The precedence relationships among events(starts of operations) are represented by a directed graph with rocurront otructure. When each operation starts as soon as all its preceding operations complete(called earliest starting), the occurrences of events are modeled in a linear system using a special algebra called minimax algebra. By investigating the eigenvalues and the eigenvectors, we develop conditions on the directed graph for which a stable steady state or a finite eigenvector exists. We demonstrate that each finite eigenvector, characterized as a finite linear combination of a class of eigenvalue, is the minimum among all the feasible schedules and an identical schedule pattern repeats every MPS. We develop an efficient algorithm to find a schedule among such schedules that minimizes a secondary performance measure related to work-in-process inventory. As a by-product of the linear system approach, we also propose a way of characterizing stable steady states of a class of discrete event dynamic systems.

• Honam Mathematical Journal
• /
• v.30 no.2
• /
• pp.343-358
• /
• 2008

The primitive orders in a quaternion algebra play a central role of the theory of Hecke operators. In this paper, we study theta series generated by Brandt matrices and its applications to almost Ramanujan graphs.

• The Pure and Applied Mathematics
• /
• v.19 no.2
• /
• pp.199-209
• /
• 2012

For a locally compact higher rank graph ${\Lambda}$, we construct a two-sided path space ${\Lambda}^{\Delta}$ with shift homeomorphism ${\sigma}$ and its corresponding path groupoid ${\Gamma}$. Then we find equivalent conditions of aperiodicity, cofinality and irreducibility of ${\Lambda}$ in (${\Lambda}^{\Delta}$, ${\sigma}$), ${\Gamma}$, and the groupoid algebra $C^*({\Gamma})$.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.281-289
• /
• 1999

The objective of this paper is to propose a brand new interface mechanism to provide more intelligent decision making support for EC problems. Its main virtue is based on a numerical process mechanism by using an Extended AND-OR Graph (EAOG)-based logic algebra. Using this mechanism, decision makers engaged in electronic commerce (EC) can effectively deal with complicated decision making problems. In the field of traditional expert systems research, AND-OR Graph approach has been suggested as a useful tool for representing the logic flowchart of the forward and/or backward chaining inference methods. However, the AND-OR Graph approach cannot be effectively used in the EC problems in which real-time problem-solving property should be highly required. In this sense, we propose the EAOG inference mechanism for EC problem-solving in which heurisric knowledge necessary for intelligent EC problem-solving can be represented in a form of matrix. Finally, we have proved the validity of our approach with several propositions and an illustrative EC example

• Research in Mathematical Education
• /
• v.11 no.2
• /
• pp.143-151
• /
• 2007

Nowadays there are practically no mathematical courses in which Computer Algebra Systems (CAS) programs, such as MATHEMATlCA, Maple, and TI-89/92, are not used to some extent. However, generally the usage of these programs is reduced to illustration of computing processes: calculation of integrals, differentiation, solution of various equations, etc. This is obtained by usage of standard command of type: Solve [...] in MATHEMATICA. At the same time the main difficulties arise at teaching nonconventional mathematical courses such as coding theory, discrete mathematics, cryptography, Scientific computing, which are gaining the increasing popularity now. Now it is impossible to imagine a modern engineer not having basic knowledge in discrete mathematics, Cryptography, coding theory. Digital processing of signals (digital sound, digital TV) has been introduced in our lives.

• Journal of the Korean Mathematical Society
• /
• v.52 no.2
• /
• pp.239-268
• /
• 2015

Let Q be a finite quiver and $G{\subseteq}Aut(\mathbb{k}Q)$ a finite abelian group. Assume that $\hat{Q}$ and ${\Gamma}$ are the generalized Mckay quiver and the valued graph corresponding to (Q, G) respectively. In this paper we discuss the relationship between indecomposable $\hat{Q}$-representations and the root system of Kac-Moody algebra $g({\Gamma})$. Moreover, we may lift G to $\bar{G}{\subseteq}Aut(g(\hat{Q}))$ such that $g({\Gamma})$ embeds into the fixed point algebra $g(\hat{Q})^{\bar{G}}$ and $g(\hat{Q})^{\bar{G}}$ as a $g({\Gamma})$-module is integrable.