• Title/Summary/Keyword: probability computation

Search Result 213, Processing Time 0.031 seconds

Fast computation of Observation Probability for Speaker-Independent Real-Time Speech Recognition (실시간 화자독립 음성인식을 위한 고속 확률계산)

  • Park Dong-Chul;Ahn Ju-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9C
    • /
    • pp.907-912
    • /
    • 2005
  • An efficient method for calculation of observation probability in CDHMM(Continous Density Hidden Markov Model) is proposed in this paper. the proposed algorithm, called FCOP(Fast Computation of Observation Probability), approximate obsewation probabilities in CDHMM by eliminating insignificant PDFs(Probability Density Functions) and reduces the computational load. When applied to a speech recognition system, the proposed FCOP algorithm can reduce the instruction cycles by $20\%-30\%$ and can also increase the recognition speed about $30\%$ while minimizing the loss in its recognition rate. When implemented on a practical cellular phone, the FCOP algorithm can increase its recognition speed about $30\%$ while suffering $0.2\%$ loss in recognition rate.

Development of Probability Computation Program for Standard Normal Distribution (표준정규분포의 확률계산 프로그램 개발)

  • 송서일
    • Journal of Korean Society for Quality Management
    • /
    • v.25 no.1
    • /
    • pp.182-192
    • /
    • 1997
  • The well-known standard normal distribution has been used within the limit of standard variable value of u=3.59. However, the probability values above the limit are not given in the literature. In this study, a probability computation program for standard normal distribution to u=5.99 with the proportional normal distribution a, pp.oximation suggested by Abramowitz and Stegun, Hastings is developed. The new standard normal distribution table developed by the program is presented and will be of help to estimate of probability values for testing and estimation of process mean value, lot acceptable probability, defective percentage of PPM unit of an out-of specification limit, process capability, test power of control charts, probability and statistics.

  • PDF

A computation method of reliability for preprocessing filters in the fire control system using Markov process and state transition probability matrix (Markov process 및 상태천이확률 행렬 계산을 통한 사격통제장치 전처리필터 신뢰성 산출 기법)

  • Kim, Jae-Hun;Lyou, Joon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.2 no.2
    • /
    • pp.131-139
    • /
    • 1999
  • An easy and efficient method is proposed for a computation of reliability of preprocessing filters in the fire control system when the sensor data are frequently unreliable depending on the operation environment. It computes state transition probability matrix after modeling filter states as a Markov process, and computing false alarm and detection probability of each filter state under the given sensor failure probability. It shows that two important indices such as distributed state probability and error variance can be derived easily for a reliability assessment of the given sensor fusion system.

  • PDF

Comparative Analysis on Imprecision Probability Under Several Imprecise Scheduling Schemes in Real Time Systems (실시간 시스템에서 여러 부정확한 스케쥴링 기법하에서의 부정확한 확률에 관한 비교 분석)

  • Ah, Gwl-Im;Koh, Kern
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.7
    • /
    • pp.1304-1320
    • /
    • 1994
  • There are two computation techniques in real time systems : precise and imprecise computation. The imprecise computation technique is a means to provide scheduling flexibility in real time systems. The studies on imprecise scheduling using queueing theoretical formulation up to data are to explicitly quantify the costs and benifits in trade-off between the average result quality and the average waiting time of tasks. This paper uses two imprecise scheduling schemes and solves the imprecision probability, the probability of any task being imprecise under two imprecise scheduling schemes and analyzes the dependence of the imprecision probability on several parameters os the monotone imprecise system.

  • PDF

