• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.1191-1194
• /
• 1995

A conversational programming system for turning processes was studied to enhance the user friendlness of an NC by adopting man-machine interface functions through Visual C $^{++}$ programming tool under the Windows 95 environment. Shop floor programming performance was incorporated in the developed CAM module. In order to increase flexibility of the man-machine interface, graphic based programmin tool have been developed. An NC turning machine equipped whit an open architecture PCNC was used as a test bed of the system. Perfomance of the system was verified through case studies..

• Korean Journal of Organic Agriculture
• /
• v.26 no.2
• /
• pp.181-202
• /
• 2018

Most of eco-friendly agrifood processing enterprises in Korean rural area are small and medium-sized business. For this reason, it's hard for eco-friendly agrifood processing enterprises to neither analyze business performance for efficient business management nor establish their own business plan for rational decision-making. Therefore it's necessary to design effective mathematical programming model and to make practical application which can support rational management decision-making ensuring the stable business activity of eco-friendly agrifood processing enterprises. Accordingly this paper focuses on the designing and its application of multi-objective mathematical programming model using goal programming to support rational decision-making of eco-friendly agrifood processing enterprise. Hansalimanseongmachum Food Inc. which runs soy bean processing business making tofu based on regional-based soybean farms around Anseong City will be the specific case to apply multi-objective mathematical programming model in practice. And it will suggest measures to support rational management decision-making of other eco-friendly agrifood processing enterprises.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.1
• /
• pp.9-13
• /
• 1985

This paper develops a decomposition method for stochastic programming with a block diagonal structure. Here we assume that the right-hand side random vector of each subproblem is differente each other. We first, transform this problem into a master problem, and subproblems in a similar way to Dantizig-Wolfe's Decomposition Princeple, and then solve this master problem by solving subproblems. When we solve a subproblem, we first transform this subproblem to a Deterministic Equivalent Programming (DEF). The form of DEF depends on the type of the random vector of the subproblem. We found the subproblem with finite discrete random vector can be transformed into alinear programming, that with continuous random vector into a convex quadratic programming, and that with random vector of unknown distribution and known mean and variance into a convex nonlinear programming, but the master problem is always a linear programming.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.96-99
• /
• 1992

Currently, there are various robot programming methods for articulated robots. Although each method has merits and drawbacks, they have commonly weak points for practical application, and especially the weak point can be even more vulnerable when the robot programming requires the subtle feelings of human being. This is because the movement of a human being is synthetic while the robot programming is analytic. Therefore, the present method of programming has limits in performing these kinds of subtle robot movement. In this paper, we propose a direct robot programming method, which generates robot programs based on the force/torque vector applied to a force/torque sensor by the human operator. The method reduces the effort required in the robot programming.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.79-88
• /
• 1999

This work aims to establish an algorithm for solving the problem of convex programming with several objective-functions with linear constraints. Starting from the idea of Rosen's algorithm for solving the problem of convex programming with linear con-straints and taking into account the solution concept from multi-dimensional programming represented by a program which reaches "the best compromise" we are extending this method in the case of multidimensional programming. The concept of direction of min-imization is introduced and a necessary and sufficient condition is given for a s∈Rn direction to be a direction is min-imal. The two numerical examples presented at the end validate the algorithm.

• Journal of The Korean Association of Information Education
• /
• v.13 no.4
• /
• pp.443-450
• /
• 2009

A programming class was conducted in a current discretionary activity time-slot for computer education by using Dolittle which enhances problem solving ability and creativity for the fifth graders in elementary school. Based on this experiment, a correlation between the programming class and problem solving ability, creativity, and interests in programming of children was examined to suggest an outlook for improving the current computer education.

• 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이 제공하지 못하는 최적의 염기서열 정렬을 제공할 수 있었다.

• 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.

• 전기의세계
• /
• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.11
• /
• pp.183-190
• /
• 2015

This paper investigates the three main functions of a typical visual app programming environment for Novice Programming developers, and compares the features. The Scratch is a visual programming environment for education, anyone can create a story easy as possible variously interaction, games, animations and more. App inventor provides precise and professional application development capabilities as compared with scratch. App Inventor in runs independently of the computer platform, and has a feature that must be constantly connected to the server over the internet, while the Inventor app runs. M-Bizmaker is suitable for commercial application development, consists of m-BizBuilder, m-BizEngine, m-BizServer or the like, provides a cross-platform visual programming environment.