• Research in Mathematical Education
• /
• v.15 no.2
• /
• pp.115-126
• /
• 2011

The aim of this study was to explore teachers' values about teaching mathematics in the classrooms which implemented Lesson Study and Open Approach as a teaching approach. The targeted group was 83 school teachers from 4 schools participating in a teacher professional development project. The data was gathered through teacher questionnaires, lesson observations and interviews. Data analysis is based on Bishop's (1988; 2003; 2007) and Komin's (1990) frameworks. The results from the implementation of Lesson Study and Open Approach in Thai classroom found the different of the roles and behaviors of teachers and students in classroom. The results revealed 3 kinds of values about teaching: Mathematical values, General educational values, Mathematics educational values and also found that most of the teachers valued problem solving as an innovative teaching approach as against traditional approaches they were familiar with.

• Journal of the Korea Safety Management & Science
• /
• v.6 no.2
• /
• pp.141-154
• /
• 2004

The objective of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the job shop scheduling. The proposed heuristic method is based on a constraint satisfaction problem technique and a improved randomizing search algorithm. In this paper, ILOG programming libraries are used to embody the job shop model, and a constraint satisfaction problem technique is developed for this model to generate the initial solution. Then, a improved randomizing search algorithm is employed to overcome the increased search time of constrained satisfaction problem technique on the increased problem size and to find a improved solution. Computational experiments on well known MT and LA problem instances show that this approach yields better results than the other procedures.

• Journal of Digital Convergence
• /
• v.15 no.2
• /
• pp.155-163
• /
• 2017

South Korea has experienced various social problems during rapid economic development, and now attempts to address them through social economy and advanced technologies. This approach, however, requires comprehensive research on not only phenomenal issues but also their fundamental causes and regional/cultural contexts as Design Thinking Process does. This study aims to draw implications for applying Design Thinking Process into the entire process of solving social problems, from field research, idea refinement, and solution design. Limitations of Design Thinking-based social problem solving are also drawn through comparative analysis on various cases. In conclusion, the process of refining ideas and developing product/service can be utilized by social enterprises, ventures, NGOs, etc. as a guideline in addressing social problems.

• Korean Journal of Construction Engineering and Management
• /
• v.14 no.6
• /
• pp.30-37
• /
• 2013

Idea creation is the most important step in the overall value engineering (VE) process. Usually the activity is done mostly relying on the experience and knowledge of the experts in the VE team. A more organized approach is needed to find the chance of design improvement during a VE workshop. This study presents an organized approach to increasing the chance of idea creation during the VE workshop. The concept of conflict resolution in TRIZ (Theory of Inventive Problem Solving) is applied to understand the problem area during design improvement. The technical parameters were identified in the problem area to explain the conflicts in design improvement. These technical parameters were used to assist problem solving and improve design functions. A case study was done on a temporary construction operation, and demonstrated that the organized idea creation can help improve the design value of the temporary construction operation.

• Journal of Agricultural Extension & Community Development
• /
• v.5 no.1
• /
• pp.31-44
• /
• 1998

An environmental problem is the important issue of mankind. It should be treated main discourse in our period. There are many assertions related to environment but they are not to be clearly classified because of miscellaneous paradigm. It is possible to classify into two category on the basis of human attitude toward nature and environmental problem. One of them is anthropocentrism and the other is ecocentrism. This classification is helpful to understand various environmental discourses. Owing to different paradigm approach, anthropocentrism and ecocentrism have different concept for environmental problem. Anthropocentrism is powerful to the real life in behalf of economic rationalism. But ecocentrism is important for the only settlement of environmental problem in ecocentric perspectives. Therefore a new scheme for environmental problem solving is necessary through combining the merits of anthropocentrism and ecocentrism.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.191-194
• /
• 2003

Location-allocation problem is known as one of the important problem faced in Industrial Engineering and Operations Research fielde. There are many variations on this problem for different applications, however, most of them consider no obstacle existing. Since the location-allocation problem with obstacles is very complex and with many infeasible solutions, no direct method is effective to solve it. In this paper we propose a hybrid Genetic Algorithm (hGA) method for solving this problem. The proposed hGA is based on Lagrangian relaxation method and Dijkstra's shortest path algorithm. To enhance the proposed hGA, a Fuzzy Logic Controller (FLC) approach is also adopted to auto-tune the GA parameters.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.2
• /
• pp.141-147
• /
• 2009

We introduce a noble method to find a variation of the optimal path problem. The problem is to find the optimal decomposition of an original planar region such that the number of paths in the region is minimized. The paths are required to uniformly cover each subregion and the directions of the paths in each sub-region are required to be either entirely vertical or entirely horizontal. We show how we can transform the path problem into a graph s-t cut problem. We solve the transformed s-t cut problem using the Ford-Fulkerson method and show its performance. The approach can be used in zig-zag milling and layerd manufacturing.

• Proceedings of the KIEE Conference
• /
• 2006.11a
• /
• pp.222-224
• /
• 2006

This paper addresses a particle swarm optimization-based approach for solving a generating unit maintenance scheduling problem(GMS) with some constraints. We focus on the power system reliability such as reserve ratio better than cost function as the objective function of GMS problem. It is shown that particle swarm optimization-based method is effective in obtaining feasible schedules such as GMS problem related to power system planning and operation. In this paper, we find the optimal solution of the GMS problem within a specific time horizon using particle swarm optimization algorithm. Simple case study with 16-generators system is applicable to the GMS problem. From the result, we can conclude that PSO is enough to look for the optimal solution properly in the generating unit maintenance scheduling problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.345-357
• /
• 1998

This paper focuses on production planning and scheduling problems in an assembly system operating on a make-to-order basis. Due dates are considered as constraints in the problems, that is, tardiness is not allowed. Since the planning problem is a higher-level decision making than the scheduling problem, the scheduling problem is solved using a production plan obtained by solving the planning problem. We suggest heuristic procedures in which aggregated information is used when the production planning problem is solved while more detailed information is used when the scheduling problem is solved. Since a feasible schedule may not be obtained from a production plan, an iterative approach is employed in the two procedures to obtain a solution that is feasible for both the production planning and scheduling problems. Computational tests on randomly generated test problems are done to show the performance of these algorithms, and results are reported.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.5
• /
• pp.542-554
• /
• 1997

In this paper, we present a resource conscious approach to designing distributed real-time systems as an extension of our original approach [8][9] which was limited to single processor systems. Starting from a given task graph and a set of end-to-end constraints, we automatically generate task attributes (e.g., periods and deadlines) such that (i) the task set is schedulable, and (ii) the end-to-end timing constraints are satisfied. The method works by first transforming the end-to-end timing constraints into a set of intermediate constraints on task attributes, and then solving the intermediate constraints. The complexity of constraint solving is tackled by reducing the problem into relatively tractable parts, and then solving each sub-problem using heuristics to enhance schedulability. In this paper, we build on our single processor solution and show how it can be extended for distributed systems. The extension to distributed systems reveals many interesting sub-problems, solutions to which are presented in this paper. The main challenges arise from end-to-end propagation delay constraints, and therefore this paper focuses on our solutions for such constraints. We begin with extending our communication scheme to provide tight delay bounds across a network, while hiding the low-level details of network communication. We also develop an algorithm to decompose end-to-end bounds into local bounds on each processor of making extensive use of relative load on each processor. This results in significant decoupling of constraints on each processor, without losing its capability to find a schedulable solution. Finally, we show, how each of these parts fit into our overall methodology, using our previous results for single processor systems.