Book picks similar to
A Second Course in Stochastic Processes by Samuel Karlin
mathematics
stochastic
male
partly-read
Linear Algebra With Applications
Steven J. Leon - 1980
Each chapter contains integrated worked examples and chapter tests. This edition has the ancillary ATLAST computer exercise guide and new MATLAB and Maple guides.
Solving Mathematical Problems: A Personal Perspective
Terence Tao - 2006
Covering number theory, algebra, analysis, Euclidean geometry, and analytic geometry, Solving Mathematical Problems includes numerous exercises and model solutions throughout. Assuming only a basic level of mathematics, the text is ideal for students of 14 years and above in pure mathematics.
Probability For Dummies
Deborah J. Rumsey - 2006
This book helps you even the odds. Using easy-to-understand explanations and examples, it demystifies probability -- and even offers savvy tips to boost your chances of gambling success Discover how to* Conquer combinations and permutations* Understand probability models from binomial to exponential* Make good decisions using probability* Play the odds in poker, roulette, and other games
Math Girls
Hiroshi Yuki - 2007
Love is.Currently in its eighteenth printing in Japan, this best-selling novel is available in English at last. Combining mathematical rigor with light romance, Math Girls is a unique introduction to advanced mathematics, delivered through the eyes of three students as they learn to deal with problems seldom found in textbooks. Math Girls has something for everyone, from advanced high school students to math majors and educators.
The H. Beam Piper Megapack: 33 Classic Science Fiction Novels and Short Stories
H. Beam Piper - 2013
BEAM PIPER MEGAPACK collects 33 novels, novellas, and short stories by H. Beam Piper, including such classics as LITTLE FUZZY, SPACE VIKING, and "He Walked Around the Horses."Complete contents:Introduction: Meet H. Beam PiperTime and Time Again (1947) He Walked around the Horses (1948) Police Operation (1948) The Mercenaries (1950) Last Enemy (1950) Flight from Tomorrow (1950) Operation R.S.V.P. (1951) Dearest (1951) Temple Trouble (1951) Genesis (1951) Day of the Moron (1951) Uller Uprising (1952) Null-ABC (1953) The Return (1954) Time Crime (1955) Omnilingual (1957) The Edge of the Knife (1957) The Keeper (1957) Lone Star Planet (1958) Graveyard of Dreams (1958) Ministry of Disturbance (1958) Hunter Patrol (1959) Crossroads of Destiny (1959) The Answer (1959) Four-day Planet (1961) Oomphel in the Sky (1960) Naudsonce (1962) Little Fuzzy (1962) A Slave Is a Slave (1962) Space Viking (1962) The Cosmic Computer (1963) Other Works (Not Science Fiction):Rebel Raider (1950) Murder in the Gunroom (1953)Note: This is version 3.0 of this ebook, and corrects a number of typos from previous versions.
Applied Cryptography: Protocols, Algorithms, and Source Code in C
Bruce Schneier - 1993
… The book the National Security Agency wanted never to be published." –Wired Magazine "…monumental… fascinating… comprehensive… the definitive work on cryptography for computer programmers…" –Dr. Dobb's Journal"…easily ranks as one of the most authoritative in its field." —PC Magazine"…the bible of code hackers." –The Millennium Whole Earth CatalogThis new edition of the cryptography classic provides you with a comprehensive survey of modern cryptography. The book details how programmers and electronic communications professionals can use cryptography—the technique of enciphering and deciphering messages-to maintain the privacy of computer data. It describes dozens of cryptography algorithms, gives practical advice on how to implement them into cryptographic software, and shows how they can be used to solve security problems. Covering the latest developments in practical cryptographic techniques, this new edition shows programmers who design computer applications, networks, and storage systems how they can build security into their software and systems. What's new in the Second Edition? * New information on the Clipper Chip, including ways to defeat the key escrow mechanism * New encryption algorithms, including algorithms from the former Soviet Union and South Africa, and the RC4 stream cipher * The latest protocols for digital signatures, authentication, secure elections, digital cash, and more * More detailed information on key management and cryptographic implementations
On Formally Undecidable Propositions of Principia Mathematica and Related Systems
Kurt Gödel - 1992
Kurt Giidel maintained, and offered detailed proof, that in any arithmetic system, even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. It is thus uncertain that the basic axioms of arithmetic will not give rise to contradictions. The repercussions of this discovery are still being felt and debated in 20th-century mathematics.The present volume reprints the first English translation of Giidel's far-reaching work. Not only does it make the argument more intelligible, but the introduction contributed by Professor R. B. Braithwaite (Cambridge University}, an excellent work of scholarship in its own right, illuminates it by paraphrasing the major part of the argument.This Dover edition thus makes widely available a superb edition of a classic work of original thought, one that will be of profound interest to mathematicians, logicians and anyone interested in the history of attempts to establish axioms that would provide a rigorous basis for all mathematics. Translated by B. Meltzer, University of Edinburgh. Preface. Introduction by R. B. Braithwaite.
Problem-Solving Strategies
Arthur Engel - 1997
The discussion of problem solving strategies is extensive. It is written for trainers and participants of contests of all levels up to the highest level: IMO, Tournament of the Towns, and the noncalculus parts of the Putnam Competition. It will appeal to high school teachers conducting a mathematics club who need a range of simple to complex problems and to those instructors wishing to pose a "problem of the week", "problem of the month", and "research problem of the year" to their students, thus bringing a creative atmosphere into their classrooms with continuous discussions of mathematical problems. This volume is a must-have for instructors wishing to enrich their teaching with some interesting non-routine problems and for individuals who are just interested in solving difficult and challenging problems. Each chapter starts with typical examples illustrating the central concepts and is followed by a number of carefully selected problems and their solutions. Most of the solutions are complete, but some merely point to the road leading to the final solution. Very few problems have no solutions. Readers interested in increasing the effectiveness of the book can do so by working on the examples in addition to the problems thereby increasing the number of problems to over 1300. In addition to being a valuable resource of mathematical problems and solution strategies, this volume is the most complete training book on the market.
The Taming Of Chance
Ian Hacking - 1990
Professor Hacking shows how by the late nineteenth century it became possible to think of statistical patterns as explanatory in themselves, and to regard the world as not necessarily deterministic in character. Combining detailed scientific historical research with characteristic philosophic breath and verve, The Taming of Chance brings out the relations among philosophy, the physical sciences, mathematics and the development of social institutions, and provides a unique and authoritative analysis of the probabilization of the Western world.
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael R. Garey - 1979
Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.
Symmetry
Hermann Weyl - 1952
Hermann Weyl explores the concept of symmetry beginning with the idea that it represents a harmony of proportions, and gradually departs to examine its more abstract varieties and manifestations--as bilateral, translatory, rotational, ornamental, and crystallographic. Weyl investigates the general abstract mathematical idea underlying all these special forms, using a wealth of illustrations as support. Symmetry is a work of seminal relevance that explores the great variety of applications and importance of symmetry.
Essential Keats: Selected by Philip Levine
John Keats - 1987
He remains a wellspring to which all of us might go to refresh our belief in the value of this art.
Libellus de Numeros
Jim West - 2014
With a cruel council leading the only safe city of it's kind in this world, she will have to prove her worth to stay as well as help this city as it is the target for two evil wizards who seek to destroy the city and it's ruling council.Will the council's mighty army of guardians be enough to repel the onslaught of the two wizards' wrath?To help the city and also get back home, she will need the help of the greatest mathematician of all time, Archimedes. In a world where math is magic, Alex wishes she paid more attention in math class.
Psychology
Peter O. Gray - 1991
Peter Gray's Psychology has become a favorite of instructors with its exploration of psychology's major theories, and the evidence that supports and refutes these theories. Each edition incorporates an exceptional amount of contemporary research, encouraging students to probe for the purposes and biological origins of behavior--the "whys" and "hows" of human psychology. Peter Gray's engaging, readable writing style makes the science of psychology, and its interactions with biology, accessible and meaningful. With the new edition, Gray has taken care to ensure that his comprehensive, thought-provoking, and contemporary coverage is well-attuned to the needs and interests of today's students.
A Course of Pure Mathematics
G.H. Hardy - 1908
Since its publication in 1908, it has been a classic work to which successive generations of budding mathematicians have turned at the beginning of their undergraduate courses. In its pages, Hardy combines the enthusiasm of a missionary with the rigor of a purist in his exposition of the fundamental ideas of the differential and integral calculus, of the properties of infinite series and of other topics involving the notion of limit.