• Journal of the Korean Association of Geographic Information Studies
• /
• v.13 no.4
• /
• pp.67-77
• /
• 2010

Growth of oil and chemical industries has been remarkable during recent years. Hazardous materials (Hazmat) make frequent use in the wide range of industries. It increases the frequency of Hazmat transport and it leads to increase the number of accidents. Optimal Hazmat routes can reduce damage. Thus, the objective of this study is to minimize the areas impacted by Hazmat accidents by adopting experts' opinion in planning the route. We calculated weights using AHP (Analytic Hierarchy Process) and deduced the best route by applying this weights. Results showed that in the case of shortest route versus weighted route, the percentage of population damage has been decreased by 33.4% in the comparison between shortest route and optimally weighted route. And the percentage of environmental damage also has been decreased by 21.8%. Social damage has been decreased by 1521.7%. In the case of none weighted route versus weighted route, the percentage of population damage has been decreased by 2.6% when we adopted weighted route. Consequently, the recommended route with weighted risk assessment avoids densely populated area comparing with none weighted route. Further research needs to be carried out in order to figure out the specific cost-effectiveness analysis applying the equal cost unit for each factor.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.99-110
• /
• 2005

Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.47-58
• /
• 2006

Due to the movement of nodes, ad-hoc networks suffer from the problems such as the decrease of data delivery ratio, the increase of end-to-end delay, and the increase of routing overhead. The backup routing schemes try to solve these problems by finding the backup routes during the route discovery phase and using them when a route fails. Generally the backup routing schemes outperform the single-path routing schemes in terms of data delivery ratio, end-to-end delay, and routing overhead when the nodes move rapidly. But when the nodes don't move rapidly, the backup routing schemes generate more routing traffics than the single-path routing schemes because they need to exchange packets to find the backup route. In addition, when the backup route fails earlier than the main route, it can not use the backup route because in many backup route algorithms, the backup route is found only at the initial route discovery phase. RBR(Reactive Backup Routing Algorithm) proposed in this paper is an algorithm that provides more stable data delivery than the previous backup routing schemes through the selective maintenance of backup route and the backup route rediscovery. To do that RBR prioritize the backup routes, and maintain and use them selectively Thus it can also decrease the routing overheads. Also, RBR can increase data delivery ratio and decrease delay because it reestablishes the backup route when the network topology changes. For the performance evaluation, OPNET simulator is used to compare RBR with the single-path routing scheme and some of the well known backup routing schemes.

• Journal of Chest Surgery
• /
• v.25 no.1
• /
• pp.1-16
• /
• 1992

The quantitatively measured local myocardial perfusion rates with microspheres are used as an objective indicator of even distribution of cardioplegic solution, and the efficacy of the retrograde right atrial route of cardioplegia is evaluated in hearts with various levels of coronary arterial obstruction. After initial antegrade cardioplegia under the median sternotomy and aortic cannulation, 60 hearts from anesthetized New Zealand white rabbits are divided in random order as normal group [ligated left main coronary artery ; MA, MR] and diagonal group [ligated proximal diagonal artery ; LA, LR]. Half of each group [N=10] are perfused with antegrade cardioplegia[A] under the pressure of 100 cmH2O and the other half with retrograde right atrial route[R] under the pressure of 60 cmH2O[St. Thomas cardioplegic solution mixed with measured amount of microspheres]. The myocardium is subdivided into segments as A[atria], RV[right ventricle]. S[septum], LV[normally perfused left ventricular free wall], ROI[ischemic myocardium of left ventricular free wall]. LV and RQI are further divided into N[subendocardium] and P[subepicardium]. The resulting local myocardial perfusion rates and N /P of each group are compared with Wilcoxon rank sum test. The weight of the hearts is 5.94$\pm$0.66g, and there are no statistically significant dif-ferences[p>0.05, ANOVA] between six compared group. The mean flow rate[F: ml /g / min] of MR group is comparable with MA group[p>0.05], but in N and L group, there are significantly depressed F with right atrial route of cardioplegia, which means elevated perfusion resistance with this route. In spite of no significant differences in delivered doses of microsphere[DEL] between compared groups[p>0.05, ANOVA], there are significantly depressed REC and NF in hearts with right atrial cardioplegia which suggests increased requirement of cardioplegic solution with this route. The interventricular septum shows poor perfusion with right atrial route of cardioplegia without obstruction of supplying coronary arteries. But, with obstruction of coronary artery supplying septum as in M group, the flow rate is superior with right atrial route of infusion. The left ventricular free wall perfusion rates of every RQI with R route are superior to that of A route[p<0.05]. But, in LV segments, there are unfavorable effects of right atrial cardioplegia in L group, although the subendocardial perfusion is well maintained in N group. The LV free wall of left main group shows depressed perfusion rates with antegrade route as compared with RQI segments of diagonal group. But, by contraries, there are increased perfusion rates and superior N /P ratio with retrograde right atrial route. It implies more effective perfusion with right atrial route of cardioplegia in more proximal coronary arterial obstruction[i.e., M group as compared with L group]. As a conclusion, all region of ischemia have superior perfusion rates with right atrial car-dioplegia as compared with antegrade route, and especially excellent results can be obtained in hearts with more proximal obstruction of coronary arteries which would otherwise result in more severe ischemic damage. But, the depressed perfusion rates of the segments with normal coronary artery in hearts with coronary arterial obstruction may be a problem of concern with right atrial cardioplegia and needs solution.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2012.10a
• /
• pp.119-120
• /
• 2012

