Computer science Books
John Wiley & Sons Inc Search Engine Optimization AllinOne For Dummies
Book SynopsisTable of ContentsIntroduction 1 Book 1: How Search Engines Work 5 Chapter 1: Putting Search Engines in Context 7 Chapter 2: Meeting the Search Engines 23 Chapter 3: Recognizing and Reading Search Results 37 Chapter 4: Getting Your Site to Appear in the Right Results 53 Chapter 5: Knowing What Drives Search Results 77 Chapter 6: Spam Issues: When Search Engines Get Fooled 87 Book 2: Keyword Strategy 101 Chapter 1: Employing Keyword Research Techniques and Tools 103 Chapter 2: Selecting Keywords 113 Chapter 3: Exploiting Pay Per Click Lessons Learned 127 Chapter 4: Assigning Keywords to Pages 135 Chapter 5: Adding and Maintaining Keywords 145 Book 3: Competitive Positioning 155 Chapter 1: Identifying Your Competitors 157 Chapter 2: Competitive Research Techniques and Tools 167 Chapter 3: Applying Collected Data 187 Book 4: SEO Web Design 201 Chapter 1: The Basics of SEO Web Design 203 Chapter 2: Building an SEO-Friendly Site 223 Chapter 3: Page Experience Update 249 Chapter 4: Making Your Page Search Engine Compatible 261 Chapter 5: Perfecting Navigation and Linking Techniques 289 Book 5: Creating Content 303 Chapter 1: Selecting a Style for Your Audience 305 Chapter 2: Establishing Content Depth and Page Length 321 Chapter 3: Adding Keyword-Specific Content 347 Chapter 4: Adapting Your Content for Local Search 363 Chapter 5: Dealing with Duplicate Content 373 Chapter 6: Crediting Your Content 391 Chapter 7: Using SEO to Build Your Brand 403 Book 6: Linking 421 Chapter 1: Employing Linking Strategies 423 Chapter 2: Structuring Internal Links 441 Chapter 3: Obtaining Links 457 Chapter 4: Vetting Inbound Links 479 Chapter 5: Connecting with Social Networks 497 Book 7: Optimizing the Foundations 511 Chapter 1: Server Issues: Why Your Server Matters 513 Chapter 2: Domain Names: What Your URL Says about You 537 Chapter 3: Using Redirects for SEO 555 Chapter 4: Implementing 301 Redirects 563 Chapter 5: Watching Your Backend: Content Management System Troubles 577 Chapter 6: Solving SEO Roadblocks 595 Book 8: Analyzing Results 605 Chapter 1: Employing Site Analytics 607 Chapter 2: Tracking Behavior with Web Analytics 627 Chapter 3: Mastering SEO Tools and Reports 641 Book 9: International SEO 655 Chapter 1: Discovering International Search Engines 657 Chapter 2: Tailoring Your Marketing Message for Asia 671 Chapter 3: Staking a Claim in Europe 683 Chapter 4: Getting Started in Latin America 693 Appendix: The Value of Training 699 Index 715
£24.64
Wolfram Media New Kind of Science
Book Synopsis
£14.20
Hodder Education Cambridge International AS & A Level Computer
Book SynopsisThis title is endorsed by Cambridge Assessment International Education to support the full syllabus for examination from 2021. Develop computational thinking and ensure full coverage of the revised Cambridge Assessment International Education AS & A Level Computer Science syllabus (9618) with this comprehensive Student's Book written by experienced authors and examiners.- Improve understanding with clear explanations, examples, illustrations and diagrams, plus a glossaryof key terms- Reinforce learning with a range of activities, exercises, and exam-style questions- Prepare for further study with extension activities that go beyond the requirements of the syllabus and prompt further investigation about new developments in technology- Follow a structured route through the course with in-depth coverage of the full AS & A Level syllabus- Answers are available online www.hoddereducation.co.uk/cambridgeextras
£46.55
Oxford University Press, USA Physical Computation A Mechanistic Account
Book SynopsisComputation permeates our world, but a satisfactory philosophical theory of what it is has been lacking. Gualtiero Piccinini presents a mechanistic account of what makes a physical system a computing system. He argues that computation does not entail representation or information-processing, although information-processing entails computation.Trade Reviewthe mechanistic account of physical computation is the best that we currently have . . . Physical Computation is eminently readable and well presented, with a clear structure and helpful introduction . . . It provides a thorough . . . introduction to the philosophical issues associated with computation in the physical sense and would serve as a good basis for a postgraduate or upper-level undergraduate course on the subject. Piccinini delivers a comprehensive summary of previous work on physical computation, alongside the definitive presentation of his mechanistic account, and I have no doubt that this book will become a valuable resource for future work on the topic. * Joe Dewhurst, Philosophical Psychology *Table of ContentsAcknowledgements Introduction 1: Towards an Account of Physical Computation 2: Mapping Accounts 3: Semantic Accounts 4: Pancomputationalism 5: From Functional Analysis to Mechanistic Explanation 6: The Ontology of Functional Mechanisms 7: The Mechanistic Account 8: Primitive Components of Computing Mechanisms 9: Complex Components of Computing Mechanisms 10: Digital Calculators 11: Digital Computers 12: Analog Computers 13: Parallel Computers and Neural Networks 14: Information Processing 15: The Bold Physical Church-Turing Thesis 16: The Modest Physical Church-Turing Thesis Epilogue: The Nature of Computation Appendix: Computability Bibliography Index
£31.49
McGraw-Hill Education Mike Meyers CompTIA Network Guide to Managing and
Book SynopsisPractice the Skills Essential for a Successful IT Career 80+ lab exercises challenge you to solve problems based on realistic case studies Step-by-step scenarios require you to think critically Lab Analysis tests measure your understanding of lab results Key Term Quizzes help build your vocabulary Mike Meyersâ CompTIA Network+â Guide to Managing and Troubleshooting Networks Lab Manual, Sixth Edition covers: Network models Cabling and topology Ethernet basics Ethernet standards Installing a physical network TCP/IP basics Routing TCP/IP applications Network naming Securing TCP/IP Switch features IPv6 WAN connectivity Wireless networking Virtualization and cloud computing Data centers Integrating network devices Network operations Protecting your network Network mon
£31.49
CRC Press Interactive Data Visualization
Book SynopsisAn Updated Guide to the Visualization of Data for Designers, Users, and ResearchersInteractive Data Visualization: Foundations, Techniques, and Applications, Second Edition provides all the theory, details, and tools necessary to build visualizations and systems involving the visualization of data. In color throughout, it explains basic terminology and concepts, algorithmic and software engineering issues, and commonly used techniques and high-level algorithms. Full source code is provided for completing implementations. New to the Second Edition New related readings, exercises, and programming projects Better quality figures and numerous new figures New chapter on techniques for time-oriented data This popular book continues to explore the fundamental components of the viTrade ReviewPraise for the First Edition:A 2010 CHOICE Outstanding Academic Title"College-level collections strong in concepts and theory surrounding data visualization will find Interactive Data Visualization: Foundations, Techniques, and Applications to be a powerful addition, covering all the details and tools needed for building visualizations around data. From math and statistical graphs to cartography and scientific displays, this offers plenty of details for creating visual displays of data, offering color illustrations throughout and plenty of refinement details."—The Midwest Book Review, August 2011"With chapters on elaborating on the importance of visualization, understanding the data without it, the relation to the human eyes and mind, what technology has brought in the avenues of displaying and interacting data, no concept is really left untouched. Enhanced with example data, samples, a history of computer graphics, and more, Interactive Data Visualization is a solid text to have on hand for any community or college library collection."—James A. Cox, The Midwest Book Review, August 2010Table of ContentsIntroduction. Data Foundations. Human Perception and Information Processing. Visualization Foundations. Visualization Techniques for Spatial Data. Visualization Techniques for Geospatial Data. Visualization Techniques for Time-Oriented Data. Visualization Techniques for Multivariate Data. Visualization Techniques for Trees, Graphs, and Networks. Text and Document Visualization. Interaction Concepts. Interaction Techniques. Designing Effective Visualizations. Comparing and Evaluating Visualization Techniques. Visualization Systems. Research Directions in Visualization. Appendices. Bibliography. Index.
£42.74
Elsevier Science & Technology Digital Design and Computer Architecture, RISC-V Edition
Book SynopsisTable of Contents1. From Zero to One 2. Combinational Logic Design 3. Sequential Logic Design 4. Hardware Description Languages 5. Digital Building Blocks 6. Architecture 7. Microarchitecture 8. Memory Systems 9. I/O Systems e9. I/O Systems A. Digital System Implementation eA. Digital System Implementation B. ARM Instructions C. C Programming eC. C Programming
£71.09
College Publications Handbook of Paraconsistency
£20.42
Hodder Education OCR AS/A-level Computer Science Workbook 1:
Book SynopsisExam board: OCRLevel: A-levelSubject: Computer ScienceFirst teaching: September 2015First exams: Summer 2017Strengthen your students' understanding and upgrade their confidence and exam skills with our OCR Computer Science workbooks, full of self-contained exercises to consolidate knowledge and exam practice questions to improve performance. Written by an experienced Computer Science author, these full colour workbooks provide stimulus materials on all AS and A-level topics, followed by sets of questions designed to develop and test skills in the unit.· Thoroughly prepares students for their examinations as they work through numerous practice questions that cover every question type in the specification.· Helps students identify their revision needs and see how to target the top grades using online answers for each question.· Encourages ongoing revision throughout the course as students progressively develop their skills in class and at home. · Packed full with consolidation and exam practice questions, these workbooks can save valuable preparation time and expense, with self-contained exercises that don't need photocopying and provide instant lesson and homework solutions for specialist and non-specialist teachers.· Ensures that students feel confident tackling their exams as they know what to expect in each section.
£11.57
McGraw-Hill Education GPEN GIAC Certified Penetration Tester AllinOne
Book SynopsisPublisher's Note: Products purchased from Third Party sellers are not guaranteed by the publisher for quality, authenticity, or access to any online entitlements included with the product.This effective study guide provides 100% coverage of every topic on the GPEN GIAC Penetration Tester examThis effective self-study guide fully prepares you for the Global Information Assurance Certificationâs challenging Penetration Tester exam, which validates advanced IT security skills. The book features exam-focused coverage of penetration testing methodologies, legal issues, and best practices. GPEN GIAC Certified Penetration Tester All-in-One Exam Guide contains useful tips and tricks, real-world examples, and case studies drawn from authorsâ extensive experience. Beyond exam preparation, the book also serves as a valuable on-the-job reference. Covers every topic on the exam, including:Pre-engagement and planning Table of ContentsChapter 1: Penetration Testing FundamentalsChapter 2: Pre-Engagement ActivityChapter 3: Penetration Testing Lab SetupChapter 4: Reconnaissance, Open Source Intelligence (OSINT)Chapter 5: Scanning, Enumerating Targets and VulnerabilitiesChapter 6: Exploiting TargetsChapter 7: Advanced MetasploitChapter 8: Password AttacksChapter 9: Stealing Data, Maintaining Access and PivotingChapter 10: PowerShell for Penetration TestingChapter 11: Web Application HackingChapter 12: Proxies, Crawlers, and SpidersChapter 13: OWASP Top 10Appendix A: Tools Reference
£35.24
John Wiley & Sons Inc Enterprise AI For Dummies
Book SynopsisTable of ContentsIntroduction 1 Part 1: Exploring Practical AI and How It Works 7 Chapter 1: Demystifying Artificial Intelligence 9 Chapter 2: Looking at Uses for Practical AI 29 Chapter 3: Preparing for Practical AI 45 Chapter 4: Implementing Practical AI 63 Part 2: Exploring Vertical Market Applications 81 Chapter 5: Healthcare/HMOs: Streamlining Operations 83 Chapter 6: Biotech/Pharma: Taming the Complexity 91 Chapter 7: Manufacturing: Maximizing Visibility 99 Chapter 8: Oil and Gas: Finding Opportunity in Chaos 111 Chapter 9: Government and Nonprofits: Doing Well by Doing Good 119 Chapter 10: Utilities: Renewing the Business 133 Chapter 11: Banking and Financial Services: Making It Personal 141 Chapter 12: Retail: Reading the Customer’s Mind 149 Chapter 13: Transportation and Travel: Tuning Up Your Ride 157 Chapter 14: Telecommunications: Connecting with Your Customers 167 Chapter 15: Legal Services: Cutting Through the Red Tape 173 Chapter 16: Professional Services: Increasing Value to the Customer 181 Chapter 17: Media and Entertainment: Beating the Gold Rush 189 Part 3: Exploring Horizontal Market Applications 197 Chapter 18: Voice of the Customer/Citizen: Finding Coherence in the Cacophony 199 Chapter 19: Asset Performance Optimization: Increasing Value by Extending Lifespans 207 Chapter 20: Intelligent Recommendations: Getting Personal 217 Chapter 21: Content Management: Finding What You Want, When You Want It 231 Chapter 22: AI-Enhanced Content Capture: Gathering All Your Eggs into the Same Basket 239 Chapter 23: Regulatory Compliance and Legal Risk Reduction: Hitting the Bullseye On a Moving Target 249 Chapter 24: Knowledge Assistants and Chatbots: Monetizing the Needle in the Haystack 265 Chapter 25: AI-Enhanced Security: Staying Ahead by Watching Your Back 275 Part 4: The Part of Tens 287 Chapter 26: Ten Ways AI Will Influence the Next Decade 289 Chapter 27: Ten Reasons Why AI Is Not a Panacea 297 Index 313
£22.94
John Wiley & Sons Inc Design and Analysis of Distributed Algorithms 56
Book SynopsisThis text is based on a simple and fully reactive computational model that allows for intuitive comprehension and logical designs. The principles and techniques presented can be applied to any distributed computing environment (e.g. , distributed systems, communication networks, data networks, grid networks, internet, etc.).Table of ContentsPreface. 1. Distributed Computing Environments. 1.1 Entities. 1.2 Communication. 1.3 Axioms and Restrictions. 1.3.1 Axioms. 1.3.2 Restrictions. 1.4 Cost and Complexity. 1.4.1 Amount of Communication Activities. 1.4.2 Time. 1.5 An Example: Broadcasting. 1.6 States and Events. 1.6.1 Time and Events. 1.6.2 States and Configurations. 1.7 Problems and Solutions (*). 1.8 Knowledge. 1.8.1 Levels of Knowledge. 1.8.2 Types of Knowledge. 1.9 Technical Considerations. 1.9.1 Messages. 1.9.2 Protocol. 1.9.3 Communication Mechanism. 1.10 Summary of Definitions. 1.11 Bibliographical Notes. 1.12 Exercises, Problems, and Answers. 1.12.1 Exercises and Problems. 1.12.2 Answers to Exercises. 2. Basic Problems And Protocols. 2.1 Broadcast. 2.1.1 The Problem. 2.1.2 Cost of Broadcasting. 2.1.3 Broadcasting in Special Networks. 2.2 Wake-Up. 2.2.1 Generic Wake-Up. 2.2.2 Wake-Up in Special Networks. 2.3 Traversal. 2.3.1 Depth-First Traversal. 2.3.2 Hacking (*). 2.3.3 Traversal in Special Networks. 2.3.4 Considerations on Traversal. 2.4 Practical Implications: Use a Subnet. 2.5 Constructing a Spanning Tree. 2.5.1 SPT Construction with a Single Initiator: Shout. 2.5.2 Other SPT Constructions with Single Initiator. 2.5.3 Considerations on the Constructed Tree. 2.5.4 Application: Better Traversal. 2.5.5 Spanning-Tree Construction with Multiple Initiators. 2.5.6 Impossibility Result. 2.5.7 SPT with Initial Distinct Values. 2.6 Computations in Trees. 2.6.1 Saturation: A Basic Technique. 2.6.2 Minimum Finding. 2.6.3 Distributed Function Evaluation. 2.6.4 Finding Eccentricities. 2.6.5 Center Finding. 2.6.6 Other Computations. 2.6.7 Computing in Rooted Trees. 2.7 Summary. 2.7.1 Summary of Problems. 2.7.2 Summary of Techniques. 2.8 Bibliographical Notes. 2.9 Exercises, Problems, and Answers. 2.9.1 Exercises. 2.9.2 Problems. 2.9.3 Answers to Exercises. 3. Election. 3.1 Introduction. 3.1.1 Impossibility Result. 3.1.2 Additional Restrictions. 3.1.3 Solution Strategies. 3.2 Election in Trees. 3.3 Election in Rings. 3.3.1 All the Way. 3.3.2 As Far As It Can. 3.3.3 Controlled Distance. 3.3.4 Electoral Stages. 3.3.5 Stages with Feedback. 3.3.6 Alternating Steps. 3.3.7 Unidirectional Protocols. 3.3.8 Limits to Improvements (*). 3.3.9 Summary and Lessons. 3.4 Election in Mesh Networks. 3.4.1 Meshes. 3.4.2 Tori. 3.5 Election in Cube Networks. 3.5.1 Oriented Hypercubes. 3.5.2 Unoriented Hypercubes. 3.6 Election in Complete Networks. 3.6.1 Stages and Territory. 3.6.2 Surprising Limitation. 3.6.3 Harvesting the Communication Power. 3.7 Election in Chordal Rings (*). 3.7.1 Chordal Rings. 3.7.2 Lower Bounds. 3.8 Universal Election Protocols. 3.8.1 Mega-Merger. 3.8.2 Analysis of Mega-Merger. 3.8.3 YO-YO. 3.8.4 Lower Bounds and Equivalences. 3.9 Bibliographical Notes. 3.10 Exercises, Problems, and Answers. 3.10.1 Exercises. 3.10.2 Problems. 3.10.3 Answers to Exercises. 4. Message Routing and Shortest Paths. 4.1 Introduction. 4.2 Shortest Path Routing. 4.2.1 Gossiping the Network Maps. 4.2.2 Iterative Construction of Routing Tables. 4.2.3 Constructing Shortest-Path Spanning Tree. 4.2.4 Constructing All-Pairs Shortest Paths. 4.2.5 Min-Hop Routing. 4.2.6 Suboptimal Solutions: Routing Trees. 4.3 Coping with Changes. 4.3.1 Adaptive Routing. 4.3.2 Fault-Tolerant Tables. 4.3.3 On Correctness and Guarantees. 4.4 Routing in Static Systems: Compact Tables. 4.4.1 The Size of Routing Tables. 4.4.2 Interval Routing. 4.5 Bibliographical Notes. 4.6 Exercises, Problems, and Answers. 4.6.1 Exercises. 4.6.2 Problems. 4.6.3 Answers to Exercises. 5. Distributed Set Operations. 5.1 Introduction. 5.2 Distributed Selection. 5.2.1 Order Statistics. 5.2.2 Selection in a Small Data Set. 5.2.3 Simple Case: Selection Among Two Sites. 5.2.4 General Selection Strategy: RankSelect. 5.2.5 Reducing the Worst Case: ReduceSelect. 5.3 Sorting a Distributed Set. 5.3.1 Distributed Sorting. 5.3.2 Special Case: Sorting on a Ordered Line. 5.3.3 Removing the Topological Constraints: Complete Graph. 5.3.4 Basic Limitations. 5.3.5 Efficient Sorting: SelectSort. 5.3.6 Unrestricted Sorting. 5.4 Distributed Sets Operations. 5.4.1 Operations on Distributed Sets. 5.4.2 Local Structure. 5.4.3 Local Evaluation (*). 5.4.4 Global Evaluation. 5.4.5 Operational Costs. 5.5 Bibliographical Notes. 5.6 Exercises, Problems, and Answers. 5.6.1 Exercises. 5.6.2 Problems. 5.6.3 Answers to Exercises. 6. Synchronous Computations. 6.1 Synchronous Distributed Computing. 6.1.1 Fully Synchronous Systems. 6.1.2 Clocks and Unit of Time. 6.1.3 Communication Delays and Size of Messages. 6.1.4 On the Unique Nature of Synchronous Computations. 6.1.5 The Cost of Synchronous Protocols. 6.2 Communicators, Pipeline, and Transformers. 6.2.1 Two-Party Communication. 6.2.2 Pipeline. 6.2.3 Transformers. 6.3 Min-Finding and Election: Waiting and Guessing. 6.3.1 Waiting. 6.3.2 Guessing. 6.3.3 Double Wait: Integrating Waiting and Guessing. 6.4 Synchronization Problems: Reset, Unison, and Firing Squad. 6.4.1 Reset /Wake-up. 6.4.2 Unison. 6.4.3 Firing Squad. 6.5 Bibliographical Notes. 6.6 Exercises, Problems, and Answers. 6.6.1 Exercises. 6.6.2 Problems. 6.6.3 Answers to Exercises. 7. Computing in Presence of Faults. 7.1 Introduction. 7.1.1 Faults and Failures. 7.1.2 Modelling Faults. 7.1.3 Topological Factors. 7.1.4 Fault Tolerance, Agreement, and Common Knowledge. 7.2 The Crushing Impact of Failures. 7.2.1 Node Failures: Single-Fault Disaster. 7.2.2 Consequences of the Single Fault Disaster. 7.3 Localized Entity Failures: Using Synchrony. 7.3.1 Synchronous Consensus with Crash Failures. 7.3.2 Synchronous Consensus with Byzantine Failures. 7.3.3 Limit to Number of Byzantine Entities for Agreement. 7.3.4 From Boolean to General Byzantine Agreement. 7.3.5 Byzantine Agreement in Arbitrary Graphs. 7.4 Localized Entity Failures: Using Randomization. 7.4.1 Random Actions and Coin Flips. 7.4.2 Randomized Asynchronous Consensus: Crash Failures. 7.4.3 Concluding Remarks. 7.5 Localized Entity Failures: Using Fault Detection. 7.5.1 Failure Detectors and Their Properties. 7.5.2 The Weakest Failure Detector. 7.6 Localized Entity Failures: Pre-Execution Failures. 7.6.1 Partial Reliability. 7.6.2 Example: Election in Complete Network. 7.7 Localized Link Failures. 7.7.1 A Tale of Two Synchronous Generals. 7.7.2 Computing With Faulty Links. 7.7.3 Concluding Remarks. 7.7.4 Considerations on Localized Entity Failures. 7.8 Ubiquitous Faults. 7.8.1 Communication Faults and Agreement. 7.8.2 Limits to Number of Ubiquitous Faults for Majority. 7.8.3 Unanimity in Spite of Ubiquitous Faults. 7.8.4 Tightness. 7.9 Bibliographical Notes. 7.10 Exercises, Problems, and Answers. 7.10.1 Exercises. 7.10.2 Problems. 7.10.3 Answers to Exercises. 8. Detecting Stable Properties. 8.1 Introduction. 8.2 Deadlock Detection. 8.2.1 Deadlock. 8.2.2 Detecting Deadlock: Wait-for Graph. 8.2.3 Single-Request Systems. 8.2.4 Multiple-Requests Systems. 8.2.5 Dynamic Wait-for Graphs. 8.2.6 Other Requests Systems. 8.3 Global Termination Detection. 8.3.1 A Simple Solution: Repeated Termination Queries. 8.3.2 Improved Protocols: Shrink. 8.3.3 Concluding Remarks. 8.4 Global Stable Property Detection. 8.4.1 General Strategy. 8.4.2 Time Cuts and Consistent Snapshots. 8.4.3 Computing A Consistent Snapshot. 8.4.4 Summary: Putting All Together. 8.5 Bibliographical Notes. 8.6 Exercises, Problems, and Answers. 8.6.1 Exercises. 8.6.2 Problems. 8.6.3 Answers to Exercises. 9. Continuous Computations. 9.1 Introduction. 9.2 Keeping Virtual Time. 9.2.1 Virtual Time and Causal Order. 9.2.2 Causal Order: Counter Clocks. 9.2.3 Complete Causal Order: Vector Clocks. 9.2.4 Concluding Remarks. 9.3 Distributed Mutual Exclusion. 9.3.1 The Problem. 9.3.2 A Simple And Efficient Solution. 9.3.3 Traversing the Network. 9.3.4 Managing a Distributed Queue. 9.3.5 Decentralized Permissions. 9.3.6 Mutual Exclusion in Complete Graphs: Quorum. 9.3.7 Concluding Remarks. 9.4 Deadlock: System Detection and Resolution. 9.4.1 System Detection and Resolution. 9.4.2 Detection and Resolution in Single-Request Systems. 9.4.3 Detection and Resolution in Multiple-Requests Systems. 9.5 Bibliographical Notes. 9.6 Exercises, Problems, and Answers. 9.6.1 Exercises. 9.6.2 Problems. 9.6.3 Answers to Exercises. Index.
£147.56
HarperCollins Publishers Shinoy and the Chaos Crew The Day of the
Book SynopsisCollins Big Cat supports every primary child on their reading journey from phonics to fluency. Top authors and illustrators have created fiction and non-fiction books that children love to read. Book banded for guided and independent reading, there are reading notes in the back, comprehensive teaching and assessment support and ebooks available.When Shinoy downloads the Chaos Crew app on his phone, a glitch in the system gives him the power to summon his TV heroes into his world. With the team on board, Shinoy can figure out what dastardly plans S.N.A.I.R. has come up with, and save the day.Location: Flat Hill shopping centreOperative: Super-strong SalamaMission: Investigate the UFOs hovering over Flat Hill, and the monsters rampaging through the town.This exciting title is part of the Shinoy and the Chaos Crew series by Chris Callaghan.Gold/Band 9 books offer developing readers literary language and stories with distinctive characters.Ideas for reading in the back of the book provide
£9.53
HarperCollins Publishers OCR GCSE 91 Computer Science Revision Cards
Book SynopsisExam Board: OCRLevel: GCSE Grade 9-1Subject: Computer ScienceSuitable for the 2025 examsIdeal GCSE grade 9-1 practice in handy revision cardsWhat can you remember? Test your OCR GCSE 9-1 Computer Science knowledge!Revise, practise and test yourself on every topic. Mix them up to revise and test yourself on the go.Suitable for the 2016 and 2020 specification 100 topic-based GCSE revision cards How to Use cards include revision tips and games Revise cards: recap key facts Memorise cards: learn important terms and definitions Test cards: quick-fire questionsTrade Review“Generally excellent. Attractive layout, clear and easy to access. There is necessary focus on exam skills, but presented in an interesting, step-by-step format.” Susan Stirrup, King’s Ely “I like the clear layout, especially the spacing of the questions – it is very accessible.” Fiona Hall, Sheringham High School “Colourful and informative.” Jane Hamilton, Alsager School
£11.57
HarperCollins UK International Primary Computing Students Book
Book Synopsis
£12.99
HarperCollins UK International Primary Computing Teachers Guide
Book Synopsis
£47.50
HarperCollins Publishers International Lower Secondary Computing Students
Book Synopsis
£16.99
McGraw-Hill Education - Europe Schaums Outline of Programming with C
Book SynopsisTough Test Questions? Missed Lectures? Not Enough Time?Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills. This Schaum's Outline gives you Practice problems with full explanations that reinforce knowledge Coverage of the most up-to-date developments in your course field In-depth review of practices and applications Fully compatible with your classroom text, Schaum's highlights all the important facts you need to know. Use Schaum's to shorten your study time-and get your best test scores!Schaum's Outlines-Problem Solved.Table of ContentsChapter 1: Elementary C++ Programming. Chapter 2: Fundamental Types. Chapter 3: Selection. Chapter 4: Iteration. Chapter 5: Functions. Chapter 6: Arrays. Chapter 7: Pointers and References. Chapter 8: C-Strings. Chapter 9: Standard C++ Strings. Chapter 10: Classes. Chapter 11: Overloading Operators. Chapter 12: Composition and Inheritance. Chapter 13: Templates and Iterators. Chapter 14: Standard C++ Vectors. Chapter 15: Container Classes. Appendices: A: Character Codes. B: Standard C++ Keywords. C: Standard C++ Operators. D: Standard C++ Container Classes. E: Standard C++ Generic Algorithms. F: The Standard C Library. G: Hexadecimal Numbers. H: References.
£26.39
McGraw-Hill Education - Europe Schaums Outline of Principles of Computer Science
Book SynopsisLearn the essentials of computer scienceSchaumâs Outline of Principles of Computer Science provides aconcise overview of the theoretical foundation of computerscience. It also includes focused review of object-oriented programming using Java.Table of ContentsChapter 1. Introduction to Computer ScienceChapter 2. AlgorithmsChapter 3. Computer OrganizationChapter 4. SoftwareChapter 5. Programming in JavaChapter 6. Operating SystemsChapter 7. NetworkingChapter 8. DatabaseChapter 9. Social IssuesAppendix: Answers to Review QuestionsIndex
£21.24
McGraw-Hill Education - Europe TCPIP Protocol Suite
Book SynopsisIn a world where the number of people who need to learn about data communications and networking is exploding, Forouzan's book is the answer. The book's visual approach makes it easy for students to learn about and understand the concepts involved in this rapidly developing field.TCP/IP Protocol Suite teaches students and professionals, with no prior knowledge of TCP/IP everything they need to know about the subject. This comprehensive book uses hundreds of figures to make technical concepts easy to grasp as well as many examples which help tie the material to the real-world. The fourth edition of TCP/IP Protocol Suite has been fully updated to include all of the recent technology changes in the field. Additionally, out-of-date material has been overhauled to reflect recent changes in technology.Table of ContentsPart 1 Introduction and Underlying Technologies1 Introduction2 The OSI Model and the TCP/IP Protocol Suite3 Underlying TechnologiesPart 2 Network Layer4 Introduction to Network Layer5 IPv4 Addresses6 Delivery and Forwarding, of IP Packets7 Internet Protocol Version 4 (IPv4)8 Address Resolution Protocol (ARP)9 Internet Control Message Protocol Version 4 (ICMPv4)10 Mobile IP11 Unicast Routing Protocols (RIP, OSPF, and BGP)12 Multicasting and Multicast Routing ProtocolsPart 3 Transport Layer13 Introduction to the Transport Layer14 User Datagram Protocol (UDP)15 Transmission Control Protocol (TCP)16 Stream Control Transmission Protocol (SCTP)Part 4 Application Layer17 Introduction to the Application Layer18 Host Configuration: DHCP19 Domain Name System (DNS)20 Remote Login: TELNET and SSH21 File Transfer: FTP and TFTP22 World Wide Web and HTTP23 Electronic Mail: SMTP, POP, IMAP, and MIME24 Network Management: SNMP25 MultimediaPart 5 Next Generation26 IPv6 Addressing27 IPv6 Protocol28 ICMPv6Part 6 Security29 Cryptography and Network Security30 Internet SecurityPart 7 AppendicesAppendix A UnicodeAppendix B Positional Numbering SystemsAppendix C Error Detection CodesAppendix D ChecksumAppendix E HTML, XHTML, XML,and XSL Appendix F Client-Server Programming in JavaAppendix G Miscellaneous Information
£204.33
McGraw-Hill Education - Europe ObjectOriented and Classical Software Engineering
Book SynopsisBuilding on seven strong editions, the eighth edition maintains the organization and approach for which Object-Oriented and Classical Software Engineering is known while making significant improvements and additions to content as well as problems and projects. The revisions for the eighth edition make the text easier to use in a one-semester course.Integrating case studies to show the object oriented approach to software engineering, Object-Oriented and Classical Software Engineering, 8/e presents an excellent introduction to software engineering fundamentals, covering both traditional and object-oriented techniques. While maintaining a unique organization with Part I covering underlying software engineering theory, and Part II presenting the more practical life cycle, the eighth edition includes significant revision to problems, new content, as well as a new chapter to enable instructors to better-utilize the book in a one-semester course. ComplementiTable of ContentsPart I: Introduction to Software EngineeringChapter 1: The Scope of Software EngineeringChapter 2: Software Life-Cycle ModelsChapter 3: The Software ProcessChapter 4: TeamsChapter 5: The Tools of the TradeChapter 6: TestingChapter 7: From Modules to ObjectsChapter 8: Reusability and PortabilityChapter 9: Planning and EstimatingPart II: The Workflows of the Software Life CycleChapter 10: Key Material from Part AChapter 11: RequirementsChapter 12: Classical AnalysisChapter 13: Object-Oriented AnalysisChapter 14: DesignChapter 15: ImplementationChapter 16: Postdelivery MaintenanceChapter 17: More on UMLChapter 18: Emerging Technologies
£168.52
McGraw-Hill Education - Europe Your UNIXLinux The Ultimate Guide
Book SynopsisYour UNIX/Linux: The Ultimate Guide, written with both users and programmers in mind, is the ultimate UNIX/Linux text. Both pedagogical tool and exhaustive reference, it is well-suited to any course that includes UNIX or Linux. A strong pedagogical framework sets it apart from similar texts and allows beginning students to gain a firm grasp of fundamental concepts, while chapters on advanced topics inspire the more experienced reader to move beyond the basics. Nearly a thousand exercises and self-test questions provide a way for students to test and reinforce their understanding of the material.Table of ContentsPart I -- User UNIXChapter 1 Introducing UNIXChapter 2 Getting familiar with UNIX CommandsChapter 3 The File SystemChapter 4 File AttributesChapter 5 The vi/vim EditorChapter 6 The ShellChapter 7 The ProcessChapter 8 The Shell - Customizing the EnvironmentChapter 9 Simple FiltersChapter 10 Filters Using Regular Expressions - grep and sedChapter 11 Networking and Internet ToolsPart II--Programmer UNIXChapter 12 Filtering and programming with awkChapter 13 Shell ProgrammingChapter 14 A C Programming PrimerChapter 15 Program Development ToolsChapter 16 Systems Programming I - FilesChapter 17 Systems Programming II - Process ControlChapter 18 perl - The Master ManipulatorPart III -- System AdministrationChapter 19 System Administration
£145.26
McGraw-Hill Education Using Information Technology
Book Synopsis"The tumultuous changes in the landscape of information technology over the last two years have led us to make extensive modifications in this edition of USING INFORMATION TECHNOLOGY - to do not just a revision but a remaking and reimagining of this computer concepts book."-Brian K. Williams & Stacey C. Sawyer A comprehensive, storytelling approach to Computing Concepts. The 11th edition has been revamped to include emphasis on mobile computing, cloud computing, privacy/surveillance, and big data.
£153.99
McGraw-Hill Education - Europe Computer Networks A Top Down Approach
Book SynopsisThis new networking text follows a top-down approach. The presentation begins with an explanation of the application layer, which makes it easier for students to understand how network devices work, and then, with the students fully engaged, the authors move on to discuss the other layers, ending with the physical layer. With this top-down approach, its thorough treatment of the topic, and a host of pedagogical features, this new networking book offers the market something it hasn't had for many years- a well-crafted, modern text that places the student at the center of the learning experience. Forouzan's Computer Networks presents a complex topic in an accessible, student-friendly way that makes learning the material not only manageable but fun as well. The appealing visual layout combines with numerous figures and examples to provide multiple routes to understanding. Students are presented with the most up-to-date material currently available and are encouraged to view what theyTable of ContentsChapter 1: Introduction Chapter 2: Application Layer Chapter 3: Transport Layer Chapter 4: Network Layer Chapter 5: Data Link Layer and Wired Networks Chapter 6: Wireless Networks and Mobile IP Chapter 7: Physical Layer and Transmission Media Chapter 8: Multimedia Chapter 9: Network Management Chapter 10: Network Security Chapter 11: Socket-Interface Programming in Java
£168.21
McGraw-Hill Education - Europe An Introduction to ObjectOriented Programming
Book SynopsisAn Introduction to Object-Oriented Programming with Java takes a full-immersion approach to object-oriented programming. Proper object-oriented design practices are emphasized throughout the book. Students learn how to use the standard classes first, then learn to design their own classes. Wu uses a gentler approach to teaching students how to design their own classes, separating the coverage into two chapters. GUI coverage is also located independently in the back of the book and can be covered if desired.Wu also features a robust set of instructors' materials including PowerPoint slides, code samples, and quiz questions.Table of ContentsChapter 0 Introduction to Computers and Programming LanguagesChapter 1 Introduction to Object-Oriented Programming and Software DevelopmentChapter 2 Getting Started with JavaChapter 3 Numerical DataChapter 4 Defining Your Own Classes - Part 1Chapter 5 Selection StatementsChapter 6 Repetition StatementsChapter 7 Defining Your Own Classes - Part 2Chapter 8 Exceptions and AssertionsChapter 9 Characters and StringsChapter 10 Arrays and CollectionsChapter 11 Sorting and SearchingChapter 12 File Input and OutputChapter 13 Inheritance and PolymorphismChapter 14 GUI and Event-Driven ProgrammingChapter 15 Recursive AlgorithmsAppendix AHow to Run Java ProgramsAppendix BSample ProgramsAppendix CStandard Classes and InterfacesAppendix DUML Diagrams
£159.14
McGraw-Hill Education Database System Concepts by Abraham Silberschatz
Book SynopsisDatabase System Concepts by Silberschatz, Korth and Sudarshan is now in its 6th edition and is one of the cornerstone texts of database education. It presents the fundamental concepts of database management in an intuitive manner geared toward allowing students to begin working with databases as quickly as possible.The text is designed for a first course in databases at the junior/senior undergraduate level or the first year graduate level. It also contains additional material that can be used as supplements or as introductory material for an advanced course. Because the authors present concepts as intuitive descriptions, a familiarity with basic data structures, computer organization, and a high-level programming language are the only prerequisites. Important theoretical results are covered, but formal proofs are omitted. In place of proofs, figures and examples are used to suggest why a result is true.
£109.99
McGraw-Hill Education - Europe Exploring Python
Book SynopsisExploring Python takes an active learning approach which engages the student as an equal partner in the process of learning the fun, educational, and powerful programming language. This approach instills habits that students will carry with them throughout their programming career and helps them retain and use the information they have learned.Tim Budd is one of the best-known authors in Computer Science and has a reputation for producing writing texts along the leading edge of the discipline. Exploring Python provides an accessible and reliable introduction into programming with the Python language.Table of ContentsPart I. Basic Features of Python 1.Exploring Python 2.Creating Python Programs3.Defining Functions4.Strings, Lists, Tuples, and Sets5.Dictionaries6.Files7.Classes8.Functional Programming9.Object-Oriented Programming10.Scopes, Name Spaces, and Modules 11.Advanced FeaturesPart II. 12.GUI Programming with Tkinter13.Web-Based Applications14.A Simple Blog15.A Wiki Web16.A Sudoku Solver17. Using XML to Read an iTunes Database18.Data StructuresAppendicesA.Brief Python ReferenceB.How to Learn a Second (or Third) Programming Language
£93.64
McGraw-Hill Education Database Design and Programming with Access SQL
Book SynopsisThe book explains all stages of database development, starting with a comprehensive database application systems development life cycle model, which clearly defines the areas of focus required for any new database developer. Database design using entity modelling and normalization are described in a clear and comprehensible manner. Covering inplementation in Access, SQL, Access forms, macros, modules and report writer, the text also addresses Visual Basic database programming using Data Control, DAO, ADO and Access modules. The second edition contains a new set of chapters on Active Server Pages with HTML and VBScript. The new material explains how to get your database onto the Internet and the benefits offered by web-based database applications. ASP is put into context with a discussion of web terminology and client and server side scripting in VBScript. Client-side scripting examples in Javascript are also included. HTML and ASP are given separate chapters, with an array of examples,
£44.99
McGraw-Hill Education - Europe Java Programming A Comprehensive Introduction
Book SynopsisJava Programming: A Comprehensive Introduction is designed for an introductory programming course using Java. This text takes a logical approach to the presentation of core topics, moving step-by-step from the basics to more advanced material, with objects being introduced at the appropriate time. The book is divided into three parts: Part One covers the elements of the Java language and the fundamentals of programming. An introduction to object-oriented design is also included. Part Two introduces GUI (Graphical User Interface) programming using Swing. Part Three explores key aspects of Java's API (Application Programming Interface) library, including the Collections Framework and the concurrency API. Herb Schildt has written many successful programming books in Java, C++, C, and C#. His books have sold more than three million copies. Dale Skrien is a professor at Colby College with degrees from the University of Illinois-Champaign, the UniTable of ContentsPART ONE: The Java Language1. Java Programming Fundamentals2. Introducing Data Types and Operators3. Program Control Statements4. Introducing Classes, Objects, and Methods5. More Data Types and Operators6. A Closer Look at Methods and Classes7. Inheritance8. Interfaces9. Packages10. Exception Packages11. Using I/O12. Multithreaded Programming13. Enumerations, Autoboxing, and Annotations14. Generics15. Applets and the Remaining Java Keywords16. Introduction to Object-Oriented DesignPART TWO: Introducing GUI Programming with Swing17. Swing Fundamentals18. Exploring Swing Controls19. Working with Menus20. Dialogs21. Threading, Applets, and PaintingPART THREE: Exploring the Java API Library22. String Handling23. Exploring java.lang24. Exploring java.util25. Using the Data Structures in the Collections Framework26. Networking with java.net27. The Concurrency UtilitiesAppendix A: Using Java's Documentation CommentsAppendix B: An Introduction to Regular ExpressionsAppendix C: Answers to Selcted Exercises
£165.96
Emerald Publishing Limited Computer Assisted Learning
Book SynopsisA selection of papers from the Computer Assisted Learning 1995 Symposium. The theme of the proceedings, Learning to Succeed, draws upon the experience of the widespread use of the microcomputer in education over the past decade in order to assess the use in the new millennium.Table of ContentsSelected papers: Evaluating CAL at the Open University: 15 years on (A. Jones et al.). Structured learning in a virtual environment (T. Boyle et al.). The use of computers to support learning in children with emotional and behavioural difficulties (A. Jones). A scenario design tool for helping students learn mechanics (Yibing Li et al.). Education 2000: implications of W3 technology (I. Neilson et al.). Mangaging technological change in education--what lessons can we all learn? (R. Scott, B. Robinson). Managing models of collaborative learning (J.R. Hartley). Author Index. Subject Index.
£107.34
Elsevier Science Business Intelligence
Book SynopsisProvides an introduction to the concepts to uncomplicate the learning process when implementing a business intelligence program. This book offers an introduction to both business and technical aspects of business intelligence.Table of Contents1. Business Intelligence – An Introduction2. Value Drivers3. Planning for Success4. Developing a Business Intelligence Roadmap5. The Business Intelligence Environment6. Business Models and Information Flow7. Data Requirements Analysis8. Data Warehouses and the Technical BI Architecture9. Business Metadata10. Data Profiling11. Business Rules12. Data Quality13. Data Integration14. High Performance BI15. Alternate Information Contexts16. Location Intelligence and Spatial analysis?17. Knowledge Discovery, Data Mining, and Analytics18. Using Publicly Available Data19. Knowledge Delivery20. New and Emerging Techniques 21. Quick Reference
£37.99
Elsevier Science Heat Exchanger Design Guide
Table of Contents1.0 Heat exchanger design2.0 Calculation of the temperature differences LMTD and CMTD3.0 Calculation of the heat transfer coefficients and pressure losses in convective heat transfer4.0 Geometrical heat exchanger calculations5.0 Dimensionsless characterisation numbers for heat transfer6.0 Overall heat transfer coefficient and temperature profile of a heat exchanger7.0 Process engineering calculations8.0 Design of condensers9.0 Design of evaporators10.0 Design of thermosiphon evaporators11.0 Double tube-, plain tube- and cross-flow heat exchanger12.0 Finned-tube heat exchanger
£78.30
Elsevier Science Publishing Co Inc Digital Signal Processing
Book SynopsisTable of Contents1. Introduction to Digital Signal Processing 2. Signal Sampling and Quantization 3. Digital Signals and Systems 4. Discrete Fourier Transform and Signal Spectra 5. The Z-Transform 6. Digital Signal Processing Systems, Basic Filtering Types, and Digital Filter Realizations 7. Finite Impulse Response Filter Design 8. Infinite Impulse Response Filter Design 9. Adaptive Filters and Applications 10. Waveform Quantization and Compression 11. Multirate Digital Signal Processing, Oversampling Analog-To-Digital Conversion, and Undersampling of Bandpass Signals 12. Subband and Wavelet-Based Coding 13. Image Processing Basics 14. Hardware and Software for Digital Signal Processors
£90.20
Elsevier Science Publishing Co Inc Differential Equations with Mathematica
Book SynopsisTable of Contents1. Preface 2. Introduction to Differential Equations 3. First-Order Ordinary Differential Equations 4. Applications of First-Order Ordinary Differential Equations 5. Higher-Order Differential Equations 6. Applications of Higher-Order Differential Equations 7. Systems of Ordinary Differential Equations 8. Applications of Systems of Ordinary Differential Equations 9. Laplace Transform Methods 10. Eigenvalue Problems and Fourier Series 11. Partial Differential Equations 12. Appendix: Getting Started 13. The Mathematica Menu 14. Bibliography 15. Index
£103.50
Pearson Education (US) Fundamentals of Embedded Software with the ARM
Book SynopsisDr. Daniel W. Lewis' efforts led to the creation of Santa Clara University's Computer Engineering department in 1988, providing its leadership for the first 18 years. During his tenure, Lewis established unique co-op and study abroad options that fit within the normal undergraduate four-year plan, the first graduate-level academic certificate programs for working professionals, a new interdisciplinary major in Web Design and Engineering, and a interdisciplinary minor in Information Technology and Society. Since 2004, Lewis has focused on K-12 outreach in engineering and computing, raising more than $1.7M from NSF and private sources, and providing professional development for more than 200 K-12 teachers and summer camps for more than 2,000 K-12 students. Prior to joining the University in 1975, Lewis worked for six years at General Electric's Aerospace Division where he designed a fault-tolerant clocking system for one of the first triple-redundant automatic landing systTable of Contents1 Introduction 1.1 WHAT IS AN EMBEDDED SYSTEM? 1.2 WHAT’S UNIQUE ABOUT THE DESIGN GOALS FOR EMBEDDED SOFTWARE? 1.3 What Does "Real-Time" Mean? 1.4 What Does "multithreading" mean? 1.5 HOW POWERFUL ARE EMBEDDED PROCESSORS? 1.6 WHAT PROGRAMMING LANGUAGES ARE USED? 1.7 HOW IS BUILDING AN EMBEDDED APPLICATION DIFFERENT? 1.8 HOW BIG ARE TYPICAL EMBEDDED PROGRAMS? PROBLEMS 2 Data Representation2.1 FIXED-PRECISION BINARY NUMBERS 2.2 POSITIONAL NUMBER SYSTEMS 2.2.1 Binary-to-Decimal Conversion 2.2.2 Decimal-to-Binary Conversion 2.2.3 Hexadecimal — A Shorthand for Binary 2.2.4 Fixed Precision, Rollover and Overflow 2.3 BINARY REPRESENTATION OF INTEGERS 2.3.1 Signed Integers 2.3.2 Positive and Negative Representations of the Same Magnitude 2.3.3 Interpreting the Value of a 2’s-Complement Number 2.3.4 Changing the Sign of Numbers with Integer and Fractional Parts 2.3.5 Binary Addition and Subtraction 2.3.6 Range and Overflow 2.4 BINARY REPRESENTATION OF REAL NUMBERS 2.4.1 Floating-Point Real Numbers 2.4.2 Fixed-Point Real Numbers 2.5 ASCII REPRESENTATION OF TEXT 2.6 BINARY-CODED DECIMAL (BCD) PROBLEMS 3 Implementing Arithmetic 3.1 2’s Complement and hardware complexity 3.2 MULTIPLICATION AND DIVISION 3.2.1 Signed vs. Unsigned Multiplication 3.2.2 Shifting Instead of Multiplying or Dividing by Powers of 2 3.2.3 Multiplying by an Arbitrary Constant 3.2.4 Dividing by an Arbitrary Constant 3.3 ARITHMETIC FOR FIXED-POINT REALS 3.3.1 Fixed-Point Using a Universal 16.16 Format 3.3.2 Fixed-Point Using a Universal 32.32 Format 3.3.3 Multiplication of 32.32 Fixed Point Reals 3.3.4 Example: Multiplying two 4.4 Fixed Point Reals PROBLEMS 4 Getting the Most Out of C 4.1 Integer Data Types 4.1.1 Integer Range and the Standard Header File LIMITS.H 4.2 BOOLEAN Data Types 4.3 Mixing Data Types 4.4 Manipulating Bits in Memory 4.4.1 Testing Bits 4.4.2 Setting, Clearing, and Inverting Bits 4.4.3 Extracting Bits 4.4.4 Inserting Bits 4.5 Manipulating Bits in INPUT/OUTPUT PORTS 4.5.1 Write-Only I/O Devices 4.5.2 I/O Devices Differentiated by Reads Versus Writes 4.5.3 I/O Devices Differentiated by Sequential Access 4.5.4 I/O Devices Differentiated by Bits in the Written Data 4.6 Accessing Memory-Mapped I/O Devices 4.6.1 Accessing Data Using a Pointer 4.6.2 Arrays, Pointers, and the “Address of” Operator 4.7 Structures 4.7.1 Packed Structures 4.7.2 Bit Fields 4.8 Variant Access 4.8.1 Casting the Address of an Object 4.8.2 Using Unions Problems 5 Programming in Assembly Part 1: Computer Organization 5.1 Memory 5.1.1 Data Alignment 5.2 The Central Processing Unit (CPU) 5.2.1 Other Registers 5.2.2 The Fetch-Execute Cycle 5.3 Input/Output (I/O) 5.4 Introduction to the ARM® CortexTM- M3 V7M Architecture 5.4.1 Internal Organization 5.4.2 Instruction Pipelining 5.4.3 Memory Model 5.4.4 Bit-Banding 5.5 ARM ASSEMBLY LANGUAGE 5.5.1 Instruction Formats and Operands 5.5.2 Translating Assembly into Binary Problems 6 Programming in Assembly Part 2: Data Manipulation 6.1 LOADING CONSTANTS INTO REGISTERS 6.2 LOADING MEMORY DATA INTO REGISTERS 6.3 STORING DATA FROM REGISTERS TO MEMORY 6.4 CONVERTING SIMPLE C ASSIGNMENT STATEMENTS INTO ARM ASSEMBLY 6.5 MEMORY ADDRESS CALCULATIONS 6.6 MEMORY ADDRESSING EXAMPLES 6.6.1 Translating C Pointer Expressions to Assembly 6.6.2 Translating C Subscript Expressions to Assembly 6.6.3 Translating Structure References to Assembly 6.7 STACK INSTRUCTIONS 6.8 DATA PROCESSING INSTRUCTIONS 6.8.1 Updating the Flags in the APSR 6.8.2 Arithmetic Instructions 6.8.3 Bit Manipulation Instructions 6.8.4 Shift Instructions 6.8.5 Bitfield Manipulation Instructions 6.8.6 Miscellaneous Bit, Byte and Halfword Instructions PROBLEMS 7 Programming in Assembly Part 3: Control Structures 7.1 INSTRUCTION SEQUENCING 7.2 IMPLEMENTING DECISIONS 7.2.1 Conditional Branch Instructions 7.2.2 If-Then and If-Then-Else Statements 7.2.3 Compound Conditionals 7.1.4 The “If-Then” (IT) Instruction 7.2 IMPLEMENTING LOOPS 7.2.1 Speeding Up Array Access 7.3 IMPLEMENTING FUNCTIONS 7.3.1 Function Call and Return 7.3.2 Register Usage 7.3.3 Parameter Passing 7.3.4 Return Values 7.3.5 Temporary Variables 7.3.6 Preserving Registers PROBLEMS 8 Programming in Assembly Part 4: I/O Programming 8.1 THE CORTEX-M3 I/O HARDWARE 8.1.1 Interrupts and Exceptions 8.1.2 Thread and Handler Modes 8.1.3 Entering the Exception Handler 8.1.4 Returning from the Exception Handler 8.1.5 Latency Reduction 8.1.6 Priorities and Nested Exceptions 8.2 SYNCHRONIZATION, TRANSFER RATE, AND LATENCY 8.3 BUFFERS AND QUEUES 8.3.1 Double Buffering 8.4 ESTIMATING I/O PERFORMANCE CAPABILITY 8.4.1 Polled Waiting Loops 8.4.2 Interrupt-Driven I/O 8.4.3 Direct Memory Access 8.4.4 Comparison of Methods PROBLEMS 9 Concurrent Software 9.1 FOREGROUND/BACKGROUND SYSTEMS 9.1.1 Thread State and Serialization 9.1.2 Managing Latency 9.1.3 Interrupt Overrun 9.1.4 Moving Work into the Background 9.2 MULTI-THREADED PROGRAMMING 9.2.1 Concurrent Execution of Independent Threads 9.2.2 Context Switching 9.2.3 Non-preemptive (Cooperative) Multithreading 9.2.4 Preemptive Multithreading 9.3 SHARED RESOURCES AND CRITICAL SECTIONS 9.3.1 Disabling Interrupts 9.3.2 Disabling Task Switching 9.3.3 Spin Locks 9.3.4 Mutex Objects 9.3.5 Semaphores PROBLEMS 10 Scheduling 10.1 THREAD STATES 10.2 PENDING THREADS 10.3 CONTEXT SWITCHING 10.4 ROUND-ROBIN SCHEDULING 10.5 PRIORITY-BASED SCHEDULING 10.5.1 Resource Starvation 10.5.2 Priority Inversion 10.5.3 The Priority Ceiling Protocol 10.5.4 The Priority Inheritance Protocol 10.6 ASSIGNING PRIORITIES 10.6.1 Deadline-Driven Scheduling 10.6.2 Rate-Monotonic Scheduling 10.7 DEADLOCK 10.8 WATCHDOG TIMERS PROBLEMS 11 Memory Management 11.1 OBJECTS IN C 11.2 SCOPE 11.2.1 Refining Local Scope 11.2.2 Refining Global Scope 11.3 LIFETIME 11.4 AUTOMATIC ALLOCATION 11.4.1 Storage Class “Register” 11.5 STATIC ALLOCATION 11.6 THREE PROGRAMS TO DISTINGUISH STATIC FROM AUTOMATIC 11.6.1 Object Creation 11.6.2 Object Initialization 11.6.3 Object Destruction 11.7 DYNAMIC ALLOCATION 11.7.1 Fragmentation 11.7.2 Memory Allocation Pools 11.8 AUTOMATIC ALLOCATION WITH VARIABLE SIZE (alloca) 11.8.1 Variable-Size Arrays 11.9 RECURSIVE FUNCTIONS AND MEMORY ALLOCATION PROBLEMS 12 Shared Memory 12.1 RECOGNIZING SHARED OBJECTS 12.2 REENTRANT FUNCTIONS 12.3 READ-ONLY DATA 12.3.1 Type Qualifier "const" 12.4 CODING PRACTICES TO AVOID 12.4.1 Functions That Keep Internal State in Local Static Objects 12.4.2 Functions That Return the Address of a Local Static Object 12.5 ACCESSING SHARED MEMORY 12.5.1 The Effect of Processor Architecture 12.5.2 Read-Only and Write-Only Access 12.5.3 Type Qualifier “volatile” PROBLEMS 13 System Initialization 13.1 MEMORY LAYOUT 13.2 THE CPU AND VECTOR TABLE 13.3 C RUN-TIME ENVIRONMENT 13.3.1 Copying Initial Values from Non-Volatile Memory into the Data Region 13.3.2 Zeroing Uninitialized Statics 13.3.3 Setting Up a Heap 13.4 SYSTEM TIMER 13.5 OTHER PERIPHERAL DEVICES
£192.02
Pearson Education (US) Web Service Contract Design and Versioning for
Book Synopsis&> Thomas Erl is a best-selling IT author and founder of CloudSchool.com andSOASchool.com. Thomas has been the world's top-selling service technology author for over five years and is the series editor of the Prentice Hall Service Technology Series from Thomas Erl (www.servicetechbooks.com ), as well as the editor of the Service Technology Magazine (www.servicetechmag.com). With over 175,000 copies in print world-wide, his eight published books have become international bestsellers and have been formally endorsed by senior members of major IT organizations, such as IBM, Microsoft, Oracle, Intel, AccentureTable of Contents Foreword xxxv Preface xxxvii Chapter 1: Introduction 1 Chapter 2: Case Study Background 17 Part I: Fundamental Service Contract Design 21 Chapter 3: SOA Fundamentals and Web Service Contracts 23 Chapter 4: Anatomy of a Web Service Contract 49 Chapter 5: A Plain English Guide to Namespaces 81 Chapter 6: Fundamental XML Schema: Types and Message Structure Basics 117 Chapter 7: Fundamental WSDL Part I: Abstract Description Design 167 Chapter 8: Fundamental WSDL Part II: Concrete Description Design 197 Chapter 9: Fundamental WSDL 2.0: New Features and Design Options 225 Chapter 10: Fundamental WS-Policy: Assertions, Expressions, and Attachments 241 Chapter 11: Fundamental Message Design: SOAP Envelope Structure, Fault Messages, and Header Processing 271 Part II: Advanced Service Contract Design 307 Chapter 12: Advanced XML Schema Part I: Message Flexibility, Type Inheritance, and Composition 309 Chapter 13: Advanced XML Schema Part II: Reusability, Relational Design, and Industry Schemas 353 Chapter 14: Advanced WSDL Part I: Modularization, Extensibility, MEPs, and Asynchrony 395 Chapter 15: Advanced WSDL Part II: Message Dispatch, Service Instance Identification, and Non-SOAP HTTP Binding 445 Chapter 16: Advanced WS-Policy Part I: Policy Centralization and Nested, Parameterized, and Ignorable Assertions 485 Chapter 17: Advanced WS-Policy Part II: Custom Policy Assertion Design, Runtime Representation, and Compatibility 517 Chapter 18: Advanced Message Design Part I: WS-Addressing Vocabularies 549 Chapter 19: Advanced Message Design Part II: WS-Addressing Rules and Design Techniques 569 Part III: Service Contract Versioning 597 Chapter 20: Versioning Fundamentals 599 Chapter 21: Versioning WSDL Definitions 617 Chapter 22: Versioning Message Schemas 657 Chapter 23: Advanced Versioning 689 Part IV: Appendices 719 Appendix A: Case Study Conclusion 721 Appendix B: How Technology Standards are Developed 725 Appendix C: Alphabetical Pseudo Schema Reference 729 Appendix D: Namespaces and Prefixes Used in this Book 747 Appendix E: SOA Design Patterns Related to this Book 751 About the Authors 763 Index 769
£44.49
Pearson Education (US) Technology In Action Complete
Book SynopsisFor introductory courses in computer concepts, digital literacy, or computer literacy, often including instruction in Microsoft Office. Using technology to teach technology Explore, discover, and experience technology with Technology in Action, the best seller that uses technology to teach
£159.50
Pearson Education Adobe Animate CC Classroom in a Book 2018 release
Book Synopsis
£52.70
Pearson Education (US) GO All in One
Book SynopsisAbout our authors Shelley Gaskin (series editor) is a professor in the Business and Computer Technology Division at Pasadena City College in Pasadena, California. She holds a bachelor's degree in Business Administration from Robert Morris College (Pennsylvania), a master's degree in Business from Northern Illinois University, and a doctorate in Adult and Community Education from Ball State University (Indiana). Before joining Pasadena City College, she spent 12 years in the computer industry, where she was a systems analyst, sales representative, and director of Customer Education with Unisys Corporation. She also worked for Ernst & Young on the development of large systems applications for their clients. She has written and developed training materials for custom systems applications in both the public and private sector and has also written and edited numerous computer application textbooks. Debra?Geoghan (PowerPoint author) is a PTable of ContentsTable of Contents Concepts: Computers and Information Processing Concepts: Hardware Concepts: System Software Concepts: Networks, Security, and Privacy Concepts: Troubleshooting and Maintenance Concepts: Application Software Concepts: The Internet Concepts: Digital Ethics and Awareness Applications: Cloud Computing Project 9A: Google Productivity Project 9B: Microsoft Cloud Computing and OneNote Project 9C: Using Professional Networks Applications: Microsoft Office Features and Windows 10 File Management Project I0A: Chef Notes Project 10B: Hotel Files MICROSOFT WORD 2019 Applications: Creating Documents with Microsoft Word Project 11A: Flyer Project 11B: Information Handout Applications: Creating Cover Letters and Using Tables to Create Resumes Project 12A: Resume Project 12B: Cover Letter and Envelope Applications: Creating Research Papers, Newsletters, and Merged Mailing Labels Project 13A: Research Paper Project 13B: Newsletter with Optional Mailing Labels MICROSOFT EXCEL 2019 Applications: Creating a Worksheet and Charting Data Project 14A: Sales Report with Embedded Column Chart and Sparklines Project 14B: Inventory Valuation Applications: Using Functions, Creating Tables, and Managing Large Workbooks Project 15A: Inventory Status Report Project 15B: Weekly Sales Summary Applications: Analyzing Data with Pie Charts, Line Charts, and What-If Analysis Tools Project 16A: Enterprise Fund Pie Chart Project 16B: Tourism Spending Projection with Line Chart MICROSOFT ACCESS 2019 Applications: Getting Started with Microsoft Access 2019 Project 17A: Advising Database with Two Tables Project 17B: Instructors and Courses Database Project 17C: Athletic Scholarships Database MICROSOFT POWERPOINT 2019 Applications: Getting Started with Microsoft PowerPoint Project 18A: Company Overview Presentation Project 18B: Itinerary Presentation Project 18C: Employee Training Presentation
£179.99
Pearson Education (US) CompTIA Linux Portable Command Guide
Book SynopsisTable of Contents Introduction xxx Part I: Hardware and System Confi gurationCHAPTER 1 Explain Linux boot process concepts 1 Boot Loaders 1 Boot Options 3 File Locations 6 Boot Modules and Files 7 Kernel Panic 9CHAPTER 2 Given a scenario, install, confi gure, and monitor kernel modules 11 Commands 11 Files 15CHAPTER 3 Given a scenario, confi gure and verify network connection parameters 17 Diagnostic Tools 18 Configuration Files 28 Bonding 34CHAPTER 4 Given a scenario, manage storage in a Linux environment 37 Basic Partitions 38 Filesystem Hierarchy 40 Device Mapper 41 Tools 44 Location 54 Filesystem Types 58CHAPTER 5 Compare and contrast cloud and virtualization concepts and technologies 59 Templates 60 Bootstrapping 62 Storage 63 Network Considerations 65 Types of Hypervisors 66 Tools 67CHAPTER 6 Given a scenario, confi gure localization options 69 File Locations 70 Commands 70 Environment Variables 73 Character Sets 75 UTF-8 75 Part II: Systems Operation and MaintenanceCHAPTER 7 Given a scenario, conduct software installations, confi gurations, updates, and removals 77 Package Types 78 Installation Tools 78 Build Tools 86 Repositories 88 Acquisition Commands 89CHAPTER 8 Given a scenario, manage users and groups 93 Creation 94 Modification 94 Deletion 96 Queries 96 Quotas 98 Profiles 102 Important Files and File Contents 106CHAPTER 9 Given a scenario, create, modify, and redirect fi les 109 Text Editors 110 File Readers 114 Output Redirection 117 Text Processing 123 File and Directory Operations 129 Bonus: regex 141CHAPTER 10 Given a scenario, manage services 143 Systemd Management 144 Systemd-analyze blame 148 Unit Files 148 SysVinit 152CHAPTER 11 Summarize and explain server roles 157 NTP 158 SSH 158 Web 159 Certificate Authority 159 Name Server 159 DHCP 160CHAPTER 12 Given a scenario, automate and schedule jobs 165 cron 165 at 165 crontab 167 fg 170 bg 171 & 171 kill 171 Ctrl-c 172 Ctrl-z 172 nohup 172CHAPTER 13 Explain the use and operation of Linux devices 173 Types of Devices 174 Monitoring and Configuration Tools 176 File Locations 182 Hot Pluggable Devices 185CHAPTER 14 Compare and Contrast Linux Graphical User Interfaces 187 Servers 187 GUI 188 Remote Desktop 189 Accessibility 192 Part III: SecurityCHAPTER 15 Given a scenario, apply or acquire the appropriate user and/or group permissions and ownership 193 File and Directory Permissions 194 Context-Based Permissions 203 Privilege Escalation 209 User Types 211CHAPTER 16 Given a scenario, confi gure and implement appropriate access and authentication methods 213 PAM 214 SSH 221 TTYs 228 PTYs 230 PKI 230 VPN as a Client 231 SSL/TLS 232 Transport Mode 232 Tunnel Mode 232 IPSec 232 DTLS 233CHAPTER 17 Summarize security best practices in a Linux environment 235 Boot Security 236 Additional Authentication Methods 237 Multifactor Authentication 237 Importance of Disabling Root Login via SSH 239 Password-Less Login 239 Chroot Jail Services 240 No Shared IDs 240 Importance of Denying Hosts 240 Separation of OS Data from Application Data 241 Change Default Ports 241 Importance of Disabling or Uninstalling Unused and Unsecure Services 242 Importance of Enabling SSL/TLS 243 Importance of Enabling auditd 243 CVE Monitoring 243 Discouraging Use of USB Devices 243 Disk Encryption 244 Restrict cron Access 244 Disable Ctrl-Alt-Del 244 Add Banner 245 MOTD 245CHAPTER 18 Given a scenario, implement logging services 247 Key File Locations 247 Log Management 249CHAPTER 19 Given a scenario, implement and confi gure Linux fi rewalls 257 Access Control Lists 258 Technologies 259 IP Forwarding 263 Dynamic Rule Sets 263 Common Application 265CHAPTER 20 Given a scenario, backup, restore, and compress fi les 267 Archive and Restore Utilities 268 Compression 269 Backup Types 272 Off-Site/Off-System Storage 274 Integrity Checks 275 Part IV: Linux Troubleshooting and DiagnosticsCHAPTER 21 Given a scenario, analyze system properties and remediate accordingly 277 Network Monitoring and Configuration 278 Storage Monitoring and Configuration 287 CPU Monitoring and Configuration 289 Memory Monitoring and Configuration 292 Lost Root Password 295CHAPTER 22 Given a scenario, analyze system processes in order to optimize performance 297 Process Management 297 Process States 297 Priorities 298 Kill Signals 299 Commands 300 PIDs 305CHAPTER 23 Given a scenario, analyze and troubleshoot user issues 307 Permissions 307 Access 309 Authentication 309 File Creation 310 Insufficient Privileges for Authorization 312 Environment and Shell Issues 312CHAPTER 24 Given a scenario, analyze and troubleshoot application and hardware issues 313 SELinux Context Violations 314 Storage 314 Firewall 317 Permission 318 Service Accounts 319 Group Memberships 319 Dependencies 319 Troubleshooting Additional Hardware Issues 320 Part V: Automation and ScriptingCHAPTER 25 Given a scenario, deploy and execute basic BASH scripts 327 Shell Environments and Shell Variables 328 #!/ bin/bash 332 Sourcing Scripts 332 Directory and File Permissions 333 Extensions 333 Commenting 333 File Globbing 334 Shell Expansions 334 Redirection and Piping 336 Exit Codes 336 Metacharacters 336 Positional Parameters 337 Looping Constructs 337 Conditional Statements 338 Escaping Characters 340CHAPTER 26 Given a scenario, carry out version control using Git 343 Arguments 343 Files 349CHAPTER 27 Summarize orchestration processes and concepts 351 Agent 351 Agentless 352 Procedures 352 Attributes 352 Infrastructure Automation 352 Infrastructure as Code 352 Inventory 353 Automated Configuration Management 353 Build Automation 353 APPENDIX Create your own journal 355 9780135591840, TOC, 7/19/19
£23.39
Pearson Education (US) IT Essentials Course Booklet v7
Book SynopsisCisco Networking Academy is an innovative Cisco education initiative that delivers information and communication technology skills to improve career and economic opportunities around the world. The Academy provides online courses, interactive tools, and lab activities to prepare individuals for information technology and networking careers in virtually every industry.Table of Contents Chapter 1 Introduction to Personal Computer Hardware 1 1.0 Introduction to Personal Computers 1 1.1 Personal Computers 1 1.1.1 What is in a Computer? 1 1.1.2 Electrical and ESD Safety 1 1.2 PC Components 2 1.2.1 Case and power supplies 2 1.2.2 Motherboards 4 1.2.3 CPUs and Cooling Systems 6 1.2.4 Memory 6 1.2.5 Adapter Cards and Expansion Slots 8 1.2.6 Hard disk drives and SSDs 9 1.2.7 Optical Storage Devices 11 1.2.8 Ports, Cables, and Adaptors 11 1.2.9 Input Devices 12 1.2.10 Output Devices 12 1.3 Computer Disassembly 13 1.3.1 The Technician’s Toolkit 13 1.3.2 Computer Disassembly 13 1.4 Summary 14 Chapter 1 Quiz 15 Chapter 1 Exam 15 Your Chapter Notes 15 Chapter 2 PC Assembly 17 2.0 Introduction to PC Assembly 17 2.1 Assemble the Computer 17 2.1.1 General and Fire Safety 17 2.1.2 Open the Case and Connect the Power Supply 17 2.1.3 Install the Motherboard Components 19 2.1.4 Install Internal Drives 21 2.1.5 Install the Adapter Cards 23 2.1.6 Select Additional Storage 25 2.1.7 Install the Cables 26 2.2 Summary 28 Chapter 2 Quiz 30 Chapter 2 Exam 30 Your Chapter Notes 30 Chapter 3 Advanced Computer Hardware 31 3.0 Introduction to Advanced Computer Hardware 31 3.1 Boot the Computer 31 3.1.1 POST, BIOS, CMOS and UEFI 31 3.1.2 BIOS/UEFI Configuration 33 3.2 Electrical Power 35 3.2.1 Wattage and Voltage 35 3.2.2 Power Fluctuation and Protection 36 3.3 Advanced Computer Functionality 37 3.3.1 CPU Architectures and Operation 37 3.3.2 RAID 39 3.3.3 Ports, Connectors, and Cables 40 3.3.4 Monitors 41 3.4 Computer Configuration 42 3.4.1 Upgrade Computer Hardware 42 3.4.2 Configurations for Specialized Computers 45 3.5 Protecting the Environment 47 3.5.1 Safe Disposal of Equipment and Supplies 47 3.6 Summary 48 Chapter 3 Quiz 50 Chapter 3 Exam 50 Your Chapter Notes 50 Chapter 4 Preventive Maintenance and Troubleshooting 51 4.0 Introduction 51 4.1 Preventive Maintenance 51 4.1.1 PC Preventive Maintenance Overview 51 4.2 Troubleshooting Process 53 4.2.1 Troubleshooting Process Steps 53 4.2.2 Common Problems and Solutions for PCs 58 4.2.3 Apply Troubleshooting Process to Computer Components and Peripherals 58 4.3 Summary 60 Chapter 4 Quiz 61 Chapter 4 Exam 61 Your Chapter Notes 61 Chapter 5 Networking Concepts 63 5.0 Introduction 63 5.1 Network Components and Types 63 5.1.1 Types of Networks 63 5.1.2 Internet Connection Types 64 5.2 Networking Protocols, Standards, and Services 67 5.2.1 Transport Layer Protocols 67 5.2.2 Application Port Numbers 68 5.2.3 Wireless Protocols 69 5.2.4 Network Services 70 5.3 Network Devices 73 5.3.1 Basic Network Devices 73 5.3.2 Security Devices 76 5.3.3 Other Network Devices 77 5.4 Network Cables 79 5.4.1 Network Tools 79 5.4.2 Copper Cables and Connectors 79 5.4.3 Fiber Cables and Connectors 80 5.5 Summary 81 Chapter 5 Quiz 83 Chapter 5 Exam 83 Your Chapter Notes 83 Chapter 6 Applied Networking 85 6.0 Introduction 85 6.1 Device to Network Connection 85 6.1.1 Network Addressing 85 6.1.2 Configure a NIC 89 6.1.3 Configure a Wired and Wireless Network 92 6.1.4 Firewall Settings 94 6.1.5 IoT Device Configuration 97 6.2 Basic Troubleshooting Process for Networks 98 6.2.1 Applying the Troubleshooting Process to 98 6.2.2 Network Problems and Solutions 99 6.3 Summary 99 Chapter 6 Quiz 101 Chapter 6 Exam 101 Your Chapter Notes 101 Chapter 7 Laptops and Other Mobile Devices 103 7.0 Introduction 103 7.1 Characteristics of laptops and other mobile devices 103 7.1.1 Mobile Device Overview 103 7.1.2 Laptop Components 106 7.1.3 Laptop Display Components 108 7.2 Laptop Configuration 109 7.2.1 Power Settings Configuration 109 7.2.2 Wireless Configuration 110 7.3 Laptop Hardware and Component Installation and Configuration 112 7.3.1 Expansion Slots 112 7.3.2 Replacing Laptop Components 114 7.4 Other Mobile Device Hardware Overview 117 7.4.1 Other Mobile Device Hardware 117 7.4.2 Specialty Mobile Devices 118 7.5 Network Connectivity and Email 119 7.5.1 Wireless and Cellular Data Networks 119 7.5.2 Bluetooth 121 7.5.3 Configuring Email 122 7.5.4 Mobile Device Synchronization 124 7.6 Preventive Maintenance for Laptops and other Mobile Devices 126 7.6.1 Scheduled Maintenance for Laptops and other Mobile Devices 126 7.7 Basic Troubleshooting Process for Laptops and other Mobile Devices 127 7.7.1 Applying the Troubleshooting Process to Laptops and other Mobile Devices 127 7.7.2 Common Problems and Solutions for Laptops and Other Mobile Devices 128 7.8 Summary 129 Chapter 7 Quiz 131 Chapter 7 Exam 131 Your Chapter Notes 131 Chapter 8 Printers 133 8.0 Introduction 133 8.1 Common Printer Features 133 8.1.1 Characteristics and Capabilities 133 8.1.2 Printer Connections 135 8.2 Printer Type Comparison 135 8.2.1 Inkjet Printers 135 8.2.2 Laser Printers 135 8.2.3 Laser Printing Process 136 8.2.4 Thermal Printers and Impact Printers 136 8.2.5 Virtual Printers 137 8.2.6 3D Printers 137 8.3 Installing and Configuring Printers 138 8.3.1 Installing and Updating a Printer 138 8.3.2 Configuring Options and Default Settings 139 8.3.3 Optimizing Printer Performance 139 8.4 Sharing Printers 140 8.4.1 Operating System Settings for Sharing Printers 140 8.4.2 Print Servers 141 8.5 Maintaining and Troubleshooting Printers 143 8.5.1 Printer Preventive Maintenance 143 8.5.2 Inkjet Printer Preventive Maintenance 143 8.5.3 Laser Printer Preventive Maintenance 144 8.5.4 Thermal Printer Preventive Maintenance 145 8.5.5 Impact Printer Preventive Maintenance 145 8.5.6 3D Printer Preventive Maintenance 145 8.5.7 Applying the Troubleshooting Process to Printers 146 8.5.8 Problems and Solutions 147 8.6 Summary 147 Chapter 8 Quiz 149 Chapter 8 Exam 149 Your Chapter Notes 149 Chapter 9 Virtualization and Cloud Computing 151 9.0 Introduction 151 9.1 Virtualization 151 9.1.1 Virtualization 151 9.1.2 Client-Side Virtualization 153 9.2 Cloud Computing 155 9.2.1 Cloud Computing Applications 155 9.2.2 Cloud Services 155 9.3 Summary 156 Chapter 9 Quiz 158 Chapter 9 Exam 158 Your Chapter Notes 158 Chapter 10 Windows Installation 159 10.0 Introduction 159 10.1 Modern Operating Systems 159 10.1.1 Operating System Features 159 10.1.2 Customer Requirements for an Operating System 160 10.1.3 Operating System Upgrades 162 10.2 Disk Management 163 10.2.1 Disk Management 163 10.3 Installation and Boot Sequence 166 10.3.1 Basic Windows Installation 166 10.3.2 Custom Installation Options 167 10.3.3 Windows Boot Sequence 170 10.4 Summary 171 Chapter 10 Quiz 172 Chapter 10 Exam 172 Your Chapter Notes 172 Chapter 11 Windows Configuration 173 11.0 Introduction 173 11.1 Windows Desktop and File Explorer 173 11.1.1 Comparing Windows Versions 173 11.1.2 The Windows Desktop 175 11.1.3 Windows Task Manager 178 11.1.4 Windows File Explorer 180 11.2 Configure Windows with Control Panels 183 11.2.1 Control Panel Utilities 183 11.2.2 User and Account Control Panel Items 184 11.2.3 Network and Internet Control Panels 185 11.2.4 Display Settings and Control Panel 187 11.2.5 Power and System Control Panels 188 11.2.6 Hardware and Sound Control Panels 190 11.2.7 Clock, Region, and Language 191 11.2.8 Programs and Features Control Panels 192 11.2.9 Other Control Panels 193 11.3 System Administration 194 11.3.1 Administrative Tools 194 11.3.2 System Utilities 197 11.3.3 Disk Management 199 11.3.4 Application Installation and Configuration 202 11.4 Command-Line Tools 204 11.4.1 Using Windows CLI 204 11.4.2 File System CLI Commands 205 11.4.3 Disk CLI Commands 206 11.4.4 Task and System CLI Commands 207 11.4.5 Other Useful CLI Commands 207 11.5 Windows Networking 208 11.5.1 Network Sharing and Mapping Drives 208 11.5.2 Sharing Local Resources with Others 210 11.5.3 Configure a Wired Network Connection 211 11.5.4 Configure a Wireless Network Interfaces in Windows 213 11.5.5 Remote Access Protocols 213 11.5.6 Remote Desktop and Assistance 214 11.6 Common Preventive Maintenance Techniques for Operating Systems 215 11.6.1 OS Preventive Maintenance Plan 215 11.6.2 Backup and Restore 217 11.7 Basic Troubleshooting Process for Windows Operating Systems 218 11.7.1 Applying Troubleshooting Process to Windows Operating Systems 218 11.7.2 Common Problems and Solutions for Windows Operating Systems 219 11.7.3 Advanced Troubleshooting for Windows Operating Systems 219 11.8 Summary 219 Chapter 11 Quiz 221 Chapter 11 Exam 221 Your Chapter Notes 221 Chapter 12 Mobile, Linux, and macOS Operating Systems 223 12.0 Introduction 223 12.1 Mobile Operating Systems 223 12.1.1 Android vs. iOS 223 12.1.2 Android Touch Interface 224 12.1.3 iOS Touch Interface 224 12.1.4 Common Mobile Device Features 225 12.2 Methods for Securing Mobile Devices 227 12.2.1 Screen Locks and Biometric Authentication 227 12.2.2 Cloud-Enabled Services for Mobile Devices 227 12.2.3 Software Security 228 12.3 Linux and macOS Operating Systems 230 12.3.1 Linux and macOS tools and features 230 12.3.2 Linux and macOS Best Practices 233 12.3.3 Basic CLI Commands 234 12.4 Basic Troubleshooting Process for Mobile, Linux, and macOS Operating Systems 236 12.4.1 Applying the Troubleshooting Process to Mobile, Linux, and macOS Operating Systems 236 12.4.2 Common Problems and Solutions for Other Operating Systems 237 12.5 Summary 237 Chapter 12 Quiz 239 Chapter 12 Exam 239 Your Chapter Notes 239 Chapter 13 Security 241 13.0 Introduction 241 13.1 Security Threats 241 13.1.1 Malware 241 13.1.2 Preventing Malware 243 13.1.3 Network Attacks 246 13.1.4 Social Engineering Attacks 247 13.2 Security Procedures 248 13.2.1 Security Policy 248 13.2.2 Protecting Physical Equipment 249 13.2.3 Protecting Data 250 13.2.4 Data Destruction 253 13.3 Securing Windows Workstations 254 13.3.1 Securing a Workstation 254 13.3.2 Windows Local Security Policy 256 13.3.3 Managing Users and Groups 258 13.3.4 Windows Firewall 260 13.3.5 Web Security 262 13.3.6 Security Maintenance 264 13.4 Wireless Security 265 13.4.1 Configure Wireless Security 265 13.5 Basic Troubleshooting Process for Security 268 13.5.1 Applying the Troubleshooting Process to Security 268 13.5.2 Common Problems and Solutions for Security 269 13.6 Summary 269 Chapter 13 Quiz 271 Chapter 13 Exam 271 Your Chapter Notes 271 Chapter 14 The IT Professional 273 14.0 Introduction 273 14.1 Communication Skills and the IT Professional 273 14.1.1 Communication Skills, Troubleshooting, and Professional Behavior 273 14.1.2 Working with a Customer 275 14.1.3 Professional Behavior 276 14.1.4 The Customer Call 277 14.2 Operational Procedures 280 14.2.1 Documentation 280 14.2.2 Change Management 281 14.2.3 Disaster Prevention and Recovery 281 14.3 Ethical and Legal Considerations 284 14.3.1 Ethical and Legal Considerations in the IT Profession 284 14.3.2 Legal Procedures Overview 287 14.4 Call Center Technicians 289 14.4.1 Call Centers, Level One and Level Two Technicians 289 14.4.2 Basic Scripting and the IT Professional 291 14.5 Summary 292 Chapter 14 Quiz 294 Chapter 14 Exam 294 Your Chapter Notes 294 9780135612163 TOC 10/1/2019
£23.81
Pearson Go All in One Computer Concepts and Applications
Book Synopsis
£232.14
Pearson Education Advanced Digital Design with the Verilog HDL
Book SynopsisMichael Ciletti is Professor Emeritus in the Department of Electrical and Computer Engineering at the University of Colorado, Colorado Springs. His areas of interest include Modeling, synthesis and verification of digital systems with hardware description languages, system-level design languages, and embedded systems with FPGAs. He is the author of Advanced Digital Design with the Verilog HDL and the co-author of Digital Design, 4e.Trade ReviewI use VHDL in daily design job at Bell Labs. When I was asked to teach this advanced digital design course using Verilog, this example-rich book [ Advanced Digital Design with the Verilog, HDL, 2e] helped me easily apply my design knowledge in Verilog. It is also very easy for students who first learn high-level design language to appreciate the power of design using Verilog, again via plenty of examples in the book.Table of Contents1 Introduction to Digital Design Methodology 1 1.1 Design Methodology–An Introduction 1.1.1 Design Specification 1.1.2 Design Partition 1.1.3 Design Entry 1.1.4 Simulation and Functional Verification 1.1.5 Design Integration and Verification 1.1.6 Presynthesis Sign-Off 1.1.7 Gate-Level Synthesis and Technology Mapping 1.1.8 Postsynthesis Design Validation 1.1.9 Postsynthesis Timing Verification 1.1.10 Test Generation and Fault Simulation 1.1.11 Placement and Routing 1.1.12 Physical and Electrical Design Rule Checks 1.1.13 Parasitic Extraction 1.1.14 Design Sign-Off 1.2 IC Technology Options 1.3 Overview References 2 Review of Combinational Logic Design 13 2.1 Combinational Logic and Boolean Algebra 2.1.1 ASIC Library Cells 2.1.2 Boolean Algebra 2.1.3 DeMorgan’s Laws 2.2 Theorems for Boolean Algebraic Minimization 2.3 Representation of Combinational Logic 2.3.1 Sum-of-Products Representation 2.3.2 Product-of-Sums Representation 2.4 Simplification of Boolean Expressions 2.4.1 Simplification with Exclusive-Or 2.4.2 Karnaugh Maps (SOP Form) 2.4.3 Karnaugh Maps (POS Form) 2.4.4 Karnaugh Maps and Don’t-Cares 2.4.5 Extended Karnaugh Maps 2.5 Glitches and Hazards 2.5.1 Elimination of Static Hazards (SOP Form) 2.5.2 Summary: Elimination of Static Hazards in Two-Level Circuits 2.5.3 Static Hazards in Multilevel Circuits 2.5.4 Summary: Elimination of Static Hazards in Multilevel Circuits 2.5.5 Dynamic Hazards 2.6 Building Blocks for Logic Design 2.6.1 NAND—NOR Structures 2.6.2 Multiplexers 2.6.3 Demultiplexers 2.6.4 Encoders 2.6.5 Priority Encoder 2.6.6 Decoder 2.6.7 Priority Decoder References Problems 3 Fundamentals of Sequential Logic Design 69 3.1 Storage Elements 3.1.1 Latches 3.1.2 Transparent Latches 3.2 Flip-Flops 3.2.1 D-Type Flip-Flop 3.2.2 Master—Slave Flip-Flop 3.2.3 J-K Flip-Flops 3.2.4 T Flip-Flop 3.3 Busses and Three-State Devices 3.4 Design of Sequential Machines 3.5 State-Transition Graphs 3.6 Design Example: BCD to Excess-3 Code Converter 3.7 Serial-Line Code Converter for Data Transmission 3.7.1 Design Example: A Mealy-Type FSM for Serial Line-Code Conversion 3.7.2 Design Example: A Moore-Type FSM for Serial Line-Code Conversion 3.8 State Reduction and Equivalent States References Problems 4 Introduction to Logic Design with Verilog 103 4.1 Structural Models of Combinational Logic 4.1.1 Verilog Primitives and Design Encapsulation 4.1.2 Verilog Structural Models 4.1.3 Module Ports 4.1.4 Some Language Rules 4.1.5 Top-Down Design and Nested Modules 4.1.6 Design Hierarchy and Source-Code Organization 4.1.7 Vectors in Verilog 4.1.8 Structural Connectivity 4.2 Logic System, Design Verification, and Test Methodology 4.2.1 Four-Value Logic and Signal Resolution in Verilog 4.2.2 Test Methodology 4.2.3 Signal Generators for Testbenches 4.2.4 Event-Driven Simulation 4.2.5 Testbench Template 4.2.6 Sized Numbers 4.3 Propagation Delay 4.3.1 Inertial Delay 4.3.2 Transport Delay 4.4 Truth Table Models of Combinational and Sequential Logic with Verilog References Problems 5 Logic Design with Behavioral Models of Combinational and Sequential Logic 141 5.1 Behavioral Modeling 5.2 A Brief Look at Data Types for Behavioral Modeling 5.3 Boolean Equation-Based Behavioral Models of Combinational Logic 5.4 Propagation Delay and Continuous Assignments 5.5 Latches and Level-Sensitive Circuits in Verilog 5.6 Cyclic Behavioral Models of Flip-Flops and Latches 5.7 Cyclic Behavior and Edge Detection 5.8 A Comparison of Styles for Behavioral Modeling 5.8.1 Continuous Assignment Models 5.8.2 Dataflow/RTL Models 5.8.3 Algorithm-Based Models 5.8.4 Naming Conventions: A Matter of Style 5.8.5 Simulation with Behavioral Models 5.9 Behavioral Models of Multiplexers, Encoders, and Decoders 5.10 Dataflow Models of a Linear-Feedback Shift Register 5.11 Modeling Digital Machines with Repetitive Algorithms 5.11.1 Intellectual Property Reuse and Parameterized Models 5.11.2 Clock Generators 5.12 Machines with Multicycle Operations 5.13 Design Documentation with Functions and Tasks: Legacy or Lunacy? 5.13.1 Tasks 5.13.2 Functions 5.14 Algorithmic State Machine Charts for Behavioral Modeling 5.15 ASMD Charts 5.16 Behavioral Models of Counters, Shift Registers, and Register Files 5.16.1 Counters 5.16.2 Shift Registers 5.16.3 Register Files and Arrays of Registers (Memories) 5.17 Switch Debounce, Metastability, and Synchronizers for Asynchronous Signals 5.18 Design Example: Keypad Scanner and Encoder References Problems 6 Synthesis of Combinational and Sequential Logic 235 6.1 Introduction to Synthesis 6.1.1 Logic Synthesis 6.1.2 RTL Synthesis 6.1.3 High-Level Synthesis 6.2 Synthesis of Combinational Logic 6.2.1 Synthesis of Priority Structures 6.2.2 Exploiting Logical Don’t-Care Conditions 6.2.3 ASIC Cells and Resource Sharing 6.3 Synthesis of Sequential Logic with Latches 6.3.1 Accidental Synthesis of Latches 6.3.2 Intentional Synthesis of Latches 6.4 Synthesis of Three-State Devices and Bus Interfaces 6.5 Synthesis of Sequential Logic with Flip-Flops 6.6 Synthesis of Explicit State Machines 6.6.1 Synthesis of a BCD-to-Excess-3 Code Converter 6.6.2 Design Example: Synthesis of a Mealy-Type NRZ-to-Manchester Line Code Converter 6.6.3 Design Example: Synthesis of a Moore-Type NRZ-to-Manchester Line Code Converter 6.6.4 Design Example: Synthesis of a Sequence Recognizer 284 6.7 Registered Logic 6.8 State Encoding 6.9 Synthesis of Implicit State Machines, Registers, and Counters 6.9.1 Implicit State Machines 6.9.2 Synthesis of Counters 6.9.3 Synthesis of Registers 6.10 Resets 6.11 Synthesis of Gated Clocks and Clock Enables 6.12 Anticipating the Results of Synthesis 6.12.1 Synthesis of Data Types 6.12.2 Operator Grouping 6.12.3 Expression Substitution 6.13 Synthesis of Loops 6.13.1 Static Loops without Embedded Timing Controls 6.13.2 Static Loops with Embedded Timing Controls 6.13.3 Nonstatic Loops without Embedded Timing Controls 6.13.4 Nonstatic Loops with Embedded Timing Controls 6.13.5 State-Machine Replacements for Unsynthesizable Loops 6.14 Design Traps to Avoid 6.15 Divide and Conquer: Partitioning a Design References Problems 7 Design and Synthesis of Datapath Controllers 345 7.1 Partitioned Sequential Machines 7.2 Design Example: Binary Counter 7.3 Design and Synthesis of a RISC Stored-Program Machine 7.3.1 RISC SPM: Processor 7.3.2 RISC SPM:ALU 7.3.3 RISC SPM: Controller 7.3.4 RISC SPM: Instruction Set 7.3.5 RISC SPM: Controller Design 7.3.6 RISC SPM: Program Execution 7.4 Design Example: UART 7.4.1 UART Operation 7.4.2 UART Transmitter 7.4.3 UART Receiver References Problems 8 Programmable Logic and Storage Devices 415 8.1 Programmable Logic Devices 8.2 Storage Devices 8.2.1 Read-Only Memory (ROM) 8.2.2 Programmable ROM (PROM) 8.2.3 Erasable ROMs 8.2.4 ROM-Based Implementation of Combinational Logic 8.2.5 Verilog System Tasks for ROMs 8.2.6 Comparison of ROMs 8.2.7 ROM-Based State Machines 8.2.8 Flash Memory 8.2.9 Static Random Access Memory (SRAM) 8.2.10 Ferroelectric Nonvolatile Memory 8.3 Programmable Logic Array (PLA) 8.3.1 PLA Minimization 8.3.2 PLA Modeling 8.4 Programmable Array Logic (PAL) 8.5 Programmability of PLDs 8.6 Complex PLDs (CPLDs) 8.7 Field-Programmable Gate Arrays 8.7.1 The Role of FPGAs in the ASIC Market 8.7.2 FPGA Technologies 8.7.3 XILINX Virtex FPGAs 8.8 Embeddable and Programmable IP Cores for a System-on-a-Chip (SoC) 8.9 Verilog-Based Design Flows for FPGAs 8.10 Synthesis with FPGAs References Related Web Sites Problems and FPGA-Based Design Exercises 9 Algorithms and Architectures for Digital Processors 515 9.1 Algorithms, Nested-Loop Programs, and Data Flow Graphs 9.2 Design Example: Halftone Pixel Image Converter 9.2.1 Baseline Design for a Halftone Pixel Image Converter 9.2.2 NLP-Based Architectures for the Halftone Pixel Image Converter 9.2.3 Minimum Concurrent Processor Architecture for a Halftone Pixel Image Converter 9.2.4 Halftone Pixel Image Converter: Design Tradeoffs 9.2.5 Architectures for Dataflow Graphs with Feedback 9.3 Digital Filters and Signal Processors 9.3.1 Finite-Duration Impulse Response Filter 9.3.2 Digital Filter Design Process 9.3.3 Infinite-Duration Impulse Response Filter 9.4 Building Blocks for Signal Processors 9.4.1 Integrators (Accumulators) 9.4.2 Differentiators 9.4.3 Decimation and Interpolation Filters 9.5 Pipelined Architectures 9.5.1 Design Example: Pipelined Adder 9.5.2 Design Example: Pipelined FIR Filter 9.6 Circular Buffers 9.7 Asynchronous FIFOs–Synchronization across Clock Domains 9.7.1 Simplified Asynchronous FIFO 9.7.2 Clock Domain Synchronization for an Asynchronous FIFO References Problems 10 Architectures for Arithmetic Processors 627 10.1 Number Representation 10.1.1 Signed Magnitude Representation of Negative Integers 10.1.2 Ones Complement Representation of Negative Integers 10.1.3 Twos Complement Representation of Positive and Negative Integers 10.1.4 Representation of Fractions 10.2 Functional Units for Addition and Subtraction 10.2.1 Ripple-Carry Adder 10.2.2 Carry Look-Ahead Adder 10.2.3 Overflow and Underflow 10.3 Functional Units for Multiplication 10.3.1 Combinational (Parallel) Binary Multiplier 10.3.2 Sequential Binary Multiplier 10.3.3 Sequential Multiplier Design: Hierarchical Decomposition 10.3.4 STG-Based Controller Design 10.3.5 Efficient STG-Based Sequential Binary Multiplier 10.3.6 ASMD-Based Sequential Binary Multiplier 10.3.7 Efficient ASMD-Based Sequential Binary Multiplier 10.3.8 Summary of ASMD-Based Datapath and Controller Design 10.3.9 Reduced-Register Sequential Multiplier 10.3.10 Implicit-State-Machine Binary Multiplier 10.3.11 Booth’s Algorithm Sequential Multiplier 10.3.12 Bit-Pair Encoding 10.4 Multiplication of Signed Binary Numbers 10.4.1 Product of Signed Numbers: Negative Multiplicand, Positive Multiplier 10.4.2 Product of Signed Numbers: Positive Multiplicand, Negative Multiplier 10.4.3 Product of Signed Numbers: Negative Multiplicand, Negative Multiplier 10.5 Multiplication of Fractions 10.5.1 Signed Fractions: Positive Multiplicand, Positive Multiplier 10.5.2 Signed Fractions: Negative Multiplicand, Positive Multiplier 10.5.3 Signed Fractions: Positive Multiplicand, Negative Multiplier 10.5.4 Signed Fractions: Negative Multiplicand, Negative Multiplier 10.6 Functional Units for Division 10.6.1 Division of Unsigned Binary Numbers 10.6.2 Efficient Division of Unsigned Binary Numbers 10.6.3 Reduced-Register Sequential Divider 10.6.4 Division of Signed (2s Complement) Binary Numbers 10.6.5 Signed Arithmetic References Problems 11 Postsynthesis Design Tasks 749 11.1 Postsynthesis Design Validation 11.2 Postsynthesis Timing Verification 11.2.1 Static Timing Analysis 11.2.2 Timing Specifications 11.2.3 Factors That Affect Timing 11.3 Elimination of ASIC Timing Violations 11.4 False Paths 11.5 System Tasks for Timing Verification 11.5.1 Timing Check: Setup Condition 11.5.2 Timing Check: Hold Condition 11.5.3 Timing Check: Setup and Hold Conditions 11.5.4 Timing Check: Pulsewidth Constraint 11.5.5 Timing Check: Signal Skew Constraint 11.5.6 Timing Check: Clock Period 11.5.7 Timing Check: Recovery Time 11.6 Fault Simulation and Manufacturing Tests 11.6.1 Circuit Defects and Faults 11.6.2 Fault Detection and Testing 11.6.3 D-Notation 11.6.4 Automatic Test Pattern Generation for Combinational Circuits 11.6.5 Fault Coverage and Defect Levels 11.6.6 Test Generation for Sequential Circuits 11.7 Fault Simulation 11.7.1 Fault Collapsing 11.7.2 Serial Fault Simulation 11.7.3 Parallel Fault Simulation 11.7.4 Concurrent Fault Simulation 11.7.5 Probabilistic Fault Simulation 11.8 JTAG Ports and Design for Testability 11.8.1 Boundary Scan and JTAG Ports 11.8.2 JTAG Modes of Operation 11.8.3 JTAG Registers 11.8.4 JTAG Instructions 11.8.5 TAP Architecture 11.8.6 TAP Controller State Machine 11.8.7 Design Example:Testing with JTAG 11.8.8 Design Example: Built-In Self-Test References Problems A Verilog Primitives 851 A.1 Multiinput Combinational Logic Gates A.2 Multioutput Combinational Gates A.3 Three-State Logic Gates A.4 MOS Transistor Switches A.5 MOS Pull-Up/Pull-Down Gates A.6 MOS Bidirectional Switches B Verilog Keywords 863 C Verilog Data Types 865 C.1 Nets C.2 Register Variables C.3 Constants C.4 Referencing Arrays of Nets or Regs D Verilog Operators 873 D.1 Arithmetic Operators D.2 Bitwise Operators D.3 Reduction Operators D.4 Logical Operators D.5 Relational Operators D.6 Shift Operators D.7 Conditional Operator D.8 Concatenation Operator D.9 Expressions and Operands D.10 Operator Precedence D.11 Arithmetic with Signed Data Types D.12 Signed Literal Integers D.13 System Functions for Sign Conversion 2.1.1 Assignment Width Extension E Verilog Language Formal Syntax 885 F Verilog Language Formal Syntax 887 F.1 Source text F.2 Declarations F.3 Primitive instances F.4 Module and generated instantiation F.5 UDP declaration and instantiation F.6 Behavioral statements F.7 Specify section F.8 Expressions F.9 General G Additional Features of Verilog 913 G.1 Arrays of Primitives G.2 Arrays of Modules G.3 Hierarchical Dereferencing G.4 Parameter Substitution G.5 Procedural Continuous Assignment G.6 Intra-Assignment Delay G.7 Indeterminate Assignment and Race Conditions G.8 wait STATEMENT G.9 fork join Statement G.10 Named (Abstract) Events G.11 Constructs Supported by Synthesis Tools H Flip-Flop and Latch Types 925 I Verilog-2001, 2005 927 I.1 ANSI C Style Changes I.2 Code Management I.3 Support for Logic Modeling I.4 Support for Arithmetic I.5 Sensitivity List for Event Control I.6 Sensitivity List for Combinational Logic I.7 Parameters I.8 Instance Generation J Programming Language Interface 949 K Web sites 951 L Web-Based Resources 953 Index 965
£197.03
Penguin Books Ltd Turings Cathedral
Book SynopsisGeorge Dyson''s fascinating account of the early years of computers: Turing''s Cathedral is the story behind how the PC, ipod, smartphone and almost every aspect of modern life came into being.In 1945 a small group of brilliant engineers and mathematicians gathered at the Institute for Advanced Study in Princeton, determined to build a computer that would make Alan Turing''s theory of a ''universal machine'' reality. Led by the polymath émigré John von Neumann, they created the numerical framework that underpins almost all modern computing - and ensured that the world would never be the same again.George Dyson is a historian of technology whose interests include the development (and redevelopment) of the Aleut kayak. He is the author of Baidarka; Project Orion; and Darwin Among the Machines.''Unusual, wonderful, visionary'' Francis Spufford, Guardian''Fascinating . . . the story Dyson tells is intensely human . . . a grippiTrade ReviewRiveting . . . conveys the electrifying sense of possibility that the first computers unleashed . . . a page-turner * New Scientist *Brings to life a myriad cast of extraordinary characters, each of whom contributed to ushering in today's digital age * Daily Telegraph *An engrossing and well-researched book that recounts an important chapter in the history of 20th-century computing -- Evgeny Morozov * Observer *
£12.59
Oxford University Press Natural General Intelligence
Book SynopsisSince the time of Turing, computer scientists have dreamed of building artificial general intelligence (AGI) - a system that can think, learn and act as humans do. Over recent years, the remarkable pace of progress in machine learning research has reawakened discussions about AGI. But what would a generally intelligent agent be able to do? What algorithms, architectures, or cognitive functions would it need? To answer these questions, we turn to the study of natural intelligence. Humans (and many other animals) have evolved precisely the sorts of generality of function that AI researchers see as the defining hallmark of intelligence. The fields of cognitive science and neuroscience have provided us with a language for describing the ingredients of natural intelligence in terms of computational mechanisms and cognitive functions and studied their implementation in neural circuits. Natural General Intelligence describes the algorithms and architectures that are driving progress in AI research in this language, by comparing current AI systems and biological brains side by side. In doing so, it addresses deep conceptual issues concerning how perceptual, memory and control systems work, and discusses the language in which we think and the structure of our knowledge. It also grapples with longstanding controversies about the nature of intelligence, and whether AI researchers should look to biology for inspiration. Ultimately, Summerfield aims to provide a bridge between the theories of those who study biological brains and the practice of those who are seeking to build artificial brains.Trade ReviewThis book will be of interest to students and researchers in cognitive psychology, neuroscience, computer science, and cognitive science. * Choice *Table of Contents1: Turing's question 2: The nature of intelligence 3: The language of thought 4: The structure of knowledge 5: The problem of abstraction 6: The value of action 7: The control of memory 8: A picture of the mind
£72.50
Oxford University Press Combinatorial Physics Combinatorics Quantum Field
Book SynopsisThe goal of the book is to use combinatorial techniques to solve fundamental physics problems, and vice-versa, to use theoretical physics techniques to solve combinatorial problems.Trade ReviewA useful compendium of relevant subjects and it give the information about useful references in the field. * Juan Carlos Vazquez, zb Math Open *An outstanding book on a recent and very timely topic. * Vincent Rivasseau, University Paris-Sud XI, Orsay *This book appears at a time where there is a crucial need for such a cross-fertilisation of combinatorics and theoretical physics. * Thomas Krajewski, Aix-Marseille University *Table of Contents1: Introduction 2: Graphs, maps and polynomials 3: Quantum field theory (QFT) 4: Tree weights and renormalization in QFT 5: Combinatorial QFT and the Jacobian Conjecture 6: Fermionic QFT, Grassmann calculus and combinatorics 7: Analytic combinatorics and QFT 8: Algebraic combinatorics and QFT 9: QFT on the non-commutative Moyal space and combinatorics 10: Quantum gravity, Group Field Theory and combinatorics 11: From random matrices to random tensors 12: Random tensor models - the U(N)D-invariant model 13: Random tensor models - the multi-orientable (MO) model 14: Random tensor models - the O(N)3 invariant model 15: The Sachdev-Ye-Kitaev holographic model 16: SYK-like tensor models Appendix A: Examples of tree weights B: Renormalization of the Grosse-Wulkenhaar model, one-loop examples C: The B+ operator in Moyal QFT, two-loop examples D: Explicit examples of GFT tensor Feynman integral computations E: Coherent states of SU(2) F: Proof of the double scaling limit of the U(N)D??invariant tensor model G: Proof of Theorem 15.3.2 H: Proof of Theorem 16.1.1 J: Summary of results on the diagrammatics of the coloured SYK model and of the Gurau-Witten model Bibliography
£107.78
Oxford University Press Inc Ethical Data Science
Book SynopsisCan data science truly serve the public interest? Data-driven analysis shapes many interpersonal, consumer, and cultural experiences yet scientific solutions to social problems routinely stumble. All too often, predictions remain solely a technocratic instrument that sets financial interests against service to humanity. Amidst a growing movement to use science for positive change, Anne L. Washington offers a solution-oriented approach to the ethical challenges of data science. Ethical Data Science empowers those striving to create predictive data technologies that benefit more people. As one of the first books on public interest technology, it provides a starting point for anyone who wants human values to counterbalance the institutional incentives that drive computational prediction. It argues that data science prediction embeds administrative preferences that often ignore the disenfranchised. The book introduces the prediction supply chain to highlight moral questions alongside the iTable of ContentsIntroduction: Ethical data science Prologue: Tracking ethics in a prediction supply chain 1: SOURCE - Data are people too 2: MODEL - Dear validity: Advice for wayward algorithms 3: COMPARE - Category hacking 4: OPTIMIZE - Data science reasoning 5: LEARN - For good 6: Show us your work or someone gets hurt 7: Prediction in the public interest References Index
£25.99
OUP Oxford Computers in Chemistry
Book SynopsisThis Primer provides an authoritative and easy to read overview of computers and their use in chemistry. It presents the essential basic ideas required to understand and exploit computers as encountered by chemistry students in their studies and in the laboratory at all stages up to and including research level. It gives its readers an insight into the workings of computers and so helps them to use the facilities more effectively.
£27.99