Mathematical theory of computation Books

Book SynopsisThis textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why. The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. The author then shows how advanced, graph colouring techniques can be applied to classic real-world operational research problems such as designing seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by an online suite of downloadable code. The book is of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. The reader should have elementary knowledge of sets, matrices, and enumerative combinatorics.Table of Contents1. Introduction to Graph Colouring.- 2. Bounds and Constructive Algorithms.- 3. Advanced Techniques for Graph Colouring.- 4. Algorithm Case Studies.- 5. Applications and Extensions.- 6. Designing Seating Plans.- 7. Designing Sports Leagues.- 8. Designing University Timetables.

Read more less

Book SynopsisThis survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of “mechanical process” using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarski’s theorem on the non-representability of truth, Goedel’s incompleteness and Rosser’s incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church’s thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oracle computations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum’s complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions.Trade Review“This textbook is suited for self-study … . As a second reading however a reader interested in rigorous proofs and/or different approaches to known concepts will benefit from this wealth of material.” (Dieter Riebesehl, zbMATH 1507.03002, 2023)Table of ContentsMathematical Background; a Review.- A Theory of Computability.- Primitive Recursive Functions.- Loop Programs.-The Ackermann Function.- (Un)Computability via Church's Thesis.- Semi-Recursiveness.- Yet another number-theoretic characterisation of P.- Godel's Incompleteness Theorem via the Halting Problem.- The Recursion Theorem.- A Universal (non-PR) Function for PR.- Enumerations of Recursive and Semi-Recursive Sets.- Creative and Productive Sets Completeness.- Relativised Computability.- POSSIBILITY: Complexity of P Functions.- Complexity of PR Functions.- Turing Machines and NP-Completeness.

Read more less

Book SynopsisThis survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of “mechanical process” using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarski’s theorem on the non-representability of truth, Goedel’s incompleteness and Rosser’s incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church’s thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oracle computations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum’s complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions.Trade Review“This textbook is suited for self-study … . As a second reading however a reader interested in rigorous proofs and/or different approaches to known concepts will benefit from this wealth of material.” (Dieter Riebesehl, zbMATH 1507.03002, 2023)Table of ContentsMathematical Background; a Review.- A Theory of Computability.- Primitive Recursive Functions.- Loop Programs.-The Ackermann Function.- (Un)Computability via Church's Thesis.- Semi-Recursiveness.- Yet another number-theoretic characterisation of P.- Godel's Incompleteness Theorem via the Halting Problem.- The Recursion Theorem.- A Universal (non-PR) Function for PR.- Enumerations of Recursive and Semi-Recursive Sets.- Creative and Productive Sets Completeness.- Relativised Computability.- POSSIBILITY: Complexity of P Functions.- Complexity of PR Functions.- Turing Machines and NP-Completeness.

Read more less

Book SynopsisThis book integrates the foundations of quantum computing with a hands-on coding approach to this emerging field; it is the first to bring these elements together in an updated manner. This work is suitable for both academic coursework and corporate technical training.The second edition includes extensive updates and revisions, both to textual content and to the code. Sections have been added on quantum machine learning, quantum error correction, Dirac notation and more. This new edition benefits from the input of the many faculty, students, corporate engineering teams, and independent readers who have used the first edition.This volume comprises three books under one cover: Part I outlines the necessary foundations of quantum computing and quantum circuits. Part II walks through the canon of quantum computing algorithms and provides code on a range of quantum computing methods in current use. Part III covers the mathematical toolkit required to master quantum computing. Additional resources include a table of operators and circuit elements and a companion GitHub site providing code and updates.Jack D. Hidary is a research scientist in quantum computing and in AI at Alphabet X, formerly Google X. Trade Review“This well-put-together book is a valuable addition to the literature in the field.” (Shrisha Rao, Computing Reviews, February 3, 2023)Table of Contents-Preface the the Second Edition.- Preface to the First Edition.- Acknowledgements.- Navigating this Book.- I. Foundations.- 1. Superposition, Entanglement and Reversibility.- 2. A Brief History of Quantum Computing.- 3. Qubits, Operators and Measurement.- 4. Complexity Theory.- II. 5. Building a Quantum Computer.- 6. Development Libraries for Quantum Computer Programming.- 7. Teleportation, Superdense Coding and Bell’s Inequality.- 8. The Canon: Code Walkthroughs.- 9. Quantum Computing Methods.- 10. Applications and Quantum Supremacy.- III. Toolkit.- 11. Mathematical Tools for Quantum Computing I.- 12. Mathematical Tools for Quantum Computing II.- 13. Mathematical Tools for Quantum Computing III.- 14. Dirac Notation.- 15. Table of Quantum Operators and Core Circuits.- Works Cited.- Index.

Read more less

