Mathematical theory of computation Books

Book SynopsisCognitive science arose in the 1950s when it became apparent that anumber of disciplines, including psychology, computer science,linguistics, and philosophy, were fragmenting. Perhaps owing to thefield’s immediate origins in cybernetics, as well as to thefoundational assumption that cognition is information processing,cognitive science initially seemed more unified than psychology.However, as a result of differing interpretations of the foundationalassumption and dramatically divergent views of the meaning of the terminformation processing, three separate schools emerged:classical cognitive science, connectionist cognitive science, andembodied cognitive science. Examples, cases, and research findings taken from the wide range ofphenomena studied by cognitive scientists effectively explain andexplore the relationship among the three perspectives. Intended tointroduce both graduate and senior undergraduate students to thefoundations of cognitive science, Mind, Body, World addressesa number of questions currently being asked by those practicing in thefield: What are the core assumptions of the three different schools?What are the relationships between these different sets of coreassumptions? Is there only one cognitive science, or are there manydifferent cognitive sciences? Giving the schools equal treatment anddisplaying a broad and deep understanding of the field, Dawsonhighlights the fundamental tensions and lines of fragmentation thatexist among the schools and provides a refreshing and unifyingframework for students of cognitive science.Table of ContentsList of Figures and Tables | ix Preface | xiii Who Is This Book Written For? | xiv Acknowledgements | xv Chapter 1. The Cognitive Sciences: One or Many? | 1 1.0 Chapter Overview | 1 1.1 A Fragmented Psychology | 2 1.2 A Unified Cognitive Science | 3 1.3 Cognitive Science or the Cognitive Sciences? | 6 1.4 Cognitive Science: Pre-paradigmatic? | 13 1.5 A Plan of Action | 16 Chapter 2. Multiple Levels of Investigation | 19 2.0 Chapter Overview | 19 2.1 Machines and Minds | 20 2.2 From the Laws of Thought to Binary Logic | 23 2.3 From the Formal to the Physical | 29 2.4 Multiple Procedures and Architectures | 32 2.5 Relays and Multiple Realizations | 35 2.6 Multiple Levels of Investigation and Explanation | 38 2.7 Formal Accounts of Input-Output Mappings | 40 2.8 Behaviour by Design and by Artifact | 41 2.9 Algorithms from Artifacts | 43 2.10 Architectures against Homunculi | 46 2.11 Implementing Architectures | 48 2.12 Levelling the Field | 51 Chapter 3. Elements of Classical Cognitive Science | 55 3.0 Chapter Overview | 55 3.1 Mind, Disembodied | 56 3.2 Mechanizing the Infinite | 59 3.3 Phrase Markers and Fractals | 65 3.4 Behaviourism, Language, and Recursion | 68 3.5 Underdetermination and Innateness | 72 3.6 Physical Symbol Systems | 75 3.7 Componentiality, Computability, and Cognition | 78 3.8 The Intentional Stance | 82 3.9 Structure and Process | 85 3.10 A Classical Architecture for Cognition | 89 3.11 Weak Equivalence and the Turing Test | 93 3.12 Towards Strong Equivalence | 97 3.13 The Impenetrable Architecture | 106 3.14 Modularity of Mind | 113 3.15 Reverse Engineering | 119 3.16 What is Classical Cognitive Science? | 122 Chapter 4. Elements of Connectionist Cognitive Science | 125 4.0 Chapter Overview | 125 4.1 Nurture versus Nature | 126 4.2 Associations | 133 4.3 Nonlinear Transformations | 139 4.4 The Connectionist Sandwich | 142 4.5 Connectionist Computations: An Overview | 148 4.6 Beyond the Terminal Meta-postulate | 149 4.7 What Do Output Unit Activities Represent? | 152 4.8 Connectionist Algorithms: An Overview | 158 4.9 Empiricism and Internal Representations | 159 4.10 Chord Classification by a Multilayer Perceptron | 162 4.11 Trigger Features | 172 4.12 A Parallel Distributed Production System | 177 4.13 Of Coarse Codes | 184 4.14 Architectural Connectionism: An Overview | 188 4.15 New Powers of Old Networks | 189 4.16 Connectionist Reorientation | 193 4.17 Perceptrons and Jazz Progressions | 195 4.18 What Is Connectionist Cognitive Science? | 198 Chapter 5. Elements of Embodied Cognitive Science | 205 5.0 Chapter Overview | 205 5.1 Abandoning Methodological Solipsism | 206 5.2 Societal Computing | 210 5.3 Stigmergy and Superorganisms | 212 5.4 Embodiment, Situatedness, and Feedback | 216 5.5 Umwelten, Affordances, and Enactive Perception | 219 5.6 Horizontal Layers of Control | 222 5.7 Mind in Action | 224 5.8 The Extended Mind | 230 5.9 The Roots of Forward Engineering | 235 5.10 Reorientation without Representation | 239 5.11 Robotic Moments in Social Environments | 245 5.12 The Architecture of Mind Reading | 250 5.13 Levels of Embodied Cognitive Science | 255 5.14 What Is Embodied Cognitive Science? | 260 Chapter 6. Classical Music and Cognitive Science | 265 6.0 Chapter Overview | 265 6.1 The Classical Nature of Classical Music | 266 6.2 The Classical Approach to Musical Cognition | 273 6.3 Musical Romanticism and Connectionism | 280 6.4 The Connectionist Approach to Musical Cognition | 286 6.5 The Embodied Nature of Modern Music | 291 6.6 The Embodied Approach to Musical Cognition | 301 6.7 Cognitive Science and Classical Music | 307 Chapter 7. Marks of the Classical? | 315 7.0 Chapter Overview | 315 7.1 Symbols and Situations | 316 7.2 Marks of the Classical | 324 7.3 Centralized versus Decentralized Control | 326 7.4 Serial versus Parallel Processing | 334 7.5 Local versus Distributed Representations | 339 7.6 Internal Representations | 343 7.7 Explicit Rules versus Implicit Knowledge | 345 7.8 The Cognitive Vocabulary | 348 7.9 From Classical Marks to Hybrid Theories | 355 Chapter 8. Seeing and Visualizing | 359 8.0 Chapter Overview | 359 8.1 The Transparency of Visual Processing | 360 8.2 The Poverty of the Stimulus | 362 8.3 Enrichment via Unconscious Inference | 368 8.4 Natural Constraints | 371 8.5 Vision, Cognition, and Visual Cognition | 379 8.6 Indexing Objects in the World | 383

Read more less

Book SynopsisThis book includes constructive approximation theory; it presents ordinary and fractional approximations by positive sublinear operators, and high order approximation by multivariate generalized Picard, Gauss–Weierstrass, Poisson–Cauchy and trigonometric singular integrals. Constructive and Computational Fractional Analysis recently is more and more in the center of mathematics because of their great applications in the real world. In this book, all presented is original work by the author given at a very general level to cover a maximum number of cases in various applications. The author applies generalized fractional differentiation techniques of Riemann–Liouville, Caputo and Canavati types and of fractional variable order to various kinds of inequalities such as of Opial, Hardy, Hilbert–Pachpatte and on the spherical shell. He continues with E. R. Love left- and right-side fractional integral inequalities. They follow fractional Landau inequalities, of left and right sides, univariate and multivariate, including ones for Semigroups. These are developed to all possible directions, and right-side multivariate fractional Taylor formulae are proven for the purpose. It continues with several Gronwall fractional inequalities of variable order. This book results are expected to find applications in many areas of pure and applied mathematics. As such this book is suitable for researchers, graduate students and seminars of the above disciplines, also to be in all science and engineering libraries.Table of ContentsVariable order general fractional integral inequalitie.- Variable order fractional integral inequalities for spherical shell.- Left fractional integral inequalities of E.R. Love type.- Right side fractional integral inequalities of E.R. Love type.- General fractional Landau inequalities.- Abstract fractional Landau inequalities.- Fractional Landau inequalities of Riemann-Liouville type.- Generalized Canavati fractional Landau inequalities.- Sequential left abstract fractional Landau inequalities.- Iterated left abstract generalized fractional Landau inequalities.

