A nonmeasure theoretic introduction to stochastic processes. Considers its diverse range of applications and provides readers with probabilistic intuition and insight in thinking about problems. This revised edition contains additional material on compound Poisson random variables including an identity which can be used to efficiently compute moments; a new chapter on Poisson approximations; and coverage of the mean time spent in transient states as well as examples relating to the Gibb's sampler, the Metropolis algorithm and mean cover time in star graphs. Numerous exercises and problems have been added throughout the text.

The major creations and developments in mathematics from the beginnings in Babylonia and Egypt through the first few decades of the twentieth century are presented with clarity and precision in this comprehensive historical study.

Balancing conceptual and applied coverage of all aspects of the management and operation of services, "Service Management" has maintained the position as market leader through five previous editions. It is the most comprehensive and widely used introduction to service operations on the market, written by one of the top authorities on the subject, and it is designed to develop students' skills in both strategic and operational issues pertaining to services.New material on Professional Service Firms highlights IBM's initiative to establish a Service Science, Management, and Engineering discipline. The Sixth Edition also offers the latest information on Six-Sigma and RFID, as well as recent developments in other important industry topics. Text coverage spans both qualitative and quantitative aspects of service management and offers flexibility in courses, offering varying approaches to the study of service operations. The ancillary package includes student CD-ROM and Website that includes self-test quizzes, video clips, ServiceModel Software, and the Mortgage Service Game.

In this substantive yet accessible book, pioneering software designer Alexander Stepanov and his colleague Daniel Rose illuminate the principles of generic programming and the mathematical concept of abstraction on which it is based, helping you write code that is both simpler and more powerful.
If you’re a reasonably proficient programmer who can think logically, you have all the background you’ll need. Stepanov and Rose introduce the relevant abstract algebra and number theory with exceptional clarity. They carefully explain the problems mathematicians first needed to solve, and then show how these mathematical solutions translate to generic programming and the creation of more effective and elegant code. To demonstrate the crucial role these mathematical principles play in many modern applications, the authors show how to use these results and generalized algorithms to implement a real-world public-key cryptosystem.
As you read this book, you’ll master the thought processes necessary for effective programming and learn how to generalize narrowly conceived algorithms to widen their usefulness without losing efficiency. You’ll also gain deep insight into the value of mathematics to programming–insight that will prove invaluable no matter what programming languages and paradigms you use.
You will learn about
How to generalize a four thousand-year-old algorithm, demonstrating indispensable lessons about clarity and efficiency
Ancient paradoxes, beautiful theorems, and the productive tension between continuous and discrete
A simple algorithm for finding greatest common divisor (GCD) and modern abstractions that build on it
Powerful mathematical approaches to abstraction
How abstract algebra provides the idea at the heart of generic programming
Axioms, proofs, theories, and models: using mathematical techniques to organize knowledge about your algorithms and data structures
Surprising subtleties of simple programming tasks and what you can learn from them
How practical implementations can exploit theoretical knowledge

This book builds theoretical statistics from the first principles of probability theory. Starting from the basics of probability, the authors develop the theory of statistical inference using techniques, definitions, and concepts that are statistical and are natural extensions and consequences of previous concepts. Intended for first-year graduate students, this book can be used for students majoring in statistics who have a solid mathematics background. It can also be used in a way that stresses the more practical uses of statistical theory, being more concerned with understanding basic statistical concepts and deriving reasonable statistical procedures for a variety of situations, and less concerned with formal optimality investigations.

....The most comprehensive guide to designing practical and efficient algorithms....
Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this new edition of The Algorithm Design Manual is an essential learning tool for students needing a solid grounding in algorithms, as well as a special text/reference for professionals who need an authoritative and insightful guide. Professor Skiena is also author of the popular Springer text, Programming Challenges: The Programming Contest Training Manual.

Here's a systems engineering-level introduction to the growing field of information Warfare (IW) -- the battlefield where information is both target and weapon.

Product Description
Eminently suited to classroom use as well as individual study, Roger Myerson's introductory text provides a clear and thorough examination of the models, solution concepts, results, and methodological principles of noncooperative and cooperative game theory. Myerson introduces, clarifies, and synthesizes the extraordinary advances made in the subject over the past fifteen years, presents an overview of decision theory, and comprehensively reviews the development of the fundamental models: games in extensive form and strategic form, and Bayesian games with incomplete information.
Game Theory will be useful for students at the graduate level in economics, political science, operations research, and applied mathematics. Everyone who uses game theory in research will find this book essential.

That at London the hospitals are better and more desirable than those of Paris, for that in the best at Paris there die two out of fifteen, whereas at London there die out of the worst scarce 2 out of 16, and yet but a fiftieth part of the whole die out of the hospitals at London, and two-fifths, or twenty times that proportion die out of the Paris hospitals which are of the same kind; that is to say, the number of those at London, who choose to lie sick in hospitals rather than in their own houses, are to the like people of Paris as one to twenty; which shows the greater poverty or want of means in the people of Paris than those of London.

This is the 2nd edition of "Speech and Language Processing, 2000" (http://www.douban.com/subject/1810715/).
An explosion of Web-based language techniques, merging of distinct fields, availability of phone-based dialogue systems, and much more make this an exciting time in speech and language processing. The first of its kind to thoroughly cover language technology – at all levels and with all modern technologies – this book takes an empirical approach to the subject, based on applying statistical and other machine-learning algorithms to large corporations. Builds each chapter around one or more worked examples demonstrating the main idea of the chapter, usingthe examples to illustrate the relative strengths and weaknesses of various approaches. Adds coverage of statistical sequence labeling, information extraction, question answering and summarization, advanced topics in speech recognition, speech synthesis. Revises coverage of language modeling, formal grammars, statistical parsing, machine translation, and dialog processing. A useful reference for professionals in any of the areas of speech and language processing.