• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.112-119
• /
• 2021

In the Fourth Industrial Revolution and the foundation of software and hardware technologies through ICT, the technology to analyze the principles of information processing activities is the ability to implement programming. In this study, to improve the programming academic performance of electronics majors, firstly, we presented an effective teaching method in order to promote employment in the programming field by improving problem-solving skills and logical thinking skills in the programming field that electronics majors do not prefer. Secondly, we plan to promote intelligence informatization by converging intelligence information technology into the existing electronics industry by developing software utilization skills through programming curriculum that reflects the specificity and reality of electronics. Lastly, as computer programmers, we would like to expand creative talent education by developing learners' capabilities to cultivate smart talents who have both hardware and software capabilities.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.513-524
• /
• 2006

The ammunition allocation problem is a Multi-objective optimization(MOO) problem, maximizing fill-rate of multiple user troops and minimizing transportation time. Recent studies attempted to solve this problem by the prior preference articulation approach such as goal programming. They require that all the preference information of decision makers(DM) should be extracted prior to solving the problem. However, the prior preference information is difficult to implement properly in a rapidly changing state of war. Moreover they have some limitations such as heavy cognitive effort required to DM. This paper proposes a new ammunition allocation model based on more reasonable assumptions and uses an interactive MOO method to the ammunition allocation problem to overcome the limitations mentioned above. In particular, this article uses the GDF procedure, one of the well-known interactive optimization methods in the MOO liter-ature, in solving the ammunition allocation problem.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.259-268
• /
• 1999

In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.151-164
• /
• 2001

In this paper, a new approach for finding the approximate solution of the Stokes problem is introduced. In this method the problem is transformed to an equivalent optimization problem. Then, by considering it as a distributed parameter control system, the theory of measure is used to approximate values of pressure are obtained by a finite difference scheme.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.73-80
• /
• 1986

This paper deals with the problem of the optimal location of warehouses in the two stage distribution system, i.e., the distribution system where the product is transported from plants to customer areas via warehouses. The Problem is formulated with a zero-one mixed integer programming and an efficient branch and bound algorithm is then used to solve the problem. In order to obtain the solution of this problem, this paper shows the procedure of conversion of two stage distribution system into one stage distribution system. An improved method of solving the linear programming at the nodes and branching decision rule is also showed by this study.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1636-1648
• /
• 2006

In this paper, we propose a new optimization approach to the rate control problem in a wired-cum-wireless network. A primal-dual interior-point(PDIP) algorithm is used to find the solution of the rate optimization problem. We show a comparison between the dual-based(DB) algorithm and PDIP algorithm for solving the rate control problem in the wired-cum-wireless network. The PDIP algorithm performs much better than the DB algorithm. The PDIP can be considered as an attractive method to solve the rate control problem in network. We also present a numerical example and simulation to illustrate our conclusions.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.8 no.4
• /
• pp.259-267
• /
• 2018

The subset-sum problem is to find out whether or not the element sum of a subset within a finite set of numbers is equal to a given value. The problem is a well-known NP-complete problem, which is difficult to solve within a polynomial time. Genetic algorithm is a method for finding the optimal solution of a given problem through operations such as selection, crossover, and mutation. Dynamic programming is a method of solving a given problem from one or several subproblems. In this paper, we design and implement a genetic algorithm that solves the subset-sum problem, and experimentally compared the time performance to find the answer with the case of dynamic programming method. We selected a total of 17 test cases considering the difficulty in a set with 63 elements of positive number, and compared the performance of the two algorithms. The presented genetic algorithms showed time performance improved by 84% on 13 of 17 problems when compared with dynamic programming.

• The Journal of Korean Association of Computer Education
• /
• v.20 no.1
• /
• pp.13-26
• /
• 2017

The programming(algorithm) automated assessment system is to evaluate automatically the accuracy and time/space efficiency of user's solution to the problem which is provided. This system gives the immediate feedback of the solution, real-time ranking. So, in the course of data structure and algorithm, we can apply the knowledge which we have learned to the problem solving. Especially, in the basic course of learning the syntax of the programming language, the novice student can learn in easy and fun by solving the simple problem. The university students can understand in the easy way the meaning of asymptotic analysis of algorithm in data structure & algorithm course.

• Journal of Internet Computing and Services
• /
• v.20 no.4
• /
• pp.81-90
• /
• 2019

Since 2015, the government has been striving to strengthen the software capabilities required for future talent through software-oriented university in Korea. In the university selected as a software-oriented university, basic software education is given to all departments such as humanities, social science, engineering, natural science, arts and the sports within the university in order to foster convergent human resources with different knowledge and software literacy. In this paper, we analyze the contents of basic software education for twenty universities selected as software-oriented universities. As a result of analysis, most of the basic software education which is carried out to the students of the non-majors students was aimed at improvement of problem solving ability centered on computational thinking for future society and improvement of convergence ability based on computer science. It uses block-based educational programming language and text-based advanced programming language to adjust the difficulty of programming contents and contents reflecting characteristics of each major. Problem-based learning, project-based learning, and discussion method were used as the teaching and learning methods for problem solving. In the future, this paper will help to establish the systematic direction for basic software education of non-majors students.

• Journal of The Korean Association of Information Education
• /
• v.16 no.1
• /
• pp.61-70
• /
• 2012

In this study, the newly designed course related to creative problem solving is introduced. According to the characteristics of multimedia engineering, the Alice, which is well known as an effective 3D interactive authoring tool, is adopted as the supporting tool to validate the accomplishment of study goals set up for software design. Each creative problem solving phase could be clearly implemented and its expected performance could be evaluated efficiently by using Alice. The result of curricular implementation and performance evaluation is shown.