Read more less

Book SynopsisThis book gathers papers presented at the Workshop on Computational Diffusion MRI, CDMRI 2020, held under the auspices of the International Conference on Medical Image Computing and Computer-Assisted Intervention (MICCAI), which took place virtually on October 8th, 2020, having originally been planned to take place in Lima, Peru.This book presents the latest developments in the highly active and rapidly growing field of diffusion MRI. While offering new perspectives on the most recent research challenges in the field, the selected articles also provide a valuable starting point for anyone interested in learning computational techniques for diffusion MRI. The book includes rigorous mathematical derivations, a large number of rich, full-colour visualizations, and clinically relevant results. As such, it is of interest to researchers and practitioners in the fields of computer science, MRI physics, and applied mathematics. The reader will find numerous contributions covering a broad range of topics, from the mathematical foundations of the diffusion process and signal generation to new computational methods and estimation techniques for the in-vivo recovery of microstructural and connectivity features, as well as diffusion-relaxometry and frontline applications in research and clinical practice.Table of Contents

Read more less

Book SynopsisIn this book the author explains domain engineering and the underlying science, and he then shows how we can derive requirements prescriptions for computing systems from domain descriptions. A further motivation is to present domain descriptions, requirements prescriptions, and software design specifications as mathematical quantities.The author's maxim is that before software can be designed we must understand its requirements, and before requirements can be prescribed we must analyse and describe the domain for which the software is intended. He does this by focusing on what it takes to analyse and describe domains. By a domain we understand a rationally describable discrete dynamics segment of human activity, of natural and man-made artefacts, examples include road, rail and air transport, container terminal ports, manufacturing, trade, healthcare, and urban planning. The book addresses issues of seemingly large systems, not small algorithms, and it emphasizes descriptions as formal, mathematical quantities.This is the first thorough monograph treatment of the new software engineering phase of software development, one that precedes requirements engineering. It emphasizes a methodological approach by treating, in depth, analysis and description principles, techniques and tools. It does this by basing its domain modeling on fundamental philosophical principles, a view that is new for a computer science monograph.The book will be of value to computer scientists engaged with formal specifications of software. The author reveals this as a field of interesting problems, most chapters include pointers to further study and exercises drawn from practical engineering and science challenges. The text is supported by a primer to the formal specification language RSL and extensive indexes.Table of ContentsPart I, Setting the Scope.- Concepts.- Philosophy.- Space, Time and Matter.- Logic and Mathematics.- Part II, Domains.- Domains: A Taxonomy: External Qualities.- Domains: An Ontology: Internal Qualities.- Transcendental Deduction.- Domains: A Dynamics Ontology: Perdurants.- Domain Facets.- Part III, Requirements.- Requirements.- Part IV, Closing.- Demos, Simulators, Monitors and Controllers.- Winding Up.- References.- Appendix A: Pipelines Domain: Endurants.- Appendix B: Mereology, A Model.- Appendix C: Four Languages.- Appendix D: An RSL Primer.- Appendix E: Indexes.- List of Figures

Read more less

Book SynopsisComputation, itself a form of calculation, incorporates steps that include arithmetical and non-arithmetical (logical) steps following a specific set of rules (an algorithm). This uniquely accessible textbook introduces students using a very distinctive approach, quite rapidly leading them into essential topics with sufficient depth, yet in a highly intuitive manner. From core elements like sets, types, Venn diagrams and logic, to patterns of reasoning, calculus, recursion and expression trees, the book spans the breadth of key concepts and methods that will enable students to readily progress with their studies in Computer Science.Trade Review“This book is intended as a textbook for an introductory course in computation for students beginning in informatics. No prerequisites are needed, all concepts, even elementary ones ... . it is also very suited for self-study, even if a reader is interested in Haskell or symbolic logic alone. ... Comprehension is supported by exercises for each chapter ... .” (Dieter Riebesehl, zbMATH 1497.68005, 2022)Table of Contents1 Sets 132 Types 193 Simple Computations 274 Venn Diagrams and Logical Connectives 355 Lists and Comprehensions 456 Features and Predicates 557 Testing Your Programs 638 Patterns of Reasoning 739 More Patterns of Reasoning 8110 Lists and Recursion 9111 More Fun with Recursion 10112 Higher-Order Functions 11113 Higher and Higher 12314 Sequent Calculus 13115 Algebraic Data Types 14316 Expression Trees 15717 Karnaugh Maps 17518 Relations and Quantifiers 18319 Checking Satisfiability 19120 Data Representation 20321 Data Abstraction 22122 Efficient CNF Conversion 23723 Counting Satisfying Valuations 24924 Type Classes 26325 Search in Trees 27526 Combinatorial Algorithms 28527 Finite Automata 29928 Deterministic Finite Automata 31129 Non-Deterministic Finite Automata 32130 Input/Output and Monads 34131 Regular Expressions 35932 Non-Regular Languages 369Index 377

Read more less

Book SynopsisThis volume contains articles related to the work of the Simons Collaboration “Arithmetic Geometry, Number Theory, and Computation.” The papers present mathematical results and algorithms necessary for the development of large-scale databases like the L-functions and Modular Forms Database (LMFDB). The authors aim to develop systematic tools for analyzing Diophantine properties of curves, surfaces, and abelian varieties over number fields and finite fields. The articles also explore examples important for future research.Specific topics include● algebraic varieties over finite fields● the Chabauty-Coleman method● modular forms● rational points on curves of small genus● S-unit equations and integral points.Table of Contents A robust implementation for solving the S-unit equation and several application (C. Rasmussen).- Computing classical modular forms for arbitrary congruence subgroups (E. Assaf).- Square root time Coleman integration on superelliptic curves (A. Best).- Computing classical modular forms ( A. Sutherland).- Elliptic curves with good reduction outside of the first six primes (B. Matschke).- Efficient computation of BSD invariants in genus 2 (R. van Bommel).- Restrictions on Weil polynomials of Jacobians of hyperelliptic curves (E. Costa).- Zen and the art of database maintenance (D. Roe).- Effective obstructions to lifting Tate classes from positive characteristic (E. Costa).- Conjecture: 100% of elliptic surfaces over Q have rank zero (A. Cowan).- On rational Bianchi newforms and abelian surfaces with quaternionic multiplication (J. Voight).- A database of Hilbert modular forms (J. Voight).- Isogeny classes of Abelian Varieties over Finite Fields in the LMFDB (D. Roe).- Computing rational points on genus 3 hyperelliptic curves (S. Hashimoto).- Curves with sharp Chabauty-Coleman bound (S. Gajović).- Chabauty-Coleman computations on rank 1 Picard curves (S. Hashimoto).- Linear dependence among Hecke eigenvalues (D. Kim).- Congruent number triangles with the same hypotenuse (D. Lowry-Duda).- Visualizing modular forms (D. Lowry-Duda).- A Prym variety with everywhere good reduction over Q(√ 61) ( J. Voight).- The S-integral points on the projective line minus three points via étale covers and Skolem's method (B. Poonen).

