Algorithms and data structures Books

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

Book SynopsisA walkthrough of computer science concepts you must know. Designed for readers who don't care for academic formalities, it's a fast and easy computer science guide. It teaches the foundations you need to program computers effectively. After a simple introduction to discrete math, it presents common algorithms and data structures. It also outlines the principles that make computers and programming languages work.

Read more less

Book SynopsisDiscrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover''s search algorithm. These walks are constructed on an underlying graph, and so there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory.Table of ContentsPreface; 1. Grover search; 2. Two reflections; 3. Applications; 4. Averaging: 5. Covers and embeddings; 6. Vertex-face walks; 7. Shunts; 8. 1-Dimensional walks; References; Glossary; Index.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

Table of Contents Introduction to Backup and Recovery Backup Software Physical Backup Media Virtual Backup Media New Media Technologies Software Architectures: CommVault Software Architectures: NetBackup Application Backup Strategies Putting It All Together: Sample Backup Environments Monitoring and Reporting Summary

Read more less

Book SynopsisBeginning Oracle SQL is your introduction to the interactive query tools and specific dialect of SQL used with Oracle Database.Table of Contents1. Relational Database Systems and Oracle2. Introduction to SQL and SQL*Plus, and SQL Developer3. Data Definition, Part I4. Retrieval: The Basics5. Retrieval: Functions6. Data Manipulation7. Data Definition, Part II8. Retrieval: Joins and Grouping9. Retrieval: Advanced Features10. Views11. Automating12. Object-Relational Features13. Appendix A – Case Tables14. Appendix B – Exercise Solutions

Read more less

Book SynopsisExpert Oracle RAC Performance Diagnostics and Tuning provides comprehensive coverage of the features, technology and principles for testing and tuning RAC databases. The book takes a deep look at optimizing RAC databases by following a methodical approach based on scientific analysis rather than using a speculative approach, twisting and turning knobs and gambling on the system.The book starts with the basic concepts of tuning methodology, capacity planning, and architecture. Author Murali Vallath then dissects the various tiers of the testing implementation, including the operating system, the network, the application, the storage, the instance, the database, and the grid infrastructure. He also introduces tools for performance optimization and thoroughly covers each aspect of the tuning process, using many real-world examples, analyses, and solutions from the field that provide you with a solid, practical, and replicable approach to tuning a RAC enTable of Contents1. Methodology2. Capacity Planning and Architecture3. Testing for Availability4. Testing for Scalability5. Real Application Testing6. Tools and Utilities7. SQL Tuning8. Parallel Query Tuning9. Tuning the Database10. Tuning Recovery11. Tuning Oracle Net12. Tuning Storage Subsystem13. Tuning Global Cache14. Tuning the Cluster Interconnect15. Optimization of Distributed Workload16. Tuning the Oracle Clusterware17. Enqueues, Waits and Latches18. Problem DiagnosticsA. The SQL Scripts Used in This BookBibliography

Read more less

Book SynopsisThe Origins of Real-Time Processing.- The Concept of Time in the Specification of Real-Time Systems.- Language-Independent Schedulability Analysis of Real-Time Programs.- Which Theory Matches Automation Engineering?.- Requirements Engineering for Real-Time and Embedded Systems.- Real-Time Programming Languages.- Comparison of Synchronization Concepts.- Real-Time Database Systems.- Microprocessor Architectures: A Basis for Real-Time Systems.- Buses in Real-Time Environments.- Distributed Systems for Real Time Applications.- Robot Programming.- Real-Time Data Processing of the Sensory Data of a Multi- Fingered Dextrous Robot Hand.- Fly-By-Wire Systems for Military High Performance Aircraft.- Artificial Intelligence Techniques in Real-Time Processing.- Recommendations for a Real-Time Systems Curriculum.Table of ContentsForeword. I: Introduction. 1. The Origins of Real-Time Processing; M. Schiebe. II: Theoretical Foundations. 2. The Concept of Time in the Specification of Real-Time Systems; B. Hoogeboom, W.A. Halang. 3. Language-Independent Schedulability Analysis of Real-Time Programs; A.D. Stoyenko. III: Models and Tools 4. Which Theory Matches Automation Engineering? Petri-Nets as a Formal Basis; E. Schnieder. 5. Requirements Engineering for Real-Time and Embedded Systems; P. Hruschka. IV: Practical Considerations. 6. Real-Time Programming Languages; W.A. Halang, K.-O. Mangold. 7. Comparison of Synchronization Concepts of Ada, Concurrent C and PEARL; K.-F. Gebhardt. 8. Real-Time Database Systems; H. Windauer. 9. Microprocessor Architectures: A Basis for Real-Time Systems; T. Bemmerl. 10. Buses in Real-Time Environments; F. Demmelmeier. 11. Distributed Systems for Real-Time Applications Using Manufacturing Automation as an Example; H. Rzehak. 12. Robot Programming; K. Fischer, B. Glavina, E. Hagg, G. Schrott, J. Schweiger, H.-J. Siegert. V: Examples for Applications. 13. Real-Time Data Processing of the Sensory Data of Multi-Fingered Dextrous Hand; A. Knoll. 14. Fly-By-Wire Systems for Military High Performance Aircraft; D. Langer, J. Rauch, M. Rößler. VI: Future Developments. 15. Artificial Intelligence Techniques in Real-Time Processing; K. Kratzer. 16. Recommendations for a Real-Time Systems Curriculum; W.A. Halang. Glossary. Index.

