Muutke küpsiste eelistusi

Introduction to Modeling for Biosciences 2010 [Kõva köide]

  • Formaat: Hardback, 322 pages, kõrgus x laius x paksus: 234x156x19 mm, kaal: 1430 g, biography
  • Ilmumisaeg: 11-Aug-2010
  • Kirjastus: Springer London Ltd
  • ISBN-10: 1849963258
  • ISBN-13: 9781849963251
Teised raamatud teemal:
  • Kõva köide
  • Hind: 67,19 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 79,05 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Hardback, 322 pages, kõrgus x laius x paksus: 234x156x19 mm, kaal: 1430 g, biography
  • Ilmumisaeg: 11-Aug-2010
  • Kirjastus: Springer London Ltd
  • ISBN-10: 1849963258
  • ISBN-13: 9781849963251
Teised raamatud teemal:
Mathematical modeling can be a useful tool for researchers in the biological scientists. Yet in biological modeling there is no one modeling technique that is suitable for all problems. Instead, different problems call for different approaches. Furthermore, it can be helpful to analyze the same system using a variety of approaches, to be able to exploit the advantages and drawbacks of each. In practice, it is often unclear which modeling approaches will be most suitable for a particular biological question, a problem which requires researchers to know a reasonable amount about a number of techniques, rather than become experts on a single one. "Introduction to Modeling for Biosciences" addresses this issue by presenting a broad overview of the most important techniques used to model biological systems. In addition to providing an introduction into the use of a wide range of software tools and modeling environments, this helpful text/reference describes the constraints and difficulties that each modeling technique presents in practice, enabling the researcher to quickly determine which software package would be most useful for their particular problem. Topics and features: introduces a basic array of techniques to formulate models of biological systems, and to solve them; intersperses the text with exercises throughout the book; includes practical introductions to the Maxima computer algebra system, the PRISM model checker, and the Repast Simphony agent modeling environment; discusses agent-based models, stochastic modeling techniques, differential equations and Gillespie's stochastic simulation algorithm; contains appendices on Repast batch running, rules of differentiation and integration, Maxima and PRISM notation, and some additional mathematical concepts; supplies source code for many of the example models discussed, at the associated website http://www.cs.kent.ac.uk/imb/. This unique and practical guide leads the novice modeler through realistic and concrete modeling projects, highlighting and commenting on the process of abstracting the real system into a model. Students and active researchers in the biosciences will also benefit from the discussions of the high-quality, tried-and-tested modeling tools described in the book. Dr. David J. Barnes is a lecturer in computer science at the University of Kent, UK, with a strong background in the teaching of programming. Dr. Dominique Chu is a lecturer in computer science at the University of Kent, UK. He is an internationally recognized expert in agent-based modeling, and has also in-depth research experience in stochastic and differential equation based modeling.

Arvustused

From the reviews: "The intersection of biological and computational sciences is well served by this clear, well-written, and interesting guide to the variety of methods currently being used to formulate computational models for biological systems. ... the book very accessible to a wide range of readers--from students to experienced researchers--from a variety of backgrounds. ... Thus, this volume is very timely. ... Overall, this book is an excellent and approachable introduction to biological modeling." (Sara Kalvala, ACM Computing Reviews, May, 2011)