Book SynopsisThis book constitutes the proceedings of the 18th International Colloquium on Theoretical Aspects of Computing, ICTAC 2021, organized by the Nazarbayev University, Nur-Sultan, Kazakhstan. The event was supposed to take place in Nur-Sultan, Kazakhstan, but due to COVID-19 pandemic is was held virtually. The 15 papers presented in this volume were carefully reviewed and selected from 40 submissions. The book also contains one invited talk in full paper length. The book deals with challenges in both theoretical aspects of computing and the exploitation of theory through methods and tools for system development. The 20 full papers presented in this volume were carefully reviewed and selected from 55 submissions. The papers cover a wide variety of topics, including: getting the best price for selling your personal data; attacking Bitcoin; optimizing various forms of model checking; synthesizing and learning algorithms; formalizing and verifying contracts, languages, and compilers; analyzing the correctness and complexity of programs and distributed systems; and finding connections from proofs in propositional logic to quantum programming languages.Table of ContentsConcurrency and Objects Matter! Disentangling the Fabric of Real Operational Processes to Create Digital Twins.- Qualitative–Quantitative Reasoning: thinking informally about formal things.- Model Checking and Machine Learning Joining Forces in Uppaal.- Databases and Distributed Transactions Some Aspects of the Database Resilience.- On the Correctness Problem for Serializability.- Efficient Model Checking Methods A Set Automaton to Locate All Pattern Matches in a Term.- Groote Accelerating SpMV Multiplication in Probabilistic Model Checkers using GPUs.- A divide & conquer approach to conditional stable model checking.- Formalization and Verification in Coq and Isabelle Certifying Choreography Compilation.- Mechanically Verified Theory of Contracts.- A Complete Semantics of K and Its Translation to Isabelle.- Quantum Computing A New Connective in Natural Deduction, and its Application to Quantum Computing.- Security and Privacy An Incentive Mechanism for Trading Personal Data in Data Markets.- Palamidessi Assessing Security of Crypto-Currencies with Attack-Defense Trees: Proof of Concept and Future Directions.- Compositional Analysis of Protocol Equivalence in the Applied π-calculus using Quasi-Open Bisimilarity.- Card-based Cryptographic Protocols with a Standard Deck of Cards Using Private Operations.- Ono Normalising Lustre Preserves Security.- Synthesis and Learning Learning Probabilistic Automata using Residuals.- Deductive Synthesis of Sorting Algorithms in Theorema.- Reactive Synthesis from Visibly Register Pushdown Automata.- Systems Calculi and Analysis ComplexityParser: an automatic tool for certifying poly-time complexity of Java programs.- A Calculus for Attribute-based Memory Updates.- A Proof Method for Local Sufficient Completeness of Term Rewriting Systems.

Read more less

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.-

Read more less

This textbook discusses the design and implementation of basic algebraic graph algorithms, and algebraic graph algorithms for complex networks, employing matroids whenever possible. The text describes the design of a simple parallel matrix algorithm kernel that can be used for parallel processing of algebraic graph algorithms. Example code is presented in pseudocode, together with case studies in Python and MPI. The text assumes readers have a background in graph theory and/or graph algorithms.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 6th International Conference on Belief Functions, BELIEF 2021, held in Shanghai, China, in October 2021. The 30 full papers presented in this book were carefully selected and reviewed from 37 submissions. The papers cover a wide range on theoretical aspects on mathematical foundations, statistical inference as well as on applications in various areas including classification, clustering, data fusion, image processing, and much more.Table of ContentsClustering.- Transfer learning.- Classification.- Statistical inference and learning.- Deep learning.- Conflict, inconsistency and specificity.- Information fusion.- Elicitation.- Algorithms and computation.

Read more less

Book SynopsisThis book constitutes the proceedings of the 41st SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, AI 2021, which was supposed to be held in Cambridge, UK, in December 2021. The conference was held virtually due to the COVID-19 pandemic.The 22 full papers and 10 short papers presented in this volume were carefully reviewed and selected from 37 submissions. The volume includes technical papers presenting new and innovative developments in the field as well as application papers presenting innovative applications of AI techniques in a number of subject domains. The papers are organized in the following topical sections: technical paper; machine learning; AI techniques; short technical stream papers; application papers; applications of machine learning; AI for medicine; advances in applied AI; and short application stream papers. Table of ContentsTechnical Papers.- On the Generalization Abilities of Fine-Tuned Commonsense Language Representation Models (Best Technical Paper).- Machine Learning.- Generation of Human-aware Navigation Maps using Graph Neural Networks.- Extended Category Learning with Spiking Nets and Spike Timing Dependent Plasticity.- ORACLE: End-to-end Model Based Reinforcement Learning.- Towards Explaining Metaheuristic Solution Quality by Data Mining Surrogate Fitness Models for Importance of Variables.- AI Techniques.- Assessing the Impact of Agents in Weighted Bipolar Argumentation Frameworks.- Towards Explainable Metaheuristics: PCA for Trajectory Mining in Evolutionary Algorithms.- AI Methods of Autonomous Geological Target Selection in the Hunt for Signs of Extraterrestrial Life.- Probabilistic Rule Induction for Transparent CBR under Uncertainty.- Short Technical Stream Papers.- Detection of Brain Tumour using Deep Learning.- GaussianProductAttributes: Density-based Distributed Representations for Products.- Modelling Emotion Dynamics in Chatbots with Neural Hawkes Processes.- Knowledge-Based Composable Inductive Programming.- Named Entity Recognition and Relation Extraction for COVID-19: Explainable Active Learning with word2vec Embeddings and Transformer-based BERT Models.- Application Papers.- Patients Forecasting in Emergency Services by using Machine Learning and Exogenous variables (Best Application Paper).- Applications of Machine Learning.- Automatic Information Extraction from Electronic Documents using Machine Learning.- Modelling Satellite Data for Automobile Insurance Risk.- Ranking Pathology Data in the Absence of a Ground Truth.- Evolving Large Scale Prediction Models for Vehicle Volume Forecasting in Service Stations.- AI for Medicine.- Sequential Association Rule Mining Revisited: A Study Directed at Relational Pattern Mining for Multi-morbidity.- Addressing the Challenge of Data Heterogeneity using a Homogeneous Feature Vector Representation.- Context-aware Support for Cardiac Health Monitoring using Federated Machine Learning.- Using Automated Feature Selection for Building Case-Based Reasoning Systems: An Example from Patient-Reported Outcome Measurements.- Advances in Applied AI.- A Live-User Evaluation of a Visual Module Recommender & Advisory System for Undergraduate Students.- AdverseGen: A Practical Tool for Generating Adversarial Examples to Deep Neural Networks Using Black-box Approaches.- Adaptive Maneuver Planning for Autonomous Vehicles using Behavior Tree on Apollo Platform.- Behavioural User Identification from Clickstream Data for Business Improvement.- Short Application Stream Papers.- AI enabled Bio Waste Contamination-Scanner.- Parkinson's Disease Tremor Severity Classification - A Comparison Between ON and OFF Medication State.- Towards Publishing Ontology-based Data Quality Metadata of Open Data.- Towards a Brain Controller Interface for Generating Simple Berlin School Style Music with Interactive Genetic Algorithms.

