JSM 2011 Online Program

The views expressed here are those of the individual authors and not necessarily those of the JSM sponsors, their officers, or their staff.

Activity Details


661 Thu, 8/4/2011, 10:30 AM - 12:20 PM CC-D241
Sampling and Sampling Distributions — Contributed Papers
Section on Statistical Computing , Section on Statistical Graphics
Chair(s): Peter Craigmile, The Ohio State University
10:35 AM On the Sample Size of the One-Stage and Two-Stage Sampling Procedures Under Heteroscedasticity Shun-Yi Chen, Tamkang University ; Ching-Feng Hsu, Tajen University
10:50 AM Bootstraps, Permutation Tests, and Sampling with and Without Replacement Orders of Magnitude Faster Using SASĀ® John Douglas Opdyke, DataMineIt
11:05 AM A Fully Adaptive Interacting Wang-Landau Algorithm for Automatic Density Exploration Luke Bornn, University of British Columbia
11:20 AM An Adaptive Particle Allocation Scheme for Offline Sequential Importance Sampling Algorithms Anindya Bhadra, Texas A & M University ; Edward L. Ionides, University of Michigan
11:35 AM Resampling with Perturbing the Original Data: A New Variant of the Smoothed Bootstrap Haiyan Bai, University of Central Florida ; Wei Pan, University of Cincinnati
11:50 AM Importance Sampling with Multiple Proposals: New Advances and Comparison Wentao Li, Rutgers University ; Zhiqiang Tan, Rutgers University ; Rong Chen, Rutgers University
12:05 PM Modeling Sampling Distributions of Similarity Measures Madhuri Mulekar, University of South Alabama ; Jyoti Champanerkar, William Paterson University



2011 JSM Online Program Home

For information, contact jsm@amstat.org or phone (888) 231-3473.

If you have questions about the Continuing Education program, please contact the Education Department.