Median spheres: theory, algorithms, applications

A generalized hypersphere is either a hyperplane or a hypersphere, which consists of all points equidistant from a center. Geometrically, a weighted median hypersphere minimizes a weighted average of the distances from it to finitely many data points. As proved here, for each finite data set there exists at least one weighted median generalized hypersphere. Moreover, denote the sums of the weights of the data points inside by W ⁻, outside by W ⁺, and on the hypersphere by W ⁰. The present results show that each weighted median hypersphere is a weighted pseudo-halving hypersphere, in the sense that |W ⁻ − W ⁺| < W ⁰, and passes through at least two distinct data points. Combinatorically, a hypersphere is blocked if and only if it passes through data points in general position, in the sense that no other hypersphere passes through the same data points. A hypersphere is a halving hypersphere if and only if it is blocked, contains exactly k data points inside, confines exactly ℓ data points outside, and |k − ℓ| ≤ 1. In the plane, the present results also show that if a median circle is not a halving circle, then moving its center along a median between two data points on it until it passes through the next data point yields a halving circle. Relative to the center, if the direction cosines of the external and internal data points have the same mean and variance, then the median circle must be blocked, and stays so under sufficiently small perturbations of the data. Moreover, for every set of four points, at least one unweighted median circle is blocked. These results lend credence to a variant of a method used by archaeologists, and explain some findings from operations research.     

Bootstrap and permutation tests in ANOVA for directional data

The problem of testing the null hypothesis of a common direction across several populations defined on the hypersphere arises frequently when we deal with directional data. We may consider the Analysis of Variance (ANOVA) for testing such hypotheses. However, for the Watson distribution, a commonly used distribution for modeling axial data, the ANOVA test is only valid for large concentrations. So we suggest to use alternative tests, such as bootstrap and permutation tests in ANOVA. Then, we investigate the performance of these tests for data from Watson populations defined on the hypersphere.     

The Numerical Solution of the Linear Regulator Problem with Positive Control

The standard linear regulator problem with positive controlis solved using a minimum principle, a maximum principle, andthe hypersphere inequality method. Comparisons are made betweenthe numerical results produced, to examine the theoretical superiorityof the hypersphere method.     

Hyperspheric Integer Programming

This paper develops an efficient method for finding the optimal solution to linear mathematical programs on 0–1 variables. It is shown that the lattice (0–1) points satisfying some linear constraint of dimension n can equally be represented by those lying in a hypersphere of the same dimension. The lattice points satisfying two linear constraints can be represented by a hypersphere which contains the intersection of the hyperspheres of the two constraints. The method for finding the optimal solution consists of enumerating lattice points which are close to the center of the hypersphere corresponding to the constraints. As soon as a better value of the objective function has been found, than some lower bound, we find a new hypersphere which contains the lattice points of the constraints at which the objective function remains higher than the best known value. We continue in this manner until we have at some stage enumerated all lattice points within a given hypersphere and found none which give a better value.     

Realisation of special Kähler manifolds as parabolic spheres

We prove that any simply connected special Kähler manifold admits a canonical immersion as a parabolic affine hypersphere. As an application, we associate a parabolic affine hypersphere to any nondegenerate holomorphic function. We also show that a classical result of Calabi and Pogorelov on parabolic spheres implies Lu's theorem on complete special Kähler manifolds with a positive definite metric.

     

Management science applications: Computing and systems analysis: Hamed Kamal ELDIN and Hooshang M. BEHESHTI North-Holland,New York, 1981, xii + 316 pages, $41.50

An acceptance-rejection algorithm for generating random vectors uniformly distributed over (inside or on the surface of) a complex region inserted in a minimal multidimensional rectangle is considered. For regions having simple forms (simplex, hypersphere, hyperellipsoid) several algorithms are presented as well.     

The small Reynolds number expansion of then-dimensional drag coefficient

Small Reynolds number expansions are given for the drag coefficient appropriate to ann-dimensional streaming flow past a hypersphere. These demonstrate the basic structure of the well known three-dimensional result.     

Riemannian submersions with minimal fibers and affine hypersurfaces

Let π : M → B be a Riemannian submersion with minimal fibers. In this article we prove the following results: (1) If M is positively curved, then the horizontal distribution of the submersion is a non-totally geodesic distribution; (2) if M is non-negatively (respectively, negatively) curved, then the fibers of the submersion have non-positive (respectively, negative) scalar curvature; and (3) if M can be realized either as an elliptic proper centroaffine hypersphere or as an improper hypersphere in some affine space, then the horizontal distribution is non-totally geodesic. Several applications are also presented.     

Spherical 2-type hypersurfaces

A hypersurface (not necessarily compact) of a hypersphereS ⁿ⁺¹ of a Euclidean spaceE ⁿ⁺² is of 2-type if and only if it has constant nonzero mean curvature inS ⁿ⁺¹ and constant scalar curvature, unless it is a portion of a small hypersphere inS ⁿ⁺¹. This shows that the 2-type compact hypersurfaces of a hypersphere are mass-symmetric.     

Riemannian submersions with minimal fibers and affine hypersurfaces

Let π : M → B be a Riemannian submersion with minimal fibers. In this article we prove the following results: (1) If M is positively curved, then the horizontal distribution of the submersion is a non-totally geodesic distribution; (2) if M is non-negatively (respectively, negatively) curved, then the fibers of the submersion have non-positive (respectively, negative) scalar curvature; and (3) if M can be realized either as an elliptic proper centroaffine hypersphere or as an improper hypersphere in some affine space, then the horizontal distribution is non-totally geodesic. Several applications are also presented.     

Ned sets on a hyperplane

