• Title/Summary/Keyword: Computer programming

Search Result 2,150, Processing Time 0.028 seconds

Computer aided design system for robotic painting line (동장공정의 로보틱자동화를 위한 설계지원 시스템)

  • Suh, Suk-Hwan;Cho, Jung-Hoon;Kang, Dae-Ho
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.11 no.5
    • /
    • pp.171-179
    • /
    • 1994
  • For successful implementation of robotic painting system, a structured design and analysis procedure is necessary. In designing robotic system, both functional and economical feasibility should be investigated. As the robotization is complicated task involving implemen- tation details (such as robot selection, accessory design, and spatial layout) together with operation details, the computer aided design and analysis method should be sought. However, conventional robotic design systems and off-line programming systems cannot accommodate these inquiries in a unified fashion. In this research, we develop an interactive design support system for robotization of a cycle painting line. With the developed system called SPRPL (Simulation Package for Robotic Painting Line) users can design the painting objects (via FRAME module), select robot model (ROBOT), design the part hanger (FEEDER), and arrange the workcell. After motion programming (MOTION), the design is evaluated in terms of: a) workpace analysis, b) coating thickness analysis, and c) cycle time (ANALYSIS).

  • PDF

Language Education System with Structured Programming (구조적 프로그래밍을 위한 언어 학습 시스템)

  • Park, Kyoung-Wook;Ryu, Nam-Hoon;Kim, Eung-Kon
    • 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.

A Case Study of Python Programming Error in an Online Learning Environment (온라인 학습 환경에서 발생하는 파이썬 프로그래밍 오류 사례 분석)

  • Jung, Hye-Wuk
    • The Journal of the Convergence on Culture Technology
    • /
    • v.7 no.3
    • /
    • pp.247-253
    • /
    • 2021
  • There are various programming errors that occur in the course of programming practice for beginners in computer programming. At this time, since it is difficult for learners to recognize errors by themselves, they correct program errors through the instructor's feedback. However, as students learn programming techniques in an online learning environment due to the COVID-19 pandemic, there is a limit to interaction between the students and the instructor in comparison with offline classes, so it is necessary for learners to develop their own ability to solve programming errors by themselves. Therefore, in this study, error cases in online programming classes using the Python language are analyzed and an online programming education method that can improve learners' ability to correct programming errors is proposed based on the analysis results.

Relation Analysis of High School Students' Abstract Thinking, Language Familiarity, and Academic Achievement on C and Scratch Program Understanding (C와 스크래치 프로그램 이해에 대한 고등학생의 추상적 사고, 언어친밀성, 학업성취도 관계 분석)

  • Park, Chan Jung;Hyun, Jung Suk;Jin, Heuiran;Jeong, Hyesun
    • The Journal of Korean Association of Computer Education
    • /
    • v.18 no.6
    • /
    • pp.1-12
    • /
    • 2015
  • In computer education area, abstract thinking has played a positive role in programming ability, and language experience has also affected the ability. However, most of the studies were empirical. The practical research about the relation analysis between abstract thinking and programming ability has rarely been performed. Among various types of programming abilities such as coding, debugging, and reading, this paper focused on program understanding. We analyzed the affection relation on program understanding and the interaction effect between abstract thinking level and language familiarity. We surveyed 376 high school students on their abstract thinking levels, language familiarity, academic achievement, and the program understanding abilities of C and Scratch. From the research, we knew that the abstract thinking level played an important role in understanding the iterative program for the male students. In addition, if the students had the experience on other programming languages before entering high schools, then there was an interaction effect between abstract thinking level and program language familiarity.

Case Study on Problem-based Programming Classes in Software Education for Non-Computer Science Majors

  • Seo, Joo-Young;Shin, Seung-Hun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.4
    • /
    • pp.213-222
    • /
    • 2020
  • Recently, as awareness of the need for software education has spread worldwide, the government of Korea has led compulsory software education also. Basic software education in universities has been stabilized through various trials and efforts. However, due to software classes are mandatory, students not only could not have motivation for learning but also have treated programming course as a difficult subject. In this paper, two programming classes, which were designed and managed as a problem-oriented programming class for the purpose of cultivating computational thinking for the non-computer science students, are compared using the lecture assessment results. As a result, in the case of expanding the use of the problem as a grammatical explanation aid and expanding the ratio of major-friendly problems, the student's responses were concentrated on higher scores and the response average improved by about 7%. It means that the level of difficulty experienced by learners is lowered.

Development and Analysis of Elementary Dolittle Programming Problems using Algorithmic Thinking-based Problem Model (알고리즘적 사고 문제 모델을 이용한 두리틀 프로그래밍 문제 개발 및 적용)

  • Hur, Kyeong
    • The Journal of Korean Institute for Practical Engineering Education
    • /
    • v.3 no.2
    • /
    • pp.69-74
    • /
    • 2011
  • This paper proposes elementary Dolittle programming problems using the algorithmic thinking-based problem model with material factors in the elementary Dolittle programming. And this paper proves the validity of developed Dolittle programming problems in defining them as algorithmic thinking-based problems through experiments. The experimental results are analyzed in views of variety and effectiveness evaluation of answer algorithms and suitability of allocating degrees of difficulties to the developed Dolittle programming problems.

  • PDF