The International Hydrographic Organization (IHO) developed S-100 standards as a framework for a variety of data and service for hydrography and a standard research is in process, including a next-generation electronic chart standard, for products and services based on this.The need for standard storage and utilization of navigation routes generated by ECDIS and navigation system using navigation planning features has emerged and a standard research based on S-100 standard has been performed. Route information standard is needed for interoperability among route information generated by a variety of navigation system and requires an examination for the possibility of applicability. In this research, route generation tools and standard-based generation and result of route information using these tools in order to examine the application of route information standards have been executed.In details, first, as a module capable of generating route information, a module that can store values in memory based on route information standards of S-100, second, a module that can store route information in the memory in XML form, third, it includes loading module for route information stored as XML.In this research, we verified normal generation of route information, storage of generated route information and loading functions through developing three modules.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.22 no.2
• /
• pp.50-64
• /
• 2019

According to the Maritime Safety Act, there are all 34 routes including 5 traffic safety zones, 3 traffic separation schemes, 26 routes designated by regional maritime affairs departments in the Republic of Korea. In the SOLAS convention, the route information should be is effectively used for the safe navigation. However, the route information is complicatedly composed of the location of the route, the navigation rule by each route, the restriction of the navigation, and the anchorages. Moreover, the present method of providing information using the navigational chart and other publications is not effective for users to grasp the navigational information. Therefore, it was conducted to study the design of the S-100 based routing information data model developed by the International Hydrographic Organization to find ways to more effectively provide route information. To do this, the analysis of route requirement, selection of items, encoding test and users' review were carried out. Through expert user review, it was evaluated that the study on the design of the route information data model can be utilized as a good basic data for the route information integration service. Future research on the development of route information data models is expected to provide integrated route information services.

• Korean Institute of Interior Design Journal
• /
• no.28
• /
• pp.140-148
• /
• 2001

The purpose of this thesis is to provide basic information of efficient flow line arrangement, which results from examining the factors of route choice with a focus on the store' space elements and pedestrian activity patterns in the outlets. The route tracking is applied to grasp pedestrian activity patterns, therefore, a concrete analysis into influential factors of the space structure arrangement and forms on route choice. The route tracking is a means to understand pedestrian activity patterns by establishing an unrecognizable space and examining every route in the investigating area for pedestrian activity pattern research. Three sample stores have different systems in the ground plan structures, the escalator location and the directions. The analysis focuses on the booth arrangement and shopping patterns. In conclusion, route choice of the customers and the structure of the space are quite closely related and affect the quality of shopping. This can suggest evidence for the need of the space structure to meet the pedestrian activity patterns.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.235-249
• /
• 2008

On-demand routing protocol in ad hoc network is that establishes a route to a destination node only when it is required by a source node. But, it is necessary to reestablish a new route when an active route breaks down. The reconstruction process establishes another route by flooding messages from the source to the destination, cause not only heavy traffic but also long delays in route discovery. A good method for analyzing performance of protocols is important for deriving better systems. In this paper, we suggest the numerical formulas of a representative on-demand routing protocol AODV, ARMP, and RRAODV to estimate the performance of these routing protocols for analyzing the performance of these protocols. The proposed analytical models are very simple and straightforward. The results of analysis show good agreement with the results of computer simulations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1437-1445
• /
• 1999

n개의 꼭지점을 가진 단조(monotone) 다각형은 2차원 평면상의 임의의 선분에 단조 적인 2개의 체인으로 구성된다. 단조 다각형의 내부를 경로 상에서 모두 감시할 수 있는 최소 링크를 가진 경비원 경로(watchman route with minimum links)는 최소 개수의 선분으로 구성된 경로로서 하나 이상 존재할 수 있다. 본 논문에서는 단조 다각형의 최소 링크를 가진 경비원 경로들 중에서 최단 경비원 경로를 구하는 O(n) 시간의 알고리즘을 제시한다.Abstract A monotone polygon consists of n vertices and is a union of two monotone chains with respect to some line segment in the plane. A watchman route with minimum-links is a polygonal path such that each point in the interior of the polygon can be visible from at least one point along the route. There may be more than one watchman route with minimum links for given monotone polygon. In this paper, we present an algorithm with O(n) time that finds a shortest watchman route among the watchman routes with minimum links in a monotone polygon.

• Journal of Korea Multimedia Society
• /
• v.6 no.1
• /
• pp.176-182
• /
• 2003

The use of the A* for the path search of the agent in the game map gives the computational overhead in real time game processing. To solve this problem, the route table was presented for the 2D game This route table is made in the game development phase and utilized in game playing. The route table designed for 2D game is extended for 3D game in this paper. But the memory space is required too much. This Problem can also be solved using the data compression by skipping the duplicated route table.