Computer networking and communications Books

Book SynopsisA complete guide to Pentaho Kettle, the Pentaho Data lntegration toolset for ETL This practical book is a complete guide to installing, configuring, and managing Pentaho Kettle. If you're a database administrator or developer, you'll first get up to speed on Kettle basics and how to apply Kettle to create ETL solutionsbefore progressing to specialized concepts such as clustering, extensibility, and data vault models. Learn how to design and build every phase of an ETL solution. Shows developers and database administrators how to use the open-source Pentaho Kettle for enterprise-level ETL processes (Extracting, Transforming, and Loading data) Assumes no prior knowledge of Kettle or ETL, and brings beginners thoroughly up to speed at their own pace Explains how to get Kettle solutions up and running, then follows the 34 ETL subsystems model, as created by the Kimball Group, to explore the entire ETL lifecycle, including all aspects of data warehoTable of ContentsIntroduction xxxi Part I Getting Started 1 Chapter 1 ETL Primer 3 OLTP versus Data Warehousing 3 What Is ETL? 5 The Evolution of ETL Solutions 5 ETL Building Blocks 7 ETL, ELT, and EII 8 ELT 9 EII: Virtual Data Integration 10 Data Integration Challenges 11 Methodology: Agile BI 12 ETL Design 14 Data Acquisition 14 Beware of Spreadsheets 15 Design for Failure 15 Change Data Capture 16 Data Quality 16 Data Profiling 16 Data Validation 17 ETL Tool Requirements 17 Connectivity 17 Platform Independence 18 Scalability 18 Design Flexibility 19 Reuse 19 Extensibility 19 Data Transformations 20 Testing and Debugging 21 Lineage and Impact Analysis 21 Logging and Auditing 22 Summary 22 Chapter 2 Kettle Concepts 23 Design Principles 23 The Building Blocks of Kettle Design 25 Transformations 25 Steps 26 Transformation Hops 26 Parallelism 27 Rows of Data 27 Data Conversion 29 Jobs 30 Job Entries 31 Job Hops 31 Multiple Paths and Backtracking 32 Parallel Execution 33 Job Entry Results 34 Transformation or Job Metadata 36 Database Connections 37 Special Options 38 The Power of the Relational Database 39 Connections and Transactions 39 Database Clustering 40 Tools and Utilities 41 Repositories 41 Virtual File Systems 42 Parameters and Variables 43 Defining Variables 43 Named Parameters 44 Using Variables 44 Visual Programming 45 Getting Started 46 Creating New Steps 47 Putting It All Together 49 Summary 51 Chapter 3 Installation and Configuration 53 Kettle Software Overview 53 Integrated Development Environment: Spoon 55 Command-Line Launchers: Kitchen and Pan 57 Job Server: Carte 57 Encr.bat and encr.sh 58 Installation 58 Java Environment 58 Installing Java Manually 58 Using Your Linux Package Management System 59 Installing Kettle 59 Versions and Releases 59 Archive Names and Formats 60 Downloading and Uncompressing 60 Running Kettle Programs 61 Creating a Shortcut Icon or Launcher for Spoon 62 Configuration 63 Configuration Files and the .kettle Directory 63 The Kettle Shell Scripts 69 General Structure of the Startup Scripts 70 Adding an Entry to the Classpath 70 Changing the Maximum Heap Size 71 Managing JDBC Drivers 72 Summary 72 Chapter 4 An Example ETL Solution—Sakila 73 Sakila 73 The Sakila Sample Database 74 DVD Rental Business Process 74 Sakila Database Schema Diagram 75 Sakila Database Subject Areas 75 General Design Considerations 77 Installing the Sakila Sample Database 77 The Rental Star Schema 78 Rental Star Schema Diagram 78 Rental Fact Table 79 Dimension Tables 79 Keys and Change Data Capture 80 Installing the Rental Star Schema 81 Prerequisites and Some Basic Spoon Skills 81 Setting Up the ETL Solution 82 Creating Database Accounts 82 Working with Spoon 82 Opening Transformation and Job Files 82 Opening the Step’s Configuration Dialog 83 Examining Streams 83 Running Jobs and Transformations 83 The Sample ETL Solution 84 Static, Generated Dimensions 84 Loading the dim_date Dimension Table 84 Loading the dim_time Dimension Table 86 Recurring Load 87 The load_rentals Job 88 The load_dim_staff Transformation 91 Database Connections 91 The load_dim_customer Transformation 95 The load_dim_store Transformation 98 The fetch_address Subtransformation 99 The load_dim_actor Transformation 101 The load_dim_film Transformation 102 The load_fact_rental Transformation 107 Summary 109 Part II ETL 111 Chapter 5 ETL Subsystems 113 Introduction to the 34 Subsystems 114 Extraction 114 Subsystems 1–3: Data Profiling, Change Data Capture, and Extraction 115 Cleaning and Conforming Data 116 Subsystem 4: Data Cleaning and Quality Screen Handler System 116 Subsystem 5: Error Event Handler 117 Subsystem 6: Audit Dimension Assembler 117 Subsystem 7: Deduplication System 117 Subsystem 8: Data Conformer 118 Data Delivery 118 Subsystem 9: Slowly Changing Dimension Processor 118 Subsystem 10: Surrogate Key Creation System 119 Subsystem 11: Hierarchy Dimension Builder 119 Subsystem 12: Special Dimension Builder 120 Subsystem 13: Fact Table Loader 121 Subsystem 14: Surrogate Key Pipeline 121 Subsystem 15: Multi-Valued Dimension Bridge Table Builder 121 Subsystem 16: Late-Arriving Data Handler 122 Subsystem 17: Dimension Manager System 122 Subsystem 18: Fact Table Provider System 122 Subsystem 19: Aggregate Builder 123 Subsystem 20: Multidimensional (OLAP) Cube Builder 123 Subsystem 21: Data Integration Manager 123 Managing the ETL Environment 123 Summary 126 Chapter 6 Data Extraction 127 Kettle Data Extraction Overview 128 File-Based Extraction 128 Working with Text Files 128 Working with XML files 133 Special File Types 134 Database-Based Extraction 134 Web-Based Extraction 137 Text-Based Web Extraction 137 HTTP Client 137 Using SOAP 138 Stream-Based and Real-Time Extraction 138 Working with ERP and CRM Systems 138 ERP Challenges 139 Kettle ERP Plugins 140 Working with SAP Data 140 ERP and CDC Issues 146 Data Profiling 146 Using eobjects.org DataCleaner 147 Adding Profile Tasks 149 Adding Database Connections 149 Doing an Initial Profile 151 Working with Regular Expressions 151 Profiling and Exploring Results 152 Validating and Comparing Data 153 Using a Dictionary for Column Dependency Checks 153 Alternative Solutions 154 Text Profiling with Kettle 154 CDC: Change Data Capture 154 Source Data–Based CDC 155 Trigger-Based CDC 157 Snapshot-Based CDC 158 Log-Based CDC 162 Which CDC Alternative Should You Choose? 163 Delivering Data 164 Summary 164 Chapter 7 Cleansing and Conforming 167 Data Cleansing 168 Data-Cleansing Steps 169 Using Reference Tables 172 Conforming Data Using Lookup Tables 172 Conforming Data Using Reference Tables 175 Data Validation 179 Applying Validation Rules 180 Validating Dependency Constraints 183 Error Handling 183 Handling Process Errors 184 Transformation Errors 186 Handling Data (Validation) Errors 187 Auditing Data and Process Quality 191 Deduplicating Data 192 Handling Exact Duplicates 193 The Problem of Non-Exact Duplicates 194 Building Deduplication Transforms 195 Step 1: Fuzzy Match 197 Step 2: Select Suspects 198 Step 3: Lookup Validation Value 198 Step 4: Filter Duplicates 199 Scripting 200 Formula 201 JavaScript 202 User-Defined Java Expressions 202 Regular Expressions 203 Summary 205 Chapter 8 Handling Dimension Tables 207 Managing Keys 208 Managing Business Keys 209 Keys in the Source System 209 Keys in the Data Warehouse 209 Business Keys 209 Storing Business Keys 210 Looking Up Keys with Kettle 210 Generating Surrogate Keys 210 The “Add sequence” Step 211 Working with auto_increment or IDENTITY Columns 217 Keys for Slowly Changing Dimensions 217 Loading Dimension Tables 218 Snowflaked Dimension Tables 218 Top-Down Level-Wise Loading 219 Sakila Snowflake Example 219 Sample Transformation 221 Database Lookup Configuration 222 Sample Job 225 Star Schema Dimension Tables 226 Denormalization 226 Denormalizing to 1NF with the “Database lookup” Step 226 Change Data Capture 227 Slowly Changing Dimensions 228 Types of Slowly Changing Dimensions 228 Type 1 Slowly Changing Dimensions 229 The Insert / Update Step 229 Type 2 Slowly Changing Dimensions 232 The “Dimension lookup / update” Step 232 Other Types of Slowly Changing Dimensions 237 Type 3 Slowly Changing Dimensions 237 Hybrid Slowly Changing Dimensions 238 More Dimensions 239 Generated Dimensions 239 Date and Time Dimensions 239 Generated Mini-Dimensions 239 Junk Dimensions 241 Recursive Hierarchies 242 Summary 243 Chapter 9 Loading Fact Tables 245 Loading in Bulk 246 STDIN and FIFO 247 Kettle Bulk Loaders 248 MySQL Bulk Loading 249 LucidDB Bulk Loader 249 Oracle Bulk Loader 249 PostgreSQL Bulk Loader 250 Table Output Step 250 General Bulk Load Considerations 250 Dimension Lookups 251 Maintaining Referential Integrity 251 The Surrogate Key Pipeline 252 Using In-Memory Lookups 253 Stream Lookups 253 Late-Arriving Data 255 Late-Arriving Facts 256 Late-Arriving Dimensions 256 Fact Table Handling 260 Periodic and Accumulating Snapshots 260 Introducing State-Oriented Fact Tables 261 Loading Periodic Snapshots 263 Loading Accumulating Snapshots 264 Loading State-Oriented Fact Tables 265 Loading Aggregate Tables 266 Summary 267 Chapter 10 Working with OLAP Data 269 OLAP Benefits and Challenges 270 OLAP Storage Types 272 Positioning OLAP 272 Kettle OLAP Options 273 Working with Mondrian 274 Working with XML/A Servers 277 Working with Palo 282 Setting Up the Palo Connection 283 Palo Architecture 284 Reading Palo Data 285 Writing Palo Data 289 Summary 291 Part III Management and Deployment 293 Chapter 11 ETL Development Lifecycle 295 Solution Design 295 Best and Bad Practices 296 Data Mapping 297 Naming and Commentary Conventions 298 Common Pitfalls 299 ETL Flow Design 300 Reusability and Maintainability 300 Agile Development 301 Testing and Debugging 306 Test Activities 307 ETL Testing 308 Test Data Requirements 308 Testing for Completeness 309 Testing Data Transformations 311 Test Automation and Continuous Integration 311 Upgrade Tests 312 Debugging 312 Documenting the Solution 315 Why Isn’t There Any Documentation? 316 Myth 1: My Software Is Self-Explanatory 316 Myth 2: Documentation Is Always Outdated 316 Myth 3: Who Reads Documentation Anyway? 317 Kettle Documentation Features 317 Generating Documentation 319 Summary 320 Chapter 12 Scheduling and Monitoring 321 Scheduling 321 Operating System–Level Scheduling 322 Executing Kettle Jobs and Transformations from the Command Line 322 UNIX-Based Systems: cron 326 Windows: The at utility and the Task Scheduler 327 Using Pentaho’s Built-in Scheduler 327 Creating an Action Sequence to Run Kettle Jobs and Transformations 328 Kettle Transformations in Action Sequences 329 Creating and Maintaining Schedules with the Administration Console 330 Attaching an Action Sequence to a Schedule 333 Monitoring 333 Logging 333 Inspecting the Log 333 Logging Levels 335 Writing Custom Messages to the Log 336 E‑mail Notifications 336 Configuring the Mail Job Entry 337 Summary 340 Chapter 13 Versioning and Migration 341 Version Control Systems 341 File-Based Version Control Systems 342 Organization 342 Leading File-Based VCSs 343 Content Management Systems 344 Kettle Metadata 344 Kettle XML Metadata 345 Transformation XML 345 Job XML 346 Global Replace 347 Kettle Repository Metadata 348 The Kettle Database Repository Type 348 The Kettle File Repository Type 349 The Kettle Enterprise Repository Type 350 Managing Repositories 350 Exporting and Importing Repositories 350 Upgrading Your Repository 351 Version Migration System 352 Managing XML Files 352 Managing Repositories 352 Parameterizing Your Solution 353 Summary 356 Chapter 14 Lineage and Auditing 357 Batch-Level Lineage Extraction 358 Lineage 359 Lineage Information 359 Impact Analysis Information 361 Logging and Operational Metadata 363 Logging Basics 363 Logging Architecture 364 Setting a Maximum Buffer Size 365 Setting a Maximum Log Line Age 365 Log Channels 366 Log Text Capturing in a Job 366 Logging Tables 367 Transformation Logging Tables 367 Job Logging Tables 373 Summary 374 Part IV Performance and Scalability 375 Chapter 15 Performance Tuning 377 Transformation Performance: Finding the Weakest Link 377 Finding Bottlenecks by Simplifying 379 Finding Bottlenecks by Measuring 380 Copying Rows of Data 382 Improving Transformation Performance 384 Improving Performance in Reading Text Files 384 Using Lazy Conversion for Reading Text Files 385 Single-File Parallel Reading 385 Multi-File Parallel Reading 386 Configuring the NIO Block Size 386 Changing Disks and Reading Text Files 386 Improving Performance in Writing Text Files 387 Using Lazy Conversion for Writing Text Files 387 Parallel Files Writing 387 Changing Disks and Writing Text Files 387 Improving Database Performance 388 Avoiding Dynamic SQL 388 Handling Roundtrips 388 Handling Relational Databases 390 Sorting Data 392 Sorting on the Database 393 Sorting in Parallel 393 Reducing CPU Usage 394 Optimizing the Use of JavaScript 394 Launching Multiple Copies of a Step 396 Selecting and Removing Values 397 Managing Thread Priorities 397 Adding Static Data to Rows of Data 397 Limiting the Number of Step Copies 398 Avoiding Excessive Logging 398 Improving Job Performance 399 Loops in Jobs 399 Database Connection Pools 400 Summary 401 Chapter 16 Parallelization, Clustering, and Partitioning 403 Multi-Threading 403 Row Distribution 404 Row Merging 405 Row Redistribution 406 Data Pipelining 407 Consequences of Multi-Threading 408 Database Connections 408 Order of Execution 409 Parallel Execution in a Job 411 Using Carte as a Slave Server 411 The Configuration File 411 Defining Slave Servers 412 Remote Execution 413 Monitoring Slave Servers 413 Carte Security 414 Services 414 Clustering Transformations 417 Defining a Cluster Schema 417 Designing Clustered Transformations 418 Execution and Monitoring 420 Metadata Transformations 421 Rules 422 Data Pipelining 425 Partitioning 425 Defining a Partitioning Schema 425 Objectives of Partitioning 427 Implementing Partitioning 428 Internal Variables 428 Database Partitions 429 Partitioning in a Clustered Transformation 430 Summary 430 Chapter 17 Dynamic Clustering in the Cloud 433 Dynamic Clustering 433 Setting Up a Dynamic Cluster 434 Using the Dynamic Cluster 436 Cloud Computing 437 EC2 438 Getting Started with EC2 438 Costs 438 Customizing an AMI 439 Packaging a New AMI 442 Terminating an AMI 442 Running a Master 442 Running the Slaves 443 Using the EC2 Cluster 444 Monitoring 445 The Lightweight Principle and Persistence Options 446 Summary 447 Chapter 18 Real-Time Data Integration 449 Introduction to Real-Time ETL 449 Real-Time Challenges 450 Requirements 451 Transformation Streaming 452 A Practical Example of Transformation Streaming 454 Debugging 457 Third-Party Software and Real-Time Integration 458 Java Message Service 459 Creating a JMS Connection and Session 459 Consuming Messages 460 Producing Messages 460 Closing Shop 460 Summary 461 Part V Advanced Topics 463 Chapter 19 Data Vault Management 465 Introduction to Data Vault Modeling 466 Do You Need a Data Vault? 466 Data Vault Building Blocks 467 Hubs 467 Links 468 Satellites 469 Data Vault Characteristics 471 Building a Data Vault 471 Transforming Sakila to the Data Vault Model 472 Sakila Hubs 472 Sakila Links 473 Sakila Satellites 474 Loading the Data Vault: A Sample ETL Solution 477 Installing the Sakila Data Vault 477 Setting Up the ETL Solution 477 Creating a Database Account 477 The Sample ETL Data Vault Solution 478 Sample Hub: hub_actor 478 Sample Link: link_customer_store 480 Sample Satellite: sat_actor 483 Loading the Data Vault Tables 485 Updating a Data Mart from a Data Vault 486 The Sample ETL Solution 486 The dim_actor Transformation 486 The dim_customer Transformation 488 The dim_film Transformation 492 The dim_film_actor_bridge Transformation 492 The fact_rental Transformation 493 Loading the Star Schema Tables 495 Summary 495 Chapter 20 Handling Complex Data Formats 497 Non-Relational and Non-Tabular Data Formats 498 Non-Relational Tabular Formats 498 Handling Multi-Valued Attributes 498 Using the Split Field to Rows Step 499 Handling Repeating Groups 500 Using the Row Normaliser Step 500 Semi- and Unstructured Data 501 Kettle Regular Expression Example 503 Configuring the Regex Evaluation Step 504 Verifying the Match 507 Key/Value Pairs 508 Kettle Key/Value Pairs Example 509 Text File Input 509 Regex Evaluation 510 Grouping Lines into Records 511 Denormaliser: Turning Rows into Columns 512 Summary 513 Chapter 21 Web Services 515 Web Pages and Web Services 515 Kettle Web Features 516 General HTTP Steps 516 Simple Object Access Protocol 517 Really Simple Syndication 517 Apache Virtual File System Integration 517 Data Formats 517 XML 518 Kettle Steps for Working with XML 518 Kettle Job Entries for XML 519 HTML 520 JavaScript Object Notation 520 Syntax 521 JSON, Kettle, and ETL/DI 522 XML Examples 523 Example XML Document 523 XML Document Structure 523 Mapping to the Sakila Sample Database 524 Extracting Data from XML 525 Overall Design: The import_xml_into_db Transformation 526 Using the XSD Validator Step 528 Using the “Get Data from XML” Step 530 Generating XML Documents 537 Overall Design: The export_xml_from_db Transformation 537 Generating XML with the Add XML Step 538 Using the XML Join Step 541 SOAP Examples 544 Using the “Web services lookup” Step 544 Configuring the “Web services lookup” Step 544 Accessing SOAP Services Directly 546 JSON Example 549 The Freebase Project 549 Freebase Versus Wikipedia 549 Freebase Web Services 550 The Freebase Read Service 550 The Metaweb Query Language 551 Extracting Freebase Data with Kettle 553 Generate Rows 554 Issuing a Freebase Read Request 555 Processing the Freebase Result Envelope 556 Filtering Out the Original Row 557 Storing to File 558 RSS 558 RSS Structure 558 Channel 558 Item 559 RSS Support in Kettle 560 RSS Input 561 RSS Output 562 Summary 567 Chapter 22 Kettle Integration 569 The Kettle API 569 The LGPL License 569 The Kettle Java API 570 Source Code 570 Building Kettle 571 Building javadoc 571 Libraries and the Class Path 571 Executing Existing Transformations and Jobs 571 Executing a Transformation 572 Executing a Job 573 Embedding Kettle 574 Pentaho Reporting 574 Putting Data into a Transformation 576 Dynamic Transformations 580 Dynamic Template 583 Dynamic Jobs 584 Executing Dynamic ETL in Kettle 586 Result 587 Replacing Metadata 588 Direct Changes with the API 589 Using a Shared Objects File 589 OEM Versions and Forks 590 Creating an OEM Version of PDI 590 Forking Kettle 591 Summary 592 Chapter 23 Extending Kettle 593 Plugin Architecture Overview 593 Plugin Types 594 Architecture 595 Prerequisites 596 Kettle API Documentation 596 Libraries 596 Integrated Development Environment 596 Eclipse Project Setup 597 Examples 598 Transformation Step Plugins 599 StepMetaInterface 599 Value Metadata 605 Row Metadata 606 StepDataInterface 607 StepDialogInterface 607 Eclipse SWT 607 Form Layout 607 Kettle UI Elements 609 Hello World Example Dialog 609 StepInterface 614 Reading Rows from Specific Steps 616 Writing Rows to Specific Steps 616 Writing Rows to Error Handling 617 Identifying a Step Copy 617 Result Feedback 618 Variable Substitution 618 Apache VFS 619 Step Plugin Deployment 619 The User-Defined Java Class Step 620 Passing Metadata 620 Accessing Input and Fields 620 Snippets 620 Example 620 Job Entry Plugins 621 JobEntryInterface 622 JobEntryDialogInterface 624 Partitioning Method Plugins 624 Partitioner 625 Repository Type Plugins 626 Database Type Plugins 627 Summary 628 Appendix A The Kettle Ecosystem 629 Kettle Development and Versions 629 The Pentaho Community Wiki 631 Using the Forums 631 Jira 632 ##pentaho 633 Appendix B Kettle Enterprise Edition Features 635 Appendix C Built-in Variables and Properties Reference 637 Internal Variables 637 Kettle Variables 640 Variables for Configuring VFS 641 Noteworthy JRE Variables 642 Index 643