1 Foundations of Modeling 1(14)
1.1 Simulation vs. Analytic Results
3(2)
1.2 Stochastic vs. Deterministic Models
5(1)
1.3 Fundamentals of Modeling
6(5)
1.4 Validity and Purpose of Models
11(4)
2 Agent-Based Modeling 15(64)
2.1 Mathematical and Computational Modeling
15(6)
2.1.1 Limits to Modeling
17(4)
2.2 Agent-Based Models
21(9)
2.2.1 The Structure of ABMs
22(3)
2.2.2 Algorithms
25(1)
2.2.3 Time-Driven Algorithms
26(2)
2.2.4 Event-Driven Models
28(2)
2.3 Game of Life
30(4)
2.4 Malaria
34(12)
2.4.1 A Digression
37(2)
2.4.2 Stochastic Systems
39(4)
2.4.3 Immobile Agents
43(3)
2.5 General Consideration when Analyzing a Model
46(2)
2.5.1 How to Test ABMs9
47(1)
2.6 Case Study: The Evolution of Fimbriation
48(31)
2.6.1 Group Selection
49(2)
2.6.2 The Model
51(28)
3 ABMs Using Repast and Java 79(52)
3.1 The Basics of Agent-Based Modeling
80(3)
3.2 An Outline of Repast Concepts
83(4)
3.2.1 Contexts and Projections
84(2)
3.2.2 Model Parameterization
86(1)
3.3 The Game of Life in Repast S
87(23)
3.3.1 The model.score File
88(1)
3.3.2 The Agent Class
89(14)
3.3.3 The Model Initializer
103(1)
3.3.4 Summary of Model Creation
104(1)
3.3.5 Running the Model
105(1)
3.3.6 Creating a Display
106(1)
3.3.7 Creating an Agent Style Class
107(2)
3.3.8 Inspecting Agents at Runtime
109(1)
3.3.9 Review
109(1)
3.4 Malaria Model in Repast Using Java
110(21)
3.4.1 The Malaria Model
110(1)
3.4.2 The model.score File
111(1)
3.4.3 Commonalities in the Agent Types
112(1)
3.4.4 Building the Root Context
112(1)
3.4.5 Accessing Runtime Parameter Values
113(1)
3.4.6 Creating a Projection
114(1)
3.4.7 Implementing the Common Elements of the Agents
115(3)
3.4.8 Completing the Mosquito Agent
118(1)
3.4.9 Scheduling the Actions
119(1)
3.4.10 Visualizing the Model
120(1)
3.4.11 Charts
121(3)
3.4.12 Outputting Data
124(1)
3.4.13 A Statistics-Gathering Agent
124(3)
3.4.14 Summary of Concepts Relating to the Malaria Model
127(1)
3.4.15 Running Repast Models Outside Eclipse
128(2)
3.4.16 Going Further with Repast S A
130(1)
4 Differential Equations 131(52)
4.1 Differentiation
131(10)
4.1.1 A Mathematical Example
136(3)
4.1.2 Digression
139(2)
4.2 Integration
141(3)
4.3 Differential Equations
144(10)
4.3.1 Limits to Growth
147(3)
4.3.2 Steady State
150(2)
4.3.3 Bacterial Growth Revisited
152(2)
4.4 Case Study: Malaria
154(12)
4.4.1 A Brief Note on Stability
161(5)
4.5 Chemical Reactions
166(11)
4.5.1 Michaelis-Menten and Hill Kinetics
168(5)
4.5.2 Modeling Gene Expression
173(4)
4.6 Case Study: Cherry and Adler's Bistable Switch
177(5)
4.7 Summary
182(1)
5 Mathematical Tools 183(32)
5.1 A Word of Warning: Pitfalls of CAS
183(2)
5.2 Existing Tools and Types of Systems
185(2)
5.3 Maxima: Preliminaries
187(2)
5.4 Maxima: Simple Sample Sessions
189(6)
5.4.1 The Basics
189(5)
5.4.2 Saving and Recalling Sessions
194(1)
5.5 Maxima: Beyond Preliminaries
195(14)
5.5.1 Solving Equations
196(2)
5.5.2 Matrices and Eigenvalues
198(2)
5.5.3 Graphics and Plotting
200(5)
5.5.4 Integrating and Differentiating
205(4)
5.6 Maxima: Case Studies
209(5)
5.6.1 Gene Expression
209(1)
5.6.2 Malaria
210(2)
5.6.3 Cherry and Adler's Bistable Switch
212(2)
5.7 Summary
214(1)
6 Other Stochastic Methods and Prism 215(58)
6.1 The Master Equation
217(8)
6.2 Partition Functions
225(11)
6.2.1 Preferences
227(4)
6.2.2 Binding to DNA
231(4)
6.2.3 Codon Bias in Proteins
235(1)
6.3 Markov Chains
236(10)
6.3.1 Absorbing Markov Chains
240(2)
6.3.2 Continuous Time Markov Chains
242(2)
6.3.3 An Example from Gene Activation
244(2)
6.4 Analyzing Markov Chains: Sample Paths
246(2)
6.5 Analyzing Markov Chains: Using PRISM
248(16)
6.5.1 The PRISM Modeling Language
249(2)
6.5.2 Running PRISM
251(6)
6.5.3 Rewards
257(4)
6.5.4 Simulation in PRISM
261(2)
6.5.5 The PRISM GUI
263(1)
6.6 Examples
264(9)
6.6.1 Fim Switching
265(3)
6.6.2 Stochastic Versions of a Differential Equation
268(2)
6.6.3 Tricks for PRISM Models
270(3)
7 Simulating Biochemical Systems 273(34)
7.1 The Gillespie Algorithms
273(11)
7.1.1 Gillespie's Direct Method
274(1)
7.1.2 Gillespie's First Reaction Method
275(1)
7.1.3 Java Implementation of the Direct Method
276(2)
7.1.4 A Single Reaction
278(1)
7.1.5 Multiple Reactions
279(2)
7.1.6 The Lotka-Volterra Equation
281(3)
7.2 The Gibson-Bruck Algorithm
284(5)
7.2.1 The Dependency Graph
285(1)
7.2.2 The Indexed Priority Queue
285(1)
7.2.3 Updating the r Values
286(2)
7.2.4 Analysis
288(1)
7.3 A Constant Time Method
289(4)
7.3.1 Selection Procedure
290(2)
7.3.2 Reaction Selection
292(1)
7.4 Practical Implementation Considerations
293(4)
7.4.1 Data Structures—The Dependency Tree
294(1)
7.4.2 Programming Techniques—Tree Updating
295(1)
7.4.3 Runtime Environment
296(1)
7.5 The Tau-Leap Method
297(1)
7.6 Dizzy
297(4)
7.7 Delayed Stochastic Models
301(2)
7.8 The Stochastic Genetic Networks Simulator
303(2)
7.9 Summary
305(2)
A Reference Material 307(10)
A.1 Repast Batch Running
307(1)
A.2 Some Common Rules of Differentiation and Integration
307(2)
A.2.1 Common Differentials
307(1)
A.2.2 Common Integrals
308(1)
A.3 Maxima Notation
309(1)
A.4 PRISM Notation Summary
310(1)
A.5 Some Mathematical Concepts
310(7)
A.5.1 Vectors and Matrices
310(3)
A.5.2 Probability
313(1)
A.5.3 Probability Distributions
314(1)
A.5.4 Taylor Expansion
315(2)
References 317(2)
Index 319