• 제목/요약/키워드: Minimum cut set

검색결과 24건 처리시간 0.024초

최대 수용량-기반 최소절단 알고리즘 (Maximum Capacity-based Minimum Cut Algorithm)

  • 이상운
    • 한국컴퓨터정보학회논문지
    • /
    • 제16권5호
    • /
    • pp.153-162
    • /
    • 2011
  • 최소 절단 문제는 공급처 S에서와 수요처 T로의 흐름 용량이 최소가 되는 지점들을 절단하는 문제이다. 망의 병목지점을 찾는 방법은 대부분 유동망을 계산하여 최소 절단값을 찾는 유동-기반 알고리즘이 적용되고 있다. 이 알고리즘은 최소절단은 제시하지 않는 단점이 있다. 본 논문은 유동망을 구하지 않고 망으로부터 직접 최대 수용량을 가진 정점을 인접한 S 또는 T로 병합하는 방법으로 최소 절단값을 찾는 간단한 알고리즘이다. 13개의 한정된 그래프에 적용한 결과 제안된 알고리즘은 간단하면서도 정확하게 최소 절단 값 $_{\min}c$(S, T)을 찾을 수 있었다.

A Study on Transmission System Expansion Planning using Fuzzy Branch and Bound Method

  • Park, Jaeseok;Sungrok Kang;Kim, Hongsik;Seungpil Moon;Lee, Soonyoung;Roy Billinton
    • KIEE International Transactions on Power Engineering
    • /
    • 제2A권3호
    • /
    • pp.121-128
    • /
    • 2002
  • This study proposes a new method for transmission system expansion planning using fuzzy integer programming. It presents stepwise cost characteristics analysis which is a practical condition of an actual system. A branch and bound method which includes the network flow method and the maximum flow - minimum cut set theorem has been used in order to carry out the stepwise cost characteristics analysis. Uncertainties of the permissibility of the construction cost and the lenient reserve rate and load forecasting of expansion planning have been included and also processed using the fuzzy set theory in this study. In order to carry out the latter analysis, the solving procedure is illustrated in detail by the branch and bound method which includes the network flow method and maximum flow-minimum cut set theorem. Finally, case studies on the 21- bus test system show that the algorithm proposed is efficiently applicable to the practical expansion planning of transmission systems in the future.

한국의 초고령사회를 대비한 최소주거면적 기준의 인체측정학적 방법 연구 - Karl H. E. Kroemer의 인체측정학적 데이터 적용 방법 - (A Study on the Anthropometrical Method of Minimum Residential Space Standard for the Super-Aged Society of Korea - by Anthropometrical Data Application Methods of Karl H. E. Kroemer -)

  • 이호성
    • 의료ㆍ복지 건축 : 한국의료복지건축학회 논문집
    • /
    • 제23권1호
    • /
    • pp.15-24
    • /
    • 2017
  • Purpose: Korea is expected to enter an aged society in 2018 and then a super-aged society in early 2025. The country's aging is progressing faster than any other country in the world. However, the foundation of the elderly friendly industry is weak, and measures at the government level are urgently needed. Especially, housing problems of the elderly are one of the most urgent measures to be taken. Korea does not have the minimum residential area standard for the elderly, and the current general minimum residential area standard is based on the survey of the housing situation without scientific evidence. Therefore, both standards need to be revised as soon as possible based on scientific evidence. Methods: The minimum residential area standard has been calculated following Karl H. E. Kroemer's Min or Max design also being called as-single cut and dual cut theory- as the maximum population value and minimum population value theory of Ernest J. McCormick. Therefore there is a need for a formula made using a few key factors, such as corresponding dimension, practical dimension, clearance, spare dimension, integrated dimension. These elements can be defined and used as formulas to calculate minimum residential area standards. Results: Assuming the results of the spatial variability in this study showed that it is possible to raise the standard of living in a terms of sustainable minimum size for the young, old and all residents. Implications: The government should set a minimum residential area standard with scientific grounds and set up a policy improving the life of people who live in an needy residential environment.