Read more less

Book SynopsisProgram in assembly starting with simple and basic programs, all the way up to AVX programming. By the end of this book, you will be able to write and read assembly code, mix assembly with higher level languages, know what AVX is, and a lot more than that. The code used in Beginning x64 Assembly Programming is kept as simple as possible, which means: no graphical user interfaces or whistles and bells or error checking. Adding all these nice features would distract your attention from the purpose: learning assembly language. The theory is limited to a strict minimum: a little bit on binary numbers, a short presentation of logical operators, and some limited linear algebra. And we stay far away from doing floating point conversions. The assembly code is presented in complete programs, so that you can test them on your computer, play with them, change them, break them. This book will also show you what tools can be Table of Contents

Read more less

Book SynopsisPreface.- Introduction.- 1 An Introduction to Cryptography.- 2 Discrete Logarithms and Diffie-Hellman.- 3 Integer Factorization and RSA.- 4 Digital Signatures.- 5 Combinatorics, Probability, and Information Theory.- 6 Elliptic Curves and Cryptography.- 7 Lattices and Cryptography.- 8 Additional Topics in Cryptography.- List of Notation.- References.- Index.Trade Review“This book explains the mathematical foundations of public key cryptography in a mathematically correct and thorough way without omitting important practicalities. … I would like to emphasize that the book is very well written and quite clear. Topics are well motivated, and there are a good number of examples and nicely chosen exercises. To me, this book is still the first-choice introduction to public-key cryptography.” (Klaus Galensa, Computing Reviews, March, 2015)“This is a text for an upper undergraduate/lower graduate course in mathematical cryptography. … It is very well written and quite clear. Topics are well-motivated, and there are a good number of examples and nicely chosen exercises. … An instructor of a fairly sophisticated undergraduate course in cryptography who wants to emphasize public key cryptography should definitely take a look at this book.” (Mark Hunacek, MAA Reviews, October, 2014)Table of ContentsPreface.- Introduction.- 1 An Introduction to Cryptography.- 2 Discrete Logarithms and Diffie-Hellman.- 3 Integer Factorization and RSA.- 4 Digital Signatures.- 5 Combinatorics, Probability, and Information Theory.- 6 Elliptic Curves and Cryptography.- 7 Lattices and Cryptography.- 8 Additional Topics in Cryptography.- List of Notation.- References.- Index.

Read more less

