• Journal of Korean Society of Transportation
• /
• v.26 no.5
• /
• pp.227-235
• /
• 2008

This study analyzed the efficiency of a trunk with branches and a trunk with feeders route system comparing the user cost and operator cost of those route systems. Basically, a trunk with branches is more efficient than a trunk with feeders in the passengers' perspective if the transit system of a trunk and feeders are the same. In the case that the trunk system is hierarchically higher than the feeder system, a trunk with feeders has the competitive edge over a trunk with branches if the saving of travel cost induced by using the trunk line is larger than the increasing waiting and transfer cost. This result is consistent with the previous research by Park et al.(2007c), which analyzed the efficiency of hierarchical structure in a grid transit network. If the travel demand of each origins and destinations is low, increasing headway according to the travel demand can increase passenger load or operating efficiency in a trunk with feeders route system. In this case, a trunk with feeders route system is more prevalent as the operating cost, route length, and number of destinations increases, while it is less prevalent as the transfer cost and passengers' time value of the waiting time increases. In cases that central business district, which is located in the middle of a trunk line, generates travel demand, a trunk with feeders is more efficient than a trunk with branches with the increasing travel demand from and to the CBD. Therefore it can be concluded that to have a dual operating system between CBD and suburban is more efficient than one type transit system. The efficiency of that system can be increased through an efficient transfer system that can reduce the transfer cost.

• Land and Housing Review
• /
• v.3 no.3
• /
• pp.241-248
• /
• 2012

Although infrastructure cost comprises the great proportion of residential development cost, all of it tends to be borne by land developers which develop large area. This brings about free-riding by adjacent small development or built-up area, followed by the equity problem in terms of infrastructure development cost sharing and the privatization of development gain. This study aims to establish the method to analyze free-riding on the transportation infrastructure(roads) and investigate empirically how much the free-riding occurs. It sets several development scenarios to calculate the part generated by Bucheon Sangdong district, the case area of this study, of all the traffic flow on the roads. The Network analysis is used to estimate the proportion, by development scenarios, of traffic flow, travel time, and travel cost. As a result, the developer of Bucheon Sangdong district is responsible for 83% of the construction cost of selected roads. The methodology and empirical result of this study would contribute to determine who are liable for the infrastructure facilitation and to estimate how much of the cost the obligators have to share.

• Journal of Korea Water Resources Association
• /
• v.50 no.4
• /
• pp.223-232
• /
• 2017

The ability to defend against floods in urban areas was weakened, because the increase in the impervious rate of urban areas due to urbanization and industrialization and the increase in the localized torrential rainfall due to abnormal climate. In order to reduce flood damage in urban areas, various runoff reduction facilities such as detention ponds and infiltration facilities were installed. However, in the case of domestic metropolitan cities, it is difficult to secure land for the installation of storm water reduction facilities and secure the budget for improving the aged pipelines. Therefore, it is necessary to design a storage system (called the detention pond in trunk sewer) that linked the existing drainage system to improve the flood control capacity of the urban area and reduce the budget. In this study, to analyze the effect of reducing runoff amounts according to the volume of the detention pond in trunk sewer, three kinds of virtual watershed (longitudinal, middle, concentration shape) were assumed and the detention pond in trunk sewer was installed at an arbitrary location in the watershed. The volume of the detention pond in trunk sewer was set to 6 cases ($1,000m^3$, $3,000m^3$, $5,000m^3$, $10,000m^3$, $20,000m^3$, $30,000m^3$), and the installation location of the detention pond in trunk sewer was varied to 20%, 40%, 60%, and 80% of the detention pond upstream area to the total watershed area (DUAR). Also, using the results of this study, a graph of the relationship and relational equation between the volume of the detention pond in trunk sewer and the installation location is presented.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.165-173
• /
• 2012

Given a connected, weighted, and undirected graph, the Minimum Spanning Tree (MST) should have minimum sum of weights, connected all vertices, and without any cycle taking place. Borůvka Algorithm is firstly suggested as an algorithm to evaluate the MST, but it is not widely used rather than Prim and Kruskal algorithms. Borůvka algorithm selects the Minimum Weight Edge (MWE) from each vertex with distinct weights in $1^{st}$ stage, and selects the MWE from each MSF (Minimum Spanning Forest) in $2^{nd}$ stage. But the cycle check and the number of MSF in $1^{st}$ stage and $2^{nd}$ stage are difficult to implication by computer program even if it is easy to verify visually. This paper suggests the generalized Borůvka Algorithm, This algorithm selects all of the same MWEs for each vertex, then checks the cycle and constructs MSF for ascending sorted MWEs. Kruskal method bring into this process. if the number of MSF greats then 1, this algorithm selects MWE from ascending sorted inter-MSF edges. The generalized Borůvka algorithm is verified its application by being applied to the 7 graphs with the many minimum weights or distinct weight edges for any vertex. As a result, the generalized Borůvka algorithm is less required for cycle verification then the Kruskal algorithm. Therefore, the generalized Borůvka algorithm is more fast to obtain MST then Kruskal algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.2
• /
• pp.234-242
• /
• 2010

