• The Mathematical Education
• /
• v.51 no.4
• /
• pp.429-453
• /
• 2012

The purpose of the study were to analyze teaching models of arithmetic operations of integers in Korean middle school mathematics textbooks of the first grade and Americans', from which we compare and analyze standards for choice of models of middle school teachers and preservice mathematics teachers. We also analyze the effect of the choice of teaching models for students to understand and appreciate number systems as a coherent body of knowledge. On the basis of that, we would like to find the best model to help students understand and reason the process of formulate the arithmetic operations of natural numbers and integers into the operation of the real number system. Furthermore, we help these series of the study to be applied effectively in the middle school mathematics class in Korea.

• Journal of the Korean School Mathematics Society
• /
• v.11 no.1
• /
• pp.97-115
• /
• 2008

In high school mathematics class, to subtract a number b from a, we add the additive inverse of b to a and to divide a number a by a non-zero number b, we multiply a by the multiplicative inverse of b, which is the formal approach for operations of real numbers. This article aims to give a connection between the intuitive models in middle school mathematics class and the formal approach in high school for teaching operations of negative integers. First, we highlight the teaching methods(Hwang et al, 2008), by which subtraction of integers is denoted by addition of integers. From this methods and activities applying the counting model, we give new teaching methods for the rule that the product of negative integers is positive. The teaching methods with horizontal mathematization(Treffers, 1986; Freudenthal, 1991) of operations of integers, which is based on consistently applying the intuitive model(number line model, counting model), will remove the gap, which is exist in both teachers and students of middle and high school mathematics class. The above discussion is based on students' cognition that the number system in middle and high school and abstracted number system in abstract algebra course is formed by a conceptual structure.

• Journal of Educational Research in Mathematics
• /
• v.8 no.2
• /
• pp.527-540
• /
• 1998

In the teacher's guide of mathematics textbook for the 1st grade of the middle school, the clear and logical reason why the multiplication of negative number to negative number makes positive number, and $a^{-m}$ with a>0 and m>0, is defined by ${\frac{1}{a^m}}$ is not given. When we define the multiplication or the power by successive addition or successive multiplication of the same number, respectively, we encounter this ambiguity, in the case that the number of successive operations is negative, In this paper, we name this number, negative counting number, and we make the following more logical and intuitive definition, which is "negatively many successive operations is defined by positively many successive inverse operations." According to this new definition, we define the multiplication by the successive addition or the successive subtraction of the same number, when the multiplier is positive or negative respectively, and the power by the successive multiplication or the power is positive or negative, respectively. In addition, using this new definition and following the E.R.S Instruction strategy which revised and complemented the Bruner's E.I.S Instruction strategy, we develope new teaching model available in the 1st grade class of middle school where the concept of integers, three operations of integers are introduced.ntroduced.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.9
• /
• pp.1207-1214
• /
• 1995

We present an optimized integer cosine transform(OICT) as an alternative approach to the conventional discrete cosine transform(DCT), and its fast computational algorithm. In the actual implementation of the OICT, we have used the techniques similar to those of the orthogonal integer transform(OIT). The normalization factors are approximated to single one while keeping the reconstruction error at the best tolerable level. By obtaining a single normalization factor, both forward and inverse transform are performed using only the integers. However, there are so many sets of integers that are selected in the above manner, the best OICT matrix obtained through value minimizing the Hibert-Schmidt norm and achieving fast computational algorithm. Using matrix decomposing, a fast algorithm for efficient computation of the order-8 OICT is developed, which is minimized to 20 integer multiplications. This enables us to implement a high performance 2-D DCT processor by replacing the floating point operations by the integer number operations. We have also run the simulation to test the performance of the order-8 OICT with the transform efficiency, maximum reducible bits, and mean square error for the Wiener filter. When the results are compared to those of the DCT and OIT, the OICT has out-performed them all. Furthermore, when the conventional DCT coefficients are reduced to 7-bit as those of the OICT, the resulting reconstructed images were critically impaired losing the orthogonal property of the original DCT. However, the 7-bit OICT maintains a zero mean square reconstruction error.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.6
• /
• pp.49-58
• /
• 1993