Read more less

Book SynopsisThis handbook focuses on biopolymers for both environmental and biomedical applications. It shows recent advances in technology in all areas from chemical synthesis or biosynthesis to end use applications. These areas have not been covered in a single book before and they include biopolymers for chemical and biotechnological modifications, material structures, characterization, processing, properties, and applications. After the introduction which summarizes the importance of biopolymer in the market, the book covers almost all the topics related to polysaccharides, biofibers, bioplastics, biocomposites, natural rubber, gums, bacterial and blood compatible polymers, and applications of biopolymers in various fields.Table of ContentsIntroductory Preface. About the Editors. Part I. Polysaccharides. 1. Hyaluronic Acid: A Natural Biopolymer (Juergen Schiller, Nicola Volpi, Eva Hrabárova, and Ladislav Soltes). 2. Polysaccharide Graft Copolymers Synthesis, Properties and Applications (B. S. Kaith, Hemant Mittal, Jaspreet Kaur Bhatia, and Susheel Kalia). 3. Natural Polysaccharides: From Membranes to Active Food Packaging (Keith J. Fahnestock, Marjorie S. Austero, and Caroline L. Schauer). 4. Starch as Source of Polymeric Materials (Antonio A. J. Carvalho). 5. Grafted Polysaccharides: Smart Materials of Future, Synthesis and Applications (Gautam Sen, Ashoke Sharon, and Sagar Pal). 6. Chitosan: The Marine based Biopolymer for Applications (Debasish Sahoo, and P. L. Nayak). Part II. Bioplastics and Biocomposites. 7. Biopolymers Based-on Carboxylic Acids Derived from Renewable Resources (Sushil Kumar, Nikhil Prakash, and Dipaloy Datta). 8. Characteristics and Applications of PLA (Sandra Domenek, Cecile Courgneau, and Violette Ducruet). 9. Biobased Composites & Applications (Smita Mohanty, and Sanjay K. Nayak). Part III. Miscellaneous Biopolymers. 10. Cassia Seed Gums: A Renewable Reservoir for Synthesizing High Performance Materials for Water Remediation (Vandana Singh, and Pramendra Kumar). 11. Bacterial Polymers: Resources, Synthesis and Applications (GVN Rathna, and Sutapa Gosh). 12. Gum Arabica: A Natural Biopolymer (A. Sarkar). 13. Gluten: A Natural Biopolymer (S. Georgiev, and Tereza Dekova). 14. Natural Rubber: Production, Properties, and Applications (Thomas Kurian, and N. M. Mathew). 15. Electronic Structures and Conduction Properties of Biopolymers (Mohsineen Wazir, Vinita Arora, and A. K. Bakhshi). Part IV. Biopolymers for Specific Applications. 16. Applications of Biopolymers in Agriculture with Special Reference to Role of Plant Derived Biopolymers in Crop Protection (S. Niranjan Raj, S. N. Lavanya, J, Sudisha, and H. Shekar Shetty). 17. Modified Cellulose Fibers as a Biosorbent for the Organic Pollutants (Sami Boufi, and Sabrine Alila). 18. Polymers and Biopolymers in Pharmaceutical Technology (István Erös). 19. Biopolymers Employed in Drug Delivery (Betina Giehl Zanetti Ramos). 20. Natural Polymeric Vectors in Gene Therapy (Patit P. Kundu, and Kishor Sarkar).

Read more less

Book SynopsisFocusing just on the essentials of command-line interface (CLI), this title shows how to quickly perform day-to-day tasks of Windows administration without ever touching the graphical user interface (GUI). It replaces many tedious GUI steps with just one command at the command-line, while easy to access answers provide solutions on the spot.Table of ContentsIntroduction xix Part I: Command Line Basics 1 Chapter 1: Configuring the Local Machine 3 Configure the Command Window 4 Set the Window Options 4 Change the Font 7 Choose a Window Layout 8 Define the Text Colors 9 Set the Environment 10 Manage Environment Variables with the Set Command 10 Manage Environment Variables with the SetX Utility 13 Perform Common Tasks 16 Clear the Display 16 Determine the Operating System Version 16 Start an Application 16 Work with Services 18 Shut Down the System 19 Obtain Command Line Help 20 Chapter 2: Making Remote Connections 23 Configure the Remote System 24 Change Security and Basic Setup 25 Setup Remote Administrator 28 Use the Remote Desktop Connection Application 30 Create a Connection 30 Use a Saved Connection 35 Set the Display 35 Access Local Resources 36 Run a Configuration Program 38 Optimize Performance 38 Terminate a Session 39 Use the Start Menu 40 Use the Logoff Utility 40 Chapter 3: Automating Tasks 41 View and Manage Tasks Using Scheduled Tasks 42 Configure the Task Scheduler 43 View Tasks 44 Create New Tasks 46 Delete Existing Tasks 50 Manage Tasks Using the SchTasks Command 51 Use the /Create Switch 51 Use the /Delete Switch 53 Use the /Query Switch 53 Use the /Change Switch 54 Use the /Run Switch 54 Use the /End Switch 54 Part II: Managing Data 55 Chapter 4: Working with File and Directory Objects 57 Manage Directory Objects 58 Find Directories 58 Find Directories Using Patterns 59 View the Current Directory 60 Change the Current Directory 60 Create Directories 61 Move Directories 61 Rename Directories 61 Remove a Directory 62 Display a Directory Structure 62 Manage File Objects 63 Find Files 63 Find Files in Sorted Order 64 Find Files by Attribute 65 Find Files Using Patterns 66 Copy Files 68 Perform Bulk File Transfers 69 Remove Files 70 Move Files 71 Rename a File 71 Set File Attributes 71 Work with File Associations and Types 72 Determine File Associations 72 Create File Associations 73 Determine File Types 73 Create File Types 73 Make Data Links 74 Create Simple Hard Links 75 View Simple Hard Links 75 Delete Simple Hard Links 75 Create Hard Links Using the New Technique 76 Create Symbolic Links 76 Create Junctions 77 Chapter 5: Administering File and Directory Content 79 Execute Applications Anywhere 80 View Application Paths 80 Set Application Paths 80 Locate Information in Files 81 Find Simple Strings 81 Find Complex Strings 82 Display Files Containing Strings 82 Perform Case Insensitive Searches 83 Monitor the File System with the FSUtil Command 83 Control File System Behavior 83 Manage the Volume Dirty Bit 86 Obtain the File System Information Using FSInfo 87 Manage Quotas 88 Repair File System Errors 90 Display Data Files 92 Display a Data File on Screen 92 Employ Data Redirection 92 Display Data One Page at a Time 95 Chapter 6: Managing the Hard Drive 99 Save Hard Drive Space 101 Compress Data 101 Uncompress Data 102 View Compression Status 102 Manage the Volume 102 Get Volume Information 103 Manage Volume Labels 103 Format a Disk 103 Mount a Volume 104 Maintain the Volume 106 Determine File and Directory Status 106 Locate Bad Sectors 107 Perform Boot-Time Disk Checks 108 Improve Disk Access Performance 109 Manage Partitions 110 Start DiskPart 110 List the Objects 111 See Object Details 112 Select an Object 113 Rescan a Computer for Objects 114 Create a Partition 114 Create a Volume 116 Clean a Drive 117 Mark a Partition as Active 117 Mark a Partition as Inactive 118 Assign a Drive Letter 118 Remove a Drive Letter 119 Extend a Volume 119 Delete an Object 120 Exit DiskPart 120 Chapter 7: Securing the Data 121 Protect Data 122 Encrypt a File or Directory 122 View Encrypted Files and Directories 123 Encrypt Hidden Files 124 Back Up Recovery Keys and Certificates 125 Add a User to a File or Directory 125 Remove a User from a File or Directory 126 Decrypt a File or Directory 127 Change File and Directory Access 127 Obtain the DACL 127 Find an SID 130 Grant Permission 130 Deny Permission 131 Remove Permission 131 Set the Owner 132 Verify Security 132 Detect Shared Open Files 132 Use the Query Option 132 Use the Disconnect Option 133 Use the Local Option 134 Take Ownership of Files 134 Set Administrator Ownership 134 Set Other User Ownership 135 Part III: Managing the Network 137 Chapter 8: Managing the Network 139 Get the Media Access Control Information 140 Interact with the Network Using the Net Utility 141 Manage Users 141 Manage Accounts 143 Manage Domains and Local Groups 146 Manage Computers 149 View and Close Sessions 149 Perform Server Configuration 151 View Workstation Configuration 153 Manage Services 153 Manage Files 155 Obtain Help for the Net Utility 156 Manage Print Jobs 157 Manage Resources 158 Obtain Statistics 161 Configure Time Synchronization 163 Chapter 9: Working with TCP/IP 165 Manage the Internet Protocol 166 Display the IP Information 166 Renew Addresses for an Adapter 168 Clear the DNS Resolver Cache 168 Renew DHCP Addresses and Register DNS Names 169 Release a Connection 169 Use Basic Diagnostics 170 Check Connections 170 Trace Transmission Paths 171 Track the Network Path 172 Perform Detailed Network Diagnostics 173 Obtain a Copy of NetDiag 174 Perform a Test 175 Understand Diagnostics 175 Locate and Fix Minor Problems 177 Get Network Statistics 177 Display All Connections and Ports 177 Display Application Statistics 178 Display Ethernet Statistics 179 Display Protocol Information 179 Set a Refresh Interval 180 Manipulate the Network Routing Tables 180 Print the Routing Tables 180 Add a New Route 181 Change a Route 182 Delete a Route 183 Chapter 10: Creating System Connections 185 Perform Remote System Management 186 Create Remote Connections 186 Set Up a Telephony Client 190 Perform Remote Windows Management 191 Execute Commands on a Remote System 206 Work with Terminal Server 206 Obtain Process Information 206 Get Session Information 207 Terminate a Session 208 Disconnect an Active Session 208 End Processes 208 Shut Down the Terminal Server 209 Part IV: Interacting with Active Directory 211 Chapter 11: Configuring Directory Services 213 Manage Directory Services Using the WMIC NTDomain Alias 214 List the Objects 215 List Object Properties 215 Get an Object Property 216 Set an Object Property 217 Query an Association 217 Manage Active Directory with the DSQuery Utility 218 Interact with Servers 218 Interact with Users 220 Interact with Computers 223 Interact with Contacts 223 Interact with Groups 223 Interact with Organizational Units 224 Manage the Active Directory Database 225 Issue a Command 225 Use a Stream 226 Chapter 12: Working with Directory Objects 229 Create New Objects 230 Add a Computer 230 Add a Contact 231 Add a Group 233 Add an Organizational Unit 234 Add a User 234 Get Objects 238 List Computers 238 List Contacts 239 List Groups 240 List Organizational Units 241 List Servers 241 List Users 242 Edit Existing Objects 243 Modify Computer Data 244 Modify Contact Data 245 Modify Group Data 246 Modify Organizational Unit Data 246 Modify User Data 246 Move Existing Objects 248 Delete Existing Objects 248 Part V: Performing Diagnostics 251 Chapter 13: Monitoring System Events 253 Create Simple System Events 254 Trigger System Events 257 Create an Event 258 Delete an Event 261 Query an Event 261 Manage Event Information 262 Display a List of Publishers 262 Get a Publisher 262 Enumerate the Logs 263 Query Log Events 264 Get a Log 267 Get Log Status Information 267 Set a Log 267 Export a Log 269 Archive a Log 270 Clear a Log 270 Chapter 14: Monitoring System Performance 271 Add Performance Counters 272 Load a Performance Counter 272 Save Performance Counter Settings 273 Restore Performance Counter Settings 273 Manage Performance Logs and Alerts 274 Create a Performance Log 274 Start Collecting Data 276 Stop Collecting Data 276 Query a Collection 277 Update a Collection 277 Delete a Collection 278 Create New Performance Logs from Existing Logs 278 Remove Performance Counters 281 Convert Event Trace Logs 281 Part VI: Performing Maintenance 283 Chapter 15: Performing Basic Maintenance 285 Configure the Server 286 Understand the SQL Syntax of WMIC 287 Use Aliases in WMIC 290 Get Help in WMIC 302 Format Data in WMIC 306 Translate Data in WMIC 310 Activate Windows 311 Perform an Activation 311 Display the Activation Information 312 Change the Product Key 312 Manage the System Time 312 Update the Time 313 Configure a Time Source 313 Obtain Time Settings Information 314 Manage the Boot Configuration 315 Enumerate the Configurations 315 Get BCDEdit Help 316 Edit an Existing Boot Setting 317 Change the Boot Sequence 318 Set the Default Boot Item 318 Chapter 16: Managing System Users 319 Audit User Access 320 List the Policies 321 Get a Policy 322 Set a Policy 326 Perform a Backup 327 Perform a Restore 327 Clear an Audit Policy 328 Remove an Audit Policy 328 Work with Group Policies 328 Obtain Group Policy Results 328 Manage Group Policies 330 Obtain Session Status Information 331 Get Process Information 331 Get Session Information 331 Get User Information 332 Get Terminal Server Information 332 Get the User’s Identity 332 Obtain User Logon Information 333 Discover User Identity 333 Chapter 17: Securing the System 335 Add Virus and External Intrusion Protection 337 Remove Viruses 337 Detect and Remove Malicious Software 338 Verify System Files 339 Verify Drivers 340 Change the Verifier Settings 342 Configure Local Security Policies 344 Perform an Analysis 344 Configure Security Policies 345 Export Policies 345 Import Policies 346 Validate a Policy File 346 Work with General Applications 347 Use TaskKill and TaskList Filters 347 Terminate Tasks 350 List Applications 350 List Services 351 Chapter 18: Interacting with the Registry 353 Perform Basic Registry Tasks 354 Export a Registry Key 356 Import a Registry Key 357 Delete a Registry Key 357 Save the Registry 358 Restore the Registry 358 Use the SCRegEdit Script 358 Set Automatic Updates 359 Enable Terminal Services 359 Configure the IP Security (IPSec) Monitor 360 Manage the DNS Service Priority and Weight 361 Use the Command Line Reference 361 Manage the Registry 362 Understand the Registry Settings 362 Query a Registry Entry 363 Add a Registry Entry 364 Delete a Registry Entry 365 Copy a Registry Entry 366 Compare Registry Entries 366 Export Registry Entries 367 Import Registry Entries 367 Restore Registry Entries 368 Part VII: Creating Batch Files 369 Chapter 19: Changing the Batch File Environment 371 Use the CMD Switches 372 Configure the Command Interpreter in the Registry 375 Use Command Extensions 377 Modify Config.NT 380 Use ANSI.SYS to Control the Environment 382 Set the Command Interpreter Location 382 Run Character Mode Applications Only 383 Display the Config.NT Commands 383 Control the Expanded Memory EMM Entry 383 Set the Number of Accessible Files 384 Control Extended Memory with HIMEM.SYS 385 Modify AutoExec.NT 387 Set the Code Page Number with the CHCP Utility 387 Add DPMI Support Using the DosX Utility 388 Enable Graphics Character Support with the GrafTabl Utility 389 Save Memory Using the LH Command 389 Install the Network Redirector Using the ReDir Utility 389 Chapter 20: Working at the Command Prompt 391 Redirect Command Line Output to the Clipboard 392 Manage Usernames and Passwords 393 Display Usernames 393 Create Users 394 Delete Users 394 Change Screen Colors 395 Configure the System Date 396 Configure the System Time 396 Change the Command Window Title 397 Chapter 21: Creating and Testing Batch Files 399 Use Batch File Commands 400 Employ the Call Command 401 Employ the Choice Command 403 Employ the Echo Command 406 Employ the Exit Command 406 Employ the ForFiles Utility 407 Employ the For Command 409 Employ the GoTo Command 414 Employ the If Command 414 Employ the Pause Command 418 Employ the Prompt Command 418 Employ the Rem Command 419 Employ the TimeOut Utility 420 Test Batch Files 420 Add Debug Information to Batch Files 421 Identify Batch Files and Their Actions 425 Use a Centralized Data Store 428 Store and Retrieve Directories with the PushD and PopD Commands 430 Part VIII: Creating Scripts 433 Chapter 22: Discovering Scripting Basics 435 Use Scripting Languages 436 Learn the Basics of JavaScript 436 Learn the Basics of VBScript 438 Use the Windows Scripting File 439 Execute Scripts 442 Run Scripts with the CScript and WScript Utilities 442 Configure the Host and Property Page Options 444 Chapter 23: Using the Scripting Objects 447 Use the WScript Object 449 Use the WScript Properties 449 Use the WScript Methods 451 Use the WScript.WshArguments Object 454 Use the WScript.WshShell Object 455 Use the WScript.WshNetwork Object 457 Use the WScript.WshNetwork Properties 457 Use the WScript.WshNetwork Methods 458 Create a Basic Script 462 Script the Command Line and System Environment 463 Script the Registry 466 Create .LNK Files 468 Chapter 24: Creating Advanced Scripting Examples 471 Script Registry Entries 472 Script Networking Solutions 473 Discover the NetSH Helper List 473 Get NetSH Help 474 Execute NetSH Commands 476 Understand the Basic NetSH Contexts 476 Use the Root Context Commands 478 Impersonate a User 480 Change the Environment 481 Change Logons, Ports, and Users 481 Enable or Disable Session Logons Directly 482 List COM Port Mappings 482 Modify the Install Mode 482 Map a Network Drive 483 Create a .CSV File 487 Appendix A: Alphabetical Command List 493 Appendix B: Topical Command List 505 Appendix C: Listing of Best Practices 521 Always Verify the Data 522 Real Administrators Use Help 523 Test Your Theories on a Test System 524 Use Batch Files, Scripts, and Written Procedures 525 Make Backups 526 Perform User-Specific Changes during Downtime 526 Index 529

