The k Most Frequent Distances in the Plane

   Abstract. A new upper bound is shown for the number of incidences between n points and n families of concentric circles in the plane. As a consequence, it is shown that the number of the k most frequent distances among n points in the plane is f _n (k)=O(n ^1.4571 k ^.6286 ) improving on an earlier bound of Akutsu, Tamaki, and Tokuyama.     

The Most Critical Path in a PERT Network

The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a project by a given deadline. However, in general, such a path is not the ‘most critical’ path and does not provide the smallest estimate for the probability of completion time. This paper studies the ‘most critical path’ problem and formulates it as an optimal path problem in a deterministic network with a two-attribute fractional objective function. An exact solution approach is presented for the optimal path problem which also gives the solution to the most critical path problem. The illustrative examples as well as our computational results demonstrate that the proposed algorithm provides estimates for the probabilities of completion time that are much more accurate than those of the classical approach.     

The k Most Frequent Distances in the Plane

Abstract. A new upper bound is shown for the number of incidences between n points and n families of concentric circles in the plane. As a consequence, it is shown that the number of the k most frequent distances among n points in the plane is f _n (k)=O(n ^1.4571 k ^.6286 ) improving on an earlier bound of Akutsu, Tamaki, and Tokuyama.     

Most robust M-estimators in the infinitesimal sense

Summary The change-of-variance curve (CVC) is generalized to M-estimators with piecewise continuous -functions, in which case it becomes a Schwartz distribution. An M-estimator is called most B-robust when it minimizes Hampel's gross-error sensitivity ^*, and most V-robust when it minimizes the change-of-variance sensitivity k ^*. In the general case, the median is most B-robust and most V-robust. If consideration is restricted to redescending M-estimators, then the skipped median is most B-robust and the median-type tanh-estimator is most V-robust. By means of these results, complete solutions of the problems of optimal infinitesimal robustness are obtained.     

Most vital links and nodes in weighted networks

The n most vital links (or nodes) in a weighted network are those n links (nodes) whose removal from the network results in the greatest increase in shortest distance between two specified nodes. Preliminary results are presented for obtaining these entities.     

多元对应分析在抽样调查分析中的应用

本文应用多元对应分析、聚类分析等数理统计方法 ,对抽样调查问卷进行分析 ,从而得出各类读者群的特征及它们之间的差异