Read more less

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

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 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 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 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 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 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 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 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 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 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 SynopsisEdited in collaboration with FoLLI, this book constitutes the refereed proceedings of the 10th Indian Conference on Logic and Its Applications, ICLA 2023, which was held in Indore, India, in March 2023.Besides 6 invited papers presented in this volume, there are 9 contributed full papers which were carefully reviewed and selected from 18 submissions. The volume covers a wide range of topics. These topics are related to modal and temporal logics, intuitionistic connexive and imperative logics, systems for reasoning with vagueness and rough concepts, topological quasi-Boolean logic and quasi-Boolean based rough set models, and first-order definability of path functions of graphs.Table of ContentsA Note on the Ontology of Mathematics.- Boolean Functional Synthesis: From Under the Hood of Solvers.- Labelled Calculi for Lattice-based Modal Logics.- Two Ways to Scare a Gruffalo.- Determinacy Axioms and Large Cardinals.- Big ideas from logic for mathematics and computing education.- Modal Logic of Generalized Separated Topological Spaces.- Multiple-valued Semantics for Metric Temporal Logic.- Segment transit function of the induced path function of graphs and its first-order definability.- Fuzzy Free Logic with Dual Domain Semantics.- A New Dimension of Imperative Logic. -Quasi-Boolean based models in Rough Set theory: A case of Covering.- Labelled calculi for the logics of rough concepts.- An Infinity of Intuitionistic Connexive Logics.- Relational Semantics for Normal Topological Quasi-Boolean Logic.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 12th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2022 held in Leiden, The Netherlands, during March 20-24, 2023. The 44 regular papers presented in this book were carefully reviewed and selected from 65 submissions. The papers are divided into the following topical sections: Algorithm Design and Engineering; Machine Learning and Multi-criterion Optimization; Benchmarking and Performance Assessment; Indicator Design and Complexity Analysis; Applications in Real World Domains; and Multi-Criteria Decision Making and Interactive Algorithms..Table of Contents​Algorithm Design and Engineering.- Visual Exploration of the Effect of Constraint Handling in Multiobjective Optimization.- A Two-stage Algorithm for Integer Multiobjective Simulation Optimization.- RegEMO: Sacrificing Pareto-Optimality for Regularity in Multi-objective Problem-Solving.- Cooperative coevolutionary NSGA-II with Linkage Measurement Minimization for Large-scale Multi-objective Optimization.- Data-Driven Evolutionary Multi-Objective Optimization Based on Multiple-Gradient Descent for Disconnected Pareto Fronts.- Eliminating Non-dominated Sorting from NSGA-III.- Scalability of Multi-Objective Evolutionary Algorithms for Solving Real-World Complex Optimization Problems.- Machine Learning and Multi-criterion Optimization.- Multi-Objective Learning using HV Maximization.- Sparse Adversarial Attack via Bi-Objective Optimization.- Investigating Innovized Progress Operators with Different Machine Learning Methods.- End-to-End Pareto Set Prediction with Graph Neural Networks for Multi-objective Facility Location.- Online Learning Hyper-Heuristics in Multi-Objective Evolutionary Algorithms.- Surrogate-assisted Multi-objective Optimization via Genetic Programming based Symbolic Regression.- Learning to Predict Pareto-optimal Solutions From Pseudo-weights.- A Relation Surrogate Model for Expensive Multiobjective Continuous and Combinatorial Optimization.- Pareto Front Upconvert by Iterative Estimation Modeling and Solution Sampling.- Pareto Front Upconvert by Iterative Estimation Modeling and Solution Sampling.- Approximation of a Pareto Set Segment Using a Linear Model with Sharing Variables.- Feature-based Benchmarking of Distance-based Multi/Many-objective Optimisation Problems: A Machine Learning Perspective.- Benchmarking and Performance Assessment.- Partially Degenerate Multi-Objective Test Problems.- Peak-A-Boo! Generating Multi-Objective Multiple Peaks Benchmark Problems with Precise Pareto Sets.- MACO: A Real-world inspired Benchmark for Multi-objective Evolutionary Algorithms.- A scalable test suite for bi-objective multidisciplinary optimisation.- Performance Evaluation of Multi-Objective Evolutionary Algorithms using Artificial and Real-World Problems.- A Novel Performance Indicator based on the Linear Assignment Problem.- A Test Suite for Multi-objective Multi-fidelity Optimization.- Indicator Design and Complexity Analysis.- Diversity enhancement via magnitude.- Two-Stage Greedy Approximated Hypervolume Subset Selection for Large-Scale Problems.- Two-Stage Greedy Approximated Hypervolume Subset Selection for Large-Scale Problems.- On the Computational Complexity of Efficient Non-Dominated Sort using Binary Search.- Applications in Real World Domains.- Evolutionary Algorithms with Machine Learning Models for Multiobjective Optimization in Epidemics Control.- Joint Price Optimization across a Portfolio of Fashion E-commerce Products.- Improving MOEA/D with Knowledge Discovery. Application to a Bi-Objective Routing Problem.- The Prism-Net Search Space Representation for Multi-Objective Building Spatial Design.- Selection Strategies for a Balanced Multi- or Many-Objective Molecular Optimization and Genetic Diversity: a Comparative Study.- A Multi-objective Evolutionary Framework for Identifying Dengue Stage-Specific Differentially Co-expressed and Functionally Enriched Gene Modules.- A Multi-objective Evolutionary Framework for Identifying Dengue Stage-Specific Differentially Co-expressed and Functionally Enriched Gene Modules. -Multiobjective Optimization of Evolutionary Neural Networks for Animal Trade Movements Prediction.- Transfer of Multi-Objectively Tuned CMA-ES Parameters to a Vehicle Dynamics Problem.- Multi-Criteria Decision Making and Interactive Algorithms.- Preference-Based Nonlinear Normalization for Multiobjective Optimization.- Incorporating preference information interactively in NSGA-III by the adaptation of reference vectors.- A Systematic Way of Structuring Real-World Multiobjective Optimization Problems.- IK-EMOViz: An Interactive Knowledge-based Evolutionary Multi-objective Optimization Framework.- An Interactive Decision Tree-Based Evolutionary Multi-Objective Algorithm.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 25th International Symposium on Formal Methods, FM 2023, which took place in Lübeck, Germany, in March 2023. The 26 full paper, 2 short papers included in this book were carefully reviewed and selected rom 95 submissions. They have been organized in topical sections as follows: SAT/SMT; Verification; Quantitative Verification; Concurrency and Memory Models; Formal Methods in AI; Safety and Reliability. The proceedings also contain 3 keynote talks and 7 papers from the industry day. Table of Contents​Keynotes.- Symbolic Computation in Automated Program Reasoning.- The next big thing: from embedded systems to embodied actors.- Intelligent and Dependable Decision-Making Under Uncertainty.- A Coq formalization of Lebesgue Induction Principle and Tonelli’s Theorem.- SAT/SMT.- Railway Scheduling Using Boolean Satisfiability Modulo Simulations.- SMT Sampling via Model-Guided Approximation.- Efficient SMT-based Network Fault Tolerance Verification.- Verification I.- Formalising the Prevention of Microarchitectural Timing Channels by Operating Systems.- Can we Communicate? Using Dynamic Logic to Verify Team Automata.- The ScalaFix equation solver.- HHLPy: Practical Verification of Hybrid Systems using Hoare Logic.- Quantitative Verification.- symQV: Automated Symbolic Verification of Quantum Programs.- PFL: a Probabilistic Logic for Fault Trees.- Energy Buechi Problems.- QMaude: quantitative specification and verification in rewriting logic.- Concurrency and Memory Models.- Minimisation of Spatial Models using Branching Bisimilarity.- Reasoning about Promises in Weak Memory Models with Event Structures.- A fine-grained semantics for arrays and pointers under weak memory models.- VeyMont: Parallelising Verified Programs instead of Verifying Parallel Programs.- Verification 2.- Verifying At the Level of Java Bytecode.- Abstract Alloy Instances.- Monitoring the Internet Computer.- Word Equations in Synergy with Regular Constraints.- Formal Methods in AI.- Verifying Feedforward Neural Networks for Classification in Isabelle/HOL.- SMPT: A Testbed for Reachabilty Methods in Generalized Petri Nets.- The Octatope Abstract Domain for Verification of Neural Networks.- Program Semantics and Verification Technique for AI-centred Programs.- Safety and Reliability.- Tableaux for Realizability of Safety Specifications.- A Decision Diagram Operation for Reachability.- Formal Modelling of Safety Architecture for Responsibility-AwareAutonomous Vehicle via Event-B Refinement.- A Runtime Environment for Contract Automata.- Industry Day.- Formal and Executable Semantics of the Ethereum Virtual Machine in Dafny.- Shifting Left for Early Detection of Machine-Learning Bugs.- A Systematic Approach to Automotive Security.- Specification-Guided Critical Scenario Identification for Automated Driving.- Runtime Monitoring for Out-of-Distribution Detection in Object Detection Neural Networks.- Backdoor Mitigation in Deep Neural Networks via Strategic Retraining.- veriFIRE: Verifying an Industrial, Learning-Based Wildfire Detection System.

