Computing Books

Book SynopsisBased on real--world problems and systems and illustrated with "war stories," this practical nuts--and--bolts guide to architectural solutions describes step--by--step how to design robustness and flexibility into a system. A running case study illustrates the evolution and iteration of the system as it grows in functionality and capability.Table of ContentsAcknowledgements. An All-Too-Common Story. Introduction. Part 1 Architecture, Patterns and Internet Technology. System Architecture. Internet Technology Systems. Architectural Patterns for Internet Technology Systems. The GlobalTech System. Part 2 The Patterns. Fundamental Patterns. System Performance Patterns. System Control Patterns. System Evolution Patterns. Part 3 Application of the Patterns. GlobalTech Revisited. Appplying the Patterns. Moving on from Here. Appendix Reference Patterns. Bibliography. Glossary.

Read more less

Book SynopsisSoftware documentation forms the basis for all communication relating to a software project. To be truly effective and usable, it should be based on what needs to be known. Agile Documentation provides sound advice on how to produce lean and lightweight software documentation.Trade Review??many (Test Documents) would benefit from this treatment?? (Professional Tester, October 03) "...applicable to documentation for any project...highly recommended..." (CVu, Vol 16(4), August 2004)Table of ContentsForeword ix Preface xi Acknowledgements xvii Introduction 1 Project Background 11 1 Finding the Right Topics 19 Target Readers 24 Focused Information 26 Individual Documentation Requirements 28 Documentation Portfolio 30 Focus on Long-Term Relevance 34 Specification as a Joint Effort 36 Design Rationale 39 The Big Picture 40 Separation of Description and Evaluation 42 Realistic Examples 44 Experience Reports 46 2 Structuring Individual Documents 61 Structured information 66 Judicious Diagrams 70 Unambiguous Tables 73 Guidelines for Readers 75 Thumbnail Sketches 77 Traceable References 78 Glossary 79 Document History 81 Experience Reports 82 3 Layout and Typography 93 Text on 50% of a Page 98 Two Alphabets per Line 100 120% Line Spacing 102 Two Typefaces 104 Careful Use of Type Variations 106 Careful Ruling and Shading 108 Adjacent Placement 109 Coherent Pages 111 Experience Reports 112 4 Infrastructure and Technical Organisation 117 Document Landscape 120 Document Archive 123 Wiki 125 Code-Comment Proximity 126 Reader-Friendly Media 128 Separation of Contents and Layout 131 Single Source and Multiple Targets 133 Import by Reference 136 Separation of Processing and Printing 138 Document Templates 139 Few Tools 142 Annotated Changes 144 Notification upon Update 145 Reorganisation upon Request 147 Experience Reports 149 5 Management and Quality Assurance 159 A Distinct Activity 161 One Responsible Author 164 Continuing Documentation 166 Writing and Reflection 168 Review Culture 170 Review Before Delivery 174 Customer Review 175 A Distant View 177 Information Marketplace 179 Knowledge Management 180 Experience Reports 182 Final Remarks 193 Pattern Thumbnails 197 Finding the Right Topics 197 Structuring Individual Documents 198 Layout and Typography 200 Infrastructure and Technical Organisation 201 Management and Quality Assurance 203 Glossary 205 References 211 Index 221

Read more less

Book SynopsisMultimedia Content and Semantic Web - Methods, Standards and Tools is the first book of its kind to bring together the technologies and tools used for the description and processing of multimedia content with the standards and the emerging ideas of the shared knowledge representation, provided by the Semantic Web.Trade Review"…an informative and well-thought-out compendium of research-oriented literature…the editors and respective researchers should be congratulated on a job well done." (Computing Reviews.com, October 17, 2006)Table of ContentsList of Contributors. Foreword (Rudi Studer). Foreword (A. Murat Tekalp). Introduction. PART ONE: KNOWLEDGE AND MULTIMEDIA. 1. Multimedia Content Description in MPEG-7 and MPEG-21 (Fernando Pereira and Rik Van de Walkle). 2. Ontology Representation and Querying for Realizing Semantics-driven Applications (Boris Motik, Alexander Maedche and Raphael Volz). 3. Adding Multimedia to the Semantic Web: Building and Applying an MPEG-7 Ontology (Jane Hunter). 4. A Fuzzy Knowledge-Based System for Multimedia Applications (Vassilis Tzouvaras, Giorgos Stamou and Stefanos Kollias). PART TWO: MULTIMEDIA CONTENT ANALYSIS. 5. Structure Identification in an Audiovisual Document (Philippe Joly). 6. Object-Based Video Indexing (Jenny Benois-Pineau). 7. Automatic Extraction and Analysis of Visual Objects Information (Xavier Gir´o, Ver´onica Vilaplana, Ferran Marqu´es, Philippe Salembier). 8. Mining the Semantics of Visual Concepts and Context (Milind R. Naphade and John R. Smith). 9. Machine Learning in Multimedia (Nemanja Petrovic, Ira Cohen and Thomas S. Huang). PART THREE: MULTIMEDIA CONTENT MANAGEMENT SYSTEMS AND THE SEMANTIC WEB. 10. SemanticWeb Applications (Alain L´eger, Pramila Mullan, Shishir Garg and Jean Charlet). 11. Multimedia Indexing and Retrieval Using Natural Language, Speech and Image Processing Methods (Harris Papageorgiou, Prokopis Prokopidis, Athanassios Protopapas and George Carayannis). 12. Knowledge-Based Multimedia Content Indexing and Retrieval (Manolis Wallace, Yannis Avrithis, Giorgos Stamou and Stefanos Kollias). 13. Multimedia Content Indexing and Retrieval Using an Object Ontology (Ioannis Kompatsiaris, Vasileios Mezaris and Michael G. Strintzis). 14. Context-Based Video Retrieval for Life-Log Applications (Kiyoharu Aizawa and Tetsuro Hori). Index.

Read more less

Book SynopsisMost security books are targeted at security engineers and specialists. Few show how build security into software. None breakdown the different concerns facing security at different levels of the system: the enterprise, architectural and operational layers.Table of ContentsChapter 1 The Pattern Approach 1 Patterns at a Glance 2 No Pattern is an Island 4 Patterns Everywhere 4 Humans are the Target 5 Patterns Resolve Problems and Shape Environments 6 Towards Pattern Languages 7 Documenting Patterns 9 A Brief Note on The History of Patterns 11 The Pattern Community and its Culture 12 Chapter 2 Security Foundations 15 Overview 16 Security Taxonomy 17 General Security Resources 26 Chapter 3 Security Patterns 29 The History of Security Patterns 30 Characteristics of Security Patterns 31 Why Security Patterns? 34 Sources for Security Pattern Mining 37 Chapter 4 Patterns Scope and Enterprise Security 47 The Scope of Patterns in the Book 48 Organization Factors 49 Resulting Organization 51 Mapping to the Taxonomy 53 Organization in the Context of an Enterprise Framework 53 Chapter 5 The Security Pattern Landscape 59 Enterprise Security and Risk Management Patterns 59 Identification & Authentication (I&A) Patterns 62 Access Control Model Patterns 67 System Access Control Architecture Patterns 69 Operating System Access Control Patterns 71 Accounting Patterns 73 Firewall Architecture Patterns 77 Secure Internet Applications Patterns 78 Cryptographic Key Management Patterns 80 Related Security Pattern Repositories Patterns 83 Chapter 6 Enterprise Security and Risk Management 85 Security Needs Identification for Enterprise Assets 89 Asset Valuation 103 Threat Assessment 113 Vulnerability Assessment 125 Risk Determination 137 Enterprise Security Approaches 148 Enterprise Security Services 161 Enterprise Partner Communication 173 Chapter 7 Identification and Authentication (I&A) 187 I&A Requirements 192 Automated I&A Design Alternatives 207 Password Design and Use 217 Biometrics Design Alternatives 229 Chapter 8 Access Control Models 243 Authorization 245 Role-Based Access Control 249 Multilevel Security 253 Reference Monitor 256 Role Rights Definition 259 Chapter 9 System Access Control Architecture 265 Access Control Requirements 267 Single Access Point 279 Check Point 287 Security Session 297 Full Access with Errors 305 Limited Access 312 Chapter 10 Operating System Access Control 321 Authenticator 323 Controlled Process Creator 328 Controlled Object Factory 331 Controlled Object Monitor 335 Controlled Virtual Address Space 339 Execution Domain 343 Controlled Execution Environment 346 File Authorization 350 Chapter 11 Accounting 355 Security Accounting Requirements 360 Audit Requirements 369 Audit Trails and Logging Requirements 378 Intrusion Detection Requirements 388 Non-Repudiation Requirements 396 Chapter 12 Firewall Architectures 403 Packet Filter Firewall 405 Proxy-Based Firewall 411 Stateful Firewall 417 Chapter 13 Secure Internet Applications 423 Information Obscurity 426 Secure Channels 434 Known Partners 442 Demilitarized Zone 449 Protection Reverse Proxy 457 Integration Reverse Proxy 465 Front Door 473 Chapter 14 Case Study: IP Telephony 481 IP Telephony at a Glance 482 The Fundamentals of IP Telephony 483 Vulnerabilities of IP Telephony Components 488 IP Telephony Use Cases 488 Securing IP telephony with patterns 493 Applying Individual Security Patterns 497 Conclusion 500 Chapter 15 Supplementary Concepts 503 Security Principles and Security Patterns 504 Enhancing Security Patterns with Misuse Cases 525 Chapter 16 Closing Remarks 531 References 535 Index 555

Read more less

Book SynopsisThis volume is based on a new idea of gathering state of the art topics in Geometric Modeling together with techniques, applications, systems and tools.Table of ContentsPreface. 1. Polygonal Subdivision Curves for Computer Graphics and Geometric Modeling (Ahmad H. Nasri). 2. Planar Development of Digital Free-Form Surfaces (Phillip N. Azariadis and Nickolas S. Sapidis). 3. A Shape Preserving Representation for Rational Curves with Efficient Evaluation Algorithm (Jorge Delgado and Juan M. Peña). 4. Piecewise Power Basis Conversion of Dynamic B-spline Curves and Surfaces (Deok-Soo Kim and Joonghyun Ryu). 5. Computational Methods for Geometric Processing of Surfaces: Blending, Offsetting, Intersection, Implicitization (Andres Iglesias). 6. Weighted Nu Splines: An Alternative to NURBS (Muhammad Sarfraz). 7. Generation of Parting Surfaces Using Subdivision Technique (C. L. Li). 8. Triadic Subdivision of Non Uniform Powell-Sabin splines (Evelyne Vanraes, Paul Dierckx, and AdhemarBultheel). 9. Surface Interpolation Scheme By Distance Blending Over Convex Sets (Lizhuang Ma, Qiang Wang, and TonyChan K Y). 10. Family of G2 Spiral Transition Between Two Circles (Zulfiqar Habib and Manabu Sakai). 11. Optimal Hierarchical Adaptive Mesh Construction Using FCO Sampling (Panagiotis A. Dafas, Ioannis Kompatsiarisand Michael G. Strintzis). 12. Virtual Sculpting and Deformable Volume Modeling (K. C. Hui). 13. Free Form Modeling Method Based on Silhouette and Boundary Lines (Jun Kamiya and Hideki Aoyama). 14. Intuitive and Precise Solid Modeling in A Virtual Reality Environment (Yongmin Zhong, Wolfgang Müller-Wittig and Weiyin Ma). 15. Efficient Simplification of Triangular Meshes (Muhammad Hussain, Yoshihiro Okada, andKoichi Niijima). 16. Multiresolution and Diffusion Methods Applied to Surface Reconstruction Based on T-Surfaces Framework (Gilson A. Giraldi, Rodrigo L. S. Silva, WalterH. Jiménez, Edilberto Strauss, and Antonio A. F. Oliveira). 17. A Multiresolution Framework for NUBS (Muhammad Sarfraz and Mohammed Ali Siddiqui). 18. Irregular Topology Spline Surfaces and Texture Mapping (Jin J. Zheng and Jian J. Zhang). 19. Segmentation of Scanned Surfaces: Improved Extraction of Planes (R. Sacchi, J.F. Poliakoff, P.D. Thomas, and K.-H. Häfele). 20. Constraint-Based Visualization of Spatiotemporal Databases (Peter Revesz and Lixin Li). 21. Surface Oriented Triangulation of Unorganized 3D Points Based On Laszlo’s Algorithm (Thomas Schadlich, Guido Brunnett and Mark Vanco). 22. Modifying the Shape of Cubic B-spline and NURBS Curves by Means of Knots (Imre Juhász and Miklós Hoffmann). Index of Authors.

Read more less

Book SynopsisAddresses the application of both IP and ATM technologies to a cellular environment, including IP telephony protocols, the use of ATM/AAL2 and the AAL2 signalling protocol for voice/multimedia and data transport. This book explains the operation and integration of GSM, GPRS, EDGE, UMTS, CDMA2000, IP, and ATM.Trade Review"…this is an excellent volume, a must-have for systems architects…also to be commended for its cohesive and comprehensive assembly of many complex standards." (Computing Reviews.com, October 4, 2005) "This both is very detailed, yet readable. It would be an excellent read for both students and telecommunications professionals…" (Computing Reviews.com, June 8, 2005) "…well-structured…it provides detailed, and carefully selected and prepared, material." (Computing Reviews.com, October 21, 2004) "...very detailed yet readable...an excellent read for both students and professionals..." (The IEE Communications Engineer, June/July 2004)Table of ContentsAbout the Authors. 1. Introduction. 2. Principles of Communications . 3. GSM Fundamentals. 4. General Packet Radio System. 5. IP Applications for GPRS/UMTS. 6. Universal Mobile Telecommunications System. 7. UMTS Transmission Networks. 8. IP Telephony for UMTS Release 4. 9. Release 5 and Beyond (All-IP). Glossary of Terms. Index.

Read more less

Book SynopsisNetwork and system administration usually refers to the skill of keeping computers and networks running properly. But in truth, the skill needed is that of managing complexity. This book describes the science behind these complex systems, independent of the actual operating systems they work on.Table of ContentsForeword xi Preface xiv 1 Introduction 1 1.1 What is system administration? 1 1.2 What is a system? 2 1.3 What is administration? 2 1.4 Studying systems 3 1.5 What’s in a theory? 6 1.6 How to use the text 10 1.7 Some notation used 10 2 Science and its methods 13 2.1 The aim of science 13 2.2 Causality, superposition and dependency 16 2.3 Controversies and philosophies of science 17 2.4 Technology 20 2.5 Hypotheses 20 2.6 The science of technology 21 2.7 Evaluating a system—dependencies 22 2.8 Abuses of science 22 3 Experiment and observation 25 3.1 Data plots and time series 26 3.2 Constancy of environment during measurement 27 3.3 Experimental design 28 3.4 Stochastic (random) variables 29 3.5 Actual values or characteristic values 30 3.6 Observational errors 30 3.7 The mean and standard deviation 31 3.8 Probability distributions and measurement 32 3.8.1 Scatter and jitter 35 3.8.2 The ‘normal’ distribution 35 3.8.3 Standard error of the mean 36 3.8.4 Other distributions 37 3.9 Uncertainty in general formulae 38 3.10 Fourier analysis and periodic behaviour 39 3.11 Local averaging procedures 41 3.12 Reminder 43 4 Simple systems 45 4.1 The concept of a system 45 4.2 Data structures and processes 46 4.3 Representation of variables 47 4.4 The simplest dynamical systems 48 4.5 More complex systems 49 4.6 Freedoms and constraints 50 4.7 Symmetries 51 4.8 Algorithms, protocols and standard ‘methods’ 52 4.9 Currencies and value systems 53 4.9.1 Energy and power 53 4.9.2 Money 54 4.9.3 Social currency and the notion of responsibility 54 4.10 Open and closed systems: the environment 56 4.11 Reliable and unreliable systems 58 5 Sets, states and logic 59 5.1 Sets 59 5.2 A system as a set of sets 61 5.3 Addresses and mappings 61 5.4 Chains and states 62 5.5 Configurations and macrostates 64 5.6 Continuum approximation 65 5.7 Theory of computation and machine language 65 5.7.1 Automata or State Machines 66 5.7.2 Operators and operands 68 5.7.3 Pattern matching and operational grammars 69 5.7.4 Pathway analysis and distributed algorithms 70 5.8 A policy-defined state 71 6 Diagrammatical representations 73 6.1 Diagrams as systems 73 6.2 The concept of a graph 74 6.3 Connectivity 77 6.4 Centrality: maxima and minima in graphs 77 6.5 Ranking in directed graphs 80 6.6 Applied diagrammatical methods 84 7 System variables 91 7.1 Information systems 91 7.2 Addresses, labels, keys and other resource locators 92 7.3 Continuous relationships 94 7.4 Digital comparison 94 8 Change in systems 97 8.1 Renditions of change 97 8.2 Determinism and predictability 98 8.3 Oscillations and fluctuations 99 8.4 Rate of change 102 8.5 Applications of the continuum approximation 103 8.6 Uncertainty in the continuum approximation 105 9 Information 109 9.1 What is information? 109 9.2 Transmission 110 9.3 Informationandcontrol 111 9.4 Classification and resolution 111 9.5 Statistical uncertainty and entropy 114 9.6 Propertiesoftheentropy 118 9.7 Uncertainty in communication 119 9.8 A geometrical interpretation of information 123 9.9 Compressibility and size of information 127 9.10 Information and state 128 9.11 Maximum entropy principle 129 9.12 Fluctuation spectra. 133 10 Stability 135 10.1 Basic notions 135 10.2 Types of stability 135 10.3 Constancy 136 10.4 Convergence of behaviour 137 10.5 Maxima and minima 138 10.6 Regions of stability in a graph 139 10.7 Graph stability under random node removal 141 10.8 Dynamical equilibria: compromise 142 10.9 Statistical stability 143 10.10 Scaling stability 145 10.11 Maximum entropy distributions 148 10.12 Eigenstates 148 10.13 Fixed points of maps 151 10.14 Metastable alternatives and adaptability 155 10.15 Final remarks 156 11 Resource networks 159 11.1 What is a system resource? 159 11.2 Representation of resources 160 11.3 Resource currency relationships 161 11.4 Resource allocation, consumption and conservation 162 11.5 Where to attach resources? 163 11.6 Access to resources 165 11.7 Methods of resource allocation 167 11.7.1 Logical regions of systems 167 11.7.2 Using centrality to identify resource bottlenecks 168 11.8 Directed resources: flow asymmetries 170 12 Task management and services 173 12.1 Task list scheduling 173 12.2 Deterministic and non-deterministic schedules 174 12.3 Human–computer scheduling 176 12.4 Service provision and policy 176 12.5 Queue processing 177 12.6 Models 178 12.7 The prototype queue M/M/ 1 179 12.8 Queue relationships or basic ‘laws’ 181 12.9 Expediting tasks with multiple servers M/M/k 186 12.10 Maximum entropy input events in periodic systems 188 12.11 Miscellaneous issues in scheduling 189 13 System architectures 191 13.1 Policy for organization 191 13.2 Informative and procedural flows 192 13.3 Structured systems and ad hoc systems 193 13.4 Dependence policy 193 13.5 System design strategy 195 13.6 Event-driven systems and functional systems 200 13.7 The organization of human resources 201 13.8 Principle of minimal dependency 202 13.9 Decision-making within a system 202 13.9.1 Layered systems: Managers and workers 202 13.9.2 Efficiency 203 13.10 Prediction, verification and their limitations 204 13.11 Graphical methods 205 14 System normalization 207 14.1 Dependency 207 14.2 The database model 209 14.3 Normalized forms 210 15 System integrity 215 15.1 System administration as communication? 215 15.2 Extensive or strategic instruction 219 15.3 Stochastic semi-groups and martingales 223 15.4 Characterizing probable or average error 224 15.5 Correcting errors of propagation 226 15.6 Gaussian continuum approximation formula 228 16 Policy and maintenance 231 16.1 What is maintenance? 231 16.2 Average changes in configuration 231 16.3 The reason for random fluctuations 234 16.4 Huge fluctuations 235 16.5 Equivalent configurations and policy 236 16.6 Policy 237 16.7 Convergent maintenance 237 16.8 The maintenance theorem 240 16.9 Theory of back-up and error correction 241 17 Knowledge, learning and training 249 17.1 Information and knowledge 250 17.2 Knowledgeasclassification 250 17.3 Bayes’ theorem 252 17.4 Belief versus truth 254 17.5 Decisions based on expert knowledge 255 17.6 Knowledge out of date 259 17.7 Convergence of the learning process 260 18 Policy transgressions and fault modelling 263 18.1 Faults and failures 263 18.2 Deterministic system approximation 265 18.3 Stochasticsystemmodels 269 18.4 Approximate information flow reliability 273 18.5 Fault correction by monitoring and instruction 275 18.6 Policy maintenance architectures 279 18.7 Diagnostic cause trees 286 18.8 Probabilistic fault trees 290 18.8.1 Faults 290 18.8.2 Conditions and set logic 291 18.8.3 Construction 293 19 Decision and strategy 295 19.1 Causal analysis 295 19.2 Decision-making 296 19.3 Game theory 297 19.4 The strategic form of a game 301 19.5 The extensive form of a game 302 19.6 Solving zero-sum games 303 19.7 Dominated strategies 304 19.8 Nash equilibria 305 19.9 A security game 309 19.9.1 Zero-sum approximation 310 19.9.2 Non-zero sum approximation 313 19.10 The garbage collection game 315 19.11 A social engineering game 321 19.12 Human elements of policy decision 328 19.13 Coda: extensive versus strategic configuration management 328 20 Conclusions 331 A Some Boolean formulae 335 A.1 Conditional probability 335 A.2 Boolean algebra and logic 336 B Statistical and scaling properties of time-series data 339 B. 1 Local averaging procedure 339 B. 2 Scaling and self-similarity 343 B. 3 Scaling of continuous functions 344 C Percolation conditions 347 C. 1 Random graph condition 347 C. 2 Bi-partite form 350 C. 3 Small-graph corrections 351 Bibliography 353 Index 359

Read more less

Book SynopsisMMS has evolved from the huge popularity of the SMS text service for GSM networks. It is a departure from the transport mechanism used for SMS (which is based on the GSM signalling channels) to the use of IP to transport messages within the MMS network. To this end, MMS has similarities with Internet email and standard IETF protocols.Trade Review"…a good introduction to GPRS…" (IEE Communications Engineer, February 2004) "...target audience should find Daniel Ralph and Paul Graham's book a useful addition to their office..." (M2 Best Books, 2004) "...a very comprehensive guide...can be strongly recommended..." (EBU Technical Review, 20 July 2004)Table of ContentsAbout the Authors. How This Book Is Organized. Acknowledgements. PART I: MOBILE MESSAGING BUSINESS CHALLENGES. 1. Multimedia Messaging Overview. 2. The Multimedia Messaging Value Chain. PART II: THE TECHNOLOGIES OF MULTI MEDIA MESSAGING. 3. A Standards-based Approach. 4. Application Layer. 5. Network Layer. PART III: MULTI MEDIA MESSAGING SERVICES TODAY AND TOMORROW. 6. Multimedia Messaging Services Today and Tomorrow. 7. Future Recommendations. Table of Infrastructure, Content and Software Vendors. Glossary. Standards and Specifications. Websites. Industrial Fora, Regulatory Organizations and Other Relevant Initiatives. References. Index.

Read more less

Book SynopsisHere is the first book to include a step--by--step process of how to design intelligent agents. Providing a full life--cycle methodology for developing intelligent agent systems, Developing Autonomous Agent Systems present a thoroughly developed and tested methodology to developing intelligent agent technologies.Table of ContentsForeword from the Series Editor. Preface. Acknowledgements. 1. Agents and Multi-Agent Systems. 2. Concepts for Building Agents. 3. Overview of the Prometheus Methodology. 4. System Specification. 5. Architectural Design: Specifying the Agent Types. 6. Architectural Design: Specifying the Interactions. 7. Finalizing the Architectural Design. 8. Detailed Design: Agents, Capabilities and Processes. 9. Detailed Design: Capabilities, Plans and Events. 10. Implementing Agent Systems. Appendix A: Electronic Bookstore. Appendix B: Descriptor Forms. Appendix C:The AUML Notaton. Bibliography. Index.

Read more less

Book Synopsis Extending the scenario method beyond interface design, this important book shows developers how to design more effective systems by soliciting, analyzing, and elaborating stories from end-users Contributions from leading industry consultants and opinion-makers present a range of scenario techniques, from the light, sketchy, and agile to the careful and systematic Includes real-world case studies from Philips, DaimlerChrysler, and Nokia, and covers systems ranging from custom software to embedded hardware-software systems Trade Review"...this book is a breath of fresh air, providing practical guidance on incorporating techniques and approaches to the development cycle." - Usability ConsultantTable of ContentsPreface xiii Biographies and Photographs xvii Part I Overview Chapter 1 Introduction: Scenarios in System Development Context 3 Through the Life Cycle 17 Types of System 18 Scenarios for Systems—Not Necessarily Software 19 The Way Ahead 21 Keywords 21 References 21 Recommended Reading 22 Chapter 2 Scenario-based Approaches Overview: The Crews Scenario Framework 25 The Framework 26 The Scenario Approaches Described in this Book 28 Conclusion 32 Keywords 32 References 32 Part II Scenarios Through the System Life-cycle: Techniques Chapter 3 Scenarios in Requirements Discovery Applicability 39 Position in the Life Cycle 40 Key Features 40 Strengths 40 Weaknesses 41 What Is a Requirements Scenario? 41 From Scenarios to Atomic Requirements 51 Keeping Track of the Investigation 54 Who Produces the Scenarios? 54 Techniques for Building Scenarios 55 When to Use Scenarios 58 Keywords 59 References 59 Chapter 4 Scenarios for Innovation: Developing Scenario-based User Needs Analysis (Suna) Applicability 61 Position in the Life Cycle 62 Key Features 62 Strengths and Weaknesses 63 Technique 64 Worked Example 73 Comparisons 77 Keywords 79 References 79 Recommended Readings 79 Chapter 5 Running a Use Case/scenario Workshop Applicability 81 Position in the Life Cycle 82 Key Features 82 Strengths 83 Weaknesses 84 Technique 85 Worked Example 93 Comparisons 99 Keywords 100 References 100 Recommended Reading 101 Chapter 6 Alternative World Scenarios to Assess Requirement Stability Applicability 103 Position in the Life Cycle 104 Key Features 104 Strengths 104 Weaknesses 104 Technique 105 Worked Example 110 Comparisons 115 Keywords 116 References 116 Recommended Reading 117 Chapter 7 Cases Negative Scenarios and Misuse Applicability 119 Roles in the Life Cycle 119 Key Features 120 Strengths 120 Weaknesses 120 Technique 120 Worked Example 128 Comparisons 131 Keywords 138 References 138 Recommended Reading 139 Chapter 8 Authoring Use Cases Applicability 141 Position in the Life Cycle 141 Key Features 142 Strengths 143 Weaknesses 143 Technique 143 Comparisons 158 Keywords 159 References 159 Recommended Reading 160 Chapter 9 Systematic Scenario Walkthroughs with Art-scene Position in the Life Cycle 161 Applicability 161 Key Features 162 Strengths 162 Weaknesses 162 The Art-Scene Process and Environment 162 Art-Scene’s Research Provenance 163 The Art-Scene Approach 164 The Structure and Representation of an Art-Scene Scenario 164 The Art-Scene Software Environment 166 Facilitating Scenario Walkthroughs 171 The Scenario Workshop Environment 173 Worked Example 173 Comparisons 176 Keywords 177 References 177 Recommended Reading 178 Chapter 10 The role of scenarios In Contextual Design: From User Observations to Work Redesign To Use Cases Applicability 180 Position in the Life Cycle 180 Key Features 181 Strengths 181 Weaknesses 185 Technique 185 Techniques and Worked Example 186 Lessons Learnt 205 Comparisons 206 Keywords 207 References 207 Recommended Readings 208 Chapter 11 A Scenario-based Design Method for Human-centred Interaction Design Overview 211 Applicability 211 Position in the Life Cycle 212 Key Features 212 Strengths 213 Weaknesses 213 The Method 213 Other Artifacts in the Method 218 Processes of the Method 220 Summary 223 Worked Example 224 User Story 225 Comparisons 232 Acknowledgements 233 Keywords 234 References 234 Recommended Reading 234 Chapter 12 Use Case-based Software Development Applicability 237 Position in the Life Cycle 238 Key Features 238 Strengths 238 Weaknesses 238 Technique and Worked Example 239 Summary and Comparisons 262 Keywords 263 References 263 Recommended Reading 264 Chapter 13 User Stories in Agile Software Development Applicability 265 Applicability II—Why User Stories? 266 Position in Life Cycle 267 Key Features 267 Strengths 268 Weaknesses 268 Technique 269 Worked Example 275 Comparisons 278 Keywords 279 References 279 Recommended Reading 279 Chapter 14 Use Cases, Test Cases Applicability 281 Position in the Life Cycle 281 Key Features 282 Strengths 282 Weaknesses 282 Background: The V-Model 283 Technique 284 Worked Example 290 Comparisons 296 Keywords 297 References 297 Recommended Reading 298 Chapter 15 Project Stories: Combining Life-cycle Process Models Applicability 299 Position in the Life Cycle 299 Key Features 300 Strengths 300 Weaknesses 300 Technique 300 Conclusion 323 Keywords 324 References 324 Recommended Reading 324 Part III Scenarios in Action: Case Studies Chapter 16 Story Use and Reuse in Automotive Systems Engineering Type of Project 329 Applicability 329 Position in the Life Cycle 330 Roles Played by Scenarios 330 Strengths 330 Weaknesses 330 Introduction 330 Automotive Software Development 331 Stories in Automotive Software Development 334 Lessons Learnt 342 Keywords 345 References 346 Chapter 17 Systems Use and Misuse Cases in Railway A: Use Cases for Train Control Requirements Discovery 347 Type of Project 347 Applicability 348 Position in the Life Cycle 348 Roles Played by Scenarios 348 Strengths 348 Weaknesses 348 Case Study 349 Methods and Tools 350 Approach 350 Lessons Learnt 352 Keywords 353 B: Misuse Cases for a Seats Trade-Off 354 Type of Project 354 Applicability 354 Position in the Life Cycle 354 Roles Played by Scenarios 354 Strengths 355 Weaknesses 355 Case Study 355 Lessons Learnt 360 Summary 361 Keywords 362 References 362 Chapter 18 Scenarios in Air Traffic Control (ATC) Applicability 363 Roles in the Life Cycle 364 Key Features 364 Strengths 364 Weaknesses 365 Background 366 Results 372 Keywords 376 References 376 Chapter 19 Scenarios and Quality Requirements in Telecommunications Type of Project 379 Applicability 379 Position in the Life Cycle 380 Roles Played by Scenarios 380 Strengths 380 Weaknesses 380 Case Study 381 Lessons Learnt 389 Acknowledgements 391 Keywords 391 References 391 Chapter 20 Scenarios in Rail Rolling Stock with Reveal Applicability 393 Position in the Life Cycle 394 Key Features 394 Strengths 394 Weaknesses 395 Case Study 396 Lessons Learnt 408 Keywords 409 References 409 Chapter 21 Evaluating Scenarios by Simulation Type of Project 411 Applicability 412 Position in the Life Cycle 412 Roles Played by Scenarios 412 Strengths 412 Weaknesses 412 Case Study 413 Lessons Learnt 425 Keywords 426 References 426 Part IV The Way Ahead Chapter 22 Putting Scenarios Into Practice Which Kind of Scenario, When? 431 Which Scenario Technique, When? Conclusions from Part 2 432 Who, and Why? 435 Scenarios Everywhere? 436 How Does Project Scale Affect Scenario Usage? 437 Into Practice: Conclusions from the Part 3 Case Studies 439 Do Scenarios Replace Requirements? 440 Getting Started 443 Keywords 444 References 444 Chapter 23 Teaching Computer Scientists To Make Use Challenges in Teaching Students to Make Use 445 Comparisons—Scenarios for Making Use 446 Using Cases to Teach Scenario-Based Usability Engineering 449 Strengths and Weaknesses 458 Discussion and Future Directions 459 Acknowledgements 461 Keywords 461 References 462 Recommended Readings 463 Chapter 24 What Scenarios (Still) Aren’t Good for Continuous Behaviour 465 Very Large Systems 466 Fragmentary Models 466 Episodic, Allusory 467 Domain-Specific? 467 Which Representation? 467 Open-Ended 468 Tacit Knowledge 468 Non-Functional Requirements (NFRs) 468 Summary 468 References 469 Chapter 25 The Future of Scenarios Introduction: Horses for Courses 471 Towards a Framework 471 Representation 471 Process 472 Domain Knowledge 473 COTS 473 Dissemination 473 Summary 474 References 474 Appendix 1 Scenario-based System Development Templates 475 Appendix 2 Exercises 499 Appendix 3 Answers to Exercises 501 Glossary 507 Index 513