Read more less

Book SynopsisThis book covers the latest advances in applying agent-based modelling in social sciences. The Social Simulation Conference is the major global conference devoted to this topic. It is aimed at promoting social simulation and computational social science. This year’s special theme is “Social Simulation geared towards Post-Pandemic times”, focused not only on questions raised by the current pandemic but also on future challenges related to economic recovery, such as localization, globalization, inequality, sustainable growth and social changes induced by progressive digitalization, data availability and artificial intelligence. The primary audience of this book are scholars and practitioners in computational social sciences including economics, business, sociology, politics, psychology and urban studies.Table of ContentsThis year’s special theme will be “Social Simulation geared towards Post-Pandemic times”, focused not only on questions raised by the current pandemic but also on future challenges related to economic recovery, such as localisation, globalization, inequality, sustainable growth and social changes induced by progressive digitalisation, data availability and artificial intelligence.

Read more less

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.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 13th International Tbilisi Symposium on Logic, Language and Computation, TbiLLC 2019, held in Batumi, Georgia, in September 2019. The volume contains 17 full revised papers presented at the conference from 17 submissions. The scientific program consisted of tutorials, invited lectures, contributed talks, and two workshops. The symposium offered two tutorials in language and logic and aimed at students as well as researchers working in the other areas: · Language: Sign language linguistics. State of the art, by Fabian Bross (University of Stuttgart, Germany) · Logic: Axiomatic Semantics, by Graham E. Leigh (University of Gothenburg, Sweden)Table of ContentsLanguage and Logic.- Logic and Computation.- Mathematical Logic.- Computational Linguistics.- Semantics.- Georgian.- German.

Read more less

Book SynopsisThis open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.

Read more less

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

Read more less

Book SynopsisThis open access book constitutes the proceedings of the 25th International Conference on Fundamental Approaches to Software Engineering, FASE 2022, which was held during April 4-5, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 17 regular papers presented in this volume were carefully reviewed and selected from 64 submissions. The proceedings also contain 3 contributions from the Test-Comp Competition. The papers deal with the foundations on which software engineering is built, including topics like software engineering as an engineering discipline, requirements engineering, software architectures, software quality, model-driven development, software processes, software evolution, AI-based software engineering, and the specification, design, and implementation of particular classes of systems, such as (self-)adaptive, collaborative, AI, embedded, distributed, mobile, pervasive, cyber-physical, or service-oriented applications.Table of ContentsFASE Contributions.- Information-flow Interfaces.- A Survey-Based Feature Model for Software Traceability.- Construction of Veri er Combinations Based on Off-the-Shelf Verifiers.- On the Detection of Doped Software by Falsification.- Estimating Worst-case Resource Usage by Resource-usage-aware Fuzzing.- Quantitative Program Sketching using Lifted Static Analysis.- SixthSense: Debugging Convergence Problems in Probabilistic Programs via Program Representation Learning.- Finding Semantic Bugs Fast.- SMC4PEP: Stochastic Model Checking of Product Engineering Processes.- Symbolic Predictive Cache Analysis for Out-of-Order Execution.- PEQtest: Testing Functional Equivalence.- An Institutional Approach to Communicating UML State Machines.- Semantic Code Search in Software Repositories using Neural Machine Translation.- AequeVox: Automated Fairness Testing of Speech Recognition Systems.- SMT-Based Planning Synthesis for Distributed System Reconfigurations.- Semantic Clone Detection via Probabilistic Software Modeling.- QMaxUSE: A Query-based Verification Tool for UML Class Diagrams with OCL Invariants.- Test-Comp Contributions.- Advances in Automatic Software Testing: Test-Comp 2022.- FuSeBMC v4: Smart Seed Generation for Hybrid Fuzzing (Competition Contribution).- VeriFuzz: Good Seeds for Fuzzing (Competition Contribution).

Read more less

