• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집D
• /
• pp.175-180
• /
• 2001

In this study, the minimum heat flux conditions are experimentally investigated for the spray cooling of hot plate. The hot plates are cooled down from the initial temperature of about $900^{\circ}C$, and the local heat flux and surface temperatures are calculated from the measured temperature-time history. The results show that the minimum heat flux point temperatures increase linearly resulting from the propagation of wetting front with the increase of the distance from the stagnation point of spray flow. However, in the wall region, the minimum heat flux point temperature becomes independent of the distance. Also, the experimental results show that the velocity of wetting front increases with the increase of the droplet flow rate.

• 한국정보과학회논문지:시스템및이론
• /
• 제26권11호
• /
• pp.1437-1445
• /
• 1999

n개의 꼭지점을 가진 단조(monotone) 다각형은 2차원 평면상의 임의의 선분에 단조 적인 2개의 체인으로 구성된다. 단조 다각형의 내부를 경로 상에서 모두 감시할 수 있는 최소 링크를 가진 경비원 경로(watchman route with minimum links)는 최소 개수의 선분으로 구성된 경로로서 하나 이상 존재할 수 있다. 본 논문에서는 단조 다각형의 최소 링크를 가진 경비원 경로들 중에서 최단 경비원 경로를 구하는 O(n) 시간의 알고리즘을 제시한다.Abstract A monotone polygon consists of n vertices and is a union of two monotone chains with respect to some line segment in the plane. A watchman route with minimum-links is a polygonal path such that each point in the interior of the polygon can be visible from at least one point along the route. There may be more than one watchman route with minimum links for given monotone polygon. In this paper, we present an algorithm with O(n) time that finds a shortest watchman route among the watchman routes with minimum links in a monotone polygon.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권11호
• /
• pp.786-792
• /
• 2004

A wavelet based ECG data compression has become an attractive and efficient method in many mobile tele-cardiology applications. But large data size required for high compression performance leads a serious delay. In this paper, new wavelet compression method with minimum delay is proposed. It is based on deciding the type and compression ratio(CR) of block organically according to the standard deviation of input ECG data with minimum block size. Compression performances of the proposed algorithm for different MIT ECG Records were analyzed comparing other ECG compression algorithm. In addition to the processing delay measurement, compression efficiency and reconstruction sensitivity to error were also evaluated via random noise simulation models. The results show that the proposed algorithm has both lower PRD than other algorithm on same CR and minimum time in the data acquisition, processing and transmission.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2001년도 춘계학술대회논문집
• /
• pp.997-1002
• /
• 2001

This paper describes an implementation of inverse filter using SVD in order to recover the input in multi-channel system. The matrix formulation in SISO system is extended to MIMO system. In time and frequency domain we investigates the inversion of minimum phase system and non-minimum phase system. To execute an effective inversion of non-minimum phase system, SVD is introduced. First of all we computes singular values of system matrix and then investigates the phase property of system. In case of overall system is non-minimum phase, system matrix has one (or more) very small singular value(s). The very small singular value(s) carries information about phase properties of system. Using this property, approximate inverse filter of overall system is founded. The numerical simulation shows potentials in use of the inverse filter.

• 설비공학논문집
• /
• 제13권10호
• /
• pp.974-981
• /
• 2001

In this study, the minimum heat flux conditions are experimentally investigated for the spray cooling of hot plate. The hot plates are cooled down from the initial temperature of about$ 900^{\circ}C$, and the local heat flux and surface temperatures are calculated from the measured temperature-time history. The results show that the minimum heat flux point temperatures increase linearly resulting from the propagation of wetting front with the increase of the distance from the stagnation point of spray flow. However, in the wall region, the minimum heat flux point temperature becomes independent of the distance. Also, the velocity of wetting front increases with the increase of the droplet flow rate.

• 천문학회지
• /
• 제8권1호
• /
• pp.15-23
• /
• 1975

A new technique of photographic observations is developed for the determination of time of minimum light of eclipsing binary. An instrumental system to accomplish the observation is described. With this instrument the atmospheric extinction coefficients in Seoul are observed, and four times of minimum light for Algol and W UMa are determined.

• 한국경영과학회지
• /
• 제32권4호
• /
• pp.51-60
• /
• 2007

In this study, we consider the minimum ADM problem which is the fundamental problem for the cost-effective design of SONET ADM embedded in WDM ring networks. To minimize the number of SONET ADMs, efficient algorithms for the routing and wavelength assignment are needed. We propose a mathematical model based on the graph theory for the problem and propose a branch-and-price approach to solve the suggested model effectively within reasonable time. By exploiting the mathematical structure of ring networks, we developed polynomial time algorithms for column generation subroutine at branch-and-bound tree. In a computer simulation study, the suggested approach can find the optimal solution for sufficient size networks and shows better performance than the greedy heuristic method.

• 한국경영과학회지
• /
• 제25권3호
• /
• pp.81-89
• /
• 2000

The real-time multicast problem is to construct a multicast tree starting from a source node and including multiple destination nodes and that has minimum network cost with delay constraints. It is known that to find a tree of the minimum network cost is the Steiner Tree problem which is NP-complete. In this paper, we propose a genetic algorithm to solve the multicast tree with minimum network cost and the delay constraints. The computational results obtained by comparing an existing algorithm. Kompella algorithm, and the proposed algorithm show that our algorithm tends to find lower network cost on the average than Kompella algorithm does.

• 대한기계학회논문집
• /
• 제15권5호
• /
• pp.1495-1502
• /
• 1991

본 연구에서는 동일 작업 공간내에서 두대의 로봇이 각각의 토크의 제한 조건 과 충돌 회피 조건을 만족하면서 근사 최소 시간에 지정된 경로를 주행하기 위한 궤적 계획법을 제안하고자 한다. 이때, 동작 우선도에 의하여 한 대의 로봇은 주 로봇, 다른 한 대의 로봇은 종 로봇으로 지정되는데 주 로봇은 입력 토크의 제한조건을 만족 하며 주어진 경로를 최소 시간에 움직이도록 궤적 계획을 하였으며, 종 로봇은 주 로 봇과의 충돌을 피하고 입력 토크의 제한 조건을 만족하며 주어진 경로를 근사 최소 시 간에 움직이도록 하였다.

• 한국국방경영분석학회지
• /
• 제24권2호
• /
• pp.162-169
• /
• 1998

This study presents an single machine scheduling algorithm minimize lateness of product by controlling machining speed. Generally, production scheduling uses the information of process planning. But the production scheduling algorithm has not considered the control of machining speed in its procedures. Therefore, the purpose of this study is to consider the machining speed in production scheduling algorithm for efficient production scheduling. Machining time and machining cost required to manufacture a piece of a product are expressed as a unimodal convex function with respect to machining speed, so it has minimal point at minimum time speed or the minimum cost speed. Therefore, because of considering the machining cost, the control of machining speed for the algorithm is executed between minimum speed and maximum speed. An example is demonstrated to explain the algorithm.