• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제38권1호
• /
• pp.49-67
• /
• 2024

최근 인공지능 언어 모델의 다양한 활용에 대한 관심이 높아지면서 수학교육에서의 교수학적 활용 방안 모색에 대한 필요성이 강조되고 있다. 인공지능 언어 모델은 자연어 처리가 가능하다는 특징으로 인하여 수학 문장제 해결과 관련된 활용이 기대된다. 인공지능 언어 모델 중 하나인 ChatGPT의 성능을 확인하기 위하여 초등학교 교과서에 제시된 문장제를 해결하도록 지시하였으며 풀이 과정 및 오류를 분석하였다. 분석 결과, 인공지능 언어 모델은 81.08%의 정답률을 나타내었으며 문제 이해 오류, 식 수립 오류, 계산 오류 등이 발생하였다. 이러한 문장제 해결 과정 및 오류 유형의 분석을 바탕으로 인공지능 언어 모델의 교수학적 활용 방안과 관련된 시사점을 제안하였다.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제5권1호
• /
• pp.13-24
• /
• 2001

Using computer technology in teaching school mathematics creates new instructional environments. The emphases on the use of computer technology in the classrooms and in particular the use of computer-based exploration as a context of mathematics instruction have been reflected in the recommendation of the NCTM (Curriculum and Evaluation Standards for School Mathematics, 1989). Although the power of using computer technology in the exploration of mathematical problems has been recognized and stressed by many educators, we do not have many research studies on mathematics in computer-based explorations. Especially research has failed to clarify how computer technology can contribute to the construction of procedural and conceptual knowledge of mathematics. Up to now most researches on procedural and conceptual knowledge in computer environments have only focused on classifying programming languages which program language has more random access and rich interrelationship characteristic in relation to conceptual knowledge in humans, and which computer language has more characteristic flavor of procedural knowledge. How computer-based explorations affect the knowledge construction of mathematics, therefore, emerges as an issue of research on teacher education program for theoretical framework. This situation leads to do research on the effectiveness of using computer explorations in pre-service teacher education in terms of procedural and conceptual knowledge construction.

• Journal of applied mathematics & informatics
• /
• 제9권2호
• /
• pp.645-655
• /
• 2002

In this Paper we consider non-deterministic finite Rabin-Scott's automata. We define special abstract objects, being pairs of values of states-marking functions. On the basis of these objects as the states of automaton, we define its edges; the obtained structure is considered also as a non-deterministic automaton. We prove, that any edge of any non-deterministic automaton defining the given regular language can be obtained by such techniques. Such structure can be used for solving various problems in the frames of finite automata theory.

• Journal of applied mathematics & informatics
• /
• 제20권1_2호
• /
• pp.181-195
• /
• 2006

Resource-constrained project scheduling problems with variant processes can be represented and solved using a logic-based terminological language called RSV (resource constrained project scheduling with variant processes). We consider three different variants for formalizing the RSV-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the RSV- problem is NP-complete. Further we show that the optimizing variant (or number variant) of the RSV-problem is computable in polynomial time iff. the decision variant is computable in polynomial time.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제23권4호
• /
• pp.1131-1148
• /
• 2009

이 논문에서는 대학에서 컴퓨터를 사용한 고급단계수학강좌의 방안 연구로서, ISETL 프로그램을 소개하고 그것을 활용한 대수학 강좌 방향을 모색하고자 한다.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제45권2호
• /
• pp.177-189
• /
• 2006

This study focuses on the analysis of prospective elementary teachers' representation of trapezoid area and teacher educator's reflecting in the context of a mathematics course. In this study, I use my own teaching and classroom of prospective elementary teachers as the site for investigation. 1 examine the ways in which my own pedagogical content knowledge as a teacher educator influence and influenced by my work with students. Data for the study is provided by audiotape of class proceeding. Episode describes the ways in which the mathematics was presented with respect to the development and use of representation, and centers around trapezoid area. The episode deals with my gaining a deeper understanding of different types of representations-symbolic, visual, and language. In conclusion, I present two major finding of this study. First, Each representation influences mutually. Prospective elementary teachers reasoned visual representation from symbolic and language. And converse is true. Second, Teacher educator should be prepared proper mathematical language through teaching and learning with his students.

• 한국수학교육학회지시리즈C:초등수학교육
• /
• 제21권2호
• /
• pp.193-208
• /
• 2018

분류하기는 초등학교 수학, 과학, 국어, 통합교과의 교육과정에서 학습해야 할 주요 기능으로 제시하고 있으며, 수학과에서는 수집한 자료를 정리하고 해석하기 위한 기초 과정으로서 별도의 단원에서 지도되고 있다. 이에 여러 교과에서 분류하기를 지도하는 방안을 살펴보고 이를 수학과의 맥락에서 어떻게 지도할 수 있는지에 대해 살펴보았다. 그 결과, 직관적으로 떠올릴 수 있는 기준 이외에 상세한 관찰, 조사활동과 연계하여 다양한 분류 기준을 찾을 필요가 있으며, 분류의 상황 및 목적을 고려하여 지도할 필요가 있었다. 또한 교과 공통의 핵심개념, 탐구기능을 중심으로 한 교과 연계 융합수업의 활성화 방안에 대해서도 시사점을 제공하였다.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.135-150
• /
• 2002

The present paper discusses non-deterministic finite Rabin-scott's automate. The majority of works recently dealing with this subject were, in fact, concerned only with properties of a canonical term automata or of some objects equivalent to it. This article continues the series of works in which the authors state a different point of view, describing the finite automata as just another invariant of the given regular language called basis finite automaton. In this article the authors argue on some new properties for the basis finite automaton. One of them is included into basis automaton's table of binary relations. It is stated that this table can not contain either identical strings or identical columns. Another property depicts a possibility to obtain any finite automaton for a given regular language by the process of duplicating or combining some of its states.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제29권1호
• /
• pp.93-102
• /
• 2022

The impact of programming languages in the research sector has helped lot of researchers to broaden their view and extend their work without any limitation. More importantly, even the complex problems can be solved in no matter of time while converting them into a programming language. This convenience provides upper hand for the researchers as it places them in a comfort zone where they can work without much stress. With this context, we have converted the research problems in Topology into programming language with the help of Python. In this paper, we have developed a Python program to find the weaker form of closed sets namely alpha closed set, semi closed set, pre closed set, beta closed set and regular closed set.

• 충청수학회지
• /
• 제7권1호
• /
• pp.13-23
• /
• 1994

In this paper, we consider the higher-order type theoretic language L and construct a type model D of complete partial ordered set. We show that the complete partial ordered set for the language L gives rise to a category and generates a topos.