• Journal of the Korean Mathematical Society
• /
• v.42 no.3
• /
• pp.517-527
• /
• 2005

This paper considers a discrete-time queueing system with variable service capacity. Using the supplementary variable method and the generating function technique, we compute the joint probability distribution of queue length and remaining service time at an arbitrary slot boundary, and also compute the distribution of the queue length at a departure time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.91-105
• /
• 2019

Discrete-time Queueing models are frequently utilized to analyze the performance of computing and communication systems. The length of busy period is one of important performance measures for such systems. In this paper, we consider the busy period of the Geo/Geo/1/K queue with a single vacation. We derive the moments of the length of the busy (idle) period, the number of customers who arrive and enter the system during the busy (idle) period and the number of customers who arrive but are lost due to no vacancies in the system for both early arrival system (EAS) and late arrival system (LAS). In order to do this, recursive equations for the joint probability generating function of the busy period of the Geo/Geo/1/K queue starting with n, 1 ≤ n ≤ K, customers, the number of customers who arrive and enter the system, and arrive but are lost during that busy period are constructed. Using the result of the busy period analysis, we also numerically study differences of various performance measures between EAS and LAS. This numerical study shows that the performance gap between EAS and LAS increases as the system capacity K decrease, and the arrival rate (probability) approaches the service rate (probability). This performance gap also decreases as the vacation rate (probability) decrease, but it does not shrink to zero.

• Convergence Security Journal
• /
• v.22 no.5
• /
• pp.95-105
• /
• 2022

The Army, Navy, and Air Force are making various efforts to develop a weapon system that incorporates the 4th industrial revolution technology so that it can be used in multi-domain operations. In order to effectively demonstrate the integrated combat power through the weapon system to which the new technology is applied, it is necessary to establish a network environment in which each weapon system can transmit and receive information smoothly. For this, it is essential to analyze the Information Exchange Requirement(IER) of each weapon system, but many IER analysis studies did not sufficiently reflect the various considerations of the actual tactical network. Therefore, this study closely analyzes the research methods and results of the existing information exchange requirements analysis studies. In IER analysis, the size of the message itself, the size of the network protocol header, the transmission/reception structure of the tactical network, the information distribution process, and the message occurrence frequency. In order to be able to use it for future IER prediction, we present a technique for calculating the information exchange requirement as a probability distribution using the Poisson distribution and the probability generating function. In order to prove the validity of this technique, the results of the probability distribution calculation using the message list and network topology samples are compared with the simulation results using Network Simulator 2.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.47 no.7
• /
• pp.13-22
• /
• 2005

Main purpose of this article is to classify reservoirs corresponding to their physical characteristics, for example, dam height, dam width, age, repair-works history. First of all, data set of 13,976 reservoirs was analyzed using k means and self organized maps. As a result of these analysis, lots of reservoirs have been classified into four clusters. Factors and their critical values to classify the reservoirs into four groups have been founded by generating a decision tree. The path rules to each group seem reasonable since their survivor function showed unique pattern.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.3
• /
• pp.179-186
• /
• 1993

We derive the arbitrary time point system size distribution of M/ $G^{B}$1 queue in which late arrivals are not allowed to join the on-going service. The distribution is given by P(z) = $P_{4}$(z) $S^{*}$ (.lambda.-.lambda.z) where $P_{4}$ (z) is the probability generating function of the queue size and $S^{*}$(.theta.) is the Laplace-Stieltjes transform of the service time distribution function. We also derive the distribution of the service siez at arbitrary point of time. time.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.4
• /
• pp.341-348
• /
• 1990

This paper describes an algorithm for evaluating the Loss of Load Probability (LOLP) and calculating the production cost for all the generators in the system using Fast Hartley Transform (FHT). It also suggests the deconvolution procedure which is necessary for the generation expansion planning. The FHT is as fast as or faster than the Fast Fourier Transform (FFT) and serves for all the uses such as spectral, digital processing, and convolution to which the FFT is normally applied. The transformed function using FFT has complex numbers. However, the transformed function using FHT has real numbers and the convolution become quite simple. This method has been applied for the IEEE reliability test system and practical size model system. The test results show the effectiveness of the proposed method.

• Nuclear Engineering and Technology
• /
• v.39 no.6
• /
• pp.717-724
• /
• 2007

A measurement-based time-domain noise simulation of radiation detector-preamplifier (front-end) noise in nuclear spectroscopy is described. The time-domain noise simulation was performed by generating "noise random numbers" using Monte Carlo's inverse method. The probability of unpredictable noise was derived from the empirical cumulative distribution function via the sampled noise, which was measured from a preamplifier output. Results of the simulated noise were investigated as functions of time, frequency, and statistical domains. Noise behavior was evaluated using the signal wave-shaping function, and was compared with the actual noise. Similarities between the response characteristics of the simulated and the actual preamplifier output noises were found. The simulated noise and the computed nuclear pulse signal were also combined to generate a simulated preamplifier output signal. Such simulated output signals could be used in nuclear spectroscopy to determine energy resolution degradation from front-end noise effect.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.1
• /
• pp.1-10
• /
• 2014

In this paper, we study approximations of the ruin probability in a continuous time surplus process. First, we introduce the well-known approximation formulas of the ruin probability such as Cram$\acute{e}$r, Tijms' and De Vylder's methods. We, then, suggest new approximation formulas of two types, which improve the existing approximation formulas. One is Cram$\acute{e}$r and Tijms' type which makes use of the moment generating function of distribution of a claim size and the other is De Vylder's type which makes use of the surplus process with exponential claims. Finally, we compare, by illustrating numerical examples, the newly suggested approximation formulas with the existing approximation formulas of the ruin probability.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.7
• /
• pp.537-546
• /
• 2020

The reliability used as a performance indicator during the development of space launch vehicle should be validated by the launch success probability, and the launch data need to be fed back for reliability management. In this paper, the launch data of space launch vehicles around the world were investigated and statistically analyzed for the success probabilities according to the launch vehicle models and maturity. The Bayesian estimation of launch success probability was reviewed and analyzed by comparing the estimated success probabilities using several prior distributions and the statistical success probability. We presented the method of generating prior distribution function and considerations for Bayesian estimation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.6
• /
• pp.111-123
• /
• 2004

A hash function is a function that takes bit strings of arbitrary length to bit string of fixed length. A cellular automata is a finite state machine and has the property of generating pseudorandom numbers efficiently by combinational logics of neighbour cells. In [1] and [7], hash functions based on cellular automata which can be implemented efficiently in hardware were proposed. In this paper, we show that we can find collisions of these hash functions with probability 0.46875 and 0.5 respectively.