In digital soil mapping(DSM),a fundamental assumption is that the spatial variability of the target variable can be explained by the predictors or environmental covariates.Strategies to adequately sample the predictor...In digital soil mapping(DSM),a fundamental assumption is that the spatial variability of the target variable can be explained by the predictors or environmental covariates.Strategies to adequately sample the predictors have been well documented,with the conditioned Latin hypercube sampling(cLHS)algorithm receiving the most attention in the DSM community.Despite advances in sampling design,a critical gap remains in determining the number of samples required for DSM projects.We propose a simple workflow and function coded in R language to determine the minimum sample size for the cLHS algorithm based on histograms of the predictor variables using the Freedman-Diaconis rule for determining optimal bin width.Data preprocessing was included to correct for multimodal and non-normally distributed data,as these can affect sample size determination from the histogram.Based on a user-selected quantile range(QR)for the sample plan,the densities of the histogram bins at the upper and lower bounds of the QR were used as a scaling factor to determine minimum sample size.This technique was applied to a field-scale set of environmental covariates for a well-sampled agricultural study site near Guelph,Ontario,Canada,and tested across a range of QRs.The results showed increasing minimum sample size with an increase in the QR selected.Minimum sample size increased from 44 to 83 when the QR increased from 50% to 95% and then increased exponentially to 194 for the 99%QR.This technique provides an estimate of minimum sample size that can be used as an input to the cLHS algorithm.展开更多
After describing a general sampling discretization algorithm for multistage continuous stochastic programming problems, we prove the global convergence of the al- gorithm under suitable conditions. The convergence of ...After describing a general sampling discretization algorithm for multistage continuous stochastic programming problems, we prove the global convergence of the al- gorithm under suitable conditions. The convergence of most available algorithms as well as new algorithms can thus be derived or improved as a special case of this general result.展开更多
基金the Natural Science and Engineering Research Council(NSERC)of Canada,which supported and funded this project through an NSERC Postgraduate Scholarship—Doctoral(PGS-D)。
文摘In digital soil mapping(DSM),a fundamental assumption is that the spatial variability of the target variable can be explained by the predictors or environmental covariates.Strategies to adequately sample the predictors have been well documented,with the conditioned Latin hypercube sampling(cLHS)algorithm receiving the most attention in the DSM community.Despite advances in sampling design,a critical gap remains in determining the number of samples required for DSM projects.We propose a simple workflow and function coded in R language to determine the minimum sample size for the cLHS algorithm based on histograms of the predictor variables using the Freedman-Diaconis rule for determining optimal bin width.Data preprocessing was included to correct for multimodal and non-normally distributed data,as these can affect sample size determination from the histogram.Based on a user-selected quantile range(QR)for the sample plan,the densities of the histogram bins at the upper and lower bounds of the QR were used as a scaling factor to determine minimum sample size.This technique was applied to a field-scale set of environmental covariates for a well-sampled agricultural study site near Guelph,Ontario,Canada,and tested across a range of QRs.The results showed increasing minimum sample size with an increase in the QR selected.Minimum sample size increased from 44 to 83 when the QR increased from 50% to 95% and then increased exponentially to 194 for the 99%QR.This technique provides an estimate of minimum sample size that can be used as an input to the cLHS algorithm.
文摘After describing a general sampling discretization algorithm for multistage continuous stochastic programming problems, we prove the global convergence of the al- gorithm under suitable conditions. The convergence of most available algorithms as well as new algorithms can thus be derived or improved as a special case of this general result.
