Browsing by Author "Lee, JG"

Now showing 1 - 4 of 4

An enhanced zero-one optimal path set selection method
(1997-11-01)
Chung, CG
;
Lee, JG
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
One issue in structural program testing is how to select a mimimal set of test paths to meet certain test requirements. This is referred to as the optimal path set selection problem. The previously proposed zero-one optimal path set selection method is a generalized method that can be applied to most coverage criteria. However, the major drawback of this method is that for a large program the computation may take ten or more hours because the computation is exponentially proportional to the number of candidate paths and proportional to the number of components to be covered. To alleviate the drawback, this paper enhances the method by (1) defining five reduction rules, and (2) reusing previously selected path sets to reduce both the number of candidate paths and the number of components to be covered. Since both the number of candidate paths and the number of components to be covered are reduced, the computation time can be greatly reduced. In addition, an efficient approach to handling infeasible paths is proposed. An evaluation of the enhanced zero-one method, the original zero-one method, and a greedy method is executed and the result is presented. (C) 1997 Elsevier Science Inc.
An enhanced zero-one optimal path set selection method
(1997-11-01)
Chung, CG
;
Lee, JG
;
資訊工程學系
;
Department of Computer Science
One issue in structural program testing is how to select a mimimal set of test paths to meet certain test requirements. This is referred to as the optimal path set selection problem. The previously proposed zero-one optimal path set selection method is a generalized method that can be applied to most coverage criteria. However, the major drawback of this method is that for a large program the computation may take ten or more hours because the computation is exponentially proportional to the number of candidate paths and proportional to the number of components to be covered. To alleviate the drawback, this paper enhances the method by (1) defining five reduction rules, and (2) reusing previously selected path sets to reduce both the number of candidate paths and the number of components to be covered. Since both the number of candidate paths and the number of components to be covered are reduced, the computation time can be greatly reduced. In addition, an efficient approach to handling infeasible paths is proposed. An evaluation of the enhanced zero-one method, the original zero-one method, and a greedy method is executed and the result is presented. (C) 1997 Elsevier Science Inc.
An optimal representative set selection method
(2000-01-15)
Lee, JG
;
Chung, CG
;
資訊工程學系
;
Department of Computer Science
The optimal representative set selection problem is defined thus: given a set of test requirements and a test suite that satisfies all test requirements, find a subset of the test suite containing a minimum number of test cases that still satisfies all test requirements. Existing methods for solving the representative set selection problem do not guarantee that obtained representative sets are optimal (i.e, minimal). The enhanced zero-one optimal path set selection method [C.G. Chung, J.G. Lee, An enhanced zero-one optimal path set selection method, Journal of Systems and Software, 39(2) (1997) 145-164] solves the so-caned optimal path set selection problem, and can be adapted to solve the optimal representative set selection problem by considering paths as test cases and components to be covered (e.g. branches) as test requirements. (C) 2000 Elsevier Science B.V. All rights reserved.
Elearning for teachers on water environment education
(2005)
Lee, JG
;
Su, F
;
Chan, CL
;
Shan, HY
;
友訊交大聯合研發中心
This paper introduces a 3-year eLearning program for teachers on water environment education co-sponsored by the Ministry of Education, the Environmental Protection Agency, and the Water Resources Agency for the school teachers to disseminate the core knowledge on water environment to facilitate nationwide water education. This is the most extensive eLearning program for teachers on water environment education in Taiwan. A total of ninety hours of eLearning courses will be offered to the school teachers from 2004 to 2007. The first 30-hour eLearning courses offered in year 2004 attracted 1,576 participants, among which 56% are elementary school teachers. On the other hand, 80% of the participants are 21 to 40 years old. Seventy two percent of the participants joined the program by self-motivation to enrich their own knowledge, while another 25% participated in order to improve their teaching performance. With the success of the program in 2004, the Ministry of Education not only continues its support but also set a challenging goal to train more than 160,000 participants from now to year 2008.