Read more less

Book SynopsisThe leading introductory book on data mining, fully updated and revised! When Berry and Linoff wrote the first edition of Data Mining Techniques in the late 1990s, data mining was just starting to move out of the lab and into the office and has since grown to become an indispensable tool of modern business.Table of ContentsIntroduction xxxvii Chapter 1 What Is Data Mining and Why Do It? 1 What Is Data Mining? 2 Data Mining Is a Business Process 2 Large Amounts of Data 3 Meaningful Patterns and Rules 3 Data Mining and Customer Relationship Management 4 Why Now? 6 Data Is Being Produced 6 Data Is Being Warehoused 6 Computing Power Is Affordable 7 Interest in Customer Relationship Management Is Strong 7 Commercial Data Mining Software Products Have Become Available 8 Skills for the Data Miner 9 The Virtuous Cycle of Data Mining 9 A Case Study in Business Data Mining 11 Identifying BofA’s Business Challenge 12 Applying Data Mining 12 Acting on the Results 13 Measuring the Effects of Data Mining 14 Steps of the Virtuous Cycle 15 Identify Business Opportunities 16 Transform Data into Information 17 Act on the Information 19 Measure the Results 20 Data Mining in the Context of the Virtuous Cycle 23 Lessons Learned 26 Chapter 2 Data Mining Applications in Marketing and Customer Relationship Management 27 Two Customer Lifecycles 27 The Customer’s Lifecycle 28 The Customer Lifecycle 28 Subscription Relationships versus Event-Based Relationships 30 Organize Business Processes Around the Customer Lifecycle 32 Customer Acquisition 33 Customer Activation 36 Customer Relationship Management 37 Winback 38 Data Mining Applications for Customer Acquisition 38 Identifying Good Prospects 39 Choosing a Communication Channel 39 Picking Appropriate Messages 40 A Data Mining Example: Choosing the Right Place to Advertise 40 Who Fits the Profile? 41 Measuring Fitness for Groups of Readers 44 Data Mining to Improve Direct Marketing Campaigns 45 Response Modeling 46 Optimizing Response for a Fixed Budget 47 Optimizing Campaign Profitability 49 Reaching the People Most Influenced by the Message 53 Using Current Customers to Learn About Prospects 54 Start Tracking Customers Before They Become “Customers” 55 Gather Information from New Customers 55 Acquisition-Time Variables Can Predict Future Outcomes 56 Data Mining Applications for Customer Relationship Management 56 Matching Campaigns to Customers 56 Reducing Exposure to Credit Risk 58 Determining Customer Value 59 Cross-selling, Up-selling, and Making Recommendations 60 Retention 60 Recognizing Attrition 60 Why Attrition Matters 61 Different Kinds of Attrition 62 Different Kinds of Attrition Model 63 Beyond the Customer Lifecycle 64 Lessons Learned 65 Chapter 3 The Data Mining Process 67 What Can Go Wrong? 68 Learning Things That Aren’t True 68 Learning Things That Are True, but Not Useful 73 Data Mining Styles 74 Hypothesis Testing 75 Directed Data Mining 81 Undirected Data Mining 81 Goals, Tasks, and Techniques 82 Data Mining Business Goals 82 Data Mining Tasks 83 Data Mining Techniques 88 Formulating Data Mining Problems: From Goals to Tasks to Techniques 88 What Techniques for Which Tasks? 95 Is There a Target or Targets? 96 What Is the Target Data Like? 96 What Is the Input Data Like? 96 How Important Is Ease of Use? 97 How Important Is Model Explicability? 97 Lessons Learned 98 Chapter 4 Statistics 101: What You Should Know About Data 101 Occam’s Razor 103 Skepticism and Simpson’s Paradox 103 The Null Hypothesis 104 P-Values 105 Looking At and Measuring Data 106 Categorical Values 106 Numeric Variables 117 A Couple More Statistical Ideas 120 Measuring Response 120 Standard Error of a Proportion 121 Comparing Results Using Confidence Bounds 123 Comparing Results Using Difference of Proportions 124 Size of Sample 125 What the Confidence Interval Really Means 126 Size of Test and Control for an Experiment 127 Multiple Comparisons 129 The Confidence Level with Multiple Comparisons 129 Bonferroni’s Correction 129 Chi-Square Test 130 Expected Values 130 Chi-Square Value 132 Comparison of Chi-Square to Difference of Proportions 134 An Example: Chi-Square for Regions and Starts 134 Case Study: Comparing Two Recommendation Systems with an A/B Test 138 First Metric: Participating Sessions 140 Data Mining and Statistics 144 Lessons Learned 148 Chapter 5 Descriptions and Prediction: Profiling and Predictive Modeling 151 Directed Data Mining Models 152 Defining the Model Structure and Target 152 Incremental Response Modeling 154 Model Stability 156 Time-Frames in the Model Set 157 Directed Data Mining Methodology 159 Step 1: Translate the Business Problem into a Data Mining Problem 161 How Will Results Be Used? 163 How Will Results Be Delivered? 163 The Role of Domain Experts and Information Technology 164 Step 2: Select Appropriate Data 165 What Data Is Available? 166 How Much Data Is Enough? 167 How Much History Is Required? 167 How Many Variables? 168 What Must the Data Contain? 168 Step 3: Get to Know the Data 169 Examine Distributions 169 Compare Values with Descriptions 170 Validate Assumptions 170 Ask Lots of Questions 171 Step 4: Create a Model Set 172 Assembling Customer Signatures 172 Creating a Balanced Sample 172 Including Multiple Timeframes 174 Creating a Model Set for Prediction 174 Creating a Model Set for Profiling 176 Partitioning the Model Set 176 Step 5: Fix Problems with the Data 177 Categorical Variables with Too Many Values 177 Numeric Variables with Skewed Distributions and Outliers 178 Missing Values 178 Values with Meanings That Change over Time 179 Inconsistent Data Encoding 179 Step 6: Transform Data to Bring Information to the Surface 180 Step 7: Build Models 180 Step 8: Assess Models 180 Assessing Binary Response Models and Classifiers 181 Assessing Binary Response Models Using Lift 182 Assessing Binary Response Model Scores Using Lift Charts 184 Assessing Binary Response Model Scores Using Profitability Models 185 Assessing Binary Response Models Using ROC Charts 186 Assessing Estimators 188 Assessing Estimators Using Score Rankings 189 Step 9: Deploy Models 190 Practical Issues in Deploying Models 190 Optimizing Models for Deployment 191 Step 10: Assess Results 191 Step 11: Begin Again 193 Lessons Learned 193 Chapter 6 Data Mining Using Classic Statistical Techniques 195 Similarity Models 196 Similarity and Distance 196 Example: A Similarity Model for Product Penetration 197 Table Lookup Models 203 Choosing Dimensions 204 Partitioning the Dimensions 205 From Training Data to Scores 205 Handling Sparse and Missing Data by Removing Dimensions 205 RFM: A Widely Used Lookup Model 206 RFM Cell Migration 207 RFM and the Test-and-Measure Methodology 208 RFM and Incremental Response Modeling 209 Naïve Bayesian Models 210 Some Ideas from Probability 210 The Naïve Bayesian Calculation 212 Comparison with Table Lookup Models 213 Linear Regression 213 The Best-fit Line 215 Goodness of Fit 217 Multiple Regression 220 The Equation 220 The Range of the Target Variable 221 Interpreting Coefficients of Linear Regression Equations 221 Capturing Local Effects with Linear Regression 223 Additional Considerations with Multiple Regression 224 Variable Selection for Multiple Regression 225 Logistic Regression 227 Modeling Binary Outcomes 227 The Logistic Function 229 Fixed Effects and Hierarchical Effects 231 Hierarchical Effects 232 Within and Between Effects 232 Fixed Effects 233 Lessons Learned 234 Chapter 7 Decision Trees 237 What Is a Decision Tree and How Is It Used? 238 A Typical Decision Tree 238 Using the Tree to Learn About Churn 240 Using the Tree to Learn About Data and Select Variables 241 Using the Tree to Produce Rankings 243 Using the Tree to Estimate Class Probabilities 243 Using the Tree to Classify Records 244 Using the Tree to Estimate Numeric Values 244 Decision Trees Are Local Models 245 Growing Decision Trees 247 Finding the Initial Split 248 Growing the Full Tree 251 Finding the Best Split 252 Gini (Population Diversity) as a Splitting Criterion 253 Entropy Reduction or Information Gain as a Splitting Criterion 254 Information Gain Ratio 256 Chi-Square Test as a Splitting Criterion 256 Incremental Response as a Splitting Criterion 258 Reduction in Variance as a Splitting Criterion for Numeric Targets 259 F Test 262 Pruning 262 The CART Pruning Algorithm 263 Pessimistic Pruning: The C5.0 Pruning Algorithm 267 Stability-Based Pruning 268 Extracting Rules from Trees 269 Decision Tree Variations 270 Multiway Splits 270 Splitting on More Than One Field at a Time 271 Creating Nonrectangular Boxes 271 Assessing the Quality of a Decision Tree 275 When Are Decision Trees Appropriate? 276 Case Study: Process Control in a Coffee Roasting Plant 277 Goals for the Simulator 277 Building a Roaster Simulation 278 Evaluation of the Roaster Simulation 278 Lessons Learned 279 Chapter 8 Artificial Neural Networks 281 A Bit of History 282 The Biological Model 283 The Biological Neuron 285 The Biological Input Layer 286 The Biological Output Layer 287 Neural Networks and Artificial Intelligence 287 Artificial Neural Networks 288 The Artificial Neuron 288 The Multi-Layer Perceptron 291 A Network Example 292 Network Topologies 293 A Sample Application: Real Estate Appraisal 295 Training Neural Networks 299 How Does a Neural Network Learn Using Back Propagation? 299 Pruning a Neural Network 300 Radial Basis Function Networks 303 Overview of RBF Networks 303 Choosing the Locations of the Radial Basis Functions 305 Universal Approximators 305 Neural Networks in Practice 308 Choosing the Training Set 309 Coverage of Values for All Features 309 Number of Features 310 Size of Training Set 310 Number and Range of Outputs 310 Rules of Thumb for Using MLPs 310 Preparing the Data 311 Interpreting the Output from a Neural Network 313 Neural Networks for Time Series 315 Time Series Modeling 315 A Neural Network Time Series Example 316 Can Neural Network Models Be Explained? 317 Sensitivity Analysis 318 Using Rules to Describe the Scores 318 Lessons Learned 319 Chapter 9 Nearest Neighbor Approaches: Memory-Based Reasoning and Collaborative Filtering 321 Memory-Based Reasoning 322 Look-Alike Models 323 Example: Using MBR to Estimate Rents in Tuxedo, New York 324 Challenges of MBR 327 Choosing a Balanced Set of Historical Records 328 Representing the Training Data 328 Determining the Distance Function, Combination Function, and Number of Neighbors 331 Case Study: Using MBR for Classifying Anomalies in Mammograms 331 The Business Problem: Identifying Abnormal Mammograms 332 Applying MBR to the Problem 332 The Total Solution 334 Measuring Distance and Similarity 335 What Is a Distance Function? 335 Building a Distance Function One Field at a Time 337 Distance Functions for Other Data Types 340 When a Distance Metric Already Exists 341 The Combination Function: Asking the Neighbors for Advice 342 The Simplest Approach: One Neighbor 342 The Basic Approach for Categorical Targets: Democracy 342 Weighted Voting for Categorical Targets 344 Numeric Targets 344 Case Study: Shazam — Finding Nearest Neighbors for Audio Files 345 Why This Feat Is Challenging 346 The Audio Signature 347 Measuring Similarity 348 Collaborative Filtering: A Nearest-Neighbor Approach to Making Recommendations 351 Building Profiles 352 Comparing Profiles 352 Making Predictions 353 Lessons Learned 354 Chapter 10 Knowing When to Worry: Using Survival Analysis to Understand Customers 357 Customer Survival 360 What Survival Curves Reveal 360 Finding the Average Tenure from a Survival Curve 362 Customer Retention Using Survival 364 Looking at Survival as Decay 365 Hazard Probabilities 367 The Basic Idea 368 Examples of Hazard Functions 369 Censoring 371 The Hazard Calculation 372 Other Types of Censoring 375 From Hazards to Survival 376 Retention 376 Survival 378 Comparison of Retention and Survival 378 Proportional Hazards 380 Examples of Proportional Hazards 381 Stratification: Measuring Initial Effects on Survival 382 Cox Proportional Hazards 382 Survival Analysis in Practice 385 Handling Different Types of Attrition 385 When Will a Customer Come Back? 387 Understanding Customer Value 389 Forecasting 392 Hazards Changing over Time 393 Lessons Learned 394 Chapter 11 Genetic Algorithms and Swarm Intelligence 397 Optimization 398 What Is an Optimization Problem? 398 An Optimization Problem in Ant World 399 E Pluribus Unum 400 A Smarter Ant 401 Genetic Algorithms 403 A Bit of History 404 Genetics on Computers 404 Representing the Genome 413 Schemata: The Building Blocks of Genetic Algorithms 414 Beyond the Simple Algorithm 417 The Traveling Salesman Problem 418 Exhaustive Search 419 A Simple Greedy Algorithm 419 The Genetic Algorithms Approach 419 The Swarm Intelligence Approach 420 Case Study: Using Genetic Algorithms for Resource Optimization 421 Case Study: Evolving a Solution for Classifying Complaints 423 Business Context 424 Data 425 The Comment Signature 425 The Genomes 426 The Fitness Function 427 The Results 427 Lessons Learned 427 Chapter 12 Tell Me Something New: Pattern Discovery and Data Mining 429 Undirected Techniques, Undirected Data Mining 431 Undirected versus Directed Techniques 431 Undirected versus Directed Data Mining 431 Case Study: Undirected Data Mining Using Directed Techniques 432 What is Undirected Data Mining? 435 Data Exploration 435 Segmentation and Clustering 436 Target Variable Definition, When the Target Is Not Explicit 438 Simulation, Forecasting, and Agent-Based Modeling 443 Methodology for Undirected Data Mining 455 There Is No Methodology 456 Things to Keep in Mind 456 Lessons Learned 457 Chapter 13 Finding Islands of Similarity: Automatic Cluster Detection 459 Searching for Islands of Simplicity 461 Customer Segmentation and Clustering 461 Similarity Clusters 463 Tracking Campaigns by Cluster-Based Segments 464 Clustering Reveals an Overlooked Market Segment 466 Fitting the Troops 467 The K-Means Clustering Algorithm 468 Two Steps of the K-Means Algorithm 468 Voronoi Diagrams and K-Means Clusters 471 Choosing the Cluster Seeds 473Choosing K 473 Using K-Means to Detect Outliers 474 Semi-Directed Clustering 475 Interpreting Clusters 475 Characterizing Clusters by Their Centroids 476 Characterizing Clusters by What Differentiates Them 477 Using Decision Trees to Describe Clusters 478 Evaluating Clusters 479 Cluster Measurements and Terminology 480 Cluster Silhouettes 480 Limiting Cluster Diameter for Scoring 483 Case Study: Clustering Towns 484 Creating Town Signatures 484 Creating Clusters 486 Determining the Right Number of Clusters 486 Evaluating the Clusters 487 Using Demographic Clusters to Adjust Zone Boundaries 488 Business Success 490 Variations on K-Means 490 K-Medians, K-Medoids, and K-Modes 490 The Soft Side of K-Means 494 Data Preparation for Clustering 495 Scaling for Consistency 496 Use Weights to Encode Outside Information 496 Selecting Variables for Clustering 497 Lessons Learned 497 Chapter 14 Alternative Approaches to Cluster Detection 499 Shortcomings of K-Means 500 Reasonableness 500 An Intuitive Example 501 Fixing the Problem by Changing the Scales 503 What This Means in Practice 504 Gaussian Mixture Models 505 Adding “Gaussians” to K-Means 505 Back to Gaussian Mixture Models 508 Scoring GMMs 510 Applying GMMs 511 Divisive Clustering 513 A Decision Tree–Like Method for Clustering 513 Scoring Divisive Clusters 515 Clusters and Trees 515 Agglomerative (Hierarchical) Clustering 516 Overview of Agglomerative Clustering Methods 516 Clustering People by Age: An Example of An Agglomerative Clustering Algorithm 520 Scoring Agglomerative Clusters 522 Limitations of Agglomerative Clustering 523 Agglomerative Clustering in Practice 525 Combining Agglomerative Clustering and K-Means 526 Self-Organizing Maps 527 What Is a Self-Organizing Map? 527 Training an SOM 530 Scoring an SOM 531 The Search Continues for Islands of Simplicity 532 Lessons Learned 533 Chapter 15 Market Basket Analysis and Association Rules 535 Defining Market Basket Analysis 536 Four Levels of Market Basket Data 537 The Foundation of Market Basket Analysis: Basic Measures 539 Order Characteristics 540 Item (Product) Popularity 541 Tracking Marketing Interventions 542 Case Study: Spanish or English 543 The Business Problem 543 The Data 544 Defining “Hispanicity” Preference 545 The Solution 546 Association Analysis 547 Rules Are Not Always Useful 548 Item Sets to Association Rules 551 How Good Is an Association Rule? 553 Building Association Rules 555 Choosing the Right Set of Items 556 Anonymous Versus Identified 561 Generating Rules from All This Data 561 Overcoming Practical Limits 565 The Problem of Big Data 567 Extending the Ideas 569 Different Items on the Right- and Left-Hand Sides 569 Using Association Rules to Compare Stores 570 Association Rules and Cross-Selling 572 A Typical Cross-Sell Model 572 A More Confident Approach to Product Propensities 573 Results from Using Confidence 574 Sequential Pattern Analysis 574 Finding the Sequences 575 Sequential Association Rules 578 Sequential Analysis Using Other Data Mining Techniques 579 Lessons Learned 579 Chapter 16 Link Analysis 581 Basic Graph Theory 582 What Is a Graph? 582 Directed Graphs 584 Weighted Graphs 585 Seven Bridges of Königsberg 585 Detecting Cycles in a Graph 588 The Traveling Salesman Problem Revisited 589 Social Network Analysis 593 Six Degrees of Separation 593 What Your Friends Say About You 595 Finding Childcare Benefits Fraud 596 Who Responds to Whom on Dating Sites 597 Social Marketing 598 Mining Call Graphs 598 Case Study: Tracking Down the Leader of the Pack 601 The Business Goal 601 The Data Processing Challenge 601 Finding Social Networks in Call Data 602 How the Results Are Used for Marketing 602 Estimating Customer Age 603 Case Study: Who Is Using Fax Machines from Home? 604 Why Finding Fax Machines Is Useful 604 How Do Fax Machines Behave? 604 A Graph Coloring Algorithm 605 “Coloring” the Graph to Identify Fax Machines 606 How Google Came to Rule the World 607 Hubs and Authorities 608 The Details 609 Hubs and Authorities in Practice 611 Lessons Learned 612 Chapter 17 Data Warehousing, OLAP, Analytic Sandboxes, and Data Mining 613 The Architecture of Data 615 Transaction Data, the Base Level 616 Operational Summary Data 617 Decision-Support Summary Data 617 Database Schema/Data Models 618 Metadata 623 Business Rules 623 A General Architecture for Data Warehousing 624 Source Systems 624 Extraction, Transformation, and Load 626 Central Repository 627 Metadata Repository 630 Data Marts 630 Operational Feedback 631 Users and Desktop Tools 631 Analytic Sandboxes 633 Why Are Analytic Sandboxes Needed? 634 Technology to Support Analytic Sandboxes 636 Where Does OLAP Fit In? 639 What’s in a Cube? 641 Star Schema 646 OLAP and Data Mining 648 Where Data Mining Fits in with Data Warehousing 650 Lots of Data 651 Consistent, Clean Data 651 Hypothesis Testing and Measurement 652 Scalable Hardware and RDBMS Support 653 Lessons Learned 653 Chapter 18 Building Customer Signatures 655 Finding Customers in Data 656 What Is a Customer? 657 Accounts? Customers? Households? 658 Anonymous Transactions 658 Transactions Linked to a Card 659 Transactions Linked to a Cookie 659 Transactions Linked to an Account 660 Transactions Linked to a Customer 661 Designing Signatures 661 Is a Customer Signature Necessary? 666 What Does a Row Represent? 666 Will the Signature Be Used for Predictive Modeling? 671 Has a Target Been Defined? 672 Are There Constraints Imposed by the Particular Data Mining Techniques to be Employed? 672 Which Customers Will Be Included? 673 What Might Be Interesting to Know About Customers? 673 What a Signature Looks Like 674 Process for Creating Signatures 677 Some Data Is Already at the Right Level of Granularity 678 Pivoting a Regular Time Series 679 Aggregating Time-Stamped Transactions 680 Dealing with Missing Values 685 Missing Values in Source Data 685 Unknown or Non-Existent? 687 What Not to Do 687 Things to Consider 689 Lessons Learned 691 Chapter 19 Derived Variables: Making the Data Mean More 693 Handset Churn Rate as a Predictor of Churn 694 Single-Variable Transformations 696 Standardizing Numeric Variables 696 Turning Numeric Values into Percentiles 697 Turning Counts into Rates 698 Relative Measures 699 Replacing Categorical Variables with Numeric Ones 700 Combining Variables 707 Classic Combinations 707 Combining Highly Correlated Variables 710 Rent to Home Value 712 Extracting Features from Time Series 718 Trend 719 Seasonality 721 Extracting Features from Geography 722 Geocoding 722 Mapping 723 Using Geography to Create Relative Measures 724 Using Past Values of the Target Variable 725 Using Model Scores as Inputs 725 Handling Sparse Data 726 Account Set Patterns 726 Binning Sparse Values 727 Capturing Customer Behavior from Transactions 727 Widening Narrow Data 728 Sphere of Influence as a Predictor of Good Customers 728 An Example: Ratings to Rater Profile 730 Sample Fields from the Rater Signature 730 The Rating Signature and Derived Variables 732 Lessons Learned 733 Chapter 20 Too Much of a Good Thing? Techniques for Reducing the Number of Variables 735 Problems with Too Many Variables 736 Risk of Correlation Among Input Variables 736 Risk of Overfitting 738 The Sparse Data Problem 738 Visualizing Sparseness 739 Independence 740 Exhaustive Feature Selection 743 Flavors of Variable Reduction Techniques 744 Using the Target 744 Original versus New Variables 744 Sequential Selection of Features 745 The Traditional Forward Selection Methodology 745 Forward Selection Using a Validation Set 747 Stepwise Selection 748 Forward Selection Using Non-Regression Techniques 748 Backward Selection 748 Undirected Forward Selection 749 Other Directed Variable Selection Methods 749 Using Decision Trees to Select Variables 750 Variable Reduction Using Neural Networks 752 Principal Components 753 What Are Principal Components? 753 Principal Components Example 758 Principal Component Analysis 763 Factor Analysis 767 Variable Clustering 768 Example of Variable Clusters 768 Using Variable Clusters 770 Hierarchical Variable Clustering 770 Divisive Variable Clustering 773 Lessons Learned 774 Chapter 21 Listen Carefully to What Your Customers Say: Text Mining 775 What Is Text Mining? 776 Text Mining for Derived Columns 776 Beyond Derived Features 777 Text Analysis Applications 778 Working with Text Data 781 Sources of Text 781 Language Effects 782 Basic Approaches to Representing Documents 783 Representing Documents in Practice 784 Documents and the Corpus 786 Case Study: Ad Hoc Text Mining 786 The Boycott 787 Business as Usual 787 Combining Text Mining and Hypothesis Testing 787 The Results 788 Classifying News Stories Using MBR 789 What Are the Codes? 789 Applying MBR 790 The Results 793 From Text to Numbers 794 Starting with a “Bag of Words” 794 Term-Document Matrix 796 Corpus Effects 797 Singular Value Decomposition (SVD) 798 Text Mining and Naïve Bayesian Models 800 Naïve Bayesian in the Text World 801 Identifying Spam Using Naïve Bayesian 801 Sentiment Analysis 806 DIRECTV: A Case Study in Customer Service 809 Background 809 Applying Text Mining 811 Taking the Technical Approach 814 Not an Iterative Process 818 Continuing to Benefit 818 Lessons Learned 819 Index 821

