Hartley, H. O.
Overview
Works:  191 works in 472 publications in 3 languages and 3,329 library holdings 

Genres:  History Conference papers and proceedings Bibliography Academic theses Charts, diagrams, etc 
Roles:  Editor, Author, Other, Contributor, Dedicatee, Honoree 
Classifications:  QA276, 519 
Publication Timeline
.
Most widely held works about
H. O Hartley
 H.O. Hartley's contributions to sample survey theory and methods ; William G. Cochran's contributions to sample survey theory and methods by J. N. K Rao( Book )
 Papers by H. O Hartley( )
Most widely held works by
H. O Hartley
Biometrika tables for statisticians by
E. S Pearson(
Book
)
101 editions published between 1954 and 1976 in English and held by 1,036 WorldCat member libraries worldwide
This volume contains a collection of numerical tables commonly required by mathematical statisticians in the course of their work. The tables are accompanied by a lengthy introduction which gives for each table the appropriate mathematical formulae, detailed instructions for use (Including interpolation where relevant) And, in many cases, one or two worked examples. A uniform notation is adopted as far as possible
101 editions published between 1954 and 1976 in English and held by 1,036 WorldCat member libraries worldwide
This volume contains a collection of numerical tables commonly required by mathematical statisticians in the course of their work. The tables are accompanied by a lengthy introduction which gives for each table the appropriate mathematical formulae, detailed instructions for use (Including interpolation where relevant) And, in many cases, one or two worked examples. A uniform notation is adopted as far as possible
Guide to tables in mathematical statistics by
J. Arthur Greenwood(
Book
)
24 editions published between 1962 and 2017 in English and held by 601 WorldCat member libraries worldwide
This book is exclusively devoted to the tables of mathematical statistics. It catalogues a large selection of tables in the field of mathematical statistics, with a small selection of mathematical tables lying outside statistics but often used with statistical tables.Originally published in 1962.The Princeton Legacy Library uses the latest printondemand technology to again make available previously outofprint books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905
24 editions published between 1962 and 2017 in English and held by 601 WorldCat member libraries worldwide
This book is exclusively devoted to the tables of mathematical statistics. It catalogues a large selection of tables in the field of mathematical statistics, with a small selection of mathematical tables lying outside statistics but often used with statistical tables.Originally published in 1962.The Princeton Legacy Library uses the latest printondemand technology to again make available previously outofprint books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905
On the history of statistics and probability : proceedings of a symposium on the American mathematical heritage, to celebrate
the bicentennial of the United States of America, held at Southern Methodist University, May 2729, 1974 by
D. B Owen(
Book
)
9 editions published between 1976 and 1977 in English and held by 578 WorldCat member libraries worldwide
Early development of techniques in comparative experimentation; The analysis of variance and factorial design; Industrial experimentation (19551965); Some important events in the historical development of sample surveys; A personal perspective on statistical techniques for quasiexperiments; History of the early developments of modern statistics in America (19201944)
9 editions published between 1976 and 1977 in English and held by 578 WorldCat member libraries worldwide
Early development of techniques in comparative experimentation; The analysis of variance and factorial design; Industrial experimentation (19551965); Some important events in the historical development of sample surveys; A personal perspective on statistical techniques for quasiexperiments; History of the early developments of modern statistics in America (19201944)
Contributions to survey sampling and applied statistics : papers in honor of H.O. Hartley by
H. O Hartley(
Book
)
10 editions published between 1977 and 2014 in English and held by 413 WorldCat member libraries worldwide
Contributions to Survey Sampling and Applied Statistics: Papers in Honor of H. O. Hartley covers the significant advances in survey sampling, modeling, and applied statistics. This book is organized into five parts encompassing 20 chapters.<br><br>The opening part looks into some aspects of statistics, sampling, randomization, predictive estimation, and internal congruency. This part also considers the properties of variance estimation for a specified multiple frame survey design and some sampling designs involving unequal probabilities of selection and robust estimation of a finite population
10 editions published between 1977 and 2014 in English and held by 413 WorldCat member libraries worldwide
Contributions to Survey Sampling and Applied Statistics: Papers in Honor of H. O. Hartley covers the significant advances in survey sampling, modeling, and applied statistics. This book is organized into five parts encompassing 20 chapters.<br><br>The opening part looks into some aspects of statistics, sampling, randomization, predictive estimation, and internal congruency. This part also considers the properties of variance estimation for a specified multiple frame survey design and some sampling designs involving unequal probabilities of selection and robust estimation of a finite population
Biometrika tables for statisticians by
E. S Pearson(
Book
)
61 editions published between 1954 and 1984 in English and Swedish and held by 255 WorldCat member libraries worldwide
61 editions published between 1954 and 1984 in English and Swedish and held by 255 WorldCat member libraries worldwide
'Biometrika' tables for statisticians by
E. S Pearson(
Book
)
24 editions published between 1966 and 1976 in English and held by 106 WorldCat member libraries worldwide
24 editions published between 1966 and 1976 in English and held by 106 WorldCat member libraries worldwide
Modern machine calculation with the Facit calculating machine, model Lx by H Sabielny(
Book
)
2 editions published in 1939 in English and held by 24 WorldCat member libraries worldwide
2 editions published in 1939 in English and held by 24 WorldCat member libraries worldwide
Direkte methoden der variationsrechnung zur lösung von randwertproblemen by
H. O Hartley(
Book
)
5 editions published between 1933 and 1934 in German and held by 22 WorldCat member libraries worldwide
5 editions published between 1933 and 1934 in German and held by 22 WorldCat member libraries worldwide
New tables of statistical variables by
M Merrington(
Book
)
5 editions published between 1942 and 1943 in English and held by 8 WorldCat member libraries worldwide
5 editions published between 1942 and 1943 in English and held by 8 WorldCat member libraries worldwide
Computerized scheduling of seagoing tankers by
H. O Hartley(
Book
)
2 editions published in 1971 in English and held by 4 WorldCat member libraries worldwide
The paper represents a condensed summary of the mathematical aspects of a project which was carried out with the active cooperation of Defense Supply Agency Headquarters (DSAH), Defense Fuel Supply Center (DFSC), Military Sea Transportation Service (MSTS), Office of Naval Research (ONR). It must not be regarded as a complete statement of the logistic ramifications of the operational problem of the scheduling of tankers, but rather as a somewhat idealized version of the real life situation. The authors should state however that the computer program they have developed and which is briefly sketched in section 6 takes account of all operational aspects although certain modifications are still in progress. Mathematical formulations of the problem are given. One is a reduction to nonconvex integer programming problem. The other (utilizing operational restrictions for the feasible tanker routes) reduces the problem to linear integer programming which is solved by a decomposition algorithm. (Author)
2 editions published in 1971 in English and held by 4 WorldCat member libraries worldwide
The paper represents a condensed summary of the mathematical aspects of a project which was carried out with the active cooperation of Defense Supply Agency Headquarters (DSAH), Defense Fuel Supply Center (DFSC), Military Sea Transportation Service (MSTS), Office of Naval Research (ONR). It must not be regarded as a complete statement of the logistic ramifications of the operational problem of the scheduling of tankers, but rather as a somewhat idealized version of the real life situation. The authors should state however that the computer program they have developed and which is briefly sketched in section 6 takes account of all operational aspects although certain modifications are still in progress. Mathematical formulations of the problem are given. One is a reduction to nonconvex integer programming problem. The other (utilizing operational restrictions for the feasible tanker routes) reduces the problem to linear integer programming which is solved by a decomposition algorithm. (Author)
The use of Monte Carlo methods in some statistical distribution problems by Suharto Soedardjo(
Book
)
1 edition published in 1968 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 1968 in English and held by 4 WorldCat member libraries worldwide
Applications of Graph Theory to PERT Critical Path Analysis by Ersen Arseven(
Book
)
3 editions published in 1974 in English and held by 4 WorldCat member libraries worldwide
The first part of this report is concerned with the study of the detailed structure of networks sometimes referred to as directed acyclic networks. A number of new properties in theorems concerning such networks have been derived and although they do not necessarily assist in the generalization of the statistical PERT algorithms, they are useful in surveying the multiplicity of networks that might be encountered and in establishing convergence proofs and other properties of the algorithms that have been developed to date. Based upon the study of the properties of PERT networks an attempt is made to develop algorithms which at least provide approximate answers for both the statistical distribution of the project completion times as well as for their expectations. (Modified author abstract)
3 editions published in 1974 in English and held by 4 WorldCat member libraries worldwide
The first part of this report is concerned with the study of the detailed structure of networks sometimes referred to as directed acyclic networks. A number of new properties in theorems concerning such networks have been derived and although they do not necessarily assist in the generalization of the statistical PERT algorithms, they are useful in surveying the multiplicity of networks that might be encountered and in establishing convergence proofs and other properties of the algorithms that have been developed to date. Based upon the study of the properties of PERT networks an attempt is made to develop algorithms which at least provide approximate answers for both the statistical distribution of the project completion times as well as for their expectations. (Modified author abstract)
The transportation problem with optimization of the origins by Alvin Paul Rainosek(
Book
)
3 editions published in 1970 in English and held by 4 WorldCat member libraries worldwide
The report presents solution procedures for two related location/allocation problems. Two algorithms which mathematically guarantee global optimality are described for the first problem which considers the optimal positioning of an origin set and associated optimal quotas given a known destination set. For the second problem which requires the optimal positioning of a 'serving center' set given a known origin set and destination set, an efficient exhaustive scanning procedure and a modified version of an algorithm given for the first problem are presented. Both of these techniques guarantee a global optimum. For large problems which have both limited capacities and geographic restritions placed on the optimal positioning of the serving centers, a twophase iterative procedure not guaranteeing global optimality is described. Example problems are provided to illustrate selected algorithms. (Author)
3 editions published in 1970 in English and held by 4 WorldCat member libraries worldwide
The report presents solution procedures for two related location/allocation problems. Two algorithms which mathematically guarantee global optimality are described for the first problem which considers the optimal positioning of an origin set and associated optimal quotas given a known destination set. For the second problem which requires the optimal positioning of a 'serving center' set given a known origin set and destination set, an efficient exhaustive scanning procedure and a modified version of an algorithm given for the first problem are presented. Both of these techniques guarantee a global optimum. For large problems which have both limited capacities and geographic restritions placed on the optimal positioning of the serving centers, a twophase iterative procedure not guaranteeing global optimality is described. Example problems are provided to illustrate selected algorithms. (Author)
Estimation of the Upper Limit of Finite Range Distributions by
L. W Spradley(
Book
)
3 editions published in 1972 in English and held by 4 WorldCat member libraries worldwide
The report is concerned with the problem of estimating the upper limit of a distribution using a random sample drawn from it. Specifically, the theory may be applied to the estimation of either the upper or lower limit of finite range distribution or to the estimation of either the upper or the lower limit for distributions where one of the limits is infinite. The literature on this particular estimation problem is limited and confined to special cases of parametric distributions such as the gamma distribution with unknown origin and the uniform distribution. The most general situation discussed in the literature arises in the Pearsonian system of frequency curves with the lower end or upper limit finite. (Author)
3 editions published in 1972 in English and held by 4 WorldCat member libraries worldwide
The report is concerned with the problem of estimating the upper limit of a distribution using a random sample drawn from it. Specifically, the theory may be applied to the estimation of either the upper or lower limit of finite range distribution or to the estimation of either the upper or the lower limit for distributions where one of the limits is infinite. The literature on this particular estimation problem is limited and confined to special cases of parametric distributions such as the gamma distribution with unknown origin and the uniform distribution. The most general situation discussed in the literature arises in the Pearsonian system of frequency curves with the lower end or upper limit finite. (Author)
Algorithm for the Computation of the Coefficients of Powers of Polynomials by
Grace YunLoh Yeh Chen(
Book
)
3 editions published in 1974 in English and held by 4 WorldCat member libraries worldwide
One of the approaches to determine the global maximum of a multivariate function f(x) within a 'feasible region' R in the Euclidean nspace is based on the evaluation of the socalled functional moments of f(x), that is, the integrals (I sub k) = the integral over R of f(x) (sup k)dx for a sequence of integral k. This study is concerned with algorithms accomplishing this task in three special cases. The first case arises when f(x) is a multivariate polynomial and R is the n dimensional hypercube. In the second case, f(x) is a multivariate expansion into trigonometric functions and region R is the hypercube. Finally, third case is considered where f(x) is given by a multivariate polar expansion and R is a smooth convex region in the sense that the distance from an origin in the interior of R to the boundary is a low degree trigonometric expansion in the space angles
3 editions published in 1974 in English and held by 4 WorldCat member libraries worldwide
One of the approaches to determine the global maximum of a multivariate function f(x) within a 'feasible region' R in the Euclidean nspace is based on the evaluation of the socalled functional moments of f(x), that is, the integrals (I sub k) = the integral over R of f(x) (sup k)dx for a sequence of integral k. This study is concerned with algorithms accomplishing this task in three special cases. The first case arises when f(x) is a multivariate polynomial and R is the n dimensional hypercube. In the second case, f(x) is a multivariate expansion into trigonometric functions and region R is the hypercube. Finally, third case is considered where f(x) is given by a multivariate polar expansion and R is a smooth convex region in the sense that the distance from an origin in the interior of R to the boundary is a low degree trigonometric expansion in the space angles
Expected mean squares in variance components models based on unbalanced data by Richard Francis Fawcett(
Book
)
1 edition published in 1970 in English and held by 3 WorldCat member libraries worldwide
Formulas are developed for calculating expected mean squares in variance components models whose effects, apart from the general mean, come from infinite populations. The formulas apply to models containing either balanced or unbalanced samples. A procedure is developed for extending these formulas to finite models (variance components models whose effects, apart from the general mean, come from balanced finite populations). The formulas apply to finite models containing either balanced or unbalanced sampled data. The procedure is modified slightly to allow for the calculation of expected mean squares in mixed models. The resulting estimators of the variance components of the random factors in the mixed model are biased however
1 edition published in 1970 in English and held by 3 WorldCat member libraries worldwide
Formulas are developed for calculating expected mean squares in variance components models whose effects, apart from the general mean, come from infinite populations. The formulas apply to models containing either balanced or unbalanced samples. A procedure is developed for extending these formulas to finite models (variance components models whose effects, apart from the general mean, come from balanced finite populations). The formulas apply to finite models containing either balanced or unbalanced sampled data. The procedure is modified slightly to allow for the calculation of expected mean squares in mixed models. The resulting estimators of the variance components of the random factors in the mixed model are biased however
CONVEX : a computer program for solving convex programs by
Texas A & M University(
Book
)
3 editions published in 1970 in English and held by 3 WorldCat member libraries worldwide
The report describes a computer program implementing the HartleyHocking convex programming algorithm. The two parts of this report are, respectively, a description of the HartleyHocking method as extracted from the original paper, and the documentation of the computer program
3 editions published in 1970 in English and held by 3 WorldCat member libraries worldwide
The report describes a computer program implementing the HartleyHocking convex programming algorithm. The two parts of this report are, respectively, a description of the HartleyHocking method as extracted from the original paper, and the documentation of the computer program
A tentative proposal for a shipping plan of bulk petroleum products by seagoing tankers by
H. O Hartley(
Book
)
2 editions published in 1970 in English and held by 3 WorldCat member libraries worldwide
In the study, an ocean shipping problem in fuel transportation is formulated mathematically as a twostage cost minimization problem. Linear programming methods are used in the first stage to find the cheapest way to ship the (p)th type product from the (i)th source to the (j)th destination in the (t)th period by a ship of type s. In the second stage, a tanker cargo algorithm is developed to satisfy cargo composition requirements and routing considerations. In the model, the objective is to minimize, subject to constraints, the purchase and shipping costs of all the fuels transported from all the sources to all the destinations in all of the time periods. Product requirements of all types at all destinations must be fulfilled. The amount of the (p)th product shipped to all destinations in all time periods on all types of ships cannot exceed the amount available at the (i)th source. There are three sets of shipping restrictions: (1) Shipments of type s to all destinations of all products cannot exceed the shipping capacity of that type available at source i in time period t; (2) the shipments in (1) in all time periods cannot exceed the shipping capacity of type s at source i (available in all time periods); and (3) the shipments in (2) originating from all sources cannot exceed the available shipping capacity of type s
2 editions published in 1970 in English and held by 3 WorldCat member libraries worldwide
In the study, an ocean shipping problem in fuel transportation is formulated mathematically as a twostage cost minimization problem. Linear programming methods are used in the first stage to find the cheapest way to ship the (p)th type product from the (i)th source to the (j)th destination in the (t)th period by a ship of type s. In the second stage, a tanker cargo algorithm is developed to satisfy cargo composition requirements and routing considerations. In the model, the objective is to minimize, subject to constraints, the purchase and shipping costs of all the fuels transported from all the sources to all the destinations in all of the time periods. Product requirements of all types at all destinations must be fulfilled. The amount of the (p)th product shipped to all destinations in all time periods on all types of ships cannot exceed the amount available at the (i)th source. There are three sets of shipping restrictions: (1) Shipments of type s to all destinations of all products cannot exceed the shipping capacity of that type available at source i in time period t; (2) the shipments in (1) in all time periods cannot exceed the shipping capacity of type s at source i (available in all time periods); and (3) the shipments in (2) originating from all sources cannot exceed the available shipping capacity of type s
A technique for maximum likelihood estimation in mixed models by William King Vaughn(
Book
)
1 edition published in 1970 in English and held by 3 WorldCat member libraries worldwide
A computer program is implemented which solves the likelihood equations arising from the general mixed analysis of variance model. A RungeKutta procedure is used to solve the system of first order differential equations resulting from the equations of steepest ascent. Because of the frequent evaluation of the right hand sides of these equations required when applying a fifth order RungeKutta technique, polynomial approximations to the equations of steepest ascent are used. The RungeKutta procedure is then applied to these approximations. Fully documented examples illustrating these techniques are given. Estimates of the variances and covariances of the maximum likelihood estimates are obtained from the inverse of the information matrix. The parameters appearing in the information matrix are replaced by the maximum likelihood estimates and the resulting matrix is inverted giving these estimates. Full documentation for the computer program is given
1 edition published in 1970 in English and held by 3 WorldCat member libraries worldwide
A computer program is implemented which solves the likelihood equations arising from the general mixed analysis of variance model. A RungeKutta procedure is used to solve the system of first order differential equations resulting from the equations of steepest ascent. Because of the frequent evaluation of the right hand sides of these equations required when applying a fifth order RungeKutta technique, polynomial approximations to the equations of steepest ascent are used. The RungeKutta procedure is then applied to these approximations. Fully documented examples illustrating these techniques are given. Estimates of the variances and covariances of the maximum likelihood estimates are obtained from the inverse of the information matrix. The parameters appearing in the information matrix are replaced by the maximum likelihood estimates and the resulting matrix is inverted giving these estimates. Full documentation for the computer program is given
Confidence regions for global optima in nonlinear programming by TaLin Liau(
Book
)
3 editions published in 1973 in English and held by 3 WorldCat member libraries worldwide
This dissertation is concerned with developing new statistical techniques for nonlinear optimization including nonconvex optimization. The approach is a statistical one and provides an upper confidence limit for the global maximum of a mathematical function g(x) of a vector x in a multidimensional 'feasible space', say S. Specifically the dissertation develops the statistical techniques for determining these confidence limits as well as algorithms implementing the techniques and computer programs executing the algorithms. From a statistical viewpoint the problem is one of determining an upper confidence limit for the upper limit of a finite range distribution given a sample from this distribution. The dissertation is therefore concerned predominantly with two issues: (a). the generation of the sample, and (b). the methods used to determine the upper confidence limit from the sample. Several techniques for generating the sample have been studied. In particular, we may single out the following sampling procedure. A random starting point, x₀, lying in the 'feasible space', S, is selected and an ascent algorithm is followed for k iterative steps leading to a point x₀[subscript k]. The corresponding 'sample value' generated is g₁ = g(x₀[subscript k]). This stochastic process is repeated n times leading to the desired sample g[subscript t], t = 1, ..., n. Various modifications of this procedure have also been investigated. Notable among these is the use of a set of L systematically and deterministically selected values of g(x), say g[superscript (j)], j = 1, ..., L. In which case the tth sample value, g[subscript (t)] is defined as the weighted average of these g[superscript (j)] and the tth observation of g(x₀[subscript k]).
3 editions published in 1973 in English and held by 3 WorldCat member libraries worldwide
This dissertation is concerned with developing new statistical techniques for nonlinear optimization including nonconvex optimization. The approach is a statistical one and provides an upper confidence limit for the global maximum of a mathematical function g(x) of a vector x in a multidimensional 'feasible space', say S. Specifically the dissertation develops the statistical techniques for determining these confidence limits as well as algorithms implementing the techniques and computer programs executing the algorithms. From a statistical viewpoint the problem is one of determining an upper confidence limit for the upper limit of a finite range distribution given a sample from this distribution. The dissertation is therefore concerned predominantly with two issues: (a). the generation of the sample, and (b). the methods used to determine the upper confidence limit from the sample. Several techniques for generating the sample have been studied. In particular, we may single out the following sampling procedure. A random starting point, x₀, lying in the 'feasible space', S, is selected and an ascent algorithm is followed for k iterative steps leading to a point x₀[subscript k]. The corresponding 'sample value' generated is g₁ = g(x₀[subscript k]). This stochastic process is repeated n times leading to the desired sample g[subscript t], t = 1, ..., n. Various modifications of this procedure have also been investigated. Notable among these is the use of a set of L systematically and deterministically selected values of g(x), say g[superscript (j)], j = 1, ..., L. In which case the tth sample value, g[subscript (t)] is defined as the weighted average of these g[superscript (j)] and the tth observation of g(x₀[subscript k]).
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Pearson, E. S. (Egon Sharpe) 18951980 Other Author Editor
 Greenwood, J. Arthur (Joseph Arthur) 1926 Author
 Cochran, William G. (William Gemmell) 19091980 Author Contributor
 Owen, D. B. (Donald Bruce) 1922 Editor
 Neyman, Jerzy 18941981 Contributor
 David, H. A. (Herbert Aron) 19252014 Editor
 Texas A & M University
 Hocking, R. R.
 Freund, R. J.
 TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS
