• Journal of the Korean Statistical Society
• /
• v.36 no.3
• /
• pp.349-355
• /
• 2007

In this paper we study some important properties of the bivariate generalized hypergeometric probability (BGHP) distribution by establishing the existence of all the moments of the distribution and by deriving recurrence relations for raw moments. It is shown that certain mixtures of BGHP distributions are again BGHP distributions and a limiting case of the distribution is considered.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.408-413
• /
• 2005

A new methodology for discrete non-Gaussian probability density estimation is investigated in this paper based on a dynamic Bayesian network (DBN) and kernel functions. The estimator consists of a DBN in which the transition distribution is represented with kernel functions. The estimator parameters are determined through a recursive learning algorithm according to the maximum likelihood (ML) scheme. A discrete-type Poisson distribution is generated in a simulation experiment to evaluate the proposed method. In addition, an unknown probability density generated by nonlinear transformation of a Poisson random variable is simulated. Computer simulations numerically demonstrate that the method successfully estimates the unknown probability distribution function (PDF).

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.2
• /
• pp.325-334
• /
• 2011

In this paper we consider the discrete time delayed renewal risk model. We investigate what will happen when the distribution function of the discounted proper deficit is asymptotic in the initial surplus. In doing this we establish several lemmas regarding some related ruin quantities in the discrete time delayed renewal risk model, which are of significance on their own right.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.17-24
• /
• 2007

Critical practicality problems are cause to search the presentation and contents according to user request and purpose in previous internet system. Recently, there are a lot of researches about dynamic adaptable ontology based system. We designed ontology based educational system which uses discrete probability and user profile. This system provided advanced usability of contents by ontology and dynamic adaptive model based on discrete probability distribution function and user profile in ontology educational systems. This models represents application domain to weighted direction graph of dynamic adaptive objects and modeling user actions using dynamically approach method structured on discrete probability function. Proposed probability analysis can use that presenting potential attribute to user actions that are tracing search actions of user in ontology structure. This approach methods can allocate dynamically appropriate profiles to user.

• Communications of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.765-800
• /
• 2022

Quantization for probability distributions concerns the best approximation of a d-dimensional probability distribution P by a discrete probability with a given number n of supporting points. In this paper, we have considered a probability measure generated by an infinite iterated function system associated with a probability vector on ℝ. For such a probability measure P, an induction formula to determine the optimal sets of n-means and the nth quantization error for every natural number n is given. In addition, using the induction formula we give some results and observations about the optimal sets of n-means for all n ≥ 2.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.4
• /
• pp.811-817
• /
• 2011

We shall introduce a general probability mass function which includes several discrete probability mass functions. Especially, when the random variable X is Poisson, binomial, and negative binomial random variables as some special cases of the introduced distribution, the maximum likelihood estimator (MLE) and the uniformly minimum variance unbiased estimator (UMVUE) of the probability P(X ${\leq}$ t) are considered. And the efficiencies of the MLE and the UMVUE of the reliability ar compared each other.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.921-928
• /
• 2004

This paper proposed dynamic adaptive model based on discrete probability distribution function and user profile in web based HyperMedia educational systems. This modelsrepresents application domain to weighted direction graph of dynamic adaptive objects andmodeling user actions using dynamically approach method structured on discrete probability function. Proposed probabilitic analysis can use that presenting potential attribute to useractions that are tracing search actions of user in WebMedia structure. This approach methodscan allocate dynamically appropriate profiles to user.

• Tunnel and Underground Space
• /
• v.11 no.2
• /
• pp.156-166
• /
• 2001

A stochastic continuum(SC) modeling technique was developed to simulate the groundwater flow pathway in fractured rocks. This model was developed to overcome the disadvantageous points of discrete fracture network(DFN) modes which has the limitation of fracture numbers. Besides, SC model is able to perform probabilistic analysis and to simulate the conductive groundwater pathway as discrete fracture network model. The SC model was formulated based on the discrete fracture network(DFN) model. The spatial distribution of permeability in the stochastic continuum model was defined by the probability distribution and variogram functions defined from the permeabilities of subdivided smaller blocks of the DFN model. The analysis of groundwater travel time was performed to show the consistency between DFN and SC models by the numerical experiment. It was found that the stochastic continuum modes was an appropriate way to provide the probability density distribution of groundwater velocity which is required for the probabilistic safety assessment of a radioactive waste disposal facility.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.453-460
• /
• 2006

A discrete-time priority queueing system with place reservation discipline is studied, in which two different types of packets arrive according to batch geometric streams. It is assumed that there is a reserved place in the queue. Whenever a high-priority packet enters the queue, it will seize the reserved place and make a new reservation at the end of the queue. Low-priority arrivals take place at the end of the queue in the usual way. Using the probability generating function method, the joint distribution of system state and the delay distribution for each type are obtained.

• 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.