Read more less

Book SynopsisThis book focuses heavily on the principles, analysis and applications of code-division multiple-access (CDMA) techniques in optical communication systems and networks. In this book, the authors intimately discuss modern optical networks and their applications in current and emerging communication technologies, evaluating the quality, speed and number of supported services. In particular, principles and fundamentals of optical CDMA techniques from beginner to advanced levels are heavily covered. Furthermore, the authors concentrate on methods and techniques of various encoding and decoding schemes and their structures, as well as analysis of optical CDMA systems with various transceiver models including advanced multi-level incoherent and coherent modulations with the architecture of access/aggregation networks in mind. Moreover, authors examine intriguing topics of optical CDMA networking, compatibility with IP networks, and implementation of optical multi-rate multiTable of ContentsList of Figures xiii List of Tables xxv Preface xxvii Acknowledgements xxxiii 1 Introduction to Optical Communications 1 1.1 Evolution of Lightwave Technology 1 1.2 Laser Technologies 3 1.3 Optical Fibre Communication Systems 4 1.4 Lightwave Technology in Future 7 1.5 Optical Lightwave Spectrum 7 1.6 Optical Fibre Transmission 9 1.7 Multiple Access Techniques 10 1.8 Spread Spectrum Communications Techniques 14 1.9 Motivations for Optical CDMA Communications 21 1.10 Access Networks Challenges 22 1.11 Summary 23 References 24 2 Optical Spreading Codes 29 2.1 Introduction 29 2.2 Bipolar Codes 30 2.3 Unipolar Codes: Optical Orthogonal Codes 37 2.4 Unipolar Codes: Prime Code Families 41 2.5 Codes with Ideal In-Phase Cross-Correlation 62 2.6 Multidimensional Optical Codes 76 2.7 Channel Encoding in OCDMA Systems 84 2.8 Turbo-Coded Optical CDMA 100 2.9 Summary 110 References 111 3 Optical CDMA Review 115 3.1 Introduction 115 3.2 Optical Coding Principles 115 3.3 OCDMA Networking: Users Are Codes 117 3.4 Optical CDMA Techniques 119 3.5 Free-Space and Atmospheric Optical CDMA 126 3.6 Summary 128 References 128 4 Spectrally Encoded OCDMA Networks 133 4.1 Introduction 133 4.2 Spectral-Amplitude-Coding Schemes 134 4.3 System Considerations 141 4.4 Gaussian Approach Analysis 144 4.5 Negative Binomial Approach Analysis 153 4.6 Spectral-Phase-Coding Schemes 164 4.7 Summary 167 References 167 5 Incoherent Temporal OCDMA Networks 171 5.1 Introduction 171 5.2 PPM-OCDMA Signalling 172 5.3 PPM-OCDMA Transceiver Architecture 173 5.4 PPM-OCDMA Performance Analysis 180 5.5 Discussion of Results 183 5.6 Overlapping PPM-OCDMA Signalling 187 5.7 OPPM-OCDMA Transceiver Architecture 188 5.8 OPPM-OCDMA Performance Analysis 196 .9 Discussion of Results 203 5.10 Analysis of Throughput 209 5.11 Summary 211 References 211 6 Coherent Temporal OCDMA Networks 213 6.1 Introduction 213 6.2 Coherent Homodyne BPSK-OCDMA Architecture 214 6.3 Coherent Heterodyne BPSK-OCDMA Architecture 222 6.4 Summary 229 References 230 7 Hybrid Temporal Coherent and Incoherent OCDMA Networks 231 7.1 Introduction 231 7.2 Coherent Transmitter with Incoherent Receiver 232 7.3 Analysis of Transceivers with MAI Cancellation 235 7.4 Results and Throughput Analysis 239 7.5 Summary 244 References 244 8 Optical CDMA with Polarization Modulations 245 8.1 Introduction 245 8.2 Optical Polarization Shift Keying (PolSK) 247 8.3 PolSK-OCDMA Transceiver Architecture 254 8.4 Evaluation of PolSK-OCDMA Transceiver Performance 263 8.5 Transceiver Architecture for Hybrid F-PolSK-OCDMA 265 8.6 Performance of F-PolSK-OCDMA Transceiver 273 8.7 Long-Haul PolSK Transmission 273 8.8 Summary 278 References 278 9 Optical CDMA Networking 281 9.1 Introduction 281 9.2 OCDMA-PON 289 9.3 OCDMA-PON Architecture 290 9.4 IP Traffic over OCDMA Networks 299 9.5 Random Access Protocols 308 9.6 Multi-Protocol Label Switching 330 9.7 Summary 342 References 344 10 Services Differentiation and Quality of Services in Optical CDMA Networks 347 10.1 Introduction 347 10.2 Differentiated Services in Optical CDMA 351 10.3 Variable-Weight Optical Spreading Codes 354 10.4 Variable-Length Optical Spreading Codes 364 10.5 Multirate Differentiated Services in OCDMA Networks 376 10.6 Summary 383 References 384 Index 387

Read more less

Book SynopsisWritten by experts in the field, this book describes the Personal Network architecture and its various components This book focuses on networking and security aspects of Personal Networks (PNs). Given a single user, the authors propose an architecture for PNs in which devices are divided into one of two types of nodes: personal nodes and foreign nodes. Furthermore, the authors demonstrate the ways in which PNs can be formed in a self-organized and secure way, how they can be interconnected using infrastructure networks, how multiple PNs can be connected, and how their services and resources can be shared. In addition, the book shows how security and ease-of-use can be achieved through automatic configuration and how mobility can be supported through adaptability and self-organization. The motivations for the PN concept, the PN architecture, its functionalities and features, as well as future challenges are covered in depth. Finally, the authors consider the potential applicaTable of ContentsForeword. Preface. List of Abbreviations. 1 The Vision of Personal Networks. 1.1 Past, Present, and Future Telecommunication. 1.2 Personal Networks. 1.3 Some Typical PN Use-Case Scenarios. 1.4 Federations of Personal Networks. 1.5 Early Personal Network Implementations. 1.6 Expected Impact. 1.7 Summary. 2 Personal Networks User Requirements. 2.1 Ubiquitous Networking. 2.2 Heterogeneous Hardware Constraints. 2.3 Quality of Service and Reliability. 2.4 Name, Service, and Content Management. 2.5 Context Awareness. 2.6 Being Cognitive. 2.7 Security and Trust. 2.8 Privacy. 2.9 Usability. 2.10 Other Requirements. 2.11 Jane Revisited. 2.12 Summary. 3 Trends in Personal Networks. 3.1 Wireless Communications. 3.2 Ad Hoc Networking. 3.3 WWRF Book of Visions. 3.4 Ubiquitous and Pervasive Computing and Communication. 3.5 Ambient Networks. 3.6 IST PACWOMAN and SHAMAN. 3.7 Personal Distributed Environment. 3.8 MyNet. 3.9 P2P Universal Computing Consortium. 3.10 More Trends. 3.11 Personal Networks and Current Trends. 3.12 Summary. 4 The Personal Network Architecture. 4.1 Terminology. 4.2 Personal and Foreign Nodes. 4.3 The Three Level Architecture View. 4.4 Personalization of Nodes. 4.5 Cluster Organization. 4.6 Personal Network Organization. 4.7 Foreign Communication. 4.8 Higher Layer Support Systems. 4.9 Federations of Personal Networks. 4.10 Discussion. 4.11 Summary. 5 Cluster Formation and Routing. 5.1 What is a Cluster? 5.2 Mobile Ad Hoc Network Technologies. 5.3 Cluster Formation and Maintenance. 5.4 Intra-Cluster Routing. 5.5 Summary. 6 Inter-Cluster Tunneling and Routing. 6.1 Inter-Cluster Tunneling Requirements. 6.2 IP Mobility. 6.3 PN Addressing. 6.4 Infrastructure Support. 6.5 Inter-Cluster Tunneling. 6.6 Inter-Cluster Routing. 6.7 Summary. 7 Foreign Communication. 7.1 Requirements for Foreign Communication. 7.2 Setting up Communication with Foreign Nodes. 7.3 Bridging Inside and Outside Protocols. 7.4 Mobility and Gateway Node Handover. 7.5 Summary. 8 Personal Network Application Support Systems. 8.1 Required PN Application Support. 8.2 Design of a PN Application Support System. 8.3 Service Discovery and Management Implementation. 8.4 An Implementation of Context Management. 8.5 Summary. 9 Personal Network Security. 9.1 Device Personalization. 9.2 Establishment of Secure Communication. 9.3 Secure Foreign Communication. 9.4 Anonymity. 9.5 Summary. 10 Personal Network Federations. 10.1 Examples. 10.2 Types of Federations. 10.3 Requirements. 10.4 Architecture of a Federation. 10.5 Life Cycle of a Federation. 10.6 Federation Access Control. 10.7 Federation Implementation Approaches. 10.8 Security. 10.9 Summary. 11 Personal Network Prototypes. 11.1 The TU Delft Prototype. 11.2 The PNP2008 Prototypes. 11.3 The MAGNET Prototype. 11.4 Summary. 12 The Future of Personal Networks. 12.1 Are We There Yet? 12.2 Future Directions. Appendix A Terminology. A.1 Connectivity Abstraction Level. A.2 Network Abstraction Level. A.3 Application and Service Abstraction Level. A.4 Personal Network Federations. References. Related Websites. Index.

