A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways

The objective of the Interconnecting Highways problem is to construct roads of minimum total length to interconnect n given highways under the constraint that the roads can intersect each highway only at one point in a designated interval which is a line segment. We present a polynomial time approximation scheme for this problem by applying Arora's framework (Arora, 1998; also available from http:www.cs.princeton.edu/~arora). For every fixed c > 1 and given any n line segments in the plane, a randomized version of the scheme finds a -approximation to the optimal cost in O(n ^O(c)log(n) time.     

Evaluating fit in functional data analysis using model embeddings

The author proposes a general method for evaluating the fit of a model for functional data. His approach consists of embedding the proposed model into a larger family of models, assuming the true process generating the data is within the larger family, and then computing a posterior distribution for the Kullback‐Leibler distance between the true and the proposed models. The technique is illustrated on biomechanical data reported by Ramsay, Flanagan & Wang (1995). It is developed in detail for hierarchical polynomial models such as those found in Lindley & Smith (1972), and is also generally applicable to longitudinal data analysis where polynomials are fit to many individuals.     

多项式Copula方法对市场相关结构的分析

Copula函数的出现解决了如何为描述市场相关性的问题,同时也为构建多元函数的联合分布提供了一种可行的方法。然而由于高维copula函数的拟合相对比较困难,本文首次通过对高维copula的Bernstein多项式展开,建立关于市场相关结构的多参数线性模型。然后将沪深两市的指数经过GARCH处理后,作为经验数据带入进行多项式回归。从而验证了运用多项式逼近来描述市场相关结构的方法是可行的。     

Generalized Empirical Likelihood Inference in Generalized Linear Models for Longitudinal Data

In this article, the generalized linear model for longitudinal data is studied. A generalized empirical likelihood method is proposed by combining generalized estimating equations and quadratic inference functions based on the working correlation matrix. It is proved that the proposed generalized empirical likelihood ratios are asymptotically chi-squared under some suitable conditions, and hence it can be used to construct the confidence regions of the parameters. In addition, the maximum empirical likelihood estimates of parameters are obtained, and their asymptotic normalities are proved. Some simulations are undertaken to compare the generalized empirical likelihood and normal approximation-based method in terms of coverage accuracies and average areas/lengths of confidence regions/intervals. An example of a real data is used for illustrating our methods.     

On improving convergence rate of Bernstein polynomial density estimator

This paper is concerned with the Bernstein estimator [Vitale, R.A. (1975), ‘A Bernstein Polynomial Approach to Density Function Estimation’, in Statistical Inference and Related Topics, ed. M.L. Puri, 2, New York: Academic Press, pp. 87–99] to estimate a density with support [0, 1]. One of the major contributions of this paper is an application of a multiplicative bias correction [Terrell, G.R., and Scott, D.W. (1980), ‘On Improving Convergence Rates for Nonnegative Kernel Density Estimators’, The Annals of Statistics, 8, 1160–1163], which was originally developed for the standard kernel estimator. Moreover, the renormalised multiplicative bias corrected Bernstein estimator is studied rigorously. The mean squared error (MSE) in the interior and mean integrated squared error of the resulting bias corrected Bernstein estimators as well as the additive bias corrected Bernstein estimator [Leblanc, A. (2010), ‘A Bias-reduced Approach to Density Estimation Using Bernstein Polynomials’, Journal of Nonparametric Statistics, 22, 459–475] are shown to be O(n^?8/9) when the underlying density has a fourth-order derivative, where n is the sample size. The condition under which the MSE near the boundary is O(n^?8/9) is also discussed. Finally, numerical studies based on both simulated and real data sets are presented.     

Flat-Top Realized Kernel Estimation of Quadratic Covariation With Nonsynchronous and Noisy Asset Prices

This article develops a general multivariate additive noise model for synchronized asset prices and provides a multivariate extension of the generalized flat-top realized kernel estimators, analyzed earlier by Varneskov (2014), to estimate its quadratic covariation. The additive noise model allows for α-mixing dependent exogenous noise, random sampling, and an endogenous noise component that encompasses synchronization errors, lead-lag relations, and diurnal heteroscedasticity. The various components may exhibit polynomially decaying autocovariances. In this setting, the class of estimators considered is consistent, asymptotically unbiased, and mixed Gaussian at the optimal rate of convergence, n^1/4. A simple finite sample correction based on projections of symmetric matrices ensures positive definiteness without altering the asymptotic properties of the estimators. It, thereby, guarantees the existence of nonlinear transformations of the estimated covariance matrix such as correlations and realized betas, which inherit the asymptotic properties from the flat-top realized kernel estimators. An empirically motivated simulation study assesses the choice of sampling scheme and projection rule, and it shows that flat-top realized kernels have a desirable combination of robustness and efficiency relative to competing estimators. Last, an empirical analysis of signal detection and out-of-sample predictions for a portfolio of six stocks of varying size and liquidity illustrates the use and properties of the new estimators.     

A general algorithm for non-parametric maximum likelihood estimator of stochastically ordered survival functions from case 2 interval-censored data

In this paper, we study an algorithm to compute the non-parametric maximum likelihood estimator of stochastically ordered survival functions from case 2 interval-censored data. The algorithm, simply denoted by SQP (sequential quadratic programming), re-parameterizes the likelihood function to make the order constraints as a set of linear constraints, approximates the log-likelihood function as a quadratic function, and updates the estimate by solving a quadratic programming. We particularly consider two stochastic orderings, simple and uniform orderings, although the algorithm can also be applied to many other stochastic orderings. We illustrate the algorithm using the breast cancer data reported in Finkelstein and Wolfe (1985 Finkelstein, D. M., and R. A. Wolfe. 1985. A semiparametric model for regression analysis of interval-censored failure time data. Biometrics 41:933–45. [Google Scholar]).     

Optimal Designing of Variables Sampling Plan for Resubmitted Lots

This article proposes a variables sampling plan that can be applied for sampling inspection of resubmitted lots when the quality characteristic of interest follows the normal distribution. Resubmission of lots for inspection is allowed in some situations where the original inspection results are suspected or when the supplier or producer is allowed to opt for resampling as per the provisions of the contract, etc. The advantages of this proposed variables sampling plan over the existing single sampling variables plan are discussed. Tables are also constructed for the selection of optimal parameters of known and unknown standard deviation variables resampling scheme for specified two points on the operating characteristic curve, namely, the acceptable quality level and the limiting quality level along with the producer and consumer's risks. The optimization problem is formulated as a nonlinear programming where the objective function to be minimized is the average sample number and the constraints are related to lot acceptance probabilities at acceptable quality level and limiting quality level under the operating characteristic curve.     

Approximate solution of a profit maximization constrained virtual business planning problem

A virtual business problem is studied, in which a company-contractor outsources production to specialized subcontractors. Finances of the contractor and resource capacities of subcontractors are limited. The objective is to select subcontractors and distribute a part of the demanded production among them so that the profit of the contractor is maximized. A generalization of the knapsack problem, called Knapsack-of-Knapsacks (K-of-K), is used to model this situation, in which items have to be packed into small knapsacks and small knapsacks have to be packed into a large knapsack. A fully polynomial time approximation scheme is developed to solve the problem K-of-K.