• Journal of the Korean Institute of Navigation
• /
• v.25 no.1
• /
• pp.77-91
• /
• 2001

According to the many ancient literatures, it is said to be that Merchant Prince, Chang Pogo in unification Silla had traded with not only China, Japan but also Arab-Islam Countries, but unfortunately there is no definite records about this. Therefore in this study the writer would like to presume the sea routes of Merchant Prince, Chang Pogo in a unification Silla. For the purpose of this study the writer would like to study the reference books and materials regarding to the sea routes of prehistoric age and ancient three countries of Kingdoms and unification Silla. Especially the writer consider “The Work of Routes and Kingdoms” of Ibn Khurdarhbih regarding to the ancient sea routes of Korea, China, Arab-Islam Countries, and also the writer consider the ancient sea routes of Tang Dynasty in China and Ryukyu Kingdom in Japan. About this methodology of this study, the writer believe that the sea routes of today is the results of ancient sea routes, and this ancient sea routes could not be changed forever except special circumstance. According in this study the writer would like to persume the sea routes of Merchant Prince, Chang Pogo using like this methodologies. This presumption of the writer is originated on the basis of The Work of Routes and Kingdoms written by ancient Arabian Geographer, Ibn Khurdadhbih in the early years of 9th century. The Work of Routes and Kingdoms is geography, and the principal contents of this geography are the activities of Arab-Islam merchants and Chinese Merchants between Arab-Islam countries and China from 9th century to 11th century by ancient sea routes. But surprisingly in this geography, Silla was marked, and another ancient Arabian geogrpher, Al-Biruni marked Silla on his map, Qanun Al-mas'udi in the 9th century, and also another ancient Arabian geographer, Al-Idrisi marked Silla on his map in the 11th century. Especially Al-Biruni expressed the longitude and latitude of Silla on his map, he expressed Silla as following. “at the extreme end of China toward the East and few people travelled to it by sea”. Therefore the writer would like to presume that Arab-Islam merchants had traded with unification Silla in the 9th century, and also Merchant Prince, Chang Pogo had traded with not only China, Japan but also Arab-Islam Countries using above ancient sea routes in the 9th century.

• Journal of Korea Port Economic Association
• /
• v.38 no.1
• /
• pp.113-127
• /
• 2022

The purpose of this study is to analyze the efficiency of 90 domestic passenger shipping routes using the DEA Window model as a Decision Making Unit (DMU). Data from 2015 to 2019 are divided into three windows, and efficiency was analyzed by using the number of passenger ships of sails, gross tonnage and distance traveled as input variables and transportation performance of the general public and islanders as output variables. As a result of the analysis, improvements are derived and presented for routes with low relative efficiency. In particular, the efficiency is evaluated for general routes operated by private operators as profit routes and auxiliary routes supported by the government as non-profit routes. In addition, scale efficiency (SE) is derived by using the technical efficiency (TE) of the CCR model and the pure technical efficiency (PTE) values of the BCC model. It is found that the inefficiency of the route was due to pure technical efficiency (PTE) rather than scale efficiency (SE). It will be necessary to consider the improvements for each route shown in the analysis results of this study when establishing the policy for the domestic passenger shipping route.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.4
• /
• pp.1836-1842
• /
• 2015

On road networks, the clustering of moving objects is important for traffic monitoring and routes recommendation. The existing schemes find out density route by considering the number of vehicles in a road segment. Since they don’t consider the features of each road segment such as width, length, and directions in a road network, the results are not correct in some real road networks. To overcome such problems, we propose a clustering method for congested routes discovering from the trajectories of moving objects on road networks. The proposed scheme can be divided into three steps. First, it divides each road network into segments with different width, length, and directions. Second, the congested road segments are detected through analyzing the trajectories of moving objects on the road network. The saturation degree of each road segment and the average moving speed of vehicles in a road segment are computed to detect the congested road segments. Finally, we compute the final congested routes by using a clustering scheme. The experimental results showed that the proposed scheme can efficiently discover the congested routes in different directions of the roads.

• ETRI Journal
• /
• v.40 no.5
• /
• pp.613-623
• /
• 2018