Read more less

Book SynopsisThis book constitutes extended, revised, and selected papers from the JSAI annual conference, JSAI 2022, and the 14th International Symposium on Artificial Intelligence, JSAI-isAI 2022, held in Kyoto, Japan, in June 2022. The 18 full papers were carefully selected from 67 submissions and presented during the two events: 16th International Workshop on Juris-informatics, JURISIN 2022, and JSAI 2022 Intenational Session. This papers present discussion on fundamental and practical issues in Juris-informatics among researchers from various backgrounds such as law, social science, information and intelligent technology, logic, and philosophy, including the conventional AI and Law area. Table of ContentsJURISIN 2022.- Differential-aware Transformer for Partially Amended Sentence Translation.- On Complexity and Generality of Contrary Prioritized Defeasible Theory.- Mapping Similar Provisions between Japanese and Foreign Laws.- COLIEE 2022 Summary: Methods for Legal Document Retrieval and Entailment.- JNLP team: Deep Learning Approaches for Tackling Long and Ambiguous Legal Documents in COLIEE 2022.- Semantic-based Classification of Relevant Case Law.- nigam@COLIEE-22: Legal Case Retrieval and Entailment using Cascading of Lexical and Semantic-based models.- HUKB at the COLIEE 2022 Statute Law Task.- Using Textbook Knowledge for Statute Retrieval and Entailment Classification.- Legal Textual Entailment using Ensemble of Rule-based and BERT-based method with Data Augmentation by Related Article Generation.- Less is Better: Constructing Legal Question Answering System by Weighing Longest Common Subsequence of Disjunctive Union Text.- JSAI 2022 International Session.- Proposal for Turning Point Detection Method using Financial Text and Transformer.- Product Portfolio Optimization for LTV Maximization.- An Examination of Eating Experiences in Relation to Psychological States, Loneliness, and Depression Using BERT.- Objective Detection of High-risk Tackle in Rugby by Combination of Pose Estimation and Machine Learning.- Incremental informational value of floorplans for rent price prediction - Applications of modern computer vision techniques in real-estate.- Transaction Prediction by Using Graph Neural Network and Textual Industry Information.- Overfitting Problem in the Approximate Bayesian Computation Method Based on Maxima Weighted Isolation Kernel.

Read more less

Book SynopsisThis book constitutes the proceedings of the 23rd International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2022, which took place in Sendai, Japan, during December 7-9, 2022.The 24 full papers and 16 short papers included in this volume were carefully reviewed and selected from 95 submissions. The papers are categorized into the following topical sub-headings: Heterogeneous System (1; HPC & AI; Embedded systems & Communication; Blockchain; Deep Learning; Quantum Computing & Programming Language; Best Papers; Heterogeneous System (2); Equivalence Checking & Model checking; Interconnect; Optimization (1); Optimization (2); Privacy; and Workflow.Table of ContentsHeterogeneous System (1).- Towards Priority-Flexible Task Mapping for Heterogeneous Multi-Core NUMA systems.- Multi-GPU Scaling of a Conservative Weakly Compressible Solver for Large-scale Two-phase Flow Simulation.- Improving the Performance of Lattice Boltzmann Method with Pipelined Algorithm on A Heterogeneous Multi-zone Processor.- FPGA.- DEEPFAKE CLI: Accelerated Deepfake Detection using FPGAs.- Memory access optimization for former process of pencil drawing style image conversion in High-level Synthesis.- Word2Vec FPGA Accelerator Based on Spatial and Temporal Parallelism.- HPC & AI.- Analyzing I/O Performance of a Hierarchical HPC Storage System for Distributed Deep Learning.- An Advantage Actor-Critic Deep Reinforcement Learning Method for Power Management in HPC Systems.- An AutoML Based Algorithm for Performance Prediction in HPC Systems.- Embedded systems & Communication.- Edge-Gateway Intrusion Detection for Smart Home.- Energy-Delay Tradeoff in Parallel Task Allocation and Execution for Autonomous Platooning Applications.- A Reservation-based List Scheduling for Embedded Systems with Memory Constraints.- Formalization and Verification of SIP Using CSP.- Blockchain.- Towards a Blockchain and Fog-Based Proactive Data Distribution Framework for ICN.- Research on user influence weighted scoring algorithm incorporating incentive mechanism.- BloodMan-Chain: A Management of Blood and Its Products Transportation based on Blockchain Approach.- Deep Learning.- A Systematic Comparison on Prevailing Intrusion Detection Models.- Enhancing Resolution of Inferring Hi-C Data Integrating U-Net and ResNet Networks.- Detecting Network Intrusions with Resilient Approaches Based on Convolutional Neural Networks.- Quantum Computing & Programming Language.- Analysis of Precision Vectors for Ising-based Linear Regression.- Evaluating and Analyzing Irregular Tree Search in the Tascell and HOPE Parallel Programming Languages.- Best Papers.- Distributed Parallel Tall-Skinny QR factorization: Performance Evaluation of Various Algorithms on Various Systems.- A Partitioned Memory Architecture with Prefetching for Efficient Video Encoders .- A Hardware Trojan Exploiting Coherence Protocol on NoCs.- A System-Wide Communication to Couple Multiple MPI Programs for Heterogeneous Computing.- Heterogeneous System (2).- A task-parallel runtime for heterogeneous multi-node vector systems.- Accelerating Radiative Transfer Simulation on NVIDIA GPUs with OpenACC.- QR Factorization of Block Low-Rank Matrices on Multi-Instance GPU.- Equivalence Checking & Model checking.- Equivalence Checking of Code Transformation by Numerical and Symbolic Approaches.- MEA: A Framework for Model Checking of Mutual Exclusion Algorithms Focusing on Atomicity.- Interconnect.- A High-Radix Non-Random Shortcut Network Topology for Efficient Collective Communication.- Fault Tolerance and Packet Latency of Peer Fat-Trees.- Accelerating Imbalanced Many-to-Many Communication with Systematic Delay Insertion.- Optimization (1).- Optimizing Depthwise Convolutions on ARMv8 Architecture.- A Profiling-based Approach to Cache Partitioning of Program Data.- Optimization (2).- Memory Bandwidth Conservation for SpMV Kernels through Adaptive Lossy Data Compression.- SimdFSM: An Adaptive Vectorization of Finite State Machines for Speculative Execution.- Privacy.- Broad Learning Inference Based on Fully Homomorphic Encryption.- Application of probabilistic common set in the open world set for vertical federated learning.- Workflow.- Towards a Standard Process Management Infrastructure for Workflows. 　

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13–16, 2023. The 25 full papers included in this book were carefully reviewed and selected from 49 submissions. They cover all important areas of research on algorithms and complexity such as algorithm design and analysis; sequential, parallel and distributed algorithms; data structures; computational and structural complexity; lower bounds and limitations of algorithms; randomized and approximation algorithms; parameterized algorithms and parameterized complexity classes; smoothed analysis of algorithms; alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions), on-line computation and competitive analysis, streaming algorithms, quantum algorithms and complexity, algorithms in algebra, geometry, number theory and combinatorics, computational geometry, algorithmic game theory and mechanism design, algorithmic economics (including auctions and contests), computational learning theory, computational biology and bioinformatics, algorithmic issues in communication networks, algorithms for discrete optimization (including convex optimization) and algorithm engineering.Table of ContentsUnifying Gathering Strategies for Swarms of Mobile Robots.- The Complexity of Secure RAMs.- Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models.- The power of the Binary Value Principle.- Independent Set under a Change Constraint from an Initial Solution.- Asynchronous Fully-Decentralized SGD in the Cluster-Based Model.- Non-Crossing Shortest Paths Lengths in Planar Graphs in Linear Time.- How Vulnerable is an Undirected Planar Graph with respect to Max Flow.- Maximum Flows in Parametric Graph Templates.- Dynamic Coloring on Restricted Graph Classes.- Enumeration of Minimal Tropical Connected Sets.- Dynamic Flows with Time-Dependent Capacities.- On One-Sided Testing Affine Subspaces.- Stable Scheduling in Transactional Memory.- Parameterizing Path Partitions.- Maintaining Triconnected Components under Node Expansion.- Approximating Power Node-Deletion Problems.- Phase transition in count approximation by Count-Min sketch with conservative updates.- Minimum-link ´ $C$-Oriented Paths Visiting a Sequence of Regions in the Plane.- Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond.- Broadcasting in Split Graphs.- Partitioning Subclasses of Chordal Graphs with Few Deletions.- Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision.- Improved Deterministic Leader Election in Diameter-Two Networks.- Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues.- On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves.- Efficiently Enumerating All Spanning Trees of a Plane 3-Tree.- Communication-Efficient Distributed Graph Clustering and Sparsification under Duplication Models.

