• Title/Summary/Keyword: State probability

Search Result 1,043, Processing Time 0.025 seconds

Steady-state Probabilities under Non-additivity

  • Yoo, Keuk-Ryoul
    • Journal of the Korean Statistical Society
    • /
    • v.26 no.4
    • /
    • pp.555-564
    • /
    • 1997
  • Uncertainty, which arises when little information is revealed, can be represented by a non-additive probability, while risk is described by an additive one. This paper demonstrates that in the presence of uncertainty a steady state probability exists, which implies that we can estimate an average over a long period even under uncertainty. It is also shown that the steady state probability may not be unique in the presence of uncertainty. This implies that the estimated average under uncertainty is less accurate than under risk.

  • PDF

A Study of the Probability of Prediction to Crime according to Time Status Change (시간 상태 변화를 적용한 범죄 발생 예측에 관한 연구)

  • Park, Koo-Rack
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.5
    • /
    • pp.147-156
    • /
    • 2013
  • Each field of modern society, industrialization and the development of science and technology are rapidly changing. However, as a side effect of rapid social change has caused various problems. Crime of the side effects of rapid social change is a big problem. In this paper, a model for predicting crime and Markov chains applied to the crime, predictive modeling is proposed. Markov chain modeling of the existing one with the overall status of the case determined the probability of predicting the future, but this paper predict the events to increase the probability of occurrence probability of the prediction and the recent state of the entire state was divided by the probability of the prediction. And the whole state and the probability of the prediction and the recent state by applying the average of the prediction probability and the probability of the prediction model were implemented. Data was applied to the incidence of crime. As a result, the entire state applies only when the probability of the prediction than the entire state and the last state is calculated by dividing the probability value. And that means when applied to predict the probability, close to the crime was concluded that prediction.

A Study on the Alternative ARL Using Generalized Geometric Distribution (일반화 기하분포를 이용한 ARL의 수정에 관한 연구)

  • 문명상
    • Journal of Korean Society for Quality Management
    • /
    • v.27 no.4
    • /
    • pp.143-152
    • /
    • 1999
  • In Shewhart control chart, the average run length(ARL) is calculated using the mean of a conventional geometric distribution(CGD) assuming a sequence of identical and independent Bernoulli trials. In this, the success probability of CGB is the probability that any point exceeds the control limits. When the process is in-control state, there is no problem in the above assumption since the probability that any point exceeds the control limits does not change if the in-control state continues. However, if the out-of-control state begins and continues during the process, the probability of exceeding the control limits may take two forms. First, once the out-of-control state begins with exceeding probability p, it continues with the same exceeding probability p. Second, after the out-of-control state begins, the exceeding probabilities may very according to some pattern. In the first case, ARL is the mean of CGD with success probability p as usual. But in the second case, the assumption of a sequence of identical and independent Bernoulli trials is invalid and we can not use the mean of CGD as ARL. This paper concentrate on that point. By adopting one generalized binomial distribution(GBD) model that allows correlated Bernoulli trials, generalized geometric distribution(GGD) is defined and its mean is derived to find an alternative ARL when the process is in out-of-control state and the exceeding probabilities take the second form mentioned in the above. Small-scale simulation is performed to show how an alternative ARL works.

  • PDF

A Sequential Analysis of Mother-Infant Interaction (연속적 분석법을 통한 어머니와 유아의 상호작용 연구)

  • Choae, Jin Kyong
    • Korean Journal of Child Studies
    • /
    • v.6 no.1
    • /
    • pp.3-16
    • /
    • 1985
  • The purpose of this study was the application of sequential analysis to mother-infant interaction data, with particular reference to goodness of fit. The subjects of this study were 22 7- to 16-month-old infants(12 girls and 10 boys) and their mothers. Each mother-infant dyad was videotaped in a 5-min free-play session in the playroom. The videotaped data was transcribed on the behavioral checklist every 3 seconds. The recorded raw data were lagged by one time interval (3 sec.). Transitional probabilities from behavior at time t-1 to behavior at time t were gathered. The statistical analysis of frequency data and transitional probabilities consisted of Z test, t test, and sign test. It was found that regarding 1) direction of effect: the transitional probability of infant vocalization following maternal vocalization was significantly higher than the reverse; the transitional probability of a 'Coacting State' following a 'Mother Active State' was significantly higher than the reverse; the probability of a 'Mother Active State' following 'Quiescent State' was significantly higher than that of a 'Coacting State' following an 'Infant Active State'; 2) sex differences: male infants' transitional probability from an 'Infant Active State' to a 'Quiescent State' was significantly higher than that of female infants; 3) age differences: more than younger infants older infants had higher transitional probabilities from a 'Mother Active State' to a 'Coacting State', from a 'Parallel State' to a 'Coacting State', and from a 'Quiescent State' to a 'Parallel State'. These showed goodness of fit for sex and age differences, particularily for direction of effect.

  • 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