Book SynopsisThis open access book constitutes the proceedings of the 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022, which was held during April 2-7, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 46 full papers and 4 short papers presented in this volume were carefully reviewed and selected from 159 submissions. The proceedings also contain 16 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, exibility, and efficiency of tools and algorithms for building computer-controlled systems. Table of ContentsProbabilistic Systems.- A Probabilistic Logic for Verifying Continuous-time Markov Chains.- Under-Approximating Expected Total Rewards in POMDPs.- Correct Probabilistic Model Checking with Floating-Point Arithmetic.- Correlated Equilibria and Fairness in Concurrent Stochastic Games.- Omega Automata.- A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.- Practical Applications of the Alternating Cycle Decomposition.- Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation.- On-The-Fly Solving for Symbolic Parity Games.- Equivalence Checking.- Distributed Coalgebraic Partition Refinement.- From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques.- Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time.- Monitoring and Analysis.- A Theoretical Analysis of Random Regression Test Prioritization.- Verified First-Order Monitoring with Recursive Rules.- Maximizing Branch Coverage with Constrained Horn Clauses.- Efficient Analysis of Cyclic Redundancy Architectures via Boolean Fault Propagation.- Tools | Optimizations, Repair and Explainability.- Adiar: Binary Decision Diagrams in External Memory.- Forest GUMP: A Tool for Explanation.- Alpinist: an Annotation-Aware GPU Program Optimizer.- Automatic Repair for Network Programs.- 11th Competition on Software Verification | SV-COMP 2022.- Progress on Software Verification: SV-COMP 2022.- AProVE: Non-Termination Witnesses for C Programs (Competition Contribution).- BRICK: Path Enumeration Based Bounded Reachability Checking of C Program (Competition Contribution).- A Prototype for Data Race Detection in CSeq 3 (Competition Contribution).- Dartagnan: SMT-based Violation Witness Validation (Competition Contribution).- Deagle: An SMT-based Veri er for Multi-threaded Programs (Competition Contribution).- The Static Analyzer Frama-C in SV-COMP (Competition Contribution).- GDart: An Ensemble of Tools for Dynamic Symbolic Execution on the Java Virtual Machine (Competition Contribution).- Graves-CPA: A Graph-Attention Veri er Selector (Competition Contribution).- GWIT: A Witness Validator for Java based on GraalVM (Competition Contribution).- The Static Analyzer Infer in SV-COMP (Competition Contribution).- LART: Compiled Abstract Execution (Competition Contribution).- Symbiotic 9: String Analysis and Backward Symbolic Execution with Loop Folding (Competition Contribution).- Symbiotic-Witch: A Klee-Based Violation Witness Checker (Competition Contribution).- Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection.- Ultimate GemCutter and the Axes of Generalization (Competition Contribution).- Wit4Java: A Violation-Witness Validator for Java Verifiers (Competition Contribution).

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 10th European Conference on Artificial Intelligence in Music, Sound, Art and Design, EvoMUSART 2022, held as part of Evo* 2022, in April 2022, co-located with the Evo* 2022 events, EvoCOP, EvoApplications, and EuroGP. The 20 full papers and 6 short papers presented in this book were carefully reviewed and selected from 66 submissions. They cover a wide range of topics and application areas, including generative approaches to music and visual art, deep learning, and architecture.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 10th International Conference on Culture and Computing, C&C 2022, held as part of the 23rd International Conference, HCI International 2022, which was held virtually in June/July 2022. The total of 1271 papers and 275 posters included in the HCII 2022 proceedings was carefully reviewed and selected from 5487 submissions. The C&C 2022 proceedings presents topics such as User Experience, Culture, and Technology, Culture and Computing in Arts and Music and preservation and fruition of cultural heritage, as well as developing and shaping future cultures.Table of ContentsUser Experience, Culture, and Technology.- Interactions with Tangible and Intangible Cultural Heritage.- Culture and Computing in Arts and Music.- Reflections on ICT and Culture.

Read more less

Book SynopsisThe 3-volume set LNAI 13280, LNAI 13281 and LNAI 13282 constitutes the proceedings of the 26th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2022, which was held during May 2022 in Chengdu, China. The 121 papers included in the proceedings were carefully reviewed and selected from a total of 558 submissions. They were organized in topical sections as follows: Part I: Data Science and Big Data Technologies, Part II: Foundations; and Part III: Applications.Table of ContentsData Science.- Big Data.- Data mining. Model selection,.- Biological data.- IoT data,.- Deep learning. Meta-learning.- Security.- Privacy.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 17th International Conference on Integrated Formal Methods, IFM 2022, held in Lugano, Switzerland, in June 2022. The 14 full papers and 2 short papers were carefully reviewed and selected from 46 submissions. The papers are categorized into the following topical sub-headings: Invited Papers; Cooperative and Relational Verification; B Method; Time; Probability; learning and Synthesis; Security; Stats Analysis and Testing; PhD Symposium Presentations.

Read more less

Book SynopsisThis book constitutes the proceedings of the 19th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2022, which was held in Los Angeles, CA, USA, in June 2022.The 28 regular papers presented were carefully reviewed and selected from a total of 60 submissions. The conference program included a Master Class on the topic "Bridging the Gap between Machine Learning and Optimization”.Table of ContentsA Two-Phase Hybrid Approach for the Hybrid Flexible Flowshop with Transportation Times.- A SAT Encoding to compute Aperiodic Tiling Rhythmic Canons.- Transferring Information across Restarts in MIP.- Towards Copeland Optimization in Combinatorial Problems.- Coupling Different Integer Encodings for SAT.- Model-Based Algorithm Configuration with Adaptive Capping and Prior Distributions.- Shattering Inequalities for Learning Optimal Decision Trees.- Learning Pseudo-Backdoors for Mixed Integer Programs.- Leveraging Integer Linear Programming to Learn Optimal Fair Rule Lists.- Solving the Job Shop Scheduling Problem extended with AGVs – Classical and Quantum Approaches.- Stochastic Decision Diagrams.- Improving the robustness of EPS to solve the TSP.- Efficient operations between MDDs and constraints.- Deep Policy Dynamic Programming for Vehicle Routing Problems.- Learning a Propagation Complete Formula.- A FastMap-Based Algorithm for Block Modeling.- Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock Problem.- Dealing with the product constraint.- Multiple-choice knapsack constraint in graphical models.- A Learning Large Neighborhood Search for the Staff Rerostering Problem.- Practically Uniform Solution Sampling in Constraint Programming.- Training Thinner and Deeper Neural Networks: Jumpstart Regularization.- Hybrid Offline/Online Optimization for Energy Management via Reinforcement Learning.- Enumerated Types and Type Extensions for MiniZinc.- A parallel algorithm for generalized arc-consistent filtering for the Alldifferent constraint.- Analyzing the Reachability Problem in Choice Networks.- Model-based Approaches to Multi-Attribute Diverse Matching.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 42nd IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2022, held in Lucca, Italy, in June 2022, as part of the 17th International Federated Conference on Distributed Computing Techniques, DisCoTec 2022.The 12 regular papers presented were carefully reviewed and selected from 28 submissions. They cover topics such as: software quality, reliability, availability, and safety; security, privacy, and trust in distributed and/or communicating systems; service-oriented, ubiquitous, and cloud computing systems; component-and model-based design; object technology, modularity, and software adaptation; self-stabilisation and self-healing/organising; and verification, validation, formal analysis, and testing of the above.