Read more less

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 ContentsInvited Talk.-A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.- Model Checking.- Bounded Model Checking for Asynchronous Hyperproperties.- Model Checking Linear Dynamical Systems under Floating-point Rounding.- Efficient Loop Conditions for Bounded Model Checking Hyperproperties.- Reconciling Preemption Bounding with DPOR.- Optimal Stateless Model Checking for Causal Consistency.- Symbolic Model Checking for TLA+ Made Faster.- AutoHyper: Explicit-State Model Checking for HyperLTL.- Machine Learning/Neural Networks.- Feature Necessity & Relevancy in ML Classifier Explanations.- Towards Formal XAI: Formally Approximate Minimal Explanations of Neural Networks.- OccRob: Effcient SMT-Based Occlusion Robustness Verification of Deep Neural Networks.- Neural Network-Guided Synthesis of Recursive List Functions.- Automata.- Modular Mix-and-Match Complementation of Buechi automata.- Validating Streaming JSON Documents With Learned VPAs.- Antichains Algorithms for the Inclusion Problem Between ω -VPL.- Stack-Aware Hyperproperties.- Proofs.- Propositional Proof Skeletons.- Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers.- Carcara: An effcient proof checker and elaborator for SMT proofs in the Alethe format.- Constraint Solving/Blockchain.- The Packing Chromatic Number of the Infinite Square Grid is 15.- Active Learning for SAT Solver Benchmarking.- ParaQooba: A Fast and Flexible Framework for Parallel and Distributed QBF Solving.- Inferring Needless Write Memory Accesses on Ethereum Bytecode.- Markov Chains/Stochastic Control.- A Practitioner’s Guide to MDP Model Checking Algorithms.- Correct Approximation of Stationary Distributions.- Robust Almost-Sure Reachability in Multi-Environment MDPs.- Mungojerrie: Linear-Time Objectives in Model-Free Reinforcement Learning.- Verification.- A Formal CHERI-C Semantics for Verification.- Automated Verification for Real-Time Systems via Implicit Clocks and an Extended Antimirov Algorithm.- Parameterized Verification under TSO with Data Types.- Verifying Learning-Based Robotic Navigation Systems: A Case Study.- Make flows small again: revisiting the flow framework.- ALASCA: Reasoning in Quantified Linear Arithmetic.- A Matrix-Based Approach to Parity Games.- A GPU Tree Database for Many-Core Explicit State Space Exploration.

Read more less

Book SynopsisThis book constitutes the proceedings of the 18th International Workshop on Algorithms and Models for the Web Graph, WAW 2023, held in Toronto, Canada, in May 23–26, 2023.The 12 Papers presented in this volume were carefully reviewed and selected from 21 submissions. The aim of the workshop was understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs.Table of ContentsCorrecting for Granularity Bias in Modularity-Based Community Detection Methods.- The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects.- Unsupervised Framework for Evaluating Structural Node Embeddings of Graphs.- Modularity Based Community Detection in Hypergraphs.- Establishing Herd Immunity is Hard Even in Simple Geometric Networks.- Multilayer hypergraph clustering using the aggregate similarity matrix.- The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks: An Empirical Analysis.- A Random Graph Model for Clustering Graphs.- Topological Analysis of Temporal Hypergraphs.- PageRank Nibble on the sparse directed stochastic block model.- A simple model of influence.- The Iterated Local Transitivity Model for Tournaments.

Read more less

