Computing Books
John Wiley & Sons Inc Digital Media Tools
Book SynopsisDigital Media Tools is a clearly focussed introduction to the major software tools used for creating digital graphics, multimedia and Web pages. There are substantial chapters on each of the industry-leading applications such as Photoshop or Flash, plus an introductory chapter on the common interface elements. Readers will acquire a basic fluency with these important tools, learn what they do best and what their limitations are. The book is lavishly illustrated throughout, and files are provided on the supporting web site for students to work through all the major examples themselves. The approach is highly practical and founded in the authors' extensive experience with these tools, but also supported by a thorough understanding and explanation of the technical and theoretical issues underpinning their use. Digital Media Tools is designed to be the perfect practical companion text to the authors' latest course Web Design: A Complete Introduction. This edition brings this verTable of ContentsWelcome. Teaching and Learning Features. Supporting Web Site. 1 Introduction. Safe Working with Digital Media Tools. 2 Interface Basics. Platforms. Menus and Commands. File Menu. Edit Menu. Help Menu. Keyboard Shortcuts. Context Menus. Panels. Panel Groups and Docks. Workspaces. Panel Controls. Common Panels. Tools Panel. Options Bar, Control and Properties Panels. Layers Panel. Navigator Panel. History Panel. Automating Repetitive Tasks. Replaying History. Actions. Layout Aids. Rulers and Grids. Guides. 3 Bridge. The Browser Window. The Default View. Other Workspaces. Rotating. Slide Shows. Compact Mode. Stacks. Navigation and File Operations. Navigation. File and Folder Operations. Interacting with Other Programs. File Organization. Ratings, Labels and Keywords. Metadata. Filtering and Sorting. Retrieval. 4 Photoshop. Fundamentals. Opening and Importing Images. Saving and Exporting. Resolution. Modes and Colour Spaces. Creating Images. Layers. Making and Using Selections. Marquee Selection and Cropping. Lasso Selections. Selecting by Colour. Paths. Combining and Transforming Selections. Selecting and Extracting Objects. Masks. Adjustments and Retouching. Tonal Adjustments. Colour Adjustments. Retouching by Hand. Effects and Filters. Smart Filters. Blurring and Sharpening. Artistic Filters and Distortion. Layer Effects and Layer Styles. Vanishing Point. Painting Pixels. The Paintbrush and Pencil. The Brushes Panel. Selecting with Brushes. Erasing. Fills. Animation. Animated GIFs. The Animation Panel. Animating Layer Properties. 5 Illustrator. Fundamentals. Vector Graphics. Creating Documents. Technical Drawing. Stroke and Fill. Shape Tools. Freehand Drawing. Manipulating Objects. Selection. Transforming Objects. Reshaping. Appearance. Complex Fills and Strokes. Live Paint. Effects, Filters and Styles. 3D Effects. Warping. The Appearance Panel. Symbols. Symbols and Instances. Symbol Sets and the Symbolism Tools. Symbols and 3D. Bitmaps. Combining Bitmaps and Vector Art. Importing Bitmaps. Manipulating Bitmapped Images. Live Trace. Shared Features. Selection. Colour. Drawing Aids. Layers. Type. Web Graphics. 6 Flash. Basic Concepts. Documents and Movies. The Stage and the Timeline. Artwork. Drawing. Selection. Transformations and Reshaping. Graphic Symbols. Importing Artwork. Animation. Animating One Frame at a Time. Motion Tweening. Editing Animations. Animated Symbols. Shape Tweening. Sound and Video. Sound. Video. 7 Dreamweaver. Fundamentals. Web Pages and Sites. User Interface. Preferences. Formatting Web Pages. Structure and Appearance. Layout. Simple Formatting. Font Properties. Backgrounds. Links. Lists. Using CSS. Displaying and Editing Rules. Creating CSS Rules. CSS and Layout. Page Content. Images. Flash Movies and Video. Tables. Forms. JavaScript. Behaviours. The Spry Framework. Sites. Local and Remote Sites. Assets and Templates. Templates. 8 Shared Concepts. Colour. Colour Models and Modes. Picking Colours. Gradients. Typographic Controls. Entering Type. Formatting Type. Bézier Curves. Web Graphics. Web Image Files. Optimizing for the Web. Index.
£48.56
John Wiley & Sons Inc Requirements Engineering
Book SynopsisThe book presents both the current state of the art in requirements engineering and a systematic method for engineering high-quality requirements, broken down into four parts. The first part introduces fundamental concepts and principles including the aim and scope of requirements engineering, the products and processes involved, requirements qualities to aim at and flaws to avoid, and the critical role of requirements engineering in system and software engineering. The second part of the book is devoted to system modeling in the specific context of engineering requirements. It presents a multi-view modeling framework that integrates complementary techniques for modeling the system-as-is and the system-to-be. The third part of the book reviews goal-based reasoning techniques to support the various steps of the KAOS method. The fourth part of the book goes beyond requirements engineering to discuss the mapping from goal-oriented requirements to software specifications and to software architecture. Online software will accompany the book and will add value to both classroom and self-study by enabling students to build models and specifications involved in the book's exercises and case studies, helping them to discover the latest RE technology solutions. Instructor resources such as slides, figures and handouts areavailable from an accompanying website.Table of ContentsForeword xvii Preface xxi Part I Fundamentals of Requirements Engineering 1 1 Setting the Scene 3 1.1 What is requirements engineering? 3 1.1.1 The problem world and the machine solution 4 1.1.2 Introducing our running case studies 6 1.1.3 The WHY, WHAT and WHO dimensions of requirements engineering 12 1.1.4 Types of statements involved in requirements engineering 17 1.1.5 Categories of requirements 23 1.1.6 The requirements lifecycle: Processes, actors and products 30 1.1.7 Target qualities and defects to avoid 35 1.1.8 Types of software projects 40 1.1.9 Requirements in the software lifecycle 42 1.1.10 The relationship of requirements engineering to other disciplines 45 1.2 Why engineer requirements? 47 1.2.1 Facts, data and citations about the requirements problem 47 1.2.2 The role and stakes of requirements engineering 51 1.3 Obstacles to good requirements engineering practice 52 1.4 Agile development processes and requirements engineering 53 Summary 55 Notes and Further Reading 56 Exercises 58 2 Domain Understanding and Requirements Elicitation 61 2.1 Identifying stakeholders and interacting with them 62 2.2 Artefact-driven elicitation techniques 64 2.2.1 Background study 64 2.2.2 Data collection 65 2.2.3 Questionnaires 65 2.2.4 Repertory grids and card sorts for concept-driven acquisition 66 2.2.5 Storyboards and scenarios for problem world exploration 67 2.2.6 Mock-ups and prototypes for early feedback 70 2.2.7 Knowledge reuse 72 2.3 Stakeholder-driven elicitation techniques 76 2.3.1 Interviews 77 2.3.2 Observation and ethnographic studies 79 2.3.3 Group sessions 80 2.4 Conclusion 81 Summary 82 Notes and Further Reading 84 Exercises 85 3 Requirements Evaluation 87 3.1 Inconsistency management 88 3.1.1 Types of inconsistency 88 3.1.2 Handling inconsistencies 89 3.1.3 Managing conflicts: A systematic process 90 3.2 Risk analysis 93 3.2.1 Types of risk 94 3.2.2 Risk management 95 3.2.3 Risk documentation 101 3.2.4 Integrating risk management in the requirements lifecycle 102 3.3 Evaluating alternative options for decision making 105 3.4 Requirements prioritization 108 3.5 Conclusion 112 Summary 113 Notes and Further Reading 114 Exercises 116 4 Requirements Specification and Documentation 119 4.1 Free documentation in unrestricted natural language 120 4.2 Disciplined documentation in structured natural language 121 4.2.1 Local rules on writing statements 121 4.2.2 Global rules on organizing the requirements document 124 4.3 Use of diagrammatic notations 127 4.3.1 System scope: context, problem and frame diagrams 127 4.3.2 Conceptual structures: entity–relationship diagrams 130 4.3.3 Activities and data: SADT diagrams 133 4.3.4 Information flows: dataflow diagrams 134 4.3.5 System operations: use case diagrams 136 4.3.6 Interaction scenarios: event trace diagrams 136 4.3.7 System behaviours: state machine diagrams 138 4.3.8 Stimuli and responses: R-net diagrams 142 4.3.9 Integrating multiple system views and multiview specification in UML 142 4.3.10 Diagrammatic notations: Strengths and limitations 144 4.4 Formal specification 145 4.4.1 Logic as a basis for formalizing statements 146 4.4.2 History-based specification 151 4.4.3 State-based specification 155 4.4.4 Event-based specification 163 4.4.5 Algebraic specification 167 4.4.6 Other specification paradigms 172 4.4.7 Formal specification: strengths and limitations 173 4.5 Conclusion 174 Summary 176 Notes and Further Reading 179 Exercises 183 5 Requirements Quality Assurance 187 5.1 Requirements inspections and reviews 188 5.1.1 The requirements inspection process 188 5.1.2 Inspection guidelines 190 5.1.3 Requirements inspection checklists 191 5.1.4 Conclusion 195 5.2 Queries on a requirements database 196 5.3 Requirements validation by specification animation 198 5.3.1 Extracting an executable model from the specification 199 5.3.2 Simulating the model 199 5.3.3 Visualizing the simulation 200 5.3.4 Conclusion 200 5.4 Requirements verification through formal checks 202 5.4.1 Language checks 202 5.4.2 Dedicated consistency and completeness checks 203 5.4.3 Model checking 205 5.4.4 Theorem proving 208 5.5 Conclusion 211 Summary 213 Notes and Further Reading 214 Exercises 217 6 Requirements Evolution 219 6.1 The time–space dimensions of evolution: Revisions and variants 220 6.2 Change anticipation 223 6.3 Traceability management for evolution support 225 6.3.1 Traceability links 226 6.3.2 The traceability management process, its benefits and cost 233 6.3.3 Traceability management techniques 237 6.3.4 Determining an adequate cost–benefit trade-off for traceability management 244 6.4 Change control 246 6.4.1 Change initiation 247 6.4.2 Change evaluation and prioritization 248 6.4.3 Change consolidation 249 6.5 Runtime monitoring of requirements and assumptions for dynamic change 249 6.6 Conclusion 251 Summary 252 Notes and Further Reading 254 Exercises 256 7 Goal Orientation in Requirements Engineering 259 7.1 What are goals? 260 7.2 The granularity of goals and their relationship to requirements and assumptions 261 7.3 Goal types and categories 265 7.3.1 Types of goal: behavioural goals vs soft goals 265 7.3.2 Goal categories: Functional vs non-functional goals 269 7.4 The central role of goals in the requirements engineering process 272 7.5 Where are goals coming from? 275 7.6 The relationship of goals to other requirements-related products and processes 276 7.6.1 Goals and scenarios 276 7.6.2 Intentional and operational specifications 277 7.6.3 Goals and use cases 277 7.6.4 Goals and model-checked properties 277 7.6.5 Goal orientation and agent orientation 278 7.6.6 Goal orientation and object orientation 278 7.6.7 Goal orientation and top-down analysis 279 Summary 279 Notes and Further Reading 280 Exercises 283 Part II Building System Models for Requirements Engineering 287 8 Modelling System Objectives with Goal Diagrams 293 8.1 Goal features as model annotations 294 8.2 Goal refinement 297 8.3 Representing conflicts among goals 301 8.4 Connecting the goal model with other system views 302 8.5 Modelling alternative options 303 8.5.1 Alternative goal refinements 304 8.5.2 Alternative responsibility assignments 305 8.6 Goal diagrams as AND/OR graphs 307 8.7 Documenting goal refinements and assignments with annotations 308 8.8 Building goal models: Heuristic rules and reusable patterns 309 8.8.1 Eliciting preliminary goals 309 8.8.2 Identifying goals along refinement branches 311 8.8.3 Delimiting the scope of the goal model 316 8.8.4 Avoiding common pitfalls 317 8.8.5 Reusing refinement patterns 319 8.8.6 Reusing refinement trees associated with goal categories 326 Summary 328 Notes and Further Reading 329 Exercises 331 9 Anticipating What Could Go Wrong: Risk Analysis on Goal Models 335 9.1 Goal obstruction by obstacles 336 9.1.1 What are obstacles? 336 9.1.2 Completeness of a set of obstacles 337 9.1.3 Obstacle categories 338 9.2 Modelling obstacles 339 9.2.1 Obstacle diagrams 339 9.2.2 Conditions on obstacle refinement 341 9.2.3 Bottom-up propagation of obstructions in goal AND-refinements 342 9.2.4 Annotating obstacle diagrams 343 9.3 Obstacle analysis for a more robust goal model 344 9.3.1 Identifying obstacles 344 9.3.2 Evaluating obstacles 349 9.3.3 Resolving obstacles in a modified goal model 349 Summary 353 Notes and Further Reading 355 Exercises 356 10 Modelling Conceptual Objects with Class Diagrams 359 10.1 Representing domain concepts by conceptual objects 360 10.1.1 What are conceptual objects? 360 10.1.2 Object instantiation: classes and current instances 361 10.1.3 Types of conceptual object 362 10.1.4 Object models as UML class diagrams 363 10.1.5 Object features as model annotations 364 10.2 Entities 366 10.3 Associations 366 10.4 Attributes 371 10.5 Built-in associations for structuring object models 373 10.5.1 Object specialization 373 10.5.2 Object aggregation 376 10.6 More on class diagrams 377 10.6.1 Derived attributes and associations 377 10.6.2 OR-associations 378 10.6.3 Ordered associations 379 10.6.4 Associations of associations 379 10.7 Heuristic rules for building object models 380 10.7.1 Deriving pertinent and complete class diagrams from goal diagrams 380 10.7.2 Object or attribute? 384 10.7.3 Entity, association, agent or event? 384 10.7.4 Attribute of a linked object or of the linking association? 385 10.7.5 Aggregation or association? 386 10.7.6 Specializing and generalizing concepts 386 10.7.7 Avoiding common pitfalls 387 Summary 389 Notes and Further Reading 391 Exercises 392 11 Modelling System Agents and Responsibilities 395 11.1 What are agents? 396 11.2 Characterizing system agents 397 11.2.1 Basic features 397 11.2.2 Agent capabilities 397 11.2.3 Agent responsibilities and goal realizability 399 11.2.4 Agents as operation performers 401 11.2.5 Agent wishes and beliefs 402 11.2.6 Agent dependencies 403 11.3 Representing agent models 405 11.3.1 Agent diagrams and instance declarations 405 11.3.2 Context diagrams 406 11.3.3 Dependency diagrams 407 11.4 Refinement of abstract agents 408 11.5 Building agent models 411 11.5.1 Heuristics for building agent diagrams from goal models 411 11.5.2 Generating context diagrams from goal models 413 Summary 415 Notes and Further Reading 417 Exercises 418 12 Modelling System Operations 421 12.1 What are operations? 422 12.2 Characterizing system operations 425 12.2.1 Basic features 425 12.2.2 Operation signature 425 12.2.3 Domain pre- and post-conditions 426 12.2.4 Operation performer 427 12.3 Goal operationalization 427 12.3.1 Required pre-, post- and trigger conditions for goal satisfaction 427 12.3.2 Agent commitments 430 12.3.3 Goal operationalization and satisfaction arguments 432 12.4 Goals, agents, objects and operations: The semantic picture 434 12.5 Representing operation models 435 12.5.1 Operationalization diagrams 435 12.5.2 UML use case diagrams 435 12.6 Building operation models 437 12.6.1 Heuristics for building operationalization diagrams 437 12.6.2 Generating use case diagrams from operationalization diagrams 442 Summary 442 Notes and Further Reading 444 Exercises 445 13 Modelling System Behaviours 449 13.1 Modelling instance behaviours 450 13.1.1 Scenarios as UML sequence diagrams 450 13.1.2 Scenario refinement: Episodes and agent decomposition 452 13.2 Modelling class behaviours 454 13.2.1 State machines as UML state diagrams 455 13.2.2 State machine refinement: Sequential and concurrent sub-states 459 13.3 Building behaviour models 463 13.3.1 Elaborating relevant scenarios for good coverage 465 13.3.2 Decorating scenarios with state conditions 467 13.3.3 From scenarios to state machines 469 13.3.4 From scenarios to goals 473 13.3.5 From operationalized goals to state machines 475 Summary 477 Notes and Further Reading 480 Exercises 481 14 Integrating Multiple System Views 485 14.1 A meta-model for view integration 485 14.1.1 Overall structure of the meta-model 487 14.1.2 The goal meta-model 488 14.1.3 The object meta-model 489 14.1.4 The agent meta-model 490 14.1.5 The operation meta-model 491 14.1.6 The behaviour meta-model 492 14.2 Inter-view consistency rules 493 14.3 Grouping related view fragments into packages 496 Summary 498 Notes and Further Reading 498 Exercises 499 15 A Goal-Oriented Model-Building Method in Action 501 15.1 Modelling the system-as-is 503 15.1.1 Step 1: Build a preliminary goal model illustrated by scenarios 503 15.1.2 Step 2: Derive a preliminary object model 506 15.2 Modelling the system-to-be 507 15.2.1 Step 3: Update the goal model with new goals illustrated by scenarios 507 15.2.2 Step 4: Derive the updated object model 510 15.2.3 Step 5: Analyse obstacles, threats and conflicts 512 15.2.4 Step 6: Analyse responsibilities and build the agent model 515 15.2.5 Step 7: Make choices among alternative options 517 15.2.6 Step 8: Operationalize goals in the operation model 518 15.2.7 Step 9: Build and analyse the behaviour model 521 15.3 Handling model variants for product lines 524 Summary 528 Notes and Further Reading 529 Exercises 529 Part III Reasoning About System Models 535 16 Semi-Formal Reasoning for Model Analysis and Exploitation 537 16.1 Query-based analysis of the model database 538 16.1.1 Checking the structural consistency and completeness of the model 538 16.1.2 Generation of other views for dedicated analyses 540 16.1.3 Traceability management 540 16.1.4 Analogical model reuse 541 16.2 Semi-formal analysis of goal-oriented models 544 16.2.1 Conflict analysis 544 16.2.2 Heuristic identification of obstacles 549 16.2.3 Threat analysis: From goal models to anti-goal models 551 16.3 Reasoning about alternative options 557 16.3.1 Qualitative reasoning about alternatives 557 16.3.2 Quantitative reasoning about alternatives 560 16.4 Model-driven generation of the requirements document 562 16.5 Beyond RE: From goal-oriented requirements to software architecture 566 16.5.1 Deriving a software data architecture from the object model 567 16.5.2 Deriving an abstract dataflow architecture from the agent and operation models 568 16.5.3 Selecting an architectural style from architectural requirements 570 16.5.4 Architectural refinement from quality requirements 571 Summary 574 Notes and Further Reading 576 Exercises 578 17 Formal Specification of System Models 583 17.1 A real-time temporal logic for specifying model annotations 584 17.1.1 State assertions 584 17.1.2 Temporal assertions 585 17.1.3 Real-time temporal constructs 586 17.2 Specifying goals in the goal model 588 17.3 Specifying descriptive properties in the object model 592 17.4 Specifying operationalizations in the operation model 594 17.5 Back to the system’s semantic picture 596 Summary 598 Notes and Further Reading 599 Exercises 599 18 Formal Reasoning for Specification Construction and Analysis 603 18.1 Checking goal refinements 604 18.1.1 Using a theorem prover 604 18.1.2 Formal refinement patterns 604 18.1.3 Using bounded SAT solvers 608 18.2 Deriving goal operationalizations 609 18.2.1 Using bounded SAT solvers 610 18.2.2 Formal operationalization patterns 610 18.3 Generating obstacles for risk analysis 613 18.3.1 Regressing obstructions through domain properties 614 18.3.2 Using formal obstruction patterns 617 18.4 Generating anti-goals for security analysis 618 18.4.1 Specifying security goals 618 18.4.2 Identifying security goals and initial anti-goals 620 18.4.3 Refining anti-goals 621 18.5 Formal conflict analysis 622 18.5.1 Deriving boundary conditions for conflict 623 18.5.2 Formal resolution of divergences 625 18.6 Synthesizing behaviour models for animation and model checking 627 18.6.1 Goal-driven model synthesis 628 18.6.2 Scenario-driven model synthesis 628 Summary 635 Notes and Further Reading 636 Exercises 637 Bibliography 641 Index 669
£51.26
John Wiley & Sons Inc Internet Measurement
Book SynopsisThis book provides all the ingredients necessary for a full understanding of the increasingly important discipline of Internet Measurement ranging from its role in the different layers of architecture to the various applications where it plays a critical role. This book and its subject help to build foundational knowledge for other areas of internet and computing courses particularly in regard to internet security, whose subject matter depend upon information derived from this source. Students studying courses that look at web applications or P2P file-sharingapplications will find this book provides crucial information for their subject areas. The experience of the authors, who are at the heart of the Internet Measurement community, and the emerging importance of the discipline make this the authoratitive and defining book of the field.Trade Review"The book will be a valuable resource for students and researchers starting to work on internet measurements." (IEEE Network Magazine, May/June 2007)Table of ContentsAcknowledgments xxi I Background 1 1 Introduction 3 1.1 Why Measure the Internet? 5 1.2 How to Read this Book 6 1.3 Resources for More Information 10 2 Internet Architecture 13 2.1 The Internet’s Architecture 13 2.1.1 The History of the Internet 14 2.1.2 The Organization of the Internet 17 2.1.3 Design Principles of the Internet 22 2.2 Details of Internet Operation 25 2.2.1 Endsystems, Links, and Routers 25 2.2.2 Autonomous Systems 26 2.2.3 Routing 26 2.3 Protocols 31 2.3.1 IP 32 2.3.2 TCP 33 2.3.3 UDP 34 2.3.4 Routing Protocols 35 2.3.5 ICMP 35 2.3.6 SNMP 36 2.3.7 IP Multicast 37 2.3.8 DNS 37 2.3.9 HTTP 39 2.3.10 P2P 40 2.4 Applications 42 3 Analytic Background 45 3.1 Linear Algebra 45 3.2 Probability 48 3.2.1 Background 49 3.2.2 Special Issues in the Internet 55 3.3 Statistics 58 3.3.1 Background 58 3.3.2 Special Issues in the Internet 61 3.4 Graphs 64 3.4.1 Background 64 3.4.2 Special Issues in the Internet 66 3.5 Metrics 70 3.6 Measurement and Modeling 73 3.6.1 Models in General 73 3.6.2 The Use of Probability Models 76 4 Practical Issues in Internet Measurement 79 4.1 Where can Measurements be Made? 80 4.1.1 Local Area Network 82 4.1.2 Inside a Backbone 82 4.1.3 Entry Points into a Network 84 4.1.4 Mirror Sites/Network Exchange Points 86 4.1.5 Wide Area Network 87 4.2 Role of Time 89 4.2.1 Background 90 4.2.2 Sources of Time Information 91 4.2.3 Synchronized Time 93 4.3 Role of Internet Directories and Databases 94 4.3.1 Internet Address and Routing Registries 95 4.3.2 Domain Name System 97 4.3.3 Measurement-related Issues in Dealing with Databases 98 4.4 Measurements Across Various Protocol Layers 99 4.4.1 Issues in Capturing Data 99 4.4.2 Changes to Infrastructure/Instrumentation 102 4.4.3 Local vs Remote vs Distributed Data Gathering 103 4.4.4 Measurement on Overlays 104 II In Depth 105 5 Infrastructure 107 5.1 Properties 107 5.1.1 Physical Device Properties 107 5.1.2 Topology Properties 111 5.1.3 Interaction of Traffic and Network 112 5.2 Challenges 115 5.2.1 Core Simplicity 115 5.2.2 Hidden Layers 116 5.2.3 Hidden Pieces 116 5.2.4 Administrative Barriers 117 5.3 Tools 117 5.3.1 Active Measurement 118 5.3.2 Passive Measurement 124 5.3.3 Fused Measurements 127 5.3.4 Bandwidth Measurement 127 5.3.5 Latency Measurement and Estimation 136 5.3.6 Geolocation 142 5.3.7 Inference 147 5.3.8 Other Tools 152 5.4 State of the Art 152 5.4.1 Equipment Properties 153 5.4.2 Topology Properties 154 5.4.3 Interaction of Traffic and Network 165 6 Traffic 171 6.1 Properties 172 6.1.1 The Basics: Packets and Bytes 172 6.1.2 Higher-level Structure 173 6.1.3 Flows 175 6.1.4 Semantically Distinct Traffic Types 176 6.2 Challenges 176 6.2.1 Practical Issues 177 6.2.2 Statistical Difficulties 179 6.3 Tools 188 6.3.1 Packet Capture 188 6.3.2 Data Management 191 6.3.3 Data Reduction 192 6.3.4 Inference 212 6.4 State of the Art 215 6.4.1 Packets and Bytes 216 6.4.2 Higher-level Structure 234 6.4.3 Flows 236 6.4.4 Control Traffic 238 6.4.5 Wireless 239 7 Applications 241 7.1 Application Mix 242 7.2 DNS 244 7.2.1 DNS Measurement Properties 245 7.2.2 DNS Measurement Challenges 248 7.2.3 DNS Measurement Tools 251 7.2.4 Use of DNS in Other Applications 256 7.2.5 State of the Art 258 7.3 Web 269 7.3.1 Web Measurement Properties 270 7.3.2 Web Measurement Challenges 273 7.3.3 Web Measurement Tools 278 7.3.4 State of the Art 286 7.4 P2P 309 7.4.1 P2P Measurement Properties 310 7.4.2 P2P Measurement Challenges 314 7.4.3 P2P Measurement Tools 317 7.4.4 State of the Art 321 7.5 Online Games 331 7.5.1 Games and Measurement Properties 332 7.5.2 Networked Games Measurement Challenges 337 7.5.3 State of the Art 340 7.6 Other Applications 346 7.6.1 Streaming Multimedia 346 III In Perspective 353 8 Anonymization 355 8.1 Definitions 356 8.2 General Motivation for Anonymizing Data 357 8.3 Obstacles and Risks in Sharing Data 358 8.4 What Should be Anonymized: Data Categorization 360 8.5 How Data is Anonymized: Process and Techniques 365 8.5.1 Anonymization Process 365 8.5.2 Anonymization Techniques 367 8.6 Anonymization Examples at Different Layers 369 8.6.1 Configuration Data 369 8.6.2 Router-level Data 370 8.6.3 Packet-level Traces 370 8.6.4 Application-level Data 373 8.7 Attacks Against Anonymized Data 374 8.8 Anonymizing Data: Metrics for Success 376 8.9 Alternatives to Anonymization 377 9 Security 379 9.1 Role of Internet Measurement in Security 380 9.2 Intranet Measurements in Aid of Security 382 9.3 Gateway Measurements in Aid of Security 384 9.4 Inter-domain Measurements Impact on Security 386 9.5 Wide-area Measurements in Aid of Security 387 9.6 Application-level Measurements of Attacks 394 10 Case Studies 395 10.1 Low-level Monitoring Tools 395 10.2 Individual Toolsets for Network Measurement 397 10.2.1 Windmill 398 10.2.2 Click 399 10.2.3 dss 400 10.2.4 Gigascope 403 10.3 Large-scale Measurement Projects 404 10.3.1 RIPE 405 10.3.2 High-energy Physics 407 10.3.3 CAIDA 410 10.3.4 PlanetLab 414 11 Conclusions and Prospects 419 11.1 Trends in Internet Measurement 419 11.2 Difficulties 424 11.3 Future Work 426 11.3.1 Research Challenges 426 11.3.2 Emerging Questions 428 Bibliography 431 Index 473
£53.19
John Wiley & Sons Inc The Semantic Web
Book SynopsisThe Semantic Web is an idea of World Wide Web inventor Tim Berners-Lee that the Web as a whole can be made more intelligent and perhaps even intuitive about how to serve a users needs. Although search engines index much of the Web''s content, they have little ability to select the pages that a user really wants or needs. Berners-Lee foresees a number of ways in which developers and authors, singly or in collaborations, can use self-descriptions and other techniques so that the context-understanding programs can selectively find what users want. The Semantic Web: Crafting Infrastructure for Agency presents a more holistic view of the current state of development and deployment. This a comprehensive reference to the rapidly developing technologies, which are enabling more intelligent and automated transactions over the internet, and a visionary overview of the implications of deploying such a layer of infrastructure. A through examination of the Semantic Web, inclTable of ContentsForeword. Preface. Part I: Content Concepts. 1. Enhancing the Web. 2. Defining the Semantic Web. 3. Web Information Management. 4. Semantic Web Collaboration and Agency. Part II: Current Technology Overview. 5. Languages and Protocols. 6. Ontologies and the Semantic Web. 7. Organizations and Projects. 8. Application and Tools. 9. Examples of Deployed Systems. Part III: Future Potential. 10. The Next Steps. 11. Extending the Concept. Part IV: Appendix Material. Appendix A: Technical Terms and References. Appendix B: Semantic Web Resources. Appendix C: Lists. Index.
£80.96
John Wiley & Sons Inc Web Engineering The Discipline of Systematic
Book SynopsisThe World Wide Web has a massive and permanent influence on our lives. Economy, industry, education, healthcare, public administration, entertainment - there is hardly any part of our daily lives which has not been pervaded by the Internet.Table of ContentsPreface xv Foreword xvii 1 An Introduction to Web Engineering 1Gerti Kappel, Birgit Pröll, Siegfried Reich, Werner Retschitzegger 1.1 Motivation 1 1.2 Categories of Web Applications 4 1.3 Characteristics of Web Applications 7 1.3.1 Product-related Characteristics 8 1.3.2 Usage-related Characteristics 12 1.3.3 Development-related Characteristics 14 1.3.4 Evolution 16 1.4 Objectives and Structure of the Book 17 2 Requirements Engineering for Web Applications 23Paul Grünbacher 2.1 Introduction 23 2.2 Fundamentals 24 2.2.1 Where Do Requirements Come From? 24 2.2.2 Requirements Engineering Activities 25 2.3 RE Specifics in Web Engineering 26 2.4 Principles for RE of Web Applications 30 2.5 Adapting RE Methods to Web Application Development 32 2.5.1 Requirement Types 32 2.5.2 Notations 34 2.5.3 Tools 36 2.6 Outlook 37 3 Modeling Web Applications 39Wieland Schwinger, Nora Koch 3.1 Introduction 39 3.2 Fundamentals 40 3.3 Modeling Specifics in Web Engineering 41 3.3.1 Levels 41 3.3.2 Aspects 42 3.3.3 Phases 42 3.3.4 Customization 43 3.4 Modeling Requirements 43 3.5 Content Modeling 45 3.5.1 Objectives 45 3.5.2 Concepts 45 3.6 Hypertext Modeling 46 3.6.1 Objectives 47 3.6.2 Hypertext Structure Modeling Concepts 47 3.6.3 Access Modeling Concepts 49 3.6.4 Relation to Content Modeling 50 3.7 Presentation Modeling 51 3.7.1 Objectives 51 3.7.2 Concepts 51 3.7.3 Relation to Hypertext Modeling 52 3.8 Customization Modeling 53 3.8.1 Objectives 54 3.8.2 Concepts 54 3.8.3 Relation to Content, Hypertext, and Presentation Modeling 58 3.9 Methods and Tools 58 3.9.1 Modeling Methods: An Overview 58 3.9.2 Model-Driven Development 61 3.9.3 Tool Support 61 3.10 Outlook 63 4 Web Application Architectures 65Christian Eichinger 4.1 Introduction 65 4.2 Fundamentals 66 4.2.1 What is an Architecture? 66 4.2.2 Developing Architectures 67 4.2.3 Categorizing Architectures 69 4.3 Specifics of Web Application Architectures 70 4.4 Components of a Generic Web Application Architecture 71 4.5 Layered Architectures 72 4.5.1 2-Layer Architectures 72 4.5.2 N-Layer Architectures 73 4.6 Data-aspect Architectures 79 4.6.1 Database-centric Architectures 80 4.6.2 Architectures for Web Document Management 80 4.6.3 Architectures for Multimedia Data 81 4.7 Outlook 84 5 Technology-aware Web Application Design 85Gerhard Austaller, Andreas Hartl, Markus Lauff, Fernando Lyardet, Max Mühlhaüser 5.1 Introduction 86 5.2 Web Design from an Evolutionary Perspective 89 5.2.1 Background 89 5.2.2 Information Design: An Authoring Activity 90 5.2.3 Software Design: A Programming Activity 92 5.2.4 Merging Information Design and Software Design 93 5.2.5 Problems and Restrictions in Integrated Web Design 94 5.2.6 A Proposed Structural Approach 95 5.3 Presentation Design 95 5.3.1 Presentation of Nodes and Meshes 96 5.3.2 Device-independent Development Approaches 97 5.4 Interaction Design 98 5.4.1 User Interaction 98 5.4.2 User Interface Organization 100 5.4.3 Navigation Design 101 5.4.4 Designing a Link Representation: The Anchor 101 5.4.5 Designing Link Internals: The URL 102 5.4.6 Navigation and Orientation 102 5.4.7 Structured Dialog for Complex Activities 103 5.4.8 Interplay with Technology and Architecture 104 5.5 Functional Design 105 5.5.1 Integration 105 5.5.2 Communication Paradigms and Middleware 105 5.5.3 Distributed Cross-corporate Web Applications 106 5.6 Outlook 107 5.6.1 Context-aware Applications 107 5.6.2 Device-independent Applications 108 5.6.3 Reusability 109 5.7 Summary 110 6 Technologies for Web Applications 111Martin Nussbaumer, Martin Gaedke 6.1 Introduction 111 6.2 Fundamentals 112 6.2.1 Markup 112 6.2.2 Hypertext and Hypermedia 112 6.3 Client/Server Communication on the Web 113 6.3.1 SMTP – Simple Mail Transfer Protocol. 113 6.3.2 RTSP – Real Time Streaming Protocol 113 6.3.3 HTTP – HyperText Transfer Protocol 113 6.3.4 Session Tracking 114 6.4 Client-side Technologies 116 6.4.1 Helpers and Plug-ins 116 6.4.2 Java Applets 116 6.4.3 ActiveX Controls 116 6.5 Document-specific Technologies 117 6.5.1 HTML – Hypertext Markup Language 117 6.5.2 SVG – Scalable Vector Graphics 117 6.5.3 SMIL – Synchronized Multimedia Integration Language 118 6.5.4 XML – eXtensible Markup Language 118 6.5.5 XSL – eXtensible Stylesheet Language 122 6.6 Server-side Technologies 126 6.6.1 URI Handlers 126 6.6.2 Web Services 129 6.6.3 Middleware Technologies 130 6.7 Outlook 132 7 Testing Web Applications 133Christoph Steindl, Rudolf Ramler, Josef Altmann 7.1 Introduction 133 7.2 Fundamentals 134 7.2.1 Terminology 134 7.2.2 Quality Characteristics 135 7.2.3 Test Objectives 136 7.2.4 Test Levels 136 7.2.5 Role of the Tester 137 7.3 Test Specifics in Web Engineering 138 7.4 Test Approaches 140 7.4.1 Conventional Approaches 140 7.4.2 Agile Approaches 140 7.5 Test Scheme 142 7.5.1 Three Test Dimensions 142 7.5.2 Applying the Scheme to Web Applications 143 7.5.3 Examples of Using the Test Scheme 145 7.6 Test Methods and Techniques 145 7.6.1 Link Testing 147 7.6.2 Browser Testing 147 7.6.3 Usability Testing 148 7.6.4 Load, Stress, and Continuous Testing 148 7.6.5 Testing Security 149 7.6.6 Test-driven Development 150 7.7 Test Automation 150 7.7.1 Benefits and Drawbacks of Automated Tests 150 7.7.2 Test Tools 151 7.7.3 Selecting Test Tools 152 7.8 Outlook 152 8 Operation and Maintenance of Web Applications 155Arno Ebner, Birgit Pröll, Hannes Werthner 8.1 Introduction 155 8.2 Challenges Following the Launch of a Web Application 156 8.3 Promoting a Web Application 157 8.3.1 Newsletters 158 8.3.2 Affiliate Marketing 158 8.3.3 Search Engine Marketing 159 8.3.4 Content-related Marketing 162 8.3.5 Domain Management 162 8.4 Content Management 163 8.4.1 Content Update Rate and Demand on Currency 164 8.4.2 Content Syndication 165 8.5 Usage Analysis 165 8.5.1 Usage Analysis Techniques 165 8.5.2 Statistical Indicators 167 8.5.3 User Behavior Analysis 168 8.6 Outlook 169 9 Web Project Management 171Herwig Mayr 9.1 From Software Project Management to Web Project Management 171 9.1.1 Objectives of Software Project Management 171 9.1.2 The Tasks of Software Project Management 172 9.1.3 Conflicting Areas in Projects 173 9.1.4 Specifics of Web Project Management 173 9.2 Challenges in Web Project Management 175 9.2.1 General Challenges in Software Development 175 9.2.2 Development-related Challenges in Web Projects 176 9.2.3 Product-related Challenges in Web Projects 179 9.3 Managing Web Teams 182 9.3.1 Software Development: A Human-centered Task 182 9.3.2 The Web Project Team 183 9.3.3 The Web Project Manager 184 9.4 Managing the Development Process of a Web Application 185 9.4.1 Deploying the Tools 185 9.4.2 Measuring Progress 188 9.4.3 Project Risks 190 9.4.4 Risk Management 193 9.5 Outlook 194 10 The Web Application Development Process 197Gregor Engels, Marc Lohmann, Annika Wagner 10.1 Motivation 197 10.2 Fundamentals 198 10.3 Requirements for a Web Application Development Process 201 10.3.1 Handling Short Development Cycles 201 10.3.2 Handling Changing Requirements 201 10.3.3 Releases with Fixed Deadlines and Flexible Contents 203 10.3.4 Parallel Development of Different Releases 203 10.3.5 Reuse and Integration 204 10.3.6 Adapting to Web Application’s Complexity Level 204 10.3.7 Summary 205 10.4 Analysis of the Rational Unified Process 205 10.4.1 Introduction 205 10.4.2 General Suitability for Web Application Development 208 10.4.3 Does RUP meet the Requirements of Web Applications? 209 10.5 Analysis of Extreme Programming 211 10.5.1 Introduction 211 10.5.2 Does XP meet the Requirements of Web Application Development? 214 10.6 Outlook 216 11 Usability of Web Applications 219Martin Hitz, Gerhard Leitner, Rudolf Melcher 11.1 Motivation 219 11.2 What is Usability? 220 11.3 What Characterizes the Usability of Web Applications? 222 11.4 Design Guidelines 225 11.4.1 Response Times 225 11.4.2 Interaction Efficiency 225 11.4.3 Colors 226 11.4.4 Text Layout 227 11.4.5 Page Structure 228 11.4.6 Navigation Structure 228 11.4.7 Multiculturality 230 11.4.8 Confidence-generating Measures 231 11.4.9 Other Design Criteria 232 11.5 Web Usability Engineering Methods 232 11.5.1 Requirements Analysis 234 11.5.2 Design 237 11.5.3 Implementation 238 11.5.4 Operation 238 11.6 Web Usability Engineering Trends 239 11.6.1 Usability Patterns 239 11.6.2 Mobile Usability 241 11.6.3 Accessibility 243 11.7 Outlook 245 12 Performance of Web Applications 247Gabriele Kotsis 12.1 Introduction 247 12.2 What Is Performance? 248 12.3 What Characterizes the Performance of Web Applications? 250 12.4 System Definition and Indicators 251 12.5 Characterizing the Workload 252 12.6 Analytical Techniques 254 12.6.1 Operational Analysis 254 12.6.2 Queuing Networks and Simulation Models 255 12.6.3 Measuring Approaches 257 12.7 Representing and Interpreting Results 258 12.8 Performance Optimization Methods 259 12.8.1 Acceleration Within a Web Application 260 12.8.2 Reducing Transmission Time 261 12.8.3 Server Tuning 263 12.9 Outlook 263 13 Security for Web Applications 265Martin Wimmer, Alfons Kemper, Stefan Seltzsam 13.1 Introduction 265 13.2 Aspects of Security 266 13.3 Encryption, Digital Signatures and Certificates 268 13.3.1 Symmetric Cryptography 268 13.3.2 Asymmetric Cryptography 270 13.3.3 Digital Signatures 271 13.3.4 Certificates and Public Key Infrastructure 272 13.4 Secure Client/Server-Interaction 272 13.4.1 Point-to-Point Security 272 13.4.2 End-to-End Security 274 13.4.3 User Authentication and Authorization 276 13.4.4 Electronic Payment Systems 278 13.5 Client Security Issues 279 13.5.1 Preserving Privacy 279 13.5.2 Mobile Code Security 281 13.5.3 Phishing and Web Spoofing 282 13.5.4 Desktop Security 283 13.6 Service Provider Security Issues 285 13.6.1 Cross-Site Scripting 285 13.6.2 SQL Injection 287 13.6.3 Security of CGI Programs 289 13.6.4 Service Availability 290 13.6.5 Host Security 291 13.7 Outlook 292 14 The Semantic Web – The Network of Meanings in the Network of Documents 293Wernher Behrendt, Nitin Arora 14.1 Fundamentals of the Semantic Web 293 14.1.1 The Role of Software Agents 294 14.1.2 The Role of Semantic Markup 296 14.1.3 The Role of Ontologies 297 14.2 Technological Concepts 298 14.2.1 Agents According to the FIPA Standard 298 14.2.2 Ontologies 300 14.2.3 Semantic Markup on the Web 303 14.3 Specifics of Semantic Web Applications 308 14.3.1 Semantic Markup 308 14.3.2 Agents 309 14.3.3 Ontologies 309 14.3.4 Semantic Web Services 310 14.3.5 Integration into Web Engineering 313 14.4 Tools 314 14.5 Outlook 315 Glossary 317 Author Biographies 329 Bibliography 337 Credits 357 Index 359
£48.44
John Wiley & Sons Inc The Art of Error Correcting Coding
Book SynopsisBuilding on the success of the first edition, which offered a practical introductory approach to the techniques of error concealment, this book, now fully revised and updated, provides a comprehensive treatment of the subject and includes a wealth of additional features.The Art of Error Correcting Coding, Second Edition explores intermediate and advanced level concepts as well as those which will appeal to the novice. All key topics are discussed, including Reed-Solomon codes, Viterbi decoding, soft-output decoding algorithms, MAP, log-MAP and MAX-log-MAP. Reliability-based algorithms GMD and Chase are examined, as are turbo codes, both serially and parallel concatenated, as well as low-density parity-check (LDPC) codes and their iterative decoders. Features additional problems at the end of each chapter and an instructor's solutions manual Updated companion website offers new C/C ++programs and MATLAB scripts, to help with the understanding and implemeTable of ContentsPreface ix Foreword xi The ECC web site xiii 1 Introduction 1 1.1 Error correcting coding: Basic concepts 4 1.1.1 Block codes and convolutional codes 4 1.1.2 Hamming distance, Hamming spheres and error correcting capability 5 1.2 Linear block codes 7 1.2.1 Generator and parity-check matrices 7 1.2.2 The weight is the distance 8 1.3 Encoding and decoding of linear block codes 8 1.3.1 Encoding with G and H 8 1.3.2 Standard array decoding 10 1.3.3 Hamming spheres, decoding regions and the standard array 12 1.4 Weight distribution and error performance 13 1.4.1 Weight distribution and undetected error probability over a BSC 14 1.4.2 Performance bounds over BSC, AWGN and fading channels 15 1.5 General structure of a hard-decision decoder of linear codes 23 Problems 23 2 Hamming, Golay and Reed–Muller codes 27 2.1 Hamming codes 27 2.1.1 Encoding and decoding procedures 28 2.2 The binary Golay code 29 2.2.1 Encoding 29 2.2.2 Decoding 30 2.2.3 Arithmetic decoding of the extended (24, 12, 8) Golay code 30 2.3 Binary Reed–Muller codes 31 2.3.1 Boolean polynomials and RM codes 31 2.3.2 Finite geometries and majority-logic decoding 33 Problems 37 3 Binary cyclic codes and BCH codes 39 3.1 Binary cyclic codes 39 3.1.1 Generator and parity-check polynomials 39 3.1.2 The generator polynomial 40 3.1.3 Encoding and decoding of binary cyclic codes 41 3.1.4 The parity-check polynomial 42 3.1.5 Shortened cyclic codes and CRC codes 44 3.1.6 Fire codes 45 3.2 General decoding of cyclic codes 46 3.2.1 GF(2m) arithmetic 48 3.3 Binary BCH codes 52 3.3.1 BCH bound 53 3.4 Polynomial codes 53 3.5 Decoding of binary BCH codes 54 3.5.1 General decoding algorithm for BCH codes 56 3.5.2 The Berlekamp–Massey algorithm (BMA) 57 3.5.3 PGZ decoder 60 3.5.4 Euclidean algorithm 61 3.5.5 Chien search and error correction 63 3.5.6 Errors-and-erasures decoding 63 3.6 Weight distribution and performance bounds 65 3.6.1 Error performance evaluation 66 Problems 69 4 Nonbinary BCH codes: Reed–Solomon codes 73 4.1 RS codes as polynomial codes 73 4.2 From binary BCH to RS codes 73 4.3 Decoding RS codes 74 4.3.1 Remarks on decoding algorithms 79 4.3.2 Errors-and-erasures decoding 79 4.4 Weight distribution 84 Problems 84 5 Binary convolutional codes 87 5.1 Basic structure 87 5.1.1 Recursive systematic convolutional codes 92 5.1.2 Free distance 94 5.2 Connections with block codes 94 5.2.1 Zero-tail construction 94 5.2.2 Direct-truncation construction 95 5.2.3 Tail-biting construction 95 5.2.4 Weight distributions 95 5.3 Weight enumeration 97 5.4 Performance bounds 99 5.5 Decoding: Viterbi algorithm with Hamming metrics 101 5.5.1 Maximum-likelihood decoding and metrics 101 5.5.2 The Viterbi algorithm 102 5.5.3 Implementation issues 104 5.6 Punctured convolutional codes 112 5.6.1 Implementation issues related to punctured convolutional codes 115 5.6.2 RCPC codes 116 Problems 116 6 Modifying and combining codes 119 6.1 Modifying codes 119 6.1.1 Shortening 119 6.1.2 Extending 121 6.1.3 Puncturing 122 6.1.4 Augmenting, expurgating and lengthening 122 6.2 Combining codes 124 6.2.1 Time sharing of codes 124 6.2.2 Direct sums of codes 125 6.2.3 The |u|u + v|-construction and related techniques 126 6.2.4 Products of codes 128 6.2.5 Concatenated codes 134 6.2.6 Generalized concatenated codes 136 Problems 140 7 Soft-decision decoding 143 7.1 Binary transmission over AWGN channels 144 7.2 Viterbi algorithm with Euclidean metric 145 7.3 Decoding binary linear block codes with a trellis 146 7.4 The Chase algorithm 150 7.5 Ordered statistics decoding 153 7.6 Generalized minimum distance decoding 156 7.6.1 Sufficient conditions for optimality 157 7.7 List decoding 158 7.8 Soft-output algorithms 158 7.8.1 Soft-output Viterbi algorithm 158 7.8.2 Maximum-a posteriori (MAP) algorithm 161 7.8.3 Log-MAP algorithm 163 7.8.4 Max-Log-MAP algorithm 164 7.8.5 Soft-output OSD algorithm 164 Problems 165 8 Iteratively decodable codes 169 8.1 Iterative decoding 172 8.2 Product codes 174 8.2.1 Parallel concatenation: Turbo codes 174 8.2.2 Serial concatenation 183 8.2.3 Block product codes 185 8.3 Low-density parity-check codes 190 8.3.1 Tanner graphs 190 8.3.2 Iterative hard-decision decoding: The bit-flip algorithm 192 8.3.3 Iterative probabilistic decoding: Belief propagation 196 Problems 201 9 Combining codes and digital modulation 203 9.1 Motivation 203 9.1.1 Examples of signal sets 204 9.1.2 Coded modulation 206 9.1.3 Distance considerations 207 9.2 Trellis-coded modulation (TCM) 208 9.2.1 Set partitioning and trellis mapping 209 9.2.2 Maximum-likelihood decoding 211 9.2.3 Distance considerations and error performance 212 9.2.4 Pragmatic TCM and two-stage decoding 213 9.3 Multilevel coded modulation 217 9.3.1 Constructions and multistage decoding 217 9.3.2 Unequal error protection with MCM 221 9.4 Bit-interleaved coded modulation 225 9.4.1 Gray mapping 226 9.4.2 Metric generation: De-mapping 227 9.4.3 Interleaving 227 9.5 Turbo trellis-coded modulation 227 9.5.1 Pragmatic turbo TCM 228 9.5.2 Turbo TCM with symbol interleaving 228 9.5.3 Turbo TCM with bit interleaving 229 Problems 230 Appendix A Weight distributions of extended BCH codes 233 A.1 Length 8 233 A.2 Length 16 233 A.3 Length 32 234 A.4 Length 64 235 A.5 Length 128 238 Bibliography 247 Index 257
£76.46
John Wiley & Sons Inc An Introduction to 3D Computer Vision Techniques
Book SynopsisComputer vision encompasses the construction of integrated vision systems and the application of vision to problems of real-world importance. The process of creating 3D models is still rather difficult, requiring mechanical measurement of the camera positions or manual alignment of partial 3D views of a scene.Trade Review“This text is a valuable reference for practitioners and programmers working in 3D computer vision, image processing and analysis as well as computer visualisation. It would also be of interest to advanced students and researchers in the fields of engineering, computer science, clinical photography, robotics, graphics and mathematics.” (Zentralblatt MATH, 2012) Table of ContentsPreface xv Acknowledgements xvii Notation and Abbreviations xix Part I 1 1 Introduction 3 1.1 Stereo-pair Images and Depth Perception 4 1.2 3D Vision Systems 4 1.3 3D Vision Applications 5 1.4 Contents Overview: The 3D Vision Task in Stages 6 2 Brief History of Research on Vision 9 2.1 Abstract 9 2.2 Retrospective of Vision Research 9 2.3 Closure 14 2.3.1 Further Reading 14 Part II 15 3 2D and 3D Vision Formation 17 3.1 Abstract 17 3.2 Human Visual System 18 3.3 Geometry and Acquisition of a Single Image 23 3.3.1 Projective Transformation 24 3.3.2 Simple Camera System: the Pin-hole Model 24 3.3.3 Projective Transformation of the Pin-hole Camera 28 3.3.4 Special Camera Setups 29 3.3.5 Parameters of Real Camera Systems 30 3.4 Stereoscopic Acquisition Systems 31 3.4.1 Epipolar Geometry 31 3.4.2 Canonical Stereoscopic System 36 3.4.3 Disparity in the General Case 38 3.4.4 Bifocal, Trifocal and Multifocal Tensors 39 3.4.5 Finding the Essential and Fundamental Matrices 41 3.4.6 Dealing with Outliers 49 3.4.7 Catadioptric Stereo Systems 54 3.4.8 Image Rectification 55 3.4.9 Depth Resolution in Stereo Setups 59 3.4.10 Stereo Images and Reference Data 61 3.5 Stereo Matching Constraints 66 3.6 Calibration of Cameras 70 3.6.1 Standard Calibration Methods 71 3.6.2 Photometric Calibration 73 3.6.3 Self-calibration 73 3.6.4 Calibration of the Stereo Setup 74 3.7 Practical Examples 75 3.7.1 Image Representation and Basic Structures 75 3.8 Appendix: Derivation of the Pin-hole Camera Transformation 91 3.9 Closure 93 3.9.1 Further Reading 93 3.9.2 Problems and Exercises 94 4 Low-level Image Processing for Image Matching 95 4.1 Abstract 95 4.2 Basic Concepts 95 4.2.1 Convolution and Filtering 95 4.2.2 Filter Separability 97 4.3 Discrete Averaging 99 4.3.1 Gaussian Filter 100 4.3.2 Binomial Filter 101 4.4 Discrete Differentiation 105 4.4.1 Optimized Differentiating Filters 105 4.4.2 Savitzky–Golay Filters 108 4.5 Edge Detection 115 4.5.1 Edges from Signal Gradient 117 4.5.2 Edges from the Savitzky–Golay Filter 119 4.5.3 Laplacian of Gaussian 120 4.5.4 Difference of Gaussians 126 4.5.5 Morphological Edge Detector 127 4.6 Structural Tensor 127 4.6.1 Locally Oriented Neighbourhoods in Images 128 4.6.2 Tensor Representation of Local Neighbourhoods 133 4.6.3 Multichannel Image Processing with Structural Tensor 143 4.7 Corner Detection 144 4.7.1 The Most Common Corner Detectors 144 4.7.2 Corner Detection with the Structural Tensor 149 4.8 Practical Examples 151 4.8.1 C++ Implementations 151 4.8.2 Implementation of the Morphological Operators 157 4.8.3 Examples in Matlab: Computation of the SVD 161 4.9 Closure 162 4.9.1 Further Reading 163 4.9.2 Problems and Exercises 163 5 Scale-space Vision 165 5.1 Abstract 165 5.2 Basic Concepts 165 5.2.1 Context 165 5.2.2 Image Scale 166 5.2.3 Image Matching Over Scale 166 5.3 Constructing a Scale-space 168 5.3.1 Gaussian Scale-space 168 5.3.2 Differential Scale-space 170 5.4 Multi-resolution Pyramids 172 5.4.1 Introducing Multi-resolution Pyramids 172 5.4.2 How to Build Pyramids 175 5.4.3 Constructing Regular Gaussian Pyramids 175 5.4.4 Laplacian of Gaussian Pyramids 177 5.4.5 Expanding Pyramid Levels 178 5.4.6 Semi-pyramids 179 5.5 Practical Examples 181 5.5.1 C++ Examples 181 5.5.2 Matlab Examples 186 5.6 Closure 191 5.6.1 Chapter Summary 191 5.6.2 Further Reading 191 5.6.3 Problems and Exercises 192 6 Image Matching Algorithms 193 6.1 Abstract 193 6.2 Basic Concepts 193 6.3 Match Measures 194 6.3.1 Distances of Image Regions 194 6.3.2 Matching Distances for Bit Strings 198 6.3.3 Matching Distances for Multichannel Images 199 6.3.4 Measures Based on Theory of Information 202 6.3.5 Histogram Matching 205 6.3.6 Efficient Computations of Distances 206 6.3.7 Nonparametric Image Transformations 209 6.3.8 Log-polar Transformation for Image Matching 218 6.4 Computational Aspects of Matching 222 6.4.1 Occlusions 222 6.4.2 Disparity Estimation with Subpixel Accuracy 224 6.4.3 Evaluation Methods for Stereo Algorithms 226 6.5 Diversity of Stereo Matching Methods 229 6.5.1 Structure of Stereo Matching Algorithms 233 6.6 Area-based Matching 238 6.6.1 Basic Search Approach 239 6.6.2 Interpreting Match Cost 241 6.6.3 Point-oriented Implementation 245 6.6.4 Disparity-oriented Implementation 250 6.6.5 Complexity of Area-based Matching 256 6.6.6 Disparity Map Cross-checking 257 6.6.7 Area-based Matching in Practice 259 6.7 Area-based Elastic Matching 273 6.7.1 Elastic Matching at a Single Scale 273 6.7.2 Elastic Matching Concept 278 6.7.3 Scale-based Search 280 6.7.4 Coarse-to-fine Matching Over Scale 283 6.7.5 Scale Subdivision 284 6.7.6 Confidence Over Scale 285 6.7.7 Final Multi-resolution Matcher 286 6.8 Feature-based Image Matching 288 6.8.1 Zero-crossing Matching 289 6.8.2 Corner-based Matching 292 6.8.3 Edge-based Matching: The Shirai Method 295 6.9 Gradient-based Matching 296 6.10 Method of Dynamic Programming 298 6.10.1 Dynamic Programming Formulation of the Stereo Problem 301 6.11 Graph Cut Approach 306 6.11.1 Graph Cut Algorithm 306 6.11.2 Stereo as a Voxel Labelling Problem 311 6.11.3 Stereo as a Pixel Labelling Problem 312 6.12 Optical Flow 314 6.13 Practical Examples 318 6.13.1 Stereo Matching Hierarchy in C++ 318 6.13.2 Log-polar Transformation 319 6.14 Closure 321 6.14.1 Further Reading 321 6.14.2 Problems and Exercises 322 7 Space Reconstruction and Multiview Integration 323 7.1 Abstract 323 7.2 General 3D Reconstruction 323 7.2.1 Triangulation 324 7.2.2 Reconstruction up to a Scale 325 7.2.3 Reconstruction up to a Projective Transformation 327 7.3 Multiview Integration 329 7.3.1 Implicit Surfaces and Marching Cubes 330 7.3.2 Direct Mesh Integration 338 7.4 Closure 342 7.4.1 Further Reading 342 8 Case Examples 343 8.1 Abstract 343 8.2 3D System for Vision-Impaired Persons 343 8.3 Face and Body Modelling 345 8.3.1 Development of Face and Body Capture Systems 345 8.3.2 Imaging Resolution, 3D Resolution and Implications for Applications 346 8.3.3 3D Capture and Analysis Pipeline for Constructing Virtual Humans 350 8.4 Clinical and Veterinary Applications 352 8.4.1 Development of 3D Clinical Photography 352 8.4.2 Clinical Requirements for 3D Imaging 353 8.4.3 Clinical Assessment Based on 3D Surface Anatomy 353 8.4.4 Extraction of Basic 3D Anatomic Measurements 354 8.4.5 Vector Field Surface Analysis by Means of Dense Correspondences 357 8.4.6 Eigenspace Methods 359 8.4.7 Clinical and Veterinary Examples 362 8.4.8 Multimodal 3D Imaging 367 8.5 Movie Restoration 370 8.6 Closure 374 8.6.1 Further Reading 374 Part III 375 9 Basics of the Projective Geometry 377 9.1 Abstract 377 9.2 Homogeneous Coordinates 377 9.3 Point, Line and the Rule of Duality 379 9.4 Point and Line at Infinity 380 9.5 Basics on Conics 382 9.5.1 Conics in ℘2 382 9.5.2 Conics in ℘2 384 9.6 Group of Projective Transformations 385 9.6.1 Projective Base 385 9.6.2 Hyperplanes 386 9.6.3 Projective Homographies 386 9.7 Projective Invariants 387 9.8 Closure 388 9.8.1 Further Reading 389 10 Basics of Tensor Calculus for Image Processing 391 10.1 Abstract 391 10.2 Basic Concepts 391 10.2.1 Linear Operators 392 10.2.2 Change of Coordinate Systems: Jacobians 393 10.3 Change of a Base 394 10.4 Laws of Tensor Transformations 396 10.5 The Metric Tensor 397 10.5.1 Covariant and Contravariant Components in a Curvilinear Coordinate System 397 10.5.2 The First Fundamental Form 399 10.6 Simple Tensor Algebra 399 10.6.1 Tensor Summation 399 10.6.2 Tensor Product 400 10.6.3 Contraction and Tensor Inner Product 400 10.6.4 Reduction to Principal Axes 400 10.6.5 Tensor Invariants 401 10.7 Closure 401 10.7.1 Further Reading 401 11 Distortions and Noise in Images 403 11.1 Abstract 403 11.2 Types and Models of Noise 403 11.3 Generating Noisy Test Images 405 11.4 Generating Random Numbers with Normal Distributions 407 11.5 Closure 408 11.5.1 Further Reading 408 12 Image Warping Procedures 409 12.1 Abstract 409 12.2 Architecture of the Warping System 409 12.3 Coordinate Transformation Module 410 12.3.1 Projective and Affine Transformations of a Plane 410 12.3.2 Polynomial Transformations 411 12.3.3 Generic Coordinates Mapping 412 12.4 Interpolation of Pixel Values 412 12.4.1 Bilinear Interpolation 412 12.4.2 Interpolation of Nonscalar-Valued Pixels 414 12.5 The Warp Engine 414 12.6 Software Model of the Warping Schemes 415 12.6.1 Coordinate Transformation Hierarchy 415 12.6.2 Interpolation Hierarchy 416 12.6.3 Image Warp Hierarchy 416 12.7 Warp Examples 419 12.8 Finding the Linear Transformation from Point Correspondences 420 12.8.1 Linear Algebra on Images 424 12.9 Closure 427 12.9.1 Further Reading 428 13 Programming Techniques for Image Processing and Computer Vision 429 13.1 Abstract 429 13.2 Useful Techniques and Methodology 430 13.2.1 Design and Implementation 430 13.2.2 Template Classes 436 13.2.3 Asserting Code Correctness 438 13.2.4 Debugging Issues 440 13.3 Design Patterns 441 13.3.1 Template Function Objects 441 13.3.2 Handle-body or Bridge 442 13.3.3 Composite 445 13.3.4 Strategy 447 13.3.5 Class Policies and Traits 448 13.3.6 Singleton 450 13.3.7 Proxy 450 13.3.8 Factory Method 451 13.3.9 Prototype 452 13.4 Object Lifetime and Memory Management 453 13.5 Image Processing Platforms 455 13.5.1 Image Processing Libraries 455 13.5.2 Writing Software for Different Platforms 455 13.6 Closure 456 13.6.1 Further Reading 456 14 Image Processing Library 457 References 459 Index 475
£99.86
John Wiley & Sons Inc Developing Web Applications
Book SynopsisBuilding applications for the Internet is a complex and fast-moving field which utilizes a variety of continually evolving technologies. Whether your perspective is from the client or server side, there are many languages to master - X(HTML), JavaScript, PHP, XML and CSS to name but a few.Table of ContentsPreface. Introduction. Features. Additional Materials. Trademarks. Acknowledgments. CHAPTER 1: THE WAY THE WEB WORKS. A basic introduction to how the WWW works within the context of the Internet with supporting protocols and applications. CHAPTER 2: THE CLIENT SIDE: HTML. This chapter starts to look at the client side and static Web page development using HTML. You will learn how to develop simple Web pages and formatting, together with tables, images and frames. CHAPTER 3: FROM HTML TO XHTML. Here we continue the exploration of HTML into XHTML. You will learn about the various standards that have been developed for HTML. More advanced HTML will also be studied, and the ability to control search engines, cache refresh and meta information. CHAPTER 4: GETTING SOME STYLE: CSS. In this chapter you will learn how to present and control the format of Web pages using CSS. This includes the ability to precisely control the positioning and attributes of content while maintaining the structure of the document itself. CHAPTER 5: JAVASCRIPT: INTRODUCTION TO CLIENT SIDE SCRIPTING. This chapter will prepare you for developing with this popular scripting language, showing you the syntax and possibilities of use. The aims here are to show you how it is placed within a page, variables, strings, arrays and loops. Program flow is also discussed and how conditional operators and commands are used. CHAPTER 6: JAVASCRIPT: DEVELOPING MORE ADVANCED SCRIPTS. In this chapter you will learn about using objects in JavaScript, both the built-in types and creating your own. You will also learn about the Document Object Model (DOM), which allows HTML documents to be manipulated and accessed. Forms and ways of validating information submitted are explored here too. CHAPTER 7: DHTML. The aim of this chapter is to bring dynamic aspects of site design together. You will learn about animation, caching, event driven scripting and browser compatibility. It’s in this chapter you will also find out more about compatibility and the need to provide alternatives for different browsers. CHAPTER 8: XML: EXTENSIBLE MARKUP LANGUAGE. In this chapter you will learn about the basics of XML and how it can be used to store information away from the mechanism of processing or formatting of such data. You will learn how to build simple XML files, and be able to manipulate and refer to them. CHAPTER 9: XML, XSL AND XSLT: TRANSFORMING XML. The aim of this chapter is to learn about and explore the possibilities of using XML as the starting point for data to be transformed into other target formats using XSLT. Style sheets are used and linked to documents. It is shown here that it is possible to process XML with a browser or a programing language on the client side. CHAPTER 10: WEB SERVICES, FEEDS AND BLOGS. Here you will learn about three important areas of Web activity: how it is possible to create language- and platform-independent services that utilize common Web protocols and XML; how information can be disseminated automatically to interested people; and finally, the phenomenon of the blog! CHAPTER 11: THE SERVER SIDE. This chapter aims to give you your first contact with the server side and introduces you to the server; the various possible packages and platforms; how to set up and the options involved; testing your server; logging users and dealing with dynamic IPs. CHAPTER 12: PHP 1: STARTING TO SCRIPT ON THE SERVER SIDE. This chapter gives a basic introduction to PHP and dynamic programing on the server side. You will learn how to develop simple PHP, how to structure your programs and embed script within HTML. CHAPTER 13: PHP 2: ARRAYS, FUNCTIONS AND FORMS. Here, you learn how to further manipulate data within PHP and in the process get to grips with new functions, loop structures and the verification of data input through forms. Simple arrays to dynamic structures are discussed, along with the ability to manipulate strings through special functions. Attention is particularly given to how to enlist specific features of PHP when processing data and how these can be used to add security. CHAPTER 14: MORE ADVANCED PHP. The aim here is to provide a glimpse of the further possibilities within PHP, including cookies, sessions, objects and more advanced file handling. CHAPTER 15: NETWORK AND WEB SECURITY. The aim of this chapter is to make you aware of threats to online security that you and your users must guard against. The most common forms of attack are studied, such as viruses and worms, cross site scripting, email problems, Trojan horses, phishing and many other mechanisms. Possible solutions are also looked into, including firewalls and anti-virus software. CHAPTER 16: DATABASES. The aim of this chapter is to help you understand databases so that they can easily be utilized in your Web applications and sites. The basic idea of the database is explored, together with how well it can be linked in with server side scripting. All the basic functions are studied, together with how these can be communicated directly to the database server. CHAPTER 17: ALTERNATIVE SCRIPTING LANGUAGES. The aim of this chapter is to have a look at the various technologies available for developing Web applications. This can be useful to familiarize you with legacy code that may be met while maintaining older applications and Web sites. CHAPTER 18: FUTURE: GAINING A PERSPECTIVE. This chapter’s main focus is to acquaint the reader with the leading edge of Internet and Web technology, to give some idea of the currently active research areas and inspire interest for future study. Glossary. Sources. Index.
£41.79
John Wiley & Sons Inc Service Modelling
Book SynopsisLearn how to use service modelling to streamline and optimize processes! Information about customer needs, the technical composition of services, and service performance are fundamental to effective service management. Service modelling is a structured approach to utilizing this information to improve the way services are delivered.Table of ContentsAcknowledgements. Preface. Abbreviations. How to Read This Book. Information About Trademarks and Copyrights. List of Figures. List of Tables. I Background. 1 Introduction. 1.1 Definition of Service Modelling. 1.2 Packet-based Services. 1.3 Emerging Technologies. 1.4 Summary. 1.5 Highlights. 2 Approaches to Modelling. 2.1 Introduction to Modelling. 2.2 Software Engineering Paradigm. 2.3 Object-Oriented Modelling. 2.4 Expert Systems. 2.5 Service-Oriented Architectures. 2.6 Databases. 2.7 Architecture Design. 2.8 Other Modelling Methods. 2.9 Summary. 2.10 Highlights. 3 Industry Initiatives. 3.1 Introduction. 3.2 OMG. 3.3 Business Process Management. 3.4 ITU. 3.5 3GPP. 3.6 TeleManagement Forum. 3.7 IT Service Management Forum. 3.8 Activities Related to Internet Services. 3.9 Other Fora and Viewpoints. 3.10 Summary. 3.11 Highlights. II Service Modelling Concepts. 4 Requirements for Service Modelling. 4.1 Notation. 4.2 General Requirements and Concerns. 4.3 Technology-related Requirements. 4.4 Process-related Requirements. 4.5 Information Modelling–Related Requirements. 4.6 Stakeholder Type–Specific Requirements and Concerns. 4.7 Summary. 4.8 Highlights. 5 Management Framework. 5.1 Description of the Framework. 5.2 Assumptions about Inter-provider Relations. 5.3 Relation to Existing Frameworks. 5.4 Summary. 5.5 Highlights. 6 Service Framework. 6.1 Introduction. 6.2 Service Quality Framework. 6.3 Security Framework. 6.4 Using of Service Framework in Management Framework. 6.5 End-user Services. 6.6 Summary. 6.7 Highlights. 7 Service Modelling Patterns. 7.1 Modelling Framework. 7.2 Modelling Patterns. 7.3 Notes About Using Service Model Patterns. 7.4 Relationship to Existing Models. 7.5 Summary. 7.6 Highlights. III Use Cases. 8 DiffServ Network Example. 8.1 Introduction. 8.2 Description. 8.3 Service Framework. 8.4 Service Model. 8.5 Link to Service Management. 8.6 Summary. 8.7 Highlights. 9 Mobile Network Example. 9.1 Introduction. 9.2 Description. 9.3 Service Framework. 9.4 Service Model. 9.5 Link to Service Management. 9.6 Summary. 9.7 Highlights. 10 Distributed Network Example. 10.1 Introduction. 10.2 Description. 10.3 Service Framework. 10.4 Service Model. 10.5 Link to Service Management. 10.6 Summary. 10.7 Highlights. IV Summary. 11 Summary. 11.1 Issues for the Future. V Appendices. A 3GPP Bearer Concepts. B DiffServ SLA Concepts. Bibliography. Index.
£106.35
John Wiley & Sons Inc EventBased Neuromorphic Systems
Book SynopsisNeuromorphic electronic engineering takes its inspiration from the functioning of nervous systems to build more power efficient electronic sensors and processors. Event-based neuromorphic systems are inspired by the brain''s efficient data-driven communication design, which is key to its quick responses and remarkable capabilities. This cross-disciplinary text establishes how circuit building blocks are combined in architectures to construct complete systems. These include vision and auditory sensors as well as neuronal processing and learning circuits that implement models of nervous systems. Techniques for building multi-chip scalable systems are considered throughout the book, including methods for dealing with transistor mismatch, extensive discussions of communication and interfacing, and making systems that operate in the real world. The book also provides historical context that helps relate the architectures and circuits to each other and that guides readers to the exTable of ContentsList of Contributors xv Foreword xvii Acknowledgments xix List of Abbreviations and Acronyms xxi 1 Introduction 1 1.1 Origins and Historical Context 3 1.2 Building Useful Neuromorphic Systems 5 References 5 Part I UNDERSTANDING NEUROMORPHIC SYSTEMS 7 2 Communication 9 2.1 Introduction 9 2.2 Address-Event Representation 12 2.2.1 AER Encoders 13 2.2.2 Arbitration Mechanisms 13 2.2.3 Encoding Mechanisms 17 2.2.4 Multiple AER Endpoints 19 2.2.5 Address Mapping 19 2.2.6 Routing 19 2.3 Considerations for AER Link Design 20 2.3.1 Trade-off: Dynamic or Static Allocation 21 2.3.2 Trade-off: Arbitered Access or Collisions? 23 2.3.3 Trade-off: Queueing versus Dropping Spikes 24 2.3.4 Predicting Throughput Requirements 25 2.3.5 Design Trade-offs 27 2.4 The Evolution of AER Links 28 2.4.1 Single Sender, Single Receiver 28 2.4.2 Multiple Senders, Multiple Receivers 30 2.4.3 Parallel Signal Protocol 31 2.4.4 Word-Serial Addressing 32 2.4.5 Serial Differential Signaling 33 2.5 Discussion 34 References 35 3 Silicon Retinas 37 3.1 Introduction 37 3.2 Biological Retinas 38 3.3 Silicon Retinas with Serial Analog Output 39 3.4 Asynchronous Event-Based Pixel Output Versus Synchronous Frames 40 3.5 AER Retinas 40 3.5.1 Dynamic Vision Sensor 41 3.5.2 Asynchronous Time-Based Image Sensor 46 3.5.3 Asynchronous Parvo–Magno Retina Model 46 3.5.4 Event-Based Intensity-Coding Imagers (Octopus and TTFS) 48 3.5.5 Spatial Contrast and Orientation Vision Sensor (VISe) 50 3.6 Silicon Retina Pixels 54 3.6.1 DVS Pixel 54 3.6.2 ATIS Pixel 56 3.6.3 VISe Pixel 58 3.6.4 Octopus Pixel 59 3.7 New Specifications for Silicon Retinas 60 3.7.1 DVS Response Uniformity 60 3.7.2 DVS Background Activity 62 3.7.3 DVS Dynamic Range 62 3.7.4 DVS Latency and Jitter 63 3.8 Discussion 64 References 67 4 Silicon Cochleas 71 4.1 Introduction 72 4.2 Cochlea Architectures 75 4.2.1 Cascaded 1D 76 4.2.2 Basic 1D Silicon Cochlea 77 4.2.3 2D Architecture 78 4.2.4 The Resistive (Conductive) Network 79 4.2.5 The BM Resonators 80 4.2.6 The 2D Silicon Cochlea Model 80 4.2.7 Adding the Active Nonlinear Behavior of the OHCs 82 4.3 Spike-Based Cochleas 83 4.3.1 Q-control of AEREAR2 Filters 85 4.3.2 Applications: Spike-Based Auditory Processing 86 4.4 Tree Diagram 87 4.5 Discussion 87 References 89 5 Locomotion Motor Control 91 5.1 Introduction 92 5.1.1 Determining Functional Biological Elements 92 5.1.2 Rhythmic Motor Patterns 93 5.2 Modeling Neural Circuits in Locomotor Control 95 5.2.1 Describing Locomotor Behavior 96 5.2.2 Fictive Analysis 97 5.2.3 Connection Models 99 5.2.4 Basic CPG Construction 100 5.2.5 Neuromorphic Architectures 102 5.3 Neuromorphic CPGs at Work 108 5.3.1 A Neuroprosthesis: Control of Locomotion in Vivo 109 5.3.2 Walking Robots 111 5.3.3 Modeling Intersegmental Coordination 112 5.4 Discussion 113 References 115 6 Learning in Neuromorphic Systems 119 6.1 Introduction: Synaptic Connections, Memory, and Learning 120 6.2 Retaining Memories in Neuromorphic Hardware 121 6.2.1 The Problem of Memory Maintenance: Intuition 121 6.2.2 The Problem of Memory Maintenance: Quantitative Analysis 122 6.2.3 Solving the Problem of Memory Maintenance 124 6.3 Storing Memories in Neuromorphic Hardware 128 6.3.1 Synaptic Models for Learning 128 6.3.2 Implementing a Synaptic Model in Neuromorphic Hardware 132 6.4 Toward Associative Memories in Neuromorphic Hardware 136 6.4.1 Memory Retrieval in Attractor Neural Networks 137 6.4.2 Issues 142 6.5 Attractor States in a Neuromorphic Chip 143 6.5.1 Memory Retrieval 143 6.5.2 Learning Visual Stimuli in Real Time 145 6.6 Discussion 148 References 149 Part II BUILDING NEUROMORPHIC SYSTEMS 153 7 Silicon Neurons 155 7.1 Introduction 156 7.2 Silicon Neuron Circuit Blocks 158 7.2.1 Conductance Dynamics 158 7.2.2 Spike-Event Generation 159 7.2.3 Spiking Thresholds and Refractory Periods 161 7.2.4 Spike-Frequency Adaptation and Adaptive Thresholds 162 7.2.5 Axons and Dendritic Trees 164 7.2.6 Additional Useful Building Blocks 165 7.3 Silicon Neuron Implementations 166 7.3.1 Subthreshold Biophysically Realistic Models 166 7.3.2 Compact I&F Circuits for Event-Based Systems 169 7.3.3 Generalized I&F Neuron Circuits 170 7.3.4 Above Threshold, Accelerated-Time, and Switched-Capacitor Designs 174 7.4 Discussion 176 References 180 8 Silicon Synapses 185 8.1 Introduction 186 8.2 Silicon Synapse Implementations 188 8.2.1 Non Conductance-Based Circuits 188 8.2.2 Conductance-Based Circuits 198 8.2.3 NMDA Synapse 200 8.3 Dynamic Plastic Synapses 201 8.3.1 Short-Term Plasticity 201 8.3.2 Long-Term Plasticity 203 8.4 Discussion 213 References 215 9 Silicon Cochlea Building Blocks 219 9.1 Introduction 219 9.2 Voltage-Domain Second-Order Filter 220 9.2.1 Transconductance Amplifier 220 9.2.2 Second-Order Low-Pass Filter 222 9.2.3 Stability of the Filter 223 9.2.4 Stabilised Second-Order Low-Pass Filter 225 9.2.5 Differentiation 225 9.3 Current-Domain Second-Order Filter 227 9.3.1 The Translinear Loop 227 9.3.2 Second-Order Tau Cell Log-Domain Filter 229 9.4 Exponential Bias Generation 230 9.5 The Inner Hair Cell Model 233 9.6 Discussion 234 References 234 10 Programmable and Configurable Analog Neuromorphic ICs 237 10.1 Introduction 238 10.2 Floating-Gate Circuit Basics 238 10.3 Floating-Gate Circuits Enabling Capacitive Circuits 238 10.4 Modifying Floating-Gate Charge 242 10.4.1 Electron Tunneling 242 10.4.2 pFET Hot-Electron Injection 242 10.5 Accurate Programming of Programmable Analog Devices 244 10.6 Scaling of Programmable Analog Approaches 246 10.7 Low-Power Analog Signal Processing 247 10.8 Low-Power Comparisons to Digital Approaches: Analog Computing in Memory 249 10.9 Analog Programming at Digital Complexity: Large-Scale Field Programmable Analog Arrays 251 10.10 Applications of Complex Analog Signal Processing 253 10.10.1 Analog Transform Imagers 253 10.10.2 Adaptive Filters and Classifiers 253 10.11 Discussion 256 References 257 11 Bias Generator Circuits 261 11.1 Introduction 261 11.2 Bias Generator Circuits 263 11.2.1 Bootstrapped Current Mirror Master Bias Current Reference 263 11.2.2 Master Bias Power Supply Rejection Ratio (PSRR) 265 11.2.3 Stability of the Master Bias 265 11.2.4 Master Bias Startup and Power Control 266 11.2.5 Current Splitters: Obtaining a Digitally Controlled Fraction of the Master Current 267 11.2.6 Achieving Fine Monotonic Resolution of Bias Currents 271 11.2.7 Using Coarse–Fine Range Selection 273 11.2.8 Shifted-Source Biasing for Small Currents 274 11.2.9 Buffering and Bypass Decoupling of Individual Biases 275 11.2.10 A General Purpose Bias Buffer Circuit 278 11.2.11 Protecting Bias Splitter Currents from Parasitic Photocurrents 279 11.3 Overall Bias Generator Architecture Including External Controller 279 11.4 Typical Characteristics 280 11.5 Design Kits 281 11.6 Discussion 282 References 282 12 On-Chip AER Communication Circuits 285 12.1 Introduction 286 12.1.1 Communication Cycle 286 12.1.2 Speedup in Communication 287 12.2 AER Transmitter Blocks 289 12.2.1 AER Circuits within a Pixel 289 12.2.2 Arbiter 290 12.2.3 Other AER Blocks 295 12.2.4 Combined Operation 297 12.3 AER Receiver Blocks 298 12.3.1 Chip-Level Handshaking Block 298 12.3.2 Decoder 299 12.3.3 Handshaking Circuits in Receiver Pixel 300 12.3.4 Pulse Extender Circuits 301 12.3.5 Receiver Array Peripheral Handshaking Circuits 301 12.4 Discussion 302 References 303 13 Hardware Infrastructure 305 13.1 Introduction 306 13.1.1 Monitoring AER Events 307 13.1.2 Sequencing AER Events 311 13.1.3 Mapping AER Events 313 13.2 Hardware Infrastructure Boards for Small Systems 316 13.2.1 Silicon Cortex 316 13.2.2 Centralized Communication 317 13.2.3 Composable Architecture Solution 318 13.2.4 Daisy-Chain Architecture 324 13.2.5 Interfacing Boards using Serial AER 324 13.2.6 Reconfigurable Mesh-Grid Architecture 328 13.3 Medium-Scale Multichip Systems 329 13.3.1 Octopus Retina + IFAT 329 13.3.2 Multichip Orientation System 332 13.3.3 CAVIAR 335 13.4 FPGAs 340 13.5 Discussion 342 References 345 14 Software Infrastructure 349 14.1 Introduction 349 14.1.1 Importance of Cross-Community Commonality 350 14.2 Chip and System Description Software 350 14.2.1 Extensible Markup Language 351 14.2.2 NeuroML 351 14.3 Configuration Software 352 14.4 Address Event Stream Handling Software 352 14.4.1 Field-Programmable Gate Arrays 353 14.4.2 Structure of AE Stream Handling Software 353 14.4.3 Bandwidth and Latency 353 14.4.4 Optimization 354 14.4.5 Application Programming Interface 355 14.4.6 Network Transport of AE Streams 355 14.5 Mapping Software 356 14.6 Software Examples 357 14.6.1 ChipDatabase – A System for Tuning Neuromorphic aVLSI Chips 357 14.6.2 Spike Toolbox 359 14.6.3 jAER 359 14.6.4 Python and PyNN 360 14.7 Discussion 363 References 363 15 Algorithmic Processing of Event Streams 365 15.1 Introduction 365 15.2 Requirements for Software Infrastructure 367 15.2.1 Processing Latency 369 15.3 Embedded Implementations 369 15.4 Examples of Algorithms 370 15.4.1 Noise Reduction Filters 370 15.4.2 Time-Stamp Maps and Subsampling by Bit-Shifting Addresses 372 15.4.3 Event Labelers as Low-Level Feature Detectors 372 15.4.4 Visual Trackers 374 15.4.5 Event-Based Audio Processing 378 15.5 Discussion 379 References 379 16 Towards Large-Scale Neuromorphic Systems 381 16.1 Introduction 381 16.2 Large-Scale System Examples 382 16.2.1 Spiking Neural Network Architecture 382 16.2.2 Hierarchical AER 384 16.2.3 Neurogrid 386 16.2.4 High Input Count Analog Neural Network System 388 16.3 Discussion 390 References 391 17 The Brain as Potential Technology 393 17.1 Introduction 393 17.2 The Nature of Neuronal Computation: Principles of Brain Technology 395 17.3 Approaches to Understanding Brains 396 17.4 Some Principles of Brain Construction and Function 398 17.5 An Example Model of Neural Circuit Processing 400 17.6 Toward Neuromorphic Cognition 402 References 404 Index 407
£76.46
John Wiley & Sons Inc Networking and Online Games
Book SynopsisThe computer game industry is clearly growing in the direction of multiplayer, online games. Understanding the demands of games on IP (Internet Protocol) networks is essential for ISP (Internet Service Provider) engineers to develop appropriate IP services. Correspondingly, knowledge of the underlying network''s capabilities is vital for game developers. Networking and Online Games concisely draws together and illustrates the overlapping and interacting technical concerns of these sectors. The text explains the principles behind modern multiplayer communication systems and the techniques underlying contemporary networked games. The traffic patterns that modern games impose on networks, and how network performance and service level limitations impact on game designers and player experiences, are covered in-depth, giving the reader the knowledge necessary to develop better gaming products and network services. Examples of real-world multiplayer online games illustrate the theoTable of ContentsAuthor Biographies. Acknowledgements. 1 Introduction. 2 Early Online and Multiplayer Games. 2.1 Defining Networked and Multiplayer Games. 2.2 Early Multiplayer Games. 2.3 Multiplayer Network Games. 3 Recent Online and Multiplayer Games. 3.1 Communication Architectures. 3.2 The Evolution of Online Games. 3.3 Summary of Growth of Online Games. 3.4 The Evolution of Online Game Platforms. 3.5 Context of Computer Games. 4 Basic Internet Architecture. 4.1 IP Networks as seen from the Edge. 4.2 Connectivity and Routing. 4.3 Address Management. 5 Network Latency, Jitter and Loss. 5.1 The Relevance of Latency, Jitter and Loss. 5.2 Sources of Latency, Jitter and Loss in the Network. 5.3 Network Control of Lag, Jitter and Loss. 5.4 Measuring Network Conditions. 6 Latency Compensation Techniques. 6.1 The Need for Latency Compensation. 6.2 Prediction. 6.3 Time Manipulation. 6.4 Visual Tricks. 6.5 Latency Compensation and Cheating. 7 Playability versus Network Conditions and Cheats. 7.1 Measuring Player Tolerance for Network Disruptions. 7.2 Communication Models, Cheats and Cheat-Mitigation. 8 Broadband Access Networks. 8.1 What Broadband Access Networks are and why they Matter. 8.2 Access Network Protocols and Standards. 8.3 Cable Networks. 8.4 ADSL Networks. 8.5 Wireless LANs. 8.6 Cellular Networks. 8.7 Bluetooth Networks. 8.8 Conclusion. 9 Where Do Players Come from and When? 9.1 Measuring Your Own Game Traffic. 9.2 Hourly and Daily Game-play Trends. 9.3 Server-discovery (Probe Traffic) Trends. 9.4 Mapping Traffic to Player Locations. 10 Online Game Traffic Patterns. 10.1 Measuring Game Traffic with Timestamping Errors. 10.2 Sub-second Characteristics. 10.3 Sub-second Packet-size Distributions. 10.4 Sub-Second Inter-Packet Arrival Times. 10.5 Estimating the Consequences. 10.6 Simulating Game Traffic. 11 Future Directions. 11.1 Untethered. 11.2 Quality of Service. 11.3 New Architectures. 11.4 Cheaters Beware. 11.5 Augmented Reality. 11.6 Massively Multiplayer. 11.7 Pickup and Putdown. 11.8 Server Browsers. 12 Setting Up Online FPS Game Servers. 12.1 Considerations for an Online Game Server. 12.2 Wolfenstein Enemy Territory. 12.3 Half-Life 2. 12.4 Configuring FreeBSD’s Linux-compatibility Mode. 13 Conclusion. 13.1 Networking Fundamentals. 13.2 Game Technologies and Development. 13.3 A Note Regarding Online Sources. Index.
£77.36
John Wiley & Sons Inc Customer Intelligence
Book SynopsisDeveloped from the authors'' experience working with firms seeking to build better business intelligence, The Customer Information Wars is concerned with who will own and control information about customers and who will develop the best skills and capabilities to exploit it for competitive advantage. At its core, it attempts to explain why the age of information has failed to live up to its own hype of specialization, personalization over homogenization, and consistently satisfying customers.Trade Review"Kelly's elegant, jargon-free style and compelling arguments make the work read like a whodunnit..." (Journal of Direct, Data and Digital Marketing Practice, March 2006) "... this book is indispensable" (The Marketer, April 2006) "it should still prove equally inspiring [as his previous book, Data Warehousing]" (Information Age, April 2006) "... succeeds in crystallising a radical change in marketing...." (Journal of Direct Data & Digital Marketing Practise, June 2006)Table of ContentsForeword by Malcolm McDonald xi Acknowledgements xiii Introduction xv Part I The Decade of Customer Information Exploitation: 1990–2000 1 Chapter 1 The Concept of Customer Intelligence: From Product to Customer 3 Chapter 2 Achieving an Intelligence Capability: From Data to Knowledge 37 Chapter 3 The Eclipse of Mass Marketing: From Many to One 77 Chapter 4 Achieving Segmentation and Differentiation: From Fuzzy to Focused 105 Part II The Decade of Customer Information Exchange: 2000–2010 129 Chapter 5 The Collapse of Time: From Lapsed to Real 131 Chapter 6 Customer Privacy and Confidentiality: From Surveillance to Permission 155 Chapter 7 Closing the Loop: From Monologue to Dialogue 185 Chapter 8 The New Practice of Marketing: From Selling to Buying 203 Notes 229 Index 237
£45.59
John Wiley & Sons Inc Intelligent Bioinformatics
Book SynopsisBioinformatics is contributing to some of the most important advances in medicine and biology.At the forefront of this exciting new subject are techniques known as artificial intelligence which are inspired by the way in which naturesolves the problems it faces.This book provides a unique insight into the complex problems of bioinformatics and the innovative solutions which make up intelligent bioinformatics'. Intelligent Bioinformatics requires only rudimentary knowledge of biology, bioinformatics or computer science and is aimed at interested readers regardless of discipline.Three introductory chapters on biology, bioinformatics and the complexities of search and optimisation equip the reader with the necessary knowledge to proceed through the remaining eight chapters, each of which is dedicated to an intelligent technique in bioinformatics. The book also contains many links to software and information available on the internet, in academic journals and beyonTrade Review"... coverage of problems and techniques are such that more advanced practitioners' might clearly find interest in parts of this book." (Genetic Programming in Evolvable Machinery, Oct 2006)Table of ContentsPreface ix Acknowledgement xi PART 1 INTRODUCTION 1 1 Introduction to the Basics of Molecular Biology 3 1.1 Basic cell architecture 3 1.2 The structure, content and scale of deoxyribonucleic acid (DNA) 4 1.3 History of the human genome 9 1.4 Genes and proteins 10 1.5 Current knowledge and the ‘central dogma’ 21 1.6 Why proteins are important 23 1.7 Gene and cell regulation 24 1.8 When cell regulation goes wrong 26 1.9 So, what is bioinformatics? 27 1.10 Summary of chapter 28 1.11 Further reading 29 2 Introduction to Problems and Challenges in Bioinformatics 31 2.1 Introduction 31 2.2 Genome 31 2.3 Transcriptome 40 2.4 Proteome 50 2.5 Interference technology, viruses and the immune system 57 2.6 Summary of chapter 63 2.7 Further reading 64 3 Introduction to Artificial Intelligence and Computer Science 65 3.1 Introduction to search 65 3.2 Search algorithms 66 3.3 Heuristic search methods 72 3.4 Optimal search strategies 76 3.5 Problems with search techniques 83 3.6 Complexity of search 84 3.7 Use of graphs in bioinformatics 86 3.8 Grammars, languages and automata 90 3.9 Classes of problems 96 3.10 Summary of chapter 98 3.11 Further reading 99 PART 2 CURRENT TECHNIQUES 101 4 Probabilistic Approaches 103 4.1 Introduction to probability 103 4.2 Bayes’ Theorem 105 4.3 Bayesian networks 111 4.4 Markov networks 116 4.5 Summary of chapter 125 4.6 References 126 5 Nearest Neighbour and Clustering Approaches 127 5.1 Introduction 127 5.2 Nearest neighbour method 130 5.3 Nearest neighbour approach for secondary structure protein folding prediction 132 5.4 Clustering 135 5.5 Advanced clustering techniques 138 5.6 Application guidelines 144 5.7 Summary of chapter 145 5.8 References 146 6 Identification (Decision) Trees 147 6.1 Method 147 6.2 Gain criterion 152 6.3 Over fitting and pruning 157 6.4 Application guidelines 160 6.5 Bioinformatics applications 163 6.6 Background 169 6.7 Summary of chapter 170 6.8 References 170 7 Neural Networks 173 7.1 Method 173 7.2 Application guidelines 185 7.3 Bioinformatics applications 187 7.4 Background 192 7.5 Summary of chapter 193 7.6 References 193 8 Genetic Algorithms 195 8.1 Single-objective genetic algorithms – method 195 8.2 Single-objective genetic algorithms – example 202 8.3 Multi-objective genetic algorithms – method 205 8.4 Application guidelines 207 8.5 Genetic algorithms – bioinformatics applications 210 8.6 Summary of chapter 217 8.7 References and further reading 217 PART 3 FUTURE TECHNIQUES 219 9 Genetic Programming 221 9.1 Method 221 9.2 Application guidelines 230 9.3 Bioinformatics applications 232 9.4 Background 236 9.5 Summary of chapter 236 9.6 References 237 10 Cellular Automata 239 10.1 Method 239 10.2 Application guidelines 245 10.3 Bioinformatics applications 247 10.4 Background 251 10.5 Summary of chapter 252 10.6 References and further reading 252 11 Hybrid Methods 255 11.1 Method 255 11.2 Neural-genetic algorithm for analysing gene expression data 256 11.3 Genetic algorithm and k nearest neighbour hybrid for biochemistry solvation 262 11.4 Genetic programming neural networks for determining gene – gene interactions in epidemiology 265 11.5 Application guidelines 268 11.6 Conclusions 268 11.7 Summary of chapter 269 11.8 References and further reading 269 Index 271
£117.75
John Wiley & Sons Inc Hdbk of Virtual Humans
Book SynopsisVirtual humans are becoming more and more popular and used in many applications such as the entertainment industry (in both film and games) and medical applications.Table of ContentsPreface. List of Contributors. List of Figures. List of Tables. 1. An Overview of Virtual Humans (Nadia Magnenat Thalmann and Daniel Thalmann). 2. Face Cloning and Face Motion Capture (Wonsook Lee, Taro Goto, Sumedha Kshirsagar, Tom Molet). 3. Body Cloning and Body Motion Capture (Pascal Fua, Ralf Plaenkers, WonSook Lee, Tom Molet). 4. Anthropometric Body Modeling (Hyewon Seo). 5. Body Motion Control (Ronan Boulic, Paolo Baerlocher). 6. Facial Deformation Models (Prem Kalra, Stephane Garchery, Sumedha Kshirsagar). 7. Body Deformations (Amaury Aubel). 8. Hair Simulation (Sunil Hadap). 9. Cloth Simulation (Pascal Volino, Frédéric Cordier). 10. Expressive Speech Animation and Facial Communication (Sumedha Kshirsagar, Arjan Egges, Stéphane Garchery). 11. Behavioral Animation (Jean-Sébastien Monzani, Anthony Guye-Vuilleme, Etienne de Sevin). 12. Body Gesture Recognition and Action Response (Luc Emering, Bruno Herbelin). 13. Interaction with 3-D Objects (Marcello Kallmann). 14. Groups and Crowd Simulation (Soraia Raupp Musse, Branislav Ulicny, Amaury Aubel). 15. Rendering of Skin and Clothes (Neeharika Adabala). 16. Standards for Virtual Humans (Stéphane Garchery, Ronan Boulic, Tolga Capin, Prem Kalra). Appendix A: Damped Least Square Pseudo-Inverse J+A. Appendix B: H-Anim Joint and Segment Topology. Appendix C: Facial Animation Parameter Set . References. Index.
£133.16
John Wiley & Sons Inc Network Congestion Control Managing Internet
Book SynopsisAs the Internet becomes increasingly heterogeneous, the issue of congestion control becomes ever more important. In order to maintain good network performance, mechanisms must be provided to prevent the network from being congested for any significant period of time.Trade Review"…a good supplement to the companion toolbox…" (Computing Reviews.com, May 19, 2006)Table of ContentsForeword. Preface. List of Tables. List of Figures. 1. Introduction . 1.1 Who should read this book? 1.2 Contents. 1.3 Structure. 2. Congestion control principles. 2.1 What is congestion? 2.2 Congestion collapse. 2.3 Controlling congestion: design considerations. 2.4 Implicit feedback. 2.5 Source behaviour with binary feedback. 2.6 Stability. 2.7 Rate-based versus window-based control. 2.8 RTT estimation. 2.9 Traffic phase effects. 2.10 Queue management. 2.11 Scalability. 2.12 Explicit feedback. 2.13 Special environments. 2.14 Congestion control and OSI layers. 2.15 Multicast congestion control. 2.16 Incentive issues. 2.17 Fairness. 2.18 Conclusion. 3. Present technology. 3.1 Introducing TCP. 3.2 TCP window management. 3.3 TCP RTO calculation. 3.4 TCP congestion control and reliability. 3.5 Concluding remarks about TCP. 3.6 The Stream Control Transmission Protocol (SCTP). 3.7 Random Early Detection (RED). 3.8 The ATM‘Available Bit Rate’ service. 4. Experimental enhancements. 4.1 Ensuring appropriate TCP behaviour. 4.2 Maintaining congestion state. 4.3 Transparent TCP improvements. 4.4 Enhancing active queue management. 4.5 Congestion control for multimedia applications. 4.6 Better-than-TCP congestion control. 4.7 Congestion control in special environments. 5. Internet traffic management – the ISP perspective. 5.1 The nature of Internet traffic. 5.2 Traffic engineering. 5.3 Quality of Service (QoS). 5.4 Putting it all together. 6. The future of Internet congestion control. 6.1 Small deltas or big ideas? 6.2 Incentive issues. 6.3 Tailor-made congestion control. Appendix A: Teaching congestion control with tools. A.1 CAVT. A.1.1 Writing script. A.1.2 Teaching with CAVT. A.1.3 Internals. A.2 ns. A.2.1 Using ns for teaching: the problem. A.2.2 Using ns for teaching: the solution. A.2.3 NSBM. A.2.4 Example exercises. Appendix B: Related IETF work. B.1 Overview. B.2 Working groups. B.3 Finding relevant documents. Appendix C: List of abbreviations. Bibliography. Index.
£95.36
John Wiley & Sons Inc ModelDriven Software Development
Book SynopsisModel-Driven Software Development (MDSD) is currently a highly regarded development paradigm among developers and researchers. With the advent of OMG's MDA and Microsoft's Software Factories, the MDSD approach has moved to the centre of the programmer's attention, becoming the focus of conferences such as OOPSLA, JAOO and OOP.Table of ContentsPart I: Introduction. 1. Introduction. 2. MDSD – Basic Ideas and Terminology. 3. Case Study: A Typical Web Application. 4. Concept Formation. 5. Classification. Part II: Domain Architectures. 6. Metamodeling. 7. MDSD-Capable Target Architectures. 8. Building Domain Architectures. 9. Code Generation Techniques. 10. Model Transformation Techniques. 11. MDSD Tools: Roles, Architecture, Selection Criteria, and Pointers. 12. The MDA Standard. Part III: Processes and Engineering. 13. MDSD Process Building Blocks and Best Practices. 14. Testing. 15. Versioning. 16. Case Study: Embedded Component Infrastructures. 17. Case Study: An Enterprise System. Part IV: Management. 18. Decision Support. 1.9 Organizational Aspects. 20. Adoption Strategies for MDSD. References. Index.
£36.00
John Wiley & Sons Inc Semantic Web Technologies
Book SynopsisChampioned by the 3W Consortium, the Semantic Web is a highly significant initiative affecting the future of the World Wide Web. SEKT is a ?12 million EU project with the aim to develop and exploit the knowledge technologies that underlie Next Generation Knowledge Management.Trade Review"The authors have created an easy-to-read, exampled-based book on the semantic Web that will be useful to students, practitioners, researchers, and novices alike. I highly recommend it to all professionals with an interest in this field." (Computing Reviews, March 13, 2008) "…readers interested in developing ontologies for reasoning will get a strong foundation and direction to begin their journeys on the Semantic Web." (CHOICE, March 2007) "…an interesting, well-written computer science textbook that is well worth reading by anyone interested in the semantic Web." (Computing Reviews.com, March 2, 2007) "…a good exposition on the state of the art in semantic Web research." (Computing Reviews.com, January 17, 2007) "…a useful addition to a Semantic Web library." (www.freepint.com, 5th October 2006)Table of ContentsForeword. 1. Introduction. 1.1. Semantic Web Technologies. 1.2. The Goal of the Semantic Web. 1.3. Ontologies and Ontology Languages. 1.4. Creating and Managing Ontologies. 1.5. Using Ontologies. 1.6. Applications. 1.7. Developing the Semantic Web. References. 2. Knowledge Discovery for Ontology Construction. 2.1. Introduction. 2.2. Knowledge Discovery. 2.3. Ontology Definition. 2.4. Methodology for Semi-automatic Ontology Construction. 2.5. Ontology Learning Scenarios. 2.6. Using Knowledge Discovery for Ontology Learning. 2.7. Related Work on Ontology Construction. 2.8. Discussion and Conclusion. Acknowledgments. References. 3. Semantic Annotation and Human Language Technology. 3.1. Introduction. 3.2. Information Extraction: A Brief Introduction. 3.3. Semantic Annotation. 3.4. Applying ‘Traditional’ IE in Semantic Web Applications. 3.5. Ontology-based IE. 3.6. Deterministic Ontology Authoring using Controlled Language IE. 3.7. Conclusion. References. 4. Ontology Evolution. 4.1. Introduction. 4.2. Ontology Evolution: State-of-the-art. 4.3. Logical Architecture. 4.4. Data-driven Ontology Changes. 4.5. Usage-driven Ontology Changes. 4.6. Conclusion. References. 5. Reasoning With Inconsistent Ontologies: Framework, Prototype, and Experiment. 5.1. Introduction. 5.2. Brief Survey of Approaches to Reasoning with Inconsistency. 5.3. Brief Survey of Causes for Inconsistency in the Semantic WEB. 5.4. Reasoning with Inconsistent Ontologies. 5.5. Selection Functions. 5.6. Strategies for Selection Functions. 5.7. Syntactic Relevance-Based Selection Functions. 5.8. Prototype of Pion. 5.9. Discussion and Conclusions. Acknowledgment. References. 6. Ontology Mediation, Merging, and Aligning. 6.1. Introduction. 6.2. Approaches in Ontology Mediation. 6.3. Mapping and Querying Disparate Knowledge Bases. 6.4. Summary. References. 7. Ontologies for Knowledge Management. 7.1. Introduction. 7.2. Ontology usage Scenario. 7.3. Terminology. 7.4. Ontologies as RDBMS Schema. 7.5. Topic-ontologies versus Schema-ontologies. 7.6. Proton Ontology. 7.7. Conclusion. References. 8. Semantic Information Access. 8.1. Introduction. 8.2. Knowledge Access and the Semantic WEB. 8.3. Natural Language Generation from Ontologies. 8.4. Device Independence: Information Anywhere. 8.5. SEKTAgent. 8.6. Concluding Remarks. References. 9. Ontology Engineering Methodologies. 9.1. Introduction. 9.2. The Methodology Focus. 9.3. Past and Current Research. 9.4. Diligent Methodology. 9.5. First Lessons Learned. 9.6. Conclusion and Next Steps. References. 10. Semantic Web Services—Approaches and Perspectives. 10.1. Semantic Web Services—A Short Overview. 10.2. The WSMO Approach. 10.3. The OWL-S Approach. 10.4. The SWSF Approach. 10.5. The IRS-III Approach. 10.6. The WSDL-S Approach. 10.7. Semantic Web Services Grounding: The Link Between The SWS and Existing Web Services Standards. 10.8. Conclusions and Outlook. References. 11. Applying Semantic Technology to a Digital Library. 11.1. Introduction. 11.2. Digital Libraries: The State-of-the-art. 11.3. A Case Study: the BT Digital Library. 11.4. The Users’ View. 11.5. Implementing Semantic Technology in a Digital Library. 11.6. Future Directions. References. 12. Semantic Web: A Legal Case Study. 12.1. Introduction. 12.2. Profile of The Users. 12.3. Ontologies for Legal Knowledge. 12.4. Architecture. 12.5. Conclusions. References. 13. A Semantic Service Oriented Architecture for the Telecommunications Industry. 13.1. Introduction. 13.2. Introduction to Service Oriented Architectures. 13.3. A Semantic Service Orientated Architecture. 13.4. Semantic Mediation. 13.5. Standards and Ontologies in Telecommunications. 13.6. Case Study. 13.7. Conclusion. References. 14. Conclusion and Outlook. 14.1. Management of Networked Ontologies. 14.2. Engineering of Networked Ontologies. 14.3. Contextualizing Ontologies. 14.4. Cross Media Resources. 14.5. Social Semantic Desktop. 14.6. Applications. Index.
£95.36
John Wiley & Sons Inc Fundamental Modeling Concepts Effective
Book SynopsisTo develop information processing systems requires effective and efficient communication between many people. In order to understand requirements and design decisions, there is a need for a common conceptual model of the system: one that represents the architecture of the system.Table of ContentsForeword. Preface. 1 Introduction. 1.1 The need for communication. 1.2 The FMC Idea. 1.3 Outline of this book. 2 Compositional Structures. 2.1 An example: The travel agency. 2.2 Modeling the structure of a system. 2.3 Agents accessing storages. 2.4 Agents communicate via channels. 2.5 Summary. 2.6 Exercises. 3 Dynamic Structures. 3.1 Petrinets: Basic principles. 3.2 Conflicts and conditions. 3.3 Basic patterns. 3.4 Responsibilities and scope boundaries. 3.5 Summary. 3.6 Exercises. 4 Value Structures and Mind Maps. 4.1 Entity sets and relationships. 4.2 Cardinalities. 4.3 Predicates and roles. 4.4 Partitions. 4.5 Reification. 4.6 Summary. 4.7 Exercises. 5 FMC Basics: Summary. 6 Reinforcing the Concepts. 6.1 The meta model: A mind map to FMC. 6.2 Operational versus control state. 6.3 Block diagrams: Advanced concepts. 6.4 Petrinets: Advanced concepts. 6.5 Non-hierarchical transformations and semantic layers. 6.6 Exercises. 7 Towards Implementation Structures. 7.1 System structure versus software structure. 7.2 From Processor to processes. 7.3 Distribution, concurrency and synchronization. 7.4 From FMC to objects and classes. 7.5 Conceptual patterns versus software patterns. 8 Applying FMC in Your Daily Work. 8.1 Becoming comfortable with FMC. 8.2 Describing existing systems with FMC. 8.3 Using FMC in construction. 8.4 Using FMCdiagrams to support communication. 8.5 Guidelines for didactical modeling. 8.6 Cost and benefit of modeling. 9 Modeling and Visualization Guidelines. 9.1 Introduction. 9.2 Increasingt he reader’s perception. 9.3 Increasing comprehension. 9.4 Secondary notation, patterns and pitfalls. 10 Relationship with Other Modeling Approaches. 10.1 Comparing FMC with Structured Analysis. 10.2 FMC and the Unified Modeling Language. 11 A System of Server Patterns 247 11.1 Applicationdomain. 11.2 A pattern language for request processing servers. 11.3 Example applications. 11.4 Conclusion and further research. Epilogue. A Solutions. B Reference Sheets. C Glossary. References. Index.
£31.50
John Wiley & Sons Inc Security in Wireless AD Hoc and Sensor Networks
Book SynopsisThis advanced book is a comprehensive guide to security issues in wireless ad hoc and sensor networks. The book is organized into two main sections. The first, gives an introduction to the fundamentals and key issues related to wireless ad hoc networking, with an emphasis on security related issues.Table of ContentsAbout the Authors. Preface. Acknowledgements. List of Acronyms. Part One Wireless Ad Hoc, Sensor and Mesh Networking. 1 Introduction. 1.1 Information Security. 1.2 Scope of the Book. 1.3 Structure of the Book. 1.4 Electronic Resources for the Book. 1.5 Review Questions. 2 Wireless Ad Hoc, Sensor and Mesh Networks. 2.1 Ad Hoc Networks and Applications. 2.2 Sensor and Actuator Networks. 2.3 Mesh Networks. 2.4 Tactical Communications and Networks. 2.5 Factors Influencing the Design of Wireless Ad Hoc, Sensor and Mesh Networks. .6 Review Questions. 3 The Wireless Medium. 3.1 Wireless Channel Fundamentals and Security. 3.2 Advanced Radio Technologies. 3.3 Review Questions. 4 Medium Access and Error Control. 4.1 Medium Access Control. 4.2 Error Control. 4.3 Wireless Metropolitan Area Networks. 4.4 Wireless Local Area Networks. 4.5 Wireless Personal Area Networks. 4.6 Review Questions. 5 Routing. 5.1 Internet Protocol and Mobile IP. 5.2 Routing in Wireless Ad Hoc Networks. 5.3 Routing in Wireless Sensor and Actuator Networks. 5.4 Review Questions. 6 Reliability, Flow and Congestion Control. 6.1 Reliability. 6.2 Flow and Congestion Control. 6.3 Review Questions. 7 Other Challenges and Security Aspects. 7.1 Localization and Positioning. 7.2 Time Synchronization. 7.3 Addressing. 7.4 Data Aggregation and Fusion. 7.5 Data Querying. 7.6 Coverage. 7.7 Mobility Management. 7.8 Cross-layer Design. 7.9 Review Questions. Part Two Security in Wireless Ad Hoc, Sensor and Mesh Networking. 8 Security Attacks in Ad Hoc, Sensor and Mesh Networks. 8.1 Security Attacks. 8.2 Attackers. 8.3 Security Goals. 8.4 Review Questions. 9 Cryptography. 9.1 Symmetric Encryption. 9.2 Asymmetric Encryption. 9.3 Hash Functions and Message Authentication Code. 9.4 Cascading Hashing. 9.5 Review Questions. 10 Challenges and Solutions: Basic Issues. 10.1 Bootstrapping Security in Ad Hoc Networks. 10.2 Bootstrapping Security in Sensor Networks. 10.3 Key Distribution, Exchange and Management. 10.4 Authentication Issues. 10.5 Integrity. 10.6 Review Questions. 11 Challenges and Solutions: Protection. 11.1 Privacy and Anonymity. 11.2 Intrusion Detection. 11.3 Defense Against Traffic Analysis. 11.4 Access Control and Secure Human–Computer Interaction. 11.5 Software-Based Anti-Tamper Techniques. 11.6 Tamper Resilience: Hardware Protection. 11.7 Availability and Plausibility. 11.8 Review Questions. 12 Secure Routing. 12.1 Defense Against Security Attacks in Ad Hoc Routing. 12.2 Secure Ad Hoc Routing Protocols. 12.3 Further Reading. 12.4 Review Questions. 13 Specific Challenges and Solutions. 13.1 SPINS: Security Protocols for Sensor Networks. 13.2 Quarantine Region Scheme for Spam Attacks. 13.3 Secure Charging and Rewarding Scheme. 13.4 Secure Node Localization. 13.5 Secure Time Synchronization. 13.6 Secure Event and Event Boundary Detection. 13.7 Review Questions. 14 Information Operations and Electronic Warfare. 14.1 Electronic Support. 14.2 Electronic Attack. 14.3 Electronic Protection. 14.4 Review Questions. 15 Standards. 15.1 X.800 and RFC 2828. 15.2 Wired Equivalent Privacy (WEP). 15.3 Wi-Fi Protected Access (WPA). References. Index.
£96.85
John Wiley & Sons Inc Raising Venture Capital
Book SynopsisOffering a deep insight into the venture capital deal-making process, Raising Venture Capital also provides valuable introduction to the subject. The book is practical in focus but based on sound academic theory, research and teaching materials gathered over the last 4 years at Tanaka Business School.Table of ContentsPreface xiii Part I The Business of Venture Capital 1 1 Entrepreneurs and Venture Capitalists 3 2 Other People’s Money 9 3 The Limited Partnership 15 4 The Competitive Environment 25 5 The VC's Investment Model 31 Part II Accessing Venture Capital 49 6 Introduction to Part II 51 7 Is Venture Capital the Right Option? 53 8 Choosing a VC Firm 59 9 The Entry Point 65 10 The Investment Process 71 11 Preparing for the Investment Process 81 Part III The VC Term Sheet 99 12 Introduction to Term Sheets 101 13 Business Valuation 121 14 Investment Structure 123 15 Syndication 125 16 Investment Milestones 129 17 Corporate Governance 139 18 Equity Participation 147 19 Share Incentives 169 20 Share Vesting 175 21 Pre-emption Rights on Securities Issues 185 22 Anti-dilution Rights 191 23 Provisions Relating to Share Transfers 203 24 Deal Management Terms 219 Index 229
£44.99
John Wiley & Sons Inc An Introduction to Practical Formal Methods Using
Book SynopsisThis book provides an introduction to formal methods based on temporal logic, describing techniques for testing and developing complex computational systems. It starts with a full introduction to the subject and then goes into more detail, covering the basics of temporal logics in order to give the reader a firm basis on which to progress further.Trade Review“The strength of the book is the nice mixture of a pleasant to read and gentle presentation of the underlying concepts together with detailed tool descriptions (focused on a user's point of view). This book is perfectly suited for a course at senior undergraduate or beginning graduate level.” (Zentralblatt MATH, 1 December 2012) "I highly recommend this book, both for formal methods in general and for temporal logic in particular. It will remain within my easy reach for a long time." (Computing Reviews, 1 December 2011) Table of ContentsPreface vii 1 Introduction 1 1.1 Aims of the book 2 1.2 Why temporal logic? 3 1.3 What is temporal logic? 4 1.4 Structure of the book 6 2 Temporal logic 9 2.1 Intuition 10 2.2 Syntactic aspects 12 2.3 Semantics 14 2.4 Reactive system properties 22 2.5 What is temporal logic? 25 2.6 Normal form 28 2.7 Büchi automata and temporal logic 29 2.8 Advanced topics 37 2.9 Final exercises 47 3 Specification 49 3.1 Describing simple behaviours 49 3.2 A semantics of imperative programs 53 3.3 Linking specifications 60 3.4 Advanced topics 74 3.5 Final exercises 82 3.6 Where to next? 83 4 Deduction 85 4.1 Temporal proof 85 4.2 Clausal temporal resolution 87 4.3 The TSPASS system 108 4.4 Advanced topics 122 4.5 Final exercises 127 5 Model checking 129 5.1 Algorithmic verification 129 5.2 Automata-theoretic model checking 135 5.3 The Spin system 143 5.4 Advanced topics 171 5.5 Final exercises 181 6 Execution 185 6.1 From specifications to programs 185 6.2 MetateM: executing temporal formulae 188 6.3 The Concurrent MetateM system 211 6.4 Advanced topics 233 7 Selected applications 243 7.1 Model checking programs 243 7.2 Security protocol analysis 246 7.3 Recognizing temporal patterns 251 7.4 Parameterized systems 255 7.5 Reasoning with intervals 260 7.6 Planning 264 8 Summary 267 A Review of classical logic 269 A.1 Introduction 269 A.2 Propositional logic 271 A.3 Normal forms 276 A.4 Propositional resolution 279 A.5 Horn clauses 286 A.6 First-order logic 288 B Solutions to exercises 307 References 321 Index 349
£98.95
John Wiley & Sons Inc SelfOrganization in Sensor and Actor Networks
Book SynopsisSelf-Organization in Sensor and Actor Networks explores self-organization mechanisms and methodologies concerning the efficient coordination between intercommunicating autonomous systems.Self-organization is often referred to as the multitude of algorithms and methods that organise the global behaviour of a system based on inter-system communication. Studies of self-organization in natural systems first took off in the 1960s. In technology, such approaches have become a hot research topic over the last 4-5 years with emphasis upon management and control in communication networks, and especially in resource-constrained sensor and actor networks. In the area of ad hoc networks new solutions have been discovered that imitate the properties of self-organization. Some algorithms for on-demand communication and coordination, including data-centric networking, are well-known examples. Key features include: Detailed treatment of self-organization, mobile sensor and actoTable of ContentsForeword. Preface. About the Author. List of Abbreviations. I Self-Organization. 1 Introduction to Self-Organization. 1.1 Understanding self-organization. 1.2 Application scenarios for self-organization. 2 System Management and Control – A Historical Overview. 2.1 System architecture. 2.2 Management and control. 2.2.1 Centralized control. 2.2.2 Distributed systems. 2.2.3 Self-organizing systems. 3 Self-Organization – Context and Capabilities. 3.1 Complex systems. 3.2 Self-organization and emergence. 3.3 Systems lacking self-organization. 3.3.1 External control. 3.3.2 Blueprints and templates. 3.4 Self-X capabilities. 3.5 Consequences of emergent properties. 3.6 Operating self-organizing systems. 3.6.1 Asimov’s Laws of Robotics. 3.6.2 Attractors. 3.7 Limitations of self-organization. 4 Natural Self-Organization. 4.1 Development of understandings. 4.2 Examples in natural sciences. 4.2.1 Biology. 4.2.2 Chemistry. 4.3 Differentiation self-organization and bio-inspired. 4.3.1 Exploring bio-inspired. 4.3.2 Bio-inspired techniques. 4.3.3 Self-organization vs. bio-inspired. 5 Self-Organization in Technical Systems. 5.1 General applicability. 5.1.1 Autonomous systems. 5.1.2 Multi-robot systems. 5.1.3 Autonomic networking. 5.1.4 Mobile Ad Hoc Networks. 5.1.5 Sensor and Actor Networks. 5.2 Operating Sensor and Actor Networks. 6 Methods and Techniques. 6.1 Basic methods. 6.1.1 Positive and negative feedback. 6.1.2 Interactions among individuals and with the environment. 6.1.3 Probabilistic techniques. 6.2 Design paradigms for self-organization. 6.2.1 Design process. 6.2.2 Discussion of the design paradigms. 6.3 Developing nature-inspired self-organizing systems. 6.4 Modeling self-organizing systems. 6.4.1 Overview to modeling techniques. 6.4.2 Differential equation models. 6.4.3 Monte Carlo simulations. 6.4.4 Choosing the right modeling technique. Appendix I Self-Organization – Further Reading. II Networking Aspects: Ad Hoc and Sensor Networks. 7 Mobile Ad Hoc and Sensor Networks. 7.1 Ad hoc networks. 7.1.1 Basic properties of ad hoc networks. 7.1.2 Mobile Ad Hoc Networks. 7.2 Wireless Sensor Networks. 7.2.1 Basic properties of sensor networks. 7.2.2 Composition of single sensor nodes. 7.2.3 Communication in sensor networks. 7.2.4 Energy aspects. 7.2.5 Coverage and deployment. 7.2.6 Comparison between MANETs and WSNs. 7.2.7 Application examples. 7.3 Challenges and research issues. 7.3.1 Required functionality and constraints. 7.3.2 Research objectives. 8 Self-Organization in Sensor Networks. 8.1 Properties and objectives. 8.2 Categorization in two dimensions. 8.2.1 Horizontal dimension. 8.2.2 Vertical dimension. 8.3 Methods and application examples. 8.3.1 Mapping with primary self-organization methods. 8.3.2 Global state. 8.3.3 Location information. 8.3.4 Neighborhood information. 8.3.5 Local state. 8.3.6 Probabilistic techniques. 9 Medium Access Control. 9.1 Contention-based protocols. 9.2 Sensor MAC. 9.2.1 Synchronized listen/sleep cycles. 9.2.2 Performance aspects. 9.2.3 Performance evaluation. 9.3 Power-Control MAC protocol. 9.4 Conclusion. 10 Ad Hoc Routing. 10.1 Overview and categorization. 10.1.1 Address-based routing vs. data-centric forwarding. 10.1.2 Classification of ad hoc routing protocols. 10.2 Principles of ad hoc routing protocols. 10.2.1 Destination Sequenced Distance Vector. 10.2.2 Dynamic Source Routing. 10.2.3 Ad Hoc on Demand Distance Vector. 10.2.4 Dynamic MANET on Demand. 10.3 Optimized route stability. 10.4 Dynamic address assignment. 10.4.1 Overview and centralized assignment. 10.4.2 Passive Duplicate Address Detection. 10.4.3 Dynamic Address Allocation. 10.5 Conclusion. 11 Data-Centric Networking. 11.1 Overview and classification. 11.1.1 Data dissemination. 11.1.2 Network-centric operation. 11.1.3 Related approaches. 11.2 Flooding, gossiping, and optimizations. 11.2.1 Flooding. 11.2.2 Pure gossiping. 11.2.3 Optimized gossiping. 11.3 Agent-based techniques. 11.4 Directed diffusion. 11.4.1 Basic algorithm. 11.4.2 Mobility support. 11.4.3 Energy efficiency. 11.5 Data aggregation. 11.5.1 Principles and objectives. 11.5.2 Aggregation topologies. 11.6 Conclusion. 12 Clustering. 12.1 Principles of clustering. 12.1.1 Requirements and classification. 12.1.2 k-means. 12.1.3 Hierarchical clustering. 12.2 Clustering for efficient routing. 12.2.1 Low-Energy Adaptive Clustering Hierarchy. 12.2.2 Hybrid Energy-Efficient Distributed Clustering Approach. 12.3 Conclusion. Appendix II Networking Aspects – Further reading. III Coordination and Control: Sensor and Actor Networks. 13 Sensor and Actor Networks. 13.1 Introduction. 13.1.1 Composition of SANETs – an example. 13.1.2 Properties and capabilities. 13.1.3 Components of SANET nodes. 13.1.4 Application examples. 13.2 Challenges and research objectives. 13.2.1 Communication and coordination. 13.2.2 Collaboration and task allocation. 13.3 Limitations. 14 Communication and Coordination. 14.1 Synchronization vs. coordination. 14.1.1 Problem statement. 14.1.2 Logical time. 14.1.3 Coordination. 14.2 Time synchronization in WSNs and SANETs. 14.2.1 Requirements and objectives. 14.2.2 Conventional approaches. 14.2.3 Algorithms for WSNs. 14.3 Distributed coordination. 14.3.1 Scalable coordination. 14.3.2 Selected algorithms. 14.3.3 Integrated sensor-actor and actor-actor coordination. 14.3.4 Problems with selfish nodes. 14.4 In-network operation and control. 14.5 Conclusion. 15 Collaboration and Task Allocation. 15.1 Introduction to MRTA. 15.1.1 Primary objectives. 15.1.2 Classification and taxonomy. 15.2 Intentional cooperation – auction-based task allocation. 15.2.1 Open Agent Architecture. 15.2.2 MURDOCH. 15.2.3 Dynamic negotiation algorithm. 15.3 Emergent cooperation. 15.3.2 Stimulation by state. 15.4 Conclusion. Appendix III Coordination and Control – Further reading. IV Self-Organization Methods in Sensor and Actor Networks. 16 Self-Organization Methods – Revisited. 16.1 Self-organization methods in SANETs. 16.2 Positive and negative feedback. 16.3 Interactions among individuals and with the environment . 16.4 Probabilistic techniques. 17 Evaluation Criteria. 17.1 Scalability. 17.2 Energy considerations. 17.2.1 Energy management. 17.2.2 Transmission power management. 17.3 Network lifetime. 17.3.1 Definition of network lifetime. 17.3.2 Scenario-based comparisons of network lifetime. V Bio-inspired Networking. 18 Bio-inspired Systems. 18.1 Introduction and overview. 18.1.1 Ideas and concepts. 18.1.2 Bio-inspired research fields. 18.2 Swarm Intelligence. 18.2.1 Principles of ant foraging. 18.2.2 Ant-based routing. 18.2.3 Ant-based task allocation. 18.3 Artificial Immune System. 18.3.1 Principles of the immune system. 18.3.2 Application examples. 18.4 Cellular signaling pathways. 18.4.1 Introduction to signaling pathways. 18.4.2 Applicability in SANETs. 18.5 Conclusion. Appendix IV Bio-inspired Networking – Further reading. Bibliography. Index.
£93.05
John Wiley & Sons Inc Coding Theory Algorithms Architectures and
Book SynopsisOne of the most important key technologies for digital communication systems as well as storage media is coding theory. It provides a means to transmit information across time and space over noisy and unreliable communication channels.Trade Review"This text provides a unified framework for presenting coding-theory algorithms, signal-processing architectures, and accompanying applications." (Computing Reviews, June 16, 2008) "This book should provide a concise overview of channel coding and applications." (Zentralblatt MATH, 2008)Table of ContentsPreface. 1 Introduction. 1.1 Communication Systems. 1.2 Information Theory. 1.2.1 Entropy. 1.2.2 Channel Capacity. 1.2.3 Binary Symmetric Channel. 1.2.4 AWGN Channel. 1.3 A Simple Channel Code. 2 Algebraic Coding Theory. 2.1 Fundamentals of Block Codes. 2.1.1 Code Parameters. 2.1.2 Maximum Likelihood Decoding. 2.1.3 Binary Symmetric Channel. 2.1.4 Error Detection and Error Correction. 2.2 Linear Block Codes. 2.2.1 Definition of Linear Block Codes. 2.2.2 Generator Matrix. 2.2.3 Parity Check Matrix. 2.2.4 Syndrome and Cosets. 2.2.5 Dual Code. 2.2.6 Bounds for Linear Block Codes. 2.2.7 Code Constructions. 2.2.8 Examples of Linear Block Codes. 2.3 Cyclic Codes. 2.3.1 Definition of Cyclic Codes. 2.3.2 Generator Polynomial. 2.3.3 Parity Check Polynomial. 2.3.4 Dual Codes. 2.3.5 Linear Feedback Shift Registers. 2.3.6 BCH Codes. 2.3.7 Reed-Solomon Codes. 2.3.8 Algebraic Decoding Algorithm. 2.4 Summary. 3 Convolutional Codes. 3.1 Encoding of Convolutional Codes. 3.1.1 Convolutional Encoder. 3.1.2 Generator Matrix in Time-Domain. 3.1.3 State Diagram of a Convolutional Encoder. 3.1.4 Code Termination. 3.1.5 Puncturing. 3.1.6 Generator Matrix in D-Domain. 3.1.7 Encoder Properties. 3.2 Trellis Diagram and Viterbi’s Algorithm. 3.2.1 Minimum Distance Decoding. 3.2.2 Trellises. 3.2.3 Viterbi Algorithm. 3.3 Distance Properties and Error Bounds. 3.3.1 Free Distance. 3.3.2 Active Distances. 3.3.3 Weight Enumerators for Terminated Codes. 3.3.4 Path Enumerators. 3.3.5 Pairwise Error Probability. 3.3.6 Viterbi Bound. 3.4 Soft Input Decoding. 3.4.1 Euclidean Metric. 3.4.2 Support of Punctured Codes. 3.4.3 Implementation Issues. 3.5 Soft Output Decoding. 3.5.1 Derivation of APP Decoding. 3.5.2 APP Decoding in the Log-Domain. 3.6 Convolutional Coding in Mobile Communications. 3.6.1 Coding of Speech Data. 3.6.2 Hybrid ARQ. 3.6.3 EGPRS Modulation and Coding. 3.6.4 Retransmission Mechanism. 3.6.5 Link Adaptation. 3.6.6 Incremental Redundancy. 3.7 Summary. 4 Turbo Codes. 4.1 LDPC Codes. 4.1.1 Codes Based on Sparse Graphs. 4.1.2 Decoding for the Binary Erasure Channel. 4.1.3 Log-Likelihood Algebra. 4.1.4 Belief Propagation. 4.2 A First Encounter with Code Concatenation. 4.2.1 Product Codes. 4.2.2 Iterative Decoding of Product Codes. 4.3 Concatenated Convolutional Codes. 4.3.1 Parallel Concatenation. 4.3.2 The UMTS Turbo Code. 4.3.3 Serial Concatenation. 4.3.4 Partial Concatenation. 4.3.5 Turbo Decoding. 4.4 EXIT Charts. 4.4.1 Calculating an EXIT Chart. 4.4.2 Interpretation. 4.5 Weight Distribution. 4.5.1 Partial Weights. 4.5.2 ExpectedWeight Distribution. 4.6 Woven Convolutional Codes. 4.6.1 Encoding Schemes. 4.6.2 Distance Properties of Woven Codes. 4.6.3 Woven Turbo Codes. 4.6.4 Interleaver Design. 4.7 Summary. 5 Space-Time Codes. 5.1 Introduction. 5.1.1 Digital Modulation Schemes. 5.1.2 Diversity. 5.2 Spatial Channels. 5.2.1 Basic Description. 5.2.2 Spatial Channel Models. 5.2.3 Channel Estimation. 5.3 Performance Measures. 5.3.1 Channel Capacity. 5.3.2 Outage Probability and Outage Capacity. 5.3.3 Ergodic Error Probability. 5.4 Orthogonal Space-Time Block Codes. 5.4.1 Alamouti’s Scheme. 5.4.2 Extension to more than two Transmit Antennas. 5.4.3 Simulation Results. 5.5 Spatial Multiplexing. 5.5.1 General Concept. 5.5.2 Iterative APP Preprocessing and Per-Layer Decoding. 5.5.3 Linear Multi-Layer Detection. 5.5.4 Original Bell Labs Layered Space Time (BLAST) Detection. 5.5.5 QL Decomposition and Interference Cancellation. 5.5.6 Performance of Multi-Layer Detection Schemes. 5.5.7 Unified Description by Linear Dispersion Codes. 5.6 Summary. A. Algebraic Structures. A.1 Groups, Rings and Finite Fields. A.1.1 Groups. A.1.2 Rings. A.1.3 Finite Fields. A.2 Vector Spaces. A.3 Polynomials and Extension Fields. A.4 Discrete Fourier Transform. B. Linear Algebra. C. Acronyms. Bibliography. Index.
£95.36
John Wiley & Sons Inc Programming MultiAgent Systems in Agentspeak
Book SynopsisJason is an Open Source interpreter for an extended version of AgentSpeak a logic-based agent-oriented programming language written in Java. It enables users to build complex multi-agent systems that are capable of operating in environments previously considered too unpredictable for computers to handle. Jason is easily customisable and is suitable for the implementation of reactive planning systems according to the Belief-Desire-Intention (BDI) architecture. Programming Multi-Agent Systems in AgentSpeak using Jasonprovides a brief introduction to multi-agent systems and the BDI agent architecture on which AgentSpeak is based. The authors explain Jason's AgentSpeak variant and provide a comprehensive, practical guide to using Jason to program multi-agent systems. Some of the examples include diagrams generated using an agent-oriented software engineering methodology particularly suited for implementation using BDI-based programming languages. ThTrade Review"This essential guide to ArgentSpeak and Jason will be invaluable to senior undergraduate and post-graduate students." (Zentralblatt Math 1132, August 2008)Table of ContentsPreface. 1 Introduction. 1.1 Autonomous Agents. 1.2 Characteristics of Agents. 1.3 Multi-Agent Systems. 1.4 Hello World! 2 The BDI Agent Model. 2.1 Agent-Oriented Programming. 2.2 Practical Reasoning. 2.3 A Computational Model of BDI Practical Reasoning. 2.4 The Procedural Reasoning System. 2.5 Agent Communication. 3 The Jason Agent Programming Language. 3.1 Beliefs. 3.2 Goals. 3.3 Plans. 3.4 Example: A Complete Agent Program. 3.5 Exercises. 4 Jason Interpreter. 4.1 The Reasoning Cycle. 4.2 Plan Failure. 4.3 Interpreter Configuration and Execution Modes. 4.4 Pre-Defined Plan Annotations. 4.5 Exercises. 5 Environments. 5.1 Support for Defining Simulated Environments. 5.2 Example: Running a System of Multiple Situated Agents. 5.3 Exercises. 6 Communication and Interaction. 6.1 Available Performatives. 6.2 Informal Semantics of Receiving Messages. 6.3 Example: Contract Net Protocol. 6.4 Exercises. 7 User-Defined Components. 7.1 Defining New Internal Actions. 7.2 Customising the Agent Class. 7.3 Customising the Overall Architecture. 7.4 Customising the Belief Base. 7.5 Pre-Processing Directives. 7.6 Exercises. 8 Advanced Goal-Based Programming. 8.1 BDI Programming. 8.2 Declarative (Achievement) Goal Patterns. 8.3 Commitment Strategy Patterns. 8.4 Other Useful Patterns. 8.5 Pre-Processing Directives for Plan Patterns. 9 Case Studies. 9.1 Case Study I: Gold Miners. 9.2 Case Study II: Electronic Bookstore. 10 Formal Semantics. 10.1 Semantic Rules. 10.2 Semantics of Message Exchange in a Multi-Agent System. 10.3 Semantic Rules for Receiving Messages. 10.4 Semantics of the BDI Modalities for AgentSpeak. 11 Conclusions. 11.1 Jason and Agent-Oriented Programming. 11.2 Ongoing Work and Related Research. 11.3 General Advice on Programming Style and Practice. A Reference Guide. A.1 EBNF for the Agent Language. A.2 EBNF for the Multi-Agent Systems Language. A.3 Standard Internal Actions. A.4 Pre-Defined Annotations. A.5 Pre-Processing Directives. A.6 Interpreter Configuration. Bibliography.
£70.16
Wiley Metamodelling for Software Engineering
Book SynopsisThis book focuses on metamodelling as a discipline, exploring its foundations, techniques and results. It presents a comprehensive metamodel that covers process, product and quality issues under a common framework. Issues covered include: An explanation of what metamodelling is and why it is necessary in the context of software engineering.Table of ContentsPreface vii CHAPTER 1 – Software Development Methodologies and Metamodelling 1 1.1 What is a Methodology? 2 1.2 Metamodelling Needs 11 1.3 What is Metamodelling? 17 1.4 Summary 18 References 19 CHAPTER 2 – Modelling Infrastructure 21 2.1 Models and Modelling 21 2.2 Modelling Languages 26 2.3 Categorization Issues 36 2.4 The Relationship Between Models and Metamodels 42 2.5 Infrastructure 44 2.6 Summary 48 References 48 CHAPTER 3 – Using Metamodels 53 3.1 Metamodelling for Modelling Languages 53 3.2 Metamodelling for Processes 58 3.3 Metamodelling for Development Methodologies 62 3.4 Metamodelling for Model Transformation 65 3.5 Using a Metamodelling Infrastructure 68 3.6 Summary 72 References 72 CHAPTER 4 – Problems with Traditional Approaches and Current Products 75 4.1 Terminology and Culture Clashes 76 4.2 Linguistic and Ontological Metamodels 79 4.3 Process and Modelling Conflicts 83 4.4 The Quality Aspect 95 4.5 Solutions and Guidelines 104 4.6 Summary 106 References 106 CHAPTER 5 – New Approaches to Metamodelling 111 5.1 Deep Instantiation-Based Metamodelling 112 5.2 Powertype-Based Metamodelling 114 5.3 Comparison of Powertype Modelling and Potency 126 5.4 Summary 129 References 130 CHAPTER 6 – Software Engineering Metamodel for Development Methodologies 133 6.1 General Philosophy and Scope 133 6.2 High-Level View 141 6.3 Process Aspects 144 6.4 Modelling Aspects – Product Classes 148 6.5 People Aspects – Producer Classes 151 6.6 Linking Process and Product Aspects 153 6.7 Support Classes 154 6.8 Classes in ISO/IEC 24744 155 6.9 Extending the ISO/IEC 24744 Metamodel 157 6.10 Summary 161 References 161 CHAPTER 7 – Creating and Using a Methodology Generated from the Metamodel 163 7.1 Creating a Powertype-Based Methodology from its Metamodel 165 7.2 The Endeavour Domain 175 7.3 Summary 178 References 179 APPENDIX – Proposed Notation for ISO/IEC 24744 181 Index 203
£53.06
John Wiley & Sons Inc Computer Graphics for Java Programmers
Book SynopsisThe book covers elementary concepts, from how to produce simple graphical objects using logical coordinates to producing filled regions. The book reinforces concepts with useful and simple examples, then progresses to applied geometry (vectors, polygons) and then onto how to perform rotations and other transformations of graphical objects. In a logical progression of ideas, the reader is introduced to some of the classic graphics algorithms and finally to chapters which cover particular effects such as perspective drawings and hidden-face and hidden-line elimination. The book also provides a host of ready-to-run programs and worked examples to illuminate general principles and geometric techniques for the creation of both 2D and 3D graphical objects.Table of ContentsPreface ix C H A P T E R 1 – Elementary Concepts 1 1.1 Lines, Coordinates and Pixels 2 1.2 The Boundaries of Filled Regions 7 1.3 Logical Coordinates 8 1.4 Anisotropic and Isotropic Mapping Modes 14 1.5 Defining a Polygon by Using the Mouse 21 Exercises 26 C H A P T E R 2 – Applied Geometry 31 2.1 Vectors 32 2.2 Inner Product 34 2.3 Determinants 34 2.4 Vector Product 37 2.5 The Orientation of Three Points 38 2.6 Polygons 41 2.7 The Area of a Polygon 42 2.8 Point-in-Triangle Test 44 2.9 Point-in-Polygon Test 45 2.10 Point-on-Line Test 47 2.11 Distance Between a Point and a Line 50 2.12 Projection of a Point on a Line 51 2.13 Triangulation of Polygons 53 Exercises 58 C H A P T E R 3 – Geometrical Transformations 63 3.1 Matrix Multiplication 64 3.2 Linear Transformations 65 3.3 Translations 71 3.4 Homogeneous Coordinates 71 3.5 Inverse Transformations and Matrix Inversion 72 3.6 Rotation About an Arbitrary Point 74 3.7 Changing the Coordinate System 78 3.8 Rotations About 3D Coordinate Axes 79 3.9 Rotation About an Arbitrary Axis 80 Exercises 88 C H A P T E R 4 – Some Classic Algorithms 91 4.1 Bresenham’s Algorithm for Line Drawing 92 4.2 Doubling the Line-Drawing Speed 97 4.3 Circles 102 4.4 Cohen–Sutherland Line Clipping 107 4.5 Sutherland–Hodgman Polygon Clipping 113 4.6 B´ezier Curves 120 4.7 B-Spline Curve Fitting 130 Exercises 135 C H A P T E R 5 – Perspective 139 5.1 Introduction 140 5.2 The Viewing Transformation 141 5.3 The Perspective Transformation 146 5.4 A Cube in Perspective 148 5.5 Some Useful Classes 152 5.6 A General Program for Wire-Frame Models 168 Exercises 174 C H A P T E R 6 – Hidden-Line Elimination 177 6.1 Line Segments and Triangles 178 6.2 Tests for Visibility 179 6.3 Specification and Representation of 3D Objects 190 6.4 Holes and Invisible Line Segments 192 6.5 Individual Faces and Line Segments 194 6.6 Automatic Generation of Object Specification 198 6.7 Hidden-Line Elimination with HP-GL Output 207 6.8 Implementation 209 Exercises 213 C H A P T E R 7 – Hidden-Face Elimination 219 7.1 Back-Face Culling 220 7.2 Coloring Individual Faces 225 7.3 Painter’s Algorithm 226 7.4 Z-Buffer Algorithm 234 Exercises 246 C H A P T E R 8 – Fractals 249 8.1 Introduction 249 8.2 Koch Curves 250 8.3 String Grammars 253 8.4 Mandelbrot and Julia Sets 264 Exercises 276 A P P E N D I X A – Linear Interpolation of 1/z 277 AP P ENDIX B – A Note on Event Handling 281 A P P E N D I X C – File Obj3D.java 287 A P P E N D I X D – Class CvHLines.java 293 A P P E N D I X E – Some Applications 301 E.1 Platonic Solids 301 E.2 Sphere Representations 312 E.3 A Torus 319 E.4 Beams in a Spiral 323 E.5 Functions of Two Variables 326 A P P E N D I X F – Hints and Solutions to Exercises 339 Bibliography 371 Index 373
£48.56
John Wiley & Sons Inc Spatial Audio Processing
Book SynopsisThis book collects a wealth of information about spatial audio coding into one comprehensible volume. It is a thorough reference to the 3GPP and MPEG Parametric Stereo standards and the MPEG Surround multi-channel audio coding standard. It describes key developments in coding techniques, which is an important factor in the optimization of advanced entertainment, communications and signal processing applications. Until recently, technologies for coding audio signals, such as redundancy reduction and sophisticated source and receiver models did not incorporate spatial characteristics of source and receiving ends. Spatial audio coding achieves much higher compression ratios than conventional coders. It does this by representing multi-channel audio signals as a downmix signal plus side information that describes the perceptually-relevant spatial information. Written by experts in spatial audio coding, Spatial Audio Processing: reviews psychoacousticTable of ContentsAuthor Biographies. Foreword. Preface. 1 Introduction. 1.1 The human auditory system. 1.2 Spatial audio reproduction. 1.3 Spatial audio coding. 1.4 Book outline. 2 Background. 2.1 Introduction. 2.2 Spatial audio playback systems. 2.2.1 Stereo audio loudspeaker playback. 2.2.2 Headphone audio playback. 2.2.3 Multi-channel audio playback. 2.3 Audio coding. 2.3.1 Audio signal representation. 2.3.2 Lossless audio coding. 2.3.3 Perceptual audio coding. 2.3.4 Parametric audio coding. 2.3.5 Combining perceptual and parametric audio coding. 2.4 Matrix surround. 2.5 Conclusions. 3 Spatial Hearing. 3.1 Introduction. 3.2 Physiology of the human hearing system. 3.3 Spatial hearing basics. 3.3.1 Spatial hearing with one sound source. 3.3.2 Ear entrance signal properties and lateralization. 3.3.3 Sound source localization. 3.3.4 Two sound sources: summing localization. 3.3.5 Superposition of signals each evoking one auditory object. 3.4 Spatial hearing in rooms. 3.4.1 Source localization in the presence of reflections: the precedence effect. 3.4.2 Spatial impression. 3.5 Limitations of the human auditory system. 3.5.1 Just-noticeable differences in interaural cues. 3.5.2 Spectro-temporal decomposition. 3.5.3 Localization accuracy of single sources. 3.5.4 Localization accuracy of concurrent sources. 3.5.5 Localization accuracy when reflections are present. 3.6 Source localization in complex listening situations. 3.6.1 Cue selection model. 3.6.2 Simulation examples. 3.7 Conclusions. 4 Spatial Audio Coding. 4.1 Introduction. 4.2 Related techniques. 4.2.1 Pseudostereophonic processes. 4.2.2 Intensity stereo coding. 4.3 Binaural Cue Coding (BCC). 4.3.1 Time–frequency processing. 4.3.2 Down-mixing to one channel. 4.3.3 ‘Perceptually relevant differences’ between audio channels. 4.3.4 Estimation of spatial cues. 4.3.5 Synthesis of spatial cues. 4.4 Coding of low-frequency effects (LFE) audio channels. 4.5 Subjective performance. 4.6 Generalization to spatial audio coding. 5 Parametric Stereo. 5.1 Introduction. 5.1.1 Development and standardization. 5.1.2 AacPlus v2. 5.2 Interaction between core coder and spatial audio coding. 5.3 Relation to BCC. 5.4 Parametric stereo encoder. 5.4.1 Time/frequency decomposition. 5.4.2 Parameter extraction. 5.4.3 Down-mix. 5.4.4 Parameter quantization and coding. 5.5 Parametric stereo decoder. 5.5.1 Analysis filterbank. 5.5.2 Decorrelation. 5.5.3 Matrixing. 5.5.4 Interpolation. 5.5.5 Synthesis filterbanks. 5.5.6 Parametric stereo in enhanced aacPlus. 5.6 Conclusions. 6 MPEG Surround. 6.1 Introduction. 6.2 Spatial audio coding. 6.2.1 Concept. 6.2.2 Elementary building blocks. 6.3 MPEG Surround encoder. 6.3.1 Structure. 6.3.2 Pre- and post-gains. 6.3.3 Time–frequency decomposition. 6.3.4 Spatial encoder. 6.3.5 Parameter quantization and coding. 6.3.6 Coding of residual signals. 6.4 MPEG Surround decoder. 6.4.1 Structure. 6.4.2 Spatial decoder. 6.4.3 Enhanced matrix mode. 6.5 Subjective evaluation. 6.5.1 Test 1: operation using spatial parameters. 6.5.2 Test 2: operation using enhanced matrix mode. 6.6 Conclusions. 7 Binaural Cues for a Single Sound Source. 7.1 Introduction. 7.2 HRTF parameterization. 7.2.1 HRTF analysis. 7.2.2 HRTF synthesis. 7.3 Sound source position dependencies. 7.3.1 Experimental procedure. 7.3.2 Results and discussion. 7.4 HRTF set dependencies. 7.4.1 Experimental procedure. 7.4.2 Results and discussion. 7.5 Single ITD approximation. 7.5.1 Procedure. 7.5.2 Results and discussion. 7.6 Conclusions. 8 Binaural Cues for Multiple Sound Sources. 8.1 Introduction. 8.2 Binaural parameters. 8.3 Binaural parameter analysis. 8.3.1 Binaural parameters for a single sound source. 8.3.2 Binaural parameters for multiple independent sound sources. 8.3.3 Binaural parameters for multiple sound sources with varying degrees of mutual correlation. 8.4 Binaural parameter synthesis. 8.4.1 Mono down-mix. 8.4.2 Extension towards stereo down-mixes. 8.5 Application to MPEG Surround. 8.5.1 Binaural decoding mode. 8.5.2 Binaural parameter synthesis. 8.5.3 Binaural encoding mode. 8.5.4 Evaluation. 8.6 Conclusions. 9 Audio Coding with Mixing Flexibility at the Decoder Side. 9.1 Introduction. 9.2 Motivation and details. 9.2.1 ICTD, ICLD and ICC of the mixer output. 9.3 Side information. 9.3.1 Reconstructing the sources. 9.4 Using spatial audio decoders as mixers. 9.5 Transcoding to MPEG Surround. 9.6 Conclusions. 10 Multi-loudspeaker Playback of Stereo Signals. 10.1 Introduction. 10.2 Multi-channel stereo. 10.3 Spatial decomposition of stereo signals. 10.3.1 Estimating ps,b, Ab and pn,b. 10.3.2 Least-squares estimation of sm, n1,m and n2,m. 10.3.3 Post-scaling. 10.3.4 Numerical examples. 10.4 Reproduction using different rendering setups. 10.4.1 Multiple loudspeakers in front of the listener. 10.4.2 Multiple front loudspeakers plus side loudspeakers. 10.4.3 Conventional 5.1 surround loudspeaker setup. 10.4.4 Wavefield synthesis playback system. 10.4.5 Modifying the decomposed audio signals. 10.5 Subjective evaluation. 10.5.1 Subjects and playback setup. 10.5.2 Stimuli. 10.5.3 Test method. 10.5.4 Results. 10.6 Conclusions. 10.7 Acknowledgement. Frequently Used Terms, Abbreviations and Notation. Terms and abbreviations. Notation and variables. Bibliography. Index.
£88.16
John Wiley & Sons Inc Designing the Mobile User Experience
Book SynopsisGain the knowledge and tools to deliver compelling mobile phone applications. Mobile and wireless application design is complex and challenging.Table of ContentsPreface. About the Author. 1 Introduction: Mobility is Different. 1.1 Mobilizing Applications. 1.2 What is ‘Mobile’ Anyhow? 1.3 The Carry Principle. 1.4 Components of a Mobile Application. 1.5 About This Book. 2 Mobile Users in the Wild. 2.1 Mobile User Characteristics. 2.2 Groups and Tribes. 2.3 International Differences. 3 Mobile Devices. 3.1 A Device Taxonomy. 3.2 Anatomy of the PCD. 4 Selecting Application Technologies. 4.1 Input Modalities. 4.2 Interaction Responsiveness. 4.3 Data Storage Locations. 4.4 Display Modality. 4.5 Supplemental Technologies. 4.6 Distribution Methods. 4.7 Other Concerns. 4.8 Platforms. 5 Mobile Design Principles. 5.1 Mobilize, Don’t Miniaturize. 5.2 User Context. 5.3 Handling Device Proliferation. 5.4 Emulators and Simulators. 5.5 Detailed Design Recommendations. 6 Mobile User Interface Design Patterns. 6.1 About User Interface Patterns. 6.2 Screen Design. 6.3 Application Navigation. 6.4 Application Management. 6.5 Advertising. 7 Graphic and Media Design. 7.1 Composition for the Small Screen. 7.2 Video and Animation. 7.3 Sound. 7.4 Streaming versus Downloaded Content. 7.5 Managing Media: Meta Data. 8 Industry Players. 8.1 Carriers (Operators). 8.2 Device Manufacturers. 8.3 Technology and Platform Providers. 8.4 Application and Content Developers. 8.5 Content Distributors. 8.6 Industry Associations. 8.7 Government. 9 Research and Design Process. 9.1 Mobile Research Challenges. 9.2 User Research. 9.3 Design Phase Testing. 9.4 Application Usability Testing. 9.5 Market Acceptance (beta) Testing. 10 Example Application: Traveler Tool. 10.1 User Requirements. 10.2 Product Requirements. 10.3 High-level Design Concepts. 10.4 Detailed Design Plan. Appendices. A: Mobile Markup Languages. B: Domain Names. C: Minimum Object Resolution. D: Opt-In and Opt-Out. E: Mobile Companies. Glossary. Index.
£53.96
John Wiley and Sons Ltd Bioinformatics Challenges at the Interface of
Book SynopsisThis innovative book provides a completely fresh exploration of bioinformatics, investigating its complex interrelationship with biology and computer science. It approaches bioinformatics from a unique perspective, highlighting interdisciplinary gaps that often trap the unwary.Table of ContentsPreface x Acknowledgements xvii About the companion website xviii PART 1 1 Introduction 3 1.1 Overview 3 1.2 Bioinformatics 3 1.2.1 What is bioinformatics? 3 1.2.2 The provenance of bioinformatics 4 1.2.3 The seeds of bioinformatics 5 1.3 Computer Science 7 1.3.1 Origins of computer science 7 1.3.2 Computer science meets bioinformatics 9 1.4 What did we want to do with bioinformatics? 10 1.5 Summary 12 1.6 References 13 1.7 Quiz 14 1.8 Problems 16 2 The biological context 17 2.1 Overview 17 2.2 Biological data]types and concepts 17 2.2.1 Diversity of biological data]types 17 2.2.2 The central dogma 18 2.2.3 Fundamental building]blocks and alphabets 19 2.2.4 The protein structure hierarchy 29 2.2.5 RNA processing in prokaryotes and eukaryotes 30 2.2.6 The genetic code 33 2.2.7 Conceptual translation and gene finding 35 2.3 Access to whole genomes 42 2.4 Summary 43 2.5 References 43 2.6 Quiz 46 2.7 Problems 47 3 Biological databases 49 3.1 Overview 49 3.2 What kinds of database are there? 49 3.3 The Protein Data Bank (PDB) 50 3.4 The EMBL nucleotide sequence data library 56 3.5 GenBank 58 3.6 The PIR]PSD 61 3.7 Swiss]Prot 62 3.8 PROSITE 64 3.9 TrEMBL 69 3.10 InterPro 71 3.11 UniProt 73 3.12 The European Nucleotide Archive (ENA) 77 3.13 Summary 81 3.14 References 82 3.15 Quiz 85 3.16 Problems 87 4 Biological sequence analysis 89 4.1 Overview 89 4.2 Adding meaning to raw sequence data 89 4.2.1 Annotating raw sequence data 94 4.2.2 Database and sequence formats 96 4.2.3 Making tools and databases interoperate 101 4.3 Tools for deriving sequence annotations 103 4.3.1 Methods for comparing two sequences 103 4.3.2 The PAM and BLOSUM matrices 104 4.3.3 Tools for global and local alignment 110 4.3.4 Tools for comparing multiple sequences 114 4.3.5 Alignment]based analysis methods 115 4.4 Summary 131 4.5 References 132 4.6 Quiz 134 4.7 Problems 136 5 The gap 138 5.1 Overview 138 5.2 Bioinformatics in the 21st century 138 5.3 Problems with genes 139 5.4 Problems with names 142 5.5 Problems with sequences 143 5.6 Problems with database entries 146 5.6.1 Problems with database entry formats 147 5.7 Problems with structures 148 5.8 Problems with alignments 150 5.8.1 Different methods, different results 150 5.8.2 What properties do my sequences share? 154 5.8.3 How similar are my sequences? 157 5.8.4 How good is my alignment? 160 5.9 Problems with families 163 5.10 Problems with functions 168 5.11 Functions of domains, modules and their parent proteins 173 5.12 Defining and describing functions 176 5.13 Summary 179 5.14 References 180 5.15 Quiz 182 5.16 Problems 183 PART 2 6 Algorithms and complexity 187 6.1 Overview 187 6.2 Introduction to algorithms 187 6.2.1 Mathematical computability 189 6.3 Working with computers 191 6.3.1 Discretisation of solutions 191 6.3.2 When computers go bad 193 6.4 Evaluating algorithms 197 6.4.1 An example: a sorting algorithm 197 6.4.2 Resource scarcity: complexity of algorithms 199 6.4.3 Choices, choices 200 6.5 Data structures 201 6.5.1 Structural consequences 202 6.5.2 Marrying form and function 210 6.6 Implementing algorithms 211 6.6.1 Programming paradigm 212 6.6.2 Choice of language 214 6.6.3 Mechanical optimisation 216 6.6.4 Parallelisation 224 6.7 Summary 227 6.8 References 227 6.9 Quiz 227 6.10 Problems 229 7 Representation and meaning 230 7.1 Overview 230 7.2 Introduction 230 7.3 Identification 233 7.3.1 Namespaces 233 7.3.2 Meaningless identifiers are a good thing 233 7.3.3 Identifying things on the Web 236 7.3.4 Cool URIs don’t change 238 7.3.5 Versioning and provenance 238 7.3.6 Case studies 239 7.4 Representing data 243 7.4.1 Design for change 245 7.4.2 Contemporary data]representation paradigms 247 7.5 Giving meaning to data 255 7.5.1 Bio ontologies in practice 260 7.5.2 First invent the universe 263 7.6 Web services 264 7.6.1 The architecture of the Web 266 7.6.2 Statelessness 267 7.7 Action at a distance 268 7.7.1 SOAP and WSDL 270 7.7.2 HTTP as an API 270 7.7.3 Linked Data 272 7.8 Summary 275 7.9 References 275 7.10 Quiz 276 7.11 Problems 277 8 Linking data and scientific literature 279 8.1 Overview 279 8.2 Introduction 279 8.3 The lost steps of curators 281 8.4 A historical perspective on scientific literature 286 8.5 The gulf between human and machine comprehension 288 8.6 Research objects 295 8.7 Data publishing 297 8.8 Separating scientific wheat from chaff – towards semantic searches 298 8.9 Semantic publication 300 8.9.1 Making articles ‘semantic’ 301 8.10 Linking articles with their cognate data 305 8.10.1 What Utopia Documents does 305 8.10.2 A case study 306 8.11 Summary 314 8.12 References 315 8.13 Quiz 318 8.14 Problems 319 Afterword 321 Glossary 327 Quiz Answers 371 Problem Answers 378 Index 394
£50.36
John Wiley and Sons Ltd Bioinformatics Challenges at the Interface of
Book SynopsisThis innovative book provides a completely fresh exploration of bioinformatics, investigating its complex interrelationship with biology and computer science. It approaches bioinformatics from a unique perspective, highlighting interdisciplinary gaps that often trap the unwary.Table of ContentsPreface x Acknowledgements xvii About the companion website xviii PART 1 1 Introduction 3 1.1 Overview 3 1.2 Bioinformatics 3 1.2.1 What is bioinformatics? 3 1.2.2 The provenance of bioinformatics 4 1.2.3 The seeds of bioinformatics 5 1.3 Computer Science 7 1.3.1 Origins of computer science 7 1.3.2 Computer science meets bioinformatics 9 1.4 What did we want to do with bioinformatics? 10 1.5 Summary 12 1.6 References 13 1.7 Quiz 14 1.8 Problems 16 2 The biological context 17 2.1 Overview 17 2.2 Biological data]types and concepts 17 2.2.1 Diversity of biological data]types 17 2.2.2 The central dogma 18 2.2.3 Fundamental building]blocks and alphabets 19 2.2.4 The protein structure hierarchy 29 2.2.5 RNA processing in prokaryotes and eukaryotes 30 2.2.6 The genetic code 33 2.2.7 Conceptual translation and gene finding 35 2.3 Access to whole genomes 42 2.4 Summary 43 2.5 References 43 2.6 Quiz 46 2.7 Problems 47 3 Biological databases 49 3.1 Overview 49 3.2 What kinds of database are there? 49 3.3 The Protein Data Bank (PDB) 50 3.4 The EMBL nucleotide sequence data library 56 3.5 GenBank 58 3.6 The PIR]PSD 61 3.7 Swiss]Prot 62 3.8 PROSITE 64 3.9 TrEMBL 69 3.10 InterPro 71 3.11 UniProt 73 3.12 The European Nucleotide Archive (ENA) 77 3.13 Summary 81 3.14 References 82 3.15 Quiz 85 3.16 Problems 87 4 Biological sequence analysis 89 4.1 Overview 89 4.2 Adding meaning to raw sequence data 89 4.2.1 Annotating raw sequence data 94 4.2.2 Database and sequence formats 96 4.2.3 Making tools and databases interoperate 101 4.3 Tools for deriving sequence annotations 103 4.3.1 Methods for comparing two sequences 103 4.3.2 The PAM and BLOSUM matrices 104 4.3.3 Tools for global and local alignment 110 4.3.4 Tools for comparing multiple sequences 114 4.3.5 Alignment]based analysis methods 115 4.4 Summary 131 4.5 References 132 4.6 Quiz 134 4.7 Problems 136 5 The gap 138 5.1 Overview 138 5.2 Bioinformatics in the 21st century 138 5.3 Problems with genes 139 5.4 Problems with names 142 5.5 Problems with sequences 143 5.6 Problems with database entries 146 5.6.1 Problems with database entry formats 147 5.7 Problems with structures 148 5.8 Problems with alignments 150 5.8.1 Different methods, different results 150 5.8.2 What properties do my sequences share? 154 5.8.3 How similar are my sequences? 157 5.8.4 How good is my alignment? 160 5.9 Problems with families 163 5.10 Problems with functions 168 5.11 Functions of domains, modules and their parent proteins 173 5.12 Defining and describing functions 176 5.13 Summary 179 5.14 References 180 5.15 Quiz 182 5.16 Problems 183 PART 2 6 Algorithms and complexity 187 6.1 Overview 187 6.2 Introduction to algorithms 187 6.2.1 Mathematical computability 189 6.3 Working with computers 191 6.3.1 Discretisation of solutions 191 6.3.2 When computers go bad 193 6.4 Evaluating algorithms 197 6.4.1 An example: a sorting algorithm 197 6.4.2 Resource scarcity: complexity of algorithms 199 6.4.3 Choices, choices 200 6.5 Data structures 201 6.5.1 Structural consequences 202 6.5.2 Marrying form and function 210 6.6 Implementing algorithms 211 6.6.1 Programming paradigm 212 6.6.2 Choice of language 214 6.6.3 Mechanical optimisation 216 6.6.4 Parallelisation 224 6.7 Summary 227 6.8 References 227 6.9 Quiz 227 6.10 Problems 229 7 Representation and meaning 230 7.1 Overview 230 7.2 Introduction 230 7.3 Identification 233 7.3.1 Namespaces 233 7.3.2 Meaningless identifiers are a good thing 233 7.3.3 Identifying things on the Web 236 7.3.4 Cool URIs don’t change 238 7.3.5 Versioning and provenance 238 7.3.6 Case studies 239 7.4 Representing data 243 7.4.1 Design for change 245 7.4.2 Contemporary data]representation paradigms 247 7.5 Giving meaning to data 255 7.5.1 Bio ontologies in practice 260 7.5.2 First invent the universe 263 7.6 Web services 264 7.6.1 The architecture of the Web 266 7.6.2 Statelessness 267 7.7 Action at a distance 268 7.7.1 SOAP and WSDL 270 7.7.2 HTTP as an API 270 7.7.3 Linked Data 272 7.8 Summary 275 7.9 References 275 7.10 Quiz 276 7.11 Problems 277 8 Linking data and scientific literature 279 8.1 Overview 279 8.2 Introduction 279 8.3 The lost steps of curators 281 8.4 A historical perspective on scientific literature 286 8.5 The gulf between human and machine comprehension 288 8.6 Research objects 295 8.7 Data publishing 297 8.8 Separating scientific wheat from chaff – towards semantic searches 298 8.9 Semantic publication 300 8.9.1 Making articles ‘semantic’ 301 8.10 Linking articles with their cognate data 305 8.10.1 What Utopia Documents does 305 8.10.2 A case study 306 8.11 Summary 314 8.12 References 315 8.13 Quiz 318 8.14 Problems 319 Afterword 321 Glossary 327 Quiz Answers 371 Problem Answers 378 Index 394
£139.95
John Wiley & Sons Inc Ubiquitous Computing
Book SynopsisThis book provides an introduction to the complex field of ubiquitous computing Ubiquitous Computing (also commonly referred to as Pervasive Computing) describes the ways in which current technological models, based upon three base designs: smart (mobile, wireless, service) devices, smart environments (of embedded system devices) and smart interaction (between devices), relate to and support a computing vision for a greater range of computer devices, used in a greater range of (human, ICT and physical) environments and activities. The author details the rich potential of ubiquitous computing, the challenges involved in making it a reality, and the prerequisite technological infrastructure. Additionally, the book discusses the application and convergence of several current major and future computing trends. Key Features: Provides an introduction to the complex field of ubiquitous computing Describes how current technology models based upon six different technology form factors which have varying degrees of mobility wireless connectivity and service volatility: tabs, pads, boards, dust, skins and clay, enable the vision of ubiquitous computing Describes and explores how the three core designs (smart devices, environments and interaction) based upon current technology models can be applied to, and can evolve to, support a vision of ubiquitous computing and computing for the future Covers the principles of the following current technology models, including mobile wireless networks, service-oriented computing, human computer interaction, artificial intelligence, context-awareness, autonomous systems, micro-electromechanical systems, sensors, embedded controllers and robots Covers a range of interactions, between two or more UbiCom devices, between devices and people (HCI), between devices and the physical world. Includes an accompanying website with PowerPoint slides, problems and solutions, exercises, bibliography and further reading Graduate students in computer science, electrical engineering and telecommunications courses will find this a fascinating and useful introduction to the subject. It will also be of interest to ICT professionals, software and network developers and others interested in future trends and models of computing and interaction over the next decades.Table of ContentsList of Figures xix List of Tables xxiii Preface xxv Acknowledgements xxvii 1 Ubiquitous Computing: Basics and Vision 1 1.1 Living in a Digital World 1 1.1.1 Chapter Overview 2 1.1.2 Illustrative Ubiquitous Computing Applications 2 1.1.2.1 Personal Memories 3 1.1.2.2 Adaptive Transport Scheduled Service 5 1.1.2.3 Foodstuff Management 5 1.1.2.4 Utility Regulation 6 1.1.3 Holistic Framework for UbiCom: Smart DEI 7 1.2 Modelling the Key Ubiquitous Computing Properties 8 1.2.1 Core Properties of UbiCom Systems 9 1.2.2 Distributed ICT Systems 9 1.2.2.1 Networked ICT Devices 10 1.2.2.2 Transparency and Openness 10 1.2.3 Implicit Human–Computer Interaction (iHCI) 11 1.2.3.1 The Calm Computer 11 1.2.3.2 Implicit Versus Explicit Human–Computer Interaction 12 1.2.3.3 Embodied Reality versus Virtual, Augmented and Mediated Reality 12 1.2.4 Context-Awareness 13 1.2.4.1 Three Main Types of Environment Context: Physical, User, Virtual 14 1.2.4.2 User-Awareness 14 1.2.4.3 Active Versus Passive Context-Awareness 15 1.2.5 Autonomy 15 1.2.5.1 Reducing Human Interaction 16 1.2.5.2 Easing System Maintenance Versus Self-Maintaining Systems 16 1.2.6 Intelligence 17 1.2.7 Taxonomy of UbiCom Properties 17 1.3 Ubiquitous System Environment Interaction 22 1.3.1 Human–ICT Device Interaction (HCI) 24 1.3.2 ICT Device to Physical World Interaction (CPI) 25 1.4 Architectural Design for UbiCom Systems: Smart DEI Model 26 1.4.1 Smart Devices 27 1.4.1.1 Weiser’s ICT Device Forms: Tabs, Pads and Boards 28 1.4.1.2 Extended Forms for ICT Devices: Dust, Skin and Clay 28 1.4.1.3 Mobility 29 1.4.1.4 Volatile Service Access 29 1.4.1.5 Situated and Self-Aware 30 1.4.2 Smart Environments 30 1.4.2.1 Tagging, Sensing and Controlling Environments 31 1.4.2.2 Embedded Versus Untethered 31 1.4.2.3 Device Sizes 32 1.4.3 Smart Interaction 32 1.4.3.1 Basic Interaction 32 1.4.3.2 Smart Interaction 33 1.5 Discussion 34 1.5.1 Interlinking System Properties, Environments and Designs 34 1.5.2 Common Myths about Ubiquitous Computing 35 1.5.3 Organisation of the Smart DEI Approach 37 Exercises 38 References 39 2 Applications and Requirements 41 2.1 Introduction 41 2.1.1 Overview 41 2.2 Example Early UbiCom Research Projects 41 2.2.1 Smart Devices: cci 42 2.2.1.1 Smart Boards, Pads and Tabs 42 2.2.1.2 Active Badge, Bat and Floor 42 2.2.2 Smart Environments: CPI and cci 43 2.2.2.1 Classroom 2000 43 2.2.2.2 Smart Space and Meeting Room 43 2.2.2.3 Interactive Workspaces and iRoom 44 2.2.2.4 Cooltown 44 2.2.2.5 EasyLiving and SPOT 45 2.2.2.6 HomeLab and Ambient Intelligence 46 2.2.3 Smart Devices: CPI 46 2.2.3.1 Unimate and MH-1 Robots 46 2.2.3.2 Smart Dust and TinyOS 47 2.2.4 Smart Devices: iHCI and HPI 48 2.2.4.1 Calm Computing 48 2.2.4.2 Things That Think and Tangible Bits 48 2.2.4.3 DataTiles 49 2.2.4.4 Ambient Wood 50 2.2.4.5 WearComp and WearCam 50 2.2.4.6 Cyborg 1.0 and 2.0 52 2.2.5 Other UbiCom Projects 52 2.3 Everyday Applications in the Virtual, Human and Physical World 53 2.3.1 Ubiquitous Networks of Devices: cci 53 2.3.2 Human–Computer Interaction 54 2.3.2.1 Ubiquitous Audio-Video Content Access 54 2.3.2.2 Ubiquitous Information Access and Ebooks 55 2.3.2.3 Universal Local Control of ICT Systems 56 2.3.2.4 User-Awareness and Personal Spaces 58 2.3.3 Human-to-Human Interaction (HHI) Applications 58 2.3.3.1 Transaction-based M-Commerce and U-Commerce Services 59 2.3.3.2 Enhancing the Productivity of Mobile Humans 59 2.3.3.3 Care in the Community 60 2.3.4 Human-Physical World-Computer Interaction (HPI) and (CPI) 61 2.3.4.1 Physical Environment Awareness 61 2.3.4.2 (Physical) Environment Control 61 2.3.4.3 Smart Utilities 62 2.3.4.4 Smart Buildings and Home Automation 62 2.3.4.5 Smart Living Environments and Smart Furniture 63 2.3.4.6 Smart Street Furniture 65 2.3.4.7 Smart Vehicles, Transport and Travel 65 2.3.4.8 Pervasive Games and Social Physical Spaces 66 2.4 Discussion 67 2.4.1 Achievements from Early Projects and Status Today 67 2.4.1.1 Smart Devices 67 2.4.1.2 Smart Physical World Environments 68 2.4.1.3 Context-Awareness and Service Discovery 69 2.4.1.4 Wearable Smart Devices and Implants 69 Exercises 71 References 71 3 Smart Devices and Services 75 3.1 Introduction 75 3.1.1 Chapter Overview 75 3.1.2 Smart Device and Service Characteristics 75 3.1.3 Distributed System Viewpoints 77 3.1.4 Abstraction Versus Virtualisation 78 3.2 Service Architecture Models 80 3.2.1 Partitioning and Distribution of Service Components 80 3.2.2 Multi-tier Client Service Models 81 3.2.2.1 Distributed Data Storage 82 3.2.2.2 Distributed Processing 82 3.2.2.3 Client–Server Design 83 3.2.2.4 Proxy-based Service Access 84 3.2.3 Middleware 85 3.2.4 Service Oriented Computing (SOC) 86 3.2.5 Grid Computing 87 3.2.6 Peer-to-Peer Systems 88 3.2.7 Device Models 91 3.3 Service Provision Life-Cycle 91 3.3.1 Network Discovery 92 3.3.2 Service Announcement, Discovery, Selection and Configuration 93 3.3.2.1 Web Service Discovery 95 3.3.2.2 Semantic Web and Semantic Resource Discovery 95 3.3.3 Service Invocation 95 3.3.3.1 Distributed Processes 96 3.3.3.2 Asynchronous (MOM) Versus Synchronous (RPC) Communication Models 97 3.3.3.3 Reliable versus Unreliable Communication 99 3.3.3.4 Caches, Read-Ahead and Delayed Writes 99 3.3.3.5 On-Demand Service Access 100 3.3.3.6 Event-Driven Architectures (EDA) 101 3.3.3.7 Shared Data Repository 103 3.3.3.8 Enterprise Service Bus (ESB) Model 103 3.3.3.9 Volatile Service Invocation 104 3.3.4 Service Composition 105 3.3.4.1 Service Interoperability 106 3.4 Virtual Machines and Operating Systems 106 3.4.1 Virtual Machines 106 3.4.2 Bios 107 3.4.3 Multi-Tasking Operating Systems (MTOS) 108 3.4.4 Process Control 109 3.4.5 Memory Management 110 3.4.6 Input and Output 111 Exercises 111 References 112 4 Smart Mobiles, Cards and Device Networks 115 4.1 Introduction 115 4.1.1 Chapter Overview 115 4.2 Smart Mobile Devices, Users, Resources and Code 115 4.2.1 Mobile Service Design 116 4.2.1.1 SMS and Mobile Web Services 117 4.2.1.2 Java VM and J2ME 119 4.2.1.3 .net Cf 120 4.2.2 Mobile Code 121 4.2.3 Mobile Devices and Mobile Users 122 4.3 Operating Systems for Mobile Computers and Communicator Devices 123 4.3.1 Microkernel Designs 123 4.3.2 Mobility Support 123 4.3.3 Resource-Constrained Devices 124 4.3.4 Power Management 125 4.3.4.1 Low Power CPUs 125 4.3.4.2 Application Support 126 4.4 Smart Card Devices 126 4.4.1 Smart Card OS 127 4.4.2 Smart Card Development 128 4.5 Device Networks 128 4.5.1 HAVi, HES and X 10 129 4.5.2 Device Discovery 129 4.5.3 OSGi 131 Exercises 132 References 133 5 Human–Computer Interaction 135 5.1 Introduction 135 5.1.1 Chapter Overview 135 5.1.2 Explicit HCI: Motivation and Characteristics 136 5.1.3 Complexity of Ubiquitous Explicit HCI 136 5.1.4 Implicit HCI: Motivation and Characteristics 137 5.2 User Interfaces and Interaction for Four Widely Used Devices 138 5.2.1 Diversity of ICT Device Interaction 138 5.2.2 Personal Computer Interface 139 5.2.3 Mobile Hand-Held Device Interfaces 140 5.2.3.1 Handling Limited Key Input: Multi-Tap, T9, Fastap, Soft keys and Soft Keyboard 140 5.2.3.2 Handling Limited Output 141 5.2.4 Games Console Interfaces and Interaction 142 5.2.5 Localised Remote Control: Video Devices 143 5.3 Hidden UI Via Basic Smart Devices 143 5.3.1 Multi-Modal Visual Interfaces 144 5.3.2 Gesture Interfaces 145 5.3.3 Reflective Versus Active Displays 147 5.3.4 Combining Input and Output User Interfaces 148 5.3.4.1 Touchscreens 149 5.3.4.2 Tangible Interfaces 149 5.3.4.3 Organic Interfaces 150 5.3.5 Auditory Interfaces 151 5.3.6 Natural Language Interfaces 151 5.4 Hidden UI Via Wearable and Implanted Devices 152 5.4.1 Posthuman Technology Model 152 5.4.2 Virtual Reality and Augmented Reality 152 5.4.3 Wearable Computer Interaction 153 5.4.3.1 Head(s)-Up Display (HUD) 154 5.4.3.2 Eyetap 154 5.4.3.3 Virtual Retinal Display (VRD) 154 5.4.3.4 Clothes as Computers 155 5.4.4 Computer Implants and Brain Computer Interfaces 155 5.4.5 Sense-of-Presence and Telepresence 157 5.5 Human-Centred Design (HCD) 157 5.5.1 Human-Centred Design Life-Cycle 158 5.5.2 Methods to Acquire User Input and to Build Used Models 159 5.5.3 Defining the Virtual and Physical Environment Use Context 160 5.5.4 Defining the Human Environment Use Context and Requirements 160 5.5.4.1 User Characteristics 160 5.5.5 Interaction Design 161 5.5.5.1 Conceptual Models and Mental Models 162 5.5.6 Evaluation 162 5.6 User Models: Acquisition and Representation 163 5.6.1 Indirect User Input and Modelling 164 5.6.2 Direct User Input and Modelling 164 5.6.3 User Stereotypes 165 5.6.4 Modelling Users’ Planned Tasks and Goals 165 5.6.5 Multiple User Tasks and Activity-Based Computing 166 5.6.6 Situation Action Versus Planned Action Models 167 5.7 iHCI Design 167 5.7.1 iHCI Model Characteristics 167 5.7.2 User Context-Awareness 168 5.7.3 More Intuitive and Customised Interaction 168 5.7.4 Personalisation 169 5.7.5 Affective Computing: Interactions Using Users’ Emotional Context 171 5.7.6 Design Heuristics and Patterns 171 Exercises 175 References 175 6 Tagging, Sensing and Controlling 179 6.1 Introduction 179 6.1.1 Chapter Overview 180 6.2 Tagging the Physical World 180 6.2.1 Life-Cycle for Tagging Physical Objects 181 6.2.2 Tags: Types and Characteristics 181 6.2.3 Physical and Virtual Tag Management 183 6.2.4 RFID Tags 183 6.2.4.1 Active RFID Tags 185 6.2.4.2 Passive RFID Tags 185 6.2.5 Personalised and Social Tags 186 6.2.6 Micro Versus Macro Tags 187 6.3 Sensors and Sensor Networks 187 6.3.1 Overview of Sensor Net Components and Processes 187 6.3.2 Sensor Electronics 189 6.3.3 Physical Network: Environment, Density and Transmission 191 6.3.4 Data Network: Addressing and Routing 192 6.3.4.1 Sensor Networks Versus Ad Hoc Networks 193 6.3.5 Data Processing: Distributed Data Storage and Data Queries 193 6.4 Micro Actuation and Sensing: MEMS 194 6.4.1 Fabrication 195 6.4.2 Micro-Actuators 195 6.4.3 Micro-Sensors 196 6.4.4 Smart Surfaces, Skin, Paint, Matter and Dust 197 6.4.5 Downsizing to Nanotechnology and Quantum Devices 198 6.5 Embedded Systems and Real-Time Systems 199 6.5.1 Application-Specific Operating Systems (ASOS) 200 6.5.2 Real-Time Operating Systems for Embedded Systems 201 6.6 Control Systems (for Physical World Tasks) 202 6.6.1 Programmable Controllers 202 6.6.2 Simple PID-Type Controllers 203 6.6.3 More Complex Controllers 203 6.7 Robots 204 6.7.1 Robot Manipulators 205 6.7.2 Mobile Robots 206 6.7.3 Biologically Inspired Robots 206 6.7.4 Nanobots 207 6.7.5 Developing UbiCom Robot Applications 207 Exercises 209 References 210 7 Context-Aware Systems 213 7.1 Introduction 213 7.1.1 Chapter Overview 214 7.1.2 Context-Aware Applications 214 7.2 Modelling Context-Aware Systems 216 7.2.1 Types of Context 216 7.2.2 Context Creation and Context Composition 218 7.2.3 Context-Aware Adaptation 219 7.2.4 Environment Modelling 221 7.2.5 Context Representation 221 7.2.6 A Basic Architecture 222 7.2.7 Challenges in Context-Awareness 225 7.3 Mobility Awareness 227 7.3.1 Call Routing for Mobile Users 227 7.3.2 Mobile Phone Location Determination 227 7.3.3 Mobile User Awareness as an Example of Composite Context-Awareness 228 7.3.4 Tourism Services for Mobile Users 228 7.4 Spatial Awareness 229 7.4.1 Spatial Context Creation 230 7.4.1.1 Spatial Acquisition 230 7.4.1.2 Location Acquisition 231 7.4.2 Location and Other Spatial Abstractions 233 7.4.3 User Context Creation and Context-Aware Adaptation 233 7.4.3.1 Cartography: Adapting Spatial Viewpoints to Different User Contexts 233 7.4.3.2 Geocoding: Mapping Location Contexts to User Contexts 234 7.4.4 Spatial Context Queries and Management: GIS 234 7.5 Temporal Awareness: Coordinating and Scheduling 235 7.5.1 Clock Synchronization: Temporal Context Creation 235 7.5.2 Temporal Models and Abstractions 236 7.5.3 Temporal Context Management and Adaptation to User Contexts 237 7.6 ICT System Awareness 238 7.6.1 Context-Aware Presentation and Interaction at the UI 238 7.6.1.1 Acquiring the UI Context 238 7.6.1.2 Content Adaptation 239 7.6.2 Network-Aware Service Adaptation 240 Exercises 242 References 242 8 Intelligent Systems (IS) 245 With Patricia Charlton 8.1 Introduction 245 8.1.1 Chapter Overview 246 8.2 Basic Concepts 246 8.2.1 Types of Intelligent Systems 246 8.2.2 Types of Environment for Intelligent Systems 247 8.2.3 Use of Intelligence in Ubiquitous Computing 248 8.3 IS Architectures 249 8.3.1 What a Model Knows Versus How it is Used 249 8.3.1.1 Types of Architecture Model 250 8.3.1.2 Unilateral Versus Bilateral System Environment Models 251 8.3.1.3 Model Representations 252 8.3.1.4 How System Models are Acquired and Adapt 252 8.3.2 Reactive IS Models 252 8.3.3 Environment Model-based IS 254 8.3.4 Goal-based IS 255 8.3.5 Utility-based IS 256 8.3.6 Learning-based IS 256 8.3.6.1 Machine Learning Design 257 8.3.7 Hybrid IS 258 8.3.8 Knowledge-based (KB) IS 260 8.3.8.1 Production or Rule-based KB System 260 8.3.8.2 Blackboard KB System 261 8.3.9 IS Models Applied to UbiCom Systems 261 8.4 Semantic KB IS 263 8.4.1 Knowledge Representation 263 8.4.2 Design Issues 265 8.4.2.1 Open World Versus Closed World Semantics 265 8.4.2.2 Knowledge Life-cycle and Knowledge Management 266 8.4.2.3 Creating Knowledge 266 8.4.2.4 Knowledge Deployment and Maintaining Knowledge 267 8.4.2.5 Design Issues for UbiCom Use 267 8.5 Classical Logic IS 268 8.5.1 Propositional and Predicate Logic 268 8.5.2 Reasoning 269 8.5.3 Design Issues 270 8.6 Soft Computing IS Models 271 8.6.1 Probabilistic Networks 271 8.6.2 Fuzzy Logic 272 8.7 IS System Operations 272 8.7.1 Searching 272 8.7.2 Classical (Deterministic) Planning 274 8.7.3 Non-Deterministic Planning 275 Exercises 276 References 276 9 Intelligent System Interaction 279 With Patricia Charlton 9.1 Introduction 279 9.1.1 Chapter Overview 279 9.2 Interaction Multiplicity 279 9.2.1 P2P Interaction Between Multiple Senders and Receivers 281 9.2.1.1 Unknown Sender and Malicious Senders 281 9.2.1.2 Unknown Receivers 282 9.2.1.3 Too Many Messages 282 9.2.2 Interaction Using Mediators 282 9.2.2.1 Shared Communication Resource Access 283 9.2.2.2 Shared Computation Resource Access 283 9.2.2.3 Mediating Between Requesters and Providers 284 9.2.3 Interaction Using Cooperative Participants 286 9.2.3.1 Coordination 287 9.2.3.2 Coordination Using Norms and Electronic Institutions 289 9.2.3.3 Hierarchical and Role-based Organisational Interaction 290 9.2.4 Interaction with Self-Interested Participants 291 9.2.4.1 Market-based Interaction and Auctions 292 9.2.4.2 Negotiation and Agreements 293 9.2.4.3 Consensus-based Agreements 295 9.3 Is Interaction Design 295 9.3.1 Designing System Interaction to be More Intelligent 296 9.3.2 Designing Interaction Between Individual Intelligent Systems 297 9.3.3 Interaction Protocol Design 297 9.3.3.1 Semantic or Knowledge-Sharing Protocols 298 9.3.3.2 Agent Communication Languages and Linguistic-based Protocols 300 9.3.4 Further Examples of the Use of Interaction Protocols 302 9.3.5 Multi-Agent Systems 303 9.3.5.1 ACL and Agent Platform Design 304 9.3.5.2 Multi-Agent System Application Design 305 9.4 Some Generic Intelligent Interaction Applications 306 9.4.1 Social Networking and Media Exchange 307 9.4.2 Recommender and Referral Systems 308 9.4.2.1 Recommender Systems 308 9.4.2.2 Content-based Recommendations 308 9.4.2.3 Collaborative Filtering 309 9.4.3 Pervasive Work Flow Management for People 309 9.4.4 Trust Management 309 Exercises 311 References 312 10 Autonomous Systems and Artificial Life 317 10.1 Introduction 317 10.1.1 Chapter Overview 317 10.2 Basic Autonomous Intra-Acting Systems 318 10.2.1 Types of Autonomous System 318 10.2.1.1 Autonomous Intelligent Systems 319 10.2.1.2 Limitation of Autonomous Systems 319 10.2.2 Self-* Properties of Intra-Action 320 10.3 Reflective and Self-Aware Systems 322 10.3.1 Self-Awareness 322 10.3.2 Self-Describing and Self-Explaining Systems 323 10.3.3 Self-Modifying Systems Based Upon Reflective Computation 325 10.4 Self-Management and Autonomic Computing 326 10.4.1 Autonomic Computing Design 328 10.4.2 Autonomic Computing Applications 330 10.4.3 Modelling and Management Self-Star Systems 331 10.5 Complex Systems 332 10.5.1 Self-Organization and Interaction 332 10.5.2 Self-Creation and Self-Replication 335 10.6 Artificial Life 336 10.6.1 Finite State Automata Models 336 10.6.2 Evolutionary Computing 337 Exercises 338 References 339 11 Ubiquitous Communication 343 11.1 Introduction 343 11.1.1 Chapter Overview 344 11.2 Audio Networks 344 11.2.1 PSTN Voice Networks 344 11.2.2 Intelligent Networks and IP Multimedia Subsystems 345 11.2.3 ADLS Broadband 346 11.2.4 Wireless Telecoms Networks 346 11.2.5 Audio Broadcast (Radio Entertainment) Networks 347 11.3 Data Networks 347 11.3.1 Network Protocol Suites 348 11.3.2 Addressing 348 11.3.3 Routing and Internetworking 349 11.4 Wireless Data Networks 350 11.4.1 Types of Wireless Network 350 11.4.2 WLAN and WiMAX 352 11.4.3 Bluetooth 353 11.4.4 ZigBee 353 11.4.5 Infrared 354 11.4.6 Uwb 354 11.4.7 Satellite and Microwave Communication 354 11.4.8 Roaming between Local Wireless LANs 355 11.5 Universal and Transparent Audio, Video and Alphanumeric Data Network Access 356 11.5.1 Combined Voice and Data Networks 357 11.5.2 Combined Audio-Video and Data Content Distribution Networks 358 11.5.3 On-demand, Interactive and Distributed Content 360 11.6 Ubiquitous Networks 360 11.6.1 Wireless Networks 360 11.6.2 Power Line Communication (PLC) 361 11.6.3 Personal Area Networks 362 11.6.4 Body Area Networks 362 11.6.5 Mobile Users Networks 363 11.6.5.1 Mobile Addresses 363 11.6.5.2 Single-Path Routing 364 11.6.5.3 Multi-Path Routing in Mobile Ad hoc Networks (MANETs) 364 11.7 Further Network Design Issues 365 11.7.1 Network Access Control 365 11.7.2 Ubiquitous Versus Localised Access 366 11.7.3 Controlling Network Access: Firewalls, NATs and VPNs 367 11.7.4 Group Communication: Transmissions for Multiple Receivers 368 11.7.5 Internetworking Heterogeneous Networks 368 11.7.6 Global Use: Low-Cost Access Networks for Rural Use 369 11.7.7 Separating Management and Control from Usage 369 11.7.8 Service-Oriented Networks 370 11.7.8.1 Service-Orientation at the Network Edge 371 11.7.8.2 Content-based Networks 372 11.7.8.3 Programmable Networks 372 11.7.8.4 Overlay Networks 372 11.7.8.5 Mesh Networks 373 11.7.8.6 Cooperative Networks 375 Exercises 375 References 376 12 Management of Smart Devices 379 12.1 Introduction 379 12.1.1 Chapter Overview 380 12.2 Managing Smart Devices in Virtual Environments 380 12.2.1 Process and Application Management 380 12.2.2 Network-Oriented Management 380 12.2.2.1 Fcaps 382 12.2.3 Monitoring and Accounting 383 12.2.3.1 Icmp 384 12.2.3.2 Snmp 384 12.2.4 Configuration Management 386 12.2.5 Security Management 386 12.2.5.1 Encryption Support for Confidentiality, Authentication and Authorisation 388 12.2.5.2 Securing the System and its Middleware 389 12.2.5.3 Securing Access Devices 391 12.2.5.4 Securing Information 392 12.2.6 Fault Management 393 12.2.7 Performance Management 394 12.2.8 Service-Oriented Computer Management 395 12.2.8.1 Metrics for Evaluating the Use of SOA 395 12.2.8.2 Distributed Resource Management and the Grid 396 12.2.8.3 SLA Management of Services 397 12.2.8.4 Policy-based Service Management 397 12.2.8.5 Pervasive Work Flow Management for Services 398 12.2.9 Information Management 399 12.2.9.1 Information Applications 399 12.2.9.2 Rich Versus Lean and Soft Versus Hard Information 399 12.2.9.3 Managing the Information Explosion 400 12.2.9.4 Managing Multimedia Content 401 12.2.9.5 Managing Lean and Hard Data Using RDBMSs 402 12.2.9.6 Managing Metadata 403 12.3 Managing Smart Devices in Human User-Centred Environments 404 12.3.1 Managing Richer and Softer Data 404 12.3.2 Service Management Models for Human User and Physical Environments 404 12.3.3 User Task and Activity-Based Management 407 12.3.4 Privacy Management 407 12.3.4.1 Biometric User Identification 408 12.3.4.2 Privacy-Invasive Technologies versus Privacy-Enhanced Technologies 410 12.3.4.3 Entrusted Regulation of User Privacy to Service Providers 411 12.3.4.4 Legislative Approaches to Privacy 412 12.4 Managing Smart Devices in Physical Environments 412 12.4.1 Context-Awareness 412 12.4.1.1 Context-Aware Management of Physical and Human Activities 413 12.4.1.2 Management of Contexts and Events 413 12.4.2 Micro and Nano-Sized Devices 415 12.4.3 Unattended Embedded Devices 415 Exercises 416 References 416 13 Ubiquitous System: Challenges and Outlook 421 13.1 Introduction 421 13.1.1 Chapter Overview 421 13.2 Overview of Challenges 422 13.2.1 Key Challenges 422 13.2.2 Multi-Level Support for UbiCom Properties 423 13.2.3 Evolution Versus Revolution 424 13.2.4 Future Technologies 424 13.3 Smart Devices 425 13.3.1 Smaller, More Functional Smart Devices 425 13.3.2 More Fluid Ensembles of Diverse Devices 426 13.3.3 Richer System Interaction and Interoperability 427 13.3.3.1 Migrating from Analogue to Digital Device Interaction 427 13.3.3.2 Richer Digital Device Interaction 428 13.4 Smart Interaction 428 13.4.1 Unexpected Connectivity: Accidentally Smart Environments 428 13.4.2 Impromptu Service Interoperability 429 13.5 Smart Physical Environment Device Interaction 430 13.5.1 Context-Awareness: Ill-Defined Contexts Versus a Context-Free World 430 13.5.2 Lower Power and Sustainable Energy Usage 431 13.5.3 ECO-Friendly UbiCom Devices 433 13.6 Smart Human–Device Interaction 436 13.6.1 More Diverse Human–Device Interaction 437 13.6.2 More Versus Less Natural HCI 439 13.6.3 Analogue to Digital and Digital Analogues 439 13.6.4 Form Follows Function 440 13.6.5 Forms for Multi-Function Devices 441 13.7 Human Intelligence Versus Machine Intelligence 441 13.7.1 Posthuman: ICT Augments Human Abilities Beyond Being Human 443 13.7.2 Blurring of Reality and Mediated Realities 444 13.8 Social Issues: Promise Versus Peril 444 13.8.1 Increased Virtual Social Interaction Versus Local Social Interaction 446 13.8.2 UbiCom Accessible by Everyone 446 13.8.3 UbiCom Affordable by Everyone 447 13.8.4 Legislation in the Digital World and Digitising Legislation 448 13.9 Final Remarks 450 Exercises 451 References 452 Index 455
£75.56
John Wiley & Sons Inc Wireless Sensor Networks
Book SynopsisThis book presents an in-depth study on recent advances and research in Wireless Sensor Networks (WSNs). Existing WSN applications are described, followed by discussing the ongoing research efforts on some WSNs applications that show the usefulness of sensor networks. Theoretical analysis and factors influencing protocol design are highlighted.Trade Review"It is intended for advanced students but also would be useful for researchers, system and chip designers, and other professionals in related fields." (Booknews, 1 February 2011) "The book is written in an accessible, textbook style, and includes problems and solutions to assist learning." (Dark Fiber, 8 February 2011)Table of ContentsAbout the Series Editor xvii Preface xix 1 Introduction 1 1.1 Sensor Mote Platforms 2 1.2 WSN Architecture and Protocol Stack 10 References 15 2 WSN Applications 17 2.1 Military Applications 17 2.2 Environmental Applications 21 2.3 Health Applications 26 2.4 Home Applications 29 2.5 Industrial Applications 31 References 33 3 Factors Influencing WSN Design 37 3.1 Hardware Constraints 37 3.2 Fault Tolerance 39 3.3 Scalability 40 3.4 Production Costs 40 3.5 WSN Topology 40 3.6 Transmission Media 41 3.7 Power Consumption 43 References 49 4 Physical Layer 53 4.1 Physical Layer Technologies 53 4.2 Overview of RF Wireless Communication 57 4.3 Channel Coding (Error Control Coding) 59 4.4 Modulation 62 4.5 Wireless Channel Effects 66 4.6 PHY Layer Standards 72 References 75 5 Medium Access Control 77 5.1 Challenges for MAC 77 5.2 CSMA Mechanism 80 5.3 Contention-Based Medium Access 83 5.4 Reservation-Based Medium Access 103 5.5 Hybrid Medium Access 110 References 115 6 Error Control 117 6.1 Classification of Error Control Schemes 117 6.2 Error Control in WSNs 120 6.3 Cross-layer Analysis Model 123 6.4 Comparison of Error Control Schemes 131 References 137 7 Network Layer 139 7.1 Challenges for Routing 139 7.2 Data-centric and Flat-Architecture Protocols 141 7.3 Hierarchical Protocols 148 7.4 Geographical Routing Protocols 152 7.5 QoS-Based Protocols 159 References 163 8 Transport Layer 167 8.1 Challenges for Transport Layer 167 8.2 Reliable Multi-Segment Transport (RMST) Protocol 169 8.3 Pump Slowly, Fetch Quickly (PSFQ) Protocol 171 8.4 Congestion Detection and Avoidance (CODA) Protocol 175 8.5 Event-to-Sink Reliable Transport (ESRT) Protocol 177 8.6 GARUDA 180 8.7 Real-Time and Reliable Transport (RT)2 Protocol 185 References 189 9 Application Layer 191 9.1 Source Coding (Data Compression) 191 9.2 Query Processing 195 9.3 Network Management 212 References 218 10 Cross-layer Solutions 221 10.1 Interlayer Effects 222 10.2 Cross-layer Interactions 224 10.3 Cross-layer Module 229 References 240 11 Time Synchronization 243 11.1 Challenges for Time Synchronization 243 11.2 Network Time Protocol 245 11.3 Definitions 246 11.4 Timing-Sync Protocol for Sensor Networks (TPSN) 248 11.5 Reference-Broadcast Synchronization (RBS) 251 11.6 Adaptive Clock Synchronization (ACS) 253 11.7 Time Diffusion Synchronization Protocol (TDP) 254 11.8 Rate-Based Diffusion Protocol (RDP) 257 11.9 Tiny- and Mini-Sync Protocols 258 11.10 Other Protocols 260 References 262 12 Localization 265 12.1 Challenges in Localization 265 12.2 Ranging Techniques 268 12.3 Range-Based Localization Protocols 272 12.4 Range-Free Localization Protocols 280 References 284 13 Topology Management 287 13.1 Deployment 288 13.2 Power Control 289 13.3 Activity Scheduling 296 13.4 Clustering 308 References 317 14 Wireless Sensor and Actor Networks 319 14.1 Characteristics of WSANs 321 14.2 Sensor–Actor Coordination 325 14.3 Actor–Actor Coordination 337 14.4 WSAN Protocol Stack 345 References 348 15 Wireless Multimedia Sensor Networks 349 15.1 Design Challenges 350 15.2 Network Architecture 353 15.3 Multimedia Sensor Hardware 357 15.4 Physical Layer 365 15.5 MAC Layer 367 15.6 Error Control 371 15.7 Network Layer 374 15.8 Transport Layer 379 15.9 Application Layer 383 15.10 Cross-layer Design 388 15.11 Further Research Issues 392 References 394 16 Wireless Underwater Sensor Networks 399 16.1 Design Challenges 401 16.2 Underwater Sensor Network Components 402 16.3 Communication Architecture 405 16.4 Basics of Underwater Acoustic Propagation 409 16.5 Physical Layer 414 16.6 MAC Layer 416 16.7 Network Layer 426 16.8 Transport Layer 435 16.9 Application Layer 437 16.10 Cross-layer Design 437 References 440 17 Wireless Underground Sensor Networks 443 17.1 Applications 445 17.2 Design Challenges 447 17.3 Network Architecture 450 17.4 Underground Wireless Channel for EM Waves 453 17.5 Underground Wireless Channel for Magnetic Induction 463 17.6 Wireless Communication in Mines and Road/Subway Tunnels 466 17.7 Communication Architecture 474 References 480 18 Grand Challenges 483 18.1 Integration of Sensor Networks and the Internet 483 18.2 Real-Time and Multimedia Communication 484 18.3 Protocol Stack 485 18.4 Synchronization and Localization 485 18.5 WSNs in Challenging Environments 486 18.6 Practical Considerations 488 18.7 Wireless Nano-sensor Networks 488 References 489 Index 491
£79.16
John Wiley & Sons Inc It Disaster Recovery Planning for Dummies
Book SynopsisIf you have a business or a nonprofit organization, or if you're the one responsible for information systems at such an operation, you know that disaster recovery planning is pretty vital. But it's easy to put it off.Table of ContentsForeword xix Introduction 1 About This Book 1 How This Book Is Organized 2 Part I: Getting Started with Disaster Recovery 2 Part II: Building Technology Recovery Plans 2 Part III: Managing Recovery Plans 2 Part IV: The Part of Tens 3 What This Book Is — and What It Isn’t 3 Assumptions about Disasters 3 Icons Used in This Book 4 Where to Go from Here 4 Write to Us! 5 Part I: Getting Started with Disaster Recovery 7 Chapter 1: Understanding Disaster Recovery 9 Disaster Recovery Needs and Benefits 9 The effects of disasters 10 Minor disasters occur more frequently 11 Recovery isn’t accidental 12 Recovery required by regulation 12 The benefits of disaster recovery planning 13 Beginning a Disaster Recovery Plan 13 Starting with an interim plan 14 Beginning the full DR project 15 Managing the DR Project 18 Conducting a Business Impact Analysis 18 Developing recovery procedures 22 Understanding the Entire DR Lifecycle 25 Changes should include DR reviews 26 Periodic review and testing 26 Training response teams 26 Chapter 2: Bootstrapping the DR Plan Effort 29 Starting at Square One 30 How disaster may affect your organization 30 Understanding the role of prevention 31 Understanding the role of planning 31 Resources to Begin Planning 32 Emergency Operations Planning 33 Preparing an Interim DR Plan 34 Staffing your interim DR plan team 35 Looking at an interim DR plan overview 35 Building the Interim Plan 36 Step 1 — Build the Emergency Response Team 37 Step 2 — Define the procedure for declaring a disaster 37 Step 3 — Invoke the interim DR plan 39 Step 4 — Maintain communications during a disaster 39 Step 5 — Identify basic recovery plans 41 Step 6 — Develop processing alternatives 42 Step 7 — Enact preventive measures 44 Step 8 — Document the interim DR plan 46 Step 9 — Train ERT members 48 Testing Interim DR Plans 48 Chapter 3: Developing and Using a Business Impact Analysis 51 Understanding the Purpose of a BIA 52 Scoping the Effort 53 Conducting a BIA: Taking a Common Approach 54 Gathering information through interviews 55 Using consistent forms and worksheets 56 Capturing Data for the BIA 58 Business processes 59 Information systems 60 Assets 61 Personnel 62 Suppliers 62 Statements of impact 62 Criticality assessment 63 Maximum Tolerable Downtime 64 Recovery Time Objective 64 Recovery Point Objective 65 Introducing Threat Modeling and Risk Analysis 66 Disaster scenarios 67 Identifying potential disasters in your region 68 Performing Threat Modeling and Risk Analysis 68 Identifying Critical Components 69 Processes and systems 70 Suppliers 71 Personnel 71 Determining the Maximum Tolerable Downtime 72 Calculating the Recovery Time Objective 72 Calculating the Recovery Point Objective 73 Part II: Building Technology Recovery Plans 75 Chapter 4: Mapping Business Functions to Infrastructure 77 Finding and Using Inventories 78 Using High-Level Architectures 80 Data flow and data storage diagrams 80 Infrastructure diagrams and schematics 84 Identifying Dependencies 90 Inter-system dependencies 91 External dependencies 95 Chapter 5: Planning User Recovery 97 Managing and Recovering End-User Computing 98 Workstations as Web terminals 99 Workstation access to centralized information 102 Workstations as application clients 104 Workstations as local computers 108 Workstation operating systems 113 Managing and Recovering End-User Communications 119 Voice communications 119 E-mail 121 Fax machines 125 Instant messaging 126 Chapter 6: Planning Facilities Protection and Recovery 129 Protecting Processing Facilities 129 Controlling physical access 130 Getting charged up about electric power 140 Detecting and suppressing fire 141 Chemical hazards 144 Keeping your cool 145 Staying dry: Water/flooding detection and prevention 145 Selecting Alternate Processing Sites 146 Hot, cold, and warm sites 147 Other business locations 149 Data center in a box: Mobile sites 150 Colocation facilities 150 Reciprocal facilities 151 Chapter 7: Planning System and Network Recovery 153 Managing and Recovering Server Computing 154 Determining system readiness 154 Server architecture and configuration 155 Developing the ability to build new servers 157 Distributed server computing considerations 159 Application architecture considerations 160 Server consolidation: The double-edged sword 161 Managing and Recovering Network Infrastructure 163 Implementing Standard Interfaces 166 Implementing Server Clustering 167 Understanding cluster modes 168 Geographically distributed clusters 169 Cluster and storage architecture 170 Chapter 8: Planning Data Recovery 173 Protecting and Recovering Application Data 173 Choosing How and Where to Store Data for Recovery 175 Protecting data through backups 176 Protecting data through resilient storage 179 Protecting data through replication and mirroring 180 Protecting data through electronic vaulting 182 Deciding where to keep your recovery data 182 Protecting data in transit 184 Protecting data while in DR mode 185 Protecting and Recovering Applications 185 Application version 186 Application patches and fixes 186 Application configuration 186 Application users and roles 187 Application interfaces 189 Application customizations 189 Applications dependencies with databases,operating systems, and more 190 Applications and client systems 191 Applications and networks 192 Applications and change management 193 Applications and configuration management 193 Off-Site Media and Records Storage 194 Chapter 9: Writing the Disaster Recovery Plan 197 Determining Plan Contents 198 Disaster declaration procedure 198 Emergency contact lists and trees 200 Emergency leadership and role selection 202 Damage assessment procedures 203 System recovery and restart procedures 205 Transition to normal operations 207 Recovery team 209 Structuring the Plan 210 Enterprise-level structure 210 Document-level structure 211 Managing Plan Development 212 Preserving the Plan 213 Taking the Next Steps 213 Part III: Managing Recovery Plans 215 Chapter 10: Testing the Recovery Plan 217 Testing the DR Plan 217 Why test a DR plan? 218 Developing a test strategy 219 Developing and following test procedures 220 Conducting Paper Tests 221 Conducting Walkthrough Tests 222 Walkthrough test participants 223 Walkthrough test procedure 223 Scenarios 224 Walkthrough results 225 Debriefing 225 Next steps 226 Conducting Simulation Testing 226 Conducting Parallel Testing 227 Parallel testing considerations 228 Next steps 229 Conducting Cutover Testing 230 Cutover test procedure 231 Cutover testing considerations 233 Planning Parallel and Cutover Tests 234 Clustering and replication technologies and cutover tests 235 Next steps 236 Establishing Test Frequency 236 Paper test frequency 237 Walkthrough test frequency 238 Parallel test frequency 239 Cutover test frequency 240 Chapter 11: Keeping DR Plans and Staff Current 241 Understanding the Impact of Changes on DR Plans 241 Technology changes 242 Business changes 243 Personnel changes 245 Market changes 247 External changes 248 Changes — some final words 249 Incorporating DR into Business Lifecycle Processes 250 Systems and services acquisition 250 Systems development 251 Business process engineering 252 Establishing DR Requirements and Standards 253 A Multi-Tiered DR Standard Case Study 254 Maintaining DR Documentation 256 Managing DR documents 257 Updating DR documents 258 Publishing and distributing documents 260 Training Response Teams 261 Types of training 261 Indoctrinating new trainees 262 Chapter 12: Understanding the Role of Prevention 263 Preventing Facilities-Related Disasters 264 Site selection 265 Preventing fires 270 HVAC failures 272 Power-related failures 272 Protection from civil unrest and war 273 Avoiding industrial hazards 274 Preventing secondary effects of facilities disasters 275 Preventing Technology-Related Disasters 275 Dealing with system failures 276 Minimizing hardware and software failures 276 Pros and cons of a monoculture 277 Building a resilient architecture 278 Preventing People-Related Disasters 279 Preventing Security Issues and Incidents 280 Prevention Begins at Home 283 Chapter 13: Planning for Various Disaster Scenarios 285 Planning for Natural Disasters 285 Earthquakes 285 Wildfires 287 Volcanoes 288 Floods 289 Wind and ice storms 290 Hurricanes 291 Tornadoes 292 Tsunamis 293 Landslides and avalanches 295 Pandemic 297 Planning for Man-Made Disasters 300 Utility failures 300 Civil disturbances 301 Terrorism and war 302 Security incidents 303 Part IV: The Part of Tens 305 Chapter 14: Ten Disaster Recovery Planning Tools 307 Living Disaster Recovery Planning System (LDRPS) 307 BIA Professional 308 COBRA Risk Analysis 308 BCP Generator 309 DRI Professional Practices Kit 310 Disaster Recovery Plan Template 310 SLA Toolkit 311 LBL ContingencyPro Software 312 Emergency Management Guide for Business and Industry 312 DRJ’s Toolbox 313 Chapter 15: Eleven Disaster Recovery Planning Web Sites 315 DRI International 315 Disaster Recovery Journal 316 Business Continuity Management Institute 316 Disaster Recovery World 317 Disaster Recovery Planning.org 317 The Business Continuity Institute 318 Disaster-Resource.com 319 Computerworld Disaster Recovery 319 CSO Business Continuity and Disaster Recovery 320 Federal Emergency Management Agency (FEMA) 320 Rothstein Associates Inc 321 Chapter 16: Ten Essentials for Disaster Planning Success 323 Executive Sponsorship 323 Well-Defined Scope 324 Committed Resources 325 The Right Experts 325 Time to Develop the Project Plan 326 Support from All Stakeholders 326 Testing, Testing, Testing 327 Full Lifecycle Commitment 327 Integration into Other Processes 328 Luck 329 Chapter 17: Ten Benefits of DR Planning 331 Improved Chances of Surviving “The Big One” 331 A Rung or Two Up the Maturity Ladder 332 Opportunities for Process Improvements 332 Opportunities for Technology Improvements 333 Higher Quality and Availability of Systems 334 Reducing Disruptive Events 334 Reducing Insurance Premiums 335 Finding Out Who Your Leaders Are 336 Complying with Standards and Regulations 336 Competitive Advantage 338 Index 339
£17.84
John Wiley & Sons Inc Excel 2007 Advanced Report Development
Book SynopsisCreate powerful, innovative reporting solutions with Excel 2007! With this new book, which is significantly updated from the bestselling Excel 2003 version, author Timothy Zapawa provides you with in-depth coverage of Excel 2007's enhanced reporting capabilities.Table of ContentsAbout the Author. Acknowledgements. Introduction. Part I Report Basics. Chapter 1 Taking a First Look at Excel's Reporting Tools. Chapter 2 Getting Started with PivotTable Reports. Chapter 3 PivotTable Essentials and Components. Part II External Data. Chapter 4 Working with External Data Sources. Chapter 5 Looking at the Get External Data Tab. Chapter 6 Retrieving External Data Using Microsoft Query. Chapter 7 Using the Query Wizard. Chapter 8 Getting Started with Microsoft Query. Chapter 9 Working with SQL in Microsoft Query. Part III PivotTable Reporting. Chapter 10 Designing PivotTable Reports. Chapter 11 PivotTable Report Formatting. Chapter 12 Managing PivotTable Data. Chapter 13 Analyzing Data in a PivotChart. Part IV Spreadsheet Reporting. Chapter 14 Creating and Using Spreadsheet Reports. Chapter 15 Building Report Solutions. Chapter 16 Spreadsheet ReportFormatting. Part V Appendices. Appendix A SQL Reference. Appendix B Pop-Up Menus, Clicking Actions, and Toolbar Functions. Index.
£28.49
John Wiley & Sons Inc VBA for Dummies
Book SynopsisVBA helps you put your computer in its place Write programs that automate tasks and make Office 2007 work better for you If your computer is becoming your boss instead of your servant, start using VBA to tell it what to do! Here''s the latest on the VBA IDE and program containers, debugging and controlling your programs, working with multiple applications using a single program, and the most exciting stuff -- programming for all the Office 2007 applications. Discover how to Customize an application''s interface Quick-launch a VBA program Store and modify information Use VBA with the Ribbon Understand object-oriented programming Avoid runtime errors Table of ContentsIntroduction 1 Part I: An Overview of VBA 7 Chapter 1: Getting to Know VBA 9 Chapter 2: Your First VBA Program 33 Part II: Learning the Ropes 49 Chapter 3: Writing Structured VBA Programs 51 Chapter 4: Storing and Modifying Information 79 Chapter 5: Creating Structured Programs 111 Chapter 6: Trapping Errors and Squashing Bugs 133 Chapter 7: Interacting with the User 155 Part III: Expanding Your VBA Horizons 179 Chapter 8: Object-Oriented Programming 181 Chapter 9: Working with Arrays and Collections 205 Chapter 10: Working with Disk Files 229 Chapter 11: VBA Programming with XML 239 Part IV: Programming for Applications 255 Chapter 12: VBA Programming in Office 257 Chapter 13: VBA Programming in Word 277 Chapter 14: VBA Programming in Excel 305 Chapter 15: VBA Programming in Access 329 Chapter 16: Applications that Work Together 355 Part V: The Part of Tens 379 Chapter 17: Ten Kinds of VBA Resources 381 Chapter 18: Ten Ways to Update Your Old VBA Code Quickly 389 On the Web Bonus Chapter 1: VBA Programming in FrontPage BC1 Bonus Chapter 2: VBA Programming in Visio BC25 Bonus Chapter 3: Ten Really Cool Things You Can Do with VBA BC43 Index 397
£20.79
John Wiley & Sons Inc Microsoft Office Excel 2007 for Project Managers
Book SynopsisCombine the power of Excel 2007, Microsoft Office SharePoint Server, and sound project management tools to boost your skill set and maximize your productivity. You'll walk through a project and learn how to use these powerful tools to schedule jobs, create budgets, manage processes, and share project information. Whether new to project management or a veteran, you'll discover techniques, hints, and examples you can use immediately.Table of ContentsIntroduction. Chapter 1. Establishing Project Management Fundamentals. Chapter 2. Establishing Excel and Office 2007 Share Point Server Fundamentals. Chapter 3. Initiating the Project. Chapter 4. Determining Project Requirements. Chapter 5. Planning and Acquiring Resources. Chapter 6. Assessing and Tracking Risk. Chapter 7. Quality Management. Chapter 8. Constructing the Project Schedule and Budget. Chapter 9. Establishing Change Control Processes. Chapter 10. Controlling Project Outcomes and Archiving Documents. Appendix A. Excel Function Junction. Index.
£24.79
John Wiley & Sons Inc Skype For Dummies For Dummies S
Book SynopsisSee how to use Skype for secure chats and connect SkypeOut and SkypeIN.Table of ContentsForeword. Introduction. Part I: Getting Started with Skype. Chapter 1: What’s All the Hoopla about Skype? Chapter 2: Hooking Up with Skype. Chapter 3: Getting Familiar with Skype’s Interface. Part II: As You Like It: Skype Your Way. Chapter 4: Customizing Skype Options to Suit Your Style. Chapter 5: Getting Personal. Chapter 6: The Mad Chatter. Chapter 7: Skyping Eye to Eye: Skype with Video. Chapter 8: The Ins and Outs of SkypeIn and SkypeOut. Part III: Calling All Seasoned Skypers. Chapter 9: Managing Your Messages. Chapter 10: Partying On — On the Conference Line! Chapter 11: Spicing Things Up with Great Gadgets and Add-Ons. Part IV: The Professional Skyper. Chapter 12: “Skypifying” Your Business. Chapter 13: Exploring Skype Communities. Chapter 14: Skypecasting. Part V: The Part of Tens. Chapter 15: Ten Reasons Your Mom (and Other Family) Will Love Skype. Chapter 16: (Almost) Ten Ways to Promote Your Business Using Skype. Chapter 17: Ten Ways to Use Skype at School. Appendix A: Skype Multilanguage Support. Appendix B: Skype Tips and Tricks Guide. Index.
£18.39
John Wiley & Sons Inc The Essential Guide to User Interface Design
Book SynopsisBringing together the results of more than 300 new design studies, an understanding of people, knowledge of hardware and software capabilities, and the author's practical experience gained from 45 years of work with display-based systems, this book addresses interface and screen design from the user's perspective. You will learn how to create an effective design methodology, design and organize screens and Web pages that encourage efficient comprehension and execution, and create screen icons and graphics that make displays easier and more comfortable to use.Table of ContentsAbout the Author v Preface xix Acknowledgments xxvii Part 1 The User Interface—An Introduction and Overview 1 Chapter 1 The Importance of the User Interface 3 Defining the User Interface 4 The Importance of Good Design 4 The Benefits of Good Design 5 A Brief History of the Human-Computer Interface 7 Introduction of the Graphical User Interface 7 The Blossoming of the World Wide Web 8 A Brief History of Screen Design 10 What’s Next? 12 Chapter 2 Characteristics of Graphical and Web User Interfaces 13 Interaction Styles 13 Command Line 14 Menu Selection 14 Form Fill-in 14 Direct Manipulation 15 Anthropomorphic 15 The Graphical User Interface 16 The Popularity of Graphics 16 The Concept of Direct Manipulation 17 Graphical Systems: Advantages and Disadvantages 19 Characteristics of the Graphical User Interface 24 The Web User Interface 28 The Popularity of the Web 29 Characteristics of a Web Interface 29 The Merging of Graphical Business Systems and the Web 39 Characteristics of an Intranet versus the Internet 39 Extranets 40 Web Page versus Application Design 40 Principles of User Interface Design 44 Principles for the Xerox STAR 44 General Principles 45 Part 1 Exercise 58 What’s Next? 58 Part 2 The User Interface Design Process 59 Obstacles and Pitfalls in the Development Path 59 Designing for People: The Seven Commandments 60 Usability 64 Usability Assessment in the Design Process 65 Common Usability Problems 65 Some Practical Measures of Usability 68 Some Objective Measures of Usability 69 Step 1 Know Your User or Client 71 Understanding How People Interact with Computers 71 The Human Action Cycle 72 Why People Have Trouble with Computers 73 Responses to Poor Design 74 People and Their Tasks 76 Important Human Characteristics in Design 76 Perception 76 Memory 78 Sensory Storage 79 Visual Acuity 80 Foveal and Peripheral Vision 81 Information Processing 81 Mental Models 82 Movement Control 83 Learning 83 Skill 84 Performance Load 84 Individual Differences 85 Human Considerations in the Design of Business Systems 87 The User’s Knowledge and Experience 87 The User’s Tasks and Needs 92 The User’s Psychological Characteristics 95 The User’s Physical Characteristics 96 Human Interaction Speeds 100 Performance versus Preference 101 Methods for Gaining an Understanding of Users 102 Step 1 Exercise 102 Step 2 Understand the Business Function 103 Business Definition and Requirements Analysis 104 Information Collection Techniques 104 Defining the Domain 112 Considering the Environment 112 Possible Problems in Requirements Collection 113 Determining Basic Business Functions 113 Understanding the User’s Work 114 Developing Conceptual Models 115 The User’s New Mental Model 120 Design Standards or Style Guides 120 Value of Standards and Guidelines 121 Customized Style Guides 124 Design Support and Implementation 125 System Training and Documentation Needs 125 Training 126 Documentation 126 Step 2 Exercise 126 Step 3 Understand the Principles of Good Interface and Screen Design 127 Human Considerations in Interface and Screen Design 128 How to Discourage the User 128 What Users Want 130 What Users Do 130 Interface Design Goals 131 The Test for a Good Design 132 Screen and Web Page Meaning and Purpose 132 Organizing Elements Clearly and Meaningfully 133 Consistency 133 Starting Point 135 Ordering of Data and Content 136 Navigation and Flow 139 Visually Pleasing Composition 141 Distinctiveness 161 Focus and Emphasis 162 Conveying Depth of Levels or a Three-Dimensional Appearance 165 Presenting Information Simply and Meaningfully 168 Application and Page Size 178 Application Screen Elements 184 Organization and Structure Guidelines 220 The Web — Web sites and Web Pages 230 Intranet Design Guidelines 258 Extranet Design Guidelines 259 Small Screens 259 Weblogs 260 Statistical Graphics 261 Types of Statistical Graphics 273 Flow Charts 283 Technological Considerations in Interface Design 284 Graphical Systems 284 Web Systems 287 The User Technology Profile Circa 2006 292 Examples of Screens 293 Example 1 293 Example 2 297 Example 3 300 Example 4 301 Example 5 302 Example 6 303 Example 7 305 Step 3 Exercise 306 Step 4 Develop System Menus and Navigation Schemes 307 Structures of Menus 308 Single Menus 308 Sequential Linear Menus 309 Simultaneous Menus 309 Hierarchical or Sequential Menus 310 Connected Menus 311 Event-Trapping Menus 313 Functions of Menus 313 Navigation to a New Menu 314 Execute an Action or Procedure 314 Displaying Information 314 Data or Parameter Input 314 Content of Menus 314 Menu Context 315 Menu Title 315 Choice Descriptions 315 Completion Instructions 315 Formatting of Menus 315 Consistency 316 Display 316 Presentation 316 Organization 317 Complexity 320 Item Arrangement 321 Ordering 321 Groupings 323 Selection Support Menus 325 Phrasing the Menu 328 Menu Titles 329 Menu Choice Descriptions 330 Menu Instructions 332 Intent Indicators 332 Keyboard Shortcuts 333 Selecting Menu Choices 337 Initial Cursor Positioning 337 Choice Selection 338 Defaults 339 Unavailable Choices 340 Mark Toggles or Settings 340 Toggled Menu Items 341 Web Site Navigation 342 Web Site Navigation Problems 343 Web Site Navigation Goals 344 Web Site Navigation Design 345 Maintaining a Sense of Place 367 Kinds of Graphical Menus 369 Menu Bar 369 Pull-Down Menu 371 Cascading Menus 375 Pop-Up Menus 377 Tear-Off Menus 379 Iconic Menus 380 Pie Menus 380 Graphical Menu Examples 382 Example 1 382 Step 5 Select the Proper Kinds of Windows 385 Window Characteristics 385 The Attraction of Windows 386 Constraints in Window System Design 388 Components of a Window 390 Frame 390 Title Bar 391 Title Bar Icon 391 Window Sizing Buttons 392 What’s This? Button 393 Menu Bar 393 Status Bar 394 Scroll Bars 394 Split Box 394 Toolbar 394 Command Area 395 Size Grip 395 Work Area 395 Window Presentation Styles 395 Tiled Windows 396 Overlapping Windows 397 Cascading Windows 398 Picking a Presentation Style 399 Types of Windows 399 Primary Window 400 Secondary Windows 401 Dialog Boxes 407 Property Sheets and Property Inspectors 408 Message Boxes 411 Palette Windows 413 Pop-Up Windows 413 Organizing Window Functions 414 Window Organization 414 Number of Windows 415 Sizing Windows 416 Window Placement 417 The Web and the Browser 419 Browser Components 419 Step 5 Exercise 422 Step 6 Select the Proper Interaction Devices 423 Input Devices 423 Characteristics of Input Devices 424 Other Input Devices 436 Selecting the Proper Input Device 436 Output Devices 440 Screens 440 Speakers 441 Step 6 Exercise 441 Step 7 Choose the Proper Screen-Based Controls 443 Operable Controls 445 Buttons 445 Text Entry/Read-Only Controls 461 Text Boxes 461 Selection Controls 468 Radio Buttons 468 Check Boxes 478 Palettes 488 List Boxes 493 List View Controls 503 Drop-Down/Pop-Up List Boxes 503 Combination Entry/Selection Controls 509 Spin Boxes 509 Combo Boxes 512 Drop-Down/Pop-Up Combo Boxes 514 Other Operable Controls 517 Slider 517 Tabs 521 Date-Picker 524 Tree View 525 Scroll Bars 526 Custom Controls 531 Presentation Controls 531 Static Text Fields 532 Group Boxes 533 Column Headings 534 ToolTips 535 Balloon Tips 537 Progress Indicators 539 Sample Box 540 Scrolling Tickers 542 Selecting the Proper Controls 542 Entry versus Selection — A Comparison 543 Comparison of GUI Controls 544 Control Selection Criteria 547 Choosing a Control Form 548 Examples 552 Example 1 552 Example 2 553 Example 3 556 Example 4 557 Example 5 558 Example 6 559 Step 7 Exercise 561 Step 8 Write Clear Text and Messages 563 Words, Sentences, Messages, and Text 564 Readability 564 Choosing the Proper Words 565 Writing Sentences and Messages 568 Kinds of Messages 570 Presenting and Writing Text 578 Window Title, Conventions, and Sequence Control Guidance 582 Content and Text for Web Pages 584 Words 584 Page Text 585 Page Title 589 Headings and Headlines 589 Instructions 590 Error Messages 590 Step 8 Exercise 591 Step 9 Provide Effective Feedback and Guidance and Assistance 593 Providing the Proper Feedback 594 Response Time 594 Dealing with Time Delays 598 Blinking for Attention 601 Use of Sound 602 Guidance and Assistance 603 Preventing Errors 603 Problem Management 604 Providing Guidance and Assistance 606 Instructions or Prompting 608 Help Facility 608 Contextual Help 613 Task-Oriented Help 617 Reference Help 619 Wizards 620 Hints or Tips 622 Step 9 Exercise 623 Step 10 Provide Effective Internationalization and Accessibility 625 International Considerations 626 Localization 626 Cultural Considerations 627 Words and Text 628 Images and Symbols 631 Color, Sequence, and Functionality 633 Requirements Determination and Testing 635 Accessibility 635 Types of Disabilities 636 Accessibility Design 636 Step 10 Exercise 650 Step 11 Create Meaningful Graphics, Icons, and Images 651 Icons 652 Kinds of Icons 652 Characteristics of Icons 654 Influences on Icon Usability 654 Choosing Icons 657 Choosing Icon Images 659 Creating Icon Images 659 Drawing Icon Images 664 Icon Animation and Audition 665 The Icon Design Process 667 Screen Presentation 667 Multimedia 669 Graphics 669 Images 671 Photographs/Pictures 676 Video 677 Diagrams 678 Drawings 681 Animation 681 Audition 683 Combining Mediums 686 Step 11 Exercise 689 Step 12 Choose the Proper Colors 691 Color — What Is It? 692 RGB 694 HSV 694 Dithering 694 Color Uses 695 Color as a Formatting Aid 695 Color as a Visual Code 696 Other Color Uses 696 Possible Problems with Color 696 High Attention-Getting Capacity 696 Interference with Use of Other Screens 697 Varying Sensitivity of the Eye to Different Colors 697 Color-Viewing Deficiencies 697 Color Connotations 698 Cross-Disciplinary and Cross-Cultural Differences 700 Color — What the Research Shows 700 Color and Human Vision 701 The Lens 701 The Retina 701 Choosing Colors 702 Choosing Colors for Categories of Information 703 Colors in Context 703 Usage 704 Discrimination and Harmony 704 Emphasis 706 Common Meanings 706 Location 707 Ordering 708 Foregrounds and Backgrounds 708 Three-Dimensional Look 709 Color Palette, Defaults, and Customization 710 Grayscale 711 Text in Color 712 Monochromatic Screens 712 Consistency 713 Considerations for People with Color-Viewing Deficiencies 713 Cultural, Disciplinary, and Accessibility Considerations 714 Choosing Colors for Textual Graphic Screens 714 Effective Foreground/Background Combinations 714 Choose the Background First 717 Maximum of Four Colors 717 Use Colors in Toolbars Sparingly 718 Test the Colors 718 Choosing Colors for Statistical Graphics Screens 718 Emphasis 718 Number of Colors 718 Backgrounds 719 Size 719 Status 719 Measurements and Area-Fill Patterns 719 Physical Impressions 720 Choosing Colors for Web Pages 721 Uses of Color to Avoid 723 Step 12 Exercise 725 Step 13 Organize and Layout Windows and Pages 727 Organizing and Laying Out Screens 728 General Guidelines 728 Organization Guidelines 729 Control Navigation 748 Window Guidelines 749 Web Page Guidelines 750 Screen Examples 761 Example 1 761 Example 2 762 Step 14 Test, Test, and Retest 767 Usability 768 The Purpose of Usability Testing 768 The Importance of Usability Testing 769 Scope of Testing 770 Prototypes 771 Hand Sketches and Scenarios 772 Interactive Paper Prototypes 774 Programmed Facades 775 Prototype-Oriented Languages 776 Comparisons of Prototypes 776 Kinds of Tests 777 Guidelines and Standards Review 779 Heuristic Evaluation 780 Cognitive Walk-Throughs 786 Think-Aloud Evaluations 788 Usability Test 789 Classic Experiments 790 Focus Groups 791 Choosing a Testing Method 792 Developing and Conducting a Test 795 The Test Plan 795 Test Conduct and Data Collection 803 Analyze, Modify, and Retest 806 Evaluate the Working System 807 Additional Reading 809 A Final Word 810 References 811 Index 835
£61.20
John Wiley & Sons Inc High Performance Switches and Routers Wiley IEEE
Book SynopsisLearn to Design High Performance Switches and Routers for Today's Ever Growing Internet Traffic As Internet traffic continues to grow, and demands for quality of service become more stringent, researchers and engineers can turn to High Performance Switches and Routers for tested and proven solutions.Trade Review"Unique in its approach and scope, and written in an easy-to-follow manner, I strongly recommend it to the interested reading community." (ComputingReviews.com, December 17, 2007)Table of ContentsPreface xv Acknowledgments xvii 1 Introduction 1 1.1 Architecture of the Internet: Present and Future 2 1.1.1 The Present 2 1.1.2 The Future 4 1.2 Router Architectures 5 1.3 Commercial Core Router Examples 9 1.3.1 T640 TX-Matrix 9 1.3.2 Carrier Routing System (CRS-1) 11 1.4 Design of Core Routers 13 1.5 IP Network Management 16 1.5.1 Network Management System Functionalities 16 1.5.2 NMS Architecture 17 1.5.3 Element Management System 18 1.6 Outline of the Book 19 2 IP Address Lookup 25 2.1 Overview 25 2.2 Trie-Based Algorithms 29 2.2.1 Binary Trie 29 2.2.2 Path-Compressed Trie 31 2.2.3 Multi-Bit Trie 33 2.2.4 Level Compression Trie 35 2.2.5 Lulea Algorithm 37 2.2.6 Tree Bitmap Algorithm 42 2.2.7 Tree-Based Pipelined Search 45 2.2.8 Binary Search on Prefix Lengths 47 2.2.9 Binary Search on Prefix Range 48 2.3 Hardware-Based Schemes 51 2.3.1 DIR-24-8-BASIC Scheme 51 2.3.2 DIR-Based Scheme with Bitmap Compression (BC-16-16) 53 2.3.3 Ternary CAM for Route Lookup 57 2.3.4 Two Algorithms for Reducing TCAM Entries 58 2.3.5 Reducing TCAM Power – CoolCAMs 60 2.3.6 TCAM-Based Distributed Parallel Lookup 64 2.4 IPv6 Lookup 67 2.4.1 Characteristics of IPv6 Lookup 67 2.4.2 A Folded Method for Saving TCAM Storage 67 2.4.3 IPv6 Lookup via Variable-Stride Path and Bitmap Compression 69 2.5 Comparison 73 3 Packet Classification 77 3.1 Introduction 77 3.2 Trie-Based Classifications 81 3.2.1 Hierarchical Tries 81 3.2.2 Set-Pruning Trie 82 3.2.3 Grid of Tries 83 3.2.4 Extending Two-Dimensional Schemes 84 3.2.5 Field-Level Trie Classification (FLTC) 85 3.3 Geometric Algorithms 90 3.3.1 Background 90 3.3.2 Cross-Producting Scheme 91 3.3.3 Bitmap-Intersection 92 3.3.4 Parallel Packet Classification (P2C) 93 3.3.5 Area-Based Quadtree 95 3.3.6 Hierarchical Intelligent Cuttings 97 3.3.7 HyperCuts 98 3.4 Heuristic Algorithms 103 3.4.1 Recursive Flow Classification 103 3.4.2 Tuple Space Search 107 3.5 TCAM-Based Algorithms 108 3.5.1 Range Matching in TCAM-Based Packet Classification 108 3.5.2 Range Mapping in TCAMs 110 4 Traffic Management 114 4.1 Quality of Service 114 4.1.1 QoS Parameters 115 4.1.2 Traffic Parameters 116 4.2 Integrated Services 117 4.2.1 Integrated Service Classes 117 4.2.2 IntServ Architecture 117 4.2.3 Resource ReSerVation Protocol (RSVP) 119 4.3 Differentiated Services 121 4.3.1 Service Level Agreement 122 4.3.2 Traffic Conditioning Agreement 123 4.3.3 Differentiated Services Network Architecture 123 4.3.4 Network Boundary Traffic Classification and Conditioning 124 4.3.5 Per Hop Behavior (PHB) 126 4.3.6 Differentiated Services Field 127 4.3.7 PHB Implementation with Packet Schedulers 128 4.4 Traffic Policing and Shaping 129 4.4.1 Location of Policing and Shaping Functions 130 4.4.2 ATM’s Leaky Bucket 131 4.4.3 IP’s Token Bucket 133 4.4.4 Traffic Policing 134 4.4.5 Traffic Shaping 135 4.5 Packet Scheduling 136 4.5.1 Max-Min Scheduling 136 4.5.2 Round-Robin Service 138 4.5.3 Weighted Round-Robin Service 139 4.5.4 Deficit Round-Robin Service 140 4.5.5 Generalized Processor Sharing (GPS) 141 4.5.6 Weighted Fair Queuing (WFQ) 146 4.5.7 Virtual Clock 150 4.5.8 Self-Clocked Fair Queuing 153 4.5.9 Worst-Case Fair Weighted Fair Queuing (WF2Q) 155 4.5.10 WF2Q+ 158 4.5.11 Comparison 159 4.5.12 Priorities Sorting Using a Sequencer 160 4.6 Buffer Management 163 4.6.1 Tail Drop 163 4.6.2 Drop on Full 164 4.6.3 Random Early Detection (RED) 164 4.6.4 Differential Dropping: RIO 167 4.6.5 Fair Random Early Detection (FRED) 168 4.6.6 Stabilized Random Early Detection (SRED) 170 4.6.7 Longest Queue Drop (LQD) 172 5 Basics of Packet Switching 176 5.1 Fundamental Switching Concept 177 5.2 Switch Fabric Classification 181 5.2.1 Time-Division Switching 181 5.2.2 Space-Division Switching 183 5.3 Buffering Strategy in Switching Fabrics 187 5.3.1 Shared-Memory Queuing 188 5.3.2 Output Queuing (OQ) 188 5.3.3 Input Queuing 189 5.3.4 Virtual Output Queuing (VOQ) 189 5.3.5 Combined Input and Output Queuing 190 5.3.6 Crosspoint Queuing 191 5.4 Multiplane Switching and Multistage Switching 191 5.5 Performance of Basic Switches 195 5.5.1 Traffic Model 196 5.5.2 Input-Buffered Switches 197 5.5.3 Output-Buffered Switches 199 5.5.4 Completely Shared-Buffered Switches 201 6 Shared-memory Switches 207 6.1 Linked List Approach 208 6.2 Content Addressable Memory Approach 213 6.3 Space-Time-Space Approach 215 6.4 Scaling the Shared-Memory Switches 217 6.4.1 Washington University Gigabit Switch 217 6.4.2 Concentrator-Based Growable Switch Architecture 218 6.4.3 Parallel Shared-Memory Switches 218 6.5 Multicast Shared-Memory Switches 220 6.5.1 Shared-Memory Switch with a Multicast Logical Queue 220 6.5.2 Shared-Memory Switch with Cell Copy 220 6.5.3 Shared-Memory Switch with Address Copy 222 7 Input-buffered Switches 225 7.1 Scheduling in VOQ-Based Switches 226 7.2 Maximum Matching 229 7.2.1 Maximum Weight Matching 229 7.2.2 Approximate MWM 229 7.2.3 Maximum Size Matching 230 7.3 Maximal Matching 231 7.3.1 Parallel Iterative Matching (PIM) 232 7.3.2 Iterative Round-Robin Matching (iRRM) 233 7.3.3 Iterative Round-Robin with SLIP (iSLIP) 234 7.3.4 Firm 241 7.3.5 Dual Round-Robin Matching (DRRM) 241 7.3.6 Pipelined Maximal Matching 245 7.3.7 Exhaustive Dual Round-Robin Matching (EDRRM) 248 7.4 Randomized Matching Algorithms 249 7.4.1 Randomized Algorithm with Memory 250 7.4.2 A Derandomized Algorithm with Memory 250 7.4.3 Variant Randomize Matching Algorithms 251 7.4.4 Polling Based Matching Algorithms 254 7.4.5 Simulated Performance 258 7.5 Frame-based Matching 262 7.5.1 Reducing the Reconfiguration Frequency 263 7.5.2 Fixed Size Synchronous Frame-Based Matching 267 7.5.3 Asynchronous Variable-Size Frame-Based Matching 270 7.6 Stable Matching with Speedup 273 7.6.1 Output-Queuing Emulation with Speedup of 4 274 7.6.2 Output-Queuing Emulation with Speedup of 2 275 7.6.3 Lowest Output Occupancy Cell First (LOOFA) 278 8 Banyan-based Switches 284 8.1 Banyan Networks 284 8.2 Batcher-Sorting Network 287 8.3 Output Contention Resolution Algorithms 288 8.3.1 Three-Phase Implementation 288 8.3.2 Ring Reservation 288 8.4 The Sunshine Switch 292 8.5 Deflection Routing 294 8.5.1 Tandem Banyan Switch 294 8.5.2 Shuffle-Exchange Network with Deflection Routing 296 8.5.3 Dual Shuffle-Exchange Network with Error-Correcting Routing 297 8.6 Multicast Copy Networks 303 8.6.1 Broadcast Banyan Network 304 8.6.2 Encoding Process 308 8.6.3 Concentration 309 8.6.4 Decoding Process 310 8.6.5 Overflow and Call Splitting 310 8.6.6 Overflow and Input Fairness 311 9 Knockout-based Switches 316 9.1 Single-Stage Knockout Switch 317 9.1.1 Basic Architecture 317 9.1.2 Knockout Concentration Principle 318 9.1.3 Construction of the Concentrator 320 9.2 Channel Grouping Principle 323 9.2.1 Maximum Throughput 324 9.2.2 Generalized Knockout Principle 325 9.3 Two-Stage Multicast Output-Buffered ATM Switch (MOBAS) 327 9.3.1 Two-Stage Configuration 327 9.3.2 Multicast Grouping Network (MGN) 330 9.4 Appendix 333 10 The Abacus Switch 336 10.1 Basic Architecture 337 10.2 Multicast Contention Resolution Algorithm 340 10.3 Implementation of Input Port Controller 342 10.4 Performance 344 10.4.1 Maximum Throughput 344 10.4.2 Average Delay 347 10.4.3 Cell Loss Probability 349 10.5 ATM Routing and Concentration (ARC) Chip 351 10.6 Enhanced Abacus Switch 354 10.6.1 Memoryless Multi-Stage Concentration Network 354 10.6.2 Buffered Multi-Stage Concentration Network 357 10.6.3 Resequencing Cells 359 10.6.4 Complexity Comparison 361 10.7 Abacus Switch for Packet Switching 362 10.7.1 Packet Interleaving 362 10.7.2 Cell Interleaving 364 11 Crosspoint Buffered Switches 367 11.1 Combined Input and Crosspoint Buffered Switches 368 11.2 Combined Input and Crosspoint Buffered Switches with VOQ 370 11.2.1 CIXB with One-Cell Crosspoint Buffers (CIXB-1) 371 11.2.2 Throughput and Delay Performance 371 11.2.3 Non-Negligible Round-Trip Times in CIXB-k 376 11.3 OCF_OCF: Oldest Cell First Scheduling 376 11.4 LQF_RR: Longest Queue First and Round-Robin Scheduling in CIXB-1 378 11.5 MCBF: Most Critical Buffer First Scheduling 379 12 Clos-network Switches 382 12.1 Routing Property of Clos Network Switches 383 12.2 Looping Algorithm 387 12.3 m-Matching Algorithm 388 12.4 Euler Partition Algorithm 388 12.5 Karol’s Algorithm 389 12.6 Frame-Based Matching Algorithm for Clos Network (f-MAC) 391 12.7 Concurrent Matching Algorithm for Clos Network (c-MAC) 392 12.8 Dual-Level Matching Algorithm for Clos Network (d-MAC) 395 12.9 The ATLANTA Switch 398 12.10 Concurrent Round-Robin Dispatching (CRRD) Scheme 400 12.11 The Path Switch 404 12.11.1 Homogeneous Capacity and Route Assignment 406 12.11.2 Heterogeneous Capacity Assignment 408 13 Multi-plane Multi-stage Buffered Switch 413 13.1 TrueWay Switch Architecture 414 13.1.1 Stages of the Switch 415 13.2 Packet Scheduling 417 13.2.1 Partial Packet Interleaving (PPI) 419 13.2.2 Dynamic Packet Interleaving (DPI) 419 13.2.3 Head-of-Line (HOL) Blocking 420 13.3 Stage-To-Stage Flow Control 420 13.3.1 Back-Pressure 421 13.3.2 Credit-Based Flow Control 421 13.3.3 The DQ Scheme 422 13.4 Port-To-Port Flow Control 424 13.4.1 Static Hashing 424 13.4.2 Dynamic Hashing 425 13.4.3 Time-Stamp-Based Resequence 428 13.4.4 Window-Based Resequence 428 13.5 Performance Analysis 431 13.5.1 Random Uniform Traffic 431 13.5.2 Hot-Spot Traffic 432 13.5.3 Bursty Traffic 432 13.5.4 Hashing Schemes 432 13.5.5 Window-Based Resequencing Scheme 434 13.6 Prototype 434 14 Load-balanced Switches 438 14.1 Birkhoff–Von Neumann Switch 438 14.2 Load-Balanced Birkhoff–von Neumann Switches 441 14.2.1 Load-Balanced Birkhoff–von Neumann Switch Architecture 441 14.2.2 Performance of Load-Balanced Birkhoff–von Neumann Switches 442 14.3 Load-Balanced Birkhoff–von Neumann Switches With FIFO Service 444 14.3.1 First Come First Served (FCFS) 446 14.3.2 Earliest Deadline First (EDF) and EDF-3DQ 450 14.3.3 Full Frames First (FFF) 451 14.3.4 Full Ordered Frames First (FOFF) 455 14.3.5 Mailbox Switch 456 14.3.6 Byte-Focal Switch 459 15 Optical Packet Switches 468 15.1 Opto-Electronic Packet Switches 469 15.1.1 Hypass 469 15.1.2 Star-Track 471 15.1.3 Cisneros and Brackett 472 15.1.4 BNR (Bell-North Research) Switch 473 15.1.5 Wave-Mux Switch 474 15.2 Optoelectronic Packet Switch Case Study I 475 15.2.1 Speedup 476 15.2.2 Data Packet Flow 477 15.2.3 Optical Interconnection Network (OIN) 477 15.2.4 Ping-Pong Arbitration Unit 482 15.3 Optoelectronic Packet Switch Case Study II 490 15.3.1 Petabit Photonic Packet Switch Architecture 490 15.3.2 Photonic Switch Fabric (PSF) 495 15.4 All Optical Packet Switches 503 15.4.1 The Staggering Switch 503 15.4.2 Atmos 504 15.4.3 Duan’s Switch 505 15.4.4 3M Switch 506 15.5 Optical Packet Switch with Shared Fiber Delay Lines Single-stage Case 509 15.5.1 Optical Cell Switch Architecture 509 15.5.2 Sequential FDL Assignment (SEFA) Algorithm 512 15.5.3 Multi-Cell FDL Assignment (MUFA) Algorithm 518 15.6 All Optical Packet Switch with Shared Fiber Delay Lines – Three Stage Case 524 15.6.1 Sequential FDL Assignment for Three-Stage OCNS (SEFAC) 526 15.6.2 Multi-Cell FDL Assignment for Three-Stage OCNS (MUFAC) 526 15.6.3 FDL Distribution in Three-Stage OCNS 528 15.6.4 Performance Analysis of SEFAC and MUFAC 530 15.6.5 Complexity Analysis of SEFAC and MUFAC 532 16 High-speed Router Chip Set 538 16.1 Network Processors (NPs) 538 16.1.1 Overview 538 16.1.2 Design Issues for Network Processors 539 16.1.3 Architecture of Network Processors 542 16.1.4 Examples of Network Processors – Dedicated Approach 543 16.2 Co-Processors for Packet Classification 554 16.2.1 LA-1 Bus 554 16.2.2 TCAM-Based Classification Co-Processor 556 16.2.3 Algorithm-Based Classification Co-Processor 562 16.3 Traffic Management Chips 567 16.3.1 Overview 567 16.3.2 Agere’s TM Chip Set 567 16.3.3 IDT TM Chip Set 573 16.3.4 Summary 579 16.4 Switching Fabric Chips 579 16.4.1 Overview 579 16.4.2 Switch Fabric Chip Set from Vitesse 580 16.4.3 Switch Fabric Chip Set from AMCC 589 16.4.4 Switch Fabric Chip Set from IBM (now of AMCC) 593 16.4.5 Switch Fabric Chip Set from Agere 597 Index 606
£149.35
John Wiley & Sons Inc The eBay Billionaires Club
Book SynopsisIN The eBay Billionaires'' Club, you will read thestories of twelve professional eBay merchants whorecognized a great business opportunity on the Internetand pursued it-some at great personal financial risk.In every case, the gamble has paid off. There are some powerful lessons to be learnedfrom these entrepreneurs, whose experiences truly runthe gamut. In the end, what they all have in common is that they started small-and some have purposely decided to stay that way. You''ll quickly discover that eBay success really iswithin your reach, because every person in this bookbegan at the very bottom. What''s more, a number of them have achievedincredible growth in a relatively short period of time,which should motivate you to stop thinking aboutyour idea and get started on the road to becoming amember of this elite club yourself. Get your highlighters out and fasten your seat belts for a journey that will put you on the road to building your own million-dollar-or perhaps Table of ContentsAcknowledgements. Introduction. Essential Steps for Getting Started on eBay. Chapter 1 . Anthony Roberts, AACS Autographs. Chapter 2 . Adam Hersh, Adam Hersh Auctions. Chapter 3. David Yaskulka, Blueberry Boutique. Chapter 4. Dan Glasure, Dan’s Train Depot. Chapter 5. Connie Gray, Estate Treasure by Byrum. Chapter 6. John Wieber, Exel-i. Chapter 7. Ann Mayer and Ellen Navarro, ExpressDrop. Chapter 8 . Robert Walzer, Forklift Deals. Chapter 9. Nir Hollander, Gem Stone King. Chapter 10. Jim Orcholski, J&T Coins. Chapter 11. Dan Yen, Movie Mars. Chapter 12. Marat Denenberg, Narro Corp. Chapter 13. Jacob North Sophias Style Store. 50 Secrets of The eBay Billionaires’ Club. Resources. Index.
£13.59
John Wiley & Sons Inc Programming Mobile Devices
Book SynopsisWith forewords by Jan Bosch, Nokia and Antero Taivalsaari, Sun Microsystems. Learn how to programme the mobile devices of the future! The importance of mobile systems programming has emerged over the recent years as a new domain in software development. The design of software that runs in a mobile device requires that developers combine the rules applicable in embedded environment; memory-awareness, limited performance, security, and limited resources with features that are needed in workstation environment; modifiability, run-time extensions, and rapid application development. Programming Mobile Devices is a comprehensive, practical introduction to programming mobile systems. The book is a platform independent approach to programming mobile devices: it does not focus on specific technologies, and devices, instead it evaluates the component areas and issues that are common to all mobile software platforms. This text will enable the designer to proTable of ContentsForeword by Jan Bosch. Foreword by Antero Taivalsaari. Preface. Acknowledgments. 1 Introduction. 1.1 Motivation. 1.2 Commonly Used Hardware and Software. 1.3 Development Process. 1.4 Chapter Overview. 1.5 Summary. 1.6 Exercises. 2 Memory Management. 2.1 Overview. 2.2 Strategies for Allocating Variables to Memory. 2.3 Design Patterns for Limited Memory. 2.4 Memory Management in Mobile Java. 2.5 Symbian OS Memory Management. 2.6 Summary. 2.7 Exercises. 3 Applications. 3.1 What Constitutes an Application? 3.2 Workflow for Application Development. 3.3 Techniques for Composing Applications. 3.4 Application Models in Mobile Java. 3.5 Symbian OS Application Infrastructure. 3.6 Summary. 3.7 Exercises. 4 Dynamic Linking. 4.1 Overview. 4.2 Implementation Techniques. 4.3 Implementing Plugins. 4.4 Managing Memory Consumption Related to Dynamically Linked Libraries. 4.5 Rules of Thumb for Using Dynamically Loaded Libraries. 4.6 Mobile Java and Dynamic Linking. 4.7 Symbian OS Dynamic Libraries. 4.8 Summary. 4.9 Exercises. 5 Concurrency. 5.1 Motivation. 5.2 Infrastructure for Concurrent Programming. 5.3 Faking Concurrency. 5.4 MIDP Java and Concurrency. 5.5 Symbian OS and Concurrency. 5.6 Summary. 5.7 Exercises. 6 Managing Resources. 6.1 Resource-Related Concerns in Mobile Devices. 6.2 Common Concerns. 6.3 MIDP Java. 6.4 Symbian OS. 6.5 Summary. 6.6 Exercises. 7 Networking. 7.1 Introduction. 7.2 Design Patterns for Networking Environment. 7.3 Problems with Networking Facilities and Implementations. 7.4 MIDP Java and Web Services. 7.5 Symbian OS and Bluetooth Facilities. 7.6 Summary. 7.7 Exercises. 8 Security. 8.1 Overview. 8.2 Secure Coding and Design. 8.3 Infrastructure for Enabling Secured Execution. 8.4 Security Features in MIDP Java. 8.5 Symbian OS Security Features. 8.6 Summary. 8.7 Exercises. References. Index.
£56.66
John Wiley & Sons Inc Developing MultiAgent Systems with JADE Wiley
Book SynopsisLearn how to employ JADE to build multi-agent systems! JADE (Java Agent DEvelopment framework) is a middleware for the development of applications, both in the mobile and fixed environment, based on the Peer-to-Peer intelligent autonomous agent approach.Trade Review"As a guide, this book is much better than online documentation because it's more comprehensive." (IEEE Distributed Systems Online) "…a comprehensive book that covers a wide range of topics related to agent-based programming with JADE." (Computing Reviews.com, October 1, 2007)Table of ContentsThe Authors ix List of Contributors xi Preface xiii 1 Introduction 1 2 Agent Technology Overview 3 2.1 About agents 3 2.2 The Foundation for Intelligent, Physical Agents (FIPA) 10 3 The JADE Platform 29 3.1 Brief history 29 3.2 JADE and the agents paradigm 30 3.3 JADE architecture 32 3.4 Compiling the software and launching the platform 34 3.5 JADE packages 37 3.6 Message transport service 39 3.7 Admin and debugging tools 42 4 Programming with JADE – Basic Features 51 4.1 Creating agents 51 4.2 Agent tasks 57 4.3 Agent communication 65 4.4 Agent discovery: the yellow pages service 72 4.5 Agents with a GUI 75 5 Programming with JADE – Advanced Features 77 5.1 Ontologies and content languages 77 5.2 Composing behaviours to create complex tasks 91 5.3 Threaded behaviours 99 5.4 Interaction protocols 100 5.5 Interacting with the AMS 107 5.6 Starting JADE from an external Java application 111 6 Agent Mobility 115 6.1 Agent mobility 115 6.2 Intra-platform mobility 117 6.3 Inter-platform mobility service 119 6.4 Usage of the JADE mobility services 121 7 JADE Internal Architecture 131 7.1 Distributed coordinated filters 131 7.2 Creating a JADE kernel service 136 8 Running JADE Agents on Mobile Devices 145 8.1 Main limitations of the mobile environment 145 8.2 The LEAP add-on 146 8.3 The split container execution mode 150 8.4 Developing MIDP agents 154 8.5 LEAP add-on advanced 161 9 Deploying a Fault-Tolerant JADE Platform 173 9.1 The main replication service 173 9.2 Attaching the DF to a relational DB 176 10 The JADE Web Services Integration Gateway 181 10.1 Web service technology 181 10.2 The utility of agent and Web service integration 182 10.3 The WSIG architecture 182 10.4 Installation requirements 184 10.5 WSIG installation procedure 185 10.6 WSIG operation 186 10.7 Example 1: Web service client invokes an agent service 193 10.8 Example 2: Agent service invokes a Web service 203 11 Agent-Society Configuration Manager and Launcher 207 11.1 Basic terms and concepts 207 11.2 Book-trading example 209 11.3 Distributed deployment 215 11.4 The XML meta-model 218 11.5 Inside the ASCML 220 11.6 Distributed monitoring, logging and debugging 222 11.7 Outlook 223 12 JADE Semantics Framework 225 12.1 FIPA-SL language 226 12.2 Interpretation engine 230 12.3 Basic semantic agent 231 12.4 Specializing the interpretation activity 234 12.5 Customizing belief handling 237 12.6 Handling Actions 240 12.7 Synthesizing standard and advanced use of the JSA 245 12.8 Conclusions 245 13 A Selection of Other Relevant Tools 247 13.1 The Bean Generator 247 13.2 Jademx 250 13.3 The Java Sniffer 251 13.4 JADEX – engineering goal-oriented agents 254 Appendix A Command Line Options 259 A.1 Syntax 259 A.2 Options to launch containers and main containers 260 A.3 General Options 261 A.4 Options of the JADE kernel-level services 262 A.5 Options related to MTPs 265 A.6 Options to configure the yellow page DF service 267 A.7 Options specific to the JADE-LEAP platform 268 A.8 Extending the command line with user-defined options 269 Appendix B List of Symbols and Acronyms 271 Bibliography 275 References 275 FIPA Specifications 278 Index 281
£79.16
John Wiley & Sons Inc Smart Technologies for Safety Engineering
Book SynopsisSmart technologies comprise a dynamic new interdisciplinary research field that encompasses a wide spectrum of engineering applications including, but not limited to, intelligent structures and materials, actuators, sensors and structural observability, control systems and software tools for the design of adaptive structures.Table of ContentsPreface. About the Authors. Organization of the Book. 1 Introduction to Smart Technologies (Jan Holnicki-Szulc, Jerzy Motylewski and Przemyslaw Kolakowski). 1.1 Smart Technologies – 30 Years of History. 1.2 Smart-Tech Hardware Issues. 1.2.1 Structual Health Monitoring. 1.2.2 Adaptive Impact Absorption. 1.3 Smart-Tech Software Issues. References. 2 The Virtual Distortion Method – A Versatile Reanalysis Tool (Przemyslaw Kolakowski, Marcin Wiklo and Jan Holnicki-Szulc). 2.1 Introduction. 2.2 Overview of Reanalysis Methods. 2.3 Virtual Distortion Method – The Main Idea. 2.4 VDM in Structural Statics. 2.4.1 Influence Matrix in Statics. 2.4.2 Stiffness Remodeling in Statics. 2.4.3 Plasticity in Statics. 2.4.4 Example 1 in Statics. 2.4.5 Example 2 in Statics. 2.5 VDM in Structural Dynamics. 2.5.1 Influence Matrices in Dynamics. 2.5.2 Stiffness Remodeling in Dynamics. 2.5.3 Plasticity in Dynamics. 2.5.4 Mass Remodeling in Dynamics. 2.6 VDM-Based Sensitivity Analysis. 2.7 Versatility of VDM in System Modeling. 2.8 Recapitulation. 2.8.1 General Remarks. 2.8.2 Applications of the VDM to Structures. 2.8.3 Applications of the VDM to Nonstructural Systems. References. 3 VDM-Based Health Monitoring of Engineering Systems (Przemyslaw Kolakowski, Andrzej´ Swiercz, Anita Orlowska, Marek Kokot and Jan Holnicki-Szulc). 3.1 Introduction to Structural Health Monitoring. 3.2 Damage Identification in Skeletal Structures. 3.2.1 Introduction. 3.2.2 Time Domain (VDM-T) versus Frequency Domain (VDM-F). 3.2.3 Modifications in Beams. 3.2.4 Problem Formulation and Optimization Issues. 3.2.5 Numerical Algorithm. 3.2.6 Numerical Examples. 3.2.7 Experimental Verification. 3.2.8 Conclusions. 3.3 Modeling and Identification of Delamination in Double-Layer Beams. 3.3.1 Introduction. 3.3.2 Modeling of Delamination. 3.3.3 Identification of Delamination. 3.3.4 Conclusions. 3.4 Leakage Identification in Water Networks. 3.4.1 Introduction. 3.4.2 Modeling of Water Networks and Analogies to Truss Structures. 3.4.3 VDM-Based Simulation of Parameter Modification. 3.4.4 Leakage Identification. 3.4.5 Numerical Examples. 3.4.6 Conclusions. 3.5 Damage Identification in Electrical Circuits. 3.5.1 Introduction. 3.5.2 Modeling of Electrical Circuits and Analogies to Truss Structures. 3.5.3 VDM Formulation. 3.5.4 Defect Identification. 3.5.5 Numerical Example. 3.5.6 Conclusions. References. 4 Dynamic Load Monitoring (Lukasz Jankowski, Krzysztof Sekula, Bartlomiej D. Blachowski, Marcin Wiklo, and Jan Holnicki-Szulc). 4.1 Real-Time Dynamic Load Identification. 4.1.1 Impact Load Characteristics. 4.1.2 Solution Map Approach. 4.1.3 Approach Based on Force and Acceleration. 4.1.4 Approaches Based on Conservation of Momentum. 4.1.5 Experimental Test Stand. 4.1.6 Experimental Verification. 4.1.7 Comparison of Approaches. 4.2 Observer Technique for On-Line Load Monitoring. 4.2.1 State-Space Representation of Mechanical Systems. 4.2.2 State Estimation and Observability. 4.2.3 Model-Based Input Estimation. 4.2.4 Unknown Input Observer. 4.2.5 Numerical Examples. 4.3 Off-Line Identification of Dynamic Loads. 4.3.1 Response to Dynamic Loading. 4.3.2 Load Reconstruction. 4.3.3 Optimum Sensor Location. 4.3.4 Numerical Example. References. 5 Adaptive Impact Absorption (Piotr K. Pawlowski, Grzegorz Mikulowski, Cezary Graczykowski, Marian Ostrowski, Lukasz Jankowski and Jan Holnicki-Szulc). 5.1 Introduction. 5.2 Multifolding Materials and Structures. 5.2.1 Introduction. 5.2.2 The Multifolding Effect. 5.2.3 Basic Model of the MFM. 5.2.4 Experimental Results. 5.3 Structural Fuses for Smooth Reception of Repetitive Impact Loads. 5.3.1 Introductory Numerical Example. 5.3.2 Optimal Control 162 5.3.3 Structural Recovery. 5.3.4 Numerical Example of Adaptation and Recovery. 5.4 Absorption of Repetitive, Exploitative Impact Loads in Adaptive Landing Gears. 5.4.1 The Concept of Adaptive Landing Gear. 5.4.2 Control System Issues. 5.4.3 Modeling of ALG. 5.4.4 Control Strategies. 5.4.5 Potential for Improvement. 5.4.6 Fast Control of an MRF-Based Shock Absorber. 5.5 Adaptive Inflatable Structures with Controlled Release of Pressure. 5.5.1 The Concept of Adaptive Inflatable Structures (AIS), Mathematical Modeling and Numerical Tools. 5.5.2 Protection against Exploitative Impact Loads for Waterborne Transport. 5.5.3 Protective Barriers against an Emergency Crash for Road Transport. 5.5.4 Adaptive Airbag for Emergency Landing in Aeronautic Applications. 5.6 Adaptive Crash Energy Absorber. 5.6.1 Low-Velocity Impacts. 5.6.2 Energy Absorption by the Prismatic Thin-Walled Structure. 5.6.3 Use of Pyrotechnic Technology for the Crash Stiffness Reduction. References. 6 VDM-Based Remodeling of Adaptive Structures Exposed to Impact Loads (Marcin Wiklo, Lukasz Jankowski, Malgorzata Mróz and Jan Holnicki-Szulc). 6.1 Material Redistribution in Elastic Structures. 6.1.1 VDM Formulation. 6.1.2 Sensitivity Analysis. 6.1.3 Numerical Testing Example. 6.2 Remodeling of Elastoplastic Structures. 6.2.1 VDM Formulation. 6.2.2 Sensitivity Analysis. 6.3 Adaptive Structures with Active Elements. 6.3.1 Stiffest Elastic Substructure. 6.3.2 Structural Fuses as Active Elements. 6.3.3 Comments. 6.4 Remodeling of Damped Elastic Structures. 6.4.1 Damping Model. 6.4.2 General VDM Formulation. 6.4.3 Specific Formulations and Sensitivity Analysis. References. 7 Adaptive Damping of Vibration by the Prestress Accumulation/Release Strategy (Arkadiusz Mróz, Anita Orlowska and Jan Holnicki-Szulc). 7.1 Introduction. 7.2 Mass–Spring System. 7.2.1 The Concept. 7.2.2 Analytical Solution. 7.2.3 Case with Inertia of the Active Spring Considered. 7.3 Delamination of a Layered Beam. 7.3.1 PAR Strategy for Layered Beams. 7.3.2 Numerical Example of a Simply Supported Beam. 7.3.3 PAR – the VDM Formulation. 7.4 Experimental Verification. 7.4.1 Experimental Set-up. 7.4.2 Control Procedure. 7.4.3 Results. 7.5 Possible Applications. References. 8 Modeling and Analysis of Smart Technologies in Vibroacoustics (Tomasz G. Zielínski). 8.1 Introduction. 8.1.1 Smart Hybrid Approach in Vibroacoustics. 8.1.2 A Concept of an Active Composite Noise Absorber. 8.1.3 Physical Problems Involved and Relevant Theories. 8.1.4 General Assumptions and Some Remarks on Notation. 8.2 Biot’s Theory of Poroelasticity. 8.2.1 Isotropic Poroelasticity and the Two Formulations. 8.2.2 The Classical Displacement Formulation. 8.2.3 The Mixed Displacement–Pressure Formulation. 8.3 Porous and Poroelastic Material Data and Coefficients. 8.3.1 Porous Materials with a Rigid Frame. 8.3.2 Poroelastic Materials. 8.4 Weak Forms of Poroelasticity, Elasticity, Piezoelectricity and Acoustics. 8.4.1 Weak Form of the Mixed Formulation of Poroelasticity. 8.4.2 Weak Form for an Elastic Solid. 8.4.3 Weak Form of Piezoelectricity. 8.4.4 Weak Form for an Acoustic Medium. 8.5 Boundary Conditions for Poroelastic Medium. 8.5.1 The Boundary Integral. 8.5.2 Imposed Displacement Field. 8.5.3 Imposed Pressure Field. 8.6 Interface Coupling Conditions for Poroelastic and Other Media. 8.6.1 Poroelastic–Poroelastic Coupling. 8.6.2 Poroelastic–Elastic Coupling. 8.6.3 Poroelastic–Acoustic Coupling. 8.6.4 Acoustic–Elastic Coupling. 8.7 Galerkin Finite Element Model of a Coupled System of Piezoelectric, Elastic, Poroelastic and Acoustic Media. 8.7.1 A Coupled Multiphysics System. 8.7.2 Weak Form of the Coupled System. 8.7.3 Galerkin Finite Element Approximation. 8.7.4 Submatrices and Couplings in the Algebraic System. 8.8 Modeling of Poroelastic Layers with Mass Implants Improving Acoustic Absorption. 8.8.1 Motivation. 8.8.2 Two Approaches in Modeling Small Solid Implants. 8.8.3 Acoustic Absorption of the Poroelastic Layer. 8.8.4 Results of Analyses. 8.8.5 Concluding Remarks. 8.9 Designs of Active Elastoporoelastic Panels. 8.9.1 Introduction. 8.9.2 Active Sandwich Panel. 8.9.3 Active Single-Plate Panel. 8.10 Modeling and Analysis of an Active Single-Plate Panel. 8.10.1 Kinds and Purposes of Numerical Tests. 8.10.2 Plate Tests. 8.10.3 Multilayer Analysis. 8.10.4 Analysis of Passive Behavior of the Panel. 8.10.5 Test of Active Behavior of the Panel. 8.10.6 Concluding Remarks. References. Acknowledgements. Index.
£117.75
John Wiley & Sons Inc Applied Data Mining for Business and Industry
Book SynopsisThe increasing availability of data in our current, information overloaded society has led to the need for valid tools for its modelling and analysis. Data mining and applied statistical methods are the appropriate tools to extract knowledge from such data. This book provides an accessible introduction to data mining methods in a consistent and application oriented statistical framework, using case studies drawn from real industry projects and highlighting the use of data mining methods in a variety of business applications. Introduces data mining methods and applications. Covers classical and Bayesian multivariate statistical methodology as well as machine learning and computational data mining methods. Includes many recent developments such as association and sequence rules, graphical Markov models, lifetime value modelling, credit risk, operational risk and web mining. Features detailed case studies based on applied projects within industry. Trade Review“If I had to recommend a good introduction to data mining, I would choose this one.” (Stat Papers, 2011) Table of Contents1 Introduction. Part I Methodology. 2 Organisation of the data. 2.1 Statistical units and statistical variables. 2.2 Data matrices and their transformations. 2.3 Complex data structures. 2.4 Summary. 3 Summary statistics. 3.1 Univariate exploratory analysis. 3.2 Bivariate exploratory analysis of quantitative data. 3.3 Multivariate exploratory analysis of quantitative data. 3.4 Multivariate exploratory analysis of qualitative data. 3.5 Reduction of dimensionality. 3.6 Further reading. 4 Model specification. 4.1 Measures of distance. 4.2 Cluster analysis. 4.3 Linear regression. 4.4 Logistic regression. 4.5 Tree models. 4.6 Neural networks. 4.7 Nearest-neighbour models. 4.8 Local models. 4.9 Uncertainty measures and inference. 4.10 Non-parametric modelling. 4.11 The normal linear model. 4.12 Generalised linear models. 4.13 Log-linear models. 4.14 Graphical models. 4..15 Survival analysis models. 4.16 Further reading. 5 Model evaluation. 5.1 Criteria based on statistical tests. 5.2 Criteria based on scoring functions. 5.3 Bayesian criteria. 5.4 Computational criteria. 5.5 Criteria based on loss functions. 5.6 Further reading. Part II Business caste studies. 6 Describing website visitors. 6.1 Objectives of the analysis. 6.2 Description of the data. 6.3 Exploratory analysis. 6.4 Model building. 6.5 Model comparison. 6.6 Summary report. 7 Market basket analysis. 7.1 Objectives of the analysis. 7.2 Description of the data. 7.3 Exploratory data analysis. 7.4 Model building. 7.5 Model comparison. 7.6 Summary report. 8 Describing customer satisfaction. 8.1 Objectives of the analysis. 8.2 Description of the data. 8.3 Exploratory data analysis. 8.4 Model building. 8.5 Summary. 9 Predicting credit risk of small businesses. 9.1 Objectives of the analysis. 9.2 Description of the data. 9.3 Exploratory data analysis. 9.4 Model building. 9.5 Model comparison. 9.6 Summary report. 10 Predicting e-learning student performance. 10.1 Objectives of the analysis. 10.2 Description of the data. 10.3 Exploratory data analysis. 10.4 Model specification. 10.5 Model comparison. 10.6 Summary report. 11 Predicting customer lifetime value. 11.1 Objectives of the analysis. 11.2 Description of the data. 11.3 Exploratory data analysis. 11.4 Model specification. 11.5 Model comparison. 11.6 Summary report. 12 Operational risk management. 12.1 Context and objectives of the analysis. 12.2 Exploratory data analysis. 12.3 Model building. 12.4 Model comparison. 12.5 Summary conclusions. References. Index.
£116.96
John Wiley & Sons Inc Applied Data Mining for Business and Industry
Book SynopsisThe increasing availability of data in our current, information overloaded society has led to the need for valid tools for its modelling and analysis. Data mining and applied statistical methods are the appropriate tools to extract knowledge from such data. This book provides an accessible introduction to data mining methods in a consistent and application oriented statistical framework, using case studies drawn from real industry projects and highlighting the use of data mining methods in a variety of business applications. Introduces data mining methods and applications. Covers classical and Bayesian multivariate statistical methodology as well as machine learning and computational data mining methods. Includes many recent developments such as association and sequence rules, graphical Markov models, lifetime value modelling, credit risk, operational risk and web mining. Features detailed case studies based on applied projects within industry. Trade Review“If I had to recommend a good introduction to data mining, I would choose this one.” (Stat Papers, 2011) Table of Contents1 Introduction. Part I Methodology. 2 Organisation of the data. 2.1 Statistical units and statistical variables. 2.2 Data matrices and their transformations. 2.3 Complex data structures. 2.4 Summary. 3 Summary statistics. 3.1 Univariate exploratory analysis. 3.1.1 Measures of location. 3.1.2 Measures of variability. 3.1.3 Measures of heterogeneity. 3.1.4 Measures of concentration. 3.1.5 Measures of asymmetry. 3.1.6 Measures of kurtosis. 3.2 Bivariate exploratory analysis of quantitative data. 3.3 Multivariate exploratory analysis of quantitative data. 3.4 Multivariate exploratory analysis of qualitative data. 3.4.1 Independence and association. 3.4.2 Distance measures. 3.4.3 Dependency measures. 3.4.4 Model-based measures. 3.5 Reduction of dimensionality. 3.5.1 Interpretation of the principal components. 3.6 Further reading. 4 Model specification. 4.1 Measures of distance. 4.1.1 Euclidean distance. 4.1.2 Similarity measures. 4.1.3 Multidimensional scaling. 4.2 Cluster analysis. 4.2.1 Hierarchical methods. 4.2.2 Evaluation of hierarchical methods. 4.2.3 Non-hierarchical methods. 4.3 Linear regression. 4.3.1 Bivariate linear regression. 4.3.2 Properties of the residuals. 4.3.3 Goodness of fit. 4.3.4 Multiple linear regression. 4.4 Logistic regression. 4.4.1 Interpretation of logistic regression. 4.4.2 Discriminant analysis. 4.5 Tree models. 4.5.1 Division criteria. 4.5.2 Pruning. 4.6 Neural networks. 4.6.1 Architecture of a neural network. 4.6.2 The multilayer perceptron. 4.6.3 Kohonen networks. 4.7 Nearest-neighbour models. 4.8 Local models. 4.8.1 Association rules. 4.8.2 Retrieval by content. 4.9 Uncertainty measures and inference. 4.9.1 Probability. 4.9.2 Statistical models. 4.9.3 Statistical inference. 4.10 Non-parametric modelling. 4.11 The normal linear model. 4.11.1 Main inferential results. 4.12 Generalised linear models. 4.12.1 The exponential family. 4.12.2 Definition of generalised linear models. 4.12.3 The logistic regression model. 4.13 Log-linear models. 4.13.1 Construction of a log-linear model. 4.13.2 Interpretation of a log-linear model. 4.13.3 Graphical log-linear models. 4.13.4 Log-linear model comparison. 4.14 Graphical models. 4.14.1 Symmetric graphical models. 4.14.2 Recursive graphical models. 4.14.3 Graphical models and neural networks. 4.15 Survival analysis models. 4.16 Further reading. 5 Model evaluation. 5.1 Criteria based on statistical tests. 5.1.1 Distance between statistical models. 5.1.2 Discrepancy of a statistical model. 5.1.3 Kullback–Leibler discrepancy. 5.2 Criteria based on scoring functions. 5.3 Bayesian criteria. 5.4 Computational criteria. 5.5 Criteria based on loss functions. 5.6 Further reading. Part II Business case studies. 6 Describing website visitors. 6.1 Objectives of the analysis. 6.2 Description of the data. 6.3 Exploratory analysis. 6.4 Model building. 6.4.1 Cluster analysis. 6.4.2 Kohonen networks. 6.5 Model comparison. 6.6 Summary report. 7 Market basket analysis. 7.1 Objectives of the analysis. 7.2 Description of the data. 7.3 Exploratory data analysis. 7.4 Model building. 7.4.1 Log-linear models. 7.4.2 Association rules. 7.5 Model comparison. 7.6 Summary report. 8 Describing customer satisfaction. 8.1 Objectives of the analysis. 8.2 Description of the data. 8.3 Exploratory data analysis. 8.4 Model building. 8.5 Summary. 9 Predicting credit risk of small businesses. 9.1 Objectives of the analysis. 9.2 Description of the data. 9.3 Exploratory data analysis. 9.4 Model building. 9.5 Model comparison. 9.6 Summary report. 10 Predicting e-learning student performance. 10.1 Objectives of the analysis. 10.2 Description of the data. 10.3 Exploratory data analysis. 10.4 Model specification. 10.5 Model comparison. 10.6 Summary report. 11 Predicting customer lifetime value. 11.1 Objectives of the analysis. 11.2 Description of the data. 11.3 Exploratory data analysis. 11.4 Model specification. 11.5 Model comparison. 11.6 Summary report. 12 Operational risk management. 12.1 Context and objectives of the analysis. 12.2 Exploratory data analysis. 12.3 Model building. 12.4 Model comparison. 12.5 Summary conclusions. References. Index.
£44.96
John Wiley & Sons Inc Computer Modeling in Bioengineering
Book SynopsisBioengineering is a broad-based engineering discipline that applies engineering principles and design to challenges in human health and medicine, dealing with bio-molecular and molecular processes, product design, sustainability and analysis of biological systems. Applications that benefit from bioengineering include medical devices, diagnostic equipment and biocompatible materials, amongst others. Computer Modeling in Bioengineering offers a comprehensive reference for a large number of bioengineering topics, presenting important computer modeling problems and solutions for research and medical practice. Starting with basic theory and fundamentals, the book progresses to more advanced methods and applications, allowing the reader to become familiar with different topics to the desired extent. It includes unique and original topics alongside classical computational modeling methods, and each application is structured to explain the physiological background, phenomena that arTable of ContentsContributors. Preface. Part I: Theoretical Background of Computational Methods. 1. Notation - Matrices and Tensors. 2. Fundamentals of Continuum Mechanics. 3. Heat Transfer, Diffusion, Fluid Mechanics, and Fluid Flow through Porous Deformable Media. Part II: Fundamentals of Computational Methods. 4. Isoparametric Formulation of Finite Elements. 5. Dynamic Finite Element Analysis. 6. Introduction to Nonlinear Finite Element Analysis. 7. Finite Element Modeling of Field Problems. 8. Discrete Particle Methods for Modeling of Solids and Fluids. Part III: Computational Methods in Bioengineering. 9. Introduction to Bioengineering. 10. Bone Modeling. 11. Biological Soft Tissue. 12. Skeletal Muscles. 13. Blood Flow and Blood Vessels. 14. Modeling Mass Transport and Thrombosis in Arteries. 15. Cartilage Mechanics. 16. Cell Mechanics. 17. Extracellular Mechanotransduction: Modeling Ligand Concentration Dynamics in the Lateral Intercellular Space of Compressed Airway Epithelial Cells. 18. Spider Silk: Modeling Solvent Removal during Synthetic and Nephila clavipes Fiber Spinning. 19. Modeling in Cancer Nanotechnology. Index.
£117.85
John Wiley & Sons Inc Web Design
Book Synopsis* Complete introduction in the classic academic sense - a foundation text which focuses on principles. * By the authors of Digital Multimedia and Digital Media Tools, textbooks which helped shape Multimedia syllabuses across the world.Table of ContentsWelcome x 1. Web Experiences 1 Web Pages and Sites 2 Using the Web 8 The Web Community 15 Web Design Principles 21 New Developments 25 Key Points 29 Exercises 32 2. Web Technology 35 Web Pages 36 Fetching Pages 46 Data Representations 70 Transmission of Digital Data 79 Key Points 93 Exercises 97 3. Markup 99 XML 101 XHTML 110 Key Points 145 Exercises 148 4. Stylesheets 151 Rules in CSS 153 Typography 162 Layout 176 Positioning 191 Special Cases 199 Advanced Features of CSS 208 Key Points 215 Exercises 220 5. Web Graphics 223 Display and Storage of Images 224 Colour 227 Bitmapped Images 237 Vector Graphics 254 XHTML Markup for Images 269 Key Points 276 Exercises 281 6. Time-Based Media 283 Time-Based Media and Web Pages 287 Animation 296 Video 307 Sound 326 Key Points 331 Exercises 335 7. DOM Scripting 339 Fundamentals 342 The DOM 349 JavaScript 357 Dynamic Pages 370 Applications of DOM Scripting 386 Embedded Applications 412 Key Points 427 Exercises 432 8. Web Applications 435 Server-Side Technologies 436 Ready-Made Applications 446 Databases 450 Dynamically Generated Pages 462 Key Points 496 Exercises 500 9. Web Accessibility 503 Problems with Access 504 Assistive Technology 510 Making Sites More Accessible 513 Accessible Content 519 Accessible Function 533 Key Points 541 Exercises 545 10. Web Page Design 547 Visual Communication 549 Layout 563 Colour and Tone 586 Typography 592 Key Points 604 Exercises 608 11. Web Site Design 611 Logical Structure 613 URL Structure 616 Navigational Structure 619 Creating Web Sites 633 Epilogue 646 Key Points 647 Exercises 650 Appendix A. Software for Web Designers 652 Appendix B. XML Namespaces 666 Index 672
£48.56
John Wiley & Sons Inc Multimedia Signal Processing
Book SynopsisMultimedia Signal Processing is a comprehensive and accessible text to the theory and applications of digital signal processing (DSP). The applications of DSP are pervasive and include multimedia systems, cellular communication, adaptive network management, radar, pattern recognition, medical signal processing, financial data forecasting, artificial intelligence, decision making, control systems and search engines. This book is organised in to three major parts making it a coherent and structured presentation of the theory and applications of digital signal processing. A range of important topics are covered in basic signal processing, model-based statistical signal processing and their applications. Part 1: Basic Digital Signal Processing gives an introduction to the topic, discussing sampling and quantization, Fourier analysis and synthesis, Z-transform, and digital filters. Part 2: Model-based Signal Processing covers probability and infoTrade Review"A valuable and accessible text … .Suited not only for senior undergraduates and postgraduates but also for researchers and engineers." (Zentralblatt Math, 2008/17)Table of ContentsPreface. Acknowledgement. Symbols. Abbreviations. Part I Basic Digital Signal Processing. 1 Introduction. 1.1 Signals and Information. 1.2 Signal Processing Methods. 1.3 Applications of Digital Signal Processing. 1.4 Summary. 2 Fourier Analysis and Synthesis. 2.1 Introduction. 2.2 Fourier Series: Representation of Periodic Signals. 2.3 Fourier Transform: Representation of Nonperiodic Signals. 2.4 Discrete Fourier Transform. 2.5 Short-Time Fourier Transform. 2.6 Fast Fourier Transform (FFT). 2.7 2-D Discrete Fourier Transform (2-D DFT). 2.8 Discrete Cosine Transform (DCT). 2.9 Some Applications of the Fourier Transform. 2.10 Summary. 3 z-Transform. 3.1 Introduction. 3.2 Derivation of the z-Transform. 3.3 The z-Plane and the Unit Circle. 3.4 Properties of z-Transform. 3.5 z-Transfer Function, Poles (Resonance) and Zeros (Anti-resonance). 3.6 z-Transform of Analysis of Exponential Transient Signals. 3.7 Inverse z-Transform. 3.8 Summary. 4 Digital Filters. 4.1 Introduction. 4.2 Linear Time-Invariant Digital Filters. 4.3 Recursive and Non-Recursive Filters. 4.4 Filtering Operation: Sum of Vector Products, A Comparison of Convolution and Correlation. 4.5 Filter Structures: Direct, Cascade and Parallel Forms. 4.6 Linear Phase FIR Filters. 4.7 Design of Digital FIR Filter-banks. 4.8 Quadrature Mirror Sub-band Filters. 4.9 Design of Infinite Impulse Response (IIR) Filters by Pole–zero Placements. 4.10 Issues in the Design and Implementation of a Digital Filter. 4.11 Summary. 5 Sampling and Quantisation. 5.1 Introduction. 5.2 Sampling a Continuous-Time Signal. 5.3 Quantisation. 5.4 Sampling Rate Conversion: Interpolation and Decimation. 5.5 Summary. Part II Model-Based Signal Processing. 6 Information Theory and Probability Models. 6.1 Introduction: Probability and Information Models. 6.2 Random Processes. 6.3 Probability Models of Random Signals. 6.4 Information Models. 6.5 Stationary and Non-Stationary Random Processes. 6.6 Statistics (Expected Values) of a Random Process. 6.7 Some Useful Practical Classes of Random Processes. 6.8 Transformation of a Random Process. 6.9 Search Engines: Citation Ranking. 6.10 Summary. 7 Bayesian Inference. 7.1 Bayesian Estimation Theory: Basic Definitions. 7.2 Bayesian Estimation. 7.3 Expectation Maximisation Method. 7.4 Cramer–Rao Bound on the Minimum Estimator Variance. 7.5 Design of Gaussian Mixture Models (GMM). 7.6 Bayesian Classification. 7.7 Modelling the Space of a Random Process. 7.8 Summary. 8 Least Square Error, Wiener–Kolmogorov Filters. 8.1 Least Square Error Estimation: Wiener–Kolmogorov Filter. 8.2 Block-Data Formulation of the Wiener Filter. 8.3 Interpretation of Wiener Filter as Projection in Vector Space. 8.4 Analysis of the Least Mean Square Error Signal. 8.5 Formulation of Wiener Filters in the Frequency Domain. 8.6 Some Applications of Wiener Filters. 8.7 Implementation of Wiener Filters. 8.8 Summary. 9 Adaptive Filters: Kalman, RLS, LMS. 9.1 Introduction. 9.2 State-Space Kalman Filters. 9.3 Sample Adaptive Filters. 9.4 Recursive Least Square (RLS) Adaptive Filters. 9.5 The Steepest-Descent Method. 9.6 LMS Filter. 9.7 Summary. 10 Linear Prediction Models. 10.1 Linear Prediction Coding. 10.2 Forward, Backward and Lattice Predictors. 10.3 Short-Term and Long-Term Predictors. 10.4 MAP Estimation of Predictor Coefficients. 10.5 Formant-Tracking LP Models. 10.6 Sub-Band Linear Prediction Model. 10.7 Signal Restoration Using Linear Prediction Models. 10.8 Summary. 11 Hidden Markov Models. 11.1 Statistical Models for Non-Stationary Processes. 11.2 Hidden Markov Models. 11.3 Training Hidden Markov Models. 11.4 Decoding Signals Using Hidden Markov Models. 11.5 HMM in DNA and Protein Sequences. 11.6 HMMs for Modelling Speech and Noise. 11.7 Summary. 12 Eigenvector Analysis, Principal Component Analysis and Independent Component Analysis. 12.1 Introduction – Linear Systems and Eigenanalysis. 12.2 Eigenvectors and Eigenvalues. 12.3 Principal Component Analysis (PCA). 12.4 Independent Component Analysis. 12.5 Summary. Part III Applications of Digital Signal Processing to Speech, Music and Telecommunications. 13 Music Signal Processing and Auditory Perception. 13.1 Introduction. 13.2 Musical Notes, Intervals and Scales. 13.3 Musical Instruments. 13.4 Review of Basic Physics of Sounds. 13.5 Music Signal Features and Models. 13.6 Anatomy of the Ear and the Hearing Process. 13.7 Psychoacoustics of Hearing. 13.8 Music Coding (Compression). 13.9 High Quality Audio Coding: MPEG Audio Layer-3 (MP3). 13.10 Stereo Music Coding. 13.11 Summary. 14 Speech Processing. 14.1 Speech Communication. 14.2 Acoustic Theory of Speech: The Source–filter Model. 14.3 Speech Models and Features. 14.4 Linear Prediction Models of Speech. 14.5 Harmonic Plus Noise Model of Speech. 14.6 Fundamental Frequency (Pitch) Information. 14.7 Speech Coding. 14.8 Speech Recognition. 14.9 Summary. 15 Speech Enhancement. 15.1 Introduction. 15.2 Single-Input Speech Enhancement Methods. 15.3 Speech Bandwidth Extension – Spectral Extrapolation. 15.4 Interpolation of Lost Speech Segments – Packet Loss Concealment. 15.5 Multi-Input Speech Enhancement Methods. 15.6 Speech Distortion Measurements. 15.7 Summary. 16 Echo Cancellation. 16.1 Introduction: Acoustic and Hybrid Echo. 16.2 Telephone Line Hybrid Echo. 16.3 Hybrid (Telephone Line) Echo Suppression. 16.4 Adaptive Echo Cancellation. 16.5 Acoustic Echo. 16.6 Sub-Band Acoustic Echo Cancellation. 16.7 Echo Cancellation with Linear Prediction Pre-whitening. 16.8 Multi-Input Multi-Output Echo Cancellation. 16.9 Summary. 17 Channel Equalisation and Blind Deconvolution. 17.1 Introduction. 17.2 Blind Equalisation Using Channel Input Power Spectrum. 17.3 Equalisation Based on Linear Prediction Models. 17.4 Bayesian Blind Deconvolution and Equalisation. 17.5 Blind Equalisation for Digital Communication Channels. 17.6 Equalisation Based on Higher-Order Statistics. 17.7 Summary. 18 Signal Processing in Mobile Communication. 18.1 Introduction to Cellular Communication. 18.2 Communication Signal Processing in Mobile Systems. 18.3 Capacity, Noise, and Spectral Efficiency. 18.4 Multi-path and Fading in Mobile Communication. 18.5 Smart Antennas – Space–Time Signal Processing. 18.6 Summary. Index.
£97.16