• School Mathematics
• /
• v.19 no.1
• /
• pp.59-75
• /
• 2017

This study analyzed the $6^{th}$ graders' constructions about fraction operations and schemes and figured out the relationships quantitatively between operations and schemes through the written test of 432 students. The results of this study showed that most of students could do partitioning operation well, however, there were many students who had difficulties on iterating operation. There were more students who constructed partitioning operation prior to iterating operation than the opposite. The rate of students who constructed high schemes was lower than that of students who constructed low schemes according to the hierarchy of fraction schemes. Especially, there were many students who construct partitive unit fraction scheme but not partitive fraction scheme, because they could compose unit fraction but not do iterating it. And there were the high correlations between fraction operations and schemes. Given these result, this paper suggests implications about the teaching and learning of fraction.

• Journal of Elementary Mathematics Education in Korea
• /
• v.23 no.3
• /
• pp.323-345
• /
• 2019

This study examines the introduction of fractions in the third grade mathematics textbooks focusing on stages of units coordination and suggests alternative activities to help students develop their understanding of fractions. As results, the sessions of introduction units in textbooks was well organized to allow students to construct more extensive fraction schemes (i.e., Part-whole fraction scheme → Partitive unit fraction scheme → Partitive fraction scheme). However, most of the activities in textbooks were related to stages 1 and 2 of units coordination. In particular, the operations and partitioning schemes (i.e., equi-partitioning and splitting schemes), which are key to the development of students' fraction knowledge, were not explicitly revealed. Fraction schemes also did not extend to the Iterative fraction scheme, which is central to the construction of improper fractions. Based on these results, this study is expected to provide implications for the introduction of fractions in textbooks focusing on stages of units coordination to teachers and textbook developers.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.9-16
• /
• 2012

In this paper, we focus on end-to-end transfer delay improvement by using network coding and propose a scheme where a message is divided into several packets which are network coded generating additional redundancy with the results that the number of transmitted packets increases. In networks with high coefficient of variation of transfer time, increased number of packets could reduce the transfer time of the message to a destination. For the proposed scheme, we investigate the optimum number of divided packets and redundancy considering transfer delay reduction and additional transmission cost caused by using network coding under the restriction of maximum transmission packet size. From the results of the investigation, we see that the proposed scheme is effective in networks having high variability of transfer time and would be very useful and practical especially for the case that expedited deliveries of messages are needed.

• School Mathematics
• /
• v.12 no.3
• /
• pp.411-424
• /
• 2010

The fractional concept consists of various meaning, so that it is difficult to understand in primary school mathematics. In this article, we intend to analyze the cognition of 54 pre-service elementary teachers about the operations of partitioning and iterating that are based on Steffe's fraction schemes. The following fraction problem is used in this analysis: If the bar $\Box$ represent 3/8, then create a bar that is equivalent to 4/3. In our analysis, the 43% of pre-service elementary teachers can be well to treat the operations of partitioning and iteration. The 33% are use the equivalent fractions. But the 19% is not good. From the our analysis, it is important that pre-service elementary teachers must be have experimental(operational) thinking as the science education. And in this study we apply the operations of partitioning and iterating to the fraction activity of textbooks.

• Journal of IKEEE
• /
• v.6 no.1 s.10
• /
• pp.80-86
• /
• 2002

This paper presents a fast hardware architecture to implement a 2-D DWT(Discrete Wavelet Transform) computed by lifting scheme framework. The conventional 2-D DWT hardware architecture has problem in internal memory, hardware resource, and latency. The proposed architecture was based on the 4-way partitioned data set. This architecture is configured with a pipelining parallel architecture for 4-way partitioning method. Due to the use of this architecture, total latency was improved by 50%, and memory size was reduced by using lifting scheme.

• ETRI Journal
• /
• v.9 no.3
• /
• pp.43-54
• /
• 1987

주어진 릴레이션 스킴(relation scheme)을 이에 관련된 함수적 종속(functional dependency)들을 가지고 분해하여 Boyce-Codd 정규형(Boyce-Codd normal form)에 속하는 릴레이션 스키머(schema)로 정규화(normalization)시키는 기존의 분해 알고리즘(decomposition algorithm)은 구현해서 사용하기에 적합하지 못하다. 본 고에서는 기존의 알고리즘 구현시 발생하는 문제점을 분석하고 이런 문제점을 해결하는 방법을 제시하며, 이를 토대로 Boyce-Codd 정규형 릴레이션 스킴을 생성하는 새로운 알고리즘을 제시하고, 이 알고리즘을 UNIX 환경하에 C 언어로 구현한 후 임의의 자료를 수행하여 얻어진 릴레이션 스키머와 기존의 알고리즘에 의해 얻어진 릴레이션 스키머를 비교분석하였다.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.397-408
• /
• 2003

Existing indexing mechanisms of XML data using numbering scheme have a drawback of rebuilding the entire index structure when insertion, deletion, and update occurs on the data. We propose a new indexing mechanism based on split blocks to cope with this problem. The XML data are split into blocks, where there exists at most a relationship between two blocks, and numbering scheme is applied to each block. This mechanism reduces the overhead of rebuilding index structures when insertion, deletion, and update occurs on the data. We also propose two algorithms, Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm which retrieve the relationship between two entities in the XML hierarchy using this indexing mechanism. We also propose a mechanism in which the identifier of a block has the information of its Parents' block to expedite retrieval process of the ancestor-descendent relationship and also propose two algorithms. Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm using this indexing mechanism.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.7
• /
• pp.518-525
• /
• 2003

In this paper, we present a fast hardware architecture to implement a parallel 2-dimensional discrete wavelet transform(DWT)based on the lifting scheme DWT framework. The conventional 2-D DWT had a long initial and total latencies to get the final 2D transformed coefficients because the DWT used an entire input data set for the transformation and transformed sequentially The proposed architecture increased the parallel performance at computing the row directional transform using new data splitting method. And, we used the hardware resource sharing architecture for improving the total throughput of 2D DWT. Finally, we proposed a scheduling of hardware resource which is optimized to the proposed hardware architecture and splitting method. Due to the use of the proposed architecture, the parallel computing efficiency is increased. This architecture shows the initial and total latencies are improved by 50% and 66%.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.3
• /
• pp.31-42
• /
• 2005

We consider a network storage model whose administrator can not be fully trusted. In this model, we assume that all data stored are encrypted for data confidentiality and one owner distributes the decryption key for each time period to users. In this paper, we propose three privilege management schemes. In the first scheme, called Temporal Privilege Management (TPM), we use a symmetric encryption based on one-way function chains for key encapsulation. In the second scheme, called Asymmetric Temporal Privilege Management (ATPM), anyone can encrypt the data using the public key of owner, but only privileged users can decrypt the encrypted data. Finally, we present a scheme to restrict writers' privilege using ID-based signatures in ATPM. In our schemes, the privilege managements are based on the time and the addition of users is efficient. Specially, applying TPM and ATPM, we can solve the back-issue problem.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.2
• /
• pp.21-28
• /
• 2001

As a result of the recent explosive growth of scientific data, extremely large volume datasets have become increasingly commonplace. While several texture-based volume rendering algorithms have been proposed, most of them focused on volumes smaller than the hardware's available texture memory. This paper presents a new parallel volume rendering scheme for very large static and time-varying data on a multipipe system architecture. Our scheme subdivides large volumes dynamically into smaller bricks, and assigns them adaptively to graphics pipes to minimize the costs of texture swapping. With the new method, Phong shaded images can be easily created by computing the gradients on the fly and using the color matrix feature of OpenGL. We report experimental results on an SGI Onyx2 for the various large datasets.