• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.5
• /
• pp.459-464
• /
• 2010

Computer programs are required from all areas in society including machine, space, aviation, and medicine. However, the programming curriculum is getting hard despite a lot of teaching materials and video lessons. Programming languages are very diverse, but most of them use the same structure, and they only have different expression methods. Therefore, if one learns one programming language, then it doesn't need to spend a lot of time and efforts to learn another programming langue. Most programming languages use the structure of sequence, selection, and repletion in general. The important thing for programming learners is the structure or algorithm of programming not the grammar of program. This study designed and implemented the language learning system to learn structured programming by using a flowchart.

• Journal of The Korean Association of Information Education
• /
• v.14 no.1
• /
• pp.123-130
• /
• 2010

In this paper, we introduce a new programming learning system for young students. The programming learning system consists of a LED display kit and a web-based flowchart system. The LED display kit acts as an output device by way of displaying lights while following a set of instructions given through a flowchart programming. In the flowchart system, the students use symbolic variables for the calculation and can get various displays or animations after creating a flowchart by drag-and-drop. Then we describe the survey results of various programming classes using our system between fall 2005 and spring 2009. The programming teaching was conducted with diverse groups such as elementary school students, gifted students, college students, and teachers etc. The responses from our in class surveys were generally positive.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.1087-1091
• /
• 2009

The concept for algorithm needs to be established in various fields such as architecture, medicine and life science but understanding only theoretically has its limits. It is therefore educated using many multimedia factors but still is difficult to bring interests and carry out the higher level courses. For algorithm and programming, due to the subject's peculiarity it is very important to actually execute the program to understand the realization theory. In this paper, it aims to design a basic concept of algorithm using a flow chart of visualizing program and an algorithm education system to learn the basic programming C language, which is the fundamental element in algorithm learning.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.10a
• /
• pp.588-592
• /
• 1993

