🚀 go-pugleaf

Max Benson
Assistant Professor of Computer Science
University of Minnesota-Duluth
!ihnp4!umn-cs!umd-cs!max

----------------------------------------------------------------------

%A Max Benson
%A Kinley Larntz
%A Michael Lavine
%A Ronald Regal
%T Convex Regions in Multiple Dimensions
%R 86-4
%I University of Minnesota-Duluth
%C Duluth, Minnesota
%D May, 1986
%X Convex hulls and minimum covering ellipsoids are two methods
for defining the region of space enclosed by given set of points.
Algorithms to compute convex hulls and minimum covering ellipsoids
were implemented.  This paper describes some
of the results of these investigations.

%A Ronald R. Regal
%T Applying Order Statistic Censored Normal Confidence Intervals to
Time Censored Data
%R 86-5
%I University of Minnesota-Duluth
%C Duluth, Minnesota
%D May, 1986
%X Monte Carlo methods are used in this paper to investigate the coverage
probabilities of nominal 95% confidence intervals computed from
samples of n = 4, 6, 8, and 10 normal random variables right censored
by time limits such that a sample is censored with probability 0.05,
0.10, ..., 0.95.

%A Ronald R. Regal
%A Ernest B. Hook
%T A Note on Standard Errors for Rates Derived From Two or More Incomplete
Censuses
%R 86-6
%I University of Minnesota-Duluth
%C Duluth, Minnesota
%D May, 1986
%X Capture-recapture methods have been used in many studies to estimate
the rate of occurrence of a characteristic such as a birth defect in a
population.  This paper discusses the standard error of such an
estimate.

%A Ronald R. Regal
%T Non-parametric Testing of a Nonstandard Two-Sample Problem
%R 86-7
%I University of Minnesota-Duluth
%C Duluth, Minnesota
%D May, 1986
%X The two-sample problem is considered for a null hypothesis other than
the standard H_0 : F = G.  A stochastic process is described which
can lead to several nonparametric tests of H_0 : G = 1- (1-F)^k.  An
analog of the Wilcoxon statistic is derived which can be extended to
data with ties and some types of censoring.

%A David Kingsley
%T Exact Integer Multiplication Algorithms
%R 86-8
%I University of Minnesota-Duluth
%C Duluth, Minnesota
%D May, 1986
%X This report describes the C language implementation of three well-known exact
integer multiplication algorithms: the traditional algorithm,
the divide-and-conquer algorithm, and the Schoenhage-Strassen
algorithm.  Comparative timings are given.