• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제6권1호
• /
• pp.29-38
• /
• 2002

The purpose of this paper was to examine early numerical representations between American and Korean children. Fifty-five first graders (35 Korean and 20 American) participated in the study. According to the findings of the current study, the author concluded that the Korean children had a stronger conception of base ten representations of numbers than that of the American children. The Korean children used various strategic reasoning such as decomposition and recomposition on the basis of base 10 structure to solve addition and subtraction problems effectively. However, the author cannot conclude that language differences would be the largest factor that would make Korean children sapient in the representations of base ten structures.

• 경영과학
• /
• 제12권1호
• /
• pp.139-156
• /
• 1995

This study addresses basic requirements for mathematical programming software, discusses considerations in designing these software, implementation issues facing in these types of applications development, and shows some examples of codes being developed in the course. This type of projects requires long and ever-changing evolutionary phases. The experience is therefore, valuaable in suggesting some useful hints which may be salvaged for similar projects as well as providing reusable codes. In particular, scanning and parsing the free-format inputs, symbol table management, mixed-language programming, and data structures dealing with large sparse matrices are indispensable to many management science software development. Extensions to be made are also discussed.

• 대한수학회논문집
• /
• 제11권3호
• /
• pp.575-584
• /
• 1996

We investigate how the code automorphism groups can be used to study such combinatorial objects as codes, finite projective planes and Hadamard matrices. For this purpose, we write down a computer program for computing code automorphisms in PASCAL language. Then we study the combinatorial properties using those code automorphism group algorithms and the relationship between combinatorial objects and codes.

• 한국수학사학회지
• /
• 제10권2호
• /
• pp.11-23
• /
• 1997

Category theory gives a convenient language for the study of mathematical structures besides its own study. In this paper, we investigate how the abstract structure theory emerged in 1930s affects the study in Topology and eventually becomes a rudiment for the category theory. Moreover, various extensions and universal mapping problems were put in their proper perspective as reflections by the category theory and by its duality principle, coreflections become an interesting subject in Topology, both of which give rise to a new discipline of the categorical topology.

• 대한수학회보
• /
• 제59권1호
• /
• pp.179-190
• /
• 2022

A cascade of toric log del Pezzo surfaces of Picard number one was introduced as a language of classifying all such surfaces. In this paper, we introduce a generalized concept, a semicascade of toric log del Pezzo surfaces. As applications, we discuss Kähler-Einstein toric log del Pezzo surfaces and derive a bound on the Picard number in terms of the number of singular points, generalizing some results of Dais and Suyama.

• 한국콘텐츠학회논문지
• /
• 제8권5호
• /
• pp.268-275
• /
• 2008

학습자간의 협력 작업은 교육용 저작 시스템의 효율성을 결정짓는 중요한 요소 중의 하나이다. 기존의 저작 시스템에서도 다양한 저작 기능이 채용되고 있지만 초보자들이 동료 학습자로부터 도움을 받거나 저작과 학습을 병행하는 것에는 관심이 부족하다. 이에 따라 본 연구에서는 수학적 언어와 학습자간 협력 작업을 이용한 수학교과용 언어기반 저작도구를 설계 및 개발하고, 그 타당성을 검증하였다. 본 연구는 언어기반 저작을 통한 자료 제작의 편리성, 수학적 언어 적용에 따른 저작과 학습의 병행, 네트워크 협력 작업을 통한 학습자간 공조를 주된 내용으로 하고 있다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2024년도 춘계학술발표대회
• /
• pp.830-833
• /
• 2024

As Large Language Models (LLM) like OpenAI's ChatGPT[1] continue to grow in popularity, new applications and services are expected to emerge. This paper introduces an experimental study on a smart web-builder application assistance system that combines Computer Vision with GUI object recognition and the ChatGPT (LLM). First of all, the research strategy employed computer vision technology in conjunction with Microsoft's "ChatGPT for Robotics: Design Principles and Model Abilities"[2] design strategy. Additionally, this research explores the capabilities of Large Language Model like ChatGPT in various application design tasks, specifically in assisting with web-builder tasks. The study examines the ability of ChatGPT to synthesize code through both directed prompts and free-form conversation strategies. The researchers also explored ChatGPT's ability to perform various tasks within the builder domain, including functions and closure loop inferences, basic logical and mathematical reasoning. Overall, this research proposes an efficient way to perform various application system tasks by combining natural language commands with computer vision technology and LLM (ChatGPT). This approach allows for user interaction through natural language commands while building applications.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제19권4호
• /
• pp.571-575
• /
• 2005

We would like to celebrate the birth of a journal on college mathematics education. We make wishes and hopes on the way of the growth and developments of the journal. We especially emphasize that the journal may provide the streams of knowledges from scholars to students for better accomplishments of college mathematics educations and the development and prosperity of our country, and a storage bank for our own (mathematical) knowledges for the creation of Korea's own mathematical traditions. Best wishes for the journal.

• 대한수학회보
• /
• 제55권6호
• /
• pp.1667-1690
• /
• 2018

We consider the minimum order of a graph G with a given lazy cop number $c_L(G)$. Sullivan, Townsend and Werzanski [7] showed that the minimum order of a connected graph with lazy cop number 3 is 9 and $k_3{\square}k_3$ is the unique graph on nine vertices which requires three lazy cops. They conjectured that for a graph G on n vertices with ${\Delta}(G){\geq}n-k^2$, $c_L(G){\leq}k$. We proved that the conjecture is true for k = 4. Furthermore, we showed that the Petersen graph is the unique connected graph G on 10 vertices with ${\Delta}(G){\leq}3$ having lazy cop number 3 and the minimum order of a connected graph with lazy cop number 4 is 16.

• 한국수학사학회지
• /
• 제22권3호
• /
• pp.45-60
• /
• 2009

수학적 사고는 외적 기호에 의해 기호화되고, 역으로 이 기호는 사고의 형태를 결정한다. 기호는 - 대수학에서의 기호, 해석학에서의 기호 그리고 삼단논법을 검증해주는 다이어그램 - 수학연구에서 수행하는 사고 작용의 다양성을 반영하고 각각 발견법적 기능을 수행한다.