• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.7
• /
• pp.1118-1127
• /
• 1990

In this paper a new test generation method for Domino CMOS logic circuits is proposed. Because the stuck-at type fault is not adequate for Domino CMOS circuits the stuck-open fault, stuck-on fault and bridging fault are considered as fault models. It is shown that the test generation problem of Domino CMOS circuits results in functional block test generation problem. Test set is generated by using the logic minimizer which is a part of logic design system. An algorithm for reduction of test set is described. The proposed test method can be easily applied to various figures of circuits and make it easy to construct automatic test generator in design system. The proposed algorithms are programed and their efficiency is confirmed by examples.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.302-304
• /
• 2003

This paper presents the methods to solve the problem about Power System Protection Program(PROSET). PROSET is a overall program system to protect power system and correct it. In the context of the PROSET, it is so difficult to edit database data when topology is changed. When the renewal of data is performed, all changed values are disappeared. Therefore, it will not be expected to know the present situation by using the information of the databases data. So it is necessary to solve this problem. Solution is copy of the user. Database of GRL,GRZ,KYP2D1,KYD2X1,L90 Relay module were developed. We made a database management system for PROSET, therefore I will show this management system briefly.

• Journal of the Korean Society for Library and Information Science
• /
• v.57 no.3
• /
• pp.143-161
• /
• 2023

The purpose of this study was to investigate whether students' creative problem-solving skills improve through project-based courses. Rather than measuring overall competencies, the focus was specifically on measuring the improvement of problem-solving skills. The study involved a literature review, the design of project-based courses, and the assessment and analysis of students' competencies before and after the courses. The results of the study are as follows: Firstly, the measurement of students' creative problem-solving skills before and after the project-based courses indicated an overall improvement in the five dimensions of problem identification, analytical thinking, flexible thinking, alternative generation, and a proactive attitude. Secondly, significant correlations were found among these five dimensions, particularly strong correlations were observed between problem identification and alternative generation, problem identification and analytical thinking, and analytical thinking and alternative generation. To generalize the findings of this study, further research is needed to apply similar approaches in different types of courses and across various universities and departments.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.11-18
• /
• 2006

The logical analysis of data(LAD) is a Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a novel optimization-based pattern generation methodology and propose two mathematical programming models, a mixed 0-1 integer and linear programming (MILP) formulation and a well-studied set covering problem (SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with ease patterns of high complexity that cannot be generated with the conventional approach.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.6
• /
• pp.1827-1835
• /
• 1996

This paper addresses the problem of a torch path generation for the 2D laser cutting of a stock plate nested with resular or irregular parts. Under the constaint of the relative positions of parts enforced by nesting, the developed torch path algorithm generate feasible cutting path. In this paper, the basic object is a polygon( a many-slide figure) with holes. A part may be represented as a number of line segments connected end-to-end in counterclockwise order, and formed a closed contour as requied for cutting paths. The objective is to tranverse this cutting contours with a minimum path length. This paper proposes a simulated annealing based dtorch path algorithm, that is an improved version of previously suggested TSP models. Since everypiercing point of parts is not fixed in advance, the algorithm solves as relazed optimization problem for the constraint, thich is one of the main features of the proposed algorithm. For aolving the torch path optimization problem, an efficient generation mechanism of neighborhood structure and as annealing shedule were introduced. In this way, a global solution can be obtained in a reasonable time. Seveeral examples are represented to ilustrate the method.

• Journal of Korean Society for Quality Management
• /
• v.16 no.1
• /
• pp.32-42
• /
• 1988

The general n/m job-shop problem is easy to state what is required, but it is extremely difficult to make any progress whatever toward a solution. This paper was first to examine a heuristic procedure of general n/m scheduling generation focused on the procedure of MWRK (Most Work Remaining) presented by Giffler and Thompson (1960) among others. Then modified procedure was proposed to obtain better solution in light of the key measure of performance compared with that of the literature presented by Baker (1974). The modified procedure then has been extended to other example problem to test the better results and to assure the properness of application.

• 한국전산유체공학회:학술대회논문집
• /
• 1998.05a
• /
• pp.55-60
• /
• 1998

An elliptic grid generation scheme using Laplace's equations guarantees the resulting grids to be crossing-free as a result of maximum principle in its analytic form. Numerical results, however, often show the grid lines overlapping each other or crossing the boundaries, especially for very sharp convex corners. The cause of this problem is investigated, and it is found that this problem can be handled by properly modifying the coefficients of transformed Laplace's equations in the computational domain.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.124-127
• /
• 2001

We consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it based on column generation technique and variable fixing. We devise a branch-and-price algorithm to solve the column generation problem. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.92-99
• /
• 2004

We consider the ATM switching node location problem (ANLP). In this problem, there are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities. We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub via installed remote facilities with minimum cost, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we present a preprocessing procedure to tighten the formulation and develop a branch-and-price algorithm. In the algorithm, we consider the integer knapsack problem as the column generation problem. Computational experiments show that the algorithm gives optimal solutions in a reasonable time.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.9
• /
• pp.521-528
• /
• 2004

The demise of the native franchise markets and the emergence of competitive markets in electricity generation service is substantially altering the way that operation and planning activity is conducted and is making it increasingly difficult for market participants such as generation firms to prospect the future electricity markets. Traditional generation expansion planning (GEP) problems which centrally determine the least-cost capacity addition plan that meets forecasted demand within pre-specified reliability criteria over a planning horizon (typically 10 to 20 years) is becoming no more valid in competitive market environments. Therefore, it requires to develop a new methodology for generation investments, which is applicable to the changed electric industry business environments and is able to address the post-privatization situation where individual generation firms seek to maximize their return on generation investments against uncertain market revenues. This paper formulates a new generation expansion planning problem and solve it in a market-oriented manner.