• 제목/요약/키워드: sampling simulation

검색결과 935건 처리시간 0.027초

종속적 비평형 다중표본 계획법의 연구 (A Study of Dependent Nonstationary Multiple Sampling Plans)

  • 김원경
    • 한국시뮬레이션학회논문지
    • /
    • 제9권2호
    • /
    • pp.75-87
    • /
    • 2000
  • In this paper, nonstationary multiple sampling plans are discussed which are difficult to solve by analytical method when there exists dependency between the sample data. The initial solution is found by the sequential sampling plan using the sequential probability ration test. The number of acceptance and rejection in each step of the multiple sampling plan are found by grouping the sequential sampling plan's solution initially. The optimal multiple sampling plans are found by simulation. Four search methods are developed U and the optimum sampling plans satisfying the Type I and Type ll error probabilities. The performance of the sampling plans is measured and their algorithms are also shown. To consider the nonstationary property of the dependent sampling plan, simulation method is used for finding the lot rejection and acceptance probability function. As a numerical example Markov chain model is inspected. Effects of the dependency factor and search methods are compared to analyze the sampling results by changing their parameters.

  • PDF

Probability Sampling Method for a Hidden Population Using Respondent-Driven Sampling: Simulation for Cancer Survivors

  • Jung, Minsoo
    • Asian Pacific Journal of Cancer Prevention
    • /
    • 제16권11호
    • /
    • pp.4677-4683
    • /
    • 2015
  • When there is no sampling frame within a certain group or the group is concerned that making its population public would bring social stigma, we say the population is hidden. It is difficult to approach this kind of population survey-methodologically because the response rate is low and its members are not quite honest with their responses when probability sampling is used. The only alternative known to address the problems caused by previous methods such as snowball sampling is respondent-driven sampling (RDS), which was developed by Heckathorn and his colleagues. RDS is based on a Markov chain, and uses the social network information of the respondent. This characteristic allows for probability sampling when we survey a hidden population. We verified through computer simulation whether RDS can be used on a hidden population of cancer survivors. According to the simulation results of this thesis, the chain-referral sampling of RDS tends to minimize as the sample gets bigger, and it becomes stabilized as the wave progresses. Therefore, it shows that the final sample information can be completely independent from the initial seeds if a certain level of sample size is secured even if the initial seeds were selected through convenient sampling. Thus, RDS can be considered as an alternative which can improve upon both key informant sampling and ethnographic surveys, and it needs to be utilized for various cases domestically as well.

속산 시뮬레이션을 위한 적응형 비모수 중요 샘플링 기법 (Non-parametric Adaptive Importance Sampling for Fast Simulation Technique)

  • 김윤배
    • 한국시뮬레이션학회논문지
    • /
    • 제8권3호
    • /
    • pp.77-89
    • /
    • 1999
  • Simulating rare events, such as probability of cell loss in ATM networks, machine failure in highly reliable systems, requires huge simulation efforts due to the low chance of occurrence. Importance Sampling (IS) has been applied to accelerate the occurrence of rare events. However, it has a drawback of effective biasing scheme to make the estimator of IS unbiased. Adaptive Importance Sampling (AIS) employs an estimated sampling distribution of IS to the system of interest during the course of simulation. We propose Nonparametric Adaptive Importance Sampling (NAIS) technique which is nonparametrical version of AIS. We test NAIS to estimate a probability of rare event in M/M/1 queueing model. Comparing with classical Monte Carlo simulation, the computational efficiency and variance reductions gained via NAIS are substantial. A possible extension of NAIS regarding with random number generation is also discussed.

  • PDF

통계적 추론에서의 표집분포 개념 지도를 위한 시뮬레이션 소프트웨어 설계 및 구현 (The Design and Implementation to Teach Sampling Distributions with the Statistical Inferences)

  • 이영하;이은호
    • 대한수학교육학회지:학교수학
    • /
    • 제12권3호
    • /
    • pp.273-299
    • /
    • 2010
  • 본 논문의 목적은 고등학교 수준의 학생들이 표집분포의 개념을 학습할 수 있도록 '표집분포 시뮬레이션 (Sampling Distributions Simulation)'을 설계하고 구현하는 것이다. '표집분포 시뮬레이션'은 다음과 같이 4차시로 구성되어 있다. 1차시-신뢰도와 신뢰구간의 의미 학습하기 2차시-표집분포의 의미 학습하기 3차시-중심극한정리의 의미 학습하기 4차시-이항분포의 정규근사 학습하기 본 연구를 통하여 표집분포의 중요성에 대한 학생들이 인식이 달라지고 이해가 증진되기를 기대한다. 또 본 연구의 결과로 제공되는 프로그램 '표집분포의 시뮬레이션' 수업을 통해 통계적 추론 능력이 향상되고, 아울러 통계적 추론 속에서 표집 분포의 역할이 충분히 이해되기를 기대한다.

  • PDF

Structural reliability estimation based on quasi ideal importance sampling simulation

  • Yonezawa, Masaaki;Okuda, Shoya;Kobayashi, Hiroaki
    • Structural Engineering and Mechanics
    • /
    • 제32권1호
    • /
    • pp.55-69
    • /
    • 2009
  • A quasi ideal importance sampling simulation method combined in the conditional expectation is proposed for the structural reliability estimation. The quasi ideal importance sampling joint probability density function (p.d.f.) is so composed on the basis of the ideal importance sampling concept as to be proportional to the conditional failure probability multiplied by the p.d.f. of the sampling variables. The respective marginal p.d.f.s of the ideal importance sampling joint p.d.f. are determined numerically by the simulations and partly by the piecewise integrations. The quasi ideal importance sampling simulations combined in the conditional expectation are executed to estimate the failure probabilities of structures with multiple failure surfaces and it is shown that the proposed method gives accurate estimations efficiently.

