• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.6
• /
• pp.542-547
• /
• 2000

진화프로그래밍(Evolutionary Programming : EP)은 최적화 문제에 있어서 매우 유용한 기법으로 자연선택의 원리를 모방한 탐색알고리즘이다. EP는 기존의 최적화 알고리즘에 비하여 여러해를 동시에 탐색하는 전역탐색(global search)방법이므로 국부수렴(local convergence)의 가능성이 줄어들고, 최적화 파라메터 영역의 연속성과 미분치의 존재성과 같은 조건이 필요 없는 장점을 갖는다. 이러한 장점에도 불구하고, EP의 탐색영역이 초기조건 및 최적화 파라메터들의 랜덤 생성 그리고 최적화에 필요한 전략적 파라메터들에 의하여 탐색 영역이 결정되고, 수렴성이 느린 단점을 갖는다. 이러한 문제를 해결하기 위하여, 본 연구에서는 빠른 수렴성과 다양성을 갖는 개선된 EP을 제안하고, 제안된 방향성 벡터를 갖는 개선된 EP를 함수 최적화 문제에 적용하여 그 성능의 유용성을 보이고자 한다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.10
• /
• pp.337-342
• /
• 2015

We develop a new parallelization method for Sieve of Eratosthenes algorithm, which enhances both computation speed and energy efficiency. A pipeline scheduling is included for better load balancing after proper workload partitioning. They run on multicore CPUs with hybrid parallel programming model which uses both message passing and multithreading computation. Experimental results performed on both small scale clusters and a PC with a mobile processor show significant improvement in execution time and energy consumptions.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.141-144
• /
• 2011

최근 이기종 멀티프로세서 시스템에서의 병렬화를 위해 범용 CPU 와 다른 컴퓨팅 장치들간의 다양한 연동 기술들이 부각되고 있다. 멀티프로세서 프로그래밍 모델인 OpenMP 는 가장 널리 사용되는 병렬 프로그래밍 언어이지만 기존 OpenMP 의 작업 할당 정책으로는 프로세서간 로드밸런싱을 문제를 해결할 수 없다는 한계점을 가지고 있다. 본 논문에서는 기존 OpenMP 의 작업할당 문제를 해결할 수 있는 알고리즘을 제안한다. 제안하는 알고리즘은 SMP(Symmetric Multi Processing) 구조뿐만 아니라 AMP(명령어 구조는 같으나 동작 속도가 다른 이질 멀티프로세서 구조)에서도 작업부하균형을 효과적으로 실행할 수 있다.

• Journal of The Korean Association of Information Education
• /
• v.24 no.1
• /
• pp.11-19
• /
• 2020

Software education is provided for 6th grade students. This study explored the algorithmic composition patterns of elementary school students. After investigating the algorithm for the 6th grade students, the algorithmic pattern of the learner was explored by calculating the cyclomatic complexity of MacCabe based on the structural programming technique. Students often use one or two choice structures to solve problems, which tend to be biased towards the starting and ending points of the problem. It is also passive in the use of selection structures. Algorithm composition depends on visible objects and one's own background. Therefore, in elementary school software education, it is necessary to present the task of thinking about the algorithm structure in the context of the algorithm and the students' experiences in accordance with the algorithm composition pattern.

• Broadcasting and Media Magazine
• /
• v.19 no.3
• /
• pp.65-75
• /
• 2014

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.378-387
• /
• 2006

A programming model for ubiquitous sensor network (USN) applications based on Nano-Qplus is proposed. USN applications mean programs of nodes which are components of sensor network such as sensor, router, sink and actuator. Developers can automatically generate programs of USN applications by setting attributes values of nodes using a script after they model a sensor network. A script for setting attributes values of a node is proposed in this paper. The algorithm of automatic code generation is also described. Developers can easily implement USN applications even if they do not know details of low-level communication, data sharing, and collective operations because the applications are automatically generated from a script. They set only attributes values of nodes using the script. Efforts for USN applications development also are reduced because of automatic code generation. Furthermore, developers can correct errors of applications in the early stage of development through ear]y test based on rapid code generation.

• The Journal of Korean Association of Computer Education
• /
• v.15 no.2
• /
• pp.1-8
• /
• 2012

General form of the programing education is finding and realizing algorithm to solve problems faster and more efficiently. In other words, it is based on convergent thinking. However, the programming education must have different characteristics to education targets. For elementary school students, it is needed to provide various experience-centered investigation environments. They should learn how to find the most efficient problem solving method by themselves. This study had adopted divergent thinking strategy where divergent thinking and convergent thinking can be repeated at the same time to suit a programming education with great importance of convergent thinking to elementary school leaners, and analyzed its effects. This study was applied to 5th graders, and 12 times of experimental measure classes were conducted by dividing them into the control group that conducted general programming class and the experimental group that conducted a programming class including divergent thinking of CPS model. As a result, CPS model had significant effect on the subordinate elements of creative problem solving skills, self-assurance, independence, and divergent thinking.

• Journal of The Korean Association of Information Education
• /
• v.13 no.1
• /
• pp.69-76
• /
• 2009

This paper proposes a teaching plan of programming language class for university of education students amusingly with LEGO Mindstorms NXT robot. The goal of class is not fragmentary knowledge acquirement but problem-solving of maze. This robot communicates with GUI named NXT-G installed in computer via USB. GUI is not text-based but icon-based programming tool. This paper designs a semester with 3 steps such as beginner, intermediate, high-rank. Beginner step is consists of learning of basic functions such as GUI usage and several sensors of robot. Intermediate step is consists of solving of maze problem with low complexity. High-rank step is consists of solving maze problem with medium and high complexity. All maze problem-solving have 3 process with algorithm, flowchart, and programming with stack.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.134-139
• /
• 2022

Recently, interest in programming and artificial intelligence is continuously increasing, and software education is being implemented as a mandatory education from elementary school. For efficient programming education, it is basically necessary to build a lab environment suitable for students and teachers, but there are performance problems due to the inadequacy of old computers and network equipment. Therefore, in this paper, we propose a web page-based online practice environment and algorithm competition scoring system using React and Spring boot to solve the problem of the programming practice environment. Through this, it is thought that programming learning can be carried out using only a web browser even on low-spec computers. In addition, since various programming languages can be learned irrespective of the language to be learned, it is considered that the time cost for establishing a practice environment can be reduced.

• Journal of KIISE:Software and Applications
• /
• v.28 no.1
• /
• pp.46-51
• /
• 2001

2D로 확장한 HMM은 다수 제안되었지만 엄밀한 의미에 있어서 2D HMM이라고 하기에 부족한 점이 많다. 본 논문에서는 기존의 랜덤 필드 모형이 아닌 새로운 2D HMM을 제안한다. 상하 및 좌우 방향의 causal chain 관계를 가정하고 완전한 격자 형성 조건을 두어 2D HMM의 평가, 매개 변수를 추정하는 알고리즘을 제시하였다. 각각의 알고리즘은 동적 프로그래밍과 최우 추정법에 근거한 것이다. 변수 추정 알고리즘은 반복적으로 이루어지며 국소 최적치에 수렴함을 보였다.