• 제목/요약/키워드: Algorithmic stage

검색결과 16건 처리시간 0.03초

직관적 수준에서 초등학생들의 수학 문제해결 과정 분석 (An Analysis on the Elementary Students' Problem Solving Process in the Intuitive Stages)

  • 이대현
    • 한국학교수학회논문집
    • /
    • 제18권3호
    • /
    • pp.241-258
    • /
    • 2015
  • 본 연구의 목적은 직관적 수준에서 초등학생들의 수학 문제해결 과정을 분석하는 것이다. 이를 위해 수와 연산, 도형 및 측정 영역을 대상으로, 알고리즘에 의한 해결에서부터 직관적 판단에 의해 해결이 가능한 8문제로 구성된 검사 도구를 제작하여 조사연구를 실시하였다. 직관적 수준에 따른 결과 분석에서는 본 연구에서 설정한 분석틀을 따랐다. 분석 결과, 직관적 수준에서 해결 가능한 문제에 대한 정답률이 전반적으로 낮게 나타났다. 내용 영역별로 살펴보면, 수와 연산 영역에서는 알고리즘 수준에 의한 정답률이 높았지만, 도형 및 측정 영역에서는 직관적 수준에 의한 정답률이 높았다. 결과 분석을 통해 알고리즘 적용에 필요한 요소가 문제에 제시되지 않은 경우에 학생들은 문제 구조에 대한 통찰을 통해 답을 하려는 경향을 가지고 있다는 것을 알 수 있었다. 이에 통찰을 통해 직관적으로 해결할 수 있는 다양한 문제의 개발과 직관적 원리에 의한 교육 방안을 마련할 필요성을 제기하였다.

물질의 입자성과 문제 해결 전략을 강조한 컴퓨터 보조 수업이 고등학생들의 화학 학습에 미치는 효과 (The Influences of Computer-Assisted Instruction Emphasizing the Particulate Nature of Matter and Problem-Solving Strategy on High School Students' Learning in Chemistry)

  • 노태희;김창민;차정호;전경문
    • 한국과학교육학회지
    • /
    • 제18권3호
    • /
    • pp.337-345
    • /
    • 1998
  • 본 연구에서는 CAl가 고등학생들의 개념 이해도, 수리문제 해결능력, 학습 동기, 그리고 화학에 대한 태도에 미치는 효과를 조사하였다. CAl 프로그램은 물질의 동적인 입자성을 강조하기 위해 애니메이션을 사용하여 분자 운동을 제시하였고, 이해-계획-풀이-검토의 4단계 문제 해결 전략에 대하여 학습자의 반응 유형에 따라 각 단체별로 즉각적인 피드백을 주도록 구성하였다. 서울시에 소재한 여자 고등학교 두 반을 선택하여 기체 법칙에 대하여 4차시 동안 CAl와 전통적 수업을 실시하였다. 분석 결과 화학 개념 검사, 화학 수리문제 해결능력 검사에서 CAl 집단 학생들의 검사 점수가 통제 집단에 비해 유의미하게 높았다. 또한, CAl 집단 학생들의 학습 동기 및 화학 수업에 대한 태도가 통제 집단 학생들에 비해 유의미하게 향상되었다.

  • PDF

소프트웨어 개발팀 규모 추정 모델 (A Model for Estimation Software Development Team Size)

  • 이상운
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제29권12호
    • /
    • pp.873-882
    • /
    • 2002
  • 소프트웨어 개발 초기에 개발비용, 소요인력과 기간을 추정하는 것은 소프트웨어공학 분야에서 어렵고도 중요한 문제이다. 이 정보들은 소프트웨어 요구사항 명세서로부터 측정된 소프트웨어 규모인 기능점수를 이용하여 추정한다. 측정된 소프트웨어 규모를 개발하기 위해서는 개발팀을 몇 명으로 구성할 것인가가 문제로 제기된다. 본 논문은 소프트웨어 개발팀의 규모를 추정할 수 있는 모델을 제시한다. 모델을 유도하기 위해 301개 소프트웨어 프로젝트들이 사용되었다. 먼저, 통계적 알고리즘 모델인 회귀모델을 연구하였다. 다양한 데이타 변환과 회귀분석 결과 좋은 성능의 모델을 얻지 못하였다. 따라서, 비알고리즘 모델인 RBF망을 적용하여 잔차가 랜덤하게 분포하고 우수한 성능을 가진 모델을 제안하였다. 본 모델은 소프트웨어 개발에 필요한 개발팀 규모에 대한 기준을 제공함으로써 인력관리 정보로 활용할 수 있다.

비전공자를 위한 알고리즘씽킹 기반 소프트웨어 기초교육 설계 (Design of Algorithm Thinking-Based Software Basic Education for Nonmajors)

  • 박소현
    • 산경연구논집
    • /
    • 제10권11호
    • /
    • pp.71-80
    • /
    • 2019
  • Purpose: The purpose of this study is to design the curriculum of Basic College Software Programming to develop creative and logical-thinking. This course is guided by algorithmic thinking and logical thinking that can be solved by computing for problem-solving, and it helps to develop by software through basic programming education. Through the stage of problem analysis, abstraction, algorithm, data structure, and algorithm implementation, the curriculum is designed to help learners experience algorithm problem-solving in various areas to develop diffusion thinking. For Learners aim to achieve the balanced development of divergent and convergent-thinking needed in their creative problem-solving skills. Research design, data and methodology: This study is to design a basic software education for improving algorithm-thinking for non-major. The curriculum designed in this paper is necessary to non-majors students who have completed the 'Creative Thinking and Coding Course' Design Thinking based are targeted. For this, contents were extracted through advanced research analysis at home and abroad, and experts in computer education, computer engineering, SW education, and education were surveyed in the form of quasi-openness. Results: In this study, based on ADD Thinking's algorithm thinking, we divided the unit college majors into five groups so that students of each major could accomplish the goal of "the ability to internalize their own ideas into computing," and extracted and designed different content areas, content elements and sub-components from each group. Through three expert surveys, we established a strategy for characterization by demand analysis and major/textbook category and verified the appropriateness of the design direction to ensure that the subjects and contents of the curriculum are appropriate for each family in order to improve algorithm-thinking. Conclusions: This study helps develop software by enhancing the ability of students who practice various subjects and exercises to explore creative expressions in various areas, such as 'how to think like a computer' that can implement and execute their ideas in computing. And it helps increase the ability to think logical and algorithmic computing based on creative solutions, improving problem-solving ability based on computing thinking and fundamental understanding of computer coding and development of logical thinking ability through programming.

Problems of Teaching Pupils of Non-Specialized Classes to Program and Ways to Overcome Them: Local Study

  • Rudenko, Yuliya;Drushlyak, Marina;Osmuk, Nataliia;Shvets, Olha
    • International Journal of Computer Science & Network Security
    • /
    • 제22권1호
    • /
    • pp.105-112
    • /
    • 2022
  • The development and spread of IT-technologies has raised interest in teaching programming pupils. The article deals with problems related to programming and ways to overcome them. The importance of programming skills is emphasized, as this process promotes the formation of algorithmic thinking of pupils. The authors determined the level of pupils' interest to programing learning depending on the age. The analysis has showed that the natural interest of younger pupils in programming is decreasing over the years and in the most productive period of its study is minimized. It is revealed that senior school pupils are characterized by low level of interest in the study of programming; lack of motivation; the presence of psychological blocks on their own abilities in the context of programming; law level of computer science understanding. To overcome these problems, we conducted the second stage of the experiment, which was based on a change in the approach to programing learning, which involved pupils of non-specialized classes of senior school (experimental group). During the study of programming, special attention was paid to the motivational and psychological component, as well as the use of game technologies and teamwork of pupils. The results of the pedagogical experiment on studying the effectiveness of teaching programming for pupils of nonspecialized classes are presented. Improvement of the results provided the use of social and cognitive motives; application of verbal and non-verbal, external and internal means; communicative attacks; stimulation and psychological setting; game techniques, independent work and reflection, teamwork. The positive effect of the implemented methods is shown by the results verified by the methods of mathematical statistics in the experimental and control groups of pupils.

Optimal synthesis for retrofitting heat exchanger network

  • Lee, In-Beum;Jung, Jae-Hak;Chang, Kun-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
    • /
    • pp.1259-1264
    • /
    • 1990
  • During the past two decades, a lot of researches have been done on the synthesis of grassroot heat exchanger networks(HEN). However, few have been dedicated to retrofit of existing heat exchanger networks, which usually use more amount of utilities (i.e. steam and/or cooling water) than the minimum requirements. This excess gives motivation of trades-off between energy saving and rearranging investment. In this paper, an algorithmic-evolutionary synthesis procedure for retrofitting heat exchanger networks is proposed. It consists of two stages. First, after the amount of maximum energy recovery(MER) is computed, a grass-root network featuring minimum number of units(MNU) is synthesized. In this stage, a systematic procedure of synthesizing MNU networks is presented. It is based upon the concept of pinch, from which networks are synthesized in a logical way by the heuristics verified by the pinch technology. In the second stage, since an initial feasible network is synthesized based on the pre-analysis result of MER and must-matches, an assignment problem between new and existing units is solved to minimize total required additional areas. After the existing units are assigned, the network can be improved by switching some units. For this purpose, an improvement problem is formulated and solved to utilize the areas of existing units as much as possible. An example is used to demonstrate the effectiveness of the proposed method.

  • PDF

인공지능 알고리즘은 사람을 차별하는가? (Does Artificial Intelligence Algorithm Discriminate Certain Groups of Humans?)

  • 오요한;홍성욱
    • 과학기술학연구
    • /
    • 제18권3호
    • /
    • pp.153-216
    • /
    • 2018
  • 빅데이터에 근거하여 자동적인 의사결정을 내리는 알고리즘이 사회의 각종 영역에서 점차 널리 사용되고 있는 저변에는 알고리즘의 의사결정이 사회의 자원을 보다 효율적으로 분배하리라는 기대 뿐만 아니라 그 결정이 선입견, 편향, 자의적 판단 등이 개입될 수 있는 인간의 의사결정보다 더 공정한 결과를 낳으리라는 희망 또한 자리잡고 있다. 하지만 알고리즘 의사결정이 그 결정에 의해 영향 받는 이들을 공정하게 다루지 않는다는 주장이 여러 사례와 함께 거듭 제기되면서, 의사결정이 어떻게 절차화되었는지, 또한 특정한 의사결정을 공정하다고 판단하는 데에 어떤 요인이 고려되는지에 대한 근본적인 질문들이 새롭게 제기되고 있다. 본 논문은 사법, 치안, 국가 안보의 세 가지 알고리즘 활용 영역에서 차별의 문제가 제기되는 상황을 구체적으로 분석한 연구들을 검토함으로써, 인공지능 알고리즘이 과연 특정 집단의 인간을 차별하는지, 그리고 공정한 의사결정을 분별하는 기준은 무엇인지 살펴보고자 한다. 본격적인 검토에 앞서 데이터 마이닝 각 단계에서 의도적으로 그리고 비의도적으로 편향적인 결과가 산출될 수 있는 원인에는 무엇이 있는지를 살필 것이다. 결론에서는 이러한 이론적이고 실질적인 검토가 현대 한국 사회에 시사하는 바가 무엇인지 간추려 제시할 것이다.

통합 공급사슬 최적화 모델에 관한 연구 (Integrated Supply Chain Optimization Models)

  • 최경현;이현지;곽호만
    • 산업공학
    • /
    • 제13권3호
    • /
    • pp.320-327
    • /
    • 2000
  • In this research report, we consider multi stage supply chain optimization modeling techniques, and propose a new integrated model. The stages that are normally associated with a supply chain include procurement, production and distribution. In general, there are two distinct set of approaches which manage whole supply chain. One approach is the plant decision and subsequently distribution and inventory decision while the second approach is to address all decisions simultaneously through the integrated model. First, we present a survey of existing models that are treated by independently. And then, we propose an integrated model that is in a moderate size and easy to implement in practice. Finally, we address possible solution methodologies and present some computational test results using CPLEX to see the computational burden from which new algorithmic insight might be come up.

  • PDF

Clinical Approach to Children with Proteinuria

  • Jang, Kyung Mi;Cho, Min Hyun
    • Childhood Kidney Diseases
    • /
    • 제21권2호
    • /
    • pp.53-60
    • /
    • 2017
  • Proteinuria is common in pediatric and adolescent patients. Proteinuria is defined as urinary protein excretion at levels higher than $100-150mg/m^2/day$ in children. It can be indicative of normal or benign conditions as well as numerous types of severe underlying renal or systemic disease. The school urine screening program has been conducted in Korea since 1998. Since then, numerous patients with normal or benign proteinuria as well as early stage renal diseases have been referred to the hospital. Benign proteinuria includes orthostatic proteinuria and transient proteinuria. Most causes of proteinuria can be categorized into 3 types: 1) overflow, 2) tubular, and 3) glomerular. Although treatment should be directed at the underlying cause of the proteinuria, prompt evaluation, diagnosis, and long-term monitoring of these pediatric patients can prevent potential progression of the underlying disease process. This article provides an overview of proteinuria: its causes, methods of assessment, and algorithmic suggestions to differentiate benign from pathologic renal disease.

Classification of Diagnostic Information and Analysis Methods for Weaknesses in C/C++ Programs

  • Han, Kyungsook;Lee, Damho;Pyo, Changwoo
    • 한국컴퓨터정보학회논문지
    • /
    • 제22권3호
    • /
    • pp.81-88
    • /
    • 2017
  • In this paper, we classified the weaknesses of C/C++ programs listed in CWE based on the diagnostic information produced at each stage of program compilation. Our classification identifies which stages should be responsible for analyzing the weaknesses. We also present algorithmic frameworks for detecting typical weaknesses belonging to the classes to demonstrate validness of our scheme. For the weaknesses that cannot be analyzed by using the diagnostic information, we separated them as a group that are often detectable by the analyses that simulate program execution, for instance, symbolic execution and abstract interpretation. We expect that classification of weaknesses, and diagnostic information accordingly, would contribute to systematic development of static analyzers that minimizes false positives and negatives.