• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.3 s.8
• /
• pp.9-22
• /
• 2005

Route travel cost in transportation networks consists of actual route travel cost and route perception cost. Since the route perception cost is differently perceived according to each origin and each destination, route search has limitation to reflect the note perception cost due to route enumeration problem. Thus, currently employed advanced traveller information systems (ATIS) have considered only actual route travel cost for providing route information. This study proposes an optimal and a K-route searching algorithm which are able to reflect the route perception cost but encompass route enumeration problem. For this purpose, this research defines the minimum nit of route as a link by adopting the link label technique in route searching, therefore the comparison of two adjacent links which can be finally expanded the comparison of two routes. In order to reflect the characteristics of route perception in real situation, an optimal shortest cost path algorithm that both the forward search from the origin and the backward search from the destination can be simultaneously processed is proposed. The proposed algorithm is applied for finding K number of shortest routes with an entire-path-deletion-type of K shortest route algorithm.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2021.11a
• /
• pp.10-12
• /
• 2021

유선은 수상에서 고기잡이, 관광, 그 밖의 유락하는 사람을 승선시키는 것 등 「해운법」을 적용받지 아니하는 유선사업에 종사하는 선박으로, 안전관리 부분의 경우 해양경찰청에서 담당하고 있다. 선령기준 초과 유선의 선박검사 및 선박관리평가 기준을 마련하여 해양경찰청에서는 노후 유선에 대한 안전관리를 지속적으로 평가 하고 있으나, 기존의 여객운송사업의 선박관리평가 기준을 준용하여 평가함에 따라 내항만을 통항하고 출발지와 도착지가 동일한 관광등의 유람 목적 등 유선의 특수성 등을 반영하지 못하고 있다. 본 연구에서는 유선의 통항 특성과 일반적인 운영 환경등을 고려하여 유선에 적합한 선령기준 초과 유선의 선박 검사 및 관리평가 기준 마련의 필요성을 제안하였다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.6
• /
• pp.1-12
• /
• 2016

In this paper, we consider a general discrete-time queueing system with D-BMAP(discrete-time batch Markovian arrival process) and D-policy. An idle single server becomes busy when the total service times of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state workload distribution is derived in the form of generating function. Mean workload is derived as a performance measure. Simulation is also performed for the purpose of verification and a simple numerical example is shown.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.3 s.8
• /
• pp.51-59
• /
• 2005

To improve the quality of bus service, providing bus ravel time information to passenger through station screen. Generally, bus travel time information predict by using previous bus data such as neural network, Kalman filtering, and moving average algorithms. However, when they got a difficulty about bus travel time information because of the missing previous bus data, they use pattern data. Generally, nevertheless the difference of range is big. Hence in this research to calculate the bus travel time information when the bus information is missed, use queue detector's data which set up in link. The application of several factors which influence in bus link travel time, we used CORSIM Version 5.1 simulation package.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.87-92
• /
• 2013

This paper focuses on analyzing the effects of primary user (PU) signal arrival on the local spectrum sensing performance. The probability for signal arrival at a sample in the sensing time is uniformly distributed in the sensing time. We first analyze the main factor that causes the degradation in the detection results in the conventional energy detection (CED) under the uniformly random arrival of the PU-signal. Thus we propose an approach in order to enhance the detection performance, in which an estimator which detects the arrival of the PU signal cooperates with a composite energy detection. The mathematical analysis and numerical simulation has validated the outperformance of the proposed approach compared to the CED.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5C
• /
• pp.556-561
• /
• 2006

In this study, an ultra-wideband(UWB) signal model is considered to estimate the angle-of-arrivals(AOAs) of clusters in an UWB indoor-to-outdoor communication environment having random angle spreads. A conventional AOA algorithm for UWB estimates the directions of both clusters and multipath signals together and so has complex estimation procedure. In order to solve that problem, we propose a new clustered AOA estimation algorithm. The estimation technique based a well-known MUSIC algorithm is proposed and the estimates of the AOA on received clusters are obtained using the proposed technique. The proposed model and estimation technique are verified through computer simulations.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.1-10
• /
• 2009

Bus delay time is occurred as the result of traffic condition and important factor to predict bus arrival time. In this paper, transition probability matrixes between bus stops are made by using Markov Chain and it is predicted bus delay time with them. As the results of study, it is confirmed a possibility of adapting the assumption which it has same bus transition probability between stops through paired-samples T-test and overcame the limitation of exiting studies in case there is no scheduled bus arrival time for each stops with using bus interval time. Therefore it will be possible to predict bus arrival time with Markov Chain.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.4
• /
• pp.93-99
• /
• 2011

This paper proposes a novel network jitter estimation algorithm for robust VoIP communication system. The proposed method computes the current network environment mode using the differences of arrival time and generation time from sequential received packets. According to the current network environment mode, the jitter variance weights is adjusted to minimize the error for estimating the network jitter. The jitter average and variance are calculated by the autoregressive estimated algorithm, and then the network jitter is estimated by applying the jitter variance weights.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.895-900
• /
• 2010

As the diverse telecommunication services have been developed, network designers need to prevent congestion which may be caused by properties of timecorrelation and burstiness, and unpredictable statistical fluctuation of traffic streams. This paper considers the leaky bucket scheme with combined control of arrival and token rates, in which the arrival rate and the token generation interval are controlled according to the queue length. By using the embedded Markov chain and the supplementary variable methods, we obtain the queue length distribution as well as the loss probability and the mean waiting time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10A
• /
• pp.956-963
• /
• 2008

In a multi-hop wireless ad hoc network broadcasting is an elementary operation to support route discovery, address resolution and other application tasks. Broadcasting by flooding may cause serious redundancy, contention, and collision in the network which is referred to as the broadcast storm problem. Many broadcasting schemes have been proposed to give better performance than simple flooding in wireless ad hoc network. How to decide whether re-broadcast or not also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose enhanced broadcasting schemes, which can reduce re-broadcast packets without loss of reachability. Simulation results show that proposed schemes can offer better reachability as well as efficiency as compared to other previous schemes.