• Journal of Korean Society of Transportation
• /
• v.21 no.6
• /
• pp.89-99
• /
• 2003

Considering a path represented by a sequence of link numbers in a network, the vine is differentiated from the loop in a sense that any link number can be appeared in the path only once, while more than once in the loop. The vine provides a proper idea how to account for complicated travel patterns such as U-turn and P-turn witnessed nearby intersections in urban roads. This paper proposes a new algorithm in which the vine travel pattern can be considered for finding K number of sequential paths. The main idea of this paper is achieved by replacing the node label of the existing Yen's algorithm by the link label technique. The case studies show that the algorithm properly represent the vine travel patterns in searching K number of paths. A noticeable result is that the algorithm may be a promising alternative for ITS deployment by enabling to provide reasonable route information including perceived traveler costs.

• Journal of The Korean Society of Clinical Toxicology
• /
• v.19 no.2
• /
• pp.93-99
• /
• 2021

Purpose: Nutritional status and support in critically ill patients are important factors in determining patient recovery and prognosis. The aim of this study was to analyze the early nutritional status and the methods of nutritional support in critically ill patients with acute poisoning and to evaluate the effect of nutritional status on prognosis. Methods: A retrospective study was conducted in tertiary care teaching hospital from January 2018 to December 2020. in an emergency department of university hospital, 220 patients who were stayed more than 2 days of poisoning in intensive care unit were enrolled. Results: 155 (70.5%) of patients with acute poisoning had low-risk in nutritional risk screening (NRS). Patients with malignancy had higher NRS (low risk 5.2%, moderate risk 18.5%, high risk 13.2%, p=0.024). Patients of 91.4% supplied nutrition via oral route or enteral route. Parenteral route for starting method of nutritional support were higher in patients with acute poisoning of herbicide or pesticide (medicine 3.2%, herbicide 13.8%, pesticide 22.2%, p=0.000). In multivariate logistic regression analysis, herbicide or pesticide intoxication, higher risk in NRS and sequential organ failure assessment over 4.5 were affecting factor on poor recovery at discharge. Conclusion: NRS in patients intoxicated with herbicide or pesticide were higher than that in patients intoxicated with medicine intoxication. Enteral nutrition in patients intoxicated with herbicide or pesticide was less common. Initial NRS was correlated with recovery at discharge in patient with intoxication. It is expected to be helpful in finding patients with high-risk nutritional status in acute poisoning patients and establishing a treatment plan that can actively implement nutritional support.

• Journal of Korean Society of Transportation
• /
• v.23 no.6 s.84
• /
• pp.91-102
• /
• 2005

When it comes to the process of information storage, people are likely to organize individual information into the forms of groups rather than independent attributes, and put them together in their brains. Likewise, in case of finding the shortest path, this study suggests that a Hierarchical Road Network(HRN) model should be selected to browse the most desirable route, since the HRN model takes the process mentioned above into account. Moreover, most of drivers make a decision to select a route from origin to destination by road hierarchy. It says that the drivers feel difference between the link travel tine which was measured by driving and the theoretical link travel time. There is a different solution which has predicted the link travel time to solve this problem. By using this solution, the link travel time is predicted based on link conditions from time to time. The predicated link travel time is used to search the shortest path. Stochastic Process model uses the historical patterns of travel time conditions on links. The HRN model has compared favorably with the conventional shortest path finding model in tern of calculated speeds. Even more, the result of the shortest path using the HRN model has more similar to the survey results which was conducted to the taxi drivers. Taxi drivers have a strong knowledge of road conditions on the road networks and they are more likely to select a shortest path according to the real common sense.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.1
• /
• pp.10-21
• /
• 2008

User travel behavior is based on the existence of complete traffic information in deterministic user optimal principle by Wardrop(1952). According to deterministic user optimal principle, users choose the optimal route from origin to destination and they change their routes arbitrarily in order to minimize travel cost. In this principle, users only consider travel time as a factor to take their routes. However, user behavior is not determined by only travel time in actuality. Namely, the models that reflect only travel time as a route choice factor could give irrational travel behavior results. Therefore, the model is necessary that considers various factors including travel time, transportation networks structure and traffic information. In this research, more realistic deterministic optimal traffic assignment model is proposed in the way of route recognizance behavior. This model assumes that when users decide their routes, they consider many factors such as travel time, road condition and traffic information. In addition, route recognizance attributes is reflected in this suggested model by forward searching method and backward searching method with numerical formulas and algorithms.

• Journal of the Korean Society of Costume
• /
• v.50 no.6
• /
• pp.59-72
• /
• 2000

