• Journal of Advanced Marine Engineering and Technology
• /
• v.41 no.1
• /
• pp.111-117
• /
• 2017

The arrival time of rescue ships is very important in the event of distress. This paper presents the development of experimental data to calculate the arrival time of rescue ships. The ship's traffic probability distribution was used. Mokpo Port was selected as the area of study, and AIS data for a 1 year period were used. For the ship's traffic probability distribution, a gateline was established. The lateral range distribution was calculated and fitted to the normal distribution and two Gaussian mixture distributions (GMD2), and each parameter was extracted. After the locations of ${\mu}$, ${\mu}{\pm}1{\sigma}$ of the normal distribution and ${\mu}_1$ of the two Gaussian mixture distribution(GMD2) were set as waypoints, the location and probability were determined. A scenario was established in relation to each type of parameter. Thus, the arrival time can be calculated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1128-1135
• /
• 2010

A wireless positioning system using ultra-wideband (UWB) for indoor wireless positioning uses ranging data in order to accurately estimate location. Commonly, ranging uses time of arrival (TOA), time difference of arrival (TDOA) based on arrival time. The most fundamental issue in the ranging for wireless positioning is to obtain clock synchronization among the sensor nodes and to correct an error caused by the relative clock offset from each node. In this paper, we propose ranging and positioning technique using common clock in order to solve both clock synchronization and clock offset problems. To verify the performance of proposed, we simulated ranging and positioning in channel model introduced by IEEE 802.15.4a Task Group and then results show that location estimation is unaffected by clock offset.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.3
• /
• pp.119-135
• /
• 2005

Design of location erea(LA) in a cellular network is to partition the network into clusters of cells so as to minimize the cost of location updating and paging. Most research works dealing with the LA design problem assume that the call. arrival rate and mobile flow rate are fixed parameters which can be estimated independently. In this aspect, most Problems addressed so far are deterministic LA design problems(DLADP), known to be NP hard. The mobile flow and call arrival rate are, however, varying with time and should be treated simultaneously because the call arrival rate in a cell during a day is influenced by the change of a population size of the cell. This Paper Presents a new model on IA design problems considering the time-dependent call arrival and mobile flow rate. The new model becomes a stochastic LA design problem(SLADP) because It takes into account the possibility of paging waiting and blocking caused by the changing call arrival rate and finite paging capacity. Un order to obtain the optimal solution of the LA design problem, the SIADP is transformed Into the DLADP by introducing the utilization factor of paging channels and the problem is solved iteratively until the required paging quality is satisfied. Finally, an illustrative example reflecting the metropolitan area, Seoul, is provided and the optimal partitions of a cell structure are presented.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.39 no.6
• /
• pp.833-839
• /
• 2019

Bus Information System (BIS) collects information related to the operation of buses and provides information to users through predictive algorithms. Method of predicting through recent information in same section reflects the traffic situation of the section, but cannot reflect the characteristics of the target line. The method of predicting the historical data at the same time zone is limited in forecasting peak time with high volatility of traffic flow. Therefore, we developed a pattern recognition bus arrival time prediction algorithm which could be overcome previous limitation. This method recognize the traffic pattern of target flow and select the most similar past traffic pattern. The results of this study were compared with the BIS arrival forecast information history of Seoul. RMSE of travel time between estimated and observed was approximately 35 seconds (40 seconds in BIS) at the off-peak time and 40 seconds (60 seconds in BIS) at the peak time. This means that there is data that can represent the current traffic situation in other time zones except for the same past time zone.

• Convergence Security Journal
• /
• v.22 no.2
• /
• pp.105-114
• /
• 2022

This paper is presents an intelligent control system that visualizes the direction of arrival for hearing impaired using personal mobility, and aims to recognize and prevent dangerous situations caused by sound such as alarm sounds and crack sounds on roads. The position estimation method of sound source uses a machine learning classification model characterized by generalized correlated phase transformation based on time difference of arrival. In the experimental environment reproducing the road situations, four classification models learned after extracting learning data according to wind speeds 0km/h, 5.8km/h, 14.2km/h, and 26.4km/h were compared with grid search cross validation, and the Muti-Layer Perceptron(MLP) model with the best performance was applied as the optimal algorithm. When wind occurred, the proposed algorithm showed an average performance improvement of 7.6-11.5% compared to the previous studies.

• IE interfaces
• /
• v.25 no.3
• /
• pp.283-289
• /
• 2012

