Exact two-sample nonparametric test for quantile difference between two populations based on ranked set samples

Creation of a ranked set sample, by its nature, involves judgment ranking error within set units. This ranking error usually distorts statistical inference of the population characteristics. Tests may have inflated sizes, confidence intervals may have incorrect coverage probabilities, and the estimators may become biased. In this paper, we develop an exact two-sample nonparametric test for quantile shift between two populations based on ranked set samples. This test is based on two independent exact confidence intervals for the quantile of interest corresponding to the two populations and rejects the null hypothesis of equal quantiles if these intervals are disjoint. It is shown that a pair of 83 and 93% confidence intervals provide a 5 and 1% test for the equality of quantiles. The proposed test is calibrated for the effect of judgment ranking error so that the test has the correct size even under a wide range of judgment ranking errors. A small scale simulation study suggests that the test performs quite well for cycle sizes as small as 2.     

Local powers of two-sample and multi-sample rank tests for Lehmann's contaminated alternative

Summary Local powers of two- andk-sample rank tests under alternatives of contaminated distributions are investigated. It is shown that the rank tests based on normal scores and Wilcoxon scores are superior to thet-test or theF-test for many choices of alternatives of contaminated distributions and that the values of the asymptotic relative efficiency of the rank test based on Wilcoxon scores with respect to the normal scores are about one in all the investigated cases.     

A note on scale estimates based on the empirical characteristic function and their application to test for normality

We present a test for the composite hypothesis of normality against general alternatives. The test statistic is essentially the difference of two estimates of scale based on the empirical characteristic function. The test is simple to apply and its performance is comparable with that of several other well-known tests of normality.     

Remarks on a difficult test problem for quadratic boolean programming

We show that a “difficult” example is only difficult for special kinds of algorithms     

Combining very large scale and ILP based neighborhoods for a two-level location problem

In this paper we tackle a generalization of the Single Source Capacitated Facility Location Problem in which two sets of facilities, called intermediate level and upper level facilities, have to be located; the dimensioning of the intermediate set, the assignment of clients to intermediate level facilities, and of intermediate level facilities to upper level facilities, must be optimized, as well. Such problem arises, for instance, in telecommunication network design: in fact, in hierarchical networks the traffic arising at client nodes often have to be routed through different kinds of facility nodes, which provide different services. We propose a heuristic approach, based on very large scale neighborhood search to tackle the problem, in which both ad hoc algorithms and general purpose solvers are applied to explore the search space. We report on experimental results using datasets from the capacitated location literature. Such results show that the approach is promising and that Integer Linear Programming based neighborhoods are significantly effective.     

刻度指数族参数的经验Bayes检验函数收敛速度的改进

在加权线性损失下导出了刻度指数族中参数单调的Bayes检验函数,利用同分布负相协(NA)样本情形概率密度函数及其导数的核估计构造了经验Bayes(EB)检验函数,获得了EB检验函数的收敛速度.在适当的条件下,这一收敛速度可任意接近O(n~(-1)),改进了文献中已有的结果.对同分布正相协(PA)样本和独立同分布(iid)样本情形,亦可获得类似结论.最后给出了一个满足文中主要结果的例子.     

The limiting normality of the test statistic for the two-sample problem induced by a convex sum distance

Critchlow (1992, J. Statist. Plann. Inference, 32, 325–346) proposed a method of a unified construction of a class of rank tests. In this paper, we introduce a convex sum distance and prove the limiting normality of the test statistics for the two-sample problem derived by his method.     

A note on asymptotic inference in a class of non-stationary processes

In this note some problems of asymptotic inference in a class of non-stationary stochastic processes are considered. In particular, it is shown that no criterion based on the existence of uniformly most powerful tests over a local neighborhood can be used in this situation.     

Decentralized iterative learning control for a class of large scale interconnected dynamical systems