Book SynopsisThis volume comprises the thoroughly reviewed and revised papers of the First International Conference on New Trends in Applied Mathematics, ICNTAM 2022, which took place in Béni Mellal, Morocco, 19-21 May 2022.The papers deal with the following topics: Inverse Problems, Partial Differential Equations, Mathematical Control, Numerical Analysis and Computer Science. The main interest is in recent trends on Inverse Problems analysis and real applications in Computer Science. The latter is viewed as a dynamic branch on the interface of mathematics and related fields, that has been growing rapidly over the past several decades. However, its mathematical analysis and interpretation still not well-detailed and needs much more clarifications. The main contribution of this book is to give some sufficient mathematical content with expressive results and accurate applications. As a growing field, it is gaining a lot of attention both in media as well as in the industry world, which will attract the interest of readers from different scientist discipline. Table of ContentsA. Oulmelk, M. Srati and L. Afraites. Comparing numerical methods for inverse source problem in time-fractional diffusion equation.- S. Lyaqini. An improvement to the nonparametric regression models using the nonsmooth loss functions.- A. Nachaoui. Iterative methods for inverse problems subject to the convection-diffusion equation.- Y. Essadaoui, I. Hafidi. The dynamic behavior of an incompressible lubrication system.- M. Nachaoui, A. Nachaoui and M A hilal. A new approach for solving an inverse Cauchy problem based on BFGS method.- S. Lyaqini, M. Nachaoui. Heart failure prediction using supervised machine learning algorithms.- M. Srati, A. Oulmelk and L. Afraites. Optimization method for estimating the source term in elliptic equation.- A. Nachaoui. Cauchy's problem for the modified biharmonic equation: ill-posedness and Iterative regularizing methods.- A. Nachaoui and S. M. Rasheed. A mesh free wavelet method to solve the Cauchy problem for the Helmholtz equation.- A. Nachaoui, M. Nachaoui and T. Tadumadze. Meshless methods to noninvasively calculate neurocortical potentials from potentials measured at the scalp surface.- A. Nachaoui and F. Aboud. Solving geometric inverse problems with a polynomial based meshless method.- A. El-Hakoum, Z. Zaabouli and L. Afraites. On the analysis of a coupled denoising PDE.- M. Nachaoui, F. Jauberteau. A novel identification scheme of an inverse source problem based on Hilbert reproducing kernels.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 9th International Conference on Rigorous State-Based Methods, ABZ 2023, held in Nancy, France, in May 2023. The 12 full and 7 short papers included in this volume were carefully reviewed and selected from 47 submissions. The proceedings also include 4 PhD symposium contributions. They deal with state-based and machine-based formal methods, mainly Abstract State Machines (ASM), Alloy, B, TLA+, VDM, and Z. Table of ContentsPattern-based Refinemnt Generation Through Domain Specifi Languages.- Inductive Construction in B with the Theory Plugin.- Validation of Formal Models by Interactive Simulation.- Thread-Local, Step-Local Proof Obligations for Refnement of State-Based Concurrent Systems.- Encoding TLA+ Proof Obligations Safely for SMT.- Compositional I/O Abstract State Machines.- Crucible Tools for Test Generation and Animation of Alloy Models.- Modelling an Automotive Software System with TASTD.- TASTD a real-time extension for ASTD.- Validation by Abstraction and Refiement.- Verifying Event-B Hybrid Models using Cyclone.- Exploration of Reflectie ASMs for Security.- Standalone Event-B models analysis relying on the EB4EB meta-theory.- Adding records to Alloy.- Designing Secure Systems using Hierarchical STPA and Event-B.- Behavioural Theory of Reflectie Algorithms.- Specification in the Event-B Institution.- Verifying temporal relational models with Pardinus.- AMAN Case Study.- Analysis of a Safety-critical Interactive System through VOs.- Task Model Design and Analysis with Alloy.- Modeling and Verifying an Arrival Manager using Event-B.- Formal MVC: a Pattern for the Integration of ASM Specification in UI Development.- Exploring a methodology for formal verificatio of safety-critical systems.- Extending Modelchecking with ProB to Floating-Point Numbers and Hybrid Systems.- A framework for formal verificatio and validation of railway systems.- Reconstruction of TLAPS proofs solved by veriT in Lambdapi.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 14th International Conference on Combinatorics on Words, WORDS 2023, held in Umeå, Sweden, during June 12–16, 2023.The 19 contributed papers presented in this book were carefully reviewed and selected from 28 submissions. In addition, the volume also contains 3 invited papers. WORDS is the main conference series devoted to combinatorics on words. This area is connected to several topics from computer science and mathematics, including string algorithms, automated proofs, discrete dynamics, number theory and, of course, classical combinatoricsTable of Contents​Invited Papers: Minimal Complexities for Infinite Words Written with d Letters.- Alternate Base Numeration Systems.- On the number of distinct squares in finite sequences: some old and new results. Contributed Papers: Ranking and Unranking k-Subsequence Universal Words.- Longest common subsequence with gap constraints.- On Substitutions Preserving their Return Sets.- Recurrence and frequencies.- Sturmian and infinitely desubstitutable words accepted by an ω-automaton.- String attractors for factors of the Thue-Morse word.- Critical exponent of Arnoux-Rauzy sequences.- On a class of 2-balanced sequences.- Order conditions for languages.- On Sensitivity of Compact Directed Acyclic Word Graphs.- Smallest and Largest Block Palindrome Factorizations.- String attractors of fixed points of k-bonacci-like morphisms.- Magic Numbers in Periodic Sequences.- Dyck Words, Pattern Avoidance, and Automatic Sequences.- Rudin-Shapiro Sums Via Automata Theory and Logic.- Automaticity and Parikh-collinear morphisms.- On the solution sets of entire systems of word equations.- On arch factorization and subword universality for words and compressed words.- Characteristic sequences of the sets of sums of squares as columns of cellular automata.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 27th International Conference on Developments in Language Theory, DLT 2023, held in Umeå, Sweden, during June 12–16, 2023. The 20 full papers included in this book were carefully reviewed and selected from 32 submissions (31 regular ones and one invited).The DLT conference series provides a forum for presenting current developments informal languages and automata. Its scope is very general and includes, among others, the following topics and areas: grammars, acceptors and transducers for words; trees and graphs; relations between formal languages and artificial neural networks; algebraic theories of automata; algorithmic, combinatorial, and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; groups and semigroups generated by automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory, and logic; bio-inspired computing; and quantum computing.Table of ContentsTransducers and the Power of Delay.- When the Map is More Exact than the Terrain.- Formal Languages and the NLP Black Box.- On Structural Tractability Parameters for Hard String Problems.- Jumping Automata over Infinite Words.- Isometric Words based on Swap and Mismatch Distance.- Set Augmented Finite Automata over Infinite Alphabets.- Fast detection of specific fragments against a set of sequences.- Weak Inverse Neighborhoods of Languages.- The exact state complexity for the composition of Root and reversal.- Bit catastrophes for the Burrows-Wheeler Transform.- The Domino problem is undecidable on every rhombus subshift.- Synchronization of Parikh Automata.- Completely Distinguishable Automata and the Set of Synchronizing Words.- Zielonka DAG Acceptance and Regular Languages over Infinite Words.- On Word Representable and Multi-Word Representable Graphs.- On the Simon's Congruence Neighborhood of Languages.- Tree-Walking-Storage Automata.- Rewriting rules for arithmetics in alternate base systems.- Synchronizing Automata with Coinciding Cycles.- Approaching Repetition Thresholds Via Local Resampling and Entropy Compression.- Languages Generated by Conjunctive Query Fragments of FC[REG].- Groups whose word problems are accepted by abelian G-automata.

Read more less

Book SynopsisThe 4-volume set LNAI 13935 - 13938 constitutes the proceedings of the 27th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2023, which took place in Osaka, Japan during May 25–28, 2023.The 143 papers presented in these proceedings were carefully reviewed and selected from 813 submissions. They deal with new ideas, original research results, and practical development experiences from all KDD related areas, including data mining, data warehousing, machine learning, artificial intelligence, databases, statistics, knowledge engineering, big data technologies, and foundations.Table of ContentsBig data.- Toward Explainable Recommendation Via Counterfactual Reasoning.- Online Volume Optimization for Notifications via Long Short-Term Value Modeling.- Discovering Geo-referenced Frequent Patterns in Uncertain Geo-referenced Transactional Databases.- Financial data.- Joint Latent Topic Discovery and Expectation Modeling for Financial Markets.- Let the model make financial senses: a Text2Text generative approach for financial complaint identification.- Information retrieval and search.- Web-scale Semantic Product Search With Large Language Models.- Multi-task learning based Keywords weighted Siamese Model for semantic retrieval.- Relation-Aware Network with Attention-Based Loss for Few-Shot Knowledge Graph Completion.- MFBE: Leveraging Multi-Field Information of FAQs for Efficient Dense Retrieval.- Isotropic Representation Can Improve Dense Retrieval.- Knowledge-Enhanced Prototypical Network with Structural Semantics for Few-Shot Relation Classification.- Internet of Things.- MIDFA : Memory-Based Instance Division and Feature Aggregation Network for Video Object Detection.- Medical and biological data.- Vision Transformers for Small Histological Datasets learned through Knowledge Distillation.- Cascaded Latent Diffusion Models for High-Resolution Chest X-ray Synthesis.- DKFM: Dual Knowledge-guided Fusion Model for Drug Recommendation.- Hierarchical Graph Neural Network for Patient Treatment Preference Prediction with External Knowledge.- Multimedia and multimodal data.- An Extended Variational Mode Decomposition Algorithm Developed Speech Emotion Recognition Performance.- Dynamically-Scaled Deep Canonical Correlation Analysis.- TCR: Short Video Title Generation and Cover Selection with Attention Refinement.- ItrievalKD: An Iterative Retrieval Framework Assisted with Knowledge Distillation for Noisy Text-to-Image Retrieval.- Recommender systems.- Semantic Relation Transfer for Non-overlapped Cross-domain Recommendations.- Interest Driven Graph Structure Learning for Session-Based Recommendation.- Multi-behavior Guided Temporal Graph Attention Network for Recommendation.- Pure Spectral Graph Embeddings: Reinterpreting Graph Convolution for Top-N Recommendation.- Meta-learning Enhanced Next POI Recommendation by Leveraging Check-ins from Auxiliary Cities.- Global-Aware External Attention Deep Model for Sequential Recommendation.- Aggregately Diversified Bundle Recommendation via Popularity Debiasing and Configuration-aware Reranking.- Diversely Regularized Matrix Factorization for Accurate and Aggregately Diversified Recommendation.- kNN-Embed: Locally Smoothed Embedding Mixtures For Multi-interest Candidate Retrieval.- Staying or Leaving: A Knowledge-Enhanced User Simulator for Reinforcement Learning Based Short Video Recommendation.- RLMixer: A Reinforcement Learning Approach For Integrated Ranking With Contrastive User Preference Modeling.

