An introduction to state-of-the-art experimental design approaches to better understand and interpret repeated measurement data in cross-over designs. Repeated Measurements and Cross-Over Designs: Features the close tie between the design, analysis, and presentation of results Presents principles and rules that apply very generally to most areas of research, such as clinical trials, agricultural investigations, industrial procedures, quality control procedures, and epidemiological studies Includes many practical examples, such as PK/PD studies in the pharmaceutical industry, k-sample and one sample repeated measurement designs for psychological studies, and residual effects of different treatments in controlling conditions such as asthma, blood pressure, and diabetes. Utilizes SAS(R) software to draw necessary inferences. All SAS output and data sets are available via the book's related website. This book is ideal for a broad audience including statisticians in pre-clinical research, researchers in psychology, sociology, politics, marketing, and engineering.

Combinatorics has come of age. It had its beginnings in a number of puzzles which have still not lost their charm. Among these are EULER'S problem of the 36 officers and the KONIGSBERG bridge problem, BACHET's problem of the weights, and the Reverend T.P. KIRKMAN'S problem of the schoolgirls. Many of the topics treated in ROUSE BALL'S Recreational Mathe matics belong to combinatorial theory. All of this has now changed. The solution of the puzzles has led to a large and sophisticated theory with many complex ramifications. And it seems probable that the four color problem will only be solved in terms of as yet undiscovered deep results in graph theory. Combinatorics and the theory of numbers have much in common. In both theories there are many prob lems which are easy to state in terms understandable by the layman, but whose solution depends on complicated and abstruse methods. And there are now interconnections between these theories in terms of which each enriches the other. Combinatorics includes a diversity of topics which do however have interrelations in superficially unexpected ways. The instructional lectures included in these proceedings have been divided into six major areas: 1. Theory of designs; 2. Graph theory; 3. Combinatorial group theory; 4. Finite geometry; 5. Foundations, partitions and combinatorial geometry; 6. Coding theory. They are designed to give an overview of the classical foundations of the subjects treated and also some indication of the present frontiers of research.

The International Conference on Linear Statistical Inference LINSTAT'93 was held in Poznan, Poland, from May 31 to June 4, 1993. The purpose of the confer ence was to enable scientists, from various countries, engaged in the diverse areas of statistical sciences and practice to meet together and exchange views and re sults related to the current research on linear statistical inference in its broadest sense. Thus, the conference programme included sessions on estimation, prediction and testing in linear models, on robustness of some relevant statistical methods, on estimation of variance components appearing in linear models, on certain gen eralizations to nonlinear models, on design and analysis of experiments, including optimality and comparison of linear experiments, and on some other topics related to linear statistical inference. Within the various sessions 22 invited papers and 37 contributed papers were presented, 12 of them as posters. The conference gathered 94 participants from eighteen countries of Europe, North America and Asia. There were 53 participants from abroad and 41 from Poland. The conference was the second of this type, devoted to linear statistical inference. The first was held in Poznan in June, 4-8, 1984. Both belong to the series of confer ences on mathematical statistics and probability theory organized under the auspices of the Committee of Mathematics of the Polish Academy of Sciences, due to the ini tiative and efforts of its Mathematical Statistics Section. In the years 1973-1993 there were held in Poland nineteen such conferences, some of them international.

A Survey of Combinatorial Theory covers the papers presented at the International Symposium on Combinatorial Mathematics and its Applications, held at Colorado State University (CSU), Fort Collins, Colorado on September 9-11, 1971. The book focuses on the principles, operations, and approaches involved in combinatorial theory, including the Bose-Nelson sorting problem, Golay code, and Galois geometries. The selection first ponders on classical and modern topics in finite geometrical structures; balanced hypergraphs and applications to graph theory; and strongly regular graph derived from the perfect ternary Golay code. Discussions focus on perfect ternary Golay code, finite projective and affine planes, Galois geometries, and other geometric structures. The book then examines the characterization problems of combinatorial graph theory, line-minimal graphs with cyclic group, circle geometry in higher dimensions, and Cayley diagrams and regular complex polygons. The text discusses combinatorial problems in finite Abelian groups, dissection graphs of planar point sets, combinatorial problems and results in fractional replication, Bose-Nelson sorting problem, and some combinatorial aspects of coding theory. The text also reviews the enumerative theory of planar maps, balanced arrays and orthogonal arrays, existence of resolvable block designs, and combinatorial problems in communication networks. The selection is a valuable source of information for mathematicians and researchers interested in the combinatorial theory.

The book is composed of two volumes, each consisting of five chapters. In Vol ume I, following some statistical motivation based on a randomization model, a general theory of the analysis of experiments in block designs has been de veloped. In the present Volume II, the primary aim is to present methods of that satisfy the statistical requirements described in constructing block designs Volume I, particularly those considered in Chapters 3 and 4, and also to give some catalogues of plans of the designs. Thus, the constructional aspects are of predominant interest in Volume II, with a general consideration given in Chapter 6. The main design investigations are systematized by separating the material into two contents, depending on whether the designs provide unit efficiency fac tors for some contrasts of treatment parameters (Chapter 7) or not (Chapter 8). This distinction in classifying block designs may be essential from a prac tical point of view. In general, classification of block designs, whether proper or not, is based here on efficiency balance (EB) in the sense of the new termi nology proposed in Section 4. 4 (see, in particular, Definition 4. 4. 2). Most of the attention is given to connected proper designs because of their statistical advantages as described in Volume I, particularly in Chapter 3. When all con trasts are of equal importance, either the class of (v - 1; 0; O)-EB designs, i. e.

Design theory is a branch of combinatorics with applications in number theory, coding theory and geometry. In this book the authors discuss the generalization of results and applications to quasi-symmetric designs. The coverage is comprehensive and will be useful for researchers and graduate students. An attractive feature is the discussion of unsolved problems.