• Title/Summary/Keyword: Route exchange

Search Result 107, Processing Time 0.03 seconds

A brief introduction to the research of cultural exchange of Eurasian Continent in Korea (한국에서 유라시아 문명교류사 연구의 성과와 과제)

  • Kwon, Ohyoung
    • Korean Journal of Heritage: History & Science
    • /
    • v.48 no.3
    • /
    • pp.166-185
    • /
    • 2015
  • Recently, as an enonomic importance of the Eurasian Continent raises, the necessity of east-west connecting ancient transport roads research is increasing. Although domestic research of eastern-western international exchange in the Eurasia is not yet very active, the studies of history, archaeology, art history, folklore, costume history have been advanced steadily. An attention for the exchange through steppe route originated from the interest in Korean folk and Korean culture and the research range is extending to Xiungnu, Kurgan culture as a direct investigation on the remains of Mongolia and Kazakhstan has been achieved constantly. The art history has been leading the research of exchange which is based on desert and oasis. The field research of Iran, Uzbekistan, Azerbaijan, etc progressed in various routes, and the research on diverse topics including Silla's golden culture, transmission of glass, and the Buddhism is improving. Research on the maritime silk road is weaker, compared to other parts. Buddhist and Hindu temples of Southeast Asia attracted some interest to people, but the research should focus on the restoration of sea route and consideration of its meaning. Research of this part is expected to be more activative, as domestic researchers investigate Don Son culture and Sa Huynh culture of Vietnam by themselves. From now on, we should focus on topics that are not directly connected to Korean history, and Korean culture. Because it is also our duty to study and conserve the culture of entire human community.

A Study on Environmentally Friend Counter Facilities for Improvement of Harbor Water Quality (항내수질 개선을 위한 친환경 외곽시설에 관한 연구)

  • Kim, Kang-Min;Kang, Suk-Hyong;Ryu, Ha-Sang;Kim, Sang-Hoon
    • Journal of Navigation and Port Research
    • /
    • v.27 no.2
    • /
    • pp.233-238
    • /
    • 2003
  • Due to the impermeability of outer wall facilities such as Breakwaters which dissipates the wave energy and keeps harbor tranquility, the enclosed area of harbor becomes partially blocked and the water exchange can be reduced. Recent trends of port development protect water quality and emphasize Water-Front, so the method which enhances the circulation of harbor waters and the dilution of the water pollutants are studied. The best improvement of water quality is a remove of pollutant source on land, but an enclosed port must be enhanced the tidal exchange. For this end, the best improvement may be made a drain-route on the existing outer wall facilities. In this study, the numerical computations were carried out to predict the circulation of harbor waters and the tidal exchange through the drain-rout in the polluted harbor(Samchonpo-guhang) located at the east coast of South Sea. Computational models adopting FDM(Finite Difference Method) were used here and were already verified from the previous studies und ocean survey. As a result of this study, circulation and the tidal exchange at the harbor before and after introduction of drain-route were assessed.

A Postal Transportation Planning Algorithm (우편물 기간운송계획 알고리듬)

  • 최지영;이경식;박성수;김진석;김혜규
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.191-194
    • /
    • 2001
  • We consider a postal transportation planning in the transportation network of the form of hub and spoke. Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is Proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is acceptable.

  • PDF

Route Optimization Scheme for Mobile Content Sources in Content Centric Networking

  • Lee, Jihoon;Rhee, Eugene
    • Journal of information and communication convergence engineering
    • /
    • v.18 no.1
    • /
    • pp.22-27
    • /
    • 2020
  • Content centric networking (CCN) is regarded as promising internet architecture because it can provide network efficiency in terms of bandwidth consumption by separating contents from a specific network location and decrease network congestion events. However, the application of a CCN does not widely consider the side effects of mobile devices, particularly mobile content sources. For content source mobility, a full routing update is required. Therefore, in this study, a route optimization scheme is proposed for mobile content sources in a CCN environment to provide low communication overhead, short download time, and low resource consumption. The proposed scheme establishes a direct path between content requesters and a mobile content source for the exchange of interest and data packets using interest-piggybacked data packets. Based on the inherent CCN naming characteristics, the content source does not know the name prefix of the content consumer, and thus the proposed optimized CCN scheme utilizes the content router in the home domain of the content source.

