• Title/Summary/Keyword: 유추적 부호화

Search Result 7, Processing Time 0.017 seconds

The Influence of Structural Highlighting Conditions on Analogical Problem Solving (부호화와 인출시의 구조적 강조가 아동의 유추문제해결에 미치는 영향)

  • Kim, Min Hwa;Choi, Kyoung Sook
    • Korean Journal of Child Studies
    • /
    • v.23 no.5
    • /
    • pp.1-17
    • /
    • 2002
  • The influence on children's analogical problem solving of structural highlighting during encoding and retrieval of sources was studied with 379 9-year-old participants. Performance on the first 2 of 4 tests determined the analogical level of each child. For the remaining 2 tests, the child was assigned to 1 of 12 different structural highlighting conditions, including 4 encoding conditions (reading, line, self-line, and self-explain) and 3 retrieval conditions (reminding, cued, and thematic comparison). Results showed that retrieval conditions, not encoding conditions, improved the analogical ability of the child. Children initially low in analogical ability improved in cued retrieval conditions; children initially high in analogical ability improved both in thematically compared and in cued retrieval conditions. Practical implications of the results were discussed.

  • PDF

A Case Study on Teaching Solutions Exploration of Wythoff's Game through Using the Analogy for the Elementary Gifted Class (초등학교 영재학급에서 유추를 활용한 위도프 게임의 해법 탐구 지도 방법)

  • Bae, Sin Young;Song, Sang Hun
    • Journal of Educational Research in Mathematics
    • /
    • v.25 no.1
    • /
    • pp.95-111
    • /
    • 2015
  • The purpose of this study is to analyze cases on teaching solutions exploration of Wythoff's game through using the analogy for the gifted elementary students, to suggest useful teaching methods. Students recognized structural similarity among problems on the basis of relevance of conditions of problems. The discovery of structural similarity improves the ability to solve problems. Although 2 groups-NIM game with surface similarity is not helpful in solving Wythoff's game, Queen's move game with structural similarity makes it easier for students to solve Wythoff's game. Useful teaching methods to find solutions of Wythoff's game through using the analogy are as follow. Encoding process helps students make sense of the game. It is significant to help students realize how many stones are remained and how the location of Queen can be expressed by the ordered pair. Inferring process helps students find a solution of 2 groups-NIM game and Queen's move game. It is necessary to find a winning strategy through reversely solving method. Mapping process helps students discover surface similarity and structural similarity through identifying commonalities between the two games. It is crucial to recognize the relationship among the two games based on the teaching in the Encoding process. Application process encourages students to find a solution of Wythoff's game. It is more important to find a solution by using the structural similarity of the Queen's move game rather than reversely solving method.

Expected problems for storytelling mathematics education and some suggestions (스토리텔링 수학수업의 예상되는 문제점과 해결방법의 모색)

  • Kim, Yon Mi
    • The Mathematical Education
    • /
    • v.52 no.4
    • /
    • pp.497-516
    • /
    • 2013
  • Inspite of many strengthens of storytelling mathematics education, some problems are expected: when math is taught in concrete contexts, students may have trouble to extract concepts, to transfer to noble and abstract contexts, and they may experience inert knowledge problem. Low achieving students are particularly prone to these issues. To solve these problems some suggestions are made by the author. These are analogous encoding and progressive formalism. Using analogous encoding method students can construct concepts and schema more easily and transfer knowledge which shares structural similarity. Progressive formalism is an effective way of introducing concepts progressively moving from concrete contexts to abstract context.

A Entropy Coding Method using Temporal and Spatial Correlation on HEVC (HEVC에서 시공간적 상관관계를 이용한 엔트로피 부호화 방법)

  • Kim, Tae-Ryong;Kim, Kyung-Yong;Lee, Han-Soo;Park, Gwang-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.17 no.1
    • /
    • pp.191-194
    • /
    • 2012
  • The split flag and the skip flag in CU syntax have high correlation on spatial domain as well as temporal domain. This paper suggests a method for enhancing coding efficiency by using not only spatial correlation but also temporal correlation when coding CU information. In the CABAC case, temporal collocated CU information is used for selecting context model of the split flag and the skip flag. In the CAVLC case, current CU information is estimated from temporal collocated CU information then encoded. As a result, a coding efficiency was increased by 0.1%~0.6% in CABAC, 0.1%~0.4% in CAVLC compared with HM 3.0. This method shows better performance on lowdelay condition which uses reference frame close to current frame.

A Modified Gaussian Model-based Low Complexity Pre-processing Algorithm for H.264 Video Coding Standard (H.264 동영상 표준 부호화 방식을 위한 변형된 가우시안 모델 기반의 저 계산량 전처리 필터)

  • Song, Won-Seon;Hong, Min-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.2C
    • /
    • pp.41-48
    • /
    • 2005
  • In this paper, we present a low complexity modified Gaussian model based pre-processing filter to improve the performance of H.264 compressed video. Video sequence captured by general imaging system represents the degraded version due to the additive noise which decreases coding efficiency and results in unpleasant coding artifacts due to higher frequency components. By incorporating local statistics and quantization parameter into filtering process, the spurious noise is significantly attenuated and coding efficiency is improved for given quantization step size. In addition, in order to reduce the complexity of the pre-processing filter, the simplified local statistics and quantization parameter are introduced. The simulation results show the capability of the proposed algorithm.

Goal-Directed Learning and Memory (목표지향적 학습과 기억)

  • Shin, Yeon Soon;Han, Sanghoon
    • Science of Emotion and Sensibility
    • /
    • v.16 no.3
    • /
    • pp.319-332
    • /
    • 2013
  • Previous research on learning and memory has focused on how they are constructed through past experiences. Recent studies, however, have shed light on that such cognitive processes are in service of higher goals of maximizing future rewards. This review paper aims to introduce and discuss a related line of research. First, this paper introduces researches that show goal-directed model-based reinforcement learning, in which agents choose a behavior that does not necessarily bring immediate rewards but will allow future rewards, based on generalization and analogical extrapolation. It also reviews studies on neural substrates of goal-directed learning, and discusses that cognitive process implicated in striatal dopaminergic signals can also influence memory. Especially, memory is not a merely passive process of storing and retrieving past experiences homogeneously, but rather results of a decision-making process to serve higher goals. The body of research suggests that information on future rewards can have influence on current cognitive processing in a retrospective manner.

  • PDF

Fast Motion Estimation Algorithm via Minimum Error for Each Step (단계별 최소에러를 통한 고속 움직임 예측 알고리즘)

  • Kim, Jong Nam
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.8
    • /
    • pp.1531-1536
    • /
    • 2016
  • In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to its tremendous computational amount of for full search algorithm, efforts for reducing computations in motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate at once to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors. By doing that, we can estimate the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as full search.