• The Korean Journal of Air & Space Law and Policy
• /
• v.21 no.2
• /
• pp.71-96
• /
• 2006

This paper intends to describe the carrier's duty for the delivery of international air cargo and the carrier's liability for the illegal delivery of cargo under the Montreal Convention, lATA Conditions of Carriage for Cargo and judicial precedents. Under the Article 13 of Montreal Convention, the consignee is entitled, on arrival of the cargo at the place of destination, to require the carrier to deliver the cargo to it, on payment of the charge due and on complying with the conditions of carriage. And unless it is otherwise agreed, it is the duty of the carrier to give notice to the consignee as soon as the cargo arrives. Under the Article 18 of Montreal Convention, the carrier is liable for damage sustained in the event of the destruction or less of or damage to, cargo upon condition only that the event which caused the damage so sustained took place during the carriage by air. And the carriage by air comprises by the period during which the cargo is in the carriage of the carrier. Under the Article 11 of lATA Conditions of Carriage for Cargo, carrier is liable to shipper, consignee of any other person for damage sustained in the event of destruction of loss of, or damage to, or delay in the carriage of cargo only if the occurrence which caused to the damage so sustained took place during the carriage as defined under Article 1. According to the precedent of Korean Supreme Court sentenced on 22 July 2004, the freight forwarder as carrier was not liable for the illegal delivery of cargo to the notify party (actual importer) on the airway bill by the bonded warehouse operator because the freight forwarder did not designate the bonded warehouse and did not hold the position of employer to the bonded warehouse operator. In conclusion, the carrier or freight forwarder should pay always attention the movement and condition of the cargo not to be liable for the illegal delivery of cargo.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.2
• /
• pp.1-6
• /
• 2023

The purpose of this study is to research and develop so that users who are gradually progressing in the popularization of smartphones and the calculation of agricultural quality can use more active and flexible applications than existing application fields. People use event management applications to remember what they need to do, and maps applications to get to their appointments on time. You will need to build a glue-delivered application that leverages the Maps API to be able to recommend the glove's path for events so that the user can use the application temporarily. By comparing and analyzing currently used calendar, map, and schedule applications, several Open Maps APIs were compared to supplement the weaknesses and develop applications that converge the strengths. The results of application development by applying the optimal algorithm for recommending traffic routes according to time and place for the schedule registered by the user are described.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.5
• /
• pp.988-995
• /
• 2009

One of the most popular services of Telematics is a shortest path finding from a starting point to a destination. In this paper, a dynamic shortest path finding system with forecasting result of traffic flow in the future was developed and various experiments to verify the performance of our system using real-time traffic information has been conducted. Traffic forecasting has been done by a prediction system using Bayesian network. It searched a dynamic shortest path, a static shortest path and an accumulated shortest path for the same starting point and destination and calculated their travel time to compare with one of its real shortest path. From the experiment, over 75%, the travel time of dynamic shortest paths is the closest to one of their real shortest paths than one of static shortest paths and accumulated shortest paths. Therefore, it is proved that finding a dynamic shortest path by applying traffic flows in the future for intermediated intersections can give more accurate traffic information and improve the quality of services of Telematics than finding a static shortest path applying by traffic flows of the starting time for intermediated intersections.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.94-99
• /
• 2001

Recently a lot of informations is interchanged among many users through the network such as Internet. In this situation. multimedia data transfer has some problems. that are jitter, the difference of delay in arriving packets, and loss of data due to the various delay between sender and receiver. The arriving data packets are not synchronized because of those problems. Especially, an efficient method is needed to revise the sudden large changes of the delay, called spike-like delay. which is occured in explosive growth of networking. We propose efficient synchronization algorithm which controls synchronization interval and adjusts to sudden changes in networks. The algorithm, a receiver-driven adaptive synchronization method, is to synchronize the arriving data packets against spike-like delay and decrease the loss of them. In addition, another method is proposed in this paper. The method uses the probabilistic features of delay distribution appearing in general network. It is evaluated for the loss of data packets and the delay times.

