• 제목/요약/키워드: Maximum flow

검색결과 3,397건 처리시간 0.026초

Augmenting Quasi-Tree Search Algorithm for Maximum Homogenous Information Flow with Single Source/Multiple Sinks

  • Fujita, Koichi;Watanabe, Hitoshi
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -1
    • /
    • pp.462-465
    • /
    • 2002
  • This paper presents a basic theory of information flow from single sending point to multiple receiving points, where new theories of algebraic system called "Hybrid Vector Space" and flow vector space play important roles. Based on the theory, a new algorithm for finding maximum homogenous information flow is proposed, where homogenous information flow means the flow of the same contents of information delivered to multiple clients at a time. Effective multi-routing algorithms fur tree-shape delivery rout search are presented.

  • PDF

Pier Scour Prediction in Pressure Flow

  • Choi, Gye-Woon;Ahn, Sang-Jin;Kim, Jong-Sup
    • Korean Journal of Hydrosciences
    • /
    • 제6권
    • /
    • pp.23-37
    • /
    • 1995
  • In this experimental paper, the maximum scour depth at pier was student. The model of the pier of San Gye bridge in the Bocheong stream was set for the experimental studies. Several model verification processes were conducted through the roughness comparisons between model and prototype, pursuing scour depth variations with time depending upon channel bed variation, the comparison of the ratios between falling velocities and shear velocities in the model and prototype, and the comparison of pier scour depths between experimental data and field measuring data. The experiments were conducted in the free flow conditions and pressure flow conditions. The maximum scour depth at piers in the pressure flow conditions is almost twice as much as compared to the free flow conditions. Also, the maximum scour depth variations are indicated in the figures based on the Froude numbers, opening ratios, water depths and approaching angles in the free surface flow conditions.

  • PDF

최대유통문제에서 MVA를 결정하는 방법에 관한 연구 (A Study on a Method of Determining the Most Vital Arc in the Maximum Flow Problem)

  • 정호연
    • 산업경영시스템학회지
    • /
    • 제19권40호
    • /
    • pp.263-269
    • /
    • 1996
  • The most vital arc in the maximum flow problem is that arc whose removal results in the greatest reduction in the value of the maximal flow between a source node and a sink node. This paper develops an algorithm to determine such a most vital arc(MVA) in the maximum flow problem. We first define the transformed network corresponding In a given network in order to compute the minimal capacity for each candidate arc. The set of candidate arcs for a MVA consists of the arcs whose flow is at least as greate as the flow over every arc in a minimal cut As a result, we present a method in which the MVA is determined more easily by computing the minimal capacity in the transformed network. The proposed method is demonstrated by numerical example.

  • PDF

Finding the Maximum Flow in a Network with Simple Paths

  • Lee, Seung-Min;Lee, Chong-Hyung;Park, Dong-Ho
    • Communications for Statistical Applications and Methods
    • /
    • 제9권3호
    • /
    • pp.845-851
    • /
    • 2002
  • An efficient method is developed to obtain the maximum flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.

유동해석을 통한 터보차저 형상 연구 (A Study on the Configuration of Turbo Charger through Flow Analysis)

  • 한문식;조재웅
    • 한국기계가공학회지
    • /
    • 제17권3호
    • /
    • pp.34-38
    • /
    • 2018
  • Recently, the turbo charger has become an important part because it yields little displacement and high power while downsizing the engine's fuel ratio for environmental purposes. In this study, flow analysis was conducted to form the basis of data regarding the best efficiency. The axial displacement was changed from none to 25 mm by controlling the configuration of the turbo charger and the flow analyses were compared with each other. The maximum rate of the outlet of model 1 was 46.36 m/s and the maximum pressure of model 4 was 0.761946 Pa. The maximum flow rate of model 4 was 0.000187650 kg/s. This study's result should aid in the effective design of a turbo charger with high performance.

