• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.15 no.4
• /
• pp.117-130
• /
• 2007

Incheon International Airport has handled 3,054,485 transfer passengers (11.9% transfer rate) and 950,441 transfer cargo(44.2% transfer rate)recorded in 2005. Comparing to 30-40% transfer passenger rate which are competition hub airports in northeast Asia, transfer passenger rate of Incheon International Airport is lower. Above all, We think that Minimum Connecting Time(MCT) which is relating factors with transfer rate need to be monitored to make up for the weak points in the current Incheon internationalairport system. Minimum Connecting Time is defined the legally minimum time necessary to change planes at a given airport. and Transfers represent 35% of the total passenger volume at Vienna International Airport in Europe, which underscores our function as a major international hub. Vienna is rated priority in reservation systems because of our excellent minimum connecting time, and that increases the sale of tickets through our airport. In 2004 the total number of transfer passengers rose 18% to 5,089,624. Short routes, a one roof concept and an outstanding logistics system make Vienna an ideal airport for transfers. This transfer-friendly one roof concept will also form the basis for the new VlE-Skylink Terminal. In case of Japan, Star Alliance has also implemented its so called "Move under one roof"concept at the new Centrair airport. All member carriers are located in the same part of the termina1, sharing check-in counters and ticketing facilities. Star Alliance member carriers can now offer customersa reduced average minimum connecting time of one hour, for transfers between international and domestic. The research purpose of the Study on the Enhancement for Minimum Connecting Time of Incheon International Airport is to increase transfer rate of passenger and cargo of Incheon International Airport at Northeast Asia through this paper.

• The KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.213-220
• /
• 2010

In this paper, a mechanism connecting all input edges with minimum length through Steiner tree is proposed. Edges are convertible into communication lines, roads, railroads or trace of moving object. Proposed mechanism could be applied to connect these edges with minimum cost. In our experiments where input edge number and maximum connections per edge are used as input parameters, our mechanism made connection length decrease average 6.8%, while building time for a connecting solution increase average 192.0% comparing with the method using minimum spanning tree. The result shows our mechanism might be well applied to the applications where connecting cost is more important than building time for a connecting solution.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.509-518
• /
• 2009

In this paper, a mechanism that produces an approximation edges minimum spanning tree swiftly using virtual nodes called portals dividing given edges into same distance sub-edges. The approximation edges minimum spanning tree can be used in many useful areas as connecting communication lines, road networks and railroad systems. For 3000 random input edges, when portal distance is 0.3, tree building time decreased 29.74% while the length of the produced tree increased 1.8% comparing with optimal edge minimum spanning tree in our experiment. When portal distance is 0.75, tree building time decreased 39.96% while the tree length increased 2.96%. The result shows this mechanism might be well applied to the applications that may allow a little length overhead, but should produce an edge connecting tree in short time. And the proposed mechanism can produce an approximation edge minimum spanning tree focusing on tree length or on building time to meet user requests by adjusting portal distance or portal discard ratio as parameter.

• The KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.215-224
• /
• 2011

In this paper, a mechanism connecting all weighted migration routes with minimum cost with EGOSST is proposed. Weighted migration routes may be converted to weighted input edges considered as not only traces but also traffics or trip frequencies of moving object on communication lines, roads or railroads. Proposed mechanism can be used in more wide and practical area than mechanisms considering only moving object traces. In our experiments, edge number, maximum weight for input edges, and detail level for grid are used as input parameters. The mechanism made connection cost decrease average 1.07% and 0.43% comparing with the method using weight minimum spanning tree and weight steiner minimum tree respectively. When grid detail level is 0.1 and 0.001, while each execution time for a connecting solution increases average 97.02% and 2843.87% comparing with the method using weight minimum spanning tree, connecting cost decreases 0.86% and 1.13% respectively. This shows that by adjusting grid detail level, proposed mechanism might be well applied to the applications where designer must grant priority to reducing connecting cost or shortening execution time as well as that it can provide good solutions of connecting migration routes with weights.

• The KIPS Transactions:PartA
• /
• v.17A no.2
• /
• pp.103-112
• /
• 2010

Cluster sensor network is a sensor network where input nodes crowd densely around some nuclei. Steiner minimum tree is a tree connecting all input nodes with introducing some additional nodes called Steiner points. This paper proposes a mechanism for efficient construction of a cluster sensor network connecting all sensor nodes and base stations using connections between nodes in each belonged cluster and between every cluster, and using repetitive constructions of approximate Steiner minimum trees. In experiments, while taking 1170.5% percentages more time to build cluster sensor network than the method of Euclidian minimum spanning tree, the proposed mechanism whose time complexity is O($N^2$) could spend only 20.3 percentages more time for building 0.1% added length network in comparison with the method of Euclidian minimum spanning tree. The mechanism could curtail the built trees' average length by maximum 3.7 percentages and by average 1.9 percentages, compared with the average length of trees built by Euclidian minimum spanning tree method.

