• Journal of the Korea Society of Computer and Information
• /
• v.20 no.3
• /
• pp.107-113
• /
• 2015

This paper presents a polynomial time algorithm to the minimum cardinality feedback edge set and minimum weight feedback edge set problems. The algorithm makes use of the property wherein the sum of the minimum spanning tree edge set and the minimum feedback edge set equals a given graph's edge set. In other words, the minimum feedback edge set is inherently a complementary set of the former. The proposed algorithm, in pursuit of the optimal solution, modifies the minimum spanning tree finding Kruskal's algorithm so as to arrange the weight of edges in a descending order and to assign cycle-deficient edges to the maximum spanning tree edge set MXST and cycle-containing edges to the feedback edge set FES. This algorithm runs with linear time complexity, whose execution time corresponds to the number of edges of the graph. When extensively tested on various undirected graphs both with and without the weighed edge, the proposed algorithm has obtained the optimal solutions with 100% success and accuracy.

• Proceedings of the Korea Contents Association Conference
• /
• 2019.05a
• /
• pp.451-452
• /
• 2019

논문 검색 서비스 응용에서는 공저자, 출판 정보 등을 표현하기 위해서 다양한 정점 레이블 (논문,저자) 및 간선 정보(주저자, 공저자)를 이용하여 그래프로 표현한다. 이와 함께 다양한 간선 특징 정보를 질의로 입력하는 연속 서브 그래프 매칭에 대한 요구가 존재한다. 본 논문에서는 간선의 다양한 특성을 지원하고 색인의 부하를 감소시킨 연속 서브 그래프 매칭 기법을 제안한다. 제안하는 기법은 거리 값과 질의 연관 정보만을 관리하여 간선의 다양한 특성을 지원하는 효율적인 서브 그래프 매칭을 수행한다.

• Electric Engineers Magazine
• /
• v.203 no.7
• /
• pp.24-31
• /
• 1999

간선설비란, 부하로 전력을 공급하기 위한 설비를 말하며 약전 배선에 대한 간선은 포함되지 않는 것이 보통이다. 종류로서는 고압 및 특고압 간선과 저압 간선이 있지만 일반적으로는 변전실의 저압 배전반으로부터 전등 분전반, 동력 제어 반까지의 배전설비를 말한다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.463-463
• /
• 2015

최근 들어 빈번히 발생하는 이상기후에 의한 국지성 집중호우로 내수배제 불량에 따른 도시지역의 내수침수 피해가 잇따르고 있으며, 이로 인한 대책으로 도시지역의 노후화된 우수관거 교체 및 저류시설의 설치 계획이 이루어지고 있다. 그러나 국내 대도시의 경우 저류시설 설치를 위한 부지 확보가 어렵고 우수관거 교체를 위한 예산확보가 어려운 실정이므로 도시지역에서의 홍수피해를 저감하기 위한 우수관거 및 저류시설의 합리적이고 효율적인 설계 기준이 필요하다. 따라서 도심지의 치수능력 향상과 예산 절감을 시킬 수 있는 기존의 우수관거를 연계한 저류지 설계가 필요하다고 판단된다. 따라서 본 연구에서는 기존 우수관거를 연계한 저류지인 간선저류지(가칭)를 설치한 것을 가정하여 연구를 진행하였다. 간선저류지란 도시에 설계빈도 이상의 강우 발생으로 관거의 허용용량을 초과하는 유량에 대해 기존 관거와 연결된 지하저류지에 임시로 저류시켜 내수침수를 방지하기 위한 구조물로 간선저류지에서 저류된 우수는 흐름이 원활한 하류의 맨홀이나 수위가 안정적인 하천으로 자연방류시킨다. 또한 간선저류지는 관거의 허용용량을 초과하는 구간에서 초과용량에 맞게 소규모로 설계되며 기존의 지하구조물에 간섭이 없도록 설계하여 설치하는게 기본 개념이다. 본 연구에서는 최근 내수침수피해가 발생한 강남역을 대상유역으로 선정하여 유출분석을 진행하고 집중호우시 유역내 기존 우수관거의 통수능 검토 및 침수피해 지역을 검토하였다. 또한 관거의 과부하가 심한 구간을 중심으로 저류지의 용량 및 개수 등을 고려한 분석을 통하여 간선저류지 설치로 인한 관거의 여유용량 및 간선저류지의 저류효과를 검토하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.233-241
• /
• 2014

