Algorithms and data structures Books
IGI Global Metaheuristics Algorithm and Optimization of
Book Synopsis
£351.90
Pearson Education (US) Data Structures and Algorithm Analysis in Java
Book SynopsisMark Allen Weiss is Professor and Associate Director for the School of Computing and Information Sciences at Florida International University. He is also currently serving as both Director of Undergraduate Studies and Director of Graduate Studies. He received his Bachelor's Degree in Electrical Engineering from the Cooper Union in 1983, and his Ph.D. in Computer Science from Princeton University in 1987, working under Bob Sedgewick. He has been at FIU since 1987 and was promoted to Professor in 1996. His interests include data structures, algorithms, and education. He is most well-known for his highly-acclaimed Data Structures textbooks, which have been used for a generation by roughly a million students. Professor Weiss is the author of numerous publications in top-rated journals and was recipient of the University's Excellence in Research Award in 1994. In 1996 at FIU he was the first in the world to teach Data Structures using the Java programming language, which isTable of ContentsTable of Contents Chapter 1 Introduction 1.1 What’s the Book About? 1.2 Mathematics Review 1.2.1 Exponents 1.2.2 Logarithms 1.2.3 Series 1.2.4 Modular Arithmetic 1.2.5 The P Word 1.3 A Brief Introduction to Recursion 1.4 Implementing Generic Components Pre-Java 5 1.4.1 Using Object for Genericity 1.4.2 Wrappers for Primitive Types 1.4.3 Using Interface Types for Genericity 1.4.4 Compatibility of Array Types 1.5 Implementing Generic Components Using Java 5 Generics 1.5.1 Simple Generic Classes and Interfaces 1.5.2 Autoboxing/Unboxing 1.5.3 The Diamond Operator 1.5.4 Wildcards with Bounds 1.5.5 Generic Static Methods 1.5.6 Type Bounds 1.5.7 Type Erasure 1.5.8 Restrictions on Generics 1.6 Function Objects Summary Exercises References Chapter 2 Algorithm Analysis 2.1 Mathematical Background 2.2 Model 2.3 What to Analyze 2.4 Running Time Calculations 2.4.1 A Simple Example 2.4.2 General Rules 2.4.3 Solutions for the Maximum Subsequence Sum Problem 2.4.4 Logarithms in the Running Time 2.4.5 A Grain of Salt Summary Exercises References Chapter 3 Lists, Stacks, and Queues 3.1 Abstract Data Types (ADTs) 3.2 The List ADT 3.2.1 Simple Array Implementation of Lists 3.2.2 Simple Linked Lists 3.3 Lists in the Java Collections API 3.3.1 Collection Interface 3.3.2 Iterators 3.3.3 The List Interface, ArrayList, and LinkedList 3.3.4 Example: Using remove on a LinkedList 3.3.5 ListIterators 3.4 Implementation of ArrayList 3.4.1 The Basic Class 3.4.2 The Iterator and Java Nested and Inner Classes 3.5 Implementation of LinkedList 3.6 The Stack ADT 3.6.1 Stack Model 3.6.2 Implementation of Stacks 3.6.3 Applications 3.7 The Queue ADT 3.7.1 Queue Model 3.7.2 Array Implementation of Queues 3.7.3 Applications of Queues Summary Exercises Chapter 4 Trees 4.1 Preliminaries 4.1.1 Implementation of Trees 4.1.2 Tree Traversals with an Application 4.2 Binary Trees 4.2.1 Implementation 4.2.2 An Example: Expression Trees 4.3 The Search Tree ADT–Binary Search Trees 4.3.1 contains 4.3.2 findMin and findMax 4.3.3 insert 4.3.4 remove 4.3.5 Average-Case Analysis 4.4 AVL Trees 4.4.1 Single Rotation 4.4.2 Double Rotation 4.5 Splay Trees 4.5.1 A Simple Idea (That Does Not Work) 4.5.2 Splaying 4.6 Tree Traversals (Revisited) 4.7 B-Trees 4.8 Sets and Maps in the Standard Library 4.8.1 Sets 4.8.2 Maps 4.8.3 Implementation of TreeSet and TreeMap 4.8.4 An Example That Uses Several Maps Summary Exercises References Chapter 5 Hashing 5.1 General Idea 5.2 Hash Function 5.3 Separate Chaining 5.4 Hash Tables Without Linked Lists 5.4.1 Linear Probing 5.4.2 Quadratic Probing 5.4.3 Double Hashing 5.5 Rehashing 5.6 Hash Tables in the Standard Library 5.7 Hash Tables with Worst-Case O(1) Access 5.7.1 Perfect Hashing 5.7.2 Cuckoo Hashing 5.7.3 Hopscotch Hashing 5.8 Universal Hashing 5.9 Extendible Hashing Summary Exercises References Chapter 6 Priority Queues (Heaps) 6.1 Model 6.2 Simple Implementations 6.3 Binary Heap 6.3.1 Structure Property 6.3.2 Heap-Order Property 6.3.3 Basic Heap Operations 6.3.4 Other Heap Operations 6.4 Applications of Priority Queues 6.4.1 The Selection Problem 6.4.2 Event Simulation 6.5 d-Heaps 6.6 Leftist Heaps 6.6.1 Leftist Heap Property 6.6.2 Leftist Heap Operations 6.7 Skew Heaps 6.8 Binomial Queues 6.8.1 Binomial Queue Structure 6.8.2 Binomial Queue Operations 6.8.3 Implementation of Binomial Queues 6.9 Priority Queues in the Standard Library Summary Exercises References Chapter 7 Sorting 7.1 Preliminaries 7.2 Insertion Sort 7.2.1 The Algorithm 7.2.2 Analysis of Insertion Sort 7.3 A Lower Bound for Simple Sorting Algorithms 7.4 Shellsort 7.4.1 Worst-Case Analysis of Shellsort 7.5 Heapsort 7.5.1 Analysis of Heapsort 7.6 Mergesort 7.6.1 Analysis of Mergesort 7.7 Quicksort 7.7.1 Picking the Pivot 7.7.2 Partitioning Strategy 7.7.3 Small Arrays 7.7.4 Actual Quicksort Routines 7.7.5 Analysis of Quicksort 7.7.6 A Linear-Expected-Time Algorithm for Selection 7.8 A General Lower Bound for Sorting 7.8.1 Decision Trees 7.9 Decision-Tree Lower Bounds for Selection Problems 7.10 Adversary Lower Bounds 7.11 Linear-Time Sorts: Bucket Sort and Radix Sort 7.12 External Sorting 7.12.1 Why We Need New Algorithms 7.12.2 Model for External Sorting 7.12.3 The Simple Algorithm 7.12.4 Multiway Merge 7.12.5 Polyphase Merge 7.12.6 Replacement Selection Summary Exercises References Chapter 8 The Disjoint Set Class 8.1 Equivalence Relations 8.2 The Dynamic Equivalence Problem 8.3 Basic Data Structure 8.4 Smart Union Algorithms 8.5 Path Compression 8.6 Worst Case for Union-by-Rank and Path Compression 8.6.1 Slowly Growing Functions 8.6.2 An Analysis By Recursive Decomposition 8.6.3 An O(M log * N) Bound 8.6.4 An O( M α (M, N) ) Bound 8.7 An Application Summary Exercises References Chapter 9 Graph Algorithms 9.1 Definitions 9.1.1 Representation of Graphs 9.2 Topological Sort 9.3 Shortest-Path Algorithms 9.3.1 Unweighted Shortest Paths 9.3.2 Dijkstra’s Algorithm 9.3.3 Graphs with Negative Edge Costs 9.3.4 Acyclic Graphs 9.3.5 All-Pairs Shortest Path 9.3.6 Shortest-Path Example 9.4 Network Flow Problems 9.4.1 A Simple Maximum-Flow Algorithm 9.5 Minimum Spanning Tree 9.5.1 Prim’s Algorithm 9.5.2 Kruskal’s Algorithm 9.6 Applications of Depth-First Search 9.6.1 Undirected Graphs 9.6.2 Biconnectivity 9.6.3 Euler Circuits 9.6.4 Directed Graphs 9.6.5 Finding Strong Components 9.7 Introduction to NP-Completeness 9.7.1 Easy vs. Hard 9.7.2 The Class NP 9.7.3 NP-Complete Problems Summary Exercises References Chapter 10 Algorithm Design Techniques 10.1 Greedy Algorithms 10.1.1 A Simple Scheduling Problem 10.1.2 Huffman Codes 10.1.3 Approximate Bin Packing 10.2 Divide and Conquer 10.2.1 Running Time of Divide-and-Conquer Algorithms 10.2.2 Closest-Points Problem 10.2.3 The Selection Problem 10.2.4 Theoretical Improvements for Arithmetic Problems 10.3 Dynamic Programming 10.3.1 Using a Table Instead of Recursion 10.3.2 Ordering Matrix Multiplications 10.3.3 Optimal Binary Search Tree 10.3.4 All-Pairs Shortest Path 10.4 Randomized Algorithms 10.4.1 Random Number Generators 10.4.2 Skip Lists 10.4.3 Primality Testing 10.5 Backtracking Algorithms 10.5.1 The Turnpike Reconstruction Problem 10.5.2 Games Summary Exercises References Chapter 11 Amortized Analysis 11.1 An Unrelated Puzzle 11.2 Binomial Queues 11.3 Skew Heaps 11.4 Fibonacci Heaps 11.4.1 Cutting Nodes in Leftist Heaps 11.4.2 Lazy Merging for Binomial Queues 11.4.3 The Fibonacci Heap Operations 11.4.4 Proof of the Time Bound 11.5 Splay Trees Summary Exercises References Chapter 12 Advanced Data Structures and Implementation 12.1 Top-Down Splay Trees 12.2 Red-Black Trees 12.2.1 Bottom-Up Insertion 12.2.2 Top-Down Red-Black Trees 12.2.3 Top-Down Deletion 12.3 Treaps 12.4 Suffix Arrays and Suffix Trees 12.4.1 Suffix Arrays 12.4.2 Suffix Trees 12.4.3 Linear-Time Construction of Suffix Arrays and Suffix Trees 12.5 k-d Trees 12.6 Pairing Heaps Summary Exercises References Index
£158.01
Oxford University Press Inc Ranking
Book SynopsisTrade Review"An informative and amusing book. The author collected a treasury of stories and reflections connected with comparison, rating and ranking from the widest possible area of sports, arts, sciences, politics, media and shopping, just to mention a few. The book's main concern is not how to rank, but rather how and in what extent ranking can be avoided." * Scientometrics *"Péter Érdi's book was not a risk-free venture. It deserves a lot of success, since it has a large literary immersion, but does not hide the opinions of others." * Magyar Tudomány *"Rankings are essential in our lives-they determine the education we receive, the jobs we qualify for, the books we read, and the music we listen to. In Ranking, Péter Érdi's vivid prose brings us the science of rankings. Using examples from politics to culture, he shows how these patterns determine who wins and who loses the ranking game." * Albert-László Barabási, Professor of Network Science, Northeastern University and Harvard Medical School; author of The Formula: The Universal Laws of Success *"Most parents know their children are above average-sure proof of the subjectivity of ratings. With a light touch, combining personal experience, findings from biology and sociology and more, and with witty asides, Péter Érdi explains why Top 10 Lists fascinate us, and how to temper subjectivity with hard data when ratings and rankings truly matter." * Michael Arbib, author and Editor of more than forty books, from his pioneering Brains, Machines, and Mathematics to How the Brain Got Language: The Mirror System Hypothesis *"As my grandmother used to say, if your actions are based on comparisons with others, you'll never enjoy life. But as Ranking shows -- with lucid examples from practically every sphere of human endeavor -- we humans can't help but compare ourselves to others. So who's the best at revealing the principles and mechanisms that underpin the ubiquitous tendency to compare? The pantomathic Péter Érdi, that's who! Érdi's book, written with insight and humor, is a delightful read. I learned a lot from it, as will any individual or organization interested in this enduring aspect of the human condition-in comparing better and choosing wisely." * J. A. Scott Kelso, Glenwood and Martha Creech Eminent Scholar in Science, Florida Atlantic University; Professor Emeritus of Computational Neuroscience, Ulster University *"Drawing upon a remarkable range of disciplines, field studies, and historical insights, Érdi expertly reveals the hidden social and cognitive dynamics that inform our never-ending hunger to assign metrics to social life. With great nuance and a keen eye for detail, Érdi takes us through how supposedly straightforward processes of measurement, comparison, prioritization, and reputation management are fraught with bias and complex hidden social values. Ranking is an analytical tour-de-force and a joy to read, going straight to the top of my list of indispensable works on social hierarchy." * Alexander Cooley, Director, Harriman Institute, Columbia University *Table of Contents1 Prologue: My Early Encounters with Ranking 2 Comparison, ranking, rating, and lists 3 Social ranking in animal and human societies 4 Choices, Games, Laws, and the Web 5 The Ignorant and the Manipulative 6 Ranking games 7 The Struggle for Reputation 8 Inspired by Your Wish List: How (Not To) Buy a New Lawnmower 9 Epilogue: Rules of the Ranking Game-Where Are We Now? Notes
£42.86
MIT Press Ltd Principles of Data Mining
Book Synopsis
£76.00
WW Norton & Co Hello World
Book SynopsisShortlisted for the 2018 Baillie Gifford Prize and the 2018 Royal Society Investment Science Book Prize "A beautifully accessible guide.…One of the best books yet written on data and algorithms." —Times (UK)Trade Review"With refreshing simplicity, Fry explains what AI, machine learning and complicated algorithms really mean." -- Guardian"Fascinating and funny. I learned something on every page." -- Tom Chivers - Buzzfeed"An action-packed read during which you will be outraged, provoked, and challenged." -- Cathy O’Neil, author of Weapons of Math Destruction"This short, sharp book on the power and dangers of algorithms offers one of the clearest explanations of a complex subject." -- Financial Times"Hannah Fry is one of the best STEM explainers and popularizers today." -- Forbes"For a reader unfamiliar with the technical aspects of AI, this book offers among the best lay explanations of how algorithms work." -- Science"Hannah Fry makes algorithms sound not only quite interesting but an idea that we must understand better as they dominate more and more of our daily lives in ways we see and in many ways we don’t." -- Amazon Book Review"Mixing mathematics and storytelling, this book asks the big questions about algorithms and humans—and their future together." -- Literary Hub"A well-constructed tour of technology and its discontents?timely, too, given the increasing prominence of AI in our daily lives." -- Kirkus Reviews"A lucid and timely analysis." -- Booklist (starred review)
£12.87
Random House USA Inc Bitwise
Book SynopsisAn exhilarating, elegant memoir and a significant polemic on how computers and algorithms shape our understanding of the world and of who we are Bitwise is a wondrous ode to the computer languages and codes that captured technologist David Auerbach’s imagination. With a philosopher’s sense of inquiry, Auerbach recounts his childhood spent drawing ferns with the programming language Logo on the Apple IIe, his adventures in early text-based video games, his education as an engineer, and his contributions to instant messaging technology developed for Microsoft and the servers powering Google’s data stores. A lifelong student of the systems that shape our lives—from the psychiatric taxonomy of the Diagnostic and Statistical Manual to how Facebook tracks and profiles its users—Auerbach reflects on how he has experienced the algorithms that taxonomize human speech, knowledge, and behavior and that compel us to do the same. Into this exquisitely crafted, wide-ranging memoir of a life spent with code, Auerbach has woven an eye-opening and searing examination of the inescapable ways in which algorithms have both standardized and coarsened our lives. As we engineer ever more intricate technology to translate our experiences and narrow the gap that divides us from the machine, Auerbach argues, we willingly erase our nuances and our idiosyncrasies—precisely the things that make us human.
£15.26
Manning Publications Quantum Computing for Developers: A Java-based
Book SynopsisQuantum computing is on the horizon, ready to impact everything from scientific research to encryption and security. But you don’t need a physics degree to get started in quantum computing. Quantum Computing for Developers shows you how to leverage your existing Java skills into writing your first quantum software so you’re ready for the revolution. Rather than a hardware manual or academic theory guide, this book is focused on practical implementations of quantum computing algorithms. Using Strange, a Java-based quantum computer simulator, you’ll go hands-on with quantum computing’s core components including qubits and quantum gates as you write your very first quantum code. Key Features · An introduction to the core concepts of quantum computing · Qubits and quantum gates · Superposition, entanglement, and hybrid computing · Quantum algorithms including Shor’s, Deutsch-jozsa, and Grover’s search For Java developers at all levels who want an early start in quantum computing. No advanced math knowledge required. About the technology Whilst quantum hardware is still on the edge of development, the underlying principles for writing quantum software are well-established. Right now developers can utilize quantum simulators, like Java-based Strange, to try quantum experiments on any platform that runs the JVM. Johan Vosis a cofounder of Gluon, a Java technology company that aims to offer Java solutions for all platforms including desktop, embedded, and mobile apps, and connect them to the cloud. He is a Java Champion and holds an MSc in Mining Engineering and a PhD in Applied Physics.
£999.99
Manning Publications Machine Learning with TensorFlow
Book SynopsisThis fully revised second edition of Machine Learning with TensorFlow teaches you the foundational concepts of machine learning and how to utilize the TensorFlow library to rapidly build powerful ML models. You’ll learn the basics of regression, classification, and clustering algorithms, applying them to solve real-world challenges. New and revised content expands coverage of core machine learning algorithms and advancements in neural networks such as VGG-Face facial identification classifiers and deep speech classifiers. Written by NASA JPL Deputy CTO and Principal Data Scientist Chris Mattmann, all examples are accompanied by downloadable Jupyter Notebooks for a hands-on experience coding TensorFlow with Python. Key Features · Visualizing algorithms with TensorBoard · Understanding and using neural networks · Reproducing and employing predictive science · Downloadable Jupyter Notebooks for all examples · Questions to test your knowledge · Examples use the super-stable 1.14.1 branch of TensorFlow Developers experienced with Python and algebraic concepts like vectors and matrices. About the technology TensorFlow, Google’s library for large-scale machine learning, makes powerful ML techniques easily accessible. It simplifies often-complex computations by representing them as graphs that are mapped to machines in a cluster or to the processors of a single machine. Offering a complete ecosystem for all stages and types of machine learning, TensorFlow’s end-to-end functionality empowers machine learning engineers of all skill levels to solve their problems with ML. Chris Mattmann is the Deputy Chief Technology and Innovation Officer at NASA Jet Propulsion Lab, where he has been recognised as JPL's first Principal Scientist in the area of Data Science. Chris has applied TensorFlow to challenges he’s faced at NASA, including building an implementation of Google’s Show & Tell algorithm for image captioning using TensorFlow. He contributes to open source as a former Director at the Apache Software Foundation, and teaches graduate courses at USC in Content Detection and Analysis, and in Search Engines and Information Retrieval. Nishant Shukla wrote the first edition of Machine Learning with TensorFlow.Trade Review'A practical, no-nonsense, original approach to machine learning.' Alain Couniot, Sopra Steria Benelux 'An excellent book for readers who want to learn TensorFlow and machine learning.' Bhagvan Kommadi, ValueMomentum 'A great way to learn the ins and outs of TensorFlow, from the fundamentals to autoencoders, CNNs, and sequence-to-sequence models.' Ariel Gamiño, GLG 'Full of practical examples illustrating the concepts in a clear, progressive approach. This book is worth your while!' Alain Lompo, ISO-GRUPPETable of Contentstable of contents PART 1. YOUR MACHINE-LEARNING RIG READ IN LIVEBOOK 1A MACHINE-LEARNING ODYSSEY READ IN LIVEBOOK 2TENSORFLOW ESSENTIALS PART 2. CORE LEARNING ALGORITHMS READ IN LIVEBOOK 3LINEAR REGRESSION AND BEYOND READ IN LIVEBOOK 4USING REGRESSION FOR CALL-CENTER VOLUME PREDICTION READ IN LIVEBOOK 5A GENTLE INTRODUCTION TO CLASSIFICATION READ IN LIVEBOOK 6SENTIMENT CLASSIFICATION: LARGE MOVIE-REVIEW DATASET READ IN LIVEBOOK 7AUTOMATICALLY CLUSTERING DATA READ IN LIVEBOOK 8INFERRING USER ACTIVITY FROM ANDROID ACCELEROMETER DATA READ IN LIVEBOOK 9HIDDEN MARKOV MODELS READ IN LIVEBOOK 10PART-OF-SPEECH TAGGING AND WORD-SENSE DISAMBIGUATION PART 3. THE NEURAL NETWORK PARADIGM READ IN LIVEBOOK 11A PEEK INTO AUTOENCODERS READ IN LIVEBOOK 12APPLYING AUTOENCODERS: THE CIFAR-10 IMAGE DATASET READ IN LIVEBOOK 13REINFORCEMENT LEARNING READ IN LIVEBOOK 14CONVOLUTIONAL NEURAL NETWORKS READ IN LIVEBOOK 15BUILDING A REAL-WORLD CNN: VGG -FACE AND VGG -FACE LITE READ IN LIVEBOOK 16RECURRENT NEURAL NETWORKS READ IN LIVEBOOK 17LSTMS AND AUTOMATIC SPEECH RECOGNITION READ IN LIVEBOOK 18SEQUENCE-TO-SEQUENCE MODELS FOR CHATBOTS READ IN LIVEBOOK 19UTILITY LANDSCAPE READ IN LIVEBOOK APPENDIX A: INSTALLATION INSTRUCTIONS
£999.99
Murphy & Moore Publishing Data Mining: Concepts and Algorithms
Book Synopsis
£999.99
States Academic Press Introduction to Algorithms
Book Synopsis
£108.11
Willford Press Computer Systems: Construction Algorithms and
Book Synopsis
£115.91
ISTE Ltd and John Wiley & Sons Inc Modeling and Optimization of Air Traffic
Book SynopsisThis book combines the research activities of the authors, both of whom are researchers at Ecole Nationale de l’Aviation Civile (French National School of Civil Aviation), and presents their findings from the last 15 years. Their work uses air transport as its focal point, within the realm of mathematical optimization, looking at real life problems and theoretical models in tandem, and the challenges that accompany studying both approaches. The authors’ research is linked with the attempt to reduce air space congestion in Western Europe, USA and, increasingly, Asia. They do this through studying stochastic optimization (particularly artificial evolution), the sectorization of airspace, route distribution and takeoff slots, and by modeling airspace congestion. Finally, the authors discuss their short, medium and long term research goals. They hope that their work, although related to air transport, will be applied to other fields, such is the transferable nature of mathematical optimization. At the same time, they intend to use other areas of research, such as approximation and statistics to complement their continued inquiry in their own field. Contents 1. Introduction. Part 1. Optimization and Artificial Evolution 2. Optimization: State of the Art. 3. Genetic Algorithms and Improvements. 4. A new concept for Genetic Algorithms based on Order Statistics. Part 2. Applications to Air Traffic Control 5. Air Traffic Control. 6. Contributions to Airspace Sectorization. 7. Contribution to Traffic Assignment. 8. Airspace Congestion Metrics. 9. Conclusion and Future Perspectives. About the Authors Daniel Delahaye works for Ecole Nationale de l’Aviation Civile (French National School of Civil Aviation) in France. Stéphane Puechmorel works for Ecole Nationale de l’Aviation Civile (French National School of Civil Aviation) in France.Table of ContentsIntroduction xi PART 1. OPTIMIZATION AND ARTIFICIAL EVOLUTION 1 Chapter 1. Optimization: State of the Art 3 1.1. Methodological principles in optimization 3 1.1.1. Introduction 3 1.1.2. Modeling 4 1.1.3. Complexity 12 1.1.4. Computation time 13 1.1.5. Conclusion 13 1.2. Optimization algorithms 14 1.2.1. Introduction 14 1.2.2. Linear programming 15 1.2.3. Nonlinear programming (NLP) 16 1.2.4. Local methods subject to constraints 19 1.2.5. Deterministic global methods 21 1.2.6. Stochastic global methods 25 1.2.7. Genetic algorithms 33 1.2.8. Conclusion 34 Chapter 2. Genetic Algorithms and Improvements 37 2.1. General points 37 2.1.1. Introduction 37 2.1.2. Principle of genetic algorithms 39 2.1.3. Coding principles 42 2.1.4. Random generation of the initial population 42 2.1.5. Crossover operators 43 2.1.6. Mutation operators 45 2.1.7. Selection principles 47 2.2. Classic improvements 48 2.2.1. Scaling 49 2.2.2. Sharing 50 2.2.3. Crowding 52 2.2.4. Memetic algorithms 53 2.2.5. Multi-objective genetic algorithms 53 2.3. Our contributions 57 2.3.1. Adaptive clustered sharing 58 2.3.2. Association of genetic algorithms with simulated annealing 60 2.3.3. Parallel genetic algorithms 64 2.4. Conclusion 66 Chapter 3. A New Concept for Genetic Algorithms Based on Order Statistics 67 3.1. Introduction 67 3.2. Order statistics 68 3.3. Estimating the probability that the global optimum belongs to a given domain 71 3.4. Genetic algorithms and order statistics 71 3.4.1. Introduction 71 3.4.2. Coding 72 3.4.3. Recombination operators 73 3.4.4. Evaluation of fitness 75 3.5. Application to test functions 75 3.5.1. Results for the Griewank function 77 3.5.2. Results for the Rosenbrook function 78 3.5.3. Results for the Lennard-Jones function 79 3.6. Conclusion 81 PART 2. APPLICATIONS TO AIR TRAFFIC CONTROL 83 Chapter 4. Air Traffic Control 85 Chapter 5. Contributions to Airspace Sectorization 91 5.1. Introduction 91 5.2. Modeling in 2D 93 5.2.1. Model based on a transportation network 93 5.2.2. Associated complexity 98 5.3. Continuous modeling 99 5.3.1. Principle 99 5.3.2. Chromosome coding 101 5.3.3. Initial population generation principle 101 5.3.4. Crossover operator 101 5.3.5. Mutation operator 103 5.3.6. Calculation and normalization of the fitness function 104 5.3.7. Results 106 5.3.8. Conclusion 110 5.4. Discrete modeling 111 5.4.1. Principle 111 5.4.2. Coding 113 5.4.3. Recombination operators 115 5.4.4. Results 117 5.4.5. Conclusion 119 5.5. Extension 3D 119 5.5.1. Introduction 119 5.5.2. Mathematical modeling 122 5.5.3. Application of artificial evolution to the problem 127 5.5.4. Results 132 5.5.5. Conclusion 135 5.6. Accounting for the dynamic aspect 136 5.6.1. Formalization of objectives and associated mathematical model 136 5.6.2. Optimization using a genetic algorithm: continuous approach 140 5.6.3. Optimization using a genetic algorithm: discrete approach 144 Chapter 6. Contribution to Traffic Assignment 151 6.1. Summary of traffic assignment methods based on transportation network theory 152 6.1.1. Transportation networks 153 6.1.2. Static assignment 155 6.1.3. Dynamic assignment 163 6.2. Other approaches to traffic assignment 167 6.2.1. Temporal extension of the network 167 6.2.2. Optimal control 168 6.2.3. Dynamic programming approaches (ground holding problem) 169 6.2.4. Conclusion 171 6.3. Using artificial evolution in all-or-nothing traffic assignment 173 6.3.1. Mathematical formalization of objectives 173 6.3.2. Coding and operators of the genetic algorithm 176 6.3.3. Introduction of an inter-chromosome distance for sharing 179 6.3.4. Example of results 182 6.3.5. Conclusion 185 6.4. Allocation of routes and slots using artificial evolution 186 6.4.1. System architecture 187 6.4.2. The fitness function 192 6.4.3. Simple genetic algorithm 194 6.5. Modification of the algorithm – adaptive modifications 198 6.5.1. Establishing congestion levels in the chromosome 198 6.5.2. Establishment of trends 200 6.5.3. New coding and biased initial population 203 6.5.4. New crossover operator 203 6.5.5. New mutation operator 204 6.5.6. New results 205 6.5.7. Dynamic bi-allocation 207 6.5.8. Multi-objective approach 210 6.5.9. Conclusion 211 6.6. Sequencing flights for landing 211 6.6.1. Introduction 212 6.6.2. Single runway formulation 213 6.6.3. Modeling using GA 214 6.6.4. Results 217 6.7. Trajectory planning 220 6.7.1. Introduction 220 6.7.2. The light propagation algorithm 222 6.7.3. Approach using genetic algorithms on B-splines 234 6.8. Conclusion 241 Chapter 7. Airspace Congestion Metrics 243 7.1. Introduction 243 7.2. Flow-based approach 248 7.2.1. Mathematical modeling of the control workload 253 7.3. Geometrical approaches 253 7.3.1. Proximity metric 254 7.3.2. Convergence 258 7.3.3. Clusters 263 7.3.4. Grassmannian indicator 265 7.4. Approach based on dynamic systems 268 7.4.1. Linear dynamic systems 268 7.4.2. Spatial extension using nonlinear dynamic systems 273 7.4.3. Spatiotemporal extension using nonlinear dynamic systems 281 7.4.4. Local linear models 285 7.4.5. Stochastic extension 288 Conclusion and Future Perspectives 291 Bibliography 299 Index 327
£132.00
Pearson Education Mahout in Action
Book Synopsis
£40.03
de Gruyter Modern Algorithms for Large Sparse Eigenvalue
Book Synopsis
£111.62
De Gruyter Algorithmen und rekursive Funktionen
Book Synopsis
£134.09
Pearson Education MMIX Supplement The
Book Synopsis
£26.99
Pearson Education Data Structures Algorithm Analysis in C Pearson
Book Synopsis
£108.00
Pearson Education Data Structures Algorithm Analysis in C Ucertify
Book Synopsis
£126.00
Pearson Education Data Structures Algorithm Analysis in C Pearson
Book Synopsis
£126.00
University of California Press The Feel of Algorithms
Book SynopsisWhy do we feel excited, afraid, and frustrated by algorithms?The Feel of Algorithms brings relatable first-person accounts of what it means to experience algorithms emotionally alongside interdisciplinary social science research, to reveal how political and economic processes are felt in the everyday. People's algorithm stories might fail to separate fact and misconception, and circulate wishful, erroneous, or fearful views of digital technologies. Yet rather than treating algorithmic folklore as evidence of ignorance, this novel book explains why personal anecdotes are an important source of algorithmic knowledge. Minna Ruckenstein argues that we get to know algorithms by feeling their actions and telling stories about them. The Feel of Algorithms shows how taking everyday algorithmic emotions seriously balances the current discussion, which has a tendency to draw conclusions based on celebratory or oppositional responses to imagined future effects. An everyday focus zooms into experiences of pleasure, fear, and irritation, highlighting how political aims and ethical tensions play out in visions, practices, and emotional responses. This book shows that feelings aid in recognizing troubling practices, and also calls for alternatives that are currently ignored or suppressed.Table 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
£999.99
Pearson Education Data Structures and Algorithms in Java
Book SynopsisRobert Lafore has degrees in Electrical Engineering and Mathematics, has worked as a systems analyst for the Lawrence Berkeley Laboratory, founded his own software company, and is a best-selling writer in the field of computer programming. Some of his current titles are C++ Interactive Course and Object-Oriented Programming in C++. Earlier best-selling titles include Assembly Language Primer for the IBM PC and XT and (back at the beginning of the computer revolution) Soul of CP/M.Table of Contents Introduction. What's New in the Second Edition. What This Book Is About. What's Different About This Book. Who This Book Is For. What You Need to Know Before You Read This Book. The Software You Need to Use This Book. How This Book Is Organized. Enjoy Yourself! 1. Overview. What Are Data Structures and Algorithms Good For? Overview of Data Structures. Overview of Algorithms. Some Definitions. Object-Oriented Programming. Software Engineering. Java for C++ Programmers. Java Library Data Structures. Summary. Questions. 2. Arrays. The Array Workshop Applet. The Basics of Arrays in Java. Dividing a Program into Classes. Class Interfaces. The Ordered Workshop Applet. Java Code for an Ordered Array. Logarithms. Storing Objects. Big O Notation. Whay Not Use Arrays for Everything. Summary. Questions. Experiments. Programming Projects. 3. Simple Sorting. How Would You Do It. Bubble Sort. Selection Sort. Insertion Sort. Sorting Objects. Comparing the Simple Sorts. Summary. Questions. Experiments. Programming Projects. 4. Stacks and Queues. A Different Kind of Structure. Stacks. Queues. Priority Queues. Parsing Arithmetic Expressions. Summary. Questions. Experiments. Programming Projects. 5. Linked Lists. Links. The LinkList Workshop Applet. A Simple Linked List. Finding and Deleting Specified Links. Double-Ended Lists. Linked-List Efficiency. Abstract Data Types. Sorted Lists. Doubly Linked Lists. Iterators. Summary. Questions. Experiments. Programming Projects. 6. Recursion. Triangular Numbers. Factorials. Anagrams. A Recursive Binary Search. The Towers of Hanoi. Mergesort. Eliminating Recursion. Some Interesting Recursive Applications. Summary. Questions. Experiments. Programming Projects. 7. Advanced Sorting. Shellsort. Paartitioning. Quicksort. Radix Sort. Summary. Questions. Experiments. Programming Projects. 8. Binary Trees. Why Use Binary Trees? Tree Terminology. An Analogy. How Do Binary Search Trees Work. Finding a Node. Inserting a Node. Traversing the Tree. Finding Maximum and Minimum Values. Deleting a Node. The Efficiency of Binary Trees. Trees Represented as Arrays. Duplicate Keys. The Complete tree.java Program. The Huffman Code. Summary. Questions. Experiments. Programming Projects. 9. Red-Black Trees. Our Approach to the Discussion. Balanced and Unbalanced Trees. Using the RBTree Workshop Applet. Experimenting with the Workshop Applet. Rotations. Inserting a New Node. Deletion. The Efficiency of Red-Black Trees. Red-Black Tree Implementation. Other Balanced Trees. Summary. Questions. Experiments. 10. 2-3-4 Trees and External Storage. Introduction to 2-3-4 Trees. The Tree234 Workshop Applet. Java Code for a 2-3-4 Tree. 2-3-4 Trees and Red-Black Trees. Efficiency of 2-3-4 Trees. 2-3 Trees. External Storage. Summary. Questions. Experiments. Programming Projects. 11. Hash Tables. Introduction to Hashing. Open Addressing. Separate Chaining. Hash Functions. Hashing Efficiency. Hashing and External Storage. Summary. Questions. Experiments. Programming Projects. 12. Heaps. Introduction to Heaps. The Heap Workshop Applet. Java Code fo Heaps. A Tree-based Heap. Heapsort. Summary. Questions. Experiments. Programming Projects. 13. Graphs. Introduction to Graphs. Searches. Minimum Spanning Trees. Topological Sorting with Directed Graphs. Connectivity in Directed Graphs. Summary. Questions. Experiments. Programming Projects. 14. Weighted Graphs. Minimum Spanning Tree with Weighted Graphs. The Shortest-Path Problem. The All-Pairs Shortest-Path Problem. Efficiency. Intractable Problems. Summary. Questions. Experiments. Programming Projects. 15. When to Use What. General-Purpose Data Structures. Special-Purpose Data Structures. Sorting. Graphs. External Storage. Onward. Appendix A. Running the Workshop Applets and Example Programs. The Workshop Applets. The Example Programs. The Sun Microsystem's Software Development Kit. Multiple Class Files. Other Development Systems. Appendix B. Further Reading. Data Structures and Algorithms. Object-Oriented Programming Languages. Object-Oriented Design (OOD) and Software Engineering. Appendix C. Answers to Questions. Chapter 1, Overview. Chapter 2, Arrays. Chapter 3, Simple Sorting. Chapter 4, Stacks and Queues. Chapter 5, Linked Lists. Chapter 6, Recursion. Chapter 7, Advanced Sorting. Chapter 8, Binary Trees. Chapter 9, Red-Black Trees. Chapter 10, 2-3-4 Trees and External Storage. Hash Tables. Heaps. Graphs. Weighted Graphs. Index.
£48.44
Cambridge University Press Mathematical Analysis of Machine Learning
Book SynopsisThis self-contained textbook introduces students and researchers of AI to the key mathematical concepts and techniques necessary to learn and analyze machine learning algorithms. Readers will gain the technical knowledge needed to understand research papers in theoretical machine learning, without much difficulty.Trade Review'This graduate-level text gives a thorough, rigorous and up-to-date treatment of the main mathematical tools that have been developed for the analysis and design of machine learning methods. It is ideal for a graduate class, and the exercises at the end of each chapter make it suitable for self-study. An excellent addition to the literature from one of the leading researchers in this area, it is sure to become a classic.' Peter Bartlett, University of California, Berkeley'This book showcases the breadth and depth of mathematical ideas in learning theory. The author has masterfully synthesized techniques from the many disciplines that have contributed to this subject, and presented them in an accessible format that will be appreciated by both newcomers and experts alike. Readers will learn the tools-of-the-trade needed to make sense of the research literature and to express new ideas with clarity and precision.' Daniel Hsu, Columbia University'Tong Zhang shares in this book his deep and broad knowledge of machine learning, writing an impressively comprehensive and up-to-date reference text, providing a rigorous and rather advanced treatment of the most important topics and approaches in the mathematical study of machine learning. As an authoritative reference and introduction, his book will be a great asset to the field.' Robert Schapire, Microsoft Research'This book gives a systematic treatment of the modern mathematical techniques that are commonly used in the design and analysis of machine learning algorithms. Written by a key contributor to the field, it is a unique resource for graduate students and researchers seeking to gain a deep understanding of the theory of machine learning.' Shai Shalev-Shwartz, Hebrew University of JerusalemTable of Contents1. Introduction; 2. Basic probability inequalities for sums of independent random variables; 3. Uniform convergence and generalization analysis; 4. Empirical covering number analysis and symmetrization; 5. Covering number estimates; 6. Rademacher complexity and concentration inequalities; 7. Algorithmic stability analysis; 8. Model selection; 9. Analysis of kernel methods; 10. Additive and sparse models; 11. Analysis of neural networks; 12. Lower bounds and minimax analysis; 13. Probability inequalities for sequential random variables; 14. Basic concepts of online learning; 15. Online aggregation and second order algorithms; 16. Multi-armed bandits; 17. Contextual bandits; 18. Reinforcement learning; A. Basics of convex analysis; B. f-Divergence of probability measures; References; Author index; Subject index.
£42.74
Springer An Introduction to Mathematical Cryptography
Book SynopsisPreface.- Introduction.- 1 An Introduction to Cryptography.- 2 Discrete Logarithms and Diffie-Hellman.- 3 Integer Factorization and RSA.- 4 Digital Signatures.- 5 Combinatorics, Probability, and Information Theory.- 6 Elliptic Curves and Cryptography.- 7 Lattices and Cryptography.- 8 Additional Topics in Cryptography.- List of Notation.- References.- Index.Trade Review“This book explains the mathematical foundations of public key cryptography in a mathematically correct and thorough way without omitting important practicalities. … I would like to emphasize that the book is very well written and quite clear. Topics are well motivated, and there are a good number of examples and nicely chosen exercises. To me, this book is still the first-choice introduction to public-key cryptography.” (Klaus Galensa, Computing Reviews, March, 2015)“This is a text for an upper undergraduate/lower graduate course in mathematical cryptography. … It is very well written and quite clear. Topics are well-motivated, and there are a good number of examples and nicely chosen exercises. … An instructor of a fairly sophisticated undergraduate course in cryptography who wants to emphasize public key cryptography should definitely take a look at this book.” (Mark Hunacek, MAA Reviews, October, 2014)Table of ContentsPreface.- Introduction.- 1 An Introduction to Cryptography.- 2 Discrete Logarithms and Diffie-Hellman.- 3 Integer Factorization and RSA.- 4 Digital Signatures.- 5 Combinatorics, Probability, and Information Theory.- 6 Elliptic Curves and Cryptography.- 7 Lattices and Cryptography.- 8 Additional Topics in Cryptography.- List of Notation.- References.- Index.
£999.99
Technics Publications LLC Julia for Data Science
Book SynopsisMaster how to use the Julia language to solve business critical data science challenges. After covering the importance of Julia to the data science community and several essential data science principles, we start with the basics including how to install Julia and its powerful libraries. Many examples are provided as we illustrate how to leverage each Julia command, dataset, and function. Specialised script packages are introduced and described. Hands-on problems representative of those commonly encountered throughout the data science pipeline are provided, and we guide you in the use of Julia in solving them using published datasets. Many of these scenarios make use of existing packages and built-in functions, as we cover: 1. An overview of the data science pipeline along with an example illustrating the key points, implemented in Julia; 2. Options for Julia IDEs; 3. Programming structures and functions; 4. Engineering tasks, such as importing, cleaning, formatting and storing data, as well as performing data pre-processing; 5. Data visualisation and some simple yet powerful statistics for data exploration purposes; 6. Dimensionality reduction and feature evaluation; 7. Machine learning methods, ranging from unsupervised (different types of clustering) to supervised ones (decision trees, random forests, basic neural networks, regression trees, and Extreme Learning Machines); 8. Graph analysis including pinpointing the connections among the various entities and how they can be mined for useful insights. Each chapter concludes with a series of questions and exercises to reinforce what you learned. The last chapter of the book will guide you in creating a data science application from scratch using Julia.
£999.99
Arcler Education Inc Handbook of Metadata, Semantics and Ontologies
Book SynopsisMetadata research is a new field of study that focuses on providing a variety of digital resources with semantic descriptions, where digital resources is the most common target. These related descriptions form the foundation for more progressive and improved services in a number of applications such as, location and search, customization, and automated information delivery. As a result, metadata research focuses not only on the creation of metadata description languages but also on the practices of creating, disseminating, evaluating, maintaining, and using metadata in a variety of settings and usage contexts. The objective of the Semantic Web is essentially built on Ontology, which has recently emerged as a knowledge symbol infrastructure for the delivery of mutual semantics to metadata. A truly multidisciplinary approach is required because the combination of metadata description methods and ontology engineering creates a new setting for information engineering with certain setbacks and promising applications. The purpose of this volume is to promote interaction among researchers from a variety of disciplines and to provide some fundamental insights for the activity of engineering systems dependent on metadata, semantics, and ontologies.Table of Contents Chapter 1 Typology of Metadata and Metadata Uses Chapter 2 The Value and Cost of Metadata Chapter 3 History of Ontologies Chapter 4 Brief History of MetadataChapter 5 Metadata Quality Chapter 6 Ontologies in System Theory Chapter 7 Technologies and Systems for Managing MetadataChapter 8 Ontologies and Ontology Languages Chapter 9 Using Metadata for E-Learning Chapter 10 Methodologies for the Creation of Semantic Data in Libraries
£143.20
Springer London Ltd Graph Theory
Book SynopsisThe primary aim of this book is to present a coherent introduction to graph theory, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated. The book also serves as an introduction to research in graph theory.Trade Reviewdeveloped by Paul Seymour and Neil Robertson and followers), which certainly now deserves a monographic treatment of its own. Summing up: Recommended. Lower-division undergraduate through professional collections. CHOICE This book is a follow-on to the authors' 1976 text, Graphs with Applications. What began as a revision has evolved into a modern, first-class, graduate-level textbook reflecting changes in the discipline over the past thirty years... This text hits the mark by appearing in Springer’s Graduate Texts in Mathematics series, as it is a very rigorous treatment, compactly presented, with an assumption of a very complete undergraduate preparation in all of the standard topics. While the book could ably serve as a reference for many of the most important topics in graph theory, it fulfills the promise of being an effective textbook. The plentiful exercises in each subsection are divided into two groups, with the second group deemed "more challenging". Any exercises necessary for a complete understanding of the text have also been marked as such. There is plenty here to keep a graduate student busy, and any student would learn much in tackling a selection of the exercises... Not only is the content of this book exceptional, so too is its production. The high quality of its manufacture, the crisp and detailed illustrations, and the uncluttered design complement the attention to the typography and layout. Even in simple black and white with line art, it is a beautiful book. SIAM Book Reviews "A text which is designed to be usable both for a basic graph theory course … but also to be usable as an introduction to research in graph theory, by including more advanced topics in each chapter. There are a large number of exercises in the book … . The text contains drawings of many standard interesting graphs, which are listed at the end." (David B. Penman, Zentralblatt MATH, Vol. 1134 (12), 2008) MathSciNet Reviews "The present volume is intended to serve as a text for "advanced undergraduate and beginning graduate students in mathematics and computer science" (p. viii). It is well suited for this purpose. The writing is fully accessible to the stated groups of students, and indeed is not merely readable but is engaging… Even a complete listing of the chapters does not fully convey the breadth of this book… For researchers in graph theory, this book offers features which parallel the first Bondy and Murty book: it provides well-chosen terminology and notation, a multitude of especially interesting graphs, and a substantial unsolved problems section…One-hundred unsolved problems are listed in Appendix A, a treasure trove of problems worthy of study… (In short) this rewrite of a classic in graph theory stands a good chance of becoming a classic itself." "The present volume is intended to serve as a text for ‘advanced undergraduate and beginning graduate students in mathematics and computer science’ … . The writing is fully accessible to the stated groups of students, and indeed is not merely readable but is engaging. The book has many exercise sets, each containing problems … ." (Arthur M. Hobbs, Mathematical Reviews, Issue 2009 C) "A couple of fantastic features: Proof techniques: I love these nutshelled essences highlighted in bordered frames. They look like pictures on the wall and grab the view of the reader. Exercises: Their style, depth and logic remind me of Lovász’ classical exercise book. Also the fact that the name of the author is bracketed after the exercise…Figures: Extremely precise and high-tech…The book contains very recent results and ideas. It is clearly an up-to-date collection of fundamental results of graph theory…All-in-all, it is a marvelous book." (János Barát, Acta Scientiarum Mathematicarum, Vol. 75, 2009)Table of ContentsGraphs.- Subgraphs.- Connected Graphs.- Trees.- Nonseparable Graphs.- Tree-Search Algorithms.- Flows in Networks.- Complexity of Algorithms.- Connectivity.- Planar Graphs.- The Four-Colour Problem.- Stable Sets and Cliques.- The Probabilistic Method.- Vertex Colourings.- Colourings of Maps.- Matchings.- Edge Colourings.- Hamilton Cycles.- Coverings and Packings in Directed Graphs.- Electrical Networks.- Integer Flows and Coverings.
£999.99
Springer Nature Switzerland AG Sequential and Parallel Algorithms and Data
Book SynopsisThis textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between simplicity and efficiency, between theory and practice, and between classical results and the forefront of research. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, optimization, collective communication and computation, and load balancing. The authors also discuss important issues such as algorithm engineering, memory hierarchies, algorithm libraries, and certifying algorithms. Moving beyond the sequential algorithms and data structures of the earlier related title, this book takes into account the paradigm shift towards the parallel processing required to solve modern performance-critical applications and how this impacts on the teaching of algorithms. The book is suitable for undergraduate and graduate students and professionals familiar with programming and basic mathematical language. Most chapters have the same basic structure: the authors discuss a problem as it occurs in a real-life situation, they illustrate the most important applications, and then they introduce simple solutions as informally as possible and as formally as necessary so the reader really understands the issues at hand. As they move to more advanced and optional issues, their approach gradually leads to a more mathematical treatment, including theorems and proofs. The book includes many examples, pictures, informal explanations, and exercises, and the implementation notes introduce clean, efficient implementations in languages such as C++ and Java.Trade Review“The style of the book is accessible and is suitable for a wide range of audiences, from mathematicians and computer scientists to researchers from other fields who would like to use parallelised approaches in their research.” (Irina Ioana Mohorianu, zbMATH 1445.68003, 2020)Table of ContentsAppetizer: Integer Arithmetic.- Introduction.- Representing Sequences by Arrays and Linked Lists.- Hash Tables and Associative Arrays.- Sorting and Selection.- Priority Queues.- Sorted Sequences.- Graph Representation.- Graph Traversal.- Shortest Paths.- Minimum Spanning Trees.- Generic Approaches to Optimization.- Collective Communication and Computation.- Load Balancing.- App. A, Mathematical Background.- App. B, Computer Architecture Aspects.- App. C, Support for Parallelism in C++.- App. D, The Message Passing Interface (MPI).- App. E, List of Commercial Products, Trademarks and Licenses.
£999.99
Springer Nature Switzerland AG Elements of the General Theory of Optimal
Book SynopsisIn this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Throughout the book, the authors explore well-known and proposed algorithms with a view toward analyzing their quality and the range of their efficiency. The concept of the approach taken is based on several theories (of computations, of optimal algorithms, of interpolation, interlination, and interflatation of functions, to name several). Theoretical principles and practical aspects of testing the quality of algorithms and applied software, are a major component of the exposition. The computer technology in construction of T-efficient algorithms for computing ε-solutions to problems of computational and applied mathematics, is also explored. The readership for this monograph is aimed at scientists, postgraduate students, advanced students, and specialists dealing with issues of developing algorithmic and software support for the solution of problems of computational and applied mathematics.Table of Contents-Preface.- Introduction.- List of symbols and abbreviations.- 1. Elements of the computing theory.- 2. Theories of computational complexity.- 3. Interlination of functions.- 4. Interflatation of functions.- 5. Cubature formulae using interlanation functions.- 6. Testing the quality of algorithm programs.- 7. Computer technologies of solving problems of computational and applied mathematics with fixed values of quality characteristics.- Bilbiography.- Index.- About the Authors.
£999.99
Springer String Processing and Information Retrieval
Book Synopsis
£49.49
de Gruyter Algebra Sprachen Programmierung
Book Synopsis
£134.09
Springer Vieweg Grundkurs Codierung
Book Synopsis
£34.19
Austin Pearson Arduino: Complete Guide to Electronics for
Book Synopsis
£20.11