The Purpose of this study is to determine the effect of new generation adolescents' clothing consumption values on their evaluation of clothing products. In the positive analysis, a questionnaire survey was conducted. Particularly, based on Sheth's (1991) theory, a focus group Interview was performed to develop the questionnaire on adolescents' clothing consumption values. The results of this study can be summarized as follows: First, young consumers have different values and clothing purchasing behavior from adults. To be specific, adolescents tended to appreciate fashionable and sensual values among clothing consumption values. Second, it was found that adolescents'personal values and their group-wise clothing consumption values affected their evaluation of clothing products. Such a finding may explain the relationship between value system and purchasing decisions. Namely, adolescents' evaluation of clothing products is affected by their value system. This finding supports the consumer value system suggested by the "expectation-value" theory. Thus, values and clothing products evaluation are neither separated from each other nor unrelated, but they affect each other in an abstract hierarchial structure. After all, through the route model, personal values affect clothing consumption values, which in turn affect clothing products evaluation. Besides, the clothing consumption values are affected by gender directly or indirectly. All in all, some specific indices regarding the abstract and hierarchial consumption values could be offered by analyzing the effects of adolescents' consumption values on their evaluation of clothing products in reference to the external clues of price and trademark manipulated, and thereby, the effects of consumption values on the positive clothing products evaluation could be determined in general.n general.

• Journal of Korean Society of Transportation
• /
• v.23 no.2
• /
• pp.117-130
• /
• 2005

In both deteministic user Optimal Traffic Assignment Model (UOTAM) and stochastic UOTAM, travel time, which is a major ccriterion for traffic loading over transportation network, is defined by the sum of link travel time and turn delay at intersections. In this assignment method, drivers actual route perception processes and choice behaviors, which can become main explanatory factors, are not sufficiently considered: therefore may result in biased traffic loading. Even though there have been some efforts in Stochastic UOTAM for reflecting drivers' route perception cost by assuming cumulative distribution function of link travel time, it has not been fundamental fruitions, but some trials based on the unreasonable assumptions of Probit model of truncated travel time distribution function and Logit model of independency of inter-link congestion. The critical reason why deterministic UOTAM have not been able to reflect route perception cost is that the route perception cost has each different value according to each origin, destination, and path connection the origin and destination. Therefore in order to find the optimum route between OD pair, route enumeration problem that all routes connecting an OD pair must be compared is encountered, and it is the critical reason causing computational failure because uncountable number of path may be enumerated as the scale of transportation network become bigger. The purpose of this study is to propose a method to enable UOTAM to reflect route perception cost without route enumeration between an O-D pair. For this purpose, this study defines a link as a least definition of path. Thus since each link can be treated as a path, in two links searching process of the link label based optimum path algorithm, the route enumeration between OD pair can be reduced the scale of finding optimum path to all links. The computational burden of this method is no more than link label based optimum path algorithm. Each different perception cost is embedded as a quantitative value generated by comparing the sub-path from the origin to the searching link and the searched link.

• Journal of Korea Port Economic Association
• /
• v.30 no.1
• /
• pp.175-194
• /
• 2014

Because the thawing of the Arctic ocean is slowly accelerating due to global warming, recently exploring resources in Arctic ocean and transporting resources by using the North Pole route have been getting spotlight. Since the original route transported by the Suez Canal from Korea to Europe could be shorten about 8,000km in distance(decreased about 38% compared to the original route), which means shortening about 10 voyage dates, it is expected to bring huge logistics cost reduction. Once the North Pole route is commercialized successfully, it would be one of the most important variables that affects future of Busan port and guides for economic development of Busan. Therefore, the purpose of this study is to analyze Busan port and the economic growth of Busan area by researching promising industry, based on the effect of freight transporting by the Northern sea route on the economy of Busan. For this study, questionnaire surveys and interviews were conducted for 64 people of experts in the shipping and port industry, relevant government, and academics. The survey finding shows that port logistics industry is a promising business in Busan in terms of its growth and competitiveness. It is necessary to develop feeder network facilities that prepare for commercialization of the Northern sea route as a short and medium term plan and provide professional manpower training in polar regions. Ship supply business would also play an important role. It is identified that revitalization of shipbuilding and ocean plant industry should be done in terms of Arctic business. With regard to the fishery industry it is found that modernization of fishery ship and development of fishery equipment used in polar areas should be carried out.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.409-414
• /
• 2008

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.

• Journal of Korean Society of Transportation
• /
• v.33 no.2
• /
• pp.192-203
• /
• 2015

Pedestrians not only walk along pedestrian pathways, but also choose unusual routes such as passing through buildings or crossing large scale open spaces. This study defines these unusual paths as social path, and includes them into one of the pedestrian road categories. Previous pedestrian accessibility and route choice studies could not evaluate correctly the space connectivity or optimal route because the social path was not considered properly. Therefore, this study analyzes the effectiveness of the social path in view of space connectivity focused on Coex and Seoul stations in Seoul, which are representative transit oriented development(TOD) areas. Global integration, which is widely used in network analysis, is selected (as performance index) to identify the space hierarchy and define new pedestrian links. The study results show that the network connectivity is improved especially in the main streets and social paths. This study demonstrated that the social path should be considered in finding the pedestrian optimal route from the practical perspective.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.1-23
• /
• 2005

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.