• Honam Mathematical Journal
• /
• v.41 no.4
• /
• pp.823-835
• /
• 2019

A solution for Nevanlinna-Pick interpolation problem with low complexity is constructed via non-recursive method. More precisely, a stable rational function satifying the given interpolation data in the complex right half plane is found by solving a homogeneous interpolation problem related to a minial interpolation problem for the given data in the right half plane together with its mirror-image data.

• IE interfaces
• /
• v.12 no.3
• /
• pp.362-373
• /
• 1999

Resource Constrained Dynamic Multi-Projects Scheduling (RCDMPS) is intended to schedule activities of two or more projects sequentially arriving at die shop under restricted resources. The aim of this paper is to develop a new problem solving method for RCDMPS to make an effect schedule based by constraint programming. The constraint-based scheduling method employs ILOG Solver which is C++ constraint reasoning library for solving complex resource management problems and ILOG Schedule which is a add-on library to ILOG Solver dedicated to solving scheduling problems. And this method interfaces with ILOG Views so that the result of scheduling displays with Gantt chart. The scheduling method suggested in this paper was applied to a company scheduling problem and compared with the other heuristic methods, and then it shows that the new scheduling system has more preference.

• The Journal of Korean Association of Computer Education
• /
• v.23 no.3
• /
• pp.41-47
• /
• 2020

Computational Thinking(CT) is drawing attention as a core competency required for future talent in the 21st century. Software education for improving CT ability at home and abroad is in full swing. Among them, problem-solving programming education helps to improve CT ability. The CT-TDPS learning model follows the decomposition, abstraction thinking process, which modularizes complex problems, and the Agile development method, which is an iterative and incremental programming method to implement it. In this study, we tried to confirm the improvement of CT ability by applying CT-TDPS learning model to problem solving programming education using Scratch. As a result of the study, it was confirmed that in the problem solving programming education using the CT-TDPS learning model, it improved in all aspects of computing concept, computing performance, and computing perspective, which are sub-factors of CT ability. In addition, it was confirmed that there was a significant difference in the experimental group as a result of the t-test on the Dr.Scratch automatic evaluation result.

• Information Systems Review
• /
• v.9 no.3
• /
• pp.45-65
• /
• 2007

As digital economy era and knowledge society advent, division of the industry has been indistinctive and complex. This change of business environment has leaded todifficulty in operations of firms consisted of continuous decision making. To develop effective SDSS needs systematic strategic decision making process, efficient problem solving techniques, information of good quality, efficiently information system, and analysis ability of problem solver. This research develop SDSS framework combined strategic decision making process with various problem solving techniques for designing SDSS. Finally, this paper developed the technique recommendation system by selected the criterions of technique assortment.

• Coupled systems mechanics
• /
• v.11 no.2
• /
• pp.167-198
• /
• 2022

In this paper we deal with classical instability problems of heterogeneous Euler beam under conservative loading. It is chosen as the model problem to systematically present several possible solution methods from simplest deterministic to more complex stochastic approach, both of which that can handle more complex engineering problems. We first present classical analytic solution along with rigorous definition of the classical Euler buckling problem starting from homogeneous beam with either simplified linearized theory or the most general geometrically exact beam theory. We then present the numerical solution to this problem by using reduced model constructed by discrete approximation based upon the weak form of the instability problem featuring von Karman (virtual) strain combined with the finite element method. We explain how such numerical approach can easily be adapted to solving instability problems much more complex than classical Euler's beam and in particular for heterogeneous beam, where analytic solution is not readily available. We finally present the stochastic approach making use of the Duffing oscillator, as the corresponding reduced model for heterogeneous Euler's beam within the dynamics framework. We show that such an approach allows computing probability density function quantifying all possible solutions to this instability problem. We conclude that increased computational cost of the stochastic framework is more than compensated by its ability to take into account beam material heterogeneities described in terms of fast oscillating stochastic process, which is typical of time evolution of internal variables describing plasticity and damage.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.131-145
• /
• 1995

This paper presents a method for solving project planning problem which the opinions of experts greatly disagree in each activity processing time. Triangular fuzzy numbers (TFNs) are used to represent activity times of experts. And we introduce a pessimistic project planning with major TFNs and an optimistic project planning with minor. TFNs, and illustrate the approach using a combination of the existing composite and the comparison methods, which is used to solve the complex project planning problem.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.04a
• /
• pp.401-405
• /
• 2004

Column subtraction, originally proposed by Harche and Thompson(]994), is an exact method for solving large set covering, packing and partitioning problems. Since the constraint set of ship scheduling problem(SSP) have a special structure, most instances of SSP can be solved by LP relaxation. This paper aims at applying the column subtraction method to solve SSP which can not be solved by LP relaxation. For remained instances of unsolvable ones, we subtract columns from the finale simplex table to get another integer solution in an iterative manner. Computational results having up to 10,000 0-1 variables show better performance of the column subtraction method solving the remained instances of SSP than complex branch-and-bound algorithm by LINDO.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.1111-1116
• /
• 1993

In this study, we discuss the design of the expert system for the scheduling of the FMC(Flexible Manufacturing Cell) consisting of the several versatile machines. Due to the NP property, the scheduling problem of several machine FMC is very complex task. Thus we proposed the two heuritstic shceduling algorithms for solving the problem and constituted the algorithm based of solving the problem and constituted the algorithm base of ISS(Intelligent Scheduling System) using them. By the rules in the rule base, the best alternative among various algorithms in algorithm base is selected and applied in controlling the FMC. To show the efficiency of ISS, the scheduling output of ISS and the existent dynamic dispatching rule were tested and compared. The results indicate that the ISS is superior to the existent dynamic dispatching rules in various performance indexes.

• Journal of Navigation and Port Research
• /
• v.28 no.2
• /
• pp.129-133
• /
• 2004

Column subtraction, originally proposed by Harche and Thompson(1994), is an exact method for solving large set covering, packing and partitioning problems. Since the constraint set of ship scheduling problem(SSP) have a special structure, most instances of SSP can be solved by LP relaxation This paper aim, at applying the column subtraction method to solve SSP which am not be solved by LP relaxation For remained instances of unsolvable ones, we subtract columns from the finale simplex table to get another integer solution in an iterative manner. Computational results having up to 10,000 0-1 variables show better performance of the column subtraction method solving the remained instances of SSP than complex branch and-bound algorithm by LINDO.

• Education of Primary School Mathematics
• /
• v.26 no.2
• /
• pp.83-97
• /
• 2023

Nominalization is one of the grammatical metaphors that makes it easier to mathematize the target that needs to be converted into a formula, but it has the disadvantage of making problem understanding difficult due to complex and compressed sentence structures. To investigate how this nominalization affects students' problem-solving processes, an analysis was conducted on 233 third-grade elementary school students' problem solving of eight arithmetic word problems with or without nominalization. The analysis showed that the presence or absence of nominalization did not have a significant impact on their problem understanding and their ability to convert sentences to formulas. Although the students did not have any prior experience in nominalization, they restructured the sentences by using nominalization or agnation in the problem understanding stage. When the types of nominalization change, the rate of setting the formula correctly appeared high. Through this, the use of nominalization can be a pedagogical strategy for solving word problems and can be expected to help facilitate deeper understanding.