• Journal of Korea Game Society
• /
• v.15 no.1
• /
• pp.125-134
• /
• 2015

This paper designs a peer tutoring in Flipped Learning environments for effective game programming(TGF), suggests a result of survey and a lesson learned from game programming in terms of students' and professors' perspectives in hands-on program training using Snake game programming as an applied example. The TGF is more effective than the traditional classroom to achieve the learning goals of game programming course.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.75-106
• /
• 2008

In this paper, we derive necessary optimality conditions for a continuous programming problem in which both objective and constraint functions contain support functions and is, therefore, nondifferentiable. It is shown that under generalized invexity of functionals, Karush-Kuhn-Tucker type optimality conditions for the continuous programming problem are also sufficient. Using these optimality conditions, we construct dual problems of both Wolfe and Mond-Weir types and validate appropriate duality theorems under invexity and generalized invexity. A mixed type dual is also proposed and duality results are validated under generalized invexity. A special case which often occurs in mathematical programming is that in which the support function is the square root of a positive semidefinite quadratic form. Further, it is also pointed out that our results can be considered as dynamic generalizations of those of (static) nonlinear programming with support functions recently incorporated in the literature.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.1
• /
• pp.146-153
• /
• 2004

This paper presents the method for the placement and operation of dispersed generator systems(DGs) using fuzzy goal programming in distribution systems. For the placement and operation of DGs the problem is formulated with reduction of search spaces and flexibility of system situations. Especially, the original objective function and constraints are transformed by fuzzy goal programming to evaluate their imprecise nature for the criterion of power loss minimization, the number or total capacity of DGs and the bus voltage deviation, and then solve the problem using genetic algorithm.

• Korean Management Science Review
• /
• v.20 no.2
• /
• pp.33-43
• /
• 2003

In this paper we applied dynamic programming to determining work schedule type. In dynamic programming formulation, each day during a planning horizon represents a stage for which a decision is made. The alternatives are given by work schedule types that combine regular time, overtime, additional shift, and so on. In this case, their associated return function is labor cost. The state is defined as the amount of work time allocated to stage 1, stage 2,…, and current stage. A case study for a real manufacturing company was performed to apply dynamic programming to scheduling daily work hours during a week. The case study showed that total cost of our solution derived from dynamic programming decreased by about 6％ as compared with the solution obtained from the previous method.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.717-730
• /
• 2002

In this paper we use measure theory to solve a wide range of the nonlinear programming problems. First, we transform a nonlinear programming problem to a classical optimal control problem with no restriction on states and controls. The new problem is modified into one consisting of the minimization of a special linear functional over a set of Radon measures; then we obtain an optimal measure corresponding to functional problem which is then approximated by a finite combination of atomic measures and the problem converted approximately to a finite-dimensional linear programming. Then by the solution of the linear programming problem we obtain the approximate optimal control and then, by the solution of the latter problem we obtain an approximate solution for the original problem. Furthermore, we obtain the path from the initial point to the admissible solution.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.11
• /
• pp.3091-3097
• /
• 1994

An expert system for NC part programming of NC lathe (ESPP-1) is developed as a part of Computer-Adied Manufacturing system. Conventional computer-assisted part programming system essentially requires an NC part programmer who is an expert in NC part programming. But the developed ESSP-1 can allow an inexperienced person to make an excellent NC data for the NC Lathe without any problem, since the system has a knowledge base composed of EIA and ISO NC code, feed rate, spindle speed, machining coordinates selection, and tool selection etc., which were directly evoked from some skilled NC part programmers, and referenced some machining handbooks. This paper discusses the algorithm of the expert system for NC part programming of the NC lathe (ESPP-1) and the performance comparisons between the developed expert system and the conventional system.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.1201-1206
• /
• 2007

Robot simulation technique is essential not only for robot developers to design robotic systems but also for robot operators to predict robot motion, configure system layout, and increase robot ability. However, commercial robot simulation software such as ROBCAD, IGRIP, and so on are expensive and sometimes they are difficult to customize into industrial purpose programming for users. Therefore, user-based simulation programming is required to magnify the efficiency of robot system. In this paper, we show the methodology of developing user-based robot simulation programming using PC(personal computer), Open-Inventor, and Windows Programming. The developed programming has been successfully applied to welding robot systems of a shipbuilding industry. Also, the methodology presented here can be easily extended to simulate manipulators of other typed mechanism on user's PC.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.11 no.1
• /
• pp.36-43
• /
• 1986

In this study, the fuzzy programming is extended to handle various types of membership functions by transformation of the complicated fuzzy programming problems into the equivalent crisp linear programming problems with single objective. It is well-known that the fuzzy programming problem with linear membership functions (i.e., ramp type) can be easily transformed into a linear programming problem by introducing one dummy variable to minimize the worst unwanted deviation. However, until recently not many researches have been done to handle various general types of complicated linear membership functions which might be more realistic than ramp-or triangular-type functions. In order to handle these complicated membership functions, the goal dividing concept, which is based on the fuzzy set operation (i. e., intersection and union operations), has been prepared. The linear model obtained using the goal dividing concept is more efficient and single than the previous models [4, 8]. In addition, this result can be easily applied to any nonlinear membership functions by piecewise approximation since the membership function is continuous and monotone increasing or decreasing.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.617-620
• /
• 2000

In this paper, we show an application of constraint logic programming to the operation scheduling on machines in a job shop. Constraint logic programming is a new genre of programming technique combining the declarative aspect of logic programming with the efficiency of constraint manipulation and solving mechanisms. Due to the latter feature, combinatorial search problems like scheduling may be resolved efficiently. In this study, the jobs that consist of a set of related operations are supposed to be constrained by precedence and resource availability. We also explore how the constraint solving mechanisms can be defined over a scheduling domain. Thus the scheduling approach presented here has two benefits: the flexibility that can be expected from an artificial intelligence tool by simplifying greatly the problem; and the efficiency that stems from the capability of constraint logic programming to manipulate constraints to prune the search space in an a priori manner.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.2
• /
• pp.37-44
• /
• 1998

Computers can be used in providing new ways to promote intellectual skills. A computer programming environment can create conditions under which an intellectual mode takes root. Especially problem solving skills can be promoted through programming. To investigate whether and, if so, how computer programming enhances problem solving skills, the nature of programming and problem solving skills are examined. Then, issues on the programming learning context in relation to problem solving are presented.