Read more less

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.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 12th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2022, held in Helsinki, Finland, in June 2022. The 13 full papers presented were carefully reviewed and selected from 21 submissions. The papers address various topics such as information and knowledge systems, including submissions that apply ideas, theories or methods from specific disciplines to information and knowledge systems. Examples of such disciplines are discrete mathematics, logic and algebra, model theory, databases, information theory, complexity theory, algorithmics and computation, statistics and optimization.Table of ContentsOn Sampling Representatives of Relational Schemas with a Functional Dependency.- On the expressive power of message-passing neural networks as global feature map transformers.- Assumption-Based Argumentation for Extended Disjunctive Logic Programming.- A graph based semantics for Logical Functional Diagrams in power plant controllers.- Database Repair via Event-Condition-Action Rules in Dynamic Logic.- Statistics of RDF store for querying knowledge graphs.- Can you answer while you wait?.- The implication problem for functional dependencies and variants of marginal distribution equivalences.- Approximate Keys and Functional Dependencies in Incomplete Databases With Limited domains.- The Fault-Tolerant Cluster-Sending Problem.- Optimizing multiset relational algebra queries using weak-equivalent rewrite rules.- Properties of System W and its Relationships to Other Inductive Inference Operators.- Towards the Evaluation of Action Reversibility in STRIPS using Domain Generators.

Read more less

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.

Read more less

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.

Read more less

Book SynopsisThis book constitutes selected papers from the refereed proceedings of the 14th International Workshop on Rewriting Logic and Its Applications, WRLA 2022, held in Munich, Germany, in April 2022.The 9 full papers included in this book were carefully reviewed and selected from 13 submissions. They focus on topics in rewriting logic and its applications. The book also contains 2 invited papers, 2 invited tutorials and an experience report.Table of Contents​Invited Papers.- From Static to Dynamic Analysis and Allocation of Resources for BPMN Processes.- Rewriting Privacy.- Invited Tutorials and Experience Report.- Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method.- An Overview of the Maude Strategy Language and its Applications.- Teaching Formal Methods to Undergraduate Students Using Maude.- Regular Papers.- Business Processes Analysis with Resource-aware Machine Learning Scheduling in Rewriting Logic.- Modeling, Algorithm Synthesis, and Instrumentation for Co-simulation in Maude.- An Efficient Canonical Narrowing Implementation for Protocol Analysis.- Checking Sufficient Completeness by Inductive Theorem Proving.- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies.- Automating Safety Proofs about Cyber-Physical Systems using Rewriting Modulo SMT.- Executable Semantics and Type Checking for Session-Based Concurrency in Maude.- Tool Papers.- Parallel Maude-NPA for Cryptographic Protocol Analysis.- Maude as a Library: An Efficient All-Purpose Programming Interface.

Read more less

