• Korean Journal of Acupuncture
• /
• v.25 no.1
• /
• pp.1-18
• /
• 2008

Objectives : The aim of this study is to investigate the properties of Meridian Gi in $\ulcorner$Huangdineijing(黃帝內經)$\lrcorner$, specially one of the movement properties like that comings and goings of Gi. Methods : Through searching concepts and properties of Meridian Gi in several chapters of $\ulcorner$Huangdineijing(黃帝內經)$\lrcorner$, many phrases concerned with that properties could be explained and reconstructed into new motional shape of Meridian Gi. Results : The basic characters of comings and goings of Meridian Gi or genuine Gi originate from food essence, and that are like a kind of waves. The most important moments of acupuncture treatment is such time of it's short passing the acupoints, carrying out tonifying and purging methods by controlling the spirit. Conclusions : The Meridian Gi consists of anti-pathogenic Gi so called genuine Gi and pathogenic Gi. Medical doctor must correctly knows the flow of Meridian Gi to operate tonifying and purging method of acupuncture treatments in order to get the desired results. Also maintaining very sensitive state in diagnostic process, the most important key points is to control the spirit and adjust mental activities of both doctors and patients. The motional properties of Meridian Gi are actually concerned with the arrival of Gi and reinforcement-reduction along and against Meridian Gi.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.1
• /
• pp.107-115
• /
• 2008

We consider the discrete-time GI/G/1/K queue under the early arrival system. Using a modified supplementary variable technique(SVT), we obtain the distribution of the steady-state queue length. Unlike the conventional SVT, the modified SVT yields transform-free results in such a form that a simple two-moment approximation scheme can be easily established.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.32 no.1D
• /
• pp.13-22
• /
• 2012

The 119 emergency rescue-aid service operated by Korean government is a very valuable in a society and its importance is growing in Korea as an aging society. Especially, the emergency vehicle's arrival time to accidents place is an important variable which affects initial emergency measure for patients and it depends on the road network attributes, such as emergency service station's location, accessibility to accidents place and so on. This study aims to analysis the emergency vehicles' arrival delay and the dispatch station in the viewpoint of efficiency utilizing the real rescue-aid activity data. We analyzed the dispatch distribution of the emergency rescue-aid service at first. And we analyzed high accident rate locations not involved in the fixed radius of rescue-aid service stations and display GIS map showing regions have been delayed. The input data of the road network speed is based on the KTDB (Korea Transportation Database) and historical rescue-aid data is from Gyeongsangbuk-do's fire service headquarters.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.399-405
• /
• 2002

Now days, it is based on GIS and GPS, it can search for the shortest path and estimation of arrival time by using the internet and cell phone to driver. But, even though good car navigation system does not create which is the shortest path when there average vehicle speed is 10 -20 Km. Therefore In order to reduce vehicle waiting time and average vehicle speed, we suggest optimal green time algorithm using fuzzy adaptive control , where there are different traffic intersection length and lane. In this paper, it will be able to forecast the optimal traffic Information, estimation of destination arrival time, under construction road, and dangerous road using internet.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.5
• /
• pp.304-313
• /
• 2016

This work suggests a new analysis approach for a discrete-time GI/G/1 queue with multiple vacations. The method used is called a modified supplementary variable technique and our result is an exact transform-free expression for the steady state queue length distribution. Utilizing this result, we propose a simple two-moment approximation for the queue length distribution. From this, approximations for the mean queue length and the probabilities of the number of customers in the system are also obtained. To evaluate the approximations, we conduct numerical experiments which show that our approximations are remarkably simple yet provide fairly good performance, especially for a Bernoulli arrival process.

• Industrial Engineering and Management Systems
• /
• v.12 no.3
• /
• pp.281-287
• /
• 2013

In this paper, we introduce a roots method that uses the roots inside the unit circle of the associated characteristics equation to evaluate the steady-state system-length distribution at three epochs (pre-arrival, arbitrary, and post-departure) and sojourn-time distribution in GI/PH/1 queueing model. It is very important for an air base to inspect airplane oil because low-quality oil leads to drop or breakdown of an airplane. Since airplane oil inspection is composed of several inspection steps, it sometimes causes train congestion and delay of inventory replenishments. We analyzed interarrival time and inspection (service) time of oil supply from the actual data which is given from one of the ROKAF's (Republic of Korea Air Force) bases. We found that interarrival time of oil follows a normal distribution with a small deviation, and the service time follows phase-type distribution, which was first introduced by Neuts to deal with the shortfalls of exponential distributions. Finally, we applied the GI/PH/1 queueing model to the oil train congestion problem and analyzed the distributions of the number of customers (oil trains) in the queue and their mean sojourn-time using the roots method suggested by Chaudhry for the model GI/C-MSP/1.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.1
• /
• pp.17-30
• /
• 1988

The aim of this project is to analyze the queueing model with the two types of customers which either can wait unrestrictedly or wait restrictively in the system depending on the condition of service facility unless they may be served immediately. This model consists of the three-dimensional state space and then quasi birth-death process is formulated. The steady-state probabilities and measures of performance of this system are derived by using Matrix Geometric method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1101-1103
• /
• 2006

For a broad class of discrete-time FIFO queueing systems with D-MAP (discrete-time Markovian arrival process) arrivals, we present a distributional Little's law that relates the distribution of the stationary number of customers in system (queue) with that of the stationary number of slots a customer spends in system (queue). Taking the multi-server D-MAP/D/c queue for example, we illustrate how to utilize this relation to get the desired distribution of the number of customers.

• Proceedings of the KSR Conference
• /
• 2005.05a
• /
• pp.915-921
• /
• 2005

Accurate and reliable tracking system is essential for the central train control system. There are two systems widely being used. one is the fixed block system which utilizes the track circuit for the detection of train position. the other is the moving block system which has the advantage over the former since it enables shorter radio signal for the train position detection. In this paper a new algorithm is proposed which uses signal's phase difference of arrival to detect the train position. Experimental verification of the algorithm is presented in the paper.

• IE interfaces
• /
• v.23 no.3
• /
• pp.239-245
• /
• 2010

This paper considers a localization problem of a moving tag on RFID(Radio Frequency Identification) systems, where a positioning engine collects TDOA(Time-difference of Arrival) signal from a target tag to estimate the position of the tag. To localize the tag in the RFID system, we develop two heuristic algorithms and evaluate their performance in the estimation error and computational time by using randomly generated numerical examples. Based upon the performance evaluation, we can conclude our algorithms are valuable for localization the moving target.