최대유통문제의 단수치명호 결정 방법 (Determining the Single Most Vital Arc in the Maximum Flow Problem)

  • 정호연;안재근;박순달
    • 한국경영과학회지
    • /
    • 제25권2호
    • /
    • pp.115-124
    • /
    • 2000
  • The most vital arc in the maximum flow problem is that arc whose removal results in the greatest reduction in the value of the maximal flow between a source node and a sink node. This paper develops an algorithm to determine such a most vital arc in the maximum flow problem. We first define the transformed network corresponding to a given network in order to compute the minimal capacity for each candidate arc. The set of candidate arcs for single most vital arc consists of the arcs whose flow is at least as great as the flow over every arc in a minimal cut. As a result we present a method in which the most vital arc is determined more easily by computing the minimal capacity in the transformed network. the proposed method is demonstrated by numerical example and computational experiment.

  • PDF

연속알고리듬을 이용한 연계선로의 송전운용한계 결정 (A Method of Determining the Maximum Interface Flow Limit Using Continuation Algorithm)

  • 김슬기;송화창;이병준;권세혁
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제49권2호
    • /
    • pp.78-84
    • /
    • 2000
  • This paper introduces a method of determining the maximum real power transfer limit of interface lines, which connect two areas of a power system, using locally parameterized continuation algorithm. This method traces the path of power flow solutions as interface flow is gradually increased under a certain load demand condition and finds the steady state voltage stability limit, the interface flow limit. Voltage stability index is used to indicate how close the maximum limit is reached. Also, this study presents a procedure to determine the security-constrained interface flow limit using the above method. Contingency ranking index is proposed to identify the severity of contingencies. The case study is performed according to the suggested procedure.

  • PDF

최대유통문제에서 유전알고리듬을 적용한 치명호 결정방법

  • 정호연;김은영;안재근;박순달
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 1998년도 추계학술대회 논문집
    • /
    • pp.282-285
    • /
    • 1998
  • The purpose of this study is to present a method for determining the k most vital arcs in the maximum flow problem using a heuristic method. Generally, the problem which determine the k most vital arcs in maximum flow problem has known as NP-hard. Therefore, in this study we propose a method for determining all the k most vital arcs in maximum flow problem using a genetic algorithm. The proposed algorithm found all alternatives within shorter time than other heuristic methods. The method presented in this study can determine all the alternatives when there exists other alternative solutions.

  • PDF

최대유통문제에서 k-MVA를 결정하는 방법 (A Method for Determining the k Most Vital Arcs in Maximum Flow Problem)

  • 정호연
    • 한국국방경영분석학회지
    • /
    • 제25권2호
    • /
    • pp.106-116
    • /
    • 1999
  • The purpose of this study is to present a method for determining the k most vital arcs in the maximum flow problem using genetic algorithms. Generally, the problem which determine the k most vital arcs in maximum flow problem has known as NP-hard. Therefore, in this study we propose a method for determining all the k most vital arcs in maximum flow problem using genetic algorithms. First, we propose a genetic algorithm to find the k most vital arcs removed at the same time and then present the expression and determination method of individuals compatible with the characteristics of the problem, and specify the genetic parameter values of constitution, population size, crossover rate, mutation rate and etc. of the initial population which makes detecting efficiency better. Finally, using the proposed algorithms, we analyzed the performance of searching optimal solution through computer experiment. The proposed algorithms found all alternatives within shorter time than other heuristic methods. The method presented in this study can determine all the alternatives when there exists other alternative solutions.

  • PDF

관류홴의 최대유량역에서 설계인자 변화에 따른 공력성능 특성에 관한 실험적 연구 (Experimental Study on the Aerodynamic Performance Characteristics for Various Design Factors in the Maximum Flowrate Range of a Cross-Flow Fan)

  • 김장권
    • 동력기계공학회지
    • /
    • 제9권3호
    • /
    • pp.44-49
    • /
    • 2005
  • The aerodynamic performance of an indoor room air-conditioner using a cross-flow fan is strongly influenced by the various design factors of a rear-guider and a stabilizer. The purpose of this study is to investigate the effects of a rear-guider and a stabilizer on the aerodynamic performance in the maximum flowrate range of a cross-flow fan. The design factors considered in this study are a rear-guider clearance, a stabilizer cutoff clearance, and a stabilizer setup angle, respectively. Aerodynamic performances including maximum flowrate and power show the biggest magnitude distribution in the case of $45^{\circ}$, the stabilizer setup angle as well as nearly similar magnitude distribution regardless of the stabilizer cutoff clearances. Moreover, the more a rear-guider clearance increases, the more the magnitude of maximum flowrate and power increases.

  • PDF