Read more less

Book SynopsisA comprehensive resource that responds to the high demand for specialists who can provide advice to users and handle day-to-day administration, maintenance, and support of computer systems and networks. It shows how to discover customer needs and then use that information to identify, interpret, and evaluate system and network requirements.Table of ContentsPreface to Second Edition. 1. Introduction. 2. System Components. 3. Networked Communities. 4. Host Management. 5. User Management 6. Models of Network and System Administration. 7. Configuration and Maintenance. 8. Diagnostics, Fault and Change Management. 9. Application Level Services. 10. Network Level Services. 11. Principles of Security. 12. Security Implications. 13. Analytical System Administration. 14. Summary and Outlook. A. Some Useful Unix Commands. B. Programming and Compiling. C. Example Telnet Session. D. Glossary. E. Recommended Reading. Bibliography. Index.

Read more less

Book SynopsisA computer network is made up of a group of two or more connected machines. In a Local Area Network (or LAN), computers are connected together within a local area, such as an office or home. In a Wide Area Network (or WAN), computers are farther apart and connected via telephone/communication lines, radio waves, or other means of communication.Table of ContentsPreface. Part I: Networking Basics. Chapter 1: Evolution of Computer Networks. Chapter 2: General Principles of Network Design. Chapter 3: Packet and Circuit Switching. Chapter 4: Network Architecture and Standardization. Chapter 5: Examples of Networks. Chapter 6: Network Characteristics. Chapter 7: Methods of Ensuring Quality of Service. Part II: Physical Layer Technologies. Chapter 8: Transmission Links. Chapter 9: Data Encoding and Multiplexing. Chapter 10: Wireless Transmission. Chapter 11: Transmission Networks. Part III: Local Area Networks. Chapter 12: Ethernet. Chapter 13: High-Speed Ethernet. Chapter 14: Shared Media LANs. Chapter 15: Switched LAN Basics. Chapter 16: Advanced Features of Switched LANs. Part IV: TCP/IP Internet-working. Chapter 17: Addressing in TCP/IP Networks. Chapter 18: Internet Protocol. Chapter 19: Core Protocols of the TCP/IP Stack. Chapter 20: Advanced Features of IP Routers. Part V: Wide-Area Networks. Chapter 21: Virtual Circuit WAN. Chapter 22: IP WANs. Chapter 23: Remote Access. Chapter 24: Secure Transport Services. Summary. Review questions. Problems. Conclusion. References and recommended reading. Index.

Read more less

Book SynopsisThe perennial bestseller shows you how share your files and Internet connection across a wireless network Fully updated for Windows 7 and Mac OS X Snow Leopard, this new edition of this bestseller returns with all the latest in wireless standards and security. This fun and friendly guide shows you how to integrate your iPhone, iPod touch, smartphone, or gaming system into your home network. Veteran authors escort you through the various financial and logisitical considerations that you need to take into account before building a wireless network at home. Covers the basics of planning, installing, and using wireless LANs Reviews essential information on the latest security issues Delivers valuable tips on how to stay current with fast-moving technology Discusses how to share resources such as printers, scanners, an Internet connection, files, and more with multiple computers on one network Wireless Home Networking For DTable of ContentsIntroduction 1 Part I: Wireless Networking Fundamentals 7 Chapter 1: Introducing Wireless Home Networking 9 Chapter 2: From a to n and b-yond 27 Chapter 3: Exploring Bluetooth and Other Wireless Networks 51 Part II: Making Plans 67 Chapter 4: Planning a Wireless Home Network 69 Chapter 5: Choosing Wireless Home Networking Equipment 91 Part III: Installing a Wireless Network 107 Chapter 6: Installing Wireless Access Points in Windows 109 Chapter 7: Setting Up a Wireless Windows Network 125 Chapter 8: Setting Up a Wireless Mac Network 143 Chapter 9: Securing Your Home Network 161 Part IV: Using Your Wireless Network 183 Chapter 10: Putting Your Wireless Network to Work 185 Chapter 11: Gaming Over Your Wireless Network 205 Chapter 12: Networking Your Entertainment Center 225 Chapter 13: Extending Your Mobile Network 245 Chapter 14: Other Cool Things You Can Network 257 Chapter 15: Using a Bluetooth Network 273 Chapter 16: Going Wireless Away from Home 285 Part V: The Part of Tens 297 Chapter 17: Ten FAQs about Wireless Home Networks 299 Chapter 18: Ten Ways to Troubleshoot Wireless LAN Performance 309 Chapter 19: Ten Devices to Connect to Your Wireless Network in the Future 319 Chapter 20: Ten Sources for More Information 339 Index 347

Read more less

Book SynopsisQuickly Engages in Applying Algorithmic Techniques to Solve Practical Signal Processing Problems With its active, hands-on learning approach, this text enables readers to master the underlying principles of digital signal processing and its many applications in industries such as digital television, mobile and broadband communications, and medical/scientific devices. Carefully developed MATLAB examples throughout the text illustrate the mathematical concepts and use of digital signal processing algorithms. Readers will develop a deeper understanding of how to apply the algorithms by manipulating the codes in the examples to see their effect. Moreover, plenty of exercises help to put knowledge into practice solving real-world signal processing challenges. Following an introductory chapter, the text explores: Sampled signals and digital processing Random signals Representing signals and systems TemporTrade Review"Intended for undergraduate or graduate students in engineering or related disciplines, this introductory volume examines key theories in signal processing and presents this information optimized for use with MATLAB technical computing software." (Book News, 1 October 2011) Table of ContentsPreface xi Chapter 1. What Is Signal Processing? 1 1.1 Chapter Objectives 1 1.2 Introduction 1 1.3 Book Objectives 2 1.4 DSP and ITS Applications 3 1.5 Application Case Studies Using DSP 4 1.6 Overview of Learning Objectives 12 1.7 Conventions Used in This Book 15 1.8 Chapter Summary 16 Chapter 2. Matlab for Signal Processing 19 2.1 Chapter Objectives 19 2.2 Introduction 19 2.3 What Is MATLAB? 19 2.4 Getting Started 20 2.5 Everything Is a Matrix 20 2.6 Interactive Use 21 2.7 Testing and Looping 23 2.8 Functions and Variables 25 2.9 Plotting and Graphing 30 2.10 Loading and Saving Data 31 2.11 Multidimensional Arrays 35 2.12 Bitwise Operators 37 2.13 Vectorizing Code 38 2.14 Using MATLAB for Processing Signals 40 2.15 Chapter Summary 43 Chapter 3. Sampled Signals and Digital Processing 45 3.1 Chapter Objectives 45 3.2 Introduction 45 3.3 Processing Signals Using Computer Algorithms 45 3.4 Digital Representation of Numbers 47 3.5 Sampling 61 3.6 Quantization 64 3.7 Image Display 74 3.8 Aliasing 81 3.9 Reconstruction 84 3.10 Block Diagrams and Difference Equations 88 3.11 Linearity, Superposition, and Time Invariance 92 3.12 Practical Issues and Computational Efficiency 95 3.13 Chapter Summary 98 Chapter 4. Random Signals 103 4.1 Chapter Objectives 103 4.2 Introduction 103 4.3 Random and Deterministic Signals 103 4.4 Random Number Generation 105 4.5 Statistical Parameters 106 4.6 Probability Functions 108 4.7 Common Distributions 112 4.8 Continuous and Discrete Variables 114 4.9 Signal Characterization 116 4.10 Histogram Operators 117 4.11 Median Filters 122 4.12 Chapter Summary 125 Chapter 5. Representing Signals and Systems 127 5.1 Chapter Objectives 127 5.2 Introduction 127 5.3 Discrete-Time Waveform Generation 127 5.4 The z Transform 137 5.5 Polynomial Approach 144 5.6 Poles, Zeros, and Stability 146 5.7 Transfer Functions and Frequency Response 152 5.8 Vector Interpretation of Frequency Response 153 5.9 Convolution 156 5.10 Chapter Summary 160 Chapter 6. Temporal and Spatial Signal Processing 165 6.1 Chapter Objectives 165 6.2 Introduction 165 6.3 Correlation 165 6.4 Linear Prediction 177 6.5 Noise Estimation and Optimal Filtering 183 6.6 Tomography 188 6.7 Chapter Summary 201 Chapter 7. Frequency Analysis of Signals 203 7.1 Chapter Objectives 203 7.2 Introduction 203 7.3 Fourier Series 203 7.4 How Do the Fourier Series Coefficient Equations Come About? 209 7.5 Phase-Shifted Waveforms 211 7.6 The Fourier Transform 212 7.7 Aliasing in Discrete-Time Sampling 231 7.8 The FFT as a Sample Interpolator 233 7.9 Sampling a Signal over a Finite Time Window 236 7.10 Time-Frequency Distributions 240 7.11 Buffering and Windowing 241 7.12 The FFT 243 7.13 The DCT 252 7.14 Chapter Summary 266 Chapter 8. Discrete-Time Filters 271 8.1 Chapter Objectives 271 8.2 Introduction 271 8.3 What Do We Mean by “Filtering”? 272 8.4 Filter Specification, Design, and Implementation 274 8.5 Filter Responses 282 8.6 Nonrecursive Filter Design 285 8.7 Ideal Reconstruction Filter 293 8.8 Filters with Linear Phase 294 8.9 Fast Algorithms for Filtering, Convolution, and Correlation 298 8.10 Chapter Summary 311 Chapter 9. Recursive Filters 315 9.1 Chapter Objectives 315 9.2 Introduction 315 9.3 Essential Analog System Theory 319 9.4 Continuous-Time Recursive Filters 326 9.5 Comparing Continuous-Time Filters 339 9.6 Converting Continuous-Time Filters to Discrete Filters 340 9.7 Scaling and Transformation of Continuous Filters 361 9.8 Summary of Digital Filter Design via Analog Approximation 371 9.9 Chapter Summary 372 Bibliography 375 Index 379

Read more less

Book SynopsisThis important resource offers a detailed description about the practical considerations and applications in database programming using Java NetBeans 6. 8 with authentic examples and detailed explanations. This book provides readers with a clear picture as to how to handle the database programming issues in the Java NetBeans environment.Table of ContentsPreface xxiii Acknowledgments xxv Chapter 1 Introduction 1 What This Book Covers 2 How This Book Is Organized and How to Use This Book 3 How to Use the Source Code and Sample Databases 5 Instructor and Customer Support 6 Homework Solutions 7 Chapter 2 Introduction to Databases 9 2.1 What Are Databases and Database Programs? 10 2.2 Develop a Database 12 2.3 Sample Database 13 2.4 Identifying Keys 17 2.5 Define Relationships 18 2.6 ER Notation 21 2.7 Data Normalization 21 2.8 Database Components in Some Popular Databases 26 2.9 Create Microsoft Access Sample Database 34 2.10 Create Microsoft SQL Server 2008 2.11 Create Oracle 10g XE Sample Database 61 2.12 Chapter Summary 85 Chapter 3 JDBC API and JDBC Drivers 89 3.1 What Are JDBC and JDBC API? 89 3.2 JDBC Components and Architecture 90 3.3 How Does JDBC Work? 92 3.4 JDBC Driver and Driver Types 95 3.5 JDBC Standard Extension API 99 3.6 Chapter Summary 108 Chapter 4 JDBC Application Design Considerations 113 4.1 JDBC Application Models 113 4.2 JDBC Applications Fundamentals 115 4.3 Chapter Summary 151 Chapter 5 Introduction to NetBeans IDE 155 5.1 Overview of the NetBeans IDE 6.8 156 5.2 Installing and Confi guring the NetBeans IDE 6.8 161 5.3 Exploring NetBeans IDE 6.8 164 5.4 Chapter Summary 312 PART I Building Two-Tier Client–Server Applications 317 Chapter 6 Query Data from Databases 319 Section I Query Data Using Java Persistence API Wizards 319 6.1 Java Persistence APIs 319 6.2 Query Data Using Java Persistence API Wizards (JPA) 321 Section II Query Data Using Java Runtime Objects Method 383 6.3 Introduction to Runtime Object Method 383 6.4 Create a Java Application Project to Access the SQL Server Database 384 6.5 Create a Java Application Project to Access the Oracle Database 441 6.6 Chapter Summary 455 Chapter 7 Insert, Update, and Delete Data from Databases 463 Section I Insert, Update and Delete Data Using Java Persistence API Wizards 463 7.1 Perform Data Manipulations to SQL Server Database Using JPA Wizards 464 7.2 Perform Data Manipulations to Oracle Database Using JPA Wizards 482 Section II Insert, Update and Delete Data Using Java Runtime Objects Method 488 7.3 Perform Data Manipulations to SQL Server Database Using Java Runtime Object 488 7.4 Perform Data Manipulations to Oracle Database Using Java Runtime Object 502 7.5 Perform Data Manipulations Using Updatable ResultSet 510 7.6 Perform Data Manipulations Using Callable Statements 522 7.7 Chapter Summary 550 PART II Building Three-Tier Client–Server Applications 555 Chapter 8 Developing Java Web Applications to Access Databases 557 8.1 A Historical Review about Java Web Application Development 557 8.2 Java EE Web Application Model 597 8.3 The Architecture and Components of Java Web Applications 599 8.4 Getting Started with Java Web Applications Using NetBeans IDE 611 8.5 Build Java Web Project to Access SQL Server Database 625 8.6 Build Java Web Project to Access and Manipulate Oracle Database 690 8.7 Chapter Summary 764 Chapter 9 Developing Java Web Services to Access Databases 769 9.1 Introduction to Java Web Services 770 9.2 The Structure and Components of SOAP-Based Web Services 772 9.3 The Procedure of Building a Typical SOAP-Based Web Service Project 774 9.4 Getting Started with Java Web Services Using NetBeans IDE 786 9.5 Build Java Web Service Projects to Access SQL Server Database 787 9.6 Build a Windows-Based Web Client Project to Consume the Web Service 795 9.7 Build a Web-Based Client Project to Consume the Web Service 801 9.8 Build Java Web Service to Insert Data into the SQL Server Database 808 9.9 Build a Windows-Based Web Client Project to Consume the Web Service 811 9.10 Build a Web-Based Client Project to Consume the Web Service 815 9.11 Build Java Web Service to Update and Delete Data from the SQL Server Database 819 9.12 Build a Windows-Based Web Client Project to Consume the Web Service 827 9.13 Build a Web-Based Client Project to Consume the Web Service 834 9.14 Build Java Web Service Projects to Access Oracle Databases 840 9.15 Build a Windows-Based Web Client Project to Consume the Web Service 873 9.16 Build a Web-Based Web Client Project to Consume the Web Service 890 9.17 Chapter Summary 904 Homework 905 Index 909 About the Author 919

Read more less

Book SynopsisThe official, Guidance Software-approved book on the newest EnCE exam! The EnCE exam tests that computer forensic analysts and examiners have thoroughly mastered computer investigation methodologies, as well as the use of Guidance Software''s EnCase Forensic 7. The only official Guidance-endorsed study guide on the topic, this book prepares you for the exam with extensive coverage of all exam topics, real-world scenarios, hands-on exercises, up-to-date legal information, and sample evidence files, flashcards, and more. Guides readers through preparation for the newest EnCase Certified Examiner (EnCE) exam Prepares candidates for both Phase 1 and Phase 2 of the exam, as well as for practical use of the certification Covers identifying and searching hardware and files systems, handling evidence on the scene, and acquiring digital evidence using EnCase Forensic 7 Includes hands-on exercises, practice questions, and up-to-date legal informTable of ContentsIntroduction xxi Assessment Test xxvii Chapter 1 Computer Hardware 1 Computer Hardware Components 2 The Boot Process 14 Partitions 20 File Systems 25 Summary 27 Exam Essentials 27 Review Questions 28 Chapter 2 File Systems 33 FAT Basics 34 The Physical Layout of FAT 36 Viewing Directory Entries Using EnCase 52 The Function of FAT 58 NTFS Basics 73 CD File Systems 77 exFAT 79 Summary 83 Exam Essentials 84 Review Questions 85 Chapter 3 First Response 89 Planning and Preparation 90 The Physical Location 91 Personnel 91 Computer Systems 92 What to Take with You Before You Leave 94 Search Authority 97 Handling Evidence at the Scene 98 Securing the Scene 98 Recording and Photographing the Scene 99 Seizing Computer Evidence 99 Bagging and Tagging 110 Summary 113 Exam Essentials 113 Review Questions 115 Chapter 4 Acquiring Digital Evidence 119 Creating EnCase Forensic Boot Disks 121 Booting a Computer Using the EnCase Boot Disk 124 Seeing Invisible HPA and DCO Data 125 Other Reasons for Using a DOS Boot 126 Steps for Using a DOS Boot 126 Drive-to-Drive DOS Acquisition 128 Steps for Drive-to-Drive DOS Acquisition 128 Supplemental Information About Drive-to-Drive DOS Acquisition 132 Network Acquisitions 135 Reasons to Use Network Acquisitions 135 Understanding Network Cables 136 Preparing an EnCase Network Boot Disk 137 Preparing an EnCase Network Boot CD 138 Steps for Network Acquisition 138 FastBloc/Tableau Acquisitions 151 Available FastBloc Models 151 FastBloc 2 Features 152 Steps for Tableau (FastBloc) Acquisition 154 FastBloc SE Acquisitions 163 About FastBloc SE 163 Steps for FastBloc SE Acquisitions 164 LinEn Acquisitions 168 Mounting a File System as Read-Only 168 Updating a Linux Boot CD with the Latest Version of LinEn 169 Running LinEn 171 Steps for LinEn Acquisition 173 Enterprise and FIM Acquisitions 176 EnCase Portable 180 Helpful Hints 188 Summary 189 Exam Essentials 192 Review Questions 194 Chapter 5 EnCase Concepts 199 EnCase Evidence File Format 200 CRC, MD5, and SHA-1 201 Evidence File Components and Function 202 New Evidence File Format 206 Evidence File Verification 207 Hashing Disks and Volumes 215 EnCase Case Files 217 EnCase Backup Utility 220 EnCase Configuration Files 227 Evidence Cache Folder 231 Summary 233 Exam Essentials 235 Review Questions 236 Chapter 6 EnCase Environment 241 Home Screen 242 EnCase Layout 246 Creating a Case 249 Tree Pane Navigation 255 Table Pane Navigation 266 Table View 266 Gallery View 275 Timeline View 277 Disk View 280 View Pane Navigation 284 Text View 284 Hex View 287 Picture View 288 Report View 289 Doc View 289 Transcript View 290 File Extents View 291 Permissions View 291 Decode View 292 Field View 294 Lock Option 294 Dixon Box 294 Navigation Data (GPS) 295 Find Feature 297 Other Views and Tools 298 Conditions and Filters 298 EnScript 299 Text Styles 299 Adjusting Panes 300 Other Views 306 Global Views and Settings 306 EnCase Options 310 Summary 318 Exam Essentials 320 Review Questions 321 Chapter 7 Understanding, Searching For, and Bookmarking Data 325 Understanding Data 327 Binary Numbers 327 Hexadecimal 333 Characters 336 ASCII 337 Unicode 338 EnCase Evidence Processor 340 Searching for Data 352 Creating Keywords 353 GREP Keywords 364 Starting a Search 373 Viewing Search Hits and Bookmarking Your Findings 376 Bookmarking 377 Summary 426 Exam Essentials 428 Review Questions 430 Chapter 8 File Signature Analysis and Hash Analysis 435 File Signature Analysis 436 Understanding Application Binding 437 Creating a New File Signature 438 Conducting a File Signature Analysis 442 Hash Analysis 449 MD5 Hash 449 Hash Sets and Hash Libraries 449 Hash Analysis 462 Summary 466 Exam Essentials 468 Review Questions 469 Chapter 9 Windows Operating System Artifacts 473 Dates and Times 475 Time Zones 475 Windows 64-Bit Time Stamp 476 Adjusting for Time Zone Offsets 481 Recycle Bin 487 Details of Recycle Bin Operation 488 The INFO2 File 488 Determining the Owner of Files in the Recycle Bin 493 Files Restored or Deleted from the Recycle Bin 494 Using an EnCase Evidence Processor to Determine the Status of Recycle Bin Files 496 Recycle Bin Bypass 498 Windows Vista/Windows 7 Recycle Bin 500 Link Files 504 Changing the Properties of a Shortcut 504 Forensic Importance of Link Files 505 Using the Link File Parser 509 Windows Folders 511 Recent Folder 515 Desktop Folder 516 My Documents/Documents 518 Send To Folder 518 Temp Folder 519 Favorites Folder 520 Windows Vista Low Folders 521 Cookies Folder 523 History Folder 526 Temporary Internet Files 532 Swap File 535 Hibernation File 536 Print Spooling 537 Legacy Operating System Artifacts 543 Windows Volume Shadow Copy 544 Windows Event Logs 549 Kinds of Information Available in Event Logs 549 Determining Levels of Auditing 552 Windows Vista/7 Event Logs 554 Using the Windows Event Log Parser 555 For More Information 558 Summary 559 Exam Essentials 564 Review Questions 566 Chapter 10 Advanced EnCase 571 Locating and Mounting Partitions 573 Mounting Files 588 Registry 595 Registry History 595 Registry Organization and Terminology 596 Using EnCase to Mount and View the Registry 601 Registry Research Techniques 605 EnScript and Filters 608 Running EnScripts 609 Filters and Conditions 611 Email 614 Base64 Encoding 619 EnCase Decryption Suite 622 Virtual File System (VFS) 629 Restoration 633 Physical Disk Emulator (PDE) 636 Putting It All Together 641 Summary 645 Exam Essentials 648 Review Questions 649 Appendix A Answers to Review Questions 653 Chapter 1: Computer Hardware 654 Chapter 2: File Systems 655 Chapter 3: First Response 657 Chapter 4: Acquiring Digital Evidence 658 Chapter 5: EnCase Concepts 659 Chapter 6: EnCase Environment 661 Chapter 7: Understanding, Searching For, and Bookmarking Data 662 Chapter 8: File Signature Analysis and Hash Analysis 663 Chapter 9: Windows Operating System Artifacts 664 Chapter 10: Advanced EnCase 665 Appendix B Creating Paperless Reports 667 Exporting the Web Page Report 669 Creating Your Container Report 671 Bookmarks and Hyperlinks 675 Burning the Report to CD or DVD 678 Appendix C About the Additional Study Tools 681 Additional Study Tools 682 Sybex Test Engine 682 Electronic Flashcards 682 PDF of Glossary of Terms 682 Adobe Reader 682 Additional Author Files 683 System Requirements 683 Using the Study Tools 683 Troubleshooting 683 Customer Care 684 Index 685

Read more less

