John T. Saccoman - Böcker
Visar alla böcker från författaren John T. Saccoman. Handla med fri frakt och snabb leverans.
5 produkter
5 produkter
1 417 kr
Skickas inom 7-10 vardagar
Linear Algebra: Algorithms, Applications, and Techniques, Fourth Edition offers a modern and algorithmic approach to computation while providing clear and straightforward theoretical background information. The book guides readers through the major applications, with chapters on properties of real numbers, proof techniques, matrices, vector spaces, linear transformations, eigen values, and Euclidean inner products. Appendices on Jordan canonical forms and Markov chains are included for further study. This useful textbook presents broad and balanced views of theory, with key material highlighted and summarized in each chapter. To further support student practice, the book also includes ample exercises with answers and hints. Introduces deductive reasoning and helps the reader develop a facility with mathematical proofs Provides a balanced approach to computation and theory by offering computational algorithms for finding eigenvalues and eigenvectors Offers excellent exercise sets, ranging from drill to theoretical/challenging, along with useful and interesting applications not found in other introductory linear algebra texts
355 kr
Skickas inom 5-8 vardagar
The past 30 years have seen an explosion in the number and variety of baseball books and articles. Following the lead of pioneers Bill James, John Thorn, and Pete Palmer, researchers have steadily challenged the ways we think about player and team performance--and along the way revised what we thought we knew of baseball history.This book by the authors of Understanding Sabermetrics (2008) goes beyond the explanation of new statistics to demonstrate their use in solving some of the more familiar problems of baseball research, such as how to compare players across generations; how to account for the effects of ballparks and rules changes; and how to measure the effectiveness of the sacrifice bunt or the range of the Gold Glove-winning shortstop.Instructors considering this book for use in a course may request an examination copy here.
Reasoning with Sabermetrics
Applying Statistical Science to Baseball's Tough Questions
Häftad, Engelska, 2012
377 kr
Skickas inom 5-8 vardagar
Sabermetrics, the specialized analysis of baseball through empirical evidence, provides an impartial perspective from which to explore the game. In this work, the third in a series, three mathematicians employ statistical science in an attempt to answer some of baseball's toughest questions. For instance, how good were the 1961 New York Yankees? How bad were the 1962 Mets? Which team was the best of the Deadball Era? They also strive to determine baseball's greatest player at various positions. Throughout, the objective evidence allows for debate devoid of emotion and personal biases, providing a fresh, balanced evaluation of these and many other challenging questions.Instructors considering this book for use in a course may request an examination copy here.
Understanding Sabermetrics
An Introduction to the Science of Baseball Statistics, 2d ed.
Häftad, Engelska, 2019
355 kr
Skickas inom 5-8 vardagar
Interest in Sabermetrics has increased dramatically in recent years as the need to better compare baseball players has intensified among managers, agents and fans, and even other players. The authors explain how traditional measures--such as Earned Run Average, Slugging Percentage, and Fielding Percentage--along with new statistics--Wins Above Average, Fielding Independent Pitching, Wins Above Replacement, the Equivalence Coefficient and others--define the value of players.Actual player statistics are used in developing models, while examples and exercises are provided in each chapter. This book serves as a guide for both beginners and those who wish to be successful in fantasy leagues.
Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach
Inbunden, Engelska, 2014
1 115 kr
Skickas inom 5-8 vardagar
This book is concerned with the optimization problem of maximizing the number of spanning trees of a multigraph. Since a spanning tree is a minimally connected subgraph, graphs and multigraphs having more of these are, in some sense, immune to disconnection by edge failure. We employ a matrix-theoretic approach to the calculation of the number of spanning trees.The authors envision this as a research aid that is of particular interest to graduate students or advanced undergraduate students and researchers in the area of network reliability theory. This would encompass graph theorists of all stripes, including mathematicians, computer scientists, electrical and computer engineers, and operations researchers.