Read more less

Book SynopsisThe 4-volume set LNAI 13935 - 13938 constitutes the proceedings of the 27th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2023, which took place in Osaka, Japan during May 25–28, 2023.The 143 papers presented in these proceedings were carefully reviewed and selected from 813 submissions. They deal with new ideas, original research results, and practical development experiences from all KDD related areas, including data mining, data warehousing, machine learning, artificial intelligence, databases, statistics, knowledge engineering, big data technologies, and foundations.

Read more less

Book SynopsisThis book constitutes revised selected papers from the refereed proceedings of the 7th International Symposium on Algorithmic Aspects of Cloud Computing, ALGOCLOUD 2022, which took place in Potsdam, Germany, on September 6, 2022.The 6 full papers included in this book were carefully reviewed and selected from 16 submissions. They were organized in topical sections as follows: Cloud-Based Urban Mobility Services; New Results in Priority-Based Bin Packing; More Sparking Soundex-based Privacy-Preserving Record Linkage and Privacy Preserving Queries of Shortest Path Distances.Table of ContentsCloud-Based Urban Mobility Services.- SQL Query Optimization in Distributed NoSQL Databases for Cloud-based Applications.- MAGMA: Proposing a Massive Historical Graph Management System.- New Results in Priority-Based Bin Packing.- More Sparking Soundex-based Privacy-Preserving Record Linkage.- Privacy Preserving Queries of Shortest Path Distances.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the International Conference on Computers and Games, CG 2022, held virtually, during November 22–24, 2022.The 15 full papers included in this book were carefully reviewed and selected from 23 submissions. They were organized in topical sections as follows: ​classic games, multi-player and multi-action games, solving games, measuring games, decision making in games and puzzles.Table of ContentsClassic Games: FairKalah: Towards Fair Mancala Play.- Improving Search in Go Using Bounded Static Safety.- Chinese Checkers Bitboards for Move Generation and Ranking Using Bitboards. Multi-Player and Multi-Action Games: Solving Chainmail Jousting.- An Algorithm for Multiplayer Games Exploiting Opponents' Interactions with the Player.- Incentivizing Information Gain in Hidden Information Multi-Action Games. Solving Games: QBF Solving using Best First Search.- Oware is Strongly Solved.- Solving Impartial SET using Knowledge and Combinatorial Game Theory. Measuring Games: Which Rules for Mu Torere?.- Measuring Board Game Distance. Decision Making in Games and Puzzles: Improving Computer Play in Skat with Hope Cards.- Batch Monte Carlo Tree Search.- Human and Computer Decision-Making in Chess with Applications to Online Cheat Detection.- Procedural Generation of Rush Hour Levels.

Read more less

Book SynopsisThis book constitutes the proceedings of the 20th International Conference on Unconventional Computation and Natural Computation, UCNC 2023, held in Jacksonville, FL, USA, in March 13–17, 2023. The UCNC conference series covers fundamental research on computation beyond the standard Turing model, including computational models and methods inspired by nature, and the computational properties of natural processes.Table of ContentsAn investigation to test spectral segments as bacterial biomarkers.- Robot Relocation is Hard in only two Directions even without Obstacles.- Robert Schweller and Tim Wylie Generically Computable Abelian Groups.- Extraction Rates of Random Continuous Functionals.- Computing with nanowire exchange-coupled spin torque oscillator arrays.- Stepney Tight bounds on the directed tile complexity of a just-barely3D $2 \times N$ rectangle at temperature 1.- Robustness of Magnetic Ring Arrays Reservoir Computing with Linear Field Calibration.- The Topological Entropy of Reversible Cellular Automata and Related Problems.- Toni Hotanen Fault Pruning: Robust Training of Neural Networkswith Memristive Weights.- Spatial correlations in the qubit properties of D-Wave 2000Q measured and simulated qubit networks.- Simulation ofMultiple Stages in Single Bin Active Tile Self-Assembly.- Single-Shuffle Card-based Protocol with Eight Cards per Gate.- Modellingand Evaluating Restricted ESNs.

Read more less

Book SynopsisThis book constitutes extended, revised, and selected papers from the 13th International Symposium on Artificial Intelligence supported by the Japanese Society for Artificial Intelligence, JSAI-isAI 2021, held online in November 2021. The 26 full papers were carefully selected from 86 submissions. The papers are organized in the volume according to the following workshops: 15th International Workshop on Juris-Informatics, JURISIN 2021; 18th Workshop on Logic and Engineering of Natural Language Semantics, LENLS 18, 5th International Workshop on SCIentific DOCument Analysis, SCI-DOCA 2021; Workshop on Artificial Affective (Kansei) Intelligence, KANSEI-AI 2021; 5th Workshop on Artificial Intelligence of and for Business, AI-Biz 2021.Table of ContentsJURISIN 2021.- LENLS 18.- SCIDOCA 2021.- KANSEIAI 2021.- AI-Biz 2021.

Read more less

Book SynopsisThis open access book constitutes the proceedings of the 29th International Conference on Automated Deduction, CADE 29, which took place in Rome, Italy, during July 2023. The 28 full papers and 5 short papers presented were carefully reviewed and selected from 77 submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, including foundations, applications, implementations, and practical experience. The papers are organized in the following topics: Logical foundations; theory and principles; implementation and application; ATP and AI; and system descriptions.Table of ContentsCertified Core-Guided MaxSAT Solving.- Superposition with Delayed Unification.- On Incremental Pre-processing for SMT.- Verified Given Clause Procedures.- QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment.- Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs.- An Isabelle/HOL Formalization of the SCL(FOL) Calculus.- SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning.- Formal Reasoning about Influence in Natural Sciences Experiments.- A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification).- SAT-Based Subsumption Resolution.- A more Pragmatic CDCL for IsaSAT and targetting LLVM (Short Paper).- Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper).- COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description).- Choose your Colour: Tree Interpolation for Quantified Formulas in SMT.- Proving Termination of C Programs with Lists.- Reasoning about Regular Properties: A Comparative Study.- Program Synthesis in Saturation.- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus.- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs.- Verification of NP-hardness Reduction Functions for Exact Lattice Problems.- Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic.- Left-Linear Completion with AC Axioms.- On P -interpolation in local theory extensions and applications to the study of interpolation in the description logics EL, EL+.- Theorem Proving in Dependently-Typed Higher-Order Logic.- Towards Fast Nominal Anti-Unification of Letrec-Expressions.- Confluence Criteria for Logically Constrained Rewrite Systems.- Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory.- An Experimental Pipeline for Automated Reasoning in Natural Language (Short paper).- Combining Combination Properties: An Analysis of Stable-infiniteness, Convexity, and Politeness.- Decidability of difference logic over the reals with uninterpreted unary predicates.- Incremental Rewriting Modulo SMT.- Iscalc: an Interactive Symbolic Computation Framework (System Description).

Read more less

