Mathematical theory of computation Books
Springer International Publishing AG New Frontiers in Artificial Intelligence:
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.
£47.49
Springer International Publishing AG Higher Education Computer Science: A Manual of
Book SynopsisThe march towards on-line and blended teaching—present before the Covid-19 pandemic—has been accelerated by it, and there is no going back. Students and staff may object, but the economic drive towards “greater productivity” will inevitably result in less face-to-face (f2f) instruction. Therefore, it is incumbent for those delivering this precious, in-person resource to make maximum use of time…which raises the question, “how”?The second edition of Higher Education Computer Science offers some potential answers. It also addresses other questions, such as “why have f2f teaching at all?” “what is the purpose of f2f?” and “what is the appropriate balance between the two?” The first edition began to offer suggestions for optimising limited opportunities to get together with students. Aligned with that, this unique new volume examines how to use the technology available to maximum advantage: For example, resources such as Moocs and other on-line instructional materials can provide invaluable pedagogic support. In addition, the book addresses ‘problem-based learning,’ using robotics in the teaching of programming, and a multidisciplinary approach to data science. Although it includes a chapter on distance learning, there is greater emphasis placed on the soft, transferable skills and employability skills that are best delivered in person. Further, the work provides several examples of putting theory into practice when teaching computer science at both undergraduate and postgraduate levels. Written by experienced practitioners, each chapter tackles a particular teaching activity or topic within computing, presented in such a way that other practitioners can use. As such, this new volume will be an invaluable resource to those who want to protect and optimise in-person teaching.Table of ContentsPart 1: Approaches to Learning.- Changing minds: Multitasking in lectures.- Active learning in large lectures.- The flipped classroom.- Applying cognitive theory to the teaching of programming: Metaphors, robots and problem-based learning.- Distance learning: Lessons learned from a UK masters programme.- Academic integrity for computer science instructors.- Contextualisation in data science.- Part 2: Teaching examples and practice.- Using graphics to inspire failing students.- Best practices for teaching information systems modelling.- Promoting design thinking through knowledge maps: A case study in computer games design and development education.- Teaching fuzzy logic utilising innovative approaches.- Semi-automating the marking of a Java programming portfolio assessment: A case study from a UK undergraduate programme.- Part 3: Employability and group work.- The enterprise showcase experience.- Task versus process: A taxonomy for group projects.- Realising the threshold of employability in higher education.- Exploring the landscape of HE industrial placements within engineering and technology subjects. Observations of recruitment, graduate attributes and student experience.- Baseline skills – Scaffolding soft skills development within the curriculum.- Professionalism and online presence.- Postscript.
£37.49
Springer International Publishing AG Parallel and Distributed Computing, Applications
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.
£61.74
Springer International Publishing AG Algorithms and Complexity: 13th International
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.
£56.99
Springer International Publishing AG Tools and Algorithms for the Construction and
Book SynopsisThis open access book constitutes the proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2023, which was held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, during April 22-27, 2023, in Paris, France. The 56 full papers and 6 short tool demonstration papers presented in this volume were carefully reviewed and selected from 169 submissions. The proceedings also contain 1 invited talk in full paper length, 13 tool papers of the affiliated competition SV-Comp and 1 paper consisting of the competition report. TACAS is a forum for researchers, developers, and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference aims to bridge the gaps between different communities with this common interest and to support them in their quest to improve the utility, reliability, flexibility, and efficiency of tools and algorithms for building computer-controlled systems.Table of ContentsTool Demos.- EVA: a Tool for the Compositional Verification of AUTOSAR Models.- WASIM: A Word-level Abstract Symbolic Simulation Framework for Hardware Formal Verification.- Multiparty Session Typing in Java, Deductively.- PyLTA: A Verification Tool for Parameterized Distributed Algorithms.- FuzzBtor2: A Random Generator of Word-Level Model Checking Problems in Btor2 Format.- Eclipse ESCET™: The Eclipse Supervisory Control Engineering Toolkit.- Combinatorial Optimization/Theorem Proving.- New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization.- Verified reductions for optimization.- Specifying and Verifying Higher-order Rust Iterators.- Extending a High-Performance Prover to Higher-Order Logic.- Tools (Regular Papers).- The WhyRel Prototype for Relational Verification of Pointer Programs.- Bridging Hardware and Software Analysis with Btor2C: A Word-Level-Circuit-to-C Converter.- CoPTIC: Constraint Programming Translated Into C.- Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability.- Synthesis.- Computing Adequately Permissive Assumptions for Synthesis.- Verification-guided Programmatic Controller Synthesis.- Taming Large Bounds in Synthesis from Bounded-Liveness Specifications.- Lockstep Composition for Unbalanced Loops.- Synthesis of Distributed Agreement-Based Systems with Effciently Decidable Verification.- LTL Reactive Synthesis with a Few Hints.- Timed Automata Verification and Synthesis via Finite Automata Learning.- Graphs/Probabilistic Systems.- A Truly Symbolic Linear-Time Algorithm for SCC Decomposition.- Transforming quantified Boolean formulas using biclique covers.- Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration.- Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants.- Runtime Monitoring/Program Analysis.- Industrial-Strength Controlled Concurrency Testing for C# Programs with Coyote.- Context-Sensitive Meta-Constraint Systems for Explainable Program Analysis.- Explainable Online Monitoring of Metric Temporal Logic.- 12th Competition on Software Verification — SV-COMP 2023.- Competition on Software Verification and Witness Validation: SV-COMP 2023.- Symbiotic-Witch 2: More Efficient Algorithm and Witness Refutation (Competition Contribution).- 2LS: Arrays and Loop Unwinding (Competition Contribution).- Bubaak: Runtime Monitoring of Program Verifiers (Competition Contribution).- EBF 4.2: Black-Box Cooperative Verification for Concurrent Programs (Competition Contribution).- Goblint: Autotuning Thread-Modular Abstract Interpretation (Competition Contribution).- Java Ranger: Supporting String and Array Operations (Competition Contribution).- Korn–Software Verification with Horn Clauses (Competition Contribution).- Mopsa-C: Modular Domains and Relational Abstract Interpretation for C Programs (Competition Contribution).- PIChecker: A POR and Interpolation based Verifier for Concurrent Programs (Competition Contribution).- Ultimate Automizer and the CommuHash Normal Form (Competition Contribution).- Ultimate Taipan and Race Detection in Ultimate (Competition Contribution).- VeriAbsL: Scalable Verification by Abstraction and Strategy Prediction (Competition Contribution).- VeriFuzz 1.4: Checking for (Non-)termination (Competition Contribution).
£31.49
Springer International Publishing AG Tools and Algorithms for the Construction and
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.
£33.24
Springer International Publishing AG Algorithms and Models for the Web Graph: 18th
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.
£42.74
Springer International Publishing AG New Trends of Mathematical Inverse Problems and
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.
£132.99
Springer International Publishing AG Rigorous State-Based Methods: 9th International
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.
£56.99
Springer International Publishing AG Combinatorics on Words: 14th International
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 ContentsInvited 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.
£56.99
Springer International Publishing AG Developments in Language Theory: 27th
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.
£47.49
Springer International Publishing AG Advances in Knowledge Discovery and Data Mining:
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.
£98.99
Springer International Publishing AG Advances in Knowledge Discovery and Data Mining:
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.
£49.49
Springer International Publishing AG Algorithmic Aspects of Cloud Computing: 7th
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.
£42.74
Springer International Publishing AG Mathematical Principles of Topological and
Book SynopsisThis book explores and demonstrates how geometric tools can be used in data analysis. Beginning with a systematic exposition of the mathematical prerequisites, covering topics ranging from category theory to algebraic topology, Riemannian geometry, operator theory and network analysis, it goes on to describe and analyze some of the most important machine learning techniques for dimension reduction, including the different types of manifold learning and kernel methods. It also develops a new notion of curvature of generalized metric spaces, based on the notion of hyperconvexity, which can be used for the topological representation of geometric information.In recent years there has been a fascinating development: concepts and methods originally created in the context of research in pure mathematics, and in particular in geometry, have become powerful tools in machine learning for the analysis of data. The underlying reason for this is that data are typically equipped with some kind of notion of distance, quantifying the differences between data points. Of course, to be successfully applied, the geometric tools usually need to be redefined, generalized, or extended appropriately.Primarily aimed at mathematicians seeking an overview of the geometric concepts and methods that are useful for data analysis, the book will also be of interest to researchers in machine learning and data analysis who want to see a systematic mathematical foundation of the methods that they use. Table of ContentsIntroduction.- Topological foundations, hypercomplexes and homology.- Weighted complexes, cohomology and Laplace operators.- The Laplace operator and the geometry of graphs.- Metric spaces and manifolds.- Linear methods: Kernels, variations, and averaging.- Nonlinear schemes: Clustering, feature extraction and dimension reduction.- Manifold learning, the scheme of Laplacian eigenmaps.- Metrics and curvature.
£53.99
Springer International Publishing AG Computers and Games: International Conference, CG
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.
£42.74
Springer International Publishing AG Unconventional Computation and Natural
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.
£47.49
Springer International Publishing AG New Frontiers in Artificial Intelligence:
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.
£56.99
Springer International Publishing AG Automated Deduction – CADE 29: 29th International
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).
£31.49
Springer International Publishing AG Implementation and Application of Automata: 27th
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.
£47.49
Springer International Publishing AG Graph-Based Representation and Reasoning: 28th
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.
£42.74
Springer International Publishing AG Recent Trends in Algebraic Development
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 ContentsInvited 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.
£42.74
Springer International Publishing AG Graph-Theoretic Concepts in Computer Science:
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.
£61.74
Springer International Publishing AG Automated Reasoning with Analytic Tableaux and
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.
£31.49
Springer International Publishing AG Hypothesis Generation and Interpretation: Design
Book SynopsisThis book focuses in detail on data science and data analysis and emphasizes the importance of data engineering and data management in the design of big data applications. The author uses patterns discovered in a collection of big data applications to provide design principles for hypothesis generation, integrating big data processing and management, machine learning and data mining techniques. The book proposes and explains innovative principles for interpreting hypotheses by integrating micro-explanations (those based on the explanation of analytical models and individual decisions within them) with macro-explanations (those based on applied processes and model generation). Practical case studies are used to demonstrate how hypothesis-generation and -interpretation technologies work. These are based on “social infrastructure” applications like in-bound tourism, disaster management, lunar and planetary exploration, and treatment of infectious diseases. The novel methods and technologies proposed in Hypothesis Generation and Interpretation are supported by the incorporation of historical perspectives on science and an emphasis on the origin and development of the ideas behind their design principles and patterns. Academic investigators and practitioners working on the further development and application of hypothesis generation and interpretation in big data computing, with backgrounds in data science and engineering, or the study of problem solving and scientific methods or who employ those ideas in fields like machine learning will find this book of considerable interest.Table of ContentsBasic Concept.- Hypothesis.- Science and Hypothesis.- Regression.- Machine Learning and Integrated Approach.- Hypothesis Generation by Difference.- Methods for Integrated Hypothesis Generation.- Interpretation.
£143.99
Springer International Publishing AG Complex Computational Ecosystems: First
Book SynopsisThis book constitutes the proceedings of the First International Conference on Complex Computational Ecosystems, CCE 2023, held in Baku, Azerbaijan, during April 25–27, 2023. The 16 full papers and the 4 keynote abstracts included in this volume were carefully reviewed and selected from 46 submissions. They explore trans-disciplinary challenges that crossed theoretical questions with empirical observations of multi-level and multi-modal computational ecosystems.Table of ContentsKeynotes.- Symbolic Artificial Intelligence.- Machine Learning, Artificial Evolution and Genetic Programming.- Agro-ecological computational ecosystems.- Security for complex computing systems.- Education computational ecosystems.- Satellite and Climate ecosystems.- Geosphere computational ecosystems.
£44.99
Birkhauser Verlag AG Structural Decision Diagrams in Digital Test: Theory and Applications
Book SynopsisThis is the first book that sums up test-related modeling of digital circuits and systems by a new structural-decision-diagrams model. The model represents structural and functional information jointly and opens a new area of research.The book introduces and discusses applications of two types of structural decision diagrams (DDs): low-level, structurally synthesized binary DDs (SSBDDs) and high-level DDs (HLDDs) that enable diagnostic modeling of complex digital circuits and systems.Topics and features: Provides the definition, properties and techniques for synthesis, compression and optimization of SSBDDs and HLDDs Provides numerous working examples that illustrate the key points of the text Describes applications of SSBDDs and HLDDs for various electronic design automation (EDA) tasks, such as logic-level fault modeling and simulation, multi-valued simulation, timing-critical path identification, and test generation Discusses the advantages of the proposed model to traditional binary decision diagrams and other traditional design representations Combines SSBDDs with HLDDs for multi-level representation of digital systems for enabling hierarchical and cross-level solving of complex test-related tasks This unique book is aimed at researchers working in the fields of computer science and computer engineering, focusing on test, diagnosis and dependability of digital systems. It can also serve as a reference for graduate- and advanced undergraduate-level computer engineering and electronics courses.Three authors are affiliated with the Dept. of Computer Systems at the Tallinn University of Technology, Estonia: Raimund Ubar is a retired Professor, Jaan Raik and Maksim Jenihhin are tenured Professors. Artur Jutman, PhD, is a researcher at the same university and the CEO of Testonica Lab Ltd., Estonia.Table of ContentsChapter 1: Introduction.- Chapter 2: Overview of structural decision diagrams.- Chapter 3: Structurally Synthesized Binary Decision Diagrams.- Chapter 4: Fault modeling in digital circuits.- Chapter 5: Logic-level fault simulation.- Chapter 6: Test generation, fault diagnosis and testability.- Chapter 7: High-Level Decision Diagrams.- Chapter 8: Test generation for microprocessors with HLDDs.
£179.99
Springer International Publishing AG Rules and Reasoning: 7th International Joint
Book SynopsisThis book constitutes the refereed proceedings of the 7th International Joint Conference on Rules and Reasoning, RuleML+RR 2023, held in Oslo, Norway, during September 18–20, 2023. The 13 full papers and 3 short papers included in these proceedings were carefully reviewed and selected from 46 submissions. They focus on all aspects of theoretical advances; novel technologies; innovative applications; knowledge representation; reasoning with rules; and research, development, applications of rule-based systems. Table of ContentsPapers.- Extension of Regression Tsetlin Machine for Interpretable Uncertainty Assessment.- GUCON: A Generic Graph Pattern based Policy Framework for Usage Control Enforcement.- Combining Proofs for Description Logic and Concrete Domain Reasoning.- Notation3 as an Existential Rule Language.- Fine-tuning Large Enterprise Language Models via Ontological Reasoning.- Layerwise Learning of Mixed Conjunctive and Disjunctive Rule Sets.- Analyzing Termination for Prev-Aware Fragments of Communicating Datalog Programs.- Marrying Query Rewriting and Knowledge Graph Embeddings.- Lore: Educational Deductive Database System.- Comparing State of the Art Rule-Based Tools for Information Extraction.- A Case Study for Declarative Pattern Mining in Digital Forensics.- Semantic Role Assisted Natural Language Rule Formalization for Intelligent Vehicle.- FreeCHR: An Algebraic Framework for CHR-Embeddings.- Explaining the optimal trajectories.- Abstract Domains for Database Manipulating Processes.- Extracting Interpretable Hierarchical Rules from Deep Neural Networks’ Latent Space.
£47.49
Springer International Publishing AG Reachability Problems: 17th International
Book SynopsisThis book constitutes the refereed proceedings of the 17th International Conference on Reachability Problems, RP 2023, held in Nice, France, during October 11–13, 2023.The 13 full papers included in this book were carefully reviewed and selected from 19 submissions. They present recent research on reachability problems to promote the exploration of new approaches for the modeling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.Table of ContentsInvited Papers.- Randomness quality and trade-offs for CA random string generators.- Regular Papers.- Complexity of Reachability Problems in Neural Networks.- Weakly synchronous systems with three machines are Turing powerful.- On the Identity and Group Problems for Complex Heisenberg Matrices.- Reachability analysis of a class of hybrid gene regulatory networks.- Quantitative Reachability Stackelberg-Pareto Synthesis.- Multi-Weighted Reachability Games.- On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions.- Adaptive Directions for Bernstein-based Polynomial Set Evolution.- Introducing Divergence for Infinite Probabilistic Models.- A Framework for the Competitive Analysis of Model Predictive Controllers.- Matching Patterns with Variables Under Simon’s Congruence.- HyperMonitor: A Python Prototype for Hyper Predictive Runtime Verification.- Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs.
£47.49
Springer International Publishing AG Automated Technology for Verification and
Book SynopsisThis book constitutes the refereed proceedings of the 21st International Symposium on Automated Technology for Verification and Analysis, ATVA 2023, held in Singapore, in October 2023. The symposium intends to promote research in theoretical and practical aspects of automated analysis, verification and synthesis by providing a forum for interaction between regional and international research communities and industry in related areas. The 30 regular papers presented together with 7 tool papers were carefully reviewed and selected from 150 submissions.The papers are divided into the following topical sub-headings: Temporal logics, Data structures and heuristics, Verification of programs and hardware. Table of ContentsTemporal logics.- Data structures and heuristics.- Verification of programs and hardware.- Tool papers.
£56.99
Springer International Publishing AG Logic-Based Program Synthesis and Transformation:
Book SynopsisThis book constitutes the refereed proceedings of the 33rd International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2023, held in Cascais, Portugal, during October 23-24, 2023. The 8 full papers and 4 short papers included in this book were carefully reviewed and selected from 29 submissions. They were organized in topical sections as follows: Horn Clauses Analysis, Transformation and Synthesis; Static analysis and Type systems; Unification and substitution in (C)LP; and Knowledge representation and AI-based learning.Table of ContentsKeynotes.- Unification modulo equational theories in languages with binding operators.- Horn Clauses Analysis, Transformation and Synthesis.- Design Datalog Templates for Synthesizing Bidirectional Programs from Tabular Examples.- Transforming big-step to small-step semantics using interpreter specialisation.- Constrained Horn Clauses Satisfiability via Catamorphic Abstractions.- Static analysis and Type systems.- A reusable machine-calculus for automated resource analyses.- Approach for Designing and Composing Abstract Domains.- A Logical Interpretation of Asynchronous Multiparty Compatibility.- Relational Solver for Java Generics Type System.- Unification and substitution in (C)LP.- Predicate Anti-unification in (Constraint) Logic Programming.- A term matching algorithm and substitution generality.- Knowledge representation and AI-based learning.- A novel EGs-based framework for systematic propositional-formula simplification.- From Static to Dynamic Access Control Policies via Attribute-Based Category Mining.- Towards a Certified Proof Checker for Deep Neural Network Verification.
£42.74
Springer International Publishing AG AIxIA 2023 – Advances in Artificial Intelligence:
Book SynopsisThis book constitutes the refereed proceedings of the XXIInd International Conference on AIxIA 2023 – Advances in Artificial Intelligence, AIxIA 2023, held in Rome, Italy, during November 6–10, 2023.The 33 full papers included in this book were carefully reviewed and selected from 53 submissions. They were organized in topical sections as follows: Argumentation and Logic Programming, Natural Language Processing, Machine Learning, Hybrid AI and Applications of AI.Table of ContentsArgumentation and Logic Programming.- ABALearn: An automated logic-based learning system for ABA frameworks.- Deriving Dependency Graphs from Abstract Argumentation Frameworks.- ReConf: An Automatic Context-based Software Reconfiguration Tool for Autonomous Vehicles using Answer-Set Programming.- Mining contrast sequential patterns with ASP.- Ontologies.- An ontological modelling of reason-based preferences.- A Defeasible Description Logic for Abduction.- Ontology-based Data Management in Healthcare: The Case of the Italian Arthroplasty Registry.- Planning.- A Structure-Sensitive Translation from Hybrid to Numeric Planning.- Intrinsically Motivated High-Level Planning for Agent Exploration.- Natural Language Processing.- Mining Argument Components in Essays at Different Levels.- Unraveling ChatGPT: A Critical Analysis of AI-Generated Goal-Oriented Dialogues and Annotations.- Scaling Large Language Models to the Extreme: Neural Semantic Processing of Multiple Tasks in Italian.- Named Entity Recognition and Linking for Entity Extraction from Italian Civil Judgements.- Machine Learning.- CENTAURO: an Explainable AI Approach for Customer Loyalty Prediction in Retail Sector.- Toward Novel Optimizers: A Moreau-Yosida View of Gradient-based Learning.- Mastering the Card Game of Jaipur through Zero-knowledge Self-Play Reinforcement Learning and Action Masks.- Uncovering Bias in the Face Processing Pipeline: An Analysis of Popular and State-of-the-Art Algorithms Across Demographic Groups.- A multi-label classification study for the prediction of long-covid syndrome.- PAUL-2: An Upgraded Transformer-Based Redesign of the Algorithmic Composer PAUL.- Robotics and Perception.- Understanding the Effect of Deep Ensembles in LiDAR-based Place Recognition.- Enanching LiDAR performance: Robust De-skewing Exclusively Relying o n Range Measurements.- Can Existing 3D Monocular Object Detection Methods Work in Roadside Contexts? A Reproducibility Study.- Embedding Shepard's Interpolation into CNN Models for Unguided Depth Completion.- Performance evaluation of depth completion neural networks for various RGB-D camera technologies in indoor scenario.- Hybrid AI.- Inference in Probabilistic Answer Set Programming under the Credal Semantics.- Efficient Modal Decision Trees.- Clique-TF-IDF: A New Partitioning Framework based on Dense Substructures.- Combining Contrastive Learning and Knowledge Graph Embeddings to develop medical word embeddings for the Italian language.- Applications of AI.- Recognizing the Style, Genre, and Emotion of a Work of Art Through Visual and Knowledge Graph Embeddings.- Combining genetic algorithms and temporal constraint satisfaction for recommending personalized tourist itineraries.- Towards Automatic Digitalization of Railway Engineering Schematics.- Election Manipulation in Social Networks with Single-Peaked Agents.- Learning to Prompt in the Classroom to Understand AI Limits: A pilot study.
£53.99
Springer International Publishing AG Theoretical Aspects of Computing – ICTAC 2023:
Book SynopsisThis book constitutes the proceedings of the 20th International Colloquium on Theoretical Aspects of Computing, ICTAC 2023, which took place in Lima, Peru, during December 4–8, 2023. The 20 full papers presented in this volume together with 3 invited papers and 1 tool paper were carefully reviewed and selected from 40 submissions. They were organised in the topical sections as follows: Bring Together Practitioners; Researchers from Academia; Industry; Government to Present Research Results and Exchange Experience and Ideas.Table of ContentsOptimal Route Synthesis in Space DTN using Markov Decision Processes.- Modelling and Verifying Robotic Software that use Neural Networks.- A game-theoretic approach to indistinguishability of winning objectives as user privacy.- Learning Attack Trees by Genetic Algorithms.- The Landscape of Computing Symmetric $n$-Variable Functions with $2n$ Cards.- On the complexity of reasoning in Kleene algebras with commutativity conditions.- Towards the Complexity Analysis of Programming Language Proof Methods.- A Dynamic Temporal Logic for Quality of Service in Choreographic Models.- Interactive Matching Logic Proofs in Coq.- An Autonomous Data Language.- Formal Language Semantics for Triggered Enable Statecharts with a Run-to-Completion Scheduling.- Strong Call-by-Value and Multi Types.- Algorithms for Checking Intersection Non-emptiness of Regular Expressions.- Realisability of Global Models of Interaction.- Efficient Reactive Synthesis Using Mode Decomposition.- A Categorical Approach to Synthetic Chemistry.- Closure and Decision Properties for Higher-Dimensional Automata.- Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad.- Moggi Synchronous Agents, Verification, and Blame – A Deontic View.- Store Locally, Prove Globally.- Denotational Semantics for Symbolic Execution.- TOOL PAPER: Tessla-ROS-Bridge - Runtime Verification of Robotic Systems.- Simplifying process parameters by unfolding algebraic data types.- Modular Soundness Checking of Feature Model Evolution Plans.
£61.74
Springer International Publishing AG Algorithmics of Wireless Networks: 19th
Book SynopsisThis book constitutes the refereed proceedings of the 19th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2023, held in Amsterdam, The Netherlands, during September 7–8, 2023.The 10 full papers included in this book were carefully reviewed and selected from 22 submissions. They were organized in topical sections as follows: design and analysis of algorithms, models of computation and experimental analysis.Table of ContentsSegment Visibility for k-transmitters.- Conflict Resolution in Arbitrary Hypergraphs.- Dispatching the Minimum Number of UAVs in Neighborhood IoT Networks.- Mutual Visibility with ASYNC Luminous Robots having Inaccurate Movements.- Minimum Degree and Connectivity in 1-Dimensional Line of Sight Networks.- WUBBLE: Energy Efficient BLE Neighborhood Discovery Leveraging Wake-up Radio.- Byzantine Fault-Tolerant Protocols for $(n, f)$-evacuation from a Circle.- Temporal Reachability Dominating Sets: contagion in temporal graphs.- Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information.- Run for Cover: Dominating Set via Mobile Agents.
£42.74
Springer International Publishing AG Combinatorial Optimization and Applications: 16th
Book SynopsisThe two-volume set LNCS 14461 and LNCS 14462 constitutes the refereed proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2023, held in Hawaii, HI, USA, during December 15–17, 2023. The 73 full papers included in the proceedings were carefully reviewed and selected from 117 submissions. They were organized in topical sections as follows: Part I: Optimization in graphs; scheduling; set-related optimization; applied optimization and algorithm; Graph planer and others;Part II: Modeling and algorithms; complexity and approximation; combinatorics and computing; optimization and algorithms; extreme graph and others; machine learning, blockchain and others.Table of ContentsModeling and Algorithms.- Differentiable Discrete Optimization using Dataless Neural Networks.- When Advertising meets Assortment Planning: Joint Advertising and Assortment Optimization under Multinomial Logit Model.- Twin-treewidth: A single-exponential logic-based approach.- Highway Preferential Attachment Models for Geographic Routing.- Complexity and Approximation.- Restricted Holant Dichotomy on Domains 3 and 4.- Earliest Deadline First is a $2$-approximation for DARP with Time Windows.- Improved approximation for broadcasting in k-Path Graphs.- The fine-grained complexity of approximately counting proper connected colorings (extended abstract).- Combinatorics and Computing.- Strong edge coloring of subquartic graphs.- Two multicolor Ramsey numbers involving bipartite graphs.- Mechanism Design for Time-Varying Value Tasks in High-Load Edge Computing Markets.- Computing random r-orthogonal Latin squares.- Optimization and Algorithms.- A Two-stage Seeds Algorithm for Competitive Influence Maximization considering User Demand.- Practical Attribute-Based Multi-Keyword Search Scheme with Sensitive Information Hiding for Cloud Storage Systems.- Testing Higher-order Clusterability on graphs.- The $2$-mixed-center color spanning problem.- A Dynamic Parameter Adaptive Path Planning Algorithm.- On the Mating Between a Polygonal Curve and a Convex Polygon.- A Faster Parameterized Algorithm for Bipartite 1-Sided Vertex Explosion.- Multi-Winner Approval Voting with Grouped Voters.- EFX Allocation to Chores Over Small Graph.- Extreme Graph and Others.- Zero-visibility Cops and Robber game on Cage graph.- Online Facility Assignment for General Layout of Servers on a Line.- Guarding Precise and Imprecise Polyhedral Terrains with Segments.- The Bag-Based Search: A meta-algorithm to construct tractable logical circuits for graphs based on tree decomposition.- On Problems Related to Absent Subsequences.- Some Combinatorial Algorithms on the Dominating Number of Anti-Rank k Hypergraphs.- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints.- Critical $(P_5,dart)$-Free Graphs.- Graph Clustering through Users' Properties and Social Influence.- Machine Learning, Blockchain and Others.- Incorporating Neural Point Process-based Temporal Feature for Rumor Detection.- Improving Contraction Hierarchies by Combining with All-Pairs Shortest Paths Problem Algorithms.- Information Theory of Blockchain Systems.- Machine Learning with Low Resource Data from Psychiatric Clinics.- Single Image Dehazing Based on Dynamic Convolution and Transformer.- Reinforcement Learning for Combating Cyberbullying in Online Social Networks.
£61.74
Springer International Publishing AG SOFSEM 2024: Theory and Practice of Computer
Book SynopsisThis book constitutes the proceedings of the 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, held in Cochem, Germany, in February 2024. The 33 full papers presented in this book were carefully reviewed and selected from 81 submissions. The book also contains one invited talk in full paper length. They focus on original research and challenges in foundations of computer science including algorithms, AI-based methods, computational complexity, and formal models.Table of ContentsThe Information Extraction Framework of Document Spanners - A Very Informal Survey.- Generalized Distance Polymatrix Games.- Relaxed agreement forests.- On the Computational Complexity of Generalized Common Shape Puzzles.- Fractional Bamboo Trimming and Distributed Windows Scheduling.- New support size bounds and proximity bounds for integer linear programming.- On the Parameterized Complexity of Minus Domination.- Exact and Parameterized Algorithms for Choosability.- Parameterized Algorithms for Covering by Arithmetic Progressions.- Row-column combination of Dyck words.- Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures.- On the parameterized complexity of the Perfect Phylogeny problem.- Data reduction for directed feedback vertex set on graphs without long induced cycles.- Visualization of Bipartite Graphs in Limited Window Size.- Outerplanar and Forest Storyplans.- The Complexity of Cluster Vertex Splitting and Company.- Morphing Graph Drawings in the Presence of Point Obstacles.- Word-Representable Graphs from a Word’s Perspective.- Removable Online Knapsack with Bounded Size Items.- The Complexity of Online Graph Games.- Faster Winner Determination Algorithms for (Colored) Arc Kayles.- Automata Classes Accepting Languages Whose Commutative Closure is Regular.- Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching.- Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages.- Apportionment with Thresholds: Strategic Campaigns Are Easy in the Top-Choice But Hard in the Second-Chance Mode.- Local Certification of Majority Dynamics.- Complexity of Spherical Equations in Finite Groups.- Positive Characteristic Sets for Relational Pattern Languages.- Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs.- The Weighted HOM-Problem over Fields.- Combinatorics of block-parallel automata networks.- On the piecewise complexity of words and periodic words.- Distance Labeling for Families of Cycles.- On the induced problem for fixed-template CSPs.
£61.74
Springer Computational Science ICCS 2024
Book Synopsis
£56.99
Springer Nature Switzerland Computer Aided Verification
Book Synopsis
£31.49
Springer Computer Algebra in Scientific Computing
Book Synopsis
£98.99
Springer Nature Switzerland Formal Aspects of Component Software
Book SynopsisVerification and testing: Enabling behaviour tree verification via a translation to BIP.- Verified fault handling for modern board management controllers.- Testing compositionality. Formal models: Correct pattern-based development through refinements and weakest preconditions calculus.- Coq formalization of orientation representation: matrix, Euler angles, axis-angle and quaternion.- Reactive graphs in action. Security and blockchain: Extracting formal smart-contract specifications from natural language with LLMs.- How do asynchronous communication models impact the composability of information flow security?
£40.49
Springer Mathematical Optimization Theory and Operations
Book Synopsis
£58.49
Springer Theoretical Aspects of Computing ICTAC 2024
Book SynopsisAutomata, Languages, and Learning.- Well Behaved (Co)algebraic Semantics of Regular Expressions in Dafny.- Jump Complexity of Deterministic Finite Automata with Translucent Letters.- Learning Closed Signal Flow Graphs.- Dual Adjunction Between $Omega$ Automata and Wilke Algebra Quotients.- On Concurrent Program Algebra and Demonic Automata.- Bisimulations and Logics for Higher Dimensional Automata.- Algorithms and Complexity.- Maximizing Weighted Dominance in the Plane.- Generalized Parikh Matrices For Tracking Subsequence Occurrences.- Card Based Protocols with Single Card Encoding.- Graphs and Games.- Winning Strategy Templates for Stochastic Parity Games towards Permissive and Resilient Control.- Disconnection Rules are Complete for Chemical Reactions.- Verification with Common Knowledge of Rationality for Graph Games.- Process Calculi.- Reversibility in Process Calculi with Nondeterminism and Probabilities.- A T
£53.99
Springer Optimization and Applications
Book SynopsisMathematical Programming.- Hybrid Method for Linear ProgrammingHybrid Method for Linear Programming.- An Equilibrium Dynamic Traffic Assignment Model with Linear Programming Formulation.- Singular optimization problems and p-factor approach for their analysis.- On the Application of Composite Penalty Functions Obtained by Gluing of External Penalties with Barrier Ones in Linear Programming.- Nesterov's Method of Dichotomy via Order Oracle: The Problem of Optimizing a Two-Variable Function on a Square.- Piecewise Linear Approximations in the Balanced Identification of Models with Differential Equations.- Extragradient Sliding for Composite Non-Monotone Variational Inequalities.- Global Optimization.- A Three-Stage Numerical Approach to the Study of Extra-Large Atomic-Molecular Clusters.- Comparative Efficiency of Machine Learning Models for Enhancing Algorithms in Solving Multiextremal Multicriteria Problems.- Automated Multi-Criteria Optimization of Parallel Robots.- Optimal Selection of Feedback Coefficients in the Problem of Stabilizing a Chain of Three Integrators.- Optimal Control.- On Some Sufficient Condition for Quadraticity of a Degenerate Optimization Problem with Inequality Constraints.- A Maximum Principle for a State-Constrained Optimal Control Problem Whose Data Is Measurable in the Time-variable.- Game Theory and Mathematical Economics.- Nash and Stackelberg Equilibria in Differential Games with Functionals in the Form of the Minimum Antagonistic and Partial Criteria.- A Model of Investment Policy of Firms.- Optimization in Economics and Finance.- The Ramsey's Conjecture for the Model with Non-Liquid Capital.- A Nonlinear Input-Output-Based Model for Medium-Term Macroeconomic Risks Analysis for a Restructuring Economy with Limited Capacities.- Optimal Timing of Investment and Debt Payment in Production Expansion with the Use of External Financing.- Identification of an Endogenous Production Function for the U.S. Economy.- An Ecological and Economic Model of Carbon Neutrality.- Applications.- Optimal Control Problem in Treatment Strategies for Breast Tumors.- The Use of Both Temperature Field and Heat Fluxes to Identify the Thermal Conductivity and Volumetric Heat Capacity.- Maximising the Discounted Accumulated Income in the Model with Two Gas Fields.- Modeling and Optimization of Controlled Conveyor Systems Using Intelligent Controllers.
£53.99
Springer Applied Antifragility in Technical Systems
Book SynopsisIntroduction.- Multistability and Intrinsic Antifragility.- Inherited Antifragility.- Induced Antifragility.- Conclusions and Open Research Questions.
£35.99
Springer Rigorous StateBased Methods
Book Synopsis.- An Invited Talk about B..- Neurosymbolic Learning Systems: Artificial Intelligence and Formal Methods..- Mathematical Proofs and Moving Trains: The Double Life of Atelier B..- Behavioural Theory of Reflective Parallel Algorithms..- Using Symbolic Model Execution to Detect Vulnerabilities of Smart Contracts..- Safely Encoding B Proof Obligations in SMT-LIB..- On Writing Alloy Models: Metrics and a new Dataset..- On Quantitative Solution Iteration in QAlloy..- Proof Semantics of Railway Interlocking..- Translating Event-B models and development proofs to TLA..- The Proved Construction of a Protocol with an Example..- Insider Threat Simulation Through Ant Colonies and ProB..- Developing safe exception recovery mechanisms for CHERI capability hardware using UML-B formal analysis..- Case Study: Safety Controller for Autonomous Driving on Highways..- Safety enforcement for autonomous driving on a simulated highway using Asmeta models@run.time..- Enhancing Decision-making Safety in Autonomous Driving Through Online Model Checking..- Polychronous RSS in a Process-Algebraic Framework - A Case Study in Autonomous Driving Safety..- On The Road Again (Safely): Modelling and Analysis of Autonomous Driving with extsc{Stark}..- Modelling and Verification of Highway Car Control with KeYmaera X..- State-Based Modelling with a Concept DSL..- Towards an End-to-End Tool Chain for Traceable and Verifiable Railway Signalling Specifications..- A reasoning and explicit algebraic theory for BBSL in Event-B: EB4BBSL framework..- Model-Based Testing of Non-Deterministic Systems..- Weakening Goals in Logical Specifications..- Formal modelling and reasoning on Assurance Cases expressed with GSN in Event-B.
£98.99
Springer Data Visualization with Category Theory and
Book SynopsisChapter 1. Introduction.- Chapter 2. Illustrating UMAP on some simple data sets.- Chapter 3. Metrics and Riemannian manifolds.- Chapter 4. Merging fuzzy simplicial sets and metric spaces: A category theoretical approach.- Chapter 5. UMAP.- Chapter 6. IsUMap: An alternative to the UMAP embedding.
£40.49
Springer Nature Switzerland Testing Software and Systems
£98.99
£53.99