Fuzzy 정수계획법을 이용한 송전망의 확충계획에 관한 연구 (A Study on the Transmission System Expansion Planning using Fuzzy Integer Programming)

  • 김홍식;문승필;이영진;최형림;최재석
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2001년도 추계학술대회 논문집 전력기술부문
    • /
    • pp.350-353
    • /
    • 2001
  • This study proposes a new method for the transmission system expansion planning using the fuzzy integer programming. It presents stepwise cost characteristics analysis which is a practical condition of an actual systems. A branch and bound method which includes the network flow method and the maximum flow-minimum cut set theorem has been used in order to proceed the stepwise cost characteristics analysis. Uncertainties of the permission of the construction cost and not strict reserve rate and load forecasting of expansion planning have been included and also processed using fuzzy set theory in this study. In order to proceed the latter analysis, the solving procedure is illustrated in detail by branch and bound method which includes the network flow method and maximum flow-minimum cut set theorem. Finally, case studies on 21-bus test system show that the algorithm proposed is efficiently applicable to the practical expansion planning of transmission systems in future.

  • PDF

편마암지역 자연사면.절취사면의 안정성 분석 사례 (Analysis of Rock Slope Stability for Natural Slope and Cut Slope of Gneiss Area in Andong, Korea)

  • 김만일;배두원;김종태;채병곤;정교철
    • 지질공학
    • /
    • 제17권2호
    • /
    • pp.289-297
    • /
    • 2007
  • 매년 강우로 인해 발생되는 사면파괴는 많은 재산피해와 인명피해를 발생시키고 있다. 사면재해로부터의 피해저감을 위해 인간의 생활권과 인접한 사면에 대한 지속적인 관리를 통해 이들의 안정성 검토와 보강 대책이 요구된다. 연구지역은 편마암으로 이루어진 암반사면으로써 단층작용으로 인해 대규모 절리군이 형성되어 있는 풍화암 내지 연암의 풍화 특성을 보여준다. 조사사면을 자연사면과 절취사면으로 구분하여 현장자료를 검토한 결과, 자연사면에서는 주 절리군이 형성된 4개 지점에서 평면파괴와 쐐기파괴 가능성이 우세하였으며, 절취사면의 경우 8개 지점에서 쐐기파괴 발생 가능성이 높게 나타났다. 또한 SLIDE 2D에 적용해 이들 사면의 최소안전율에 대한 수치해석 결과에서는 자연사면보다 절취사면의 안정성이 비교적 취약한 것으로 분석되었다.

최대 인접 병합 방법을 적용한 방향 그래프의 병목지점 탐색 알고리즘 (A Bottleneck Search Algorithm for Digraph Using Maximum Adjacency Merging Method)

  • 이상운
    • 한국인터넷방송통신학회논문지
    • /
    • 제12권5호
    • /
    • pp.129-139
    • /
    • 2012
  • 공급처 s와 수요처 t, 호가 수용량을 갖고 있는 방향 그래프 망 $D=(N,A),n{\in}N,a=c(u,v){\in}A$에 대해, 공급처 s에서 수요처 t로의 최대 흐름양은 N을 $s{\in}S$$t{\in}T$의 집합으로 분리시키는 최소절단값이 결정한다. 최소절단을 찾는 대표적인 알고리즘으로는 수행복잡도 $O(NA^2)$의 Ford-Fulkerson이 있다. 이 알고리즘은 가능한 모든 증대경로를 탐색하여 병목지점을 결정한다. 알고리즘이 종료되면 병목지점들의 조합으로 N=S+T의 절단이 되는 최소 절단을 결정해야 한다. 본 논문은 S={s}, T={t}를 초기값으로 설정하고, 망의 최대 수용량 호 $_{max}c(u,v)$를 인접한 S나 T로 병합시키고 절단값을 구하는 최대인접병합 알고리즘을 제안하였다. 최대인접병합 알고리즘은 n-1회를 수행하지만 알고리즘 수행 과정에서 최소절단을 찾는 장점을 갖고 있다. Ford-Fulkerson과 최대인접병합 알고리즘을 다양한 8개의 방향 그래프에 적용한 결과 제안된 알고리즘은 수행복잡도 O(N)인 n-1회 수행 과정에서 최소절단을 쉽게 찾을 수 있었다.