Book SynopsisThis two-volume set LNCS 13398 and LNCS 13399 constitutes the refereed proceedings of the 17th International Conference on Parallel Problem Solving from Nature, PPSN 2022, held in Dortmund, Germany, in September 2022.The 87 revised full papers were carefully reviewed and selected from numerous submissions. The conference presents a study of computing methods derived from natural models. Amorphous Computing, Artificial Life, Artificial Ant Systems, Artificial Immune Systems, Artificial Neural Networks, Cellular Automata, Evolutionary Computation, Swarm Computing, Self-Organizing Systems, Chemical Computation, Molecular Computation, Quantum Computation, Machine Learning, and Artificial Intelligence approaches using Natural Computing methods are just some of the topics covered in this field.Table of ContentsAutomated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods.- Improving Nevergrad's Algorithm Selection Wizard NGOpt through Automated Algorithm Configuration.- Non-Elitist Selection Can Improve the Performance of Irace.- Per-run Algorithm Selection with Warm-starting using Trajectory-based Features.- Efficient Approximation of Expected Hypervolume Improvement using Gauss-Hermite Quadrature.- A Systematic Approach to Analyze the Computational Cost of Robustness in Model-Assisted Robust Optimization.- Adaptive Function Value Warping for Surrogate Model Assisted Evolutionary Optimization.- Finding Knees in Bayesian Multi-Objective Optimization.- High Dimensional Bayesian Optimization with Kernel Principal Component Analysis.- Single Interaction Multi-Objective Bayesian Optimization.- Surrogate-assisted LSHADE algorithm utilizing Recursive Least Squares filter.- Towards Efficient Multiobjective Hyperparameter Optimization: A Multiobjective Multi-Fidelity Bayesian Optimization and Hyperband Algorithm.- A Continuous Optimisation Benchmark Suite from Neural Network Regression.- BBE: Basin-Based Evaluation of Multimodal Multi-Objective Optimization Problems.- Evolutionary Approaches to Improving the Layouts of Instance-Spaces.- A novelty-search approach to filling an instance-space with diverse and discriminatory instances for the knapsack problem.- Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem.- Computing High-Quality Solutions for the Patient Admission Scheduling Problem using Evolutionary Diversity Optimisation.- Cooperative Multi-Agent Search on Endogenously-Changing Fitness Landscapes.- Evolutionary Algorithm for Vehicle Routing with Diversity Oscillation Mechanism.- Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits.- Self-adaptation via Multi-objectivisation: An Empirical Study.- The Combined Critical Node and Edge Detection Problem. An Evolutionary Approach.- Attention-Based Genetic Algorithm for Adversarial Attack in Natural Language Processing.- Deep Reinforcement Learning with Two-Stage Training Strategy for Practical Electric Vehicle Routing Problem with Time Windows.- Evolving Through the Looking Glass: Learning Improved Search Spaces with Variational Autoencoders.- Generalization and Computation for Policy Classes of Generative Adversarial Imitation Learning.- Generative Models over Neural Controllers for Transfer Learning.- HVC-Net: Deep Learning based Hypervolume Contribution Approximation.- Multi-objective Evolutionary Ensemble Pruning Guided by Margin Distribution.- Revisiting Attention-based Graph Neural Networks for Graph Classification.- Robust Neural Network Pruning by Cooperative Coevolution.- SemiGraphFL: Semi-Supervised Graph Federated Learning.- Evolutionary Design of Reduced Precision Preprocessor for Levodopa-Induced Dyskinesia Classifier.- In-Materio Extreme Learning Machines.- On the impact of the duration of evaluation episodes on the evolution of adaptive robots.- Analysing the Fitness Landscape Rotation for Combinatorial Optimisation.- Analysis of Search Landscape Samplers for Solver Performance Prediction on a University Timetabling Problem.- Fractal Dimension and Perturbation Strength: A Local Optima Networks View.- HPO X ELA: Investigating Hyperparameter Optimization Landscapes by Means of Exploratory Landscape Analysis.- Increasing the Diversity of Benchmark Function Sets through Affine Recombination.- Neural Architecture Search: A Visual Analysis. - Digging into Semantics: Where do search-based software repair methods search?.- Gene-pool Optimal Mixing in Cartesian Genetic Programming.- Genetic programming for combining directional changes indicators in international stock markets.- Importance-Aware Genetic Programming for Automated Scheduling Heuristics Learning in Dynamic Flexible Job Shop Scheduling.- Towards Discrete Phenotypic Recombination in Cartesian Genetic Programming.- A general architecture for generating interactive decomposition-based MOEAs.- An Exact Inverted Generational Distance for Continuous Pareto Front.- Direction Vector Selection for R2-based Hypervolume Contribution Approximation.- Do We Really Need to Use Constraint Violation in Constrained Evolutionary Multi-Objective Optimization?.- Dynamic Multi-modal Multi-objective Optimization: A Preliminary Study.- Fair Feature Selection with a Lexicographic Multi-Objective Genetic Algorithm.- Greedy Decremental Quick Hypervolume Subset Selection Algorithms.- Hybridizing Hypervolume-based Evolutionary Algorithms and Gradient Descent by Dynamic Resource Allocation.- Identifying Stochastically Non-dominated Solutions Using Evolutionary Computation.- Large-scale multi-objective influence maximisation with network downscaling.- Multi-Objective Evolutionary Algorithm Based on the Linear Assignment Problem and the Hypervolume Approximation using Polar Coordinates (MOEA-LAPCO).- New Solution Creation Operator in MOEA/D for Faster Convergence.- Obtaining Smoothly Navigable Approximation Sets in Bi-Objective Multi-Modal Optimization.- T-DominO: Exploring Multiple Criteria with Quality-Diversity and the Tournament Dominance Objective.- Recombination Weight based Selection in the DTS-CMA-ES.- The (1+1)-ES Reliably Overcomes Saddle Points.- Collective Learning of Low-Memory Matrix Adaptation for Large-Scale Black-Box Optimization.- Evolutionary Time-Use Optimization for Improving Children's Health Outcomes.- Iterated Local Search for the eBuses Charging Location Problem.- Multi-view clustering of heterogeneous health data: Application to systemic sclerosis.- Specification-Driven Evolution of Floor Plan Design.- Surrogate-assisted Multi-objective Optimization for Compiler Optimization Sequence Selection.- A First Runtime Analysis of the NSGA-II on a Multimodal Problem.- Analysis of Quality Diversity Algorithms for the Knapsack Problem.- Better Running Time of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) by Using Stochastic Tournament Selection.- Escaping Local Optima With Local Search: A Theory-Driven Discussion.- Evolutionary Algorithms for Cardinality-Constrained Ising Models.- General Univariate Estimation-of-Distribution Algorithms.- Population Diversity Leads to Short Running Times of Lexicase Selection.- Progress Rate Analysis of Evolution Strategies on the Rastrigin Function: First Results.- Running Time Analysis of the (1+1)-EA using Surrogate Models on OneMax and LeadingOnes.- Runtime Analysis of Simple Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem.- Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions.- Runtime Analysis of Unbalanced Block-Parallel Evolutionary Algorithms.- Self-adjusting Population Sizes for the (1, λ)-EA on Monotone Functions.- Theoretical Study of Optimizing Rugged Landscapes with the cGA.- Towards Fixed-Target Black-Box Complexity Analysis.- Two-Dimensional Drift Analysis: Optimizing Two Functions Simultaneously Can Be Hard.

Read more less

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.

Read more less

Book SynopsisThis book constitutes the proceedings of the 23rd International Conference on Formal Engineering Methods, ICFEM 2022, held in Madrid, Spain, in October 2022. The 16 full and 4 short papers presented together with 1 doctoral symposium paper in this volume were carefully reviewed and selected from 41 submissions. The papers cover for research in all areas related to formal engineering methods, such as verification and validation, software engineering, formal specification and modeling, software security, and software reliability.Table of ContentsModel checking quantum Markov chains.- Bridging Formal Methods and Machine Learning with Global Optimisation.- Canonical Narrowing for Variant-based Conditional Rewrite Theories.- Modular Analysis of Tree-Topology Models.- Non-linear optimization methods for learning regular distributions.- Separation of concerning things: a simpler basis for defining and programming with the C\C++ memory model.- Creusot: a Foundry for the Deductive Verification of Rust Programs.- Generation of a Reversible Semantics for Erlang in Maude.- Program slicing techniques with support for unconditional jumps.- Formal verification of the inter-core synchronization of a multi-core RTOS kernel.- SMT-Based Model Checking of Industrial Simulink Models.- PFMC: A Parallel Symbolic Model Checker for Security Protocol Verification.- A Formal Methodology for Verifying Side-channel Vulnerabilities in Cache Architectures.- Refined Modularization for Bounded Model Checking through Precondition Generation.- TTT/ik: Learning Accurate Mealy Automata Efficiently with an Imprecise Symbol Filter.- A Proof System for Cyber-physical Systems with Shared-Variable Concurrency.- Theorem proving for Maude specifications using Lean.- On How to Not Prove Faulty Controllers Safe in Differential Dynamic Logic.- Declassification predicates for controlled information release.- Trace Refinement in B and Event-B.- Model Checking B Models via High-level Code Generation.- On Probabilistic Extension of The Interaction Theory.- Extracting Weighted Finite Automata from Recurrent Neural Networks for Natural Languages.- RoboCert: Property Specification in Robotics.- Formally Verified Animation for RoboChart using Interaction Trees.- Machine-checked executable semantics of Stateflow.

