• Title/Summary/Keyword: Example-based programming

Search Result 146, Processing Time 0.024 seconds

Development of Example-based NXC Robot Programming Support System (예제 중심의 NXC 기반 로봇 프로그래밍 지원 시스템 개발)

  • Yoo, In-Hwan
    • Journal of The Korean Association of Information Education
    • /
    • v.16 no.2
    • /
    • pp.265-273
    • /
    • 2012
  • Current computer education is moving its focus from using oriented education to improving students' creativity and problem solving ability by computer science education. Robot programming education is becoming a major research issue of computer education in the context of creativity education. One of the mainstream ideas of prior research about robot programming is the effect of robot programming. Another is curriculum development of robot programming. But, the focus of current research is moving toward teaching methods of robot programming. The theme of this research is to use examples in robot programming. Example programs are considered the most useful type of material both by the students and the teachers. Example programs play a important role in learning to program. They work as templates, guidelines, and hints for learners when developing their own programs. In this study, I developed a example-based robot programming support system. Due to the trends of smart learning, I developed this system as a mobile web application.

  • PDF

Solving A Quadratic Fractional Integer Programming Problem Using Linearization

  • Gaur, Anuradha;Arora, S.R.
    • Management Science and Financial Engineering
    • /
    • v.14 no.2
    • /
    • pp.25-44
    • /
    • 2008
  • This paper concentrates on reduction of a Quadratic Fractional Integer Programming Problem (QFIP) to a 0-1 Mixed Linear Programming Problem (0-1 MLP). The solution technique is based on converting the integer variables to binary variables and then the resulting Quadratic Fractional 0-1 Programming Problem is linearized to a 0-1 Mixed Linear Programming problem. It is illustrated with the help of a numerical example and is solved using the LINDO software.

The Impacts of Examples On the Learning Process of Programming Languages (예제가 프로그래밍 언어의 학습과정에 미치는 영향)

  • 김진수;김진우
    • Korean Journal of Cognitive Science
    • /
    • v.11 no.2
    • /
    • pp.19-35
    • /
    • 2000
  • Learning by examples has proven to be an efficient method in mastering various subjects including programming languages. This study hypothesizes that the number of examples and the type of examples are two significant dimensions that influence the performance of learning programming languages by examples. A set of experiments was conducted to investigate the impacts of the two dimensions in the domain of JAVA programming. The results showed that providing two examples is more effective than providing only one example even though significantly more explanations are attached to the single example. Among the 'two-example' groups, the group that was given functionally similar examples performed better than those with functionally dissimilar examples. Explanations for these results are provided in this paper based on the behavioral patterns of individual subjects in terms of time and frequency. This paper concludes with the implications of the study results for the development of effective tutoring systems for programming languages.

  • PDF

Quadratic Complementary Programming

  • Gupta, A.K.;Sharma, J.K.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.7 no.1
    • /
    • pp.45-50
    • /
    • 1982
  • The present paper provides a method for solving a complementary programming problem with quadratic objective function subject to linear constraints. The procedure developed is based on the simplex method for quadratic programming problem. An example is added to illustrate the procedure.

  • PDF

An Application of Dynamic Programming to the Selection of Optimal Production Lengths Based on the Minimum Cutting Loss (최소절단손실(最小切斷損失)에 의한 최적생산(最適生産)길이의 선정(選定)에 대한 동적계획법응용(動的計劃法應用))

  • Jo, Gyu-Gap
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.4 no.2
    • /
    • pp.77-81
    • /
    • 1978
  • The assortment problem with deterministic demand has been formulated so that a dynamic programming can be applied to find optimal production lengths that will minimize the sum of cutting losses. The original minimization problem can be reformulated as the maximization problem with a different objective function. This problem can be solved by the dynamic programming technique. A numerical example illustrates this approach. The ratio of computation amount of emumeration method to that of this dynamic programming is approximately n to 1.

  • PDF

Optimal Inspection Policy By Fuzzy Goal Programming (Fuzzy Goal Programming을 이용한 최적 검사 정책)

  • 유정상
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.18 no.34
    • /
    • pp.185-191
    • /
    • 1995
  • In this research, a mathematical programming model is developed for the economic modeling of sampling plans based on two evaluation criteria : the outgoing quality and the average total inspection cost A fuzzy goal programming model and its solution procedure are proposed for the managers whose management objectives on the two evaluation criteria are not rigorous. To study the sensitivity of quality characteristic dependence on the resulting inspection plans, a numerical example is solved several times for a dependent model.

  • PDF

Fuzzy Preference Based Interactive Fuzzy Physical Programming and Its Application in Multi-objective Optimization

  • Zhang Xu;Huang Hong-Zhong;Yu Lanfeng
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.6
    • /
    • pp.731-737
    • /
    • 2006
  • Interactive Fuzzy Physical Programming (IFPP) developed in this paper is a new efficient multi-objective optimization method, which retains the advantages of physical programming while considering the fuzziness of the designer's preferences. The fuzzy preference function is introduced based on the model of linear physical programming, which is used to guide the search for improved solutions by interactive decision analysis. The example of multi-objective optimization design of the spindle of internal grinder demonstrates that the improved preference conforms to the subjective desires of the designer.

Design of a Rule Based Controller using Genetic Programming and Its Application to Fuzzy Logic Controller (유전 프로그래밍을 이용한 규칙 기반 제어기의 설계와 퍼지로직 제어기로의 응용)

  • 정일권;이주장
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.5
    • /
    • pp.624-629
    • /
    • 1998
  • Evolutionary computation techniques can solve search problems using simulated evolution based on the ‘survival of the fittest’. Recently, the genetic programming (GP) which evolves computer programs using the genetic algorithm was introduced. In this paper, the genetic programming technique is used in order to design a rule based controller consisting of condition-action rules for an unknown system. No a priori knowledge about the structure of the controller is needed. Representation of a solution, functions and terminals in GP are analyzed, and a method of constructing a fuzzy logic controller using the obtained rule based controller is described. A simulation example using a nonlinear system shows the validity and efficiency of the proposed method.

  • PDF

PCB 생산라인에서의 호이스트 스케쥴링을 위한 유전자알고리즘의 응용

  • 임준묵
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.1 no.1
    • /
    • pp.29-62
    • /
    • 1996
  • In this paper, the problem of determining cyclic schedules for a material handling hoist in the printed-circuit-board(PCB) electroplating line is considered. The objective of this research is to determine an optimal simple-cycle schedule of the hoist which in turn maximizes the line throughput rate. Previous approaches to the cyclic hoist scheduling problem are all mathematical programming-based approaches to develop cyclic schedules(Mixed Integer Programming, Linear Programming based Branch and Bound, Branch and Bound Search Method and so on). In this paper, a genetic algorithm-based approach for a single hoist scheduling in the PCB electroplating line is described. Through some experiments for the well known example data and randomly generated data, the proposed algorithm is shown to be more efficient than the previous mathematical programming-based algorithm.

On a Two Dimensional Linear Programming Knapsack Problem with the Extended GUB Constrain (확장된 일반상한제약을 갖는 이차원 선형계획 배낭문제 연구)

  • Won, Joong-Yeon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.1
    • /
    • pp.25-29
    • /
    • 2001
  • We present a two dimensional linear programming knapsack problem with the extended GUB constraint. The presented problem is an extension of the cardinality constrained linear programming knapsack problem. We identify some new properties of the problem and derive a solution algorithm based on the parametric analysis for the knapsack right-hand-side. The solution algorithm has a worst case time complexity of order O($n^2logn$). A numerical example is given.

  • PDF