In this article, a testing procedure based on computational approach testis proposed for the equality of coe¢ cients of variation in k normal populations. We compare this procedure to some of the existing tests; the likelihood ratio, modi…ed Bennett’s, score, generalized p-value tests in terms of the estimated type I error rates and powers by using Monte Carlo simulation. Furthermore, applicati...

The author investigates Russian federalism and the constitutional underpinnings of the power vertical, looking specifically at the Constitutional Court’s December 2005 case about the appointment of governors. The court’s decision upheld the constitutional notion of a “unified system of executive power” as the primary legal justification for the power vertical. However, not all of the justices a...

We show that any language that has a two-locally-random reduction in which the target functions are boolean is in NP/poly\co-NP/poly. This extends and simpliies a result by Yao.

In this paper we derive nonlinear evolution equations associated with a class of non-convex energy functionals which can be used for correcting displacement errors in imaging data. We show a preliminary convergence result of a relaxed convexification of the non-convex optimization problem. Some properties on the behavior of the solutions of these filtering flows are studied by numerical analysi...

We consider a separable complete metric space equipped with a convex combination operation. For such spaces, we identify the corresponding convexification operator and show that the invariant elements for this operator appear naturally as limits in the strong law of large numbers. It is shown how to uplift the suggested construction to work with subsets of the basic space in order to develop a ...

Devadoss asked: (1) can every polygon be convexified so that no internal visibility (between vertices) is lost in the process? Moreover, (2) does such a convexification exist, in which exactly one vertex is moved at a time (that is, using single-vertex moves)? We prove the redundancy of the " single-vertex moves " condition: an affirmative answer to (1) implies an affirmative answer to (2). Sin...

A generalized word in two positive definite matrices A and B is a finite product of nonzero real powers of A and B. Symmetric words in positive definite A and B are positive definite, and so for fixed B, we can view a symmetric word, S(A, B), as a map from the set of positive definite matrices into itself. Given positive definite P , B, and a symmetric word, S(A, B), with positive powers of A, ...