• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.3
• /
• pp.371-374
• /
• 2009

In this paper, we introduce the concepts of effects and observable as generalizations of event and random variable, respectively. Also, we introduce the concept of $\sigma$-morphism and we investigate some results on $\sigma$-morphism as a probability measure on the set of effects.

• ETRI Journal
• /
• v.40 no.5
• /
• pp.624-633
• /
• 2018

Fair bandwidth allocation (FBA) has been studied in optical burst switching (OBS) networks, with the main idea being to map the max-min fairness in traditional IP networks to the fair-loss probability in OBS networks. This approach has proven to be fair in terms of the bandwidth allocation for differential connections, but the use of the ErlangB formula to calculate the theoretical loss probability has made this approach applicable only to Poisson flows. Furthermore, it is necessary to have a reasonable fairness measure to evaluate FBA models. This article proposes an approach involving throughput-based-FBA, called TFBA, and recommends a new fairness measure that is based on the ratio of the actual throughput to the allocated bandwidth. An analytical model for the performance of the output link with TFBA is also proposed.

• ETRI Journal
• /
• v.27 no.4
• /
• pp.461-464
• /
• 2005

Recently, a variety of confidence measures for utterance verification has been studied to improve speech recognition performance by rejecting out-of-vocabulary inputs. Most of the conventional confidence measures for utterance verification are based primarily on hypothesis testing or an approximated posterior probability, and their performances depend on the robustness of an alternative hypothesis or the prior probability. We introduce a novel confidence measure called a search confusion rate (SCR), which does not require an alternative hypothesis or the approximation of posterior probability. Our confusion-based approach shows better performance in additive noise-corrupted speech as well as in clean speech.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.297-302
• /
• 1995

In [1], Cramer introduced the first large deviation theorem at a probability symposium in 1938. Since 1938, there have been many developments in the large deviation theorems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.12
• /
• pp.1038-1042
• /
• 2012

In this paper, a new distance measure for biased PDFs is proposed and a related equalizer algorithm is also derived for supervised adaptive equalization for multipath channels with impulsive and time-varying DC bias noise. From the simulation results in the non-Gaussian noise environments, the proposed algorithm has proven not only robust to impulsive noise but also to have the capability of cancelling time-varying DC bias noise effectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.931-936
• /
• 2004

GBFCM(DM), Gradient-based Fuzzy c-means with Divergence Measure, for efficient clustering of GPDF(Gaussian Probability Density Function) in MPEG VBR video data modeling is proposed in this paper. The proposed GBFCM(DM) is based on GBFCM( Gradient-based Fuzzy c-means) with the Divergence for its distance measure. In this paper, sets of real-time MPEG VBR Video traffic data are considered. Each of 12 frames MPEG VBR Video data are first transformed to 12-dimensional data for modeling and the transformed 12-dimensional data are Pass through the proposed GBFCM(DM) for classification. The GBFCM(DM) is compared with conventional FCM and GBFCM algorithms. The results show that the GBFCM(DM) gives 5∼15% improvement in False Alarm Rate over conventional algorithms such as FCM and GBFCM.

• International Journal of Contents
• /
• v.11 no.2
• /
• pp.57-62
• /
• 2015

Relative entropy is a divergence measure between two probability density functions of a random variable. Assuming that the random variable has only two alphabets, the relative entropy becomes a cross-entropy error function that can accelerate training convergence of multi-layer perceptron neural networks. Also, the n-th order extension of cross-entropy (nCE) error function exhibits an improved performance in viewpoints of learning convergence and generalization capability. In this paper, we derive a new divergence measure between two probability density functions from the nCE error function. And the new divergence measure is compared with the relative entropy through the use of three-dimensional plots.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.1
• /
• pp.5-26
• /
• 2013

Since the optimized use of sonar systems for target tracking is a practical problem for naval operations, the measure of mission achievability is needed for preparing efficient sonar-maneuver tactic. In order to quantify the mission achievability or Measure Of Effectiveness(MOE) for given sonar-maneuver tactics, we developed and tested a simulation algorithm. The proposed algorithm for tracking is based on Measure Of Performance(MOP) for localization and tracking system of sonar against target. Probability of Detection(PD) using steering beam patterns referenced to the aspect angle of sonar is presented to consider the tracking-performance of sonar. Also, the integrated software package, named as Optimal Acoustic Search Path Planning(OASPP) is used for generating sonar-maneuver patterns and vulnerability analysis for a given scenario. Through simulation of a simple case for which the intuitive solution is known, the proposed algorithm is verified.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.7
• /
• pp.383-389
• /
• 2011

In this paper, we propose a improved speech absence probability estimation algorithm by applying environmental noise classification for speech enhancement. The previous speech absence probability required to seek a priori probability of speech absence was derived by applying microphone input signal and the noise signal based on the estimated value of a posteriori SNR threshold. In this paper, the proposed algorithm estimates the speech absence probability using noise classification algorithm which is based on Gaussian mixture model in order to apply the optimal parameter each noise types, unlike the conventional fixed threshold and smoothing parameter. Performance of the proposed enhancement algorithm is evaluated by ITU-T P.862 PESQ (perceptual evaluation of speech quality) and composite measure under various noise environments. It is verified that the proposed algorithm yields better results compared to the conventional speech absence probability estimation algorithm.

• Journal of the Korean Statistical Society
• /
• v.32 no.4
• /
• pp.411-423
• /
• 2003

In this paper we develop a method for calculating a probability that a particular generalized variance is the smallest of all the K multivariate normal generalized variances. The method gives a way of comparing K multivariate populations in terms of their dispersion or spread, because the generalized variance is a scalar measure of the overall multivariate scatter. Fully parametric frequentist approach for the probability is intractable and thus a Bayesian method is pursued using a variant of weighted Monte Carlo (WMC) sampling based approach. Necessary theory involved in the method and computation is provided.