We propose a new nonparametric test of affiliation, a strong form of positive dependence with independence as a special, knife–edge, case. The test is consistent against all departures from the null of affiliation, and its null distribution is standard normal. Like most nonparametric tests, a sample–size dependent input parameter is needed. We provide an informal procedure for choosing the inpu...

We consider a classical k-center problem in trees. Let T be a tree of n vertices and every vertex has a nonnegative weight. The problem is to find k centers on the edges of T such that the maximum weighted distance from all vertices to their closest centers is minimized. Megiddo and Tamir (SIAM J. Comput., 1983) gave an algorithm that can solve the problem in O(n log n) time by using Cole’s par...

We consider the line search problem in a submodular polytope P (f) ⊆ R: Given an arbitrary a ∈ R and x0 ∈ P (f), compute max{δ : x0 + δa ∈ P (f)}. The use of the discrete Newton’s algorithm for this line search problem is very natural, but no strongly polynomial bound on its number of iterations was known [Iwata, 2008]. We solve this open problem by providing a quadratic bound of n + O(n log n)...

We consider multi-objective convex optimal control problems. First we state a relationship between the (weakly or properly) efficient set of the multi-objective problem and the solution of the problem scalarized via a convex combination of objectives through a vector of parameters (or weights). Then we establish that (i) the solution of the scalarized (parametric) problem for any given paramete...

We present a parametric groundness analysis whose input and output are parameterized by a set of groundness parameters. The result of the analysis can be instantiated for different uses of the program. It can also be used to derive sufficient conditions for safely removing groundness checks for built-in calls in the program. The parametric groundness analysis is obtained by generalizing a non-p...

In the present time, evaluating the performance of banks is one of the important subjects for societies and the bank managers who want to expand the scope of their operation. One of the non-parametric approaches for evaluating efficiency is data envelopment analysis(DEA). By a mathematical programming model, DEA provides an estimation of efficiency surfaces. A major problem faced by DEA is that...

Considered are linear algebraic systems of equations and/or inequalities involving linear dependencies between interval-valued parameters. The goal is to characterize weak and strong solvability of such systems. Since any parametric interval equation is equivalent to a system of parametric interval inequalities, the focus is on the latter. We discuss an algorithmic procedure for characterizing ...

data envelopment analysis (dea) is a non-parametric approach for performance analysis of decision making units (dmus) which uses a set of inputs to produce a set of outputs without the need to consider internal operations of each unit. in recent years, there have been various studies dealt with two-stage production systems, i.e. systems which consume some inputs in their first stage to produce ...

Introduction: The purpose of multimodal and co-registration In MR Neuroimaging is to fuse two or more sets images (T1, T2, fMRI, DTI, pMRI, …) for combining the different information into a composite correlated data set in order to visualization, re-alignment and generating transform to functional Matrix. Multimodal registration and motion correction in spinal cord MR Neuroimag...