Read more less

Book SynopsisA comprehensive, encompassing and accessible text examining a wide range of key Wireless Networking and Localization technologies This book provides a unified treatment of issues related to all wireless access and wireless localization techniques. The book reflects principles of design and deployment of infrastructure for wireless access and localization for wide, local, and personal networking. Description of wireless access methods includes design and deployment of traditional TDMA and CDMA technologies and emerging Long Term Evolution (LTE) techniques for wide area cellular networks, the IEEE 802.11/WiFi wireless local area networks as well as IEEE 802.15 Bluetooth, ZigBee, Ultra Wideband (UWB), RF Microwave and body area networks used for sensor and ad hoc networks. The principles of wireless localization techniques using time-of-arrival and received-signal-strength of the wireless signal used in military and commercial applications in smart devices operating in urTable of ContentsPreface xv 1 Introduction 1 1.1 Introduction 1 1.2 Elements of Information Networks 3 1.3 Evolution of Wireless Access to the PSTN 17 1.4 Evolution of Wireless Access to the Internet 21 1.5 Evolution of Wireless Localization Technologies 27 1.6 Structure of this Book 29 Part I PRINCIPLES OF AIR–INTERFERENCE DESIGN 2 Characteristics of the Wireless Medium 39 2.1 Introduction 39 2.2 Modeling of Large-scale RSS, Path Loss, and Shadow Fading 45 2.3 Modeling of RSS Fluctuations and Doppler Spectrum 60 2.4 Wideband Modeling of Multipath Characteristics 72 2.5 Emerging Channel Models 79 Appendix A2: What Is the Decibel? 84 3 Physical Layer Alternatives forWireless Networks 99 3.1 Introduction 99 3.2 Physical Layer Basics: Data rate, Bandwidth, and Power 100 3.3 Performance in Multipath Wireless Channels 107 3.4 Wireless Transmission Techniques 112 3.5 Multipath Resistant Techniques 120 3.6 Coding Techniques for Wireless Communications 136 3.7 Cognitive Radio and Dynamic Spectrum Access 145 Appendix A3 145 4 Medium Access Methods 153 4.1 Introduction 153 4.2 Centralized Assigned-Access Schemes 155 4.3 Distributed Random Access for Data Oriented Networks 173 4.4 Integration of Voice and Data Traffic 195 Part II PRINCIPLES OF NETWORK INFRASTRUCTURE DESIGN 5 Deployment ofWireless Networks 217 5.1 Introduction 217 5.2 Wireless Network Architectures 218 5.3 Interference in Wireless Networks 224 5.4 Deployment of Wireless LANs 233 5.5 Cellular Topology, Cell Fundamentals, and Frequency Reuse 238 5.6 Capacity Expansion Techniques 248 5.7 Network Planning for CDMA Systems 268 5.8 Femtocells 270 6 Wireless Network Operations 275 6.1 Introduction 275 6.2 Cell Search and Registration 281 6.3 Mobility Management 283 6.4 Radio Resources and Power Management 301 7 Wireless Network Security 321 7.1 Introduction 321 7.2 Security in Wireless Local Networks 324 7.3 Security in Wireless Personal Networks 330 7.4 Security in Wide Area Wireless Networks 334 7.5 Miscellaneous Issues 340 Appendix A7: An Overview of Cryptography and Cryptographic Protocols 341 Part III WIRELESS LOCAL ACCESS 8 Wireless LANs 357 8.1 Introduction 357 8.2 Wireless Local Area Networks and Standards 363 8.3 IEEE 802.11 WLAN Operations 369 9 Low Power Sensor Networks 405 9.1 Introduction 405 9.2 Bluetooth 406 9.3 IEEE 802.15.4 and ZigBee 424 9.4 IEEE 802.15.6 Body Area Networks 434 10 GigabitWireless 447 10.1 Introduction 447 10.2 UWB Communications at 3.1–10.6 GHz 451 10.3 Gigabit Wireless at 60 GHz 467 Part IV WIDE AREA WIRELESS ACCESS 11 TDMA Cellular Systems 479 11.1 Introduction 479 11.2 What is TDMA Cellular? 480 11.3 Mechanisms to Support a Mobile Environment 486 11.4 Communication Protocols 491 11.5 Channel Models for Cellular Networks 501 11.6 Transmission Techniques in TDMA Cellular 508 11.7 Evolution of TDMA for Internet Access 512 12 CDMA Cellular Systems 519 12.1 Introduction 519 12.2 Why CDMA? 520 12.3 CDMA Based Cellular Systems 521 12.4 Direct Sequence Spread Spectrum 522 12.5 Communication Channels and Protocols in Example CDMA Systems 534 12.6 Cell Search, Mobility, and Radio Resource Management in CDMA 546 12.7 High Speed Packet Access 554 13 OFDM and MIMO Cellular Systems 561 13.1 Introduction 561 13.2 Why OFDM? 562 13.3 Multiple Input Multiple Output 572 13.4 WiMax 576 13.5 Long Term Evolution 582 13.6 LTE Advanced 591 Part V WIRELESS LOCALIZATION 14 Geolocation Systems 597 14.1 Introduction 597 14.2 What is Wireless Geolocation? 598 14.3 RF Location Sensing and Positioning Methodologies 602 14.4 Location Services Architecture for Cellular Systems 613 14.5 Positioning in Ad Hoc and Sensor Networks 620 15 Fundamentals of RF Localization 625 15.1 Introduction 625 15.2 Modeling of the Behavior of RF Sensors 626 15.3 Performance Bounds for Ranging 631 15.4 Wireless Positioning Algorithms 639 16 Wireless Localization in Practice 653 16.1 Introduction 653 16.2 Emergence of Wi-Fi Localization 653 16.3 Comparison of Wi-Fi Localization Systems 657 16.4 Practical TOA Measurement 665 16.5 Localization in the Absence of DP 669 16.6 Challenges in Localization inside the Human Body 675 References 687 Index 701

Read more less

Book SynopsisProvides an introduction to the Lightweight Directory Access Protocol (LDAP) technology. This book offers a detailed overview of the real world applications of the technology. It offers an explanation of the technical details of LDAP and a step-by-step demonstration of how to implement an LDAP directory.Table of ContentsIntroduction. What is the Aim of this Book? Structure of the Book. For Whom is this Book Intended? FAQs. Acknowledgements. PART 1: DIRECTORIES AND THEIR APPLICATIONS. 1. Directories Overview. 2. The History of Directories and an Introduction to LDAP. 3. LDAP Directories and Their Applications. PART 2: THE LDAP STANDARD. 4. LDAP Standard and its Client-Server Model. 5. The LDAP Models. 6. LDAP Interfaces and the Future of the Standard. PART 3: THE DESIGN PHASE. 7. Functional Design. 8. Technical Design. 9. LDAP Tools and Applications. 10. Case Studies. 11. The Life Cycle of a Corporate Directory. PART 4: EXAMPLES OF CODE. 12. Examples of Code in C and C++. 13. Examples of ADSI Implementation. Index.

Read more less

Book SynopsisFocusing on IP over WDM optical networks, this book summarizes the fundamental mechanisms and the development and deployment of WDM optical networks. It provides information on both the network and the software architectures needed to implement WDM enabled optical networks designed to transport IP traffic.Trade Review"Network engineering and planners...will be interested in this book.... Developers and architects...will also find the book useful." (Journal of Optical Networking, Vol. 2, No. 4, April 2003)Table of ContentsPreface. Acknowledgements. Introduction. Review. Characteristics of the Internet and IP Routing. WDM Optical Networks. IP over WDM. IP/WDM Network Control. IP/WDM Traffic Engineering. Other IP/WDM Specific Issues. Concluding Remarks. Bibliography. Web Site List. Acronym List. Index.

Read more less

Book SynopsisIn networks, Quality of Service (QoS) is the idea that transmission rates, error rates, and other characteristics can be measured, improved, and, to some extent, guaranteed in advance. QoS is of particular concern for the continuous transmission of high--bandwidth video and multimedia information.Table of ContentsPreface. 1. The Meaning of Quality of Service. Why QOS? Defining QOS. Book Preview. 2. Working at Layer 2. The IEEE 802.1p Signalling Technique. Configuring Cisco(r) Equipment. 3. QOS into the WAN. The IP Protocol Stack. Data Delivery. Queuing Addresses. The IPv4 Header. Router Queuing. First-in, First-out Queuing. Priority Queuing. Classifying Traffic Via the Arrival Interface. 4. Diffserv and MPLS. Differentiated Services. Supporting DiffServ in a Cisco Environment. Multi-Protocol Label Switching. Configuring MPLS. 5. The Resource Preservation Protocol. Understanding RSVP. Configuring RSVP. 6. QOS Enhancement Techniques. Enabling Static Routing. Enhancing the Address Resolution Process. Tailor the Access Line. Enabling RTP Header Compression. Enabling Other Compression Methods. Eliminate Directed Broadcasts. Enable Selective Acknowledgements. Enable Link Fragmentaton and Interleaving. 7. Monitoring Your Network. The Show Command. IP-Related Show Commands. Appendix: Testing Tools. Index.

Read more less

Book SynopsisA developera s guide to the Symbian OS (Operating System) Communications Architecture. The Symbian OS Communications Architecture is the cornerstone of Symbian OS -- enabling the combination of voice communications, wireless Internet access and computing functionality.Trade Review"...clear and detailed...the supporting text is lucid and clear..." (www.wirelessdevnet.com, 5 July 2002) "…something useful for everyone…the writing is clear, and the structure makes it easy to learn…" (Forum Nokia, 6 March 12003) "…written in a clear and accessible manner…" (CVu, June 2003)Table of ContentsPreface. Foreword. Section 1: The Basics of Symbian OS Communication. Introduction. Introduction to the Symbian Communication Architecture. Several Introductions to the Architecture Infrastructure. Transport Technologies. Look at Content Technologies. Security and Communication. Section 2: Programming using Symbian OS Communication. Getting Started with Communications Programming. Serial Communications. Communicating via Infrared: Serial Communications. Using Sockets. Communicating via Infrared: Using Sockets. Communicating with TCP/IP. Bluetooth Communications. Telephony. Sending and Receiving Messages. Browsable Content Technologies. Section 3: Miscellaneous Topics. Synchronization: PLP and SyncML. The Communications Database. Looking Ahead. Appendix A Developer Resources and Bibliography. Index.

Read more less

Book SynopsisInternet based applications are the emerging major source of traffic for wireless networks. Soon we will all be able to access the Internet from our mobile phones, PDAs, hand--held devices, etc. This book describes the networking technologies that will enable the seamless transmission of data to us, wherever we are.Trade Review"...excellent text book style...essential reading for those interested in or studying the topic..." (TelecomWorldWire, 25 June 2003) "...an excellent addition to the literature on the wireless mobile Internet...a must-read for seasoned professionals and also for those who are new to the subject...." (Computing Reviews) "...easy-to-read reference text is essential reading for those interested in or studying the topic..." (M2 Best Books, 25 June 2003) "...a survival guide that helps introduce us to issues related to providing Internet networking for wireless mobile terminals..." (IEEE Communications Magazine, Dec 2003)Table of ContentsPreface. Acknowledgements. PART I: THE WIRELESS INTERNET. An Introduction to Wireless Mobile Internet. Wireless Cellular Data Networks. Cellular Mobile Networks. Mobile Networks of the Future. PART II: FUNDAMENTAL TOPICS IN WIRELESS IP. Quality of Service in a Mobile Environment. Traffic Modeling for Wireless IP. Traffic Management for Wireless IP. Mobility in Cellular Networks. Transport Protocols for Wireless IP. Internet Protocol for Wireless IP. PART III: ADVANCED TOPICS IN WIRELESS IP. Internet Perspectives on Wireless IP. Mobile Ad Hoc Networks and Future Challenges. Satellites in Wireless IP. Acronyms. Index. About the Author.

Read more less

Book SynopsisProvides the information needed to know to plan, implement, manage and upgrade Ethernet networks. This book helps to: improve your skills in employing Ethernet hubs, switches, and routers; learn how to set up and operate a wireless Local Area Network; discover how to extend a wired Ethernet via wireless LANs; and, understand cabling standards.Table of ContentsPreface. Acknowledgments. Introduction to Networking Concepts. Networking Standards. Ethernet Networks. Frame Operations. Networking Hardware and Software. Bridging and Switching Methods and Performance Issues. Routers. Wireless Ethernet. Security. Managing the Network. The Future of Ethernet. Index.

Read more less

Book SynopsisOffers a treatment of the full range of algorithms available for conceptual data analysis, spanning creation, maintenance, display and manipulation of concept lattices. The website accompanying this book allows you to gain a better understanding of the principles covered herein through working on the topics discussed.Table of ContentsForeword. Preface. I: THEORY AND ALGORITHMS. 1. Theoretical Foundations. 1.1 Basic Notions of Orders and Lattices. 1.2 Context, Concept, and Concept Lattice. 1.3 Many-valued Contexts. 1.4 Bibliographic Notes. 2. Algorithms. 2.1 Constructing Concept Lattices. 2.2 Incremental Lattice Update. 2.3 Visualization. 2.4 Adding Knowledge to Concept Lattices. 2.5 Bibliographic Notes. II: APPLICATIONS. 3. Information Retrieval. 3.1 Query Modification. 3.2 Document Ranking 4. Text Mining. 4.1 Mining the Content of the ACM Digital Library. 4.2 MiningWeb Retrieval Results with CREDO. 4.3 Bibliographic Notes. 5. Rule Mining. 5.1 Implications. 5.2 Functional Dependencies. 5.3 Association Rules. 5.4 Classification Rules. 5.5 Bibliographic Notes. References. Index.

Read more less