M/G/1 queue with server vacations period depending on the previous vacation and customer's arrival is considered. Most existing studies on M/G/1 queue with server vacations assume that server vacations are independent of customers' arrival. However, some vacations are terminated by some class of customers' arrival in certain queueing systems. In this paper, therefore, we investigate M/G/1 queue with server vacations where each vacation period has different distribution and vacation length is influenced by customers' arrival. Laplace-Stieltjes transform of the waiting time distribution and the distribution of number of customers waiting for each class of customers are respectively derived. As performance measures, mean waiting time and average number of customers waiting for each class of customers are also derived.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.1
• /
• pp.53-63
• /
• 2018

In this paper, we analyze the waiting time of a queueing system with D-BMAP (discrete-time batch Markovian arrival process) and D-policy. Customer group or packets arrives at the system according to discrete-time Markovian arrival process, and an idle single server becomes busy when the total service time 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 waiting time distribution is derived in the form of a generating function. Mean waiting time is derived as a performance measure. Simulation is also performed for the purpose of verification and validation. Two simple numerical examples are shown.

• Journal of Korean Society of Transportation
• /
• v.28 no.1
• /
• pp.135-142
• /
• 2010

The convenient techniques for predicting the bus arrival time have used the data obtained from the buses belong to the same company only. Consequently, the conventional techniques have often failed to predict the bus arrival time at the downstream bus stops due to the lack of the data during congestion time period. The primary objective of this study is to overcome the weakness of the conventional techniques. The estimation model developed based on the data obtained from Bus Information System(BIS) and Bus management System(BMS). The proposed model predicts the bus arrival time at bus stops by using the data of all buses travelling same roadway section during the same time period. In the tests, the proposed model had a good accuracy of predicting the bus arrival time at the bus stops in terms of statistical measurements (e.g., root mean square error). Overall, the empirical results were very encouraging: the model maintains a prediction job during the morning and evening peak periods and delivers excellent results for the severely congested roadways that are of the most practical interest.

• The Korean Journal of Food & Health Convergence
• /
• v.8 no.6
• /
• pp.11-17
• /
• 2022

Emergency transport is directly related to the life of the patient, and rapid transport to the hospital is crucial. However, external environmental factors such as traffic or weather, interfere with hospital transport. In this study, we investigated the external environment affecting hospital transport time. We examined the transfer time and patient treatment time of emergency patients in an area of northern Gyeonggi-do from 2018 to 2020. Diagnosis after arrival at the hospital was used, and on-site treatment time was measured from paramedic arrival time at the scene to departure. Furthermore, we examined whether there was a correlation between the time paramedics left the scene and hospital arrival time through the reason for the delay as recorded in the emergency log. Traffic jams had the greatest impact on patient transport, while transport delays occurred due to heavy rain, but not snow. Among injured patients, electrical accidents were the most problematic in terms of on-site treatment time. This was because a lot of first aid is needed in electrical accidents. It must be necessary to mobilize two ambulances in an emergency through the expansion of infrastructure, prepare a plan for rapid transport in heavy rain, and implement strong laws against transport obstruction.

• Journal of the Korea Society for Simulation
• /
• v.24 no.3
• /
• pp.27-35
• /
• 2015

We analyze an M/G/1/K queueing system with queue-length dependent service and arrival rates. There are a single server and a buffer with finite capacity K including a customer in service. The customers are served by a first-come-first-service basis. We put two thresholds $L_1$ and $L_2$($${\geq_-}L_1$$ ) on the buffer. If the queue length at the service initiation epoch is less than the threshold $L_1$, the service time of customers follows $S_1$ with a mean of ${\mu}_1$ and the arrival of customers follows a Poisson process with a rate of ${\lambda}_1$. When the queue length at the service initiation epoch is equal to or greater than $L_1$ and less than $L_2$, the service time is changed to $S_2$ with a mean of $${\mu}_2{\geq_-}{\mu}_1$$. The arrival rate is still ${\lambda}_1$. Finally, if the queue length at the service initiation epoch is greater than $L_2$, the arrival rate of customers are also changed to a value of $${\lambda}_2({\leq_-}{\lambda}_1)$$ and the mean of the service times is ${\mu}_2$. By using the embedded Markov chain method, we derive queue length distribution at departure epochs. We also obtain the queue length distribution at an arbitrary time by the supplementary variable method. Finally, performance measures such as loss probability and mean waiting time are presented.