• Educational Technology International
• /
• v.12 no.1
• /
• pp.125-145
• /
• 2011

Facilitating critical thinking is important for students' cognitive growth and knowledge acquisition. This study examines the dimensions of tutors' roles in facilitating the critical thinking required for problem solving in online discussions. The research procedures include identifying the research problems related to critical thinking skills; synthesizing theories and perspectives on critical thinking skills; and analyzing, validating, and determining tutors' roles. Using the results of this study, problem solving processes are divided into four phases: analyzing, judging, inferencing, and meta-cognitively evaluating. Tutors' roles in online problem solving can be categorized into four domains: cognitive, social, managerial, and technical. Tutors' roles in each domain are specifically analyzed, and the strengths, weaknesses, and improvements in tutors' facilitation of critical thinking for online problem solving are evaluated.

• Journal of Astronomy and Space Sciences
• /
• v.13 no.1
• /
• pp.48-54
• /
• 1996

The generalized linear impulsive correction problem is applied to make a linear programming problem for optimizing trajectory of an orbiting spacecraft. Numerical application for the stationkeeping maneuver problem of geostationary satellite shows that this problem can efficiently find the optimal solution of the stationkeeping parameters, such as velocity changes, and the points of impulse by using the revised simplex method.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.244-259
• /
• 2022

Bicycle- or bike-sharing systems (BSSs) have received increasing attention as a secondary transportation mode due to their advantages, for example, accessibility, prevention of air pollution, and health promotion. However, in BSSs, due to bias in bike demands, the bike rebalancing problem should be solved. Various methods have been proposed to solve this problem; however, it is difficult to apply such methods to small cities because bike demand is sparse, and there are many practical issues to solve. Thus, we propose a demand prediction model using multiple classifiers, time grouping, categorization, weather analysis, and station correlation information. In addition, we analyze real-world relocation data by relocation managers and propose a relocation algorithm based on the analytical results to solve the bike rebalancing problem. The proposed system is compared experimentally with the results obtained by the real relocation managers.

• Journal of the Korean Mathematical Society
• /
• v.50 no.5
• /
• pp.945-957
• /
• 2013

In this paper we consider a Riemann problem, in particular, the case of the presence of the semi-hyperbolic patches arising from a transonic shock in simple waves interaction. Under this circumstance, we construct global solutions of the two-dimensional Riemann problem of the pressure gradient system. We approach the problem as a Goursat boundary value problem and a mixed initial-boundary value problem, where one of the boundaries is the transonic shock.

• Korean Management Science Review
• /
• v.20 no.1
• /
• pp.141-148
• /
• 2003

Vehicle routing problem Is known to be a NP-hard problem, and is traditionally solved by some heuristic approaches. This paper investigates the application of the computer method COMSOAL to the optimal vehicle routing problem. This paper discusses the adaptation of the COMSOAL approach to the known set of simple vehicle routing example problem. The results show that the COHSOAL can be a good possible approach to solve the vehicle routing problem.

• Management Science and Financial Engineering
• /
• v.14 no.1
• /
• pp.65-86
• /
• 2008

In this paper, we have considered the multicriteria quadratic plant location problem. In addition to the allocation costs, the maintenance costs of the plants are also considered. The objective functions considered in this paper are quadratic in nature. The given problem is reduced to the problem with linear objective function. The method of Fernandez and Puerto (2003) is applied to solve the reduced problem. It is illustrated with help of examples. The effect of the change in the allocation and maintenance costs on allocation of plants to the clients has also been discussed.

• Management Science and Financial Engineering
• /
• v.14 no.1
• /
• pp.91-96
• /
• 2008

Robust knapsack problem appears when dealing with data uncertainty on the knapsack constraint. This note presents a generalization of the cover inequality for the problem with its lifting procedure. Specifically, we show that the lifting can be done in a polynomial time as in the usual knapsack problem. The results can serve as a building block in devising an efficient branch-and-cut algorithm for the general robust (0, 1) IP problem.

• The Journal of Korean Association of Computer Education
• /
• v.18 no.5
• /
• pp.1-13
• /
• 2015

In recent domestic and international curriculum it is emphasized that students should acquire 'problem solving' competence as a member of knowledge information society and various programming educational methods of improving problem solving competence have been studied. But there is no difference between programming problems in related research and traditional programming courses. Most methods of solving problems are focused on acquiring specific languages rather than enhancing problem solving ability. In this research, we developed a suitable programming problems and curriculum for fostering problem solving competence and designed and developed teaching and learning contents based on PSA(Problem Solving Activities). Furthermore, we obtained meaningful results of improving learners' problem solving ability and logical thinking ability by operating curriculum with developed contents as learning materials. The results of this research are expected to be used as a reference model or basic teaching materials for developing and operating the programming teaching and learning contents or curriculum to enhance problem solving competence.

• Child Health Nursing Research
• /
• v.15 no.1
• /
• pp.15-23
• /
• 2009

Purpose: This research was done to provide fundamental data to improve learning methods in Pediatric nursing and meet the needs of the students in actual nursing by analyzing nurse student experiences with problem-based learning in Pediatric nursing. Method: Using the 31 Q-samples selected, 20 nursing students from J college were selected as p-samples. The students were personally interviewed in January or February 2008. Result: The result of the study showed 3 types. The first type was the "negative resister", who failed to adapt to the problem-based learning and resists negatively. The second type was the "active receiver", who participated in the process of the problem-based learning and received it actively. The third type was the "passive accepters", who accepted problem-based learning but worried because they were familiar only with traditional learning. Conclusions: In this study, problem-based learning was used for classes in the science of pediatric nursing. The findings indicate that preparation for learning and details should be considered when developing and using modules for pediatric nursing. Further study on the development of problem-based learning modules is also indicated.

• Journal of Distribution Science
• /
• v.15 no.7
• /
• pp.35-41
• /
• 2017

Purpose - A product bundling is a marketing approach where multiple products or components are packaged together into one bundle solution. This paper aims to introduce an optimal bundle search problem (hereinafter called "OBSP") which may be embedded with online recommendation system to provide an optimized service considering pairwise discount and delivery cost. Research design, data, and methodology - Online retailers have their own discount policy and it is time consuming for online shoppers to find an optimal bundle. Unlike an online system recommending one item for each search, the OBSP considers multiple items for each search. We propose a mathematical formulation with numerical example for the OBSP and analyzed the complexity of the problem. Results - We provide two results from the complexity analysis. In general case, the OBSP belongs to strongly NP-Hard which means the difficulty of the problem while the special case of OBSP can be solved within polynomial time by transforming the OBSP into the minimum weighted perfect matching problem. Conclusions - In this paper, we propose the OBSP to provide a customized service considering bundling price and delivery cost. The results of research will be embedded with an online recommendation system to help customers for easy and smart online shopping.