Book SynopsisWhen the web transitioned from a publishing to an interactive e--commerce medium, standardised web--browsers entered widespread use and developers were able to rely on a relatively stable client component.Table of ContentsPreface xi 1 Introduction 1 1.1 Servers on the Internet 2 1.2 Serving static hypertext 6 1.3 Serving dynamically generated hypertext 8 1.4 Forms and CGI 11 1.5 A CGI program and examples 18 1.6 Client-side scripting 29 Exercises 32 Practical 32 Short answer questions 32 Explorations 33 2 HTTP 35 2.1 Requests and responses 36 2.1.1 Requests 38 2.1.2 Responses 40 2.2 Authorization 41 2.3 Negotiated content 43 2.4 State in a stateless protocol 44 Exercises 45 Short answer questions 45 Explorations 45 3 Apache 47 3.1 Apache’s processes 48 3.2 Apache’s modules 51 3.3 Access controls 54 3.4 Logs 58 3.5 Generation of dynamic pages 61 3.6 Apache: installation and configuration 64 3.6.1 Basic installation and testing 64 3.6.2 The httpd.conf configuration file 67 Exercises 71 Practical 71 Short answer questions 75 Explorations 76 4 IP and DNS 77 4.1 IP addresses 78 4.2 IP addresses and names 81 4.3 Name resolution 84 4.4 BIND 86 Exercises 89 Practical 89 Short answer questions 90 Explorations 90 5 Perl 91 5.1 Perl’s origins 92 5.2 Running Perl, and the inevitable ‘Hello World’ program 93 5.3 Perl language 94 5.3.1 Scalar variables 95 5.3.2 Control structures 98 5.4 Perl core functions 101 5.5 ’CS1’ revisited: simple Perl programs 103 5.5.1 Burgers 103 5.5.2 ls -l 105 5.6 Beyond CS1: lists and arrays 108 5.6.1 Basics of lists 108 5.6.2 Two simple list examples 112 5.7 Subroutines 118 5.8 Hashes 120 5.9 An example using a hash and a list 122 5.10 Files and formatting 123 5.11 Regular expression matching 126 5.11.1 Basics of regex patterns 128 5.11.2 Finding ‘what matched?’ and other advanced features 131 5.12 Perl and the OS 136 5.12.1 Manipulating files and directories 137 5.12.2 Perl: processes 140 5.12.3 A ‘systems programming’ example 143 5.13 Networking 150 5.14 Modules 153 5.15 Databases 154 5.15.1 Basics 154 5.15.2 Database example 158 5.16 Perl: CGI 163 5.16.1 ’Roll your own’ CGI code 164 5.16.2 Perl: CGI module(s) 171 5.16.3 Security issues and CGI 173 Exercises 174 Practical 174 Short answer questions 180 Explorations 181 6 PHP4 183 6.1 PHP4’s origins 183 6.2 PHP language 187 6.2.1 Simple variables and data types 187 6.2.2 Operators 191 6.2.3 Program structure and flow control 191 6.2.4 Functions 193 6.3 Simple examples 194 6.4 Multi-page forms 198 6.5 File uploads 207 6.6 Databases 216 6.7 GD graphics library 227 6.8 State 238 Exercises 248 Practical 248 Short answer questions 257 Explorations 257 7 Java Servlets 259 7.1 Servlet overview 259 7.2 A first servlet example 261 7.2.1 Form and servlet code 263 7.2.2 Installation, Compilation, Deployment 265 7.2.3 web.xml deployment files 268 7.3 Sun’s servlet-related classes 269 7.4 Web application example: ‘Membership’ 276 7.5 Client state and sessions 290 7.6 Images 304 7.7 Security features 306 Exercises 328 Practical 328 Short answer questions 336 Explorations 336 Contents vii 8 JSP: Java Server Pages 337 8.1 JSP overview 337 8.2 The ‘Guru’ – a JSP example 340 8.2.1 The scriptlet Guru 340 8.2.2 The tagged Guru 343 8.3 Membership example 344 8.4 JSP: page contents 352 8.4.1 JSP directives 354 8.4.2 jsp: tag library 355 8.5 Servlet, bean and JSP examples 356 8.6 Tag libraries 368 8.6.1 Defining a simple customized action tag 369 8.6.2 Using tag libraries 373 Exercises 375 Practical 375 Short answer questions 379 Explorations 380 9 XML 381 9.1 XML overview 381 9.2 XML and friends 384 9.3 XSL, XSLT and XML display 391 9.4 XML and XSL generating WML 403 9.5 Simple API for XML 412 9.6 DOM – the Document Object Model 422 Exercises 428 Practical 428 Short answer questions 432 Explorations 433 10 Enterprise Java 435 10.1 EJB background 437 10.1.1 Smart beans in smarter containers 437 10.1.2 Distributed objects 438 10.2 EJB basics 441 10.2.1 Servers, containers and beans 441 10.2.2 The life of a bean 444 10.2.3 Classes and interfaces 444 10.2.4 EJB clients and EJB deployment 446 10.3 Session bean examples 447 10.3.1 Stateless server 447 10.3.2 Stateful server 453 10.4 An Entity bean 456 10.5 Real-world EJB 470 Exercises 485 Practical 485 Short answer questions 485 Explorations 485 11 Future technologies? 487 11.1 (Lack of) Speed kills 487 11.2 Personal internet presence 489 11.3 Peer-to-peer 490 11.4 ... and on to ‘Web Services’ 492 11.4.1 The existing world of distributed objects 492 11.4.2 Steps towards a future world of distributed objects 495 11.4.3 UDDI, WSDL and SOAP 498 11.4.4 Web service promises 509 Exercises 512 Explorations 512 Appendices A Minimalist guide to HTML and JavaScript 515 B Active Server Pages: ASP (scripting) 549 C .NET 573 Index 601

Read more less

Book SynopsisWireless Local Area Networks (LANs) represent the revolution occuring in wireless communications. These networks, allow small communities of office workers, industrial workers, hospital employees, technical teams, and others, to communicate via their mobile devices without having to worry about cables. This book covers this area.Table of ContentsPreface xi Structure of the book xii 1 Introduction 1 1.1 Definition and restriction 1 1.2 Overview of advantages and disadvantages 1 1.3 Applications overview 3 1.4 Market events 6 1.5 Organizations and governing bodies 12 2 Basics 17 2.1 History of wireless vs. wired 17 2.2 Technical communication models and classification 20 2.3 Demands on transfer networks 26 2.4 Properties of electromagnetic waves 28 2.5 Digital modulation technology 33 2.6 Channel access 38 2.7 Spread spectrum techniques 39 2.8 Orthogonal frequency division multiplex procedure 43 2.9 Antennae 2.10 Special features of wireless networks 47 2.11 Frequency allocations 48 3 Applications, devices and standards 51 3.1 Application scenarios 51 3.2 Device types 53 3.3 Standards 54 4 IEEE802.11 57 4.1 The standard 57 4.2 Architectures 59 4.3 Channel access 61 4.4 The Physical layer and bit transfer 81 4.5 Other services 86 4.6 Security 86 4.7 Extensions to the standard 88 5 Bluetooth 95 5.1 The standard 95 5.2 Architectures 99 5.3 Channel access 99 5.4 Controlling states 104 5.5 Bit transfer 108 5.6 Security 110 5.7 System implementation 110 6 DECT 113 6.1 The standard 113 6.2 Architectures 113 6.3 Channel access 114 6.4 Bit transfer 115 6.5 Application profiles 115 7 HomeRF 117 7.1 The standard 117 7.2 Architectures 117 7.3 Channel access 119 7.4 Bit transfer 121 8 HiperLAN/2 123 8.1 The standard 123 8.2 Architectures 125 8.3 Channel access 127 8.4 Bit transfer 130 8.5 Other services 132 8.6 The HiperLAN/2 standard versus IEEE802.1 a 132 9 Operating an IEEE802.11b-complaint WLAN 133 9.1 Introduction 133 9.2 Mobile stations 133 9.3 Access points 136 9.4 Extended networks 141 9.5 Network analysis 143 9.6 Examples from real life 148 10 Various aspects of WLAN technology 153 10.1 Security 10.2 Sources of interference 161 10.3 Selecting a spread spectrum technique 163 10.4 Aspects of EMT interference 165 10.5 WLANs and TCP/IP 167 10.6 Deciding factors 167 10.7 Future prospects 169 Appendix 171 A.1 Maxwellian equations 171 A.2 Physical basis of direct sequence spread spectrum process 171 A.3 Directional antennae 174 B Bibliography 179 B.1 English-language publications 179 B.2 German-language publications 182 C Abbreviations 185

Read more less

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

Read more less

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

Read more less

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

Read more less

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

Read more less

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

Read more less

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

Read more less

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

Read more less

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

Read more less

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

Read more less

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

Read more less

Book SynopsisThe up-to-date edition of the bestselling guide to the basics of telecommunications and digital technology Understanding Telecommunications and Lightwave Systems presents a nontechnical treatment of how voice, video, and multimedia can simultaneously travel over today''s evolving telecommunications systems. This updated Third Edition provides a comprehensive overview of the telecommunications field as well as a detailed introduction to the latest lightwave technology. The author''s examination of recent techniques and developing technologies in telecommunications includes: Third-generation cell phones with microbrowser capabilities Changes in the global PCS network Optical switching and transmission parameters Lightwave systems and Dense Wavelength Division Multiplexing A new chapter (Chapter 17: The Internet) that examines this multimedia structure and the network economy it has created Satellite communTrade Review"...provides a non-technical overview of contemporary telecommunications systems." (SciTech Book News, Vol. 26, No. 2, June 2002)Table of ContentsIntroduction 1 1 The Evolution of Telecommunications 3 The Telegraph 3 The Telephone 3 Wireless Communications 4 AT&T Monopoly 4 Trans-Canada System 4 Semiconductors 5 Digital Communications 5 Satellite Communications 6 Fiber Optics 6 AT&T Break-Up 6 Telecommunications Act of 1996 8 The Meltdown 10 Conclusion 10 2 Analog Transmission 12 Conclusion 15 Review Questions for Chapter 2 15 3 Digital Transmission 17 Conclusion 19 Review Questions for Chapter 3 20 4 Basic Multiplexing Techniques 21 Brief History 21 FDM 21 TDM 22 Pulse-Code Modulation 22 Conclusion 27 Review Questions for Chapter 4 27 5 Switching Hierarchy 28 Brief History '. 28 Divestiture 30 Conclusion 32 Review Questions for Chapter 5 32 6 North American Digital Hierarchies 34 Conclusion 37 Review Questions for Chapter 6 37 7 Transmission 38 Transmission Level 39 Via Net Loss (VNL) 40 All-Digital Network 40 Echo Suppressors and Echo Cancellers 43 Split Echo Suppressor 44 Full Echo Suppressor 45 Digital Echo Canceller 45 Conclusion 46 Review Questions for Chapter 7 47 8 The Local Subscriber Loop 48 Brief History 48 The Local Loop 48 Digital Subscriber Carrier Systems 50 Asymmetric Digital Subscriber Lines 52 Conclusion 54 Review Questions for Chapter 8 55 9 Microwave Radio 56 Brief History 56 Digital Radio 56 Design Considerations 58 SONET Radio 60 Conclusion 61 Review Questions for Chapter 9 61 10 Satellite Communications 63 Brief History 63 Geostationary (GEO) Satellites 65 Parking Slots 66 Transponders 67 The Footprint 68 Time Delay 68 Global Positioning System 70 MEO and LEO Satellites 71 Direct-to-Home Satellite System 75 Satellite Operators 75 Conclusion 76 Review Questions for Chapter 10 76 11 Switching Systems 78 The Strowger Switch 78 Panel Switching Syste 79 Crossbar Switch 79 The First Electronic Switch 80 The Digital Switch 81 The Optical Switch 84 Optical Switches with Electrical Cores 85 All-Optical Switches 85 Conclusion 90 Review Questions for Chapter 11 90 12 Private Branch Exchange 92 Brief History 92 Analog PBX 92 Digital PBX 93 Conclusion 95 Review Questions for Chapter 12 96 13 Traffic Considerations 97 Brief History 97 CCS 97 Grade of Service 98 Internet Congestion 99 Conclusion 101 Review Questions for Chapter 13 101 14 Video Transmission 102 Brief History 102 Video Compression 102 Switched Data Services 103 Video Codecs 103 Videophone 104 Multimedia 105 Conclusion 107 Review Questions for Chapter 14 108 15 Wireless 109 Brief History 109 Cellular Telephone Service 109 The Mobile Unit 111 Personal Communications Services (PCS) 113 The Standards 114 The Future 115 Conclusion 117 Review Questions for Chapter 15 119 16 The Computer 120 Brief History 120 Digital Computers 120 Microprocessors 123 Hard Drive 123 End of an Era 125 Internet Appliances 125 The Evolution of the Silicon Chip 127 Bluetooth 127 Conclusion 128 Review Questions for Chapter 16 130 17 The Internet 131 Brief History 131 Internet Access 132 Asymmetric Digital Subscriber Line 133 Very High Speed Digital Subscriber Line 134 Integrated Services Digital Network 134 Cable Modems 136 Satellite 137 Local Multipoint Distribution System 138 Circuit Switched vs. Packet Switched 139 Internet Telephony 142 Conclusion 143 Review Questions for Chapter 17 144 18 Lightwave Systems 145 Brief History 145 New Transcontinental Carriers 149 Lightwave Undersea Systems 150 Evolution of Lightwave Systems 150 Optical Fiber Cable 154 Optical Fiber Transmission Parameters 157 Fiber Connectors 163 Optical Emitters 165 Optical Detectors 167 Tunable Lasers 168 All-Optical Networks 169 Dense Wavelength-Division Multiplexing 169 Optical Amplifiers 171 Optical Cross-Connects 173 System Design Considerations 175 Synchronous Optical Network 178 Asynchronous Transfer Mode 186 SONET Ring Networks 190 System Availability 192 Cable Placement Choices 193 Cable Placement Techniques 195 Placement of Underground Cable 196 Placement of Aerial Cable 197 Placement of Direct Buried Cable 199 Field Splicing 203 Mechanical Splicing 205 Field Testing Using an Optical Time Domain Reflectometer 205 Fiber-to-the-Home 209 Video-on-Demand (VOD) 209 Fiber-to-the-Curb 210 Local Area Network 213 Ethernet 214 IBM Token Ring 215 LAN Topology 216 Wireless LANs 218 Fiber Optic LANs 218 Conclusion 224 Review Questions for Chapter 18 225 Telecommunications Glossary 228 Bibliography 250 Index 251 Answers to Review Questions 259 About the Author 269

Read more less

