Mathematical theory of computation Books
Springer International Publishing AG Hypothesis Generation and Interpretation: Design
Book SynopsisThis book focuses in detail on data science and data analysis and emphasizes the importance of data engineering and data management in the design of big data applications. The author uses patterns discovered in a collection of big data applications to provide design principles for hypothesis generation, integrating big data processing and management, machine learning and data mining techniques. The book proposes and explains innovative principles for interpreting hypotheses by integrating micro-explanations (those based on the explanation of analytical models and individual decisions within them) with macro-explanations (those based on applied processes and model generation). Practical case studies are used to demonstrate how hypothesis-generation and -interpretation technologies work. These are based on “social infrastructure” applications like in-bound tourism, disaster management, lunar and planetary exploration, and treatment of infectious diseases. The novel methods and technologies proposed in Hypothesis Generation and Interpretation are supported by the incorporation of historical perspectives on science and an emphasis on the origin and development of the ideas behind their design principles and patterns. Academic investigators and practitioners working on the further development and application of hypothesis generation and interpretation in big data computing, with backgrounds in data science and engineering, or the study of problem solving and scientific methods or who employ those ideas in fields like machine learning will find this book of considerable interest.Table of ContentsBasic Concept.- Hypothesis.- Science and Hypothesis.- Regression.- Machine Learning and Integrated Approach.- Hypothesis Generation by Difference.- Methods for Integrated Hypothesis Generation.- Interpretation.
£143.99
Birkhauser Verlag AG Structural Decision Diagrams in Digital Test: Theory and Applications
Book SynopsisThis is the first book that sums up test-related modeling of digital circuits and systems by a new structural-decision-diagrams model. The model represents structural and functional information jointly and opens a new area of research.The book introduces and discusses applications of two types of structural decision diagrams (DDs): low-level, structurally synthesized binary DDs (SSBDDs) and high-level DDs (HLDDs) that enable diagnostic modeling of complex digital circuits and systems.Topics and features: Provides the definition, properties and techniques for synthesis, compression and optimization of SSBDDs and HLDDs Provides numerous working examples that illustrate the key points of the text Describes applications of SSBDDs and HLDDs for various electronic design automation (EDA) tasks, such as logic-level fault modeling and simulation, multi-valued simulation, timing-critical path identification, and test generation Discusses the advantages of the proposed model to traditional binary decision diagrams and other traditional design representations Combines SSBDDs with HLDDs for multi-level representation of digital systems for enabling hierarchical and cross-level solving of complex test-related tasks This unique book is aimed at researchers working in the fields of computer science and computer engineering, focusing on test, diagnosis and dependability of digital systems. It can also serve as a reference for graduate- and advanced undergraduate-level computer engineering and electronics courses.Three authors are affiliated with the Dept. of Computer Systems at the Tallinn University of Technology, Estonia: Raimund Ubar is a retired Professor, Jaan Raik and Maksim Jenihhin are tenured Professors. Artur Jutman, PhD, is a researcher at the same university and the CEO of Testonica Lab Ltd., Estonia.Table of ContentsChapter 1: Introduction.- Chapter 2: Overview of structural decision diagrams.- Chapter 3: Structurally Synthesized Binary Decision Diagrams.- Chapter 4: Fault modeling in digital circuits.- Chapter 5: Logic-level fault simulation.- Chapter 6: Test generation, fault diagnosis and testability.- Chapter 7: High-Level Decision Diagrams.- Chapter 8: Test generation for microprocessors with HLDDs.
£179.99
Springer International Publishing AG Rules and Reasoning: 7th International Joint
Book SynopsisThis book constitutes the refereed proceedings of the 7th International Joint Conference on Rules and Reasoning, RuleML+RR 2023, held in Oslo, Norway, during September 18–20, 2023. The 13 full papers and 3 short papers included in these proceedings were carefully reviewed and selected from 46 submissions. They focus on all aspects of theoretical advances; novel technologies; innovative applications; knowledge representation; reasoning with rules; and research, development, applications of rule-based systems. Table of ContentsPapers.- Extension of Regression Tsetlin Machine for Interpretable Uncertainty Assessment.- GUCON: A Generic Graph Pattern based Policy Framework for Usage Control Enforcement.- Combining Proofs for Description Logic and Concrete Domain Reasoning.- Notation3 as an Existential Rule Language.- Fine-tuning Large Enterprise Language Models via Ontological Reasoning.- Layerwise Learning of Mixed Conjunctive and Disjunctive Rule Sets.- Analyzing Termination for Prev-Aware Fragments of Communicating Datalog Programs.- Marrying Query Rewriting and Knowledge Graph Embeddings.- Lore: Educational Deductive Database System.- Comparing State of the Art Rule-Based Tools for Information Extraction.- A Case Study for Declarative Pattern Mining in Digital Forensics.- Semantic Role Assisted Natural Language Rule Formalization for Intelligent Vehicle.- FreeCHR: An Algebraic Framework for CHR-Embeddings.- Explaining the optimal trajectories.- Abstract Domains for Database Manipulating Processes.- Extracting Interpretable Hierarchical Rules from Deep Neural Networks’ Latent Space.
£47.49
Springer International Publishing AG Automated Technology for Verification and
Book SynopsisThis book constitutes the refereed proceedings of the 21st International Symposium on Automated Technology for Verification and Analysis, ATVA 2023, held in Singapore, in October 2023. The symposium intends to promote research in theoretical and practical aspects of automated analysis, verification and synthesis by providing a forum for interaction between regional and international research communities and industry in related areas. The 30 regular papers presented together with 7 tool papers were carefully reviewed and selected from 150 submissions.The papers are divided into the following topical sub-headings: Temporal logics, Data structures and heuristics, Verification of programs and hardware. Table of ContentsTemporal logics.- Data structures and heuristics.- Verification of programs and hardware.- Tool papers.
£56.99
Springer International Publishing AG Logic-Based Program Synthesis and Transformation:
Book SynopsisThis book constitutes the refereed proceedings of the 33rd International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2023, held in Cascais, Portugal, during October 23-24, 2023. The 8 full papers and 4 short papers included in this book were carefully reviewed and selected from 29 submissions. They were organized in topical sections as follows: Horn Clauses Analysis, Transformation and Synthesis; Static analysis and Type systems; Unification and substitution in (C)LP; and Knowledge representation and AI-based learning.Table of ContentsKeynotes.- Unification modulo equational theories in languages with binding operators.- Horn Clauses Analysis, Transformation and Synthesis.- Design Datalog Templates for Synthesizing Bidirectional Programs from Tabular Examples.- Transforming big-step to small-step semantics using interpreter specialisation.- Constrained Horn Clauses Satisfiability via Catamorphic Abstractions.- Static analysis and Type systems.- A reusable machine-calculus for automated resource analyses.- Approach for Designing and Composing Abstract Domains.- A Logical Interpretation of Asynchronous Multiparty Compatibility.- Relational Solver for Java Generics Type System.- Unification and substitution in (C)LP.- Predicate Anti-unification in (Constraint) Logic Programming.- A term matching algorithm and substitution generality.- Knowledge representation and AI-based learning.- A novel EGs-based framework for systematic propositional-formula simplification.- From Static to Dynamic Access Control Policies via Attribute-Based Category Mining.- Towards a Certified Proof Checker for Deep Neural Network Verification.
£42.74
Springer International Publishing AG AIxIA 2023 – Advances in Artificial Intelligence:
Book SynopsisThis book constitutes the refereed proceedings of the XXIInd International Conference on AIxIA 2023 – Advances in Artificial Intelligence, AIxIA 2023, held in Rome, Italy, during November 6–10, 2023.The 33 full papers included in this book were carefully reviewed and selected from 53 submissions. They were organized in topical sections as follows: Argumentation and Logic Programming, Natural Language Processing, Machine Learning, Hybrid AI and Applications of AI.Table of ContentsArgumentation and Logic Programming.- ABALearn: An automated logic-based learning system for ABA frameworks.- Deriving Dependency Graphs from Abstract Argumentation Frameworks.- ReConf: An Automatic Context-based Software Reconfiguration Tool for Autonomous Vehicles using Answer-Set Programming.- Mining contrast sequential patterns with ASP.- Ontologies.- An ontological modelling of reason-based preferences.- A Defeasible Description Logic for Abduction.- Ontology-based Data Management in Healthcare: The Case of the Italian Arthroplasty Registry.- Planning.- A Structure-Sensitive Translation from Hybrid to Numeric Planning.- Intrinsically Motivated High-Level Planning for Agent Exploration.- Natural Language Processing.- Mining Argument Components in Essays at Different Levels.- Unraveling ChatGPT: A Critical Analysis of AI-Generated Goal-Oriented Dialogues and Annotations.- Scaling Large Language Models to the Extreme: Neural Semantic Processing of Multiple Tasks in Italian.- Named Entity Recognition and Linking for Entity Extraction from Italian Civil Judgements.- Machine Learning.- CENTAURO: an Explainable AI Approach for Customer Loyalty Prediction in Retail Sector.- Toward Novel Optimizers: A Moreau-Yosida View of Gradient-based Learning.- Mastering the Card Game of Jaipur through Zero-knowledge Self-Play Reinforcement Learning and Action Masks.- Uncovering Bias in the Face Processing Pipeline: An Analysis of Popular and State-of-the-Art Algorithms Across Demographic Groups.- A multi-label classification study for the prediction of long-covid syndrome.- PAUL-2: An Upgraded Transformer-Based Redesign of the Algorithmic Composer PAUL.- Robotics and Perception.- Understanding the Effect of Deep Ensembles in LiDAR-based Place Recognition.- Enanching LiDAR performance: Robust De-skewing Exclusively Relying o n Range Measurements.- Can Existing 3D Monocular Object Detection Methods Work in Roadside Contexts? A Reproducibility Study.- Embedding Shepard's Interpolation into CNN Models for Unguided Depth Completion.- Performance evaluation of depth completion neural networks for various RGB-D camera technologies in indoor scenario.- Hybrid AI.- Inference in Probabilistic Answer Set Programming under the Credal Semantics.- Efficient Modal Decision Trees.- Clique-TF-IDF: A New Partitioning Framework based on Dense Substructures.- Combining Contrastive Learning and Knowledge Graph Embeddings to develop medical word embeddings for the Italian language.- Applications of AI.- Recognizing the Style, Genre, and Emotion of a Work of Art Through Visual and Knowledge Graph Embeddings.- Combining genetic algorithms and temporal constraint satisfaction for recommending personalized tourist itineraries.- Towards Automatic Digitalization of Railway Engineering Schematics.- Election Manipulation in Social Networks with Single-Peaked Agents.- Learning to Prompt in the Classroom to Understand AI Limits: A pilot study.
£53.99
Springer International Publishing AG Theoretical Aspects of Computing – ICTAC 2023:
Book SynopsisThis book constitutes the proceedings of the 20th International Colloquium on Theoretical Aspects of Computing, ICTAC 2023, which took place in Lima, Peru, during December 4–8, 2023. The 20 full papers presented in this volume together with 3 invited papers and 1 tool paper were carefully reviewed and selected from 40 submissions. They were organised in the topical sections as follows: Bring Together Practitioners; Researchers from Academia; Industry; Government to Present Research Results and Exchange Experience and Ideas.Table of ContentsOptimal Route Synthesis in Space DTN using Markov Decision Processes.- Modelling and Verifying Robotic Software that use Neural Networks.- A game-theoretic approach to indistinguishability of winning objectives as user privacy.- Learning Attack Trees by Genetic Algorithms.- The Landscape of Computing Symmetric $n$-Variable Functions with $2n$ Cards.- On the complexity of reasoning in Kleene algebras with commutativity conditions.- Towards the Complexity Analysis of Programming Language Proof Methods.- A Dynamic Temporal Logic for Quality of Service in Choreographic Models.- Interactive Matching Logic Proofs in Coq.- An Autonomous Data Language.- Formal Language Semantics for Triggered Enable Statecharts with a Run-to-Completion Scheduling.- Strong Call-by-Value and Multi Types.- Algorithms for Checking Intersection Non-emptiness of Regular Expressions.- Realisability of Global Models of Interaction.- Efficient Reactive Synthesis Using Mode Decomposition.- A Categorical Approach to Synthetic Chemistry.- Closure and Decision Properties for Higher-Dimensional Automata.- Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad.- Moggi Synchronous Agents, Verification, and Blame – A Deontic View.- Store Locally, Prove Globally.- Denotational Semantics for Symbolic Execution.- TOOL PAPER: Tessla-ROS-Bridge - Runtime Verification of Robotic Systems.- Simplifying process parameters by unfolding algebraic data types.- Modular Soundness Checking of Feature Model Evolution Plans.
£61.74
Springer International Publishing AG Algorithmics of Wireless Networks: 19th
Book SynopsisThis book constitutes the refereed proceedings of the 19th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2023, held in Amsterdam, The Netherlands, during September 7–8, 2023.The 10 full papers included in this book were carefully reviewed and selected from 22 submissions. They were organized in topical sections as follows: design and analysis of algorithms, models of computation and experimental analysis.Table of ContentsSegment Visibility for k-transmitters.- Conflict Resolution in Arbitrary Hypergraphs.- Dispatching the Minimum Number of UAVs in Neighborhood IoT Networks.- Mutual Visibility with ASYNC Luminous Robots having Inaccurate Movements.- Minimum Degree and Connectivity in 1-Dimensional Line of Sight Networks.- WUBBLE: Energy Efficient BLE Neighborhood Discovery Leveraging Wake-up Radio.- Byzantine Fault-Tolerant Protocols for $(n, f)$-evacuation from a Circle.- Temporal Reachability Dominating Sets: contagion in temporal graphs.- Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information.- Run for Cover: Dominating Set via Mobile Agents.
£42.74
Springer International Publishing AG Combinatorial Optimization and Applications: 16th
Book SynopsisThe two-volume set LNCS 14461 and LNCS 14462 constitutes the refereed proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2023, held in Hawaii, HI, USA, during December 15–17, 2023. The 73 full papers included in the proceedings were carefully reviewed and selected from 117 submissions. They were organized in topical sections as follows: Part I: Optimization in graphs; scheduling; set-related optimization; applied optimization and algorithm; Graph planer and others;Part II: Modeling and algorithms; complexity and approximation; combinatorics and computing; optimization and algorithms; extreme graph and others; machine learning, blockchain and others.Table of ContentsModeling and Algorithms.- Differentiable Discrete Optimization using Dataless Neural Networks.- When Advertising meets Assortment Planning: Joint Advertising and Assortment Optimization under Multinomial Logit Model.- Twin-treewidth: A single-exponential logic-based approach.- Highway Preferential Attachment Models for Geographic Routing.- Complexity and Approximation.- Restricted Holant Dichotomy on Domains 3 and 4.- Earliest Deadline First is a $2$-approximation for DARP with Time Windows.- Improved approximation for broadcasting in k-Path Graphs.- The fine-grained complexity of approximately counting proper connected colorings (extended abstract).- Combinatorics and Computing.- Strong edge coloring of subquartic graphs.- Two multicolor Ramsey numbers involving bipartite graphs.- Mechanism Design for Time-Varying Value Tasks in High-Load Edge Computing Markets.- Computing random r-orthogonal Latin squares.- Optimization and Algorithms.- A Two-stage Seeds Algorithm for Competitive Influence Maximization considering User Demand.- Practical Attribute-Based Multi-Keyword Search Scheme with Sensitive Information Hiding for Cloud Storage Systems.- Testing Higher-order Clusterability on graphs.- The $2$-mixed-center color spanning problem.- A Dynamic Parameter Adaptive Path Planning Algorithm.- On the Mating Between a Polygonal Curve and a Convex Polygon.- A Faster Parameterized Algorithm for Bipartite 1-Sided Vertex Explosion.- Multi-Winner Approval Voting with Grouped Voters.- EFX Allocation to Chores Over Small Graph.- Extreme Graph and Others.- Zero-visibility Cops and Robber game on Cage graph.- Online Facility Assignment for General Layout of Servers on a Line.- Guarding Precise and Imprecise Polyhedral Terrains with Segments.- The Bag-Based Search: A meta-algorithm to construct tractable logical circuits for graphs based on tree decomposition.- On Problems Related to Absent Subsequences.- Some Combinatorial Algorithms on the Dominating Number of Anti-Rank k Hypergraphs.- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints.- Critical $(P_5,dart)$-Free Graphs.- Graph Clustering through Users' Properties and Social Influence.- Machine Learning, Blockchain and Others.- Incorporating Neural Point Process-based Temporal Feature for Rumor Detection.- Improving Contraction Hierarchies by Combining with All-Pairs Shortest Paths Problem Algorithms.- Information Theory of Blockchain Systems.- Machine Learning with Low Resource Data from Psychiatric Clinics.- Single Image Dehazing Based on Dynamic Convolution and Transformer.- Reinforcement Learning for Combating Cyberbullying in Online Social Networks.
£61.74
Springer International Publishing AG SOFSEM 2024: Theory and Practice of Computer
Book SynopsisThis book constitutes the proceedings of the 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, held in Cochem, Germany, in February 2024. The 33 full papers presented in this book were carefully reviewed and selected from 81 submissions. The book also contains one invited talk in full paper length. They focus on original research and challenges in foundations of computer science including algorithms, AI-based methods, computational complexity, and formal models.Table of ContentsThe Information Extraction Framework of Document Spanners - A Very Informal Survey.- Generalized Distance Polymatrix Games.- Relaxed agreement forests.- On the Computational Complexity of Generalized Common Shape Puzzles.- Fractional Bamboo Trimming and Distributed Windows Scheduling.- New support size bounds and proximity bounds for integer linear programming.- On the Parameterized Complexity of Minus Domination.- Exact and Parameterized Algorithms for Choosability.- Parameterized Algorithms for Covering by Arithmetic Progressions.- Row-column combination of Dyck words.- Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures.- On the parameterized complexity of the Perfect Phylogeny problem.- Data reduction for directed feedback vertex set on graphs without long induced cycles.- Visualization of Bipartite Graphs in Limited Window Size.- Outerplanar and Forest Storyplans.- The Complexity of Cluster Vertex Splitting and Company.- Morphing Graph Drawings in the Presence of Point Obstacles.- Word-Representable Graphs from a Word’s Perspective.- Removable Online Knapsack with Bounded Size Items.- The Complexity of Online Graph Games.- Faster Winner Determination Algorithms for (Colored) Arc Kayles.- Automata Classes Accepting Languages Whose Commutative Closure is Regular.- Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching.- Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages.- Apportionment with Thresholds: Strategic Campaigns Are Easy in the Top-Choice But Hard in the Second-Chance Mode.- Local Certification of Majority Dynamics.- Complexity of Spherical Equations in Finite Groups.- Positive Characteristic Sets for Relational Pattern Languages.- Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs.- The Weighted HOM-Problem over Fields.- Combinatorics of block-parallel automata networks.- On the piecewise complexity of words and periodic words.- Distance Labeling for Families of Cycles.- On the induced problem for fixed-template CSPs.
£61.74
Springer Nature Switzerland Computer Aided Verification
Book Synopsis
£33.24
Springer Computer Algebra in Scientific Computing
Book Synopsis
£104.49
Springer Nature Switzerland Formal Aspects of Component Software
Book SynopsisVerification and testing: Enabling behaviour tree verification via a translation to BIP.- Verified fault handling for modern board management controllers.- Testing compositionality. Formal models: Correct pattern-based development through refinements and weakest preconditions calculus.- Coq formalization of orientation representation: matrix, Euler angles, axis-angle and quaternion.- Reactive graphs in action. Security and blockchain: Extracting formal smart-contract specifications from natural language with LLMs.- How do asynchronous communication models impact the composability of information flow security?
£42.74
Springer Mathematical Optimization Theory and Operations
Book Synopsis
£51.99
Springer Theoretical Aspects of Computing ICTAC 2024
Book SynopsisAutomata, Languages, and Learning.- Well Behaved (Co)algebraic Semantics of Regular Expressions in Dafny.- Jump Complexity of Deterministic Finite Automata with Translucent Letters.- Learning Closed Signal Flow Graphs.- Dual Adjunction Between $Omega$ Automata and Wilke Algebra Quotients.- On Concurrent Program Algebra and Demonic Automata.- Bisimulations and Logics for Higher Dimensional Automata.- Algorithms and Complexity.- Maximizing Weighted Dominance in the Plane.- Generalized Parikh Matrices For Tracking Subsequence Occurrences.- Card Based Protocols with Single Card Encoding.- Graphs and Games.- Winning Strategy Templates for Stochastic Parity Games towards Permissive and Resilient Control.- Disconnection Rules are Complete for Chemical Reactions.- Verification with Common Knowledge of Rationality for Graph Games.- Process Calculi.- Reversibility in Process Calculi with Nondeterminism and Probabilities.- A T
£56.99
Springer An Introduction to Theory of Computation
Book SynopsisPart I Preparation.- Chapter 0 Mathematics and Computer Science Basics.- Part II Formal Language Theory and Automata.- Chapter 1 The Regular Languages.- Chapter 2 Non-Regularity.- Chapter 3 The Context-Free Languages.- Chapter 4 The Pushdown Automaton Model.- Part III Undecidability and Turing Machines.- Chapter 5 The Turing Machines.- Chapter 6 Decidable Languages.- Chapter 7 Undecidable Languages.- Part IV Computational Complexity and Resource-Bounded Turing Machine Computation.- Chapter 8 The Time Complexity.- Chapter 9 The Space Complexity.- Chapter 10 The Theory of NP-Completeness.- Chapter 11 Beyond NP-Completeness.- Part V Advanced Topics in Computational Complexity Theory.- Chapter 12 The Probabilistic Polynomial-Time Classes.- Chapter 13 Circuit Complexity and Unambiguity.
£61.74
Springer Applied Antifragility in Technical Systems
Book SynopsisIntroduction.- Multistability and Intrinsic Antifragility.- Inherited Antifragility.- Induced Antifragility.- Conclusions and Open Research Questions.
£37.99
Springer Rigorous StateBased Methods
Book Synopsis.- An Invited Talk about B..- Neurosymbolic Learning Systems: Artificial Intelligence and Formal Methods..- Mathematical Proofs and Moving Trains: The Double Life of Atelier B..- Behavioural Theory of Reflective Parallel Algorithms..- Using Symbolic Model Execution to Detect Vulnerabilities of Smart Contracts..- Safely Encoding B Proof Obligations in SMT-LIB..- On Writing Alloy Models: Metrics and a new Dataset..- On Quantitative Solution Iteration in QAlloy..- Proof Semantics of Railway Interlocking..- Translating Event-B models and development proofs to TLA..- The Proved Construction of a Protocol with an Example..- Insider Threat Simulation Through Ant Colonies and ProB..- Developing safe exception recovery mechanisms for CHERI capability hardware using UML-B formal analysis..- Case Study: Safety Controller for Autonomous Driving on Highways..- Safety enforcement for autonomous driving on a simulated highway using Asmeta models@run.time..- Enhancing Decision-making Safety in Autonomous Driving Through Online Model Checking..- Polychronous RSS in a Process-Algebraic Framework - A Case Study in Autonomous Driving Safety..- On The Road Again (Safely): Modelling and Analysis of Autonomous Driving with extsc{Stark}..- Modelling and Verification of Highway Car Control with KeYmaera X..- State-Based Modelling with a Concept DSL..- Towards an End-to-End Tool Chain for Traceable and Verifiable Railway Signalling Specifications..- A reasoning and explicit algebraic theory for BBSL in Event-B: EB4BBSL framework..- Model-Based Testing of Non-Deterministic Systems..- Weakening Goals in Logical Specifications..- Formal modelling and reasoning on Assurance Cases expressed with GSN in Event-B.
£98.99
£134.99
Springer Data Visualization with Category Theory and
Book SynopsisChapter 1. Introduction.- Chapter 2. Illustrating UMAP on some simple data sets.- Chapter 3. Metrics and Riemannian manifolds.- Chapter 4. Merging fuzzy simplicial sets and metric spaces: A category theoretical approach.- Chapter 5. UMAP.- Chapter 6. IsUMap: An alternative to the UMAP embedding.
£42.74
Springer Components Operationally Reversibility and System Engineering
Book Synopsis(Reversible) Concurrency.- Encoding Reversible Petri nets into CCSK.- Bounded Reversibility in HOπ.- Bisimulations and Reversibility.- Unique-solution of Equations in Higher-Order Process Calculi with Passivation.- Semantics.- From Complementary to Zipper Semantics.- CESAn: a Core Erlang Semantics Analyser.- Asynchronous Global Protocols, Precisely.- Verification.- Applied Formal Methods at ONERA: An experience Report.- Scalable verification of Local and Global properties of Collective Systems.- A Hybrid Modelling Approach for Hierarchical Control.- Applications.- Reversible Computation vs. Runtime Adaptation in Industrial IoT Systems.- Towards Implementing Distributed Custom Serverless FunctionScheduling in FunLess.
£44.99
£53.99
Springer-Verlag GmbH Theoretical Aspects of Computing ICTAC 2025
£58.49
Springer International Publishing AG The Handbook of Formal Methods in Human-Computer Interaction
Book SynopsisThis book provides a comprehensive collection of methods and approaches for using formal methods within Human-Computer Interaction (HCI) research, the use of which is a prerequisite for usability and user-experience (UX) when engineering interactive systems. World-leading researchers present methods, tools and techniques to design and develop reliable interactive systems, offering an extensive discussion of the current state-of-the-art with case studies which highlight relevant scenarios and topics in HCI as well as presenting current trends and gaps in research and future opportunities and developments within this emerging field. The Handbook of Formal Methods in Human-Computer Interaction is intended for HCI researchers and engineers of interactive systems interested in facilitating formal methods into their research or practical work.Trade Review“Human-computer interaction (HCI), as a discipline, is overwhelmingly experimental. One quick look at the proceedings ... the leading conference in the domain, will make this clear: almost all papers report on carefully crafted, well-designed experiments. … I enjoyed reading the book … .” (Jacques Carette, Computing Reviews, January, 22 , 2018) Table of ContentsForeword.- Part I: Introduction.- State of the Art in Formal Methods in HCI.- Topics of formal methods in HCI.- Trends and Gaps.- Case Studies.- Part II: Modeling, Execution and Simulation.- Visual and Formal Modeling of Modularized and Executable User Interface Models.- Combining Models for Interactive System Modelling.- Activity Modelling for Low-Intention Interaction.- Modelling the User Physigrams – Modeling Physical Device Characteristics Interaction.- Formal Description of Adaptive Interactive Systems based on Executable User Interface Models.- Part II:Analysis, Validation and Verification.- Learning Safe Interactions and Full-Control.- Reasoning About Interactive Systems in Dynamic Situations of Use Enhanced Operator Function Model (EOFM): A Task Analytic Modeling Formalism for Including Human.- Behavior in the Verification of Complex Systems.- The Specification and Analysis of Use Properties of a Nuclear.- Control System.- Formal Analysis of Multiple Coordinated HMI Systems.- Part IV: Future Opportunities and Developments.- Domain-Specific Modelling for Human-Computer Interaction.- Exploiting Action Theory as a Framework for Analysis and Design of Formal Methods Approaches: Application to the CIRCUS Integrated Development Environment .- A Public Tool Suite for Modelling Interactive Applications.- Formal Modeling of App-Ensembles.- Dealing with Faults during Operations: Beyond Classical Use of Formal Methods.
£237.49
Springer International Publishing AG Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich
Book SynopsisThis is a graduate textbook of advanced tutorials on the theory of cryptography and computational complexity. In particular, the chapters explain aspects of garbled circuits, public-key cryptography, pseudorandom functions, one-way functions, homomorphic encryption, the simulation proof technique, and the complexity of differential privacy. Most chapters progress methodically through motivations, foundations, definitions, major results, issues surrounding feasibility, surveys of recent developments, and suggestions for further study.This book honors Professor Oded Goldreich, a pioneering scientist, educator, and mentor. Oded was instrumental in laying down the foundations of cryptography, and he inspired the contributing authors, Benny Applebaum, Boaz Barak, Andrej Bogdanov, Iftach Haitner, Shai Halevi, Yehuda Lindell, Alon Rosen, and Salil Vadhan, themselves leading researchers on the theory of cryptography and computational complexity. The book is appropriate for graduate tutorials and seminars, and for self-study by experienced researchers, assuming prior knowledge of the theory of cryptography.Table of ContentsGarbled Circuits as Randomized Encodings of Functions: A Primer.- The Complexity of Public-Key Cryptography.- Pseudorandom Functions: Three Decades Later.- The Many Entropies in One-Way Functions.- Homomorphic Encryption.- How to Simulate It: A Tutorial on the Simulation Proof Technique.- The Complexity of Differential Privacy.
£71.99
Springer International Publishing AG Big Data Technologies and Applications
Book SynopsisThe objective of this book is to introduce the basic concepts of big data computing and then to describe the total solution of big data problems using HPCC, an open-source computing platform.The book comprises 15 chapters broken into three parts. The first part, Big Data Technologies, includes introductions to big data concepts and techniques; big data analytics; and visualization and learning techniques. The second part, LexisNexis Risk Solution to Big Data, focuses on specific technologies and techniques developed at LexisNexis to solve critical problems that use big data analytics. It covers the open source High Performance Computing Cluster (HPCC Systems®) platform and its architecture, as well as parallel data languages ECL and KEL, developed to effectively solve big data problems. The third part, Big Data Applications, describes various data intensive applications solved on HPCC Systems. It includes applications such as cyber security, social network analytics including fraud, Ebola spread modeling using big data analytics, unsupervised learning, and image classification.The book is intended for a wide variety of people including researchers, scientists, programmers, engineers, designers, developers, educators, and students. This book can also be beneficial for business managers, entrepreneurs, and investors. Trade Review“The book offers a good overview of big data technologies, which keeps a live link between theoretical background and live applications. As such, the text rises up as a starting point for engineers and researchers in the field of big data applications.” (Alexander Tzanov, Computing Reviews, June, 2017)Table of ContentsIntroduction to Big Data.- Big Data Analytics.- Transfer Learning Techniques.- Visualizing Big Data.- Deep Learning and Big Data.- The HPCC/ECL Platform for Big Data.- Scalable Automated Linking Technology for Big Data Computing.- Aggregated Data Analysis in HPCC Systems.- Models for Big Data.- Data Intensive Supercomputing Solutions.- Graph Processing with Massive Datasets: A KEL Primer.- HPCC Systems for Cyber Security Analytics.- Social Network Analytics: Hidden and Complex Fraud Schemes.- Modeling Ebola Spread and Using HPCC/KEL System.- Unsupervised Learning and Image Classification in High Performance Computing Cluster.
£98.99
Springer Fachmedien Wiesbaden Logik für Informatiker: Eine Einführung
Book Synopsis1 Einführung und mathematische Grundlagen.- 1.1 Einführung in die Fragestellung.- 1.2 Allgemeine mathematische Grundbegriffe.- 1.3 Berechenbarkeit.- 1.4 Erzeugungssysteme, Termmengen.- 2 Aussagenlogik.- 2.1 Aussagenlogische Formeln, die Syntax.- 2.2 Interpretationen und Belegungen.- 2.3 Tautologien und logische Äquivalenz.- 2.4 Ausdrucksstärke, Normalformen, Kompaktheitssatz.- 3 Prädikatenlogik.- 3.1 Einleitung.- 3.2 Syntax der Prädikatenlogik.- 3.3 Semantik und logische Grundbegriffe.- 3.4 Formalisierung des logischen Schließens.- 3.5 Normalformen prädikatenlogischer Formeln.- 3.6 Herbrand-Strukturen, Kompaktheit und rekursive Aufzählbarkeit der logischen Konsequenz.- 3.7 Die Unentscheidbarkeit der Prädikatenlogik.- 3.8 Prädikatenlogik mit Gleichheit.- 3.9 Theorien.- 3.10 Ausdrucksstärke der Prädikatenlogik 1. Stufe.- 4 Grundlagen der Logischen Programmierung.- 4.1 Logik-Programme.- 4.2 Unifikation.- 4.3 Berechnungen von Logik-Programmen.- 4.4 Korrektheit und Vollständigkeit des Resolutionsverfahrens.- 5 Modale Aussagenlogik.- 5.1 Einführung in die Modallogik.- 5.2 Entscheidbarkeit.- 5.3 Von der Modallogik zur Temporären Logik.- Übungsaufgaben.- Das Griechische Alphabet.- Verzeichnis der verwendeten Symbole.- Stichwort- und Namensverzeichnis.Table of Contents1 Einführung und mathematische Grundlagen.- 1.1 Einführung in die Fragestellung.- 1.2 Allgemeine mathematische Grundbegriffe.- 1.3 Berechenbarkeit.- 1.4 Erzeugungssysteme, Termmengen.- 2 Aussagenlogik.- 2.1 Aussagenlogische Formeln, die Syntax.- 2.2 Interpretationen und Belegungen.- 2.3 Tautologien und logische Äquivalenz.- 2.4 Ausdrucksstärke, Normalformen, Kompaktheitssatz.- 3 Prädikatenlogik.- 3.1 Einleitung.- 3.2 Syntax der Prädikatenlogik.- 3.3 Semantik und logische Grundbegriffe.- 3.4 Formalisierung des logischen Schließens.- 3.5 Normalformen prädikatenlogischer Formeln.- 3.6 Herbrand-Strukturen, Kompaktheit und rekursive Aufzählbarkeit der logischen Konsequenz.- 3.7 Die Unentscheidbarkeit der Prädikatenlogik.- 3.8 Prädikatenlogik mit Gleichheit.- 3.9 Theorien.- 3.10 Ausdrucksstärke der Prädikatenlogik 1. Stufe.- 4 Grundlagen der Logischen Programmierung.- 4.1 Logik-Programme.- 4.2 Unifikation.- 4.3 Berechnungen von Logik-Programmen.- 4.4 Korrektheit und Vollständigkeit des Resolutionsverfahrens.- 5 Modale Aussagenlogik.- 5.1 Einführung in die Modallogik.- 5.2 Entscheidbarkeit.- 5.3 Von der Modallogik zur Temporären Logik.- Übungsaufgaben.- Das Griechische Alphabet.- Verzeichnis der verwendeten Symbole.- Stichwort- und Namensverzeichnis.
£26.59
Springer Fachmedien Wiesbaden Skriptum Informatik: eine konventionelle
Book SynopsisDrei Ziele haben Stoffauswahl und Darstellung dieses Buches: Studierende erlernen die Codierung von Algorithmen mit MODULA-2, einer modernen imperativen Programmiersprache, die so einfach und sauber ist, dass die Grundbegriffe der Programmierung klar und systematisch eingeführt werden können, die sich aber andererseits auch in der Praxis bewährt. Wichtig ist auch die Möglichkeit, in MODULA-2 den Objektbegriff vorzubereiten. Theoretische Aspekte, z.B. Berechenbarkeit, Grammatiken, Semantik und Programmierverifikation, werden ganz überwiegend im Zusammenhang mit konkreten Problemen der Programmierung behandelt, so dass der praktische Nutzen jederzeit erkennbar bleibt.Trade Review"Das mit vielen vollständigen Programmbeispielen aufgelockerte Skript eignet sich daher für Studiengänge der Hauptfach-, Nebenfach-, oder sogenannten Bindestrich-Informatik, in denen Konzepte und Praxis der Programmierung nicht separat, sondern gegenseitig stützend entwickelt werden sollen." RKW - BücherdienstTable of Contents1. Grundlagen.- 1.1 Algorithmus und Berechenbarkeit.- 1.1.1 Algorithmus.- 1.1.2 Turing-Maschine.- 1.1.3 Berechenbarkeit.- 1.2 Sprache und Grammatik.- 1.2.1 Sprache.- 1.2.2 Grammatik.- 1.3 Rechner.- 1.3.1 Von-Neumann-Rechnerarchitektur.- 1.3.2 Rechnersysteme.- 1.4 Informatik als Wissenschaft.- 2. Imperative Programmierung — die Sprache Modula-2.- 2.1 Syntaxdarstellungen.- 2.2 Elementare funktionale Modula-2-Programme.- 2.2.1 Eine Modula-2-Teilsprache.- 2.2.2 Programmverzweigungen.- 2.2.3 Funktionen und Prozeduren.- 2.2.4 Elementare Datentypen, Aufzählungs- und Bereichstypen.- 2.2.5 Eingabevariablen.- 2.2.6 Rekursive Funktionen und Prozeduren.- 2.2.7 Nachteile funktional-rekursiver Programme.- 2.3 Iterative Programme.- 2.3.1 Wertzuweisungen und Referenzparameter.- 2.3.2 Gültigkeitsbereich und Lebensdauer.- 2.3.3 Anweisungen zur Iteration.- 2.3.4 Vergleich iterativer und rekursiver Lösungen.- 2.3.5 Sprunganweisungen.- 2.3.6 Prozedurtypen.- 2.4 Komplexe Datentypen.- 2.4.1 Mengen (Sets).- 2.4.1.1 Darstellung und Manipulation von Mengen.- 2.4.1.2 Ein Beispiel für Sets.- 2.4.2 Arrays (Felder).- 2.4.3 Records (Verbunde).- 2.4.3.1 Einfache Records.- 2.4.3.2 Records mit Varianten.- 2.4.4 Zeiger (Pointer) und dynamische Variablen.- 2.4.4.1 Die Speicherung auf der Halde.- 2.4.4.2 Operationen auf Zeigern.- 2.4.4.3 Verkettete Listen.- 2.4.4.4 Anwendungen und Probleme dynamischer Variablen.- 2.4.5 Dateien (Files).- 2.4.5.1 Eigenschaften und formale Beschreibung.- 2.4.5.2 Dateien in Pascal.- 2.4.5.3 Dateien in Modula-2.- 3. Abstraktion.- 3.1 Abstraktionskonzepte in Programmiersprachen.- 3.2 Abstraktion in Modula-2.- 3.2.1 Das Prinzip der separaten Übersetzung.- 3.2.2 Modularisierung eines Programms.- 3.2.3 Datenkapselung.- 3.2.4 Abstrakte Datentypen.- 3.2.4.1 Das Prinzip des Abstrakten Datentyps.- 3.2.4.2 Abstrakte Datentypen Schlange und Stack.- 3.2.4.3 Abstrakter Datentyp für große Zahlen.- 3.2.4.4 Abstrakter Datentyp für komplexe Zahlen.- 4. Semantik, Verifikation und Test.- 4.1 Konzepte für eine Semantikdefinition.- 4.1.1 Semantik: Begriff und Motivation.- 4.1.2 Grundprinzipien von Semantiknotationen.- 4.1.3 Ein Beispiel für die operationale Semantik.- 4.2 Spezifikation und Verifikation von Programmen.- 4.2.1 Vor-und Nachbedingungen.- 4.2.2 Schwächste Vorbedingungen.- 4.2.3 Die Verifikation.- 4.2.4 Beschreibung einer Schleife durch eine Invariante.- 4.2.5 Konstruktion iterativer Programme.- 4.2.6 Zusammenfassung.- 4.3 Test.- 4.3.1 Begriffsbildung und Prinzipien.- 4.3.1.1 Begriffliche Abgrenzung.- 4.3.1.2 Aufgabenteilung und Zielsetzung.- 4.3.1.3 Material und Resultate des Tests.- 4.3.2 Grenzen des Testens.- 4.3.3 Die Konstruktion von Testdaten.- 4.3.4 Zusammenfassung.- 5. Programmierparadigmen und -sprachen.- 5.1 Programmierparadigmen.- 5.1.1 Imperatives Programmieren.- 5.1.2 Funktionales Programmieren.- 5.1.3 Logik-basiertes Programmieren.- 5.1.4 Objektorientiertes Programmieren.- 5.1.5 Regel-basiertes Programmieren.- 5.1.6 Programmierung von Mehrprozessor-Systemen.- 5.2 Übersicht über Programmiersprachen.- 6. Datenstrukturen und Algorithmen.- 6.1 Komplexität und Effizienz.- 6.1.1 Motivation und Begriffsbildung.- 6.1.2 Effizienz und Komplexität von Algorithmen.- 6.1.3 Komplexität von Funktionen und Sprachen.- 6.2 Graphen und Bäume.- 6.2.1 Graphen.- 6.2.2 Bäume.- 6.3 Suchen in gegebenen Datenstrukturen.- 6.3.1 Suchen in Tabellen.- 6.3.2 Suchen von Zeichenketten.- 6.4 Datenorganisationen für effizientes Suchen.- 6.4.1 Suchverfahren auf Bäumen.- 6.4.1.1 Binäre Suchbäume.- 6.4.1.2 AVL-Bäume.- 6.4.1.3 Optimale Suchbäume.- 6.4.1.4 B-Bäume.- 6.4.1.5 Weitere balancierte Suchbäume.- 6.4.2 Hashing.- 6.4.2.1 Begriffsbildung und Anforderungen.- 6.4.2.2 Perfektes Hashing.- 6.4.2.3 Kollisionsbehandlung.- 6.4.2.4 Löschen in Hash-Tabellen.- 6.4.2.5 Aufwandsabschätzung.- 6.4.2.6 Implementierung von Kollisionsbehandlungen.- 6.5 Sortieren.- 6.5.1 Klassifizierung und allgemeine Betrachtungen.- 6.5.2 Interne Sortierverfahren.- 6.5.2.1 Einfache Sortierverfahren.- 6.5.2.2 Schnelle Sortierverfahren.- 6.5.2.3 Implementierung ausgewählter Sortierverfahren.- 6.5.2.4 Aufwandsvergleich der Sortierverfahren.- 6.5.2.5 Sortieren durch Streuen und Sammeln.- 6.5.3 Externe Sortierverfahren.- 6.5.3.1 Direktes Mischen.- 6.5.3.2 Natürliches Mischen.- 6.5.3.3 Mehrwege-Mischen.- 6.6 Speicherverwaltung.- 6.6.1 Algorithmische Konzepte.- 6.6.2 Implementierung von Stacks.- Anhang A: Mathematische Grundbegriffe und Formeln.- Anhang B: Syntaxdiagramme für Modula-2.- Literatur.- Abkürzungsverzeichnis.- Modula-2-Index.
£31.34
Springer Fachmedien Wiesbaden Studienführer IT an Fachhochschulen: Studieren
Book SynopsisDer Student erhält eine zuverlässige und detaillierte Übersicht über das konkrete Studienangebot der Fachhochschule. Gleichzeitig bekommt er konkrete Praktikums- und Karriereoptionen aufgezeigt: Mit spannenden Praktikerportraits und über 70 Firmenprofilen solcher Unternehmen, die die Vorzüge des FH-Studiums für das eigene Unternehmen zu schätzen wissen. Das neue Werk versteht sich als aktuelles und umfassendes Servicehandbuch, Übersicht und Orientierungshilfe für Studienbewerber, Studienanwärter, Fachhochschulstudenten und -absolventen. Es bietet einen detaillierten Einblick in das Studium der IT-Studiengänge an der Fachhochschule und die damit verbundenen Berufs- und Karrierechancen. Trade Review"Angesichts des Bedarfs gerade von FH-Absolventen dürfte der Führer auf breites Interesse stoßen." (ekz-Bibliotheksdienst, ID 29/02)Table of ContentsBildungsauftrag der Fachhochschule - Gestaltung der Praxisnähe - FH-Professoren: Erreichbare Coaches - IT-Studiengänge an der Fachhochschule - Praktika, Persönliche Qualifizierung - Tipps für Studium und Berufseinstieg - Erfolgs-Stories von IT-Praktikern mit FH-Abschluss - Fachhochschulen stellen sich vor - Unternehmen stellen sich vor
£37.99
Springer Fachmedien Wiesbaden Lehrbuch EDV: Elektronische Datenverarbeitung
Book SynopsisTable of Contents1. Algorithmen.- 1.1 Was ist ein Algorithmus?.- Euklidischer Algorithmus.- Die Fähigkeiten des Computers.- 1.2 Lineare Anweisungsfolge.- Variable und Konstante.- Name von Variablen.- Wertzuweisung.- Programmablaufplan.- Hilfsvariable.- Ein- und Ausgabe von Daten.- Die Zahlenmengen der EDV.- Abschneiden und Runden.- Abschneiden.- Runden.- 1.3 Bedingte Anweisungen (Verzweigungen).- Sortierprobleme.- Zusammengesetzte Bedingungen.- 1.4 Schleifen.- Laufanweisungen.- Auflösen von Laufanweisungen.- Schleifen mit Bedingungen.- Ineinandergeschachtelte Schleifen.- 1.5 Felder.- Sortieren eines Feldes.- Tabellen.- Äquidistante Schlüsselwerte.- Sequentielles Suchen und Interpolieren in geordneten Tabellen.- Binäres Suchen.- Doppelt indizierte Felder.- 1.6 Funktionen.- Funktionen mit mehreren Parametern.- 1.7 Unterprogramme.- 2. Algol.- 2.1 Was ist eine Programmiersprache?.- 2.2 Lineare Anweisungsfolge.- Abschneiden.- Runden.- Die Programmierung von Termen.- 2.3 Bedingte Anweisungen (Verzweigungen).- Sortierprobleme.- Zusammengesetzte Bedingungen.- 2.4 Schleifen.- Auflösen der Laufanweisung.- Schleifen mit Bedingung.- Ineinandergeschachtelte Laufanweisungen.- 2.5 Felder.- Sortieren eines Feldes.- Tabellen.- Äquidistante Tabellen.- Sequentielles Suchen in geordneten Tabellen.- Binäres Suchen.- Doppelt indizierte Felder.- 2.6 Funktionen.- Standardfunktionen.- Funktionen mit mehreren Parametern.- 2.7 Unterprogramme.- Zusammenfassung der ALGOL-Begriffe.- 3. Fortran.- 3.1 Was ist eine Programmiersprache?.- 3.2 Die Programmierung einer linearen Anweisungsfo1ge.- Erläuternde Kommentare zu einem FORTRAN-Programm.- Ausgabe von Text.- Die Programmierung von Termen.- Abschneiden und Runden.- 3.3 Bedingte Anweisungen (Verzweigungen).- Sortierprobleme.- Zusammengesetzte Bedingungen.- 3.4 Schleifen.- Aufgelöste Schleifenanweisung.- Schleifen mit Bedingung.- Ineinandergeschachtelte Schleifenanweisung.- 3.5 Felder.- Suchen und Interpolieren in Tabellen.- Tabellen mit äquidistanten Schlüsselwerten.- Tabellen mit geordneten Schlüsselwerten.- Doppelt indizierte Felder.- 3.6 Funktionen.- Standardfunktionen.- Funktionen mit mehreren Parametern.- 3.7 Unterprogramme.- Zusammenfassung der Grundbegriffe der Programmiersprache FORTRAN.- 4. Aufgaben.- E Aufgaben aus elementaren Stoffgebieten.- M Aufgaben aus der Mengenlehre.- Z Aufgaben mit ganzen Zahlen (Zahlentheorie).- S Aufgaben mit Gesamtheiten reeller Zahlen (Statistik, Tabellen).- G Aufgaben mit Gleichungen und Ungleichungen.- F Aufgaben über Funktionen.- A Aufgaben über Vektoren und analytische Geometrie.- T Aufgaben aus der Trigonometrie.- R Aufgaben über Folgen und Reihen.- N Näherungsmethoden.- I Aufgaben aus der Integralrechnung.- V Verschiedenes.- Geschichtlicher Überblick.- Weiterführende Literatur.- Stichwortverzeichnis.
£40.84
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Cambridge Summer School in Mathematical Logic: Held in Cambridge /U. K., August 1-21, 1971
Book SynopsisLectures on intuitionism.- Realizability: A retrospective survey.- Some applications of Kleene's methods for intuitionistic systems.- Notes on intuitionistic second order arithmetic.- Some properties of intuitionistic zermelo-frankel set theory.- Ouelques Resultats sur les Interpretations Fonctionnelles.- Combinator realizability of constructive finite type analysis.- The arithmetic theory of constructions.- The priority method for the construction of recursively enumerable sets.- Admissible ordinals and priority arguments.- Abstract computability versus analog-generability (a survey).- Infinitary combinatorics.- The maximum sum of a family of ordinals.- Effective implications between the "finite" choice axioms.- On descendingly complete ultrafilters.- XVI. A model for the negation of the axiom of choice.- Filters closed under MAHLO's and GAIFMAN's operation.- On chromatic number of graphs and set systems.- Countable models of set theories.- Errata.- Descriptive set theory in .- Modal model theory.- A preservation theorem for interpretations.- Vaught sentences and Lindström's regular relations.Table of ContentsLectures on intuitionism.- Realizability: A retrospective survey.- Some applications of Kleene's methods for intuitionistic systems.- Notes on intuitionistic second order arithmetic.- Some properties of intuitionistic zermelo-frankel set theory.- Ouelques Resultats sur les Interpretations Fonctionnelles.- Combinator realizability of constructive finite type analysis.- The arithmetic theory of constructions.- The priority method for the construction of recursively enumerable sets.- Admissible ordinals and priority arguments.- Abstract computability versus analog-generability (a survey).- Infinitary combinatorics.- The maximum sum of a family of ordinals.- Effective implications between the "finite" choice axioms.- On descendingly complete ultrafilters.- XVI. A model for the negation of the axiom of choice.- Filters closed under MAHLO's and GAIFMAN's operation.- On chromatic number of graphs and set systems.- Countable models of set theories.- Errata.- Descriptive set theory in .- Modal model theory.- A preservation theorem for interpretations.- Vaught sentences and Lindström's regular relations.
£35.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG An Introduction to Default Logic
Book SynopsisThis book is written for those who are interested in a fonnalization of human reasoning, especially in order to build "intelligent" computer systems. Thus, it is mainly designed for the Artificial Intelligence community, both students and researchers, although it can be useful for people working in related fields like cognitive psychology. The major theme is not Artificial Intelligence applications, although these are discussed throughout in sketch fonn. Rather, the book places a heavy emphasis on the fonnal development of default logic, results and problems. Default logic provides a fonnalism for an important part of human reasoning. Default logic is specifically concerned with common sense reasoning, which has recently been recognized in the Artificial Intelligence literature to be of fundamental importance for knowledge representation. Previously, fonnalized reasoning systems failed in real world environments, though succeeding with an acceptable ratio in well-defined environments. This situation enabled empirical explorations and the design of systems without theoretical justification. In particular, they could not be compared since there was no basis to judge their respective merits. Default logic turned out to be very fruitful by proving the correctness of some of them. We hope that this book will initiate other successful developments in default logic.Table of Contents1. Default Reasoning.- 2. Formal Logic as a Knowledge Representation Scheme.- 3. First Order Logic.- 4. Nonmonotonic Extensions for First Order Logic.- 5. Presentation of Default Logic.- 6. Formal Development of Default Logic.- 7. Normal Defaults.- 8. Further Topics in Default Logic.- 9. Fragments of Default Logic.- 10. Problems with Default Logic.- 11. Default Logic Revisited.- 12. Circumscription.- 13. Other Logic Formalizations of Nonmonotonic Reasoning.- Appendix: Origin of the Theorems.- References.- Table of Symbols.
£80.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Software Engineering 3: Domains, Requirements, and Software Design
Book SynopsisThe final installment in this three-volume set is based on this maxim: "Before software can be designed its requirements must be well understood, and before the requirements can be expressed properly the domain of the application must be well understood." The book covers the process from the development of domain descriptions, through the derivation of requirements prescriptions from domain models, to the refinement of requirements into software architectures and component design.Trade ReviewFrom the reviews: "The presentation is focused on the fundamental ideas of domain engineering, requirements engineering and computer system engineering. … The rigorous treatment and the author’s original style of viewing the software engineering approaches are important, outstanding features … . is of special interest for both software engineering theorists and practitioners … . The style is very concise, but at the same time very friendly. … Undoubtedly, readers coming from a large variety of fields of interest will appreciate the novelty and usefulness … ." (Tudor Balanescu, Zentralblatt MATH, Vol. 1095 (21), 2006)Table of ContentsOpening.- The Triptych Paradigm.- Documents.- Conceptual Framework.- Methods and Methodology.- Models and Modelling.- Descriptions: Theory and Practice.- Phenomena and Concepts.- On Defining and on Definitions.- Jackson’s Description Principles.- Domain Engineering.- Overview of Domain Engineering.- Domain Stakeholders.- Domain Attributes.- Domain Facets.- Domain Acquisition.- Domain Analysis and Concept Formation.- Domain Verification and Validation.- Towards Domain Theories.- The Domain Engineering Process Model.- Requirements Engineering.- Overview of Requirements Engineering.- Requirements Stakeholders.- Requirements Facets.- Requirements Acquisition.- Requirements Analysis and Concept Formation.- Requirements Verification and Validation.- Requirements Satisfiability and Feasibility.- The Requirements Engineering Process Model.- Computing Systems Design.- Hardware/Software Codesign.- Software Architecture Design.- A Case Study in Component Design.- Domain-Specific Architectures.- Etcetera: Coding and All That!.- The Computing Systems Design Process Model.- Closing.- The Triptych Development Process Model.- Finale.
£89.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Software Product Line Engineering: Foundations, Principles and Techniques
Book SynopsisSoftware product line engineering has proven to be the methodology for developing a diversity of software products and software intensive systems at lower costs, in shorter time, and with higher quality. In this book, Pohl and his co-authors present a framework for software product line engineering which they have developed based on their academic as well as industrial experience gained in projects over the last eight years. They do not only detail the technical aspect of the development, but also an integrated view of the business, organisation and process aspects are given. In addition, they explicitly point out the key differences of software product line engineering compared to traditional single software system development, as the need for two distinct development processes for domain and application engineering respectively, or the need to define and manage variability. Table of ContentsPart I Introduction Introduction to Software Product Line Engineering. - A Framework for Software Product Line Engineering. - Overview on the Example Domain: Home Automation Part II Variability Principles of Variability. - Documenting Variability in Requirements. - Documenting Variability in Design. - Documenting Variability in Realisation Part III Domain Engineering Product Management. - Domain Requirements Engineering. - Domain Design. - Domain Realisation. - Domain Testing. - Using COTS Components as Domain Artefacts Part IV Application Engineering Application Requirements Engineering. - Application Design. - Application Realisation. - Application Testing Part V Organisation Aspects Organisation. - Transition Process Part VI Experiences Experiences with Software Product Lines Appendix
£49.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Extremal Combinatorics: With Applications in
Book SynopsisThis book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful combinatorial tools together with impressive applications in computer science: methods of extremal set theory, the linear algebra method, the probabilistic method, and fragments of Ramsey theory. No special knowledge in combinatorics or computer science is assumed – the text is self-contained and the proofs can be enjoyed by undergraduate students in mathematics and computer science. Over 300 exercises of varying difficulty, and hints to their solution, complete the text.This second edition has been extended with substantial new material, and has been revised and updated throughout. It offers three new chapters on expander graphs and eigenvalues, the polynomial method and error-correcting codes. Most of the remaining chapters also include new material, such as the Kruskal—Katona theorem on shadows, the Lovász—Stein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvir's solution of the finite field Kakeya conjecture, Moser's algorithmic version of the Lovász Local Lemma, Schöning's algorithm for 3-SAT, the Szemerédi—Trotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results.Trade ReviewFrom the reviews of the second edition:“This is an entertaining and impressive book. I say impressive because the author managed to cover a very large part of combinatorics in 27 short chapters, without assuming any graduate-level knowledge of the material. … The collection of topics covered is another big advantage of the book. … The book is ideal as reference material or for a reading course for a dedicated graduate student. One could teach a very enjoyable class from it as well … .” (Miklós Bóna, The Mathematical Association of America, May, 2012)"[R]eaders interested in any branch of combinatorics will find this book compelling. ... This book is very suitable for advanced undergraduate and graduate mathematics and computer science majors. It requires a very solid grounding in intermediate-level combinatorics and an appreciation for several proof methods, but it is well worth the study." (G.M. White, ACM Computing Reviews, May 2012)“This is the second edition of a well-received textbook. It has been extended with new and updated results. Typographical errors in the first edition are corrected. … This textbook is suitable for advanced undergraduate or graduate students as well as researchers working in discrete mathematics or theoretical computer science. The author’s enthusiasm for the subject is evident and his writing is clear and smooth. This is a book deserving recommendation.” (Ko-Wei Lih, Zentralblatt MATH, Vol. 1239, 2012)“This is an introductory book that deals with the subject of extremal combinatorics. … The book is nicely written and the author has included many elegant and beautiful proofs. The book contains many interesting exercises that will stimulate the motivated reader to get a better understanding of this area. … author’s goal of writing a self-contained book that is more or less up to date … and that is accessible to graduate and motivated undergraduate students in mathematics and computer science, has been successfully achieved.” (Sebastian M. Cioabă, Mathematical Reviews, January, 2013)Table of ContentsPreface.- Prolog: What this Book Is About.- Notation.- Counting.- Advanced Counting.- Probabilistic Counting.- The Pigeonhole Principle.- Systems of Distinct Representatives.- Sunflowers.- Intersecting Families.- Chains and Antichains.- Blocking Sets and the Duality.- Density and Universality.- Witness Sets and Isolation.- Designs.- The Basic Method.- Orthogonality and Rank Arguments.- Eigenvalues and Graph Expansion.- The Polynomial Method.- Combinatorics of Codes.- Linearity of Expectation.- The Lovász Sieve.- The Deletion Method.- The Second Moment Method.- The Entropy Function.- Random Walks.- Derandomization.- Ramseyan Theorems for Numbers.- The Hales–Jewett Theorem.- Applications in Communications Complexity.- References.- Index.
£75.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.
£38.24
Springer Fachmedien Wiesbaden Computational Engineering 2: Theorie und Anwendungen im Bereich der Elektrodynamik
Book SynopsisDas Buch zeigt Theorie und praktische Anwendungen im Bereich des Computational Engineering (berechnendes Ingenieurwesen) für elektrodynamische Anwendungen. Es illustriert sowohl die mathematischen Modelle wie auch die zugehörigen Simulationsmethoden für die verschiedenen Ingenieursanwendungen. Außerdem präsentiert es Strategien zur Verbesserung der numerischen Methoden wie z. B. Zeit-Raum-Verfahren, hyperbolische Löser, Multiskalenlöser oder strukturerhaltende Verfahren sowie Kopplungsverfahren für elektrodynamische und hydrodynamische Modelle auf verschiedenen Zeit- und Raumskalen. Dabei werden Ansätze zur Zerlegung in einfachere und effizient lösbare Teilprobleme vorgestellt. Gerade im Bereich der Multikomponenten- und Multiskalenmodelle bei komplizierten Ingenieursproblemen sind solche neuartigen Multiskalenverfahren wichtig. Weiter werden auch stochastische Modelle im Bereich der Partikelmodelle und deren Einbindung in deterministische Modelle besprochen. Diese neueren Problemstellungen brauchen iterative Löser zur Kopplung der verschiedenen Zeit- und Raumskalen. Die umfangreichen Beispiele aus dem Bereich der Elektrodynamik (inkl. elektromagnetische Felder, Antennenmodelle, Teilchenmodelle im Bereich der Plasmasimulation) geben dem Leser einen Überblick zu den aktuellen Themen und deren praktischer Umsetzung in spätere Simulationsprogramme.Table of ContentsEinleitung und Überblick - Motivation und Grundlagen - Numerische Verfahren: Diskretisierungs- und Lösungsverfahren - Ergänzenden Numerische Verfahren: Zerlegungsverfahren und Parallelisierung - Anwendungen in der Elektrodynamik - Weitere Anwendungen im Bereich des Partikel-Transport und Umsetzung von Modellen bis zum Programm-Code - Zusammenfassung
£28.49
Springer Vieweg Informatik für alle
Book Synopsis1 Was ist Informatik?.- 2 Ein kurzer Ausflug in die Berechenbarkeit.- 3 Was ist Programmierung und Start der Programmierung.- 4 Elementare Datentypen.- 5 Informationsdarstellung und Algorithmen.- 6 Kontrollstrukturen und Flussdiagramme.- 7 Programmieren allein zu Hause.- 8 Funktionen.- 9 Felder.- 10 Beispiel zum Mitmachen.- 11 Zeiger.- 12 Strukturen.- 13 Dynamische Speicheranforderung.- 14 Aufwand.- 15 Ein Anwendungsbeispiel: die Kryptografie.- 16 Software-Engineering.- 17 Künstliche Intelligenz.
£33.91
Springer Fachmedien Wiesbaden Grundkurs Theoretische Informatik: Eine
Book SynopsisDiese Theorie-Einführung hat konsequent aktuelle Anwendungen im Blick. Seien es Suchmaschinen, Workflow-Managementsysteme, Web Services, Verschlüsselung von Informationen, Authentifizierungsprotokolle – all diese Technologien beruhen auf theoretischen Grundlagen der Informatik. So trägt das Buch dazu bei, dass Studierende die Grundlagen der Theoretischen Informatik nicht nur kennen lernen, sondern auch anwenden können, um effektiv und produktiv an informationstechnischen Problemlösungen mitwirken zu können. Wegen seiner speziellen inhaltlichen und didaktischen Qualität ist das Buch neben dem Einsatz in der Lehre auch für das Selbststudium geeignet.Table of ContentsEndliche Automaten und reguläre Sprachen - Kontextfreie Sprachen und Kellerautomaten - Turingmaschinen und Berechenbarkeit - Grenzen von Algorithmen - Komplexität, Effizienz und Effektivität - Vielfältige Anwendungen theoretischer Konzepte in der Praxis
£44.99
New India Publishing Agency Formulas and Computations in Agriculture
Book Synopsis
£36.58
Springer Verlag, Singapore New Trends in Applied Analysis and Computational
Book SynopsisThe volume contains original research papers as the Proceedings of the International Conference on Advances in Mathematics and Computing, held at Veer Surendra Sai University of Technology, Odisha, India, on 7-8 February, 2020. It focuses on new trends in applied analysis, computational mathematics and related areas. It also includes certain new models, image analysis technique, fluid flow problems, etc. as applications of mathematical analysis and computational mathematics. The volume should bring forward new and emerging topics of mathematics and computing having potential applications and uses in other areas of sciences. It can serve as a valuable resource for graduate students, researchers and educators interested in mathematical tools and techniques for solving various problems arising in science and engineering.Table of ContentsChapter 1. A fuzzy two-ware-house inventory model of deteriorating items with exponentially demand and backlogged condition.- Chapter 2. A comparative study of non-linear convection in a confined fluid overlying a porous layer.- Chapter 3. Persistence barcoded vehicular traffic videos in a topology of data approach to shape tracking.- Chapter 4. Heat transfer of MHD channel flow of viscoelastic (PTT) fluid.- Chapter 5. Properties of characteristic polynomials of oriented graphs.- Chapter 6. An inventory model on price-dependent-demand and linear deteriorating item with allowable shortages under partial-backlogged condition.- Chapter 7. On the local convergence of a sixth-order iterative scheme in Banach spaces.- Chapter 8. New results on chromatic polynomials.- Chapter 9. Recurrence relations of edge-Zagreb and sum-edge characteristic polynomials of some graphs.- Chapter 10. Effects of radiation on MHD flow with induced magnetic field.- Chapter 11. Various approximate multiplicative inverse lie ⋆-derivations.- Chapter 12. Analysis and computation of reactive second grade fluid flow with variable viscosity within porous channel.- Chapter 13. Hopf bifurcation and stability analysis of delayed Lotka-Volterra predator-prey model having disease for both existing species.- Chapter 14. An EOQ model without shortages with uncertain cost associated with some fuzzy parameters and interval parameters.- Chapter 15. Free Poisson elements induced by orthogonal projections.
£116.99
Springer Verlag, Singapore Artificial Intelligence and Evolutionary
Book SynopsisThis book gathers selected papers presented at the 6th International Conference on Artificial Intelligence and Evolutionary Computations in Engineering Systems, held at the Anna University, Chennai, India, from 20 to 22 April 2020. It covers advances and recent developments in various computational intelligence techniques, with an emphasis on the design of communication systems. In addition, it shares valuable insights into advanced computational methodologies such as neural networks, fuzzy systems, evolutionary algorithms, hybrid intelligent systems, uncertain reasoning techniques, and other machine learning methods and their application to decision-making and problem-solving in mobile and wireless communication networks.Table of ContentsChapter 1. Design and Construction of a Dual Axis Solar Tracking System by Astronomical Algorithm.- Chapter 2. Estimation of Magnetic Flux linkage in SRM using various defuzzification techniques.- Chapter 3. Multilevel Inverter based STATCOM for Distribution System.- Chapter 4. Sensitivity Analysis and Design Optimization of Synchronous Reluctance and Permanent Magnet Motors.- Chapter 5. A New Heuristic algorithm for Economic Load Dispatch incorporating wind power.- Chapter 6. Enhanced Grasshopper Optimization Algorithm For Numerical Optimization.- Chapter 7. Eco-Routing – To Reduce Vehicle CO2 Emissions by CACC: An IoT Application.- Chapter 8. Fuzzy Sliding Mode Control of DC-DC Boost Converter with Right-Half Plane Zero.- Chapter 9. Liquid Level Control of Non Linear Process Using Big Bang - Big Crunch Optimization Based Controller.- Chapter 10. Impact of PV Cells and MPPT Controller on Power System Dynamics.- Chapter 11. Wavelet Feature Based Microcalcification Detection in Mammogram.- Chapter 12. Reliable Radiation Hardened Memory Cells for Single-Event Multiple Effects.- Chapter 13. Finger Vein Identification Using Deep Convolutional Generative Adversarial Networks.- Chapter 14. Computer Aided Detection of Malignant Mass in Mammogram using U-Net Architecture.- Chapter 15. Visualization and Evaluation of Methane Gas Leakage by Thermal Image Processing using Supervised Deep Learning Models.
£189.99
Springer Verlag, Singapore Modeling and Simulation of Complex Dynamical
Book SynopsisThis book highlights the practical aspects of computer modelling and simulation of complex dynamical systems for students. Mechanical systems are considered in the book as representative examples of dynamical systems. Wolfram SystemModeler, in combination with Learning Management System Sakai, is used as an instrument for studying features of various physical and technical phenomena and processes. Each of the presented virtual labs may be considered a stand-alone mini project to enable students to go through all the steps of mathematical modelling and computer simulation—from the problem statement to mathematical and physical analysis of the obtained result. The book is useful for teachers to organize the educational process, allowing gradual monitoring of the learning process and assessment of students’ competencies. It also allows tutors to design individual educational trajectories for students to achieve educational properties. The subject of the book is an extension of activity started by the international team of authors within the InMotion project of the European programme ERASMUS+.Trade Review“The authors went to great effort to produce beautiful figures, with color no less, to aid the reader. The tables are laid out logically, and the discussion for each model is, for the most part straightforward. I wish I could recommend the book … .” (David S. Mazel, MAA Reviews, August 22, 2022)Table of Contents1. Virtual Labs (76 pages) 2 Guidelines for performing virtual labs in Wolfram SystemModeler (63 pages)
£37.99
Springer Verlag, Singapore Property Testing: Problems and Techniques
Book SynopsisThis book introduces important results and techniques in property testing, where the goal is to design algorithms that decide whether their input satisfies a predetermined property in sublinear time, or even in constant time – that is, time is independent of the input size. This book consists of three parts. The first part provides an introduction to the foundations of property testing. The second part studies the testing of specific properties on strings, graphs, functions, and constraint satisfaction problems. Vectors and matrices over real numbers are also covered. The third part is more advanced and explains general conditions, including full characterizations, under which properties are constant-query testable. The first and second parts of the book are intended for first-year graduate students in computer science. They should also be accessible to undergraduate students with the adequate background. The third part can be used by researchers or ambitious graduate students who want to gain a deeper theoretical understanding of property testing.Table of ContentsChapter 1: Introduction.- Chapter 2: Basic Techniques.- Chapter 3: Strings.- Chapter 4: Graphs in the Adjacency Metrix Model.- Chapter 5: Graphs in the Bounded-Degree Model.- Chapter 6: Functions over Hypercubes.- Chapter 7: Massively Parameterized Model.- Chapter 8: Vectors and Matrices over the Reals.- Chapter 9: Graphs in the Adjacency Matrix Model.- Chapter 10: Graphs in the Bounded-Degree Model.- Chapter 11: Affine-Invariant Properties of Functions.- Chapter 12: Linear Properties of Functions.- Chapter 13: Massively Parameterized Model.
£52.24
Springer Verlag, Singapore Machine Intelligence and Smart Systems:
Book SynopsisThis book is a collection of peer-reviewed best selected research papers presented at the Second International Conference on Machine Intelligence and Smart Systems (MISS 2021), organized during September 24–25, 2021, in Gwalior, India. The book presents new advances and research results in the fields of machine intelligence, artificial intelligence and smart systems. It includes main paradigms of machine intelligence algorithms, namely (1) neural networks, (2) evolutionary computation, (3) swarm intelligence, (4) fuzzy systems and (5) immunological computation. Scientists, engineers, academicians, technology developers, researchers, students and government officials will find this book useful in handling their complicated real-world issues by using machine intelligence methodologies.Table of ContentsArtificial Intelligence Aided Neurodevelopmental Disorders Diagnosis: Techniques Revisited.- Deep Learning Implementation for Dark Matter Particle Detection.- Augmentation of Handwritten Devanagari Character Dataset Using DCGAN.- Deep Reinforcement Learning for Optimal Traffic Control.- Ensemble Semi-Supervised Machine Learning Algorithm for Classifying Complaint Tweets.- Underwater Image Enhancement Using Fusion Stretch Method.- A Novel Approach for Semantic Microservices Description and Discovery towards Smarter Applications.
£189.99
Springer Verlag, Singapore Quantum Computers: Theory and Algorithms
Book SynopsisThis book presents various theories and algorithms to create a quantum computer. The concept of the classical and quantum computers, and the concept of circuits and gates are reviewed. The example of the Deutsch and the Deutsch-Josca algorithm is discussed to illustrate some key features of quantum computing. The Grover algorithm, considered to be of major milestone of the subject, is discussed in detail to exemplify the techniques used in computer algorithms. The role of quantum superposition (also called quantum parallelism) and of quantum entanglement is discussed in order to understand the key advantages of a quantum over a classical computer.Table of Contents1 Introduction 2 Classical Computer 2.1 Binary Representation 3 Quantum Computer 3.1 Qubit 4 Classical Gates and Circuits 5 Quantum Gates and Circuits 5.1 Hilbert space 5.2 Measurement 6 Deutsch Algorithm 7 Grover Algorithm 7.1 Grover algorithm: two-qubit 7.2 Grover algorithm: n-qubit 7.3 Grover diffusion and rotation gate G 7.4 Single Recursion: Two qubit 8 Deutsch-Josza Algorithm 9 Simon’s Algorithm 9.1 Quantum Algorithm 9.2 An Illustrative Example 10 Quantum Fourier Transform (QFT) 51 10.1 Quantum circuit of QFT 11 Shor 11.1 Introduction 11.2 Understanding the classical algorithm 11.3 Quantum algorithm 12 Option Pricing 12.1 Quantum Algorithm for Option Pricing 12.2 Quadratic Improvement 12.3 Estimation of Phase 12.4 Call Option 13 Solving Linear Equations 13.1 Introduction 13.2 Harrow-Hassidim-Lloyd Algorithm 13.3 Specific Example 13.4 Other applications 14 Quantum-Classical Hybrid Algorithms 14.1 Why bother? 14.2 Overlap of Wavefunctions 14.3 Variational Quantum Eigensolvers 15 Quantum Error Correction 15.1 Introduction 15.2 Simple quantum errors 15.3 Kraus Operators 15.4 Nine-qubit Code 15.5 General properties of quantum error-correcting codes 15.6 Classical Linear Codes 15.7 CSS Codes 16 Efficiency of a Quantum Computer 16.1 So where does quantum computation take place? 16.2 Conclusions 16.3 Acknowledgements
£98.99
Springer Verlag, Singapore Quantum Mechanics: A Concise Introduction
Book SynopsisThis textbook highlights a concise introduction to quantum mechanics in a readable and serious manner. Being readable, the book intends to present the beauty and magic of quantum mechanics to the mass public. Being serious, the book uses mathematics to describe the most profound results in quantum mechanics. To balance the two, the book assumes that the readers are familiar with high-school mathematics and instructs the least possible advanced mathematics necessary for the understanding of quantum mechanics.The book first covers the history of quantum mechanics and then introduces the magical quantum world, including quantum states living in Hilbert space, indistinguishable particles, linear superposition, Heisenberg's uncertainty relations, quantum entanglement, Bell's inequality, quantum energy levels, Schrödinger’s cat and many-worlds theory, etc. To compare with classic physics, the book also covers the classic mechanics before introducing quantum mechanics. At last, the book briefly covers quantum computing and quantum communications. Besides readers of other majors, the book is also a good reference for students in physics. It helps physics students to develop a solid understanding of the basics of quantum mechanics, preventing them from getting lost in solving the Schrödinger equation. The book also discusses quantum entanglement and quantum information which traditional quantum mechanics textbooks do not cover. The Foreword is written by Frank Wilczek, Nobel Laureate in physics, 2004.This book is a translation of an original Chinese edition. The translation was done with the help of artificial intelligence (machine translation by the service DeepL.com). A subsequent human revision was done primarily in terms of content, so that the book will read stylistically differently from a conventional translation.Table of ContentsChapter 1. What is quantum?.- Chapter 2. Brief history of quantum mechanics.- Chapter 3. Classical mechanics and old quantum theories.- Chapter 4. Complex number and linear algebra.- Chapter 5. Quantum entanglement and Bell’s inequality.- Chapter 6. Quantum measurement.- Chapter 7. Quantum computing.- Chapter 8. Quantum communications.
£56.99
Springer Verlag, Singapore Distributed Optimization in Networked Systems:
Book SynopsisThis book focuses on improving the performance (convergence rate, communication efficiency, computational efficiency, etc.) of algorithms in the context of distributed optimization in networked systems and their successful application to real-world applications (smart grids and online learning). Readers may be particularly interested in the sections on consensus protocols, optimization skills, accelerated mechanisms, event-triggered strategies, variance-reduction communication techniques, etc., in connection with distributed optimization in various networked systems. This book offers a valuable reference guide for researchers in distributed optimization and for senior undergraduate and graduate students alike.Table of ContentsChapter 1. Distributed Nesterov-Like Accelerated Algorithms in Networked Systems with Directed Communications.- Chapter 2. Distributed Stochastic Projected Gradient Algorithms for Composite Constrained Optimization in Networked Systems.- Chapter 3. Distributed Proximal Stochastic Gradient Algorithms for Coupled Composite Optimization in Networked Systems.- Chapter 4. Distributed Subgradient Algorithms Based on Event-Triggered Strategy in Networked Systems.- Chapter 5. Distributed Accelerated Stochastic Algorithms Based on Event-Triggered Strategy in Networked Systems.- Chapter 6. Event-Triggered Based Distributed Optimal Economic Dispatch in Smart Grids.- Chapter 7. Fast Distributed Optimal Economic Dispatch in Dynamic Smart Grids with Directed Communications.- Chapter 8. Accelerated Distributed Optimal Economic Dispatch in Smart Grids with Directed Communications.- Chapter 9. Privacy Preserving Distributed Online Learning with Time-Varying and Directed Communications.
£132.99
