• 한국수학교육학회지시리즈C:초등수학교육
• /
• 제7권2호
• /
• pp.85-99
• /
• 2003

In this paper, firstly examined various proofs types that cover informal empirical justifications by Balacheff, Miyazaki, and Harel ＆ Sowder and Tall. Using these theoretical frameworks, justification activities by 5th graders were analyzed and several conclusions were drawn as follow: 1) Children in 5th grade could justify using various proofs types and method ranged from external proofs schemes by Harel & Sowder to thought experiment by Balacheff This implies that children in elementary school can justify various mathematical statements of ideas for themselves. To improve children's proving abilities, rich experience for justifying should be provided. 2) Activities that make conjectures from cases then justify should be given to students in order to develop a sense of necessity of formal proof. 3) Children have to understand the meaning and usage of mathematical symbol to advance to formal deductive proofs. 4) New theoretical framework is needed to be established to provide a framework for research on elementary school children's justification activities. Research on proof mainly focused on the type of proof in terms of reasoning and activities involved. But proof types are also influenced by the tasks given. In elementary school, tasks that require physical activities or examples are provided. To develop students'various proof types, tasks that require various justification methods should be provided. 5) Children's justification type were influenced not only by development level but also by the concept they had. 6) Justification activities provide useful situation that assess students'mathematical understanding. 7) Teachers understanding toward role of proof(verification, explanation, communication, discovery, systematization) should be the starting point of proof activities.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제22권4호
• /
• pp.471-487
• /
• 2008

본 연구에서는 해석학 강좌를 운영하는 과정에서 얻어진 학생들의 수학적 발명의 사례를 제시하고 분석하여, 수학적 발명과 관련된 구체적인 교수-학습 과정, 얻어진 수학적 산출물들, 이들의 수학적 의의를 기술하였다.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제43권4호
• /
• pp.381-390
• /
• 2004

In this study, we conceptualized the ‘preformal proof’, which is a transitive level of proof from the experimental and inductive justification to the formalized mathematical proof. We investigated concrete features of the preformal proof in the historico-genetic and the didactical situations. The preformal proof can get the generality of the contents of proof, which makes a distinction from the experimental proof. And we can draw a distinction between the preformal and formal proof, in point that the preformal proof heads for the reality-oriented objects and does not use the formal language.

• 논리연구
• /
• 제20권1호
• /
• pp.97-112
• /
• 2017

컴퓨터를 이용한 수학적 증명의 정형화는 현대수학의 중요한 연구도구로 활용되고 있다. 본 논문에서는 정형증명에 대한 프레게의 영향을 살펴본다. 이를 위해 자유변항과 구속변항을 정형증명에서 다룰 때 발생하는 문제를 설명한 후, 프레게의 Begriffsschrift에서 언급된 아이디어를 이용하여 변항을 정형적으로 다룰 수 있는 해결책을 소개한다.

• Journal of applied mathematics & informatics
• /
• 제5권3호
• /
• pp.771-784
• /
• 1998

