Simultaneous confidence band for the difference of segmented linear models

Consider comparing between two treatments a response variable, whose expectation depends on the value of a continuous covariate in some nonlinear fashion. We fit separate segmented linear models to each treatment to approximate the nonlinear relationship. For this setting, we provide a simultaneous confidence band for the difference between treatments of the expected value functions. The treatments are said to differ significantly on intervals of the covariate where the simultaneous confidence band does not contain zero. We consider segmented linear models where the locations of the changepoints are both known and unknown. The band is obtained from asymptotic results.     

HAZARD RATE ESTIMATION FOR CENSORED DATA BY WAVELET METHODS

ABSTRACT

We study the estimation of a hazard rate function based on censored data by non-linear wavelet method. We provide an asymptotic formula for the mean integrated squared error (MISE) of nonlinear wavelet-based hazard rate estimators under randomly censored data. We show this MISE formula, when the underlying hazard rate function and censoring distribution function are only piecewise smooth, has the same expansion as analogous kernel estimators, a feature not available for the kernel estimators. In addition, we establish an asymptotic normality of the nonlinear wavelet estimator.     

Sequential confidence intervals for the number of cells in a multinomial population

A two-sided sequential confidence interval is suggested for the number of equally probable cells in a given multinomial population with prescribed width and confidence coefficient. We establish large-sample properties of the fixed-width confidence interval procedure using a normal approximation, and some comparisons are made. In addition, a simulation study is carried out in order to investigate the finite sample behaviour of the suggested sequential interval estimation procedure.     

On shrinkage m-estimators of location parameters

For a general class of continuous ( and marginally symmetric ) inultivariate distributions, based on suitable M-statistics ( involving bounded but possibly discontinuous score generating functions), shrinkage estimators of location are considered. These estimators are based on the James-Stein type rule and incorporates the idea of preliminary test estimation too. The main emphasis is laid on the study of asymptotic tdistributional ) risk properties of these est-innators, and asymptotic tin-) adraissibility results are also studied under fairly general regularity conditions.     

三向剖分域上的二元二次样条插值与逼近

本文主要用B－网方法研究了平行六边形区域在三向剖分△_6~3下的二元二次样条插值的存在性、唯一性及逼近度问题。在本文末尾我们举例说明本方法是可行的。     

On Approximability of Boolean Formula Minimization

For a Boolean function given by a Boolean formula (or a binary circuit) S we discuss the problem of building a Boolean formula (binary circuit) of minimal size, which computes the function g equivalent to , or -equivalent to , i.e., . In this paper we prove that if P NP then this problem can not be approximated with a good approximation ratio by a polynomial time algorithm.     

On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover

The problems dealt with in this paper are generalizations of the set cover problem, min{cx | Ax b, x {0,1}ⁿ}, where c Q₊ⁿ, A {0,1}^{m × n}, b 1. The covering 0-1 integer program is the one, in this formulation, with arbitrary nonnegative entries of A and b, while the partial set cover problem requires only m–K constrains (or more) in Ax b to be satisfied when integer K is additionall specified. While many approximation algorithms have been recently developed for these problems and their special cases, using computationally rather expensive (albeit polynomial) LP-rounding (or SDP-rounding), we present a more efficient purely combinatorial algorithm and investigate its approximation capability for them. It will be shown that, when compared with the best performance known today and obtained by rounding methods, although its performance comes short in some special cases, it is at least equally good in general, extends for partial vertex cover, and improves for weighted multicover, partial set cover, and further generalizations.     

Batch-Processing Scheduling with Setup Times

The problem is to minimize the total weighted completion time on a single batch-processing machine with setup times. The machine can process a batch of at most B jobs at one time, and the processing time of a batch is given by the longest processing time among the jobs in the batch. The setup time of a batch is given by the largest setup time among the jobs in the batch. This batch-processing problem reduces to the ordinary uni-processor scheduling problem when B = 1. In this paper we focus on the extreme case of B = +, i.e. a batch can contain any number of jobs. We present in this paper a polynomial-time approximation algorithm for the problem with a performance guarantee of 2. We further show that a special case of the problem can be solved in polynomial time.     

Modified Wald statistics for generalized linear models

Summary: Wald statistics in generalized linear models are asymptotically ² distributed. The asymptotic chi–squared law of the corresponding quadratic form shows disadvantages with respect to the approximation of the finite–sample distribution. It is shown by means of a comprehensive simulation study that improvements can be achieved by applying simple finite–sample size approximations to the distribution of the quadratic form in generalized linear models. These approximations are based on a ² distribution with an estimated degree of freedom that generalizes an approach by Patnaik and Pearson. Simulation studies confirm that nominal level is maintained with higher accuracy compared to the Wald statistics.     

Calculating the density and distribution function for the singly and doubly noncentral F

Simple, closed form saddlepoint approximations for the distribution and density of the singly and doubly noncentral F distributions are presented. Their overwhelming accuracy is demonstrated numerically using a variety of parameter values. The approximations are shown to be uniform in the right tail and the associated limitating relative error is derived. Difficulties associated with some algorithms used for exact computation of the singly noncentral F are noted.