• Title/Summary/Keyword: Structured Programming

Search Result 110, Processing Time 0.032 seconds

수정된 Karmarkar 기법과 이의 효율성

  • Jeong, Seong-Jin;Lee, Chang-Hun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.13 no.1
    • /
    • pp.53-60
    • /
    • 1987
  • Karmakar suggested two methods to transform the general linear programming into his specially structured linear programming problem. We show that there are bad cases that cause difficulties in the use of Karmakar's methods. We also develop a new transformation method which can handle those difficulties.

  • PDF

Development and Application of Teaching-Learning Strategy for PBL-based Programming Education Using Reflection Journal in Elementary School (성찰일지를 활용한 PBL 기반 초등학교 프로그래밍 교육 교수·학습 전략 개발 및 적용)

  • Seo, Jeonghyun;Kim, Yungsik
    • Journal of The Korean Association of Information Education
    • /
    • v.20 no.5
    • /
    • pp.465-474
    • /
    • 2016
  • The present study is aimed to find the effect of the activity of writing a structured reflection journal in the learning process of PBL-based programming on the logical thinking of elementary school students. To achieve the objective, this study carried out an experiment with 59 elementary school students in the 5th grade. They were divided into an experimental group and a control group. The experimental group was applied with PBL-based programming classes by learning step, including learning of the contents, its procedure, and the activities of writing a critical reflection journal while the control group received learning of PBL-based programming including unstructured reflection journal. And then the difference in their logical thinking was compared and analyzed before and after th experiment. The results demonstrated that the experimental group showed a significant difference in logical thinking before and after writing structured reflection journal (ANCOVA) at the significance level of .05, which evidenced writing a structured reflection journal has learning effect. Intergroup comparison of logical thinking also showed that there was learning effect. Those findings suggest that writing a structured reflection journal in the PBL-based programming learning for 5th grade elementary school students has a positive effect on the learners' logical thinking.

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

Fast Training of Structured SVM Using Fixed-Threshold Sequential Minimal Optimization

  • Lee, Chang-Ki;Jang, Myung-Gil
    • ETRI Journal
    • /
    • v.31 no.2
    • /
    • pp.121-128
    • /
    • 2009
  • In this paper, we describe a fixed-threshold sequential minimal optimization (FSMO) for structured SVM problems. FSMO is conceptually simple, easy to implement, and faster than the standard support vector machine (SVM) training algorithms for structured SVM problems. Because FSMO uses the fact that the formulation of structured SVM has no bias (that is, the threshold b is fixed at zero), FSMO breaks down the quadratic programming (QP) problems of structured SVM into a series of smallest QP problems, each involving only one variable. By involving only one variable, FSMO is advantageous in that each QP sub-problem does not need subset selection. For the various test sets, FSMO is as accurate as an existing structured SVM implementation (SVM-Struct) but is much faster on large data sets. The training time of FSMO empirically scales between O(n) and O($n^{1.2}$), while SVM-Struct scales between O($n^{1.5}$) and O($n^{1.8}$).

  • PDF

Robust Depth Measurement Using Dynamic Programming Technique on the Structured-Light Image (구조화 조명 영상에 Dynamic Programming을 사용한 신뢰도 높은 거리 측정 방법)

  • Wang, Shi;Kim, Hyong-Suk;Lin, Chun-Shin;Chen, Hong-Xin;Lin, Hai-Ping
    • Journal of Internet Computing and Services
    • /
    • v.9 no.3
    • /
    • pp.69-77
    • /
    • 2008
  • An algorithm for tracking the trace of structured light is proposed to obtain depth information accurately. The technique is based on the fact that the pixel location of light in an image has a unique association with the object depth. However, sometimes the projected light is dim or invisible due to the absorption and reflection on the surface of the object. A dynamic programming approach is proposed to solve such a problem. In this paper, necessary mathematics for implementing the algorithm is presented and the projected laser light is tracked utilizing a dynamic programming technique. Advantage is that the trace remains integrity while many parts of the laser beam are dim or invisible. Experimental results as well as the 3-D restoration are reported.

  • PDF