Book SynopsisThe next generation of wireless communications systems will offer practically unlimited mobility and high data-rate services such as streaming video. In order to provide these capabilities, wireless networks will need to have extremely high bandwidth efficiency. One of the most promising techniques for ensuring this efficiency is space-time coding.Table of ContentsPreface. Acronyms. 1. Motivation and Context. 1.1 Evolution of Wireless Communication Systems. 1.2 Wireless Propagation Effects. 1.3 Parameters and Classification of Wireless Channels. 1.3.1 Delay Spread and Coherence Bandwidth. 1.3.2 Doppler Spread and Coherence Time. 1.4 Providing, Enabling and Collecting Diversity. 1.4.1 Diversity Provided by Frequency-Selective Channels. 1.4.2 Diversity Provided by Time-Selective Channels. 1.4.3 Diversity Provided by Multi-Antenna Channels. 1.5 Chapter-by-Chapter Organization. 2. Fundamentals of ST Wireless Communications. 2.1 Generic ST System Model. 2.2 ST Coding viz Channel Coding. 2.3 Capacity of ST Channels. 2.3.1 Outage Capacity. 2.3.2 Ergodic Capacity. 2.4 Error Performance of ST Coding. 2.5 Design Criteria for ST Codes. 2.6 Diversity and Rate: Finite SNR viz Asymptotics. 2.7 Classification of ST Codes. 2.8 Closing Comments. 3. Coherent ST Codes for Flat Fading Channels. 3.1 Delay Diversity ST Codes. 3.2 ST Trellis Codes. 3.2.1 Trellis Representation. 3.2.2 TSC ST Trellis Codes. 3.2.3 BBH ST Trellis Codes. 3.2.4 GFK ST Trellis Codes. 3.2.5 Viterbi Decoding of ST Trellis Codes. 3.3 Orthogonal ST Block Codes. 3.3.1 Encoding of OSTBCs. 3.3.2 Linear ML Decoding of OSTBCs. 3.3.3 BER Performance with OSTBCs. 3.3.4 Channel Capacity with OSTBCs. 3.4 Quasi-Orthogonal ST Block Codes. 3.5 ST Linear Complex Field Codes. 3.5.1 Antenna Switching and Linear Precoding. 3.5.2 Designing Linear Precoding Matrices. 3.5.3 Upper-Bound on Coding Gain. 3.5.4 Construction based on Parameterization. 3.5.5 Construction Based on Algebraic Tools. 3.5.6 Decoding ST Linear Complex Field Codes. 3.5.7 Modulus-Preserving STLCFC. 3.6 Linking OSTBC, QO-STBC and STLCFC Designs. 3.6.1 Embedding MP-STLCFC into the Alamouti Code. 3.6.2 Embedding 2 x 2 MP-STLCFCs into OSTBC. 3.6.3 Decoding QO-MP-STLCFC. 3.7 Closing Comments. 4. Layered ST Codes. 4.1 BLAST Designs. 4.1.1 D-BLAST. 4.1.2 V-BLAST. 4.1.3 Rate Performance with BLAST Codes. 4.2 ST Codes Trading Diversity for Rate. 4.2.1 Layered ST Codes with Antenna-Grouping. 4.2.2 Layered High-Rate Codes. 4.3 Full-Diversity Full-Rate ST Codes. 4.3.1 The FDFR Transceiver. 4.3.2 Algebraic FDFR Code Design. 4.3.3 Mutual Information Analysis. 4.3.4 Diversity-Rate-Performance Trade-offs. 4.4 Numerical Examples. 4.5 Closing Comments. 5. Sphere Decoding and (Near-) Optimal MIMO Demodulation. 5.1 Sphere Decoding Algorithm. 5.1.1 Selecting a Finite Search Radius. 5.1.2 Initializing with Unconstrained LS. 5.1.3 Searching within the Fixed-Radius Sphere. 5.2 Average Complexity of SDA in Practice. 5.3 SDA Improvements. 5.3.1 SDA with Detection Ordering and Nulling-Cancelling. 5.3.2 Schnorr-Euchner Variate of SDA. 5.3.3 SDA with Increasing Radius Search. 5.3.4 Simulated Comparisons. 5.4 Reduced-Complexity IRS-SDA. 5.5 Soft Decision Sphere Decoding. 5.5.1 List Sphere Decoding (LSD). 5.5.2 Soft SDA using Hard SDAs. 5.6 Closing Comments. 6. Non-Coherent and Differential ST Codes for Flat Fading Channels. 6.1 Non-Coherent ST Codes. 6.1.1 Search-Based Designs. 6.1.2 Training-Based Designs. 6.2 Differential ST Codes. 6.2.1 Scalar Differential Codes. 6.2.2 Differential Unitary ST Codes. 6.2.3 Differential Alamouti Codes. 6.2.4 Differential OSTBCs. 6.2.5 Cayley Differential Unitary ST Codes. 6.3 Closing Comments. 7. ST Codes for Frequency-Selective Fading Channels: Single-Carrier Systems. 7.1 System Model and Performance Limits. 7.1.1 Flat-Fading Equivalence and Diversity. 7.1.2 Rate Outage Probability. 7.2 ST Trellis Codes. 7.2.1 Generalized Delay Diversity. 7.2.2 Search-Based STTC Construction. 7.2.3 Numerical Examples. 7.3 ST Block Codes. 7.3.1 Block Coding with Two Transmit-Antennas. 7.3.2 Receiver Processing. 7.3.3 ML Decoding based on the Viterbi Algorithm. 7.3.4 Turbo Equalization. 7.3.5 Multi-Antenna Extensions. 7.3.6 OSTBC Properties. 7.3.7 Numerical Examples. 7.4 Closing Comments. 8. ST Codes for Frequency-Selective Fading Channels: Multi-Carrier Systems. 8.1 The General MIMO OFDM Framework. 8.1.1 OFDM Basics. 8.1.2 MIMO OFDM. 8.1.3 STF Framework. 8.2 ST and SF Coded MIMO OFDM. 8.3 STF Coded OFDM. 8.3.1 Subcarrier Grouping. 8.3.2 GSTF Block Codes. 8.3.3 GSTF Trellis Codes. 8.3.4 Numerical Examples. 8.4 Digital Phase Sweeping and Block Circular Delay. 8.5 Full-Diversity Full-Rate MIMO OFDM. 8.5.1 Encoders and Decoders. 8.5.2 Diversity and Rate Analysis. 8.5.3 Numerical Examples. 8.6 Closing Comments. 9. ST Codes for Time-Varying Channels. 9.1 Time-Varying Channels. 9.1.1 Channel Models. 9.1.2 Time-Frequency Duality. 9.1.3 Doppler Diversity. 9.2 Space-Time-Doppler Block Codes. 9.2.1 Duality-Based STDO Codes. 9.2.2 Phase Sweeping Design. 9.3 Space-Time-Doppler FDFR Codes. 9.4 Space-Time-Doppler Trellis Codes. 9.4.1 Design Criterion. 9.4.2 Smart-Greedy Codes. 9.5 Numerical Examples. 9.6 Space-Time-Doppler Differential Codes. 9.6.1 Inner Codec. 9.6.2 Outer Differential Codec. 9.7 ST Codes for Doubly-Selective Channels. 9.7.1 Numerical Examples. 9.8 Closing Comments. 10. Joint Galois-Field and Linear Complex-Field ST Codes. 10.1 GF-LCF ST Codes. 10.1.1 Separate versus Joint GF-LCF ST Coding. 10.1.2 Performance Analysis. 10.1.3 Turbo Decoding. 10.2 GF-LCF ST Layered Codes. 10.2.1 GF-LCF ST FDFR Codes: QPSK Signalling. 10.2.2 GF-LCF ST FDFR Codes: QAM Signalling. 10.2.3 Performance Analysis. 10.2.4 GF-LCF FDFR versus GF-Coded V-BLAST. 10.2.5 Numerical Examples. 10.3 GF-LCF Coded MIMO OFDM. 10.3.1 Joint GF-LCF Coding and Decoding. 10.3.2 Numerical Examples. 10.4 Closing Comments. 11. MIMO Channel Estimation and Synchronization. 11.1 Preamble-Based Channel Estimation. 11.2 Optimal Training-Based Channel Estimation. 11.2.1 ZP-Based Block Transmissions. 11.2.2 CP-Based Block Transmissions. 11.2.3 Special Cases. 11.2.4 Numerical Examples. 11.3 (Semi-)Blind Channel Estimation. 11.4 Joint Symbol Detection and Channel Estimation. 11.4.1 Decision-Directed Methods. 11.4.2 Kalman Filtering Based Methods. 11.5 Carrier Synchronization. 11.5.1 Hopping Pilot Based CFO Estimation. 11.5.2 Blind CFO Estimation. 11.5.3 Numerical Examples. 11.6 Closing Comments. 12. ST Codes with Partial Channel Knowledge: Statistical CSI. 12.1 Partial CSI Models. 12.1.1 Statistical CSI. 12.2 ST Spreading. 12.2.1 Average Error Performance. 12.2.2 Optimization based on Average SER Bound. 12.2.3 Mean-Feedback. 12.2.4 Covariance-Feedback. 12.2.5 Beamforming Interpretation. 12.3 Combining OSTBC with Beamforming. 12.3.1 Two-Dimensional Coder-Beamformer. 12.4 Numerical Examples. 12.4.1 Performance with Mean-Feedback. 12.4.2 Performance with Covariance-Feedback. 12.5 Adaptive Modulation for Rate Improvement. 12.5.1 Numerical Examples. 12.6 Optimizing Average Capacity. 12.7 Closing Comments. 13. ST Codes With Partial Channel Knowledge: Finite-Rate CSI. 13.1 General Problem Formulation. 13.2 Finite-Rate Beamforming. 13.2.1 Beamformer Selection. 13.2.2 Beamformer Codebook Design. 13.2.3 Quantifying the Power Loss. 13.2.4 Numerical Examples. 13.3 Finite-Rate Precoded Spatial Multiplexing. 13.3.1 Precoder Selection Criteria. 13.3.2 Codebook Construction: Infinite-Rate. 13.3.3 Codebook Construction: Finite-Rate. 13.3.4 Numerical Examples. 13.4 Finite-Rate Precoded OSTBC. 13.4.1 Precoder Selection Criterion. 13.4.2 Codebook Construction: Infinite-Rate. 13.4.3 Codebook Construction: Finite-Rate. 13.4.4 Numerical Examples. 13.5 Capacity Optimization with Finite-Rate Feedback. 13.5.1 Selection Criterion. 13.5.2 Codebook Design. 13.6 Combining Adaptive Modulation with Beamforming. 13.6.1 Mode Selection. 13.6.2 Codebook Design. 13.7 Finite-rate Feedback in MIMO OFDM. 13.8 Closing Comments. 14. ST Codes in the Presence of Interference. 14.1 ST Spreading. 14.1.1 Maximizing the Average SINR. 14.1.2 Minimizing the Average Error Bound. 14.2 Combining STS with OSTBC. 14.2.1 Low-Complexity Receivers. 14.3 Optimal Training with Interference. 14.3.1 LS Channel Estimation. 14.3.2 LMMSE Channel Estimation. 14.4 Numerical Examples. 14.5 Closing Comments. 15. ST Codes for Orthogonal Multiple Access. 15.1 System Model. 15.1.1 Synchronous downlink. 15.1.2 Quasi-synchronous uplink. 15.2 Single-Carrier Systems: STBC-CIBS-CDMA. 15.2.1 CIBS-CDMA for User Separation. 15.2.2 STBC Encoding and Decoding. 15.2.3 Attractive Features of STBC-CIBS-CDMA. 15.2.4 Numerical Examples. 15.3 Multi-Carrier Systems: STF-OFDMA. 15.3.1 OFDMA for User Separation. 15.3.2 STF Block Codes. 15.3.3 Attractive Features of STF-OFDMA. 15.3.4 Numerical Examples. 15.4 Closing Comments. References. Index.

Read more less

Book SynopsisToday all enterprises, from retail stores to financial institutions, manufacturing to government departments, depend on their databases to provide the crucial information essential to running their businesses. Databases are central for the rapidly growing and maturing electronic commerce.Table of ContentsPreface xxv PART I BASIC DATABASE CONCEPTS 1 1 THE DATABASE APPROACH 3 2 OVERVIEW OF MAJOR COMPONENTS 36 PART II DATABASE DEVELOPMENT PROCESS 67 3 SIGNIFICANCE OF THE DATABASE ENVIRONMENT 69 4 DATABASE DEVELOPMENT LIFE CYCLE 93 PART III CONCEPTUAL DATA MODELING 141 5 DATA MODELING BASICS 143 6 OBJECT-BASED DATA MODEL: PRINCIPLES AND COMPONENTS 167 7 ENTITY-RELATIONSHIP DATA MODEL 206 PART IV THE RELATIONAL DATA MODEL 237 8 RELATIONAL DATA MODEL FUNDAMENTALS 239 9 SEMANTIC DATA MODEL TO RELATIONAL DATA MODEL 273 10 DATA NORMALIZATION METHOD 303 PART V DESIGN AND IMPLEMENTATION 331 11 COMPLETING THE LOGICAL DESIGN 333 12 THE PHYSICAL DESIGN PROCESS 351 13 SPECIAL IMPLEMENTATION CONSIDERATIONS 385 PART VI DATABASE ADMINISTRATION AND MAINTENANCE 423 14 OVERVIEW OF ADMINISTRATION FUNCTIONS 425 15 DATA INTEGRITY 446 16 DATABASE SECURITY 495 17 ONGOING MAINTENANCE AND GROWTH 525 PART VII ADVANCED DATABASE TOPICS 551 18 DISTRIBUTED DATABASE SYSTEMS 553 19 DATABASE SYSTEMS AND THE WEB 598 20 TRENDS IN DATABASE TECHNOLOGY 636 APPENDICES 685 A Legacy System Models: Hierarchical and Network 687 B Codd's Relational Rules 692 C Diagramming Conventions and Symbols 694 D Use of CASE tools 700 E Review of major commercial DBMSs 703 F Database Design and Development Summary 712 References 716 Glossary 718 Index 729

Read more less

Book SynopsisFor more than a decade the networking industry has been creating new technologies that bring high speed to every kind of network. Networking technology professionals have struggled to choose the right collection of technologies from this menu to meet their specific needs.Table of ContentsNetworkng Council Foreword. Acknowledgments. Introduction. Fundamentals and Design Principles. Network Architecture and Topology. Network Control and Signaling. Network Components. End Systems. End-to-End Protocols. Networked and Applications. Future Directions and Conclusion. References. Appendix A: Axioms and Principles. Appendix B: Acronyms. Index.

Read more less

Book SynopsisIntroduction to Modeling and Performance Evaluation of Communication Networks is a quantitative text that focuses on the real issues behind serious modeling and analysis of communications networks. The author covers all the necessary mathematics and theory in order for students to understand the tools that optimize computer networks today.Trade Review"This book provides valuable information on the application of analytical techniques to model communication networks." (Computing Reviews, February 29, 2008)Table of ContentsPreface. 1. Review of Elementary Probability Theory. 1.1 Sample space, events and probabilities. 1.2 Random variables. 1.3 Cumulative distribution functions, expectation and moment generating functions. 1.4 Discretely distributed random variables. 1.5 Continuously distributed random variables. 1.6 Some useful inequalities. 1.7 Joint distribution functions. 1.8 Conditional expectation. 1.9 Independent random variables. 1.10 Conditional independence. 1.11 A law of large numbers. 1.12 First order autoregressive estimators. 1.13 Measures of separation between distributions. 1.14 Statistical confidence. 1.15 Deciding between two alternative claims. Problems. 2. Markov Chains. 2.1 Memoryless property of the exponential distribution. 2.2 Finite dimensional distributions and stationarity. 2.3 The Poisson (counting) process on R+. 2.4 Continuous-time, time-homogeneous, Markov processes with countable. state-space. Markov chain. 2.5 Birth-death Markov chains. 2.6 Modeling time-series data using a Markov chain. 2.7 Simulating a Markov chain. 2.8 Overview of discrete-time Markov chains. 2.9 Martingales adapted to discrete-time Markov chains. Problems. 3. Introduction to Queueing Theory. 3.1 Arrivals, departures and queue occupancy. 3.2 Lossless queues. 3.3 A queue described by an underlying Markov chain. 3.4 Stationary queues. 3.5 Erlang's blocking formula for the M/M/K/K queue. 3.6 Overview of discrete-time queues. Problems. 4. Local Multiplexing. 4.1 Internet router architecture. 4.2 Token (leaky) buckets for packet-traffic regulation. 4.3 Multiplexing flows of variable-length packets. 4.4 Service curves. 4.5 Connection multiplexing on a single trunk. 4.6 A game-theoretic framework for multiplexing packet flows. 4.7 Discussion: local medium access control of a single wireless channel. Problems. 5. Queueing networks with static routing. 5.1 Loss Networks. 5.2 Stable open networks of queues. Problems. 6. Dynamic Routing and Routing with Incentives. 6.1 General routing issues. 6.2 Unconstrained optimization. 6.3 Revenue maximization for loss networks. 6.4 Constrained optimization and duality. 6.5 A distributed pricing and resource management framework. 6.6 Discussion: joint scheduling and routing in multihop wireless networks. 6.7 Multipath load balancing. Problems. 7. Peer-to-Peer File Sharing with Incentives. 7.1 Summary of query resolution. 7.2 Unstructured query resolution. forwarding. 7.3 Structured query resolution. 7.4 Discussion: security issues. 7.5 Incentives for cooperation when downloading. Problems. References. Appendix A: Additional Background on Routing. A.1 Network graph terminology. A.2 Link-state algorithms. A.3 The Bellman-Ford approach. Appendix B: Solutions or References for Selected Problems. References.

Read more less

Book SynopsisThe development of corporate database systems is complex, time-consuming, and expensive, causing developers to look for ways to cut costs. Len Silverston found a way to do this by identifying core data models that most companies share, standardizing them, and making them available on this CD-ROM.Trade Review"I thought the models in the books were well thought out and adequately explained" (Computer Shopper February 2002)Table of ContentsForeword. Acknowledgments. About the Author. Introduction. People and Organizations. Products. Ordering Products. Shipments. Work Effort. Invoicing. Accounting and Budgeting. Human Resources. Creating the Data Warehouse Data Model from the Enterprise Data Model. A Sample Data Warehouse Data Model. Star Schema Designs for Sales Analysis. Star Schema Designs for Human Resources. Additional Star Schema Designs. Implementing the Universal Data Models. Appendix A: Logical Data Model Entities and Attributes. Appendix B: Data Warehouse Data Model Tables and Columns. Appendix C: Star Schema Design Tables and Columns. How to Use the CD-ROM Product. Other Reusable Data Model and Data Warehouse Design Resources. Index.

Read more less

Book SynopsisA software radio is a radio whose channel modulation waveforms are defined in software. All wireless telephones are controlled by this software. Written by the leader in the field, this book covers the technology that will allow cellular telephones to greatly expand the types of data they can transmit.Trade Review"...shows how to integrate the analogue radio-frequency and digital aspect of radio with the emerging large-scale, object-oriented software technology needed for open-architecture software-defined radio." (SciTech Book News, Vol. 25, No. 3, September 2001)Table of ContentsIntroduction and Overview. Architecture Evolution. The Radio Spectrum and RF Environment. Systems-Level Architecture Analysis. Node-Level Architecture Analysis. Segment Design Tradeoffs. Antenna Segment Tradeoffs. RE/IF Conversion Segment Tradeoffs. ADC and DAC Tradeoffs. Digital Processing Tradeoffs. Software Architecture Tradeoffs. Software Component Characteristics. Performance Management. Smart Antennas. Applications. Reference Architecture. References. Glossary. Index.

Read more less

Book SynopsisAn expert guide for applying data mining with uncertain reasoning to a wide range of uses This volume presents a holistic view of data mining by integrating this diverse and exciting field with uncertain reasoning. It treats a wide range of issues and examines the state of the art in both fields while summarizing vital concepts that can normally only be found in various separate resources. The author concentrates on practical aspects of data mining-such as infrastructure and overall processes-but also discusses some selected algorithms and performance-related issues. Several important topics are addressed specifically, such as bridging the fields of machine learning and data mining and the discovery of influential association rules. In addition, the author discusses data warehousing as an enabling technique for data mining. Case studies are included throughout to illustrate important concepts. Data Mining and Uncertain Reasoning is a practical reference for pTable of ContentsWhat This Book Is About. Basics of Data Mining. Enabling Techniques and Advanced Features of Data Mining. Dealing with Uncertainty in Manipulation of Data. Data Mining Tasks for Knowledge Discovery. Bayesian Networks and Artificial Neural Networks. Uncertain Reasoning Techniques for Data Mining. Data Mining Lifecycle with Uncertainty Handling: Case Studies and Software Tools. Intelligent Conceptual Query Answering with Uncertainty: Basic Aspects and Case Studies. References. Index.

Read more less

Book SynopsisWritten to identify IP based network and service issues and the challenges facing its growth, as well as to assist the research and development community to prioritize their work in order to solve the problems facing the industry.Trade Review"The book is very practical and well-written for network operation engineers, computer scientists, and professionals. Every IP network professional will find something new and useful in this book." (E-Streams, Vol. 7, No. 6) "...a valuable source of information on a broad range of IP network-related management issues for both specialists and newcomers..." (IEEE Communications Magazine, January 2004)Table of ContentsContributors. Introduction. 1 Current Practice and Evolution (Salah Aidarous). 1.1 Introduction. 1.2 Evolution of Network Architecture. 1.3 Technology Breakthrough. 1.4 IP Management Challenges. 1.5 IP/PSTN Integration. 1.7 Summary. 2 eCommerce (Paul Levine). 2.1 Introduction. 2.2 eCommerce Requirements. 2.3 Open-edi. 2.4 Business Operational View. 2.5 Semantics (Data Definition Standards). 2.6 Shared Semantics for Interoperability (Data Exchange Standards). 2.7 Summary. 3 Quality of Service in IP Networks (Joberto Sérgio Barbosa Martins). Introduction. 3.1 IP Context and Quality of Service. 3.2 Quality of Service. 3.3 Quality of Service: Approaches and Initiatives for IP Networks. 3.4 Packet Conditioning, Queue Scheduling, and Congestion Control in Routers. 3.5 Integrated Services Architecture. 3.6 Differentiated Services Architecture. 3.7 Multiprotocol Label Switching. 3.8 Summary. 4 A Survey of Charging Internet Services (Burkhard Stiller). 4.1 Introduction. 4.2 Motivation and Terminology. 4.3 Related Work. 4.4 Internet Services and Technology Choices. 4.5 Pricing Models. 4.6 ISP Cost Models. 4.7 Charging Support Systems. 4.8 Business Model Aspects. 4.9 Summary and Conclusions. 5 IP Security (Mostafa Hashem Sherif). 5.1 Introduction. 5.2 Security of Telecommunications Services. 5.3 Security Objectives. 5.4 OSI Model for Cryptographic Security. 5.5 Message Confidentiality. 5.6 Data Integrity. 5.7 Identification of Participants. 5.8 Authentication of Participants. 5.9 Access Control. 5.10 Nonrepudiation. 5.11 Secure Management of Cryptographic Keys. 5.12 Exchange of Secret Keys: Kerberos. 5.13 Exchange of Public Keys. 5.14 Certificate Management. 5.15 Applications for Network Management. 5.16 Encryption Cracks. 5.17 Summary. Appendix I: Areas Related to Security Policies. Appendix II: Principles of Symmetric Encryption. Appendix III: Principles of Public Key Encryption. Appendix IV: Principles of the Digital Signature Algorithm. 6 The Future Optical Internet: Integration of Optical and IP Technologies (Andrea Fumagalli, Javier Aracil, and Luca Valcarenghi). 6.1 Introduction. 6.2 Optical Network Technologies. 6.3 Protocol Architectures, Signaling and Framing Techniques for the Optical Internet. 6.4 Traffic Engineering in the Optical Internet. 6.5 Open Challenges. Acronyms. Index.