A Study on Place and Route for FPGA using the Time Driven Optimization

  • Yi Myoung Hee;Yi Jae Young;Tsukiyama Shuji;Laszlo Szirmay
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.70-73
    • /
    • 2004
  • We have developed an optimization algorithm based formulation for performing efficient time driven simultaneous place and route for FPGAs. Field programmable gate array (FPGAs) provide of drastically reducing the turn-around time for digital ICs, with a relatively small degradation in performance. For a variety of application specific integrated circuit application, where time-to-market is most critical and the performance requirement do not mandate a custom or semicustom approach, FPGAs are an increasingly popular alternative. This has prompted a substantial amount of specialized synthesis and layout research focused on maximizing density, minimizing delay, and minimizing design time.

  • PDF

The Original Concept of the Silk Road and Richthofen's Humanistic Ideas

  • KWON, YOUNG-PIL
    • Acta Via Serica
    • /
    • v.3 no.2
    • /
    • pp.1-22
    • /
    • 2018
  • The concept of the "Seidenstrassen" (Silk Road) was created by the German geographer F. von Richthofen (1833-1905) in 1877. The "Seidenstrassen" means communication between China and the Roman cultural area. To prove the route of dissemination of silk, Richthofen not only focused on geographical substantiality, based on the routes of the Chinese Zhang Qian and the Roman Ptolemy, but also on etymological, historical, and religious sources. In fact, his Silk Road concept has the trade of silk as well as the humanistic ideas of cultural exchange. It is worth noting that in his book China, Richthofen presented the Silk Road as a space-time concept that considers the length of space as well as the length of time by highlighting humanistic examples that came into modern times through the Sea Route. Later, the English term "Silk Road" appeared in 1938, the Japanese term "シルクロ-ド" (sirukurodo) in 1939, and the Korean term "실크로드" (silkrodeu) in 1952.

A Study on Backup Route Setup Scheme in Ad Hoc Networks (애드혹 네트워크에서의 보조 경로 설정 기법에 관한 연구)

  • Jung Se-Won;Lee Chae-Woo
    • 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.

A feasibility study on barge transportation system between Incheon and Gaesung (인천-개성(공단)간 바아지 항로의 타당성 조사)

  • Lee, Seung-Hee;Lee, Young-Gill;Choi, Jeong-Chul;Kim, Sang-Hyun
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.1
    • /
    • pp.283-291
    • /
    • 2006
  • Recently, a logistics between south and north Korea is rising rapidly by increasing of economical exchange between two Korea and growth of Gaeseoung Industrial Complex. Considering this trend of economic cooperation between two Korea, in addition to a land transportation route it is necessary to secure various logistics and transportation route. A barge transport system which has merits such as a little initial investment and convenience of harbor loading/unloading has been also used to transport freight widely in the EU and USA. In this paper, firstly, a social and economical feasibility study is performed about a shipping route which is using barge transportation system between Incheon and Gaesung. And also we propose several candidate shipping route and investigate a technical feasibility on a realistic possibility of shipping service by some investigation activities. Finally, the optimized shipping route and barge transportation system are proposed in this paper.

  • PDF

The Design and Implementation of GIS Data Processing using 3-Tiers Architecture for selecting Route (3계층 구조를 이용한 GIS 자료처리 설계 및 구현 -도로의 노선선정을 중심으로-)

  • 이형석;배상호
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.3
    • /
    • pp.23-29
    • /
    • 2002
  • The design of data processing of GIS requires efficient method with analysis procedure. This system is easy to be used and managed for presenting route according to conditions as a graphic user interface environmental window system by applying three tiers based object-oriented method. The tier of data is in charge of a class for the exchange, extraction and conservation of data between GeoMedia and application tiers. A route selection algorithm was applied to application tiers, considering all conditions which are necessary for the route selection between a beginning point and an end point, and it was added by module such as data handing, road condition, buffering, clothoid and AHP to select the alternative route followed by new condition. The user tier can express the data acquired by an application tier. Thus three tiers based architecture was presented by implementing design of GIB data processing for its efficiency.

  • PDF

An efficient vehicle route search with time varying vehicle speed (속도 정보를 이용한 효율적 차량경로의 탐색)

  • Mun, Gi-Ju;Yang, Seung-Man
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.660-663
    • /
    • 2004
  • The vehicle routing problem with time-varying speed(VRPTVS) is difficult to handle with regular problem solving approaches. An approach by partitioning the service zone into three sub-zones to reduce computing time and vehicle traveling distance is suggested in this paper. To develop a partitioning algorithm for VRPTVS, all customer locations are divided into two sections such as morning zone and evening zone, excluding daytime zone. And then each service zone is calculated to find a possible number of delivery points and chosen by time window having more number of possible delivery points by considering customer location and varying speeds. A temporary complete route that can serve all target points is developed by this procedure and a pairwise exchange method is applied to reduce the traveling time.

  • PDF