In this paper, we deal with the visualization of graphs, which are one of the most important data structures. As the size of a graph increases, it becomes more difficult to check the graph visually because of the increase of edge intersections. We propose a new method of overcoming such problem. Most of previous studies considered only the minimization of edge intersections, but we additionally pursue to preserve distances between vertices. We present a novel genetic algorithm using an evaluation function based on a weighted sum of two objectives. Our experiments could show effective visualization results.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.444-444
• /
• 2012

본 연구는 세계적인 기후변화와 물부족 현상에 따라 우리나라에도 향후 물부족에 대비한 농업용수의 친환경적인 적정 관리의 필요성이 절실해지고 있으며 친환경 녹색기술 개발과 농촌수자원의 체계적인 관리가 중요한 국가적인 문제로 대두되고 있다. 농촌은 고령화와 인구감소로 인하여 농업기반 수리시설과 농업용수의 전통적인 인력관리가 어려워지고 있으므로 이를 혁신할 수 있는 친환경, 녹색기술, 정보통신기술(ICT) 융합으로 농촌수자원 관리기술의 개발하고 이에 농업용수를 효율적인 관리를 위하여 농촌지역 수리시설과 농업용수 관리를 위해 정보통신기술과 센서네트워크 계측제어기술 및 모바일기술을 적용하여 농촌수자원 스마트 물관리를 위한 시범지구를 운영 하였다. 시범지구는 섬진강댐 수계의 동진도수로, 김제간선, 정읍간선으로 용수를 공급하는데 이중 수혜면적 17,600 ha, 수로연장 59 km의 김제간선에 시범지구로 선정하였다. 김제간선의 용수공급량은 년평균 163,748천톤의 공급하고 있다. 시범지구 운영은 5개년 중 1차년도(2011년)에는 현장시설 설치 총 87지점에서 15개소를 설치하였으며 시범지구의 영농 및 물관리 특성, 용수공급량 조사 분석하였으며 시범지구의 운영시스템 구축과 Smart 물관리 프로그램(Web, App)개발 하였다. 시범지구 운영은 한국농어촌공사 물관리분야 관련 신기술의 실용화를 위한 인큐베이트 역할을 하며 통합수자원관리시스템과 연계하여 체계적인 현장 물관리 기술의 보급과 공사의 대표적인 물관리 시범지구로 활용 및 사업 홍보 효과에 기여할 것으로 기대되고 있다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.3
• /
• pp.509-516
• /
• 2021

The transitive signature scheme is a technique that can be very useful when authenticating edges in a graph that is transitively closed. In other words, when there is an authentication value for an edge (i, j) and an authentication value for an edge (j, k), the authentication value for the edge (i, k) can also be calculated immediately without any separate authentication procedure through a transitive signature. In this paper, we propose the first identity-based transitive signature scheme. Our scheme is based on the lattice problem.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.155-165
• /
• 2012

This paper suggests traveling salesman problem algorithm that have been unsolved problem with NP-Hard. The proposed algorithm is a heuristic with edge-swap method. The classical method finds the initial solution starts with first node and visits to mostly adjacent nodes then decides the traveling path. This paper selects minimum weight edge for each nodes, then perform Min-Min method that start from minimum weight edge among the selected edges and Min-Max method that starts from maximum weight edges among it. Then we decide tie initial solution to minimum path length between Min-Min and Min-Max method. To get the final optimal solution, we apply previous two-opt to initial solution. Also, we suggest extended 3-opt and 4-opt additionally. For the 7 actual experimental data, this algorithm can be get the optimal solutions of state-of-the-art with fast and correct.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.17 no.3
• /
• pp.119-126
• /
• 2003

The size of low voltage level conductor cables can be installed with a long length just like a aviation field, shall be determined for considering the ampacity of cable and the drop of voltage for the power system. Therefore, The size of the conductor cables may be larger one for considering the tolerable voltage drop comparatively, although the allowable ampacity of the conductor cables may have a margin in comparison with the rated full load current In this case, the conductor cables' allowable ampacity will be very larger than the rated full load current and the generated heat of the conductor will be relatively downed. The conductor cables' alternating current resistance corrected with the maximum allowable temperature of the conductors, has been applied on the general formula for the calculating the voltage drop in determinating the size of low voltage level conductor cables, and the resistance is larger than the resistance corrected with the actual temperature of the conductor cables. This paper was studied for the purpose of the conductor resistance corrected with the actual temperature rise of the conductor and address the economic design formula so that this studies shall minimize the errors which can be occurred in comparison with the general formula and which can be applied in design work for determining the size of low voltage level conductor cables.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.11
• /
• pp.159-165
• /
• 2013

This paper proposes a O(E) polynomial-time algorithm that has been devised to simultaneously solve edge-coloring problem and graph classification problem both of which remain NP-complete. The proposed algorithm selects an edge connecting maximum and minimum degree vertices so as to determine the number of edge coloring ${\chi}^{\prime}(G)$. Determined ${\chi}^{\prime}(G)$ is in turn either ${\Delta}(G)$ or ${\Delta}(G)+1$. Eventually, the result could be classified as class 1 if ${\chi}^{\prime}(G)={\Delta}(G)$ and as category 2 if ${\chi}^{\prime}(G)={\Delta}(G)+1$. This paper also proves Vizing's planar graph conjecture, which states that 'all simple, planar graphs with maximum degree six or seven are of class one, closing the remaining possible case', which has known to be NP-complete.