Under study are the sets in ℝ ⁿ (NED sets) each of which does not affect the conformal capacity of any condenser with connected plates disjoint from this set. These sets are removable singularities of quasiconformal mappings, which explains our interest in them. For compact sets on a hyperplane we obtain a geometric criterion of the NED property; we point out a simple sufficient condition for an NED set in terms of the connected attainability of its points from its complement in the hyperplane. For compact sets on a hypersphere we obtain a criterion for an NED set in terms of the reduced module at a pair of points in its complement. We establish that a compact set on a hypersphere S, removable for the capacity in at least one spherical ring concentric with S and containing S, is an NED set.     

非对称相异性矩阵的一种非度量多维尺度变换

本文将Okada ＆ Imaizumi等的模型加以推广,提出了一种用于处理非对称相异性矩阵的非度量多维尺度变换新方法.在模型中,我们假定每个研究对象可以表示为Minkowski度量空间中的一个点和一个超球面,超球面的半径揭示了相应研究对象的非对称性.文中我们给出了一种计算点坐标及球半径的算法.该算法使用了代数方法,比原来的方法收敛速度快,节省计算时间.最后给出了一个数值例子.     

Hit-and-run algorithms for the identification of nonredundant linear inequalities

Two probabilistic hit-and-run algorithms are presented to detect nonredundant constraints in a full dimensional system of linear inequalities. The algorithms proceed by generating a random sequence of interior points whose limiting distribution is uniform, and by searching for a nonredundant constraint in the direction of a random vector from each point in the sequence. In the hypersphere directions algorithm the direction vector is drawn from a uniform distribution on a hypersphere. In the computationally superior coordinate directions algorithm a search is carried out along one of the coordinate vectors. The algorithms are terminated through the use of a Bayesian stopping rule. Computational experience with the algorithms and the stopping rule will be reported.     

On monotonicity of the hypersphere volume and area

Motivated by reference [6] and applications in signal processing for communications systems, in this note, we obtain the dimension of maximum volume and the dimension of maximum surface area for the hypersphere of constant radius.      

差异张量平行和半平行的仿射超曲面

本文用活动标架法证明了：若 Ｍｎ（ｎ≥２）是 ｎ＋１维仿射空间 Ａｎ＋１中非退化的仿射超曲面,（１）若■Ｋ＝０（即差异张量平行）,则Ｍ是仿射球,且Ｊ＝０和Ｇ是一个Ｅｉｎｓｔｅｉｎ度量,这里Ｊ是Ｍ的 Ｐｉｃｋ不变量,Ｇ是Ｂｌａｓｃｈｋｅ度量;（２）Ｒ·Ｋ＝０（即差异张量半平行）当且仅当Ｓ＝０（Ｍ为虚仿射球）,或者Ｋ＝０（Ｍ为非退化的二次超曲面）,这里 Ｒ为诱导仿射联络 ■的黎曼曲率算子．     

改进卡方检验

In goodness-of-fit tests, Pearson＇s chi-squared test is one of most widely used tools of formal statistical analysis. However, Pearson＇s chi-squared test depends on the partition of the sample space. Different constructions of the partition of the sample space may lead to different conclusions. Based on an equiprobable partition of sample space, a modified chi~quared test is proposed. A method for constructing the modified chi-squared test is proposed. As an application, the proposed test is used to test whether vectorial data come from an uniformity distribution defined on the hypersphere. Some simulation studies show that the modified chisquared test against different alternative is robust.     

Surfaces with parallel normalized mean curvature vector

A surfaceM in a Riemannian manifold is said to have parallel normalized mean curvature vector if the mean curvature vector is nonzero and the unit vector in the direction of the mean curvature vector is parallel in the normal bundle. In this paper, it is proved that every analytic surface in a euclideanm-spaceE ^m with parallel normalized mean curvature vector must either lies in aE ⁴ or lies in a hypersphere ofE ^m as a minimal surface. Moreover, it is proved that if a Riemann sphere inE ^m has parallel normalized mean curvature vector, then it lies either in aE ³ or in a hypersphere ofE ^m as a minimal surfaces. Applications to the classification of surfaces with constant Gauss curvature and with parallel normalized mean curvature vector are also given.     

Affine hypersurfaces with the Ricci semi-symmetry

The purpose of the present paper is to prove that either a proper affine hypersphere or an affine cylindrical (See Introduction) is the only nondegenerate affine hypersurface of affine space with torsion free affine connection which satisfies the Ricci semi-symmetry and to study the equivalence of semi-symmetric and Ricci semi-symmetric in the case of affine hypersurfaces     

A method for determining the equilibrium states of dynamic systems

A heuristic method is presented for determining the equilibrium states of motion of dynamic systems, in particular, spacecraft. The method can also be applied to the solution of sets of linear or nonlinear algebraic equations. A positive-semidefinite functional is formed to convert the problem to that of finding those minimum points where the functional vanishes. The process is initiated within a selecteddomain of interest by random search; convergence to a minimum is obtained by a modified Davidon's deflected gradient technique. To render this approach feasible in the presence of constraints, the functional is modified to include penalty terms which cause the functional to approach infinity at the constraint boundaries. Close approximations to solutions near the constraint boundaries are found by applying Carroll's approach in successively reducing the weighting factors of the penalty terms. After finding a minimum, the local domain around this point is eliminated by adding to the functional an interior constraint term, representing the surface under a hypersphere centered at the minimum point. The domain of consideration now becomes the subdomain formed by subtracting the space contained within this hypersphere from the previous domain of interest. Minima are now sought within the remaining space, as before.This paper is derived from research performed by the author while employed by TRW Systems Group, Redondo Beach, California.The author acknowledges the helpful suggestions of Dr. G. Bekey, University of Southern California, and those of Mr. E. A. Quast, Dr. M. P. Scher, and Dr. R. J. Wiley, Dynamics Department, TRW Systems Group, Redondo Beach, California.