• 한국수자원학회논문집
• /
• 제36권1호
• /
• pp.87-104
• /
• 2003

지표면 유출과 하천 유출 통으로 구성된 동일한 홍수유출모형 SIRG-RS를 소유역과 대유역에 적용하였다. 지표면 유출로부터의 유입 방법, 하천 접합부에서의 계산방법, 급경사 산지하천에서의 에너지손실 계산 등에서 개선책을 강구하였다. 마찰력 산정을 위하여 레이놀즈수와 조고비의 함수인 지수형 마찰계수 산정식을 도입하였다. 또한 지수형 마찰계수 산정식은 실험자료뿐 아니라 최근 입수한 현장 관측자료를 사용하여 개선하였다. 개선된 모형은 대규모의 유역과 아주 작은 크기의 소유역에도 적용하였는데, 두 가지 경우 모두 관측자료와 비교하여 양호한 계산 결과를 얻었다.

• 대한전기학회논문지:전력기술부문A
• /
• 제54권6호
• /
• pp.293-305
• /
• 2005

This paper describes an improved Prony method in its speed, accuracy and reliability by efficiently determining the optimal sampling interval with use of DFT (discrete Fourier transformation). In the Prony method the computation time is dominated by the size of the linear prediction matrix, which is given by the number of data times the modeling order The size of the matrix in a general Prony method becomes large because of large number of data and so does the computation time. It is found that the Prony method produces satisfactory results when SNR is greater than three. The maximum sampling interval resulting minimum computation time is determined using the fact that the spectrum in DFT is inversely proportional to sampling interval. Also the process of computing the modes is made efficient by applying Hessenberg method to the companion matrix with complex shift and computing selectively only the dominant modes of interest. The proposed method is tested against the 2003 KEPCO system and found to be efficient and reliable. The proposed method may play a key role in monitoring in real time low frequency oscillations of power systems .

• 한국조명전기설비학회:학술대회논문집
• /
• 한국조명전기설비학회 2001년도 학술대회논문집
• /
• pp.17-22
• /
• 2001

This paper gave a review of form factor computations in the luminous flux transfer method and practical application of DiLaura's recently developed form factor computation. A systematic analysis of how the results of a contour integration solution differ from those of existing numeric solutions were undertaken with a developed computer simulation program. Various situations between sending and receiving surfaces were considered, including the facing, size, and distance between surfaces.

• East Asian mathematical journal
• /
• 제35권5호
• /
• pp.597-612
• /
• 2019

In this study, we propose a new logarithmic barrier approach to solve linear programming problem using the projective method of Karmarkar. We are interested in computation of the direction by Newton's method and of the step-size using minorant functions instead of line search methods in order to reduce the computation cost. Our new approach is even more beneficial than classical line search methods. We reinforce our purpose by many interesting numerical simulations proved the effectiveness of the algorithm developed in this work.

• 한국컴퓨터산업학회논문지
• /
• 제3권12호
• /
• pp.1669-1678
• /
• 2002

대칭 영역 탐색은 대칭 정보를 이용하여 사전 정보없이 얼굴영역을 추출 할 수 있다. 그러나 눈, 코, 입등과 같은 얼굴의 특징 부위보다 탐색할 마스크의 크기가 커져야 함으로 이 방법은 계산 시간이 많이 걸린다. 본 논문에서는 얼굴 영상에 대하여 사전 정보 없이, 적은 계산량으로 얼굴 영역 추출이 간으하도록 대칭 영역 탐색을 이용한 축소 영상에서의 얼굴 영역의 추출과 그 특징에서의 대칭값에 따른 영상을 이용하여 원영상에서는 영역 분할을 통한 얼굴 영역 추출 방법을 제안하고 실험을 통하여 이를 확인하였다.

• 정보처리학회논문지A
• /
• 제8A권2호
• /
• pp.179-188
• /
• 2001

We analyze the property of candidate node set in the network graph, and propose an algorithm to decrease shortest path-finding computation time by using multiple dynamic-range queue(MDRQ) structure. This MDRQ structure is newly created for effective management of the candidate node set. The MDRQ algorithm is the shortest path-finding algorithm that varies range and size of queue to be used in managing candidate node set, in considering the properties that distribution of candidate node set is constant and size of candidate node set rapidly change. This algorithm belongs to label-correcting algorithm class. Nevertheless, because re-entering of candidate node can be decreased, the shortest path-finding computation time is noticeably decreased. Through the experiment, the MDRQ algorithm is same or superior to the other label-correcting algorithms in the graph which re-entering of candidate node didn’t frequently happened. Moreover the MDRQ algorithm is superior to the other label-correcting algorithms and is about 20 percent superior to the other label-setting algorithms in the graph which re-entering of candidate node frequently happened.

• 인터넷정보학회논문지
• /
• 제5권1호
• /
• pp.59-66
• /
• 2004

대칭 영역 탐색은 대칭 정보를 이용하여 사전 정보 없이 얼굴영역을 추출 할 수 있다. 그러나 눈, 코, 입 등과 같은 얼굴의 특징 부위보다 탐색할 마스크의 크기가 커져야 함으로 이 방법은 계산 시간이 많이 걸린다. 본 논문에서는 얼굴 영상에 대하여 사전 정보 없이, 적은 계산량으로 얼굴 영역 추출이 가능하도록 대칭 영역 탐색 및 웨이블릿 변환을 이용하여 얼굴 영역의 추출과 그 특징에서의 대칭간에 따른 영상을 이용하여 원영상에서는 영역 분할을 통한 얼굴 영역 추출 방법을 제안하고 실험을 통하여 이를 확인하였다.

• 한국조명전기설비학회:학술대회논문집
• /
• 한국조명전기설비학회 2003년도 학술대회논문집
• /
• pp.97-102
• /
• 2003

Ground in must choose enough sectional area of conductor endurably in maximum fault current, fault duration time, maximum allowable temperature and have strong durability and life-time can bear enough from spontaneous corrosion or electrolytic corrosion and must choose material that problem does not exist electrically and mechanically when connection or junction. In this paper, modeled new ground wire size numerical formula, and examine and compare of modeled numerical formula and abroad regulation, and proved and analyzed validity of the new ground wire size computation method because do simulation to computer program.

• 대한수학회논문집
• /
• 제18권4호
• /
• pp.745-754
• /
• 2003

Maximum clique problem is to find a maximum clique(largest in size) in an undirected graph G. We present a method that computes either a maximum clique or an upper bound for the size of a maximum clique in G. We show that this method performs well on certain class of graphs and discuss the application of this method in a branch and bound algorithm for solving maximum clique problem, whose efficiency is depended on the computation of good upper bounds.

• 방사성폐기물학회지
• /
• 제18권1호
• /
• pp.19-29
• /
• 2020

This paper gives two graph-based algorithms for radioactive decay computation. The first algorithm identifies the connected components of the graph induced from the given radioactive decay dynamics to reduce the size of the problem. The solutions are derived over the precalculated connected components, respectively and independently. The second algorithm utilizes acyclic structure of radioactive decay dynamics. The algorithm evaluates the reachable vertices of the induced system graph from the initially activated vertices and finds the minimal set of starting vertices populating the entire reachable vertices. Then, the decay calculations are performed over the reachable vertices from the identified minimal starting vertices, respectively, with the partitioned initial value over the reachable vertices. Formal arguments are given to show that the proposed graph inspired divide and conquer calculation methods perform the intended radioactive decay calculation. Empirical efforts comparing the proposed radioactive decay calculation algorithms are presented.