An efficient response surface method considering the nonlinear trend of the actual limit state

  • Zhao, Weitao;Qiu, Zhiping;Yang, Yi
    • Structural Engineering and Mechanics
    • /
    • v.47 no.1
    • /
    • pp.45-58
    • /
    • 2013
  • In structural reliability analysis, the response surface method is a powerful method to evaluate the probability of failure. However, the location of experimental points used to form a response surface function must be selected in a judicious way. It is necessary for the highly nonlinear limit state functions to consider the design point and the nonlinear trend of the limit state, because both of them influence the probability of failure. In this paper, in order to approximate the actual limit state more accurately, experimental points are selected close to the design point and the actual limit state, and consider the nonlinear trend of the limit state. Linear, quadratic and cubic polynomials without mixed terms are utilized to approximate the actual limit state. The direct Monte Carlo simulation on the approximated limit state is carried out to determine the probability of failure. Four examples are given to demonstrate the efficiency and the accuracy of the proposed method for both numerical and implicit limit states.

State-Dependent Call Admission Control in Hierarchical Wireless Multiservice Networks

  • Chung Shun-Ping;Lee Jin-Chang
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.28-37
    • /
    • 2006
  • State-dependent call admission control (SDCAC) is proposed to make efficient use of scarce wireless resource in a hierarchical wireless network with heterogeneous traffic. With SDCAC, new calls are accepted according to an acceptance probability taking account of not only cell dwell time but also call holding time and system state (i.e., occupied bandwidth). An analytical method is developed to calculate performance measures of interest, e.g., new call blocking probability, forced termination probability, over. all weighted blocking probability. Numerical results with not only stationary but nonstationary traffic loads are presented to show the robustness of SDCAC. It is shown that SDCAC performs much better than the other considered schemes under nonstationary traffic load.

A low power state assignment algorithm for asynchronous circuits using a state transistion probability (상태천이확률을 이용한 비동기회로의 저전력 상태할당 알고리즘)

  • 구경회;조경록
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.12
    • /
    • pp.1-8
    • /
    • 1997
  • In this paper, a new method of state code assignment for reduction of switching activities of state transition in asynchronous circuits is proposed. The algorithm is based on a on-hot code and modifies it to reduce switching activities. To estimate switching activities as a cost functions we introduce state transition probability (STP). AS a results, the proposed algorithm has an advantage of 60% over with the conventional code assignment in terms of switching and code length of state assignment.

  • PDF

A COMPARATIVE EVALUATION OF THE ESTIMATORS OF THE 2-PARAMETER GENERALIZED PARETO DISTRIBUTION

  • Singh, V.P.;Ahmad, M.;Sherif, M.M.
    • Water Engineering Research
    • /
    • v.4 no.3
    • /
    • pp.155-173
    • /
    • 2003
  • Parameters and quantiles of the 2-parameter generalized Pareto distribution were estimated using the methods of regular moments, modified moments, probability weighted moments, linear moments, maximum likelihood, and entropy for Monte Carlo-generated samples. The performance of these seven estimators was statistically compared, with the objective of identifying the most robust estimator. It was found that in general the methods of probability-weighted moments and L-moments performed better than the methods of maximum likelihood estimation, moments and entropy, especially for smaller values of the coefficient of variation and probability of exceedance.

  • PDF

Optimized Medium Access Probability for Networked Control Systems (네트워크 제어 시스템을 위한 최적화된 매체 접근 확률)

  • Park, Pangun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.10
    • /
    • pp.2457-2464
    • /
    • 2015
  • Distributed Networked Control Systems (NCSs) through wireless networks have a tremendous potential to improve the efficiency of various control systems. In this paper, we define the State Update Interval (SUI) as the elapsed time between successful state vector reports derived from the NCSs. A simple expression of the SUI is derived to characterize the key interactions between the control and communication layers. This performance measure is used to formulate a novel optimization problem where the objective function is the probability to meet the SUI constraint and the decision parameter is the channel access probability. We prove the existence and uniqueness of the optimal channel access probability of the optimization problem. Furthermore, the optimal channel access probability for NCSs is lower than the channel access probability to maximize the throughput. Numerical results indicate that the improvement of the success probability to meet the SUI constraint using the optimal channel access probability increases as the number of nodes increases with respect to that using the channel access probability to maximize the throughput.