Reliability Analysis for Structure Design of Automatic Ocean Salt Collector Using Sampling Method of Monte Carlo Simulation

  • Song, Chang Yong
    • 한국해양공학회지
    • /
    • 제34권5호
    • /
    • pp.316-324
    • /
    • 2020
  • This paper presents comparative studies of reliability analysis and meta-modeling using the sampling method of Monte Carlo simulation for the structure design of an automatic ocean salt collector (AOSC). The thickness sizing variables of structure members are considered as random variables. Probabilistic performance functions are selected from strength performances evaluated via the finite element analysis of an AOSC. The sampling methods used in the comparative studies are simple random sampling and Sobol sequences with varied numbers of sampling. Approximation methods such as the Kriging model is applied to the meta-model generation. Reliability performances such as the probability failure and distribution are compared based on the variation of the sampling method of Monte Carlo simulation. The meta-modeling accuracy is evaluated for the Kriging model generated from the Monte Carlo simulation and Sobol sequence results. It is discovered that the Sobol sequence method is applicable to not only to the reliability analysis for the structural design of marine equipment such as the AOSC, but also to Kriging meta-modeling owing to its high numerical efficiency.

속산 시뮬레이션에 의한 ATM 텔레트래픽 연구

  • 국광호;이창호;오창환;강성렬
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
    • /
    • pp.553-556
    • /
    • 1996
  • The cell loss probability recommended in the B-ISDN is in the range of 10$^{-8}$ ~ 10$^{-12}$ . When a simulation technique is used to analyze the performance of the ATM switching system, an enormous amount of computer time is required. In this study, we derive an importance sampling simulation technique that can be used to evaluate the loss probability obtained by the importance sampling simulation is very close to that obtained by the ordinary simulation and the computer time can be reduced drastically by the importance sampling simulation.

  • PDF

MMAP 이산시간 큐잉 시스템의 속산 시뮬레이션 (An Efficient Simulation of Discrete Time Queueing Systems with Markov-modulated Arrival Processes)

  • 국광호;강성열
    • 한국시뮬레이션학회논문지
    • /
    • 제13권3호
    • /
    • pp.1-10
    • /
    • 2004
  • The cell loss probability required in the ATM network is in the range of 10$^{-9}$ ∼10$^{-12}$ . If Monte Carlo simulation is used to analyze the performance of the ATM node, an enormous amount of computer time is required. To obtain large speed-up factors, importance sampling may be used. Since the Markov-modulated processes have been used to model various high-speed network traffic sources, we consider discrete time single server queueing systems with Markov-modulated arrival processes which can be used to model an ATM node. We apply importance sampling based on the Large Deviation Theory for the performance evaluation of, MMBP/D/1/K, ∑MMBP/D/1/K, and two stage tandem queueing networks with Markov-modulated arrival processes and deterministic service times. The simulation results show that the buffer overflow probabilities obtained by the importance sampling are very close to those obtained by the Monte Carlo simulation and the computer time can be reduced drastically.

  • PDF

A New Fast Simulation Technique for Rare Event Simulation

  • Kim, Yun-Bae;Roh, Deok-Seon;Lee, Myeong-Yong
    • 한국시뮬레이션학회:학술대회논문집
    • /
    • 한국시뮬레이션학회 1999년도 춘계학술대회 논문집
    • /
    • pp.70-79
    • /
    • 1999
  • Importance Sampling (IS) has been applied to accelerate the occurrence of rare events. However, it has a drawback of effective biasing scheme to make the estimator from IS unbiased. Adaptive Importance Sampling (AIS) employs an estimated sampling distribution of IS to the systems of interest during the course of simulation. We propose Nonparametric Adaptive Importance Sampling (NAIS) technique which is nonparametrically modified version of AIS and test it to estimate a probability of rare event in M/M/1 queueing model. Comparing with classical Monte Carlo simulation, the computational efficiency and variance reductions gained via NAIS are substantial. A possible extension of NAIS regarding with random number generation is also discussed.

  • PDF

An importance sampling for a function of a multivariate random variable

  • Jae-Yeol Park;Hee-Geon Kang;Sunggon Kim
    • Communications for Statistical Applications and Methods
    • /
    • 제31권1호
    • /
    • pp.65-85
    • /
    • 2024
  • The tail probability of a function of a multivariate random variable is not easy to estimate by the crude Monte Carlo simulation. When the occurrence of the function value over a threshold is rare, the accurate estimation of the corresponding probability requires a huge number of samples. When the explicit form of the cumulative distribution function of each component of the variable is known, the inverse transform likelihood ratio method is directly applicable scheme to estimate the tail probability efficiently. The method is a type of the importance sampling and its efficiency depends on the selection of the importance sampling distribution. When the cumulative distribution of the multivariate random variable is represented by a copula and its marginal distributions, we develop an iterative algorithm to find the optimal importance sampling distribution, and show the convergence of the algorithm. The performance of the proposed scheme is compared with the crude Monte Carlo simulation numerically.