背越式跳高运动员训练过程中恐惧心理的产生原因与克服方法

从跳高运动员的主观状态、客观因素、教练员的焦虑问题三个方面对背越式跳高训练过程中运动员恐惧心理的产生原因进行了分析,并提出了相应的克服方法和建议,为背越式跳高理论和训练提供参考。     

Identifying the most successful dose (MSD) in dose-finding studies in cancer

For a dose finding study in cancer, the most successful dose (MSD), among a group of available doses, is that dose at which the overall success rate is the highest. This rate is the product of the rate of seeing non-toxicities together with the rate of tumor response. A successful dose finding trial in this context is one where we manage to identify the MSD in an efficient manner. In practice we may also need to consider algorithms for identifying the MSD which can incorporate certain restrictions, the most common restriction maintaining the estimated toxicity rate alone below some maximum rate. In this case the MSD may correspond to a different level than that for the unconstrained MSD and, in providing a final recommendation, it is important to underline that it is subject to the given constraint. We work with the approach described in O'Quigley et al. [Biometrics 2001; 57(4):1018-1029]. The focus of that work was dose finding in HIV where both information on toxicity and efficacy were almost immediately available. Recent cancer studies are beginning to fall under this same heading where, as before, toxicity can be quickly evaluated and, in addition, we can rely on biological markers or other measures of tumor response. Mindful of the particular context of cancer, our purpose here is to consider the methodology developed by O'Quigley et al. and its practical implementation. We also carry out a study on the doubly under-parameterized model, developed by O'Quigley et al. but not     

A Markov Chain Monte Carlo version of the genetic algorithm Differential Evolution: easy Bayesian computing for real parameter spaces

Differential Evolution (DE) is a simple genetic algorithm for numerical optimization in real parameter spaces. In a statistical context one would not just want the optimum but also its uncertainty. The uncertainty distribution can be obtained by a Bayesian analysis (after specifying prior and likelihood) using Markov Chain Monte Carlo (MCMC) simulation. This paper integrates the essential ideas of DE and MCMC, resulting in Differential Evolution Markov Chain (DE-MC). DE-MC is a population MCMC algorithm, in which multiple chains are run in parallel. DE-MC solves an important problem in MCMC, namely that of choosing an appropriate scale and orientation for the jumping distribution. In DE-MC the jumps are simply a fixed multiple of the differences of two random parameter vectors that are currently in the population. The selection process of DE-MC works via the usual Metropolis ratio which defines the probability with which a proposal is accepted. In tests with known uncertainty distributions, the efficiency of DE-MC with respect to random walk Metropolis with optimal multivariate Normal jumps ranged from 68% for small population sizes to 100% for large population sizes and even to 500% for the 97.5% point of a variable from a 50-dimensional Student distribution. Two Bayesian examples illustrate the potential of DE-MC in practice. DE-MC is shown to facilitate multidimensional updates in a multi-chain “Metropolis-within-Gibbs” sampling approach. The advantage of DE-MC over conventional MCMC are simplicity, speed of calculation and convergence, even for nearly collinear parameters and multimodal densities.     

A Multiple Imputation Approach to Linear Regression with Clustered Censored Data

Weextend Wei and Tanner's (1991) multiple imputation approach insemi-parametric linear regression for univariate censored datato clustered censored data. The main idea is to iterate the followingtwo steps: 1) using the data augmentation to impute for censoredfailure times; 2) fitting a linear model with imputed completedata, which takes into consideration of clustering among failuretimes. In particular, we propose using the generalized estimatingequations (GEE) or a linear mixed-effects model to implementthe second step. Through simulation studies our proposal comparesfavorably to the independence approach (Lee et al., 1993), whichignores the within-cluster correlation in estimating the regressioncoefficient. Our proposal is easy to implement by using existingsoftwares.     

Cutting Experimental Designs into Blocks