Book SynopsisNew techniques (z-transform, graphic, algebraic) for studying and analyzing parallel algorithms and how to use them Case studies throughout th book Problems at the end of each chapter and available solutions manual A companion website to include lecture notes .Table of ContentsPreface xiii List of Acronyms xix 1 Introduction 1 1.1 Introduction 1 1.2 Toward Automating Parallel Programming 2 1.3 Algorithms 4 1.4 Parallel Computing Design Considerations 12 1.5 Parallel Algorithms and Parallel Architectures 13 1.6 Relating Parallel Algorithm and Parallel Architecture 14 1.7 Implementation of Algorithms: A Two-Sided Problem 14 1.8 Measuring Benefi ts of Parallel Computing 15 1.9 Amdahl’s Law for Multiprocessor Systems 19 1.10 Gustafson–Barsis’s Law 21 1.11 Applications of Parallel Computing 22 2 Enhancing Uniprocessor Performance 29 2.1 Introduction 29 2.2 Increasing Processor Clock Frequency 30 2.3 Parallelizing ALU Structure 30 2.4 Using Memory Hierarchy 33 2.5 Pipelining 39 2.6 Very Long Instruction Word (VLIW) Processors 44 2.7 Instruction-Level Parallelism (ILP) and Superscalar Processors 45 2.8 Multithreaded Processor 49 3 Parallel Computers 53 3.1 Introduction 53 3.2 Parallel Computing 53 3.3 Shared-Memory Multiprocessors (Uniform Memory Access [UMA]) 54 3.4 Distributed-Memory Multiprocessor (Nonuniform Memory Access [NUMA]) 56 3.5 SIMD Processors 57 3.6 Systolic Processors 57 3.7 Cluster Computing 60 3.8 Grid (Cloud) Computing 60 3.9 Multicore Systems 61 3.10 SM 62 3.11 Communication Between Parallel Processors 64 3.12 Summary of Parallel Architectures 67 4 Shared-Memory Multiprocessors 69 4.1 Introduction 69 4.2 Cache Coherence and Memory Consistency 70 4.3 Synchronization and Mutual Exclusion 76 5 Interconnection Networks 83 5.1 Introduction 83 5.2 Classification of Interconnection Networks by Logical Topologies 84 5.3 Interconnection Network Switch Architecture 91 6 Concurrency Platforms 105 6.1 Introduction 105 6.2 Concurrency Platforms 105 6.3 Cilk++ 106 6.4 OpenMP 112 6.5 Compute Unifi ed Device Architecture (CUDA) 122 7 Ad Hoc Techniques for Parallel Algorithms 131 7.1 Introduction 131 7.2 Defining Algorithm Variables 133 7.3 Independent Loop Scheduling 133 7.4 Dependent Loops 134 7.5 Loop Spreading for Simple Dependent Loops 135 7.6 Loop Unrolling 135 7.7 Problem Partitioning 136 7.8 Divide-and-Conquer (Recursive Partitioning) Strategies 137 7.9 Pipelining 139 8 Nonserial–Parallel Algorithms 143 8.1 Introduction 143 8.2 Comparing DAG and DCG Algorithms 143 8.3 Parallelizing NSPA Algorithms Represented by a DAG 145 8.4 Formal Technique for Analyzing NSPAs 147 8.5 Detecting Cycles in the Algorithm 150 8.6 Extracting Serial and Parallel Algorithm Performance Parameters 151 8.7 Useful Theorems 153 8.8 Performance of Serial and Parallel Algorithms on Parallel Computers 156 9 z-Transform Analysis 159 9.1 Introduction 159 9.2 Definition of z-Transform 159 9.3 The 1-D FIR Digital Filter Algorithm 160 9.4 Software and Hardware Implementations of the z-Transform 161 9.5 Design 1: Using Horner’s Rule for Broadcast Input and Pipelined Output 162 9.6 Design 2: Pipelined Input and Broadcast Output 163 9.7 Design 3: Pipelined Input and Output 164 10 Dependence Graph Analysis 167 10.1 Introduction 167 10.2 The 1-D FIR Digital Filter Algorithm 167 10.3 The Dependence Graph of an Algorithm 168 10.4 Deriving the Dependence Graph for an Algorithm 169 10.5 The Scheduling Function for the 1-D FIR Filter 171 10.6 Node Projection Operation 177 10.7 Nonlinear Projection Operation 179 10.8 Software and Hardware Implementations of the DAG Technique 180 11 Computational Geometry Analysis 185 11.1 Introduction 185 11.2 Matrix Multiplication Algorithm 185 11.3 The 3-D Dependence Graph and Computation Domain D 186 11.4 The Facets and Vertices of D 188 11.5 The Dependence Matrices of the Algorithm Variables 188 11.6 Nullspace of Dependence Matrix: The Broadcast Subdomain B 189 11.7 Design Space Exploration: Choice of Broadcasting versus Pipelining Variables 192 11.8 Data Scheduling 195 11.9 Projection Operation Using the Linear Projection Operator 200 11.10 Effect of Projection Operation on Data 205 11.11 The Resulting Multithreaded/Multiprocessor Architecture 206 11.12 Summary of Work Done in this Chapter 207 12 Case Study: One-Dimensional IIR Digital Filters 209 12.1 Introduction 209 12.2 The 1-D IIR Digital Filter Algorithm 209 12.3 The IIR Filter Dependence Graph 209 12.4 z-Domain Analysis of 1-D IIR Digital Filter Algorithm 216 13 Case Study: Two- and Three-Dimensional Digital Filters 219 13.1 Introduction 219 13.2 Line and Frame Wraparound Problems 219 13.3 2-D Recursive Filters 221 13.4 3-D Digital Filters 223 14 Case Study: Multirate Decimators and Interpolators 227 14.1 Introduction 227 14.2 Decimator Structures 227 14.3 Decimator Dependence Graph 228 14.4 Decimator Scheduling 230 14.5 Decimator DAG for s1 = [1 0] 231 14.6 Decimator DAG for s2 = [1 −1] 233 14.7 Decimator DAG for s3 = [1 1] 235 14.8 Polyphase Decimator Implementations 235 14.9 Interpolator Structures 236 14.10 Interpolator Dependence Graph 237 14.11 Interpolator Scheduling 238 14.12 Interpolator DAG for s1 = [1 0] 239 14.13 Interpolator DAG for s2 = [1 −1] 241 14.14 Interpolator DAG for s3 = [1 1] 243 14.15 Polyphase Interpolator Implementations 243 15 Case Study: Pattern Matching 245 15.1 Introduction 245 15.2 Expressing the Algorithm as a Regular Iterative Algorithm (RIA) 245 15.3 Obtaining the Algorithm Dependence Graph 246 15.4 Data Scheduling 247 15.5 DAG Node Projection 248 15.6 DESIGN 1: Design Space Exploration When s ƒ­ƒn[1 1]t 249 15.7 DESIGN 2: Design Space Exploration When s ƒ­ƒn[1 −1]t 252 15.8 DESIGN 3: Design Space Exploration When s = [1 0]t 253 16 Case Study: Motion Estimation for Video Compression 255 16.1 Introduction 255 16.2 FBMAs 256 16.3 Data Buffering Requirements 257 16.4 Formulation of the FBMA 258 16.5 Hierarchical Formulation of Motion Estimation 259 16.6 Hardware Design of the Hierarchy Blocks 261 17 Case Study: Multiplication over GF(2m) 267 17.1 Introduction 267 17.2 The Multiplication Algorithm in GF(2m) 268 17.3 Expressing Field Multiplication as an RIA 270 17.4 Field Multiplication Dependence Graph 270 17.5 Data Scheduling 271 17.6 DAG Node Projection 273 17.7 Design 1: Using d1 = [1 0]t 275 17.8 Design 2: Using d2 = [1 1]t 275 17.9 Design 3: Using d3 = [1 −1]t 277 17.10 Applications of Finite Field Multipliers 277 18 Case Study: Polynomial Division over GF(2) 279 18.1 Introduction 279 18.2 The Polynomial Division Algorithm 279 18.3 The LFSR Dependence Graph 281 18.4 Data Scheduling 282 18.5 DAG Node Projection 283 18.6 Design 1: Design Space Exploration When s1 = [1 −1] 284 18.7 Design 2: Design Space Exploration When s2 = [1 0] 286 18.8 Design 3: Design Space Exploration When s3 = [1 −0.5] 289 18.9 Comparing the Three Designs 291 19 The Fast Fourier Transform 293 19.1 Introduction 293 19.2 Decimation-in-Time FFT 295 19.3 Pipeline Radix-2 Decimation-in-Time FFT Processor 298 19.4 Decimation-in-Frequency FFT 299 19.5 Pipeline Radix-2 Decimation-in-Frequency FFT Processor 303 20 Solving Systems of Linear Equations 305 20.1 Introduction 305 20.2 Special Matrix Structures 305 20.3 Forward Substitution (Direct Technique) 309 20.4 Back Substitution 312 20.5 Matrix Triangularization Algorithm 312 20.6 Successive over Relaxation (SOR) (Iterative Technique) 317 20.7 Problems 321 21 Solving Partial Differential Equations Using Finite Difference Method 323 21.1 Introduction 323 21.2 FDM for 1-D Systems 324 References 331 Index 337

Read more less

Book SynopsisThe visual guide to developing for one of the world s hottest new mobile platforms, the Android OS The Android operating system works on phones that combine a camera, Web browser, e-mail, GPS, and mapping tool into a single accessible pocket-sized unit, and can function on computers, as well.Table of ContentsHOW TO USE THIS VISUAL BLUEPRINT BOOK. 1 GETTING STARTED WITH ANDROID DEVELOPMENT. Introducing Android Devices. Introducing the Development Tools. Introducing the Available APIs. Check What APIs Are Not Available. Become an Android Developer. Get the Android SDK. Get the Android Eclipse Plug-in. Enable USB Debugging. Create an Android Virtual Device. Start the Emulator. 2 GETTING STARTED WITH FLASH CS5. Using the Actions Panel. Create a Skeleton Custom Class. Set the Source Path. Create MovieClips. Create Buttons. Edit Properties in Flash. Add Objects to the Stage with Code. Remove Objects from the Stage with Code. Work with Events. Using the Drawing API. Using Flash CS5 Help. 3 DEVELOPING YOUR FIRST APPLICATION. Create a New Project. Configure Publish Settings. Set Your Application Output. Create a P12 Certificate. Compile from Flash Professional CS5. Compile from the Command Line. Install Your Application on Your Device. Update Your Version Number. Set Application Permissions. Set a Custom Application URI. 4 DESIGNING YOUR APPLICATION. Mobile User Interface Guidelines. Understanding Screen Resolutions. Create Full-Screen Applications. Understanding Screen Orientation. Create Usable Hit States. Understanding Layout. 5 HANDLING INTERACTION. Create Button States. Respond to Touch Events. Track Multiple Touches. Respond to Zoom Events. Respond to Rotate Events. Respond to Pan Events. Respond to Swipe Events. Listen for Accelerometer Events. Determine If the Accelerometer Is Available. Determine Device Orientation. Detect Which Way Is Up. Filter Accelerometer Data. 6 WORKING WITH IMAGES. Prepare Your Images. Import Images. Display Images. Bundle Images with Your Application. Load Images at Runtime. Create Images Dynamically. Save Images to the Camera Roll. Select Images from the Camera Roll. Display the Camera. 7 WORKING WITH SOUND. Import Audio into Your Project. Choose an Audio Codec. Bundle Sounds with Your Application. Load Sounds at Runtime. Play Sounds. Stop Sounds. Set the Volume of a Sound. Visualize the Sound Spectrum. Access the Microphone. 8 WORKING WITH VIDEO. Explore Available Video Formats and Encode a Video File. Convert Videos. Embed a Video. Bundle a Video with Your Application. Load a Video. Buffer a Video. Control a Video. Set the Volume of a Video. 9 WORKING WITH TEXT. Embed Fonts in Your Application. Create an Input TextField. Create a Password TextField. Using TLF TextFields. Create a Scrollable TextField. 10 SAVING STATE. Create a Local SharedObject. Write to a SharedObject. Load Data from a SharedObject. Connect to a SQLite Database. Create a SQLite Table. Insert Data into a SQLite Table. Select Data from a SQLite Table. Update Data in a SQLite Table. Delete Data from a SQLite Table. Handle Application Exits. Save Application States. Handle Back and Menu Button Presses. Handle Application Deactivation. 11 WORKING WITH FILES. Reference Files and Directories. Write Files. Read Files. Update Files. Append Files. Handle Files Synchronously. Copy Files. Load SWF files. 12 USING THE LOCATION AND WIFI FEATURES. Retrieve Your Current Location. Map Your Location with Yahoo! Map Your Location with Google. Determine Your Speed. Check for an Internet Connection. Set the System Idle Mode. Display Web Pages. 13 USING SPECIAL URL PROTOCOLS. Make Phone Calls. Open the Mail Application. Open the Maps Application. Open the Messaging Application. Play a YouTube Video. 14 INTEGRATING WITH THIRD-PARTY SERVICES. Submit Updates to Twitter. Display Ads with Smaato. Track with Google Analytics. Display Ads with AdMob. 15 OPTIMIZING PERFORMANCE. Optimize Your Display List. Manage Mouse Events. Understanding cacheAsBitmap. Understanding cacheAsBitmapMatrix. 16 DEBUGGING YOUR APPLICATION. Show Your Trace Statements. Create Breakpoints. Using the Flash CS5 Debugger. Understanding the Debug Console. Understanding the Variables Panel. Debug with the Android Eclipse Plug-in. 17 DEPLOYING YOUR APPLICATION. Take Screenshots of Your Application on Your Device. Create an Application Icon. Publish Your Application for the Android Market. Upload Your Application to the Android Market. APPENDIX A ACTIONSCRIPT CLASS REFERENCE. INDEX.

Read more less

Book SynopsisThe field of data mining lies at the confluence of predictive analytics, statistical analysis, and business intelligence. Due to the ever-increasing complexity and size of data sets and the wide range of applications in computer science, business, and health care, the process of discovering knowledge in data is more relevant than ever before. This book provides the tools needed to thrive in today's big data world. The author demonstrates how to leverage a company's existing databases to increase profits and market share, and carefully explains the most current data science methods and techniques. The reader will learn data mining by doing data mining. By adding chapters on data modelling preparation, imputation of missing data, and multivariate statistical analysis, Discovering Knowledge in Data, Second Edition remains the eminent reference on data mining. The second edition of a highly praised, successful reference on data mining, with thorougTable of ContentsPreface xi Chapter 1 An Introduction to Data Mining 1 1.1 What is Data Mining? 1 1.2 Wanted: Data Miners 2 1.3 The Need for Human Direction of Data Mining 3 1.4 The Cross-Industry Standard Practice for Data Mining 4 1.4.1 Crisp-DM: The Six Phases 5 1.5 Fallacies of Data Mining 6 1.6 What Tasks Can Data Mining Accomplish? 8 1.6.1 Description 8 1.6.2 Estimation 8 1.6.3 Prediction 10 1.6.4 Classification 10 1.6.5 Clustering 12 1.6.6 Association 14 References 14 Exercises 15 Chapter 2 Data Preprocessing 16 2.1 Why do We Need to Preprocess the Data? 17 2.2 Data Cleaning 17 2.3 Handling Missing Data 19 2.4 Identifying Misclassifications 22 2.5 Graphical Methods for Identifying Outliers 22 2.6 Measures of Center and Spread 23 2.7 Data Transformation 26 2.8 Min-Max Normalization 26 2.9 Z-Score Standardization 27 2.10 Decimal Scaling 28 2.11 Transformations to Achieve Normality 28 2.12 Numerical Methods for Identifying Outliers 35 2.13 Flag Variables 36 2.14 Transforming Categorical Variables into Numerical Variables 37 2.15 Binning Numerical Variables 38 2.16 Reclassifying Categorical Variables 39 2.17 Adding an Index Field 39 2.18 Removing Variables that are Not Useful 39 2.19 Variables that Should Probably Not Be Removed 40 2.20 Removal of Duplicate Records 41 2.21 A Word About ID Fields 41 The R Zone 42 References 48 Exercises 48 Hands-On Analysis 50 Chapter 3 Exploratory Data Analysis 51 3.1 Hypothesis Testing Versus Exploratory Data Analysis 51 3.2 Getting to Know the Data Set 52 3.3 Exploring Categorical Variables 55 3.4 Exploring Numeric Variables 62 3.5 Exploring Multivariate Relationships 69 3.6 Selecting Interesting Subsets of the Data for Further Investigation 71 3.7 Using EDA to Uncover Anomalous Fields 71 3.8 Binning Based on Predictive Value 72 3.9 Deriving New Variables: Flag Variables 74 3.10 Deriving New Variables: Numerical Variables 77 3.11 Using EDA to Investigate Correlated Predictor Variables 77 3.12 Summary 80 The R Zone 82 Reference 88 Exercises 88 Hands-On Analysis 89 Chapter 4 Univariate Statistical Analysis 91 4.1 Data Mining Tasks in Discovering Knowledge in Data 91 4.2 Statistical Approaches to Estimation and Prediction 92 4.3 Statistical Inference 93 4.4 How Confident are We in Our Estimates? 94 4.5 Confidence Interval Estimation of the Mean 95 4.6 How to Reduce the Margin of Error 97 4.7 Confidence Interval Estimation of the Proportion 98 4.8 Hypothesis Testing for the Mean 99 4.9 Assessing the Strength of Evidence Against the Null Hypothesis 101 4.10 Using Confidence Intervals to Perform Hypothesis Tests 102 4.11 Hypothesis Testing for the Proportion 104 The R Zone 105 Reference 106 Exercises 106 Chapter 5 Multivariate Statistics 109 5.1 Two-Sample t-Test for Difference in Means 110 5.2 Two-Sample Z-Test for Difference in Proportions 111 5.3 Test for Homogeneity of Proportions 112 5.4 Chi-Square Test for Goodness of Fit of Multinomial Data 114 5.5 Analysis of Variance 115 5.6 Regression Analysis 118 5.7 Hypothesis Testing in Regression 122 5.8 Measuring the Quality of a Regression Model 123 5.9 Dangers of Extrapolation 123 5.10 Confidence Intervals for the Mean Value of y Given x 125 5.11 Prediction Intervals for a Randomly Chosen Value of y Given x 125 5.12 Multiple Regression 126 5.13 Verifying Model Assumptions 127 The R Zone 131 Reference 135 Exercises 135 Hands-On Analysis 136 Chapter 6 Preparing to Model the Data 138 6.1 Supervised Versus Unsupervised Methods 138 6.2 Statistical Methodology and Data Mining Methodology 139 6.3 Cross-Validation 139 6.4 Overfitting 141 6.5 BIAS–Variance Trade-Off 142 6.6 Balancing the Training Data Set 144 6.7 Establishing Baseline Performance 145 The R Zone 146 Reference 147 Exercises 147 Chapter 7 K-Nearest Neighbor Algorithm 149 7.1 Classification Task 149 7.2 k-Nearest Neighbor Algorithm 150 7.3 Distance Function 153 7.4 Combination Function 156 7.4.1 Simple Unweighted Voting 156 7.4.2 Weighted Voting 156 7.5 Quantifying Attribute Relevance: Stretching the Axes 158 7.6 Database Considerations 158 7.7 k-Nearest Neighbor Algorithm for Estimation and Prediction 159 7.8 Choosing k 160 7.9 Application of k-Nearest Neighbor Algorithm Using IBM/SPSS Modeler 160 The R Zone 162 Exercises 163 Hands-On Analysis 164 Chapter 8 Decision Trees 165 8.1 What is a Decision Tree? 165 8.2 Requirements for Using Decision Trees 167 8.3 Classification and Regression Trees 168 8.4 C4.5 Algorithm 174 8.5 Decision Rules 179 8.6 Comparison of the C5.0 and Cart Algorithms Applied to Real Data 180 The R Zone 183 References 184 Exercises 185 Hands-On Analysis 185 Chapter 9 Neural Networks 187 9.1 Input and Output Encoding 188 9.2 Neural Networks for Estimation and Prediction 190 9.3 Simple Example of a Neural Network 191 9.4 Sigmoid Activation Function 193 9.5 Back-Propagation 194 9.5.1 Gradient Descent Method 194 9.5.2 Back-Propagation Rules 195 9.5.3 Example of Back-Propagation 196 9.6 Termination Criteria 198 9.7 Learning Rate 198 9.8 Momentum Term 199 9.9 Sensitivity Analysis 201 9.10 Application of Neural Network Modeling 202 The R Zone 204 References 207 Exercises 207 Hands-On Analysis 207 Chapter 10 Hierarchical and K-Means Clustering 209 10.1 The Clustering Task 209 10.2 Hierarchical Clustering Methods 212 10.3 Single-Linkage Clustering 213 10.4 Complete-Linkage Clustering 214 10.5 k-Means Clustering 215 10.6 Example of k-Means Clustering at Work 216 10.7 Behavior of MSB, MSE, and PSEUDO-F as the k-Means Algorithm Proceeds 219 10.8 Application of k-Means Clustering Using SAS Enterprise Miner 220 10.9 Using Cluster Membership to Predict Churn 223 The R Zone 224 References 226 Exercises 226 Hands-On Analysis 226 Chapter 11 Kohonen Networks 228 11.1 Self-Organizing Maps 228 11.2 Kohonen Networks 230 11.2.1 Kohonen Networks Algorithm 231 11.3 Example of a Kohonen Network Study 231 11.4 Cluster Validity 235 11.5 Application of Clustering Using Kohonen Networks 235 11.6 Interpreting the Clusters 237 11.6.1 Cluster Profiles 240 11.7 Using Cluster Membership as Input to Downstream Data Mining Models 242 The R Zone 243 References 245 Exercises 245 Hands-On Analysis 245 Chapter 12 Association Rules 247 12.1 Affinity Analysis and Market Basket Analysis 247 12.1.1 Data Representation for Market Basket Analysis 248 12.2 Support, Confidence, Frequent Itemsets, and the a Priori Property 249 12.3 How Does the a Priori Algorithm Work? 251 12.3.1 Generating Frequent Itemsets 251 12.3.2 Generating Association Rules 253 12.4 Extension from Flag Data to General Categorical Data 255 12.5 Information-Theoretic Approach: Generalized Rule Induction Method 256 12.5.1 J-Measure 257 12.6 Association Rules are Easy to do Badly 258 12.7 How Can We Measure the Usefulness of Association Rules? 259 12.8 Do Association Rules Represent Supervised or Unsupervised Learning? 260 12.9 Local Patterns Versus Global Models 261 The R Zone 262 References 263 Exercises 263 Hands-On Analysis 264 Chapter 13 Imputation of Missing Data 266 13.1 Need for Imputation of Missing Data 266 13.2 Imputation of Missing Data: Continuous Variables 267 13.3 Standard Error of the Imputation 270 13.4 Imputation of Missing Data: Categorical Variables 271 13.5 Handling Patterns in Missingness 272 The R Zone 273 Reference 276 Exercises 276 Hands-On Analysis 276 Chapter 14 Model Evaluation Techniques 277 14.1 Model Evaluation Techniques for the Description Task 278 14.2 Model Evaluation Techniques for the Estimation and Prediction Tasks 278 14.3 Model Evaluation Techniques for the Classification Task 280 14.4 Error Rate, False Positives, and False Negatives 280 14.5 Sensitivity and Specificity 283 14.6 Misclassification Cost Adjustment to Reflect Real-World Concerns 284 14.7 Decision Cost/Benefit Analysis 285 14.8 Lift Charts and Gains Charts 286 14.9 Interweaving Model Evaluation with Model Building 289 14.10 Confluence of Results: Applying a Suite of Models 290 The R Zone 291 Reference 291 Exercises 291 Hands-On Analysis 291 Appendix: Data Summarization and Visualization 294 Index 309

Read more less