An effcient algorithm for multiple sequence alignment (복수 염기서열 정렬을 위한 한 유용성 알고리즘)

  • Kim, Jin;Song, Min-Dong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10c
    • /
    • pp.51-53
    • /
    • 1998
  • 3개 이상의 DNA 혹은 단백질의 염기서열을 정렬하는 복수 염기서열 정렬(multiple sequence alignment)방법은 염기서열들 사이의 진화관계, gene regulation, 단백질의 구조와 기능에 관한 연구에 필수적인 도구이다. 복수 염기서열 정렬문제는 NP-complete 문제군에 속하며, 이 문제를 해결하기 위하여 가장 유용하게 사용되는 알고리즘으로는 dynamic programming이 있다. Dynamic programming은 주어진 입력 염기서열 군들에 대한 최적의 정렬을 생산할 수 있다. 그러나 dynamic programming의 단점은 오랜 실행시간이 요구되며, 때로는 dynamic programming의 속성 때문에 이 알고리즘을 사용하여도 주어진 입력 염기서열 군들에 대한 최적의 정렬을 얻어내지 못하는 경우가 있다. 본 연구에서는 이러한 dynamic programming의 문제를 해결하기 위하여 genetic algorithm을 복수 염기서열 정렬문제에 적용하였다. 본 논문에서는 genetic algorithm의 design과 적용방법을 기술하였다. 본 연구에서 제안된 genetic algorithm을 사용하여 dynamic programming의 단점이었던 오랜 실행시간을 줄일 수 있었으며, dynamic programming이 제공하지 못하는 최적의 염기서열 정렬을 제공할 수 있었다.

  • PDF

MVPE:multiparadign visual programming environment (MVPE:멀티패러다임 시각 프로그래밍 환경)

  • 유재우;최종명
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.9A
    • /
    • pp.2313-2324
    • /
    • 1998
  • Although visual programming is used in many fields of computer science and engineering, some dis-advantages can be found when they work together in an integrated programming environment. To overcome these shortcomings, there have been researches in combining multiparadigm with visual programming. However they have failed because they tried to combine the paramdigms without any coceptural model and structured method. In this paper, we investigate a new multiparadigm visual programming environment (MVPE), in which dataflow paradigm, form-based paradign, direct manipulation paradigm, and object-oriented paradigm are integrated together in an object-oriented way, based on the conceptual model of "method = paradigm, " This MVPE would overcome the limits of visual programming, and may also lead to the new discipline of visual programming environment.vironment.

  • PDF

A Study of Multiple Dynamic Programming (Multiple dynamic programming에 관한 연구)

  • Young Moon park
    • 전기의세계
    • /
    • v.21 no.1
    • /
    • pp.13-16
    • /
    • 1972
  • Dynamic Programming is regarded as a very powerful tool for solving nonlinear optimization problem subject to a number of constraints of state and control variables, but has definite disadvantages that it requires much more computing time and consumes much more memory spaces than other technigues. In order to eliminate the above-mentioned demerits, this paper suggests a news technique called Multiple Dynamic Programming. The underlying principles are based on the concept of multiple passes that, instead of forming fin lattices in time-state plane as adopted in the conventional Dynamic Programming, the Multiple Dynamic Programming constitutes, at the first pass, coarse lattices in the feasible domain of time-state plane and determines the optimal state trajectory by the usual method of Dynamic Programming, and at the second pass again constitutes finer lattices in the narrower domain surrounded by both the upperand lower edges next to the lattice edges through which the first pass optimal trajectory passes and determines the more accurate optimal trajectory of state, and then at the third pass repeats the same processes, and so on. The suggested technique insures remarkable curtailment in amounts of computer memory spaces and conputing time, and its applicability has been demonstrated by a case study on the hydro-thermal power coordination in Korean power system.

  • PDF

Towards Performance-Enhancing Programming for Android Application Development

  • Kim, Dong Kwan
    • International Journal of Contents
    • /
    • v.13 no.4
    • /
    • pp.39-46
    • /
    • 2017
  • Due to resource constraints, most of Android application developers need to address potential performance problems during application development and maintenance. The coding styles and patterns of Android programming could often affect the execution time and energy efficiency which are utilized by the Android applications. Thus, it is necessary for application developers to apply performance-enhancing programming practices for mobile application development. This paper introduces performance-enhancing best practices for Android programming, and further, it evaluates the impact of these practices on the CPU time of the application. The original version with the performance-worsening code has been refactored to become an efficient version without changing its functionality. To demonstrate the efficiency of the proposed approach, each coding pattern was evaluated by measuring the CPU time under the controlled runtime environment. Furthermore, the Android applications were evaluated and compared via the CPU time of the original version, with that of the refactored version. These experimental results indicate that, by -using the proposed programming practices, the Android developer can develop performance-efficient mobile applications.