变换法在解微分方程中的应用

变量代换法是解常微分方程的一种辅助方法，它能使问题简化．本文通过联系实例给出了变换在求解微分方程中的具体应用。     

New imperfect rankings models for ranked set sampling

Ranked set sampling is a sampling approach that leads to improved statistical inference in situations where the units to be sampled can be ranked relative to each other prior to formal measurement. This ranking may be done either by subjective judgment or according to an auxiliary variable, and it need not be completely accurate. In fact, results in the literature have shown that no matter how poor the quality of the ranking, procedures based on ranked set sampling tend to be at least as efficient as procedures based on simple random sampling. However, efforts to quantify the gains in efficiency for ranked set sampling procedures have been hampered by a shortage of available models for imperfect rankings. In this paper, we introduce a new class of models for imperfect rankings, and we provide a rigorous proof that essentially any reasonable model for imperfect rankings is a limit of models in this class. We then describe a specific, easily applied method for selecting an appropriate imperfect rankings model from the class.     

A Bayesian Hierarchical Model for the Evaluation of a Website

Consider a website and the surfers visiting its pages. A typical issue of interest, for example while monitoring an advertising campaign, concerns whether a specific page has been designed successfully, i.e. is able to attract surfers or address them to other pages within the site. We assume that the surfing behaviour is fully described by the transition probabilities from one page to another, so that a clickstream (sequence of consecutively visited pages) can be viewed as a finite-state-space Markov chain. We then implement a variety of hierarchical prior distributions on the multivariate logits of the transition probabilities and define, for each page, a content effect and a link effect. The former measures the attractiveness of the page due to its contents, while the latter signals its ability to suggest further interesting links within the site. Moreover, we define an additional effect, representing overall page success, which incorporates both effects previously described. Using WinBUGS, we provide estimates and credible intervals for each of the above effects and rank pages accordingly.     

二维变系数线性微分系统的求解定理

给出二维变系数线性微分系统在已知某解的情形下求通解的公式,并直接应用此公式,导出几类二维变系数线性微分系统的通解公式.对理论和实际应用都是有益的.     

Testing Inference in Inflated Beta Regressions under Model Misspecification

We consider testing inference in inflated beta regressions subject to model misspecification. In particular, quasi-z tests based on sandwich covariance matrix estimators are described and their finite sample behavior is investigated via Monte Carlo simulations. The numerical evidence shows that quasi-z testing inference can be considerably more accurate than inference made through the usual z tests, especially when there is model misspecification. Interval estimation is also considered. We also present an empirical application that uses real (not simulated) data.     

An empirical Bayes' procedure for ranking players in Ryder Cup golf

We describe a model to obtain strengths and rankings of players appearing in golf's Ryder Cup. Obtaining rankings is complicated because of two reasons. First, competitors do not compete on an equal number of occasions, with some competitors appearing too infrequently for their ranking to be estimated with any degree of certainty, and second, different competitors experience different levels of volatility in results. Our approach is to assume the competitor strengths are drawn from some common distribution. For small numbers of competitors, as is the case here, we fit the model using Monte-Carlo integration. Results suggest there is very little difference between the top performing players, though Scotland's Colin Montgomerie is estimated as the strongest Ryder Cup player.     

Quadratic Approximation via the SCAD Penalty with a Diverging Number of Parameters

The high-dimensional data arises in diverse fields of sciences, engineering and humanities. Variable selection plays an important role in dealing with high dimensional statistical modelling. In this article, we study the variable selection of quadratic approximation via the smoothly clipped absolute deviation (SCAD) penalty with a diverging number of parameters. We provide a unified method to select variables and estimate parameters for various of high dimensional models. Under appropriate conditions and with a proper regularization parameter, we show that the estimator has consistency and sparsity, and the estimators of nonzero coefficients enjoy the asymptotic normality as they would have if the zero coefficients were known in advance. In addition, under some mild conditions, we can obtain the global solution of the penalized objective function with the SCAD penalty. Numerical studies and a real data analysis are carried out to confirm the performance of the proposed method.     

Robust modal estimation and variable selection for single-index varying-coefficient models

In this article, we present a new efficient iteration estimation approach based on local modal regression for single-index varying-coefficient models. The resulted estimators are shown to be robust with regardless of outliers and error distributions. The asymptotic properties of the estimators are established under some regularity conditions and a practical modified EM algorithm is proposed for the new method. Moreover, to achieve sparse estimator when there exists irrelevant variables in the index parameters, a variable selection procedure based on SCAD penalty is developed to select significant parametric covariates and the well-known oracle properties are also derived. Finally, some numerical examples with various distributed errors and a real data analysis are conducted to illustrate the validity and feasibility of our proposed method.     

Transductive versions of the LASSO and the Dantzig Selector

Transductive methods are useful in prediction problems when the training dataset is composed of a large number of unlabeled observations and a smaller number of labeled observations. In this paper, we propose an approach for developing transductive prediction procedures that are able to take advantage of the sparsity in the high dimensional linear regression. More precisely, we define transductive versions of the LASSO (Tibshirani, 1996) and the Dantzig Selector (Candès and Tao, 2007). These procedures combine labeled and unlabeled observations of the training dataset to produce a prediction for the unlabeled observations. We propose an experimental study of the transductive estimators that shows that they improve the LASSO and Dantzig Selector in many situations, and particularly in high dimensional problems when the predictors are correlated. We then provide non-asymptotic theoretical guarantees for these estimation methods. Interestingly, our theoretical results show that the Transductive LASSO and Dantzig Selector satisfy sparsity inequalities under weaker assumptions than those required for the “original” LASSO.     

Monitoring the coefficient of variation using a variable sample size and sampling interval control chart

This article proposes a CV chart by using the variable sample size and sampling interval (VSSI) feature to improve the performance of the basic CV chart, for detecting small and moderate shifts in the CV. The proposed VSSI CV chart is designed by allowing the sample size and the sampling interval to vary. The VSSI CV chart's statistical performance is measured by using the average time to signal (ATS) and expected average time to signal (EATS) criteria and is compared with that of existing CV charts. The Markov chain approach is employed in the design of the chart.