In this paper we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutest ex-actly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets at O(e.n) {where e,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.

• 철학연구
• /
• 제141권
• /
• pp.1-42
• /
• 2017

본 논문은 데카르트의 "성찰"(Meditations)을 중심으로 신 존재증명을 논증한다. 데카르트의 신 존재증명 방식은 공식적으로 전통적인 신앙이 아니라 넌크리스천을 위해 기하학적 방식으로 이성에 호소하였다는 점을 분석적 방식(대부분 Georges Dicker의 방식)을 사용해서 밝힐 것이다. 그의 신 존재 논증은 "성찰 III"에 나타난 첫 번째, 두 번째 증명과 "성찰 V"의 세 번째 증명이다. 데카르트는 "성찰 III"에서 신의 관념은 내 안에 있지만 그 관념의 원인자는 신이며(첫 번째 논증), 이에 근거하여 신의 관념을 가지고 있는 사유하는 자아의 존재를 신만이 원인자(두 번째 논증)라는 우주론적 논증(Cosmological argument)을 제시한다. 이를 위해 그는 먼저 관념들을 형상적 실재성(formal reality)과는 다른 표상적 실재성(representative reality)의 차등에 따라 위계가 정해진다는 것을 진술하고, 이 실재성의 차등이 결과와 원인으로 동일하게 적용되어 최초의 관념인 신에게로 나아가며 나의 존재의 원인(나는 누구로부터 나왔는가?)도 신이 될 수밖에 없다는 것을 논증한다. 세 번째 논증인 존재론적 논증(Ontological argument)에서 필자는 최고의 완전한 존재자인 신이 모양이나 수를 증명하는 것과 수학의 확실성 못지않게 신의 존재(완전성)가 그의 본질에 포함되어 있다는 사실이 명석 판명하다는 데카르트의 논증을 살핀다. 이를 통해 필자는 그의 신 존재 증명의 의도와 의의가 신은 회의의 대상이 될 수 없는 '나는 생각한다 그러므로 존재한다'(cogito ergo sum)를 보증하는 것 즉, 이성을 만족시키고 충족시킬 수 있는 것은 신의 존재 밖에 없었기 때문에 신이 요구되었으며, 인간 이성의 명석 판명한 지각이 참된 인식일 수 있다는 것을 보증해주는 궁극적 근거의 확보였다는 것을 고찰할 것이다. 더 나아가 그의 증명이 전통적인 노선(안셀무스, 토마스 아퀴나스)에 있었지만 그럼에도 불구하고 신 존재증명은 전통과는 다른 의미의 증명이며 전적으로 다른 의미의 신존재였다(Jean-Luc Marion)는 것을 비판적으로 검토할 것이다.

• 대한수학교육학회지:수학교육학연구
• /
• 제9권1호
• /
• pp.245-261
• /
• 1999

Proof is an essential characteristic of mathematics and as such should be a key component in mathematics education. But, teaching proof in school mathematics have been unsuccessful for many students. The traditional approach to proofs stresses formal logic and rigorous proof. Thus, most students have difficulties of the concept of proof and students' experiences with proof do not seem meaningful to them. However, different views of proof were asserted in the reassessment of the foundations of mathematics and the nature of mathematical truth. These different views of justification need to be reflected in demonstrative geometry classes. The purpose of this study is to characterize the types of students' justification in demonstrative geometry classes taught using dynamic software. The types of justification can be organized into three categories : empirical justification, deductive justification, and authoritarian justification. Empirical justification are based on evidence from examples, whereas deductive justification are based logical reasoning. If we assume that a strong understanding of demonstrative geometry is shown when empirical justification and deductive justification coexist and benefit from each other, then students' justification should not only some empirical basis but also use chains of deductive reasoning. Thus, interaction between empirical and deductive justification is important. Dynamic geometry software can be used to design the approach to justification that can be successful in moving students toward meaningful justification of ideas. Interactive geometry software can connect visual and empirical justification to higher levels of geometric justification with logical arguments in formal proof.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.581-586
• /
• 2003

This paper presents control designs using neural networks (NN) for a XY positioning table. The proposed neurocontroller is composed of an outer PD tracking loop for stabilization of the fast flexible-mode dynamics and an NN inner loop used to compensate for the system nonlinearities. A tuning algorithm is given for the NN weights, so that the NN compensation scheme becomes adaptive, guaranteeing small tracking errors and bounded weight estimates. Formal nonlinear stability proofs are given to show that the tracking error is small. The proposed neuro-controller is implemented and tested on an IBM PC-based XY positioning table, and is applicable to many precision XY tables. The algorithm, simulation, and experimental results are described. The experimental results are shown to be superior to those of conventional control.

• 전자공학회논문지
• /
• 제50권4호
• /
• pp.191-202
• /
• 2013

이동로봇의 역학 제어기와 퍼지 데드존 보상기가 결합된 제어구조를 제안한다. 데드존 보상이 적응적이고 추적오차와 파라미터 추정치가 유계가 되는 퍼지논리 파라미터 동조알고리듬과 안정도 증명을 제시한다. 퍼지논리 데드존 보상기를 이동로봇에 시뮬레이션 및 실험함으로써 데드존의 해로운 영향을 줄이는 효과를 보여준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권6호
• /
• pp.3254-3272
• /
• 2017

With the development of wireless access technologies and the popularity of mobile intelligent terminals, cloud computing is expected to expand to mobile environments. Attribute-based encryption, widely applied in cloud computing, incurs massive computational cost during the encryption and decryption phases. The computational cost grows with the complexity of the access policy. This disadvantage becomes more serious for mobile devices because they have limited resources. To address this problem, we present an efficient verifiable outsourced scheme based on the bilinear group of prime order. The scheme is called the verifiable outsourced computation ciphertext-policy attribute-based encryption scheme (VOC-CP-ABE), and it provides a way to outsource intensive computing tasks during encryption and decryption phases to CSP without revealing the private information and leaves only marginal computation to the user. At the same time, the outsourced computation can be verified by two hash functions. Then, the formal security proofs of its (selective) CPA security and verifiability are provided. Finally, we discuss the performance of the proposed scheme with comparisons to several related works.