Most experimental material in agriculture and industry is heterogeneous in nature and therefore its statistical analysis benefits from blocking. Many experiments are restricted in time or space, and again blocking is useful. This paper adopts the idea of orthogonal blocking of Box & Hunter (1957) and applies it to optimal blocking designs. This approach is then compared with the determinant-based approach described in the literature for constructing block designs.     

Recovering Information from Incremental Responses

Some yields analysed and reported in the literature have been adjusted by subtracting a control. It is found that full information can be recovered for estimable parameters and the error variance using these incremental responses, in comparison with unadjusted data. These findings are of practical importance, and they supplement materials usually found in a graduate course in linear inference. The issues are illustrated using a case study from the literature.     

Distance sampling methodology

We consider the method of distance sampling described by Buckland, Anderson, Burnham and Laake in 1993. We explore the properties of the methodology in simple cases chosen to allow direct and accessible comparisons of distance sampling in the design- and model-based frameworks. In particular, we obtain expressions for the bias and variance of the distance sampling estimator of object density and for the expected value of the recommended analytic variance estimator within each framework. These results enable us to clarify aspects of the performance of the methodology which may be of interest to users and potential users of distance sampling.     

Bootstrap confidence regions computed from autoregressions of arbitrary order

Given a linear time series, e.g. an autoregression of infinite order, we may construct a finite order approximation and use that as the basis for confidence regions. The sieve or autoregressive bootstrap, as this method is often called, is generally seen as a competitor with the better-understood block bootstrap approach. However, in the present paper we argue that, for linear time series, the sieve bootstrap has significantly better performance than blocking methods and offers a wider range of opportunities. In particular, since it does not corrupt second-order properties then it may be used in a double-bootstrap form, with the second bootstrap application being employed to calibrate a basic percentile method confidence interval. This approach confers second-order accuracy without the need to estimate variance. That offers substantial benefits, since variances of statistics based on time series can be difficult to estimate reliably, and—partly because of the relatively small amount of information contained in a dependent process—are notorious for causing problems when used to Studentize. Other advantages of the sieve bootstrap include considerably greater robustness against variations in the choice of the tuning parameter, here equal to the autoregressive order, and the fact that, in contradistinction to the case of the block bootstrap, the percentile t version of the sieve bootstrap may be based on the 'raw' estimator of standard error. In the process of establishing these properties we show that the sieve bootstrap is second order correct.     

Estimation of long-run inefficiency levels: a dynamic frontier approach

Cornwell, Schmidt, and Sickles (1990) and Kumbhakar (1990), among others, developed stochasticfrontier production models which allow firm specific inefficiency levels to change over time. These studies assumed arbitrary restrictions on the short-run dynamics of efficiency levels which have little theoretical justification. Further, the models are inappropriate for estimation of long-run efficiencies. We consider estimation of an alternative frontier model in which firmspecific technical inefficiency levels are autoregressive. This model is particularly useful to examine a potential dynamic link between technical innovations and production inefficiency levels. We apply our methodology to a panel of US airlines.     

Designing and integrating composite networks for monitoring multivariate gaussian pollution fields

Networks of ambient monitoring stations are used to monitor environmental pollution fields such as those for acid rain and air pollution. Such stations provide regular measurements of pollutant concentrations. The networks are established for a variety of purposes at various times so often several stations measuring different subsets of pollutant concentrations can be found in compact geographical regions. The problem of statistically combining these disparate information sources into a single 'network' then arises. Capitalizing on the efficiencies so achieved can then lead to the secondary problem of extending this network. The subject of this paper is a set of 31 air pollution monitoring stations in southern Ontario. Each of these regularly measures a particular subset of ionic sulphate, sulphite, nitrite and ozone. However, this subset varies from station to station. For example only two stations measure all four. Some measure just one. We describe a Bayesian framework for integrating the measurements of these stations to yield a spatial predictive distribution for unmonitored sites and unmeasured concentrations at existing stations. Furthermore we show how this network can be extended by using an entropy maximization criterion. The methods assume that the multivariate response field being measured has a joint Gaussian distribution conditional on its mean and covariance function. A conjugate prior is used for these parameters, some of its hyperparameters being fitted empirically.