• School Mathematics
• /
• v.10 no.2
• /
• pp.155-179
• /
• 2008

Multiplication problems for the 7th curriculum focus on functional realms featuring the memorization and application of the multiplication table, exposing learners only to additive thinking characterized by simple counting and drawing. A diversity of research has yet to be conducted for the transition to multiplicative thinking that highlights the capability to solve problems by using multiplication and division in the expanded number scope like 'prime numbers', 'fractional numbers', and 'ratio/rates' and to describe accurately how they solved. This research was designed to develop and utilize teaching-learning materials for the transition of fifth graders' additive thinking to advanced multiplicative one and to analyze the application results in order to identify validity in material development. The following conclusions were made. First, the development and application of teaching-learning materials for multiplicative thinking cultivation facilitated the transition from additive thinking featuring simple counting and drawing to multiplicative thinking characterized by multiplication and accurate description in a more complicated and expanded number scope. Second, the development of materials featuring 'basic'-'intermediate'-'in-depth' courses by activity enabled learners to benefit from learning by level and expansion in number scope. Third, the use of topics and materials closely connected to daily lives stimulated learners' curiosity, helping them concentrate more on given problems. Fourth, communication between teachers and students or among learners themselves was promoted by continuously encouraging them to explain and by reviewing their documents identifying rules or patterns.

• School Mathematics
• /
• v.10 no.4
• /
• pp.603-623
• /
• 2008

The purpose of this research was to gain a better understanding of the characteristics of students' mathematical representations using additive strategy in ratio and proportion tasks. The additive strategy is the erroneous one used most often among the strategies reported in solving ratio and proportion tasks. It is a problem solving strategy that preserves the difference from one ratio to another. Students' additive strategies were categorized into four parts: subtracting without considering units of quantities, comparing the numbers that represent the whole subtracted from the part and same part, adding the difference, and subtracting the difference. In order to change from additive strategy to multiplicative strategy, the researcher asked to find out the unit quantity and found the characteristics of students' mathematical notations in the following: Firstly, the students made the number which they wanted by multiplying and adding same numbers. Secondly, they represented the mid-points between natural numbers. Thirdly, they related $a{\div}b$ to decimal number, not $\frac{a}{b}$. Fourthly, they were inclined to divide the larger number with the smaller number without understanding the context of the problem. These results are interpreted as showing that lower level of performance in the dividing operation with the notations of fraction hinders the transformation from additive strategy to multiplicative strategy.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.295-298
• /
• 2014

In this paper, an efficient design of HEVC Adaptive Loop Filter(ALF) for filter coefficients estimation is proposed. The ALF performs Cholesky decomposition of $10{\times}10$ matrix iteratively to estimate filter coefficients. The Cholesky decomposition of the ALF consists of root and division operation which is difficult to implement in a hardware design because it needs to many computation rate and processing time due to floating-point unit operation of large values of the Maximum 30bit in a LCU($64{\times}64$). The proposed hardware architecture is implemented by designing a root operation based on Cholesky decomposition by using multiplexer, subtracter and comparator. In addition, The proposed hardware architecture of efficient and low computation rate is implemented by designing a pipeline architecture using characteristic operation steps of Cholesky decomposition. An implemented hardware is designed using Xilinx ISE 14.3 Vertex-6 XC6VCX240T FPGA device and can support a frame rate of 40 4K Ultra HD($4096{\times}2160$) frames per second at maximum operation frequency 150MHz.

• Communications of Mathematical Education
• /
• v.38 no.2
• /
• pp.187-213
• /
• 2024

This study aims to investigate the impact of mathematical journal writing activities on sixth-grade students' mathematics anxiety and the 'writing' aspect of mathematical communication. For this purpose, 27 sixth-grade students participated in 14 sessions of mathematical journal writing activities while learning division with fractions and decimals. Mathematics anxiety was measured using a questionnaire, with pre- and post-test results statistically analyzed. Mathematical communication in the 'writing' domain was quantitatively measured using an analytical framework to track changes in levels. Additionally, 13 students were interviewed to examine the impact of journal writing on mathematics anxiety and mathematical communication in more detail. The study found that among the four main factors of mathematics anxiety, there was a significant reduction in the subject-specific and environmental factors. The average levels of 'expression' and 'explanation' in the 'writing' domain of mathematical communication gradually increased, with specific teacher feedback supporting improvements in students' communication levels. Based on these findings, the study suggests implications for the use and guidance of mathematical journal writing activities in school settings.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.71-76
• /
• 2014

There is to be virtually impossible to solve the very large digits of prime number p and q from composite number n=pq using integer factorization in typical public-key cryptosystems, RSA. When the public key e and the composite number n are known but the private key d remains unknown in an asymmetric-key RSA, message decryption is carried out by first obtaining ${\phi}(n)=(p-1)(q-1)=n+1-(p+q)$ and then using a reverse function of $d=e^{-1}(mod{\phi}(n))$. Integer factorization from n to p,q is most widely used to produce ${\phi}(n)$, which has been regarded as mathematically hard. Among various integer factorization methods, the most popularly used is the congruence of squares of $a^2{\equiv}b^2(mod\;n)$, a=(p+q)/2,b=(q-p)/2 which is more commonly used then n/p=q trial division. Despite the availability of a number of congruence of scares methods, however, many of the RSA numbers remain unfactorable. This paper thus proposes an algorithm that directly and immediately obtains ${\phi}(n)$. The proposed algorithm computes $2^k{\beta}_j{\equiv}2^i(mod\;n)$, $0{\leq}i{\leq}{\gamma}-1$, $k=1,2,{\ldots}$ or $2^k{\beta}_j=2{\beta}_j$ for $2^j{\equiv}{\beta}_j(mod\;n)$, $2^{{\gamma}-1}$ < n < $2^{\gamma}$, $j={\gamma}-1,{\gamma},{\gamma}+1$ to obtain the solution. It has been found to be capable of finding an arbitrarily located ${\phi}(n)$ in a range of $n-10{\lfloor}{\sqrt{n}}{\rfloor}$ < ${\phi}(n){\leq}n-2{\lfloor}{\sqrt{n}}{\rfloor}$ much more efficiently than conventional algorithms.