Book SynopsisThe energy consumption issue in distributed computing systems raises various monetary, environmental and system performance concerns.Electricity consumption in the US doubled from 2000 to 2005. From a financial and environmental standpoint, reducing the consumption of electricity is important, yet these reforms must not lead to performance degradation of the computing systems. These contradicting constraints create a suite of complex problems that need to be resolved in order to lead to ''greener'' distributed computing systems. This book brings together a group of outstanding researchers that investigate the different facets of green and energy efficient distributed computing. Key features: One of the first books of its kind Features latest research findings on emerging topics by well-known scientists Valuable research for grad students, postdocs, and researchers Research will greatly feed into other technologies and applicatioTable of ContentsPREFACE xxix ACKNOWLEDGMENTS xxxi CONTRIBUTORS xxxiii 1 POWER ALLOCATION AND TASK SCHEDULING ON MULTIPROCESSOR COMPUTERS WITH ENERGY AND TIME CONSTRAINTS 1 Keqin Li 1.1 Introduction 1 1.1.1 Energy Consumption 1 1.1.2 Power Reduction 2 1.1.3 Dynamic Power Management 3 1.1.4 Task Scheduling with Energy and Time Constraints 4 1.1.5 Chapter Outline 5 1.2 Preliminaries 5 1.2.1 Power Consumption Model 5 1.2.2 Problem Definitions 6 1.2.3 Task Models 7 1.2.4 Processor Models 8 1.2.5 Scheduling Models 9 1.2.6 Problem Decomposition 9 1.2.7 Types of Algorithms 10 1.3 Problem Analysis 10 1.3.1 Schedule Length Minimization 10 1.3.1.1 Uniprocessor computers 10 1.3.1.2 Multiprocessor computers 11 1.3.2 Energy Consumption Minimization 12 1.3.2.1 Uniprocessor computers 12 1.3.2.2 Multiprocessor computers 13 1.3.3 Strong NP-Hardness 14 1.3.4 Lower Bounds 14 1.3.5 Energy-Delay Trade-off 15 1.4 Pre-Power-Determination Algorithms 16 1.4.1 Overview 16 1.4.2 Performance Measures 17 1.4.3 Equal-Time Algorithms and Analysis 18 1.4.3.1 Schedule length minimization 18 1.4.3.2 Energy consumption minimization 19 1.4.4 Equal-Energy Algorithms and Analysis 19 1.4.4.1 Schedule length minimization 19 1.4.4.2 Energy consumption minimization 21 1.4.5 Equal-Speed Algorithms and Analysis 22 1.4.5.1 Schedule length minimization 22 1.4.5.2 Energy consumption minimization 23 1.4.6 Numerical Data 24 1.4.7 Simulation Results 25 1.5 Post-Power-Determination Algorithms 28 1.5.1 Overview 28 1.5.2 Analysis of List Scheduling Algorithms 29 1.5.2.1 Analysis of algorithm LS 29 1.5.2.2 Analysis of algorithm LRF 30 1.5.3 Application to Schedule Length Minimization 30 1.5.4 Application to Energy Consumption Minimization 31 1.5.5 Numerical Data 32 1.5.6 Simulation Results 32 1.6 Summary and Further Research 33 References 34 2 POWER-AWARE HIGH PERFORMANCE COMPUTING 39 Rong Ge and Kirk W. Cameron 2.1 Introduction 39 2.2 Background 41 2.2.1 Current Hardware Technology and Power Consumption 41 2.2.1.1 Processor power 41 2.2.1.2 Memory subsystem power 42 2.2.2 Performance 43 2.2.3 Energy Efficiency 44 2.3 Related Work 45 2.3.1 Power Profiling 45 2.3.1.1 Simulator-based power estimation 45 2.3.1.2 Direct measurements 46 2.3.1.3 Event-based estimation 46 2.3.2 Performance Scalability on Power-Aware Systems 46 2.3.3 Adaptive Power Allocation for Energy-Efficient Computing 47 2.4 PowerPack: Fine-Grain Energy Profiling of HPC Applications 48 2.4.1 Design and Implementation of PowerPack 48 2.4.1.1 Overview 48 2.4.1.2 Fine-grain systematic power measurement 50 2.4.1.3 Automatic power profiling and code synchronization 51 2.4.2 Power Profiles of HPC Applications and Systems 53 2.4.2.1 Power distribution over components 53 2.4.2.2 Power dynamics of applications 54 2.4.2.3 Power bounds on HPC systems 55 2.4.2.4 Power versus dynamic voltage and frequency scaling 57 2.5 Power-Aware Speedup Model 59 2.5.1 Power-Aware Speedup 59 2.5.1.1 Sequential execution time for a single workload T1(w, f ) 60 2.5.1.2 Sequential execution time for an ON-chip/OFF-chip workload 60 2.5.1.3 Parallel execution time on N processors for an ON-/OFF-chip workload with DOP = i 61 2.5.1.4 Power-aware speedup for DOP and ON-/OFF-chip workloads 62 2.5.2 Model Parametrization and Validation 63 2.5.2.1 Coarse-grain parametrization and validation 64 2.5.2.2 Fine-grain parametrization and validation 66 2.6 Model Usages 69 2.6.1 Identification of Optimal System Configurations 70 2.6.2 PAS-Directed Energy-Driven Runtime Frequency Scaling 71 2.7 Conclusion 73 References 75 3 ENERGY EFFICIENCY IN HPC SYSTEMS 81 Ivan Rodero and Manish Parashar 3.1 Introduction 81 3.2 Background and Related Work 83 3.2.1 CPU Power Management 83 3.2.1.1 OS-level CPU power management 83 3.2.1.2 Workload-level CPU power management 84 3.2.1.3 Cluster-level CPU power management 84 3.2.2 Component-Based Power Management 85 3.2.2.1 Memory subsystem 85 3.2.2.2 Storage subsystem 86 3.2.3 Thermal-Conscious Power Management 87 3.2.4 Power Management in Virtualized Datacenters 87 3.3 Proactive, Component-Based Power Management 88 3.3.1 Job Allocation Policies 88 3.3.2 Workload Profiling 90 3.4 Quantifying Energy Saving Possibilities 91 3.4.1 Methodology 92 3.4.2 Component-Level Power Requirements 92 3.4.3 Energy Savings 94 3.5 Evaluation of the Proposed Strategies 95 3.5.1 Methodology 96 3.5.2 Workloads 96 3.5.3 Metrics 97 3.6 Results 97 3.7 Concluding Remarks 102 3.8 Summary 103 References 104 4 A STOCHASTIC FRAMEWORK FOR HIERARCHICAL SYSTEM-LEVEL POWER MANAGEMENT 109 Peng Rong and Massoud Pedram 4.1 Introduction 109 4.2 Related Work 111 4.3 A Hierarchical DPM Architecture 113 4.4 Modeling 114 4.4.1 Model of the Application Pool 114 4.4.2 Model of the Service Flow Control 118 4.4.3 Model of the Simulated Service Provider 119 4.4.4 Modeling Dependencies between SPs 120 4.5 Policy Optimization 122 4.5.1 Mathematical Formulation 122 4.5.2 Optimal Time-Out Policy for Local Power Manager 123 4.6 Experimental Results 125 4.7 Conclusion 130 References 130 5 ENERGY-EFFICIENT RESERVATION INFRASTRUCTURE FOR GRIDS, CLOUDS, AND NETWORKS 133 Anne-Ce´ cile Orgerie and Laurent Lefe` vre 5.1 Introduction 133 5.2 Related Works 134 5.2.1 Server and Data Center Power Management 135 5.2.2 Node Optimizations 135 5.2.3 Virtualization to Improve Energy Efficiency 136 5.2.4 Energy Awareness in Wired Networking Equipment 136 5.2.5 Synthesis 137 5.3 ERIDIS: Energy-Efficient Reservation Infrastructure for Large-Scale Distributed Systems 138 5.3.1 ERIDIS Architecture 138 5.3.2 Management of the Resource Reservations 141 5.3.3 Resource Management and On/Off Algorithms 145 5.3.4 Energy-Consumption Estimates 146 5.3.5 Prediction Algorithms 146 5.4 EARI: Energy-Aware Reservation Infrastructure for Data Centers and Grids 147 5.4.1 EARI’s Architecture 147 5.4.2 Validation of EARI on Experimental Grid Traces 147 5.5 GOC: Green Open Cloud 149 5.5.1 GOC’s Resource Manager Architecture 150 5.5.2 Validation of the GOC Framework 152 5.6 HERMES: High Level Energy-Aware Model for Bandwidth Reservation in End-To-End Networks 152 5.6.1 HERMES’ Architecture 154 5.6.2 The Reservation Process of HERMES 155 5.6.3 Discussion 157 5.7 Summary 158 References 158 6 ENERGY-EFFICIENT JOB PLACEMENT ON CLUSTERS, GRIDS, AND CLOUDS 163 Damien Borgetto, Henri Casanova, Georges Da Costa, and Jean-Marc Pierson 6.1 Problem and Motivation 163 6.1.1 Context 163 6.1.2 Chapter Roadmap 164 6.2 Energy-Aware Infrastructures 164 6.2.1 Buildings 165 6.2.2 Context-Aware Buildings 165 6.2.3 Cooling 166 6.3 Current Resource Management Practices 167 6.3.1 Widely Used Resource Management Systems 167 6.3.2 Job Requirement Description 169 6.4 Scientific and Technical Challenges 170 6.4.1 Theoretical Difficulties 170 6.4.2 Technical Difficulties 170 6.4.3 Controlling and Tuning Jobs 171 6.5 Energy-Aware Job Placement Algorithms 172 6.5.1 State of the Art 172 6.5.2 Detailing One Approach 174 6.6 Discussion 180 6.6.1 Open Issues and Opportunities 180 6.6.2 Obstacles for Adoption in Production 182 6.7 Conclusion 183 References 184 7 COMPARISON AND ANALYSIS OF GREEDY ENERGY-EFFICIENT SCHEDULING ALGORITHMS FOR COMPUTATIONAL GRIDS 189 Peder Lindberg, James Leingang, Daniel Lysaker, Kashif Bilal, Samee Ullah Khan, Pascal Bouvry, Nasir Ghani, Nasro Min-Allah, and Juan Li 7.1 Introduction 189 7.2 Problem Formulation 191 7.2.1 The System Model 191 7.2.1.1 PEs 191 7.2.1.2 DVS 191 7.2.1.3 Tasks 192 7.2.1.4 Preliminaries 192 7.2.2 Formulating the Energy-Makespan Minimization Problem 192 7.3 Proposed Algorithms 193 7.3.1 Greedy Heuristics 194 7.3.1.1 Greedy heuristic scheduling algorithm 196 7.3.1.2 Greedy-min 197 7.3.1.3 Greedy-deadline 198 7.3.1.4 Greedy-max 198 7.3.1.5 MaxMin 199 7.3.1.6 ObFun 199 7.3.1.7 MinMin StdDev 202 7.3.1.8 MinMax StdDev 202 7.4 Simulations, Results, and Discussion 203 7.4.1 Workload 203 7.4.2 Comparative Results 204 7.4.2.1 Small-size problems 204 7.4.2.2 Large-size problems 206 7.5 Related Works 211 7.6 Conclusion 211 References 212 8 TOWARD ENERGY-AWARE SCHEDULING USING MACHINE LEARNING 215 Josep LL. Berral, In˜ igo Goiri, Ramon Nou, Ferran Julia` , Josep O. Fito´ , Jordi Guitart, Ricard Gavalda´ , and Jordi Torres 8.1 Introduction 215 8.1.1 Energetic Impact of the Cloud 216 8.1.2 An Intelligent Way to Manage Data Centers 216 8.1.3 Current Autonomic Computing Techniques 217 8.1.4 Power-Aware Autonomic Computing 217 8.1.5 State of the Art and Case Study 218 8.2 Intelligent Self-Management 218 8.2.1 Classical AI Approaches 219 8.2.1.1 Heuristic algorithms 219 8.2.1.2 AI planning 219 8.2.1.3 Semantic techniques 219 8.2.1.4 Expert systems and genetic algorithms 220 8.2.2 Machine Learning Approaches 220 8.2.2.1 Instance-based learning 221 8.2.2.2 Reinforcement learning 222 8.2.2.3 Feature and example selection 225 8.3 Introducing Power-Aware Approaches 225 8.3.1 Use of Virtualization 226 8.3.2 Turning On and Off Machines 228 8.3.3 Dynamic Voltage and Frequency Scaling 229 8.3.4 Hybrid Nodes and Data Centers 230 8.4 Experiences of Applying ML on Power-Aware Self-Management 230 8.4.1 Case Study Approach 231 8.4.2 Scheduling and Power Trade-Off 231 8.4.3 Experimenting with Power-Aware Techniques 233 8.4.4 Applying Machine Learning 236 8.4.5 Conclusions from the Experiments 238 8.5 Conclusions on Intelligent Power-Aware Self-Management 238 References 240 9 ENERGY EFFICIENCY METRICS FOR DATA CENTERS 245 Javid Taheri and Albert Y. Zomaya 9.1 Introduction 245 9.1.1 Background 245 9.1.2 Data Center Energy Use 246 9.1.3 Data Center Characteristics 246 9.1.3.1 Electric power 247 9.1.3.2 Heat removal 249 9.1.4 Energy Efficiency 250 9.2 Fundamentals of Metrics 250 9.2.1 Demand and Constraints on Data Center Operators 250 9.2.2 Metrics 251 9.2.2.1 Criteria for good metrics 251 9.2.2.2 Methodology 252 9.2.2.3 Stability of metrics 252 9.3 Data Center Energy Efficiency 252 9.3.1 Holistic IT Efficiency Metrics 252 9.3.1.1 Fixed versus proportional overheads 254 9.3.1.2 Power versus energy 254 9.3.1.3 Performance versus productivity 255 9.3.2 Code of Conduct 256 9.3.2.1 Environmental statement 256 9.3.2.2 Problem statement 256 9.3.2.3 Scope of the CoC 257 9.3.2.4 Aims and objectives of CoC 258 9.3.3 Power Use in Data Centers 259 9.3.3.1 Data center IT power to utility power relationship 259 9.3.3.2 Chiller efficiency and external temperature 260 9.4 Available Metrics 260 9.4.1 The Green Grid 261 9.4.1.1 Power usage effectiveness (PUE) 261 9.4.1.2 Data center efficiency (DCE) 262 9.4.1.3 Data center infrastructure efficiency (DCiE) 262 9.4.1.4 Data center productivity (DCP) 263 9.4.2 McKinsey 263 9.4.3 Uptime Institute 264 9.4.3.1 Site infrastructure power overhead multiplier (SI-POM) 265 9.4.3.2 IT hardware power overhead multiplier (H-POM) 266 9.4.3.3 DC hardware compute load per unit of computing work done 266 9.4.3.4 Deployed hardware utilization ratio (DH-UR) 266 9.4.3.5 Deployed hardware utilization efficiency (DH-UE) 267 9.5 Harmonizing Global Metrics for Data Center Energy Efficiency 267 References 268 10 AUTONOMIC GREEN COMPUTING IN LARGE-SCALE DATA CENTERS 271 Haoting Luo, Bithika Khargharia, Salim Hariri, and Youssif Al-Nashif 10.1 Introduction 271 10.2 Related Technologies and Techniques 272 10.2.1 Power Optimization Techniques in Data Centers 272 10.2.2 Design Model 273 10.2.3 Networks 274 10.2.4 Data Center Power Distribution 275 10.2.5 Data Center Power-Efficient Metrics 276 10.2.6 Modeling Prototype and Testbed 277 10.2.7 Green Computing 278 10.2.8 Energy Proportional Computing 280 10.2.9 Hardware Virtualization Technology 281 10.2.10 Autonomic Computing 282 10.3 Autonomic Green Computing: A Case Study 283 10.3.1 Autonomic Management Platform 285 10.3.1.1 Platform architecture 285 10.3.1.2 DEVS-based modeling and simulation platform 285 10.3.1.3 Workload generator 287 10.3.2 Model Parameter Evaluation 288 10.3.2.1 State transitioning overhead 288 10.3.2.2 VM template evaluation 289 10.3.2.3 Scalability analysis 291 10.3.3 Autonomic Power Efficiency Management Algorithm (Performance Per Watt) 291 10.3.4 Simulation Results and Evaluation 293 10.3.4.1 Analysis of energy and performance trade-offs 296 10.4 Conclusion and Future Directions 297 References 298 11 ENERGY AND THERMAL AWARE SCHEDULING IN DATA CENTERS 301 Gaurav Dhiman, Raid Ayoub, and Tajana S. Rosing 11.1 Introduction 301 11.2 Related Work 302 11.3 Intermachine Scheduling 305 11.3.1 Performance and Power Profile of VMs 305 11.3.2 Architecture 309 11.3.2.1 vgnode 309 11.3.2.2 vgxen 310 11.3.2.3 vgdom 312 11.3.2.4 vgserv 312 11.4 Intramachine Scheduling 315 11.4.1 Air-Forced Thermal Modeling and Cost 316 11.4.2 Cooling Aware Dynamic Workload Scheduling 317 11.4.3 Scheduling Mechanism 318 11.4.4 Cooling Costs Predictor 319 11.5 Evaluation 321 11.5.1 Intermachine Scheduler (vGreen) 321 11.5.2 Heterogeneous Workloads 323 11.5.2.1 Comparison with DVFS policies 325 11.5.2.2 Homogeneous workloads 328 11.5.3 Intramachine Scheduler (Cool and Save) 328 11.5.3.1 Results 331 11.5.3.2 Overhead of CAS 333 11.6 Conclusion 333 References 334 12 QOS-AWARE POWER MANAGEMENT IN DATA CENTERS 339 Jiayu Gong and Cheng-Zhong Xu 12.1 Introduction 339 12.2 Problem Classification 340 12.2.1 Objective and Constraint 340 12.2.2 Scope and Time Granularities 340 12.2.3 Methodology 341 12.2.4 Power Management Mechanism 342 12.3 Energy Efficiency 344 12.3.1 Energy-Efficiency Metrics 344 12.3.2 Improving Energy Efficiency 346 12.3.2.1 Energy minimization with performance guarantee 346 12.3.2.2 Performance maximization under power budget 348 12.3.2.3 Trade-off between power and performance 348 12.3.3 Energy-Proportional Computing 350 12.4 Power Capping 351 12.5 Conclusion 353 References 356 13 ENERGY-EFFICIENT STORAGE SYSTEMS FOR DATA CENTERS 361 Sudhanva Gurumurthi and Anand Sivasubramaniam 13.1 Introduction 361 13.2 Disk Drive Operation and Disk Power 362 13.2.1 An Overview of Disk Drives 362 13.2.2 Sources of Disk Power Consumption 363 13.2.3 Disk Activity and Power Consumption 365 13.3 Disk and Storage Power Reduction Techniques 366 13.3.1 Exploiting the STANDBY State 368 13.3.2 Reducing Seek Activity 369 13.3.3 Achieving Energy Proportionality 369 13.3.3.1 Hardware approaches 369 13.3.3.2 Software approaches 370 13.4 Using Nonvolatile Memory and Solid-State Disks 371 13.5 Conclusions 372 References 373 14 AUTONOMIC ENERGY/PERFORMANCE OPTIMIZATIONS FOR MEMORY IN SERVERS 377 Bithika Khargharia and Mazin Yousif 14.1 Introduction 378 14.2 Classifications of Dynamic Power Management Techniques 380 14.2.1 Heuristic and Predictive Techniques 380 14.2.2 QoS and Energy Trade-Offs 381 14.3 Applications of Dynamic Power Management (DPM) 382 14.3.1 Power Management of System Components in Isolation 382 14.3.2 Joint Power Management of System Components 383 14.3.3 Holistic System-Level Power Management 383 14.4 Autonomic Power and Performance Optimization of Memory Subsystems in Server Platforms 384 14.4.1 Adaptive Memory Interleaving Technique for Power and Performance Management 384 14.4.1.1 Formulating the optimization problem 386 14.4.1.2 Memory appflow 389 14.4.2 Industry Techniques 389 14.4.2.1 Enhancements in memory hardware design 390 14.4.2.2 Adding more operating states 390 14.4.2.3 Faster transition to and from low power states 390 14.4.2.4 Memory consolidation 390 14.5 Conclusion 391 References 391 15 ROD: A PRACTICAL APPROACH TO IMPROVING RELIABILITY OF ENERGY-EFFICIENT PARALLEL DISK SYSTEMS 395 Shu Yin, Xiaojun Ruan, Adam Manzanares, and Xiao Qin 15.1 Introduction 395 15.2 Modeling Reliability of Energy-Efficient Parallel Disks 396 15.2.1 The MINT Model 396 15.2.1.1 Disk utilization 398 15.2.1.2 Temperature 398 15.2.1.3 Power-state transition frequency 399 15.2.1.4 Single disk reliability model 399 15.2.2 MAID, Massive Arrays of Idle Disks 400 15.3 Improving Reliability of MAID via Disk Swapping 401 15.3.1 Improving Reliability of Cache Disks in MAID 401 15.3.2 Swapping Disks Multiple Times 404 15.4 Experimental Results and Evaluation 405 15.4.1 Experimental Setup 405 15.4.2 Disk Utilization 406 15.4.3 The Single Disk Swapping Strategy 406 15.4.4 The Multiple Disk Swapping Strategy 409 15.5 Related Work 411 15.6 Conclusions 412 References 413 16 EMBRACING THE MEMORY AND I/O WALLS FOR ENERGY-EFFICIENT SCIENTIFIC COMPUTING 417 Chung-Hsing Hsu and Wu-Chun Feng 16.1 Introduction 417 16.2 Background and Related Work 420 16.2.1 DVFS-Enabled Processors 420 16.2.2 DVFS Scheduling Algorithms 421 16.2.3 Memory-Aware, Interval-Based Algorithms 422 16.3 β-Adaptation: A New DVFS Algorithm 423 16.3.1 The Compute-Boundedness Metric, β 423 16.3.2 The Frequency Calculating Formula, f ∗ 424 16.3.3 The Online β Estimation 425 16.3.4 Putting It All Together 427 16.4 Algorithm Effectiveness 429 16.4.1 A Comparison to Other DVFS Algorithms 429 16.4.2 Frequency Emulation 432 16.4.3 The Minimum Dependence to the PMU 436 16.5 Conclusions and Future Work 438 References 439 17 MULTIPLE FREQUENCY SELECTION IN DVFS-ENABLED PROCESSORS TO MINIMIZE ENERGY CONSUMPTION 443 Nikzad Babaii Rizvandi, Albert Y. Zomaya, Young Choon Lee, Ali Javadzadeh Boloori, and Javid Taheri 17.1 Introduction 443 17.2 Energy Efficiency in HPC Systems 444 17.3 Exploitation of Dynamic Voltage–Frequency Scaling 446 17.3.1 Independent Slack Reclamation 446 17.3.2 Integrated Schedule Generation 447 17.4 Preliminaries 448 17.4.1 System and Application Models 448 17.4.2 Energy Model 448 17.5 Energy-Aware Scheduling via DVFS 450 17.5.1 Optimum Continuous Frequency 450 17.5.2 Reference Dynamic Voltage–Frequency Scaling (RDVFS) 451 17.5.3 Maximum-Minimum-Frequency for Dynamic Voltage–Frequency Scaling (MMF-DVFS) 452 17.5.4 Multiple Frequency Selection for Dynamic Voltage–Frequency Scaling (MFS-DVFS) 453 17.5.4.1 Task eligibility 454 17.6 Experimental Results 456 17.6.1 Simulation Settings 456 17.6.2 Results 458 17.7 Conclusion 461 References 461 18 THE PARAMOUNTCY OF RECONFIGURABLE COMPUTING 465 Reiner Hartenstein 18.1 Introduction 465 18.2 Why Computers are Important 466 18.2.1 Computing for a Sustainable Environment 470 18.3 Performance Progress Stalled 472 18.3.1 Unaffordable Energy Consumption of Computing 473 18.3.2 Crashing into the Programming Wall 475 18.4 The Tail is Wagging the Dog (Accelerators) 488 18.4.1 Hardwired Accelerators 489 18.4.2 Programmable Accelerators 490 18.5 Reconfigurable Computing 494 18.5.1 Speedup Factors by FPGAs 498 18.5.2 The Reconfigurable Computing Paradox 501 18.5.3 Saving Energy by Reconfigurable Computing 505 18.5.3.1 Traditional green computing 506 18.5.3.2 The role of graphics processors 507 18.5.3.3 Wintel versus ARM 508 18.5.4 Reconfigurable Computing is the Silver Bullet 511 18.5.4.1 A new world model of computing 511 18.5.5 The Twin-Paradigm Approach to Tear Down the Wall 514 18.5.6 A Mass Movement Needed as Soon as Possible 517 18.5.6.1 Legacy software from the mainframe age 518 18.5.7 How to Reinvent Computing 519 18.6 Conclusions 526 References 529 19 WORKLOAD CLUSTERING FOR INCREASING ENERGY SAVINGS ON EMBEDDED MPSOCS 549 Ozcan Ozturk, Mahmut Kandemir, and Sri Hari Krishna Narayanan 19.1 Introduction 549 19.2 Embedded MPSoC Architecture, Execution Model, and Related Work 550 19.3 Our Approach 551 19.3.1 Overview 551 19.3.2 Technical Details and Problem Formulation 553 19.3.2.1 System and job model 553 19.3.2.2 Mathematical programing model 554 19.3.2.3 Example 557 19.4 Experimental Evaluation 560 19.5 Conclusions 564 References 565 20 ENERGY-EFFICIENT INTERNET INFRASTRUCTURE 567 Weirong Jiang and Viktor K. Prasanna 20.1 Introduction 567 20.1.1 Performance Challenges 568 20.1.2 Existing Packet Forwarding Approaches 570 20.1.2.1 Software approaches 570 20.1.2.2 Hardware approaches 571 20.2 SRAM-Based Pipelined IP Lookup Architectures: Alternative to TCAMs 571 20.3 Data Structure Optimization for Power Efficiency 573 20.3.1 Problem Formulation 574 20.3.1.1 Non-pipelined and pipelined engines 574 20.3.1.2 Power function of SRAM 575 20.3.2 Special Case: Uniform Stride 576 20.3.3 Dynamic Programming 576 20.3.4 Performance Evaluation 577 20.3.4.1 Results for non-pipelined architecture 578 20.3.4.2 Results for pipelined architecture 578 20.4 Architectural Optimization to Reduce Dynamic Power Dissipation 580 20.4.1 Analysis and Motivation 581 20.4.1.1 Traffic locality 582 20.4.1.2 Traffic rate variation 582 20.4.1.3 Access frequency on different stages 583 20.4.2 Architecture-Specific Techniques 583 20.4.2.1 Inherent caching 584 20.4.2.2 Local clocking 584 20.4.2.3 Fine-grained memory enabling 585 20.4.3 Performance Evaluation 585 20.5 Related Work 588 20.6 Summary 589 References 589 21 DEMAND RESPONSE IN THE SMART GRID: A DISTRIBUTED COMPUTING PERSPECTIVE 593 Chen Wang and Martin De Groot 21.1 Introduction 593 21.2 Demand Response 595 21.2.1 Existing Demand Response Programs 595 21.2.2 Demand Response Supported by the Smart Grid 597 21.3 Demand Response as a Distributed System 600 21.3.1 An Overlay Network for Demand Response 600 21.3.2 Event Driven Demand Response 602 21.3.3 Cost Driven Demand Response 604 21.3.4 A Decentralized Demand Response Framework 609 21.3.5 Accountability of Coordination Decision Making 610 21.4 Summary 611 References 611 22 RESOURCE MANAGEMENT FOR DISTRIBUTED MOBILE COMPUTING 615 Jong-Kook Kim 22.1 Introduction 615 22.2 Single-Hop Energy-Constrained Environment 617 22.2.1 System Model 617 22.2.2 Related Work 620 22.2.3 Heuristic Descriptions 621 22.2.3.1 Mapping event 621 22.2.3.2 Scheduling communications 621 22.2.3.3 Opportunistic load balancing and minimum energy greedy heuristics 622 22.2.3.4 ME-MC heuristic 622 22.2.3.5 ME-ME heuristic 624 22.2.3.6 CRME heuristic 625 22.2.3.7 Originator and random 626 22.2.3.8 Upper bound 626 22.2.4 Simulation Model 628 22.2.5 Results 630 22.2.6 Summary 634 22.3 Multihop Distributed Mobile Computing Environment 635 22.3.1 The Multihop System Model 635 22.3.2 Energy-Aware Routing Protocol 636 22.3.2.1 Overview 636 22.3.2.2 DSDV 637 22.3.2.3 DSDV remaining energy 637 22.3.2.4 DSDV-energy consumption per remaining energy 637 22.3.3 Heuristic Description 638 22.3.3.1 Random 638 22.3.3.2 Estimated minimum total energy (EMTE) 638 22.3.3.3 K-percent-speed (KPS) and K-percent-energy (KPE) 639 22.3.3.4 Energy ratio and distance (ERD) 639 22.3.3.5 ETC and distance (ETCD) 640 22.3.3.6 Minimum execution time (MET) 640 22.3.3.7 Minimum completion time (MCT) and minimum completion time with DVS (MCT-DVS) 640 22.3.3.8 Switching algorithm (SA) 640 22.3.4 Simulation Model 641 22.3.5 Results 643 22.3.5.1 Distributed resource management 643 22.3.5.2 Energy-aware protocol 644 22.3.6 Summary 644 22.4 Future Work 647 References 647 23 AN ENERGY-AWARE FRAMEWORK FOR MOBILE DATA MINING 653 Carmela Comito, Domenico Talia, and Paolo Trunfio 23.1 Introduction 653 23.2 System Architecture 654 23.3 Mobile Device Components 657 23.4 Energy Model 659 23.5 Clustering Scheme 664 23.5.1 Clustering the M2M Architecture 666 23.6 Conclusion 670 References 670 24 ENERGY AWARENESS AND EFFICIENCY IN WIRELESS SENSOR NETWORKS: FROM PHYSICAL DEVICES TO THE COMMUNICATION LINK 673 Fla´ via C. Delicato and Paulo F. Pires 24.1 Introduction 673 24.2 WSN and Power Dissipation Models 676 24.2.1 Network and Node Architecture 676 24.2.2 Sources of Power Dissipation in WSNs 679 24.3 Strategies for Energy Optimization 683 24.3.1 Intranode Level 684 24.3.1.1 Duty cycling 685 24.3.1.2 Adaptive sensing 691 24.3.1.3 Dynamic voltage scale (DVS) 693 24.3.1.4 OS task scheduling 694 24.3.2 Internode Level 695 24.3.2.1 Transmission power control 695 24.3.2.2 Dynamic modulation scaling 696 24.3.2.3 Link layer optimizations 698 24.4 Final Remarks 701 References 702 25 NETWORK-WIDE STRATEGIES FOR ENERGY EFFICIENCY IN WIRELESS SENSOR NETWORKS 709 Fla´ via C. Delicato and Paulo F. Pires 25.1 Introduction 709 25.2 Data Link Layer 711 25.2.1 Topology Control Protocols 712 25.2.2 Energy-Efficient MAC Protocols 714 25.2.2.1 Scheduled MAC protocols in WSNs 716 25.2.2.2 Contention-based MAC protocols 717 25.3 Network Layer 719 25.3.1 Flat and Hierarchical Protocols 722 25.4 Transport Layer 725 25.5 Application Layer 729 25.5.1 Task Scheduling 729 25.5.2 Data Aggregation and Data Fusion in WSNs 733 25.5.2.1 Approaches of data fusion for energy efficiency 735 25.5.2.2 Data aggregation strategies 736 25.6 Final Remarks 740 References 741 26 ENERGY MANAGEMENT IN HETEROGENEOUS WIRELESS HEALTH CARE NETWORKS 751 Nima Nikzad, Priti Aghera, Piero Zappi, and Tajana S. Rosing 26.1 Introduction 751 26.2 System Model 753 26.2.1 Health Monitoring Task Model 753 26.3 Collaborative Distributed Environmental Sensing 755 26.3.1 Node Neighborhood and Localization Rate 757 26.3.2 Energy Ratio and Sensing Rate 758 26.3.3 Duty Cycling and Prediction 759 26.4 Task Assignment in a Body Area Network 760 26.4.1 Optimal Task Assignment 760 26.4.2 Dynamic Task Assignment 762 26.4.2.1 DynAGreen algorithm 763 26.4.2.2 DynAGreenLife algorithm 768 26.5 Results 771 26.5.1 Collaborative Sensing 771 26.5.1.1 Results 772 26.5.2 Dynamic Task Assignment 776 26.5.2.1 Performance in static conditions 777 26.5.2.2 Dynamic adaptability 780 26.6 Conclusion 784 References 785 INDEX 787

Read more less

Book SynopsisThe indispensable introductory reference guide to HTML, XHTML and CSS Even though new technologies enable people to do much more with the Web, in the end HTML, XHTML and CSS are still at the root of any Web site.Trade ReviewThis is the perfect book for beginners in web development and will show you everything you need to know to get started (YoctoCon.com, July 2012)Table of ContentsForeword xix Introduction 1 Part I: Getting to Know (X)HTML and CSS 7 Chapter 1: The Least You Need to Know about HTML, CSS, and the Web 9 Chapter 2: Creating and Viewing a Web Page 31 Chapter 3: Proper Planning Prevents Poor Page Performance 43 Part II: Formatting Web Pages with (X)HTML 61 Chapter 4: Creating (X)HTML Document Structure 63 Chapter 5: Text and Lists 73 Chapter 6: Linking to Online Resources 91 Chapter 7: Finding and Using Images 105 Part III: Taking Precise Control over Web Pages and Styles 119 Chapter 8: Deprecated (X)HTML Markup 121 Chapter 9: Introducing Cascading Style Sheets 129 Chapter 10: Using Cascading Style Sheets 147 Chapter 11: Getting Creative with Colors and Fonts 169 Part IV: Scripting and (X)HTML 189 Chapter 12: Top 20 CSS Properties191 Chapter 13: Scripting Web Pages 211 Chapter 14: Working with Forms 221 Chapter 15: Bring the Best of the Web to Your Web Site 251 Chapter 16: Fun with Client-Side Scripts265 Chapter 17: Content Management Systems 279 Part V: The Future of (X)HTML 291 Chapter 18: Mobile Web Design 293 Chapter 19: Party On with HTML5 305 Chapter 20: CSS3 325 Part VI: The Part of Tens 343 Chapter 21: Ten HTML Do's and Don'ts 345 Chapter 22: Ten Ways to Exterminate Web Bugs 353 Chapter 23: Ten Cool HTML Tools and Technologies 361 Appendix A: Twitter Supporters 373 Index 377

Read more less