Extended reduced difference pyramid (ERDP) is proposed for lossless progressive image transmission, which is based on a new transform called rounded-transform(RT). The RT is a nonlinear and reversible transform of integers into integers utilizing two kinds of the rounding operations such as round up and down. The ERDP can be obtained from an N-poing RT or a series of RTs of both. For the performance evaluation, the entropy of the difference images to be transmitted is used as a lower bound transmission rate. Two examples of the ERDP can be easily shown, which is more effective in the entropy than the ordinary RDP.

• School Mathematics
• /
• v.8 no.1
• /
• pp.1-25
• /
• 2006

To be good at numeration is an important matter in learning mathematics. Unlike the 6-th curriculum, integers are introduced in middle school curriculum for the first time in the 7-th curriculum. Therefore, to help the students team integers systematically and thoroughly, it is necessary that we allow more space for process of introduction, process of operations and practice of operations in the 7-th curriculum text book than that of 6-th curriculum text book. As specific and systemic visualized teaching of operation is especially important in building the concept of operation, by using visualized teaching methods, students can understand the process of operation more fully and systematically. Moreover, students become proficient in operation of positive number and negative numbers by expending this learning process of operations to the operations used absolute value. In 7-th grade mathematics, the expression of positive numbers and negative numbers visually are useful for understanding of operations for numbers. But it is not easy to do so. In this paper we use arrows(directed segments) to express positive numbers and negative numbers visually and apply them to perform the operations for numbers. Using arrows, we can extend the method used in elementary school mathematics to the methods for operations of positive numbers and negative number in 7-th grade mathematics. By experiments, we can know that such processes of introduction for operations are effective and this way helps teachers teach and students learn.

• Kyungpook Mathematical Journal
• /
• v.62 no.2
• /
• pp.289-321
• /
• 2022

The work realized by the authors of [4], [5] and [6] associates a non-negative matrix with positive integers entries to each dissection of a polygon. In the particular case of triangulations, these matrices called ℬ𝒞𝒥-matrices here contain valuable information of their frieze patterns, a concept introduced by Coxeter and Conway. This paper is concerned with the algebraic manipulation and properties of these matrices which are derived from operations acting on dissections.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.49-62
• /
• 1998

In the ring loading problem, traffic demands are given for each pair of nodes in an undirected ring network with n nodes and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the Problem is to minimize the maximum load on the ring. In the ring loading problem with integer demand splitting, each demand can be split between the two directions and the flow routed in each direction is restricted to integers. Recently, Vachani et al. ［INFORMS J. Computing 8 (1996) 235-242］ have developed an Ο(n$^3$) algorithm for solving this integer version of the ring loading problem and independently, Schrijver et al. ［to appear in SIAM J. Disc. Math.］ have presented an algorithm which solves the problem with ｛0,1｝ demands in Ο（n$^2$｜K｜ ) time where K denotes the index set of the origin-desㅇtination pairs of nodes having flow demands. In this paper, we develop an algorithm which solves the problem in Ο(n ｜K｜) time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.762-763
• /
• 2016

In realizing a homomorphic encryption system, the operations of encrypt, decypt, and recrypt constitute major portions. The most important common operation for each back-bone operations include a polynomial modulo multiplication for over million-bit integers, which can be obtained by performing integer Fourier transform, also known as number theoretic transform. In this paper, we adopt and modify an algorithm for calculating big integer multiplications introduced by Schonhage-Strassen to propose an efficient algorithm which can save memory. The proposed architecture of number theoretic transform has been implemented on an FPGA and evaluated.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.32-40
• /
• 2001

In this paper, we propose a high-speed modular multiplication algorithm which revises conventional Montgomery's algorithm. A hardware architecture is also presented to implement 1024-bit RSA cryptosystem for digital signature based on the proposed algorithm. Each iteration in our approach requires only one addition operation for two n-bit integers, while that in Montgomery's requires two addition operations for three n-bit integers. The system which is modelled in VHDL(VHSIC Hardware Description Language) is simulated in functionally through the use of $Synopsys^{TM}$ tools on a Axil-320 workstation, where Altera 10K libraries are used for logic synthesis. For FPGA implementation, timing simulation is also performed through the use of Altera MAX + PLUS II. Experimental results show that the proposed RSA cryptosystem has distinctive features that not only computation speed is faster but also hardware area is drastically reduced compared to conventional approach.