• Educational Technology International
• /
• v.8 no.1
• /
• pp.91-100
• /
• 2007

This paper describes the experiences of three middle school teachers during the year following a two-week summer workshop in which they were introduced to a technology-enhanced problem-based learning (PBL) pedagogy. Based on their collaborative experiences during the school year, developing and implementing a PBL unit, the three teachers increased their confidence in using technology and indicated shifts in their pedagogical beliefs regarding classroom instruction. Results suggest that administrative support, collaboration with other teachers, and the development of a school culture that valued the sharing of teachers' experiences were keys to teachers' successful implementation.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.9 no.13
• /
• pp.51-61
• /
• 1986

The management science was concerned about how to use the main point of the management science model and it's technique by the rational primary factors. The problem's definition, estabilished of the model and it's solving. These function are very difficult and important problems, what is more important, are the model of management science's real prosecution to the manager and management scientist. The management science give us a clue to the solution of a business problem. To get needs conclusion and achieving the estabilished object, we must implement a plan, a stratgem, a policy. If we were not implementing the recommended items, we may call the estabilished model and problem solving impractical, ivory-tower theorizing. But, the implementation of management science model is a complicated problem that is involved mutual relations of managers and management scientist, linkage parts member and the resources of organization. And the other problems of implementation are very complicated problems composed of technologic and economic, social and politic, psychological. This paper reports the implementation of a success that possibly studies a fluent and a chief cause to systematic analysis. Then, first of all I will define of implementation and from these, construction of a unity system, I continue with a catch hold of a main point and a fluent for the successful implementation.

• Journal of Engineering Education Research
• /
• v.8 no.1
• /
• pp.99-112
• /
• 2005

Problem-Based Learning is focused, experiential learning organized around the investigation and resolution of messy, real-world problem. It is both a curriculum organizer and instructional strategy, two complementary processes. The PBL model developed in this study was composed the two components of Problem Design(curriculum organizer) and Problem Implementation(instructional strategy). The basic process of Problem Implementation Model were composed the 8 steps ; 1) the identification of problem, 2) the specification of problem, 3) the exploration and generation for solution, 4) the selecting of best idea, 5) the specific planning of best idea, 6) the implementation and realization, 7) the evaluation, 8) the applying and reflection.

• IE interfaces
• /
• v.13 no.3
• /
• pp.539-547
• /
• 2000

An architecture of a Web-based Decision Support system for mathematical analysis is presented. Front-end modules provide web-client GUI environment for mathematical analysis. The networking architecture is built upon client/server system by Java socket and accesses database by JDBC in WWW. Back-end modules provide decision supporting service and data management for mathematical programming analysis. In the back-end any analysis tools, such as mathematical optimizer, simulation package, or statistics package can be used. As an application example for this implementation, optimal facility replacement decision problem is selected. In the implementation the optimal facility replacement decision problem is formulated as a shortest path problem. It uses Oracle DB and CPLEX package as the mathematical optimizer. While ORAWeb is designed and implemented on the optimal facility replacement problem, it can easily be extended to any decision supporting problems that would require mathematical optimization process.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.183-187
• /
• 2003

In this paper, we describe an implementation method of "set constraints logic language" using the logic language Prolog. "Set constraints logic language" is a programming language with a new paradigm that uses the "set theory" in programming. In this paper, we explain "set constraints problem solver" that has been proposed by A. Dovier and his researchers and we describe an implementation method of this solver using Prolog. We ran easily implement the "set constraints problem solver" in Prolog, since Prolog easily implements nondeterministic problems and provides a data structure railed list. We have applied the language to several application fields to show the usefulness of the language.

• Journal of Positioning, Navigation, and Timing
• /
• v.5 no.1
• /
• pp.37-45
• /
• 2016

In this paper, design and implementation issues for a network-oriented RF emitter localization system with array antenna are discussed. For hardware, the problem of array mismatch and RF/IF channel mismatch are introduced and the calibration schemes for solving those problems are also provided. For software, it is explained how to overcome the drawback of conventional MUltiple Signal Identification and Classification (MUSIC) algorithm in a point of identifying the number of received signals and problems such as Data Association Problem and Ghost Node Problem in regard to multiple emitter localization are presented with some approaches for getting around those problems. Finally, for implementation, a criterion for arranging each of sensors and a requirement for alignment of array antenna' orientation are also given.

• Korean Management Science Review
• /
• v.17 no.2
• /
• pp.1-12
• /
• 2000

In this study, we deals with the implementation of an optimal basis identification procedure for interior point methods. Our implementation is based on Megiddo’s strongly polynomial algorithm applied to Andersen and Ye’s approximate LP construction. Several techniques are explained such as the use of effective indicator for obtaining optimal partition when constructing the approximate LP, the efficient implementation of the problem reduction technique proposed by Andersen, the crashing procedure needed for fast dual phase of Megiddo’s algorithm and the construction of the stable initial basis. By experimental comparison, we show that our implementation is superior to the crossover scheme implementation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.36 no.3
• /
• pp.27-43
• /
• 2011

This paper investigates properties of the newsvendor problem under a schedule involving progressive multiple discounts compared with the standard newsvendor problem under a no-discounts schedule. Unlike most conventional approaches using the criticial fractile to analyze the retailer and/or supplier behavior(s) in the newsvendor problem, our approach uses riskless profit. From the properties revealed through a series of computational experiments, two conjectures regarding the relationship between the expected profits of both newsvendor problems as a generalization over Khouja's argument (1995) are raised. Those conjectures encourage newsvendors who may face budget or warehouse capacity restriction to use the extended model under a multiple-discounts schedule rather than the standard model with no-discounts schedule because they apply for every order quantity as well as the optimal order quantity. In addition to the conjectures, some insightful results are found to justify the implementation of a multiple-discounts schedule from the computational experiments and a new interpretation for implementation of a multiple-discounts schedule that has not been addressed in Khouja is provided.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.217-225
• /
• 1999

Preprocessing is the essential technique in the implementation of the simplex method for large scale linear programming problems. In this research, we explained the effect of preprocessing in the simplex method, classified the techniques into four categories, and compared our results with those of HOPDM, CPLEX and Soplex by computational experiments. We also noted some implementing issues of preprocessing for the simplex method and the recovery of the optimal basis of the original problem from that of the preprocessed problem.

• Journal of the Korean School Mathematics Society
• /
• v.21 no.1
• /
• pp.63-89
• /
• 2018

In this study, the researcher developed a course integrated mathematical problem posing activities in order to enhance pre-service mathematics teachers' ability to carry out problem posing activities in mathematics classroom, and examined the changes of pre-service mathematics teachers' perceptions about problem posing through the course. The problem posing course developed in this study consisted of three stages: education on the theories regarding problem posing; activities with problem posing; development and implementation of problem posing tasks. According to the results of the questionnaires, interviews, and class journals data analysis, the problem posing experiences provided in this study were very effective in improving pre-service mathematics teachers' understanding of the problem posing strategies and the benefit of problem posing activities to student learning. Particularly, the experience in various problem posing activities and the implementation experience of problem posing provided in the course played a key role in the improvement of pre-service mathematics teachers' understanding of problem posing and PCK.