Book Synopsis* Authors have both industrial and academic experiences * Case studies are included reflecting author's industrial experiences * Downloadable tutorials are available .Table of ContentsPreface xv Acknowledgments xix About the Author xxi 1 Introduction to Reinforcement and Systemic Machine Learning 1 1.1. Introduction 1 1.2. Supervised, Unsupervised, and Semisupervised Machine Learning 2 1.3. Traditional Learning Methods and History of Machine Learning 4 1.4. What Is Machine Learning? 7 1.5. Machine-Learning Problem 8 1.6. Learning Paradigms 9 1.7. Machine-Learning Techniques and Paradigms 12 1.8. What Is Reinforcement Learning? 14 1.9. Reinforcement Function and Environment Function 16 1.10. Need of Reinforcement Learning 17 1.11. Reinforcement Learning and Machine Intelligence 17 1.12. What Is Systemic Learning? 18 1.13. What Is Systemic Machine Learning? 18 1.14. Challenges in Systemic Machine Learning 19 1.15. Reinforcement Machine Learning and Systemic Machine Learning 19 1.16. Case Study Problem Detection in a Vehicle 20 1.17. Summary 20 2 Fundamentals of Whole-System, Systemic, and Multiperspective Machine Learning 23 2.1. Introduction 23 2.2. What Is Systemic Machine Learning? 27 2.3. Generalized Systemic Machine-Learning Framework 30 2.4. Multiperspective Decision Making and Multiperspective Learning 33 2.5. Dynamic and Interactive Decision Making 43 2.6. The Systemic Learning Framework 47 2.7. System Analysis 52 2.8. Case Study: Need of Systemic Learning in the Hospitality Industry 54 2.9. Summary 55 3 Reinforcement Learning 57 3.1. Introduction 57 3.2. Learning Agents 60 3.3. Returns and Reward Calculations 62 3.4. Reinforcement Learning and Adaptive Control 63 3.5. Dynamic Systems 66 3.6. Reinforcement Learning and Control 68 3.7. Markov Property and Markov Decision Process 68 3.8. Value Functions 69 3.8.1. Action and Value 70 3.9. Learning an Optimal Policy (Model-Based and Model-Free Methods) 70 3.10. Dynamic Programming 71 3.11. Adaptive Dynamic Programming 71 3.12. Example: Reinforcement Learning for Boxing Trainer 75 3.13. Summary 75 4 Systemic Machine Learning and Model 77 4.1. Introduction 77 4.2. A Framework for Systemic Learning 78 4.3. Capturing the Systemic View 86 4.4. Mathematical Representation of System Interactions 89 4.5. Impact Function 91 4.6. Decision-Impact Analysis 91 4.7. Summary 97 5 Inference and Information Integration 99 5.1. Introduction 99 5.2. Inference Mechanisms and Need 101 5.3. Integration of Context and Inference 107 5.4. Statistical Inference and Induction 111 5.5. Pure Likelihood Approach 112 5.6. Bayesian Paradigm and Inference 113 5.7. Time-Based Inference 114 5.8. Inference to Build a System View 114 5.9. Summary 118 6 Adaptive Learning 119 6.1. Introduction 119 6.2. Adaptive Learning and Adaptive Systems 119 6.3. What Is Adaptive Machine Learning? 123 6.4. Adaptation and Learning Method Selection Based on Scenario 124 6.5. Systemic Learning and Adaptive Learning 127 6.6. Competitive Learning and Adaptive Learning 140 6.7. Examples 146 6.8. Summary 149 7 Multiperspective and Whole-System Learning 151 7.1. Introduction 151 7.2. Multiperspective Context Building 152 7.3. Multiperspective Decision Making and Multiperspective Learning 154 7.4. Whole-System Learning and Multiperspective Approaches 164 7.5. Case Study Based on Multiperspective Approach 167 7.6. Limitations to a Multiperspective Approach 174 7.7. Summary 174 8 Incremental Learning and Knowledge Representation 177 8.1. Introduction 177 8.2. Why Incremental Learning? 178 8.3. Learning from What Is Already Learned. . . 180 8.4. Supervised Incremental Learning 191 8.5. Incremental Unsupervised Learning and Incremental Clustering 191 8.6. Semisupervised Incremental Learning 196 8.7. Incremental and Systemic Learning 199 8.8. Incremental Closeness Value and Learning Method 200 8.9. Learning and Decision-Making Model 205 8.10. Incremental Classification Techniques 206 8.11. Case Study: Incremental Document Classification 207 8.12. Summary 208 9 Knowledge Augmentation: A Machine Learning Perspective 209 9.1. Introduction 209 9.2. Brief History and Related Work 211 9.3. Knowledge Augmentation and Knowledge Elicitation 215 9.4. Life Cycle of Knowledge 217 9.5. Incremental Knowledge Representation 222 9.6. Case-Based Learning and Learning with Reference to Knowledge Loss 224 9.7. Knowledge Augmentation: Techniques and Methods 224 9.8. Heuristic Learning 228 9.9. Systemic Machine Learning and Knowledge Augmentation 229 9.10. Knowledge Augmentation in Complex Learning Scenarios 232 9.11. Case Studies 232 9.12. Summary 235 10 Building a Learning System 237 10.1. Introduction 237 10.2. Systemic Learning System 237 10.3. Algorithm Selection 242 10.4. Knowledge Representation 244 10.5. Designing a Learning System 245 10.6. Making System to Behave Intelligently 246 10.7. Example-Based Learning 246 10.8. Holistic Knowledge Framework and Use of Reinforcement Learning 246 10.9. Intelligent Agents—Deployment and Knowledge Acquisition and Reuse 250 10.10. Case-Based Learning: Human Emotion-Detection System 251 10.11. Holistic View in Complex Decision Problem 253 10.12. Knowledge Representation and Data Discovery 255 10.13. Components 258 10.14. Future of Learning Systems and Intelligent Systems 259 10.15. Summary 259 Appendix A: Statistical Learning Methods 261 Appendix B: Markov Processes 271 Index 281

Read more less

Book SynopsisHands-on, practical guide to implementing SSL and TLS protocols for Internet security If you are a network professional who knows C programming, this practical book is for you. Focused on how to implement Secure Socket Layer (SSL) and Transport Layer Security (TLS), this book guides you through all necessary steps, whether or not you have a working knowledge of cryptography. The book covers SSLv2, TLS 1.0, and TLS 1.2, including implementations of the relevant cryptographic protocols, secure hashing, certificate parsing, certificate generation, and more. Coverage includes: Understanding Internet Security Protecting against Eavesdroppers with Symmetric Cryptography Secure Key Exchange over an Insecure Medium with Public Key Cryptography Authenticating Communications Using Digital Signatures Creating a Network of Trust Using X.509 Certificates A Usable, Secure Communications Protocol: Client-Side TLS Adding SerTable of ContentsIntroduction xxvii Chapter 1 Understanding Internet Security 1 What Are Secure Sockets? 2 “Insecure” Communications: Understanding the HTTP Protocol 4 Implementing an HTTP Client 5 Adding Support for HTTP Proxies 12 Reliable Transmission of Binary Data with Base64 Encoding 17 Implementing an HTTP Server 21 Roadmap for the Rest of This Book 27 Chapter 2 Protecting Against Eavesdroppers with Symmetric Cryptography 29 Understanding Block Cipher Cryptography Algorithms 30 Implementing the Data Encryption Standard (DES) Algorithm 31 DES Initial Permutation 34 DES Key Schedule 38 DES Expansion Function 40 DES Decryption 45 Padding and Chaining in Block Cipher Algorithms 46 Using the Triple-DES Encryption Algorithm to Increase Key Length 55 Faster Encryption with the Advanced Encryption Standard (AES) Algorithm 60 AES Key Schedule Computation 60 AES Encryption 67 Other Block Cipher Algorithms 83 Understanding Stream Cipher Algorithms 83 Understanding and Implementing the RC4 Algorithm 84 Chapter 3 Converting a Block Cipher to a Stream Cipher: The OFB and COUNTER Block-Chaining Modes 90 Secure Key Exchange over an Insecure Medium with Public Key Cryptography 91 Understanding the Theory Behind the RSA Algorithm 92 Performing Arbitrary Precision Binary Math to Implement Public-Key Cryptography 93 Implementing Large-Number Addition 93 Implementing Large-Number Subtraction 98 Implementing Large-Number Multiplication 101 Implementing Large-Number Division 106 Comparing Large Numbers 109 Optimizing for Modulo Arithmetic 112 Using Modulus Operations to Efficiently Compute Discrete Logarithms in a Finite Field 113 Encryption and Decryption with RSA 114 Encrypting with RSA 115 Decrypting with RSA 119 Encrypting a Plaintext Message 120 Decrypting an RSA-Encrypted Message 124 Testing RSA Encryption and Decryption 126 Achieving Perfect Forward Secrecy with Diffie-Hellman Key Exchange 130 Getting More Security per Key Bit: Elliptic Curve Cryptography 132 How Elliptic Curve Cryptography Relies on Modular Inversions 135 Using the Euclidean Algorithm to compute Greatest Common Denominators 135 Computing Modular Inversions with the Extended Euclidean Algorithm 137 Adding Negative Number Support to the Huge Number Library 138 Supporting Negative Remainders 147 Making ECC Work with Whole Integers: Elliptic-Curve Cryptography over Fp 150 Reimplementing Diffie-Hellman to Use ECC Primitives 150 Why Elliptic-Curve Cryptography? 154 Chapter 4 Authenticating Communications Using Digital Signatures 157 Using Message Digests to Create Secure Document Surrogates 158 Implementing the MD5 Digest Algorithm 159 Understanding MD 5 160 A Secure Hashing Example 161 Securely Hashing a Single Block of Data 166 MD5 Vulnerabilities 169 Increasing Collision Resistance with the SHA- 1 Digest Algorithm 171 Understanding SHA-1 Block Computation 171 Understanding the SHA-1 Input Processing Function 174 Understanding SHA-1 Finalization 176 Even More Collision Resistance with the SHA- 256 Digest Algorithm 180 Preventing Replay Attacks with the HMAC Keyed-Hash Algorithm 184 Implementing a Secure HMAC Algorithm 186 Completing the HMAC Operation 190 Creating Updateable Hash Functions 190 Defining a Digest Structure 191 Appending the Length to the Last Block 194 Computing the MD5 Hash of an Entire File 196 Where Does All of This Fit into SSL? 200 Understanding Digital Signature Algorithm (DSA) Signatures 201 Implementing Sender-Side DSA Signature Generation 202 Implementing Receiver-Side DSA Signature Verification 205 How to Make DSA Efficient 209 Getting More Security per Bit: Elliptic Curve DSA 210 Rewriting the Elliptic-Curve Math Functions to Support Large Numbers 211 Implementing ECDSA 215 Generating ECC Keypairs 218 Chapter 5 Creating a Network of Trust Using X.509 Certificates 221 Putting It Together: The Secure Channel Protocol 222 Encoding with ASN.1 225 Understanding Signed Certificate Structure 225 Version 226 serialNumber 227 signature 227 issuer 229 validity 232 subject 233 subjectPublicKeyInfo 235 extensions 237 Signed Certificates 238 Summary of X.509 Certificates 241 Transmitting Certificates with ASN.1 Distinguished Encoding Rules (DER) 241 Encoded Values 241 Strings and Dates 242 Bit Strings 243 Sequences and Sets: Grouping and Nesting ASN.1 Values 243 ASN.1 Explicit Tags 244 A Real-World Certificate Example 244 Using OpenSSL to Generate an RSA KeyPair and Certificate 244 Using OpenSSL to Generate a DSA KeyPair and Certificate 251 Developing an ASN.1 Parser 252 Converting a Byte Stream into an ASN.1 Structure 252 The asn1parse Code in Action 259 Turning a Parsed ASN.1 Structure into X.509 Certificate Components 264 Joining the X.509 Components into a Completed X. 509 Certificate Structure 268 Parsing Object Identifiers (OIDs) 270 Parsing Distinguished Names 271 Parsing Certificate Extensions 275 Signature Verification 279 Validating PKCS #7-Formatted RSA Signatures 280 Verifying a Self-Signed Certificate 281 Adding DSA Support to the Certificate Parser 286 Managing Certificates 292 How Authorities Handle Certificate Signing Requests (CSRs) 292 Correlating Public and Private Keys Using PKCS # 12 Formatting 293 Blacklisting Compromised Certificates Using Certificate Revocation Lists (CRLs) 294 Keeping Certificate Blacklists Up-to-Date with the Online Certificate Status Protocol (OCSP) 295 Other Problems with Certificates 296 Chapter 6 A Usable, Secure Communications Protocol: Client-Side TLS 297 Implementing the TLS 1.0 Handshake (Client Perspective) 299 Adding TLS Support to the HTTP Client 300 Understanding the TLS Handshake Procedure 303 TLS Client Hello 304 Tracking the Handshake State in the TLSParameters Structure 304 Describing Cipher Suites 308 Flattening and Sending the Client Hello Structure 309 TLS Server Hello 316 Adding a Receive Loop 317 Sending Alerts 318 Parsing the Server Hello Structure 319 Reporting Server Alerts 323 TLS Certificate 324 TLS Server Hello Done 328 TLS Client Key Exchange 329 Sharing Secrets Using TLS PRF (Pseudo-Random Function) 329 Creating Reproducible, Unpredictable Symmetric Keys with Master Secret Computation 336 RSA Key Exchange 337 Diffie-Hellman Key Exchange 343 TLS Change Cipher Spec 344 TLS Finished 346 Computing the Verify Message 347 Correctly Receiving the Finished Message 352 Secure Data Transfer with TLS 353 Assigning Sequence Numbers 353 Supporting Outgoing Encryption 355 Adding Support for Stream Ciphers 358 Updating Each Invocation of send_message 359 Decrypting and Authenticating 361 TLS Send 364 TLS Receive 365 Implementing TLS Shutdown 368 Examining HTTPS End-to-end Examples (TLS 1.0) 369 Dissecting the Client Hello Request 370 Dissecting the Server Response Messages 372 Dissecting the Key Exchange Message 373 Decrypting the Encrypted Exchange 374 Exchanging Application Data 377 Differences Between SSL 3.0 and TLS 1.0 378 Differences Between TLS 1.0 and TLS 1.1 379 Chapter 7 Adding Server-Side TLS 1.0 Support 381 Implementing the TLS 1.0 Handshake from the Server’s Perspective 381 TLS Client Hello 387 TLS Server Hello 390 TLS Certificate 391 TLS Server Hello Done 393 TLS Client Key Exchange 394 RSA Key Exchange and Private Key Location 395 Supporting Encrypted Private Key Files 399 Checking That Decryption was Successful 406 Completing the Key Exchange 407 TLS Change Cipher Spec 409 TLS Finished 409 Avoiding Common Pitfalls When Adding HTTPS Support to a Server 411 When a Browser Displays Errors: Browser Trust Issues 412 Chapter 8 Advanced SSL Topics 415 Passing Additional Information with Client Hello Extensions 415 Safely Reusing Key Material with Session Resumption 420 Adding Session Resumption on the Client Side 421 Requesting Session Resumption 422 Adding Session Resumption Logic to the Client 422 Restoring the Previous Session’s Master Secret 424 Testing Session Resumption 425 Viewing a Resumed Session 427 Adding Session Resumption on the Server Side 428 Assigning a Unique Session ID to Each Session 429 Adding Session ID Storage 429 Modifying parse_client_hello to Recognize Session Resumption Requests 433 Drawbacks of This Implementation 435 Avoiding Fixed Parameters with Ephemeral Key Exchange 436 Supporting the TLS Server Key Exchange Message 437 Authenticating the Server Key Exchange Message 439 Examining an Ephemeral Key Exchange Handshake 442 Verifying Identity with Client Authentication 448 Supporting the CertificateRequest Message 449 Adding Certificate Request Parsing Capability for the Client 450 Handling the Certificate Request 452 Supporting the Certificate Verify Message 453 Refactoring rsa_encrypt to Support Signing 453 Testing Client Authentication 458 Viewing a Mutually-Authenticated TLS Handshake 460 Dealing with Legacy Implementations: Exportable Ciphers 463 Export-Grade Key Calculation 463 Step-up Cryptography 465 Discarding Key Material Through Session Renegotiation 465 Supporting the Hello Request 466 Renegotiation Pitfalls and the Client Hello Extension 0xFF01 468 Defending Against the Renegotiation Attack 469 Implementing Secure Renegotiation 471 Chapter 9 Adding TLS 1.2 Support to Your TLS Library 479 Supporting TLS 1.2 When You Use RSA for the Key Exchange 479 TLS 1.2 Modifications to the PRF 481 TLS 1.2 Modifications to the Finished Messages Verify Data 483 Impact to Diffie-Hellman Key Exchange 485 Parsing Signature Types 485 Adding Support for AEAD Mode Ciphers 490 Maximizing Throughput with Counter Mode 490 Reusing Existing Functionality for Secure Hashes with CBC-MAC 494 Combining CTR and CBC-MAC into AES-CCM 496 Maximizing MAC Throughput with Galois-Field Authentication 502 Combining CTR and Galois-Field Authentication with AES-GCM 505 Authentication with Associated Data 510 Incorporating AEAD Ciphers into TLS 1.2 517 Working ECC Extensions into the TLS Library 523 ECDSA Certificate Parsing 527 ECDHE Support in TLS 533 ECC Client Hello Extensions 540 The Current State of TLS 1.2 540 Chapter 10 Other Applications of SSL 543 Adding the NTTPS Extension to the NTTP Algorithm 543 Implementing “Multi-hop” SMTP over TLS and Protecting Email Content with S/MIME 545 Understanding the Email Model 545 The SSL/TLS Design and Email 546 Multipurpose Internet Mail Extensions (MIME) 547 Protecting Email from Eavesdroppers with S/MIME 549 Securing Email When There Are Multiple Recipients 550 S/MIME Certificate Management 552 Securing Datagram Traffic 552 Securing the Domain Name System 553 Using the DNS Protocol to Query the Database 555 Disadvantages of the DNS Query 555 Preventing DNS Cache Poisoning with DNSSEC 556 TLS Without TCP — Datagram TLS 559 Supporting SSL When Proxies Are Involved 560 Possible Solutions to the Proxy Problem 560 Adding Proxy Support Using Tunneling 561 SSL with OpenSSL 564 Final Thoughts 566 Appendix A Binary Representation of Integers: A Primer 567 The Decimal and Binary Numbering Systems 567 Understanding Binary Logical Operations 568 The AND Operation 568 The OR Operation 569 The NOT Operation 569 The XOR Operation 569 Position Shifting of Binary Numbers 570 Two’s-Complement Representation of Negative Numbers 570 Big-Endian versus Little-Endian Number Formats 571 Appendix B Installing TCPDump and OpenSSL 573 Installing TCPDump 573 Installing TCPDump on a Windows System 574 Installing TCPDump on a Linux System 575 Installing OpenSSL 575 Installing OpenSSL on a Windows System 575 Installing OpenSSL on a Linux system 577 Appendix C Understanding the Pitfalls of SSLv 2 579 Implementing the SSL Handshake 582 SSL Client Hello 588 SSL Server Hello 592 SSL Client Master Key 600 SSL Client Finished 607 SSL Server Verify 612 SSL Server Finished 616 SSL send 617 SSL recv 617 Examining an HTTPS End-to-End Example 619 Viewing the TCPDump Output 619 Problems with SSLv 2 626 Man-in-the-Middle Attacks 626 Truncation Attacks 626 Same Key Used for Encryption and Authentication 626 No Extensions 627 Index 629

Read more less

Book SynopsisTable of Contents1 Introduction to Business Processes 1 The Functional Organizational Structure 2 Business Processes 4 Global Bike Incorporated (GBI) 15 How to use This Book 16 2 Introduction to Enterprise Systems 23 Enterprise Systems 23 Data in an Enterprise System 29 Reporting 37 3 Introduction to Accounting 49 Organizational Data 51 Master Data 52 Key Concepts 58 Processes 61 Reporting 72 4 The Procurement Process 83 Organizational Data 84 Master Data 89 Key Concepts 95 Process 102 Reporting 119 5 The Fulfillment Process 127 Organizational Data 128 Master Data 139 Process 145 Credit Management Process 167 Reporting 170 6 The Production Process 179 Master Data 182 Process 196 Reporting 215 7 Inventory and Warehouse Management Processes 221 Inventory Management 222 Organizational Data in Warehouse Management 234 Master Data in Warehouse Management 239 Processes in Warehouse Management 242 Reporting 257 8 The Material Planning Process 269 Master Data 271 Process 285 Reporting 304 9 Process Integration 315 Procurement, Fulfi llment, and IWM Processes 318 Procurement, Fulfi llment, Production, and IWM Processes 332 Index 349

Read more less

Book Synopsis

Read more less

Book SynopsisEssential reading for launching a career in computer forensics Internet crime is on the rise, catapulting the need for computer forensics specialists. This new edition presents you with a completely updated overview of the basic skills that are required as a computer forensics professional. The author team of technology security veterans introduces the latest software and tools that exist and they review the available certifications in this growing segment of IT that can help take your career to a new level. A variety of real-world practices take you behind the scenes to look at the root causes of security attacks and provides you with a unique perspective as you launch a career in this fast-growing field. Explores the profession of computer forensics, which is more in demand than ever due to the rise of Internet crime Details the ways to conduct a computer forensics investigation Highlights tips and techniques for finding hidden data, capturinTable of ContentsIntroduction. Chapter 1 The Need for Computer Forensics. Chapter 2 Preparation—What to Do Before You Start. Chapter 3 Computer Evidence. Chapter 4 Common Tasks. Chapter 5 Capturing the Data Image. Chapter 6 Extracting Information from Data. Chapter 7 Passwords and Encryption. Chapter 8 Common Forensic Tools. Chapter 9 Pulling It All Together. Chapter 10 How to Testify in Court. Appendix A Answers to Review Questions. Appendix B Forensic Resources. Appendix C Forensic Certifications and More. Appendix D Forensic Tools 289 Glossary. Index.

Read more less

Book SynopsisA highly accessible reference offering a broad range of topics and insights on large scale network-centric distributed systems Evolving from the fields of high-performance computing and networking, large scale network-centric distributed systems continues to grow as one of the most important topics in computing and communication and many interdisciplinary areas. Dealing with both wired and wireless networks, this book focuses on the design and performance issues of such systems. Large Scale Network-Centric Distributed Systems provides in-depth coverage ranging from ground-level hardware issues (such as buffer organization, router delay, and flow control) to the high-level issues immediately concerning application or system users (including parallel programming, middleware, and OS support for such computing systems). Arranged in five parts, it explains and analyzes complex topics to an unprecedented degree: Part 1: Multicore and Many-CoTable of ContentsPreface xxix Acknowledgments xxxvii List of Figures xxxix List of Tables li List of Contributors lv PART 1 MULTICORE AND MANY-CORE (MC) SYSTEMS-ON-CHIP 1 A RECONFIGURABLE ON-CHIP INTERCONNECTION NETWORK FOR LARGE MULTICORE SYSTEMS 3 Mehdi Modarressi and Hamid Sarbazi-Azad 1.1 Introduction 4 1.2 Topology and Reconfiguration 8 1.3 The Proposed NoC Architecture 9 1.4 Energy and Performance-Aware Mapping 14 1.5 Experimental Results 19 1.6 Conclusion 25 2 COMPILERS, TECHNIQUES, AND TOOLS FOR SUPPORTING PROGRAMMING HETEROGENEOUS MANY/MULTICORE SYSTEMS 31 Pasquale Cantiello, Beniamino Di Martino, and Francesco Moscato 2.1 Introduction 32 2.2 Programming Models and Tools for Many/Multicore 32 2.3 Compilers and Support Tools 42 2.4 CALuMET: A Tool for Supporting Software Parallelization 45 2.5 Conclusion 49 3 A MULTITHREADED BRANCH-AND-BOUND ALGORITHM FOR SOLVING THE FLOW-SHOP PROBLEM ON A MULTICORE ENVIRONMENT 53 Mohand Mezmaz, Nouredine Melab, and Daniel Tuyttens 3.1 Introduction 54 3.2 Flow-Shop Scheduling Problem 55 3.3 Parallel Branch-and-Bound Algorithms 56 3.4 A Multithreaded Branch-and-Bound 58 3.5 The Proposed Multithreaded B&B 60 3.6 Experiments and Results 63 3.7 Conclusion 68 PART 2 PERVASIVE/UBIQUITOUS COMPUTING AND PEER-TO-PEER SYSTEMS 4 LARGE-SCALE P2P-INSPIRED PROBLEM-SOLVING: A FORMAL AND EXPERIMENTAL STUDY 73 Mathieu Djama¨ý, Bilel Derbel, and Nouredine Melab 4.1 Introduction 74 4.2 Background 77 4.3 A Pure Peer-to-Peer B&B Approach 80 4.4 Complexity Issues 87 4.5 Experimental Results 90 4.6 Conclusion 99 Acknowledgment 99 5 DATA DISTRIBUTION MANAGEMENT 103 Azzedine Boukerche and Yunfeng Gu 5.1 Addressing DDM in Different Network Environments 104 5.2 DDM in P2P Overlay Networks 106 5.3 DDM in Cluster-Based Network Environments 111 6 MIDDLEWARE SUPPORT FOR CONTEXT HANDLING AND INTEGRATION IN UBIQUITOUS COMPUTING 123 Frederico Lopes, Paulo F. Pires, Flávia C. Delicato, Thais Batista, and Luci Pirmez 6.1 Introduction 124 6.2 Ubiquitous Computing 126 6.3 Middleware for Ubiquitous Computing 128 6.4 A Solution to Integrating Context Provision Middleware for Ubiquitous Computing 133 6.5 Conclusion 142 PART 3 WIRELESS/MOBILE NETWORKS 7 CHALLENGES IN THE USE OF WIRELESS SENSOR NETWORKS FOR MONITORING THE HEALTH OF CIVIL STRUCTURES 147 Flávia C. Delicato, Igor L. dos Santos, Luci Pirmez, Paulo F. Pires, and Claudio M. de Farias 7.1 Introduction 148 7.2 Structural Health Monitoring 150 7.3 Wireless Sensor Networks 155 7.4 Applying Wireless Sensor Networks for Structural Health Monitoring 157 7.5 Conclusion 163 8 MOBILITY EFFECTS IN WIRELESS MOBILE NETWORKS 167 Abbas Nayebi and Hamid Sarbazi-Azad 8.1 Introduction 167 8.2 The Effect of Node Mobility on Wireless Links 168 8.3 The Effect of Node Mobility on Network Topology 172 8.4 Conclusion 177 9 ANALYTICAL MODEL OF TIME-CRITICAL WIRELESS SENSOR NETWORK: THEORY AND EVALUATION 183 Kambiz Mizanian and Amir Hossein Jahangir 9.1 Introduction 184 9.2 Real-Time Wireless Sensor Network: An Overview 185 9.3 Real-Time Degree 188 9.4 Reliable Real-Time Degree 195 9.5 Model Validation 197 9.6 Conclusion 199 10 MULTICAST TRANSPORT PROTOCOLS FOR LARGE-SCALE DISTRIBUTED COLLABORATIVE ENVIRONMENTS 203 Haifa Raja Maamar and Azzedine Boukerche 10.1 Introduction 204 10.2 Definition and Features 204 10.3 Classification of Multicast Protocols 207 10.4 Conclusion 216 11 NATURE-INSPIRED COMPUTING FOR AUTONOMIC WIRELESS SENSOR NETWORKS 219 Wei Li, Javid Taheri, Albert Y. Zomaya, Franciszek Seredynski, and Bjorn Landfeldt 11.1 Introduction 220 11.2 Autonomic WSNs 222 11.3 Principles of Nature-Inspired Computing 224 11.4 Cellular Automata 226 11.5 Swarm Intelligence 228 11.6 Artificial Immune Systems 233 11.7 Evolutionary Computing 238 11.8 Molecular Biology 242 11.9 Bio-Networking Architecture 243 11.10 Conclusion 244 PART 4 GRID AND CLOUD COMPUTING 12 SMART RPC-BASED COMPUTING IN GRIDS AND ON CLOUDS 257 Thomas Brady, Oleg Girko, and Alexey Lastovetsky 12.1 Introduction 258 12.2 SmartGridRPC and SmartGridSolve 266 12.3 Making SmartGridSolve Smarter 277 12.4 Smart RPC-Based Computing on Clouds: Adaptation of SmartGridRPC and SmartGridSolve to Cloud Computing 282 13 PROFIT-MAXIMIZING RESOURCE ALLOCATION FOR MULTITIER CLOUD COMPUTING SYSTEMS UNDER SERVICE LEVEL AGREEMENTS 291 Hadi Goudarzi and Massoud Pedram 13.1 Introduction 292 13.2 Review of Datacenter Power Management Techniques 294 13.3 Review of Datacenter Performance Management Techniques 296 13.4 System Model of a Multitier Application Placement Problem 298 13.5 Profit Maximization in a Hosting Datacenter 303 13.6 Simulation Results 310 13.7 Conclusion 314 14 MARKET-ORIENTED CLOUD COMPUTING AND THE CLOUDBUS TOOLKIT 319 Rajkumar Buyya, Suraj Pandey, and Christian Vecchiola 14.1 Introduction 320 14.2 Cloud Computing 322 14.3 Cloudbus: Vision and Architecture 338 14.4 Cloudbus and Clouds Lab Technologies 340 14.5 Experimental Results 345 14.6 Related Technologies, Integration, and Deployment 350 14.7 Conclusion 351 15 A CLOUD BROKER ARCHITECTURE FOR MULTICLOUD ENVIRONMENTS 359 Jose Luis Lucas-Simarro, Iñigo San Aniceto, Rafael Moreno-Vozmediano, Ruben S. Montero, and Ignacio M. Llorente 15.1 Introduction 360 15.2 State of the Art on Cloud Brokering 361 15.3 Challenges of Cloud Brokering 363 15.4 Proposal of a Broker Architecture for Multicloud Environments 364 15.5 Scheduling Policies for Efficient Cloud Brokering 367 15.6 Results 369 15.7 Conclusion 373 16 ENERGY-EFFICIENT RESOURCE UTILIZATION IN CLOUD COMPUTING 377 Giorgio L. Valentini, Samee U. Khan, and Pascal Bouvry 16.1 Introduction 378 16.2 Related Work 380 16.3 Energy-Efficient Utilization of Resources in Cloud Computing Systems 381 16.4 Complementarity Approach 386 16.5 Simulation Results 395 16.6 Discussion of Results 402 16.7 Conclusion 404 17 SEMANTICS-BASED RESOURCE DISCOVERY IN LARGE-SCALE GRIDS 409 Juan Li, Samee U. Khan, and Nasir Ghani 17.1 Introduction 410 17.2 Related Work 411 17.3 Virtual Organization Formation 412 17.4 Semantics-Based Resource Discovery in Virtual Organizations 417 17.5 Prototype Implementation and Evaluation 421 17.6 Conclusion 427 18 GAME-BASED MODELS OF GRID USER’S DECISIONS IN SECURITY-AWARE SCHEDULING 431 Joanna Kolodziej, Samee U. Khan, Lizhe Wang, and Dan Chen 18.1 Introduction 432 18.2 Security-Aware Scheduling Problems in Computational Grids 433 18.3 Game Models in Security-Aware Grid Scheduling 441 18.4 Case Study: Approximating the Equilibrium States of the End Users’ Symmetric Game Using the Genetic Metaheuristics 447 18.5 Conclusion 460 19 ADDRESSING OPEN ISSUES ON PERFORMANCE EVALUATION IN CLOUD COMPUTING 463 Beniamino Di Martino, Massimo Ficco, Massimiliano Rak,and Salvatore Venticinque 19.1 Introduction 464 19.2 Benchmarking Approaches 465 19.3 Monitoring in Cloud Computing 468 19.4 Attack Countermeasures in Cloud Computing 474 19.5 Conclusion 480 20 BROKER-MEDIATED CLOUD-AGGREGATION MECHANISM USING MARKOVIAN QUEUES FOR SCHEDULING BAG-OF-TASKS (BOT) APPLICATIONS 485 Ganesh Neelakanta Iyer and Bharadwaj Veeravalli 20.1 Introduction 486 20.2 Literature Review and Contributions 487 20.3 Problem Setting and Notations 488 20.4 Proposed Cloud Aggregation Mechanism 489 20.5 Performance Evaluation and Discussions 494 20.6 Discussions 497 20.7 Conclusion 498 21 ON THE DESIGN OF A BUDGET-CONSCIOUS ADAPTIVE SCHEDULER FOR HANDLING LARGE-SCALE MANY-TASK WORKFLOW APPLICATIONS IN CLOUDS 503 Bharadwaj Veeravalli, Lingfang Zeng, and Xiaorong Li 21.1 Introduction 504 21.2 Related Work and Motivation 505 21.3 System Model and Problem Setting 506 21.4 Proposed Scheduling Algorithm 512 21.5 Performance Evaluation and Results 516 21.6 Conclusion 522 22 VIRTUALIZED ENVIRONMENT ISSUES IN THE CONTEXT OF A SCIENTIFIC PRIVATE CLOUD 527 Bruno Schulze, Henrique de Medeiros Klˆoh, Matheus Bousquet Bandini, Antonio Roberto Mury, Daniel Massami Muniz Yokoyama, Victor Dias de Oliveira, F´abio Andr´e Machado Porto, and Giacomo Victor McEvoy Valenzano 22.1 Introduction 528 22.2 Related Works 528 22.3 Methodology 531 22.4 Experiments 533 22.5 Conclusion 544 22.6 Glossary 546 PART 5 OTHER TOPICS RELATED TO NETWORK-CENTRIC COMPUTING AND ITS APPLICATIONS 23 IN-ADVANCE BANDWIDTH SCHEDULING IN e-SCIENCE NETWORKS 551 Yan Li, Eunsung Jung, Sanjay Ranka, Nageswara S. Rao, and Sartaj Sahni 23.1 Introduction 552 23.2 Temporal Network Model 554 23.3 Single-Path Scheduling 556 23.4 Multiple-Path Scheduling 570 23.5 Conclusion 587 24 ROUTING AND WAVELENGTH ASSIGNMENT IN OPTICAL NETWORKS 591 Yan Li, Sanjay Ranka, and Sartaj Sahni 24.1 Introduction 592 24.2 Scheduling in Full-Wavelength Conversion Network 593 24.3 Scheduling in Sparse Wavelength Conversion Network 603 25 COMPUTATIONAL GRAPH ANALYTICS FOR MASSIVE STREAMING DATA 619 David Ediger, Jason Riedy, David A. Bader, and Henning Meyerhenke 25.1 Introduction 620 25.2 STINGER: A General-Purpose Data Structure for Dynamic Graphs 622 25.3 Algorithm for Updating Clustering Coefficients 625 25.4 Tracking Connected Components in Scale-Free Graphs 628 25.5 Implementation 632 25.6 Experimental Results 634 25.7 Related Work 643 25.8 Conclusion 644 26 KNOWLEDGE MANAGEMENT FOR FAULT-TOLERANT WATER DISTRIBUTION 649 Jing Lin, Ali Hurson, and Sahra Sedigh 26.1 Introduction 650 26.2 Related Work 652 26.3 Agent-Based Model for WDN Operation 653 26.4 Classes in WDN Ontology Framework 656 26.5 Automated Failure Classification and Mitigation 659 26.6 Validation of Automated Failure Mitigation 668 26.7 Conclusion 674 Acknowledgment 675 References 675 Index 679