본 연구에서는 로봇의 교시, 궤적계획, 충돌, 로봇동작, 제어알고리즘 등의 평가에 유용하게 사용할 수 있는 다기능 오프라인 프로그래밍 시스템인 POLPS(Pusan_national_university's Off-Line Programming System) 를 개발하였다. POLPS은 4축 스카라형 FARA 로봇을 대상으로 개발되었고, 편리한 방법으로 교시작업을 수행할 수 있으며, 교시 내용에 따라 궤적계획을 수행한 후 로봇을 동작시켜 충돌을 회피하는 동적 시뮬레이션을 수행할 수 있다. 제안된 여러 제어알고리즘 중에서 주어진 작업에 적합한 제어알고리즘을 효율적으로 선정하기 위한 성능의 비교와 평가 기능을 갖추고 있는 것이 주요한 특징이다. 또한 시각위치변경, 온선. 온면제거 및 음영처리, 고속 애니메이션, 환경구성, 인터프리터 명령어 등의 다양한 기능으로 편리하게 사용할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.27-30
• /
• 2005

3개 이상의 DNA 혹은 단백질의 염기서열을 정렬하는 다중 서열 정렬(multiple sequence alignment, MSA)은 서열들 사이의 진화관계, 단백질의 구조와 기능에 관한 연구에 필수적인 도구이다. 최적화된 다중서열 정렬을 얻기 위해 사용되는 가장 유용한 방법은 동적 프로그래밍이다. 그러나 동적프로그래밍은 정렬하고자 하는 서열의 수가 증가함에 따라 시간도 지수함수($O(n^k)$)로 증가하기 때문에 다중 서열 정렬에는 효율적이지 못하다. 따라서, 본 논문에서는 최적의 MSA 문제를 해결하기 위해 클러스터링 기반의 새로운 다중 서열 정렬 (Clustering-based Multiple Sequence Alignment, CMSA) 알고리즘을 제안한다. 결과적으로 제안한 CMSA 알고리즘의 기여도는 다중 서열 정렬의 질적 향상과 처리 시간 단축($O(n^3L^2)$)이 기대된다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.69-70
• /
• 2018

본 논문은 홀로그램 기술개발에서 사용되는 다양한 광학적 계산이나 알고리즘 구현에 필요한 컴퓨터 프로그래밍 라이브러리를 위해 개발되는 홀로그래피 오픈소스 라이브러리(오픈홀로)에 대한 소개이다. 오픈홀로는 오픈 소스로서 소스코드 공개의 의무가 없고, 상업적 제한이 전혀 없는 BSD 라이센스 정책을 따른다. 이러한 Openholo의 주목적은, 홀로그램 전문가뿐만 아니라, 초보자나 일반인들도 이를 활용하여 홀로그램의 광학적 특성을 시뮬레이션하거나, 홀로그래픽 콘텐츠를 제작할 수 있도록, 관련된 알고리즘과 광학적 수치 계산을 위한 프로그래밍 라이브러리를 오픈 소스화 하는 것이다.

• Journal of KIISE:Software and Applications
• /
• v.37 no.9
• /
• pp.694-705
• /
• 2010

The mutation operation is the main operation in the evolutionary programming which has been widely used for the optimization of real valued function. In general, the mutation operation utilizes both a probability distribution and its parameter to change values of variables, and the parameter itself is subject to its own mutation operation which requires other parameters. However, since the optimal values of the parameters entirely depend on a given problem, it is rather hard to find an optimal combination of values of parameters when there are many parameters in a problem. To solve this shortcoming at least partly, if not entirely, in this paper, we propose a new mutation operation in which the parameter for the variable mutation is theoretically estimated from the self-adaptive perspective. Since the proposed algorithm estimates the scale parameter of the Cauchy probability distribution for the mutation operation, it has an advantage in that it does not require another mutation operation for the scale parameter. The proposed algorithm was tested against the benchmarking problems. It turned out that, although the relative superiority of the proposed algorithm from the optimal value perspective depended on benchmarking problems, the proposed algorithm outperformed for all benchmarking problems from the perspective of the computational time.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.673-680
• /
• 2002

This paper proposes a method for detecting edge using an evolutionary programming and a momentum back-propagation algorithm. The evolutionary programming does not perform crossover operation as to consider reduction of capability of algorithm and calculation cost, but uses selection operator and mutation operator. The momentum back-propagation algorithm uses assistant to weight of learning step when weight is changed at learning step. Because learning rate o is settled as less in last back-propagation algorithm the momentum back-propagation algorithm discard the problem that learning is slow as relative reduction because change rate of weight at each learning step. The method using EP-MBP is batter than GA-BP method in both learning time and detection rate and showed the decreasing learning time and effective edge detection, in consequence.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.159-171
• /
• 2009

The objective of this research is to explore a method to utilize a programmable robot, as a potential learning tool in the elementary school's curricula. Due to their programmability and operational ease of use, programmable robots are among digital toys that today offer specially instructive features. In this research, we developed the robot game-based project contents as a tool for teaching the elementary school children to learn the algorithm, the essential part of computer programming. The LEGO material, selected as the construction kit for robot, consists of a mechanical assembly system, a set of sensors and actuators, a central control unit, a programming environment. The project requires the children to complete 3 separate tasks, each of which is developed based on the principles of algorithm. The classroom feedback supports that the robotic experiences provided the children with fun and absorption. It is likely that implementing learning with robot in regular classroom in elementary school can bring new possibilities to the educational system, provided that a thorough preparation backs up the plan.

• The Journal of Korean Association of Computer Education
• /
• v.22 no.3
• /
• pp.55-65
• /
• 2019

In programming language learning system of flip learning methods, the evaluation of cyber lectures generally proceeds from online to multiple choice questions. In this case, the questions are randomly extracted from the question bank and given to individual learners. In order for these evaluation results to be reflected in the grades, the equity of the examination question is more important than anything else. Especially in the programming language subject, the degree of difficulty that learners think can be different depending on the type of problem. In this paper, we classify the types of multiple-choice problems into two categories, and manage the difficulty level by each type. And we propose a question selection algorithm that considers both difficulty level and type of question. Considering the characteristics of the programming language, experimental results show that the proposed algorithm is more efficient and fair than the conventional method.