An Approach to Composing a Structured Model from Validated Submodels

  • Suh, Chang-Kyo;Suh, Eui-Ho
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.15 no.2
    • /
    • pp.85-95
    • /
    • 1990
  • Structured modeling provides a formal mathematical framework, language, and computer-based environment for conceiving, representing, and manipulating a wide variety of model. It provides a natural framework for integrated modeling owing to its explicit representation power for computational dependencies among submodles. Nevertheless, it doesn't seem to offer a systematic way of composing a structured model from submodels. In order to develop a systematic way, this paper discusses three key issues : (1) Genus structure for model composition, (2) Storage of structured models, and (3) Integration of structured models. To formalize and visualize the approach, a programming module is developed to implemented the step-by-step integration.

  • PDF

Effect of Cognitive Style on Collaborative Problem Solving Ability in Programming Learning

  • Kwon, Boseob
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.9
    • /
    • pp.163-169
    • /
    • 2018
  • Problem solving by programming has a lot of influence on computational thinking improvement. Programming learning has been self-directed based on the individual's thoughts and principles. However, the revised informatics curriculum in 2015 puts importance on collaborative learning. Collaborative learning emphasizes results differently from cooperative learning, which emphasizes problem-solving processes. And cooperative learning leads to structured learning, such as role sharing and activity stages, within a small group, while collaborative learning leads to unstructured learning. Therefore, it is becoming more in collaborative learning that peer interaction can be affected by learners' cognitive style. In this paper, we propose the effect of cognitive style on problem solving ability in collaborative learning for problem solving by programming. As a result, collaborative learning was effective in improving problem solving ability and there was no significant difference in cognitive style.

A Study for a Capacitated Facility Location Problem on a Tree Structured Network (나무구조를 갖는 네트워크상에서의 제한용량이 있는 입지설정문제에 관한 연구)

  • Cho, Geon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.3
    • /
    • pp.250-259
    • /
    • 2001
  • Given a tree structured network in which each node has its own demand and also stands for a candidate location of a potential facility, such as plant or warehouse, a capacitated facility location problem on the network (CFLPOT) is to decide capacitated facility locations so that the total demand occurred on the network can be satisfied from those facilities with the minimum cost. In this paper, we first introduce a mixed integer programming formulation for CFLPOT with two additional assumptions, the indivisible demand assumption and the contiguity assumption and then show that it can be reformulated as a tree partitioning problem with an exponential number of variables. We then show that it can be solved in O($n^2b$) time by utilizing the limited column generation method developed by Shaw (1993), where n is the total number of nodes in the network and b is the maximum facility capacity. We also develop a depth-first dynamic programming algorithm with a running time of O(nb) for finding the locally maximal reduced cost which plays an important role in the limited column generation method. Finally, we implement our algorithms on a set of randomly generated problems and report the computational results.

  • PDF

An Object-oriented Finite Element Analysis Program Architecture of Easy Extension (확장이 쉬운 구조의 객체지향 유한요소해석 프로그램)

  • Nam, Yong-Yun
    • 연구논문집
    • /
    • s.33
    • /
    • pp.27-38
    • /
    • 2003
  • The object-oriented programming languages are widely used in the modern software engineering. The procedural type FEM codes are still used because it is very hard and cost consuming job to re-code them into object-oriented programs. In this study, a FEM program was newly designed and coded with C++, an object-oriented language. Also a special programming technique, auto-loading technique was developed for open structured program, with which the extension and maintenance can be carried out easily. For example, the additions of element libraries to an existence FEM program do not require any modifications of the program.

  • PDF

An assignment method for part-machine cell formation problem in the presence of multiple process routes

  • Won, You-Kyung;Kim, Sehun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1994.04a
    • /
    • pp.236-243
    • /
    • 1994
  • In this paper we consider the part-machine cell formation decision of the generalized Group Technology(GT) problem in which multiple process routes can be generated for each part. The existing p-median model and similarity coefficient algorithm can solve only small-sized or well-structured cases. We suggest an assignment method for the cell formation problem. This method uses an assignment model which is a simple linear programming. Numerical examples show that our assignment method provides good separable cells formation even for large-sized and ill-structured problems.