THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

The Design and Analysis of Experiments

Computational geometry


 The spectral ratio between horizontal and vertical components (H/V ratio) of microtremors measured at the ground surface has been used to estimate fundamental periods and amplification factors of a site, although this technique lacks theoretical background. The aim of this article is to formulate the H/V technique in terms of the characteristics of Rayleigh and Love waves, and to contribute to improve the technique. The improvement includes use of not only peaks but also troughs in the H/V ratio for reliable estimation of the period and use of a newly proposed smoothing function for better estimation of the amplification factor. The formulation leads to a simple formula for the amplification factor expressed with the H/V ratio. With microtremor data measured at 546 junior high schools in 23 wards of Tokyo, the improved technique is applied to mapping site periods and amplification factors in the area.

Ground Motion Characteristics Estimated from Spectral Ratio between Horizontal and Verticcl Components of Mietremors.

The Women’s Empowerment in Agriculture Index (WEAI) is a new survey-based index designed to measure the empowerment, agency, and inclusion of women in the agricultural sector. The WEAI was initially developed as a tool to reflect women’s empowerment that may result from the United States government’s Feed the Future Initiative, which commissioned the development of the WEAI. The WEAI can also be used more generally to assess the state of empowerment and gender parity in agriculture, to identify key areas in which empowerment needs to be strengthened, and to track progress over time. The WEAI is an aggregate index, reported at the country or regional level, based on individual-level data collected by interviewing men and women within the same households. The WEAI comprises two subindexes. The first assesses the degree to which women are empowered in five domains of empowerment (5DE) in agriculture. It reflects the percentage of women who are empowered and, among those who are not, the percentage of domains in which women enjoy adequate achievements. These domains are (1) decisions about agricultural production, (2) access to and decisionmaking power about productive resources, (3) control of use of income, (4) leadership in the community, and (5) time allocation. The second subindex (the Gender Parity Index [GPI]) measures gender parity. The GPI reflects the percentage of women who are empowered or whose achievements are at least as high as the men in their households. For those households that have not achieved gender parity, the GPI shows the empowerment gap that needs to be closed for women to reach the same level of empowerment as men. This technical paper documents the development of the WEAI and presents pilot data from Bangladesh, Guatemala, and Uganda, so that researchers and practitioners seeking to use the index in their own work would understand how the survey questionnaires were developed and piloted, how the qualitative case studies were undertaken, how the index was constructed, how various indicators were validated, and how it can be used in other settings.

/pdf/the-women-s-empowerment-in-agriculture-index-2a8n81bl0r.pdf

The Women's Empowerment in Agriculture Index

We give a deterministic algorithm for triangulating a simple polygon in linear time. The basic strategy is to build a coarse approximation of a triangulation in a bottom-up phase and then use the information computed along the way to refine the triangulation in a top-down phase. The main tools used are the polygon-cutting theorem, which provides us with a balancing scheme, and the planar separator theorem, whose role is essential in the discovery of new diagonals. Only elementary data structures are required by the algorithm. In particular, no dynamic search trees, of our algorithm.

Triangulating a simple polygon in linear time

The book presents the important fundamental theorems and algorithms on planar graph drawing with easy-to-understand and constructive proofs. Extensively illustrated and with exercises included at the end of each chapter, it is suitable for use in advanced undergraduate and graduate level courses on algorithms, graph theory, graph drawing, information visualization and computational geometry. The book will also serve as a useful reference source for researchers in the field of graph drawing and software developers in information visualization, VLSI design and CAD.

Planar graph drawing

Basic Graph Theory

An orthogonal drawing of a plane graph G is a drawing of G in which each edge is drawn as a sequence of alternate horizontal and vertical line segments. In this paper we give a linear-time algorithm to nd an orthogonal drawing of a given 3-connected cubic plane graph with the minimum number of bends. The best previously known algorithm takes time O(n 7=4 p logn) for any plane graph with n vertices.

/pdf/a-linear-algorithm-for-bend-optimal-orthogonal-drawings-of-3p7p9x3fj5.pdf

A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs

The rectangular grid drawing of a plane graph G is a drawing of G such that each vertex is located on a grid point, each edge is drawn as a horizontal or vertical line segment, and the contour of each face is drawn as a rectangle. In this paper we give a simple linear-time algorithm to find a rectangular grid drawing of G if it exists. We also give an upper bound W + H ≤ n2 on the sum of required width W and height H and a bound W H ≤ n216 on the area of a rectangular grid drawing of G, where n is the number of vertices in G. These bounds are best possible, and hold for any compact rectangular grid drawing.

Md. Saidur Rahman

Papers

Planar graph drawing

Basic Graph Theory

A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs

Rectangular grid drawings of plane graphs

Orthogonal Drawings of Plane Graphs Without Bends