Book description
Since its first volume in 1960, Advances in Computers has presented detailed coverage of innovations in computer hardware, software, theory, design, and applications. It has also provided contributors with a medium in which they can explore their subjects in greater depth and breadth than journal articles usually allow. As a result, many articles have become standard references that continue to be of significant, lasting value in this rapidly expanding field.
- In-depth surveys and tutorials on new computer technology
- Well-known authors and researchers in the field
- Extensive bibliographies with most chapters
- Many of the volumes are devoted to single themes or subfields of computer science
Table of contents
- Cover image
- Title page
- Table of Contents
- Copyright
- Preface
-
Chapter One: Comparing Reuse Strategies in Different Development Environments
- Abstract
- 1 Introduction
- 2 Development Approaches for Embedded and Nonembedded Systems with Reuse
- 3 Review Process and Inclusion Criteria
- 4 Reuse and Development Approaches for Embedded versus Nonembedded Systems
- 5 Metrics Reported
- 6 Analysis of Outcomes
- 7 Threats to Validity
- 8 Conclusion and Future Work
- Acknowledgments
- Appendix A: Years of Publication
-
Chapter Two: Advances in Behavior Modeling
- Abstract
- 1 Introduction
- 2 Properties of the Modeling Semantics Needed for System Life Cycle Support
- 3 Events, States, Transitions, and Communication–Composition
- 4 Behavior Semantics in UML
- 5 Outside UML
- 6 Summary of Semantic Elements of Behavior Modeling Approaches and Their Properties
- Acknowledgments
-
Chapter Three: Overview of Computational Approaches for Inference of MicroRNA-Mediated and Gene Regulatory Networks
- Abstract
- 1 Introduction
- 2 Biological Backgrounds of Cell Regulatory Mechanisms and Experimental Technologies
- 3 Computational Backgrounds of the Inference of MiRNA-Mediated and GRNs
- 4 Models for GRNs Inference
- 5 Computational Approaches for Inference of MicroRNA-Mediated Regulatory Networks
- 6 Model Validation
- 7 Conclusion and Further Works
-
Chapter Four: Proving Programs Terminate Using Well-Founded Orderings, Ramsey's Theorem, and Matrices
- Abstract
- 1 Introduction
- 2 Notation and Definitions
- 3 A Proof Using the Order (N, ≤)
- 4 A Proof Using the Ordering (N × N × N × N, <, <lex)
- 5 A General Theorem About Proving Programs Terminate Using Well-Founded Orderings
- 6 A Proof Using Ramsey's Theorem
- 7 A General Theorem About Proving Programs Terminate Using Ramsey Theorem
- 8 A Proof Using Matrices and Ramsey's Theorem
- 9 Another Proof Using Matrices and Ramsey's Theorem
- 10 A Proof Using Transition Invariants and Ramsey's Theorem
- 11 Another Proof Using Transition Invariants and Ramsey's Theorem
- 12 Solving Subcases of the Termination Problem
- 13 How Much Ramsey Theory Do We Need?
- 14 Open Problems
- 15 Summary
- Acknowledgments
- A Using Just C1 and C2 to Prove Termination
- B A Verification That Needs the Full Ramsey Theory
- C Ramsey's Theorem
- D The Transitive Ramsey Theorem
- Chapter Five: Advances in Testing JavaScript-Based Web Applications
- Author Index
- Subject Index
- Contents of Volumes in This Series
Product information
- Title: Advances in Computers
- Author(s):
- Release date: February 2015
- Publisher(s): Academic Press
- ISBN: 9780128023419
You might also like
book
Advances in Computers
Advances in Computers, Volume 113, the latest volume in this innovative series published since 1960, presents …
book
Advances in Computers
Advances in Computers carries on a tradition of excellence, presenting detailed coverage of innovations in computer …
book
Advances in Computers
Advances in Computers, Volume 108, the latest volume in a series published since 1960, presents detailed …
book
Win32 System Services: The Heart of Windows® 98 and Windows® 2000
The Win32 best-seller, fully updated for Windows 2000 and Windows 98! Master every key Win32 system …