• Title/Summary/Keyword: ROUTE

Search Result 5,424, Processing Time 0.027 seconds

The Study on Pharmacokinetics According to the Administration Route (흡수경로에 따른 약물동태학적 고찰)

  • Park, Min-Cheol;Kim, Hwan-Yeong;Jo, Eun-Hee
    • The Journal of Korean Medicine Ophthalmology and Otolaryngology and Dermatology
    • /
    • v.22 no.3
    • /
    • pp.95-107
    • /
    • 2009
  • Objective : The purpose of this study is to search for more effective administraion route of herbal medicine. Methods : Pharmacokinetic issues with the methods in experimental papers, which deal with finding the effectiveness of two or more administration routes of herbal medicine, searched from KERIS, KSI, KISTI and KTKP, have been analyzed by, first, categorizing the papers and comparing the validity of administration routes. Results and Conclusions : 1. Upon comparing in total of 24 papers on the basis of each administration route, per oral(PO)-herbal acupuncture(HA) was most superior in terms of number in that there were 13 cases and PO-per rectal(PR) was next superior in that there were 5 cases. PO-per dermal(PD)-inhalation therapy(IT), PO-IT and PO-PR-HA had 3, 2 and 1 cases respectively. 2. Out of the total 24 papers which compares different administration routes, 16 of them were pharmacokinetically appropriate, whereas, the remaining 8 were pharmacokinetically inappropriate. 3. Comparisons were made between PO-HA, PO-PR, PO-IT, PO-PD-IT and PO-PR-HA routes. However, none of them was not particularly effective regardless of the administered medicine or target organ. 4. No route was particularly effective against a particular drug target as a result of comparing damaged liver, asthma, endometriosis and anti-inflammation. 5. In the case of Injinhotang in medicine comparison, HA tended to be more associated with hepatotoxicity over PO. However, Cordyceps Militaris Mycelia, Gagamsohaphyangwon and Hongdeungtang showed no prominent effective administration route.

  • PDF

Application of GIS Based AHP for Route Location (노선 선정에서 계층분석과정을 이용한 GIS의 적용)

  • Roh, Tae Ho;Jeong, In Ju;Lee, Sung Rock
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.8 no.2
    • /
    • pp.55-67
    • /
    • 2005
  • This study presented the route location method by applying AHP and evaluating quantitatively. This study developed the program that can be easily applied to this kind of road design, and built the decision support system for route location. The study results are summarized as follows ; We could quantitatively evaluate the appropriateness of exiting routes by applying the AHP based on GIS. If we apply this to the roads that will be newly constructed, we can make the objective and reliable route location when making road plans and basic designs. We improved the technique of route location by applying the decision support system with third-dimensional data, which considers even the vertical alignment plan, to the existing decision support system with second-dimensional data. And, since we can set those data such as vertical slope, earth-volume, structure size, location and construction cost to independent variables, we can make road designs more scientifically and reasonably.

  • PDF

A Logit Type of Public Transit Trip Assignment Model Considering Stepwise Transfer Coefficients (Stepwise 환승계수를 고려한 Logit 유형 대중교통통행배정모형)

  • SHIN, Seongil;BAIK, Namcheol
    • Journal of Korean Society of Transportation
    • /
    • v.34 no.6
    • /
    • pp.570-579
    • /
    • 2016
  • This study proposes a concept of Stepwise Transfer Coefficient(STC) which implies greater transfer cost with increasing the number of transfers. Thus, the public transport information system provides the choice sets of travel routes by the consideration of not only transportation time but also the optimum number of transfers. However, path choice problems that involve STC are found to include non additive cost, which requires additional route enumeration works. Discussions on route enumeration in actual transportation networks is very complicated, thereby warranting a theoretical examination of route search considering STC. From these points of view, this study results in a probability based transit trip assignment model including STC. This research also uses incoming link based entire route deletion method. The entire route deletion method proposed herein simplifies construction of an aggregation of possible routes by theoretically supporting the process of enumeration of the different routes from origin to destination. Conclusively, the STC reflected route based logit model is proposed as a public transportation transit trip assignment model.

A Study on Route Map Visualization Method for Mobile Handset (모바일 핸드셋을 위한 라우트맵 시각화 방법에 관한 연구)

  • Park, Dong-Kyu;Ryu, Dong-Sung;Ou, Yoon
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.2
    • /
    • pp.231-240
    • /
    • 2004
  • Location Based Service(LBS) system is widely used in Car Navigation Service(CNS), position tracing, tour guide, etc. Recently, the development of a mobile hardware enables us to run various application of software on small handset. Although CNS systems are widely used on personal computer, PDA and embedded machines, small display system of a mobile handset still constrains to make it difficult to developed route visualization and navigation system. In this paper, we propose a new route map visualization system on mobile handset environment for LBS system. We use modified line simplification algorithm that removes extraneous information and places more emphasis on the turning point. We also adopted level of detail route visualization technique for visualization of a detail map. This system improved turn-by-turn method and line drive system, which are widely adopted by current route visualization system.

  • PDF