On the Probability of the Estimate of Variance Components that is Negative in Unbalanced One-Way Random Model (불균형(不均衡) 일원(一元) 변량모형(變量模型)에서 추정방법(推定方法)에 따른 분산성분(分散成分)의 추정량(推定量)이 음(陰)이 될 확률(確率)의 계산(計算))

  • Song, Gyu-Moon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.4
    • /
    • pp.121-130
    • /
    • 1993
  • For the One-way random effects model with unbalanced data, the AOV and MINQUE estimates of variance components are frequently found to be negative. The primary objective of present study is placed on the computation of the probability of the main effect variance component, being negative. The probability of negative estimators from AOV and MINQUE can be obtained by theoretical computation under the normality assumption. It is, however, difficult to compute the probability of negative estimates for these estimators under arbitrary distributions, and hence their probabilities of being negative were computed by simulation experiment in this study. It was shown that there was no significant difference between the theoretical probability under normality and calculated probability by simulation experiment, and that probability of negative estimates decreases as sample size, number of levels and the value of increase.

  • PDF

An Algorithm For Approximating The Reliability of Network with Multistate Units (다중상태 유닛들의 망 신뢰도 근사 계산을 위한 알고리즘)

  • 오대호;염준근
    • Journal of Korean Society for Quality Management
    • /
    • v.30 no.1
    • /
    • pp.162-171
    • /
    • 2002
  • A practical algorithm of generating most probable states in decreasing order of probability, given the probability of each unit\`s state, is suggested for approximating reliability(performability) evaluation of a network with multistate(multimode) units. Method of approximating network reliability for a given measure with most probable states is illustrated with a numerical example. The proposed method in this paper is compared with the previous method regarding memory requirement. Our method has some advantages for computation and achieves improvement with regard to memory requirement for a certain condition judging from the computation experiment.

Teleportation into Quantum Statistics

  • Gill, Richard
    • Journal of the Korean Statistical Society
    • /
    • v.30 no.2
    • /
    • pp.291-325
    • /
    • 2001
  • The paper is a tutorial introduction to quantum information theory, developing the basic model and emphasizing the role of statistics and probability.

  • PDF

Computation of Blocking Probability in a Loss System

  • Na, Seong-Ryong
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2005.05a
    • /
    • pp.203-207
    • /
    • 2005
  • A loss system where two types of customers arrive in accordance with two independent Poisson processes is considered. An efficient recursive formula is developed for calculating the loss probability when the number of servers is large. Some practical examples regarding the performance evaluation of telecommunications networks are discussed.

  • PDF

A Study on the Computation of Overload Probability Based on Bridge Load Rating Factor (교량내하력 값에 기초한 초과하중 확률 계산에 관한 연구)

  • Yang, Seung-Ie;Kim, Jin-Sung
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.7 no.2
    • /
    • pp.125-134
    • /
    • 2003
  • In order to rate current bridge load carrying capacity, typically two methods are used. These are Allowable Stress Rating (ASR) and Load Factor Rating (LFR). Using the rating factors, there are many attempts to make a connection between rating factors and probability concept. The main purpose of the paper is computing the probability of overload using rating factors and probability concept. In this paper, the load rating methods are briefly explained, and the probability concept is connected to rating factors by using live load from Weigh-in-Motion (WIM). Based on the live load model and rati ng factor, the computation procedure of the probability of overload is explained.

A COMPUTATION METHOD IN PERFORMANCE EVALUATION IN CELLULAR COMMUNICATION NETWORK UNDER THE GENERAL DISTRIBUTION MODEL

  • Kim, Kyung-Sup
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.12 no.2
    • /
    • pp.119-131
    • /
    • 2008
  • The paper considers the computation method in the performance evaluation of cellular network in the phase-type distribution assumptions that the channel holding times induced from mobility are modeled by well-fitted distributions to reflect an actual situation. When ww consider a phase-type distribution model instead of exponential distribution, the complexity of the computation increase exponential even though the accuracy is improved. We consider an efficient numerical algorithm to compute the performance evaluations in cellular networks such as a handoff call dropping probability, new call blocking probability, and handoff arrival rate. Numerical experiment shows that numerical analysis results are well approximated to the results of simulation.

  • PDF