Computer science Books
John Wiley & Sons Inc Probability and Statistics with Reliability
Book SynopsisRelates fundamental concepts in probability and statistics to the computer sciences and engineering. This book uses Markov chains and other statistical tools to illustrate processes in reliability of computer systems and networks, fault tolerance, and performance.Trade Review"The book offers a comprehensive introduction to probability, stochastic processes, and statistics for students of computer science, electrical and computer engineering, and applied mathematics. Its wealth of practical examples and up-to-date information makes it an excellent resource for practitioners as well." (Zentralblatt MATH, 2016) "I highly recommend this book for academics for use as a textbook and for researchers and professionals in the field as a useful reference." (Interfaces, September/ October 2004) "This introduction...uses Markov chains and other statistical tools to illustrate process in reliability of computer systems, fault tolerance, and performance." (SciTech Book News, Vol. 26, No. 2, June 2002) "...an excellent self-contained book.... I recommend the book to beginners and veterans in the field..." (Computer Journal, Vol.45, No.6, 2002) "This book is a tour de force of clear, virtually error-free exposition of probability as it is applied in a host of up-to-date contexts.... It will richly reward the...reader.... Read this book cover to cover. It’s worth the effort." (Technometrics, Vol. 45, No. 1, February 2003)Table of ContentsPreface to the Second Edition ix Preface to the First Edition xi Acronyms xiii 1 Introduction 1 1.1 Motivation 1 1.2 Probability Models 2 1.3 Sample Space 3 1.4 Events 6 1.5 Algebra of Events 7 1.6 Graphical Methods of Representing Events 11 1.7 Probability Axioms 13 1.8 Combinatorial Problems 19 1.9 Conditional Probability 23 1.10 Independence of Events 25 1.11 Bayes' Rule 38 1.12 Bernoulli Trials 45 2 Discrete Random Variables 61 2.1 Introduction 61 2.2 Random Variables and Their Event Spaces 62 2.3 The Probability Mass Function 64 2.4 Distribution Functions 66 2.5 Special Discrete Distributions 68 2.6 Analysis of Program MAX 92 2.7 The Probability Generating Function 96 2.8 Discrete Random Vectors 99 2.9 Independent Random Variables 104 3 Continuous Random Variables 115 3.1 Introduction 115 3.2 The Exponential Distribution 119 3.3 The Reliability and Failure Rate 124 3.4 Some Important Distributions 129 3.5 Functions of a Random Variable 148 3.6 Jointly Distributed Random Variables 153 3.7 Order Statistics 157 3.8 Distribution of Sums 167 3.9 Functions of Normal Random Variables 182 4 Expectation 193 4.1 Introduction 193 4.2 Moments 197 4.3 Expectation Based on Multiple Random Variables 200 4.4 Transform Methods 208 4.5 Moments and Transforms of Some Distributions 217 4.6 Computation of Mean Time to Failure 228 4.7 Inequalities and Limit Theorems 237 5 Conditional Distribution and Expectation 247 5.1 Introduction 247 5.2 Mixture Distributions 247 5.3 Conditional Expectation 262 5.4 Impefect Fault Coverage and Reliability 268 5.5 Random Sums 279 6 Stochastic Processes 289 6.1 Introduction 289 6.2 Classification of Stochastic Processes 294 6.3 The Bernoulli Process 300 6.4 The Poisson Process 304 6.5 Renewal Processes 314 6.6 Availability Analysis 319 6.7 Random Incidence 328 6.8 Renewal Model of Program Behavior 332 7 Discrete-Time Markov Chains 337 7.1 Introduction 337 7.2 Computation of n-step Transition Probabilities 341 7.3 State Classification and Limiting Probabilities 347 7.4 Distribution of Times Between State Changes 356 7.5 Markov Modulated Bernoulli Process 358 7.6 Irreducible Finite Chains with Aperiodic States 361 7.7 * The M/G/1 Queuing System 377 7.8 Discrete-Time Birth-Death Processes 385 7.9 Finite Markov Chains with Absorbing States 392 8 Continuous-Time Markov Chains 405 8.1 Introduction 405 8.2 The Birth- Death Process 412 8.3 Other Special Cases of the Birth-Death Model 446 8.4 Non-Birth-Death Processes 454 8.5 Markov Chains with Absorbing States 496 8.6 Solution Techniques 520 8.7 Automated Generation 530 9 Networks of Queues 555 9.1 Introduction 555 9.2 Open Queuing Networks 560 9.3 Closed Queuing Networks 568 9.4 General Service Distribution and Multiple Job Types 596 9.5 Non-product-form Networks 604 9.6 Computing Response Time Distribution 617 9.7 Summary 630 10 Statistical Inference 637 10.1 Introduction 637 10.2 Parameter Estimation 639 10.3 Hypothesis Testing 692 11 Regression and Analysis of Variance 727 11.1 Introduction 727 11.2 Least-squares Curve Fitting 732 11.3 The Coefficients of Determination 735 11.4 Confidence Intervals in Linear Regression 738 11.5 Trend Detection and Slope Estimation 742 11.6 Correlation Analysis 745 11. 7 Simple Nonlinear Regression 748 11.8 Higher-dimensional Least-squares Fit 749 11.9 Analysis of Variance 751 A Bibliography 765 A.1 Theory 765 A.2 Applications 770 B Properties of Distributions 777 C Statistical Tables 780 D Laplace Transforms 801 E Program Performance Analysis 808 Author Index 811 Subject Index 819
£152.06
John Wiley & Sons Inc Parallel and Distributed Computing A Survey of
Book SynopsisFocuses on the area of parallel and distributed computing, and considers the diverse approaches. Covering a comprehensive set of models and paradigms, this book serves as both an introduction and a survey. It is suitable for students and can be used as a foundation for parallel and distributed computing courses.Trade Review"A supplemental text providing a framework within which individual topics can be elaborated on in...courses...or a survey that researchers can consult before choosing a set of models and paradigms for the overlapping approaches to programming." (SciTech Book News, Vol. 25, No. 3, September 2001) "an excellent introduction to the field of parallel computing .." (CVu - Jnl of the Association C & C++ Users, February 2002)Table of ContentsArchitectures. Data Parallelism. Shared-Memory Programming. Message Passing. Client/Server Computing. Code Mobility. Coordination Models. Object-Oriented Models. High-Level Programming Models. Abstract Models. Final Comparison. References. Index.
£131.35
John Wiley & Sons Inc Enterprise Integration
Book SynopsisTargeted for junior/senior/grad level students majoring in Information Systems, Enterprise Integration combines the basic concepts of integrated systems with practical experience and their use in a business environment. Understanding integration requires an understanding of the business processes within a firm and between a firm and its external business partners. The book will help students understand conceptually how linkages form between business processes and how these linkages are supported by ERP systems. Case studies are included throughout to provide a balance of theory and practice.Table of ContentsForeword vii Preface ix Part One: An Introduction To Enterprise Systems 1. Information Systems, Organizations, and Integration 3 2. Silos, Mousetraps, and Islands: A Chronicle of Information Systems in Organizations 13 3. The Challenge of Integration 37 Part Two: A New Environment For Enterprise Systems 4. Let's Get Horizontal: Toward a Process View of Organization 51 5. The Relentless Distribution of Information Technology 67 6. Data at the Core of the Enterprise 87 7. The Architecture of an Enterprise System 121 Part Three: Building Enterprise Systems 8. Planning for Enterprise Systems 137 9. The Design of Enterprise Systems 153 10. Realizing and Operating Enterprise Systems 173 11. People in Enterprise Systems 189 Part Four: Extending Enterprise Systems 12. Integrating Backward: Extending the Supply Chain 203 13. Integrating Forward: Meeting Demand and Managing Customers 223 14. Integrating Upward: Supporting Managers and Executives 241 Glossary 255 Index 267
£151.05
John Wiley & Sons Inc Managing IP Networks Challenges and Opportunities
Book SynopsisWritten to identify IP based network and service issues and the challenges facing its growth, as well as to assist the research and development community to prioritize their work in order to solve the problems facing the industry.Trade Review"The book is very practical and well-written for network operation engineers, computer scientists, and professionals. Every IP network professional will find something new and useful in this book." (E-Streams, Vol. 7, No. 6) "...a valuable source of information on a broad range of IP network-related management issues for both specialists and newcomers..." (IEEE Communications Magazine, January 2004)Table of ContentsContributors. Introduction. 1 Current Practice and Evolution (Salah Aidarous). 1.1 Introduction. 1.2 Evolution of Network Architecture. 1.3 Technology Breakthrough. 1.4 IP Management Challenges. 1.5 IP/PSTN Integration. 1.7 Summary. 2 eCommerce (Paul Levine). 2.1 Introduction. 2.2 eCommerce Requirements. 2.3 Open-edi. 2.4 Business Operational View. 2.5 Semantics (Data Definition Standards). 2.6 Shared Semantics for Interoperability (Data Exchange Standards). 2.7 Summary. 3 Quality of Service in IP Networks (Joberto Sérgio Barbosa Martins). Introduction. 3.1 IP Context and Quality of Service. 3.2 Quality of Service. 3.3 Quality of Service: Approaches and Initiatives for IP Networks. 3.4 Packet Conditioning, Queue Scheduling, and Congestion Control in Routers. 3.5 Integrated Services Architecture. 3.6 Differentiated Services Architecture. 3.7 Multiprotocol Label Switching. 3.8 Summary. 4 A Survey of Charging Internet Services (Burkhard Stiller). 4.1 Introduction. 4.2 Motivation and Terminology. 4.3 Related Work. 4.4 Internet Services and Technology Choices. 4.5 Pricing Models. 4.6 ISP Cost Models. 4.7 Charging Support Systems. 4.8 Business Model Aspects. 4.9 Summary and Conclusions. 5 IP Security (Mostafa Hashem Sherif). 5.1 Introduction. 5.2 Security of Telecommunications Services. 5.3 Security Objectives. 5.4 OSI Model for Cryptographic Security. 5.5 Message Confidentiality. 5.6 Data Integrity. 5.7 Identification of Participants. 5.8 Authentication of Participants. 5.9 Access Control. 5.10 Nonrepudiation. 5.11 Secure Management of Cryptographic Keys. 5.12 Exchange of Secret Keys: Kerberos. 5.13 Exchange of Public Keys. 5.14 Certificate Management. 5.15 Applications for Network Management. 5.16 Encryption Cracks. 5.17 Summary. Appendix I: Areas Related to Security Policies. Appendix II: Principles of Symmetric Encryption. Appendix III: Principles of Public Key Encryption. Appendix IV: Principles of the Digital Signature Algorithm. 6 The Future Optical Internet: Integration of Optical and IP Technologies (Andrea Fumagalli, Javier Aracil, and Luca Valcarenghi). 6.1 Introduction. 6.2 Optical Network Technologies. 6.3 Protocol Architectures, Signaling and Framing Techniques for the Optical Internet. 6.4 Traffic Engineering in the Optical Internet. 6.5 Open Challenges. Acronyms. Index.
£128.66
John Wiley & Sons Inc C Scientific Programming
Book Synopsis Teaches the design of programs for scientific computation in C++ Introduces unique C++ classes, defines the particular relationships among these classes, and demonstrates their use in a dozen of the most powerful current applications Presents a set of practices that allows programmers to embrace the attractive features of C++ without incurring undesired side effects and hidden costs Includes a collection of source code files downloadable from the Wiley ftp site Originally announced as Scientific Program Design: C++ for Native Fortran Writers Trade Review"...teaches the design of programs for scientific computation in C++." (SciTech Book News, Vol. 25, No. 4, December 2001) "With a view to teaching the design of programs...the author introduces unique C++ classes for vectors, dense matrices, and sparse matrices...demonstrates their use..." (Mechanical Engineering, www.wemagazine.org, April 2, 2002)Table of ContentsPreafce. Overview. Vector ad Matrix Basics. Sparse Matrix Basics. Conjugate-Gradient Methods. Triangular Matrices. Householder Matrix Methods. Singular Value Decomposition. Cholesky Decomposition. Automatic Derivatives. Constrained Optimization. Interior-Point Extensions. LU Factorization. Complex Arrays. Fourier Transforms. References. Index.
£84.56
John Wiley & Sons Inc Verilog Coding for Logic Synthesis
Book SynopsisVerilog is a Hardware Description Language (HDL) used to design and document electronic systems. Verilog HDL allows designers to virtually design systems without expending time or resources on physical models. It is the most widely used HDL with a user community of more than 50,000 active designers.Table of ContentsTable of Figures. Table of Examples. List of Tables. Preface. Acknowledgments. Trademarks. Introduction. Asic Design Flow. Verilog Coding. Coding Style: Best-Known Method for Synthesis. Design Example of Programmable Timer. Design Example of Programmable Logic Block for Peripheral Interface.
£118.76
John Wiley & Sons Inc InternetBased Workflow Management
Book SynopsisInternet-based business transactions can be broken down into a series of independent steps. This workflow often involves tools from an array of fields, such as network modeling, scheduling, distributed systems, artificial intelligence, software agents, and Java. This book serves as a single, comprehensive resource for IT practitioners and students that covers all these vital aspects of workflow management.Table of ContentsPreface. Acronyms. Internet-Based Workflows. Basic Concepts and Models. Net Models of Distributed Systems and Workflows. Internet Quality of Service. From Ubiquitous Internet Services to Open Systems. Coordination and Software Agents. Knowledge Representation, Inference, and Planning. Middleware for Process Coordination: A Case Study. Glossary. Index.
£125.96
Wiley Distributed Computing 2e Fundamentals Simulations
Book SynopsisDivided into three parts, this work provides an introduction to the theory of distributed computing. It covers the fundamental models, issues, and techniques. It is organized around key simulations in distributed computing, and their applications.Trade Review"This is a second edition of a well-received graduate course textbook dealing with the important field of distributed computing." (Computing Reviews.com, May 10, 2006) "...the authors take readers through these notoriously difficult subjects and ably demystify puzzling buzzwords…" (IEEE Distributed Systems Online, March 2005) "The authors present the fundamental issues underlying the design of distributed systems…as well as fundamental algorithmic concepts and lower-bound techniques." (IEEE Computer Magazine, October 2004)Table of Contents1. Introduction. PART I: FUNDAMENTALS. 2. Basic Algorithms in Message-Passing Systems. 3. Leader Election in Rings. 4. Mutual Exclusion in Shared Memory. 5. Fault-Tolerant Consensus. 6. Causality and Time. PART II: SIMULATIONS. 7. A Formal Model for Simulations. 8. Broadcast and Multicast. 9. Distributed Shared Memory. 10. Fault-Tolerant Simulations of Read/Write Objects. 11. Simulating Synchrony. 12. Improving the Fault Tolerance of Algorithms. 13. Fault-Tolerant Clock Synchronization. PART III: ADVANCED TOPICS. 14. Randomization. 15. Wait-Free Simulations of Arbitrary Objects. 16. Problems Solvable in Asynchronous Systems. 17. Solving Consensus in Eventually Stable Systems. References. Index.
£121.46
John Wiley & Sons Inc When Computers Went to Sea
Book SynopsisExplores the history of the United States Navy's secret development of code-breaking computers and their adaptation to solve a critical fleet radar data handling problem in the Navy's first seaborne digital computer system - that went to sea in 1962.Table of ContentsPreface xxiii Introduction 1 1 Radar—New Eyes for the Fleet 5 Beginnings of Radar 5 May Day—24 October 1944 5 Creation of Radar in the U.S. Navy 11 Start of the Naval Research Laboratory Radio Location P r o j e c t . . . 11 Tracking Projectiles in Flight—The Battleship New York Tests . . . 13 The Plan Position Indicator 14 The Baby Gets a Name 15 Mass Production 16 London—An Easy Target 16 Chain Home 16 Learning to Use Radar at Sea 19 The Most Valuable Cargo 21 Radar at War in the Pacific 26 McNally's Day of Infamy 26 Aboard Lexington 32 Aboard the Flying Boats 33 The Fighter Director Officers 34 CXAM in Action 37 Rest in Peace CXAM 39 The CXAM Lives On 41 Turning Point for McNally 42 Evolution of the Combat Information Center 44 The Kamikazes 49 Divine Wind 49 Floating Chrysanthemum 51 2 A Lingering Problem 53 Legacy of the Kamikazes 53 Legacy of Radar . 54 Problems 55 Quest for Solutions 57 TheThreeTs 57 The Guided Missile Frigates 60 Too Much Data and Not Enough Information 61 Three Digital Attempts 62 The Canadian Navy's Digital Automated Tracking and Resolving System 62 Early Digital Experiments at the Navy Electronics Laboratory 62 The Semi-Automatic Air Intercept Control System 65 Trouble with Analogs 66 The Royal Navy Comprehensive Display System 66 NRL's Electronic Data System 67 The Intercept Tracking and Control Console 68 Project COSMOS 68 Project CORNFIELD 69 3 The Codebreaking Computers—A Digital Solution 71 The Navy Codebreakers 71 A Place Named Seesaw 71 From Steam to Electrons 73 A Machine Named Ice Cream 73 The Naval Computing Machine Laboratory 76 A Computer Named von Neumann 77 ENIAC 77 EDVAC 79 The Navy Computers 81 From Gliders to Codebreaking Machines 81 The Moore School Lectures 90 WHIRLWIND 92 Atlas is Built 92 A Hint of Scandal 98 UNIVAC Persists 99 WHIRLWIND and SAGE 100 WHIRLWIND Saved by the Soviets 100 Chain Home a Thousand Times Over 102 Magnetic Donuts for WHIRLWIND 103 SAGE Goes into Production 105 SAGE in Operation 106 From Tubes to Transistors 107 Magnetic Donuts for Atlas II 107 The Undercapitalization Syndrome at ERA 108 We Can Do it With Transistors 109 BOGART 109 Enter the Transistor 110 SOLO, The All-Transistorized Computer 112 MAGSTEC and TRANSTEC 113 ATHENA 113 4 Conception of a New System 117 Project Lamplight—Conception of a New System 117 Continental Air Defense Coordination? 117 McNally's Mission 118 One of Us is Wrong, Mac 118 A Good Man to Have on Your Side 121 From Concept to Technology—The NTDS Technical and Operational Requirements Document 121 I Have Just the Man You Need 121 Building Blocks for Growth 123 A Digital Frankenstein Monster? 124 General-Purpose or Special-Purpose Computers? 124 Built to Go in Harm's Way 125 Marrying the Digital to the Analog 126 Drums or Magnetic Cores? 127 Automatic Communications 128 OPNAVBuysIt 128 5 Building a New System 131 Who Should Build the System? 131 Project Organization 134 The NTDS Project Office 134 Support from the BUSHIPS Technical Organization 136 The Special Applications Branch 137 The Radar Branch 139 Staffing the Project Office 140 An Evolving Modus Operandi 146 The Chief of Naval Operations Project Office 148 Navy Electronics Laboratory Role 155 A Computer With a Dipstick 156 Selection of Univac 156 Conception of the Unit Computer 159 The AN/USQ-17 Prototype Computer 161 Turmoil in a Young Industry 164 Building the Unit Computers 165 Fuzzy Scopes and Elliptical Circles 168 Selection of Hughes Aircraft 168 Like No Cathode Ray Tubes Ever Seen Before 170 More Than Just Displays 171 Building Blocks 173 Trials and Tribulations of Transistors 173 Computers on the Airwaves 177 A Link—The Primary Long Range Tactical Data Link 177 Selection of Collins Radio 177 From Digits to Music 178 B Link—For Those Without 181 The Interceptor Control Link . 181 C Link—The UHF Short Range Tactical Data Link 182 Digits in an Analog World 182 Developing the Operational Computer Program 183 A New Thing Under the Sun 183 Who Should Build the Seagoing Operational Computer Programs? 184 Real-Programmers Write in Machine Language 185 Real-Programmers Do Not Need to Document Their Programs 187 Building the Prototype Computer Program 188 Programming a Real-Time Computer 188 First Steps 189 Force Tracking and Data Linking 190 TEWA 193 Interceptor Control 195 The Stores 197 A System that Never Sailed 197 The Fleet Comes In 207 6 No Damned Computer Is Going To Tell Me What To Do 211 Getting the Ships 211 The Guided Missile Frigates 211 Not on Our Ship!—How Oriskany Was Won 212 Ready or Not, I Want it on the Nuclear-Powered Ships 213 The Billboard Radars 213 Long Beach and Enterprise 215 Building for Service Test 216 The Q-17 Does Not Make It 216 The Purple Plague 221 The NTDS Interface Specification 228 Good Bye to the Cigarette Lighter 229 Service Test Communications Subsystems 232 Service Test Computer Programs 234 New Faces in the Project Office 234 Service Test Installation 238 No Damned Computer 241 Service Test 245 Getting Ready for Service Test 245 The Navy Meets the Software Monster 249 Where Did All Those Tracks Come From? 250 If You Don't Have a Sense of Humor, Don't Use Computers 252 Hell, It Don't Hardly Ever Fail Sir! 253 Saved by Equipment Reliability 255 Service Approval 258 So What Did They Get for the Money? 259 Money Spent 260 What Was the End Product? 263 7 In the Air, on Land, and Sea 267 On the Land as on the Sea—The Marine Tactical Data System 267 The Amphibious Force Flagships 272 Hawkeye and the Airborne Tactical Data System 274 Advent of USN Airborne Early Warning Radar 274 Hawkeye 276 The E-2A 'Hawkeye' Airborne Early Warning Aircraft 276 TheE-2B Hawkeye 281 TheE-2C Hawkeye 282 Digitizing the Antisubmarine Airplanes 283 Other Navies and NTDS 284 The Royal Navy and ADA 284 New Names for NTDS 291 8 New Horizons for Tactical Computers 297 First Production 297 First-Production Ships 297 First-Production NTDS Equipment 298 The Watch Changes 302 Maybe these Digital Computers are Good for Something After All 305 No Kid Named Joe Randolph 315 Troubles with the Three Ts 315 Seconds are Precious—Weapons Direction System Mark 11 and the AN/SPS-48 Radar 317 The Birth of Weapons Direction System Mark 11 317 Genesis of the AN/SPS-48 Radar 319 No Kid Named Joe Randolph is Going to Tell Me How to Run my Business 322 Mare Island, the Testing Ground 324 Shoehorning a New System into Wainwright 325 Life in Main Navy 327 The Anti-Submarine Warfare Ship Command and Control System 330 The Requirement 330 A Concept for Automating Anti-Submarine Warfare 333 New Link 11 Equipment 334 A New Display Subsystem 335 Analog Leaves Center Stage 337 ASWSC&CS Aftermath 338 Time to Go Competitive? 339 The System Evolves 340 Automatic Detection and Tracking 340 A Large Screen Display? 342 9 Twilight of the Analogs 347 In Combat 347 Early NTDS and ATDS Deployment in Vietnam 347 OnPIRAZ 349 The Beacon Video Processor 350 The Marine Tactical Data System in Vietnam 352 Interceptor Control and Missile Operations 354 NTDS Vietnam Summary 355 Give Us More Memory! 356 The Fleet Goes Digital 357 The First Wave 357 The Second Wave 358 New Computers for New Purposes 358 Finally, 32 Bits—The AN/UYK-7 Computer 360 Moving on to Digital Weapons Control 361 Working Out the Fundamentals 361 Digital Talos 362 Digital Tartar 364 Digital Terrier 365 Closing the Loop 365 The Guns Go Digital 366 A Line of Standards 367 Last Decade of the Analogs 367 Too Many Computers! 368 A Standard Minicomputer 370 The Navy Embedded Computer Program 372 The Politics of Computers 377 Shield of the Fleet 378 The Advanced Surface Missile System 378 From ASMS to Aegis 384 More Boundary Line Adjustments 386 Problems of Success 388 A New Name 389 Do Old Computers Ever Die? 393 Summary 394 Legacy of NTDS 394 Recognition 395 How Could They Possibly Have Succeeded? 397 A Joint Electronics Equipment Designation System 401 B Table of Acronyms and Abbreviations 405 C Univac NTDS Organization, December 1,1959 415 Bibliography 421 Index 441
£65.66
John Wiley & Sons Inc Software Paradigms
Book SynopsisSoftware Paradigms provides the first complete compilation of software paradigms commonly used to develop large software applications, with coverage ranging from discrete problems to full-scale applications.Trade Review"...an excellent course reference for someone with significant but varied...software development ideas...a handy reference for identifying the similarities between...software development elements…" (IEEE Software Magazine, January/February 2006) "…useful to some programmers." (CHOICE, October 2005) "This is a good survey of the various topics…quite relevant to the CSQE body of knowledge architecture topic." (Software Quality Professional, September 2005) "…a timely work that helps put recent advances in software architecture and framework development in context with earlier software design concepts." (Computing Reviews.com, July 29, 2005) "…a welcome…addition to the literature on software development paradigm." (Computing Reviews.com, May 3, 2005)Table of ContentsADVICE FOR THE INSTRUCTOR. ACKNOWLEDGMENTS. 1 Introduction. 1.1 The Meaning of Paradigm. 1.2 Software Solves Problems. 1.3 Designing and Developing Software. 1.4 Understanding Problem Paradigms. 1.5 Overview of Book. 1.6 Conventions. 1.7 Exercises. 2 Paradigm Overview. 2.1 Problem Paradigms. 2.2 A Functional Classification of Problems. 2.3 Programming Languages. 2.4 Design Patterns. 2.5 Components. 2.6 Software Architectures. 2.7 Frameworks. 2.8 Further Reading. 2.9 Exercises. I DESIGN PATTERNS. 3 Overview of Design Patterns. 3.1 A Brief History of Patterns. 3.2 Why Patterns? 3.3 Pattern Spaces. 3.4 Types of Software Patterns. 3.5 Describing Patterns. 3.6 How Do We Discover Patterns? 3.7 Using Patterns. 3.8 Further Reading. 3.9 Exercises. 4 Software Patterns. 4.1 Singleton. 4.2 The Wrapper Pattern. 4.3 The Abstract Factory Pattern. 4.4 Observer Pattern. 4.5 Exercises. 5 Human–Computer Interface Patterns. 5.1 Style Guides. 5.2 An HCI Pattern Language. 5.3 Web Design Patterns. 5.4 Further Reading. 5.5 Exercises. 6 Other Pattern Domains. 6.1 Coplien’s Patterns. 6.2 Object-Oriented Patterns. 6.3 Antipatterns. 6.4 Further Reading. 6.5 Exercises. 7 Pattern Design. 7.1 Design Pattern Issues. 7.2 Some Simple Pattern Design Principles. 7.3 Limitations of Design Patterns. 7.4 Further Reading. 7.5 Exercises. II COMPONENTS. 8 Component Concepts. 8.1 What Are Software Components? 8.2 Why Use Components? 8.3 Component Models. 8.4 Using Components. 8.5 Component Reuse. 8.6 Exercises. 9 Types of Components. 9.1 Event-Based Components. 9.2 Java Events. 9.3 Distributed Components. 9.4 Transaction Processing. 9.5 Further Reading. 9.6 Exercises. 10 Component Technologies. 10.1 CORBA. 10.2 System Object Model. 10.3 Microsoft’s COM/DCOM. 10.4 JavaBeans. 10.5 Further Reading. 10.6 Exercises. 11 Component-Based Software Engineering. 11.1 Defining CBSE. 11.2 Problems with CBSE. 11.3 Problems in Using Components. 11.4 Problems with Glue Code. 11.5 Exercises. III SOFTWARE ARCHITECTURES. 12 Overview of Software Architectures. 12.1 Software Architecture Elements and Description. 12.2 Why Do We Need a Software Architecture? 12.3 Software Architecting Versus Software Engineering. 12.4 Domain-Specific Software Architectures. 12.5 Roles and Benefits. 12.6 Software Architecture Models. 12.7 What To Look For. 12.8 Further Reading. 12.9 Exercises. 13 Data Flow Systems. 13.1 The Data Flow Model. 13.2 Batch Sequential Systems. 13.3 Pipe and Filter Architecture. 13.4 Further Reading. 13.5 Exercises. 14 Call-and-Return Systems. 14.1 Main Program and Subroutines. 14.2 Client–Server Systems. 14.3 Object-Oriented Systems. 14.4 Hierarchically Layered Systems. 14.5 Further Reading. 14.6 Exercises. 15 Virtual Machines. 15.1 Interpreters. 15.2 Virtual Machine Examples. 15.3 Rule-Based Systems. 15.4 Advantages and Disadvantages. 15.5 Further Reading. 15.6 Exercises. 16 Independent Component Systems. 16.1 Communicating Sequential Processes. 16.2 Event-Based Systems. 16.3 Event System Issues. 16.4 Broker Systems. 16.5 Further Reading. 16.6 Exercises. 17 Data-Centric Systems. 17.1 Database Systems. 17.2 Blackboard Systems. 17.3 The Linda Model and Language. 17.4 Further Reading. 17.5 Exercises. 18 Concurrent Software Architectures. 18.1 Basic Concepts. 18.2 Parallel Programming. 18.3 Data Parallel Systems. 18.4 Message Passing Systems. 18.5 A Parallel Programming Methodology. 18.6 Further Reading. 18.7 Exercises. 19 Software Architecture Challenges. 19.1 Software Architecture Description. 19.2 Design Issues. 19.3 Analysis of Software Architectures. 19.4 Further Reading. 19.5 Exercises. IV FRAMEWORKS. 20 Framework Concepts. 20.1 Types of Frameworks. 20.2 Framework Elements. 20.3 Using Frameworks. 20.4 Documenting Frameworks. 20.5 Designing Frameworks. 20.6 Problems with Frameworks. 20.7 Framework Domains. 20.8 Further Reading. 20.9 Exercises. 21 GUI Frameworks. 21.1 Smalltalk-80 Programming Environment. 21.2 MacApp Framework. 21.3 The Taligent Framework. 21.4 Other Frameworks. 21.5 Further Reading. 21.6 Exercises. 22 Development Frameworks. 22.1 Java as a Framework. 22.2 Microsoft’s .NET Framework. 22.3 IBM’s San Francisco Project. 22.4 POOMA. 22.5 Further Reading. 22.6 Exercises. 23 Challenges in Frameworks. 23.1 Developing Frameworks. 23.2 Application Development Using a Framework. 23.3 Testing Frameworks. 23.4 Issues in Framework Usage. 23.5 Exercises. BIBLIOGRAPHY. GLOSSARY. INDEX.
£128.66
John Wiley & Sons Inc Performability Modelling Techniques and Tools
Book SynopsisThis work covers the evaluation of the performance of computer communication systems. It covers developments in computer performability, bringing together two subjects that have been treated separately in different communities, namely computer and communication system performance evaluation.Trade Review"...examines various computer techniques for analyzing computing performance in the presence of failures." (SciTech Book News, Vol. 25, No. 3, September 2001)Table of ContentsContributing Authors. Foreword. Preface. Introduction. Queues with Breakdowns. The Uniformization Method in Performability Analysis. Closed-Form Solutions for Performability. Markov-Reward Models and Hyperbolic Systems. Monotonicity and Error Bound Results. The Task Completion Time in Degradable Systems. Rare Event Simulation. Specification and Construction of Performability Models. A Survey of Performability Modelling Tools. Bibliography. Concise Glossary. Index.
£107.06
John Wiley & Sons Inc The Art of Computer Systems Performance Analysis
Book SynopsisThe Art of Computer Systems Performance Analysis At last, a welcome and needed text for computer professionals who require practical, ready-to-apply techniques for performance analysis. Highly recommended! -Dr. Leonard Kleinrock University of California, Los Angeles An entirely refreshing text which has just the right mixture of theory and real world practice. The book is ideal for both classroom instruction and self-study. -Dr. Raymond L. Pickholtz President, IEEE Communications Society An extraordinarily comprehensive treatment of both theoretical and practical issues. -Dr. Jeffrey P. Buzen Internationally recognized performance analysis expert . it is the most thorough book available to date -Dr. Erol Gelenbe Université René Descartes, Paris . an extraordinary book.. A worthy addition to the bookshelf of any practicing computer or communications engineer -Dr. Vinton G. Cer??? Chairman, ACM SIGCOMM This is an unusual object, a textbook that one wants to sit down and peruse. The proseTrade Review"At last, a welcome and needed text for computer professionals who require practical, ready-to-apply techniques for performance analysis. Highly recommended!" -Dr. Leonard Kleinrock University of California, Los Angeles "An entirely refreshing text which has just the right mixture of theory and real world practice. The book is ideal for both classroom instruction and self-study." -Dr. Raymond L. Pickholtz President, IEEE Communications Society "An extraordinarily comprehensive treatment of both theoretical and practical issues." -Dr. Jeffrey P. Buzen Internationally recognized performance analysis expert ". it is the most thorough book available to date" -Dr. Erol Gelenbe Universite Rene Descartes, Paris ". an extraordinary book. A worthy addition to the bookshelf of any practicing computer or communications engineer" -Dr. Vinton G. Cerf Chairman, ACM SIGCOMM "This is an unusual object, a textbook that one wants to sit down and peruse. The prose is clear and fluent, but more important, it is witty." -Allison Mankin The Mitre Washington Networking Center NewsletterTable of ContentsPartial table of contents: AN OVERVIEW OF PERFORMANCE EVALUATION. Common Mistakes and How to Avoid Them. Selection of Techniques and Metrics. MEASUREMENT TECHNIQUES AND TOOLS. Types of Workloads. Workload Characterization Techniques. Monitors. Ratio Games. PROBABILITY THEORY AND STATISTICS. Summarizing Measured Data. Simple Linear Regression Models. Other Regression Models. EXPERIMENTAL DESIGN AND ANALYSIS. One-Factor Experiments. Two-Factor Full Factorial Design without Replications. Two-Factor Full Factorial Design with Replications. SIMULATION. Analysis of Simulation Results. Testing Random-Number Generators. Commonly Used Distributions. QUEUEING MODELS. Analysis of a Single Queue. Operational Laws. Convolution Algorithm. Appendix. Solutions to Selected Exercises. References. Author Index. Subject Index.
£80.10
John Wiley & Sons Inc Information Systems
Book SynopsisDesigned as a supplement to the text Information Systems: Management Principles in Action, this collection of real-world vignettes provides students with challenging applications based on the actual problems faced by information systems managers. The vignettes illustrate complex management problems at the corporate, functional, and end-user levels, most of which center around the evaluation of alternative decisions the information systems manager might make and the consequences of those decisions. Topics include information technology as a competitive weapon, strategic information systems planning, the organizational placement of the information systems department, corporate issues and opportunities, specific duties of the information systems department, organizing the information systems department, and much more.Table of ContentsOVERVIEW OF INFORMATION SYSTEMS MANAGEMENT. Scope and Role of Information Systems Management. Foundation of Information Systems Management. INFORMATION SYSTEMS AS A CORPORATE ENTITY. The Role of Information Systems as a Corporate Entity. Information Technology as a Competitive Weapon. The Organizational Placement of the Information SystemsDepartment. INFORMATION SYSTEMS AS A FUNCTIONAL ENTITY. Duties of the Information Systems Department. Functional Challenges and the Information Systems Manager. Organizing the Information Systems Department. Information Systems Personnel Management. Information Systems as a Functional Entity: Issues andOpportunities. INFORMATION SYSTEMS AS A USER SUPPORT ENTITY. The Role of Information Systems as a User Support Entity. End-User Applications Development. Organizing Information Systems to Support End-User Computing. Information Sytems as a User Support Entity: Issues andOpportunities. THE FUTURE AND INFORMATION SYSTEMS MANAGEMENT. Quality of Work. Quality of Life.
£85.45
John Wiley & Sons Inc Computational Methods for Electromagnetics and
Book SynopsisEmphasizes electromagnetic and microwave problems and the fundamental algorithms which can be used as the basis for computer programs that produce useful numerical results. Includes relevant computer project descriptions in related chapters. A requirement for any student doing work in electromagnetics.Table of ContentsFinite-Difference Method. Finite-Difference Determination of Eigenvalues. Finite-Difference Time-Domain Method. Variational and Related Methods. Finite-Element Method. Method of Moments. Scattering Solutions by Mehtod of Moments. Spectral Analysis with Fourier Series and Fourier Integral. Spectral Analysis of Microstrip Transmission Lines. Spectral Analysis of Microstrip Circuits. Mode Matching. Concluding Comments. Index.
£147.56
John Wiley & Sons Inc Analog and Computer Electronics for Scientists
Book SynopsisUpdated and reorganized, it details selected examples of integrated circuits describing their properties, limitations and the methods of applying them in practical circuitry. This edition contains a significantly expanded treatment of microcomputers as the ultimate electronic components. Discusses computer peripherals, communications and networking. Along with depicting existing electronic equipment, it assesses the future of computers including important improvements in areas such as miniaturization, speed, intercommunication and general convenience of operation.Table of ContentsANALOG ELECTRONICS. Circuits and Schematics. Operational Amplifiers 1. Operational Amplifiers 2. Semiconductors. Diodes and Transistors as Circuit Elements. Transducers. Switching Circuits. Power Supplies. DIGITAL ELECTRONICS. Binary Numeration. Binary Logic Gates. Flip-Flops and Registers. Interdomain Converters. COMPUTER ELECTRONICS. The Computer as an Electronic Device. Computer Peripherals. Data Communications. Computer Networks. Construction and Troubleshooting. A Glimpse of the Future. Mathematical Background. Questions and Problems. Appendices. Glossary. Index.
£175.46
John Wiley & Sons Inc FieldProgrammable Gate Arrays
Book SynopsisTimely, authoritative, application-oriented. an in-depthexploration of current and future uses of FPGAs in digital systemsThe development of field-programmable gate arrays (FPGAs) may wellbe the most important breakthrough for the microelectronicsindustry since the invention of the microprocessor. Using FPGAs, asystem designer working on a PC can now develop a working prototypein a few hours and change it at will in just a few minutes, ratherthan waiting weeks or months for a printed-circuit assembly or acustom integrated circuit to be built. This newfound ability tochange a system by simply altering its configuration memory is alsoleading to exciting new forms of computing, such as arrayapplications that exploit parallelism. Now in a book that functionsequally well as a working professional reference and apedagogically consistent computer engineering text, John V.Oldfield and Richard C. Dorf: * Provide a detailed overview of FPGAs in digital systemsdesign * Explain the underlyTable of ContentsSystem Implementation Strategies. Review of Logic Design and Electrical Aspects. Introduction to FPGA Architecture. Design Process Flows and Software Tools. Case Studies. Computational Applications. Business Development. Recent Developments. Afterword. Glossary. Index.
£154.76
John Wiley & Sons Inc Electromigration and Electronic Device
Book SynopsisThis study reviews an important reliability issue for both silicon and GaAs technologies. It surveys the status of electromigration physics in microelectronics, and summarizes various rate controlling details.Table of ContentsReliability and Electromigration Degradation of GaAs MicrowaveMonolithic Integrated Circuits (A. Christou). Simulation and Computer Models for Electromigration (P.Tang). Temperature Dependencies on Electromigration (M. Pecht & P.Lall). Electromigration and Related Failure Mechanisms in VLSIMetallizations (A. Christou & M. Peckerar). Metallic Electromigration Phenomena (S. Krumbein). Theoretical and Experimental Study of Electromigration (J.Zhao). GaAs on Silicon Performance and Reliability (P. Panayotatos, etal.). Electromigration and Stability of Multilayer Metal-SemiconductorSystems on GaAs (A. Christou). Electrothermomigration Theory and Experiments in Aluminum Thin FilmMetallizations (A. Christou). Reliable Metallization for VLSI (M. Peckerar). Index.
£193.46
John Wiley & Sons Inc Karel The Robot
Book SynopsisKAREL The Robot teaches students the fundamental concepts and skills of programming, quickly and easily. By emphasizing logic and structure over calculation, it provides a nonthreatening introduction to the central ideas in programming.This widely praised guide begins by introducing KAREL, a literal-minded robot whos built-in capabilities allow him to explore his world and manipulate simple objects in it. Once students learn the details of KAREL''s deceptively simple programming language, they will soon be designing well-structured programs that instruct KAREL to perform surprisingly complex tasks. Along the way students will be absorbing sophisticated programming concepts that will enhance their programming ability.Table of ContentsChapter 1. The Robot World 1 1.1. Karel's World 1 1.2. Karel's Capabilities 3 1.3. Tasks and Situations 4 1.4. Problem Set 6 Chapter 2. Primitive Instructions and Simple Programs 7 2.1. Changing Position 7 2.2. Handling Beepers 9 2.3. Finishing a Task 9 2.4. A Complete Program 10 2.5. Error Shutoffs 13 2.6. Programming Errors 14 2.7. Problem Set 19 Chapter 3. Extending Karel's Vocabulary 25 3.1. Creating a More Natural Programming Language 25 3.2. A Mechanism That Defines New Instructions 26 3.3. Block Structuring 27 3.4. The Meaning and Correctness of New Instructions 28 3.5. Defining New Instructions in a Program 29 3.6. Boxing: How Karel Understands a Program 32 3.7. An Ungrammatical Program 34 3.8. Tools for Designing and Writing Karel Programs 35 3.9. Advantages of Using New Instructions 53 3.10. Writing Understandable Programs 57 3.11. Problem Set 59 Chapter 4. Conditionally Executing Instructions 65 4.1. The IF/THEN Instruction 65 4.2. The Conditions Karel Can Test 66 4.3. Simple Examples of the IF/THEN Instruction 67 4.4. The IF/THEN/ELSE Instruction 74 4.5. Nested IF Instructions 76 4.6. More Complex Tests 79 4.7. When to Use an IF Instruction 80 4.8. Transformations for Simplifying IF Instructions 81 4.9. The Dangling ELSE 84 4.10. Problem Set 87 Chapter 5. Instructions That Repeat 93 5.1. The ITERATE Instruction 93 5.2. The WHILE Instruction 95 5.3. Errors to Avoid with WHILE Loops 100 5.4. Nested WHILE Loops 104 5.5. WHILE and IF Instructions 112 5.6. Reasoning About Loops 112 5.7. A Large Program Written by Stepwise Refinement 116 5.8. When to Use a Repeating Instruction 126 5.9. Problem Set 128 Chapter 6. Advanced Techniques for Karel 141 6.1. Recursion 141 6.2. Searching 145 6.3. Doing Arithmetic 149 6.4. Problem Set 152 Appendix 155 Technical Term Index 157 Instruction Index 159
£58.42
John Wiley & Sons Inc File Organization and Processing
Book SynopsisThe many and powerful data structures for representing information physically (in contrast to a database management system that represents information with logical structures) are introduced by this book.Table of ContentsPreface xi Part One Primary File Organizations 25 Part Two Bit Level And Related Structures 127 Part Three Tree Structures 197 Part Four File Sorting 337 Answers to Selected Exercises 375 Index 393
£120.65
John Wiley & Sons Inc Concurrent and Realtime Systems
Book SynopsisThe CSP approach has been widely used in the specification, analysis and verification of concurrent and real-time systems, and for understanding the particular issues that can arise when concurrency is present. It provides a language which enables specifications and designs to be clearly expressed and understood, together with a supporting theory which allows them to be analyzed and shown to be correct. This book supports advanced level courses on concurrency covering timed and untimed CSP. The first half introduces the language of CSP, the primary semantic models (traces, failures, divergences and infinite traces), and their use in the modelling, analysis and verification of concurrent systems. The second half of the book introduces time into the language, brings in the timed semantic model (timed failures) and finally presents the theory of timewise refinement which links the two halves together. Accompanying website: http://www.cs.rhbnc.ac.uk/books/concurreTable of ContentsPreface ix Acknowledgements xv Part 1 The language of CSP 1 Sequential processes 3 1.1 Events and processes 3 1.2 Performing events 8 1.3 Recursion 13 1.4 Choice 20 2 Concurrency 31 2.1 Alphabetized parallel 31 2.2 Interleaving 44 2.3 Interface parallel 50 3 Abstraction and control flow 55 3.1 Hiding 55 3.2 Event renaming 62 3.3 Sequential composition 69 3.4 Interrupt 72 3.5 Notes 74 Part II Analysing processes 4 Traces 87 4.1 Sequences 87 4.2 Trace semantics 91 4.3 Recursion 117 4.4 Testing 133 4.5 Congruence 136 5 Specification and verification with traces 141 5.1 Property-oriented Specification 141 5.2 Verification 143 5.3 Recursion induction 155 5.4 Case study: Distributed sum 160 5.5 Process-oriented specification 168 6 Stable failures 173 6.1 Observing processes 174 6.2 Process semantics 178 6.3 Recursion 188 7 Specification and verification with failures 195 7.1 Property-oriented specification 195 7.2 Verification 197 7.3 Recursion induction 206 7.4 Process-oriented specification 209 7.5 Case study: Distributed sum 212 8 Failures, divergences, and infinite traces 221 8.1 Observing processes 221 8.2 Process semantics 229 8.3 Recursion 242 8.4 Specification and verification 248 8.5 Recursion induction 253 8.6 Case study: Distributed sum 256 8.7 Must testing and FDI equivalence 257 8.8 Notes 258 Part III Introducing time 9 The timed language 267 9.1 Timed computational model 268 9.2 Transitions 269 9.3 Performing events 270 9.4 Choice 275 9.5 Recursion 286 9.6 Concurrency 290 9.7 Abstraction 297 9.8 Flow of control 304 10 Timed transition systems 313 10.1 Evolution 313 10.2 Executions 315 10.3 Well-timed processes 327 10.4 Notes 329 Part IV Timed analysis 11 Semantics of timed CSP 335 11.1 Timed observations 336 11.2 Timed failures semantics 347 11.3 Recursion 358 11.4 Testing and timed failures equivalence 363 12 Timed specification and verification 369 12.1 Specification 369 12.2 Verification 375 12.3 Recursion induction 385 12.4 Ill-timed processes 388 12.5 Case study: Fischer’s protocol 390 13 Timewise refinement 399 13.1 Trace timewise refinement 400 13.2 Failures timewise refinement 410 13.3 Refinement and parallel composition 413 13.4 Case study: a railway crossing 431 13.5 FDI timewise refinement 436 13.6 Testing and timewise refinement 439 13.7 Notes 442 Appendix A: Event-based time 447 A.1 Standard CSP and took 448 A.2 Translating from timed CSP 454 A.3 Notes 465 Appendix B: Model-checking with FDR 469 B.1 Interacting with FDR 470 B.2 How FDR checks refinement 473 B.3 Machine readable CSP 478 References 485 Notation 493 Index 498 Index of Processes 507
£56.00
John Wiley & Sons Inc MACSYMA for Statisticians
Book SynopsisIntroduces the basic principles and ideas of MACSYMA, a computer programming system designed to perform mathematical computations and manipulations in symbolic as well as numerical form.Table of ContentsGetting Started. Variables, Lists, Equations, Functions, and Arrays. Iteration, Conditionals, Blocks, and Recursion. Part Selection, Substitution, and Ev. Internal Representation, Storage, General Utilities. Matrices and Lists. Advanced Uses of MACSYMA. References. Answers to the Exercises. Index.
£185.36
John Wiley & Sons Inc ComponentOriented Programming
Book SynopsisComponent Oriented Programming offers a unique programming-centered approach to component-based software development that delivers the well-developed training and practices you need to successfully apply this cost-effective method. Following an overview of basic theories and methodologies, the authors provide a unified component infrastructure for building component software using JavaBeans, EJB, OSGi, CORBA, CCM, .NET, and Web services. You''ll learn how to develop reusable software components; build a software system of pre-built software components; design and implement a component-based software system using various component-based approaches. Clear organization and self-testing features make Component Oriented Programming an ideal textbook for graduate and undergraduate courses in computer science, software engineering, or information technology as well as a valuable reference for industry professionals.Trade Review"…a hands-on, experimental approach to component-oriented programming." (Computing Reviews.com, February 27, 2006)Table of ContentsPreface. 1. Introduction. 1.1 What is COP? 1.2 Why is COP important? 1.3 What is a component? 1.4 Hardware components and software components. 1.5 From OOP to COP. 1.6 Component-based software engineering. 1.7 Summary. 1.8 Self-review questions. 1.9 Exercises. 2. A Theory of Components. 2.1 Principles of COP. 2.2 Infrastructures of COP. 2.3 Component models. 2.4 Connection models. 2.5 Deployment models. 2.6 Unifying component technologies. 2.7 Summary. 2.8 Self-review questions. 2.9 Exercises. 3. COP with JavaBeans. 3.1 Overview of JavaBeans technology. 3.2 The component model of JavaBeans. 3.3 The connection model of JavaBeans. 3.4 The deployment model of JavaBeans. 3.5 Examples and lab practice. 3.6 Summary. 3.7 Self-review questions. 3.8 Exercises. 4. Enterprise JavaBeans Components. 4.1 The EJB a rchitecture. 4.2 The component model of EJB. 4.3 The connection model of EJB. 4.4 The deployment model of EJB. 4.5 Examples and lab practice. 4.6 Summary. 4.7 Self-review questions. 4.8 Exercises. 4.9 Programming exercises. 5. CORBA Components. 5.1 The COBRA component infrastructure. 5.2 The CORBA component model (CCM). 5.3 The connection model of CORBA and CCM. 5.4 The deployment model of CORBA and CCM. 5.5 Examples and lab practice. 5.6 Summary. 5.7 Self-review questions. 5.8 Exercises. 5.9 Programming exercises. 6. .NET Components. 6.1 The .NET framework. 6.2 The component model of .NET. 6.3 The connection model of .NET. 6.4 .NET component deployments. 6.5 Visual Studio .NET. 6.6 Examples and lab practice. 6.7 Summary. 6.8 Self-review questions. 6.9 Exercises. 6.10 Programming exercises. 7. COP with OSGi Components. 7.1 Overview of OSGi technology. 7.2 The component model of OSGi. 7.3 The connection model of OSGi. 7.4 The deployment model of OSGi. 7.5 Examples and lab practice. 7.6 Summary. 7.7 Self-review questions. 7.8 Exercises. 8. Web Services Components. 8.1 The Web Services framework. 8.2 The component model of Web Services. 8.3 The connection model of Web Services. 8.4 Web Services component deployment. 8.5 Examples and lab practice. 8.6 Summary. 8.7 Self-review questions. 8.8 Exercises. 8.9 Programming exercises. Appendix.
£109.76
John Wiley & Sons Inc Dependable Computing Systems
Book SynopsisA team of recognized experts leads the way to dependable computing systems With computers and networks pervading every aspect of daily life, there is an ever-growing demand for dependability. In this unique resource, researchers and organizations will find the tools needed to identify and engage state-of-the-art approaches used for the specification, design, and assessment of dependable computer systems. The first part of the book addresses models and paradigms of dependable computing, and the second part deals with enabling technologies and applications. Tough issues in creating dependable computing systems are also tackled, including: * Verification techniques * Model-based evaluation * Adjudication and data fusion * Robust communications primitives * Fault tolerance * Middleware * Grid security * Dependability in IBM mainframes * Embedded software * Real-time systems Each chapter of thTrade Review" … a very interesting and useful book." (IEEE Communications Magazine, October 2006) "…a solid collection of research papers on the specification, design, and assessment of dependable computer systems." (CHOICE, March 2006)Table of ContentsPreface xxiii Contributors xxxv Acknowledgments xxxix Part I Models and Paradigms 1 1. Formal Verification Techniques for Digital Systems 3 Masahiro Fujita, Satoshi Komatsu, and Hiroshi Saito 1.1 Introduction 3 1.2 Basic Techniques for Formal Verification 4 1.3 Verification Techniques for Combinational Circuit Equivalence 7 1.4 Verification Techniques for Sequential Circuits 14 1.5 Summary 24 References 24 2. Tolerating Arbitrary Failures With State Machine Replication 27 Assia Doudou, Benoît Garbinato, and Rachid Guerraoui 2.1 Introduction 27 2.2 System Model 31 2.3 Total Order Broadcast 32 2.4 Weak Interactive Consistency 36 2.5 Muteness Failure Detector 44 2.6 Concluding Remarks 52 References 55 3. Model-Based Evaluation as a Support to the Design of Dependable Systems 57 Andrea Bondavalli, Silvano Chiaradonna, and Felicita di Giandomenico 3.1 Introduction 57 3.2 The Role of Model-Based Evaluation in the Development of Dependable Systems 58 3.3 Dependability Modeling Methodologies and Tools 61 3.4 Analytical Modeling to Support Design Decisions 68 3.5 Analytical Modeling to Support Fault Removal During Operational Life 76 3.6 Summary 82 References 82 4. Voting: A Paradigm for Adjudication and Data Fusion in Dependable Systems 87 Behrooz Parhami 4.1 Introduction 87 4.2 Voting in Dependable Systems 88 4.3 Voting Schemes and Problems 94 4.4 Voting for Data Fusion 98 4.5 Implementation Issues 102 4.6 Unifying Concepts 107 4.7 Conclusion 110 References 111 5. Robust Communication Primitives for Wireless Sensor Networks 115 Amol Bakshi and Viktor K. Prasanna 5.1 Introduction 115 5.2 Defining Realistic Models 117 5.3 Our System Model 119 5.4 Permutation Routing in a Single-hop Topology: State-of-the-Art 121 5.5 An Energy-Efficient Protocol Using a Low-Power Control Channel 125 5.6 Our Routing Protocol for a Faulty Network 132 5.7 Our Generalized Protocol for a Multichannel Network 135 5.8 Concluding Remarks 140 References 140 6. System-Level Diagnosis and Implications in Current Context 143 Arun K. Somani 6.1 Issues in Large and Complex Computing Systems 143 6.2 System-Level Diagnosis 145 6.3 Classification of Diagnosable Systems 148 6.4 Diagnosability Algorithms 157 6.5 Diagnosis Algorithms 160 6.6 Application of System-Level Diagnosis Algorithm 165 6.7 Summary and Conclusions 166 References 167 7. Predicate Detection in Asynchronous Systems With Crash Failures 171 Felix C. Gärtner and Stefan Pleisch 7.1 Introduction 171 7.2 Predicate Detection in Fault-Free Environments 173 7.3 Failures and Failure Detection 177 7.4 Predicate Detection in Faulty Environments 183 7.5 Solving Predicate Detection in Faulty Environments 194 7.6 Conclusion 209 References 211 8. Fault Tolerance Against Design Faults 213 Lorenzo Strigini 8.1 Introduction 213 8.2 Examples and Principles 215 8.3 Potential and Actual Benefits 225 8.4 Design Solutions 230 8.5 Summary 236 References 238 9. Formal Methods for Safety Critical Systems 243 Ali E. Abdallah, Jonathan P. Bowen, and Nimal Nissanke 9.1 Introduction 243 9.2 Specification of Safety 245 9.3 Historical Background 247 9.4 Safety 248 9.5 Application Areas 253 9.6 Specification Framework 256 9.7 System State and Behavior 262 9.8 Discussion 265 9.9 Conclusion 268 References 269 Part II Enabling Technologies and Applications 273 10. Dependability Support in Wireless Sensor Networks 275 Denis Gracanin, Mohamed Eltoweissy, Stephan Olariu, and Ashraf Wadaa 10.1 Motivation and Background 276 10.2 Service Centric Model 279 10.3 Conclusion 283 References 283 11. Availability Modeling in Practice 285 Kishor S. Trivedi, Archana Sathaye, and Srinivasan Ramani 11.1 Introduction 285 11.2 Modeling Approaches 286 11.3 Composite Availability and Performance Model 292 11.4 Digital Equipment Corporation Case Study 297 11.5 Conclusion 315 References 315 12. Experimental Dependability Evaluation 319 João Gabriel Silva and Henrique Madeira 12.1 Field Measurement 321 12.2 Fault Injection 323 12.3 Robustness Testing 337 12.4 Recent Developments: Dependability Benchmarking 340 12.5 Conclusion 342 References 343 13. A Dependable Architecture for Telemedicine in Support of Disaster Relief 349 Stephan Olariu, Kurt Maly, Edwin C. Foudriat, Sameh M. Yamany, and Thomas Luckenbach 13.1 Introduction 349 13.2 Telemedicine—State of the Art 350 13.3 The WIRM System Architecture 352 13.4 A Novel 3D Data Compression Technique 356 13.5 Interactive Remote Visualization 358 13.6 An Overview of H3M—Our Wireless Architecture 359 13.7 Concluding Remarks 366 References 366 14. An Overview of IBM Mainframe Dependable Computing: From System/360 to Series 369 Lisa Spainhower 14.1 Introduction 369 14.2 Error Detection and Fault Isolation 375 14.3 Instruction Level Retry 380 14.4 Online Repair 386 14.5 Summary 391 References 392 15. Tracking the Propagation of Data Errors in Software 395 Martin Hiller, Arshad Jhumka, and Neeraj Suri 15.1 Introduction 395 15.2 Target System Model 396 15.3 Overview of the Tool Suite 397 15.4 Setup: Experiment Design and Target Instrumentation 401 15.5 Injection: Running Experiments 407 15.6 Analysis: Obtaining Error Propagation Characteristics 408 15.7 Example Results Generated by Propane 409 15.8 Propane’s Attributes and Main Characteristics 414 15.9 Summary 415 References 416 16. Integrated Reliable Real-Time Systems 419 Mohamed Younis 16.1 Background 421 16.2 Integration Issues 425 16.3 Few Forward Steps 429 16.4 An Example Aerospace Application 432 16.5 Conclusion 442 References 443 17. Network Resilience by Emergent Behavior from Simple Autonomous Agents 449 Bjarne E. Helvik and Otto Wittner 17.1 Introduction 449 17.2 Network Resilience 450 17.3 Handling Routing and Resources in Networks by Emergence 457 17.4 Cross-Entropy Based Path Finding 460 17.5 Finding “Best-Effort” Primary/Backup Paths 468 17.6 Discussion 473 17.7 Concluding Remarks 475 References 475 18. Safeguarding Critical Infrastructures 479 David Gamez, Simin Nadjm-Tehrani, John Bigham, Claudio Balducelli, Kalle Burbeck, and Tobias Chyssler 18.1 Introduction 479 18.2 Attacks, Failures, and Accidents 480 18.3 Solutions 483 18.4 The Safeguard Architecture 486 18.5 Future Work 497 18.6 Conclusion 497 References 498 19. Impact of Traffic Self-Similarity on the Performance of Routing Algorithms in Multicomputer Systems 501 Geyong Min, Mohamed Ould-Khaoua, Demetres D. Kouvatsos, and Irfan U. Awan 19.1 Introduction 502 19.2 The k-ary n-Cube and Dimension-Ordered Routing 504 19.3 Modeling of Traffic Self-Similarity 506 19.4 The Analytical Model 507 19.5 Impact of Self-Similar Traffic on Routing Performance 518 19.6 Conclusions 519 References 520 Appendix 19.1: Notation 523 20. Some Observations on Adaptive Meta-Heuristics for Routing in Datagram Networks 525 Albert Y. Zomaya, Tysun Chan, and Miro Kraetzl 20.1 Introduction 525 20.2 The Routing Problem 526 20.3 Genetic Algorithms and Routing 532 20.4 Genetic Routing Protocol Design 536 20.5 Genetic Routing Protocol Implementation 547 20.6 Results and Analysis 552 20.7 Conclusions 560 References 561 21. Reconfigurable Computing for Cryptography 563 Hassan B. Diab 21.1 Introduction 564 21.2 Reconfigurable Computing 565 21.3 AES Cryptography 576 21.4 Case Study: The Twofish Cipher on a Dynamic RC System 579 21.5 Future of RC 589 21.6 Conclusion 590 References 591 22. Dependability of Reconfigurable Computing 597 Mohamed Younis, I-Hong Yeh, Nicholas Kyriakopoulos, Nikitas Alexandridis, and Tarek El-Ghazawi 22.1 FPGA Preliminaries 598 22.2 FPGA Fault Taxonomy 603 22.3 Handling FPGA Failures 608 22.4 Conclusion and Open Issues 621 References 622 Index 627
£152.06
John Wiley & Sons Inc Understanding Information Transmission
Book SynopsisUnderstanding Information Transmission introduces you to the entire field of information technology. In this consumer handbook and introductory student resource, seven chapters span the gamut of the field-the nature, storage, transmission, networking, and protection of information.Table of ContentsPreface vii 1. Introduction: First Ideas and Some History 1 1.1 What is communication? 2 1.2 Why digital communication? 6 1.3 Some history 8 1.4 A few remarks on intellectual history 27 1.5 Conclusions 28 References 29 2. Mathematical Methods of Information Transmission: Why Sinusoids? 30 2.1 Linear, time-invariant (LTI) systems 31 2.2 On the importance of being sinusoidal 43 2.3 The Fourier transform 48 2.4 What is bandwidth? 58 2.5 Discrete-time systems 66 2.6 Conclusions 69 References 70 Problems 70 3. Information Sources: What is Out There to be Sent? 77 3.1 What is text? 78 3.2 What is speech? 81 3.3 What is music? 88 3.4 What is an image? 94 3.5 What is video? 98 3.6 Conclusion 102 References 102 Problems 103 4. Transmission Methods: How is Information Sent? 105 4.1 Communication channels 105 4.2 Analog modulation 117 4.3 Digital modulation 127 4.4 FM stereo, television and a little about electronics 139 4.5 Conclusions 146 References 147 Problems 147 5. Information Theory and Coding: What did Shannon Promise? 150 5.1 Information theory—a primer 152 5.2 Methods of source coding 179 5.3 Methods of channel coding 189 5.4 Trellis coded modulation 199 5.5 Conclusions 205 References 206 Problems 207 6. Cryptology: FUBSWRORJB?? 211 6.1 Fundamentals of cryptosystems 211 6.2 Caesar and Vigenere ciphers 215 6.3 The Vernam cipher and perfect secrecy 219 6.4 Stream ciphers 220 6.5 Block ciphers 223 6.6 Cryptomachines during World War II 224 6.7 Two-key cryptography 228 6.8 Conclusions 239 References 239 Problems 239 7. Communication Networks: Let's Get Connected 241 7.1 An overview of information networks 241 7.2 Circuit switching: The telephone net 252 7.3 Mobile telephony 260 7.4 The Internet 265 References 275 Appendix A: Complex Numbers 276 Appendix B: Sinusoids and Circuit Theory 281 Appendix C: Probability Theory: A Primer 297 Index 306 About the Authors
£65.66
John Wiley & Sons Inc Learning from Data
Book SynopsisAn interdisciplinary framework for learning methodologiescovering statistics, neural networks, and fuzzy logic, this book provides a unified treatment of the principles and methods for learning dependencies from data. It establishes a general conceptual framework in which various learning methods from statistics, neural networks, and fuzzy logic can be appliedshowing that a few fundamental principles underlie most new methods being proposed today in statistics, engineering, and computer science. Complete with over one hundred illustrations, case studies, and examples making this an invaluable text.Trade Review"I think Learning From Data is a very valuable volume. I will recommend it to my graduate students." (Journal of the American Statistical Association, March 2009) "The broad spectrum of information it offers is beneficial to many field of research. The selection of topics is good, and I believe that many researchers and practioners will find this book useful." (Technometrics, May 2008) "The authors have succeeded in summarizing some of the recent trends and future challenges in different learning methods, including enabling technologies and some interesting practical applications." (Computing Reviews, May 22, 2008)Table of ContentsPREFACE. NOTATION. 1 Introduction. 1.1 Learning and Statistical Estimation. 1.2 Statistical Dependency and Causality. 1.3 Characterization of Variables. 1.4 Characterization of Uncertainty. 1.5 Predictive Learning versus Other Data Analytical Methodologies. 2 Problem Statement, Classical Approaches, and Adaptive Learning. 2.1 Formulation of the Learning Problem. 2.1.1 Objective of Learning. 2.1.2 Common Learning Tasks. 2.1.3 Scope of the Learning Problem Formulation. 2.2 Classical Approaches. 2.2.1 Density Estimation. 2.2.2 Classification. 2.2.3 Regression. 2.2.4 Solving Problems with Finite Data. 2.2.5 Nonparametric Methods. 2.2.6 Stochastic Approximation. 2.3 Adaptive Learning: Concepts and Inductive Principles. 2.3.1 Philosophy, Major Concepts, and Issues. 2.3.2 A Priori Knowledge and Model Complexity. 2.3.3 Inductive Principles. 2.3.4 Alternative Learning Formulations. 2.4 Summary. 3 Regularization Framework. 3.1 Curse and Complexity of Dimensionality. 3.2 Function Approximation and Characterization of Complexity. 3.3 Penalization. 3.3.1 Parametric Penalties. 3.3.2 Nonparametric Penalties. 3.4 Model Selection (Complexity Control). 3.4.1 Analytical Model Selection Criteria. 3.4.2 Model Selection via Resampling. 3.4.3 Bias–Variance Tradeoff. 3.4.4 Example of Model Selection. 3.4.5 Function Approximation versus Predictive Learning. 3.5 Summary. 4 Statistical Learning Theory. 4.1 Conditions for Consistency and Convergence of ERM. 4.2 Growth Function and VC Dimension. 4.2.1 VC Dimension for Classification and Regression Problems. 4.2.2 Examples of Calculating VC Dimension. 4.3 Bounds on the Generalization. 4.3.1 Classification. 4.3.2 Regression. 4.3.3 Generalization Bounds and Sampling Theorem. 4.4 Structural Risk Minimization. 4.4.1 Dictionary Representation. 4.4.2 Feature Selection. 4.4.3 Penalization Formulation. 4.4.4 Input Preprocessing. 4.4.5 Initial Conditions for Training Algorithm. 4.5 Comparisons of Model Selection for Regression. 4.5.1 Model Selection for Linear Estimators. 4.5.2 Model Selection for k-Nearest-Neighbor Regression. 4.5.3 Model Selection for Linear Subset Regression. 4.5.4 Discussion. 4.6 Measuring the VC Dimension. 4.7 VC Dimension, Occam’s Razor, and Popper’s Falsifiability. 4.8 Summary and Discussion. 5 Nonlinear Optimization Strategies. 5.1 Stochastic Approximation Methods. 5.1.1 Linear Parameter Estimation. 5.1.2 Backpropagation Training of MLP Networks. 5.2 Iterative Methods. 5.2.1 EM Methods for Density Estimation. 5.2.2 Generalized Inverse Training of MLP Networks. 5.3 Greedy Optimization. 5.3.1 Neural Network Construction Algorithms. 5.3.2 Classification and Regression Trees. 5.4 Feature Selection, Optimization, and Statistical Learning Theory. 5.5 Summary. 6 Methods for Data Reduction and Dimensionality Reduction. 6.1 Vector Quantization and Clustering. 6.1.1 Optimal Source Coding in Vector Quantization. 6.1.2 Generalized Lloyd Algorithm. 6.1.3 Clustering. 6.1.4 EM Algorithm for VQ and Clustering. 6.1.5 Fuzzy Clustering. 6.2 Dimensionality Reduction: Statistical Methods. 6.2.1 Linear Principal Components. 6.2.2 Principal Curves and Surfaces. 6.2.3 Multidimensional Scaling. 6.3 Dimensionality Reduction: Neural Network Methods. 6.3.1 Discrete Principal Curves and Self-Organizing Map Algorithm. 6.3.2 Statistical Interpretation of the SOM Method. 6.3.3 Flow-Through Version of the SOM and Learning Rate Schedules. 6.3.4 SOM Applications and Modifications. 6.3.5 Self-Supervised MLP. 6.4 Methods for Multivariate Data Analysis. 6.4.1 Factor Analysis. 6.4.2 Independent Component Analysis. 6.5 Summary. 7 Methods for Regression. 7.1 Taxonomy: Dictionary versus Kernel Representation. 7.2 Linear Estimators. 7.2.1 Estimation of Linear Models and Equivalence of Representations. 7.2.2 Analytic Form of Cross-Validation. 7.2.3 Estimating Complexity of Penalized Linear Models. 7.2.4 Nonadaptive Methods. 7.3 Adaptive Dictionary Methods. 7.3.1 Additive Methods and Projection Pursuit Regression. 7.3.2 Multilayer Perceptrons and Backpropagation. 7.3.3 Multivariate Adaptive Regression Splines. 7.3.4 Orthogonal Basis Functions and Wavelet Signal Denoising. 7.4 Adaptive Kernel Methods and Local Risk Minimization. 7.4.1 Generalized Memory-Based Learning. 7.4.2 Constrained Topological Mapping. 7.5 Empirical Studies. 7.5.1 Predicting Net Asset Value (NAV) of Mutual Funds. 7.5.2 Comparison of Adaptive Methods for Regression. 7.6 Combining Predictive Models. 7.7 Summary. 8 Classification. 8.1 Statistical Learning Theory Formulation. 8.2 Classical Formulation. 8.2.1 Statistical Decision Theory. 8.2.2 Fisher’s Linear Discriminant Analysis. 8.3 Methods for Classification. 8.3.1 Regression-Based Methods. 8.3.2 Tree-Based Methods. 8.3.3 Nearest-Neighbor and Prototype Methods. 8.3.4 Empirical Comparisons. 8.4 Combining Methods and Boosting. 8.4.1 Boosting as an Additive Model. 8.4.2 Boosting for Regression Problems. 8.5 Summary. 9 Support Vector Machines. 9.1 Motivation for Margin-Based Loss. 9.2 Margin-Based Loss, Robustness, and Complexity Control. 9.3 Optimal Separating Hyperplane. 9.4 High-Dimensional Mapping and Inner Product Kernels. 9.5 Support Vector Machine for Classification. 9.6 Support Vector Implementations. 9.7 Support Vector Regression. 9.8 SVM Model Selection. 9.9 Support Vector Machines and Regularization. 9.10 Single-Class SVM and Novelty Detection. 9.11 Summary and Discussion. 10 Noninductive Inference and Alternative Learning Formulations. 10.1 Sparse High-Dimensional Data. 10.2 Transduction. 10.3 Inference Through Contradictions. 10.4 Multiple-Model Estimation. 10.5 Summary. 11 Concluding Remarks. Appendix A: Review of Nonlinear Optimization. Appendix B: Eigenvalues and Singular Value Decomposition. References. Index.
£126.85
John Wiley & Sons Inc Numerical Simulations and Case Studies Using
Book SynopsisReaders learn how to master the numerical simulation process required to design, test and support mobile and parallel computing systems. By presenting a series of straightforward program examples as a foundation, the authors show how problems in numerical methods and simulations are skillfully solved with the aid of Visual C++. .Trade Review"I recommend this book to anybody that needs to develop computer applications for numerical analysis." (Computing Reviews.com, July 3, 2006) "The coverage of each topic is brief but thorough." (CHOICE, December 2005)Table of ContentsPreface. 1. Developing Applications Using Visual C++.Net. 1.1 Object-Oriented Approach to Visual C++.Net. 1.2 MFC Fundamental Features. 1.3 Writing Applications Using MFC. 1.4 Writing the First Nonwizard Program. 1.5 Discussion. 1.6 Summary and Conclusion. Bibliography. 2. Interfaces for Numerical Problems. 2.1 Visualizing a Numerical Problem. 2.2 Handling Arrays. 2.3 Finding the Root of a Nonlinear Equation. 2.4 Solving a System of Linear Equations. 2.5 Summary and Conclusion. Bibliography. Code Listings. 3. Matrix Operations Using Wizard. 3.1 Document/View Architecture Using Wizard. 3.2 Matrix Algebra. 3.3 System of Linear Equations Problem Revisited. 3.4 Summary and Conclusion. Bibliography. Code Listings. 4. Differential Equations Problems. 4.1 Differential Equations. 4.2 Ordinary Differential Equations. 4.3 Partial Differential Equations. 4.4 Summary and Conclusion. Bibliography. Code Listings. 5. Drawing Curves. 5.1 Windows Graphics Representation. 5.2 MFC Functions for Displaying Graphics. 5.3 Drawing a Curve. 5.4 Cubic Spline Interpolation. 5.5 Summary and Conclusion. Bibliography. Code Listings. 6. Working with Images. 6.1 Handling Images. 6.2 Bitmap File Format. 6.3 Edge-Detection Problem. 6.4 Summary and Conclusion. Bibliographical Note. Code Listing. 7. Visualizing a Graph. 7.1 Elementary Graph Concepts. 7.2 Graph Visualization Model. 7.3 Minimum Spanning Tree Problem. 7.4 Summary and Conclusion. Bibliography. Code Listings. 8. Graph Applications. 8.1 Graph-Network Relationship. 8.2 Shortest-Path Problem. 8.3 Mesh Network Applications. 8.4 Summary and Conclusion. Bibliography. Code Listings. 9. Multiprocessor Scheduling Problem. 9.1 Parallel Computing Systems. 9.2 Task Scheduling Problem. 9.3 Task Scheduling Visualization Model. 9.4 Summary and Conclusion. Bibliography. Code Listings. 10. Discrete-Event Simulation. 10.1 Concepts of Simulation. 10.2 Simulation Model Development. 10.3 Discrete-Event System Simulations. 10.4 Multicounter System with Blocking. 10.5 Queueing Systems. 10.6 Summary and Conclusion. Bibliography. Code Listings. 11. Modeling Wireless Networks. 11.1 Wireless Cellular Networks. 11.2 Channel-Assignment Problem. 11.3 Channel Assignments: Discrete Model. 11.4 Solving the Channel-Assignment Problem. 11.5 Summary and Conclusion. Bibliography. Code Listings. Index.
£121.46
John Wiley & Sons Inc Smart Technology for Aging Disability and
Book SynopsisA thorough introduction to the technologies promoting independence for older and disabled persons as they face age related declines and age related chronic conditions.Trade Review"…an in-depth overview of the current development and future trends on assistive technologies." (E-STREAMS, January 2007) "The well-organized book, which is part of two-volume series, would be a helpful resource for rehabilitation professionals, health care providers and technology researchers." (Quest, May-June 2006) "...a wealth of information...delivered in a clear and understandable format...a valuable contribution to the field of assistive technology." (IEEE Engineering in Medicine and Biology Magazine, March/April 2006) "...a readable and current description of specific assistive technologies and general living environments for the elderly...clearly an important book for all computer science students and professionals to read." (Computing Reviews.com, December 27, 2005) "...an essential resource for professionals in the rehabilitation science, health care providers, and individuals eager to learn more about what is available & what is being developed in assistive technology." (Help's Here! Resources for Seniors and Caregivers, Fall/Winter 2005)Table of ContentsPreface. Contributors. Chapter 1. Aging, Disability, and Independence: Trends and Perspectives. PART I: SMART TECHNOLOGY FOR AGING, DISABIITY AND INDEPENDENCE. Chapter 2. Home Automation and Smart Environments to Support Independence. Chapter 3. Robotics. Chapter 4. Other Devices and High Technology Solutions. Chapter 5. Telehealth. PART II. RELATED ASPECTS OF AGING, DISABILITY AND INDEPENDENCE. Chapter 6. Basic Assistive Technology. Chapter 7. Elder Drivers and Technology. Chapter 8. Transportation and Community Mobility. Chapter 9. Home Modifications and Universal Design. Chapter 10. Injury Prevention and Health Promotion. Index.
£107.06
John Wiley & Sons Inc Sensing Intelligence Motion
Book SynopsisA leap forward in the field of robotics Until now, most of the advances in robotics have taken place in structured environments. Scientists and engineers have designed highly sophisticated robots, but most are still only able to operate and move in predetermined, planned environments designed specifically for the robots and typically at very high cost. This new book takes robotics to the next level by setting forth the theory and techniques needed to achieve robotic motion in unstructured environments. The ability to move and operate in an arbitrary, unplanned environment will lead to automating a wide range of new robotic tasks, such as patient care, toxic site cleanup, and planetary exploration. The approach that opens the door for robots to handle unstructured tasks is known as Sensing-Intelligence-Motion (SIM), which draws from research in topology, computational complexity, control theory, and sensing hardware. Using SIM as an underlying foundation, the aTrade Review"This book represents a very stimulating and personal contribution to the field of algorithmic robotics." (Pragmatics & Cognition) "…a good text for senior undergraduates and graduate students with an interest in robot motion." (Computing Reviews.com, May 25, 2006)Table of ContentsPreface. Acknowledgments. 1 Motion Planning—Introduction. 1.1 Introduction. 1.2 Basic Concepts. 1.2.1 Robot? What Robot? 1.2.2 Space. Objects. 1.2.3 Input Information. Sensing. 1.2.4 Degrees of Freedom. Coordinate Systems. 1.2.5 Motion Control. 1.2.6 Robot Programming. 1.2.7 Motion Planning. 2 A Quick Sketch of Major Issues in Robotics. 2.1 Kinematics. 2.2 Statics. 2.3 Dynamics. 2.4 Feedback Control. 2.5 Compliant Motion. 2.6 Trajectory Modification. 2.7 Collision Avoidance. 2.8 Motion Planning with Complete Information. 2.9 Motion Planning with Incomplete Information. 2.9.1 The Beginnings. 2.9.2 Maze-to-Graph Transition. 2.9.3 Sensor-Based Motion Planning. 2.10 Exercises. 3 Motion Planning for a Mobile Robot. 3.1 The Model. 3.2 Universal Lower Bound for the Path Planning Problem. 3.3 Basic Algorithms. 3.3.1 First Basic Algorithm: Bug1. 3.3.2 Second Basic Algorithm: Bug2. 3.4 Combining Good Features of Basic Algorithms. 3.5 Going After Tighter Bounds. 3.6 Vision and Motion Planning. 3.6.1 The Model. 3.6.2 Algorithm VisBug-21. 3.6.3 Algorithm VisBug-22. 3.7 From a Point Robot to a Physical Robot. 3.8 Other Approaches. 3.9 Which Algorithm to Choose? 3.10 Discussion. 3.11 Exercises. 4 Accounting for Body Dynamics: The Jogger’s Problem. 4.1 Problem Statement. 4.2 Maximum Turn Strategy. 4.2.1 The Model. 4.2.2 Sketching the Approach. 4.2.3 Velocity Constraints. Minimum Time Braking. 4.2.4 Optimal Straight-Line Motion. 4.2.5 Dynamics and Collision Avoidance. 4.2.6 The Algorithm. 4.2.7 Examples. 4.3 Minimum Time Strategy. 4.3.1 The Model. 4.3.2 Sketching the Approach. 4.3.3 Dynamics and Collision Avoidance. 4.3.4 Canonical Solution. 4.3.5 Near-Canonical Solution. 4.3.6 The Algorithm. 4.3.7 Convergence. Computational Complexity. 4.3.8 Examples. 5 Motion Planning for Two-Dimensional Arm Manipulators. 5.1 Introduction. 5.1.1 Model and Definitions. 5.2 Planar Revolute–Revolute (RR) Arm. 5.2.1 Analysis. 5.2.2 Algorithm. 5.2.3 Step Planning. 5.2.4 Example. 5.2.5 Motion Planning with Vision and Proximity Sensing. 5.2.6 Concluding Remarks. 5.3 Distinct Kinematic Configurations of RR Arm. 5.4 Prismatic–Prismatic (PP, or Cartesian) Arm. 5.5 Revolute–Prismatic (RP) Arm with Parallel Links. 5.6 Revolute–Prismatic (RP) Arm with Perpendicular Links. 5.7 Prismatic–Revolute (PR) Arm. 5.8 Topology of Arm’s Free Configuration Space. 5.8.1 Workspace; Configuration Space. 5.8.2 Interaction Between the Robot and Obstacles. 5.8.3 Uniform Local Connectedness. 5.8.4 The General Case of 2-DOF Arm Manipulators. 5.9 Appendix. 5.10 Exercises. 6 Motion Planning for Three-Dimensional Arm Manipulators. 6.1 Introduction. 6.2 The Case of the PPP (Cartesian) Arm. 6.2.1 Model, Definitions, and Terminology. 6.2.2 The Approach. 6.2.3 Topology of W-Obstacles and C-Obstacles. 6.2.4 Connectivity of C. 6.2.5 Algorithm. 6.2.6 Examples. 6.3 Three-Link XXP Arm Manipulators. 6.3.1 Robot Arm Representation Spaces. 6.3.2 Monotonicity of Joint Space. 6.3.3 Connectivity of Jf. 6.3.4 Retraction of Jf. 6.3.5 Configuration Space and Its Retract. 6.3.6 Connectivity Graph. 6.3.7 Lifting 2D Algorithms into 3D. 6.3.8 Step Planning. 6.3.9 Discussion. 6.4 Other XXX Arms. 7 Human Performance in Motion Planning. 7.1 Introduction. 7.2 Preliminary Observations. 7.2.1 Moving in a Maze. 7.2.2 Moving an Arm Manipulator. 7.2.3 Conclusions and Plan for Experiment Design. 7.3 Experiment Design. 7.3.1 The Setup. 7.3.2 Test Protocol. 7.4 Results—Experiment One. 7.4.1 Principal Components Analysis. 7.4.2 Nonparametric Statistics. 7.4.3 Univariate Analysis of Variance. 7.4.4 Two-Way Analysis of Variance. 7.4.5 Implementation: Two-Way Analysis for Path Length. 7.4.6 Implementation: Two-Way Analysis for Completion Time. 7.5 Results—Experiment Two. 7.5.1 The Technique. 7.5.2 Implementation Scheme. 7.5.3 Results and Interpretation. 7.6 Discussion. 8 Sensitive Skin—Designing an All-Sensitive Robot Arm Manipulator. 8.1 Introduction. 8.2 Salient Characteristics of a Sensitive Skin. 8.3 Skin Design. 8.4 Examples. 9 Suggested Course Projects. References. Index.
£145.76
John Wiley & Sons Inc Parallel Computing for Bioinformatics and
Book SynopsisParallel Computing for Bioinformatics is the first book to deal with the topic of parallel computing and bioinformatics. Written by renowned experts and well-reputed researchers in this emerging field, it provides an opportunity for researchers to explore the rich and complex subject of ?Bioinformatics?.Trade Review"…clearly written and understandable…researchers and students in the related areas will find the style and format familiar and the content valuable." (E-STREAMS, September 2007) "…a building block on computational biology concepts to help researchers and students work on more innovative ideas." (IEEE Distributed Systems Online, March 2007) "…a good overview of the current state of computing in these areas." (CHOICE, November 2006) "…this book presents researchers in computational biology, bioinformatics, mathematics, statistics, and computer science with the opportunity to explore this interdisciplinary research area…" (Computing Reviews.com, September 27, 2006)Table of ContentsPreface. Contributors. Acknowledgments. PART I: ALGORITHMS AND MODELS. 1 Parallel and Evolutionary Approaches to Computational Biology (Nouhad J. Rizk). 1.1 Introduction. 1.2 Bioinformatics. 1.3 Evolutionary Computation Applied to Computational Biology. 1.4 Conclusions. References. 2 Parallel Monte Carlo Simulation of HIV Molecular Evolution in Response to Immune Surveillance (Jack da Silva). 2.1 Introduction. 2.2 The Problem. 2.3 The Model. 2.4 Parallelization with MPI. 2.5 Parallel Random Number Generation. 2.6 Preliminary Simulation Results. 2.7 Future Directions. References. 3 Differential Evolutionary Algorithms for In Vivo Dynamic Analysis of Glycolysis and Pentose Phosphate Pathway in Escherichia coli (Christophe Chassagnole). 3.1 Introduction. 3.2 Mathematical Model. 3.3 Estimation of the Parameters of the Model. 3.4 Kinetic Parameter Estimation by DE. 3.5 Simulation and Results. 3.6 Stability Analysis. 3.7 Control Characteristic. 3.8 Conclusions. References. 4 Compute-Intensive Simulations for Cellular Models (K. Burrage). 4.1 Introduction. 4.2 Simulation Methods for Stochastic Chemical Kinetics. 4.3 Aspects of Biology— Genetic Regulation. 4.4 Parallel Computing for Biological Systems. 4.5 Parallel Simulations. 4.6 Spatial Modeling of Cellular Systems. 4.7 Modeling Colonies of Cells. References. 5 Parallel Computation in Simulating Diffusion and Deformation in Human Brain (Ning KangI0. 5.1 Introduction. 5.2 Anisotropic Diffusion Simulation in White Matter Tractography. 5.3 Brain Deformation Simulation in Image-Guided Neurosurgery. 5.4 Summary. References. PART II: SEQUENCE ANALYSIS AND MICROARRAYS. 6 Computational Molecular Biology (Azzedine Boukerche). 6.1 Introduction. 6.2 Basic Concepts in Molecular Biology. 6.3 Global and Local Biological Sequence Alignment. 6.4 Heuristic Approaches for Biological Sequence Comparison. 6.5 Parallel and Distributed Sequence Comparison. 6.6 Conclusions. References. 7 Special-Purpose Computing for Biological Sequence Analysis (Bertil Schmidt). 7.1 Introduction. 7.2 Hybrid Parallel Computer. 7.3 Dynamic Programming Communication Pattern. 7.4 Performance Evaluation. 7.5 FutureWork and Open Problems. 7.6 Tutorial. References. 8 Multiple Sequence Alignment in Parallel on a Cluster ofWorkstations (Amitava Datta). 8.1 Introduction. 8.2 CLUSTALW. 8.3 Implementation. 8.4 Results. 8.5 Conclusion. References. 9 Searching Sequence Databases Using High-Performance BLASTs (Xue Wu). 9.1 Introduction. 9.2 Basic Blast Algorithm. 9.3 Blast Usage and Performance Factors. 9.4 High Performance BLASTs. 9.5 Comparing BLAST Performance. 9.6 UMD-BLAST. 9.7 Future Directions. 9.8 RelatedWork. 9.9 Summary. References. 10 Parallel Implementations of Local Sequence Alignment: Hardware and Software (Vipin Chaudhary). 10.1 Introduction. 10.2 Sequence Alignment Primer. 10.3 Smith–Waterman Algorithm. 10.4 FASTA. 10.5 BLAST. 10.6 HMMER — Hidden Markov Models. 10.7 ClustalW. 10.8 Specialized Hardware: FPGA. 10.9 Conclusion. References. 11 Parallel Computing in the Analysis of Gene Expression Relationships (Robert L. Martino). 11.1 Significance of Gene Expression Analysis. 11.2 Multivariate Gene Expression Relations. 11.3 Classification Based on Gene Expression. 11.4 Discussion and Future Directions. References. 12 Assembling DNA Fragments with a Distributed Genetic Algorithm (Gabriel Luque). 12.1 Introduction. 12.2 DNA Fragment Assembly Problem. 12.3 DNA Fragment Assembly Using the Sequential GA. 12.4 DNA Fragment Assembly Problem Using the Parallel GA. 12.5 Experimental Results. 12.6 Conclusions. References. 13 A Cooperative Genetic Algorithm for Knowledge Discovery in Microarray Experiments (Mohammed Khabzaoui). 13.1 Introduction. 13.2 Microarray Experiments. 13.3 Association Rules. 13.4 Multi-Objective Genetic Algorithm. 13.5 Cooperative Multi-Objective Genetic Algorithm (PMGA). 13.6 Experiments. 13.7 Conclusion. References. PART III: PHYLOGENETICS. 14 Parallel and Distributed Computation of Large Phylogenetic Trees (Alexandros Stamatakis). 14.1 Introduction. 14.2 Maximum Likelihood. 14.3 State-of-the-Art ML Programs. 14.4 Algorithmic Solutions in RAxML-III. 14.5 HPC Solutions in RAxML-III. 14.6 Future Developments. References. 15 Phylogenetic Parameter Estimation on COWs (Ekkehard Petzold). 15.1 Introduction. 15.2 Phylogenetic Tree Reconstruction using Quartet Puzzling. 15.3 Hardware, Data, and Scheduling Algorithms. 15.4 Parallelizing PEst. 15.5 Extending Parallel Coverage in PEst. 15.6 Discussion. References. 16 High-Performance Phylogeny Reconstruction Under Maximum Parsimony (Tiffani L. Williams). 16.1 Introduction. 16.2 Maximum Parsimony. 16.3 Exact MP: Parallel Branch and Bound. 16.4 MP Heuristics: Disk-Covering Methods. 16.5 Summary and Open Problems. References. PART IV: PROTEIN FOLDING. 17 Protein Folding with the Parallel Replica Exchange Molecular Dynamics Method (Ruhong Zhou). 17.1 Introduction. 17.2 REMD Method. 17.3 Protein Folding with REMD. 17.4 Protein Structure Refinement with REMD. 17.5 Summary. References. 18 High-Performance Alignment Methods for Protein Threading (R. Andonov). 18.1 Introduction. 18.2 Formal Definition. 18.3 Mixed Integer Programming Models. 18.4 Divide-and-Conquer Technique. 18.5 Parallelization. 18.6 Future Research Directions. 18.7 Conclusion. 18.8 Summary. References. 19 Parallel Evolutionary Computations in Discerning Protein Structures (Richard O. Day). 19.1 Introduction. 19.2 PSP Problem. 19.3 Protein Structure Discerning Methods. 19.4 PSP Energy Minimization EAs. 19.5 PSP Parallel EA Performance Evaluation. 19.6 Results and Discussion. 19.7 Conclusions and Suggested Research. References. PART V: PLATFORMS AND ENABLING TECHNOLOGIES. 20 A Brief Overview of Grid Activities for Bioinformatics and Health Applications (Ali Al Mazari). 20.1 Introduction. 20.2 Grid Computing. 20.3 Bioinformatics and Health Applications. 20.4 Grid Computing for Bioinformatics and Health Applications. 20.5 Grid Activities in Europe. 20.6 Grid Activities in the United Kingdom. 20.7 Grid Activities in the USA. 20.8 Grid Activities in Asia and Japan. 20.9 International Grid Collaborations. 20.10 International Grid Collaborations. 20.11 Conclusions and Future Trends. References. 21 Parallel Algorithms for Bioinformatics (Shahid H. Bokhari). 21.1 Introduction. 21.2 Parallel Computer Architecture. 21.3 Bioinformatics Algorithms on the Cray MTA System. 21.4 Summary. References. 22 Cluster and Grid Infrastructure for Computational Chemistry and Biochemistry (Kim K. Baldridge). 22.1 Introduction. 22.2 GAMESS Execution on Clusters. 22.3 Portal Technology. 22.4 Running GAMESS with Nimrod Grid-Enabling Infrastructure. 22.5 Computational ChemistryWorkflow Environments. 22.6 Conclusions. References. 23 DistributedWorkflows in Bioinformatics (Arun Krishnan). 23.1 Introduction. 23.2 Challenges of Grid Computing. 23.3 Grid Applications. 23.4 Grid Programming. 23.5 Grid Execution Language. 23.6 GUI-BasedWorkflow Construction and Execution. 23.7 Case Studies. 23.8 Summary. References. 24 Molecular Structure Determination on a Computational and Data Grid (Russ Miller). 24.1 Introduction. 24.2 Molecular Structure Determination. 24.3 Grid Computing in Buffalo. 24.4 Center for Computational Research. 24.5 ACDC-Grid Overview. 24.6 Grid Research Collaborations. 24.7 Grid Research Advancements. 24.8 Grid Research Application Abstractions and Tools. 24.9 Conclusions. References. 25 GIPSY: A Problem-Solving Environment for Bioinformatics Applications (Rajendra R. Joshi). 25.1 Introduction. 25.2 Architecture. 25.3 Currently Deployed Applications. 25.4 Conclusion. References. 26 TaskSpaces: A Software Framework for Parallel Bioinformatics on Computational Grids (Hans De Sterck). 26.1 Introduction. 26.2 The TaskSpaces Framework. 26.3 Application: Finding Correctly Folded RNA Motifs. 26.4 Case Study: Operating the Framework on a Computational Grid. 26.5 Results for the RNA Motif Problem. 26.6 FutureWork. 26.7 Summary and Conclusion. References. 27 The Organic Grid: Self-Organizing Computational Biology on Desktop Grids (Arjav J. Chakravarti). 27.1 Introduction. 27.2 Background and RelatedWork. 27.3 Measurements. 27.4 Conclusions. 27.5 Future Directions. References. 28 FPGA Computing in Modern Bioinformatics (H. Simmler). 28.1 Parallel Processing Models. 28.2 Image Processing Task. 28.3 FPGA Hardware Accelerators. 28.4 Image Processing Example. 28.5 Case Study: Protein Structure Prediction. 28.6 Conclusion. References. 29 Virtual Microscopy: Distributed Image Storage, Retrieval, Analysis, and Visualization (T. Pan). 29.1 Introduction. 29.2 Architecture. 29.3 Image Analysis. 29.4 Clinical Use. 29.5 Education. 29.6 Future Directions. 29.7 Summary. References. Index.
£159.26
John Wiley & Sons Inc Parallel Combinatorial Optimization
Book SynopsisThis text provides an excellent balance of theory and application that enables you to deploy powerful algorithms, frameworks, and methodologies to solve complex optimization problems in a diverse range of industries. Each chapter is written by leading experts in the fields of parallel and distributed optimization.Trade Review"The target audience will learn a lot from the book, and I hope they will be inspired…" (Computing Reviews.com, May 30, 2007)Table of ContentsPreface. Acknowledgments. Contributors. 1. Parallel Branch-and-Bound Algorithms (T. Crainic, B. Lecun, C. Roucairol). 2. Parallel Dynamic Programming (F. Almeida, D. Gonzalez, I. Pelaez). 3. Parallel Branch and Cut (T. Ralphs). 4. Parallel Semidefinite Programming and Combinatorial Optimization (S. J. Benson). 5. Parallel Resolution of the Satisfiability Problem: A Survey (D. Singer). 6. Parallel Metaheuristics: Algorithms and Frameworks (N. Melab, E-G. Talbi, S. Cahon, E. Alba, G. Luque). 7. Towards Parallel Design of Hybrids between Metaheuristics and Exact Methods (M. Basseur, L. Jourdan, E-G. Talbi). 8. Parallel Exact Methods for Multiobjective Combinatorial Optimization (C. Dhaenens, J. Lemesre, N. Melab, M. Mezmaz, E-G. Talbi). 9. Parallel Primal-Dual Interior Point Methods for Semidefinite Programs (M. Yamashita, K. Fujisawa, M. Fukuda, M. Kojima, K. Nakata). 10. MW: A Software Framework for Combinatorial Optimization on Computational Grids (W. Glankwamdee, T. Linderoth). 11. Constraint Logic Programming on Multiple Processors (I. Sakellariou, I. Vlahavas). 12. Application of Parallel Metaheuristics to Optimization Problems in Telecommunications and Bioinformatics (S. L. Martins, C. Ribeiro, I. Rosseti). Index.
£107.06
John Wiley & Sons Inc Spectral Logic and Its Applications for the
Book SynopsisSpectral techniques facilitate the design and testing of today''s increasingly complex digital devices There is heightened interest in spectral techniques for the design of digital devices dictated by ever increasing demands on technology that often cannot be met by classical approaches. Spectral methods provide a uniform and consistent theoretic environment for recent achievements in this area, which appear divergent in many other approaches. Spectral Logic and Its Applications for the Design of Digital Devices gives readers a foundation for further exploration of abstract harmonic analysis over finite groups in the analysis, design, and testing of digital devices. After an introduction, this book provides the essential mathematical background for discussing spectral methods. It then delves into spectral logic and its applications, covering: * Walsh, Haar, arithmetic transform, Reed-Muller transform for binary-valued functions and Vilenkin-Table of ContentsPREFACE. ACKNOWLEDGMENTS. LIST OF FIGURES. LIST OF TABLES. ACRONYMS.1. LOGIC FUNCTIONS. 1.1 Discrete Functions. 1.2 Tabular Representations of Discrete Functions. 1.3 Functional Expressions. 1.4 Decision Diagrams for Discrete Functions. 1.5 Spectral Representations of Logic Functions. 1.6 Fixed-polarity Reed–Muller Expressions of Logic.Functions. 1.7 Kronecker Expressions of Logic Functions. 1.8 Circuit Implementation of Logic Functions. 2. SPECTRAL TRANSFORMS FOR LOGIC FUNCTIONS. 2.1 Algebraic Structures for Spectral Transforms. 2.2 Fourier Series. 2.3 Bases for Systems of Boolean Functions. 2.4 Walsh Related Transforms. 2.5 Bases for Systems of Multiple-Valued Functions. 2.6 Properties of DiscreteWalsh andVilenkin–Chrestenson Transforms. 2.7 Autocorrelation and Cross-Correlation Functions. 2.8 Harmonic Analysis over an Arbitrary Finite Abelian Group. 2.9 Fourier Transform on Finite Non–Abelian Groups. 3. CALCULATION OF SPECTRAL TRANSFORMS. 3.1 Calculation of Walsh Spectra. 3.2 Calculation of the Haar Spectrum. 3.3 Calculation of the Vilenkin–Chrestenson Spectrum. 3.4 Calculation of the Generalized Haar Spectrum. 3.5 Calculation of Autocorrelation Functions. 4. SPECTRAL METHODS IN OPTIMIZATION OF DECISION DIAGRAMS. 4.1 Reduction of Sizes of Decision Diagrams. 4.2 Construction of Linearly Transformed Binary Decision Diagrams. 4.3 Construction of Linearly Transformed Planar BDD. 4.4 Spectral Interpretation of Decision Diagrams. 5. ANALYSIS AND OPTIMIZATION OF LOGIC FUNCTIONS. 5.1 Spectral Analysis of Boolean Functions. 5.2 Analysis and Synthesis of Threshold Element Networks. 5.3 Complexity of Logic Functions. 5.4 Serial Decomposition of Systems of Switching Functions. 5.5 Parallel Decomposition of Systems of Switching Functions. 6. SPECTRAL METHODS IN SYNTHESIS OF LOGIC NETWORKS. 6.1 Spectral Methods of Synthesis of Combinatorial Devices. 6.2 Spectral Methods for Synthesis of Incompletely Specified Functions. 6.3 Spectral Methods of Synthesis of Multiple-Valued Functions. 6.4 Spectral Synthesis of Digital Functions and Sequences Generators. 7. SPECTRAL METHODS OF SYNTHESIS OF SEQUENTIAL MACHINES. 7.1 Realization of Finite Automata by Spectral Methods. 7.2 Assignment of States and Inputs for Completely Specified Automata. 7.3 State Assignment for Incompletely Specified Automata. 7.4 Some Special Cases of the Assignment Problem. 8. HARDWARE IMPLEMENTATION OF SPECTRAL METHODS. 8.1 Spectral Methods of Synthesis with ROM. 8.2 Serial Implementation of Spectral Methods. 8.3 Sequential Haar Networks. 8.4 Complexity of Serial Realization by Haar Series. 8.5 Parallel Realization of Spectral Methods of Synthesis. 8.6 Complexity of Parallel Realization. 8.7 Realization by Expansions over Finite Fields. 9. SPECTRAL METHODS OF ANALYSIS AND SYNTHESIS OF RELIABLE DEVICES. 9.1 Spectral Methods for Analysis of Error Correcting Capabilities. 9.2 Spectral Methods for Synthesis of Reliable Digital Devices. 9.3 Correcting Capability of Sequential Machines. 9.4 Synthesis of Fault-Tolerant Automata with Self-Error Correction. 9.5 Comparison of Spectral and Classical Methods. 10. SPECTRAL METHODS FOR TESTING OF DIGITAL SYSTEMS. 10.1 Testing and Diagnosis by Verification of Walsh Coefficients. 10.2 Functional Testing, Error Detection, and Correction by Linear Checks. 10.3 Linear Checks for Processors. 10.4 Linear Checks for Error Detection in Polynomial Computations. 10.5 Construction of Optimal Linear Checks for Polynomial Computations. 10.6 Implementations and Error-Detecting Capabilities of Linear Checks. 10.7 Testing for Numerical Computations. 10.8 Optimal Inequality Checks and Error-Correcting Codes. 10.9 Error Detection in Computer Memories by Linear Checks. 10.10 Location of Errors in ROMs by Two Orthogonal Inequality Checks. 10.11 Detection and Location of Errors in Random-Access Memories. 11. EXAMPLES OF APPLICATIONS AND GENERALIZATIONS OF SPECTRAL METHODS ON LOGIC FUNCTIONS. 11.1 Transforms Designed for Particular Applications. 11.2 Wavelet Transforms. 11.3 Fibonacci Transforms. 11.4 Two-Dimensional Spectral Transforms. 11.5 Application of the Walsh Transform in Broadband Radio. APPENDIX A. REFERENCES. INDEX.
£155.66
John Wiley & Sons Inc The Definitive Guide to How Computers Do Math
Book SynopsisThe Basics of Computer Arithmetic Made Enjoyable and Accessible-with a Special Program Included for Hands-on Learning The combination of this book and its associated virtual computer is fantastic! Experience over the last fifty years has shown me that there''s only one way to truly understand how computers work; and that is to learn one computer and its instruction set-no matter how simple or primitive-from the ground up. Once you fully comprehend how that simple computer functions, you can easily extrapolate to more complex machines. -Fred Hudson, retired engineer/scientist This book-along with the virtual DIY Calculator-is an incredibly useful teaching and learning tool. The interesting trivia nuggets keep you turning the pages to see what''s next. Students will have so much fun reading the text and performing the labs that they won''t even realize they are learning. -Michael Haghighi, Chairperson of the Business and Computer Information Systems Trade Review"I found this book to be a lot of fun, and I think many high school teachers and students would enjoy it too." (Mathematics Teacher, September 2006) "Clive 'Max' Maxfield and Alvin Brown have written a wonderful book…about the essential workings of computers." (The Embedded Muse, February 22, 2006) "I have not seen a better description of the stack and related concepts. The authors obviously understand that these concepts are usually confusing to novices, and hence they support the material with good and simple examples." (Computing Reviews.com, January 16, 2006) "It looks like Max has done it again, i.e., written another technical book that reminds us why we studied electronics in the first place--for the sheer fun of it." (Chip Design Magazine, December 2005/January 2006) "The book is fun, highly informative, and full of vitally important stuff for both the technical and non-technical alike." (EDA Confidential, November 21, 2005) "Everybody can learn from this lively book but it [is] especially helpful for teachers and engineers who want to share their interest in math and computing machinery with others." (Wireless Net DesignLine Newsletter, November 10, 2005) "For those interested in a slightly off-beat approach to learning the basics of computer architectures, Maxfield and Brown have put together a multimedia package that's well worth the price of admission." (Electronic Design.com, October 20, 2005) "The book is perfect for students and those among us who aspire to really understand what is going on in those gismos…the prose is easy to read, and the lab exercises are well designed." (Gabe On EDA.com)Table of ContentsLaboratories ix Do You Speak Martian? xi Chapter 0 Why This Book is So Cool 1 This is where we discover just why this book is so cool, and also why this chapter is numbered “0.” Chapter 1 Introducing Binary and Hexadecimal Numbers 7 In this chapter we introduce the concepts of the binary and hexadecimal number systems (but in a much more interesting manner than most computer books). Chapter 2 Computers and Calculators 23 Here we rampage through the insides of a simple computer and calculator, and we also meet our virtual DIY Calculator. Chapter 3 Subroutines and Other Stuff 35 In this smorgasbord of a chapter, we first discuss logical, shift, and rotate instructions; then we plunge headfirst into the stack, subroutines, recursion, and the concept of selfmodifying code. Chapter 4 Integer Arithmetic 69 This is where we learn the concepts of signed and unsigned binary arithmetic, and multibyte data representations. In the labs associated with this chapter we create some integer-based math subroutines for use in Chapter 5. Chapter 5 Creating an Integer Calculator 123 This is where things really start to get interesting because we use the subroutines we developed in Chapter 4 to implement a simple four-function integer calculator. Chapter 6 More Functions and Experiments 135 This may be the last chapter, but turn that frown upside down into a smile because this is where we discover additional projects you can undertake, and also how you can compete with other readers to create better math routines for your DIY Calculator. Interactive Laboratories 155–412 This is where you will find the interactive laboratories associated with Chapters 2 through 5 (see more details on page ix). Appendix A Installing Your DIY Calculator 413 In this appendix, we learn how to install the virtual DIY Calculator presented on the CD-ROM accompanying this book. Appendix B Addressing Modes 417 Here we learn about the various addressing modes supported by the virtual microprocessor powering the DIY Calculator. Appendix C Instruction Set Summary 429 The tables in this appendix are useful for quickly determining which instructions are available with which addressing modes. Appendix D Additional Resources 433 There is a wealth of additional resources for individual readers and educators on the CD-ROM accompanying the book and from the DIY Calculator’s website. Also, there are lots of other really interesting books to read. This appendix explains it all. About the Authors 441 Acknowledgments 443 Index 445
£44.06
John Wiley & Sons Inc Quantum Approach to Informatics
Book SynopsisThe quantum theory of information, communication, and computing is rather recent, and is growing at a surprising speed. Many discussions of physical observations and quantum measurements are phrased in terms of information theoretic concepts. There is a need to educate students in this new way of thinking.Table of ContentsPreface. 1. Introduction. 2. Quantum Theory. 3. Quantum Communication and Information. 4. Quantum Computing. 5. Physical Realization of Quantum Information Processing. References. Index.
£107.06
John Wiley & Sons Inc Open Process Frameworks
Book SynopsisThis book describes a variety of patterns for internet-based solutions that support e-Business and its underpinnings. The sequence of patterns flows from business to process to commerce comprising a fundamental view of e-Business, e-Process and e-Commerce.Trade Review"The frameworks presented in this book offer a strong metaphor for formalizing an e-enterprise, which could be useful for many businesspeople…" (Computing Reviews.com, May 22, 2006)Table of ContentsForeword. Preface. Acknowledgments. Using this Book. Reading the Case Study. PART I: e-BUSINESS. 1. Business Adaptability. 2. Enterprise-wide Solutions. 3. Multi-Tier Supply Chain. 4. Internet Business Model. PART II: e-PROCESS. 5. Adaptable Technology. 6. Internet Usage Metaphor. 7. Internet-based Process. 8. Open Process Architecture. PART III: e-COMMERCE. 9. Business Architecture. 10. Process Architecture. 11. Software Architecture. 12. Data Architecture. PART IV: e-PROJECT. 13. Management Framework. 14. Project Management. 15. Implementation Management. 16. Team Management. Appendix A: Case Study Background. Appendix B: Open Process Example. About the Author. Index.
£77.36
John Wiley & Sons Inc Information Security
Book SynopsisBridging the gap between information security and strategic planning This publication is a reflection of the author''s firsthand experience as an information security consultant, working for an array of clients in the private and public sectors. Readers discover how to work with their organizations to develop and implement a successful information security plan by improving management practices and by establishing information security as an integral part of overall strategic planning. The book starts with an overview of basic concepts in strategic planning, information technology strategy, and information security strategy. A practical guide to defining an information security strategy is then provided, covering the nuts and bolts of defining long-term information security goals that effectively protect information resources. Separate chapters covering technology strategy and management strategy clearly demonstrate that both are essential, complementaryTrade Review"Executives will quickly learn to see how information security can be addressed...IT security professionals will benefit...from an understanding of how to present information security to nontechnical experts." (Computing Reviews.com, August 15, 2006) "Useful for information security managers, IT executives, and consultants, the book can also help nontechnical executives who need to protect the value and security of their organization's information." (IEEE Computer Magazine, May 2006)Table of ContentsList of Figures. Preface. 1. Introduction. Strategy Overview. Strategy and Information Technology. Strategy and Information Security. An Information Security Strategic Planning Methodology. The Business Environment. Information Value. Risk. The Strategic Planning Process. The Technology Plan. The Management Plan. Theory and Practice. 2. Developing an Information Security Strategy. Overview. An Information Security Strategy Development Methodology. Strategy Prerequisites. Research Sources. Preliminary Development. Formal Project Introduction. Fact Finding. General Background Information. Documentation Review. Interviews. Surveys. Research Sources. Analysis Methods. Strengths, Weaknesses, Opportunities, and Threats. Business Systems Planning. Life-Cycle Methods. Critical Success Factors. Economic Analysis. Risk Analysis. Benchmarks and Best Practices. Compliance Requirements. Analysis Focus Areas. Industry Environment. Organizational Mission and Goals. Executive Governance. Management Systems and Controls. Information Technology Management. Information Technology Architecture. Security Management. Draft Plan Presentation. Final Plan Presentation. Options for Plan Development. A Plan Outline. Selling the Strategy. Plan Maintenance. The Security Assessment and the Security Strategy. Strategy Implementation: What is a Tactical Plan? Converting Strategic goals to Tactical Plans. Turning Tactical Planning Outcomes into Ongoing Operations. Key Points. Plan Outline. 3. The Technology Strategy. Thinking About Technology. Planning Technology Implementation. Technology Forecasting. Some Basic Advice. Technology Life-Cycle Models. Technology Solution Evaluation. Role of Analysts. Technology Strategy Components: The Security Strategy Technical Architecture. Leveraging Existing Vendors. Legacy Technology. The Management Dimension. Overall Technical Design. The Logical Technology Architecture. Specific Technical Components. Servers. Network Zones. External Network Connections. Desktop Systems. Applications and DBMS. Portable Computing Devices. Telephone Systems. Control Devices. Intelligent Peripherals. Facility Security Systems. Security Management Systems. Key Points. 4. The Management Strategy. Control Systems. Control Systems and the Information Security Strategy. Governance. Ensuring IT Governance. IT Governance Models. Current Issues in Governance. Control Objectives for Information and Related Technology (CobiT). IT Balanced Scorecard. Governance in Information Security. End-User Role. An IT Management Model for Information Security. Policies, Procedures, and Standards. Assigning Information Security Responsibilities. To Whom Should Information Security Report? Executive Roles. Organizational Interfaces. Information Security Staff Structure. Staffing and Funding Levels. Managing Vendors. Organizational Culture and Legitimacy. Training and Awareness. Key Points. 5. Case Studies. Case Study 1—Singles Opportunity Services. Background. Developing the Strategic Plan. Information Value Analysis. Risk Analysis. Technology Strategy. Management Strategy. Implementation. Case Study 2—Rancho Nachos Mosquito Abatement District. Background. Developing the Strategic Plan. Information Value Analysis. Risk Analysis. Technology Strategy. Management Strategy. Implementation. Key Points. 6. Business and IT Strategy: Introduction. Strategy and Systems of Management. Business Strategy Models. Boston Consulting Group Business Matrix. Michael Porter—Competitive Advantage. Business Process Reengineering. The Strategy of No Strategy. IT Strategy. Nolan/Gibson Stages of Growth. Information Engineering. Rockart’s Critical Success Factors. IBM Business System Planning (BSP). So is IT really “strategic”? IT Strategy and Information Security Strategy. Key Points. 7. Information Economics. Concepts of Information Protection. Information Ownership. From Ownership to Asset. Information Economics and Information Security. Basic Economic Principles. Why is Information Economics Difficult? Information Value—Reducing Uncertainty. Information Value—Improved Business Processes. Information Security Investment Economics. The Economic Cost of Security Failures. Future Directions in Information Economics. Information Management Accounting—Return on Investment. Economic Models and Management Decision Making. Information Protection or Information Stewardship? Key Points. 8. Risk Analysis. Compliance Versus Risk Approaches. The “Classic” Risk Analysis Model. Newer Risk Models. Process-Oriented Risk Models. Tree-Based Risk Models. Organizational Risk Cultures. Risk Averse, Risk Neutral, and Risk Taking Organizations. Strategic Versus Tactical Risk Analysis. When Compliance-based Models are Appropriate. Risk Mitigation. Key Points. Notes and References. Index.
£80.06
John Wiley & Sons Inc Developing Chemical Information Systems An
Book SynopsisThis work provides both newcomers and advanced computer scientists and chemists with an excellent comprehensive how-to guide to developing chemical information systems. The author served as lead architect on the design of said systems at Merck and Co. , Inc.Trade Review"…a practical how-to guide for applying the Java technology with an object-oriented approach to developing chemical information systems." (E-STREAMS, September 2007)Table of Contents1. Introduction 1 2. Software Development Principles: High–Low Open–Closed Principles 6 3. Introduction to the Object-Oriented Approach and Its Benefits 12 4. Build Versus Buy 23 5. The Agile and Iterative Development Process 26 6. UML Modeling 34 7. Deployment Architecture 38 8. Software Architecture 43 9. A Case Study: Develop a Chemical Registration System (CRS) 49 10. A Chemical Informatics Domain Analysis Object Model 61 11. Presentation Layer 65 12. Business Layer 69 13. Entity Dictionary 147 14. Chemistry Intelligence API 168 15. Data Persistence Layer 186 16. Put Everything Together 204 Bibliography 207 Index 209
£220.46
John Wiley & Sons Inc Thinking on the Web
Book Synopsis* Provides valuable insight into the progress and direction of development of the World Wide Web and its likely future applications in science and business. * Reviews the prospects for the Web to develop intelligent services (such as online businesses, games, purchases, new search capabilities, and accessibility to trustworthy information).Trade Review?Anyone with experience of HCI will want to read this book which after all, has provided a new and entirely different way of providing a stimulus to a subject that is very much in need of direction.? (Kybernetes, 2009) "Thinking on the Web offers a fascinating history and impressive background of the age we are living through, and serves as a tribute to three great minds. A true geek bonus is the depth of coverage, with rich explanations, examples, and a look at next generation web services." (Blogcritics.org, March 9, 2009)Table of ContentsPreface. The Purpose of this Book. Who Should Read this Book. The Organization of this Book. PART I: WHAT IS WEB INTELLIGENCE. Chapter 1: The Information Age and the Web. Overview. Thinking and Intelligent Web Applications. The Information Age. The World Wide Web. The Limitations of Today’s Web. The Next Generation Web. Why Intelligent Ubiquitous Devices Improve Productivity. Conclusion. Exercises. Interlude #1 Thinking about Thinking. Chapter 2: Gödel - What is Decidable? Overview. Philosophical and Mathematical Logic. Kurt Gödel. Knowledge Representation. Computational Logic . Artificial Intelligence. Web Architecture and Business Logic. The Semantic Web. Conclusion. Exercises. Interlude #2 Truth and Beauty. Chapter 3: Turing - What is Machine Intelligence? Overview. What is Machine Intelligence? Alan Turing. What is Machine Intelligence? Turing Test and the Loebner Prize . John Searle’s Chinese Room. Artificial Intelligence. Machine Intelligence . Semantic Networks and Frames. Reasoning with Semantic Networks. Computational Complexity. Description Logic (DL). Ontology. Inference Engines. Software Agents. Adaptive Software. Limitations and Capabilities. Conclusion. Exercises. Interlude #3: Computing Machines. Chapter 4: Berners-Lee ? What is Solvable on the Web? Overview. The World Wide Web. Berners-Lee. Competing Web Standards. The Semantic Web Roadmap. Semantic Web Services. Logic on the Semantic Web. Semantic Web Capabilities and Limitations. Conclusion. Exercises. Interlude #4 Turing’s Test. PART II: WEB ONTOLOGY AND LOGIC. Chapter 5: Resource Framework Description -- RDF. Overview . HTML Language. XML Language. RDF Language. Basic Elements. RDF Schema. XQuery - XML Query Language. Conclusion . Exercises. Interlude #5 The Chinese Room. Chapter 6: Web Ontology Language -- OWL. Overview. Ontology Language. Ontology Language Requirements. Compatibility of OWL and RDF/RDFS. The OWL Language. Basic Elements. OWL Example -- Compute Ontology. Ontology Example -- Birthplace. Applying OWL. OWL Capabilities and Limitations. Conclusion. Exercises. Interlude #6: Machines and Brains. Chapter 7: Ontology Engineering. Overview. Ontology Engineering. Constructing Ontologies. Ontology Example. Ontology Methods. Ontology Libraries. Ontology Matching. Ontology Mapping . Ontology Mapping Tools . Conclusion. Exercises. Interlude #7: Machines and Meaning. Chapter 8: Logic, Inference and Rule Systems. Overview. Logic and Inference. Monotonic and Nonmonotonic Rules. Descriptive Logic. Inference Engines. Example RDF Inference Engine. Conclusion. Exercises. Interlude #8: Machines and Rules. Chapter 9: Semantic Web Rule Language -- SWRL. Overview. Rule Systems. Rule Languages. Semantic Web Rule Language (SWRL). Conclusion. Exercises. Interlude #9: Machines and Language. Chapter 10: Semantic Web Applications. Overview. Semantic Web Applications . Web Services. Semantic Search. e-Learning . Semantic Web and Bio-Informatics . Enterprise Application Integration. On-To-Knowledge (OTK) . Knowledge Base. Conclusion. Exercise. Interlude #10: Distributed Intelligence. Chapter 11: Web Ontology Language for Services -- OWL-S. Overview. XML-Based Web Services. Next Generation Web Services . OWL-S Primer. Creating an OWL-S Ontology for a Web Services. Conclusion. Exercises. Interlude #11: The Semantic Web. Chapter 12: Semantic Search Technology. Overview. Search Engines . Semantic Search. Semantic Search Technology. Web Search Agents. Semantic Methods. Latent Semantic Index Search. TAP. Swoogle. Conclusion. Exercises. Interlude #12: The Halting Problem. Chapter 13: Semantic Patterns and Adoptive Software. Overview . Patterns in Software Design. Pattern Frame. Semantic Patterns. Self-Organizing and Adaptive Software. Conclusion. Exercises. Interlude #13: The Semantic Web and Meaning. Chapter 14: Semantic Tools. Overview . Semantic Tools. Semantic Web Services Tools. Conclusion. Interlude #14: The Semantic Web and Language. Chapter 15: Opportunities and Challenges. Overview. Semantic Doubt. Semantic Opportunities. Challenges. Balancing Proprietary and Open Standards. Conclusion. Interlude #15: The Semantic Web and Zeno’s Paradox. Bibliography. Glossary. List of Acronyms. Index.
£36.05
John Wiley & Sons Inc Grid Computing for Bioinformatics and
Book SynopsisThe only single, up-to-date source for Grid issues in bioinformatics and biology Bioinformatics is fast emerging as an important discipline for academic research and industrial applications, creating a need for the use of Grid computing techniques for large-scale distributed applications.Table of ContentsPreface. Chapter 1: Open computing Grid for molecular sciences (M. Romberg, E. Benfenati, and W. Dubitzky). Chapter 2: Designing high-performance concurrent strategies for biological sequence alignment problems on networked computing platforms (B. Veeravalli). Chapter 3: Optimized cluster-enabled HMMER searches (J. P. Walters, J. Landman, and V. Chaudhary). Chapter 4: Expanding the rich of Grid computing: combining Globus and BOINC based systems (D. S. Myers, A. L. Bazinet, and M. P. Cummings). Chapter 5: Hierarchical Grid computing for high performance bioinformatics (B. Schmidt, C.X. Chen and W. Liu). Chapter 6:Multiple sequence alignment and phylogenetic inference (D. Trystram, and J. Zola). Chapter 7: Data syndication techniques for bioinformatics applications (C. Wang, A. Y. Zomaya, and B. B. Zhou). Chapter 8: Conformational sampling and docking on Grids (A. Tantar, N. Melab, and E-G. Talbi). Chapter 9: Deployment of Grid life sciences applications (V. Breton, N. Jacq, V. Kasam, and J. Salzemann). Chapter 10: Grid-based interactive decision support in biomedicine (A. Tirado-Ramos, P. M. A. Sloot, and M. Bubak). Chapter 11: Database-driven grid computing and distributed web applications: a comparison (H. De Sterck, A.Papo, C. Zhang, M. Hamady, and R. Knight). Chapter 12: A semantic mediation architecture for a clinical Data Grid (K. Kumpf, A. Wohrer, S. Benkner, G. Engelbrecht, and Jochen Fingberg). Chapter 13: Bioinformatics applications in Grid computing environments (A. Boukerche, A. C. Magalhaes and Alves De Melo). Chapter 14: Recent advances in solving the protein threading problem (R. Andonov, G. Collet, J-F. Gibrat, A. Marin, V. Poirriez, and N. Yanev). Chapter 15: DNA fragment assembly using Grid systems (A. J. Nebro, G. Luque, and E. Alba). Chapter 16: Seeing is knowing: Visualization of parameter-parameter dependencies in biomedical network models (A. Konagaya, R. Azuma, R. Umetsu, S. Ohki, F. Konishi, K. Matsumura, and S. Yoshikawa).
£137.66
John Wiley & Sons Inc Computation Analysis Designed Experiment
Book SynopsisAddresses the statistical, mathematical, and computational aspects of the construction of packages and analysis of variance (ANOVA) programs. Includes a disk at the back of the book that contains all program codes in four languages, APL, BASIC, C, and FORTRAN. Presents illustrations of the dual space geometry for all designs, including confounded designs.Table of ContentsCOMPARATIVE STUDIES AND DESIGNED EXPERIMENTS. Simple Designed Experiments. PROGRAMMING SYSTEMS. User-Level Considerations. Design of Individual Programs. Construction of Program Systems. LEAST SQUARES AND ANALYSIS OF VARIANCE. Projection and the Least Squares Method. Geometry of Hypothesis Testing. Algorithm Descriptions--Wilkinson's SWEEP. Algorithm Description--Beaton's SWP. Yates' Algorithm for Factorial Designs. Matrix Decompositions. INTERPRETATION OF DESIGN SPECIFICATIONS. Algebra of Design Specification Statements. Grammar for Design Specification Statements. Programs for Compilation of Design Specification Statements. ANALYSIS OF DESIGNED EXPERIMENTS. Specification of Hypothesis Tests for Designed Experiments. Blocking and Confounding. Analysis of Covariance. Generally Balanced Designs. Appendix. Bibliography. Index.
£204.26
John Wiley & Sons Inc Computer Applications in Geography
Book SynopsisWritten with the view of geography as spatial information technology, this text is intended for undergraduate students of geography who are interested in computer applications. Following an introduction to computers, it covers uses in cartography, remote sensing and data manipulation.Table of ContentsComputers and Geographical Data. Statistical Methods. Computers in Cartography. Remote Sensing. Simulation. Geographical Information Systems. Appendices. References. Index.
£145.76
Wiley-Blackwell Nonlinear Multivariate Analysis
Book SynopsisPresents a system of multivariate analysis techniques in cases where statistical data may be of different measurement levels such as nominal, ordinal or interval. It covers methods of studying the stability of these techniques, including resampling by the bootstrap and jackknife and discusses sensitivity analysis through first-order approximations.Table of ContentsConventions and Controversies in Multivariate Analysis. Coding of Categorical Data. Homogeneity Analysis. Nonlinear Principal Components Analysis. Nonlinear Generalized Canonical Analysis. Nonlinear Canonical Correlation Analysis. Asymmetric Treatment of Sets: Some Special Cases, Some FuturePrograms. Multidimensional Scaling and Correspondence Analysis. Models as Gauges for the Analysis of Binary Data. Reflections on Restrictions. Nonlinear Multivariate Analysis: Principles andPossibilities. The Study of Stability. The Proof of the Pudding. Appendices. References. Author Index. Subject Index.
£311.36
John Wiley & Sons Inc Computerised Environmetal Modelling
Book SynopsisComputerised Environmental Modelling A Practical Introduction Using Excel J. Hardisty, D. M. Taylor and S. E. Metcalfe The University of Hull, UK The study of the environment is currently developing into a rigorous and demanding analytical science that requires the use of sophisticated environmental models. The increasing demand for graduates trained to deal with complex environmental issues gives rise to the problem of how environmental modelling should be taught. Computerised Environmental Modelling, which is based upon an existing undergraduate course, addresses this problem by presenting a readable (and tested) introduction to the subject through an easy to use software environment. Simple numerical models taught through widely available spreadsheets do away with the need for language-specific training. Students now no longer need to program before they can model. Divided into three sections, the book first deals with the general principles of environmental systems modelling, then Table of ContentsENVIRONMENTAL MODELING. Environmental Systems. Introduction to Modeling. A PRACTICAL GUIDE TO COMPUTER MODELING. Making a Paper Model. Making a Computer Model. Environmental Models. Presenting the Results. Process-Response Modeling. Stochastic Modeling. Feedback Modeling. Validation. EXAMPLES OF ENVIRONMENTAL MODELS. An Ocean Temperature Model. Chaos. Daisy World. Faunal Extinction on an Isolated Island. Acid Deposition. Hydrological Response of Lake Basins. Appendices. Index.
£83.66
John Wiley & Sons Inc Computer Security and Cryptography
Book SynopsisGain the skills and knowledge needed to create effective data security systems This book updates readers with all the tools, techniques, and concepts needed to understand and implement data security systems.Trade Review"...essential reading for professionals in e-commerce and information technology...it is also ideal for students." (IEEE Computer Magazine, March 2007)Table of ContentsFOREWORD. PREFACE. ABOUT THE AUTHOR. CHAPTER 1: APERITIFS. 1.1 The Lexicon of Cryptography. 1.2 Cryptographic Systems. 1.3 Cryptanalysis. 1.4 Side Information. 1.5 Thomas Jefferson and the M-94. 1.6 Cryptography and History. 1.7 Cryptography and Computers. 1.8 The National Security Agency. 1.9 The Giants. 1.10 No Sex, Money, Crime or . . . Love. 1.11 An Example of the Inference Process in Cryptanalysis. 1.12 Warning! CHAPTER 2: COLUMNAR TRANSPOSITION. 2.1 Shannon’s Classification of Secrecy Transformations. 2.2 The Rules of Columnar Transposition Encipherment. 2.3 Cribbing. 2.4 Examples of Cribbing. 2.5 Plaintext Language Models. 2.6 Counting k-Grams. 2.7 Deriving the Parameters of a Markov Model from Sliding Window Counts. 2.8 Markov Scoring. 2.9 The ADFGVX Transposition System. 2.10 CODA. 2.11 Columnar Transposition Problems. CHAPTER 3: MONOALPHABETIC SUBSTITUTION. 3.1 Monoalphabetic Substitution. 3.2 Caesar’s Cipher. 3.3 Cribbing Using Isomorphs. 3.4 The x2-Test of a Hypothesis. 3.5 Pruning from the Table of Isomorphs. 3.6 Partial Maximum Likelihood Estimation of a Monoalphabetic Substitution. 3.7 The Hidden Markov Model (HMM). 3.8 Hill Encipherment of ASCII N-Grams. 3.9 Gaussian Elimination. 3.10 Monoalphabetic Substitution Problems. CHAPTER 4: POLYALPHABETIC SUBSTITUTION. 4.1 Running Keys. 4.2 Blaise de Vigene're. 4.3 Gilbert S. Vernam. 4.4 The One-Time Pad. 4.5 Finding the Key of Vernam–Vigene're Ciphertext with Known Period by Correlation. 4.6 Coincidence. 4.7 Venona. 4.8 Polyalphabetic Substitution Problems. CHAPTER 5: STATISTICAL TESTS. 5.1 Weaknesses in a Cryptosystem. 5.2 The Kolmogorov–Smirnov Test. 5.3 NIST’s Proposed Statistical Tests. 5.4 Diagnosis. 5.5 Statistical Tests Problems. CHAPTER 6: THE EMERGENCE OF CIPHER MACHINES. 6.1 The Rotor. 6.2 Rotor Systems. 6.3 Rotor Patents. 6.4 A Characteristic Property of Conjugacy. 6.5 Analysis of a 1-Rotor System: Ciphertext Only. 6.6 The Displacement Sequence of a Permutation. 6.7 Arthur Scherbius. 6.8 Enigma Key Distribution Protocol. 6.9 Cryptanalysis of the Enigma. 6.10 Cribbing Enigma Ciphertext. 6.11 The Lorenz Schlu¨sselzusatz. 6.12 The SZ40 Pin Wheels. 6.13 SZ40 Cryptanalysis Problems. 6.14 Cribbing SZ40 Ciphertext. CHAPTER 7: THE JAPANESE CIPHER MACHINES. 7.1 Japanese Signaling Conventions. 7.2 Half-Rotors. 7.3 Components of the RED Machine. 7.4 Cribbing RED Ciphertext. 7.5 Generalized Vowels and Consonants. 7.6 “Climb Mount Itaka” – War! 7.7 Components of the PURPLE Machine. 7.8 The PURPLE Keys. 7.9 Cribbing PURPLE: Finding the V-Stepper. 7.10 Cribbing PURPLE: Finding the C-Steppers. CHAPTER 8: STREAM CIPHERS. 8.1 Stream Ciphers. 8.2 Feedback Shift Registers. 8.3 The Algebra of Polynomials over Z2. 8.4 The Characteristic Polynomial of a Linear Feedback Shift Register. 8.5 Properties of Maximal Length LFSR Sequences. 8.6 Linear Equivalence. 8.7 Combining Multiple Linear Feedback Shift Registers. 8.8 Matrix Representation of the LFSR. 8.9 Cribbing of Stream Enciphered ASCII Plaintext. 8.10 Nonlinear Feedback Shift Registers. 8.11 Nonlinear Key Stream Generation. 8.12 Irregular Clocking. 8.13 RC4. 8.14 Stream Encipherment Problems. CHAPTER 9: BLOCK-CIPHERS: LUCIFER, DES, AND AES. 9.1 LUCIFER. 9.2 DES. 9.3 The DES S-Boxes, P-Box, and Initial Permutation (IP). 9.4 DES Key Schedule. 9.5 Sample DES Encipherment. 9.6 Chaining. 9.7 Is DES a Random Mapping? 9.8 DES in the Output-Feedback Mode (OFB). 9.9 Cryptanalysis of DES. 9.10 Differential Cryptanalysis. 9.11 The EFS DES-Cracker. 9.12 What Now? 9.13 The Future Advanced Data Encryption Standard. 9.14 And the Winner Is! 9.15 The Rijndael Operations. 9.16 The Rijndael Cipher. 9.17 Rijndael’s Strength: Propagation of Patterns. 9.18 When is a Product Block-Cipher Secure? 9.19 Generating the Symmetric Group. 9.20 A Class of Block Ciphers. 9.21 The IDEA Block Cipher. CHAPTER 10: THE PARADIGM OF PUBLIC KEY CRYPTOGRAPHY. 10.1 In the Beginning. . . . 10.2 Key Distribution. 10.3 E-Commerce. 10.4 Public-Key Cryptosystems: Easy and Hard Computational Problems. 10.5 Do PKCS Solve the Problem of Key Distribution? 10.6 P.S. CHAPTER 11: THE KNAPSACK CRYPTOSYSTEM. 11.1 Subset Sum and Knapsack Problems. 11.2 Modular Arithmetic and the Euclidean Algorithm. 11.3 A Modular Arithmetic Knapsack Problem. 11.4 Trap-Door Knapsacks. 11.5 Knapsack Encipherment and Decipherment of ASCII-Plaintext. 11.6 Cryptanalysis of the Merkle–Hellman Knapsack System (Modular Mapping). 11.7 Diophantine Approximation. 11.8 Short Vectors in a Lattice. 11.9 Knapsack-Like Cryptosystems. 11.10 Knapsack Cryptosystem Problems. CHAPTER 12: THE RSA CRYPTOSYSTEM. 12.1 A Short Number-Theoretic Digression. 12.2 RSA. 12.3 The RSA Encipherment and Decipherment of ASCII-Plaintext. 12.4 Attack on RSA. 12.5 Williams Variation of RSA. 12.6 Multiprecision Modular Arithmetic. CHAPTER 13: PRIME NUMBERS AND FACTORIZATION. 13.1 Number Theory and Cryptography. 13.2 Prime Numbers and the Sieve of Eratosthenes. 13.3 Pollard’s p 2 1 Method. 13.4 Pollard’s r-Algorithm. 13.5 Quadratic Residues. 13.6 Random Factorization. 13.7 The Quadratic Sieve (QS). 13.8 Testing if an Integer is a Prime. 13.9 The RSA Challenge. 13.10 Perfect Numbers and the Mersenne Primes. 13.11 Multiprecision Arithmetic. 13.12 Prime Number Testing and Factorization Problems. CHAPTER 14: THE DISCRETE LOGARITHM PROBLEM. 14.1 The Discrete Logarithm Problem Modulo p. 14.2 Solution of the DLP Modulo p Given a Factorization of p - 1. 14.3 Adelman’s Subexponential Algorithm for the Discrete Logarithm Problem. 14.4 The Baby-Step, Giant-Step Algorithm. 14.5 The Index-Calculus Method. 14.6 Pollard’s ρ-Algorithm. 14.7 Extension Fields. 14.8 The Current State of Discrete Logarithm Research. CHAPTER 15: ELLIPTIC CURVE CRYPTOGRAPHY. 15.1 Elliptic Curves. 15.2 The Elliptic Group over the Reals. 15.3 Lenstra’s Factorization Algorithm. 15.4 The Elliptic Group over Zp ( p > 3). 15.5 Elliptic Groups over the Field Zm,2. 15.6 Computations in the Elliptic Group EZm,2(a, b). 15.7 Supersingular Elliptic Curves. 15.8 Diffie–Hellman Key Exchange Using an Elliptic Curve. 15.9 The Menezes–Vanstone Elliptic Curve Cryptosystem. 15.10 The Elliptic Curve Digital Signature Algorithm. 15.11 The Certicom Challenge. 15.12 NSA and Elliptic Curve Cryptography. CHAPTER 16: KEY EXCHANGE IN A NETWORK. 16.1 Key Distribution in a Network. 16.2 U.S. Patent ’770. 16.3 Spoofing. 16.4 El Gamal’s Extension of Diffie–Hellman. 16.5 Shamir’s Autonomous Key Exchange. 16.6 X9.17 Key Exchange Architecture. 16.7 The Needham–Schroeder Key Distribution Protocol. CHAPTER 17: DIGITAL SIGNATURES AND AUTHENTICATION. 17.1 The Need for Signatures. 17.2 Threats to Network Transactions. 17.3 Secrecy, Digital Signatures, and Authentication. 17.4 The Desiderata of a Digital Signature. 17.5 Public-Key Cryptography and Signature Systems. 17.6 Rabin’s Quadratic Residue Signature Protocol. 17.7 Hash Functions. 17.8 MD5. 17.9 The Secure Hash Algorithm. 17.10 NIST’s Digital Signature Algorithm. 17.11 El Gamal’s Signature Protocol. 17.12 The Fiat–Shamir Identification and Signature Schema. 17.13 The Oblivious Transfer. CHAPTER 18: APPLICATIONS OF CRYPTOGRAPHY. 18.1 UNIX Password Encipherment. 18.2 Magnetic Stripe Technology. 18.3 Protecting ATM Transactions. 18.4 Keyed-Access Cards. 18.5 Smart Cards. 18.6 Who Can You Trust?: Kohnfelder’s Certificates. 18.7 X.509 Certificates. 18.8 The Secure Socket Layer (SSL). 18.9 Making a Secure Credit Card Payment on the Web. CHAPTER 19: CRYPTOGRAPHIC PATENTS. 19.1 What is a Patent? 19.2 Patentability of Ideas. 19.3 The Format of a Patent. 19.4 Patentable versus Nonpatentable Subjects. 19.5 Infringement. 19.6 The Role of Patents in Cryptography. 19.7 U.S. Patent 3,543,904. 19.8 U.S. Patent 4,200,770. 19.9 U.S. Patent 4,218,582. 19.10 U.S. Patent 4,405,829. 19.11 PKS/RSADSI Litigation. 19.12 Leon Stambler. INDEX.
£121.46
John Wiley & Sons Inc Fuzzy Logic
Book SynopsisOffering a new perspective on a growing field, the text explores the many hardware implications of fuzzy logic based circuits. As use of AI increases, so the VLSI area of circuits is becoming a growth subject. The text surveys fuzzy set theory before moving on to cover a range of nonstandard solutions for fuzzy logic VLSI circuits. An overview of future trends is included plus practical examples from the authors'' research which will enhance the reader''s understanding of the topic. This is the first book on hardware aspects of fuzzy systems which offers a mixture of classical work and the authors'' new perspective.Table of ContentsFuzzy Sets in Approximate Reasoning: A Personal View. FUZZY LOGIC CONTROL. Fuzzy Logic Control: A systematic Design and Performance Assessment Methodology. On the Compatibility of Fuzzy Control and Conventional Control Techniques. On the Crisp-Type Fuzzy Controller: Behaviour Analysis and Improvement. FUZZY LOGIC HARDWARE IMPLEMENTATIONS. Design Considerations of Digital Fuzzy Logic Controllers. Parallel Algorithm for Fuzzy Logic Controller. Fuzzy Flip-Flop. Design Automation of Fuzzy Logic Circuits. HYBRID SYSTEMS AND APPLICATIONS. Neuro-Fuzzy Systems: Hybrid Configurations. A Fuzzy Logic Approach to Handwriting Recognition. Index.
£245.66
Wiley Dictionary of Communications Technology
a huge range and FREE tracked UK delivery on ALL orders.
£238.46
Wiley Dictionary of Communications Technology
Book SynopsisThis volume contains almost 18,000 entries, including 6000 new entries more than the previous edition. It aims to reflectthe latest developments in communications technology, with a list of Internet RFCs, Internet and Intranet terminology, ATM, LAN and communication products.Table of ContentsDemential Programme Effectiveness in Long-Term Care. The Prince Henry Hospital Dementia Caregivers Training Programme. The Predictive Value of Dementia Screening Instruments in Clinical Populations. Risk Factors for Post Stroke Depression.
£100.76
John Wiley & Sons Inc Clinical Data Management
Book SynopsisThis long--awaited Second Edition of the successful Clinical Data Management has been extensively revised and updated with the addition of new chapters and authors.Trade Review"The key to enduring research is data quality and data quality depends upon data management. How fortunate then that the start of the New Millennium sees the publication of the second edition of 'Clinical Data Management'. ... Admirably concise and authoritatively penned, it provides an excellent introduction to a subject at the heart of pharmaceutical R&D.", Dr Hugh Boardman, Partner in Boardman Clarke, Pharmaceutical Physician#Table of ContentsChapter Review (S. Cummings). The International Conference on Harmonisation and its Impact (B. Smith & L. Heywood). Case Report Form Design (M. Avey). Data Capture (E. Waterfield). Planning and Implementation (C. Thomas). Data Validation (P. Patel). Quality Assurance and Clinical Data Management (H. Campbell & J. Sweatman). Performance Measures (J. Wood). Data Presentation (M. Mehra). Coding of Data-MedDRA and other Medical Terminologies (E. Brown & L. Wood). Database Design Issues for Central Laboratories (T. Tollenaere). Computer Systems (L. Palma). Systems Software Validation Issues-Clinical Trials Database Environment (S. Hutson). Re-engineerng the Clinical Data Management Process (S. Arlington, et al.). Working with Contract Research Organizations (K. Buchholz). Data Management in Epidemiology and Pharmacoeconomics (M. Ryan & A. Pleil). Future Revisited (R. Lane). Index.
£187.16
John Wiley & Sons Inc Algorithms for VLSI Design Automation
Book SynopsisFocusing on the algorithms which are the building blocks of the design automation software which generates the layout of VLSI circuits. This text covers all stages of design from layout synthesis through logic synthesis to high-level synthesis.Table of ContentsPRELIMINARIES. Introduction to Design Methodologies. A Quick Tour of VLSI Design Automation Tools. Algorithmic Graph Theory and Computational Complexity. Tractable and Intractable Problems. General-purpose Methods for Combinatorial Optimization. SELECTED DESIGN PROBLEMS AND ALGORITHMS. Layout Compaction. Placement and Partitioning. Floorplanning. Routing. Simulation. Logic Synthesis and Verification. High-level Synthesis. Appendices. References. Index.
£56.00