The problem of decentralized iterative learning control for a class of large scale interconnected dynamical systems is considered. In this paper, it is assumed that the considered large scale dynamical systems are linear time-varying, and the interconnections between each subsystem are unknown. For such a class of uncertain large scale interconnected dynamical systems, a method is presented whereby a class of decentralized local iterative learning control schemes is constructed. It is also shown that under some given conditions, the constructed decentralized local iterative learning controllers can guarantee the asymptotic convergence of the local output error between the given desired local output and the actual local output of each subsystem through the iterative learning process. Finally, as a numerical example, the system coupled by two inverted pendulums is given to illustrate the application of the proposed decentralized iterative learning control schemes.     

Parameter change test for location‐scale time series models with heteroscedasticity based on bootstrap

This study considers the bootstrap cumulative sum (CUSUM) test for a parameter change in location‐scale time series models with heteroscedasticity. The CUSUM test has been popular for detecting an abrupt change in time series models because it performs well in many applications. However, it has severe size distortions in many situations. As a remedy, we consider the bootstrap CUSUM test, particularly focusing on the CUSUM test based on score vectors, and demonstrate the weak consistency of the bootstrap test for its justification. A simulation study and data analysis are conducted for illustration.     

Nonparametric estimation of location parameter after a preliminary test on regression in the multivariate case

For a simple multivariate regression model, nonparametric estimation of the (vector of) intercept following a preliminary test on the regression vector is considered. Along with the asymptotic distribution of these estimators, their asymptotic bias and dispersion matrices are studied and allied efficiency results are presented.     

A neural network for solving a convex quadratic bilevel programming problem

A neural network is proposed for solving a convex quadratic bilevel programming problem. Based on Lyapunov and LaSalle theories, we prove strictly an important theoretical result that, for an arbitrary initial point, the trajectory of the proposed network does converge to the equilibrium, which corresponds to the optimal solution of a convex quadratic bilevel programming problem. Numerical simulation results show that the proposed neural network is feasible and efficient for a convex quadratic bilevel programming problem.     

A mixed Dirichlet-Robin problem for a nonlinear Kirchhoff-Carrier wave equation

In this paper, a mixed Dirichlet-Robin problem for a nonlinear Kirchhoff-Carrier wave equation is studied. Using the Faedo-Galerkin method and the linearization method for nonlinear terms, we prove the existence and uniqueness of a weak solution of the above problem. An asymptotic expansion of high order in many small parameters of solutions is also discussed.     

A note on a variant of the online open end bin packing problem

We study the minimum variant of the online open end bin packing problem. Items are presented one by one, and an item can be packed into a bin while the resulting total size of items excluding the minimum size item of the bin will be below 1. We design an improved online algorithm whose asymptotic competitive ratio does not exceed 1.180952381, and we prove a new lower bound of 1.1666666 on the asymptotic competitive ratio of any online algorithm.     

A decomposition approach for a very large scale optimal diversity management problem

This paper focuses on the solution of the optimal diversity management problem formulated as a p-Median problem. The problem is solved for very large scale real instances arising in the car industry and defined on a graph with several tens of thousands of nodes and with several millions of arcs. The particularity is that the graph can consist of several non connected components. This property is used to decompose the problem into a series of p-Median subproblems of a smaller dimension. We use a greedy heuristic and a Lagrangian heuristic for each subproblem. The solution of the whole problem is obtained by solving a suitable assignment problem using a Branch-and-Bound algorithm.Received: June 2004 / Revised version: December 2004MSC classification: 49M29, 90C06, 90C27, 90C60All correspondence to: Antonio SforzaIgor Vasilev: Support for this author was provided by NATO grant CBP.NR.RIG.911258.     

On nonparametric tests for symmetry inRm

This paper considers the problem for testing symmetry of a distribution inR ^m based on the empirical distribution function. Limit theorems which play important roles for investigating asymptotic behavior of such tests are obtained. The limit processes of the theorems are multiparameter Wiener process. Based on the limit theorems, nonparametric tests are proposed whose asymptotic distributions are functionals of a multiparameter standard Wiener process. The tests are compared asymptotically with each other in the sense of Bahadur.     

A note on one-point quadrature formula for Daubechies scale function with partial support

This note is concerned with an efficient computation of integrals of products of a smooth function and Daubechies scale function with partial support by using a one-point quadrature rule. The error estimate is obtained. The rule is illustrated by considering an example from the literature.