A Study on the Optimum Route Determination using Digital Terrain Model (수치지형모형을 이용한 최적노선선정에 관한 연구)

  • 정영동;박정남;박성규;김진기
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.11 no.2
    • /
    • pp.17-26
    • /
    • 1993
  • This study aims to develop an effective model of the optimum route determination by using digital terrain model. So in this study I select testing areas and analyse comparing the usual method with the digital terrain model method. And then I present one of the optimum route determination models by analysing an anticipated view and other roads according to the development plan. In usual method, the selected area was analysed by using panoramic terrestrial and aerial photograph. But in this study I represent the present terrain by using digital terrain materials which was acquired by a check form map of the selected area, and predict the route line according to the view points by using basic development plan. As a result of using the digital terrain model method in the optimum route determination with terrestrial photograph, it is possible to explain the terrain in detail when the present conditions terrain is analysed. As we can anticipated many sided road in large scale development plan with digital terrain materials which was used in analysing the present terrain, it is possible to lead to more effective route planning, landers planning and the optimum road determination than the usual method in the basic plan.

  • PDF

Design and Evaluation of Neighbor-aware AODV Routing Protocol in Mobile Ad-hoc Network (이동 애드혹 네트워크에서 이웃노드 정보를 이용한 AODV 라우팅 프로토콜의 설계 및 평가)

  • Kim, Cheol-Joong;Park, Seok-Cheon
    • The KIPS Transactions:PartC
    • /
    • v.15C no.3
    • /
    • pp.213-220
    • /
    • 2008
  • A MANET is an autonomous, infrastructureless system that consists of mobile nodes. In MANET, on-demand routing protocols are usually used because network topology changes frequently. The current approach in case of broken routes is to flag an error and re-initiate route discovery either at the source or at the intermediate node. Repairing these broken links is a costly affair in terms of routing overhead and delay involved. Therefore, this paper propose a NAODV(Neighbor-aware AODV) protocol that stands on the basis of an AODV. It sets up the route rapidly if it operates for setting the route directly by using sequence number of neighbor nodes without re-search the route when the route to destination node is broken. Also, it reduces loss of packets. We use NS-2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio and average end-to-end delay. Also, when the proposed protocol is applied to the large ad-hoc network with multiple nodes, the performance is more efficient.

The Optimization path searching Method Development for Destination (목적지를 고려한 최적 경로탐색 기법 개발)

  • Ham Young-Kug;Kim Tae-Eun
    • Journal of Digital Contents Society
    • /
    • v.6 no.1
    • /
    • pp.55-62
    • /
    • 2005
  • In this paper, we propose the new technique to compute the optimal route by considering the direction of distribution vehicles and the location for delivery, developing the algorithm of the shortest route to approach the location as applying the gemetic algorithm. This approach makes it possible for us to find the best route even under itineraries which include many destinations. Lively studies are currently in progress on the development of vehicle navigation software, combining PDA GPS, and electronic maps. Many web-sites are providing a varier of services which use electronic maps. Popular among these services is one that computes the optimal route between two positions that a user inputs. This service of computing the optimal route plays an important role in distribution industries such as home-delivery. For the distribution system. the construction of a vehicle regulation system enables us to calculate and manipulate the optimal route for distribution vehicles, to enhance the efficiency in making use of vehicles and labor, and to reduce costs.

  • PDF

An Effective Shipping Transport Operation Plan for the Pan-Yellow Sea Area: Focusing on the Introduction of an Incheon-China Container Liner Route (환황해권 해상운송의 효율적 운영방안-인천/중국 컨테이너항로 개설을 중심으로-)

  • 김홍섭
    • Journal of Korea Port Economic Association
    • /
    • v.17 no.2
    • /
    • pp.139-166
    • /
    • 2001
  • Globalization and regionalization are major trends in the international economic system. The severe competition among countries has signalled the need for a new international trade system as prescribed by the WTO, which regulates international trade practices. Additionally, expanding the activities and role of the Pan-Yellow Sea area in the world has a very important function in terms of regional cooperation and logistics environment. In this paper, the trading conditions and shipping transport problems of the Pan-Yellow Sea area (North-East Asia) were investigated. Shipping transport conditions in the Pan-Yellow Sea area, particularly Korea-China routes, were surveyed as well. A new Incheon-China container liner route was suggested as a partial remedy to some of the shipping transport problems of the Pan-Yellow Sea Area (North-East Asia). The Incheon-China Container Liner route is more efficient than Pusan and Pyungtaek Ports or the car ferry route to China in terms of transport time and expense. The transport burden indicator which includes the time and expense of transport, can be a useful tool in comparing these routes. Accordign to the transport burden indicator, the Incheon-China Container Liner route is more efficient than the Pusan, Pyungtaek, or car ferry routes. To establish a successful liner route between the ports of Inchon and China, there is a need to prepare three measures that contain short-term medium-term and long-term strategies. Furthermore, these measures should be prepared and adopted in phases, in accordance with considerations of future conditions for shipping and logistics in the Pan-Yellow Sea area.

  • PDF

An Solution Algorithm for A Multi-Class Dynamic Traffic Assignment Problem (다계층운전자를 고려한 동적통행배정모형의 해법)

  • Shin, Seong-Il;Kim, Jeong-Hyun;Baik, Nam-Cheol
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.6
    • /
    • pp.77-88
    • /
    • 2003
  • This paper proposes a solution algorithm for solving a multi-class analytical DTA model. In the DTA model, three traveler classes are classified according to different assumptions of traveler's route choice behavior: including fixed route, Stochastic Dynamic User Optimum(SDUO), and Dynamic User Optimum(DUO). To solve this DTA model, variables of link flow and exit flow are represented solely by inflow. The resulting Linear Program(LP) subproblem in the inner iteration is solved as a typical time-dependent shortest route problem over a physical network. Accordingly, the required time-space network expansion in solving DTA models is no longer needed.