Muutke küpsiste eelistusi

E-raamat: Computational Probability: Algorithms and Applications in the Mathematical Sciences

  • Formaat - EPUB+DRM
  • Hind: 135,23 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This new edition includes the latest advances and developments in computational probability involving A Probability Programming Language (APPL). The book examines and presents, in a systematic manner, computational probability methods that encompass data structures and algorithms. The developed techniques address problems that require exact probability calculations, many of which have been considered intractable in the past. The book addresses the plight of the probabilist by providing algorithms to perform calculations associated with random variables. 

Computational Probability: Algorithms and Applications in the Mathematical Sciences, 2nd Edition begins with an introductory chapter that contains short examples involving the elementary use of APPL. Chapter 2 reviews the Maple data structures and functions necessary to implement APPL. This is followed by a discussion of the development of the data structures and algorithms (Chapters 3–6 for continuous random variables and Chapters 7–9 for discrete random variables) used in APPL. The book concludes with Chapters 10–15 introducing a sampling of various applications in the mathematical sciences. This book should appeal to researchers in the mathematical sciences with an interest in applied probability and instructors using the book for a special topics course in computational probability taught in a mathematics, statistics, operations research, management science, or industrial engineering department.
1 Computational Probability
3(10)
1.1 Four Simple Examples of the Use of APPL
3(5)
1.2 A Different Way of Thinking
8(3)
1.3 Overview
11(2)
2 Maple for APPL
13(20)
2.1 Numerical Computations
13(2)
2.2 Variables
15(1)
2.3 Symbolic Computations
16(1)
2.4 Functions
17(2)
2.5 Data Types
19(1)
2.6 Solving Equations
20(2)
2.7 Graphing
22(1)
2.8 Calculus
23(3)
2.9 Loops and Conditions
26(2)
2.10 Procedures
28(5)
Part II Algorithms for Continuous Random Variables
3 Data Structures and Simple Algorithms
33(14)
3.1 Data Structures
33(4)
3.2 Simple Algorithms
37(10)
4 Transformations of Random Variables
47(10)
4.1 Theorem
48(2)
4.2 Implementation in APPL
50(2)
4.3 Examples
52(5)
5 Bivariate Transformations of Random Variables
57(16)
5.1 Algorithm
58(1)
5.2 Data Structure
59(1)
5.3 Implementation
60(2)
5.4 Examples
62(11)
6 Products of Random Variables
73(16)
6.1 Theorem
74(2)
6.2 Implementation in APPL
76(3)
6.3 Examples
79(3)
6.4 Extensions
82(2)
6.5 Algorithm
84(5)
Part III Algorithms for Discrete Random Variables
7 Data Structures and Simple Algorithms
89(22)
7.1 Data Structures
89(10)
7.2 Simple Algorithms
99(12)
8 Sums of Independent Discrete Random Variables
111(28)
8.1 Preliminary Examples
111(5)
8.2 Conceptual Algorithm Development
116(10)
8.3 Algorithm
126(2)
8.4 Implementation Issues
128(2)
8.5 Examples
130(9)
9 Order Statistics for Random Sampling from Discrete Populations
139(16)
9.1 Notation and Taxonomy
139(2)
9.2 Sampling Without Replacement
141(4)
9.3 Sampling with Replacement
145(5)
9.4 Extension
150(5)
Part IV Applications
10 Reliability and Survival Analysis
155(36)
10.1 Systems Analysis
155(6)
10.2 Lower Confidence Bound on System Reliability
161(3)
10.3 Survival Analysis
164(8)
10.4 Applying Bootstrap Methods to System Reliability
172(19)
11 Symbolic ARMA Model Analysis
191(18)
11.1 ARMA Model Basics
192(1)
11.2 Implementation
193(4)
11.3 Examples
197(12)
12 Stochastic Simulation
209(32)
12.1 Tests of Randomness
209(6)
12.2 Input Modeling
215(8)
12.3 Kolmogorov-Smirnov Goodness-of-Fit Test
223(18)
13 Transient Queueing Analysis
241(36)
13.1 Introduction
241(2)
13.2 Basics of the M/M/s Queue
243(1)
13.3 Creating the Sojourn Time Distribution
244(3)
13.4 Transient Analysis Applications
247(6)
13.5 Covariance and Correlation in the M/M/1 Queue
253(7)
13.6 Extending Covariance Calculations
260(9)
13.7 Sojourn Time Covariance with k Customers Initially Present...
269(8)
14 Bayesian Applications
277(24)
14.1 Introduction
277(2)
14.2 Bayesian Inference on Single-Parameter Distributions
279(8)
14.3 Bayesian Inference on Multiple-Parameter Distributions
287(14)
15 Other Applications
301(22)
15.1 Stochastic Activity Networks
301(9)
15.2 Benford's Law
310(5)
15.3 Miscellaneous Applications
315(8)
References 323(6)
Index 329
John Drew is a professor emeritus, retired in 2008 from the Department of Mathematics at The College of William & Mary in Williamsburg, Virginia, U.S.A. He received his BS in mathematics form Case Institute of Technology and his PhD in mathematics from the University of Minnesota. During his academic career he published 25 research papers in linear algebra, operations research, and computational probability. Dr. Diane Evans is a professor in the Mathematics Department at Rose-Hulman Institute of Technology in Terre Haute, U.S.A. She received her BS and MA degrees in mathematics from The Ohio State University and her MS and PhD in operations research and applied science from The College of William and Mary. Diane was named in Princeton Review's 300 Best Professors in America and was selected as one of Microsoft's 365 "Heroes in Education" in 2012. During her 2015 sabbatical, she worked for Minitab creating educational materials for new statistics instructors. Her current research and teaching interests are in probability, statistics, quality control, and Six Sigma.   Dr. Andrew Glen is a Professor Emeritus of Operations Research from the United States Military Academy, in West Point, NY. He is currently a visiting professor at The Colorado College in Colorado Springs, Colorado. He is a retired colonel from the US Army, and spend 16 years on faculty at West Point. He has published three books and dozens of scholarly articles, mostly on the subject of computational probability. His research and teaching interests are in computational probability and statistical modeling. 

Lawrence Leemis is a professor in the Department of Mathematics at The College of William & Mary in Williamsburg, Virginia, U.S.A. He received his BS and MS degrees in mathematics and his PhD in operations research from Purdue University. He has also taught courses at Purdue University, The University of Oklahoma, and Baylor University. He has served as Associate Editor for the IEEE Transactions on Reliability, Book Review Editor for the Journal of Quality Technology, and an Associate Editor for Naval Research Logistics. He has published six books and over 100 research articles, proceedings papers, and book chapters. His research and teaching interests are in reliability, simulation, and computational probability.