Book SynopsisThis book constitutes the proceedings of the 27th International Conference on Implementation and Application of Automata, CIAA 2023, held in Famagusta, North Cyprus, during September 19–22, 2023. The 20 regular papers presented in this book together with invited talks were carefully reviewed and selected from 30 submissions. The topics of the papers cover various fields in the application, implementation, and theory of automata and related structures.Table of ContentsFinite automata as verifiers.- Binary Coded Unary Regular Languages.- A Survey on Automata with Translucent Letters.- Earliest Query Answering for Deterministic Stepwise Hedge Automata.- Constrained Multi-Tildes.- On the smallest synchronizing terms of finite tree automata.- Universal First-Order Quantification over Automata.- Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions.- Sweep complexity revisited.- The Pumping Lemma for Regular Languages is Hard.- M-equivalence of Parikh Matrix over a Ternary Alphabet.- Operational Complexity in Subregular Classes.- When Is Context-Freeness Distinguishable from Regularity? An Extension of Parikh's Theorem.- Enhanced Ternary Fibonacci Codes.- Sweeping Input-Driven Pushdown Automata.- Verified Verifying: SMT-LIB for Strings in Isabelle.- Weighted Bottom-up and Top-down Tree Transformations Are Incomparable.- Deciding whether an Attributed Translation can be realized by a Top-Down Transducer.- A time to cast away stones.- Two-way Machines and de Bruijn Words.- Transduction of Automatic Sequences and Applications.- Measuring Power of Generalised Definite Languages.- Smaller Representation of Compiled Regular Expressions.

Read more less

Book SynopsisThis book constitutes the refereed deadline proceedings of the 28th International Conference on Graph-Based Representation and Reasoning, ICCS 2023, held in Berlin, Germany, during September 11–13, 2023.The 9 full papers, 5 short papers and 4 Posters are included in this book were carefully reviewed and selected from 32 submissions. They were organized in topical sections as follows: Complexity and Database Theory, Formal Concept Analysis: Theoretical Advances, Formal Concept Analysis: Applications, Modelling and Explanation, Semantic Web and Graphs, Posters.Table of ContentsComplexity and Database Theory.- Functional Dependencies with Predicates: What Makes the g3-error Easy to Compute?.- Formal Concept Analysis: Theoretical Advances.- Squared symmetric formal contexts and their connections with correlation matrices.- Aggregation Functions and Extent Structure Preservation in Formal Concept Analysis.- On pseudointents in Fuzzy Formal Concept Analysis.- Maximal Ordinal Two-Factorizations.- A Note on the Number of (Maximal) Antichains in the Lattice of set Partitions.- Formal Concept Analysis: Applications.- Formal Concept Analysis for Trace Clustering in Process Mining.- Summarization of massive RDF graphs using identifier classification.- Towards a Flexible and Scalable Data Stream Algorithm in FCA.- Modelling and Explanation.- Postmodern Human-Machine Dialogues: a Pedagogical Inquiry Experiment.- Conceptual Modelling with Euler+ Diagrams.- Automatic Textual Explanations of Concept Lattices.- Semantic Web and Graphs.- Ontology Population from French Classified Ads.- Graph Extraction for Assisting Crash Simulation Data Analysis.- Posters.- Factorization of formal contexts from modal operators.- Towards confirmation measures to mixed attribute implications.- Concept lattices as a reduction tool for fuzzy relation equations.- Analysis of Slovak Court Decisions by Formal Concept Analysis and Machine Learning Methods.

Read more less

Book SynopsisThis book constitutes the thoroughly refereed post-conference proceedings of the 26th International Workshop on Algebraic Development Techniques, WADT 2022, held in Aveiro, Portugal, in June 2022.The 6 revised papers presented together with 2 invited papers were carefully reviewed and selected from 25 submissions. The contributed presentations covered a range of topics about the algebraic approach to system specification, which encompasses many aspects of the formal design of software systems. Originally born as formal method for reasoning about abstract data types, the algebraic approach now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic, and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed, and mobile systems).Table of Contents​Invited Talks.- Taming Distributed System Complexity through Formal Patterns.- Why Adjunctions Matter — a Functional Programmer Perspective.- Standard Contributions.- A Computability Perspective on (Verified Machine Learning.- A Presheaf Semantics for Quantifie Temporal Logics.- Shades of Iteration: from Elgot to Kleene.- Automated QoS-Aware Service Selection Based on Soft Constraints.- Runtime Composition Of Systems of Interacting Cyber-Physical Components.- SpeX: a rewriting-based formal specificatio environment.

Read more less

Book SynopsisThis volume constitutes the thoroughly refereed proceedings of the 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023. The 33 full papers presented in this volume were carefully reviewed and selected from a total of 116 submissions. The WG 2022 workshop aims to merge theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, or by extracting new graph theoretic problems from applications.Table of ContentsProportionally Fair Matching with Multiple Groups.- Reconstructing Graphs from Connected Triples.- Parameterized Complexity of Vertex Splitting to Pathwidth at most 1.- Odd Chromatic Number of Graph Classes.- Deciding the Erdos-P osa property in 3-connected digraphs.- New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth.- Computational Complexity of Covering Colored Mixed Multigraphswith Degree Partition Equivalence Classes of Size at Most Two.- Cutting Barnette graphs perfectly is hard.- Metric dimension parameterized by treewidth in chordal graphs.- Efficient Constructions for the Gyori-Lovasz Theorem on Almost Chordal Graphs.- Generating faster algorithms for d-Path Vertex Cover.- A new width parameter of graphs based on edge cuts: -edge-crossing width.- Snakes and Ladders: a Treewidth Story.- Parameterized Results on Acyclic Matchings with Implications for Related Problems.- P-matchings Parameterized by Treewidth.- Algorithms and hardness for Metric Dimension on digraphs.- Degreewidth : a New Parameter for Solving Problems on Tournaments.- Approximating Bin Packing with Con ict Graphs via Maximization Techniques.- i-Metric Graphs: Radius, Diameter and all Eccentricities.- Maximum edge colouring problem on graphs that exclude a xed minor.- Bounds on Functionality and Symmetric Di erence { Two Intriguing Graph Parameters.- Cops and Robbers on Multi-layer Graphs.- Parameterized Complexity of Broadcasting in Graphs.- Turan's Theorem Through Algorithmic Lens.- On the Frank number and nowhere-zero ows on graphs.- On the minimum number of arcs in 4-dicritical oriented graphs.- Tight Algorithms for Connectivity Problems Parameterized byModular-Treewidth.

Read more less

Book SynopsisThis open access book constitutes the proceedings of the proceedings of the 32nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2023, held in Prague, Czech Republic, during September 18-21, 2023. The 20 full papers and 5 short papers included in this book together with 5 abstracts of invited talks were carefully reviewed and selected from 43 submissions. They present research on all aspects of the mechanization of reasoning with tableaux and related methods. The papers are organized in the following topical sections: tableau calculi; sequent calculi; theorem proving; non-wellfounded proofs; modal logics; linear logic and MV-algebras; separation logic; and first-order logics.Table of ContentsRange-Restricted and Horn Interpolation through Clausal Tableaux.- Non-Classical Logics in Satisfiability Modulo Theories.- DefTab: A Tableaux System for Sceptical Consequence in Default Modal Logics.- Non-distributive description logic.- A new calculus for intuitionistic Strong L\"ob logic: strong termination and cut-elimination, formalized.- Some Analytic Systems of Rules.- A cut-free, sound and complete Russellian theory of definite descriptions.- Towards Proof-Theoretic Formulation of the General Theory of Term-Forming Operators.- Lemmas: Generation, Selection, Application.- Machine-Learned Premise Selection for Lean.- gym-saturation: Gymnasium environments for saturation provers (System description).- A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed points.- Ill-founded Proof Systems For Intuitionistic Linear-time Temporal Logic.- Proof Systems for the Modal $\mu$-Calculus Obtained by Determinizing Automata.- Extensions of K5: Proof Theory and Uniform Lyndon Interpolation.- On intuitionistic diamonds (and lack thereof).- NP Complexity for Combinations of Non-Normal Modal Logics.- Resolution-based Calculi for Non-Normal Modal Logics.- Canonicity of Proofs in Constructive Modal Logic.- Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic.- The MaxSAT problem in the real-valued MV-algebra.- The Logic of Separation Logic: Models and Proofs.- Testing the Satisfiability of Formulas in Separation Logic with Permissions.- Nested Sequents for Quantified Modal Logics.- A Naive Prover for First-Order Logic: A Minimal Example of Analytic Completeness.

Read more less