Read more less

Book Synopsis* Young researchers (doctoral students and PostDocs) can use this book to learn about the related research work and use it as a reference. * Graduate students can use this book for courses related to parallel programming.Table of ContentsLIST OF CONTRIBUTORS ix PREFACE xv ACKNOWLEDGEMENTS xxiii ACRONYMS xxv PART I FOUNDATIONS 1 Multi- and Many-Cores, Architectural Overview for Programmers 1Lasse Natvig, Alexandru Iordan, Mujahed Eleyat, Magnus Jahre and Jorn Amundsen 2 Programming Models for MultiCore and Many-Core Computing Systems 29Ana Lucia Varbanescu, Rob V. van Nieuwpoort, Pieter Hijma, Henri E. Bal, Rosa M. Badia and Xavier Martorell 3 Lock-free Concurrent Data Structures 59Daniel Cederman, Anders Gidenstam, Phuong Ha, Håkan Sundell, Marina Papatriantafilou and Philippas Tsigas 4 Software Transactional Memory 81Sandya Mannarswamy PART II PROGRAMMING APPROACHES 5 Hybrid/Heterogeneous Programming with OMPSs and its Software/Hardware Implications 101Eduard Ayguade, Rosa M. Badia, Pieter Bellens, Javier Bueno, Alejandro Duran, Yoav Etsion, Montse Farreras, Roger Ferrer, Jesus Labarta, Vladimir Marjanovic, Lluis Martinell, Xavier Martorell, Josep M. Perez, Judit Planas, Alex Ramirez, Xavier Teruel, Ioanna Tsalouchidou and Mateo Valero 6 Skeleton Programming for Portable Many-Core Computing 121Christoph Kessler, Sergei Gorlatch, Johan Enmyren, Usman Dastgeer, Michel Steuwer and Philipp Kegel 7 DSL Stream Programming on Multicore Architectures 143Pablo de Oliveira Castro, Stephane Louise and Denis Barthou´ 8 Programming with Transactional Memory 165Vincent Gramoli and Rachid Guerraoui 9 Object-Oriented Stream Programming 185Frank Otto and Walter F. Tichy 10 Software-Based Speculative Parallelization 205Chen Tian, Min Feng and Rajiv Gupta 11 Autonomic Distribution and Adaptation 227Lutz Schubert, Stefan Wesner, Daniel Rubio Bonilla and Tom-maso Cucinotta PART III PROGRAMMING FRAMEWORKS 12 PEPPHER: Performance Portability and Programmability for Heterogeneous Many-Core Architectures 243Siegfried Benkner, Sabri Pllana, Jesper Larsson Trff, Philippas Tsigas, Andrew Richards, George Russell, Samuel Thibault, Cdric Augonnet, Raymond Namyst, Herbert Cornelius, Christoph Keler, David Moloney and Peter Sanders 13 Fastflow: High-Level and Efficient Streaming on Multicore 261Marco Aldinucci, Marco Danelutto, Peter Kilpatrick and Massimo Torquati 14 Parallel Programming Framework for H.264/AVC Video Encoding in Multicore Systems 281Nuno Roma, Antnio Rodrigues and Leonel Sousa 15 Parallelizing Evolutionary Algorithms on GPGPU Cards with the EASEA Platform 301Ogier Maitre, Frederic Kruger, Deepak Sharma, Stephane Querry, Nicolas Lachiche and Pierre Collet PART IV TESTINE, EVALUATION AN OPTIMIZATION 16 Smart Interleavings for Testing Parallel Programs 323Eitan Farchi 17 Parallel Performance Evaluation and Optimization 343Hazim Shafi 18 A Methodology for Optimizing Multithreaded System Scalability on Multicores 363Neil Gunther, Shanti Subramanyam and Stefan Parvu 19 Improving Multicore System Performance through Data Compression 385Ozcan Ozturk and Mahmut Kandemir PART V SCHEDULING AND MANAGEMENT 20 Programming and Managing Resources on Accelerator-Enabled Clusters 407M. Mustafa Rafique, Ali R. Butt and Dimitrios S. Nikolopoulos 21 An Approach for Efficient Execution of SPMD Applications on Multicore Clusters 431Ronal Muresano, Dolores Rexachs and Emilio Luque 22 Operating System and Scheduling for Future Multicore and Many-Core Platforms 451Tommaso Cucinotta, Giuseppe Lipari and Lutz Schubert GLOSSARY 475 INDEX 481

Read more less

Book SynopsisIn a world where most products are manufactured by machines, Etsy offers an online platform for makers of handmade products and crafts to market and sell their goods to a vast network of buyers who demand unique, genuine products. To date, the site has attracted over 400,000 sellers who collectively have sold over 30 million items, generating more than $180.6 million in revenue. The only resource of its kind, How to Make Money Using Etsy--written by Tim Adam who has successfully been selling his products all over the world through his Etsy shop since 2007--guides readers step-by-step through the many stages of selling online. How-to topics include: Establish your Etsy shop Effectively photograph your products Post your products to optimize visibility and increase sales Brand your business Use social media like blogs, Twitter, and Facebook to connTable of ContentsPreface. Introduction. Chapter 1 All About Etsy. Etsy Defined - Etsy terms you should know. The Etsy Community. Chapter 2 Getting To Know You and Your Product. Basic product questions. Marketing and Branding. General Online Selling. Product Research. Google Trends. eBay Pulse. Etsy Search. Chapter 3 Your Etsy Shop Set up. SEO Defined. Keyword Research. Working through Your Etsy. Chapter 4 Listing Your First Item. Where is the Etsy title tag found? Shipping. Uploading pictures. Chapter 5 Four-Step Game Plan For More Views. Etsy Forums. Blogging. Twitter. Facebook. Chapter 6 Advanced SEO For Your Etsy Shop. Keyword research and placement. Competition. Global Monthly Searches. Key Phrase Evaluation. Increasing your Google Rank with Quality Backlinks. Chapter 7 Handmade Blogging Essentials. Essentials for Blogging in the Handmade Scene. 20 Tips for Handmade Blogging Success. Top Blogger Interview Sum-up. 20 Tips Expanded. Chapter 8 Twitter For Etsy Sellers. Quick Twitter Terms You Should Know. Quick Twitter Overview.. Chapter 9 Facebook For Handmade. Facebook Stats. Facebook Terms. Fan Page versus Personal Profile. Fan Page versus Facebook Groups. Promoting Your Products and Links on Facebook. FacebookInsights. Promoting Your Facebook Fan Page. Final Words. Chapter 10 Top Etsy Seller Interviews. Conclusion. About the Author. Index.

Read more less

Book SynopsisFully updated with new information, including the latest changes to YouTube! If you''re a marketer, consultant, or small business owner, this is the guide you need to understand video marketing tactics, develop a strategy, implement the campaign, and measure results. You''ll find extensive coverage of keyword strategies, tips on optimizing your video, distribution and promotion tactics, YouTube advertising opportunities, and crucial metrics and analysis. Avoid errors, create a dynamite campaign, and break it all down in achievable tasks with this practical, hour-a-day, do-it-yourself guide. Shows you how to successfully develop, implement, and measure a successful video marketing strategy Written in the popular An Hour a Day format, which breaks intimidating topics down to easily approachable tasks Thoroughly updated with the latest YouTube functionality, helpful new case studies, the latest marketing insights, and more Covers optimizaTable of ContentsForeword xv Introduction xvii Chapter 1 A Short History of YouTube 1 Life before YouTube 2 2005–2006: Early Days 3 2007–2008: Middle Years 10 2009–2010: Coming of Age 20 Chapter 2 Map Out Your Video Marketing Strategy 27 Four Ps vs. Five Ws and an H 28 What Types of Video Content Do They Watch? 42 Where and When Do They Discover New Videos? 47 When and Where Do They Share New Videos? 49 Why Don’t More New Videos Go Viral? 52 How Do YouTube and Video Marketing Work? 57 Chapter 3 Month 1: Make Videos Worth Watching 63 Happy Tree #3,079 64 Week 1: Get Ready to Shoot 65 Week 2: Learn Video Production Basics 74 Week 3: Get Advanced Video Production Tips 83 Week 4: Evaluate Video Advertising Options 91 Chapter 4 Month 2: Create Content Worth Sharing 103 Learn the Lesson of "The Last Lecture" 104 Week 1: Watch YouTube Award Winners 107 Week 2: Explore Popular YouTube Videos 117 Week 3: Examine Contagious Viral Ads 133 Week 4: Observe Top Viral Videos 147 Chapter 5 Month 3: Customize Your YouTube Channel 163 Center vs. Circumference 164 Week 1: Set Up a YouTube Channel 165 Week 2: Become a YouTube Partner 174 Week 3: Create a YouTube Brand Channel 184 Week 4: Stream Live Content on YouTube 196 Chapter 6 Month 4: Explore YouTube Alternatives 203 The Northwest Passage 204 Week 1: Explore Other Video Sites 205 Week 2: Survey Video Hosting Services 213 Week 3: Look at Online Video Platforms 222 Week 4: Investigate Video Ad Networks 232 Chapter 7 Month 5: Optimize Video for YouTube 239 What Is Video Optimization? 240 Week 1: Research Keywords . 241 Week 2: Optimize Video Watch Pages 249 Week 3: Optimize Your Brand Channel 258 Week 4: Optimize Video for the Web 267 Chapter 8 Month 6: Engage the YouTube Community 277 Paul Revere's Ride 278 Week 1: Become a Member of the YouTube Community 281 Week 2: Learn the Secrets of YouTube Success 292 Week 3: Build Buzz Beyond YouTube 301 Week 4: Watch Online Video Case Studies 310 Chapter 9 Month 7: Trust but Verify YouTube Insight 325 The Map Room 326 Week 1: Trust YouTube Insight 328 Week 2: Verify with TubeMogul 338 Week 3: Verify with Google Analytics 348 Week 4: Master Web Analytics 2.0 357 Chapter 10 Study YouTube Success Stories 367 The Story behind the Story 368 Deliver 700 Percent Increase in Sales: Will It Blend? 369 Win the Presidency of the United States: Barack Obama 378 Increase Sales of DVDs 23,000 Percent: Monty Python 393 Generate $2.1 million in Sales: PiperSport Launch 399 Chapter 11 A Quick Look at the Future 409 "It's Never the Same! It's Always Bizarre!" 410 Look at What Has Changed in the Past Year 411 Stay on Top of the Latest Trends 424 Play by the New Rules of YouTube Marketing . 435 "Hit 'em Where They Ain't" 452 Index 457

Read more less

Book SynopsisThe fun and friendly guide to the world's most popular online learning management system Modular Object Oriented Dynamic Learning Environment, also known as Moodle, is an online learning management system that creates opportunities for rich interaction between educators and their audience.Table of ContentsIntroduction. Part I: Getting Started with Moodle. Chapter 1: Discovering Moodle and What You Can Do. Chapter 2: Designing Great Moodle Courses. Chapter 3: Building Your Course Front Page. Chapter 4: Creating Your Course. Part II: Creating and Managing Course Content. Chapter 5: Adding Content to Your Course: Resources. Chapter 6: Adding Audio and Video to Your Course by Using Free Software. Chapter 7: Grading Learners’ Progress and Knowledge. Part III: Adding Activities to Your Moodle Course. Chapter 8: Adding Communication Modules. Chapter 9: Adding Collaborative Modules. Chapter 10: Creating Assignments. Chapter 11: Quizzing and Testing in Moodle. Chapter 12: Using Databases to Share Resources and Adding the Latest News via RSS. Part IV: Moodle Management. Chapter 13: Administering Moodle Courses. Chapter 14: Managing Course Data, Reports, Logs, and Statistics. Part V: The Parts of Tens. Chapter 15: Ten Questions to Ask before Building and Launching Your Course. Chapter 16: Ten Creative Ways to Keep Your Learners Involved in Your Course. Index.

Read more less

Book SynopsisBroad in scope, involving theory, the application of that theory, and programming technology, compiler construction is a moving target, with constant advances in compiler technology taking place. Today, a renewed focus on do-it-yourself programming makes a quality textbook on compilers, that both students and instructors will enjoy using, of even more vital importance. This book covers every topic essential to learning compilers from the ground up and is accompanied by a powerful and flexible software package for evaluating projects, as well as several tutorials, well-defined projects, and test cases.Trade Review"Compiler Construction Using Java, JavaCC, and Yacc covers every topic essential to learning compilers from the ground up and is accompanied by a powerful and flexible software package for evaluating projects, as well as several tutorials, well-defined projects, and test cases." (Ulitzer, 5 December 2011) Table of ContentsPreface xv Chapter 1 Strings, Languages, and Compilers 1 1.1 Introduction 1 1.2 Basic Language Concepts 1 1.3 Basic Compiler Concepts 3 1.4 Basic Set Theory 4 1.5 Null String 6 1.6 Concatenation 7 1.7 Exponent Notation 7 1.8 Star Operator 8 1.9 Concatenation of Sets of Strings 9 1.10 Plus Operator 11 1.11 Question Mark Operator 11 1.12 Shorthand Notation for a Set Containing a Single String 12 1.13 Operator Precedence 12 1.14 Regular Expressions 13 1.15 Limitations of Regular Expressions 15 Problems 16 Chapter 2 Context-Free Grammars, Part 1 19 2.1 Introduction 19 2.2 What is a Context-Free Grammar? 20 2.3 Derivations Using a Context-Free Grammar 21 2.4 Language Defined by a Context-Free Grammar 23 2.5 Different Ways of Representing Contet-Free Grammars 25 2.6 Some Simple Grammars 26 2.7 Techniques for Generating Languages with Context-Free Grammars 29 2.8 Regular and Right Linear Grammars 35 2.9 Counting with Regular Grammars 37 2.0 Grammars for Lists 39 2.10 An Important Language that is Not Context Free 44 Problems 45 Chapter 3 Context-Free Grammars, Part 2 49 3.1 Introduction 49 3.2 Parse Trees 49 3.3 Leftmost and Rightmost Derivations 51 3.4 Substitution 52 3.5 Ambiguous Grammars 54 3.6 Determining Nullable Nonterminals 59 3.7 Eliminating Lambda Productions 60 3.8 Eliminating Unit Productions 64 3.9 Eliminating Useless Nonterminals 66 3.10 Recursion Conversions 71 3.11 Adding the Null String to a Language 76 Problems 77 Chapter 4 Context-Free Grammars, Part 3 83 4.1 Introduction 83 4.2 Grammars for Arithmetic Expressions 83 4.3 Specifying Associativity and Precedence in Grammars 90 4.4 Backus-Naur Form 92 4.5 Syntax Diagrams 94 4.6 Abstract Syntax Trees and Three-Address Code 96 4.7 Noncontracting Grammars 97 4.8 Essentially Noncontracting Grammars 97 4.9 Converting a Context-Free Grammar to an Essentially Noncontracting Grammar 98 4.10 Pumping Property of Context-Free Languages 101 Problems 104 Chapter 5 Chomsky’s Hierarchy 107 5.1 Introduction 107 5.2 Context-Sensitive Productions 107 5.3 Context-Sensitive Grammars no 5.4 Unrestricted Grammars 111 Problems 112 Chapter 6 Top-Down Parsing 115 6.1 Introduction 115 6.2 Top-Down Construction of a Parse Tree 115 6.3 Parses that Fail 117 6.4 A Bad Grammar for Top-Down Parsing 118 6.5 Deterministic Parsers 119 6.6 A Parser that Uses a Stack 120 6.7 Table Representation of a Stack Parser 124 6.8 Handling Productions with Nonleading Terminal 126 6.9 Writing a Stack Parser in Java 127 Problems 134 Chapter 7 LL(1) Grammars 137 7.1 Introduction 137 7.2 FIRST Set of the Right Side of a Production 137 7.3 Determining Operation Sequences 140 7.4 Determining Selection Sets of Lambda Productions 142 7.5 Whatever-Follows-Left-Follows-Rightmost Rule 145 7.6 Selection Sets for Productions with Nullable Right Sides 147 7.7 Selection Sets Containing End-of-Input Symbol 149 7.8 A Stack Parser for a Grammar with Lambda Productions 152 7.9 Converting a Non-LL( 1) Grammar to an LL( 1) Grammar 153 7.10 Parsing with an Ambiguous Grammar 160 7.11 Computing FIRST and FOLLOW Sets 163 Problems 165 Chapter 8 Table-Driven Stack Parser 171 8.1 Introduction 171 8.2 Unifying the Operations of a Stack Parser 172 8.3 Implementing a Table-Driven Stack Parser 175 8.4 Improving Our Table-Driven Stack Parser 180 8.5 Parsers that are Not Deterministic—A Digression on Theory 181 Problems 183 Chapter 9 Recursive-Descent Parsing 185 9.1 Introduction 185 9.2 Simple Recursive-Descent Parser 185 9.3 Handling Lambda Productions 192 9.4 A Common Error 197 9.5 Java Code for Productions 198 9.6 Left Factoring in a Recursive-Descent Parser 199 9.7 Eliminating Tail Recursion 204 9.8 Translating the Star, Plus, and Question Mark Operators 108 9.9 Doing Things Backward 210 Problems 211 Chapter 10 Recursive-Descent Translation 215 10.1 introduction 215 10.2 A Simple Translation Grammar 215 10.3 Converting a Translation Grammar to Java Code 217 10.4 Specifications for a Translation Grammar 218 10.5 Passing Information During a Parse 231 10.6 L-Attributed Grammars 236 10.7 New Token Manager 238 10.8 Solving the Token Lookahead Problem 241 10.9 Code for the New Token Manager 241 10.10 Translation Grammar for Prefix Expression Compiler 253 10.11 An Interesting Use of Recursion 257 Problems 261 Chapter 11 Assembly Language 265 11.1 Introduction 265 11.2 Structure of the J1 Computer 265 11.3 Machine Language Instructions 266 11.4 Assembly Language Instructions 268 11.5 Pushing Characters 269 11.6 aout Instruction 270 11.7 Using Labels 270 11.8 Using the Assembler 272 11.9 stav Instruction 275 11.10 Compiling an Assignment Statement 277 11.11 Compiling print and printin 280 11.12 Outputting Strings 28, 11.13 Inputting Decimal Numbers 283 11.14 Entry Directive 284 11.15 More Assembly Language 285 Problems 285 Chapter 12 SI—A Simple Compiler 289 12.1 Introduction 289 12.2 The Source Language 289 12.3 Grammar for Source Language 290 12.4 The Target Language 291 12.5 Symbol Table 292 12.6 Code Generator 293 12.7 Token Class 293 12.8 Writing the Translation Grammar 294 12.9 Implementing the SI Compiler 299 12.10 Trying Out SI 315 12.11 Advice on Extending the SI Compiler 318 12.12 Specifications for S2 320 Problems 324 Chapter 13 JavaCC 331 13.1 Introduction 331 13.2 JavaCC Extended Regular Expressions 333 13.3 JavaCC Input File 337 13.4 Specifying Actions for Regular Expressions 344 13.5 JavaCC Input File for Slj 348 13.6 Files Produced by JavaCC 355 13.7 Using the Star and Plus Operators 359 13.8 Choice Points and the Lookahead Directive 362 13.9 JavaCC’s Choice Algorithm 367 13.10 Syntactic and Semantic Lookahead 371 13.11 Using JavaCC to Create a Token Manager Only 372 13.12 Using the Token Chain 373 13.13 Suppressing Warning Messages 377 Problems 387 Chapter 14 Building on S2 383 14.1 Introduction 383 14.2 Extending println and print 383 14.3 Cascaded Assignment Statement 388 14.4 Unary Plus and Minus 313 14.5 readint Statement 393 14.6 Controlling the Token Trace from the Command Line 395 14.7 Specifications for S3 396 Problems 396 Chapter 15 Compiling Control Structures 399 15.1 Introduction 399 15.2 while Statement 399 15.3 if Statement 403 15.4 do-while Statement 407 15.5 Range Checking of Numerical Constants 408 15.6 Handling Backslash-Quote in a String 410 15.7 Handling Backslash-Quote with JavaCC 411 15.8 Universal Blocks in JavaCC 416 15.9 Handling Strings that Span Lines 418 15.10 Handling Strings that Span Lines Using JavaCC 419 15.11 SPECIAL_TOKEN Block in JavaCC 422 15.12 Error Recovery 424 15.13 Error Recovery in JavaCC 429 15.14 Specifications for S4 430 Problems 431 Chapter 16 Compiling Programs in Functional Form 435 16.1 Introduction 435 16.2 Separate Assembly and Linking 435 16.3 Calling and Returning from Fuctions 439 16.4 Source Language for S5 443 16.5 Symbol Table for S5 445 16.6 Code Generator for S5 446 16.7 Translation Grammar forS5 447 16.8 Linking with a Library 457 16.9 Specifications for S5 458 16.10 Extending S5 458 Problems 461 Chapter 17 Finite Automata 465 17.1 Introduction 465 17.2 Deterministic Finite Automata 466 17.3 Converting a DFA to a Regular Expression 468 17.4 Java Code for a DFA 472 17.5 Nondeterministic Finite Automata 474 17.6 Using an NFA as an Algorithm 476 17.7 Converting an NFA to a DFA with the Subset Algorithm 478 17.8 Converting a DFA to a Regular Grammar 479 17.9 Converting a Regular Grammar to an NFA 482  17.10 Converting a Regular Expression to an NF A 484 17.11 Finding the Minimal DFA 488 17.12 Pumping Property of Regular Languages 493 Problems 495 Chapter 18 Capstone Project: Implementing Grep Using Compiler Technology 499 18.1 Introduction 499 18.2 Regular Expressions for Our Grep Program 501 18.3 Token Manager for Regular Expression 501 18.4 Grammar for Regular Expressions 503 18.5 Target Language for Our Regular Expression Compiler 503 18.6 Using an NFA for Pattern Matching 508 Problems 513 Chapter 19 Compiling to a Register-Oriented Architecture 515 19.1 Introduction 515 19.2 Using the Register Instruction Set 516 19.3 Modifications to the Symbol Table for R1 517 19.4 Parser and Code Generator for R1 518 Problems 526 Chapter 20 Optimization 529 20.1 Introduction 529 20.2 Using the ldc Instruction 531 20.3 Reusing Temporary Variables 532 20.4 Constant Folding 535 20.5 Register Allocation 537 20.6 Peephole Optimization 540 Problems 543 Chapter 21 Interpreters 547 21.1 Introduction 547 21.2 Converting SI to 11 549 21.3 Interpreting Statements that Transfer Control 552 21.4 Implementing the Compiler-Interpreter Cl 1 553 21.5 Advantages of Interpreters 558 Problems 559 Chapter 22 Bottom-Up Parsing 561 22.1 Introduction 561 22.2 Principles of Bottom-Up Parsing 561 22.3 Parsing with Right- versus Left-Recursive Grammars 565 22.4 Bottom-Up Parsing with an Ambiguous Grammar 566 22.5 Do-Not-Reduce Rule 569 22.6 SLR(l) Parsing 570 22.7 Shift/Reduce Conflicts 577 22.8 Reduce/Reduce Conflicts 579 22.9 LR(1) Parsing 579 Problems 584 Chapter 23 yacc 587 23.1 Introduction 587 23.2 yacc Input and Output Files 587 23.3 A Simple yacc-Generated Parser 588 23.4 Passing Values Using the Value Stack 596 23.5 Using yacc With an Ambiguous Grammar 602 23.6 Passing Values down the Parse Tree 604 23.7 Implementing Sly 606 23.8 jflex 612 Problems 618 Appendix A Stack Instruction Set 621 Appendix B Register Instruction Set 625 References 629 Index

Read more less

