Algorithms and data structures Books

992 products


  • Introduction to Algorithms fourth edition

    MIT Press Introduction to Algorithms fourth edition

    15 in stock

    Book Synopsis

    15 in stock

    £116.00

  • Deep Learning with PyTorch

    Manning Publications Deep Learning with PyTorch

    7 in stock

    Book SynopsisEvery other day we hear about new ways to put deep learning to good use: improved medical imaging, accurate credit card fraud detection, long range weather forecasting, and more. PyTorch puts these superpowers in your hands, providing a comfortable Python experience that gets you started quickly and then grows with you as you, and your deep learning skills, become more sophisticated. Deep Learning with PyTorch teaches you how to implement deep learning algorithms with Python and PyTorch. This book takes you into a fascinating case study: building an algorithm capable of detecting malignant lung tumors using CT scans. As the authors guide you through this real example, you'll discover just how effective and fun PyTorch can be. Key features • Using the PyTorch tensor API • Understanding automatic differentiation in PyTorch • Training deep neural networks • Monitoring training and visualizing results • Interoperability with NumPy Audience Written for developers with some knowledge of Python as well as basic linear algebra skills. Some understanding of deep learning will be helpful, however no experience with PyTorch or other deep learning frameworks is required. About the technology PyTorch is a machine learning framework with a strong focus on deep neural networks. Because it emphasizes GPU-based acceleration, PyTorch performs exceptionally well on readily-available hardware and scales easily to larger systems. Eli Stevens has worked in Silicon Valley for the past 15 years as a software engineer, and the past 7 years as Chief Technical Officer of a startup making medical device software. Luca Antiga is co-founder and CEO of an AI engineering company located in Bergamo, Italy, and a regular contributor to PyTorch.

    7 in stock

    £37.99

  • Deep Learning Crash Course

    No Starch Press,US Deep Learning Crash Course

    2 in stock

    2 in stock

    £40.49

  • HBRs 10 Must Reads on Data Strategy

    Harvard Business Review Press HBRs 10 Must Reads on Data Strategy

    1 in stock

    Book Synopsis

    1 in stock

    £20.21

  • A History of Data Visualization and Graphic

    Harvard University Press A History of Data Visualization and Graphic

    10 in stock

    Book SynopsisStatistical graphing was born in the seventeenth century as a scientific tool, but it quickly escaped all disciplinary bounds. Today graphics are ubiquitous in daily life. Michael Friendly and Howard Wainer detail the history of data visualization and argue that it has not only helped us solve problems, but it has also changed the way we think.Trade ReviewThe invention of graphs and charts was a much quieter affair than that of the telescope, but these tools have done just as much to change how and what we see. -- Hannah Fry * New Yorker *An indispensable account of how important practitioners of data visualizations write the history of their field. -- Crystal Lee * Information & Culture *We live in an era of data dependence—never before have graphic representations of data been as essential and sought after as at this moment…There has not been a publication of this scope on the evolution of graphic representation of qualitative and quantitative data since Funkhouser’s work…Scholars, practitioners, lovers of statistics and data visualization, and anyone interested in understanding the methods and techniques of today will benefit from understanding the innovations that brought us to where we are. -- María del Mar Navarro * Journal of Design, Economics, and Innovation *A thoughtful and well-written introduction to the world of data visualization and its history. -- Bill Satzer * MAA Reviews *An intellectually fascinating book…The audience for this book is wide. It would be useful to professionals and to professors in many departments such as psychology, sociology, economics, biology, physics, and any department that uses graphs to display quantitative information. It is a book to broaden your knowledge and offer interesting asides for lectures and meetings…Consult it frequently to learn of the stories of the developers of the many graphic methods we use today. -- Malcolm James Ree * Personnel Psychology *A marvel of research scholarship…This is the sort of book that one can browse and sample in bite-size chunks as the mood seizes, encountering curious delights while doing so. -- Bert Gunter * Significance *A masterly study of graphic innovations, their context, and their scientific use. This brilliant book, without equivalent, is an indispensable read. -- Gilles Palsky, coauthor of An Atlas of Geographical WondersFriendly and Wainer are the Watson and Crick of statistical graphics, showing us the history of the DNA structure that is the code of life for innovative visualizations. -- Ben Shneiderman, founder of the Human-Computer Interaction Lab, University of MarylandData expertise is a fundamental prerequisite for success in our digital age. But exactly how, and when, have we learned to draw conclusions from data? For decades, Michael Friendly and Howard Wainer have been studying how data has informed decision-making, through visualization and statistical analysis. Replete with mesmerizing visual examples, this book is an eye-opening distillation of their research. -- Sandra Rendgen, author of History of Information GraphicsMichael Friendly and Howard Wainer have given us a wonderful history of the dazzling field of data visualization. They bring new life to ancient death statistics and describe the artistic poetry used to display numbers. An intriguing story of how we have learned to communicate data of all types. -- Stephen M. Stigler, author of The Seven Pillars of Statistical WisdomTwo of the most distinguished scholars of data visualization give us a glimpse of ancient attempts to quantify the world, before revealing the century-long revolution that led to the invention of modern statistics and many of the graphical methods we use today. I learned a lot from this book, and I think you will too. -- Alberto Cairo, author of How Charts Lie: Getting Smarter about Visual InformationFriendly and Wainer demonstrate the amazing progress that has been made in data graphics over the past two hundred years. Understanding this history—where graphs came from and how they developed—will be valuable as we move forward. -- Andrew Gelman, coauthor of Regression and Other Stories

    10 in stock

    £30.56

  • Absolute Beginners Guide to Algorithms

    Pearson Education (US) Absolute Beginners Guide to Algorithms

    7 in stock

    Book SynopsisKirupa Chinnathambi has spent most of his life teaching others to love web development as much as he does. He founded KIRUPA, one of the Web's most popular free web development education resources, serving 210,000+ registered members. Now a product manager at Google, he has authored several books, including Learning React (2017). He holds a B.S. in computer science from MIT.Table of ContentsPart I: Data Structures Chapter 1. Introduction to Data Structures .................................................................. 1 Right Tool for the Right Job .................................................................................... 2 Back to Data Structures ........................................................................................... 5 Conclusion ................................................................................................................. 6 Chapter 2. Big-O Notation and Complexity Analysis ................................................... 7 It's Example Time ...................................................................................................... 8 It's Big-O Notation Time! .......................................................................................11 Conclusion ...............................................................................................................15 Chapter 3. Arrays ....................................................................................................... 17 What Is an Array? ....................................................................................................18 Array Implementation / Use Cases .......................................................................24 Arrays and Memory ................................................................................................26 Performance Considerations .................................................................................30 Conclusion ...............................................................................................................32 Chapter 4. Linked Lists ............................................................................................... 35 Meet the Linked List ...............................................................................................36 Linked List: Time and Space Complexity .............................................................40 Linked List Variations ..............................................................................................41 Implementation .......................................................................................................44 Conclusion ...............................................................................................................52 Chapter 5. Stacks ........................................................................................................ 53 Meet the Stack ........................................................................................................54 A JavaScript Implementation ................................................................................56 Stacks: Time and Space Complexity ....................................................................58 Conclusion ...............................................................................................................59 Chapter 6. Queues ..................................................................................................... 61 Meet the Queue .....................................................................................................62 A JavaScript Implementation ................................................................................64 Queues: Time and Space Complexity ..................................................................66 Conclusion ...............................................................................................................67 Chapter 7. Trees ......................................................................................................... 69 Trees 101 .................................................................................................................70 Height and Depth ...................................................................................................75 Conclusion ...............................................................................................................77 Chapter 8. Binary Trees .............................................................................................. 79 Meet the Binary Tree ..............................................................................................80 A Simple Binary Tree Implementation ..................................................................86 Conclusion ...............................................................................................................89 Chapter 9. Binary Search Trees ................................................................................... 91 It's Just a Data Structure ........................................................................................93 Implementing a Binary Search Tree ....................................................................103 Performance and Memory Characteristics .........................................................110 Conclusion .............................................................................................................112 Chapter 10. Heaps ...................................................................................................... 113 Meet the Heap ......................................................................................................114 Heap Implementation ..........................................................................................126 Performance Characteristics ................................................................................132 Conclusion .............................................................................................................134 Chapter 11. Hashtable (aka Hashmap or Dictionary) .................................................. 137 A Very Efficient Robot ..........................................................................................138 From Robots to Hashing Functions ....................................................................142 From Hashing Functions to Hashtables .............................................................145 JavaScript Implementation/Usage ......................................................................148 Dealing with Collisions .........................................................................................150 Performance and Memory ...................................................................................151 Conclusion .............................................................................................................153 Chapter 12. Trie (aka Prefix Tree) ............................................................................... 155 What Is a Trie? ......................................................................................................156 Diving Deeper into Tries ......................................................................................167 Many More Examples Abound! ..........................................................................172 Implementation Time ...........................................................................................173 Performance ..........................................................................................................179 Conclusion .............................................................................................................181 Chapter 13. Graphs .................................................................................................... 183 What Is a Graph? ..................................................................................................184 Graph Implementation .........................................................................................190 Conclusion .............................................................................................................196 Part II: Algorithms Chapter 14. Introduction to Recursion ....................................................................... 199 Our Giant Cookie Problem ..................................................................................200 Recursion in Programming ..................................................................................202 Conclusion .............................................................................................................206 Chapter 15. Fibonacci and Going Beyond Recursion ................................................. 207 Recursively Solving the Fibonacci Sequence ....................................................209 Recursion with Memoization ...............................................................................213 Taking an Iteration-Based Approach ..................................................................215 Going Deeper on the Speed ..............................................................................217 Conclusion .............................................................................................................218 Chapter 16. Towers of Hanoi ...................................................................................... 221 How Towers of Hanoi Is Played ..........................................................................222 The Single Disk Case ...........................................................................................223 It's Two Disk Time .................................................................................................224 Three Disks ............................................................................................................225 The Algorithm .......................................................................................................228 The Code Solution ...............................................................................................229 Check Out the Recursiveness! ............................................................................231 It's Math Time ........................................................................................................232 Conclusion .............................................................................................................234 Chapter 17. Search Algorithms and Linear Search ..................................................... 235 Linear Search .........................................................................................................236 Conclusion .............................................................................................................241 Chapter 18. Faster Searching with Binary Search ....................................................... 243 Binary Search in Action ........................................................................................243 The JavaScript Implementation ..........................................................................250 Runtime Performance ...........................................................................................254 Conclusion .............................................................................................................257 Chapter 19. Binary Tree Traversal ............................................................................... 259 Breadth-First Traversal ..........................................................................................260 Depth-First Traversal ............................................................................................265 Implementing Our Traversal Approaches ..........................................................270 Performance of Our Traversal Approaches ........................................................278 Conclusion .............................................................................................................279 Chapter 20. Depth-First Search (DFS) and Breadth-First Search (BFS) ....................... 281 A Tale of Two Exploration Approaches ..............................................................282 It's Example Time ..................................................................................................285 When to Use DFS? When to Use BFS? ..............................................................298 A JavaScript Implementation ..............................................................................300 Performance Details .............................................................................................307 Conclusion .............................................................................................................308 Chapter 21. Quicksort ................................................................................................ 309 A Look at How Quicksort Works .........................................................................310 Another Simple Look ...........................................................................................314 It's Implementation Time .....................................................................................319 Performance Characteristics ................................................................................322 Conclusion .............................................................................................................323 Chapter 22. Bubblesort .............................................................................................. 325 How Bubblesort Works ........................................................................................326 Walkthrough ..........................................................................................................329 The Code ...............................................................................................................333 Conclusion .............................................................................................................333 Chapter 23. Insertion Sort .......................................................................................... 335 How Insertion Sort Works ....................................................................................336 One More Example ..............................................................................................347 Algorithm Overview and Implementation .........................................................349 Performance Analysis ...........................................................................................351 Conclusion .............................................................................................................353 Chapter 24. Selection Sort ......................................................................................... 355 Selection Sort Walkthrough .................................................................................356 Algorithm Deep Dive ...........................................................................................364 The JavaScript Implementation ..........................................................................366 Conclusion .............................................................................................................369 Chapter 25. Mergesort ............................................................................................... 371 How Mergesort Works .........................................................................................372 Mergesort: The Algorithm Details ......................................................................379 Looking at the Code ............................................................................................380 Conclusion .............................................................................................................381 Conclusion .................................................................................................................383 Index ............................................................................................................................ 387

    7 in stock

    £26.99

  • Algorithms MIT Press Essential Knowledge

    MIT Press Algorithms MIT Press Essential Knowledge

    5 in stock

    Book SynopsisAn accessible introduction to algorithms, explaining not just what they are but how they work, with examples from a wide range of application areas.Digital technology runs on algorithms, sets of instructions that describe how to do something efficiently. Application areas range from search engines to tournament scheduling, DNA sequencing, and machine learning. Arguing that every educated person today needs to have some understanding of algorithms and what they do, in this volume in the MIT Press Essential Knowledge series, Panos Louridas offers an introduction to algorithms that is accessible to the nonspecialist reader. Louridas explains not just what algorithms are but also how they work, offering a wide range of examples and keeping mathematics to a minimum.After discussing what an algorithm does and how its effectiveness can be measured, Louridas covers three of the most fundamental applications areas: graphs, which describe networks, from eighteenth-century proble

    5 in stock

    £14.39

  • Once Upon an Algorithm

    MIT Press Once Upon an Algorithm

    1 in stock

    Book Synopsis

    1 in stock

    £19.55

  • Data Structures and Algorithms

    Pearson Education Data Structures and Algorithms

    1 in stock

    Book SynopsisThe authors' treatment of data structures in Data Structures and Algorithms is unified by an informal notion of "abstract data types," allowing readers to compare different implementations of the same concept. Algorithm design techniques are also stressed and basic algorithm analysis is covered. Most of the programs are written in Pascal.

    1 in stock

    £74.07

  • Introduction to the Design and Analysis of

    Pearson Education Limited Introduction to the Design and Analysis of

    1 in stock

    Book SynopsisTable of Contents 1 Introduction 2 Fundamentals of the Analysis of Algorithm Efficiency 3 Brute Force and Exhaustive Search 4 Decrease-and-Conquer 5 Divide-and-Conquer 6 Transform-and-Conquer 7 Space and Time Trade-Offs 8 Dynamic Programming 9 Greedy Technique 10 Iterative Improvement 11 Limitations of Algorithm Power 12 Coping with the Limitations of Algorithm Power

    1 in stock

    £72.99

  • Principles of Concurrent and Distributed

    Pearson Education Principles of Concurrent and Distributed

    1 in stock

    Book SynopsisMordechai (Moti) Ben-Ari is an Associate Professor in the Department of Science Teaching at the Weizmann Institute of Science in Rehovot, Israel.  He is the author of texts on Ada, concurrent programming, programming languages, and mathematical logic, as well as Just a Theory: Exploring the Nature of Science.  In 2004 he was honored with the ACM/SIGCSE Award for Outstanding Contribution to Computer Science Education.Table of ContentsContents Preface xi 1 What is Concurrent Programming? 1 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Concurrency as abstract parallelism . . . . . . . . . . . . . . . . 2 1.3 Multitasking . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.4 The terminology of concurrency . . . . . . . . . . . . . . . . . 4 1.5 Multiple computers . . . . . . . . . . . . . . . . . . . . . . . . 5 1.6 The challenge of concurrent programming . . . . . . . . . . . . 5 2 The Concurrent Programming Abstraction 7 2.1 The role of abstraction . . . . . . . . . . . . . . . . . . . . . . . 7 2.2 Concurrent execution as interleaving of atomic statements . . . . 8 2.3 Justification of the abstraction . . . . . . . . . . . . . . . . . . . 13 2.4 Arbitrary interleaving . . . . . . . . . . . . . . . . . . . . . . . 17 2.5 Atomic statements . . . . . . . . . . . . . . . . . . . . . . . . . 19 2.6 Correctness . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 2.7 Fairness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 2.8 Machine-code instructions . . . . . . . . . . . . . . . . . . . . . 24 2.9 Volatile and non-atomic variables . . . . . . . . . . . . . . . . . 28 2.10 The BACI concurrency simulator . . . . . . . . . . . . . . . . . 29 2.11 Concurrency in Ada . . . . . . . . . . . . . . . . . . . . . . . . 31 2.12 Concurrency in Java . . . . . . . . . . . . . . . . . . . . . . . . 34 2.13 Writing concurrent programs in Promela . . . . . . . . . . . . . 36 2.14 Supplement: the state diagram for the frog puzzle . . . . . . . . 37 3 The Critical Section Problem 45 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 3.2 The definition of the problem . . . . . . . . . . . . . . . . . . . 45 3.3 First attempt . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 3.4 Proving correctness with state diagrams . . . . . . . . . . . . . . 49 3.5 Correctness of the first attempt . . . . . . . . . . . . . . . . . . 53 3.6 Second attempt . . . . . . . . . . . . . . . . . . . . . . . . . . . 55 3.7 Third attempt . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 3.8 Fourth attempt . . . . . . . . . . . . . . . . . . . . . . . . . . . 58 3.9 Dekker’s algorithm . . . . . . . . . . . . . . . . . . . . . . . . 60 3.10 Complex atomic statements . . . . . . . . . . . . . . . . . . . . 61 4 Verification of Concurrent Programs 67 4.1 Logical specification of correctness properties . . . . . . . . . . 68 4.2 Inductive proofs of invariants . . . . . . . . . . . . . . . . . . . 69 4.3 Basic concepts of temporal logic . . . . . . . . . . . . . . . . . 72 4.4 Advanced concepts of temporal logic . . . . . . . . . . . . . . . 75 4.5 A deductive proof of Dekker’s algorithm . . . . . . . . . . . . . 79 4.6 Model checking . . . . . . . . . . . . . . . . . . . . . . . . . . 83 4.7 Spin and the Promela modeling language . . . . . . . . . . . . . 83 4.8 Correctness specifications in Spin . . . . . . . . . . . . . . . . . 86 4.9 Choosing a verification technique . . . . . . . . . . . . . . . . . 88 5 Advanced Algorithms for the Critical Section Problem 93 5.1 The bakery algorithm . . . . . . . . . . . . . . . . . . . . . . . 93 5.2 The bakery algorithm for N processes . . . . . . . . . . . . . . 95 5.3 Less restrictive models of concurrency . . . . . . . . . . . . . . 96 5.4 Fast algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 5.5 Implementations in Promela . . . . . . . . . . . . . . . . . . . . 104

    1 in stock

    £71.99

  • Handbook of Computer Programming with Python

    Taylor & Francis Ltd Handbook of Computer Programming with Python

    1 in stock

    Book SynopsisThis handbook provides a hands-on experience based on the underlying topics, and assists students and faculty members in developing their algorithmic thought process and programs for given computational problems. It can also be used by professionals who possess the necessary theoretical and computational thinking background but are presently making their transition to Python.Key Features: Discusses concepts such as basic programming principles, OOP principles, database programming, GUI programming, application development, data analytics and visualization, statistical analysis, virtual reality, data structures and algorithms, machine learning, and deep learning Provides the code and the output for all the concepts discussed Includes a case study at the end of each chapter This handbook will benefit students of computer science, information systems, and information technology, or anyone who isTable of ContentsChapter 1 IntroductionDimitrios Xanthidis, Christos Manolas, Ourania K. Xanthidou, and Han-I WangChapter 2 Introduction to Programming with PythonAmeur Bensefia, Muath Alrammal, and Ourania K. XanthidouChapter 3 Object-Oriented Programming in PythonGhazala Bilquise, Thaeer Kobbaey, and Ourania K. XanthidouChapter 4 Graphical User Interface Programming with PythonOurania K. Xanthidou, Dimitrios Xanthidis, and Sujni PaulChapter 5 Application Development with PythonDimitrios Xanthidis, Christos Manolas, and Hanêne Ben-AbdallahChapter 6 Data Structures and Algorithms with PythonThaeer Kobbaey, Dimitrios Xanthidis, and Ghazala BilquiseChapter 7 Database Programming with PythonDimitrios Xanthidis, Christos Manolas, and Tareq AlhousaryChapter 8 Data Analytics and Data Visualization with PythonDimitrios Xanthidis, Han-I Wang, and Christos ManolasChapter 9 Statistical Analysis with PythonHan-I Wang, Christos Manolas, and Dimitrios XanthidisChapter 10 Machine Learning with PythonMuath Alrammal, Dimitrios Xanthidis, and Munir NaveedChapter 11 Introduction to Neural Networks and Deep LearningDimitrios Xanthidis, Muhammad Fahim, and Han-I WangChapter 12 Virtual Reality Application Development with PythonChristos Manolas, Ourania K. Xanthidou, and Dimitrios XanthidisAppendix: Case Studies Solutions

    1 in stock

    £89.99

  • The Feel of Algorithms

    University of California Press The Feel of Algorithms

    3 in stock

    Book SynopsisTable of ContentsContents Preface Acknowledgments Introduction 1 Structures of Feeling in Algorithmic Culture 2 Coevolving with Algorithms 3 The Digital Geography of Fear 4 Friction in Algorithmic Relations 5 Care for Algorithmic Futures Ways Forward References Index

    3 in stock

    £22.50

  • How to Think about Algorithms

    Cambridge University Press How to Think about Algorithms

    1 in stock

    Book SynopsisUnderstand algorithms and their design with this revised student-friendly textbook. Unlike other algorithms books, this one is approachable, the methods it explains are straightforward, and the insights it provides are numerous and valuable. Without grinding through lots of formal proof, students will benefit from step-by-step methods for developing algorithms, expert guidance on common pitfalls, and an appreciation of the bigger picture. Revised and updated, this second edition includes a new chapter on machine learning algorithms, and concise key concept summaries at the end of each part for quick reference. Also new to this edition are more than 150 new exercises: selected solutions are included to let students check their progress, while a full solutions manual is available online for instructors. No other text explains complex topics such as loop invariants as clearly, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.

    1 in stock

    £94.99

  • AI for the Sustainable Development Goals

    CRC Press AI for the Sustainable Development Goals

    1 in stock

    Book SynopsisArtificial Intelligence has a real impact on our lives and on our environment, and the Sustainable Development Goals enable us to evaluate these impacts in a systematic manner. AI for the Sustainable Development Goals shows how AI potentially affects all SDGs. Positively, but also negatively.Trade Review"Artificial Intelligence is continuously presented as the technology that will help solve some of the most complex problems of contemporary society, including the fight against climate change and global warming. However, reducing modern problems to mere engineering solutions is not straightforward and may have adverse consequences too. In this book, Sætra shows in an elegant and simple way how AI can indeed be a potential solution to some of the most pressing issues humanity is facing today. Yet, it also alerts about the dangers AI may entail without appropriate oversight and highlights the role and responsibilities of those wielding influence over such great powers. An excellent read and a stepping stone towards having AI serving the Sustainable Development Goals." -- Dr. Eduard Fosch-Villaronga, Assistant Professor, eLaw Center for Law and Digital Technologies, Leiden University.Table of ContentsAuthor. 1 Introduction. 2 AI and the SDGs in Context. 3 The Challenge of Evaluating AI Impact. 4 Sustainable Economic Development. 5 Sustainable Social Development. 6 Sustainable Environmental Development. 7 Assessing the Overall Impact of AI. 8 Conclusion. References. Index.

    1 in stock

    £27.84

  • Internet of Things

    Taylor & Francis Ltd Internet of Things

    1 in stock

    Book SynopsisToday, Internet of Things (IoT) is ubiquitous as it is applied in practice in everything from Industrial Control Systems (ICS) to e-Health, e-commerce, Cyber Physical Systems (CPS), smart cities, smart parking, healthcare, supply chain management and many more. Numerous industries, academics, alliances and standardization organizations make an effort on IoT standardization, innovation and development. But there is still a need for a comprehensive framework with integrated standards under one IoT vision. Furthermore, the existing IoT systems are vulnerable to huge range of malicious attacks owing to the massive numbers of deployed IoT systems, inadequate data security standards and the resource-constrained nature. Existing security solutions are insufficient and therefore it is necessary to enable the IoT devices to dynamically counter the threats and save the system.Apart from illustrating the diversified IoT applications, this book also addresses the issue of data safekeepinTable of Contents1. IoT Conceptual Model and Application. 2. Standardization of IoT Ecosystems: Open Challenges, Current Solutions, and Future Directions. 3. A Node Reduction Technique for Trojan Detection and Diagnosis in IoT Hardware Devices. 4. Deep-Learning-Empowered Edge Computing-Based IoT Frameworks. 5. A Geo-Referenced Data Collection Microservice Based on IoT Protocols for Smart HazMat Transportation. 6. Impact of Dimentionality Reduction on Performance of IoT Intrusion Detection System. 7. IoT-Based Resources Management and Monitoring for a Smart City. 8. Internet of Things Applications in Marketing. 9. Internet of Things (IoT) for Sustainable Smart Cities. 10. An Integration of IOT and Machine Learning in Smart City Planning. 11. The Internet of Medical Things for Monitoring Health. 12. Secured Multimedia and IoT in Healthcare Computing Paradigms. 13. Designing Contactless Automated Systems Using IoT, Sensors and Artificial Intelligence to Mitigate COVID-19. 14. Analysis Of the Framework for the Development, Security and Efficacy Of IoT-Based Mobile Health-Care Solutions for Antenatal Care.

    1 in stock

    £99.00

  • Stochastic Optimization for Largescale Machine

    Taylor & Francis Ltd Stochastic Optimization for Largescale Machine

    1 in stock

    Book SynopsisAdvancements in the technology and availability of data sources have led to the `Big Data'' era. Working with large data offers the potential to uncover more fine-grained patterns and take timely and accurate decisions, but it also creates a lot of challenges such as slow training and scalability of machine learning models. One of the major challenges in machine learning is to develop efficient and scalable learning algorithms, i.e., optimization techniques to solve large scale learning problems.Stochastic Optimization for Large-scale Machine Learning identifies different areas of improvement and recent research directions to tackle the challenge. Developed optimisation techniques are also explored to improve machine learning algorithms based on data access and on first and second order optimisation methods.Key Features: Bridges machine learning and Optimisation. Bridges theory and practice in machine learning. Identifies key reTable of Contents List of FiguresList of TablesPreface Section I BACKGROUND Introduction1.1 LARGE-SCALE MACHINE LEARNING 1.2 OPTIMIZATION PROBLEMS 1.3 LINEAR CLASSIFICATION1.3.1 Support Vector Machine (SVM) 1.3.2 Logistic Regression 1.3.3 First and Second Order Methods1.3.3.1 First Order Methods 1.3.3.2 Second Order Methods 1.4 STOCHASTIC APPROXIMATION APPROACH 1.5 COORDINATE DESCENT APPROACH 1.6 DATASETS 1.7 ORGANIZATION OF BOOK Optimisation Problem, Solvers, Challenges and Research Directions2.1 INTRODUCTION 2.1.1 Contributions 2.2 LITERATURE 2.3 PROBLEM FORMULATIONS 2.3.1 Hard Margin SVM (1992) 2.3.2 Soft Margin SVM (1995) 2.3.3 One-versus-Rest (1998) 2.3.4 One-versus-One (1999) 2.3.5 Least Squares SVM (1999) 2.3.6 v-SVM (2000) 2.3.7 Smooth SVM (2001) 2.3.8 Proximal SVM (2001) 2.3.9 Crammer Singer SVM (2002) 2.3.10 Ev-SVM (2003) 2.3.11 Twin SVM (2007) 2.3.12 Capped lp-norm SVM (2017) 2.4 PROBLEM SOLVERS 2.4.1 Exact Line Search Method 2.4.2 Backtracking Line Search 2.4.3 Constant Step Size 2.4.4 Lipschitz & Strong Convexity Constants 2.4.5 Trust Region Method 2.4.6 Gradient Descent Method 2.4.7 Newton Method 2.4.8 Gauss-Newton Method 2.4.9 Levenberg-Marquardt Method 2.4.10 Quasi-Newton Method 2.4.11 Subgradient Method 2.4.12 Conjugate Gradient Method 2.4.13 Truncated Newton Method 2.4.14 Proximal Gradient Method 2.4.15 Recent Algorithms 2.5 COMPARATIVE STUDY 2.5.1 Results from Literature 2.5.2 Results from Experimental Study 2.5.2.1 Experimental Setup and Implementation Details 2.5.2.2 Results and Discussions 2.6 CURRENT CHALLENGES AND RESEARCH DIRECTIONS 2.6.1 Big Data Challenge 2.6.2 Areas of Improvement 2.6.2.1 Problem Formulations 2.6.2.2 Problem Solvers 2.6.2.3 Problem Solving Strategies/Approaches 2.6.2.4 Platforms/Frameworks 2.6.3 Research Directions 2.6.3.1 Stochastic Approximation Algorithms 2.6.3.2 Coordinate Descent Algorithms 2.6.3.3 Proximal Algorithms 2.6.3.4 Parallel/Distributed Algorithms 2.6.3.5 Hybrid Algorithms 2.7 CONCLUSION Section II FIRST ORDER METHODSMini-batch and Block-coordinate Approach 3.1 INTRODUCTION 3.1.1 Motivation 3.1.2 Batch Block Optimization Framework (BBOF) 3.1.3 Brief Literature Review 3.1.4 Contributions 3.2 STOCHASTIC AVERAGE ADJUSTED GRADIENT (SAAG) METHODS3.3 ANALYSIS 3.4 NUMERICAL EXPERIMENTS 3.4.1 Experimental setup 3.4.2 Convergence against epochs 3.4.3 Convergence against Time 3.5 CONCLUSION AND FUTURE SCOPE Variance Reduction Methods 4.1 INTRODUCTION 4.1.1 Optimization Problem 4.1.2 Solution Techniques for Optimization Problem 4.1.3 Contributions 4.2 NOTATIONS AND RELATED WORK 4.2.1 Notations 4.2.2 Related Work 4.3 SAAG-I, II AND PROXIMAL EXTENSIONS 4.4 SAAG-III AND IV ALGORITHMS 4.5 ANALYSIS 4.6 EXPERIMENTAL RESULTS 4.6.1 Experimental Setup 4.6.2 Results with Smooth Problem 4.6.3 Results with non-smooth Problem 4.6.4 Mini-batch Block-coordinate versus mini-batch setting 4.6.5 Results with SVM 4.7 CONCLUSION Learning and Data Access 5.1 INTRODUCTION 5.1.1 Optimization Problem 5.1.2 Literature Review 5.1.3 Contributions 5.2 SYSTEMATIC SAMPLING 5.2.1 Definitions 5.2.2 Learning using Systematic Sampling 5.3 ANALYSIS 5.4 EXPERIMENTS 5.4.1 Experimental Setup 5.4.2 Implementation Details 5.4.3 Results 5.5 CONCLUSION Section III SECOND ORDER METHODS Mini-batch Block-coordinate Newton Method 6.1 INTRODUCTION 6.1.1 Contributions 6.2 MBN 6.3 EXPERIMENTS 6.3.1 Experimental Setup 6.3.2 Comparative Study 6.4 CONCLUSION Stochastic Trust Region Inexact Newton Method 7.1 INTRODUCTION 7.1.1 Optimization Problem 7.1.2 Solution Techniques 7.1.3 Contributions 7.2 LITERATURE REVIEW 7.3 TRUST REGION INEXACT NEWTON METHOD 7.3.1 Inexact Newton Method 7.3.2 Trust Region Inexact Newton Method 7.4 STRON 7.4.1 Complexity 7.4.2 Analysis 7.5 EXPERIMENTAL RESULTS 7.5.1 Experimental Setup 7.5.2 Comparative Study 7.5.3 Results with SVM 7.6 EXTENSIONS 7.6.1 PCG Subproblem Solver 17.6.2 Stochastic Variance Reduced Trust Region Inexact Newton Method 7.7 CONCLUSION Section IV CONCLUSIONConclusion and Future Scope 8.1 FUTURE SCOPE 142 Bibliography Index

    1 in stock

    £135.00

  • Advances in Distance Learning in Times of

    CRC Press Advances in Distance Learning in Times of

    1 in stock

    Book SynopsisThe book Advances in Distance Learning in Times of Pandemic is devoted to the issues and challenges faced by universities in the field of distance learning in COVID-19 times. It covers both the theoretical and practical aspects connected to distance education. It elaborates on issues regarding distance learning, its challenges, assessment by students and their expectations, the use of tools to improve distance learning, and the functioning of e-learning in the industry 4.0 and society 5.0 eras. The book also devotes a lot of space to the issues of Web 3.0 in university e-learning, quality assurance, and knowledge management. The aim and scope of this book is to draw a holistic picture of ongoing online teaching-activities before and during the lockdown period and present the meaning and future of e-learning from studentsâ points of view, taking into consideration their attitudes and expectations as well as industry 4.0 and society 5.0 aspects. The book presents the approach to distance learning and how it has changed, especially during a pandemic that revolutionized education. It highlights â the function of online education and how that has changed before and during the pandemic. â how e-learning is beneficial in promoting digital citizenship. â distance learning characteristic in the era of industry 4.0 and society 5.0. â how the era of industry 4.0 treats distance learning as a desirable form of education. The book covers both scientific and educational aspects and can be useful for university-level undergraduate, postgraduate and research-grade courses and can be referred to by anyone interested in exploring the diverse aspects of distance learning.

    1 in stock

    £55.68

  • Machine Learning for the Physical Sciences

    Taylor & Francis Ltd Machine Learning for the Physical Sciences

    1 in stock

    Book SynopsisMachine learning is an exciting topic with a myriad of applications. However, most textbooks are targeted towards computer science students. This, however, creates a complication for scientists across the physical sciences that also want to understand the main concepts of machine learning and look ahead to applica- tions and advancements in their fields.This textbook bridges this gap, providing an introduction to the mathematical foundations for the main algorithms used in machine learning for those from the physical sciences, without a formal background in computer science. It demon- strates how machine learning can be used to solve problems in physics and engineering, targeting senior undergraduate and graduate students in physics and electrical engineering, alongside advanced researchers.All codes are available on the author''s website: CLab (nau.edu)They areTable of ContentsChapter 1: Multivariate Calculus. Chapter 2: Probability Theory. Chapter 3: Dimensionality Reduction. Chapter 4: Cluster Analysis. Chapter 5: Vector Quantization Techniques. Chapter 6: Regression Models. Chapter 7: Classification. Chapter 8: Feedforward Networks. Chapter 9: Advanced Network Architectures. Chapter 10: Value Methods. Chapter 11: Gradient Methods. Chapter 12: Population-Based Metaheuristic Methods. Chapter 13: Local Search methods. Appendix A: Sufficient Statistic. Appendix B: Graphs. Appendix C: Sequential Minimization Optimization. Appendix D: Algorithmic Differentiation. Appendix E: Batch Normalizing Transform. Appendix F: Divergence of Two Gaussian Distributions. Appendix G: Continuous-time Bellman's Equation. Appendix H: Conjugate Gradient. Appendix I: Importance Sampling. References. Index.

    1 in stock

    £66.99

  • New Perspectives in Behavioral Cybersecurity

    CRC Press New Perspectives in Behavioral Cybersecurity

    1 in stock

    Book SynopsisNew Perspectives in Behavioral Cybersecurity offers direction for readers in areas related to human behavior and cybersecurity, by exploring some of the new ideas and approaches in this subject, specifically with new techniques in this field coming from scholars with very diverse backgrounds in dealing with these issues. It seeks to show an understanding of motivation, personality, and other behavioral approaches to understand cyberattacks and create cyberdefenses.This book:â Elaborates cybersecurity concerns in the work environment and cybersecurity threats to individuals. â Presents personality characteristics of cybersecurity attackers, cybersecurity behavior, and behavioral interventions. â Highlights the applications of behavioral economics to cybersecurity. â Captures the management and security of financial data through integrated software solutions. â Examines the importance of studying fake news proliferation by detecting cTable of ContentsSection I. Cybersecurity Concerns in the Work Environment. 1. Management and Security of Financial Data Through Integrated Software Solutions. 2. An Efficient Scheme For Detecting And Mitigating Insider Threats. 3. (Figures query) Phishing Through URLs: An Instance Based Learning Model Approach to Detecting Phishing. Section II. Cybersecurity Threats to the Individual. 4. Video Games in Digital Forensics. 5. Dances with the Illuminati: Hands-On Social Engineering in Classroom Setting. 6. Studying Fake News Proliferation by Detecting Coordinated Inauthentic Behavior. 7. Refining the Sweeney Approach on Data Privacy. Section III. Cybersecurity Concerns in the Home and Work Environment. 8. Cybersecurity Hygiene: Blending Home and Work Computing. 9. Will a Cybersecurity Mindset shift build and sustain a Cybersecurity Pipeline?. Section IV. Ethical Behavior. 10. Cybersecurity Behavior and Behavioral Interventions. Section V. Differences in Languages in Cyberattacks. 11. Using Language Differences to Detect Cyberattacks: Ukrainian and Russian. Section VI. Applications of Behavioral Economics to Cybersecurity. 12. Using Economic Prospect Theory To Quantify Side Channel Attacks. 13. A Game-Theoretic Approach to Detecting Romance Scams. Section VII. New Approaches for Future Research. 14. (Unfinished?) Human-Centered Artificial intelligence: Threats and Opportunities for Cybersecurity.

    1 in stock

    £94.72

  • Machine Learning The Art and Science of

    Cambridge University Press Machine Learning The Art and Science of

    1 in stock

    Book SynopsisAs one of the most comprehensive machine learning texts around, this book does justice to the field's incredible richness, but without losing sight of the unifying principles. Peter Flach's clear, example-based approach begins by discussing how a spam filter works, which gives an immediate introduction to machine learning in action, with a minimum of technical fuss. Flach provides case studies of increasing complexity and variety with well-chosen examples and illustrations throughout. He covers a wide range of logical, geometric and statistical models and state-of-the-art topics such as matrix factorisation and ROC analysis. Particular attention is paid to the central role played by features. The use of established terminology is balanced with the introduction of new and useful concepts, and summaries of relevant background material are provided with pointers for revision if necessary. These features ensure Machine Learning will set a new standard as an introductory textbook.Trade Review"This textbook is clearly written and well organized. Starting from the basics, the author skillfully guides the reader through his learning process by providing useful facts and insight into the behavior of several machine learning techniques, as well as the high-level pseudocode of many key algorithms." < /br>Fernando Berzal, Computing ReviewsTable of ContentsPrologue: a machine learning sampler; 1. The ingredients of machine learning; 2. Binary classification and related tasks; 3. Beyond binary classification; 4. Concept learning; 5. Tree models; 6. Rule models; 7. Linear models; 8. Distance-based models; 9. Probabilistic models; 10. Features; 11. In brief: model ensembles; 12. In brief: machine learning experiments; Epilogue: where to go from here; Important points to remember; Bibliography; Index.

    1 in stock

    £45.59

  • Finite Elements

    Cambridge University Press Finite Elements

    1 in stock

    Book SynopsisWritten in easy to understand language, this self-explanatory guide introduces the fundamentals of finite element methods and its application to differential equations. Beginning with a brief introduction to Sobolev spaces and elliptic scalar problems, the text progresses through an explanation of finite element spaces and estimates for the interpolation error. The concepts of finite element methods for parabolic scalar parabolic problems, object-oriented finite element algorithms, efficient implementation techniques, and high dimensional parabolic problems are presented in different chapters. Recent advances in finite element methods, including non-conforming finite elements for boundary value problems of higher order and approaches for solving differential equations in high dimensional domains are explained for the benefit of the reader. Numerous solved examples and mathematical theorems are interspersed throughout the text for enhanced learning.Trade Review'The book is written in a very traditional and straightforward style of theory and proof. The organization of the material makes it accessible for the reader to gain a foundational understanding of the topics … This book provides a readable, concise introduction to finite elements. Summing Up: Recommended.' S. L. Sullivan, CHOICETable of ContentsPreface; 1. Sobolev spaces; 1.1. Banach and Hilbert spaces; 1.2. Weak derivatives; 1.3. Sobolev spaces; 2. Elliptic scalar problems; 2.1. A general elliptic problem of second order; 2.2. Weak solution; 2.3. Standard Galerkin method; 2.4. Abstract error estimate; 3. Finite element spaces; 3.1. Simplices and barycentric coordinates; 3.2. Simplicial finite elements and local spaces; 3.3. Construction of finite elements spaces; 3.4. The concept of mapped finite elements: affine mappings; 3.5. Finite elements on rectangular and brick meshes; 3.6. Mapped finite elements: general bijective mappings; 3.7. Mapped Qk finite elements; 3.8. Isoparametric finite elements; 3.9. Further examples of finite elements in C0 and C1; 4. Interpolation and discretization error; 4.1. Transformation formulas; 4.2. Affine equivalent finite elements; 4.3. Canonical interpolation; 4.4. Local and global interpolation error; 4.5. Improved L2 error estimates by duality; 4.6. Interpolation of less smooth functions; 5. Biharmonic equation; 5.1. Deflection of a thin clamped plate; 5.2. Weak formulation of the biharmonic equation; 5.3. Conforming finite element methods; 5.4. Nonconforming finite element methods; 6. Parabolic problems; 6.1. Conservation of energy; 6.2. A general parabolic problem of initial boundary value problems; 6.3. Weak formulation of initial boundary value problems; 6.4. Semidiscretization by finite elements; 6.5. Time discretization; 6.6. Finite elements for high-dimensional parabolic problems; 7. Systems in solid mechanics; 7.1. Linear elasticity; 7.2. Mindlin–Reissner plate; 8. Systems in fluid mechanics; 8.1. Conservation of mass and momentum; 8.2. Weak formulation of the Stokes problem; 8.3. Conforming discretizations of the Stokes problem; 8.4. Nonconforming discretizations of the Stokes problem; 8.5. The nonconforming Crouzeix–Raviart element; 8.6. Further inf–sup stable finite element pairs; 8.7. Equal order stabilized finite elements; 8.8. Navier–Stokes problem with mixed boundary conditions; 8.9. Time discretization and linearization of the Navier–Stokes problem; 9. Implementation of the finite element method; 9.1. Mesh handling and data structure; 9.2. Numerical integration; 9.3. Sparse matrix storage; 9.4. Assembling of system matrices and load vectors; 9.5. Inclusion of boundary conditions; 9.6. Solution of the algebraic systems; 9.7. Object-oriented C++ programming; Bibliography; Index.

    1 in stock

    £53.19

  • Algorithmic Information Dynamics

    Cambridge University Press Algorithmic Information Dynamics

    1 in stock

    Book SynopsisAimed at graduate students and researchers, this book offers a model-driven approach to the study and manipulation of dynamical systems. Based on an online course hosted by the Complexity Explorer, it uses analytical tools from information theory and complexity science to tackle key challenges in network and systems biology.Table of ContentsIntroduction; Part I. Preliminaries: 1. A computational approach to causality; 2. Networks: from structure to dynamics; 3. Information and computability theories; Part II. Theory and Methods: 4. Algorithmic information theory; 5. The coding theorem method (CTM); 6. The block decomposition method (BDM); 7. Graph and tensor complexity; 8. Algorithmic information dynamics (AID); Part III. Applications: 9. From theory to practice; 10. Algorithmic dynamics in artificial environments; 11. Applications to integer and behavioural sequences; 12. Applications to evolutionary biology; Postface; Appendix: Mutual and conditional BDM; Glossary.

    1 in stock

    £56.99

  • OCP Oracle Certified Professional Java SE 17

    John Wiley & Sons Inc OCP Oracle Certified Professional Java SE 17

    1 in stock

    Book SynopsisTable of ContentsIntroduction xvii Chapter 1 Handling Date, Time, Text, Numeric and Boolean Values 1 Chapter 2 Controlling Program Flow 25 Chapter 3 Utilizing Java Object- Oriented Approach 45 Chapter 4 Handling Exceptions 149 Chapter 5 Working with Arrays and Collections 181 Chapter 6 Working with Streams and Lambda Expressions 211 Chapter 7 Packaging and Deploying Java Code and Use the Java Platform Module System 267 Chapter 8 Managing Concurrent Code Execution 295 Chapter 9 Using Java I/O API 319 Chapter 10 Accessing Databases Using JDBC 339 Chapter 11 Implementing Localization 353 Chapter 12 Practice Exam 1 365 Chapter 13 Practice Exam 2 391 Chapter 14 Practice Exam 3 417 Appendix Answers to Review Questions 443 Chapter 1: Handling Date, Time, Text, Numeric and Boolean Values 444 Chapter 2: Controlling Program Flow 450 Chapter 3: Utilizing Java Object- Oriented Approach 455 Chapter 4: Handling Exceptions 482 Chapter 5: Working with Arrays and Collections 489 Chapter 6: Working with Streams and Lambda Expressions 498 Chapter 7: Packaging and Deploying Java Code and Use the Java Platform Module System 516 Chapter 8: Managing Concurrent Code Execution 524 Chapter 9: Using Java I/O API 530 Chapter 10: Accessing Databases Using JDBC 535 Chapter 11: Implementing Localization 538 Chapter 12: Practice Exam 1 541 Chapter 13: Practice Exam 2 548 Chapter 14: Practice Exam 3 554 Index 561

    1 in stock

    £27.99

  • Entity Framework 6 Recipes

    Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Entity Framework 6 Recipes

    1 in stock

    Book SynopsisEntity Framework 6 Recipes provides an exhaustive collection of ready-to-use code solutions for Entity Framework, Microsoft's model-centric, data-access platform for the .NET Framework and ASP.NET development.Table of Contents Getting Started with Entity Framework Entity Data Modeling Fundamentals Querying an Entity Data Model Using Entity Framework in ASP.NET Loading Entities and Navigation Properties Beyond the Basics with Modeling and Inheritance Working with Object Services Plain Old CLR Objects Using the Entity Framework in N-Tier Applications Stored Procedures Functions Customizing Entity Framework Objects Improving Performance Concurrency

    1 in stock

    £52.24

  • Data versus Democracy

    APress Data versus Democracy

    1 in stock

    Book Synopsis Human attention is in the highest demand it has ever been. The drastic increase in available information has compelled individuals to find a way to sift through the media that is literally at their fingertips. Content recommendation systems have emerged as the technological solution to this social and informational problem, but they''ve also created a bigger crisis in confirming our biases by showing us only, and exactly, what it predicts we want to see.   Data versus Democracy investigates and explores how, in the era of social media, human cognition, algorithmic recommendation systems, and human psychology are all working together to reinforce (and exaggerate) human bias. The dangerous confluence of these factors is driving media narratives, influencing opinions, and possibly changing election results.  In this book, algorithmic recommendations, clickbait, familiarity bias, propaganda,Trade Review“A very well written book that has an engaging style of writing, doesn’t become dry or bogged down in the details, but still showcases the depth of knowledge that Shaffer has on the subject. … It’s accessible and it provides a satisfying read to those looking for deep analysis of this emerging problem faced by the world.” (The Robotics Law Journal, Vol. 5 (2), September - October, 2019) Table of Contents Part I: The Propaganda Problem.- Chapter 1: Pay Attention: How Information Abundance Affects the Way We Consume Media .- Chapter 2: Cog in the System: How the Limits of Our Brains Leave Us Vulnerable to Cognitive Hacking.- Chapter 3: Swimming Upstream: How Content Recommendation Engines Impact Information and Manipulate Our Attention.- Part II: Case Studies.- Chapter 4: Domestic Disturbance: Ferguson, GamerGate, and the Rise of the American Alt-Right.- Chapter 5: Democracy Hacked, Part 1: Russian Interference and the New Cold War .- Chapter 6: Democracy Hacked, Part 2: Rumors, Bots, and Genocide in the Global South .- Chapter 7: Conclusion: Where Do We Go from Here?.-

    1 in stock

    £22.49

  • Modern X86 Assembly Language Programming

    APress Modern X86 Assembly Language Programming

    1 in stock

    Book SynopsisChapter 1 X86-Core Architecture.- Chapter 2 X86-64 Core Programming (Part 1).- Chapter 3 X86-64 Core Programming (Part 2).- Chapter 4 X86-64 Core Programming (Part 3).- Chapter 5 AVX Programming - Scalar Floating-Point.- Chapter 6 Run-Time Calling Conventions.- Chapter 7 Introduction to X86-AVX SIMD Programming.- Chapter 8 AVX Programming Packed Integers.- Chapter 9 AVX Programming Packed Floating Point.- Chapter 10 AVX2 Programming Packed Integers.- Chapter 11 AVX2 Programming Packed Floating Point (Part 1).- Chapter 12 AVX2 Programming Packed Floating Point (Part 2).- Chapter 13 AVX-512 Programming Packed Integers.- Chapter 14 AVX-512 Programming Packed Floating Point (Part 1).- Chapter 15 AVX-512 Programming Packed Floating Point (Part 2).- Chapter 16 Advanced Assembly Language Programming.-  Chapter 17 Assembly Language Optimization and Development Guidelines. Appendix A Source CoTable of ContentsChapter 1 – X86-Core Architecture Chapter Goal: Explains the core architecture of an x86-64 processor. Topics discussed include fundamental data types, registers, status flags, memory addressing modes, and other important architectural subjects. Understanding of this material is necessary for the reader to successfully comprehend the book’s subsequent chapters.Historical overviewData typesFundamental data typesNumerical data typesSIMD data typesMiscellaneous data typesStringsBit fields and bit stringsX86-64 processor internal architectureOverviewGeneral-purpose registersInstruction pointerRFLAGSFloating-point and SIMD registersMXCSR RegisterInstruction operandsMemory addressingCondition codesDifferences between x86-32 and x86-64Chapter 2 – X86-64 Core Programming (Part 1) Chapter Goal: Introduces the fundamentals of x86-64 assembly language programming. The programming examples illustrate essential x86-64 assembly language programming concepts including integer arithmetic, bitwise logical operations, and shift instructions. This chapter also explains basic assembler usage and x86-64 assembly language syntax.Assembler basicsInstruction syntaxAssembler directivesModern X86 Assembly Language Programming, Third Edition Page 2 of 7Daniel Kusswurm – F:\ModX86Asm3E\Proposal\ModernX86Asm3e_Outline (proposal).docxMASM vs. NASMSource code overviewFile and function naming conventionsInteger arithmeticInteger (32-bit) addition and subtraction Bitwise logical operations Shift operations Integer (64-bit) addition and subtraction Integer multiplication and division Chapter 3 – X86-64 Core Programming (Part 2) Chapter Goal: Explores additional core x86-64 assembly language programming concepts. Topics discussed include advanced integer arithmetic, memory addressing modes, and condition codes. This chapter also covers important x86-64 assembly language programming concepts including proper stack use and for-loops.Simple stack arguments Mixed-type integer arithmetic Memory addressing Condition codes Assembly language for-loops Chapter 4 – X86-64 Core Programming (Part 3) Chapter 4 explains how to exercise core x86-64 assembly language programming data constructs including arrays and structures. It also describes how to use common x86-64 string processing instructions.Arrays1D integer array arithmetic calculations 1D integer array arithmetic calculations using multiple arrays2D integer arrays StringsOverview of x86 string instructionsCounting characters String/array compare String/array copy String/array reversal Assembly language structures Chapter 5 – Scalar Floating-Point Chapter 5 teaches the reader how to perform scalar floating-point arithmetic and other operations using assembly language. It also outlines the calling convention requirements for scalar floating-point arguments and return values.Floating-point programming conceptsSingle-precision floating-point arithmeticTemperature conversions Cone volume/surface area calculation Double-precision floating-point arithmeticSphere volume/surface area calculation Floating-point compares and conversionsFloating-point compares using VUCOMIS[S|D] Floating-point compares using VCMPS[S|D] Floating-point conversions Floating-point arraysArray mean/standard deviation calculation Chapter 6 – Assembly Language Calling Conventions Chapter 6 formally defines the calling run-time conventions for x86-64 assembly language functions. The first section explains the requirements for Windows and Visual C++ while the second section covers Linux and GNU C++.Calling convention requirements for Windows and Visual C++Stack frames (Ch06_01)Using non-volatile general-purpose registers Using non-volatile SIMD registers Calling external functions Calling convention requirements for Linux and GNU C++Stack arguments Using non-volatile general-purpose registers Calling external functions Chapter 7 – Advanced Vector Extensions Chapter 7 introduces Advanced Vector Extensions (AVX). It begins with a discussion of AVX architecture and related topics. Chapter 7 also explains elementary SIMD programming concepts. Understanding of this material is necessary for the reader to comprehend the AVX, AVX2, and AVX-512 programming examples in subsequent chapters.X86-AVX architecture overviewAVXAVX2AVX-512Merge masking and zero maskingEmbedded broadcastsInstruction level roundingSIMD programing conceptsBasic arithmeticWraparound vs. saturated arithmeticPack floating-pointPack integerProgramming differences between x86-SSE and x86-AVXChapter 8 – AVX Programming – Packed Integers Chapter 8 spotlights packed integer arithmetic and other operations using AVX. It also describes how to code packed integer calculating functions using arrays and the AVX instruction set. Integer arithmeticAddition and subtraction Multiplication Bitwise logical operations Arithmetic and logical shifts Integer array algorithmsPixel minimum and maximum Pixel mean Chapter 9 – AVX Programming – Packed Floating Point Chapter 9 demonstrates packed floating-point arithmetic and other operations using AVX. This chapter also explains how to use AVX instructions to perform calculations with floating-point arrays and matrices.Floating-point arithmeticBasic arithmetic operations Compares Conversions Floating-point arraysArray mean and standard deviation Array square roots and compares Floating-point matricesMatrix column means Chapter 10 – AVX2 Programming – Packed Integers Chapter 10 describes AVX2 integer programming using x86-64 assembly language. This chapter also elucidates the coding of common image processing algorithms using the AVX2 instruction set.Integer arithmeticBasic operations Size promotions Image processingPixel clipping RGB to grayscale Pixel conversions Image histogram Chapter 11 – AVX2 Programming – Packed Floating Point (Part 1) Chapter 11 teaches the reader how to enhance the performance of universal floating-point calculations using x86-64 assembly language and the AVX2 instruction set. The reader will also learn how to accelerate these types of calculations using fused-multiply-add (FMA) instructions.Floating-Point ArraysLeast squares with FMA Floating-Point MatricesMatrix multiplication F32 Matrix multiplication F64 Matrix (4x4) multiplication F32 Matrix (4x4) multiplication F64 Matrix (4x4) vector multiplication F32 Matrix (4x4) vector multiplication F64 Covariance matrix F64 Chapter 12 – AVX2 Programming – Packed Floating Point (Part 2) Chapter 12 is a continuation of the previous chapter. It explicates the coding of advanced algorithms including matrix inversion and convolutions using AVX2 and FMA instructions.Advanced Matrix OperationsMatrix inverse F32 Matrix inverse F64 Signal Processing1D convolution F32 variable-size kernel 1D convolution F64 variable-size kernel 1D convolution F32 fixed-size kernel 1D convolution F64 fixed-size kernel Chapter 13 – AVX-512 Programming – Packed Integers Chapter 13 highlights packed integer arithmetic and other operations using x86-64 assembly language and AVX-512. It also discusses how to code frequently used image processing algorithms using the AVX-512 instruction set.Integer ArithmeticAddition and subtraction Masked addition and subtraction Image ProcessingPixel clipping Image statistics Image histogram Chapter 14 – AVX-512 Programming – Packed Floating Point (Part 1) Chapter 14 explains basic operations using packed floating-point operands and the AVX-512 instruction set. It also teaches the reader how to code common floating-point algorithms using x86-64 assembly language and AVX-512.Floating-point arithmeticFloating-point arithmetic Floating-point compares Floating-point arithmetic and mask registers Floating-point matricesCovariance matrix Matrix multiplication F32 Matrix multiplication F64 Matrix (4x4) vector multiplication F32 Matrix (4x4) vector multiplication F64 (Ch14_08)Chapter 15 – AVX-512 Programming – Packed Floating Point (Part 2) Chapter 15 is a continuation of the previous chapter. It illustrates the coding of advanced algorithms using AVX-512 and FMA instructions.Signal Processing1D convolution F32 variable-size kernel 1D convolution F64 variable-size kernel 1D convolution F32 fixed-size kernel 1D convolution F64 fixed-size kernel Chapter 16 – Advanced Instructions and Optimization Guidelines Chapter 16 demonstrates the use of advanced x86-64 assembly language instructions. It also discusses guidelines that the reader can exploit to improve the performance of their assembly language code.Advanced instructionsCPUID instruction – processor information CPUID instruction – AVX, AVX2, FMA, and AVX-512 detection Integer non-temporal memory loads and stores Floating-point non-temporal memory stores SIMD text processing Processor microarchitecture overviewX86-64 assembly language optimization guidelinesAppendix A – Source Code and Development Tools Appendix A describes how to download, install, and execute the source code. It also includes some brief usage notes about the software development tools used to create the source code examples.Source codeDownload instructionsSetup and configurationExecuting a source code exampleSoftware development tools for WindowsMicrosoft Visual StudioMASMSoftware development tools for LinuxGNU makeGNU C++ compilerNASMBenchmarking notesAppendix B – References and Additional Resources Appendix B contains a list of references that were consulted during the writing of this book. It also lists supplemental resources that the reader can consult for additional x86-64 assembly language programming information.X86-64 assembly language programming referencesAlgorithm referencesC++ referencesX86 processor software utilities and librariesAdditional resources

    1 in stock

    £49.49

  • The Ultimate Guide to Functions in Power Query

    APress The Ultimate Guide to Functions in Power Query

    1 in stock

    Book SynopsisThis book is a complete guide to using functions in Power Query and is designed to help users of all skill levels learn and master its various functions. The Ultimate Guide to Functions in Power Query begins with an introduction to Power Query and an overview of the different types of functions available, along with detailed explanations of how to use each of them. You'll see how to leverage power functions to process and transform large datasets from various sources and learn advanced techniques such as creating custom functions and using conditional statements. The book also covers best practices for using functions, including tips on how to optimize query performance and troubleshoot common errors. Using practical example applications, Author Omid Motamedisedeh demonstrates how to optimize your data processing workflows, saving time and boosting productivity. By the end of the book, readers will have a deep understanding of Power Query functions and be ableto apply their knowledTable of ContentsChapter 1: Introduction to Power Query.- Chapter 2: Data Types.- Chapter 3: Number Functions.- Chapter 4: Text Functions.- Chapter 5: Date and Time Functions.- Chapter 6: List Functions.- Chapter 7: Record Functions.- Chapter 8: Table Functions.- Chapter 9: Extracting from Data Sources.- Chapter 10: Other Functions.

    1 in stock

    £35.99

  • Introduction to Machine Learning with R

    O'Reilly Media Introduction to Machine Learning with R

    1 in stock

    Book SynopsisMachine learning is an intimidating subject until you know the fundamentals. If you understand basic coding concepts, this introductory guide will help you gain a solid foundation in machine learning principles.

    1 in stock

    £33.74

  • Practical AI for Business Leaders Product

    De Gruyter Practical AI for Business Leaders Product

    1 in stock

    Book SynopsisMost economists agree that AI is a general purpose technology (GPT) like the steam engine, electricity, and the computer. AI will drive innovation in all sectors of the economy for the foreseeable future. Practical AI for Business Leaders, Product Managers, and Entrepreneurs is a technical guidebook for the business leader or anyone responsible for leading AI-related initiatives in their organization. The book can also be used as a foundation to explore the ethical implications of AI. Authors Alfred Essa and Shirin Mojarad provide a gentle introduction to foundational topics in AI. Each topic is framed as a triad: concept, theory, and practice. The concept chapters develop the intuition, culminating in a practical case study. The theory chapters reveal the underlying technical machinery. The practice chapters provide code in Python to implement the models discussed in the case study. With this book, readers will learn: The technical foundations of machine learning and deep leaTable of Contents Introduction What is AI and why it is at the center of major business transformation? How is it related to machine learning? What is deep learning, and how is it related to ML? Why is it important? How the book is organized Who is the audience? Section 1: Machine Learning Chapter 1.1, introduction, machine learning, different types of machine learning  Chapter 1.2, Machine Learning Technical Overview  Chapter 1.3, Hands-On Machine Learning with Scikit Learn Chapter 1.4,  Advanced Topics/flavors of Machine learning Appendix: mathematical interlude Section 2: Deep Learning  Chapter 2.1, introduction (what is it, why is it important) Chapter 2.2, Deep Learning Technical Overview  Chapter 2.3, Hands-On Deep Learning with Keras Chapter 2.4,  Advanced Topics/flavors of deep learning Appendix: mathematical interlude Section 3: Putting AI into Practice: Innovation Framework Chapter 3.1: Diffusion and Dynamics of Innovation Chapter 3.2: Managing an Innovation Portfolio

    1 in stock

    £40.95

  • Genetic Algorithms in Elixir

    The Pragmatic Programmers Genetic Algorithms in Elixir

    1 in stock

    Book SynopsisFrom finance to artificial intelligence, genetic algorithms are a powerful tool with a wide array of applications. But you don't need an exotic new language or framework to get started; you can learn about genetic algorithms in a language you're already familiar with. Join us for an in-depth look at the algorithms, techniques, and methods that go into writing a genetic algorithm. From introductory problems to real-world applications, you'll learn the underlying principles of problem solving using genetic algorithms. Evolutionary algorithms are a unique and often overlooked subset of machine learning and artificial intelligence. Because of this, most of the available resources are outdated or too academic in nature, and none of them are made with Elixir programmers in mind. Start from the ground up with genetic algorithms in a language you are familiar with. Discover the power of genetic algorithms through simple solutions to challenging problems. Use Elixir features to write genetic algorithms that are concise and idiomatic. Learn the complete life cycle of solving a problem using genetic algorithms. Understand the different techniques and fine-tuning required to solve a wide array of problems. Plan, test, analyze, and visualize your genetic algorithms with real-world applications. Open your eyes to a unique and powerful field - without having to learn a new language or framework. What You Need: You'll need a macOS, Windows, or Linux distribution with an up-to-date Elixir installation.

    1 in stock

    £30.39

  • Principles of Data Management: Facilitating

    BCS Learning & Development Limited Principles of Data Management: Facilitating

    1 in stock

    Book SynopsisData is a valuable corporate asset and its effective management is vital to an organisation’s success and survival. With this book you will learn to master the key principles of data management and use them to implement best practices in your organization. This professional guide covers all the key areas of data management, including database development and corporate data modelling. It is business-focused, providing the knowledge and techniques required to successfully implement the data management function. This fully updated new edition provides new chapters on the most important data topics such as big data, artificial intelligence, linked data and concept systems. Principles of Data Management is fully aligned with syllabus for the BCS Professional Certificate in Data Management Essentials, making this the go-to text to unlocking the value of your data. Ideal for business managers and all involved in the development of information systems as well as data management professionals Comprehensive and descriptive view of data management Suitable for all levels, from beginners to advanced learners Must-read for anyone involved in the development of systems to manage data Trade ReviewThis book is an excellent guide to understanding data management theory and techniques. It works at all levels: from beginner to advanced, and from reference source to the practicalities of implementation. I would highly recommend to anyone wanting to get to grips with data management, regardless of experience in the field. -- Ian Wallis, Managing Director, Data Strategists LtdKeith has developed a broad and thorough understanding of all aspects of data management over many years, so is without doubt one of the authorities on data management. This updated book includes reference to a number of new techniques as well as refining existing guidance on data modelling and database structures. Keith clearly explains both the importance of planning and analysis of databases and repositories and an explanation of key techniques to achieve this. A ‘must buy’ for the bookshelf of any data management practitioner. -- Julian Schwarzenbach, Chair of the BCS Data Management Specialist GroupThis book provides a comprehensive and descriptive view of data management within a database setting. This is a must read for anyone involved in the development of systems to manage data. This book is as useful as it is interesting. It covers everything you need to know about getting the most out of your data management processes and architecture. -- Ian Rush, Data & Process Advantage LtdTable of ContentsPart 1: Preliminaries Chapter 1 Data and the enterprise Chapter 2 Databases and their development Chapter 3 What is data management? Part 2: Data Administration Chapter 4 Corporate data modelling Chapter 5 Data definition and naming Chapter 6 Metadata Chapter 7 Data quality Chapter 8 Data accessibility Chapter 9 Master data management Part 3: Database and Repository Administration Chapter 10 Database administration Chapter 11 Repository administration Part 4: The Data Management Environment Chapter 12 The use of packaged application software Chapter 13 Distributed data and databases Chapter 14 Business intelligence Chapter 15 Object orientation Chapter 16 Multimedia Chapter 17 Integrating data and web technology Chapter 18 Linked data Chapter 19 Concept systems Chapter 20 Big data and artificial intelligence Appendices Appendix A Comparison of data modelling notations Appendix B Generic data models Appendix C HTML and XML Appendix D Techniques and skills for data management Appendix E Data strategy Appendix F International standards for data management Appendix G The BCS Data Management Essentials syllabus

    1 in stock

    £33.24

  • Computational Intelligence in Music, Sound, Art and Design: 8th International Conference, EvoMUSART 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 24–26, 2019, Proceedings

    Springer Nature Switzerland AG Computational Intelligence in Music, Sound, Art and Design: 8th International Conference, EvoMUSART 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 24–26, 2019, Proceedings

    1 in stock

    Book SynopsisThis book constitutes the refereed proceedings of the 8th International Conference on Evolutionary Computation in Combinatorial Optimization, EvoMUSART 2019, held in Leipzig, Germany, in April 2019, co-located with the Evo*2019 events EuroGP, EvoCOP and EvoApplications. The 16 revised full papers presented were carefully reviewed and selected from 24 submissions. The papers cover a wide range of topics and application areas, including: visual art and music generation, analysis, and interpretation; sound synthesis; architecture; video; poetry; design; and other creative tasks.Table of ContentsDeep Learning Concepts for Evolutionary Art.- Adversarial Evolution and Deep Learning – How Does An Artist Play with Our Visual System.- Autonomy, Authenticity, Authorship and Intention in Computer Generated Art.- Camera Obscurer: Generative Art for Design Inspiration.- Swarm-Based Identification of Animation Key Points from 2D-medialness Maps.- Paintings, Polygons and Plant Propagation.- Evolutionary Games for Audiovisual Works: Exploring the Demographic Prisoner's Dilemma.- Emojinating: Evolving Emoji Blends.- Automatically Generating Engaging Presentation Slide Decks.- Tired of choosing? Just Add Structure and Virtual Reality.- EvoChef: Show Me What to Cook! Artificial Evolution of Culinary Arts.- Comparing Models for Harmony Prediction in An Interactive Audio Looper.- Stochastic Synthesizer Patch Exploration in Edisyn.- Evolutionary Multi-Objective Training Set Selection of Data Instances and Augmentations for Vocal Detection.- Automatic Jazz Melody Composition Through a Learning-Based Genetic Algorithm.- Exploring Transfer Functions in Evolved CTRNNs for Music Generation.

    1 in stock

    £44.99

  • Theory of Information and its Value

    Springer Nature Switzerland AG Theory of Information and its Value

    1 in stock

    Book SynopsisThis English version of Ruslan L. Stratonovich’s Theory of Information (1975) builds on theory and provides methods, techniques, and concepts toward utilizing critical applications. Unifying theories of information, optimization, and statistical physics, the value of information theory has gained recognition in data science, machine learning, and artificial intelligence. With the emergence of a data-driven economy, progress in machine learning, artificial intelligence algorithms, and increased computational resources, the need for comprehending information is essential. This book is even more relevant today than when it was first published in 1975. It extends the classic work of R.L. Stratonovich, one of the original developers of the symmetrized version of stochastic calculus and filtering theory, to name just two topics.Each chapter begins with basic, fundamental ideas, supported by clear examples; the material then advances to great detail and depth. The reader is not required to be familiar with the more difficult and specific material. Rather, the treasure trove of examples of stochastic processes and problems makes this book accessible to a wide readership of researchers, postgraduates, and undergraduate students in mathematics, engineering, physics and computer science who are specializing in information theory, data analysis, or machine learning.Trade Review“The book could be useful in advanced graduate courses with students, who are not afraid of integrals and probabilities.” (Jaak Henno, zbMATH 1454.94002, 2021)Table of Contents

    1 in stock

    £89.99

  • A Quantum Computation Workbook

    Springer Nature Switzerland AG A Quantum Computation Workbook

    1 in stock

    Book SynopsisTeaching quantum computation and information is notoriously difficult, because it requires covering subjects from various fields of science, organizing these subjects consistently in a unified way despite their tendency to favor their specific languages, and overcoming the subjects’ abstract and theoretical natures, which offer few examples of actual realizations. In this book, we have organized all the subjects required to understand the principles of quantum computation and information processing in a manner suited to physics, mathematics, and engineering courses as early as undergraduate studies.In addition, we provide a supporting package of quantum simulation software from Wolfram Mathematica, specialists in symbolic calculation software. Throughout the book’s main text, demonstrations are provided that use the software package, allowing the students to deepen their understanding of each subject through self-practice. Readers can change the code so as to experiment with their own ideas and contemplate possible applications. The information in this book reflects many years of experience teaching quantum computation and information. The quantum simulation-based demonstrations and the unified organization of the subjects are both time-tested and have received very positive responses from the students who have experienced them.Trade Review“The book provides an extensive bibliography and index. … this volume is well suited for a advanced graduate or first-year PhD course in quantum mechanics, with ample time available for self-study.” (L.-F. Pau, Computing Reviews, January 30, 2023)Table of Contents1 The Postulates of Quantum Mechanics.- 2 Virtual Realization of Quantum Computers.- 3 Quantum Computation: Overview.- 4 Quantum Algorithms: Introduction.- 5 Quantum Information: Introduction.- 6 Quantum Error Correction Codes: Introduction.- Appendix A Linear Algebra.- Appendix B Mathematica Application Q3.- References.

    1 in stock

    £44.99

  • Modeling Reality with Mathematics

    Springer Nature Switzerland AG Modeling Reality with Mathematics

    1 in stock

    Book SynopsisSimulating the behavior of a human heart, predicting tomorrow's weather, optimizing the aerodynamics of a sailboat, finding the ideal cooking time for a hamburger: to solve these problems, cardiologists, meteorologists, sportsmen, and engineers can count on math help. This book will lead you to the discovery of a magical world, made up of equations, in which a huge variety of important problems for our life can find useful answers.Trade Review“By providing tools and current examples on modeling issues ... the book makes a contribution answering the becoming more and more prevalent presence of Mathematics in our daily lives. The examples come essentially from the physical and natural sciences, but the book can be relied on in other areas, including the humanities, aside seminal works on mathematical modeling ... . The journey consists in eight rigorous and enjoying chapters.” (Lisa Morhaim, zbMATH 1519.00001, 2023)Table of Contents1 The model, aka the magic box.- 2 Weather Forecast Models.- 3 Epidemics: the Mathematics of Contagion.- 4 Mathematical Hearth.- 5 Mathematics in the Wind.- 6 Flying on Sun Power.- 7 The taste for Mathematics.- 8 Conclusions.

    1 in stock

    £20.91

  • Similarity Joins in Relational Database Systems

    Springer International Publishing AG Similarity Joins in Relational Database Systems

    1 in stock

    Book SynopsisState-of-the-art database systems manage and process a variety of complex objects, including strings and trees. For such objects equality comparisons are often not meaningful and must be replaced by similarity comparisons. This book describes the concepts and techniques to incorporate similarity into database systems. We start out by discussing the properties of strings and trees, and identify the edit distance as the de facto standard for comparing complex objects. Since the edit distance is computationally expensive, token-based distances have been introduced to speed up edit distance computations. The basic idea is to decompose complex objects into sets of tokens that can be compared efficiently. Token-based distances are used to compute an approximation of the edit distance and prune expensive edit distance calculations. A key observation when computing similarity joins is that many of the object pairs, for which the similarity is computed, are very different from each other. Filters exploit this property to improve the performance of similarity joins. A filter preprocesses the input data sets and produces a set of candidate pairs. The distance function is evaluated on the candidate pairs only. We describe the essential query processing techniques for filters based on lower and upper bounds. For token equality joins we describe prefix, size, positional and partitioning filters, which can be used to avoid the computation of small intersections that are not needed since the similarity would be too low.Table of ContentsPreface.- Acknowledgments.- Introduction.- Data Types.- Edit-Based Distances.- Token-Based Distances.- Query Processing Techniques.- Filters for Token Equality Joins.- Conclusion.- Bibliography.- Authors' Biographies.- Index.

    1 in stock

    £26.59

  • Arithmetic of Finite Fields: 9th International Workshop, WAIFI 2022, Chengdu, China, August 29 – September 2, 2022, Revised Selected Papers

    Springer International Publishing AG Arithmetic of Finite Fields: 9th International Workshop, WAIFI 2022, Chengdu, China, August 29 – September 2, 2022, Revised Selected Papers

    1 in stock

    Book SynopsisThis book constitutes the thoroughly refereed post-workshop proceedings of the 8th International Workshop on the Arithmetic of Finite Field, WAIFI 2022, held in Chengdu, China, in August – September 2022.The 19 revised full papers and 3 invited talks presented were carefully reviewed and selected from 25 submissions. The papers are organized in topical sections: structures in finite fields; efficient finite field arithmetic; coding theory; cryptography; sequences.Table of ContentsStructures in Finite Fields.- On a conjecture on irreducible polynomials over finite fields with restricted coefficients.- On two applications of polynomials xk – cx – d over finite fields and more.- Efficient Finite Field Arithmetic.- Polynomial Constructions of Chudnovsky-Type Algorithms for Multiplication in Finite Fields with Linear Bilinear Complexity.- Reduction-free Multiplication for Finite Fields and Polynomial Rings.- Finite Field Arithmetic in Large Characteristic for Classical and Post-Quantum Cryptography.- Fast enumeration of superspecial hyperelliptic curves of genus 4 with automorphism group V4.- Coding theory.- Two Classes of Constacyclic Codes with Variable Parameters.- Near MDS Codes with Dimension 4 and Their Application in Locally Recoverable Codes.- Optimal possibly nonlinear 3-PIR codes of small size.- PIR codes from combinatorial structures.- The Projective General Linear Group PGL(2, 5m) and Linear Codes of Length 5m + 1.- Private Information Retrieval Schemes Using Cyclic Codes.- Two Classes of Optimal Few-Weight Codes over Fq + uFq.- Explicit Non-Malleable Codes from Bipartite Graphs.- Cryptography.- Algebraic Relation of Three MinRank Algebraic Modelings.- Decomposition of Dillon's APN permutation with efficient hardware implementation.- New Versions of Miller-loop Secured against Side-Channel Attacks.- A Class of Power Mappings with Low Boomerang Uniformity.- New Classes of Bent Functions via the Switching Method.- Sequences.- Correlation measure of binary sequence families with trace representation.- Linear complexity of generalized cyclotomic sequences with period pnqm.- On the 2-adic complexity of cyclotomic binary sequences with period p2 and 2p2.

    1 in stock

    £56.99

  • Modelling and Development of Intelligent Systems: 8th International Conference, MDIS 2022, Sibiu, Romania, October 28–30, 2022, Revised Selected Papers

    Springer International Publishing AG Modelling and Development of Intelligent Systems: 8th International Conference, MDIS 2022, Sibiu, Romania, October 28–30, 2022, Revised Selected Papers

    1 in stock

    Book SynopsisThis book constitutes the refereed proceedings of the 8th International Conference on Modelling and Development of Intelligent Systems, MDIS 2022, held in Sibiu, Romania, during October 28–30, 2022.The 21 papers included in this book were carefully reviewed and selected from 48 submissions. They were organized in the following topical sections as follows: intelligent systems for decision support; machine learning; mathematical models for development of intelligent systems; and modelling and optimization of dynamic systems.Table of ContentsIntelligent Systems for Decision Support.- Effective LSTM Neural Network with Adam Optimizer for Improving Frost Prediction in Agriculture Data Stream.- Gaze Tracking: A Survey of Devices, Libraries and Applications.- Group Decision-Making Involving Competence of Experts in Relation to Evaluation Criteria: Case Study for e-Commerce Platform Selection.- Transparency and Traceability for AI-based Defect Detection in PCB Production.- Tasks Management Using Modern Devices.- Machine Learning.- A Method for Target Localization by Multistatic Radars.- Intrusion Detection by XGBoost Model Tuned by Improved Social Network Search Algorithm.- Bridging the Resource Gap in Cross-lingual Embedding Space.- Classification of Microstructure Images of Metals using Transfer Learning.- Generating Jigsaw Puzzles and an AI Powered Solver.- Morphology of Convolutional Neural Network with Diagonalized Pooling.- Challenges and Opportunities in Deep Learning Driven Fashion Design and Textiles Patterns Development.- Feature Selection and Extreme Learning Machine Tuning by Hybrid Sand Cat Optimization Algorithm for Diabetes Classification.- Enriching SQL-Driven Data Exploration With Different Machine Learning Models.- Mathematical Models for Development of Intelligent Systems.- Analytical Solution of the Simplest Entropiece Inversion Problem.- Latent Semantic Structure in Malicious Programs.- Innovative Lattice Sequences Based on Component by Component Construction Method for Multidimensional Sensitivity Analysis.- On an Optimization of the Lattice Sequence for the Multidimensional Integrals Connected with Bayesian Statistics.- Modelling and Optimization of Dynamic Systems.- Numerical Optimization Identification of a Keller-Segel Model for Thermoregulation in Honey Bee Colonies in Winter.- Gradient Optimization in Reconstruction of the Diffusion Coefficient in a Time Fractional Integro-Differential Equation of Pollution in Porous Media.- Flash Flood Simulation Between Slănic and Vărbilău Rivers in Vărbilău Village, Prahova County, Romania, Using Hydraulic Modeling and GIS Techniques.

    1 in stock

    £58.49

  • Tools and Algorithms for the Construction and

    Springer International Publishing AG Tools and Algorithms for the Construction and

    1 in stock

    Book SynopsisThis open access book constitutes the proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2023, which was held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, during April 22-27, 2023, in Paris, France. The 56 full papers and 6 short tool demonstration papers presented in this volume were carefully reviewed and selected from 169 submissions. The proceedings also contain 1 invited talk in full paper length, 13 tool papers of the affiliated competition SV-Comp and 1 paper consisting of the competition report. TACAS is a forum for researchers, developers, and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference aims to bridge the gaps between different communities with this common interest and to support them in their quest to improve the utility, reliability, flexibility, and efficiency of tools and algorithms for building computer-controlled systems.Table of ContentsTool Demos.- EVA: a Tool for the Compositional Verification of AUTOSAR Models.- WASIM: A Word-level Abstract Symbolic Simulation Framework for Hardware Formal Verification.- Multiparty Session Typing in Java, Deductively.- PyLTA: A Verification Tool for Parameterized Distributed Algorithms.- FuzzBtor2: A Random Generator of Word-Level Model Checking Problems in Btor2 Format.- Eclipse ESCET™: The Eclipse Supervisory Control Engineering Toolkit.- Combinatorial Optimization/Theorem Proving.- New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization.- Verified reductions for optimization.- Specifying and Verifying Higher-order Rust Iterators.- Extending a High-Performance Prover to Higher-Order Logic.- Tools (Regular Papers).- The WhyRel Prototype for Relational Verification of Pointer Programs.- Bridging Hardware and Software Analysis with Btor2C: A Word-Level-Circuit-to-C Converter.- CoPTIC: Constraint Programming Translated Into C.- Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability.- Synthesis.- Computing Adequately Permissive Assumptions for Synthesis.- Verification-guided Programmatic Controller Synthesis.- Taming Large Bounds in Synthesis from Bounded-Liveness Specifications.- Lockstep Composition for Unbalanced Loops.- Synthesis of Distributed Agreement-Based Systems with Effciently Decidable Verification.- LTL Reactive Synthesis with a Few Hints.- Timed Automata Verification and Synthesis via Finite Automata Learning.- Graphs/Probabilistic Systems.- A Truly Symbolic Linear-Time Algorithm for SCC Decomposition.- Transforming quantified Boolean formulas using biclique covers.- Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration.- Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants.- Runtime Monitoring/Program Analysis.- Industrial-Strength Controlled Concurrency Testing for C# Programs with Coyote.- Context-Sensitive Meta-Constraint Systems for Explainable Program Analysis.- Explainable Online Monitoring of Metric Temporal Logic.- 12th Competition on Software Verification — SV-COMP 2023.- Competition on Software Verification and Witness Validation: SV-COMP 2023.- Symbiotic-Witch 2: More Efficient Algorithm and Witness Refutation (Competition Contribution).- 2LS: Arrays and Loop Unwinding (Competition Contribution).- Bubaak: Runtime Monitoring of Program Verifiers (Competition Contribution).- EBF 4.2: Black-Box Cooperative Verification for Concurrent Programs (Competition Contribution).- Goblint: Autotuning Thread-Modular Abstract Interpretation (Competition Contribution).- Java Ranger: Supporting String and Array Operations (Competition Contribution).- Korn–Software Verification with Horn Clauses (Competition Contribution).- Mopsa-C: Modular Domains and Relational Abstract Interpretation for C Programs (Competition Contribution).- PIChecker: A POR and Interpolation based Verifier for Concurrent Programs (Competition Contribution).- Ultimate Automizer and the CommuHash Normal Form (Competition Contribution).- Ultimate Taipan and Race Detection in Ultimate (Competition Contribution).- VeriAbsL: Scalable Verification by Abstraction and Strategy Prediction (Competition Contribution).- VeriFuzz 1.4: Checking for (Non-)termination (Competition Contribution).

    1 in stock

    £31.49

  • A Guide to Graph Colouring: Algorithms and

    Springer International Publishing AG A Guide to Graph Colouring: Algorithms and

    1 in stock

    Book SynopsisThis book treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring arbitrary graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why. The introductory chapters explain graph colouring, and bounds and constructive algorithms. The author then shows how advanced, modern techniques can be applied to classic real-world operational research problems such as seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by a website with an online suite of downloadable code. The book will be of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. The reader should have elementary knowledge of sets, matrices, and enumerative combinatorics.Trade Review“The book gives a comprehensive description and handling on arguably one of the most important notions of combinatorics—graph coloring. … The book is nicely written, and carries a big pile of information valuable for both users and researchers in the field.” (András Sándor Pluhár, Mathematical Reviews, February, 2017)“This well-written book will serve as a utilitarian guide to graph coloring and its practical applications. It includes many definitions, theorems, proofs, algorithms, and pointers for further reading. The book will be helpful for teaching courses on graph coloring to students of mathematics and computer science. I strongly recommend it for the intended audience.” (S. V. Nagaraj, Computing Reviews, computingreviews.com, June, 2016)“The book is a comprehensive guide to graph colouring algorithms. … The book is a nice textbook for both undergraduate and graduate students in the areas of operations research and theoretical computer science. … Finally, it is a good source of knowledge for practitioners.” (Marcin Anholcer, zbMATH 1330.05002, 2016)Table of ContentsIntroduction to Graph Colouring.- Bounds and Constructive Algorithms.- Advanced Techniques for Graph Colouring.- Algorithm Case Studies.- Applications and Extensions.- Designing Seating Plans.- Designing Sports Leagues.- Designing University Timetables.- App. A, Computing Resources.- References.- Index.

    1 in stock

    £71.99

  • Machine Vision Algorithms and Applications

    Wiley-VCH Verlag GmbH Machine Vision Algorithms and Applications

    1 in stock

    Book SynopsisThe second edition of this successful machine vision textbook is completely updated, revised and expanded by 35% to reflect the developments of recent years in the fields of image acquisition, machine vision algorithms and applications. The new content includes, but is not limited to, a discussion of new camera and image acquisition interfaces, 3D sensors and technologies, 3D reconstruction, 3D object recognition and state-of-the-art classification algorithms. The authors retain their balanced approach with sufficient coverage of the theory and a strong focus on applications. All examples are based on the latest version of the machine vision software HALCON 13.Table of ContentsINTRODUCTION IMAGE ACQUISITION Illumination Lenses Cameras Camera-Computer Interfaces MACHINE VISION ALGORITHMS Fundamental Data Structures Image Enhancement Geometric Transformations Image Segmentation Feature Extraction Morphology Edge Extraction Segmentation and Fitting of Geometric Primitives Camera Calibration Stereo Reconstruction Template Matching Optical Character Recognition MACHINE VISION APPLICATIONS Wafer Dicing Reading of Serial Numbers Inspection of Saw Blades Print Inspection Inspection of Ball Grid Arrays Surface Inspection Measuring of Spark Plugs Molding Flash Detection Inspection of Punched Sheets 3D Plane Reconstruction with Stereo Pose Verification and Resistors Classification of Non-Woven Fabrics

    1 in stock

    £56.70

  • Algorithm Engineering for Integral and Dynamic

    Taylor & Francis Ltd Algorithm Engineering for Integral and Dynamic

    1 in stock

    Book SynopsisAlgorithm engineering allows computer engineers to produce a computational machine that will execute an algorithm as efficiently and cost-effectively as possible given a set of constraints, such as minimal performance or the availability of technology. Addressing algorithm engineering in a parallel setting, regular array syntheses offer powerful computation and embody best practice, but often face the criticism that they are applicable only to restricted classes of algorithms.Algorithm Engineering for Integral and Dynamic Problems reviews the basic principles of regular array synthesis and shows how to extend its use into classes of algorithms traditionally viewed to be beyond its domain of application. The author discusses the transformation of the initial algorithm specification into a specification with data dependencies of increased regularity in order to obtain corresponding regular arrays by direct application of the standard mapping techniques. The book includes a review of the basic principles of regular array synthesis followed by applications of these techniques to well-known algorithms, concluding with numerous case studies to illustrate the methods.Researchers and practitioners in algorithm engineering will find that this text significantly extends their understanding of the applications of regular array synthesis and regular array processors beyond the traditionally narrow field of relevance.Table of ContentsList of Figures. List of Tables. Preface. Acknowledgements. Introduction. Regular Array Synthesis. Integral Recurrence Equations. Dynamic Recurrence Equations. Case Studies. Conclusions. Appendix A: Notation. Appendix B: Graph Theory. Appendix C: Convex Sets and Polyhedra. Appendix D: Aspects of Linear Algebra. Bibliography. Index.

    1 in stock

    £115.00

  • 40 Algorithms Every Data Scientist Should Know

    BPB Publications 40 Algorithms Every Data Scientist Should Know

    1 in stock

    Book Synopsis

    1 in stock

    £40.15

  • Python Interview Preparation

    BPB Publications Python Interview Preparation

    1 in stock

    Book SynopsisMaster core Python language constructs. Implement OOP using classes and inheritance. Optimize array and string manipulation techniques. Apply efficient binary search and quicksort. Solve problems using recursion and backtracking. Employ memoization and tabulation for optimization.

    1 in stock

    £37.98

  • A Statistical Mechanical Interpretation of Algorithmic Information Theory

    Springer Verlag, Singapore A Statistical Mechanical Interpretation of Algorithmic Information Theory

    1 in stock

    Book SynopsisThis book is the first one that provides a solid bridge between algorithmic information theory and statistical mechanics. Algorithmic information theory (AIT) is a theory of program size and recently is also known as algorithmic randomness. AIT provides a framework for characterizing the notion of randomness for an individual object and for studying it closely and comprehensively. In this book, a statistical mechanical interpretation of AIT is introduced while explaining the basic notions and results of AIT to the reader who has an acquaintance with an elementary theory of computation.A simplification of the setting of AIT is the noiseless source coding in information theory. First, in the book, a statistical mechanical interpretation of the noiseless source coding scheme is introduced. It can be seen that the notions in statistical mechanics such as entropy, temperature, and thermal equilibrium are translated into the context of noiseless source coding in a natural manner. Then, the framework of AIT is introduced. On this basis, the introduction of a statistical mechanical interpretation of AIT is begun. Namely, the notion of thermodynamic quantities, such as free energy, energy, and entropy, is introduced into AIT. In the interpretation, the temperature is shown to be equal to the partial randomness of the values of all these thermodynamic quantities, where the notion of partial randomness is a stronger representation of the compression rate measured by means of program-size complexity. Additionally, it is demonstrated that this situation holds for the temperature itself as a thermodynamic quantity. That is, for each of all the thermodynamic quantities above, the computability of its value at temperature T gives a sufficient condition for T to be a fixed point on partial randomness.In this groundbreaking book, the current status of the interpretation from both mathematical and physical points of view is reported. For example, a total statistical mechanical interpretation of AIT that actualizes a perfect correspondence to normal statistical mechanics can be developed by identifying a microcanonical ensemble in the framework of AIT. As a result, the statistical mechanical meaning of the thermodynamic quantities of AIT is clarified. In the book, the close relationship of the interpretation to Landauer's principle is pointed out.Table of ContentsStatistical Mechanical Interpretation of Noiseless Source Coding.- Algorithmic Information Theory.- Partial Randomness.- Temperature Equals to Partial Randomness.- Fixed Point Theorems on Partial Randomness.- Statistical Mechanical Meaning of the Thermodynamic Quantities of AIT.- The Partial Randomness of Recursively Enumerable Reals.- Computation-Theoretic Clarification of the Phase Transition at Temperature T=1.- Other Related Results and Future Development.

    1 in stock

    £49.49

  • QoS Routing Algorithms for Wireless Sensor Networks

    Springer Verlag, Singapore QoS Routing Algorithms for Wireless Sensor Networks

    1 in stock

    Book SynopsisThis book provides a systematic introduction to the fundamental concepts, major challenges, and effective solutions for Quality of Service in Wireless Sensor Networks (WSNs). Unlike other books on the topic, it focuses on the networking aspects of WSNs, discussing the most important networking issues, including network architecture design, medium access control, routing and data dissemination, node clustering, node localization, query processing, data aggregation, transport and quality of service, time synchronization, and network security. Featuring contributions from researchers, this book strikes a balance between fundamental concepts and new technologies, providing readers with unprecedented insights into WSNs from a networking perspective. It is essential reading for a broad audience, including academics, research engineers, and practitioners, particularly postgraduate/postdoctoral researchers and engineers in industry. It is also suitable as a textbook or supplementary reading for graduate computer engineering and computer science courses.Table of Contents1 An Introduction to QoS in Wireless Sensor Networks 1.0.1 Wireless Sensor Network Architecture 1.0.2 Network Layer Issues and Challenges 1.0.3 Limitations of Wireless Sensor Networks 1.0.4 Challenges of Wireless Sensor Networks1.0.5 Medium Access Control Layer Issues and Challenges 1.0.6 Issues of Medium Access Control MAC Layer 1.0.7 MAC Scheme Design Challenges 1.1 MAC Scheme in Wireless Sensor Networks 1.1.1 Contention-freeMAC Protocols 1.1.2 Contention MAC Protocols 1.1.3 Hybrid MAC Protocols 1.2 Motivation 1.2.1 Network Layer1.2.2 Medium Access Control Layer 1.2.3 Design and Evaluation Metrics in the Network Layer 1.2.4 Design and Evaluation Metrics in the Medium Access Layer1.3 Applications of Wireless Sensor Networks 1.4 Quality of Service in Wireless Sensor Networks 1.4.1 Introduction 1.4.2 Quality of Service Architecture 1.4.3 Network and MAC Layer QoS Challenges 1.4.4 Network and MAC Layer QoS Requirements 1.5 Software Tools 1.6 Organization of the Book References 2 LRTHR: Link-Reliability Based Two-Hop Routing forWSNs 2.1 Introduction 2.2 Related Works 2.3 System Model and Problem Definition 2.4 Algorithm 2.4.1 Link Reliability Estimation 2.4.2 Link Delay Estimation 2.4.3 Node Forwarding Metric 2.4.4 LRTHR: An Example 2.5 Performance Evaluation 2.6 Summary References 3 FTQAC: Fault Tolerant QoS Adaptive Clustering forWSNs 3.1 Introduction 3.2 Related Works 3.3 System Model and Problem Definition 3.4 Cluster Setup and Primary Cluster Head Selection 3.5 Secondary Cluster Head Selection3.6 QoS Route Establishment 3.7 Simulation Setup 3.8 Summary References 4 RTTDR: Real-Time Traffic-Differentiated Routing forWSNs 4.1 Introduction 4.2 Related Works 4.3 System Model and Problem Definition 4.4 Algorithm 4.4.1 Link Reliability Estimation 4.4.2 Queueing and Transmission Delay Estimation 4.4.3 Node Forwarding Metric 4.4.4 Queuing Controller 4.5 Implementation and Performance Evaluation4.6 Summary References 5 RARR: Reliable Adaptive Replication Routing Scheme forWSNs5.1 Introduction 5.2 Related Works 5.3 System Model and Problem Definition 5.4 Algorithm 5.4.1 Link Capacity Estimator 5.4.2 Packet Disseminator 5.4.3 Packet Replicator 5.5 Simulation and Performance Evaluation 5.6 Summary References 6 ETXTD: ETX and RTT Delay based Fault Detection Algorithm forWSNs 6.1 Introduction6.2 Related Works 6.3 System Model and Problem Definition 6.4 Algorithm 6.4.1 Estimation of Expected Transmission Count (ETX) Metric6.4.2 Estimation of Round Trip Time (RTT) and Round TripPath (RTP) 6.4.3 Detection of Faulty Sensor Node 6.4.4 Performance Evaluation 6.5 Summary References 7 DQTSM: Distributed Qos in Time Synchronized MAC Protocol forWSNs 7.1 Introduction 7.2 Related Works 7.3 System Model and Problem Definition 7.4 Mathematical Model 7.4.1 Energy Consumption 7.4.2 DQTSM Algorithm7.5 Performance Evaluation 7.6 Summary References8 ERRAP: Efficient Retransmission Qos-Aware MAC Scheme for WSNs 8.1 Introduction 8.2 Related Works 8.3 System Model and Problem Definition 8.4 Mathematical Model 8.4.1 One-Hop Retransmissions 8.4.2 Two-QoS Groups 8.4.3 ERRAP Algorithm 8.5 Performance Evaluation 8.5.1 Simulation Setup 8.5.2 One-Hop QoS Group 8.5.3 Two QoS Groups 8.5.4 Minimizing Energy Consumption 8.6 SummaryReferences 9 CBH-MAC: Contention Based Hybrid MAC Protocol forWSNs 9.1 Introduction 9.2 Related Works 9.3 System Model and Problem Definition9.4 Mathematical Model 9.5 Performance Evaluation 9.5.1 Simulation Setup 9.5.2 Multi-hop Chain Topology 9.5.3 Multi-hop Cross Topology9.5.4 End-to-End Latency 9.5.5 Packet Delivery Ratio (PDR) Performance 9.5.6 Energy Consumption 9.6 Summary References 10 DMS-MAC: Qos Distributed Multi-Channel Scheduling MACProtocol forWSNs 10.1 Introduction 10.2 Related Works 10.3 System Model and Problem Definition 10.4 Mathematical Model 10.4.1 DMS-MAC Algorithm10.5 Performance Evaluation 10.5.1 Simulation Setup 10.6 Summary References 11 QMSR: Qos Multihop Sensor Routing Cross Layer Design forWSns 11.1 Introduction 11.2 Related Works 11.3 System Model and Problem Definition 11.4 QMSR Algorithm 11.5 Performance Evaluation 11.6 Summary References 12 EPC: Efficient Gateway Selection for Passive Clustering in MWSNs 12.1 Introduction 12.2 Related Works12.3 Network Model 12.3.1 Definitions 12.3.2 Mobile Wireless Sensor Network as a Graph 12.4 Problem Definition12.4.1 Topological Problems associated with Passive Clustering12.5 Algorithm EPC (Efficient Passive Clustering) 12.5.1 Intelligent Gateway Selection Heuristic 12.5.2 Timeout Mechanism12.6 Performance Analysis 12.7 Summary References 13 REAR: Topology Controlled Energy Management in WSNs 13.1 Introduction 13.2 Related Works 13.3 Network Model 13.3.1 Architecture 13.3.2 Wireless Sensor Model 13.4 Problem Definition 13.4.1 Basic Energy Routing (BER) in Wireless Sensor Networks 13.5 ILP and MILP Models for Maximizing the lifetime of Wireless Sensor Networks 13.5.1 Algorithm: Residual Energy Adaptive Routing(REAR) 13.5.2 An Example 13.6 Performance Evaluations 13.7 Summary References 14 GwIP: Life Time Maximization ofWSNs 14.1 Introduction 14.2 Related Works 14.3 Wireless Sensor Model 14.4 Problem Definition 14.5 Existing Algorithms 14.5.1 Broadcast Incremental Power (BIP) 14.5.2 Weighted Broadcast Incremental Protocol (WBIP) 14.6 Proposed Algorithms 14.6.1 Total Energy Weighted Incremental Model (Recharge Model)14.6.2 Global Weighted Incremental Power (GWIP) 14.6.3 Global Weight Incremental Post Sweep (GWIPS) 14.7 Performance Evaluations14.8 Summary References 15 MSNL: Energy Efficient Broadcasting in WSNs 15.1 Introduction 15.2 Related Works 15.3 Wireless Sensor Model 15.4 Problem definition 15.5 Static Network Lifetime15.5.1 Maximizing Static Network Lifetime15.6 Performance Evaluations 15.7 Summary References 16 AANTCHAIN: Adaptive ANTChain for Increasing Lifespan in WSNs16.1 Introduction 16.2 Related Works 16.3 System Model and Problem Definition 16.4 Algorithm: Adaptive AntChain 16.5 Performance Analysis 16.6 Summary References 17 SAAQ: Secure Aggregation for Approximate Queries in WSNs 17.1 Introduction 17.2 Related Works 17.2.1 Routing and Data Aggregation 17.2.2 Secure Data Aggregation 17.2.3 Introduction to Synopsis Diffusion Framework 17.2.4 Secured Data Aggregation 17.3 Problem Definition and Models 17.3.1 Network Model 17.3.2 Attack Model 17.3.3 Security Model 17.4 The SAAQ Algorithm 17.4.1 Query Dissemination 17.4.2 Synopsis Generation and Aggregation 17.5 Results and Analysis 17.5.1 Energy Consumption per Data Collection Round 17.5.2 Impact of Inflation Attack on Final Aggregate Computed 17.5.3 Impact of Deflation Attack 17.5.4 Impact of Compromised Nodes on Number of Bytes Sent per Node 17.6 Summary References 18 SDAMQ: Secure Data Aggregation for Multiple Queries in WSNs 18.1 Introduction 18.2 Related Works 18.2.1 Data Aggregation for Multiple Coexisting Queries 18.2.2 Concealed Data Aggregation18.3 Preliminaries 18.3.1 SafeQ 18.3.2 CDAMA: Concealed Data Aggregation Scheme for Multiple Applications in Wireless Sensor Networks 18.4 Problem Definition and Models 18.4.1 Network Model 18.4.2 Query Model 18.4.3 Attack Model 18.5 The SDAMQ Algorithm 18.5.1 Query Dissemination 18.5.2 Data Generation and Aggregation 18.5.3 Decryption 18.6 Results and Analysis 18.6.1 Impact of Network Size on Overall Energy Consumption 18.6.2 Impact of Attack on Packet Delivery Ratio 18.7 Summary References 19 DAMS: Data Aggregation using Mobile Sink in Wireless Sensor Networks 19.1 Introduction 19.2 Related Works 19.2.1 Logical Coordinate Space Construction 19.2.2 Destination Identification 19.2.3 Greedy Forwarding 19.3 Problem Definition and Models 19.3.1 Network Model 19.3.2 Communication Model 19.3.3 Sink Mobility Model 19.4 The Data Aggregation using Mobile Sink (DAMS) Algorithm 19.4.1 Query Dissemination from the Mobile Sink 19.4.2 Query Propagation and Route Establishment 19.4.3 Data Aggregation and Forwarding19.5 Results and Analysis19.5.1 Impact of Network Size on Average Energy Consumption 19.5.2 Impact of Network Size on Average Packet Delivery Ratio19.5.3 Impact of Network Size on Average Path Length 19.5.4 Impact of Network Size on Delay 19.6 Summary References

    1 in stock

    £80.99

  • MCMC from Scratch: A Practical Introduction to

    Springer Verlag, Singapore MCMC from Scratch: A Practical Introduction to

    1 in stock

    Book SynopsisThis textbook explains the fundamentals of Markov Chain Monte Carlo (MCMC) without assuming advanced knowledge of mathematics and programming. MCMC is a powerful technique that can be used to integrate complicated functions or to handle complicated probability distributions. MCMC is frequently used in diverse fields where statistical methods are important – e.g. Bayesian statistics, quantum physics, machine learning, computer science, computational biology, and mathematical economics. This book aims to equip readers with a sound understanding of MCMC and enable them to write simulation codes by themselves. The content consists of six chapters. Following Chap. 2, which introduces readers to the Monte Carlo algorithm and highlights the advantages of MCMC, Chap. 3 presents the general aspects of MCMC. Chap. 4 illustrates the essence of MCMC through the simple example of the Metropolis algorithm. In turn, Chap. 5 explains the HMC algorithm, Gibbs sampling algorithm and Metropolis-Hastings algorithm, discussing their pros, cons and pitfalls. Lastly, Chap. 6 presents several applications of MCMC. Including a wealth of examples and exercises with solutions, as well as sample codes and further math topics in the Appendix, this book offers a valuable asset for students and beginners in various fields. Table of ContentsChapter 1: Introduction.- Chapter 2: What is the Monte Carlo method?.- Chapter 3: General Aspects of Markov Chain Monte Carlo.- Chapter 4: Metropolis Algorithm.- Chapter 5: Other Useful Algorithms.- Chapter 6: Applications of Markov Chain Monte Carlo.

    1 in stock

    £42.74

© 2026 Book Curl

    • American Express
    • Apple Pay
    • Diners Club
    • Discover
    • Google Pay
    • Maestro
    • Mastercard
    • PayPal
    • Shop Pay
    • Union Pay
    • Visa

    Login

    Forgot your password?

    Don't have an account yet?
    Create account