FTA를 이용한 수변전설비의 최소절단집합 도출 (Minimal Cut Set of Electric Power Installations using Fault Tree Analysis)

  • 박영호;김두현;김성철
    • 한국안전학회지
    • /
    • 제32권1호
    • /
    • pp.41-46
    • /
    • 2017
  • In this paper, from making an electrical fire which is thought to be the most damaging among potential dangers as a top event, minimal cut sets (MCS) about it were analyzed. For this, components of a power substation were classified into 15 items. Failure rates and modes were extracted based on Korea Electrical Safety Corporation, IEEE Gold Book, and RAC. To analyze the top event (an electrical fire), main events were assorted into "safety devices for overcurrent" and "ampere meter of detecter". Failure of components was divided into failure of VCB, COS, and MCCB. A fault tree was composed of 3 AND gate, 5 OR gates and 17 basic events. Overlapped events among the basic events are things which occur from relevant components. They were attached to the tree by distinguishing identifiers. In case of FT, two minimal cut sets of "IO_METER", "MF_METER", "DO_MCCB" and "IO_METER", "MF_METER", "DO_VCB" take 46% of electrical fires. Therefore, about basic events which are included in the top two minimum cut sets, strict control is necessary.

Determination of epidemiological tetracycline MIC cut-off value for Vibrio ichthyoenteri

  • Han, Hyun-Ja;Kim, Do-Hyung;Lee, Deok-Chan;Won, Kyoung-Mi;Lee, Soon-Jeong;Cho, Mi-Young;Jee, Bo-Young;Kim, Jin-Woo
    • 한국어병학회지
    • /
    • 제24권2호
    • /
    • pp.95-102
    • /
    • 2011
  • Normalized resistance interpretation (NRI) analysis for tetracycline was applied to generate information on the epidemiological cut-off value for Vibrio ichthyoenteri isolated from diseased olive flounder (Paralichthys olivaceus) larvae. Thus, 42 strains of V. ichthyoenteri were used to determine minimum inhibitory concentration (MIC) values of tetracycline using Etest. Also, 11 tetracycline resistance related genes were investigated by PCR method. Most tetracycline-resistant strains harbored both tetB and tetM with a few exceptions. NRI-derived mean and 2 SD above the mean of theoretical normal distributions of susceptible isolates were 0.33 mg/L and 1.66 mg/L, respectively. The epidemiological cut-off value for V. ichthyoenteri from the calculations could be set to S ${\leq}$ 2 mg/L. Of the 42 strains, 15 were classified as non-wild type (NWT), and MIC values of the NWT strains vary regardless of tetB and tetM detection, suggesting that there may be other mechanisms involved in tetracycline resistance in this Vibrio species.

지중 저장 이산화탄소의 누출 위험도 평가를 위한 결함수 분석 (Fault Tree Analysis for Risk Assessment of CO2 Leakage from Geologic Storage)

  • 이상일;이상기;황진환
    • 환경영향평가
    • /
    • 제18권6호
    • /
    • pp.359-366
    • /
    • 2009
  • CCS (Carbon Capture and Storage) is considered as the most promising interim solution to deal with the greenhouse gas such as $CO_2$ responsible for global warming. Even though carefully chosen geologic formations are known to contain stored gas for a long time period, there are potential risks of leakage. Up to now, applicable risk assessment procedures for the leakage of $CO_2$ are not available. This study presents a basis for risk analysis applicable to a complex geologic storage system. It starts with the classification of potential leakage pathways. Receptors and the leakage effect on them are identified and quantified. Then, a fault tree is constructed, which yields the minimum cut set (i.e., the most vulnerable leakage pathway) and quantifies the probability of the leakage risk through the cut set. The methodology will provide a tool for risk assessment in a CCS project. The outcomes of the assessment will not only ensure the safety of the CCS system but also offer a reliable and efficient monitoring plan.

네트워크 전환문제에 대한 타부 탐색 해법 (A Tabu Search Algorithm for the Network Diversion Problem)

  • 양희원;박성수
    • 한국국방경영분석학회지
    • /
    • 제30권1호
    • /
    • pp.30-47
    • /
    • 2004
  • This research considers a Network Diversion Problem (NDP) in the directed graph, which is to identify a minimum cost set of links to cut so that any communication paths from a designated source node to a destination node must include at least one link from a specified set of arcs which is called the diversion arcs. We identify a redundant constraint from an earlier formulation. The problem is known to be NP-hard, however a detailed proof has not been given. We provide the proof of the NP-hardness of this problem. We develop a tabu search algorithm that includes a preprocessing procedure with two steps for removing diversion arcs as well as reducing the problem size. Computational results of the algorithm on instances of general graphs and grid graphs are reported.