The instability of operational channels on cognitive radio networks (CRNs), which is due to the stochastic behavior of primary users (PUs), has increased the complexity of the design of the optimal routing criterion (ORC) in CRNs. The exploitation of available opportunities in CRNs, such as the channel diversity, as well as alternative routes provided by the intermediate nodes belonging to routes (internal backup routes) in the route-cost (or weight) determination, complicate the ORC design. In this paper, to cover the channel diversity, the CRN is modeled as a multigraph in which the weight of each edge is determined according to the behavior of PU senders and the protection of PU receivers. Then, an ORC for CRNs, which is referred to as the stability probability of communication between the source node and the destination node (SPC_SD), is proposed. SPC_SD, which is based on the obtained model, internal backup routes, and probability theory, calculates the precise probability of communication stability between the source and destination. The performance evaluation is conducted using simulations, and the results show that the end-to-end performance improved significantly.

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.26 no.1
• /
• pp.7-15
• /
• 2020

Purpose: Emergency room(ER) is the first place to enter a hospital where patients who might have been infected with contagious disease. Therefore, ER should be designed with infection control in mind. Researchers examined hospital ER layouts to identify layout design that support infection control. Methods: This study analyzed the hospital ER layout of Korean and other hospitals abroad. Researchers focused on route of incoming patients who potentially have infectious disease. Crossing of this route with other routes such as for imaging and testing should be avoided for infection control. Results: There were certain hospital ERs with better control of infection related incidents. ER floor plan layout is analyzed about allocation of key functions with movement routes for each role such as patients and medical staff in mind. To identify layout strategies for ER functions researchers simplified the routes in ER into diagrams. Layout options show that bypassing infection suspected routes over other routes is possible. Implications: Hospitals can control infection easier when they adopt strategic ER layout identified in this study.

• Journal of the Korean Professional Engineers Association
• /
• v.41 no.2
• /
• pp.51-58
• /
• 2008

In this paper is described "the water resources policy, a new paradigm of water resources control. the characteristic of rainfall in Korea and the compatibility of a new water routes opening in natural river". Also the construction of the Korean grand waterway in the view of disaster prevention, flood control, irrigation and environment-friendly transportation is needed eventually. And I detail a routes of Korean grand waterway, using of a flood gate, supply of irrigation water. cruse duration, activating under developed region and economic efficiency.

• Journal of Korean Institute of Industrial Engineers
• /
• v.16 no.2
• /
• pp.71-79
• /
• 1990

In this paper, the Double Shortest Arborescence & Merging method is presented as an efficient heuristic algorithm for the Public Vehicle Routing Problem which is to find the minimum total cost routes of M or less vehicles to traverse the required arcs(demand streets) at least once and return to their starting depot on a directed network. Double Shortest Arborescence which consists of forward shortest aborescence and backward one informs M or less shortest routes to traverse all required arcs. The number of these routes is reduced to M or less by merging routes. The computational experiment based on randomly generated networks reports that this algorithm is efficient.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.1
• /
• pp.25-35
• /
• 2002

This paper presents a heuristic algorithm that a mobile robot avoids obstacles using optical flow. Using optical flow, the mobile robot can easily avoid static obstacles without a prior position information as well as moving obstacles with unknown trajectories. The mobile robot in this paper is able to recognize the locations or routes of obstacles, which can be detected by obtaining 2-dimensional optical flow information from a CCD camera. It predicts the possibilities of crash with obstacles based on the comparison between planned routes and the obstacle routes. Then it modifies its driving route if necessary. Driving acceleration and angular velocity of mobile robot are applied as controlling variables of avoidance. The corresponding simulation test is performed to verify the effectiveness of these factors. The results of simulation show that the mobile robot can reach the goal with avoiding obstacles which have variable routes and speed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.278-281
• /
• 2011

Mobile devices equipped with various sensors have the potential of providing context-aware services. Location is one of the most common forms of context, which can be applied to diverse applications. In this paper, we present methods for learning and predicting users' routes between significant locations, e.g., home and workplaces, based on personal GPS data. A user's significant locations and routes between them are learned by a set of rules as well as clustering. When the user is moving, our methods can predict which of the learned routes is being taken now. After the route prediction, the user's next location can also be inferred. Our methods have been applied to the real GPS datasets from four subjects. For the next location prediction task, the achieved accuracy was 84.8%.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.6 no.1
• /
• pp.5-13
• /
• 1981

This paper considers a facility moving along a route of straight line to serve several facilities in xy plane. A route is obtained which minimizes the objective function expressed in terms of average rectilinear distance between the service facility and facilities to he served. The forms of the objective functions can be classified into several cases according to the initial and end points of the routes. In some cases, as in the problem of optimal location of new facility, the cordinates of the optimal routes are median of the cordinates of facilities to be served. In others, the optimal routes are obtained after examining the values of objective functions on the boundaries of slopes and intercepts. An overall optimal route is obtained by comparing these routes. The entire procedure has been programmed in BASIC language, and several case examples are given.