Read more less

Book SynopsisThe book is designed to serve as a textbook for advanced undergraduate and graduate students enrolled in physics and electronics and communication engineering and mathematics. The book provides an introduction to Fourier optics in light of new developments in the area of computational imaging over the last couple of decades. There is an in-depth discussion of mathematical methods such as Fourier analysis, linear systems theory, random processes, and optimization-based image reconstruction techniques. These techniques are very much essential for a better understanding of the working of computational imaging systems. It discusses topics in Fourier optics, e.g., diffraction phenomena, coherent and incoherent imaging systems, and some aspects of coherence theory. These concepts are then used to describe several system ideas that combine optical hardware design and image reconstruction algorithms, such as digital holography, iterative phase retrieval, super-resolution imaging, point spread function engineering for enhanced depth-of-focus, projection-based imaging, single-pixel or ghost imaging, etc. The topics covered in this book can provide an elementary introduction to the exciting area of computational imaging for students who may wish to work with imaging systems in their future careers.Trade Review“This book is addressed mainly to undergraduate and Ph.D. students interested in the topics of Fourier optics and imaging, which are of paramount importance in optics.” (Daniela Dragoman, optica-opn.org, August 10, 2023)Table of ContentsIntroduction.- Fourier series and transform.- Sampling Theorem.- Operational introduction to Fast Fourier Transform.- Linear systems formalism and introduction to inverse problems in imaging.- Constrained optimization methods for image recovery.- Random processes.- Geometrical Optics Essentials .- Wave equation and introduction to diffraction of light.- The angular spectrum method.

Read more less

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.

Read more less

Book SynopsisThis book constitutes the proceedings of the 13th International Conference on Swarm Intelligence, ANTS 2022, held in Málaga, Spain, in November 2022. The 19 full papers presented, together with 14 short papers and 4 extended abstracts were carefully reviewed and selected from 45 submissions. ANTS 2022 contributions are dealing with any aspect of swarm intelligence such as behavioral models of social insects, empirical and theoretical research in swarm intelligence, application of swarm intelligence methods, and much more.Table of ContentsA Geometry-Sensitive Quorum Sensing Algorithm for the Best-of-N Site Selection Problem.- An Approach Based on Particle Swarm Optimization for Inspection of Spacecraft Hulls by a Swarm of Miniaturized Robots.- Automatic Design of Multi-Objective Particle Swarm Optimizers.- Automatic Extraction of Understandable Controllers from Video Observations of Swarm Behaviors.- Benchmarking Performances of Collective Decision-making Strategies with Respect to Communication Bandwidths in Discrete Collective Estimation.- Best-of-N Collective Decisions on a Hierarchy.- Collective Decision-making for Conflict Resolution in Multi-Agent Pathfinding.- Controlling Robot Swarm Aggregation through a Minority of Informed Robots.- Decentralized Multi-Agent Path Finding in Warehouse Environments for Fleets of Mobile Robots with Limited Communication Range.- Decomposition and Merging Co-operative Particle Swarm Optimization with Random Grouping.- Dynamic Spatial Guided Multi-Guide Particle Swarm Optimization Algorithm for Many-Objective Optimization.- Extracting Symbolic Models of Collective Behaviors with Graph Neural Networks and Macro-Micro Evolution.- Learning Resilient Swarm Behaviors via Ongoing Evolution.- Mind the Gap! Predictive Flocking of Aerial Robot Swarm in Cluttered Environments.- Moving Mixtures of Active and Passive Elements with Robots That Do Not Compute.- Real-time Coordination of a Foraging Robot Swarm Using Blockchain Smart Contracts.- Robot Swarms Break Decision Deadlocks in Collective Perception through Cross-inhibition.- Self-Organized Chain Formation of Nano-Drones in an Open Space.- The Hidden Benefits of Limited Communication and Slow Sensing in Collective Monitoring of Dynamic Environments.- A Novel Time-of-Flight Range and Bearing Sensor System for Micro Air Vehicle Swarms.- An Adaptive Metric Model for Collective Motion Structures in Dynamic Environments.- An Extension of the iMOACOR Algorithm Based on Layer-Set Selection.- Binary Particle Swarm Optimization for Selective Cell Switch-Off in Ultra-Dense 5G Networks.- Choeur Synth´etique: an Art Installation Based on Swarm Robotics.- Component Swarm Optimization using Virtual Forces for Solving Layout Problems.- Constant Bearing Flocking.- Distributed Sorting in Complex Environments.- Effect of Different Communication Affordances on the Emergence of Collaboration Strategies in an Online Multiplayer Game.- Generating and Analyzing Collective Step-climbing Behavior in a Multi-legged Robotic Swarm.- Modeling Immune Search through the Lymphatic Network.- Optimization of a Self-organized Collective Motion in a Robotic Swarm.- Response Threshold Distributions to Improve Best-of-N Decisions in Minimalistic Robot Swarms.- Stability-Guided Particle Swarm Optimization.- Animals Are Not Particles: Towards a Second Generation of ‘Hetero-Swarm’ Robotics.- Applying PSO to Find Optimal Strategy for 3D Chip Layout Design.- Particle Swarm Optimization Applied to the Direct Aperture Optimization Problem on Radiotherapy.- Search Space Illumination of Robot Swarm Parameters for Trustworthiness.

