Mathematical theory of computation Books
Springer Logic and Its Applications
Book SynopsisOn Extensions of Partial Isometries.- The Specker-Blatter Theorem: An Application of Logic toCombinatorial Counting.- Propositional Dynamic Logic Formula Synthesis and some Applications.- NSOP1 as a dividing line.-Asynchronous transition system games for two processes and their analysis.- Relational Companions of Logics.- Bounded Henkin Quantifiers and the Exponential Time Hierarchy.- Monotone Modal Logic beyond Distributivity.- Recognizing Numbers.- There is hope for connexive set theories!.- Semantics of Basic Modal Language via a Rough Set Framework.- Modal and intermediate logics of spiked Boolean algebras.- Equivalence of Deterministic Weighted Real-time One-Counter Automata.- Passive Learning of Fuzzy Temporal Logic Rules from Finite Traces.- A Mimamsa Inspired Framework towards Temporal Reasoning in Large Language Models.- Measurement-Theoretic Foundations of Logic of Inexact Knowledge.- Craig Interpolation for Awareness Logics.- Knowable as Knowing How to Inquire.
£49.99
Springer Applications of Evolutionary Computation
Book Synopsis.- EvoApplications..- Optimizing Dietary Plans Using Evolutionary Algorithms..- Building Cross-Sectional Trading Strategies via Geometric Semantic Genetic Programming..- Adjacent Distance Matrix-based Competitive Swarm Optimizer..- The More the Merrier: On Evolving Five-valued Spectra Boolean Functions..- Search Trajectory Networks Applied to a Real-world Parallel Batch Scheduling Problem..- Optimizing the logistics operations of distribution network operators from a multinational electric utility company..- Analysis of Illicit Drug Mixtures at Festivals Using Portable Near-Infrared Spectroscopy with Genetic Programming..- Hybrid Optimization of Horizontal Alignments in European Terrains: A Comparative Study..- Facial Geometric Feature Extraction for Dimensional Emotion Analysis Using Genetic Programming..- Methodology for Designing Injection Molds: Data Mining and Multi-Objective Optimization..- Climbing the tower of meta-mutations - the role of higher-order mutations..- Evolutionary Reinforcement Learning for Interpretable Decision-Making in Supply Chain Management..- Grammatical Feature Construction for Enhanced Interpretability in Breast Cancer Classification..- Designing Hardware-Friendly Hash Functions for Network Security Using Cartesian Genetic Programming..- Understanding trade-offs in classifier bias with quality-diversity optimization: an application to talent management..- Genetic Programming with Co-operative Co-evolution for Feature Manipulation in Basal Cell Carcinoma Identification..- Multi-Objective Evolutionary Optimization of Virtualized Fast Feedforward Networks..- Variable-Size Genetic Network Programming for Portfolio Optimization with Trading Rules..- Evolving Dynamic Fault Mitigation Strategies in a Robot Swarm for Collective Transport..- Inferring Reaction Elasticities from Metabolic Correlations in Cells through Multi-objective Evolutionary Optimization..- Trace-Elites: better Quality-Diversity with Multi-Point Descriptors..- Optimizing Camera Placement for Chicken Farm Monitoring..- Adaptive Local Search for Real-World Multi-Echelon Inventory Control..- Evolutionary Computation for Causality-Driven Feature Selection: A Preliminary Study..- A Coach-Based Quality-Diversity Approach for Multi-Agent Interpretable Reinforcement Learning..- FedGP: Genetic Programming for Evolutionary Aggregation in Federated Learning with Non-IID data..- A Genetic Algorithm Approach for Aggregation of Residential Electricity Prosumers’ Flexibility..- Algorithm Selection with Probing Trajectories: Benchmarking the Choice of Classifier Model..- Real Application Challenges in Evolutionary Optimization? People!..- The Importance of Being Earnest: Multiple Heterogeneous Container Loading with a Simple Genetic Algorithm..- Emergent kin selection of altruistic feeding behaviour via non-episodic neuroevolution..- Stalling in Space: Attractor Analysis for any Algorithm..- Using Local Correlation Between Objectives to Detect Problem Modality..- Greater AI Design Control Aids Evolution of Computational Materials..- Scalable Evolution of Logically Independent Polycomputational Materials.
£64.99
Springer Applications of Evolutionary Computation
Book Synopsis.- Evolutionary machine learning..- Social Interpretable Reinforcement Learning..- Into the Black Box: Mining Variable Importance with XAI..- Evolving RNNs for Stock Forecasting: A Low Parameter Efficient Alternative to Transformers..- Generate more than one child in your co-evolutionary semi-supervised learning GAN..- EDCA – An Evolutionary Data-Centric AutoML Framework for Efficient Pipelines..- 30 years of particle swarm optimisation..- Proposal of Efficient Particle Swarm Optimization for Constrained Optimization Problems..- A Survey of Modern Hybrid Particle Swarm Optimization Algorithms..- An Investigation of Structural Bias in Particle Swarm Optimization..- GPSO in PTO..- We are Sending you Back... to the Optimum! Fuzzy Time Travel Particle Swarm Optimization..- Memetic Variations of Overlapping Swarm Intelligence..- Analysis of Evolutionary Computation Methods: Theory, Empirics, and Real-World Applications..- Multi-Tree Genetic Programming for Large-scale Dynamic Tugboat Scheduling..- Bio-inspired Algorithms for Green Computing and Sustainable Complex Systems..- Hybridization of techniques based on Genetic Algorithms and Neural Networks to determine the water requirements of fig trees..- Evaluating the Impact of Hysteretic Phenomena and Implementation Choices on Energy Consumption in Evolutionary Algorithms..- Measuring energy consumption of BBOB fitness functions..- Computational Intelligence for Sustainability..- A PSO-based MPPT with Dynamic Monitoring Reset for PV Systems..- An innovative approach for managing the water requirements of fig trees using artificial intelligence..- GPBus: Genetic Programming based Automated Machine Learning for Bus Delay Prediction..- Improving Fairness in Allocation of Emergency Medical Services using Multi-Objective Evolutionary Optimization..- A Multi-Agent System for Optimal Train Scheduling in Single-Track Railways..- EvoLLMs (Integrating Evolutionary Computing with Large Language Models (LLMs)..- Evolutionary Bias Identification with Embeddings..- Probing LLMs on Optimization Problems: Can They Recall and Interpret Problem Features?..- Open and Closed-source Models for LLM-generated Metaheuristics Solving Engineering Optimization Problem..- Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing..- Controlling the Mutation in Large Language Models for the Efficient Evolution of Algorithms..- Evolutionary Computation in Edge, Fog, and Cloud Computing..- A Communication-aware and Energy-efficient Genetic Programming based Method for Dynamic Resource Allocation in Clouds..- A Genetic Algorithm-Based Parameter Selection for Communication Efficient Federated Learning..- Evolutionary Computation in Image Analysis, Signal Processing, and Pattern Recognition..- Evolving Cellular Automata with Function-Based Conditional Rules for Image Filtering..- Machine Learning and AI in Digital Healthcare and Personalized Medicine..- Addressing Radiotherapy Scheduling with a Bin Packing Problem Formulation: A Comparative Study of Exact Solvers and Genetic Algorithms..- A Symbolic Regression Screening Approach within Peptide Optimisation..- Estimation of total body fat using symbolic regression and evolutionary algorithms..- Soft Computing Applied to Games..- Injecting Combinatorial Optimization into MCTS: Application to the Board Game boop..- Robust search for the underlying objectives in black-box games with binary outcomes.
£64.99
Springer Artificial Intelligence in Music Sound Art and Design
Book Synopsis.- Long Talks..- Yin-Yang: Developing Motifs With Long-Term Structure And Controllability..- Foundations of LLCM: Labelled Lambek Calculus for Music Analysis..- Large-image Object Detection for Fine-grained Recognition of Punches Patterns in Medieval Panel Painting..- Cellular Au-Tonnetz: A Unified Audio-Visual MIDI Generator UsingTonnetz, Cellular Automata, and IoT..- The Importance of Context in Image Generation: A Case Study forVideo Game Sprites..- Perceptions of AI in Animation Production..- Search-based Negative Prompt Optimisation for Text-to-Image Generation..- Exploring the Application of AIGC in Ink-Wash Animation Creation:A Case Study of Dragon Gate..- AI in Music and Healthcare: A Comparative Survey..- Combining local search and directed mutation in evolutionaryapproaches to 4-part harmony..- Exploiting the Temporal Order of Sound Features for Onset Detection..- Towards Human-Quality Drum Accompaniment Using Deep GenerativeModels and Transformers..- An Ensemble Approach to Music Source Separation: A ComparativeAnalysis of Conventional and Hierarchical Stem Separation..- Balancing Indeterminacy and Structure: Neural Text Generation forArtistic Inspiration..- Exploring Bridges Between Algorithmic and AI-generated Art..- Future Sight: Fine-tuning Language Models for Dynamic Story Generation..- Short Talks..- All YIN No YANG: Geometric abstraction of oil paintings with trainedmodels, noise and self-reference..- Exploring Multi-Objective Evolution for Aesthetic & Abstract 3D Art..- Aesthetic biases and opacity tactics in the training of visual artificialintelligence models..- Music Similarity Through Geometric Overlap..- Graph Neural Network vs Feature-based Folk Music Evolution Analysis..- Generating Virtual Landscapes and Environmental Narratives withStyleGAN2..- EmotioNotes Dataset: Decoding emotions in classical music throughConcert Program Notes..- Towards the Automatic Evaluation of Legibility for Graphic DesignPosters..- Short video interestingness: a machine learning approach to determinecreative cues in audiovisual production..- Automated Selection and Ordering of Clip Sequences for Music Videosbased on Tonal Tension and Visual Features..- Evolving the Embedding Space of Diffusion Models in the Field ofVisual Arts..- Steering Large Text-to-Image Model for Kandinsky Synthesis throughPreference-based Prompt Optimization.
£64.99
£134.99
Springer Applied Antifragility in Natural Systems
Book SynopsisIntroduction.- Ecological Antifragility.- Evolutionary Antifragility.- Interventional Antifragility.- Conclusions.
£39.99
£34.99
Springer Structural Information and Communication Complexity
Book SynopsisRegular Papers.- Support + Belief = Decision Trust.- Asynchronous Byzantine Consensus with Trusted Monotonic Counters.- Sublinear-time Collision Detection with a Polynomial Number of Statesin Population Protocols.- On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement.- Exploration of Convex Terrains by a Deterministic Automaton with Pebbles.- Explicit Token-Based Communication for Mobile Entities.- Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs.- Deterministic Color-optimal Self-stabilizing Semi-synchronous Gathering: a Certified Algorithm.- Approximating Independent Sets in Constant Distributed Rounds.- A Visibility vs. Memory Trade-off for Stand-Up Indulgent Gathering on Lines.- Simplicial Belief.- When MIS and Maximal Matching are Easy in the Congested Clique.- Bankrupting DoS Attackers.- Low-Distortion Clustering in Bounded Growth Graphs.- Multimodal Search on a Line.- Multi-Agent Disk Inspection.- Pointer Chasing with Unlimited Interaction.- Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation.- On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies.- Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity.- Lower bounds for uniform read-once threshold formulae in the randomized decision tree model.- Distributed Distance Sensitivity Oracles.- Self-stabilizing Graph Exploration by a Single Agent.- Labeling Embeddings of Planar Graphs for Face-Adjacency.- Brief Announcements.- Brief Announcement: Relaxation for Efficient Asynchronous Queues.- Brief Announcement: A Sheaf-Theoretic Characterization of Tasks in Distributed Systems .- Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model.- Brief Announcement: Perfect Matching with Few Link Activations.
£123.49
Springer Computable Structure Theory
Book SynopsisPart I Foundation of Computability.- 1. Introduction.- 2. Basics of Computability Theory.- 3. Computable Algebraic Structures.- 4. Computable Separable Spaces.- Part II Computable Duality.- 5. Computable Boolean Algebras.- 6. Computable Stone Spaces.- 7. Computable Abelian Groups.- 8. Computable Connected Compact Spaces.- Part III Computability and Classification Problems. 9. The Analytical Hierarchy and S11-completeness.- 10. Computable Categoricity.- 11. Computable Banach Spaces with Applications.- 12. Resource Bounded Computation.- Part IV Non-computability and Randomness. 13. Randomness.- 14. Degree Spectra.- 15.- Computable Transfinite Analysis.
£104.49
Springer Face Method
Book SynopsisPreface.- Acknowledgments.- Notation.- Simplex Method: The State of the Art.- Face Algorithm.- Generalized Face Method.- Dual Face Method.- Generalized Dual Face Method.- Reduced Face Method.- Dual Reduced Face Method.- Face Method with Cholesky Factorization.- Dual Face Method with Cholesky Factorization.- Appendix: Empirical Evaluation of Face and Dual Face Methods with Cholesky Factorization.- References.
£142.49
£104.49
Springer Algorithmic Aspects of Cloud Computing
Book Synopsis.- ALGOCLOUD 2024..- Innovating Medical Record Keeping with Blockchain, RSA-Encrypted NFTs, and Smart Contracts..- Towards 2-Resilient Local Failover in Destination-Based Routing..- Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing..- Achieving Processing Balance in LoRaWAN Using Multiple Edge Gateways..- Optimizing resource-constrained distance matching for cloud based systems..- Edge-based Federated Learning Methods for Remaining Useful Life Estimation in IIoT..- Degree Distribution Optimization in Historical Graphs..- Leveraging Apache Spark for Appliance-Level Load Monitoring with Ensemble Learning Techniques..- QuantuML: Machine Learning Algorithms and K-means on Quantum Cloud offering..- Outsourced Distributed Computation with PROOF..- ALGOCLOUD 2022..- Edge-Enabled Machine Learning for Solar Power Production Forecasting.
£104.49
Springer Crossroads of Computability and Logic Insights Inspirations and Innovations
Book Synopsis.- Invited Papers..- The CDSAT Method for Satisfiability Modulo Theories and Assignment: an Exposition..- Effective second countability in computable analysis..- Towards a Computational Quantum Logic: An Overview of an Ongoing Research Program..- Represented spaces of represented spaces..- Computation with Real Numbers and Continuous-Time Dynamical Systems..- Proof-Carrying Neuro-Symbolic Code..- Uniform Functional Interpretations..- Computable Analysis for Extraction of Certified Programs and its Applications..- Contributed Papers..- The existence of primitive recursive structures..- Space-bounded online Kolmogorov complexity is additive..- On learning existentially definable subsets in a computable structure..- Transfinite structured programming..- Computability of Real Functions with Oracle Pointer Machines implies Real-Time simulation of Chemical Reaction Networks..- Computability of Initial Value Problems..- Full generalized effective reducibility..- On S-Degrees of some Representations of Irrational Numbers..- Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs..- Binary Expansions of Regular Reals and Reordered Computable Numbers..- Properties of Range Sets of Continuous Functions in Reverse Mathematics..- The theory of reachability of trace-pushdown systems..- A point to set principle for finite-state dimension and relativized equidistribution porperties..- Some structural complexity results for $exists mathbb R$..- On the computational power of C-random strings..- Generalized learnability of stochastic principles..- Computably discrete represented spaces..- Multidimensional tilings and MSO logic..- Injectivity of polynomials over finite discrete dynamical systems..- Weihrauch problems as containers..- On the reverse mathematics of cut-elimination and determinacy..- $L {omegaomega}$, $L {omega 1omega}$, and Wadge hierarchy..- Ordinal Invariants of the $h$-Preorder on $k$-Labeled Forests..- Completeness theorems for modal logic in second-order arithmetic..- Variants of Solovay reducibility..- Constructive Analysis of Maximal Ideals in Z[X] by the Material Interpretation..- Alternation-Bounded Semi-Unbounded Fan-in Cascading Circuits and the Complementation Closure Property.
£104.49
Springer Descriptional Complexity of Formal Systems
Book Synopsis.- Fibonacci Pictures on a Binary Alphabet..- A Close Analysis of the Subset Construction..- k-local Graphs..- Word-Representable Graphs and Locality of Words..- Automata for Synchronised Shuffle on Backbones..- Two-Word Shuffle: Some Results..- Matrix Forbidding Grammars..- On the Decidability and Expressive Power of Several Theories Based on String Constraints..- Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals are Computationally Complete..- Disjunctive Complexity..- Two-Way Finite Automata with Translucent Input Letters..- Relative Densities of Formal Languages..- On A Measure for The Descriptional Complexity of Finite Automata with Translucent Words..- What is the Most Natural Generalization of the Pumping Lemmas for Regular and Context-Free Languages?..- Small Balanced Vertex Separators in NFA to Regular Expression Conversion.
£104.49
Springer Principles and Practices of Building Parallel Software
Book SynopsisRetrieving Unknown SMT Formulas via Structural Mutations.- On the Cloud We Can’t Wait: Asynchronous Actors Perform Even Better on the Cloud.- A Formal Model for Portable, Heterogeneous Accelerator Programming.- Evaluation of Speedup and Energy with Multigrain Parallelizing Compiler.- Hidden assumptions in static verification of data-race free GPU programs.- Intrepydd: Toward Performance, Productivity, and Portability for Massive Heterogeneous Parallelism.- Enabling User-level Asynchronous Tasking in the FA-BSP Model - Case Study: Distributed Triangle Counting.- Learning to harness in-vitro biological neural networks.- Verification of Concurrent Programs Using Hybrid Concrete-Symbolic Interpretation.- Scalable Small Message Aggregation on Modern Interconnects.- Preliminary Study on Message Aggregation Optimizations for Energy Savings in PGAS Models.
£75.99
Springer Combinatorics on Words
Book SynopsisAnd Now There are Four: Another Brick in the Wall of the Optimal Upper Bound on the MP-ratio.- A Characterization of Algebraic Multivariate Power Series with Sparse Support.- Avoiding Abelian and Additive Powers in Rich Words.- Maximal 2-dimensional Binary Words of Bounded Degree.- Factorizations and Monoids.- Free Product of Formal Series.- Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems.- Words Avoiding Half-flips.- Digital Convexity and Combinatorics on Words.- Clustering of Return Words in Languages of Interval Exchanges.- Symmetries of Rich Sequences with Minimum Critical Exponent.- The Heineis Spectrum has Non-empty Interior.- Binomial Coefficients of Multidimensional Arrays.- Circularity and Repetitiveness in Non-injective DF0L Systems.- Shuffle Squares and Nest-Free Graphs.- A Succinct Study of Positionality for Dumont--Thomas Numeration Systems.- About ?-numeration.- Purely Automatic Sequences with the Uniform Distribution Property.- On the Closed-rich Constant of Infinite Words.- Note on Dissecting Power of Regular Languages.
£66.49
Springer Computational Science ICCS 2025 Workshops
Book SynopsisAdvances in High-Performance Computational Earth Sciences: Numerical Methods, Frameworks & Applications.- Large-scale Nonlinear Viscoelastic Simulation for Crustal Deformation Accelerated by Data-driven Method and Multi-grid Solver.- Artificial Intelligence Approaches for Network Analysis.- Informing the Neural Network Activation Function with Graph Centrality Measures: The Case Study of Oscillating Chemical Reaction Simulation.- A Novel Routing Algorithm for Optical Networks Based on ML Methods.- Decision Trees and Machine Learning for Cybersecurity: How Model Settings Affect Attack Detection.- Covering the Online Spectrum of Opinion in Social Context: The Benefit of Network Node Sampling Through an Italian Case Study.- A Multilayer and Temporal Network for Studying the Connections of Cross-listed Stocks.- A Machine Learning-based Framework for Predicting Candidate Drug Side Effects from Biological Networks.- Artificial Intelligence and High-Performance Computing for Advanced Simulations.- Introducing B-spline Basis Functions in Neural Network Approximations.- Augmenting Petrov-Galerkin Method with Optimal Test Functions by DNN Learning the Inverse of the Gram Matrix.- EXPBrain: Exponential Integrators for Glioblastoma Brain Tumor Simulations.- Influence of Mixed Precision on Performance and Accuracy of DNN Training for AI-Accelerated CFD Simulations on NVIDIA Multi-GPU System.- Performance-energy Investigation of Selected Applications using a Parallel Multi-GPU Genetic Algorithm under Power Capping.- Discrete Residual Loss Functions for Training Physics-Informed Neural Networks.- Uncertainty-Aware Well Placement: Simulator-Verified Dual-Network Reinforcement Learning Approach meets Particle Filters.- Sequential, Parallel and Consecutive Hybrid Evolutionary-swarm Optimization Metaheuristics.- Graph Grammar Model for h-adaptation for Meshes with Quadrilateral, Pentagon, and Hexagon Elements.- MinRNNs for Lagrangian-Based Simulations of Transient Flow Problems.- Socio-cognitive Agent-oriented Evolutionary Algorithm with Trust-based Optimization.- Structural Limiting Range of Perception in PSO.- Towards Novel Migration Topologies for Parallel Evolutionary Algorithms.- Biomedical and Bioinformatics Challenges for Computer Science.- From the Synaptome to the Connectome: Data Bigness Estimation for the Human Connectome at the Nanoscale.- Enzyme Stability Prediction: Advancing with Ensemble Machine Learning and Explainable Artificial Intelligence.- MTL-FECAM: Bridging the stability-plasticity tradeoff in Exemplar-free Continual Learning.- Development of a pH-Responsive Bio-robotics for Targeted Drug Delivery to Lung Cancer in the Vascular System.- Accelerating Super-Resolution Magnetic Resonance Imaging Using Toeplitz k-Space Matrices and Deep Learning Reconstruction.- Logistic Regression with Covariate Clustering in Genome-wide Association Interaction Studies.- Predicting Antibody Responses to Type V GBS-TT Conjugate Vaccine Using Computational Modelling.- A Computational Immune Approach for Modeling Different Levels of Severity in COVID-19 Infections.- Implementation of Convolutional Neural Networks for the Purpose of Five Types of White Blood Cells Automatic Counting.- BioSkel - Towards a Framework for OMICS Applications.- Uncertainty Quantification of Thermal Damage in Hyperthermia as a Cancer Therapy.- Bias in Dermatological Datasets: A Critical Analysis of the Underrepresentation of Dark Skin Tones in Melanoma Classification Images.
£66.49
Springer Computational Science ICCS 2025 Workshops
Book SynopsisComputational Health.- Simulation of Blood Flow in the Left Ventricle Considering Purkinje Fibers.- ViT-SE_Res: A Hybrid Vision Transformer and ResNet50V2 with Squeeze-and-Excitation Block for Cervical Cell Classification.- MedCT: A Clinical Terminology Graph for Generative AI Applications in Healthcare.- A Fractional Computation Based Deep Learning Framework for Silicosis Detection.- Combining XAI and Graph Cuts for Skin-lesion Segmentation.- Accelerating Two-Dimensional k-Wave Ultrasound Simulations Through Pruned FFT: A Treatment Planning Optimisation.- A Computational Framework for Modelling Biomechanical Tumour Dynamics and Tissue Interactions: A Proof-of-Concept in Pleural Mesothelioma.- Towards Sensitivity Analysis: 3D Venous Modelling in the Lower Limb.- Cross-Scale Modeling of Healthcare Norms and Patient Features Dynamics with Interpretable Machine Learning.- Automatic Detection and Segmentation of Coronary Artery Stenosis in Coronary Angiography Images.- Explainable Artificial Intelligence for Clinicians Decision Support in Diagnosing Spinal Pathologies.- Predicting Disease Transmission Rates for Hybrid Modeling of Epidemic Outbreaks: Statistical and Machine Learning Approaches.- Lightweight Heterogeneous SEIR Models for Epidemic Surveillance in Russian Cities: Turning Synthetic Populations into Equations.- Is Health Systems Sustainability Measurable? - Operationalizing SDG Targets using SSP-TOPSIS Approach.- Computational Modeling and Artificial Intelligence for Social Systems.- Automatic Detection and Identification of Causal Relationships in Polish Legal Texts.- A Parameter-free Model for the Online Spread of Far-right Messages: Combining Agent-Based Models with Large-Language Models.- Accelerated Approximation of Bellman Equation Solutions: Agent Policy Optimization with a Feedforward Neural Network.- Simulation-based Inference in Agent-based Models using Spatio-temporal Summary Statistics.- Emergent Communication in Merging Artificial Agent Populations.- MAVS: An Ensemble-Based Multi-Agent Framework for Fake News Detection.- Evolutionary Game Selection Leads to Emergent Inequality.- Computational Optimization, Modelling and Simulation.- Enhancing Gaussian Mixture Model Fitting via Equiprobable Binning and Adaptive Differential Evolution.- Asymptotics in Curve Estimation by Modified Cubic Spline and Exponential Parameterization.- Physics Informed Neural Networks for Non Stationary Material Science Problems.- Adaptive Global Modeling using Neural Networks with Deep Ensembles and Space-filling Sequences.- Automated Antenna Design Using Computational Intelligence and Numerical Optimization.- Near-Optimal Mixed Partial Replications versus Uniform Replication.- Hybrid Subgradient and Simulated Annealing Method for Hemivariational Inequalities.- Reduced-Order Modeling of Compressible Flows Using Supervised Dimensionality Reduction.- Exact and Approximate Methods for Solving the Edge-strength Problem.
£66.49
Springer Computational Science ICCS 2025 Workshops
Book SynopsisMachine Learning and Data Assimilation for Dynamical Systems.- Cluster-based Reduced-order Modelling and Control for Chaotic Systems with Extreme Events.- First Experiences on Exploiting Physics-Informed Neural Networks for Approximating Solutions of a Biological Model.- A Machine Learning System for Energy Forecasting with Feature Importance Analysis.- Latent Three-dimensional Variational Data Assimilation with Convolutional Autoencoder and LSTM for Flood Forecasting.- Online Model Learning with Data-assimilated Reservoir Computers.- Data-Assimilated Model-Based Reinforcement Learning for Partially Observed Chaotic Flows.- SHAP-prioritised Machine Learning for Diagnostic Grade Prediction of Lung Function.- Turn Detection in Alpine Skiing Using Smartphone Sensors.- Assimilation of Data for Dynamic Digital Twins by Learning Covariance Information.- Multi-Criteria Decision-Making: Methods, Applications, and Innovations.- Issues Importance Analysis for Reaching High-Quality Consensus in Preference-Based Conflict Scenarios.- Integrating Conflict Analysis and Rule-Based Systems for Dispersed Data Classification.- Multicriteria Framework for Digital Content Design and Evaluation in Cross-Generational Targeting.- Integrating Habituation Effects with UCB and Softmax Multi-Armed Bandit Algorithms for Optimized Digital Content Delivery.- Computational Risk Assessment in Water Distribution Network.- Preserving Informative Content of Condition Attributes in Data Transformations for CRSA.- Using SSP-VIKOR in Sustainable Share of Renewable Energy Sources Assessment.- Decision-Making of Homogeneous Multiple Classifiers Based on Attribute Characterisation by Discretisation.- New Multi-Criteria Approach to Sustainable Development Assessment.- Compromise Fuzzy Ranking: A Novel Method for Reaching Consensus in Complex Multi-criteria Decision Problems.- A New Approach to Large-scale Multi-criteria Group Decision-making Based on the RANCOM Method.- Towards Sustainable Decision Making: New Reference Point-Based MCDA Method.- An Adaptive RANCOM-ST Method for Bias Reduction using Statistical Thresholds.- Strong Sustainability Paradigm in TOPSIS Method: New Approach to Wind Farm Selection Problem.- Aspects of Implementing RPA in an IT Company.- Evaluating Sufficiency Practices for Sustainable Competitiveness using AHP-grey Analysis.- Actionable Fire Modeling in Firemap for Extended Attack Decision Support.- The Role of Preference Reidentification in MCDA: Comparing Weight-Based, Normalization, and Reference-Object Approaches.- Subjective Equal Criteria Influence Approach (SECIA): A Novel Extended Approach to Weights Determination.- Local Markovian Consensus for Ranking Aggregation: A Novel Approach to Consensus Ranking with Weak Ordinal Dominance.
£66.49
Springer Computational Science ICCS 2025 Workshops
Book Synopsis(Credible) Multiscale Modelling and Simulation.- Novel Hierarchical Decision Tree Frameworks Introducing Tree Method Bagging-Stump Integration and Height Optimization.- Modelling Heat Conduction between Two Contacting Particles in Vacuum Insulation Panels Made with Granular Porous Media.- Multiscale Parallel Simulation of Malignant Pleural Mesothelioma via Adaptive Domain Partitioning – an Efficiency Analysis Study.- Node-level Performance of Adaptive Resolution in ls1 mardyn.- A Multiscale Modeling Framework for Organizational Resilience: Integrating Agent-Based, Discrete Event, and System Dynamics Approaches.- mUQSA - An Online Service for Uncertainty Quantification and Sensitivity Analysis.- FUMEplot: a Prototype Tool for Automated Visualisation of Uncertainties in Ensemble Modelling Outputs.- AI-enhanced Agent-based Modelling Approach for Forced Displacement Predictions.- Numerical Algorithms and Computer Arithmetic for Computational Science.- On Floating Point Approximation of the Reciprocal Cube Root Function.- Fourier Error Analysis of Caputo Derivative Approximations based on Lagrange Interpolation over Uniform Mesh.- Time and Energy Consumption of Multithreaded Matrix Factorization using Various Compilers Optimizations.- Quantum Computing.- Modeling the Cyclic Bandwidth Problem in QUBO for Quantum Annealing.- Optimization Framework for Reducing Mid-circuit Measurements and Resets.- Quantum-Classical Dual Kernel SVMs for Power Quality Classification.- Quantum-aware Transformer Model for State Classification.- Hyperspectral Image Segmentation with a Machine Learning Model Trained using Quantum Annealer.- Classification of the Polish Handwritten Letters by the use of Quantum Convolutional Neural Network.- Retrieval-Augmented Generation.- AggTruth: Contextual Hallucination Detection using Aggregated Attention Scores in LLMs.- CiteVerifier: How Good Are Citation Verifiers and How to Use Them?- From Statement of Facts to Statutory Provisions – Efficient Retrieval of Relevant Legislation.- PoliChat: Retrieval Augmented Generation on University Documents and Regulations.- Simulations of Flow and Transport: Modeling, Algorithms and Computation.- Isogeometric Galerkin-characteristic Analysis for Miscible Flows in Porous Media.- An Unconditionally Stable Parallel Splitting Algorithm for the Coupled Stokes-Parabolic Equation Based on the Three-Field Biot Model.- A Thermodynamically Consistent Model for Compressible Fluid Flow in Fractured Porous Elastic Media.- { t DarcyLite} Modules for Property-preserving Transport Solvers.- Natural Convection in Periodically Heated Porous-fluid System under Local Thermal Non-equilibrium Conditions: A Numerical Study for Enhanced Thermal Management.- Development of a Library for Far-field Sonic Boom Prediction in OpenFOAM.- Numerical Analysis of Dolphin Kick in Competitive Swimming with Free Surface Effects.- DNS of Bubble Dynamics in the Wobbling Regime using the Unstructured Conservative Level-Set Method.
£66.49
Springer Computational Science ICCS 2025 Workshops
Book SynopsisSmart Systems: Bringing Together Computer Vision, Sensor Networks and Artificial Intelligence.- Formal Security Analysis of the Authentication Protocol in Smart Cities using AVISPA.- Automatic Help Summoning through Speech Analysis on Mobile Devices.- Leveraging Graph Digital Twin for Fault Detection and Improved Power Grid Stability in Smart Cities.- PEMS-API: Malware Classification Using Parameter-Enhanced Multi-dimensional API Sequence Features.- The Effectiveness of Visual Attention Patterns in the Process of Spatial Exploration in a 3D Video Game Environment.- A New Way to Generate Urban Environments for Video Games Using the Architectural Impression Curve Method.- Enhancing Learning in Augmented Reality (AR): A Deep Learning Framework for Predicting Memory Retention in AR Environments.- Solving Problems with Uncertainty.- Unified and Diverse Coalition Formation in Dispersed Data Classification – A Conflict Analysis Approach with Weighted Decision Trees.- From Uncertainty to Semantics in Self-reported Data: An Empirical Analysis.- Uncertainties in Modeling Psychological Symptom Networks: The Case of Suicide.- Making Astrometric Solver Tractable through In-Situ Visual Analytics.- Scheduling in Workflow-as-a-Service Model with Pre-Parameterized DAG using Inaccurate Estimates.- Global Sensitivity Analysis for a Mathematical Model of the General Escape Theory of Suicide.- Multidimensional Granular Approach to Solving Fuzzy Complex System of Linear Equations.- An Algorithm for Calculating the Multidimensional Solution of the Fuzzy Sylvester Matrix Equation.- Modelling Extreme Uncertainty: Queues with Pareto Inter-Arrival Times and Pareto Service Times.- Teaching Computational Science.- Best Practices in Teaching Digitization and Process Automation - A Case Study of Warsaw University of Technology.- Contrast Computation for Improved Visibility and User Experience in Educational Interfaces.- The Role of the Sustainability Competences for IT Systems Engineers.- Smart Product-Service System for Intelligent Welding System.- The Use of Artificial Intelligence and Virtual Computer Laboratories to Develop Computer Science Education.- Exploring AI Applications in Business: Case Studies on Key Competencies for Professionals.- The Use of the Chat GPT to Solve Mathematical Programming Tasks: A Didactic Experiment with the Participation of Warsaw University of Life Sciences Students.- Service-Oriented Architecture: Learning with Generative AI and AWS.
£64.99
Springer Computational Science ICCS 2025
Book SynopsisICCS 2025 Main Track Full Papers.- Backtranslation and Paraphrasing in the LLM Era? Comparing Data Augmentation Methods for Emotion Classification.- Explainable Artificial Intelligence for Bioactivity Prediction: Unveiling the Challenges with Curated CDK2/4/6 Breast Cancer Dataset.- Bus Loop Scheduling with Dueling Double Deep Q Network.- Precise Language Deception: XAI Driven Targeted Adversarial Examples with Restricted Knowledge.- Tensorial Implementation for Robust Variational Physics-Informed Neural Networks.- Neural Parabolic Wave Equation for Refractivity Estimation.- Discover the Tractable Latent Space of Floating Offshore Wind Turbine based on a Novel GNN-Encoder-Decoder-LSTM Deep Learning Architecture.- Towards Weight-space Interpretation of Low-Rank Adapters for Diffusion Models.- Discovering Governing Equations of Geomagnetic Storm Dynamics with Symbolic Regression.- Combining Shape and Trajectory Features for Human Action Classification using a Neural Network and Synthetic Data.- Improving Object Detection Quality in Football Through Super-Resolution Techniques.- Flexible User-defined Domain Decomposition in Kilometer-Scale E3SM Land Model Simulation.- A Deeper Look into the Limitations of Early-Exit Architectures for Single and Multi-Label Classification.- Comparative Analysis of Black-Box Optimization Methods for Weather Intervention Design.- Dual Adaptive Windows Toward Concept-Drift in Online Network Intrusion Detection.- Estimating Airborne Transmission Risk for Indoor Space: Coupling Agent-based Model and Computational Fluid Dynamics.- A Dynamic Model of Customers Behavior: Integrating Econophysics and Physics-Informed Neural Networks.- Adaptive PCA-Based Outlier Detection for Multi-Feature Time Series in Space Missions.- Adaptive Physics Refinement for Anatomic Adhesive Dynamics Simulations.- Microfluidic Digital Twin for Enhanced Single-Cell Analysis.- Energy-Efficient Neural Network Training for Scientific Datasets with Advanced Similarity Analytics and Orchestration.
£66.49
Springer Computational Science ICCS 2025
Book SynopsisICCS 2025 Main Track Full Papers.- CommPlex: Community in Multiplexes - Definition and a Suite of Algorithms for Analysis.- i-QLS: Quantum-supported Algorithm for Least Squares Optimization in Non-Linear Regression.- Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach.- WebAA: Website Association Analysis via Multi-Resource Similarity Computation.- Exploring the Effect of Spatial Scales in Studying Urban Mobility Pattern.- NotiCorr: Exposing Social Relationships via Notification Traffic of Instant Messaging Applications.- PAWUK: Extensive Annotated Web Corpus of Ukrainian.- Assessing Physics Parameterizations using Evolutionary Computation.- Domain solutions obtained by the FPIES for potential 2D BVPs.- Detecting and Understanding Hateful Contents in Memes Through Captioning and Visual Question-Answering.- A GPU-Accelerated Interior Point Method with Applications in Radiation Therapy Optimization.- An Empirical Assessment of LLM-Based Approaches to Malicious Webpage Detection.- Physics Informed Neural Network Code for 2D Transient Problems (PINN-2DT) Compatible with Google Colab.- Dynamic Neural Network with Matrix-extended Residual Connections.- Proof of Training: Obtaining Verifiable ML Models by Delegating Training to a Blockchain Network.- Multiple-Meta-Instance Selection. Combining the Properties of Many Instance-Selection Methods.- Using B-spline Function Properties in the PIES Method to Handle Singularities in Boundary Value Problems.- cuTeBool: Fast and Scalable Boolean matrix factorization on GPUs using Tensor Cores.- Encrypted Malicious Traffic Detection Using Multi-Instance Learning.- Dimensionality Reduction in Product of Metric Spaces.- To Select or Not to Select? The Role of Meta-features Selection in Meta-learning Tasks with Tabular Data.- Simple Error Estimation for PIES in 2D Elasticity Problems.
£66.49
Springer Computational Science ICCS 2025
Book SynopsisICCS 2025 Main Track Full Papers.- Control Synthesis of Homogeneous Approximations of Nonlinear Systems.- A Robust Ensemble Malware Detector Against Powerful Adversaries.- Physics-Aware Compression of Plasma Distribution Functions with GPU-Accelerated Gaussian Mixture Models.- Hierarchical Structural Information – Theory and Applications.- A Connectionist Approach to Federated Digital Twins.- Low Latency Recoding CORDIC Algorithm for FPGA Implementation.- Global Optimization of Microwave Circuits Using Dimensionality Reduction and Multi-Fidelity EM Simulations.- Understanding the Limitations of Deep Transformer Models for Sea Ice Forecasting.- Microscopic Binary Engagement Model.- Dead Gate Elimination.- Advances in Adapting Memory-Bound CFD Computations to RISC-V Multicore Architecture.- Detecting Potential HIV Inhibitors using the Cross Siamese Network.- Generation of Quality Green’s Function Libraries in Complex Three-dimensional Crustal Structures by Adaptive Mesh Refinement.- An Iterative Scheme for the Solidification Benchmark Modeling.- Robust, Efficient, and Long-Time Accurate Schemes to Simulate Gas Storage in Geological Formation.- A Hybrid Approach for Medical Deepfake Detection Using Depth-Wise Convolutions in Vision Transformer and Frequency Domain Analysis.- Static Load Balancing for Molecular-Continuum Flow Simulations with Heterogeneous Particle Systems and on Heterogeneous Hardware.- Joint Spatial-Temporal Representation for Host Intrusion Detection System.- Will it Blend? Mixing Numerical and Machine-learned Physics Quantities for Accurate On-the-Fly Surrogate Modeling.- Biological Community Detection with Graph neural network and Network Curvature Analysis on Gene Co-expression Networks.- Incorporating Performance Ordering in MCDA: A Study of the Frobenius SPOTIS Method.
£66.49
Springer Computational Science ICCS 2025
Book SynopsisICCS 2025 Main Track Short Papers.- A Method for Handling Negative Similarities in Explainable Graph Spectral Clustering of Text Documents.- Preliminary Comparison of Different EDs Performance, using Simulation.- Efficient Peptide MRM Transition Prediction via Convolutional Hashing.- Comparison of Crash Simulations on Two Types of Flying Cars.- Centrality Resilience in Complex Networks.- A Customizable Agent-Based Simulation Framework for Emergency Departments.- Leveraging Positional Bias of LLM In-context Learning with Class-few-shot and Maj-Min Alternating Ordering.- Remote Sensing AI for Crop Planting in Wildfire Fuel Mapping.- Regularization Algorithm for Eliminating Singularities in the PIES Formula for 3D Multidomain Orthotropic Problems.- Advancing Bird Species Classification: A Fusion of Audio and Image Data.- Prototype-pairs Decomposition for Extracting Simple and Meaningful Rules.- Fast Prediction of Job Execution Times in the ALICE Grid Through GPU-Based Inference with Quantization and Sparsity Techniques.- Reversible Data Hiding in Encrypted Images with Pixel Prediction and ERLE Compression.- Information Flow Between Neighboring Housing Markets: A Case from the Seoul Metropolitan Area.- A Bi-Stage Framework for Automatic Development of Pixel-Based Planar Antenna Structures.- Investigation of CUDA Graphs Performance for Selected Parallel Applications.- Instance Selection by Fast Local Set Border Selector.- Modelling the Transient Evolution of Queues in Plugged-in Electric Vehicles (PEV) Fast Charging Stations.- Is Heterogeneous Model Soup Tasty? A Multidimensional Evaluation of Diverse Model Soups in Language Model Alignment.- Performance Evaluation of IMS/NGN Network with SDN-Based Transport Stratum.- Variable Resolution Machine Learning for Rapid Multi-Criterial Antenna Design.- A Fast and Scalable Genomic Data Compressor for Multicore Clusters.- Augmenting Ontologies with Competency Questions and Distant Supervision.- Modeling Firm Birth and Death Dynamics using Survival Fractions and Age Distributions.- Enhancing Sentiment Analysis through Multimodal Fusion: A BERT-DINOv2 Approach.- Modeling Parallel AI Applications for Performance Analysis on Cloud Environments.- Simplified Swarm Learning Framework for Robust and Scalable Diagnostic Services in Cancer Histopathology.- A Fast MPI-based Distributed Hash-Table as Surrogate Model for HPC Applications.- Rockburst Forecasting using Composite Modeling for Seismic Sensors Data.- Accelerating LBM with C++ STL Asynchronous Parallel Model.- Accelerating Cloud-Based Transcriptomics: Performance Analysis and Optimization of the STAR Aligner Workflow.- Adaptive Modular Housing Design for Crisis Situations.- Evaluating Parameter-Based Training Performance of Neural Networks and Variational Quantum Circuits.- Towards an Open Science – an Academic Recommendation Cloud Platform.- Algorithm Selection in Short-Range Molecular Dynamics Simulations.- SOPMOA*: Unleashing Shared-Open Parallelism for High-Performance Multi-Objective Pathfinding.- From Recursion to Parallelism: Plug & Play Dynamic Programming.- NeoN: A Tool for Automated Detection, Linguistic and LLM-Driven Analysis of Neologisms in Polish.- Surrogate Models for Analyzing Performance Behavior of HPC Applications Using RAJAPerf.- Cattle Identification using 2D Mask Retention Network.- Scaling Dynamics of the Electricity Utility Sector: Assessing the Role of Agglomeration Externalities and Sensitivity to Population Cutoffs in Spatial Dynamics Across European Regions.- Pollution Simulations and In-field Measurements Performed in March at Longyearbyen, Spitsbergen.- Reversed Model Verification by Inferring Conceptual Models from Simulation Code.- GPU-Accelerated Out-of-Core HMM Inference with Concurrent CUDA Streams.- Predicting Future Collaborations in A Scientific Community using Graph Neural Networks.- Data-Centric Parallel Programming Abstractions for High Performance Computations.- Neural Network for Evaluating the Operational Range of Antennas with Randomly Generated Designs.- Optimizing U-Net Architecture Using Differential Evolution for Brain Tumor Segmentation.- Simulation Modelling of Clinical Decision making for Personalized Policy Identification.- Verified Eigenvalue Calculation for the Laplace Operator.- A Hybrid Q-LA approach to routing in Wireless Sensor Networks.- Improving Project-level Code Generation using Combined Relevant Context.
£44.99
Springer Implementation and Application of Automata
Book Synopsis.- Complementable Normal Form of Parametrized Automata..- Toward the Glushkovization of Automata: the Strong Stabilization..- Constructing Compact BPE Token DFAs..- Epsilon Automata on Linear Orderings..- Multi-entry DFA with reduced initial states to speedup parallel recognition..- Two-Way Automata and Bounded Languages..- An Algebraic Approach to the Equivalence Checking of Deterministic Top-down Tree Transducers..- An active learning algorithm for bidirectional deterministic finite automata..- Dynamically Weighted Tree Transducers..- Engineering an LTLf Synthesis Tool..- Subsequence Matching and Analysis Problems for Automata with Translucent Letters..- Shape Preserving Tree Transducers..- Simulating two-way nondeterministic finite automata over small alphabets by one-way nondeterministic automata..- A New Approach for Showing Termination of Parameterized Transition Systems..- An Earley-Based Universal Error-Correcting Parser..- More on Language Families with a Decidable Pumping-Problem (Extended Abstract)..- Self-Verifying Predicates in B¨uchi Arithmetic..- State-Freezing Pushdown Automata..- From regular expressions to deterministic finite automata: $2ˆ{frac{n}{2}+sqrt{n}(log n)ˆ{Theta(1)}}$ states are necessary and sufficient..- A first taste of MeSCaL, a tool for solving membership problems for regular languages..- In orbit with MeSCaL: higher in concatenation and navigational hierarchies of regular languages..- A hierarchy of reversible finite automata.
£59.99
Springer Fundamentals of Computation Theory
£64.99
Springer LogicBased Program Synthesis and Transformation
Book Synopsis.- Symbolic Computation and Verification Methods in Maude..- Verifying Smart Contracts in Yul via Transformation to CHC byInterpreter Specialization..- Implementing a Many-Valued Semantics for Logic Programs withOrdered Disjunction Using ASP..- Extending the FSyntax/Hiord Approach with Imperative Notation..- Higher-Order Pattern Unification Modulo Similarity Relations..- A Completion Procedure for Equational Rewriting Systems with Binders..- Automated Certification of Logic Programs Groundness Analysis..- Managing Analysis and Verification Information about Curry Packages..- Program synthesis for geometric modeling..- Recurrent Pairs Revisited..- Logica and LogicLM Program Synthesis Evaluation..- Characterizing Equivalence of Logically Constrained Terms viaExistentially Constrained Terms..- Focusing Recursive LLM Descents with Plans Expressed as LogicPrograms.
£49.99
Springer Runtime Verification
Book Synopsis.- Algorithmic Fairness: A Runtime Perspective..- DSLs for Runtime Verification: A Tutorial..- Execution and monitoring of HOA automata with HOAX..- Formal Verification of Neural Certificates Done Dynamically..- Runtime Monitoring and Enforcement of Conditional Fairness in Generative AIs..- A ROS Adapter for RTLola..- DynSRV: Dynamically Updated Properties for Stream Runtime Verification..- Modular and Online Monitoring of Temporal Logic Specification with Integral and Filter..- Alignment Monitoring..- Instrumenting Runtime Enforcement..- Active Monitoring with RTLola: A Specification-Guided Scheduling Approach..- The Power of Reframing: Using LLMs in Synthesizing RV Monitors..- Conformal Safety Shielding for Imperfect-Perception Agents..- Extended Timed Regular Expressions..- Monitoring Distributed Systems based on Partial Order Executions with Global States..- Hidden-Layer Monitoring for Out-of-Distribution Localization in Image Segmentation..- CoCAI: Copula-based Conformal Anomaly Identification for Multivariate Time-Series..- Monitoring Progress and Failure in Autonomous Robot Navigation: A Case Study..- Conformal Predictive Monitoring for Multi-Modal Scenarios..- Runtime Verification for LTL in Stochastic Systems..- A Practical Approach to Runtime Verification..- Hyper pattern matching..- Monitoring Hypernode Logic Over Infinite Domains..- A Compositional Approach to Diagnosing Faults in Cyber-Physical Systems..- Statistical Runtime Verification for LLMs via Robustness Estimation..- ISL: Monitoring Image Segmentation Logic in Medical Imaging Analysis..- Runtime Consultants.
£59.99
Springer Nature Switzerland AG Computational Aspects of Social Networks
£54.99
Birkhauser Verlag AG Geometric Methods in Physics: XXX Workshop, Białowieża, Poland, June 26 to July 2, 2011
Book SynopsisThe Białowieża workshops on Geometric Methods in Physics are among the most important meetings in the field. Every year some 80 to 100 participants from both mathematics and physics join to discuss new developments and to interchange ideas. This volume contains contributions by selected speakers at the XXX meeting in 2011 as well as additional review articles and shows that the workshop remains at the cutting edge of ongoing research. The 2011 workshop focussed on the works of the late Felix A. Berezin (1931–1980) on the occasion of his 80th anniversary as well as on Bogdan Mielnik and Stanisław Lech Woronowicz on their 75th and 70th birthday, respectively. The groundbreaking work of Berezin is discussed from today’s perspective by presenting an overview of his ideas and their impact on further developments. He was, among other fields, active in representation theory, general concepts of quantization and coherent states, supersymmetry and supermanifolds. Another focus lies on the accomplishments of Bogdan Mielnik and Stanisław Lech Woronowicz. Mielnik’s geometric approach to the description of quantum mixed states, the method of quantum state manipulation and their important implications for quantum computing and quantum entanglement are discussed as well as the intricacies of the quantum time operator. Woronowicz’ fruitful notion of a compact quantum group and related topics are also addressed.
£123.49
Springer International Publishing AG Fundamentals of Hopf Algebras
Book SynopsisThis text aims to provide graduate students with a self-contained introduction to topics that are at the forefront of modern algebra, namely, coalgebras, bialgebras and Hopf algebras. The last chapter (Chapter 4) discusses several applications of Hopf algebras, some of which are further developed in the author’s 2011 publication, An Introduction to Hopf Algebras. The book may be used as the main text or as a supplementary text for a graduate algebra course. Prerequisites for this text include standard material on groups, rings, modules, algebraic extension fields, finite fields and linearly recursive sequences.The book consists of four chapters. Chapter 1 introduces algebras and coalgebras over a field K; Chapter 2 treats bialgebras; Chapter 3 discusses Hopf algebras and Chapter 4 consists of three applications of Hopf algebras. Each chapter begins with a short overview and ends with a collection of exercises which are designed to review and reinforce the material. Exercises range from straightforward applications of the theory to problems that are devised to challenge the reader. Questions for further study are provided after selected exercises. Most proofs are given in detail, though a few proofs are omitted since they are beyond the scope of this book.Trade Review“The goal of the book under review is to introduce graduate students to some basic results on coalgebras, bialgebras, Hopf algebras, and their applications. The book may be used as the main text or as a supplementary text for a graduate course. … This book should be very useful as a first introduction for someone who wants to learn about Hopf algebras and their applications.” (Jörg Feldvoss, zbMATH 1341.16034, 2016)Table of ContentsPreface.- Notation.- 1. Algebras and Coalgebras.- 2. Bialgebras.- 3. Hopf Algebras.- 4. Applications of Hopf Algebras.- Bibliography.
£41.24
Springer International Publishing AG A User’s Guide to Network Analysis in R
Book SynopsisPresenting a comprehensive resource for the mastery of network analysis in R, the goal of Network Analysis with R is to introduce modern network analysis techniques in R to social, physical, and health scientists. The mathematical foundations of network analysis are emphasized in an accessible way and readers are guided through the basic steps of network studies: network conceptualization, data collection and management, network description, visualization, and building and testing statistical models of networks. As with all of the books in the Use R! series, each chapter contains extensive R code and detailed visualizations of datasets. Appendices will describe the R network packages and the datasets used in the book. An R package developed specifically for the book, available to readers on GitHub, contains relevant code and real-world network datasets as well.Table of ContentsIntroducing Network Analysis in R.- The Network Analysis "5 Number Summary".- Network Data Management in R.- Basic Network Plotting and Layout.- Effective Network Graphic Design.- Advanced Network Graphics.- Actor Prominence.- Subgroups.- Affiliation Networks.- Random Network Models.- Statistical Network Models.- Dynamic Network Models.- Simulations.
£59.99
Springer International Publishing AG Models of Computation
Book SynopsisThis book presents in their basic form the most important models of computation, their basic programming paradigms, and their mathematical descriptions, both concrete and abstract. Each model is accompanied by relevant formal techniques for reasoning on it and for proving some properties. After preliminary chapters that introduce the notions of structure and meaning, semantic methods, inference rules, and logic programming, the authors arrange their chapters into parts on IMP, a simple imperative language; HOFL, a higher-order functional language; concurrent, nondeterministic and interactive models; and probabilistic/stochastic models.The authors have class-tested the book content over many years, and it will be valuable for graduate and advanced undergraduate students of theoretical computer science and distributed systems, and for researchers in this domain. Each chapter of the book concludes with a list of exercises addressing the key techniques introduced, solutions to selected exercises are offered at the end of the book.Table of ContentsPreliminaries.- Operational Semantics of IMP.- Induction and Recursion.- Partial Orders and Fixpoints.- Denotational Semantics of IMP.- Operational Semantics of HOFL.- Domain Theory.- HOFL Denotational Semantics.- Equivalence Between HOFL Denotational and Operational Semantics.- Calculus for Communicating Systems (CCS).- Temporal Logic and mu-Calculus.- Pi-Calculus.- Measure Theory and Markov Chains.- Markov Chains with Actions and Non-determinism.- Performance Evaluation Process Algebra (PEPA).
£24.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Funktionale Programmierung: Sprachdesign und
Book SynopsisGegenstand dieses Werkes sind die Theorie und Praxis der modernen funktionalen Programmierung. Dabei betrachten die Autoren aber nicht nur das, was mittels der heute implementierten Sprachen wie HASKELL, OPAL, ML usw. machbar ist, sondern weisen auch auf aktuelle Entwicklungen hin. Zum einen werden fortgeschrittene Programmiertechniken vorgestellt, wie z.B. die Verwendung unendlicher Datenstrukturen, Parser als Funktionen höherer Ordnung, Approximations-Algorithmen, Lösung von Gleichungssystemen usw. Zum anderen werden aber auch Sprachkonzepte diskutiert, wie z.B. eine systematische Form der Modularisierung oder besonders ausdrucksstarke und flexible Formen der Typisierung. Ein besonderes Gewicht wird generell auf die Integration verschiedener Paradigmen gelegt, wie etwa die Verbindung mit Konzepten der objektorientierten, der nebenläufigen oder der Constraint-basierten Programmierung. In diesem Zusammenhang wird speziell auch die Bedeutung von Monaden analysiert und kritisch hinterfragt.Trade ReviewAus den Rezensionen: "Bei diesem Titel … werden … fortgeschrittene Leser angesprochen, die mit den Grundlagen der funktionalen Programmierung vertraut sind. … ‘Im Vordergrund stehen Ideen und Konzepte einer eleganten, sicheren und produktiven Form des Programmierens‘, wobei der Blick in die Zukunft gerichtet ist und Konzepte und Methoden vorgestellt werden, die erst in den Sprachen der nächsten Generation verfügbar sein werden. Geeignet für Bibliotheken … an Hochschulstandorten … Das Lehrbuch kann noch weiter genutzt werden." (Isigkeit, in: ekz-Informationsdienst, 2006)Table of ContentsElementare Funktionale Programmierung Eine Wiederholung.- Das Strittigste vorab: Notationen.- Grundlagen der Funktionalen Programmierung.- Faulheit währt unendlich.- Parser als Funktionen höherer Ordnung.- Strukturierung von Programmen.- Gruppen: Die Basis der Modularisierung.- Operatoren auf Gruppen (Morphismen).- Die Idee der Typisierung.- Typen.- Subtypen (Vererbung).- Polymorphe und abhängige Typen.- Spezifikationen und Typklassen: Wie Typen typisiert werden.- Beispiel: Berechnung von Fixpunkten.- Beispiel: Monaden.- Datenstrukturen.- Netter stack und böse Queue.- Compilertechniken für funktionale Datenstrukturen.- Funktionale Arrays und Numerische Mathematik.- Map: Wenn Funktionen zu Daten werden.- Beispiel: Synthese von Programmen.- Integration von Paradigmen.- Zeit und Zustand in der funktionalen Welt.- Objekte und Ein-/Ausgabe.- Agenten und Prozesse.- Graphische Schnittstellen (GUIs).- Massiv parallele Programme.- Integration von Konzepten anderer Programmierparadigmen.
£27.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Finite Model Theory: Second Edition
Book SynopsisThis is a thoroughly revised and enlarged second edition that presents the main results of descriptive complexity theory, that is, the connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. The logics that are important in this context include fixed-point logics, transitive closure logics, and also certain infinitary languages; their model theory is studied in full detail. The book is written in such a way that the respective parts on model theory and descriptive complexity theory may be read independently.Table of ContentsPreliminaries.- The Ehrenfeucht-Fraïssé Method.- More on Games.- 0-1 Laws.- Satisfiability in the Finite.- Finite Automata and Logic: A Microcosm of Finite Model Theory.- Descriptive Complexity Theory.- Logics with Fixed-Point Operators.- Logic Programs.- Optimization Problems.- Logics for PTIME.- Quantifiers and Logical Reductions.
£142.49
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG LATIN 2006: Theoretical Informatics: 7th Latin
Book SynopsisThis book constitutes the refereed proceedings of the 7th International Symposium, Latin American Theoretical Informatics, LATIN 2006, held in March 2006. The 66 revised full papers presented together with seven invited papers were carefully reviewed and selected from 224 submissions. The papers presented are devoted to a broad range of topics in theoretical computer science with a focus on algorithmics and computations related to discrete mathematics as well as on cryptography, data compression and Web applications.Table of ContentsKeynotes.- Algorithmic Challenges in Web Search Engines.- RNA Molecules: Glimpses Through an Algorithmic Lens.- Squares.- Matching Based Augmentations for Approximating Connectivity Problems.- Modelling Errors and Recovery for Communication.- Lossless Data Compression Via Error Correction.- The Power and Weakness of Randomness in Computation.- Regular Contributions.- A New GCD Algorithm for Quadratic Number Rings with Unique Factorization.- On Clusters in Markov Chains.- An Architecture for Provably Secure Computation.- Scoring Matrices That Induce Metrics on Sequences.- Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.- The Complexity of Diffuse Reflections in a Simple Polygon.- Counting Proportions of Sets: Expressive Power with Almost Order.- Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets.- Relations Among Notions of Security for Identity Based Encryption Schemes.- Optimally Adaptive Integration of Univariate Lipschitz Functions.- Classical Computability and Fuzzy Turing Machines.- An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees.- An Algorithm for a Generalized Maximum Subsequence Problem.- Random Bichromatic Matchings.- Eliminating Cycles in the Discrete Torus.- On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions.- Pattern Matching Statistics on Correlated Sources.- Robust Model-Checking of Linear-Time Properties in Timed Automata.- The Computational Complexity of the Parallel Knock-Out Problem.- Reconfigurations in Graphs and Grids.- -Varieties, Actions and Wreath Product.- Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.- An Efficient Approximation Algorithm for Point Pattern Matching Under Noise.- Oblivious Medians Via Online Bidding.- Efficient Computation of the Relative Entropy of Probabilistic Automata.- A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences.- De Dictionariis Dynamicis Pauco Spatio Utentibus.- Customized Newspaper Broadcast: Data Broadcast with Dependencies.- On Minimum k-Modal Partitions of Permutations.- Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm.- Maximizing Throughput in Queueing Networks with Limited Flexibility.- Network Flow Spanners.- Finding All Minimal Infrequent Multi-dimensional Intervals.- Cut Problems in Graphs with a Budget Constraint.- Lower Bounds for Clear Transmissions in Radio Networks.- Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.- Lower Bounds for Geometric Diameter Problems.- Connected Treewidth and Connected Graph Searching.- A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs.- The Committee Decision Problem.- Common Deadline Lazy Bureaucrat Scheduling Revisited.- Approximate Sorting.- Stochastic Covering and Adaptivity.- Algorithms for Modular Counting of Roots of Multivariate Polynomials.- Hardness Amplification Via Space-Efficient Direct Products.- The Online Freeze-Tag Problem.- I/O-Efficient Algorithms on Near-Planar Graphs.- Minimal Split Completions of Graphs.- Design and Analysis of Online Batching Systems.- Competitive Analysis of Scheduling Algorithms for Aggregated Links.- A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains.- On Sampling in Higher-Dimensional Peer-to-Peer Systems.- Mobile Agent Rendezvous in a Synchronous Torus.- Randomly Colouring Graphs with Girth Five and Large Maximum Degree.- Packing Dicycle Covers in Planar Graphs with No K 5–e Minor.- Sharp Estimates for the Main Parameters of the Euclid Algorithm.- Position-Restricted Substring Searching.- Rectilinear Approximation of a Set of Points in the Plane.- The Branch-Width of Circular-Arc Graphs.- Minimal Eulerian Circuit in a Labeled Digraph.- Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization.- RISOTTO: Fast Extraction of Motifs with Mismatches.- Minimum Cost Source Location Problems with Flow Requirements.- Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.- Constructions of Approximately Mutually Unbiased Bases.- Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In.
£119.43
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Computability and Complexity in Analysis: 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers
Book SynopsisThe workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA’95 in Hagen, Germany, CCA’96 in Trier, Germany, and CCA’98 in Brno, Czech Republic. About 40 participants from the countries United Kingdom, Germany, Japan, Italy, Russia, France, Denmark, Greece, and Ireland contributed to the success of this meeting. Altogether, 28 talkswere p- sented in Swansea. These proceedings include 23 papers which represent a cro- section through recent research on computability and complexity in analysis. The workshop succeeded in bringing together people interested in computability and complexity aspects of analysis and in exploring connections with nume- cal methods, physics and, of course, computer science. It was rounded o by a number of talks and papers on exact computer arithmetic and by a competition of v e implemented systems. A report on this competition has been included in these proceedings. We would like to thank the authors for their contributions and the referees for their careful work, and we hope for further inspiring and constructive meetings of the same kind. April 2001 Jens Blanck Vasco Brattka Peter Hertling Organization CCA2000was hosted by the Department of Computer Science of the University of Wales Swansea and took place on September 17{19, 2000.Table of ContentsComputability and Complexity in Analysis.- Effectivity of Regular Spaces.- The Degree of Unsolvability of a Real Number.- A Survey of Exact Arithmetic Implementations.- Standard Representations of Effective Metric Spaces.- Banach-Mazur Computable Functions on Metric Spaces.- A Generic Root Operation for Exact Real Arithmetic.- Effective Contraction Theorem and Its Application.- Polynomially Time Computable Functions over p-Adic Fields.- On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems.- Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory.- Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations.- ?-Approximable Functions.- Computabilities of Fine-Continuous Functions.- The iRRAM: Exact Arithmetic in C++.- The Uniformity Conjecture.- Admissible Representations of Limit Spaces.- Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions.- Effective Fixed Point Theorem over a Non-Computably Separable Metric Space.- Computational Dimension of Topological Spaces.- Some Properties of the Effective Uniform Topological Space.- On Computable Metric Spaces Tietze-Urysohn Extension Is Computable.- Is the Linear Schrödinger Propagator Turing Computable?.- A Computable Spectral Theorem.- Report on Competition.- Exact Real Arithmetic Systems: Results of Competition.
£44.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Classification of Nuclear C*-Algebras. Entropy in Operator Algebras
Book Synopsisto the Encyclopaedia Subseries on Operator Algebras and Non-Commutative Geometry The theory of von Neumann algebras was initiated in a series of papers by Murray and von Neumann in the 1930's and 1940's. A von Neumann algebra is a self-adjoint unital subalgebra M of the algebra of bounded operators of a Hilbert space which is closed in the weak operator topology. According to von Neumann's bicommutant theorem, M is closed in the weak operator topology if and only if it is equal to the commutant of its commutant. Afactor is a von Neumann algebra with trivial centre and the work of Murray and von Neumann contained a reduction of all von Neumann algebras to factors and a classification of factors into types I, II and III. C* -algebras are self-adjoint operator algebras on Hilbert space which are closed in the norm topology. Their study was begun in the work of Gelfand and Naimark who showed that such algebras can be characterized abstractly as involutive Banach algebras, satisfying an algebraic relation connecting the norm and the involution. They also obtained the fundamental result that a commutative unital C* -algebra is isomorphic to the algebra of complex valued continuous functions on a compact space - its spectrum. Since then the subject of operator algebras has evolved into a huge mathematical endeavour interacting with almost every branch of mathematics and several areas of theoretical physics.Trade ReviewFrom the reviews:"... These notes [by E.Stormer] describe the main approaches to noncommutative entropy, together with several ramifications and variants. The notion of generator and variational principle are used to give applications to subfactors and C*-algebra formalism of quantum statistical mechanics. The author considers the most frequently studied examples, including Bernoulli shifts, Bogolyubov automorphisms, dual automorphisms on crossed products, shifts on infinite free products, and binary shifts on the CAR-algebra. The mathematical techniques and ideas are beautifully exposed, and the whole paper is a rich resource on the subject, either for the expert or the beginner. ..."V.Deaconu, Mathematical Reviews 2004"... the author gives a clear presentation of the dramatic developments in the classification theory for simple C*-algebras that have taken place over the past 25 years or so. ... As there is such a large amount of literature on the subject, this monograph article is particularly useful to the relative novice who wants to know the fundamental results in the theory without wading through a massive amount of detail. ...This monograph-length article is extremely well-written, filled with concrete examples, and has an exhaustive bibliography. I recommend it as an excellent introduction to graduate students and other mathematicians who want to bring themselves up-to-date on the subject. .."J.A.Packer, Mathematical Reviews 2004“Both contributions to this volume are high-end, excellently written research reviews, reflecting very thoroughly the current status in the respectively treated subbranches of the quickly evolving complex field of C* algebra theory. They both give a beautiful lay-out of the vast research program in the field which has been going on for decades … as well as to the standard works. … an excellent, very thorough, concise and needed overview for the researcher who is active in this field.” (Mark Sioen, Bulletin of the Belgian Mathematical Society, 2007) Table of ContentsI. Classification of Nuclear, Simple C*-algebras.- II. A Survey of Noncommutative Dynamical Entropy.
£85.49
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Set Theory: The Third Millennium Edition, revised
Book SynopsisThis monograph covers the recent major advances in various areas of set theory. From the reviews: "One of the classical textbooks and reference books in set theory....The present ‘Third Millennium’ edition...is a whole new book. In three parts the author offers us what in his view every young set theorist should learn and master....This well-written book promises to influence the next generation of set theorists, much as its predecessor has done." --MATHEMATICAL REVIEWSTrade ReviewFrom the reviews of the third edition: "Thomas Jech’s text has long been considered a classic survey of the state of the set theory … . As every logician will know, this is a work of extraordinary scholarship, essential for any graduate logician who needs to know where the current boundaries of research are situated. Each chapter ends with a valuable historical survey and there is an extensive bibliography. This will continue to be the bible for set theorists in the new century." (Gerry Leversha, The Mathematical Gazette, March, 2005) "The book does masterly what it is supposed to do. … every mathematician who wishes to refresh his knowledge of set theory will read it with pleasure. … They will also find historical notes, and precise references … . A very comprehensive bibliography, and detailed indexes complete the work. This book fills a serious gap in the literature and there is no doubt that it will become a standard reference … . One can strongly recommend its acquisition for any mathematical library." (Jean-Roger Roisin, Bulletin of the Belgian Mathematical Society, Vol. 11 (3), 2004) "One of the classical textbooks and reference books in set theory is Jech’s Set Theory. … The present ‘Third Millennium’ edition … is a whole new book. In three parts the author offers us what in his view every young set theorist should learn and master. … This well-written book promises to influence the next generation of set theorists, much as its predecessor has done over the last quarter of a century." (Eva Coplakova, Mathematical Reviews, 2004 g) "Jech’s book, ‘Set Theory’ has been a standard reference for over 25 years. This ‘Third Millennium Edition’, not only includes all the materials in the first two editions, but also covers recent developments of set theory during the last 25 years. We believe that this new version will become a standard reference on set theory for the next few years." (Guohua Wu, New Zealand Mathematical Society Newsletter, April, 2004) "Jech’s classic monograph has been a standard reference for a generation of set theorists. Though … labeled ‘The Third Millennium Edition’, the present work is in fact a new book. ... Even sections presenting older results have been rewritten and modernized. Exercises have been moved to the end of each section. The bibliography, the section on notation, and the index have been considerably expanded as well. This new edition will certainly become a standard reference on set theory for years to come." (Jörg D. Brendle, Zentralblatt MATH, Vol. 1007, 2003) "Thomas Jech’s Set Theory contains the most comprehensive treatment of the subject in any one volume. The present third edition is a revised and expanded version … . The third edition has three parts. The first, Jech says, every student of set theory should learn, the second every set theorist should master and the third consists of various results reflecting ‘the state of the art of set theory at the turn of the new millennium’. This last part especially contains a lot of new material." (Martin Bunder, The Australian Mathematical Society Gazette, Vol. 30 (2), 2003)Table of ContentsBasic Set Theory.- Axioms of Set Theory.- Ordinal Numbers.- Cardinal Numbers.- Real Numbers.- The Axiom of Choice and Cardinal Arithmetic.- The Axiom of Regularity.- Filters, Ultrafilters and Boolean Algebras.- Stationary Sets.- Combinatorial Set Theory.- Measurable Cardinals.- Borel and Analytic Sets.- Models of Set Theory.- Advanced Set Theory.- Constructible Sets.- Forcing.- Applications of Forcing.- Iterated Forcing and Martin’s Axiom.- Large Cardinals.- Large Cardinals and L.- Iterated Ultrapowers and L[U].- Very Large Cardinals.- Large Cardinals and Forcing.- Saturated Ideals.- The Nonstationary Ideal.- The Singular Cardinal Problem.- Descriptive Set Theory.- The Real Line.- Selected Topics.- Combinatorial Principles in L.- More Applications of Forcing.- More Combinatorial Set Theory.- Complete Boolean Algebras.- Proper Forcing.- More Descriptive Set Theory.- Determinacy.- Supercompact Cardinals and the Real Line.- Inner Models for Large Cardinals.- Forcing and Large Cardinals.- Martin’s Maximum.- More on Stationary Sets.
£151.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Fundamental Approaches to Software Engineering: First International Conference, FASE'98, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings
Book SynopsisThis book constitutes the refereed proceedings of the First International Conference on Fundamental Approaches to Software Engineering, FASE'98, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, held in Lisbon, Portugal, in March/April 1998.Besides two invited presentations and three system demonstrations, this volume presents 18 revised full papers selected from a total of 59 submissions. Among the various fundamental software engineering issues addressed are formal methods, specification languages, refinement, object-oriented modeling, software architectures, statecharts, model checking, etc.Table of ContentsExtreme programming: A humanistic discipline of software development.- Some mistakes I have and what I have learned from them.- Specifying and analyzing dynamic software architectures.- Observational proofs with critical contexts.- Integrating AORTA with model-based data specification languages.- Specifying safety-critical embedded systems with statecharts and Z: A case study.- Specifying embedded systems with statecharts and Z: An agenda for cyclic software components.- Algebra transformation systems and their composition.- Navigation expressions in object-oriented modelling.- Compositional verification of reactive systems specified by graph transformation.- Reflections on the design of a specification language.- Constructs, concepts and criteria for reuse in concurrent object-oriented languages.- Backtracking-free design planning by automatic synthesis in metaframe.- Model-checking CSP-Z.- Rule-based refinement of high-level nets preserving safety properties.- Automated formal analysis of networks: FDR models of arbitrary topologies and flow-control mechanisms.- Behaviour analysis and safety conditions: A case study in CML.- Distributed safety controllers for web services.- A refinement calculus for statecharts.- Refining formal specifications of human computer interaction by graph rewrite rules.- RELVIEW — A system for calculating with relations and relational programming.- ALBERT: A formal language and its supporting tools for requirements engineering.- Moby/plc — A design tool for hierarchical real-time automata.
£44.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG The Calculus of Computation: Decision Procedures with Applications to Verification
Book SynopsisWritten with graduate and advanced undergraduate students in mind, this textbook introduces computational logic from the foundations of first-order logic to state-of-the-art decision procedures for arithmetic, data structures, and combination theories. The textbook also presents a logical approach to engineering correct software. Verification exercises are given to develop the reader's facility in specifying and verifying software using logic. The treatment of verification concludes with an introduction to the static analysis of software, an important component of modern verification systems. The final chapter outlines courses of further study.Trade Review"...this book, which addresses the verification of sequential programs, exhibits all the features of a field that has finally fully matured. The material is substantial; it is organized very thoughtfully; the writing is concise but simple, easy to follow, and illustrated with ample examples... Overall, this book is very well written, thoughtfully constructed, and substantive yet accessible. It is bound to become a standard textbook in program verification." (Fatma Mill, ACM Computing Reviews, August 2008)Table of ContentsFoundations.- Propositional Logic.- First-Order Logic.- First-Order Theories.- Induction.- Program Correctness: Mechanics.- Program Correctness: Strategies.- Algorithmic Reasoning.- Quantified Linear Arithmetic.- Quantifier-Free Linear Arithmetic.- Quantifier-Free Equality and Data Structures.- Combining Decision Procedures.- Arrays.- Invariant Generation.- Further Reading.
£59.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG The Computer - My Life
Book SynopsisKonrad Zuse is one of the great pioneers of the computer age. He created thefirst fully automated, program controlled, freely programmable computer using binary floating-point calculation. It was operational in 1941. He built his first machines in Berlin during the Second World War, with bombs falling all around, and after the war he built up a company that was taken over by Siemens in 1967. Zuse was an inventor in the traditional style, full of phantastic ideas, but also gifted with a powerful analytical mind. Single-handedly, he developed one of the first programming languages, the Plan Calculus, including features copied only decades later in other languages. He wrote numerousbooks and articles and won many honors and awards. This is his autobiography, written in an engagingly lively and pleasant style, full of anecdotes, reminiscences, and philosophical asides. It traces his life from his childhood in East Prussia, through tense wartime experiences and hard times building up his business after the war, to a ripe old age andwell-earned celebrity.Trade ReviewFrom the reviews:“The book tells the story of an inventor and an entrepreneur. It is refreshing because it allows one to see things outside of the box, beyond the more traditional story, so that he or she can better appreciate key aspects of computing and computation. Furthermore, the book tells the story of a father, a hard worker, and a recognized inventor, including pictures and plenty of anecdotes. … The book is probably the only reliable source about Konrad Zuse’s life and contributions to the world.” (Hector Zenil, ACM Computing Reviews, November, 2011)Table of Contents1 Ancestors and parents — Early childhood memories — School days — Metropolis — Abitur.- 2 Studies (not without detours and by-ways) and general studies — First inventions — The Akademischer Verein Motiv — Student life between science and politics.- 3 The early years of the computer (and a digression on its prehistory) — Colleagues remember — From mechanics to electromechanics — Schreyer’s electronic computing machine — First outside contacts — Thoughts on the future.- 4 Outbreak of the war and (first) call-up — Structural engineer in aircraft construction — The Z2 and Z3 — Second call-up — Zuse Ingenieurbüro und Apparatebau, Berlin — The first process computer.- 5 Origins of the Z4 — News from the United States — Attempt at a Ph.D. dissertation — Computing machine for logic operations — Final months of the war in Berlin — The evacuation — Z4 completed in Göttingen — Final war days in the Allgäu.- 6 End of the war — Refugees in Hinterstein — The Plankalkül — The computing universe — Automation and self-reproducing systems — A logarithmic computing machine — Computer development in Germany and the United States — Move to Hopferau near Füssen — The mill of the Patent Office.- 7 The Zuse-Ingenieurbüro, Hopferau bei Füssen — First business partners: IBM and Remington Rand — The first pipelining design — Founding of ZUSE KG in Neukirchen — The Z4 in the ETH in Zurich — The computer in Europe: taking stock — Lost opportunities — The first German contract: the Z5.- 8 The partners leave — Computing machine for land use zoning — Electronics gains acceptance — First funds from the Deutsche Forschungsgemeinschaft — Losing one’s way (and possibly a lost opportunity) — The array processor — Custom work for geodesists — The Graphomat Z64 — Growth and crisis of ZUSE KG — The end.- 9 Free for science (again) — Honors — A look to the future.- Appendices.- 1. From Forms to Program Control.- 2. Construction of Devices.- 3. On Computer Architecture.- 4. On the Plan Calculus.- 5. Lecture on the Occasion of the Award of the Honorary Doctorate by the Technical University of Berlin (Extract).- 6. The Computer Did Not Fall from Heaven.- Notes.- References.- Name Index.- Computer Index.
£42.74
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Algebraic Complexity Theory
Book SynopsisThe algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a fact summarized in Church's thesis, which says that the resulting definitions form an adequate formalization of the intuitive notion of computability. This had and continues to have an enormous effect. First of all, with these notions it has been possible to prove that various problems are algorithmically unsolvable. Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. Secondly, concepts like Turing machines and WHILE-programs had a strong influence on the development of the first computers and programming languages. In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become increasingly important. In addition, the fact that some problems can be solved very efficiently, while others seem to defy all attempts to find an efficient solution, has called for a deeper under standing of the intrinsic computational difficulty of problems.Trade ReviewP. Bürgisser, M. Clausen, M.A. Shokrollahi, and T. Lickteig Algebraic Complexity Theory "The book contains interesting exercises and useful bibliographical notes. In short, this is a nice book."—MATHEMATICAL REVIEWS From the reviews: "This book is certainly the most complete reference on algebraic complexity theory that is available hitherto. … superb bibliographical and historical notes are given at the end of each chapter. … this book would most certainly make a great textbook for a graduate course on algebraic complexity theory. … In conclusion, any researchers already working in the area should own a copy of this book. … beginners at the graduate level who have been exposed to undergraduate pure mathematics would find this book accessible." (Anthony Widjaja, SIGACT News, Vol. 37 (2), 2006)Table of Contents1. Introduction.- I. Fundamental Algorithms.- 2. Efficient Polynomial Arithmetic.- 3. Efficient Algorithms with Branching.- II. Elementary Lower Bounds.- 4. Models of Computation.- 5. Preconditioning and Transcendence Degree.- 6. The Substitution Method.- 7. Differential Methods.- III. High Degree.- 8. The Degree Bound.- 9. Specific Polynomials which Are Hard to Compute.- 10. Branching and Degree.- 11. Branching and Connectivity.- 12. Additive Complexity.- IV. Low Degree.- 13. Linear Complexity.- 14. Multiplicative and Bilinear Complexity.- 15. Asymptotic Complexity of Matrix Multiplication.- 16. Problems Related to Matrix Multiplication.- 17. Lower Bounds for the Complexity of Algebras.- 18. Rank over Finite Fields and Codes.- 19. Rank of 2-Slice and 3-Slice Tensors.- 20. Typical Tensorial Rank.- V. Complete Problems.- 21. P Versus NP: A Nonuniform Algebraic Analogue.- List of Notation.
£104.49
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Handbook of Weighted Automata
Book SynopsisThe purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the “resources” by “profit” and then be interested in the maximal profit realized, correspondingly, by a given word.Trade ReviewFrom the reviews:"This book is an excellent reference for researchers in the field, as well as students interested in this research area. The presentation of applications makes it interesting to researchers from other fields to study weighted automata. ... One of the main arguments in favor of this handbook is the completeness of its index table — usually a faulty section in such volumes. The chapters are globally well-written and self-contained, thus pleasant to read, and the efforts put to maintain consistency in vocabulary thorough the book are very appreciable." (Michaël Cadilhac, The Book Review Column 43-3, 2012)“The book presents a broad survey, theory and applications, of weighted automata, classical nondeterministic automata in which transitions carry weights. … The individual articles are written by well-known researchers in the field: they include extensive lists of references and many open problems. The book is valuable for both computer scientists and mathematicians (being interested in discrete structures).” (Cristian S. Calude, Zentralblatt MATH, Vol. 1200, 2011)Table of ContentsFoundations.- Semirings and Formal Power Series.- Fixed Point Theory.- Concepts of Weighted Recognizability.- Finite Automata.- Rational and Recognisable Power Series.- Weighted Automata and Weighted Logics.- Weighted Automata Algorithms.- Weighted Discrete Structures.- Algebraic Systems and Pushdown Automata.- Lindenmayer Systems.- Weighted Tree Automata and Tree Transducers.- Traces, Series-Parallel Posets, and Pictures: A Weighted Study.- Applications.- Digital Image Compression.- Fuzzy Languages.- Model Checking Linear-Time Properties of Probabilistic Systems.- Applications of Weighted Automata in Natural Language Processing.
£132.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Algorithmics: The Spirit of Computing
Book SynopsisComputer science is the science of the future, and already underlies every facet of business and technology, and much of our everyday lives. In addition, it will play a crucial role in the science the 21st century, which will be dominated by biology and biochemistry, similar to the role of mathematics in the physical sciences of the 20th century. In this award-winning best-seller, the author and his co-author focus on the fundamentals of computer science, which revolve around the notion of the algorithm. They discuss the design of algorithms, and their efficiency and correctness, the inherent limitations of algorithms and computation, quantum algorithms, concurrency, large systems and artificial intelligence. Throughout, the authors, in their own words, stress the ‘fundamental and robust nature of the science in a form that is virtually independent of the details of specific computers, languages and formalisms'. This version of the book is published to celebrate 25 years since its first edition, and in honor of the Alan M. Turing Centennial year. Turing was a true pioneer of computer science, whose work forms the underlying basis of much of this book. Trade ReviewFrom the reviews of the third edition:“This book should be on any short list for a central course in computer science. It is designed to provide a uniform background on which all students might draw. It has a good-humored, easy style, which would make any reader unwilling to close the book after opening it anywhere. All computer scientists should have this book. … the bibliography is organized in a convenient chapter-by-chapter form, which makes the book useful for advanced work, and the exercises will help instructors identify capable students.” (Harvey Cohn, ACM Computing Reviews, August, 2012)“This is a reprint of the 3rd edition on the occasion of the 25th year of the existence of the book; it is also intended to honor Alan Turing’s 100th birthday. … it is highly readable, even if one is largely acquainted with the field. It is very well written, containing many illustrative examples, suited also for the non-specialist.” (Gunther Schmidt, Zentralblatt MATH, Vol. 1243, 2012)Table of ContentsPreliminaries.- and Historical Review.- Algorithms and Data.- Programming Languages and Paradigms.- Methods and Analysis.- Algorithmic Methods.- The Correctness of Algorithms.- The Efficiency of Algorithms.- Limitations and Robustness.- Inefficiency and Intractability.- Noncomputability and Undecidability.- Algorithmic Universality and Its Robustness.- Relaxing the Rules.- Parallelism, Concurrency, and Alternative Models.- Probabilistic Algorithms.- Cryptography and Reliable Interaction.- The Bigger Picture.- Software Engineering.- Reactive Systems.- Algorithmics and Intelligence.
£64.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG The Logic of Categorial Grammars: A deductive account of natural language syntax and semantics
Book SynopsisThis book is intended for students in computer science, formal linguistics, mathematical logic and to colleagues interested in categorial grammars and their logical foundations. These lecture notes present categorial grammars as deductive systems, in the approach called parsing-as-deduction, and the book includes detailed proofs of their main properties. The papers are organized in topical sections on AB grammars, Lambek’s syntactic calculus, Lambek calculus and montague grammar, non-associative Lambek calculus, multimodal Lambek calculus, Lambek calculus, linear logic and proof nets and proof nets for the multimodal Lambek calculus.
£59.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Concurrent Programming: Algorithms, Principles, and Foundations
Book SynopsisThis book is devoted to the most difficult part of concurrent programming, namely synchronization concepts, techniques and principles when the cooperating entities are asynchronous, communicate through a shared memory, and may experience failures. Synchronization is no longer a set of tricks but, due to research results in recent decades, it relies today on sane scientific foundations as explained in this book.In this book the author explains synchronization and the implementation of concurrent objects, presenting in a uniform and comprehensive way the major theoretical and practical results of the past 30 years. Among the key features of the book are a new look at lock-based synchronization (mutual exclusion, semaphores, monitors, path expressions); an introduction to the atomicity consistency criterion and its properties and a specific chapter on transactional memory; an introduction to mutex-freedom and associated progress conditions such as obstruction-freedom and wait-freedom; a presentation of Lamport's hierarchy of safe, regular and atomic registers and associated wait-free constructions; a description of numerous wait-free constructions of concurrent objects (queues, stacks, weak counters, snapshot objects, renaming objects, etc.); a presentation of the computability power of concurrent objects including the notions of universal construction, consensus number and the associated Herlihy's hierarchy; and a survey of failure detector-based constructions of consensus objects. The book is suitable for advanced undergraduate students and graduate students in computer science or computer engineering, graduate students in mathematics interested in the foundations of process synchronization, and practitioners and engineers who need to produce correct concurrent software. The reader should have a basic knowledge of algorithms and operating systems.Trade ReviewFrom the reviews:“Concurrent programming is the study of the methods which will ensure correct interactions. … Raynal (Univ. of Rennes, France) presents these classical techniques at the beginning of his book, and then moves on to cover such topics as transactional memory and current areas of research like consensus in the face of crash failures. The coverage is very up-to-date, including references through 2010. … This would be an ideal text for a beginning graduate course. Summing Up: Highly recommended. Graduate students, researchers/faculty, and professionals/practitioners.” (P. Cull, Choice, Vol. 50 (11), August, 2013)“A very comprehensive treatment of both fundamentals and recent results in concurrent programming is presented in this book. … The book is well structured, with many examples to help the reader. Each chapter starts with a short presentation of the content and a list of keywords, and concludes with a summary of the main points and results. … I can recommend this book … .” (Sergei Gorlatch, Computing Reviews, June, 2013)Table of ContentsPart I - Lock-Based Synchronization.- Chap. 1 - The Mutual Exclusion Problem.- Chap. 2 - Solving Mutual Exclusion.- Chap. 3 - Lock-Based Concurrent Objects.- Part II - On the Foundations Side: The Atomicity Concept.- Chap. 4 - Atomicity: Formal Definition and Properties.- Part III - Mutex-Free Synchronization.- Chap. 5 - Mutex-Free Concurrent Objects.- Chap. 6 - Hybrid Concurrent Objects.- Chap. 7 - Wait-Free Objects from Read/Write Registers Only.- Chap. 8 - Snapshot Objects from Read/Write Registers Only.- Chap. 9 - Renaming Objects from Read/Write Registers Only.- Part IV - The Transactional Memory Approach.- Chap. 10 - Transactional Memory.- Part V - On the Foundations Side: From Safe Bits to Atomic Registers.- Chap. 11 - Safe, Regular and Atomic Read/Write Registers.- Chap. 12 - From Safe Bits to Atomic Bits: A Lower Bound and an Optimal Construction.- Chap. 13 - Bounded Constructions of Atomic b-Valued Registers.- Part VI - On the Foundations Side: The Computability Power of Concurrent Objects (Consensus).- Chap. 14 - Universality of Consensus.- Chap. 15 - The Case of Unreliable Base Objects.- Chap. 16 - Consensus Numbers and the Consensus Hierarchy.- Chap. 17 - The Alphas and Omega of Consensus: Failure Detector-Based Consensus.- Afterword.- Bibliography.- Index.
£54.99