Mathematical theory of computation Books

251 products


  • Lectures on Matrix Field Theory

    Springer International Publishing AG Lectures on Matrix Field Theory

    3 in stock

    Book SynopsisThese lecture notes provide a systematic introduction to matrix models of quantum field theories with non-commutative and fuzzy geometries. The book initially focuses on the matrix formulation of non-commutative and fuzzy spaces, followed by a description of the non-perturbative treatment of the corresponding field theories. As an example, the phase structure of non-commutative phi-four theory is treated in great detail, with a separate chapter on the multitrace approach. The last chapter offers a general introduction to non-commutative gauge theories, while two appendices round out the text. Primarily written as a self-study guide for postgraduate students – with the aim of pedagogically introducing them to key analytical and numerical tools, as well as useful physical models in applications – these lecture notes will also benefit experienced researchers by providing a reference guide to the fundamentals of non-commutative field theory with an emphasis on matrix models and fuzzy geometries.Trade Review“The book collects almost all that has been achieved on the topic within the recent years, including all major results of many authors. As such, it is a nice reference work for graduate students and beginning researchers who want to pursue research in this area. Having all the results and different approaches collected in one place, together with the exhaustive list of references make this a valuable compendium to everyone working on noncommutative models of quantum field theory.” (Andrzej Sitarz, zbMATH 1371.81013, 2017)Table of ContentsPreface.- Introductory Remarks.- The Non-Commutative Moyal-Weyl Spaces Rd.- The Fuzzy Sphere.- Quantum Non-Commutative Phi-Four.- The Multitrace Approach.- Non-Commutative Gauge Theory.- Appendix A - The Landau States.- Appendix B - The Traces TrtAtB and TrtAtBtCtD.- Index.

    3 in stock

    £33.74

  • Discrete Mathematics

    Oxford University Press Discrete Mathematics

    2 in stock

    Book SynopsisBiggs'' Discrete Mathematics has been a best-selling textbook since the first and revised editions were published in 1986 and 1990, respectively. This second edition has been developed in response to undergraduate course changes and changes in students'' needs. New to this edition are chapters on statements and proof, logical framework, and natural numbers and the integers, in addition to updated chapters from the previous edition. The new chapters are presented at a level suitable for mathematics and computer science students seeking a first approach to this broad and highly relevant topic. Each chapter contains newly developed tailored exercises, and miscellaneous exercises are presented throughout, providing the student with over 1000 individual tailored exercises. This edition is accompanied by a website www.oup.com/mathematics/discretemath containing hints and solutions to all exercises presented in the text, providing an invaluable resource for students and lecturers alike. The bTrade ReviewThis is a new edition of a successful textbook ... this revision is particularly welcome ... The text is written in a fluent but rigorous style and should appeal to sixthformers and undergraduates who are alienated by more formal presentations. There are plenty of approachable exercises, ranging from easy riders to establish technique to more challenging problems which introduce new ideas, and a bonus is that all the answers are available on a companion web-site. I can thoroughly recommend this text. * The Mathematical Gazette *A well known definition says that a textbook is a book such that everybody thinks he can write a better one. Biggs' Discrete Mathematics is an exception - not only for its wide range of topics and its clear organization but notably for its excellent style of explanation. * EMS *... the ideal choice for introductory courses to discrete mathematicians. * Zentralblatt MATH *Table of ContentsTHE LANGUAGE OF MATHEMATICS; TECHNIQUES; ALGORITHMS AND GRAPHS; ALGEBRAIC METHODS

    2 in stock

    £62.70

  • Modelling Puzzles in First Order Logic

    Springer Nature Switzerland AG Modelling Puzzles in First Order Logic

    1 in stock

    Book SynopsisKeeping students involved and actively learning is challenging. Instructors in computer science are aware of the cognitive value of modelling puzzles and often use logical puzzles as an efficient pedagogical instrument to engage students and develop problem-solving skills. This unique book is a comprehensive resource that offers teachers and students fun activities to teach and learn logic. It provides new, complete, and running formalisation in Propositional and First Order Logic for over 130 logical puzzles, including Sudoku-like puzzles, zebra-like puzzles, island of truth, lady and tigers, grid puzzles, strange numbers, or self-reference puzzles. Solving puzzles with theorem provers can be an effective cognitive incentive to motivate students to learn logic. They will find a ready-to-use format which illustrates how to model each puzzle, provides running implementations, and explains each solution. This concise and easy-to-follow textbook is a much-needed support tool for students willing to explore beyond the introductory level of learning logic and lecturers looking for examples to heighten student engagement in their computer science courses. Trade Review“The purpose of this book is to introduce first-order logic (FOL) to newcomers. … The book is a treasure trove of puzzles like this. … All of these are motivated in an approachable, fun way. … the book is a hands-on guide to Prover9 and Mace4 … . It is quite valuable to have so many puzzles in a single book.” (Jesse Adam Alama, Mathematical Reviews, October, 2022)Table of ContentsPreface.- Getting Started with Prover9 and Mace4.- Micro Arithmetic Puzzles.- Strange Numbers.- Practical Puzzles.- Lady and Tigers.- Einstein Puzzles.- Island of Truth.- Love and Marriage.- Grid Puzzles.- Japanese Puzzles.- Russian Puzzles.- Polyomino Puzzles.- Self-reference and Other Puzzles.- Epigraph in Natural Language

    1 in stock

    £33.74

  • Modern Computational Finance

    John Wiley & Sons Inc Modern Computational Finance

    1 in stock

    Book SynopsisArguably the strongest addition to numerical finance of the past decade, Algorithmic Adjoint Differentiation (AAD) is the technology implemented in modern financial software to produce thousands of accurate risk sensitivities, within seconds, on light hardware.AAD recently became a centerpiece of modern financial systems and a key skill for all quantitative analysts, developers, risk professionals or anyone involved with derivatives. It is increasingly taught in Masters and PhD programs in finance.Danske Bank''s wide scale implementation of AAD in its production and regulatory systems won the In-House System of the Year 2015 Risk award. The Modern Computational Finance books, written by three of the very people who designed Danske Bank''s systems, offer a unique insight into the modern implementation of financial models. The volumes combine financial modelling, mathematics and programming to resolve real life financial problems and produce effective derivativesTable of ContentsModern Computational Finance xi Preface by Leif Andersen xv Acknowledgments xix Introduction xxi About the Companion C++ Code xxv PART I Modern Parallel Programming 1 Introduction 3 CHAPTER 1 Effective C++ 17 CHAPTER 2 Modern C++ 25 2.1 Lambda expressions 25 2.2 Functional programming in C++ 28 2.3 Move semantics 34 2.4 Smart pointers 41 CHAPTER 3 Parallel C++ 47 3.1 Multi-threaded Hello World 49 3.2 Thread management 50 3.3 Data sharing 55 3.4 Thread local storage 56 3.5 False sharing 57 3.6 Race conditions and data races 62 3.7 Locks 64 3.8 Spinlocks 66 3.9 Deadlocks 67 3.10 RAII locks 68 3.11 Lock-free concurrent design 70 3.12 Introduction to concurrent data structures 72 3.13 Condition variables 74 3.14 Advanced synchronization 80 3.15 Lazy initialization 83 3.16 Atomic types 86 3.17 Task management 89 3.18 Thread pools 96 3.19 Using the thread pool 108 3.20 Debugging and optimizing parallel programs 113 PART II Parallel Simulation 123 Introduction 125 CHAPTER 4 Asset Pricing 127 4.1 Financial products 127 4.2 The Arbitrage Pricing Theory 140 4.3 Financial models 151 CHAPTER 5 Monte-Carlo 185 5.1 The Monte-Carlo algorithm 185 5.2 Simulation of dynamic models 192 5.3 Random numbers 200 5.4 Better random numbers 202 CHAPTER 6Serial Implementation 213 6.1 The template simulation algorithm 213 6.2 Random number generators 223 6.3 Concrete products 230 6.4 Concrete models 245 6.5 User interface 263 6.6 Results 268 CHAPTER 7 Parallel Implementation 271 7.1 Parallel code and skip ahead 271 7.2 Skip ahead with mrg32k3a 276 7.3 Skip ahead with Sobol 282 7.4 Results 283 PART III Constant Time Differentiation 285 Introduction 287 CHAPTER 8 Manual Adjoint Differentiation 295 8.1 Introduction to Adjoint Differentiation 295 8.2 Adjoint Differentiation by hand 308 8.3 Applications in machine learning and finance 315 CHAPTER 9 Algorithmic Adjoint Differentiation 321 9.1 Calculation graphs 322 9.2 Building and applying DAGs 328 9.3 Adjoint mathematics 340 9.4 Adjoint accumulation and DAG traversal 344 9.5 Working with tapes 349 CHAPTER 10 Effective AAD and Memory Management 357 10.1 The Node class 359 10.2 Memory management and the Tape class 362 10.3 The Number class 379 10.4 Basic instrumentation 398 CHAPTER 11 Discussion and Limitations 401 11.1 Inputs and outputs 401 11.2 Higher-order derivatives 402 11.3 Control flow 402 11.4 Memory 403 CHAPTER 12 Differentiation of the Simulation Library 407 12.1 Active code 407 12.2 Serial code 409 12.3 User interface 417 12.4 Serial results 424 12.5 Parallel code 426 12.6 Parallel results 433 CHAPTER 13 Check-Pointing and Calibration 439 13.1 Check-pointing 439 13.2 Explicit calibration 448 13.3 Implicit calibration 475 CHAPTER 14 Multiple Differentiation in Almost Constant Time 483 14.1 Multidimensional differentiation 483 14.2 Traditional Multidimensional AAD 484 14.3 Multidimensional adjoints 485 14.4 AAD library support 487 14.5 Instrumentation of simulation algorithms 494 14.6 Results 499 CHAPTER 15 Acceleration with Expression Templates 503 15.1 Expression nodes 504 15.2 Expression templates 507 15.3 Expression templated AAD code 524 Debugging AAD Instrumentation 541 Conclusion 547 References 549 Index 555

    1 in stock

    £67.50

  • Programming in Haskell

    Cambridge University Press Programming in Haskell

    1 in stock

    Book SynopsisHaskell is a purely functional language that allows programmers to rapidly develop clear, concise, and correct software. The language has grown in popularity in recent years, both in teaching and in industry. This book is based on the author''s experience of teaching Haskell for more than twenty years. All concepts are explained from first principles and no programming experience is required, making this book accessible to a broad spectrum of readers. While Part I focuses on basic concepts, Part II introduces the reader to more advanced topics. This new edition has been extensively updated and expanded to include recent and more advanced features of Haskell, new examples and exercises, selected solutions, and freely downloadable lecture slides and example code. The presentation is clean and simple, while also being fully compliant with the latest version of the language, including recent changes concerning applicative, monadic, foldable, and traversable types.Trade Review'The skills you acquire by studying this book will make you a much better programmer no matter what language you use to actually program in.' Erik Meijer, Facebook, from the ForewordReview of previous edition: 'The best introduction to Haskell available. There are many paths towards becoming comfortable and competent with the language but I think studying this book is the quickest path. I urge readers of this magazine to recommend Programming in Haskell to anyone who has been thinking about learning the language.' Duncan Coutts, The Monad.ReaderReview of previous edition: 'Where this book excels is in the order and style of its exposition … With its ripe selection of examples and its careful clarity of exposition, the book is a welcome addition to the introductory functional programming literature.' Journal of Functional ProgrammingTable of ContentsForeword; Preface; Part I. Basic Concepts: 1. Introduction; 2. First steps; 3. Types and classes; 4. Defining functions; 5. List comprehensions; 6. Recursive functions; 7. Higher-order functions; 8. Declaring types and classes; 9. The countdown problem; Part II. Going Further: 10. Interactive programming; 11. Unbeatable tic-tac-toe; 12. Monads and more; 13. Monadic parsing; 14. Foldables and friends; 15. Lazy evaluation; 16. Reasoning about programs; 17. Calculating compilers; Appendix A. Selected solutions; Appendix B. Standard prelude; Bibliography; Index.

    1 in stock

    £33.24

  • Deep Learning Architectures: A Mathematical

    Springer Nature Switzerland AG Deep Learning Architectures: A Mathematical

    2 in stock

    Book SynopsisThis book describes how neural networks operate from the mathematical point of view. As a result, neural networks can be interpreted both as function universal approximators and information processors. The book bridges the gap between ideas and concepts of neural networks, which are used nowadays at an intuitive level, and the precise modern mathematical language, presenting the best practices of the former and enjoying the robustness and elegance of the latter.This book can be used in a graduate course in deep learning, with the first few parts being accessible to senior undergraduates. In addition, the book will be of wide interest to machine learning researchers who are interested in a theoretical understanding of the subject. Trade Review“This book is useful to students who have already had an introductory course in machine learning and are further interested to deepen their understanding of the machine learning material from the mathematical point of view.” (T. C. Mohan, zbMATH 1441.68001, 2020)Table of ContentsIntroductory Problems.- Activation Functions.- Cost Functions.- Finding Minima Algorithms.- Abstract Neurons.- Neural Networks.- Approximation Theorems.- Learning with One-dimensional Inputs.- Universal Approximators.- Exact Learning.- Information Representation.- Information Capacity Assessment.- Output Manifolds.- Neuromanifolds.- Pooling.- Convolutional Networks.- Recurrent Neural Networks.- Classification.- Generative Models.- Stochastic Networks.- Hints and Solutions.

    2 in stock

    £75.99

  • Introduction to Combinatorial Optimization

    Springer International Publishing AG Introduction to Combinatorial Optimization

    2 in stock

    Book SynopsisIntroductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, such as greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.Trade Review“This book introduces combinatorial optimization with a methodology-oriented organization. It targets undergraduate and graduate students and contains a good mix of theoretical results (with proof) and examples, which helps the reader acquire ideas and concepts. The chapters end with a list of exercises for the students.” (Francisco Chicano, Mathematical Reviews, January, 2024)“The book can appropriately be used as a textbook in a graduate course. All the algorithms are clearly explained and presented. It is a very valuable book for successful application of real problems from combinatorial optimization. … this book is an excellent contribution to the field of combinatorial optimization, and it is highly recommended to the students and researchers in optimization.” (Samir Kumar Neogy, zbMATH 1512.90001, 2023)Table of Contents1. Introduction.-2. Divide-and-Conquer.- 3. Dynamic Programming and Shortest Path.- 4. Greedy Algorithm and Spanning Tree.- 5. Incremental Method and Maximum Network Flow.- 6. Linear Programming.- 7. Primal-Dual Methods and Minimum Cost Flow.- 8. NP-hard Problems and Approximation Algorithms.- 9. Restriction and Steiner Tree.- 10. Greedy Approximation and Submodular Optimization.- 11. Relaxation and Rounding. 12. Nonsubmodular Optimization.- Bibliography.

    2 in stock

    £42.74

  • Mathematical Principles of Topological and

    Springer International Publishing AG Mathematical Principles of Topological and

    2 in stock

    Book SynopsisThis book explores and demonstrates how geometric tools can be used in data analysis. Beginning with a systematic exposition of the mathematical prerequisites, covering topics ranging from category theory to algebraic topology, Riemannian geometry, operator theory and network analysis, it goes on to describe and analyze some of the most important machine learning techniques for dimension reduction, including the different types of manifold learning and kernel methods. It also develops a new notion of curvature of generalized metric spaces, based on the notion of hyperconvexity, which can be used for the topological representation of geometric information.In recent years there has been a fascinating development: concepts and methods originally created in the context of research in pure mathematics, and in particular in geometry, have become powerful tools in machine learning for the analysis of data. The underlying reason for this is that data are typically equipped with some kind of notion of distance, quantifying the differences between data points. Of course, to be successfully applied, the geometric tools usually need to be redefined, generalized, or extended appropriately.Primarily aimed at mathematicians seeking an overview of the geometric concepts and methods that are useful for data analysis, the book will also be of interest to researchers in machine learning and data analysis who want to see a systematic mathematical foundation of the methods that they use. Table of ContentsIntroduction.- Topological foundations, hypercomplexes and homology.- Weighted complexes, cohomology and Laplace operators.- The Laplace operator and the geometry of graphs.- Metric spaces and manifolds.- Linear methods: Kernels, variations, and averaging.- Nonlinear schemes: Clustering, feature extraction and dimension reduction.- Manifold learning, the scheme of Laplacian eigenmaps.- Metrics and curvature.

    2 in stock

    £56.99

  • Programming Languages: Principles and Paradigms

    Springer International Publishing AG Programming Languages: Principles and Paradigms

    2 in stock

    Book SynopsisThis textbook is a thorough, up-to-date introduction to the principles and techniques that guide the design and implementation of modern programming languages. The goal of the book is to provide the basis for a critical understanding of most modern programming languages. Thus, rather than focusing on a specific language, the book identifies the most important principles shared by large classes of languages. The notion of ‘abstract machine’ is a unifying concept that helps to maintain an accurate and elementary treatment. The book introduces, analyses in depth, and compares the imperative, object-oriented, functional, logic, concurrent, constraint-based, and service-oriented programming paradigms. All material coming from the first English edition has been updated and extended, clarifying some tricky points, and discussing newer programming languages. This second edition contains new chapters dedicated to constraint, concurrent, and service-oriented programming.Topics and features: Requires familiarity with one programming language is a prerequisite Provides a chapter on history offering context for most of the constructs in use today Presents an elementary account of semantical approaches and of computability Introduces new examples in modern programming languages like Python or Scala Offers a chapter that opens a perspective on applications in artificial intelligence Conceived as a university textbook, this unique volume will also be suitable for IT specialists who want to deepen their knowledge of the mechanisms behind the languages they use. The choice of themes and the presentation style are largely influenced by the experience of teaching the content as part of a bachelor's degree in computer science.Table of Contents1. Abstract Machines.- 2. How to Describe a Programming Language.- 3. Foundations.- 4. Names and the Environment.- 5. Memory Management.- 6. Control Structure.- 7. Control Abstraction.- Structuring Data.- 8. Data Abstraction.- 9. The Object-Oriented Paradigm.- 10. The Functional Paradigm.- 11. The Logic Programming Paradigm.- 12. A Short Historical Perspective.

    2 in stock

    £44.99

  • Computational Geometry: Algorithms and

    Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Computational Geometry: Algorithms and

    2 in stock

    Book SynopsisThis introduction to computational geometry focuses on algorithms. Motivation is provided from the application areas as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.Trade Review"An excellent introduction to the field is given here, including a general motivation and usage cases beyond simple graphics rendering or interaction." from the ACM Reviews by William Fahle, University of Texas at Dallas, USATable of ContentsComputational Geometry: Introduction.- Line Segment Intersection: Thematic Map Overlay.- Polygon Triangulation: Guarding an Art Gallery.- Linear Programming: Manufacturing with Molds.- Orthogonal Range Searching: Querying a Database.- Point Location: Knowing Where You Are.- Voronoi Diagrams: The Post Office Problem.- Arrangements and Duality: Supersampling in Ray Tracing.- Delaunay Triangulations: Height Interpolation.- More Geometric Data Structures: Windowing.- Convex Hulls: Mixing Things.- Binary Space Partitions: The Painter's Algorithm.- Robot Motion Planning: Getting Where You Want to Be.- Quadtrees: Non-Uniform Mesh Generation.- Visibility Graphs: Finding the Shortest Route.- Simplex Range Searching: Windowing Revisited.- Bibliography.- Index.

    2 in stock

    £42.74

  • Mathematics and Computation

    Princeton University Press Mathematics and Computation

    10 in stock

    Book SynopsisTrade Review"Avi Wigderson, Co-Winner of the Abel Prize, Norwegian Academy of Science and Letters""Avi Wigderson's new 440-page book, Mathematics and Computation: A Theory Revolutionizing Technology and Science (Princeton University Press, October 2019), lays out a commanding overview of the theory of computing and argues for its central role in human thought."---Allyn Jackson, Communications of the ACM"This must-read book provides a high-level, enjoyable overview of numerous parts of mathematics that are related to computation in general, and computational complexity in particular." * Choice *

    10 in stock

    £40.50

  • A First Course in Machine Learning

    Taylor & Francis Ltd A First Course in Machine Learning

    1 in stock

    Book SynopsisA First Course in Machine Learning by Simon Rogers and Mark Girolami is the best introductory book for ML currently available. It combines rigor and precision with accessibility, starts from a detailed explanation of the basic foundations of Bayesian analysis in the simplest of settings, and goes all the way to the frontiers of the subject such as infinite mixture models, GPs, and MCMC.âDevdatt Dubhashi, Professor, Department of Computer Science and Engineering, Chalmers University, SwedenThis textbook manages to be easier to read than other comparable books in the subject while retaining all the rigorous treatment needed. The new chapters put it at the forefront of the field by covering topics that have become mainstream in machine learning over the last decade.âDaniel Barbara, George Mason University, Fairfax, Virginia, USAThe new edition of A First Course in Machine Learning by Rogers and Girolami is an excTrade Review"I was impressed by how closely the material aligns with the needs of an introductory course on machine learning, which is its greatest strength. While there are other books available that aim for completeness, with exhaustively comprehensive introductions to every branch of machine learning, the book by Rogers and Girolami starts with the basics, builds a solid and logical foundation of methodology, before introducing some more advanced topics. The essentials of the model construction, validation, and evaluation process are communicated clearly and in such a manner as to be accessible to the student taking such a course. I was also pleased to see that the authors have not shied away from producing algebraic derivations throughout, which are for many students an essential part of the learning process—many other texts omit such details, leaving them as ‘an exercise for the reader.’ Being shown the explicit steps required for such derivations is an important part of developing a sense of confidence in the student. Overall, this is a pragmatic and helpful book, which is well-aligned to the needs of an introductory course and one that I will be looking at for my own students in coming months."—David Clifton, University of Oxford, UK"In my opinion, this is by far the best introduction to Machine Learning. It accomplishes something I would think impossible: it assumes essentially only high school mathematics and no statistics background, and yet, by introducing math, probability and statistics as needed, it manages to do an entirely rigorous introduction to Machine Learning. Proofs are not provided only for very few theorems; the book goes fairly deep and is really enjoyable to read. I told my students that this book will be one of the best investments they have ever made!"—Aleksandar Ignjatovic, University of New South Wales"The new edition of A First Course in Machine Learning by Rogers and Girolami is an excellent introductTable of ContentsLinear Modelling: A Least Squares Approach. Linear Modelling: A Maximum Likelihood Approach. The Bayesian Approach to Machine Learning. Bayesian Inference. Classification. Clustering. Principal Components Analysis and Latent Variable Models. Further Topics in Markov Chain Monte Carlo. Classification and Regression with Gaussian Processes. Dirichlet Process models.

    1 in stock

    £39.99

  • Garbage Collection  Algorithms for Automatic

    John Wiley & Sons Inc Garbage Collection Algorithms for Automatic

    1 in stock

    Book SynopsisModern software places increasing reliance on dynamic memory allocation, but its direct management is not only notoriously error--prone. Garbage collection eliminates many of these bugs. This reference presents each of the most important algorithms in detail, often with illustrations of its characteristic features and animations of its use.Table of ContentsThe Classical Algorithms. Reference Counting. Mark-Sweep Garbage Collection. Mark-Compact Garbage Collection. Copying Garbage Collection. Generational Garbage Collection. Incremental and Concurrent Garbage Collection. Garbage Collection for C. Garbage Collection for C++. Cache-Conscious Garbage Collection. Distributed Garbage Collection. Glossary. Bibliography. Index.

    1 in stock

    £55.76

  • Computational Framework for the Finite Element

    Taylor & Francis Ltd Computational Framework for the Finite Element

    1 in stock

    Book SynopsisComputational Framework for the Finite Element Method in MATLAB and Python aims to provide a programming framework for coding linear FEM using matrix-based MATLAB language and Python scripting language. It describes FEM algorithm implementation in the most generic formulation so that it is possible to apply this algorithm to as many application problems as possible. Readers can follow the step-by-step process of developing algorithms with clear explanations of its underlying mathematics and how to put it into MATLAB and Python code. The content is focused on aspects of numerical methods and coding FEM rather than FEM mathematical analysis. However, basic mathematical formulations for numerical techniques which are needed to implement FEM are provided. Particular attention is paid to an efficient programming style using sparse matrices. Features Contains ready-to-use coding recipes allowing fast prototyping and

    1 in stock

    £45.99

  • Python

    CRC Press Python

    1 in stock

    Book SynopsisPython's simplicity and versatility make it an ideal language for both beginners and experienced programmers. Its syntax facilitates a smooth learning curve, enabling individuals to concentrate on grasping programming concepts instead of wrestling with intricate syntax rules. The extensive standard library reinforces its practicality, offering pre-built modules and functions that reduce manual coding efforts. Python's versatility is evident in its applications, spanning web development, data analysis, Machine Learning and automation.The language's interactive nature supports real-time code experimentation, stepping up the learning process and enhancing understanding. Python's wealth of online resources further enriches the learning experience, fostering a community where individuals can develop their programming skills. Python: A Practical Learning Approach exemplifies Python's simplicity and versatility with numerous examples, ensuring a seamless learning journ

    1 in stock

    £44.99

  • Theoretical Computer Science for the Working

    Cambridge University Press Theoretical Computer Science for the Working

    1 in stock

    Book SynopsisUsing basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science. In this Element, readers will meet some of the deepest ideas and theorems of modern computers and mathematics, such as Turing machines, unsolvable problems, the P=NP question, Kurt Gödel''s incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing''s Halting problem, and much more. The concepts come alive with many examples and exercises.Table of Contents1. Introduction; 2. Aide-Mémoire for Category Theory; 3. Models of Computation; 4. Computability Theory; 5. Complexity Theory; 6. Diagonal Arguments; 7. Conclusion; References.

    1 in stock

    £17.00

  • Introduction to Quantum Computing with Q# and QDK

    Springer Nature Switzerland AG Introduction to Quantum Computing with Q# and QDK

    Out of stock

    Book SynopsisThis book introduces the fundamentals of the theory of quantum computing, illustrated with code samples written in Q#, a quantum-specific programming language, and its related Quantum Development Kit. Quantum computing (QC) is a multidisciplinary field that sits at the intersection of quantum physics, quantum information theory, computer science and mathematics, and which may revolutionize the world of computing and software engineering. The book begins by covering historical aspects of quantum theory and quantum computing, as well as offers a gentle, algebra-based, introduction to quantum mechanics, specifically focusing on concepts essential for the field of quantum programming. Quantum state description, state evolution, quantum measurement and the Bell’s theorem are among the topics covered. The readers also get a tour of the features of Q# and familiarize themselves with the QDK. Next, the core QC topics are discussed, complete with the necessary mathematical formalism. This includes the notions of qubit, quantum gates and quantum circuits. In addition to that, the book provides a detailed treatment of a series of important concepts from quantum information theory, in particular entanglement and the no-cloning theorem, followed by discussion about quantum key distribution and its various protocols. Finally, the canon of most important QC algorithms and algorithmic techniques is covered in-depth - from the Deutsch-Jozsa algorithm, through Grover’s search, to Quantum Fourier Transform, quantum phase estimation and Shor’s algorithm. The book is an accessible introduction into the vibrant and fascinating field of quantum computing, offering a blend of academic diligence with pragmatism that is so central to software development world. All of the discussed theoretical aspects of QC are accompanied by runnable code examples, providing the reader with two different angles - mathematical and programmatic - of looking at the same problem space. Table of ContentsPart One1 Background 1.1 Historical development of quantum theory 1.2 Reality without realism 2 Basics of quantum mechanics 2.1 Quantum state 2.2 Superposition 2.3 Born rule 2.4 Observables 2.5 State evolution 2.6 Larger systems 2.7 Postulates of quantum mechanics 2.8 Entanglement 2.9 Bell’s theorem 2.10 No-cloning theorem Part Two 3 Getting Started with Quantum Programming 3.1 Setting up QDK environment 3.2 Getting started with Q# 4 Quantum Computing 4.1 History 4.2 Qubits 4.3 Quantum circuits 4.4 Superposition 4.5 Pauli gates 4.5.1 I gate 4.5.2 X gate 4.5.3 Z gate 4.5.4 Y gate 4.5.5 Summary 4.6 Rotation gates 4.6.1 Rz gate 4.6.2 S gate 4.6.3 T gate 4.6.4 Rx and Ry gates 4.7 Multi qubit gates 4.7.1 Controlled gates 4.7.2 CNOT gate 4.7.3 SWAP gate 4.7.4 CZ gate 4.7.5 Toffoli gate 4.8 Gate universality 5 Entanglement 5.1 Basics 5.2 Bell’s inequalities 5.3 CHSH Game 5.4 Teleportation 5.5 Superdense coding 5.6 Entanglement as a resource 6 Quantum Key Distribution 6.1 One-time pad encryption 6.2 BB84 protocol 6.3 B92 protocol 6.4 EPR-based quantum key distribution Part Three 7 Algorithms 7.1 Deutsch-Jozsa Algorithm 7.2 QuantumSearch 7.3 Useful Algorithm Components 7.3.1 QFT 7.3.2 QPE 7.4 Shor’s Algorithm

    Out of stock

    £999.99

  • Deep Learning with R, Second Edition

    Manning Publications Deep Learning with R, Second Edition

    2 in stock

    Book SynopsisDeep learning from the ground up using R and the powerful Keras library! In Deep Learning with R, Second Edition you will learn: Deep learning from first principles Image classification and image segmentation Time series forecasting Text classification and machine translation Text generation, neural style transfer, and image generation Deep Learning with R, Second Edition shows you how to put deep learning into action. It's based on the revised new edition of François Chollet's bestselling Deep Learning with Python. All code and examples have been expertly translated to the R language by Tomasz Kalinowski, who maintains the Keras and Tensorflow R packages at RStudio. Novices and experienced ML practitioners will love the expert insights, practical techniques, and important theory for building neural networks. about the technology Deep learning has become essential knowledge for data scientists, researchers, and software developers. The R language APIs for Keras and TensorFlow put deep learning within reach for all R users, even if they have no experience with advanced machine learning or neural networks. This book shows you how to get started on core DL tasks like computer vision, natural language processing, and more using R. what's inside Image classification and image segmentation Time series forecasting Text classification and machine translation Text generation, neural style transfer, and image generation about the reader For readers with intermediate R skills. No previous experience with Keras, TensorFlow, or deep learning is required.

    2 in stock

    £36.79

  • Effective DevOps

    O'Reilly Media Effective DevOps

    1 in stock

    Book SynopsisSome companies think that adopting devops means bringing in specialists or a host of new tools. With this practical guide, you'll learn why devops is a professional and cultural movement that calls for change from inside your organization.

    1 in stock

    £29.99

  • Computation Proof Machine

    Cambridge University Press Computation Proof Machine

    1 in stock

    Book SynopsisComputation, calculation, algorithms - all have played an important role in mathematical progress from the beginning - but behind the scenes, their contribution was obscured in the enduring mathematical literature. To understand the future of mathematics, this fascinating book returns to its past, tracing the hidden history that follows the thread of computation.Trade Review'In this pithy, award-winning account of the growing role of computation in mathematics, Gilles Dowek adds further evidence, if any were needed, that the Age of the Algorithm is upon us. A master storyteller, the author takes the reader on an exhilarating journey through the history of mathematics, as he explains, in engaging, vivid prose, why to prove is to compute. A delightful read brimming with big ideas.' Bernard Chazelle, Princeton University'An engaging study of the history of computing told from a distinctive perspective. Gilles Dowek examines the traditional axiomatic conception of mathematical proof and argues that the advent of computer-assisted proofs (for example the Appel-Haken proof of the four color theorem, the proof of Hale's theorem) and the recent development of the proofs-as-programs idea together lead the way to a new conception of proof, one in which computation rather than logical reasoning plays the dominant role. The result is an illuminating challenge to one of the firmest orthodoxies in the foundations of mathematics.' Michael Detlefsen, University of Notre Dame'Dowek's book is a superb overview of the transformation of mathematics toward becoming a computational science. It is historically rich, philosophically inquisitive and mathematically rigorous.' Andrew Arana, MetascienceTable of ContentsPart I. Ancient Origins: 1. From the prehistory to the Greeks; 2. Two thousand years of computation; Part II. The Age of Reason: 3. Predicate logic; 4. The decision problem; 5. Church's thesis; 6. Lambda-calculus; 7. Constructivity; 8. Constructive proofs and algorithms; Part III. Crisis of the Axiomatic Method: 9. Intuitionistic type theory; 10. Automated proof; 11. Automated proof checking; 12. News from the field; 13. Instruments; 14. The end of axioms?; 15. Conclusion: as we near the end of this mathematical voyage.

    1 in stock

    £75.99

  • P NP and NPCompleteness

    Cambridge University Press P NP and NPCompleteness

    1 in stock

    Book SynopsisThis undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P versus NP Question and the theory of NP-completeness.Trade Review'The author is a well-known expert in the field of complexity theory and so is well-qualified to bring out this book which will serve as a very good introductory textbook. The focus on search problems and promise problems in this book is to be appreciated since many books neglect these topics.' S. V. Naaraj, SIGACT NewsTable of Contents1. Computational tasks and models; 2. The P versus NP Question; 3. Polynomial-time reductions; 4. NP-completeness; 5. Three relatively advanced topics; Epilogue: a brief overview of complexity theory.

    1 in stock

    £104.50

  • Occultism and the Origins of Psychoanalysis

    Taylor & Francis Ltd Occultism and the Origins of Psychoanalysis

    1 in stock

    Book SynopsisOccultism and the Origins of Psychoanalysis traces the origins of key psychoanalytic ideas back to their roots in hypnosis and the occult. Maria Pierri follows Freud’s early interest in ‘thought-transmission’, now known as telepathy. Trade Review"This book gives back to contemporary psychoanalysis the pleasure of exploring really little-known territories, fascinatingly restoring the connection between the past, present and "elsewhere" of communications between human beings, using the Freudian experience as its starting point, in order to reconsider in a reflective way the less visible, sometimes disorienting and mysterious levels of psychoanalytic practice. offers us an especially valuable reflection on the mysterious communicating paths which put individual and group unconsciouses in contact with each other, often bypassing in an apparently disconcerting manner the border controls." - Stefano Bolognini, past President of the IPA and the Italian Psychoanalytic Society"Following the thread of thought-transference, Maria Pierri goes through the events of the Freudian endeavour starting from its roots in hypnosis and occultism, through the dialogue with the masters, the pupils and the great female patients, the leading actresses of the cure. In his disquieting curiosity for telepathy, which he shared intimately with Ferenczi, Freud discovers that fortune-tellers, who do not know the future, can read the unconscious of their clients. But the "golden coin" of occultism, the generative mother-child communication, will be the great discovery of Ferenczi." - Luis J. Martin Cabré, Training analyst, past President Madrid Psychoanalytical Association."Today we know much about the polyphonic complex of contexts, experiences, relationships and ideas which made psychoanalysis possible and still nourish its current debates. We can be very grateful to Maria Pierri for bringing us up to date with the role and meaning of some little-known aspects of Freud’s life and work concerning occultism and the fascinating dialogue of the unconsciouses developed with Ferenczi: what the Author identifies as one of the matrices of the developments of contemporary psychoanalysis." - Marco Conci, MC, IPA Committee on the History of Psychoanalysis"This book gives back to contemporary psychoanalysis the pleasure of exploring really little-known territories, fascinatingly restoring the connection between the past, present and 'elsewhere' of communications between human beings, using the Freudian experience as its starting point, in order to reconsider in a reflective way the less visible, sometimes disorienting and mysterious levels of psychoanalytic practice. It offers us an especially valuable reflection on the mysterious communicating paths which put individual and group unconsciouses in contact with each other, often bypassing in an apparently disconcerting manner the border controls." - Stefano Bolognini, past president of the IPA and the Italian Psychoanalytic Society"Following the thread of thought-transference, Maria Pierri goes through the events of the Freudian endeavour starting from its roots in hypnosis and occultism, through the dialogue with the masters, the pupils and the great female patients, the leading actresses of the cure. In his disquieting curiosity for telepathy, which he shared intimately with Ferenczi, Freud discovers that fortune-tellers, who do not know the future, can read the unconscious of their clients. But the 'golden coin' of occultism, the generative mother-child communication, will be the great discovery of Ferenczi." - Luis J. Martin Cabré, training analyst, past president, Madrid Psychoanalytical Association"Today we know much about the polyphonic complex of contexts, experiences, relationships and ideas which made psychoanalysis possible and still nourish its current debates. We can be very grateful to Maria Pierri for bringing us up to date with the role and meaning of some little-known aspects of Freud’s life and work concerning occultism and the fascinating dialogue of the unconsciouses developed with Ferenczi: what the Author identifies as one of the matrices of the developments of contemporary psychoanalysis." - Marco Conci, MC, IPA Committee on the History of PsychoanalysisTable of ContentsIntroductionStefano BologniniPrologue: a result of character: the cocaine, this magical substance1. Vienna, Porta Orientis of the Unconscious The force of suggestion: the "wonderful somnambulists" HypnosisVienna, laboratory of modernity2. The Young FreudA passionate young researcher into natureFirst love Martha and Bertha: the languages of passion3. The Lesson of Jean Martin Charcot At the SalpêtrièreThe apparatus of language The magic of words4. The lesson of Josef Breuer and the "descent to the mothers"Studies on hysteriaA difficult separation: not all debts can be paidA foundation myth: a false pregnancy and a cure with a defect.5. Sigmund Freud’s lessonThe discovery of a false connection Irma’s throat and the feminine at the origin of psychoanalysis.Dream as desire 6. Fliess and the invention of psychoanalysis A secret correspondence My friend in BerlinFreud’s heart trouble7. The discovery of infantile sexualitySelf-analysis and the writing cure Cherchez la femme: the case of Emma Eckstein8. Original thought requires a ruptureThe "reader of thoughts" The accusation of plagiarism A future in the image of the past: predestination and superstition 9. Occultism made in the USASpiritualism Medium, media, and "mental telegraphy"First hypotheses about the unconscious10 Jung, spiritualism, and countertransference: the world of the deadJung, Poltergeist phenomena, and séances The arrival at Burghölzli First visit to ViennaEaster 1909: Jung’s spiritual complex and Sabina The dangerous fascination of the "beautiful Jewess"11. Ferenczi, the unclassifiableThe sultan and his "clairvoyant" A psychoanalyst "of a restless mind"Ferenczi and the hidden treasure of SpiritualismThe encounter with Freud: a postponed transferential appointment12. A journey to America Three men and an eventful, mutually analytic crossing: the outward journey… … and back again13. The Danaan gift The clairvoyant who reads Ferenczi’s mindThe patient who reads Ferenczi’s mindThe Palermo incident, or the interpretation of paranoiaThe psychic work of the clairvoyant: two unfulfilled prophecies14. An epistolary novelFerenczi and incestuous countertransferential storms: from mother to daughter What is still missing is the fatherly blessing: fatefulness and Oedipal coincidencesElma Pàlos, fragment of the analysis of a seduction The open wound in Ferenczi’s heart, a source of creativity 15. The Saturday goy: getting to know Dr Jones The Welsh liar Difficult beginnings Freud’s first pupil from BritainDr Jones’s stethoscope: rationalisation and censorship of excess countertransferenceA prescribed training analysis in Budapest 16. The intergenerational transmission of psychoanalysis Love and death: the three women of the three pupils"If you go to women, don't forget the whip"At school with Freud: the transmission of psychoanalysis17. The secret committeeThe transformations and the desertion of JungA missed meeting: the "Kreuzlingen gesture" The Committee: the Männerbund and the defence of the "Cause" (Die Sache)Totem and taboo: unconscious intelligence and intergenerational transmission of thought 18. 1913 - the year before the warThe last congress with JungA black tide of occultism The question of telepathyThe dialogues of the unconsciousEpilogue: a fortune-teller visits Freud in BerggasseCorrespondenceIndex

    1 in stock

    £34.88

  • Python Programming for Mathematics

    CRC Press Python Programming for Mathematics

    1 in stock

    Book SynopsisPython Programming for Mathematics focuses on the practical use of the Python language in a range of different areas of mathematics. Through fifty-five exercises of increasing difficulty, the book provides an expansive overview of the power of using programming to solve complex mathematical problems.This book is intended for undergraduate and graduate students who already have learned the basics of Python programming and would like to learn how to apply that programming skill in mathematics.Features Innovative style that teaches programming skills via mathematical exercises. Ideal as a main textbook for Python for Mathematics courses, or as a supplementary resource for Numerical Analysis and Scientific Computing courses.

    1 in stock

    £44.99

  • Quantum Information Theory

    Cambridge University Press Quantum Information Theory

    2 in stock

    Book SynopsisThis new edition of Wilde's popular book promises over 100 pages of new material, exercises and references. New attention is given to the derivation of the Choi-Kraus theorem for quantum channels, the CHSH game, quantum relative entropy, and sequential decoding. The text offers an ideal entry point into the topic for graduate students.Trade Review'For years, I have been hoping that somebody would write a book on quantum information theory that was clear, comprehensive, and up to date. This is that book. And the second edition is even better than the first.' Peter Shor, Massachusetts Institute of Technology'Mark M. Wilde's Quantum Information Theory is a natural expositor's labor of love. Accessible to anyone comfortable with linear algebra and elementary probability theory, Wilde's book brings the reader to the forefront of research in the quantum generalization of Shannon's information theory. What had been a gaping hole in the literature has been replaced by an airy edifice, scalable with the application of reasonable effort and complete with fine vistas of the landscape below. Wilde's book has a permanent place not just on my bookshelf but on my desk.' Patrick Hayden, Stanford University, CaliforniaReview of previous edition: '… [its] clear, thorough, and above all self-contained presentation will aid quantum information researchers in coming up to speed with the latest results in this area of the field. Meanwhile, the familiar setting and language will help classical information theorists who wish to become more acquainted with the quantum aspects of information processing … The presentation is well-structured, making it easy to jump to the desired topic and quickly determine on what that topic depends and how it is used going forward … Quantum Information Theory fills an important gap in the existing literature and will, I expect, help propagate the latest and greatest results in quantum Shannon theory to both quantum and classical researchers.' Joseph M. Renes, Quantum Information ProcessingReview of previous edition: '… a modern self-contained text … suitable for graduate-level courses leading up to research level.' Journal of Discrete Mathematical Sciences and CryptographyReview of previous edition: '… the book does a phenomenal job of introducing, developing and nurturing a mathematical sense of quantum information processing … In a nutshell, this is an essential reference for students and researchers who work in the area or are trying to understand what it is that quantum information theorists study. Wilde, as mentioned in his book, beautifully illustrates 'the ultimate capability of noisy physical systems, governed by the laws of quantum mechanics, to preserve information and correlations' through this book. I would strongly recommend it to anyone who plans to continue working in the field of quantum information.' Subhayan Roy Moulick, SIGCAT NewsTable of ContentsPreface to the second edition; Preface to the first edition; How to use this book; Part I. Introduction: 1. Concepts in quantum Shannon theory; 2. Classical Shannon theory; Part II. The Quantum Theory: 3. The noiseless quantum theory; 4. The noisy quantum theory; 5. The purified quantum theory; Part III. Unit Quantum Protocols: 6. Three unit quantum protocols; 7. Coherent protocols; 8. Unit resource capacity region; Part IV. Tools of Quantum Shannon Theory: 9. Distance measures; 10. Classical information and entropy; 11. Quantum information and entropy; 12. Quantum entropy inequalities and recoverability; 13. The information of quantum channels; 14. Classical typicality; 15. Quantum typicality; 16. The packing lemma; 17. The covering lemma; Part V. Noiseless Quantum Shannon Theory: 18. Schumacher compression; 19. Entanglement manipulation; Part VI. Noisy Quantum Shannon Theory: 20. Classical communication; 21. Entanglement-assisted classical communication; 22. Coherent communication with noisy resources; 23. Private classical communication; 24. Quantum communication; 25. Trading resources for communication; 26. Summary and outlook; Appendix A. Supplementary results; Appendix B. Unique linear extension of a quantum physical evolution; References; Index.

    2 in stock

    £60.79

  • Mathematical Aspects of Deep Learning

    Cambridge University Press Mathematical Aspects of Deep Learning

    Out of stock

    Book SynopsisIn recent years the development of new classification and regression algorithms based on deep learning has led to a revolution in the fields of artificial intelligence, machine learning, and data analysis. The development of a theoretical foundation to guarantee the success of these algorithms constitutes one of the most active and exciting research topics in applied mathematics. This book presents the current mathematical understanding of deep learning methods from the point of view of the leading experts in the field. It serves both as a starting point for researchers and graduate students in computer science, mathematics, and statistics trying to get into the field and as an invaluable reference for future research.Table of Contents1. The modern mathematics of deep learning Julius Berner, Philipp Grohs, Gitta Kutyniok and Philipp Petersen; 2. Generalization in deep learning Kenji Kawaguchi, Leslie Pack Kaelbling, and Yoshua Bengio; 3. Expressivity of deep neural networks Ingo Gühring, Mones Raslan and Gitta Kutyniok; 4. Optimization landscape of neural networks René Vidal, Zhihui Zhu and Benjamin D. Haeffele; 5. Explaining the decisions of convolutional and recurrent neural networks Wojciech Samek, Leila Arras, Ahmed Osman, Grégoire Montavon and Klaus-Robert Müller; 6. Stochastic feedforward neural networks: universal approximation Thomas Merkh and Guido Montúfar; 7. Deep learning as sparsity enforcing algorithms A. Aberdam and J. Sulam; 8. The scattering transform Joan Bruna; 9. Deep generative models and inverse problems Alexandros G. Dimakis; 10. A dynamical systems and optimal control approach to deep learning Weinan E, Jiequn Han and Qianxiao Li; 11. Bridging many-body quantum physics and deep learning via tensor networks Yoav Levine, Or Sharir, Nadav Cohen and Amnon Shashua.

    Out of stock

    £69.99

  • ModelBased Machine Learning

    Taylor & Francis Inc ModelBased Machine Learning

    1 in stock

    Book SynopsisToday, machine learning is being applied to a growing variety of problems in a bewildering variety of domains. A fundamental challenge when using machine learning is connecting the abstract mathematics of a machine learning technique to a concrete, real world problem. This book tackles this challenge through model-based machine learning which focuses on understanding the assumptions encoded in a machine learning system and their corresponding impact on the behaviour of the system.The key ideas of model-based machine learning are introduced through a series of case studies involving real-world applications. Case studies play a central role because it is only in the context of applications that it makes sense to discuss modelling assumptions. Each chapter introduces one case study and works through step-by-step to solve it using a model-based approach. The aim is not just to explain machine learning methods, but also showcase how to create, debug, and evolve them to solvTable of ContentsIntroduction. How Can Machine Learning Solve my Problem? 1. A Murder Mystery 2. Assessing People’s Skills Interlude. The Machine Learning Life Cycle 3. Meeting Your Match 4. Uncluttering Your Inbox 5. Making Recommendations 6. Understanding Asthma 7. Harnessing the Crowd 8. How to Read a Model Afterword

    1 in stock

    £71.99

  • Statistical & Soft Computing Approaches in

    Nova Science Publishers Inc Statistical & Soft Computing Approaches in

    1 in stock

    Book SynopsisThis book reviews the application of different statistical and Soft-Computing (SC) techniques in insurance-related problems. The book has been divided into 5 chapters, with the following structure: Chapter 1 provides a comprehensive review of SC techniques in insurance problems. A review of the application of these methods in insurance problems and a case study in a real problem completes this first chapter. Chapters 2 and 3 describe two different real applications of SC techniques in insurance. In this chapter, the authors describe the main concepts related to the algorithm and discuss different application of the algorithm in the insurance sector. Chapter 3 is devoted to a state-of-the-art technique in neural computation (Support Vector Machines, SVM). Chapter 4 presents a new mathematical tool based on modal intervals that allow us to process interval data (reflecting the fact that the data we are working with is not exact) and to interpret semantically the results obtained. Chapter 5 concentrates on two well-known risk measures: the Value at Risk and the Tail Value at Risk. The authors present a new analytical expression of the Tail Value at Risk using the Normal-Power approximation and they analyse its precision.

    1 in stock

    £72.24

  • Tools and Algorithms for the Construction and Analysis of Systems: 25 Years of TACAS: TOOLympics, Held as Part of ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Part III

    Springer Nature Switzerland AG Tools and Algorithms for the Construction and Analysis of Systems: 25 Years of TACAS: TOOLympics, Held as Part of ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Part III

    1 in stock

    Book SynopsisThis book is Open Access under a CC BY licence. This book, LNCS 11429, is part III of the proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019. It's a special volume on the occasion of the 25 year anniversary of TACAS. Table of ContentsTOOLympics 2019: An Overview of Competitions in Formal Methods.- Confluence Competion 2019.- International Competition on Runtime Verification (CRV).- The Model Checking Contest (2019).- The 2019 Comparison of Tools for the Analysis of Quantitative Formal Models.- The Rewrite Engines Competitions: A RECtrospective.- RERS 2019: Combining Synthesis with Real-World Models.- SL-COMP: Competition of Solvers for Separation Logic.- Automatic Verification of C and Java Programs: SV-COMP 2019.- The Termination and Complexity Competition.- Competition on Software Testing (Test-Comp).- VerifyThis - Verification Competition with a Human Factor.- SV-COMP 2019.- CBMC Path: A Symbolic Execution Retrofit of the C Bounded Model Checker (Competition Contribution).- Extending DIVINE with Symbolic Verification using SMT (Competition Contribution).- ESBMC v6.0: Verifying C Programs using k-Induction and Invariant Inference (Competition Contribution).- JBMC: Bounded Model Checking for Java Bytecode (Competition Contribution).- JayHorn: A Java Model Checker (Competition Contribution).- Java Pathfinder at SV-COMP 2019.- Pinaka: Symbolic Execution meets Incremental Solving (Competition Contribution).- PeSCo: Predicting Sequential Combinations of Verifiers (Competition Contribution).- Symbolic Pathfinder for SV-COMP.- VeriFuzz: Program Aware Fuzzing.- VIAP 1.1 (Competition Contribution).

    1 in stock

    £40.49

  • 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

  • Multivariate Data Analysis on Matrix Manifolds:

    Springer Nature Switzerland AG Multivariate Data Analysis on Matrix Manifolds:

    1 in stock

    Book SynopsisThis graduate-level textbook aims to give a unified presentation and solution of several commonly used techniques for multivariate data analysis (MDA). Unlike similar texts, it treats the MDA problems as optimization problems on matrix manifolds defined by the MDA model parameters, allowing them to be solved using (free) optimization software Manopt. The book includes numerous in-text examples as well as Manopt codes and software guides, which can be applied directly or used as templates for solving similar and new problems. The first two chapters provide an overview and essential background for studying MDA, giving basic information and notations. Next, it considers several sets of matrices routinely used in MDA as parameter spaces, along with their basic topological properties. A brief introduction to matrix (Riemannian) manifolds and optimization methods on them with Manopt complete the MDA prerequisite. The remaining chapters study individual MDA techniques in depth. The number of exercises complement the main text with additional information and occasionally involve open and/or challenging research questions. Suitable fields include computational statistics, data analysis, data mining and data science, as well as theoretical computer science, machine learning and optimization. It is assumed that the readers have some familiarity with MDA and some experience with matrix analysis, computing, and optimization. Table of ContentsIntroduction.- Matrix analysis and differentiation.- Matrix manifolds in MDA.- Principal component analysis (PCA).- Factor analysis (FA).- Procrustes analysis (PA).- Linear discriminant analysis (LDA).- Canonical correlation analysis (CCA).- Common principal components (CPC).- Metric multidimensional scaling (MDS) and related methods.- Data analysis on simplexes.

    1 in stock

    £33.74

  • Artificial Intelligence: 19th Russian Conference, RCAI 2021, Taganrog, Russia, October 11–16, 2021, Proceedings

    Springer Nature Switzerland AG Artificial Intelligence: 19th Russian Conference, RCAI 2021, Taganrog, Russia, October 11–16, 2021, Proceedings

    1 in stock

    Book SynopsisThis book constitutes the proceedings of the 19th Russian Conference on Artificial Intelligence, RCAI 2021, held in Moscow, Russia, in October 2021. The 19 full papers and 7 short papers presented in this volume were carefully reviewed and selected from 80 submissions. The conference deals with a wide range of topics, categorized into the following topical headings: cognitive research; data mining, machine learning, classification; knowledge engineering; multi-agent systems and robotics; natural language processing; fuzzy models and soft computer; intelligent systems; and tools for designing intelligent systems. Table of ContentsCognitive Research.- Heterogeneous Formal Neurons and Modeling of Multi-Transmitter Neural Ensembles.- Methods for Recognition of Frustration-Derived Reactions in Social Media.- Identification of the Network State Based on the ART-2 Neural Network with a Hierarchical Memory Structure in Parallel Mode.- Data Mining, Machine Learning, Classification.- Ranking Weibull Survival Model: Boosting Concordance Index of Weibull Time-to-event Prediction Model with Ranking Losses.- Predicting Different Health and Lifestyle Behaviors of Social Media Users.- Methods for Finding Consequences with Specified Properties.- Data Mining Methods for Analysis and Forecast of Emerging Technology Trend: A Systematic Mapping Study from SCOPUS Papers.- Machine Learning for Assessment of Cardiometabolic Risk Factors Predictive Potential and Prediction of Obstructive Coronary Arteries Lesions.- Knowledge Engineering.- Application of FCA for Domain Model Theory Investigation.- The Metagraph Model for Complex Networks: Definition, Calculus and Granulation Issues.- Subjective Expert Evaluations in the Model-Theoretic Representation of Object Domain Knowledge.- Multiagent Systems and Robotics.- Q-Mixing Network for Multi-Agent Path Finding in Partially Observable Grid Environments.- Subdefinite Computations for Reducing the Search Space in Mobile Robot Localization Task.- Enhancing Exploration Algorithms for Navigation with Visual SLAM.- Natural Language Processing.- Relying on Discourse Trees to Extract Medical Ontologies from Text.- TITANIS: A Tool for Intelligent Text Analysis in Social Media.- Approach to the Automated Development of Scientific Subject Domain Ontologies Based on Heterogeneous Ontology Design Patterns.- Fuzzy Models and Soft Computing.- PC-algorithm of Algebraic Bayesian Network Secondary Structure Training.- Logistic-based Design of Fuzzy Interpretable Classifiers.- Intelligent Systems.- Knowledge-Based Diagnostic System with a Precedent Library.- Semiotic Models in Monitoring and Decision Support Systems.- Cognitive Patterns for Semantic Presentation of Natural-language Descriptions of Well-formalizable Problems.- Detecting Anomalous Behavior of Users of Data Centers based on the Application of Artificial Neural Networks.- Tools for Designing Intelligent Systems.- Study of the Feasibility of Creating of a Real-time Neuronetwork Infrared Ground Objects Recognition System.- The Implementation of the Ontological Approach to Control of the Processes of Designing Integrated Expert Systems Based on the Problem-oriented Methodology.- A Module for Industrial Safety Inspection Planning Based on Self-organization.-

    1 in stock

    £67.49

  • Logical Foundations of Computer Science: International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings

    Springer Nature Switzerland AG Logical Foundations of Computer Science: International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022, Proceedings

    1 in stock

    Book SynopsisThis book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2022, held in Deerfield Beach, FL, USA, in January 2022. The 23 revised full papers were carefully reviewed and selected from 35 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science.Table of ContentsA Non-Hyperarithmetical Gödel Logic.- Shorten Resolution Proofs Non-Elementarily.- The Isomorphism Problem for FST Injection Structures.- Justification Logic and Type Theory as Formalizations of Intuitionistic Propositional Logic.- Hyperarithmetical Worm Battles.- Parametric Church’s Thesis: Synthetic Computability Without Choice.- Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic.- A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance.- A Parameterized View on the Complexity of Dependence Logic.- A Logic of Interactive Proofs.- Recursive Rules With Aggregation: A Simple Unified Semantics.- Computational Properties of Partial Non-deterministic Matrices and Their Logics.- Soundness and Completeness Results for LEA and Probability Semantics.- On Inverse Operators in Dynamic Epistemic Logic.- Computability Models Over Categories and Presheaves.- Reducts of Relation Algebras: The Aspects of Axiomatisability and Finite Representability.- Between Turing and Kleene.- Propositional Dynamic Logic With Quantification Over Regular Computation Sequences.- Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic.- Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems.- Logical Principles.- Small Model Property Reflects in Games and Automata.

    1 in stock

    £58.49

  • Understanding Computation: Pillars, Paradigms,

    Springer International Publishing AG Understanding Computation: Pillars, Paradigms,

    1 in stock

    Book SynopsisComputation theory is a discipline that uses mathematical concepts and tools to expose the nature of "computation" and to explain a broad range of computational phenomena: Why is it harder to perform some computations than others? Are the differences in difficulty that we observe inherent, or are they artifacts of the way we try to perform the computations? How does one reason about such questions? This unique textbook strives to endow students with conceptual and manipulative tools necessary to make computation theory part of their professional lives. The work achieves this goal by means of three stratagems that set its approach apart from most other texts on the subject. For starters, it develops the necessary mathematical concepts and tools from the concepts' simplest instances, thereby helping students gain operational control over the required mathematics. Secondly, it organizes development of theory around four "pillars," enabling students to see computational topics that have the same intellectual origins in physical proximity to one another. Finally, the text illustrates the "big ideas" that computation theory is built upon with applications of these ideas within "practical" domains in mathematics, computer science, computer engineering, and even further afield. Suitable for advanced undergraduate students and beginning graduates, this textbook augments the "classical" models that traditionally support courses on computation theory with novel models inspired by "real, modern" computational topics,such as crowd-sourced computing, mobile computing, robotic path planning, and volunteer computing. Arnold L. Rosenberg is Distinguished Univ. Professor Emeritus at University of Massachusetts, Amherst, USA. Lenwood S. Heath is Professor at Virgina Tech, Blacksburg, USA. Table of ContentsPreface.- I: Introduction.- 1 Introducing Computation Theory.- 2 Introducing the Book.- II: Pillar S: STATE.- 3 Pure State-Based Computational Models.- 4 The Myhill-Nerode Theorem: Implications and Applications.- 5 Online Turing Machines and the Implications of Online Computing.- 6 Pumping: Computational Pigeonholes in Finitary Systems.- 7 Mobility in Computing: An FA Navigates a Mesh.- 8 The Power of Cooperation: Teams of MFAs on a Mesh.- III: Pillar E: ENCODING.- 9 Countability and Uncountability: The Precursors of ENCODING.- 10 Computability Theory.- 11 A Church-Turing Zoo of Computational Models.- 12 Pairing Functions as Encoding Mechanisms.- IV: Pillar N: NONDETERMINISM.- 13 Nondeterminism as Unbounded Parallelism.- 14 Nondeterministic Finite Automata.- 15 Nondeterminism as Unbounded Search.- 16 Complexity Theory.- V: Pillar P: PRESENTATION/SPECIFICATION.- 17 The Elements of Formal Language Theory.- A A Chapter-Long Text on Discrete Mathematics.- B Selected Exercises, by Chapter.- List of ACRONYMS and SYMBOLS.- References.- Index.

    1 in stock

    £62.99

  • Advances in Computer Games: 17th International

    Springer International Publishing AG Advances in Computer Games: 17th International

    1 in stock

    Book SynopsisThis book constitutes the refereed post-conference proceedings of the 17th International Conference on Advances in Computer Games, ACG 2021, which was held as a virtual event during November 23–25, 2021. The 22 full papers included in this book were carefully reviewed and selected from 34 submissions. They were organized in topical sections as follows: learning in games; search in games; solving games; chess patterns; player modelling; and game systems.Table of Contents​Learning in Games.- Improving Counterfactual Regret Minimization Agents Training in the Card Game Cheat.- Deep Reinforcement Learning for Morpion Solitaire.- Expert Iteration for Risk.- Search in Games.- Sequential Halving Using Scores.- Cosine Annealing, Mixnet and Swish Activation for Computer Go.- A Heuristic Approach to the Game of Sylver Coinage.- Evaluating Interpretability Methods for DNNs in Game-Playing Agents.- Solving Games.- Quixo is Solved.- Solving Bicoloring-Graph Games on Rectangular Boards – Part 1: Partisan Col and Snort.- Solving Bicoloring-Graph Games on Rectangular Boards – Part 2: Impartial Col and Snort.- BoxOff is NP-Complete.

    1 in stock

    £52.24

  • Automata Theory and Formal Languages: Fundamental

    Springer International Publishing AG Automata Theory and Formal Languages: Fundamental

    1 in stock

    Book SynopsisKnowledge of automata theory and formal languages is crucial for understanding human-computer interaction, as well as for understanding the various processes that take place when manipulating knowledge if that knowledge is, indeed, expressed as sentences written in a suitably formalized language. In particular, it is at the basis of the theory of parsing, which plays an important role in language translation, compiler construction, and knowledge manipulation in general.Presenting basic notions and fundamental results, this concise textbook is structured on the basis of a correspondence that exists between classes of automata and classes of languages. That correspondence is established by the fact that the recognition and the manipulation of sentences in a given class of languages can be done by an automaton in the corresponding class of automata. Four central chapters center on: finite automata and regular languages; pushdown automata and context-free languages; linear bounded automata and context-sensitive languages; and Turing machines and type 0 languages. The book also examines decidable and undecidable problems with emphasis on the case for context-free languages.Topics and features: Provides theorems, examples, and exercises to clarify automata-languages correspondences Presents some fundamental techniques for parsing both regular and context-free languages Classifies subclasses of decidable problems, avoiding focus on the theory of complexity Examines finite-automata minimalization and characterization of their behavior using regular expressions Illustrates how to derive grammars of context-free languages in Chomsky and Greibach normal forms Offers supplementary material on counter machines, stack automata, and abstract language families This highly useful, varied text/reference is suitable for undergraduate and graduate courses on automata theory and formal languages, and assumes no prior exposure to these topics nor any training in mathematics or logic.Alberto Pettorossi is professor of theoretical computer science at the University of Rome Tor Vergata, Rome, Italy.Table of Contents1 Formal Grammars and Languages.- 2 Finite Automata and Regular Grammars.- 3 Pushdown Automata and Context-Free Grammars.- 4 Linear Bounded Automata and Context-Sensitive Grammars.- 5 Turing Machines and Type 0 Grammars.- 6 Decidability and Undecidability in Context-Free Languages.- 7 Supplementary Topics.

    1 in stock

    £47.49

  • Computer Algebra in Scientific Computing: 24th International Workshop, CASC 2022, Gebze, Turkey, August 22–26, 2022, Proceedings

    Springer International Publishing AG Computer Algebra in Scientific Computing: 24th International Workshop, CASC 2022, Gebze, Turkey, August 22–26, 2022, Proceedings

    1 in stock

    Book SynopsisThis book constitutes the proceedings of the 24th International Workshop on Computer Algebra in Scientific Computing, CASC 2022, which took place in Gebze, Turkey, in August 2022. The 20 full papers included in this book were carefully reviewed and selected from 32 submissions. They focus on the theory of symbolic computation and its implementation in computer algebra systems as well as all other areas of scientific computing with regard to their benefit from or use of computer algebra methods and software. Table of ContentsSurvey on Generalizations of the Intermediate Value Theorem and Applications (Invited Talk).- On Truncated Series Involved in Exponential-Logarithmic Solutions of Truncated LODEs.- Subresultant Chains Using B´ezout Matrices.- Application of Symbolic-Numerical Modeling Tools for Analysis of Gyroscopic Stabilization of Gyrostat Equilibria.- Computer Science for Continuous Data: Vision, Theory, and Practice of a Computer (Algebra) ANALYSIS System.- Computational Aspects of Equivariant Hilbert Series of Canonical Rings for Algebraic Curves.- Symbolic-Numeric Algorithm for Calculations in Geometric Collective Model of Atomic Nuclei.- Analyses and Implementations of Chordality-Preserving Top-Down Algorithms for Triangular Decomposition.- Accelerated Subdivision for Clustering Roots of Polynomials Given by Evaluation Oracles.- On Equilibrium Positions in the Problem of the Motion of a System of Two Bodies in a Uniform Gravity Field.- An Interpolation Algorithm for Computing Dixon Resultants.- Distance Evaluation to the Set of Matrices with Multiple Eigenvalues.- On Boundary Conditions Parametrized by Analytic Functions.- Computing the Integer Hull of Convex Polyhedral Sets.- A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences.- Stability Analysis of Periodic Motion of the Swinging Atwood Machine.- New Heuristic to Choose a Cylindrical Algebraic Decomposition Variable Ordering Motivated by Complexity Analysis.- An Implementation of Parallel Number-Theoretic Transform Using Intel AVX-512 Instructions.- Locating the Closest Singularity in a Polynomial Homotopy.- A General Method of Finding New Symplectic Schemes for Hamiltonian Mechanics.- A Mechanical Method for Isolating Locally Optimal Points of Certain Radical Functions.

    1 in stock

    £58.49

  • Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles: 11th International Symposium, ISoLA 2022, Rhodes, Greece, October 22–30, 2022, Proceedings, Part I

    Springer International Publishing AG Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles: 11th International Symposium, ISoLA 2022, Rhodes, Greece, October 22–30, 2022, Proceedings, Part I

    1 in stock

    Book SynopsisThis four-volume set LNCS 13701-13704 constitutes contributions of the associated events held at the 11th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2022, which took place in Rhodes, Greece, in October/November 2022. The contributions in the four-volume set are organized according to the following topical sections: specify this - bridging gaps between program specification paradigms; x-by-construction meets runtime verification; verification and validation of concurrent and distributed heterogeneous systems; programming - what is next: the role of documentation; automated software re-engineering; DIME day; rigorous engineering of collective adaptive systems; formal methods meet machine learning; digital twin engineering; digital thread in smart manufacturing; formal methods for distributed computing in future railway systems; industrial day.Table of ContentsSpecify This - Bridging gaps between program specification paradigms.- X-by-Construction Meets Runtime Verification.- Verification and Validation of Concurrent and Distributed Heterogeneous Systems.

    1 in stock

    £67.49

  • Coordination, Organizations, Institutions, Norms, and Ethics for Governance of Multi-Agent Systems XV: International Workshop, COINE 2022, Virtual Event, May 9, 2022, Revised Selected Papers

    Springer International Publishing AG Coordination, Organizations, Institutions, Norms, and Ethics for Governance of Multi-Agent Systems XV: International Workshop, COINE 2022, Virtual Event, May 9, 2022, Revised Selected Papers

    1 in stock

    Book SynopsisThis book constitutes the thoroughly refereed post-conference proceedings of the International Workshop on Coordination, Organizations, Institutions, and Norms for Governance of Multi-Agent Systems, COINE 2022, which was held in Auckland, New Zealand, on May 9, 2022.The 14 papers included in these proceedings were carefully reviewed and selected from 15 submissions. They deal with autonomous agents and multi-agent systems, focusing on the scientific and technological aspects of social coordination, organizational theory, artificial (electronic) institutions, and normative and ethical MAS.Table of ContentsDesigning International Humanitarian Law into Military Autonomous Devices.- Epistemic Diversity and Explanatory Adequacy in Distributed Information Processing.- The Complexity of Norm Synthesis and Revision.- Embracing AWKWARD! Real-Time Adjustment of Reactive Plans Using Social Norms.- Self-Learning Governance of Black-Box Multi-Agent Systems.- Computational Theory of Mind for Human-Agent Coordination.- Computational Discovery of Transaction-Based Financial Crime via Grammatical Evolution: The Case of Ponzi Schemes.- Centralized Norm Enforcement in Mixed-Motive Multiagent Reinforcement Learning.- Supporting the Reasoning about Environmental Consequences of Institutional Actions.- Social Motives and Social Contracts in Cooperative Survival Games.- Evaluating Human and Agent Task Allocators in Ad Hoc Human-Agent Teams.- Fleur: Social Values Orientation for Robust Norm Emergence.- Reasoning about Collective Action in Markov Logic: A Case Study from Classical Athens.- Design Heuristics for Ethical Online Institutions.

    1 in stock

    £47.49

  • Rules and Reasoning: 6th International Joint Conference on Rules and Reasoning, RuleML+RR 2022, Berlin, Germany, September 26–28, 2022, Proceedings

    Springer International Publishing AG Rules and Reasoning: 6th International Joint Conference on Rules and Reasoning, RuleML+RR 2022, Berlin, Germany, September 26–28, 2022, Proceedings

    1 in stock

    Book SynopsisThis book constitutes the proceedings of the International Joint Conference on Rules and Reasoning, RuleML+RR 2022, held in Berlin, Germany, during September 26–28, 2022. This is the 6th conference of a new series, joining the efforts of two existing conference series, namely “RuleML” (International Web Rule Symposium) and “RR” (Web Reasoning and Rule Systems). The 18 full research papers presented in this book were carefully reviewed and selected from 54 submissions. The papers cover the following topics: answer set programming; foundations of nonmonotonic reasoning; datalog; queries over ontologies; proofs, error-tolerance, and rules; as well as agents and argumentation.Table of ContentsAnswer Set Programming.- Foundations of Nonmonotonic Reasoning.- Datalog.- Queries Over Ontologies.- Proofs, Error-tolerance, and Rules.- Agents and Argumentation.

    1 in stock

    £47.49

  • Advances in Optimization and Applications: 13th International Conference, OPTIMA 2022, Petrovac, Montenegro, September 26–30, 2022, Revised Selected Papers

    Springer International Publishing AG Advances in Optimization and Applications: 13th International Conference, OPTIMA 2022, Petrovac, Montenegro, September 26–30, 2022, Revised Selected Papers

    1 in stock

    Book SynopsisThis book constitutes the refereed proceedings of the 13th International Conference on Advances in Optimization and Applications, OPTIMA 2022, held in Petrovac, Montenegro, during September 26–30, 2022. The 13 full papers included in this book were carefully reviewed and selected from 26 submissions. They were organized in topical sections as follows: ​mathematical programming; global optimization; discrete and combinatorial optimization; optimization and data analysis; game theory and mathematical economics; and applications.Table of Contents​Mathematical Programming.- A Derivative-Free Nonlinear Least Squares Solver.- Gradient-Type Methods for Optimization Problems with Polyak- Lojasiewicz Condition: Early Stopping and Adaptivity to Inexactness Parameter.- Global Optimization.- An Improved Genetic Algorithm for the Resource-Constrained Project Scheduling Problem.- Nonlocal Optimization Methods for Nonlinear Controlled Systems with Terminal Constraints.- Discrete and Combinatorial Optimization.- Three-Bar Charts Packing Problem.- An 11/7 – Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times.- Optimization and Data Analysis.- Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches.- Game Theory and Mathematical Economics.- Analysis of the Model of Optimal Expansion of a Firm.- Comparative Analysis of the Efficiency of Financing the State Budget through Emissions, Taxes and Public Debt.- Applications.- Construction of Optimal Feedback for Zooplankton Diel Vertical Migration.- Synthesis of Trajectory Planning Algorithms Using Evolutionary Optimization Algorithms.- Application of Attention Technique for Digital Pre-Distortion.- Forecasting with Using Quasilinear Recurrence Equation.

    1 in stock

    £49.49

  • SOFSEM 2023: Theory and Practice of Computer Science: 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023, Proceedings

    Springer International Publishing AG SOFSEM 2023: Theory and Practice of Computer Science: 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15–18, 2023, Proceedings

    1 in stock

    Book SynopsisThis book constitutes the conference proceedings of the 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, held in Nový Smokovec, Slovakia, during January 15–18, 2023.The 22 full papers presented together with 2 best papers and 2 best students papers in this book were carefully reviewed and selected from 43 submissions.This workshop focuses on graphs problems and optimization; graph drawing and visualization; NP-hardness and fixed parameter tractability; communication and temporal graphs; complexity and learning; and robots and strings. Table of ContentsThe Complexity of Finding Tangles.- A spectral algorithm for finding maximum cliques in dense random intersection graphs.- Solving Cut-Problems in Quadratic Time for Graphs With Bounded Treewidth.- More Effort Towards Multiagent Knapsack.- Dominance Drawings for DAGs with Bounded Modular Width.- Morphing Planar Graph Drawings Through 3D.- Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees.- Parameterized Approaches to Orthogonal Compaction.- Hardness of bounding influence via graph modification.- On the Parameterized Complexity of $s$-club Cluster Deletion Problems.- Balanced Substructures in Bicolored Graphs.- On the Complexity of Scheduling Problems With a Fixed Number of Parallel Identical Machines.- On the 2-Layer Window Width Minimization Problem.- Sequentially Swapping Tokens: Further on Graph Classes.- On the Preservation of Properties when Changing Communication Models.- Introduction to Routing Problems with Mandatory Transitions .- Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs.- Lower Bounds for Monotone $q$-Multilinear Boolean Circuits.- A faster algorithm for determining the linear feasibility of systems of BTVPI constraints.- Quantum complexity for vector domination problem.- Learning through Imitation by using Formal Verification.- Delivery to Safety with Two Cooperating Robots.- Space-Efficient STR-IC-LCS Computation.- The k-center Problem for Classes of Cyclic Words.

    1 in stock

    £56.99

  • High-Performance Computing Systems and Technologies in Scientific Research, Automation of Control and Production: 12th International Conference, HPCST 2022, Barnaul, Russia, May 20–21, 2022, Revised Selected Papers

    Springer International Publishing AG High-Performance Computing Systems and Technologies in Scientific Research, Automation of Control and Production: 12th International Conference, HPCST 2022, Barnaul, Russia, May 20–21, 2022, Revised Selected Papers

    1 in stock

    Book SynopsisThis book constitutes the refereed proceedings of the 12th International Conference on High-Performance Computing Systems and Technologies in Scientific Research, Automation of Control and Production, HPCST 2022, held in Barnaul, Russia, during May 20–21, 2022. The 23 full papers included in this book were carefully reviewed and selected from 116 submissions. They were organized in topical sections as follows: hardware for high-performance computing and signal processing; information technologies and computer simulation of physical phenomena; computing technologies in data analysis and decision making; and computing technologies in information security applications.Table of Contents​Hardware for High-Performance Computing and Signal Processing.- Hierarchical Encoder-Decoder Neural Network with Self-Attention for Single-Channel Speech Denoising.- Calculation of Activation Functions in FPGA-Based Neuroprocessors Using the Cordic Algorithm.- Frequency-Domain Generalized Phase Transform Method in Pipeline Leaks Locating.- Information Technologies and Computer Simulation of Physical Phenomena.- Inverse Problem Regularization of Parametric Identification of the Particle Temperature Distribution of Gas-Thermal Flow with Optimization of Its Solution.- Application of the Heterogeneous Multiscale Finite Element Method for Modelling the Compressibility of Porous Media.- Parallel Non-Conforming Finite Element Technique for Mathematical Simulation of Fluid Flow in Multiscale Porous Media.- Darcy Problem Solution in a Mixed Formulation for Geological Media of Various Structures.- Mathematical Modeling of the Electromagnetic Field from a Solenoidal Coil in the Frequency Domain.- Computing Technologies in Data Analysis and Decision Making.- Novel Planning Technique for ERP Systems Implementation Projects.- Development of an Automated Document Classification System with a Predefined Structure.- Ontology-Based Data Mining Platform for Diagnosing Sowing Quality of Wheat Seeds.- Algorithm for the Classification of Coronary Heart Disease Based on the Use of Symptom Complexes in the Cardiovascular Environment.- Business Process Designing of the Institutional Ranking System of Higher Education of the Kyrgyz Republic.- Evaluation of the Efficiency of the Vaccination against Chickenpox Based on the Results of Simulation Modeling.- Hierarchical Volume Mesh Model of Heterogeneous Media Based on Non-Destructive Imaging Data.- Modeling а Potential Plant Habitat by Ensemble Machine Learning.- Information and Computing Technologies in Automation and Control Science.- Adaptive Traffic Signal Control Based on a Macroscopic Model of the Transport Network.- Optimization and Robustization of Angular Motion Control of an Automatic Maneuverable Aerial Vehicle.- Synthesis of the Rational Analyzing Function for Feature Extraction of Signals from the Electrostatic Location System.- Application of Computer Numerical Control in Eddy-Current Study Methods.- Computing Technologies in Information Security Applications.- Open-Source Solution for Identification and Blocking of Anomalous BGP-4 Routing Information.- Simulation of DDoS Attacks on LTE and LoRaWAN Protocols in the NS-3 Network Simulator.- Transaction-Oriented Approach to the Design of Information Systems Based on Formal Grammar.

    1 in stock

    £58.49

  • Algorithms and Discrete Applied Mathematics: 9th

    Springer International Publishing AG Algorithms and Discrete Applied Mathematics: 9th

    1 in stock

    Book SynopsisThis book constitutes the proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023, which was held in Gandhinagar, India, during February 9-11, 2023.The 32 papers presented in this volume were carefully reviewed and selected from 67 submissions. The papers were organized in topical sections named: algorithms and optimization; computational geometry; game theory; graph coloring; graph connectivity; graph domination; graph matching; graph partition and graph covering.Table of ContentsStable Approximation Schemes.- A whirlwind tour of intersection graph enumeration.- Graph modification problems with forbidden minors.- Algorithms & Optimization Efficient reductions and algorithms for Subset Product.- Optimal length cutting plane refutations of integer programs.- Fault-Tolerant Dispersion Resource management in device-to-device communications.- Computational Geometry Algorithms for k-Dispersion for Points in Convex Position in the Plane.- Arbitrary oriented color spanning region for line segments.- Games with a Simple Rectilinear Obstacle in Plane.- Diverse Fair Allocations: Complexity and Algorithms.- Graph Coloring New bounds and constructions for neighbor-locating colorings of graphs.- D K 5-list coloring toroidal 6-regular triangulations in linear time.- On Locally Identifying Coloring of Graphs.- On Structural Parameterizations of Star Coloring.- Reddy Perfectness of G-generalized join of graphs.- Coloring of a superclass of 2K2-free graphs.- The Weak (2,2)-Labelling Problem for graphs with forbidden induced structures.- Graph Connectivity Short cycles dictate dichotomy status of the Steiner tree problem on Bisplit graphs.- Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs.- Monitoring edge-geodetic sets in graphs.- Cyclability, Connectivity and Circumference.- Graph Domination On three domination-based identification problems in block graphs.- Graph modification problems with forbidden minors.- Computational Aspects of Double Dominating Sequences in Graph.- Relation between broadcast domination and multipacking numbers on chordal graphs.- Pushing Cops and Robber on Oriented Graphs.- Mind the Gap: Edge Facility Location Problems in Theory and Practice.- Complexity Results on Cosecure Domination in Graphs.- Kusum and Arti Pandey Graph Matching Latin Hexahedra and Related Combinatorial Structures.- Minimum Maximal Acyclic Matching in Proper Interval Graphs.- Graph Partition & Graph Covering Transitivity on subclasses of chordal graphs.- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength.- Covering using Bounded Size Subgraphs.- Axiomatic characterization of the the toll walk function of some graph classes.- Structural Parameterization of Alliance Problems.

    1 in stock

    £61.74

  • 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

  • Optimization and Applications

    Springer Optimization and Applications

    1 in stock

    Book SynopsisMathematical Programming.- Hybrid Method for Linear ProgrammingHybrid Method for Linear Programming.- An Equilibrium Dynamic Traffic Assignment Model with Linear Programming Formulation.- Singular optimization problems and p-factor approach for their analysis.- On the Application of Composite Penalty Functions Obtained by Gluing of External Penalties with Barrier Ones in Linear Programming.- Nesterov's Method of Dichotomy via Order Oracle: The Problem of Optimizing a Two-Variable Function on a Square.- Piecewise Linear Approximations in the Balanced Identification of Models with Differential Equations.- Extragradient Sliding for Composite Non-Monotone Variational Inequalities.- Global Optimization.- A Three-Stage Numerical Approach to the Study of Extra-Large Atomic-Molecular Clusters.- Comparative Efficiency of Machine Learning Models for Enhancing Algorithms in Solving Multiextremal Multicriteria Problems.- Automated Multi-Criteria Optimization of Parallel Robots.- Optimal Selection of Feedback Coefficients in the Problem of Stabilizing a Chain of Three Integrators.- Optimal Control.- On Some Sufficient Condition for Quadraticity of a Degenerate Optimization Problem with Inequality Constraints.- A Maximum Principle for a State-Constrained Optimal Control Problem Whose Data Is Measurable in the Time-variable.- Game Theory and Mathematical Economics.- Nash and Stackelberg Equilibria in Differential Games with Functionals in the Form of the Minimum Antagonistic and Partial Criteria.- A Model of Investment Policy of Firms.- Optimization in Economics and Finance.- The Ramsey's Conjecture for the Model with Non-Liquid Capital.- A Nonlinear Input-Output-Based Model for Medium-Term Macroeconomic Risks Analysis for a Restructuring Economy with Limited Capacities.- Optimal Timing of Investment and Debt Payment in Production Expansion with the Use of External Financing.- Identification of an Endogenous Production Function for the U.S. Economy.- An Ecological and Economic Model of Carbon Neutrality.- Applications.- Optimal Control Problem in Treatment Strategies for Breast Tumors.- The Use of Both Temperature Field and Heat Fluxes to Identify the Thermal Conductivity and Volumetric Heat Capacity.- Maximising the Discounted Accumulated Income in the Model with Two Gas Fields.- Modeling and Optimization of Controlled Conveyor Systems Using Intelligent Controllers.

    1 in stock

    £56.99

  • Concise Computer Mathematics: Tutorials on Theory and Problems

    Springer International Publishing AG Concise Computer Mathematics: Tutorials on Theory and Problems

    1 in stock

    Book SynopsisAdapted from a modular undergraduate course on computational mathematics, Concise Computer Mathematics delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of essential mathematical concepts. The material is divided into four units: discrete mathematics (sets, relations, functions), logic (Boolean types, truth tables, proofs), linear algebra (vectors, matrices and graphics), and special topics (graph theory, number theory, basic elements of calculus). The chapters contain a brief theoretical presentation of the topic, followed by a selection of problems (which are direct applications of the theory) and additional supplementary problems (which may require a bit more work). Each chapter ends with answers or worked solutions for all of the problems.Trade ReviewFrom the reviews:“The book is ideally suited as an adjunct to a course in computer mathematics or as a refresher for someone with some background in computer mathematics. … The book fulfills its purpose of providing a distilled treatment of the mathematics most commonly used in computer science. It is of most value to computer science students who need a place to find a succinct treatment of the topics covered.” (Marlin Thomas, Computing Reviews, April, 2014)“Each of the chapters opens with a short summary followed by a set of essential problems and then a set of supplementary problems. … it would be very useful for someone that needs a quick and effective review that includes problems.” (Charles Ashbacher, MAA Reviews, January, 2014)Table of ContentsSets and NumbersRelations and DatabasesFunctionsBoolean Algebra, Logic and QuantifiersNormal Forms, Proof and ArgumentVectors and Complex NumbersMatrices and ApplicationsMatrix Transformations for Computer GraphicsElements of Graph TheoryElements of Number Theory and CryptographyElements of CalculusElementary Numerical Methods

    1 in stock

    £49.49

  • Object-Process Methodology: A Holistic Systems Paradigm

    Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Object-Process Methodology: A Holistic Systems Paradigm

    1 in stock

    Book SynopsisObject-Process Methodology (OPM) is an intuitive approach to systems engineering. This book presents the theory and practice of OPM with examples from various industry segments and engineering disciplines, as well as daily life. OPM is a generic, domain independent approach that is applicable almost anywhere in systems engineering.Table of ContentsI Foundations of Object-Process Methodology.- 1 A Taste of OPM.- 1.1 The Wedding Example: A Sneak Preview of OPM.- 1.2 OPM Building Blocks: Objects, Processes, and States.- 1.3 Specialization and Inheritance.- 1.4 Aggregation and the Result Link.- Summary.- Problems.- 2 Object-Process Diagrams.- 2.1 Objects and Aggregation.- 2.2 Structural Relations and Structural Links.- 2.3 Processes and Procedural Links.- 2.4 System Diagram: The Top-Level OPD.- 2.5 Zooming into the Transaction Executing Process.- 2.6 The OPD Set.- 2.7 How to Read an OPD.- 2.7.1 Flow of Control.- 2.7.2 The Timeline in OPDs.- 2.7.3 Object States and Conditions.- 2.8 Completing the In-Zoomed Transaction Executing OPD.- 2.8.1 Logical XOR, AND, and OR Operators.- 2.8.2 The System Map.- 2.8.3 The Ultimate OPD.- 2.8.4 Zooming Out of Transaction Executing.- Summary.- Problems.- 3 Object-Process Language.- 3.1 Motivation for a Language.- 3.1.1 Real-Time Textual Feedback.- 3.1.2 Closing the Requirements-Implementation Gap.- 3.2 Structural Links and Structure Sentences.- 3.2.1 The First OPL Sentence.- 3.2.2 The First OPL Aggregation Sentence.- 3.3 The OPL Paragraph and the Graphics-Text Principle.- 3.3.1 Extending the OPL Paragraph.- 3.3.2 Enabling Sentences.- 3.3.3 Transformation Sentences.- 3.3.4 The SD Paragraph.- 3.4 More OPL Sentence Types.- 3.4.1 State Enumeration and Condition Sentences.- 3.4.2 AND, XOR, and OR Logical Operators.- 3.4.3 The SD1 Paragraph.- 3.4.4 In-Zooming and Out-Zooming Sentences.- 3.5 Boolean Objects and Determination Sentence.- 3.5.1 Boolean Condition Sentences.- 3.5.2 Compound Condition Sentences.- 3.5.3 State-Specified Generation Sentence.- 3.5.4 Converting a Dual-State Object into a Boolean Object.- 3.6 OPD-OPL Item Pairs and Synergy.- Summary.- Problems.- 4 Objects and Processes.- 4.1 Existence, Things, and Transformations.- 4.1.1 Objects.- 4.1.2 Transformation and Processes.- 4.2 Processes and Time.- 4.2.1 Cause and Effect.- 4.2.2 Syntactic vs. Semantic Sentence Analysis.- 4.2.3 The Process Test.- 4.3 Things.- 4.3.1 Things and Entities.- 4.3.2 The Perseverance of Things.- 4.3.3 The Essence of Things.- 4.3.4 Symbolizing Physical Things.- 4.3.5 The Origin of Things.- 4.3.6 The Complexity of Things.- 4.3.7 Thing Types.- 4.3.8 The Relativity of Object and Process Importance.- 4.3.9 Object and Process Naming.- 4.4 Informatical Objects.- 4.4.1 Telling Informatical and Physical Objects Apart.- 4.4.2 Systems and Information Systems.- 4.4.3 Translation of Informatical Objects.- 4.4.4 Toward “Pure” Informatical Objects.- 4.5 Object Identity.- 4.5.1 Change of State or Change of Identity?.- 4.5.2 Classes and Instances of Objects and Processes.- Summary.- Problems.- II Concepts of OPM Systems Modeling.- 5Dynamics.- 5.1 States.- 5.1.1 Object States and Status.- 5.1.2 Change and Effect.- 5.1.3 Explicit and Implicit Status Representations.- 5.1.4 The Input, Output, and Effect Links.- 5.1.5 State Suppression and the Effect Link.- 5.1.6 State Expression.- 5.2 Existence and Transformation.- 5.2.1 Result and Consumption Links.- 5.2.2 Procedural Links, Enablers, and Transformées.- 5.2.3 Enablers.- 5.2.4 Agents.- 5.2.5 Instruments.- 5.2.6 Enabling Links.- 5.2.7 Transformées.- 5.2.8 Odd Man Out: The Invocation Linkt.- 5.3 Object Roles with Respect to a Process.- 5.3.1 Enablers and Affectees.- 5.3.2 The Involved, Preprocess, and Postprocess Object Sets.- 5.3.3 Condition and Agent Condition Links.- 5.3.4 Operator, Operand, and Transform?.- Summary.- Problems.- 6Structure.- 6.1 Structural Relations.- 6.1.1 Structural Links.- 6.1.2 Structural Relation Directions.- 6.1.3 Unidirectional Structural Link.- 6.1.4 OPD Sentences.- 6.1.5 The Reciprocity of a Structural Relation.- 6.1.6 Null Tags and Their Default OPL Reserved Phrases.- 6.1.7 Structural Relations as Static Verbs.- 6.2 Participation Constraints and Cardinality.- 6.2.1 Participation Constraints.- 6.2.2 Parameterized Participation Constraints.- 6.2.3 Range Participation Constraints.- 6.2.4 Shorthand Notations and Reserved Phrases.- 6.2.5 Cardinality.- 6.2.6 Participation Constraints in Procedural Relations.- 6.3 The Distributive Law and Forks.- 6.3.1 Forks.- 6.3.2 Fork Degree.- 6.3.3 Fork Comprehensiveness.- 6.4 The Transitivity of Structural Relations.- 6.5 The Four Fundamental Structural Relations.- Summary.- Problems.- 7Aggregation and Exhibition.- 7.1 Aggregation-Participation: Underlying Concepts.- 7.1.1 Aggregation-Participation as a Tagged Structural Relation.- 7.1.2 The Aggregation-Participation Symbol.- 7.1.3 Sets and Order.- 7.1.4 Aggregate Naming.- 7.1.5 Aggregating Processes.- 7.2 Aggregation Hierarchy and Comprehensiveness.- 7.2.1 Aggregation Hierarchy.- 7.2.2 Aggregation Comprehensiveness.- 7.2.3 Parameterized Participation Constraints.- 7.2.4 Participation Level and Aggregational Complexity.- 7.3 Exhibition-Characterization: Underlying Concepts.- 7.3.1 The Name Exhibition-Characterization.- 7.3.2 The Exhibition-Characterization Symbol.- 7.3.3 Attribute and Operation Are Features.- 7.3.4 Exhibition Complexity.- 7.4 Features in 00 vs. OPM.- 7.5 The Four Thing-Feature Combinations.- 7.5.1 The Object-Attribute Combination.- 7.5.2 The Object-Operation Combination.- 7.5.3 The Process-Attribute Combination.- 7.5.4 Process-Operation Combination.- 7.6 The Feature Hierarchy.- 7.7 Feature-Related Natural Language Issues.- 7.7.1 Attribute Naming Dilemmas.- 7.7.2 Reserved Objects and the Measurement Unit Reserved Object.- 7.7.3 Continuous Values and Multi-Valued Attributes.- 7.7.4 Mathematical Inequalities in OPM.- 7.8 Reflective Metamodeling of an Attribute.- 7.8.1 The Size of an Attribute.- 7.8.2 The Mode of an Attribute.- 7.8.3 The Touch of an Attribute.- 7.8.4 The Source of a Feature.- 7.8.5 The Operation a Feature Carries.- Summary.- Problems.- 8 Generalization and Instantiation.- 8.1 Generalization-Specialization: Introduction.- 8.1.1 Specialization Symbol and Sentence.- 8.1.2 Process Specialization.- 8.2 Inheritance.- 8.2.1 Feature Inheritance.- 8.2.2 Structural Relations Inheritance.- 8.2.3 Procedural Link Inheritance.- 8.2.4 State Inheritance.- 8.2.5 State Specialization.- 8.2.6 Process Specialization.- 8.2.7 Generalization Complexity.- 8.3 Qualification.- 8.3.1 Qualification Inheritance.- 8.3.2 Multiple Qualification Inheritance.- 8.4 Classification-Instantiation.- 8.4.1 Classes and Instances.- 8.4.2 The Relation Between Instantiation and Specialization.- 8.4.3 The Relativity of Instance.- 8.4.4 Instance Qualification.- 8.4.5 Process Instances.- 8.4.6 Classification Complexity.- 8.5 Modifiers and Instances.- 8.5.1 Natural Language Modifiers and Shortcuts.- 8.5.2 Adjectives and Attributes.- 8.5.3 Adverbs and Operations.- 8.6 Specializations of the Involved Object Set Members.- 8.7 Non-Comprehensiveness.- 8.7.1 Non-Comprehensiveness of Fundamental Structural Relations.- 8.7.2 Non-Comprehensiveness of States and Values.- Summary.- Problems.- 9 Managing Systems’ Complexity.- 9.1 The Need for Complexity Management.- 9.1.1 Middle-Out as the De-Facto Architecting Practice.- 9.1.2 Determining the Extent of Refinement.- 9.1.3 Towards Quantifying Complexity.- 9.2 Divide and Conquer: By Aspects or by Details?.- 9.2.1 Why is Detail Decomposition Good?.- 9.2.2 When Should a New OPD Be Created?.- 9.3 The Attributes of Scaling.- 9.3.1 The Purpose of Scaling.- 9.3.2 The Mode of Scaling.- 9.3.3 Controlling Visibility by In- and Out-Zooming.- 9.3.4 The Distributivity of Procedural Links.- 9.3.5 Unfolding and Folding.- 9.3.6 State Expressing and Suppressing.- 9.3.7 Primary and Secondary Operands.- 9.4 Abstracting.- 9.4.1 Consolidating.- 9.4.2 Zoom consolidating.- 9.4.3 Paths and Path Labels.- 9.4.4 Zoom Consolidating Pitfalls.- 9.4.5 Zoom Consolidating Conditions.- 9.4.6 Fold Consolidating.- 9.5 What Happens to Procedural Links During Abstracting?.- 9.5.1 Procedural Link Precedence.- 9.5.2 Semi-Folding and Semi-Unfolding.- 9.5.3 Selective Semi-Folding and Semi-Unfolding.- 9.6 Looking at the Big Picture: The System Map and the OPM Construct Pairs.- Summary.- Problems.- III Building Systems with OPM.- 10 Systems and Modeling.- 10.1 Defining Systems.- 10.1.1 Some Existing Definitions.- 10.1.2 Function.- 10.1.3 The Various Functions of Stone.- 10.2 System Defined.- 10.2.1 System as a Relative Term.- 10.2.2 System as a Subjective Term.- 10.2.3 The Function of Naturaland Artificial Systems.- 10.3 Goal, Concept, and Function.- 10.3.1 The Intent and Goal of Artificial Systems.- 10.3.2 Telling System Function and Dynamics Apart.- 10.3.3 Function, Structure, and Behavior.- 10.4 System Architecture.- 10.4.1 Function vs. Dynamics.- 10.4.2 The Concept Behind a System.- 10.4.3 The Origin and Essence of Systems.- 10.5 Objects, Systems, and Products.- 10.5.1 Product Defined.- 10.5.2 The Object-System-Product Hierarchy.- 10.5.3 Goods, Services, and Projects.- 10.6 Documenting Functions of the System Architecture.- 10.6.1 The Function Hierarchy.- 10.6.2 Function Boxes and Function Sentences.- 10.6.3 Functionality.- 10.7 From Systems to Models.- 10.7.1 Some Model Definitions.- 10.7.2 Model Defined.- 10.8 Modeling Paradigms.- 10.8.1 Natural Language as a Modeling Tool.- 10.8.2 Mathematical and Symbolic Modeling.- 10.8.3 Graphic Modeling and Knowledge Representation.- 10.9 Reflective Metamodeling.- Summary.- Problems.- 11 System Lifecycle and Evolution.- 11.1 System Lifecycle.- 11.1.1 Lifecycle of Artificial Systems.- 11.1.2 Software and Product Development Processes.- 11.2 Systems Analysis and the Scientific Method.- 11.3 Categorization vs. Interdisciplinarity.- 11.4 System Engineering and the Role of the System Architect.- 11.5 An OPM Model of System Lifecycle Phases.- 11.5.1 Top-Level Description of System Evolution.- 11.5.2 Initiating the System.- 11.5.3 Developing the System.- 11.5.4 Analyzing.- 11.5.5 The Refining-Abstracting Cycles.- 11.5.6 Designing.- 11.5.7 The Waterfall Model vs. Iterative and Incremental Development.- 11.5.8 Deploying the System.- 11.6 Zooming into Analyzing.- 11.7 Zooming into Designing and Implementing.- 11.8 From Design to Implementation.- Summary.- Problems.- 12 States and Values.- 12.1 State-specified Objects and Links.- 12.1.1 Initial, Ultimate and Default States.- 12.1.2 The Transformation Attribute of a Process.- 12.1.3 Object as a Role Player for State.- 12.1.4 State Maintaining Processes.- 12.1.5 Sentences and Phrases of States and Values.- 12.1.6 Single Value Sentence.- 12.2 Telling States Apart from Values.- 12.3 Metamodeling the Attributes of Value and Their States.- 12.3.1 Numeric and Symbolic Values.- 12.3.2 Mapping Object States onto Attribute Values.- 12.4 Compound States and State Space.- 12.4.1 The Attribute Feasibility Matrix.- 12.4.2 Logical Compound States.- Summary.- Problems.- 13 Advanced OPM Concepts.- 13.1 Real-Time Issues.- 13.1.1 Sequential vs. Parallel Process Execution.- 13.1.2 Process Synchronization.- 13.1.3 Events.- 13.1.4 Chronon and Event.- 13.1.5 Basic Triggering Event Types.- 13.2 Process and State Duration.- 13.3 Processing states.- 13.4 Probability in Procedural Relations.- 13.5 Scope and Name Disambiguation.- 13.5.1 The Fundamental DAG.- 13.5.2 Scope of an Object.- 13.6 The Reserved Words “of” and “which”.- 13.6.1 The Reserved Word “of” and the Dot Operator.- 13.6.2 Using “of” with Tagged Structural Relations.- 13.6.3 The Reserved Word “which”.- 13.6.4 Operation: A Process Without Side Effect.- 13.7 Structure-Related Issues.- 13.7.1 Transitivity Strength.- 13.7.2 Hamiltonian Distance.- 13.7.3 The Fractal Relation.- 13.7.4 Covariance and Contravariance.- 13.8 OPM Metamodeling Issues.- 13.8.1 AMetamodelofThing.- 13.8.2 The Specialization-Specification Hierarchy.- 13.8.3 A Refined Generic Processing Model.- 13.8.4 Time Exception Handling.- 13.9 The OPM Construct Hierarchy.- Summary.- Problems.- 14 Systems Theory.- 14.1 The Informatics Hierarchy.- 14.1.1 Computers Are Climbing the Informatics Hierarchy.- 14.1.2 Knowledge and Understanding.- 14.2 Ontology.- 14.3 General Systems Theory.- 14.3.1 A Brief History of General Systems Theory.- 14.3.2 The Hierarchy of System Levels.- 14.4 Autopoietic vs. Allopoietic Systems.- 14.5 Systems and Humans.- 14.6 Systems Theory Characteristics.- 14.6.1 Previously Defined Characteristics.- 14.6.2 System, Environment and Beneficiaries.- 14.6.3 Control and Feedback.- 14.7 Classical Physics vs. Quantum Theory.- 14.7.1 Visualization.- 14.7.2 Causality.- 14.7.3 Locality.- 14.7.4 Self-Identity.- 14.7.5 Objectivity.- 14.8 Objectifying: Converting a Process into an Object.- Summary.- Problems.- 15 Object-Oriented Modeling.- 15.1 The Evolution of System Analysis Methods.- 15.1.1 Data Flow Diagrams.- 15.1.2 Entity-Relationship Diagrams and Their Combination with DFD.- 15.1.3 The Object-Oriented Paradigm.- 15.2 Pre-UML Object-Oriented Methods.- 15.2.1 Object Modeling Technique.- 15.2.2 Object-Oriented Software Engineering.- 15.2.3 Object-Oriented Analysis and Object-Oriented Design.- 15.2.4 Object-Oriented Systems Analysis.- 15.2.5 Object-Oriented Analysis & Design.- 15.2.6 Object Life-Cycles.- 15.2.7 The Booch Method.- 15.2.8 MOSES.- 15.2.9 The Fusion Method.- 15.2.10 OPEN Modeling Language.- 15.3 Unified Modeling Language-UML.- 15.4 Metamodeling in OO Methods.- 15.5 OO Methods - A Summary.- 15.6 Software Development Approaches and Trends.- 15.6.1 Aspect-Oriented Programming.- 15.6.2 The Rational Unified Process.- 15.6.3 Extreme Programming.- 15.6.4 Agile Modeling.- 15.7 Challenges for OO Methods.- 15.7.1 A Historic Perspective.- 15.7.2 The Encapsulation Challenge.- 15.7.3 The Model Multiplicity Challenge.- 15.7.4 Empirical Evidence of the Model Multiplicity Problem.- 15.7.5 The Complexity Management Challenge.- 15.8 OPM and OO.- 15.8.1 The UML 2.0 Initiative.- 15.8.2 Systemantica: an OPM Supporting Tool.- 15.8.3 OPM Applications and Research: Present and Future.- Summary.- Problems.- Appendix A: The ATM System.- References.

    1 in stock

    £47.49

  • Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

    Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy

    1 in stock

    Book SynopsisParameterized Complexity in the Polynomial Hierarchy was co-recipient of the E.W. Beth Dissertation Prize 2017 for outstanding dissertations in the fields of logic, language, and information. This work extends the theory of parameterized complexity to higher levels of the Polynomial Hierarchy (PH). For problems at higher levels of the PH, a promising solving approach is to develop fixed-parameter tractable reductions to SAT, and to subsequently use a SAT solving algorithm to solve the problem. In this dissertation, a theoretical toolbox is developed that can be used to classify in which cases this is possible. The use of this toolbox is illustrated by applying it to analyze a wide range of problems from various areas of computer science and artificial intelligence.Table of ContentsComplexity Theory and Non-determinism.- Parameterized Complexity Theory.- Fpt-Reducibility to SAT.- The Need for a New Completeness Theory.- A New Completeness Theory.- Fpt-algorithms with Access to a SAT Oracle.- Problems in Knowledge Representation and Reasoning.- Model Checking for Temporal Logics.- Problems Related to Propositional Satisfiability.- Problems in Judgment Aggregation.- Planning Problems.- Graph Problems.- Relation to Other Topics in Complexity Theory.- Subexponential-Time Reductions.- Non-Uniform Parameterized Complexity.- Open Problems and Future Research Directions.- Conclusion.- Compendium of Parameterized Problems.- Generalization to Higher Levels of the Polynomial Hierarchy.

    1 in stock

    £62.99

© 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