• Journal of Korean Society of Transportation
• /
• v.28 no.1
• /
• pp.77-86
• /
• 2010

The study developed physical distribution channel choice models reflecting decision making of the firms and studied how choice decision factors influence selection of distribution channel. The distribution channel survey data in Korea was used to do empirical study. As a choice set, distribution channels were classified into two main choice channels: direct and indirect channels. In addition, indirect channels were classified into other three channels according to the type of intermediate point: distribution center, wholesale store, and agency. This study developed choice models by applying both binary and multinomial logit model with various set of factors. The results showed that the developed logit models seemingly reflect distribution channel choice behaviors. The hypothesis tests on how each factor influences choice of distribution channel were performed and discussed as well.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.4D
• /
• pp.339-349
• /
• 2010

The objective of this paper is to develop a structural equations model system for the purpose of tourists' excursion behaviour analysis with their information usage. A tourist' excursion behavior defined as activities in the sightseeing region between arriving and leaving time includes indexes with respect to activity' time use and the number of spots. Additionally, such indexes can be modeled as endogenous variables in the structural equation model system on the assumption that they are influenced by the degree of familarity on the sightseeing region, the degree of information usage, and individual attributes. The case study application involves excursion behaviour data such as one-day excursion activity and information usage diary that are observed in the Fuji Five Lakes, Japan. Since the models presented in the paper are available to statistically analyze the covariance among the endogenous variables, they have the advantage of effectiveness analysis on information usage in the excursion area, compared to the prior approaches such as discrete choice models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1884-1892
• /
• 1993

In push out scheme, high priority cell which arrives when the buffer is full pushs low priority cell. The PBS scheme provides priority by variable threshold in buffer.In this paper, for Controlling congestion in ATM network we propose buffer processing method in which the PBS scheme has variable threshold. And we analysis The performance of this scheme. As a result of simulation, the proposed push out scheme with variable threshold reduces the loss of low priority cell compared with existing push out scheme. This proposed method not only reduces the loss of high priority cell like existing push out scheme but also reduces the loss of low priority cell by variable threshold.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.10
• /
• pp.2014-2027
• /
• 1994

A queueing model with two input streams of different service priorities is studied. Specifically, IBP+BP/D/1 with head-of-line priority is analyzed. IBP and BP stand for Interrupted Bernoulli Process and Bernoulli Process respectively. The BP-stream customers have the higher service priority over the IBP-stream customers. An exact analysis of this priority queue is presented to derive the distributions of the state of the system at steady state, the waiting time distributions for each class of customers, and the interdeparture time distributions. The numerical results of the analysis are presented to show how the various parameters of the low and high priority arrival processes affect the performance of the system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2170-2178
• /
• 1994

Our previously proposed method is further applied to find the queue length distribution of MMPP/D1 in an ATM multiplexer. We derive some useful relationship between the queue distribution seen by arriving cells and for a server befor each service. The relations were used to improve out approximation. For MMPP/D1 the calculated results show a good agreement with those obtained by a simulation of the system. Furthermore, our approximation provides fast numerical algorithms for general traffic models. These advantages demomstrate that our approximation method is useful for a fast and accurate traffic analysis in ATM networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.663-668
• /
• 2010

In driving a car, turns such as left turns, right turns, or u-turns, make the speed of the car decrease considerably. A more straight path, therefore, is probably faster to arrive at the destination than zig-zag path with same distance. In this paper, we have newly proposed the turn heuristic to make more straight path. The path navigation algorithm with turn heuristic(called as TA* algorithm) could enhance the straightness of a path by putting the turned-edges to the turn cost. It requires higher cost to use TA* algorithm than traditional A* algorithm because the straight-edge first searching have increased the search space. We have improved the TA* algorithm into the variable TA* algorithm(called as VTA* algorithm) which adopt the turn-heuristic during the a portion of the whole path.