• The Korean Journal of Applied Statistics
• /
• v.20 no.2
• /
• pp.333-343
• /
• 2007

The auxiliary renewal function has an important role in analyzng queues in which the either of the inter-arrival time and the service time of customers is not exponential. As like the renewal function, the auxiliary renewal function is hard to compute although it can be defined theoretically. In this paper, we suggest two approximations for auxiliary renewal function and compare the two with the true value of auxiliary renewal function which can be computed in some special cases.

• The Korean Journal of Applied Statistics
• /
• v.7 no.2
• /
• pp.21-34
• /
• 1994

In this paper we consider the M/M/1 Queue with mean inter arrival time $\theta$. We derive a sample path estimator for the derivative of steady state mean system time with respect to $\theta$. We also show that the derived sample path estimate can be expressed as a sum of the IPA estimate and the other effect. We have a similar result for the derivative of limiting probability $P_k$ with respect to $\theta$.

• Journal of the Institute of Convergence Signal Processing
• /
• v.16 no.2
• /
• pp.40-43
• /
• 2015

In this paper, the effects of the leading and the following sounds with single frequency on sound localization are investigated. The sounds with different levels and ISIs(Inter Stimuli Intervals) were used. The width of test sound is 2ms, and those of the leading and the following sounds are 10ms. 1 kHz of the test sound is utilized. The arrival time difference in the subject's ears is set to be 0.5ms. The four kinds of level differences used for one ISI are 0, -10, -15, and -20dB interval. The leading sound is found to have more effect on sound localization than the following sound is. The effect of the leading sound is also found to be dependent on the value of ISI. When the value of the ISI is small, different effects affecting the sound localization are observed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.4
• /
• pp.111-122
• /
• 1999

In this paper, we consider a queueing network model. where the population constraint within each subnetwork is controlled by a semaphore queue. The total number of customers that may be present in the subnetwork can not exceed a given value. Each node has a constant service time and the arrival process to the queueing network is an arbitrary distribution. A major characteristics of this model is that the lower layer flow is halted by the state of higher layer. We present some properties that the inter-change of nodes does not make any difference to customer's waiting time in the queueing network under a certain condition. The queueing network can be transformed into a simplified queueing network. A dramatic simplification of the queueing network is shown. It is interesting to see how the simplification developed for sliding window flow control, can be applied to multi-layered queueing network.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.64
• /
• pp.63-76
• /
• 2001

This paper presents a job-shop type flexible manufacturing system(FMS) scheduling problem and examines the effects of scheduling rules on the performance of FMS. Several machine and AGV scheduling rules are tested against the mean flow-time criterion. In this paper, I compare the rules under various experimental conditions by using an FMS simulation model. One of the objectives of this study is to discuss how the simulation-based scheduling problem can be operated. The other is to measure sensitivity of the rules to changes at inter arrival time, queue capacity, breakdown rates for machines and AGV, and AGV speed. Therefore, the results of simulation experiments were considered on FMS design and operating stages. A comprehensive bibliograph? is also presented in the paper.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.2
• /
• pp.91-100
• /
• 2015

In this study, we propose an efficient two-phase heuristic policy, called an acceptance tolerance control policy, for Infrastructure as a Service (IaaS) cloud services that considers both the service provider and customer in terms of profit and satisfaction, respectively. Each time an IaaS cloud service is requested, this policy determines whether the service is accepted or rejected by calculating the potential for realizing the two performance objectives. Moreover, it uses acceptance tolerance to identify the possibility for error with the chosen decision while compensating for both future fluctuations in customer demand and error possibilities based on past decisions. We conducted a numerical experiment to verify the performance of the proposed policy using several actual IaaS cloud service specifications and comparing it with other heuristics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.334-348
• /
• 2015

Widespread use of smart devices accompanies increase of use of access point (AP), which enables the connection to the wireless network. If the appropriate security is not served when a user tries to connect the wireless network through an AP, various security problems can arise due to the rogue APs. In this paper, we are going to examine the threat by evil-twin, which is a kind of rogue APs. Most of recent researches for detecting rogue APs utilize the measured time difference, such as round trip time (RTT), between the evil-twin and authorized APs. These methods, however, suffer from the low detection rate in the network congestion. Due to these reasons, in this paper, we suggest a new factor, packet inter-arrival time (PIAT), in order to detect evil-twins. By using both RTT and PIAT as the learning factors for the support vector machine (SVM), we determine the non-linear metric to classify evil-twins and authorized APs. As a result, we can detect evil-twins with the probability of up to 96.5% and at least 89.75% even when the network is congested.

• Journal of Korea Water Resources Association
• /
• v.49 no.6
• /
• pp.565-577
• /
• 2016

The objective of this study is to propose a method for computing the Natural Drought Index (NDI) that does not consider man-made drought facilities. Principal Component Analysis (PCA) was used to estimate the NDI. Three monthly moving cumulative runoff, soil moisture and precipitation were selected as input data of the NDI during 1977~2012. Observed precipitation data was collected from KMA ASOS (Korea Meteorological Association Automatic Synoptic Observation System), while model-driven runoff and soil moisture from Variable Infiltration Capacity Model (VIC Model) were used. Time series analysis, drought characteristic analysis and spatial analysis were used to assess the utilization of NDI and compare with existing SPI, SRI and SSI. The NDI precisely reflected onset and termination of past drought events with mean absolute error of 0.85 in time series analysis. It explained well duration and inter-arrival time with 1.3 and 1.0 respectively in drought characteristic analysis. Also, the NDI reflected regional drought condition well in spatial analysis. The accuracy rank of drought onset, termination, duration and inter-arrival time was calculated by using NDI, SPI, SRI and SSI. The result showed that NDI is more precise than the others. The NDI overcomes the limitation of univariate drought indices and can be useful for drought analysis as representative measure of different types of drought such as meteorological, hydrological and agricultural droughts.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.81-85
• /
• 2009

본 논문은 VoIP, IPTV, VoD 등의 실시간 서비스 품질을 네트워크 노드에서 모니터링함으로써네트워크에서 발생한 품질이상을 분석할 수 있는 스위치 칩을 설계하였다. 인터넷 서비스의 특성상 단대단 서비스에 기반한 실시간서비스는 품질이상이 발생한 위치를 정확하게 분석할 수 없기 때문에 유지보수에 어려움이 있다. 이러한 문제를 해결하기 위해 본 논문에서는 실시간서비스에 해당하는 플로우를 등록하고 해당 플로우가 장치내에서 발생한 패킷손실, RTP 시퀀스 넘버를 참조하여 이전 장치에서의 패킷손실, 패킷의 IAT(Inter Arrival Time), 대역폭, 그리고 장치내 지연을 실시간으로 측정할 수 있는 기능을 가진 AVB(Audio/Video Bridge)칩을 구현하기 위해 IEEE802.1AS를 기만한 시간동기 프로토콜의 정확성을 시뮬레이션하고, FPGA를 이용하여 구현한 AVB 스위치칩에서 타임스템프의 정확성을 확인함으로써 실시간서비스의 품질을 네트워크에서 실시간으로 모니터링 할 수 있는 가능성을 확인하였다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.117-129
• /
• 2005

This paper considers a make-to-order inventory-production system in which customer orders are admitted only when the number of outstanding customer orders is below a value committed by the system. We deal with general distributions for the customer order Inter-arrival, production, and replenishment lead time processes. Monotonicities of the optimal average cost with respect to these distribution parameters are established using sample path coupling arguments. When distributions are given as an exponential one, we implement a sensitivity analysis on the optimal inventory policy and show that it has monotonicities with respect to system costs using dynamic programming.