Useful Links
Associated Subjects
American Statistical Association Beta functions Biology Biomathematics Biometry BiometryStatistical methods Calculators Calculus of variations Cochran, William G.(William Gemmell), Computer algorithms Critical path analysis Differential equations Distribution (Probability theory) Graph theory Hartley, H. O Iowa State University Mathematical optimization Mathematical statistics Mathematical statisticsTables Mathematics Moment problems (Mathematics) Nonconvex programming Nonlinear programming Numerical integration Order statistics PERT (Network analysis) PetroleumTransportationMathematical models Probabilities Production schedulingMathematical models Programming (Mathematics) Project managementMathematical models Sampling (Statistics) Statisticians Statistics United States United States.National Aeronautics and Space Administration Universities and collegesFaculty
Alternative Names
H. O. Hirschfeld
Hartley, H. O.
Hartley, H. O. 19121980
Hartley, Herman Otto
Hartley, Hermann Otto 19121980
Herman Otto Hartley Amerikaans wiskundige (19121980)
Herman Otto Hartley amerikansk matematikar
Herman Otto Hartley amerikansk matematiker
Herman Otto Hartley deutschamerikanischer Mathematiker
Hirschfeld, Hermann O.
Hirschfeld, Hermann O. 19121980
Hirschfeld, Hermann Otto
Hirschfeld, Hermann Otto 19121980
Languages