Book Synopsis? C++ is one of the best languages for the development of financial engineering and instrument pricing applications. ? This book applies C++ to the design and implementation of classes, libraries and latest applications for option and derivative pricing models.Table of ContentsCHAPTER 1 A Tour of C++ and Environs 1 1.1 Introduction and Objectives 1 1.2 What is C++? 1 1.3 C++ as a Multiparadigm Programming Language 2 1.4 The Structure and Contents of this Book: Overview 4 1.5 A Tour of C++11: Black–Scholes and Environs 6 1.6 Parallel Programming in C++ and Parallel C++ Libraries 12 1.7 Writing C++ Applications; Where and How to Start? 14 1.8 For whom is this Book Intended? 16 1.9 Next-Generation Design and Design Patterns in C++ 16 1.10 Some Useful Guidelines and Developer Folklore 17 1.11 About the Author 18 1.12 The Source Code and Getting the Source Code 19 CHAPTER 2 New and Improved C++ Fundamentals 21 2.1 Introduction and Objectives 21 2.2 The C++ Smart Pointers 21 2.3 Using Smart Pointers in Code 23 2.4 Extended Examples of Smart Pointers Usage 30 2.5 Move Semantics and Rvalue References 34 2.6 Other Bits and Pieces: Usability Enhancements 39 2.7 Summary and Conclusions 52 2.8 Exercises and Projects 52 CHAPTER 3 Modelling Functions in C++ 59 3.1 Introduction and Objectives 59 3.2 Analysing and Classifying Functions 60 3.3 New Functionality in C++: std::function<> 64 3.4 New Functionality in C++: Lambda Functions and Lambda Expressions 65 3.5 Callable Objects 69 3.6 Function Adapters and Binders 70 3.7 Application Areas 75 3.8 An Example: Strategy Pattern New Style 75 3.9 Migrating from Traditional Object-Oriented Solutions: Numerical Quadrature 78 3.10 Summary and Conclusions 81 3.11 Exercises and Projects 82 CHAPTER 4 Advanced C++ Template Programming 89 4.1 Introduction and Objectives 89 4.2 Preliminaries 91 4.3 decltype Specifier 94 4.4 Life Before and After decltype 101 4.5 std::result_of and SFINAE 106 4.6 std::enable_if 108 4.7 Boost enable_if 112 4.8 std::decay()Trait 114 4.9 A Small Application: Quantities and Units 115 4.10 Conclusions and Summary 118 4.11 Exercises and Projects 118 CHAPTER 5 Tuples in C++ and their Applications 123 5.1 Introduction and Objectives 123 5.2 An std:pair Refresher and New Extensions 123 5.3 Mathematical and Computer Science Background 128 5.4 Tuple Fundamentals and Simple Examples 130 5.5 Advanced Tuples 130 5.6 Using Tuples in Code 133 5.7 Other Related Libraries 138 5.8 Tuples and Run-Time Efficiency 140 5.9 Advantages and Applications of Tuples 142 5.10 Summary and Conclusions 143 5.11 Exercises and Projects 143 CHAPTER 6 Type Traits, Advanced Lambdas and Multiparadigm Design in C++ 147 6.1 Introduction and Objectives 147 6.2 Some Building Blocks 149 6.3 C++ Type Traits 150 6.4 Initial Examples of Type Traits 158 6.5 Generic Lambdas 161 6.6 How Useful will Generic Lambda Functions be in the Future? 164 6.7 Generalised Lambda Capture 171 6.7.1 Living Without Generalised Lambda Capture 173 6.8 Application to Stochastic Differential Equations 174 6.9 Emerging Multiparadigm Design Patterns: Summary 178 6.10 Summary and Conclusions 179 6.11 Exercises and Projects 179 CHAPTER 7 Multiparadigm Design in C++ 185 7.1 Introduction and Objectives 185 7.2 Modelling and Design 185 7.3 Low-Level C++ Design of Classes 190 7.4 Shades of Polymorphism 199 7.5 Is there More to Life than Inheritance? 206 7.6 An Introduction to Object-Oriented Software Metrics 207 7.7 Summary and Conclusions 210 7.8 Exercises and Projects 210 CHAPTER 8 C++ Numerics, IEEE 754 and Boost C++ Multiprecision 215 8.1 Introduction and Objectives 215 8.2 Floating-Point Decomposition Functions in C++ 219 8.3 A Tour of std::numeric_limits 221 8.4 An Introduction to Error Analysis 223 8.5 Example: Numerical Quadrature 224 8.6 Other Useful Mathematical Functions in C++ 228 8.7 Creating C++ Libraries 231 8.8 Summary and Conclusions 239 8.9 Exercises and Projects 239 CHAPTER 9 An Introduction to Unified Software Design 245 9.1 Introduction and Objectives 245 9.1.1 Future Predictions and Expectations 246 9.2 Background 247 9.3 System Scoping and Initial Decomposition 251 9.4 Checklist and Looking Back 259 9.5 Variants of the Software Process: Policy-Based Design 260 9.6 Using Policy-Based Design for the DVM Problem 268 9.7 Advantages of Uniform Design Approach 273 9.8 Summary and Conclusions 274 9.9 Exercises and Projects 275 CHAPTER 10 New Data Types, Containers and Algorithms in C++ and Boost C++ Libraries 283 10.1 Introduction and Objectives 283 10.2 Overview of New Features 283 10.3 C++ std::bitset and Boost Dynamic Bitset Library 284 10.4 Chrono Library 288 10.5 Boost Date and Time 301 10.6 Forwards Lists and Compile-Time Arrays 306 10.7 Applications of Boost.Array 311 10.8 Boost uBLAS (Matrix Library) 313 10.9 Vectors 316 10.10 Matrices 318 10.11 Applying uBLAS: Solving Linear Systems of Equations 322 10.12 Summary and Conclusions 330 10.13 Exercises and Projects 331 CHAPTER 11 Lattice Models Fundamental Data Structures and Algorithms 333 11.1 Introduction and Objectives 333 11.2 Background and Current Approaches to Lattice Modelling 334 11.3 New Requirements and Use Cases 335 11.4 A New Design Approach: A Layered Approach 335 11.5 Initial ‘101’ Examples of Option Pricing 347 11.6 Advantages of Software Layering 349 11.7 Improving Efficiency and Reliability 352 11.8 Merging Lattices 355 11.9 Summary and Conclusions 357 11.10 Exercises and Projects 357 CHAPTER 12 Lattice Models Applications to Computational Finance 367 12.1 Introduction and Objectives 367 12.2 Stress Testing the Lattice Data Structures 368 12.3 Option Pricing Using Bernoulli Paths 372 12.4 Binomial Model for Assets with Dividends 374 12.5 Computing Option Sensitivities 377 12.6 (Quick) Numerical Analysis of the Binomial Method 379 12.7 Richardson Extrapolation with Binomial Lattices 382 12.8 Two-Dimensional Binomial Method 382 12.9 Trinomial Model of the Asset Price 384 12.10 Stability and Convergence of the Trinomial Method 385 12.11 Explicit Finite Difference Method 386 12.12 Summary and Conclusions 389 12.13 Exercises and Projects 389 CHAPTER 13 Numerical Linear Algebra: Tridiagonal Systems and Applications 395 13.1 Introduction and Objectives 395 13.2 Solving Tridiagonal Matrix Systems 395 13.3 The Crank-Nicolson and Theta Methods 406 13.4 The ADE Method for the Impatient 411 13.5 Cubic Spline Interpolation 415 13.6 Some Handy Utilities 427 13.7 Summary and Conclusions 428 13.8 Exercises and Projects 429 CHAPTER 14 Data Visualisation in Excel 433 14.1 Introduction and Objectives 433 14.2 The Structure of Excel-Related Objects 433 14.3 Sanity Check: Is the Excel Infrastructure Up and Running? 435 14.4 ExcelDriver and Matrices 437 14.5 ExcelDriver and Vectors 444 14.6 Path Generation for Stochastic Differential Equations 448 14.7 Summary and Conclusions 459 14.8 Exercises and Projects 459 14.9 Appendix: COM Architecture Overview 463 14.10 An Example 468 14.11 Virtual Function Tables 471 14.12 Differences between COM and Object-Oriented Paradigm 473 14.13 Initialising the COM Library 474 CHAPTER 15 Univariate Statistical Distributions 475 15.1 Introduction, Goals and Objectives 475 15.2 The Error Function and Its Universality 475 15.3 One-Factor Plain Options 478 15.4 Option Sensitivities and Surfaces 488 15.5 Automating Data Generation 491 15.6 Introduction to Statistical Distributions and Functions 499 15.7 Advanced Distributions 504 15.8 Summary and Conclusions 511 15.9 Exercises and Projects 511 CHAPTER 16 Bivariate Statistical Distributions and Two-Asset Option Pricing 515 16.1 Introduction and Objectives 515 16.2 Computing Integrals Using PDEs 516 16.3 The Drezner Algorithm 521 16.4 The Genz Algorithm and the West/Quantlib Implementations 521 16.5 Abramowitz and Stegun Approximation 525 16.6 Performance Testing 528 16.7 Gauss–Legendre Integration 529 16.8 Applications to Two-Asset Pricing 531 16.9 Trivariate Normal Distribution 536 16.10 Chooser Options 543 16.11 Conclusions and Summary 545 16.12 Exercises and Projects 546 CHAPTER 17 STL Algorithms in Detail 551 17.1 Introduction and Objectives 551 17.2 Binders and std::bind 554 17.3 Non-modifying Algorithms 557 17.4 Modifying Algorithms 567 17.5 Compile-Time Arrays 575 17.6 Summary and Conclusions 576 17.7 Exercises and Projects 576 17.8 Appendix: Review of STL Containers and Complexity Analysis 583 CHAPTER 18 STL Algorithms Part II 589 18.1 Introduction and Objectives 589 18.2 Mutating Algorithms 589 18.3 Numeric Algorithms 597 18.4 Sorting Algorithms 601 18.5 Sorted-Range Algorithms 604 18.5.5 Merging 608 18.6 Auxiliary Iterator Functions 609 18.7 Needle in a Haystack: Finding the Right STL Algorithm 612 18.8 Applications to Computational Finance 613 18.9 Advantages of STL Algorithms 613 18.10 Summary and Conclusions 614 18.11 Exercises and Projects 614 CHAPTER 19 An Introduction to Optimisation and the Solution of Nonlinear Equations 617 19.1 Introduction and Objectives 617 19.2 Mathematical and Numerical Background 618 19.3 Sequential Search Methods 619 19.4 Solutions of Nonlinear Equations 620 19.5 Fixed-Point Iteration 622 19.6 Aitken’s Acceleration Process 623 19.7 Software Framework 623 19.8 Implied Volatility 632 19.9 Solvers in the Boost C++ Libraries 632 19.10 Summary and Conclusions 633 19.11 Exercises and Projects 633 19.12 Appendix: The Banach Fixed-Point Theorem 636 CHAPTER 20 The Finite Difference Method for PDEs: Mathematical Background 641 20.1 Introduction and Objectives 641 20.2 General Convection–Diffusion–Reaction Equations and Black–Scholes PDE 641 20.3 PDE Preprocessing 64520.3.2 Reduction of PDE to Conservative Form 646 20.4 Maximum Principles for Parabolic PDEs 649 20.5 The Fichera Theory 650 20.6 Finite Difference Schemes: Properties and Requirements 654 20.7 Example: A Linear Two-Point Boundary Value Problem 655 20.8 Exponentially Fitted Schemes for Time-Dependent PDEs 659 20.9 Richardson Extrapolation 663 20.10 Summary and Conclusions 665 20.11 Exercises and Projects 666 CHAPTER 21 Software Framework for One-Factor Option Models 669 21.1 Introduction and Objectives 669 21.2 A Software Framework: Architecture and Context 669 21.3 Modelling PDEs and Finite Difference Schemes: What is Supported? 670 21.4 Several Versions of Alternating Direction Explicit 671 21.5 A Software Framework: Detailed Design and Implementation 673 21.6 C++ Code for PDE Classes 674 21.7 C++ Code for FDM Classes 679 21.8 Examples and Test Cases 690 21.9 Summary and Conclusions 693 21.10 Exercises and Projects 694 CHAPTER 22 Extending the Software Framework 701 22.1 Introduction and Objectives 701 22.2 Spline Interpolation of Option Values 701 22.3 Numerical Differentiation Foundations 704 22.4 Numerical Greeks 710 22.5 Constant Elasticity of Variance Model 715 22.6 Using Software Design (GOF) Patterns 715 22.7 Multiparadigm Design Patterns 720 22.8 Summary and Conclusions 721 22.9 Exercises and Projects 721 CHAPTER 23A PDE Software Framework in C++11 for a Class of Path-Dependent Options 727 23.1 Introduction and Objectives 727 23.2 Modelling PDEs and Initial Boundary Value Problems in the Functional Programming Style 728 23.3 PDE Preprocessing 731 23.4 The Anchoring PDE 732 23.5 ADE for Anchoring PDE 739 23.6 Useful Utilities 746 23.7 Accuracy and Performance 748 23.8 Summary and Conclusions 750 23.9 Exercises and Projects 751 CHAPTER 24 Ordinary Differential Equations and their Numerical Approximation 755 24.1 Introduction and Objectives 755 24.2 What is an ODE? 755 24.3 Classifying ODEs 756 24.4 A Palette of Model ODEs 757 24.5 Existence and Uniqueness Results 760 24.6 Overview of Numerical Methods for ODEs: The Big Picture 763 24.7 Creating ODE Solvers in C++ 770 24.8 Summary and Conclusions 776 24.9 Exercises and Projects 776 24.10 Appendix 778 CHAPTER 25 Advanced Ordinary Differential Equations and Method of Lines 781 25.1 Introduction and Objectives 781 25.2 An Introduction to the Boost Odeint Library 782 25.3 Systems of Stiff and Non-stiff Equations 791 25.4 Matrix Differential Equations 796 25.5 The Method of Lines: What is it and what are its Advantages? 799 25.6 Initial Foray in Computational Finance: MOL for One-Factor Black-Scholes PDE 801 25.7 Barrier Options 806 25.8 Using Exponential Fitting of Barrier Options 808 25.9 Summary and Conclusions 808 25.10 Exercises and Projects 809 CHAPTER 26 Random Number Generation and Distributions 819 26.1 Introduction and Objectives 819 26.2 What is a Random Number Generator? 820 26.3 What is a Distribution? 821 26.4 Some Initial Examples 825 26.5 Engines in Detail 827 26.6 Distributions in C++: The List 830 26.7 Back to the Future: C-Style Pseudo-Random Number Generation 831 26.8 Cryptographic Generators 833 26.9 Matrix Decomposition Methods 833 26.10 Generating Random Numbers 845 26.11 Summary and Conclusions 848 26.12 Exercises and Projects 849 CHAPTER 27 Microsoft .Net, C# and C++11 Interoperability 853 27.1 Introduction and Objectives 853 27.2 The Big Picture 854 27.3 Types 858 27.4 Memory Management 859 27.5 An Introduction to Native Classes 861 27.6 Interfaces and Abstract Classes 861 27.7 Use Case: C++/CLI as ‘Main Language’ 862 27.8 Use Case: Creating Proxies, Adapters and Wrappers for Legacy C++ Applications 864 27.8.1 Alternative: SWIG (Simplified Wrapper and Interface Generator) 871 27.9 ‘Back to the Future’ Use Case: Calling C# Code from C++11 872 27.10 Modelling Event-Driven Applications with Delegates 876 27.11 Use Case: Interfacing with Legacy Code 886 27.12 Assemblies and Namespaces for C++/CLI 889 27.13 Summary and Conclusions 895 27.14 Exercises and Projects 896 CHAPTER 28 C++ Concurrency, Part I Threads 899 28.1 Introduction and Objectives 899 28.2 Thread Fundamentals 900 28.3 Six Ways to Create a Thread 903 28.4 Intermezzo: Parallelising the Binomial Method 909 28.5 Atomics 916 28.6 Smart Pointers and the Thread-Safe Pointer Interface 924 28.7 Thread Synchronisation 926 28.8 When should we use Threads? 929 28.9 Summary and Conclusions 929 28.10 Exercises and Projects 930 CHAPTER 29 C++ Concurrency, Part II Tasks 935 29.1 Introduction and Objectives 935 29.2 Finding Concurrency: Motivation 936 29.3 Tasks and Task Decomposition 937 29.4 Futures and Promises 941 29.5 Shared Futures 945 29.6 Waiting on Tasks to Complete 948 29.7 Continuations and Futures in Boost 950 29.8 Pure Functions 952 29.9 Tasks versus Threads 953 29.10 Parallel Design Patterns 953 29.11 Summary and Conclusions 955 29.12 Quizzes, Exercises and Projects 955 CHAPTER 30 Parallel Patterns Language (PPL) 961 30.1 Introduction and Objectives 961 30.2 Parallel Algorithms 962 30.3 Partitioning Work 967 30.4 The Aggregation/Reduction Pattern in PPL 971 30.5 Concurrent Containers 977 30.6 An Introduction to the Asynchronous Agents Library and Event-Based Systems 978 30.7 A Design Plan to Implement a Framework Using Message Passing and Other Approaches 986 30.8 Summary and Conclusions 989 30.9 Exercises and Projects 990 CHAPTER 31 Monte Carlo Simulation, Part I 993 31.1 Introduction and Objectives 993 31.2 The Boost Parameters Library for the Impatient 995 31.3 Monte Carlo Version 1: The Monolith Program (‘Ball of Mud’) 1000 31.4 Policy-Based Design: Dynamic Polymorphism 1003 31.5 Policy-Based Design Approach: CRTP and Static Polymorphism 1011 31.6 Builders and their Subcontractors (Factory Method Pattern) 1013 31.7 Practical Issue: Structuring the Project Directory and File Contents 1014 31.8 Summary and Conclusions 1016 31.9 Exercises and Projects 1017 CHAPTER 32 Monte Carlo Simulation, Part II 1023 32.1 Introduction and Objectives 1023 32.2 Parallel Processing and Monte Carlo Simulation 1023 32.3 A Family of Predictor–Corrector Schemes 1033 32.4 An Example (CEV Model) 1038 32.5 Implementing the Monte Carlo Method Using the Asynchronous Agents Library 1041 32.6 Summary and Conclusions 1047 32.7 Exercises and Projects 1050 Appendix 1: Multiple-Precision Arithmetic 1053 Appendix 2: Computing Implied Volatility 1075 References 1109 Index 1117

Read more less

Book SynopsisModern Analysis of Customer Surveys: with applications using R Customer survey studies deal with customer, consumer and user satisfaction from a product or service. In practice, many of the customer surveys conducted by business and industry are analyzed in a very simple way, without using models or statistical methods. Typical reports include descriptive statistics and basic graphical displays. This book demonstrates how integrating such basic analysis with more advanced tools, provides insights into non-obvious patterns and important relationships between the survey variables. This knowledge can significantly affect the conclusions derived from a survey. Key features: Provides an integrated case studies-based approach to analysing customer survey data. Presents a general introduction to customer surveys, within an organization's business cycle. Contains classical techniques with modern and non standard tools.Table of ContentsForeword xvii Preface xix Contributors xxiii Part I Basic Aspects of Customer Satisfaction Survey Data Analysis 1 Standards and Classical Techniques in Data Analysis of Customer Satisfaction Surveys 3 Silvia Salini and Ron S. Kenett 1.1 Literature on customer satisfaction surveys 4 1.2 Customer satisfaction surveys and the business cycle 4 1.3 Standards used in the analysis of survey data 7 1.4 Measures and models of customer satisfaction 12 1.4.1 The conceptual construct 12 1.4.2 The measurement process 13 1.5 Organization of the book 15 1.6 Summary 17 References 17 2 The ABC Annual Customer Satisfaction Survey 19 Ron S. Kenett and Silvia Salini 2.1 The ABC company 19 2.2 ABC 2010 ACSS: Demographics of respondents 20 2.3 ABC 2010 ACSS: Overall satisfaction 22 2.4 ABC 2010 ACSS: Analysis of topics 24 2.5 ABC 2010 ACSS: Strengths and weaknesses and decision drivers 27 2.6 Summary 28 References 28 Appendix 29 3 Census and Sample Surveys 37 Giovanna Nicolini and Luciana Dalla Valle 3.1 Introduction 37 3.2 Types of surveys 39 3.2.1 Census and sample surveys 39 3.2.2 Sampling design 40 3.2.3 Managing a survey 40 3.2.4 Frequency of surveys 41 3.3 Non-sampling errors 41 3.3.1 Measurement error 42 3.3.2 Coverage error 42 3.3.3 Unit non-response and non-self-selection errors 43 3.3.4 Item non-response and non-self-selection error 44 3.4 Data collection methods 44 3.5 Methods to correct non-sampling errors 46 3.5.1 Methods to correct unit non-response errors 46 3.5.2 Methods to correct item non-response 49 3.6 Summary 51 References 52 4 Measurement Scales 55 Andrea Bonanomi and Gabriele Cantaluppi 4.1 Scale construction 55 4.1.1 Nominal scale 56 4.1.2 Ordinal scale 57 4.1.3 Interval scale 58 4.1.4 Ratio scale 59 4.2 Scale transformations 60 4.2.1 Scale transformations referred to single items 61 4.2.2 Scale transformations to obtain scores on a unique interval scale 66 Acknowledgements 69 References 69 5 Integrated Analysis 71 Silvia Biffignandi 5.1 Introduction 71 5.2 Information sources and related problems 73 5.2.1 Types of data sources 73 5.2.2 Advantages of using secondary source data 73 5.2.3 Problems with secondary source data 74 5.2.4 Internal sources of secondary information 75 5.3 Root cause analysis 78 5.3.1 General concepts 78 5.3.2 Methods and tools in RCA 81 5.3.3 Root cause analysis and customer satisfaction 85 5.4 Summary 87 Acknowledgement 87 References 87 6 Web Surveys 89 Roberto Furlan and Diego Martone 6.1 Introduction 89 6.2 Main types of web surveys 90 6.3 Economic benefits of web survey research 91 6.3.1 Fixed and variable costs 92 6.4 Non-economic benefits of web survey research 94 6.5 Main drawbacks of web survey research 96 6.6 Web surveys for customer and employee satisfaction projects 100 6.7 Summary 102 References 102 7 The Concept and Assessment of Customer Satisfaction 107 Irena Ograjenšek and Iddo Gal 7.1 Introduction 107 7.2 The quality–satisfaction–loyalty chain 108 7.2.1 Rationale 108 7.2.2 Definitions of customer satisfaction 108 7.2.3 From general conceptions to a measurement model of customer satisfaction 110 7.2.4 Going beyond SERVQUAL: Other dimensions of relevance to the B2B context 112 7.2.5 From customer satisfaction to customer loyalty 113 7.3 Customer satisfaction assessment: Some methodological considerations 115 7.3.1 Rationale 115 7.3.2 Think big: An assessment programme 115 7.3.3 Back to basics: Questionnaire design 116 7.3.4 Impact of questionnaire design on interpretation 118 7.3.5 Additional concerns in the B2B setting 119 7.4 The ABC ACSS questionnaire: An evaluation 119 7.4.1 Rationale 119 7.4.2 Conceptual issues 119 7.4.3 Methodological issues 120 7.4.4 Overall ABC ACSS questionnaire asssessment 121 7.5 Summary 121 References 122 Appendix 126 8 Missing Data and Imputation Methods 129 Alessandra Mattei, Fabrizia Mealli and Donald B. Rubin 8.1 Introduction 129 8.2 Missing-data patterns and missing-data mechanisms 131 8.2.1 Missing-data patterns 131 8.2.2 Missing-data mechanisms and ignorability 132 8.3 Simple approaches to the missing-data problem 134 8.3.1 Complete-case analysis 134 8.3.2 Available-case analysis 135 8.3.3 Weighting adjustment for unit nonresponse 135 8.4 Single imputation 136 8.5 Multiple imputation 138 8.5.1 Multiple-imputation inference for a scalar estimand 138 8.5.2 Proper multiple imputation 139 8.5.3 Appropriately drawing imputations with monotone missing-data patterns 140 8.5.4 Appropriately drawing imputations with nonmonotone missing-data patterns 141 8.5.5 Multiple imputation in practice 142 8.5.6 Software for multiple imputation 143 8.6 Model-based approaches to the analysis of missing data 144 8.7 Addressing missing data in the ABC annual customer satisfaction survey: An example 145 8.8 Summary 149 Acknowledgements 150 References 150 9 Outliers and Robustness for Ordinal Data 155 Marco Riani, Francesca Torti and Sergio Zani 9.1 An overview of outlier detection methods 155 9.2 An example of masking 157 9.3 Detection of outliers in ordinal variables 159 9.4 Detection of bivariate ordinal outliers 160 9.5 Detection of multivariate outliers in ordinal regression 161 9.5.1 Theory 161 9.5.2 Results from the application 163 9.6 Summary 168 References 168 Part II Modern Techniques in Customer Satisfaction Survey Data Analysis 10 Statistical Inference for Causal Effects 173 Fabrizia Mealli, Barbara Pacini and Donald B. Rubin 10.1 Introduction to the potential outcome approach to causal inference 173 10.1.1 Causal inference primitives: Units, treatments, and potential outcomes 175 10.1.2 Learning about causal effects: Multiple units and the stable unit treatment value assumption 176 10.1.3 Defining causal estimands 177 10.2 Assignment mechanisms 179 10.2.1 The criticality of the assignment mechanism 179 10.2.2 Unconfounded and strongly ignorable assignment mechanisms 180 10.2.3 Confounded and ignorable assignment mechanisms 181 10.2.4 Randomized and observational studies 181 10.3 Inference in classical randomized experiments 182 10.3.1 Fisher’s approach and extensions 183 10.3.2 Neyman’s approach to randomization-based inference 183 10.3.3 Covariates, regression models, and Bayesian model-based inference 184 10.4 Inference in observational studies 185 10.4.1 Inference in regular designs 186 10.4.2 Designing observational studies: The role of the propensity score 186 10.4.3 Estimation methods 188 10.4.4 Inference in irregular designs 188 10.4.5 Sensitivity and bounds 189 10.4.6 Broken randomized experiments as templates for the analysis of some irregular designs 189 References 190 11 Bayesian Networks Applied to Customer Surveys 193 Ron S. Kenett, Giovanni Perruca and Silvia Salini 11.1 Introduction to Bayesian networks 193 11.2 The Bayesian network model in practice 197 11.2.1 Bayesian network analysis of the ABC 2010 ACSS 197 11.2.2 Transport data analysis 201 11.2.3 R packages and other software programs used for studying BNs 210 11.3 Prediction and explanation 211 11.4 Summary 213 References 213 12 Log-linear Model Methods 217 Stephen E. Fienberg and Daniel Manrique-Vallier 12.1 Introduction 217 12.2 Overview of log-linear models and methods 218 12.2.1 Two-way tables 218 12.2.2 Hierarchical log-linear models 220 12.2.3 Model search and selection 222 12.2.4 Sparseness in contingency tables and its implications 223 12.2.5 Computer programs for log-linear model analysis 223 12.3 Application to ABC survey data 224 12.4 Summary 227 References 228 13 CUB Models: Statistical Methods and Empirical Evidence 231 Maria Iannario and Domenico Piccolo 13.1 Introduction 231 13.2 Logical foundations and psychological motivations 233 13.3 A class of models for ordinal data 233 13.4 Main inferential issues 236 13.5 Specification of CUB models with subjects’ covariates 238 13.6 Interpreting the role of covariates 240 13.7 A more general sampling framework 241 13.7.1 Objects’ covariates 241 13.7.2 Contextual covariates 243 13.8 Applications of CUB models 244 13.8.1 Models for the ABC annual customer satisfaction survey 245 13.8.2 Students’ satisfaction with a university orientation service 246 13.9 Further generalizations 248 13.10 Concluding remarks 251 Acknowledgements 251 References 251 Appendix 255 A program in R for CUB models 255 A.1 Main structure of the program 255 A.2 Inference on CUB models 255 A.3 Output of CUB models estimation program 256 A.4 Visualization of several CUB models in the parameter space 257 A.5 Inference on CUB models in a multi-object framework 257 A.6 Advanced software support for CUB models 258 14 The Rasch Model 259 Francesca De Battisti, Giovanna Nicolini and Silvia Salini 14.1 An overview of the Rasch model 259 14.1.1 The origins and the properties of the model 259 14.1.2 Rasch model for hierarchical and longitudinal data 263 14.1.3 Rasch model applications in customer satisfaction surveys 265 14.2 The Rasch model in practice 267 14.2.1 Single model 267 14.2.2 Overall model 268 14.2.3 Dimension model 272 14.3 Rasch model software 277 14.4 Summary 278 References 279 15 Tree-based Methods and Decision Trees 283 Giuliano Galimberti and Gabriele Soffritti 15.1 An overview of tree-based methods and decision trees 283 15.1.1 The origins of tree-based methods 283 15.1.2 Tree graphs, tree-based methods and decision trees 284 15.1.3 CART 287 15.1.4 CHAID 293 15.1.5 PARTY 295 15.1.6 A comparison of CART, CHAID and PARTY 297 15.1.7 Missing values 297 15.1.8 Tree-based methods for applications in customer satisfaction surveys 298 15.2 Tree-based methods and decision trees in practice 300 15.2.1 ABC ACSS data analysis with tree-based methods 300 15.2.2 Packages and software implementing tree-based methods 303 15.3 Further developments 304 References 304 16 PLS Models 309 Giuseppe Boari and Gabriele Cantaluppi 16.1 Introduction 309 16.2 The general formulation of a structural equation model 310 16.2.1 The inner model 310 16.2.2 The outer model 312 16.3 The PLS algorithm 313 16.4 Statistical interpretation of PLS 319 16.5 Geometrical interpretation of PLS 320 16.6 Comparison of the properties of PLS and LISREL procedures 321 16.7 Available software for PLS estimation 323 16.8 Application to real data: Customer satisfaction analysis 323 References 329 17 Nonlinear Principal Component Analysis 333 Pier Alda Ferrari and Alessandro Barbiero 17.1 Introduction 333 17.2 Homogeneity analysis and nonlinear principal component analysis 334 17.2.1 Homogeneity analysis 334 17.2.2 Nonlinear principal component analysis 336 17.3 Analysis of customer satisfaction 338 17.3.1 The setting up of indicator 338 17.3.2 Additional analysis 340 17.4 Dealing with missing data 340 17.5 Nonlinear principal component analysis versus two competitors 343 17.6 Application to the ABC ACSS data 344 17.6.1 Data preparation 344 17.6.2 The homals package 345 17.6.3 Analysis on the ‘complete subset’ 346 17.6.4 Comparison of NLPCA with PCA and Rasch analysis 350 17.6.5 Analysis of ‘entire data set’ for the comparison of missing data treatments 352 17.7 Summary 355 References 355 18 Multidimensional Scaling 357 Nadia Solaro 18.1 An overview of multidimensional scaling techniques 357 18.1.1 The origins of MDS models 358 18.1.2 MDS input data 359 18.1.3 MDS models 362 18.1.4 Assessing the goodness of MDS solutions 369 18.1.5 Comparing two MDS solutions: Procrustes analysis 371 18.1.6 Robustness issues in the MDS framework 371 18.1.7 Handling missing values in MDS framework 373 18.1.8 MDS applications in customer satisfaction surveys 373 18.2 Multidimensional scaling in practice 374 18.2.1 Data sets analysed 375 18.2.2 MDS analyses of overall satisfaction with a set of ABC features: The complete data set 375 18.2.3 Weighting objects or items 381 18.2.4 Robustness analysis with the forward search 382 18.2.5 MDS analyses of overall satisfaction with a set of ABC features: The incomplete data set 383 18.2.6 Package and software for MDS methods 384 18.3 Multidimensional scaling in a future perspective 386 18.4 Summary 386 References 387 19 Multilevel Models for Ordinal Data 391 Leonardo Grilli and Carla Rampichini 19.1 Ordinal variables 391 19.2 Standard models for ordinal data 393 19.2.1 Cumulative models 394 19.2.2 Other models 395 19.3 Multilevel models for ordinal data 395 19.3.1 Representation as an underlying linear model with thresholds 396 19.3.2 Marginal versus conditional effects 397 19.3.3 Summarizing the cluster-level unobserved heterogeneity 397 19.3.4 Consequences of adding a covariate 398 19.3.5 Predicted probabilities 399 19.3.6 Cluster-level covariates and contextual effects 399 19.3.7 Estimation of model parameters 400 19.3.8 Inference on model parameters 401 19.3.9 Prediction of random effects 402 19.3.10 Software 403 19.4 Multilevel models for ordinal data in practice: An application to student ratings 404 References 408 20 Quality Standards and Control Charts Applied to Customer Surveys 413 Ron S. Kenett, Laura Deldossi and Diego Zappa 20.1 Quality standards and customer satisfaction 413 20.2 ISO 10004 guidelines for monitoring and measuring customer satisfaction 414 20.3 Control Charts and ISO 7870 417 20.4 Control charts and customer surveys: Standard assumptions 420 20.4.1 Introduction 420 20.4.2 Standard control charts 420 20.5 Control charts and customer surveys: Non-standard methods 426 20.5.1 Weights on counts: Another application of the c chart 426 20.5.2 The χ2 chart 427 20.5.3 Sequential probability ratio tests 428 20.5.4 Control chart over items: A non-standard application of SPC methods 429 20.5.5 Bayesian control chart for attributes: A modern application of SPC methods 432 20.5.6 Control chart for correlated Poisson counts: When things become fairly complicated 433 20.6 The M-test for assessing sample representation 433 20.7 Summary 435 References 436 21 Fuzzy Methods and Satisfaction Indices 439 Sergio Zani, Maria Adele Milioli and Isabella Morlini 21.1 Introduction 439 21.2 Basic definitions and operations 440 21.3 Fuzzy numbers 441 21.4 A criterion for fuzzy transformation of variables 443 21.5 Aggregation and weighting of variables 445 21.6 Application to the ABC customer satisfaction survey data 446 21.6.1 The input matrices 446 21.6.2 Main results 448 21.7 Summary 453 References 455 Appendix an Introduction to R 457 Stefano Maria Iacus A.1 Introduction 457 A.2 How to obtain R 457 A.3 Type rather than ‘point and click’ 458 A.3.1 The workspace 458 A.3.2 Graphics 458 A.3.3 Getting help 459 A.3.4 Installing packages 459 A.4 Objects 460 A.4.1 Assignments 460 A.4.2 Basic object types 462 A.4.3 Accessing objects and subsetting 466 A.4.4 Coercion between data types 469 A.5 S4 objects 470 A.6 Functions 472 A.7 Vectorization 473 A.8 Importing data from different sources 475 A.9 Interacting with databases 476 A.10 Simple graphics manipulation 477 A.11 Basic analysis of the ABC data 481 A.12 About this document 496 A.13 Bibliographical notes 496 References 496 Index 499