Read more less

Book SynopsisThis book offers comprehensive coverage of wireless networks and mobile computing with an emphasis on computer science and system considerations rather than devices. It offers detailed, practical discussion of topics such as cellular networks, channel assignment, queuing, power optimization, and more.Trade Review"Each of this handbook's 28 chapters features a self-contained compendium of the state-of-the-art or practice of a wireless or mobile networking research topic." (Choice, July 2002)Table of ContentsContributors. Preface. 1. Handoff in Wireless Mobile Networks (Q. An Zeng & D. Agrawal). 2. Location Management in Cellular Networks (J. Zhang). 3. Heuristics for Solving Fixed-Channel Assignment Problems (H. Sandalidis & P. Stavroulakis). 4. Channel Assignment and Graph Multicoloring (L. Narayanan). 5. Channel Assignment and Graph Labeling (J. Janssen). 6. Wireless Media Access Control (A. Myers & S. Basagni). 7. Traffic Integration in Personal, Local, and Geographical Wireless Networks(R. Bruno, et al.). 8. Fair Scheduling in Wireless Packet Data Networks (T. Nandagopal & X. Gao). 9. Randomized Initialization protocols for Radio Networks (K. Nakano & S. Olariu). 10. Leader Election Protocols for Radio Networks (K. Nakano & S. Olariu). 11. Data Broadcast (J. Xu, et al.). 12. Ensemble Planning for Digital Audio Broadcasting (A. Gräf & T. McKenney). 13. Transport over Wireless Networks (H. Hsieh & R. Sivakumar). 14. Security and Fraud Detection in Mobile and Wireless Networks (A. Boukerche). 15. Mobile Ad Hoc Networks (S. Giordano). 16. Broadcast Scheduling for TDMA in Wireless Multihop Networks (E. Lloyd). 17. Mobile Ad Hoc Networks and Routing Protocols (Y. Tseng, et al.). 18. Routing with Guaranteed Delivery in Geometric and Wireless Networks (J. Urrutia). 19. Power Optimization in Routing Protocols for Wireless and Mobile Networks (S. Lindsey, et al.). 20. Dominating-Set-Based Routing in Ad Hoc Wireless Networks (J. Wu). 21. Location Updates for Efficient Routing in Ad Hoc Networks (I. Stojmenovi). 22. Topological Design, Routing, and Handover in Satellite Networks (A. Ferreira, et al.). 23. Multicasting: From Fixed Networks to Ad Hoc Networks (T. Kunz). 24. Broadcasting in Radio Networks (A. Pelc). 25. Mobile IP Protocols (C. Douligeris & T. Vasilakos). 26. Data Management in Wireless Mobile Environments (S. Gupta & P. Srimani). 27. Mobile, Distributed and Pervasive Computing (M. Barbeau). 28. Indoor Wireless Environments (L. Ramachandran). Index.

Read more less

Book SynopsisDivided into three parts, this work provides an introduction to the theory of distributed computing. It covers the fundamental models, issues, and techniques. It is organized around key simulations in distributed computing, and their applications.Trade Review"This is a second edition of a well-received graduate course textbook dealing with the important field of distributed computing." (Computing Reviews.com, May 10, 2006) "...the authors take readers through these notoriously difficult subjects and ably demystify puzzling buzzwords…" (IEEE Distributed Systems Online, March 2005) "The authors present the fundamental issues underlying the design of distributed systems…as well as fundamental algorithmic concepts and lower-bound techniques." (IEEE Computer Magazine, October 2004)Table of Contents1. Introduction. PART I: FUNDAMENTALS. 2. Basic Algorithms in Message-Passing Systems. 3. Leader Election in Rings. 4. Mutual Exclusion in Shared Memory. 5. Fault-Tolerant Consensus. 6. Causality and Time. PART II: SIMULATIONS. 7. A Formal Model for Simulations. 8. Broadcast and Multicast. 9. Distributed Shared Memory. 10. Fault-Tolerant Simulations of Read/Write Objects. 11. Simulating Synchrony. 12. Improving the Fault Tolerance of Algorithms. 13. Fault-Tolerant Clock Synchronization. PART III: ADVANCED TOPICS. 14. Randomization. 15. Wait-Free Simulations of Arbitrary Objects. 16. Problems Solvable in Asynchronous Systems. 17. Solving Consensus in Eventually Stable Systems. References. Index.

Read more less

Book SynopsisThis work covers the evaluation of the performance of computer communication systems. It covers developments in computer performability, bringing together two subjects that have been treated separately in different communities, namely computer and communication system performance evaluation.Trade Review"...examines various computer techniques for analyzing computing performance in the presence of failures." (SciTech Book News, Vol. 25, No. 3, September 2001)Table of ContentsContributing Authors. Foreword. Preface. Introduction. Queues with Breakdowns. The Uniformization Method in Performability Analysis. Closed-Form Solutions for Performability. Markov-Reward Models and Hyperbolic Systems. Monotonicity and Error Bound Results. The Task Completion Time in Degradable Systems. Rare Event Simulation. Specification and Construction of Performability Models. A Survey of Performability Modelling Tools. Bibliography. Concise Glossary. Index.

Read more less

Book SynopsisThis text tackles the economic, social, and political issues that electronic commerce raises from interdisciplinary and international perspectives. It presents information for those wanting the background of e-commerce, and gives case studies related to specific services making use of e-commerce.Table of ContentsList of Contributors vii Preface and Acknowledgements ix Introduction E-Commerce Definition, Dimensions and Constraints xiThomas R. Leinbach and Stanley D. Brunn Part 1 E-commerce: Meaning, Theory, and Impacts Chapter 1 Emergence of the Digital Economy and E-Commerce 3Thomas R. Leinbach Chapter 2 Towards an Economics of the Internet and E-Commerce 27Kenneth Button and Samantha Taylor Chapter 3 Beyond Transaction Costs: E-Commerce and the Power of the Internet Dataspace 45Martin Kenney and James Curry Chapter 4 Towards a Location Theory of Distributed Computing and E-Commerce 67Michael F. Goodchild Chapter 5 Maybe the Death of Distance, but not the End of Geography: the Internet as a Network 87Edward J. Malecki and Sean P. Gorman Part II E-Commerce in Firm, Regional, and International Context Chapter 6 The Information Society, Japanese Style: Corner Stores as Hubs for E-Commerce Access 109Yuko Aoyama Chapter 7 Internet Economics and the Outline Recruiting Industry 129Sharon Cobb Chapter 8 Grounding Global Flows: Constructing an E-Commerce Hub in Singapore 145Neil M. Coe and Henry Wai-chung Yeung Chapter 9 Finding the Source of Amazon.com: Examining the Store with the ‘Earth’s Biggest Selection’Martin Dodge Chapter 10 Electronic Banking and the City System in the Netherlands 181Marina van Geenhuizen and Peter Nijkamp Chapter 11 Global Electronic Spaces: Singapore’s Role in the Foreign Exchange Market in the Asia Pacific Region 203John Langdale Part III E-commerce: Financial, Legal, and State Dimensions Chapter 12 The Currency of Currency: Speed, Sovereignty, and Electronic Finance 223Barney Warf and Darren Purcell Chapter 13 Information and Communication Technologies and the Integration of European Derivatives Markets 241Dominic Power Chapter 14 ‘Dry Counties’ in Cyberspace: Governance and Enforcement without Geographic Borders 257Priscilla M. Regan Chapter 15 Dot com Development: Are IT Lines Better than Tractors? 277Mark I. Wilson Chapter 16 Corporate Nations: The Emergence of New sovereignties 293Thomas M. Edwards References 315 Index 345

Read more less

Book SynopsisHow to use LANs to help your company grow A vital component of today's business, Local Area Networks (LANs) alloworganizations to link their computers together for maximum work sharing,collaboration among geographically disparate teams, and other essential businessfunctions. This book helps system administrators and IT professionals set upLANs and Intranets in a way that will contribute to their company's growth andsuccess. Beginning with the theoretical foundation for LAN operation and design,it covers the applicable data communications principles, then goes on to exploreboth LAN hardware and infrastructure design, network operating systems, LANmanagement and security. The book also gives a practical introduction to theworld's most popular network operating systemsWindows 2000, NovellNetWare, and Linux. Finally, the book takes an in-depth look at business and management issues, with special emphasis given to the impact of Intranets onbusiness goals.Table of ContentsPreface xiii Objectives xiii Structure of the book xiv Target readers xiv Long distance learning xv Thanks xv Chapter 1 - introduction 1 Terminology 2 History 3 Mainframe/minicomputers and networks 3 Microcomputers and local area networks 4 Local area networks, Ethernet and internet 4 Classification of local area networks 5 Local area network (LAN) 5 Metropolitan area network (MAN) 5 Wide are network (WAN) 5 WANs and the Internet 6 Intranets 6 Why local area networks? 7 Resource sharing 7 Communication and cooperation 7 Security 8 Costs 8 The life cycle of the local area network 8 Analysis 9 Design 10 Implementation 10 Integration and system testing 11 Operation and maintenance 11 Conclusion 11 Part 1 Chapter 2 - Data communication in local area networks 13 Models for communication 14 A layered model 17 Communication tasks 18 OSI 22 TCP/IP 28 Conclusion 34 Media and Physical layers 34 Media 34 Topology 37 Point-to-point or star topology 37 Bus or tree topology 38 Ring topology 39 Hubs and switches 39 The telephone network and modems 40 DTE – DCE 41 Types of connection 41 Capacities 42 Fields of application 42 How a modem works 42 Serial interface and standards 44 Flow control 45 Error correction 46 Compression 47 Command set 47 Null modem 48 ISDN 48 ADSL 50 UMTS 51 Access methods 51 Contest (CSMA/CD) 51 Token passing 53 Local area network standards 53 IEEE 802.2 LLC – Logical Ling Control 55 IEEE 802.x MAC – Medium Access Control 55 FDDI – Fiber Distributed Data Interface 61 ATM 63 IP networks 65 The protocols 68 IP addresses 69 IP datagram format 72 Assigning IP numbers in local area networks 75 IP routing 76 Transport layer in the TCP/IP suite 82 TCP – Transmission Control Protocol 86 TCP protocol details 90 UDP – User datagram Protocol 95 Application in TCP/IP networks 97 SMTP Simple mail Transfer Protocol 97 HTTP – Hypertext Transfer protocol 99 DNS – Domain Name System 100 Encryption and security 103 Traditional encryption algorithms 104 Encryption with public and private keys 106 PCP encryption 107 Part 2 Chapter 3 - Hardware in a local area network 111 Servers 112 File applications 113 SCSI 115 Hard disks 121 Buses 124 Memory (RAM) 128 Motherboards 132 Processor 134 Chipset 138 Case 139 Hardware for backup copying 141 Magnetic tape 142 Other media 143 Network interface cards 143 Introduction 143 Arhilecture 144 Examples of network card setup and installation 148 Workstations 150 Homogenus networks 150 Diskless workstations 150 Other factors 15I Cables 151 Twisted-pair cables 152 Coaxial cables 155 Wireless networks 158 Conclusion 158 Exercises 159 Chapter 4 - Designing local area networks 161 Introduction 162 Topology 162 Bus 155 Ring 165 Star 167 Segments [Ethernet] 168 Traditional interconnection components 169 Repeaters 169 The 5-4-3 rule for connecting segments 170 Bridges 170 Routers 173 Switch technology 175 Mode of Operations 177 Type of switch 178 Port switching and segment switching 180 Combined speed 181 Structured cabling 182 Cabling and patch panel 183 Hubs 185 Wireless networks 187 Speed Spectrum transfer 188 Infrared transfer 188 VLAN 189 Routing between VLANs 193 Paperwork and documentation 194 Two strategies 195 Negotiation of contract 196 Support and maintenance 197 Level of support agreements 198 Installation 199 Documentation 199 Planning of location 199 Building regulations 202 Summary 202 Exercises 203 Part 3 Chapter 5 - Local area network operating system 205 Introduction 205 Peer-to-peer network 207 Functions and responsibility 208 I/O optimisation 208 Fault tolerance 212 Multiple processing and time sharing 220 Print spooler 222 Logical and physical printing 222 “The running” of network printing 223 Current network operating systems 223 Banyan VINES 224 LANtastic 224 OS/2 Warp Server 225 Summary 225 Exercises 227 Chapter 6 - Management and security 229 Introduction 229 Deciding security levels 230 Printing environment 232 Printing opportunities 232 Printer driver 239 A society of users 239 Groups 241 Physical security 243 Logical security 245 Backup 248 The need for backup 248 Wheel are the consequences? 249 Static and dynamic data 250 Full/incremental/differential backup 250 Backup routine 251 Recouvery 255 Firewalls 256 Disaster planning 257 Summary 257 Exercises 259 Chapter 7 - Novell netware 261 Versions 261 NetWare 252 NetWare 4 262 IntranetWare 264 NetWare 5 265 GroupWise 268 ManageWise 269 NDS - Novell Directory Services 269 What is NDS? 270 Object orientation 271 Object types 273 Leaf objects 274 Novell file system 275 Volumes and folders 275 System fault tolerance 276 SFT Level I 276 SFT Level II 277 SKV level III 278 The order of login script 280 Novell NetWare security 281 Login security 281 Trustees 284 Novell NDS security 293 Printing Environment in Novell NetWare 298 Queue-based printing environment 298 NDPS – Novell Distributed Print Services 302 Managing/maintenance of printing (NDPS) 304 Summary 306 Exercises 307 Chapter 8 - Windows 2000 309 Introduction 309 History/versions 310 Windows 310 Windows 95/98 311 Windows Me (Millennium edition) 312 Windows NT 313 Windows 2000 314 Windows 2000 Professional 315 Hardware requirements 316 Administrator user on workstation 317 Password administration 317 Windows 2000 server 317 Hardware requirements 318 Installation 318 Connecting workstations in. W2K network 320 Workgroups 321 Active directory 322 Important terms 322 Microsoft Management Console MMC 328 Adctive Directory design 327 Object management in Active Directory 330 User administration 331 Groups 327 File security 342 Sharing 342 Folder/file rights 346 Controlling access to AD objects 351 Policies 353 Summary 357 Chapter 9 - linux 361 Introduction 361 History 362 GNU 363 Distributors 364 LINUX structure 365 Installation [RedHat LINUX) on PC 366 Preparations 367 Installation alternatives 368 The file system and. Partitioning 369 LILO Bootmanager 371 Startup 371 Simple UNIX 371 Users and groups 371 Files and rights 373 Useful commands 375 Process handling 376 Shell programming 376 Printing environment in Linux 377 System administration 379 Graphical user interface 380 X-windows 380 Window manager 381 FVWM2 381 WindowMaker 381 Enlightment 381 Libraries 382 GNOME 382 KDE 382 Applications under Linux 383 Xterm 383 Text editors 383 Emacs 384 Pico 384 Word processing 384 Staroffice 384 WordPerfect 385 Other applications 386 Development tools 386 LINUX in networks 386 TCP/IP 386 Platform for services 386 Summary 388 Exercises 389 Part 4 Chapter 10 - Management philosophy and standards for network administration 391 Introduction 391 The fire fighting management method 391 The fire fighting approach 393 Preventive management 396 The good circle 397 Capacity planning 398 System tuning 399 Examples of tools of preventive management 401 Preventive or fire fighting? 436 Standards for network administration 407 MIB 408 SNMP 410 RMON 411 Summary 413 Exercises 414 Chapter 11 - intranet 415 Introduction 415 Intranet services 417 Conveying messages and e-mail 417 Conference system 417 Videoconferences 420 Sharing information 422 Spreading information 422 Implementing an intranet 426 Planning, planning and planning 426 Intranet tools 427 Maintenance and management 429 Summary 437 Exercises 438 Index 439

Read more less

Book SynopsisA much--needed guide on how to apply patterns in user interface design While the subject of design patterns for software development has been covered extensively, little has been written about the power of the pattern format in interface design.Table of ContentsPreface. Series Foreword. Acknowledgements. Introduction. Design Pattern Languages. An Interdisciplinary Pattern Framework. A Pattern Language for Interactive Music Exhibits. Evaluation and Tool Support. Summary and Further Research. Bibliography. Appendix A: Online Resources. Appendix B: WorldBeat Sample Run. List of Figures and Credits. Index.

Read more less

Book SynopsisDigital Communication Receivers Synchronization, Channel Estimation, and Signal Processing Digital Communication Receivers offers a complete treatment on the theoretical and practical aspects of synchronization and channel estimation from the standpoint of digital signal processing.Table of ContentsBASIC MATERIAL. Basic Material. BASEBAND COMMUNICATIONS. Baseband Communications. PASSBAND COMMUNICATION OVER TIME INVARIANT CHANNELS. Passband Transmission. Receiver Structure for PAM Signals. Synthesis of Synchronization Algorithms. Performance Analysis of Synchronizers. Bit Error Rate Degradation Caused by Random Tracking Errors. Frequency Estimation. Timing Adjustment by Interpolation. DSP System Implementation. COMMUNICATION OVER FADING CHANNELS. Characterization, Modeling, and Simulation of Linear Fading Channels. Detection and Parameter Synchronization on Fading Channels. Receiver Structures for Fading Channels. Parameter Synchronization for Flat Fading Channels. Parameter Synchronization for Selective Fading Channels. Bibliography. Index.

Read more less