This paper suggests a fast minimum spanning tree algorithm which simplify the original graph to 2-edge connected graph, and using the cycling property. Borůvka algorithm firstly gets the partial spanning tree using cycle property for one-edge connected graph that selects the only one minimum weighted edge (e) per vertex (v). Additionally, that selects minimum weighted edge between partial spanning trees using cut property. Kruskal algorithm uses cut property for ascending ordered of all edges. Reverse-delete algorithm uses cycle property for descending ordered of all edges. Borůvka and Kruskal algorithms always perform |e| times for all edges. The proposed algorithm obtains 2-edge connected graph that selects 2 minimum weighted edges for each vertex firstly. Secondly, we use cycle property for 2-edges connected graph, and stop the algorithm until |e|=|v|-1 For actual 10 benchmark data, The proposed algorithm can be get the minimum spanning trees. Also, this algorithm reduces 60% of the trial number than Borůvka, Kruskal and Reverse-delete algorithms.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.16 no.3
• /
• pp.84-92
• /
• 2002

A size of low-voltage conductor cables is determined by the voltage drop of a system the cable impedance and the cable ampacity based on temperature correction factor in accordance with the condition of cable installation. Therefore, the proper temperation correction factor according to the condition of cable installation should be applied to determining the cable ampacity and also the skin effect and proximity effect, along with the kind and size of conductor and the condition of cable installation, should be properly considered to analyze the proper value of resistance and the reactance of the conductors. This paper addresses the systematic design flow for determining the size of low voltage level con여ctor cables in calculating the voltage drop of a power system and proposes a new improved the calculating formula what error should be minimized in comparison with the general formula and which can be applied in design work for determining the size of conductor cables.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.981-983
• /
• 2009

피라미드 그래프는 정방형 메쉬와 트리 구조를 기반으로 하는 상호연결망 토폴로지다. 정방형 메쉬 내에서 NPC-간선은 해당 메쉬를 피라미드의 부그래프 관점에서 해석할 때 NPC-간선의 양 끝 노드들의 부모 노드들이 상위 계층의 메쉬 부그래프 내에서 서로 인접하게 되는 간선으로써 사이클 확장이나 고장허용 특성의 관점에서 중요한 의미를 갖는 간선이다. 본 연구에서는 $2^n{\times}2^n$ 2-차원 정방형 메쉬 내에서 헤밀톤 사이클 구성 시 포함할 수 있는 NPC-간선 개수의 하한값이 $2^{2n-2}$임을 분석한다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.2
• /
• pp.32-38
• /
• 2018

Studies on classification of national roads have been continued, but there is little research on the classification of urban arterial roads. Due to the increase of traffic volume, urban arterial roads do not perform well as main roads. In this paper, the function of urban arterial road was established by using cluster analysis using traffic characteristics. Traffic characteristics such as traffic volume, weekend coefficient and speed coefficient were used to establish the functions of 55 main arterial roads in Seoul. The results of this paper are compared with those of the method using AADT. The method using AADT classifies the characteristics according to the traffic volume of the whole lane. In this paper, however, the results are derived using the traffic volume per lane reflecting the actual traffic volume. In addition, the functional classification of the arterial roads in Seoul was compared with the results of this paper to verify that the traffic characteristics were reflected. As a result, the method presented in this paper is more effective in showing traffic characteristics than the current highway functional classification method, and the functional classification system will be helpful for road extension and planning design.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.2
• /
• pp.35-42
• /
• 2014

This paper suggests a method that obtains the minimum spanning tree (MST) far more easily and rapidly than the present ones. The suggested algorithm, firstly, simplifies a graph by means of reducing the number of edges of the graph. To achieve this, it applies a method of eliminating the maximum weight edge if the valency of vertices of the graph is equal to or more than 3. As a result of this step, we can obtain the reduced edge population. Next, it applies a method in which the maximum weight edge is eliminated within the cycle. On applying the suggested population minimizing and maximum weight edge deletion algorithms to 9 various graphs, as many as the number of cycles of the graph is executed and MST is easily obtained. It turns out to lessen 66% of the number of cycles and obtain the MST in at least 2 and at most 8 cycles by only deleting the maximum weight edges.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.51-59
• /
• 2014

This paper suggests a method of lessening number of a graph's edges population in order to rapidly obtain the minimum spanning tree. The present minimum spanning tree algorithm works on all the edges of the graph. However, the suggested algorithm reduces the edges population size by means of applying a method of deleting maximum weight edges in advance from vertices with more than 2 valencies. Next, it applies a stopping criterion which ideally terminates Borůvka, Prim, Kruskal and Reverse-Delete algorithms for reduced edges population. On applying the suggested algorithm to 9 graphs, it was able to minimize averagely 83% of the edges that do not become MST. In addition, comparing to the original graph, edges are turned out to be lessened 38% by Borůvka, 37% by Prim, 39% by Kruskal and 73% by Reverse-Delete algorithm, and thereby the minimum spanning tree is obtained promptly.