Read more less

Book Synopsis*Trade Review"I highly recommend the essential and idea filled book Connected Services: A Guide to the Internet Technologies Shaping the Future of Mobile Services and Operators by Paul Golding, to anyone in any internet, telco, business, policy making, or technology related field who seeks a clearer understanding of the rapidly changing technologies affecting the overall information and communications landscape. This book explains in detail how the underlying technologies, that drive connected services, really work in a format that is understandable and applicable for anyone with a basic knowledge of technology." (Blog Business World, 4 November 2011)Table of ContentsForeword xv Preface xvii 1 Connected Services: The Collision of Internet with Telco 1 1.1 Connected What? 1 1.2 Ubiquity: IP Everywhere or Software Everyware? 5 1.3 Six Models for Potential Operator Futures 6 1.3.1 Access Provider 7 1.3.2 Connected Services Platform 7 1.3.3 Distribution Channel 8 1.3.4 Seamless Services Provider 9 1.3.5 Financial Merchant 10 1.3.6 Social Telco 10 1.3.7 Start Thinking Platforms 12 1.3.8 Execution 14 1.4 “Follow Me” Web – Social Networks and Social Software 14 1.5 What are Platforms and Why are They Important? 18 1.5.1 Platform Patterns for Telcos 23 1.5.2 Marketplace and Service Platforms 24 1.5.3 Data and Mash-Up Platforms 26 1.5.4 Platform as a Service 28 1.5.5 Do Platforms Work? 30 1.6 From Platforms to Ecosystems 31 1.7 Where’s the Value? 32 1.8 What Should We Build? It’s Still About the Experience! 33 1.9 Summary 36 2 The Web 2.0 Services Ecosystem, How ItWorks and Why 37 2.1 Introduction 37 2.2 Beneath the Hood of Web 2.0: CRUD, MVC and REST 38 2.3 LAMP and Beyond: Web Frameworks and Middleware 45 2.3.1 Introducing LAMP 45 2.3.2 Web Frameworks 47 2.3.3 Agile – Coding at the Speed of Thought 50 2.3.4 Summary – “Why Frameworks Work” 52 2.4 Open by Default: Open Source, Open APIs and Open Innovation 52 2.4.1 The Different Types of Open 52 2.4.2 Open, Open, Open! 56 2.4.3 Summary (“Why Open Works . . .”) 58 2.5 One App Fits All? HTML5 and the Modern Browser 58 2.5.1 Summary (“Why the Browser Works”) 62 2.6 It’s all About People: Social Computing 62 2.6.1 Exploiting Relationships – The Social Graph 62 2.6.2 Exploiting Interests – Context Awareness 63 2.6.3 Portable Data 64 2.6.4 Mobile is THE Social Device 67 2.6.5 Summary (“Why Social Computing Works”) 67 2.7 User Participation, Co-Creation and Analytics 67 2.7.1 User Participation 67 2.7.2 Co-Creation 68 2.7.3 Analytics 68 2.7.4 Summary (“Why User-Voice Works”) 69 2.8 Standing on the Shoulders of Giants: APIs and Mash-Ups 69 2.8.1 Summary (“Why Mash-Ups Work”) 71 2.9 Mobile 2.0 – It’s Really a Developer Thing! 71 2.9.1 Mobile 2.0 71 2.9.2 Mobile as THE Platform (Again) 72 3 The Web Operating System – The Future (Mobile) Services Platform 75 3.1 Why is the Concept of a Web OS Important? 75 3.1.1 Summary 81 3.2 Internet of Things 81 3.2.1 Summary 84 3.3 Making Sense of Data 85 3.3.1 Data Semantics 85 3.3.2 Data Relationships 87 3.3.3 Meta-Data Tools: Ontologies, OWL, RDF 89 3.3.4 Meta-Data Tools: Tagging and Folksonomies 91 3.3.5 RDFa – Embedding Meta-Data Within Web Pages 93 3.3.6 Meta-Data Tools: Twitter and Annotations “Twannotations” 94 3.3.7 Summary 98 3.4 Future Web: “People OS?” 98 3.4.1 Introduction 98 3.4.2 Social Networks 100 3.4.3 Social APIs and Platform Thinking (Again) 103 3.4.4 Open Social API – A Cross-Platform People OS? 104 3.4.5 Open Social API – The Mechanics 105 3.4.6 Emergence of a Person OS at the UI layer 108 3.4.7 Privacy and Personas 110 3.5 Social Telcos and the Web OS 110 3.5.1 Where are the Telcos? 110 3.5.2 Telco Social Graph and APIs 111 3.5.3 Identity and Security 114 4 Big Data and Real-Time Web 115 4.1 What is Big Data and Where Did it Come From? 115 4.1.1 In Search of the New Big Data 115 4.1.2 The Business of Big Data 116 4.1.3 Welcome to the Age of Big Data 120 4.2 Some Key Examples of Big Data 121 4.2.1 Statistics Collection at Facebook 121 4.2.2 Real-Time e-Commerce at Amazon with Dynamo 123 4.2.3 Amazon’s Dynamo Features 127 4.3 Say Hello to the Data Geeks 128 4.4 “No SQL” and Some of its Flavours 130 4.4.1 No SQL Means No SQL, But not Much Else 130 4.4.2 Key-Value Stores 132 4.4.3 Document Stores 133 4.4.4 Graph Stores 134 5 Real-Time and Right-TimeWeb 137 5.1 Real-Time Web and Twitter 137 5.1.1 Web Becomes Real-Time Thanks to Twitter 137 5.1.2 Web Infrastructure Goes Real-Time 142 5.1.3 The Real-Time Nature of Mobile 149 5.2 Big Data + Real-Time = Right-Time Web 152 5.2.1 New Buzzword: Right-Time Web 152 5.2.2 Key Components of Right-Time Web 153 6 Modern Device Platforms 159 6.1 Mobile Devices or Connected Devices? 160 6.1.1 What is a Mobile Platform? 160 6.1.2 Developer Mindset About Mobile Platforms 162 6.1.3 Mobile Device or Connected Device? 164 6.2 Introduction to Mobile Device Platforms 166 6.2.1 Platforms of Interest 166 6.2.2 Brief Explanation of an Operating System and SDK 167 6.3 The iOS Platform 170 6.3.1 Mac OS X and Unix – The Foundation for iOS 171 6.3.2 The Mechanics of iOS 172 6.3.3 iOS – What Makes the Platform Tick 176 6.3.4 How Open is iOS? 177 6.4 The Android Platform 178 6.4.1 Introduction 178 6.4.2 Architecture 179 6.4.3 Linux Kernel 179 6.4.4 Android Runtime 180 6.4.5 Android Application Framework 181 6.4.6 Android System Libraries 181 6.4.7 Android – What Makes the Platform Tick 182 6.4.8 How Open is Android? 183 6.5 The Mobile Web Platform 184 6.5.1 Introduction 184 6.5.2 Native versus Web “Debate” 184 6.5.3 Is Native versus Web the Right Question? 186 6.5.4 Major Trends in Mobile Web 190 6.5.5 HTML5 193 6.5.6 Widgets 200 6.5.7 Is That a Phone in My Browser? 207 6.5.8 Mobile Web First? 207 7 Augmented Web 209 7.1 Real or Virtual Worlds? 210 7.1.1 Introduction 210 7.1.2 Augmented Reality 210 7.1.3 Proof-of-Presence or “check-in” Services 215 7.1.4 Summary – Virtual is Just Another Layer in the Web OS 215 7.2 Sensor-Net: Mobiles as Sixth-Sense Devices 216 7.2.1 Current Sensor Applications in Smartphones 217 7.2.2 Emergent and Future Sensor Applications in Smartphones 220 7.2.3 Sensor Net – Is This Web 3.0? 227 8 Cloud Computing, Saas and PaaS 229 8.1 What is Cloud Computing? 230 8.1.1 More Than Just a Fluffy Phrase 230 8.1.2 Open and Commodity: Key Enablers for Cloud Computing 231 8.1.3 Public or Private Cloud? 233 8.1.4 Key Use Cases 234 8.2 On-Demand: Cloud Computing Infrastructure 236 8.2.1 The Infrastructure Level: Servers, Images and Templates 236 8.2.2 The Service Level: Storage, Queues, Load-Balancers . . . 239 8.3 On-Demand: Software as a Service 242 8.3.1 Opening SaaS with APIs 243 8.3.2 Using SaaS for an Ecosystem Strategy 244 8.3.3 Opportunities for Telcos 245 8.4 On-Demand: Platform as a Service 247 8.4.1 Business PaaS – Force.com 248 8.4.2 Telco 2.0 PaaS – Tropo.com 251 8.4.3 Web 2.0 PaaS – Heroku.com 255 9 Operator Platform: Network as a Service 265 9.1 Opportunity? Network as a Service 266 9.1.1 What is Network as a Service (NaaS)? 266 9.1.2 Characteristics of NaaS APIs 266 9.1.3 Opportunity? 267 9.1.4 The “Customers” are Developers, not the Users! 268 9.1.5 Who are Developers? 268 9.1.6 Ingredients for NaaS Success – What do Developers Want? 270 9.2 Examples of NaaS Connected Services 279 9.2.1 NaaS Case Study – O2 Litmus 279 9.2.2 Update to O2 Litmus Story – BlueVia 281 9.2.3 OneAPI – The Interoperable NaaS Play 282 9.2.4 Hashblue Case Study? – RT# and SMSOwl 283 9.2.5 The #Blue Hacks 284 9.2.6 The Benefits of #Blue Platform 286 10 Harnessing Web 2.0 Start-Up Methods for Telcos 289 10.1 Start-Ups and Innovation 289 10.2 What can Telcos Learn from Web 2.0? 290 10.3 Key Web Start-Up Memes 291 10.4 Tech People 293 10.5 Lean Start-Up Methodologies 294 10.6 Extreme and Constant Optimization 297 10.6.1 Ship Often 297 10.6.2 Always Experiment 298 10.6.3 Experiment Driven Development (EDD) 301 10.6.4 The Metrics Mantra – Startup Metrics for Pirates: AARRR! 303 10.7 Co-Creation and Crowdsourcing 304 10.8 Exploiting Big-Data 307 10.9 Social Discovery 310 10.10 APIs and Developers 311 10.11 Incubation and Acceleration 312 10.12 Hack Days, Events and Barcamps 313 10.12.1 Hack Days 314 10.12.2 Barcamps 315 Index 319

Read more less

Book SynopsisConcise Encyclopaedia of Bioinformatics and Computational Biology, 2nd Edition is a fully revised and updated version of this acclaimed resource. The book provides definitions and often explanations of over 1000 words, phrases and concepts relating to this fast-moving and exciting field, offering a convenient, one-stop summary of the core knowledge in the area. This second edition is an invaluable resource for students, researchers and academics.Trade Review“This book is an invaluable resource for students, researchers, and academics. Summing Up: Highly recommended. Upper-division undergraduates through professionals/practitioners.” (Choice, 1 September 2014) Table of ContentsList of Contributors ix Preface xiii Entries A to Z 1 Author Index 791 Colour plate section facing p 210

Read more less

Book SynopsisConcise Encyclopaedia of Bioinformatics and Computational Biology, 2nd Edition is a fully revised and updated version of this acclaimed resource. The book provides definitions and often explanations of over 1000 words, phrases and concepts relating to this fast-moving and exciting field, offering a convenient, one-stop summary of the core knowledge in the area. This second edition is an invaluable resource for students, researchers and academics.Trade Review“This book is an invaluable resource for students, researchers, and academics. Summing Up: Highly recommended. Upper-division undergraduates through professionals/practitioners.” (Choice, 1 September 2014) Table of ContentsList of Contributors ix Preface xiii Entries A to Z 1 Author Index 791 Colour plate section facing p 210

Read more less

Book SynopsisFacilitating Cooperation for Wireless Systems Cooperative Communications: Hardware, Channel & PHY focuses on issues pertaining to the PHY layer of wireless communication networks, offering a rigorous taxonomy of this dispersed field, along with a range of application scenarios for cooperative and distributed schemes, demonstrating how these techniques can be employed. The authors discuss hardware, complexity and power consumption issues, which are vital for understanding what can be realized at the PHY layer, showing how wireless channel models differ from more traditional models, and highlighting the reliance of PHY algorithm performance on the underlying channel models. Numerous transparent and regenerative relaying protocols are described in detail for a variety of transparent and regenerative cooperative schemes. Key Features: Introduces background, concepts, applications, milestones and thorough taxonomy ITable of ContentsPreface. Abbreviations. Functions. Symbols. 1 Introduction. 1.1 Book Structure. 1.2 Quick Introduction. 1.3 Application Scenarios. 1.4 Pros and Cons of Cooperation. 1.5 Cooperative Performance Bounds. 1.6 Definitions and Terminology. 1.7 Background and Milestones. 1.8 Concluding Remarks. 2 Wireless Relay Channel. 2.1 Introductory Note. 2.2 General Characteristics and Trends. 2.3 Regenerative Relaying Channel. 2.4 Transparent Relaying Channel. 2.5 Distributed MIMO Channel. 2.6 Concluding Remarks. 3 Transparent Relaying Techniques. 3.1 Introductory Note. 3.2 Transparent Relaying Protocols. 3.3 Transparent Space–Time Processing. 3.4 Distributed System Optimization. 3.5 Concluding Remarks. 4 Regenerative Relaying Techniques. 4.1 Introductory Note. 4.2 Regenerative Relay Protocols. 4.3 Distributed Space–Time Coding. 4.4 Distributed Network Coding. 4.5 Concluding Remarks. 5 Hardware Issues. 5.1 Introductory Note. 5.2 Analog Hardware Transceivers. 5.3 Digital Hardware Transceivers. 5.4 Architectural Comparisons. 5.5 Complexity of 3G UMTS Voice/HSDPA Relay. 5.6 Complexity of LTE/WiMAX Relay. 5.7 Hardware Demonstrators. 5.8 Concluding Remarks. 6 Conclusions and Outlook. 6.1 Contributions. 6.2 Real-World Impairments. 6.3 Open Research Problems. 6.4 Business Challenges. References. Index.

Read more less

Book SynopsisWithin the set of many identifier-locator separation designs for the Internet, HIP has progressed further than anything else we have so far. It is time to see what HIP can do in larger scale in the real world. In order to make that happen, the world needs a HIP book, and now we have it. - Jari Arkko, Internet Area Director, IETF One of the challenges facing the current Internet architecture is the incorporation of mobile and multi-homed terminals (hosts), and an overall lack of protection against Denial-of-Service attacks and identity spoofing. The Host Identity Protocol (HIP) is being developed by the Internet Engineering Task Force (IETF) as an integrated solution to these problems. The book presents a well-structured, readable and compact overview of the core protocol with relevant extensions to the Internet architecture and infrastructure. The covered topics include the Bound End-to-End Tunnel Mode for IPsec, Overlay Routable Cryptographic Hash Identifiers, extensTrade Review"I recommend this book to all software writers and engineers who are working in the context of mobile IP, IPv6, and the future internet. Graduate and advanced undergraduate students who are interested in discovering a practical and challenging application of identity management models and cryptographic protocols will also benefit from this book." (Computing Reviews, May 5, 2009)Table of ContentsAbout the Author. Foreword. (Jari Arkko) Foreword. (David Hutchison) Preface. Acknowledgments. Abbreviations. Part I Introduction. Chapter 1: Overview. 1.1 Identifierâ??locatorsplit. 1.2 HIPin the Internetarchitecture. 1.3 BriefhistoryofHIP. 1.4 Organization of the book. Chapter 2: Introduction to network security. 2.1 Goalsof cryptographicprotocols. 2.2 Basics andterminology. 2.3 Attacktypes. 2.4 Defensemechanisms. 2.5 Securityprotocols. 2.6 Weakauthenticationtechniques. 2.7 SecureDNS. Part II The Host Identity Protocol. Chapter 3: Architectural overview. 3.1 Internet namespaces. 3.2 Methods of identifying a host. 3.3 OverlayRoutableCryptographicHashIdentifiers. Chapter 4: Baseprotocol. 4.1 Base exchange. 4.2 OtherHIPcontrolpackets. 4.3 IPsec encapsulation. Chapter 5: Main extensions. 5.1 Mobility and multihoming. 5.2 Rendezvous server. 5.3 DNSextensions. 5.4 Registrationprotocol. Chapter 6: Advanced extensions. 6.1 Opportunistic mode. 6.2 Piggybacking transport headers to base exchange. 6.3 HIPservicediscovery. 6.4 Simultaneous multiaccess. 6.5 DisseminatingHITswitha presenceservice. 6.6 Multicast. Chapter 7: Performance measurements. 7.1 HIPonNokia InternetTablet. 7.2 Experimental results. 7.3 Summary. Chapter 8: Lightweight HIP. 8.1 Security functionality of HIP. 8.2 HIPhigh-levelgoals. 8.3 LHIPdesign. 8.4 LHIPperformance. 8.5 Discussion. Part III Infrastructure Support. Chapter 9: Middlebox traversal. 9.1 Requirements for traversinglegacymiddleboxes. 9.2 LegacyNATtraversal. 9.3 Requirements forHIP-awaremiddleboxes. 9.4 HIP-awarefirewall. Chapter 10: Name resolution. 10.1 Problemstatementofnaming. 10.2 DistributedHashTables. 10.3 HIPinterface toOpenDHT. 10.4 Overviewofoverlaynetworks. 10.5 Host Identity Indirection Infrastructure. 10.5.1 Separatingcontrol,data, andnaming. 10.5.2 Thedata plane. 10.5.3 Thecontrolplane. 10.5.4 Discussionof theHi3design. Chapter 11: Micromobility. 11.1 Local rendezvousservers. 11.2 Secure micromobility. 11.3 Network mobility. Chapter 12: Communication privacy. 12.1 SPINAT. 12.2 BLIND. 12.3 Anonymousidentifiers. Part IV Applications. Chapter 13: Possible HIP applications. 13.1 VirtualPrivateNetworking. 13.2 P2PInternetSharingArchitecture. 13.3 InteroperatingIPv4andIPv6. 13.4 SecureMobileArchitecture. 13.5 Liveapplicationmigration. 13.6 NetworkoperatorviewpointonHIP. Chapter 14: Application interface. 14.1 UsinglegacyapplicationswithHIP. 14.2 API fornativeHIPapplications. Chapter 15: Integrating HIP with other protocols. 15.1 GeneralizedHIP. 15.2 The use of Session Initiation Protocol. 15.3 EncapsulatingHIPdatausingSRTP. 15.4 ReplacingHIPbase exchangewithIKEv2. 15.5 MobileIPandHIP. 15.6 HIPproxyfor legacyhosts. Installing and using HIP. Bibliography. Index.

Read more less

Book SynopsisClick here to read ACCU''s review of this book.This text is an indispensable collection of four tutorials covering concepts in modern engineering computations, and engineering programming in ANSI C, MATLAB Version 5 and Java 1.1.Table of ContentsCONCEPTS IN MODERN ENGINEERING COMPUTATIONS. Introduction to Engineering Computations. Principles of Engineering Software Development. C PROGRAMMING TUTORIAL. Getting Started. Basic Data Types and Variables. Operators and Expressions. Control of Flow. Functions I. Arrays and Pointers. Functions II. Dynamic Allocation of Memory. The C Preprocessor. Input and Output. MATLAB PROGRAMMING TUTORIAL. Introduction to MATLAB. MATLAB Graphics. Solution of Linear Matrix Equations. JAVA PROGRAMMING TUTORIAL. Introduction to Java. Object-Oriented Program Design. The Java Language. Java Graphics. Appendices. References. Index.

Read more less

Book SynopsisThe book is the complete introduction and applications guide to this new technology. This book introduces the reader to features and gives an overview of geometric modeling techniques, discusses the conceptual development of features as modeling entities, illustrates the use of features for a variety of engineering design applications, and develops a set of broad functional requirements and addresses high level design issues.Table of ContentsBACKGROUND. Geometric Modeling. FUNDAMENTALS. Feature Concepts. Feature Creation Techniques. APPLICATION OF FEATURES. Features in Design. Features in Manufacturing. Feature Mapping and Data Exchange. DESIGN AND IMPLEMENTATION. Design-by-Features Techniques. Feature Recognition Techniques. Implementation Tools. Feature-Based Process Planning. BEYOND FEATURES. Future CAD/CAM Technologies. Appendices. Index.

Read more less

Book SynopsisThe effective design of high-speed, reliable switching systems is essential for moving the huge volumes of traffic and multimedia over modern communications networks. This book explains all the main packet-switching architectures, including all theoretical and practical topics relevant to the design and management of high-speed networks. Delivering the most systematic coverage available of the subject, the authors interweave fundamental concepts with real-world applications and include engineering case studies from wireless and fiber-optic communications. Market: Hardware and Software Engineers in the telecommunication industry, System Engineers, and Technicians.Trade Review"...addresses the basics, theory, architectures, and technologies for implementing ATM switches and IP routers." (SciTech Book News, Vol. 26, No. 2, June 2002) "...a remarkable overview of switching architectures and techniques in different technological environments..." (IEEE Communications Magazine, September 2002)Table of ContentsPreface. Introduction. Basics of Packet Switching. Input-Buffered Switches. Shared-Memory Switches. Banyan-Based Switches. Knockout-Based Switches. The Abacus Switch. Crosspoint-Buffered Switches. The Tandem-Crosspoint Switch. Clos-Network Switches. Optical Packet Switches. Wireless ATM Switches. IP Route Lookups. Appendix: SONET and ATM Protocols. Index.

Read more less

Book SynopsisThis book is devoted to the statistical theory of learning and generalization, that is, the problem of choosing the desired function on the basis of empirical data. The author will present the whole picture of learning and generalization theory. Learning theory has applications in many fields, such as psychology, education and computer science.Table of ContentsPreface xxi Introduction: The Problem of induction and Statistical inference 1 I Theory of learning and generation 1 Two Approches to the learnig problem 19 Appendix to chapter 1: Methods for solving III-posed problems 51 2 Estimation of the probability Measure and problem of learning 59 3 Conditions for Consistency of Empirical Risk Minimization Principal 79 4 Bounds on the Risk for indicator Loss Functions 121 Appendix to Chapter 4: Lower Bounds on the Risk of the ERM Principle 169 5 Bounds on the Risk for Real-valued loss functions 183 6 The structural Risk Minimization Principle 219 Appendix to chapter 6: Estimating Functions on the basis of indirect measurements 271 7 stochastic III-posed problems 293 8 Estimating the values of Function at given points 339 II Support Vector Estimation of Functions 9 Perceptions and their Generalizations 375 10 The Support Vector Method for Estimating Indicator functions 401 11 The Support Vector Method for Estimating Real-Valued functions 443 12 SV Machines for pattern Recognition 493 13 SV Machines for Function Approximations, Regression Estimation, and Signal Processing 521 III Statistical Foundation of Learning Theory 14 Necessary and Sufficient Conditions for Uniform Convergence of Frequencies to their Probabilities 571 15 Necessary and Sufficient Conditions for Uniform Convergence of Means to their Expectations 597 16 Necessary and Sufficient Conditions for Uniform One-sided Convergence of Means to their Expectations 629 Comments and Bibliographical Remarks 681 References 723 Index 733

Read more less

Book SynopsisDespite our growing understanding of the properties and capabilities of nonlinear filters, there persists the belief among engineers that these filters are too complex to implement. This book debunks the myth that all nonlinear filters are complex with its coverage of the polynomial filter.Trade Review"A first-year graduate-level text that provides an overview of the state of the art in the area of nonlinear signal processing known as polynomial signal processing." (SciTech Book News Vol. 25, No. 2 June 2001) "The text is clear and easy to follow - an excellent way of getting started in this area." (Ultramicroscopy, Vol.87, 2001)Table of ContentsVolterra Series Expansions. Realization of Truncated Volterra Filters. Multidimensional Volterra Filters. Parameter Estimation. Frequency-Domain Methods for Volterra System Identification. Adaptive Truncated Volterra Filters. Recursive Polynomial Systems. Inversion and Time Series Analysis. Applications of Polynomial Filters. Some Related Topics and Recent Developments. Appendices. References. Index.

Read more less