Book SynopsisRandom Number Generators, Principles and Practices has been written for programmers, hardware engineers, and sophisticated hobbyists interested in understanding random numbers generators and gaining the tools necessary to work with random number generators with confidence and knowledge. Using an approach that employs clear diagrams and running code examples rather than excessive mathematics, random number related topics such as entropy estimation, entropy extraction, entropy sources, PRNGs, randomness testing, distribution generation, and many others are exposed and demystified. If you have ever Wondered how to test if data is really random Needed to measure the randomness of data in real time as it is generated Wondered how to get randomness into your programs Wondered whether or not a random number generator is trustworthy Wanted to be able to choose between random number generator solutions Needed to turn uniform random data into a different distribution NeededTable of Contents1 Introduction 1.1 Tools 1.2 Terminology 1.3 The Many Types of Random Numbers 1.3.1 Uniform Random Numbers 2 Random Number Generators 2.1 Classes of Random Number Generators 2.2 Names for RNGs 3 Making Random Numbers 3.1 A Quick Overview of the RNG Types 3.2 The Structure of Full RNG Implementations 3.3 Pool Extractor Structures 3.4 Multiple Input Extractors 4 Physically Uncloneable Functions 21 4.1 The other kind âAS Static vs. Dynamic Random Number Generators . 5 Testing Random Numbers 5.1 Known Answer Tests 5.2 Distinguishing From Random 5.3 PRNG Test Suites 5.4 Entropy Measurements 5.5 Min Entropy Estimation 5.6 Model Equivalence Testing 5.7 Statistical Prerequisite Testing 5.8 The problem Distinguishing Entropy and Pseudo-randomness 5.9 PRNG Tests: DieHarder, NIST SP800-22,TestU01, China ICS 35.040 5.10 Entropy Measurements 5.11 Min Entropy Measurements 5.12 Modeling to Test a Source 5.13 Statistical Prerequisites 5.14 Testing for bias . 5.15 results that are âAŸtoo goodâAZ (E.G. Chi-square == 0.5) 5.16 Distinguishing Correlation from Bias 5.17 Testing for Stationary properties 5.18 FFT analysis 5.19 Online Testing 5.20 Working From the Source RNG 5.21 Tools 5.22 Summary 6 Entropy Extraction or Distillation 6.1 A simple extractor, the XOR gate 6.2 A simple way of improving the distribution of random numbers that have known missing values using XOR 7 Quantifying Entropy 7.1 Rényi Entropy 7.2 Distance From Uniform Topics to put somewhere in the book- in existing chapters and new chapters 8.1 XOR as a 2 bit extractor 8.2 Properties of real random numbers 8.3 Binomial distributions 8.4 Normal distributions 8.4.1 Dice, more dice 8.4.2 Central limit theorem 8.5 Seeing patterns 8.6 Regression to the mean 8.7 Lack of correlation, bias, algorithmic connections, predictability 8.8 What’s a True random number? 8.9 Random numbers in cryptography 8.10 Things they help with liveness, unpredictability, resistance to attacks 8.11 Examples of use 8.11.1 Salting Passwords . 8.11.2 802.11i exchange 8.11.3 PKMv2 exchange 8.11.4 Making Keys 8.12 Examples of RNG crypto failures 8.12.1 Sony PS3 attack 8.12.2 MiFare Classic 8.12.3 Online Poker 8.12.4 Debian OpenSSL Fiasco 8.12.5 Linux Boot Time Entropy 8.13 Humans and random numbers 8.14 Result of asking people for a random number 8.14.1 Normal People 8.14.2 Crypto People 8.15 Mental Random Number Tricks 8.15.1 How to think of a really random number 8.16 PRNGs 8.17 extractors 8.17.1 CBC MAC 8.17.2 BIW 8.17.3 Von Neumann 8.18 Extractor Theory 8.19 Random Number Standards 8.19.1 SP800-90A B C . 8.19.2 Ansi X9.82 8.20 PRNG Algorithms 8.20.1 SP800-90A CTR DRBG 8.20.2 SP800-90A SHA DRBG 8.20.3 XOR Construction 8.20.4 Oversampling Construction 8.21 Yarrow 8.22 Whirlpool 8.23 Linux Kernel random service 8.24 Appendices 8.25 Resources 8.25.1 SW Sources 8.25.2 Online random number sources 8.26 Example Algorithm Vectors 8.26.1 SP800-90A CTR DRBG 128 & 256 8.26.2 SP800-90A Hash DRBG SHA-1 & SHA 256 8.26.3 AES-CBC-MAC Conditioner 128 8.26.4 AES-CBC-MAC Conditioner 8.27 SP800-90 LZ Tests Issues

Read more less

Book SynopsisA comprehensive guide to help aspiring and professional C++ developers elevate the performance of their apps by allowing them to run faster and consume fewer resources.Purchase of the print or Kindle book includes a free eBook in PDF format.Key Features Updated to C++20 with completely revised code and more content on error handling, benchmarking, memory allocators, and concurrent programming Explore the latest C++20 features including concepts, ranges, and coroutines Utilize C++ constructs and techniques to carry out effective data structure optimization and memory management Book DescriptionC++ High Performance, Second Edition guides you through optimizing the performance of your C++ apps. This allows them to run faster and consume fewer resources on the device they're running on without compromising the readability of your codebase. The book begins by introducing the C++ language and some of its modern concepts in brief. Once you are familiar with the fundamentals, you will be ready to measure, identify, and eradicate bottlenecks in your C++ codebase. By following this process, you will gradually improve your style of writing code. The book then explores data structure optimization, memory management, and how it can be used efficiently concerning CPU caches. After laying the foundation, the book trains you to leverage algorithms, ranges, and containers from the standard library to achieve faster execution, write readable code, and use customized iterators. It provides hands-on examples of C++ metaprogramming, coroutines, reflection to reduce boilerplate code, proxy objects to perform optimizations under the hood, concurrent programming, and lock-free data structures. The book concludes with an overview of parallel algorithms. By the end of this book, you will have the ability to use every tool as needed to boost the efficiency of your C++ projects.What you will learn Write specialized data structures for performance-critical code Use modern metaprogramming techniques to reduce runtime calculations Achieve efficient memory management using custom memory allocators Reduce boilerplate code using reflection techniques Reap the benefits of lock-free concurrent programming Gain insights into subtle optimizations used by standard library algorithms Compose algorithms using ranges library Develop the ability to apply metaprogramming aspects such as constexpr, constraints, and concepts Implement lazy generators and asynchronous tasks using C++20 coroutines Who this book is forIf you're a C++ developer looking to improve the efficiency of your code or just keen to upgrade your skills to the next level, this book is for you.Table of ContentsTable of Contents A Brief Introduction to C++ Essential C++ Techniques Analyzing and Measuring Performance Data Structures Algorithms Using Ranges and Views Memory Management Compile-Time Programming Essential Utilities Proxy Objects and Lazy Evaluation Concurrency Coroutines and Lazy Generators Asynchronous Programming with Coroutines Parallel STL Algorithms

Read more less