• Title/Summary/Keyword: Computer programming

Search Result 2,150, Processing Time 0.032 seconds

Design and Implementation of Educational Contents for ASP Programming Efficiency (ASP 프로그래밍 능력 향상을 위한 교육용 컨텐츠의 설계 및 구현)

  • Jung, Nam-Cheol
    • Journal of the Korea Computer Industry Society
    • /
    • v.6 no.5
    • /
    • pp.791-800
    • /
    • 2005
  • In this work, we developed educational contents for ASP programming efficiency. These contents are applied to the cognitive apprentice model, one of the teaching-learning models based in constructivism. Specifically the functions of these contents are as follows: Learners can learn from the lecturing video made of multimedia, they have practical programming training according to the lecturing video showing illustration executed similar to a practical environment, and they grasp level of their understanding by themselves as doing the assigned tasks. Therefore we can anticipate for learning effects, because the contents that we developed can induce learners to learn by themselves and interest them in programming practice.

  • PDF

Multi-Thread based Synchronization of Locomotion Control in Snake Robots

  • Rai, Laxmisha;Kang, Soon-Ju
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.947-950
    • /
    • 2005
  • In this paper, we present an approach to control the locomotion of snake robot with concurrent programming model constructed using threads and semaphores. The multi-thread based concurrent programming model adds the flexibility to design and synchronize the movement of snake robots as compared with microcontroller and mechanical based approaches. We have designed a physical snake robot using LEGO sensors and actuator blocks and the wave motion of the snake robot is generated by multi-thread based concurrent programming under RT-Linux. The different robot movements in a desired direction along with different types of snake movements are achieved using angle sensors.

  • PDF

FUZZY NUMBER LINEAR PROGRAMMING: A PROBABILISTIC APPROACH (3)

  • maleki, H.R.;Mashinchi, M.
    • Journal of applied mathematics & informatics
    • /
    • v.15 no.1_2
    • /
    • pp.333-341
    • /
    • 2004
  • In the real world there are many linear programming problems where all decision parameters are fuzzy numbers. Several approaches exist which use different ranking functions for solving these problems. Unfortunately when there exist alternative optimal solutions, usually with different fuzzy value of the objective function for these solutions, these methods can not specify a clear approach for choosing a solution. In this paper we propose a method to remove the above shortcoming in solving fuzzy number linear programming problems using the concept of expectation and variance as ranking functions

Static Analysis of AND-parallelism in Logic Programs based on Abstract Interpretation (추상해석법을 이용한 논리언어의 AND-병렬 태스크 추출 기법)

  • Kim, Hiecheol;Lee, Yong-Doo
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 1997.11a
    • /
    • pp.79-89
    • /
    • 1997
  • Logic programming has many advantages as a paradigm for parallel programming because it offers ease of programming while retaining high expressive power due to its declarative semantics. In parallel logic programming, one of the important issues is the compile-time parallelism detection. Static data-dependency analysis has been widely used to gather some information needed for the detection of AND-parallelism. However, the static data-dependency analysis cannot fully detect AND-parallelism because it does not provide some necessary functions such as the propagation of groundness. As an alternative approach, abstract interpretation provides a promising way to deal with AND-parallelism detection, while a full-blown abstract interpretation is not efficient in terms of computation since it inherently employs some complex operations not necessary for gathering the information on AND-parallelism. In this paper, we propose an abstract domain which can provide a precise and efficient way to use the abstract interpretation for the detection of AND-parallelism of logic programs.

  • PDF

A Curriculum for Mobile Programming Education that Includes A Project Completion and It's Implementation Results

  • Ha, Seok-Wun;Huh, Kwang-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.9
    • /
    • pp.139-147
    • /
    • 2016
  • In recent, android application developments have been done widely that intensify smart phone utilization. In this paper, we propose a curriculum that undergraduate students can improve their mobile programming abilities as well as integrate experiences of application development based on android. And also a series of practices to advance their sense of accomplishment are added by offering an opportunity to carry out a real project to use a variety of sensors embedded in smart phone during the course of study. The project is composed of a series of modules for implementing a trekking App that helpful to people who enjoy spending time in outdoors through their favorite activities such as trekking, cycling, and climbing with their own smart phones. Through practical curriculum operation and project implementation, we show that the proposed curriculum is appropriate to a mobile programming education that combine learning and practice.