Read more less

Book SynopsisThis book gathers the peer-reviewed proceedings of the 15th Annual Meeting of the Bulgarian Section of the Society for Industrial and Applied Mathematics, BGSIAM'20, held in Sofia, Bulgaria. The general theme of BGSIAM'20 was industrial and applied mathematics with particular focus on mathematical physics, numerical analysis, high-performance computing, optimization and control, mathematical biology, stochastic modeling, machine learning, digitization and imaging, advanced computing in environmental, and biomedical and engineering applications.Table of ContentsVera Angelova, Sensitivity of the nonlinear matrix equation.- Adjoint State Optimization Algorithm for Prediction of Honeybee Population Losses.- Study of time series connected to an innovative window heat transfer system.- Coefficient Identification for SEIR Model and Economic Forecasting in the Propagation of COVID–19.- Recovering the Time-Dependent Volatility and Interest Rate in European Options from Nonlocal Price Measurements by Adjoint Equation Optimization.- Comparison of four classification methods on small-sample-size synthetic RNA-seq data.- Sensitivity Analysis of a Large-Scale Air Pollution Model by Using Effective Stochastic Approaches.- Two-Way Intuitionistic Fuzzy Analysis of Variance for COVID-19 Cases in Europe by Season and Location Factors.- A Generic Nonlinear Evolution Equation of Magnetic Type I. Reductions.

Read more less

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.

Read more less

Book SynopsisChapter(s) “Chapter Name or No.” is/are available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.Table of ContentsA stochastic algorithm for non-monotone DR-submodular maximziation over a convex set.- Flow shop scheduling problems with transportation constraints revisited.- LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data Streams.- Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants.- Large k-gons in a 1.5D Terrain.- Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits (Extended Abstract).-Analysis of Approximate sorting in I/O model.-Two Generalizations of Proper Coloring: Hardness and Approximability.-Approximation Algorithms for Capacitated Assignment with Budget Constraints and Applications in Transportation Systems.-On the Complexity of Minimum Maximal Acyclic Matchings.-Online non-monotone DR-submodular maximization: 1/4 approximation ratio and sublinear regret.-Fair Division with Minimal Withheld Information in Social Networks.- Facility Location Games with Ordinal Preferences.-Fully Dynamic $k$-Center Clustering with Outliers.-Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search.-Online one-sided smooth function maximization.-Revisiting Maximum Satisfiability and Related Problems in Data Streams.-Turing Machines with Two-level Memory: A Deep Look into the Input/Output Complexity.- A quantum version of Pollard's Rho of which Shor's Algorithm is a particular case.-Single machine scheduling with rejection to minimize the $k$-th power of the makespan.- Escape from the Room.- Algorithms for hard-constraint point processes via discretization.-Space Limited Graph Algorithms on Big Data Counting Cycles on Planar Graphs in Subexponential Time.-Semi-strict chordal digraphs.- Reallocation Problems with Minimum Completion Time.-The bound coverage problem by aligned disks in L1 metric.-Facility Location Games with Group Externalities.- Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs.- Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps.- Customizable Hub Labeling: Properties and Algorithms Linear-Time Algorithm for Paired-Domination on Distance-Hereditary Graphs.-Bounding the Number of Eulerian Tours in Undirected Graphs.- A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables.- A 4-Space Bounded.- Approximation Algorithm \\for Online Bin Packing Problem.-Generalized Sweeping Line Spanners.- Rooting Gene Trees via Phylogenetic Networks.- An evolving network model from clique extension.- Online semi-matching problem with two heterogeneous sensors in a metric space.- Two-Stage BP Maximization under $p$-matroid Constraint.- The Hamiltonian Path Graph is Connected for Simple $s,t$ Paths in Rectangular Grid Graphs.- An $O(n^3)$-Time Algorithm for the Min-Gap.- Unit-Length Job Scheduling Problem.- Approximation Schemes for k-Facility Location.- Improved Deterministic Algorithms for Non-monotone Submodular Maximization.- Distributed Dominating Sets in Interval Graphs.- Optimal Window Queries on Line Segments using the Trapezoidal Search DAG.- On Rotation Distance, Transpositions and Rank Bounded Trees.- Hitting Geometric Objects Online via Points in $\mathbb{Z}^d$.- Capacitated Facility Location with Outliers/Penalties Improved Separated Red Blue Center Clustering.- Proper colorability of segment intersection graphs.

Read more less

Book SynopsisThis book constitutes the proceedings of the 30th International Symposium on Graph Drawing and Network Visualization, GD 2022, held in Tokyo, Japan, during September 13-16, 2022. The 25 full papers, 7 short papers, presented together with 2 invited talks, one report on graph drawing contest, and one obituary in these proceedings were carefully reviewed and selected from 70 submissions. The abstracts of 5 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: properties of drawings of complete graphs; stress-based visualizations of graphs; planar and orthogonal drawings; drawings and properties of directed graphs; beyond planarity; dynamic graph visualization; linear layouts; and contact and visibility graph representations. Table of ContentsProperties of Drawings of Complete Graphs.- Stress-based Visualizations of Graphs.- Planar and Orthogonal Drawings.- Drawings and Properties of Directed Graphs.- Beyond Planarity.- Dynamic Graph Visualization.- Linear Layouts.- Contact and Visibility Graph Representations.

Read more less