• 대한전자공학회논문지
• /
• 제27권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 하계학술대회 논문집 A
• /
• 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.

• 한국문헌정보학회지
• /
• 제57권3호
• /
• pp.143-161
• /
• 2023

본 연구에서는 대학생의 전체 역량 측정이 아니라 문제해결역량의 향상도를 측정하기 위해 프로젝트 수업을 진행한 후 학생들의 창의적 문제해결역량이 실제로 수업을 통해서 향상되는지를 확인해 보고자 하였다. 이를 위해 문헌연구, 프로젝트 수업 설계, 프로젝트 수업 전후의 역량조사 및 분석 과정을 거쳤으며, 연구결과는 다음과 같다. 첫째, 프로젝트 수업전과 수업 후의 학생들의 창의적 문제해결역량은 어느 정도 향상되는지 측정한 결과, 창의적 문제해결 역량을 이루는 문제인식, 분석적 사고, 융통적 사고, 대안발견, 도전적 태도 등 5개 역량이 모두 향상된 것으로 측정되었다. 둘째, 위 5개의 역량간 상관관계가 모두 상호 유의미하게 나타났으며, 특히 높은 상관관계를 나타낸 것은 문제인식과 대안발견, 문제인식과 분석적 사고, 분석적 사고와 대안발견 순이다. 향후, 본 연구의 일반화를 위해 다른 형태의 수업 및 타 대학이나 학과에 적용하는 연구가 수행될 필요가 있다고 본다.

• 한국컴퓨터정보학회논문지
• /
• 제11권1호
• /
• pp.11-18
• /
• 2006

LAD(Logical Analysis of Data)는 Boolean-logic에 기반을 둔 데이터 마이닝 방법론이다. LAD에 의한 데이터 분석 시 중요한 과정은 데이터 집합에 숨겨진 구조적 정보를 패턴의 형식으로 발견해내는 패턴 생성 단계이다. 기존의 패턴 생성 방법은 열거법에 기반을 두고 있어 높은 차수의 패턴을 생성하는 것은 실질적으로 불가능하였다. 본 논문에서는 최적화에 기반을 둔 패턴 생성 방법론을 제안하고 혼합 정수 선형 모형과 SCP(Set Covering Problem)의 두 가지 모형을 제안한다. 기계학습 분야에서 널리 쓰이는 데이터 집합에 대해 제안된 패턴 생성 방법을 이용한 분석 실험을 통하여 기존의 패턴 생성 방법으로는 생성될 수 없는 패턴을 쉽게 생성하는 효율성을 입증하였다.

• 대한기계학회논문집A
• /
• 제20권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.

• 품질경영학회지
• /
• 제16권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년도 춘계 학술대회논문집
• /
• 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.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2001년도 추계학술대회 논문집
• /
• 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
• /
• 제3권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.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권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.