A Dynamic Programming Approach for Emergency Vehicle Dispatching Problems

  • Choi, Jae Young;Kim, Heung-Kyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.9
    • /
    • pp.91-100
    • /
    • 2016
  • In this research, emergency vehicle dispatching problems faced with in the wake of massive natural disasters are considered. Here, the emergency vehicle dispatching problems can be regarded as a single machine stochastic scheduling problems, where the processing times are independently and identically distributed random variables, are considered. The objective of minimizing the expected number of tardy jobs, with distinct job due dates that are independently and arbitrarily distributed random variables, is dealt with. For these problems, optimal static-list policies can be found by solving corresponding assignment problems. However, for the special cases where due dates are exponentially distributed random variables, using a proposed dynamic programming approach is found to be relatively faster than solving the corresponding assignment problems. This so-called Pivot Dynamic Programming approach exploits necessary optimality conditions derived for ordering the jobs partially.

The University Examination And Course Timetabling Problem With Integer Programming

  • Chung, Yerim;Kim, Hak-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.9
    • /
    • pp.9-20
    • /
    • 2019
  • In this paper, we study the university timetabling problem, which consists of two subproblems, the university course timetabling problem and the examination timetabling problem. Given a set of classrooms, students, teachers, and lectures, the problem is to assign a number of courses (and examinations) to suitable timeslots and classrooms while satisfying the given set of constraints. We discuss the modeling and solution approaches to construct course and examination timetables for one of the largest Korean university. By using binary integer programming formulations, we describe these two complex real-world problems. Then, we propose a solution method, called NOGOOD, to solve the examination timetabling model. The computation results show that NOGOOD finds the optimal examination schedule for the given instance. Although we consider a specific instance of the university timetabling problem, the methods we use can be applicable to modeling and solving other timetabling problems.

A Self-regulated Learning Model Development in Computer Programming Education (컴퓨터 프로그램 교육에서 자기조절 학습 모델 개발)

  • Kim, Kapsu
    • Journal of The Korean Association of Information Education
    • /
    • v.19 no.1
    • /
    • pp.21-30
    • /
    • 2015
  • Information and knowledge society in the 21st century computer education is very important. Computer programming education in computer education is very important. There are very few teaching and learning model of computer programming education. In this paper, we develop a self-regulated learning model for students to be self-regulated learning. In this study, we propose self-regulated learning elements, a self-regulated learning steps and self-regulated learning modele. Self-regulated learning elements are task level, generalized level, and efficiency level. Self-regulated learning phases are problem understanding, design, and coding, testing, and maintenance. Self-regulated learning models are to copy, to modify, create, and to challenge. The results of this study are as follows. At Correlations between learning elements and achievement, generalized level, and efficiency level are higher than the task level. At Correlations between learning and achievement, Understanding and design stages are higher than the other stages. At Correlations between learning model and achievement, to transform, to create, and to challenge are higher than to copy.

A Survey of Genetic Programming and Its Applications

  • Ahvanooey, Milad Taleby;Li, Qianmu;Wu, Ming;Wang, Shuo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.1765-1794
    • /
    • 2019
  • Genetic Programming (GP) is an intelligence technique whereby computer programs are encoded as a set of genes which are evolved utilizing a Genetic Algorithm (GA). In other words, the GP employs novel optimization techniques to modify computer programs; imitating the way humans develop programs by progressively re-writing them for solving problems automatically. Trial programs are frequently altered in the search for obtaining superior solutions due to the base is GA. These are evolutionary search techniques inspired by biological evolution such as mutation, reproduction, natural selection, recombination, and survival of the fittest. The power of GAs is being represented by an advancing range of applications; vector processing, quantum computing, VLSI circuit layout, and so on. But one of the most significant uses of GAs is the automatic generation of programs. Technically, the GP solves problems automatically without having to tell the computer specifically how to process it. To meet this requirement, the GP utilizes GAs to a "population" of trial programs, traditionally encoded in memory as tree-structures. Trial programs are estimated using a "fitness function" and the suited solutions picked for re-evaluation and modification such that this sequence is replicated until a "correct" program is generated. GP has represented its power by modifying a simple program for categorizing news stories, executing optical character recognition, medical signal filters, and for target identification, etc. This paper reviews existing literature regarding the GPs and their applications in different scientific fields and aims to provide an easy understanding of various types of GPs for beginners.

A Study on the Learning Objectives, Instructional Design, and Evaluation Methods in the Software Developing Education (소프트웨어 제작 분야의 성취 목표, 교수학습 방법 및 평가 방법에 관한 연구)

  • Jeong, Young-Sik;Kim, Chul
    • Journal of The Korean Association of Information Education
    • /
    • v.18 no.1
    • /
    • pp.185-193
    • /
    • 2014
  • Software developing education teaches students computer programming, which allows them to actively use IT and talk to computers. In this study, we analyzed computer science curriculum in the United Kingdom, the United States, India, and Estonia. In order to teach 1st - 9th grade students computer programming, we suggested the learning objectives, instructional design, and evaluation methods in software developing education focusing on Information Science. The objectives were divided into four phases, which were determined by age and grade level. Then, we determined 2-3 outcomes for each phase.