• Korean Journal of Mathematics
• /
• v.21 no.4
• /
• pp.503-521
• /
• 2013

For over 20 years, the issue of using an adequate CAS tool in teaching and learning of linear algebra has been raised constantly. And a variety of CAS tools were introduced in many linear algebra textbooks. In Korea, however, because of some realistic problems, they have not been introduced in the class and the theoretical aspect of linear algebra has been focused on in teaching and learning of it. In this paper, we suggest Sage as an alternative for CAS tools overcoming the problems mentioned above. And, we introduce full contents for linear algebra and matrix calculator that Sage was used to develop. Taking advantage of them, almost all the concepts of linear algebra can be easily covered and the size of matrices can be expanded without difficulty.

• 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 Korean Society for Railway
• /
• v.12 no.2
• /
• pp.267-275
• /
• 2009

Max-plus algebra is a nonlinear system comprised of two operations, maximization (max) and addition (Plus), which are corresponding to the addition and the multiplication in conventional algebra, respectively. This methodology is applicable to many discrete event systems containing the state transition with the maximization and addition operation. Timetable with connection is one of such systems. We present the method based on max-plus algebra, which can make up timetable considering transfer and analyse its stability and robustness. In this study, it will be shown how to make up the timetable of the urban train and analyse its stability using Max-Plus algebra.

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

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.8
• /
• pp.534-546
• /
• 2009

Query by humming is an effective and intuitive querying mechanism when a user wants to find a song without knowing lyrics. The query by humming system takes a user-hummed melody as input, compares it with melodies in a music database, and returns top-k similar melodies to the input. In this paper, we propose a novel algebra for query by humming, and design and implement a real query by humming system called HummingBase by exploiting the algebra. By analyzing existing similarity search techniques, we derive 10 core operators for the algebra. By using the well-defined algebra, we can easily implement such a system in a extensible and modular way. With two case studies, we show that the proposed algebra can easily represent the query processing processes of existing query-by-humming systems.

• East Asian mathematical journal
• /
• v.15 no.1
• /
• pp.11-17
• /
• 1999

• Kyungpook Mathematical Journal
• /
• v.29 no.2
• /
• pp.115-123
• /
• 1989

• Communications of Mathematical Education
• /
• v.19 no.4 s.24
• /
• pp.599-620
• /
• 2005

There can be two different approaches to introducing Abstract Algebra to undergraduate students: One is to introduce group concept prior to ring concept, and the other is to do the other way around. Although the former is almost conventional, it is worth while to take the latter into consideration in the viewpoint that students are already familiar to rings of integers and polynomials. In this paper, we investigated 16 most commonly used Abstract Algebra undergraduate textbooks and found that 5 of them introduce ring theory prior to group theory while the rest do the other way around. In addition, we interviewed several undergraduate students who already have taken an Abstract Algebra course to look into which approach they prefer. Then we compare pros and cons of two approaches on the basis of the results of the interview and the historico-genetic principle of teaching and learning in Abstract Algebra and suggest that it certainly be one of alternatives to introduce ring theory before group theory in its standpoint.

• Honam Mathematical Journal
• /
• v.32 no.2
• /
• pp.255-260
• /
• 2010

Given vectors x and y in a separable complex Hilbert space $\mathcal{H}$, an interpolating operator is a bounded operator A such that Ax = y. In this article, we investigate compact interpolation problems for vectors in a tridiagonal algebra. We show the following : Let Alg$\mathcal{L}$ be a tridiagonal algebra on a separable complex Hilbert space $\mathcal{H}$ and let x = $(x_i)$ and y = $(y_i)$ be vectors in H. Then the following are equivalent: (1) There exists a compact operator A = $(a_{ij})$ in Alg$\mathcal{L}$ such that Ax = y. (2) There is a sequence ${{\alpha}_n}$ in $\mathbb{C}$ such that ${{\alpha}_n}$ converges to zero and for all k ${\in}$ $\mathbb{N}$, $y_1 = {\alpha}_1x_1 + {\alpha}_2x_2$ $y_{2k} = {\alpha}_{4k-1}x_{2k}$ $y_{2k+1}={\alpha}_{4k}x_{2k}+{\alpha}_{4k+1}x_{2k+1}+{\alpha}_{4k+2}+x_{2k+2}$.

• Journal of Advanced Navigation Technology
• /
• v.15 no.5
• /
• pp.781-788
• /
• 2011

A sphere-packing problem is to find an arrangement of the spheres to fill as large area of the given space as possible, and covering problems are optimization problems which are dual problems to the packing problems. We generalize the concepts of the weight and the Hamming distance for a binary code to those of Boolean algebra. In this paper, we define a weight and a distance on a Boolean algebra and research some properties of the weight and the distance. Also, we prove the notions of the sphere-packing bound and the Gilbert-Varshamov bound on Boolean algebra.