• Journal of the Korea Computer Industry Society
• /
• v.10 no.3
• /
• pp.79-86
• /
• 2009

This paper proposes a mechanism for prompt and efficient construction of sensor network connecting sensor nodes and base stations using limited length edges minimum spanning tree. This mechanism can rapidly build a connecting tree which may be used in routing of sensor network. In an experiment for 2000 input terminal nodes, this mechanism can curtail 94.7% construction time comparing with the method by naive minimum spanning tree without tree length overheads. This shows the proposed mechanism can apply well to the application of swift construction of a sensor network.

• The Korean Journal of Air & Space Law and Policy
• /
• v.22 no.2
• /
• pp.85-108
• /
• 2007

동북아시아지역에서 인천국제공항이 최고의 허브공항으로서 역할을 위해서는 무엇보다도 환승율에 대한 연구가 필요하다고 판단된다. 인천국제공항은 2005년도에 3,054,485만명의 환승여객을 처리하여 환승율은 11.9% 를 기록하였는데 이는 동북아시아의 경쟁허브공항의 환승율인 30-40%와 비교해보면 공항경쟁력이 상당히 뒤쳐진다고 할 수 있다. 이러한 약점을 보완하기 위하여 여러 가지 관련 인자들을 검토하는 것이 중요하다고 판단되어지는데 그중에서 인천국제공항의 비행편최소연결시간(MCT)을 개선하는 것이 필요하다. 이러한 문제를 개선하기 위해서는 항공기 스케줄, 항공사 배치, 게이트 배정방법, 수하물처리, 여객 동선 등이 함께 검토되어야 할 것이다. 그러나 이러한 인자들에 대한 세부적인 분석이 단기간에 걸쳐 해결되는 문제가 아니기 때문에 본 연구에서는 외국 허브공항의 MCT 수준, 관리방법, 국외사례 등을 고찰해 보고 동북아시아에서 허브공항을 향한 인천국제공항의 환승율 제고차원에서 정책적 방안을 제시하고자 한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.319-323
• /
• 2003

Let P be a set of n points in the plane. A minimum spanning tree(MST) is a spanning tree connecting n points of P such that the sum of lengths of edges of the tree is minimized. A diameter of a tree is the maximum length of paths connecting two points of a spanning tree of P. The problem considered in this paper is to compute the spanning tree whose diameter is minimized over all spanning trees of P. We call such tree a minimum-diameter spanning tree(MDST). The best known previous algorithm[3] finds MDST in $O(n^2)$ time. In this paper, we suggest an approximation algorithm to compute a spanning tree whose diameter is no more than 5/4 times that of MDST, running in O(n$^2$log$^2$n) time. This is the first approximation algorithm on the MDST problem.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.528-531
• /
• 2004

This paper presents the design and implementation of a QoS based IrDA in mobile phones. The IrDA standards have arised from the need to connect various mobile devices together. But currently, we have a difficult to connecting various mobile devices together. The difficult thing is to adjust the minimum turn around time. The minimum turn around time in IrDA deals with the time needed for a receiver circuit to recover following saturation by transmissions from the same device (turn around latency). This parameter corresponds to the required time delay between the last byte of the last frames sent by a station and the point at which it is ready the first byte of a frame from another station. This parameter comes into play when the link is turned around and is negotiated independency for each station. We solve this matter by using the Dynamic Adjustment Algorithm (DAA). The dynamic adjustment algorithm adjusts the minimum turn around time according to the numbers of devices. We apply our direct adjustment algorithm to our QoS based IrDA in mobile phones and show the improved performance of connection with various mobile phones together.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.7
• /
• pp.87-95
• /
• 2012

In this paper, PTAS three-dimensional Steiner minimum tree connecting numerous input nodes rapidly in 3D space is proposed. Steiner minimum tree problem belongs to NP problem domain, and when properly devised heuristic introduces, it is generally superior to other algorithms as minimum spanning tree affiliated with P problem domain. But when the number of input nodes is very large, the problem requires excessive execution time. In this paper, a method using PTAS is proposed to solve the difficulty. In experiments for 70,000 input nodes in 3D space, the tree produced by the proposed 8 space partitioned PTAS method reduced 86.88% execution time, compared with the tree by naive 3D steiner minimum tree method, though increased 0.81% tree length. This affirms the proposed method can work well for applications that many nodes of three dimensions are need to connect swifty, enduring slight increase of tree length.