Maths for computer scientists Books

Book SynopsisThis book constitutes the refereed proceedings of the 16th International Conference on Learning and Intelligent Optimization, LION 16, which took place in Milos Island, Greece, in June 2022.The 36 full papers and 3 short papers presented in this volume were carefully reviewed and selected from 60 submissions. LION deals with automatic solver configuration, parallel methods, intelligent optimization, nature-inspired algorithms, hard combinatorial optimization problems, DC learning, computational intelligence, and others. The contributions were organized in topical sections as follows: Invited Papers; Contributed Papers.Table of Contents​Invited Papers.- Optimal Scheduling of the Leaves of a Tree and the SVO Frequencies of Languages.- From Design of Experiments to Combinatorics of Disasters: A Conceptual Framework for Disaster Exercises.- Separating two polyhedra utilizing alternative theorems and penalty function.- Contributed Papers. -A Composite Index Method for Optimization Benchmarking.- Optimal Energy Management of Microgrid Using Multi-objective Optimisation Approach.- A Stochastic Alternating Balance k-Means Algorithm for Fair Clustering.- Binary Black Widow Optimization Algorithm for Feature Selection Problems.- Learning to Solve a Stochastic Orienteering Problem with Time Windows.- ML-based approach for accelerating global search algorithm for solving multicriteria problems .- The Skewed Kruskal algorithm.- Bounds for sparse solutions of K-SVCR multi-class classification model.- Integer Linear Programming in Solving an Optimization Problem at the Mixing Department of the Metallurgical Production.- Realtime Gray-Box Algorithm Configuration.- Dynamic urban solid waste management system for smart cities.- Single MCMC Chain Parallelisation on Decision Trees.- Single MCMC Chain Parallelisation on Decision Trees.- Competitive supply allocation in a distribution network under overproduction.- Safe-exploration of control policies from safe-experience via Gaussian Processes.- Bayesian Optimization in Wasserstein Spaces.- Network Vulnerability Analysis in Wasserstein Spaces.- BERT Self-Learning Approach with Limited Labels for Document Classification.- Autonomous Learning Optimization for Deep Learning.- Optimizing Data Augmentation Policy through Random Unidimensional Search.- Evaluating Student Behaviour on the MathE Platform - Clustering Algorithms Approaches.- Unsupervised Training for Neural TSP Solver.- Comparing surrogate models for tuning optimization algorithms.- Search and Score-based Waterfall Auction Optimization.- Survey on KNN Methods in Data Science.- Constrained Shortest Path and Hierarchical Structures.- Investigation of Graph Neural Networks for Instance Segmentation of Industrial Point Cloud Data.- Fitness landscape ruggedness impact on PSO in dealing with three variants of the travelling salesman problem.- A Multi-UAVs’ Provider Model for the provision of 5G Service Chains: a game theoretic approach.- Metabolic Syndrome Risk Forecasting on Elderly with ML Techniques.- Airport Digital Twins for Resilient Disaster Management Response.- Strategies for Surviving Aggressive Multiparty Repeated Standoffs.- A Hybridization of GRASP and UTASTAR for Solving the Vehicle Routing Problem with Pickups and Deliveries and 3D Loading Constraints.- Packing hypertrees and the k-cut problem in Hypergraphs.- Maximizing the Eigenvalue-Gap and Promoting Sparsity of Doubly Stochastic Matrices with PSO.- Value of Information in the Mean-Square Case and its Application to the Analysis of Financial Time-Series Forecast.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 18th European Workshop on Computer Performance Engineering, EPEW 2022, held in Santa Pola, Spain, in September 2022.The 14 papers presented in this volume together with one invited talk were carefully reviewed and selected from 14 submissions. The papers presented at the workshop reflect the diversity of modern performance engineering. The sessions covered a wide range of topics including robustness analysis, machine learning, edge and cloud computing, as well as more traditional topics on stochastic modelling, techniques and tools.Table of ContentsRobustness analysis.- Applications.- Stochastic modelling.- Machine learning.- Edge-cloud computing.- Modelling paradigms and tools.

Read more less

Book SynopsisThis book constitutes the proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023, which was held in Gandhinagar, India, during February 9-11, 2023.The 32 papers presented in this volume were carefully reviewed and selected from 67 submissions. The papers were organized in topical sections named: algorithms and optimization; computational geometry; game theory; graph coloring; graph connectivity; graph domination; graph matching; graph partition and graph covering.Table of ContentsStable Approximation Schemes.- A whirlwind tour of intersection graph enumeration.- Graph modification problems with forbidden minors.- Algorithms & Optimization Efficient reductions and algorithms for Subset Product.- Optimal length cutting plane refutations of integer programs.- Fault-Tolerant Dispersion Resource management in device-to-device communications.- Computational Geometry Algorithms for k-Dispersion for Points in Convex Position in the Plane.- Arbitrary oriented color spanning region for line segments.- Games with a Simple Rectilinear Obstacle in Plane.- Diverse Fair Allocations: Complexity and Algorithms.- Graph Coloring New bounds and constructions for neighbor-locating colorings of graphs.- D K 5-list coloring toroidal 6-regular triangulations in linear time.- On Locally Identifying Coloring of Graphs.- On Structural Parameterizations of Star Coloring.- Reddy Perfectness of G-generalized join of graphs.- Coloring of a superclass of 2K2-free graphs.- The Weak (2,2)-Labelling Problem for graphs with forbidden induced structures.- Graph Connectivity Short cycles dictate dichotomy status of the Steiner tree problem on Bisplit graphs.- Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs.- Monitoring edge-geodetic sets in graphs.- Cyclability, Connectivity and Circumference.- Graph Domination On three domination-based identification problems in block graphs.- Graph modification problems with forbidden minors.- Computational Aspects of Double Dominating Sequences in Graph.- Relation between broadcast domination and multipacking numbers on chordal graphs.- Pushing Cops and Robber on Oriented Graphs.- Mind the Gap: Edge Facility Location Problems in Theory and Practice.- Complexity Results on Cosecure Domination in Graphs.- Kusum and Arti Pandey Graph Matching Latin Hexahedra and Related Combinatorial Structures.- Minimum Maximal Acyclic Matching in Proper Interval Graphs.- Graph Partition & Graph Covering Transitivity on subclasses of chordal graphs.- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength.- Covering using Bounded Size Subgraphs.- Axiomatic characterization of the the toll walk function of some graph classes.- Structural Parameterization of Alliance Problems.

Read more less

Book SynopsisThe multi-volume set LNAI 13713 until 13718 constitutes the refereed proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2022, which took place in Grenoble, France, in September 2022.The 236 full papers presented in these proceedings were carefully reviewed and selected from a total of 1060 submissions. In addition, the proceedings include 17 Demo Track contributions. The volumes are organized in topical sections as follows: Part I: Clustering and dimensionality reduction; anomaly detection; interpretability and explainability; ranking and recommender systems; transfer and multitask learning; Part II: Networks and graphs; knowledge graphs; social network analysis; graph neural networks; natural language processing and text mining; conversational systems; Part III: Deep learning; robust and adversarial machine learning; generative models; computer vision; meta-learning, neural architecture search; Part IV: Reinforcement learning; multi-agent reinforcement learning; bandits and online learning; active and semi-supervised learning; private and federated learning; . Part V: Supervised learning; probabilistic inference; optimal transport; optimization; quantum, hardware; sustainability; Part VI: Time series; financial machine learning; applications; applications: transportation; demo track. Table of ContentsSupervised learning.- Probabilistic inference.- Optimal transport.- Optimization.- Quantum, hardware.- Sustainability.

Read more less

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

Read more less

Book SynopsisThis book constitutes the proceedings of the 20th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2023, which took place in Augsburg, Germany, during April 3–6, 2023. The 17 papers presented in this book were carefully reviewed and selected from 26 submissions. They deal with the development and dissemination of relation algebras, Kleene algebras, and similar algebraic formalisms. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond. Apart from the submitted articles, this volume features the abstracts of the presentations of the three invited speakers. Table of ContentsAmalgamation Property for Some Varieties of BL-algebras Generated by one Finite Set of BL-chains with Finitely-many Components.- Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture.- A General Method for Representing Sets of Relations by Vectors.- Contextuality in Distributed Systems.- The Structure of Locally Integral Involutive Po-monoids and Semirings.- Compatibility of Refining and Controlling Plant Automata with Bisimulation Quotients.- Dependences Between Domain Constructions in Heterogeneous Relation Algebras.- Normal Forms for Elements of the *-Continuous Kleene Algebras K (x) C2’.- Representable and Diagonally rRpresentable Weakening Relation Algebras.- Completeness and the Finite Model Property for Kleene Algebra, Reconsidered.- What Else is Undecidable About Loops.- Implication Algebras and Implication Semigroups of Binary Relations.- On the Complexity of Kleene Algebra with Domain.- Enumerating, Cataloguing and Classifying all Quantales on up to Nine Elements.- Duoidally Enriched Freyd Categories.- Towards a Theory of Conversion Relations for Prefixed Units of Measure.- Relational Algebraic Approach to the Real Numbers - The Additive Group.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 24th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2023, held in Madison, WI, USA, during June 21–23, 2023. The 33 full papers presented were carefully reviewed and selected from 119 submissions. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

Read more less

Book SynopsisThis volume constitutes the proceedings of the 9th International Conference on Variable Neighborhood Search, ICVNS 2023, held in Abu Dhabi, United Arab Emirates, in October 2022.The 11 full papers presented in this volume were carefully reviewed and selected from 29 submissions. The papers describe recent advances in methods and applications of variable neighborhood search.Table of ContentsA metaheuristic approach for solving Monitor Placement Problem.- A VNS-based heuristic for the minimum number of resources under a perfect schedule.- BVNS for Overlapping Community Detection.- A Simulation-Based Variable Neighborhood Search Approach for Optimizing Cross-Training Policies.- Multi-Objective Variable Neighborhood Search for improving software modularity.- An Effective VNS for Delivery Districting.- BVNS for the Minimum Sitting Arrangement problem in a cycle.- Assigning Multi-Skill Confgurations to Multiple Servers with a Reduced VNS.- Multi-Round Infuence Maximization: A Variable Neighborhood Search Approach.- A VNS based heuristic for a 2D Open Dimension Problem.- BVNS for the bi-objective multi row equal facility layout problem.

Read more less

Book SynopsisThis book constitutes the proceedings of the 6th International Conference on Geometric Science of Information, GSI 2023, held in St. Malo, France, during August 30-September 1, 2023. The 125 full papers presented in this volume were carefully reviewed and selected from 161 submissions. They cover all the main topics and highlights in the domain of geometric science of information, including information geometry manifolds of structured data/information and their advanced applications. The papers are organized in the following topics: geometry and machine learning; divergences and computational information geometry; statistics, topology and shape spaces; geometry and mechanics; geometry, learning dynamics and thermodynamics; quantum information geometry; geometry and biological structures; geometry and applications.Table of ContentsGeometry and machine learning.- Divergences and computational information geometry.- Statistics, topology and shape spaces.- Geometry and mechanics.- Geometry, learning dynamics and thermodynamics.- Quantum information geometry.- Geometry and biological structures.- Geometry and applications.

Read more less

Book SynopsisThis book constitutes the proceedings of the 6th International Conference on Geometric Science of Information, GSI 2023, held in St. Malo, France, during August 30-September 1, 2023. The 125 full papers presented in this volume were carefully reviewed and selected from 161 submissions. They cover all the main topics and highlights in the domain of geometric science of information, including information geometry manifolds of structured data/information and their advanced applications. The papers are organized in the following topics: geometry and machine learning; divergences and computational information geometry; statistics, topology and shape spaces; geometry and mechanics; geometry, learning dynamics and thermodynamics; quantum information geometry; geometry and biological structures; geometry and applications.Table of ContentsGeometry and machine learning.- Divergences and computational information geometry.- Statistics, topology and shape spaces.- Geometry and mechanics.- Geometry, learning dynamics and thermodynamics.- Quantum information geometry.- Geometry and biological structures.- Geometry and applications.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 17th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2023), consisting of the 17th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 4th International Joint Conference on Theoretical Computer Science (IJTCS), held in Macau, China, during August 14–18, 2023.FAW started as the Frontiers of Algorithmic Workshop in 2007 at Lanzhou, China, and was held annually from 2007 to 2021 and published archival proceedings. IJTCS, the International joint theoretical Computer Science Conference, started in 2020, aimed to bring in presentations covering active topics in selected tracks in theoretical computer science. To accommodate the diversified new research directions in theoretical computer science, FAW and IJTCS joined their forces together to organize an event for information exchange of new findings and work of enduring value in the field. The 21 full papers included in this book were carefully reviewed and selected from 34 submissions. They were organized in topical sections as follows: algorithmic game theory; algorithms and data structures; combinatorial optimization; and computational economics.Table of ContentsUnderstanding the Relationship Between Core Constraints and Core-Selecting Payment Rules in Combinatorial Auctions.- An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization.- Generalized Sorting with Predictions Revisited.- Eliciting Truthful Reports with Partial Signals in Repeated Games.- On the NP-hardness of two scheduling problems under linear constraints.- On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree.- Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant.- Approximate Core Allocations for Edge Cover Games.- Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints.- Additive Approximation Algorithms for Sliding Puzzle.- Differential Game Analysis for Cooperation Models in Automotive Supply Chain under Low-Carbon Emission Reduction Policies.- Adaptivity Gap for Influence Maximization with Linear Threshold Model on Trees.- Physically Verifying the First Nonzero Term in a Sequence: Physical ZKPs for ABC End View and Goishi Hiroi.- Mechanism Design in Fair Sequencing.- Red-Blue Rectangular Annulus Cover Problem.- Applying Johnson's Rule in Scheduling Multiple Parallel Two-Stage Flowshops.- The Fair k-Center with Outliers Problem: FPT and Polynomial Approximations.- Constrained Graph Searching on Trees.- EFX Allocations Exist for Binary Valuations.- Maximize Egalitarian Welfare for Cake Cutting.- Stackelberg Strategies on Epidemic Containment Games.

Read more less

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

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 11th International Conference on Code-Based Cryptography, CBCrypto 2023, held in Lyon, France, during April 22–23, 2023. The 8 full papers included in this book were carefully reviewed and selected from 28 submissions. The conference offers a wide range of many important aspects of code-based cryptography such as cryptanalysis of existing schemes, the proposal of new cryptographic systems and protocols as well as improved decoding algorithms.

Read more less

Book SynopsisThese two volumes constitute the proceedings of the 10th International Symposium on Integrated Uncertainty in Knowledge Modelling and Decision Making, IUKM 2023, held in Kanazawa, Japan, during November 2-4, 2023. The 58 full papers presented were carefully reviewed and selected from 107 submissions. The papers deal with all aspects of research results, ideas, and experiences of application among researchers and practitioners involved with all aspects of uncertainty modelling and management.Table of ContentsUncertainty Management and Decision Making.- Optimization and Statistical Methods.- Economic Application

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 4th Southern African Conference on Artificial Intelligence Research, SACAIR 2023, held in Muildersdrift, South Africa, in December 2023. The 22 full papers presented in these proceedings were carefully reviewed and selected from 66 submissions. The papers are organized in the following topical sections: Responsible and Ethical AI Track; Socio-Technical and Human-Centered AI Track; Algorithmic, and Data Driven and Symbolic AI.Table of ContentsResponsible and Ethical AI track.- Emerging AI Discourses and Policies in the EU: Implications for Evolving AI Governance.- Intergenerational Justice as Driver for Responsible AI.- AI Literacy: A Primary Good.- Exploring the ethical and societal concerns of Generative AI in Internet of Things (IoT) environments.- Warfare in the Age of AI: A Critical Evaluation of ArkinÕs Case for Ethical Autonomy in Unmanned Systems.- Socio-technical and human-centered AI track.- The decision criteria used by large organisations in South Africa for adopting Artificial Intelligence.- Let’s play games: Using no-code AI to reduce human cognitive load during AI solution development.- Algorithmic, Data Driven and Symbolic AI.- Unit-Based Genetic Algorithmic Approach for Optimal Multipurpose Batch Plant Scheduling.- Investigating the extent and usability of webtext available in South Africa’s official languages.- Voice Conversion for Stuttered Speech, Instruments, Unseen Languages and Textually Described Voices.- Extending Defeasible Reasoning Beyond Rational Closure.- Sequence Based Deep Neural Networks for Channel Estimation in Vehicular Communication Systems.- Comparative Study of Image Resolution Techniques in the Detection of Cancer Using Neural Networks.- Investigating Frequent Pattern-based Models for Improving Community Policing in South Africa.- Financial Inclusion in Sub-Saharan Emerging Markets: The Application of Deep Learning to Improve Determinants.- Viability of Convolutional Variational Autoencoders for Lifelong Class Incremental Similarity Learning.- PuoBERTa: Training and evaluation of a curated language model for Setswana.- Hierarchical Text Classification using Language Models with Global Label-wise Attention Mechanisms.- Multimodal Misinformation Detection in a South African Social Media Environment.- Improving Semi-Supervised Learning in Generative Adversarial Networks.- Impacts of Architectural Enhancements on Sequential Recommendation Models.- A comparative study of over-sampling techniques as applied to seismic events.

Read more less

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.

Read more less

Book SynopsisPython Essentials.- Number Theory.- Rational Arithmetic.- Matrix Algebra.- Polynomial Algebra.- Polynomial Applications.- Multivariate Rational Algebra.- Differentiation.- Integration.

Read more less

Book SynopsisOptimized Scheduling of Medical Appointment Sequences using Constraint Programming.- An integrated optimisation method for aluminium hot rolling.- Determining the Most Promising Selective Backbone Size for Partial Knowledge Compilation.- Leveraging Quantum Computing for Accelerated Classical Algorithms in Power Systems Optimization.- Hybridizing Machine Learning and Optimization for Planning Satellite Observations.- Algorithm Configuration in Sequential Decision-Making.- Self-Supervised Penalty-Based Learning for Robust Constrained Optimization.- Revisiting Pseudo-Boolean Encodings from an Integer Perspective.- Multi-task Representation Learning for Mixed Integer Linear Programming.- Breaking the Symmetries of Indistinguishable Objects.- Tackling Symmetry Breaking as a Symbolic Set Cover.- Modeling and Solving the Generalized Test Laboratory Scheduling Problem.- Parallelising Lazy Clause Generation with Trail Sharing.- Learning Primal Heuristics for 0–1 Knapsack Interdiction Problems.- Bounded-Error Policy Optimization for Mixed Discrete-Continuous MDPs via Constraint Generation in Nonlinear Programming.- Minimising Source-Plate Swaps for Robotised Compound Dispensing in Microplates.

Read more less

Book Synopsis

Read more less

Book Synopsis Scientific Computing for Scientists and Engineers is designed to teach undergraduate students relevant numerical methods and required fundamentals in scientific computing. Most problems in science and engineering require the solution of mathematical problems, most of which can only be done on a computer. Accurately approximating those problems requires solving differential equations and linear systems with millions of unknowns, and smart algorithms can be used on computers to reduce calculation times from years to minutes or even seconds. This book explains: How can we approximate these important mathematical processes? How accurate are our approximations? How efficient are our approximations? Scientific Computing for Scientists and Engineers covers: An introduction to a wide range of numerical methods for linear systems, eigenvalue problems, differential equations, numerical integration, and nonlinear problems; Scientific computing fundamentals like floating point representation of numbers and convergence; Analysis of accuracy and efficiency; Simple programming examples in MATLAB to illustrate the algorithms and to solve real life problems; Exercises to reinforce all topics.

Read more less

Book SynopsisThis book analyzes the generation of the arrow-categories of a given category, which is a foundational and distinguishable Category Theory phenomena, in analogy to the foundational role of sets in the traditional set-based Mathematics, for defi nition of natural numbers as well. This inductive transformation of a category into the infinite hierarchy of the arrowcategories is extended to the functors and natural transformations. The author considers invariant categorial properties (the symmetries) under such inductive transformations. The book focuses in particular on Global symmetry (invariance of adjunctions) and Internal symmetries between arrows and objects in a category (in analogy to Field Theories like Quantum Mechanics and General Relativity). The second part of the book is dedicated to more advanced applications of Internal symmetry to Computer Science: for Intuitionistic Logic, Untyped Lambda Calculus with Fixpoint Operators, Labeled Transition Systems in Process Algebras and Modal logics as well as Data Integration Theory.

Read more less

Book SynopsisThis book provides an introduction to hypergraphs, its aim being to overcome the lack of recent manuscripts on this theory. In the literature hypergraphs have many other names such as set systems and families of sets. This work presents the theory of hypergraphs in its most original aspects, while also introducing and assessing the latest concepts on hypergraphs. The variety of topics, their originality and novelty are intended to help readers better understand the hypergraphs in all their diversity in order to perceive their value and power as mathematical tools. This book will be a great asset to upper-level undergraduate and graduate students in computer science and mathematics. It has been the subject of an annual Master's course for many years, making it also ideally suited to Master's students in computer science, mathematics, bioinformatics, engineering, chemistry, and many other fields. It will also benefit scientists, engineers and anyone else who wants to understand hypergraphs theory.Trade ReviewFrom the reviews:“This book addresses the mathematics and theory of hypergraphs. The target audience includes graduate students and researchers with an interest in math and computer science (CS). … I expect readers of this book will be motivated to advance this field, which in turn can advance other sciences.” (Hsun-Hsien Chang, Computing Reviews, January, 2014)“The aim of this book is to introduce the basic concepts of hypergraphs, to present the knowledge of the theory and applications of hypergraphs in other fields. … This book is useful for anyone who wants to understand the basics of hypergraph theory. It is mainly for math and computer science majors, but it may also be useful for other fields which use the theory. … appropriate for both researchers and graduate students. It is very well-written and proofs are stated in a clear manner.” (Somayeh Moradi, zbMATH, Vol. 1269, 2013)Table of ContentsHypergraphs: basic concepts.- Hypergraphs: first properties.- Hypergraph coloring.- Some particular hypergraphs.- Reduction-contraction of Hypergraph.- Dirhypergraphs: basic concepts.- Applications of hypergraph theory : a brief overview.

Read more less

Book SynopsisAdapted from a modular undergraduate course on computational mathematics, Concise Computer Mathematics delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of essential mathematical concepts. The material is divided into four units: discrete mathematics (sets, relations, functions), logic (Boolean types, truth tables, proofs), linear algebra (vectors, matrices and graphics), and special topics (graph theory, number theory, basic elements of calculus). The chapters contain a brief theoretical presentation of the topic, followed by a selection of problems (which are direct applications of the theory) and additional supplementary problems (which may require a bit more work). Each chapter ends with answers or worked solutions for all of the problems.Trade ReviewFrom the reviews:“The book is ideally suited as an adjunct to a course in computer mathematics or as a refresher for someone with some background in computer mathematics. … The book fulfills its purpose of providing a distilled treatment of the mathematics most commonly used in computer science. It is of most value to computer science students who need a place to find a succinct treatment of the topics covered.” (Marlin Thomas, Computing Reviews, April, 2014)“Each of the chapters opens with a short summary followed by a set of essential problems and then a set of supplementary problems. … it would be very useful for someone that needs a quick and effective review that includes problems.” (Charles Ashbacher, MAA Reviews, January, 2014)Table of ContentsSets and NumbersRelations and DatabasesFunctionsBoolean Algebra, Logic and QuantifiersNormal Forms, Proof and ArgumentVectors and Complex NumbersMatrices and ApplicationsMatrix Transformations for Computer GraphicsElements of Graph TheoryElements of Number Theory and CryptographyElements of CalculusElementary Numerical Methods

Read more less

Book SynopsisThis book provides an introduction to hypergraphs, its aim being to overcome the lack of recent manuscripts on this theory. In the literature hypergraphs have many other names such as set systems and families of sets. This work presents the theory of hypergraphs in its most original aspects, while also introducing and assessing the latest concepts on hypergraphs. The variety of topics, their originality and novelty are intended to help readers better understand the hypergraphs in all their diversity in order to perceive their value and power as mathematical tools. This book will be a great asset to upper-level undergraduate and graduate students in computer science and mathematics. It has been the subject of an annual Master's course for many years, making it also ideally suited to Master's students in computer science, mathematics, bioinformatics, engineering, chemistry, and many other fields. It will also benefit scientists, engineers and anyone else who wants to understand hypergraphs theory.Trade ReviewFrom the reviews:“This book addresses the mathematics and theory of hypergraphs. The target audience includes graduate students and researchers with an interest in math and computer science (CS). … I expect readers of this book will be motivated to advance this field, which in turn can advance other sciences.” (Hsun-Hsien Chang, Computing Reviews, January, 2014)“The aim of this book is to introduce the basic concepts of hypergraphs, to present the knowledge of the theory and applications of hypergraphs in other fields. … This book is useful for anyone who wants to understand the basics of hypergraph theory. It is mainly for math and computer science majors, but it may also be useful for other fields which use the theory. … appropriate for both researchers and graduate students. It is very well-written and proofs are stated in a clear manner.” (Somayeh Moradi, zbMATH, Vol. 1269, 2013)Table of ContentsHypergraphs: basic concepts.- Hypergraphs: first properties.- Hypergraph coloring.- Some particular hypergraphs.- Reduction-contraction of Hypergraph.- Dirhypergraphs: basic concepts.- Applications of hypergraph theory : a brief overview.

Read more less

Book SynopsisTransactions are a concept related to the logical database as seen from the perspective of database application programmers: a transaction is a sequence of database actions that is to be executed as an atomic unit of work. The processing of transactions on databases is a well- established area with many of its foundations having already been laid in the late 1970s and early 1980s.The unique feature of this textbook is that it bridges the gap between the theory of transactions on the logical database and the implementation of the related actions on the underlying physical database. The authors relate the logical database, which is composed of a dynamically changing set of data items with unique keys, and the underlying physical database with a set of fixed-size data and index pages on disk. Their treatment of transaction processing builds on the “do-redo-undo” recovery paradigm, and all methods and algorithms presented are carefully designed to be compatible with this paradigm as well as with write-ahead logging, steal-and-no-force buffering, and fine-grained concurrency control.Chapters 1 to 6 address the basics needed to fully appreciate transaction processing on a centralized database system within the context of our transaction model, covering topics like ACID properties, database integrity, buffering, rollbacks, isolation, and the interplay of logical locks and physical latches. Chapters 7 and 8 present advanced features including deadlock-free algorithms for reading, inserting and deleting tuples, while the remaining chapters cover additional advanced topics extending on the preceding foundational chapters, including multi-granular locking, bulk actions, versioning, distributed updates, and write-intensive transactions.This book is primarily intended as a text for advanced undergraduate or graduate courses on database management in general or transaction processing in particular.Table of Contents1 Transactions on the Logical Database.- 2 Operations on the Physical Database.- 3 Logging and Buffering.- 4 Transaction Rollback and Restart Recovery.- 5 Transactional Isolation.- 6 Lock-Based Concurrency Control.- 7 B-Tree Traversals.- 8 B-Tree Structure Modifications.- 9 Advanced Locking Protocols.- 10 Bulk Operations on B-Trees.- 11 Online Index Construction and Maintenance.- 12 Concurrency Control by Versioning.- 13 Distributed Transactions.- 14 Transactions in Page-Server Systems.- 15 Processing of Write-Intensive Transactions.

Read more less

Book SynopsisIn this introductory textbook the author explains the key topics in cryptography. He takes a modern approach, where defining what is meant by "secure" is as important as creating something that achieves that goal, and security definitions are central to the discussion throughout.The author balances a largely non-rigorous style — many proofs are sketched only — with appropriate formality and depth. For example, he uses the terminology of groups and finite fields so that the reader can understand both the latest academic research and "real-world" documents such as application programming interface descriptions and cryptographic standards. The text employs colour to distinguish between public and private information, and all chapters include summaries and suggestions for further reading.This is a suitable textbook for advanced undergraduate and graduate students in computer science, mathematics and engineering, and for self-study by professionals in information security. While the appendix summarizes most of the basic algebra and notation required, it is assumed that the reader has a basic knowledge of discrete mathematics, probability, and elementary calculus.Trade Review“The goal of cryptography is to obfuscate data for unintended recipients. … The book is divided into four parts. … The book is very comprehensive, and very accessible for dedicated students.” (Klaus Galensa, Computing Reviews, computingreviews.com, October, 2016)“Cryptography made simple is a textbook that provides a broad coverage of topics that form an essential working knowledge for the contemporary cryptographer. It is particularly suited to introducing graduate and advanced undergraduate students in computer science to the concepts necessary for understanding academic cryptography and its impact on real-world practice, though it will also be useful for mathematicians or engineers wishing to gain a similar perspective on this material.” (Maura Beth Paterson, Mathematical Reviews, July, 2016)“This is a very thorough introduction to cryptography, aimed at lower-division undergraduates. It is an engineering textbook that uses modern mathematical terminology (such as groups and finite fields). … Bottom line: really for engineers, and a useful book if used carefully; the organization makes is easy to get overwhelmed by the background material before you get to the 'good stuff', and even the good stuff has an overwhelming amount of detail.” (Allen Stenger, MAA Reviews, maa.org, June, 2016)“This very thorough book by Smart (Univ. of Bristol, UK) is aimed at graduate students and advanced undergraduates in mathematics and computer science and intended to serve as a bridge to research papers in the field. … Summing Up: Recommended. Upper-division undergraduates through professionals/practitioners.” (C. Bauer, Choice, Vol. 53 (10), June, 2016)Table of ContentsModular Arithmetic, Groups, Finite Fields and Probability.- Elliptic Curves.- Historical Ciphers.- The Enigma Machine.- Information Theoretic Security.- Historical Stream Ciphers.- Modern Stream Ciphers.- Block Ciphers.- Symmetric Key Distribution.- Hash Functions and Message Authentication Codes.- Basic Public Key Encryption Algorithms.- Primality Testing and Factoring.- Discrete Logarithms.- Key Exchange and Signature Schemes.- Implementation Issues.- Obtaining Authentic Public Keys.- Attacks on Public Key Schemes.- Definitions of Security.- Complexity Theoretic Approaches.- Provable Security: With Random Oracles.- Hybrid Encryption.- Provable Security: Without Random Oracles.- Secret Sharing Schemes.- Commitments and Oblivious Transfer.- Zero-Knowledge Proofs.- Secure Multiparty Computation.

Read more less

Book SynopsisNow in its second edition, this textbook serves as an introduction to probability and statistics for non-mathematics majors who do not need the exhaustive detail and mathematical depth provided in more comprehensive treatments of the subject. The presentation covers the mathematical laws of random phenomena, including discrete and continuous random variables, expectation and variance, and common probability distributions such as the binomial, Poisson, and normal distributions. More classical examples such as Montmort's problem, the ballot problem, and Bertrand’s paradox are now included, along with applications such as the Maxwell-Boltzmann and Bose-Einstein distributions in physics.Key features in new edition:* 35 new exercises* Expanded section on the algebra of sets * Expanded chapters on probabilities to include more classical examples* New section on regression* Online instructors' manual containing solutions to all exercises<Advanced undergraduate and graduate students in computer science, engineering, and other natural and social sciences with only a basic background in calculus will benefit from this introductory text balancing theory with applications.Review of the first edition: This textbook is a classical and well-written introduction to probability theory and statistics. … the book is written ‘for an audience such as computer science students, whose mathematical background is not very strong and who do not need the detail and mathematical depth of similar books written for mathematics or statistics majors.’ … Each new concept is clearly explained and is followed by many detailed examples. … numerous examples of calculations are given and proofs are well-detailed." (Sophie Lemaire, Mathematical Reviews, Issue 2008 m)Trade Review“Schay (emer., Univ. of Massachusetts) has created a text for a two semester, calculus-based course in mathematical statistics. … The prose reads well. Physical production is good. … Summing Up: Recommended. Upper-division undergraduates and graduate students.” (W. R. Lee, Choice, Vol. 54 (6), February, 2017)“I believe that students concentrating in mathematics and related subjects will find this book readable and interesting. … I think that students learning the probability for the first time will get real value out of working through the examples and exercises of the text. … Introduction to Probability with Statistical Applications is very clearly written and reading the book is enjoyable. I would certainly recommend Schay’s book as a primary textbook for an undergraduate course in calculus-based probability.” (Jason M. Graham, MAA Reviews, September, 2016)Table of ContentsIntroduction.- The Algebra of Events.- Combinatorial Problems.- Probabilities.- Random Variables.- Expectation, Variance, Moments.- Some Special Distributions.- The Elements of Mathematical Statistics.

Read more less

Book Synopsis This book presents two new decomposition methods to decompose a time series in intrinsic components of low and high frequencies. The methods are based on Singular Value Decomposition (SVD) of a Hankel matrix (HSVD). The proposed decomposition is used to improve the accuracy of linear and nonlinear auto-regressive models. Linear Auto-regressive models (AR, ARMA and ARIMA) and Auto-regressive Neural Networks (ANNs) have been found insufficient because of the highly complicated nature of some time series. Hybrid models are a recent solution to deal with non-stationary processes which combine pre-processing techniques with conventional forecasters, some pre-processing techniques broadly implemented are Singular Spectrum Analysis (SSA) and Stationary Wavelet Transform (SWT). Although the flexibility of SSA and SWT allows their usage in a wide range of forecast problems, there is a lack of standard methods to select their parameters. The proposed decomposition HSVD and Multilevel SVD are described in detail through time series coming from the transport and fishery sectors. Further, for comparison purposes, it is evaluated the forecast accuracy reached by SSA and SWT, both jointly with AR-based models and ANNs. Table of ContentsPreface 1. Time Series and Forecasting 1.1. Introduction 1.2. Time series 1.3. Linear Autoregressive Models 1.4. Artificial Neural Networks 1.5. Hybrid models 1.5.1. Singular Spectrum Analysis 1.5.2. Wavelet Transform 1.6. Forecasting Accuracy Measures 1.7. Empirical Applications 1.7.1. Traffic Accidents Forecasting based on AR, ANNs and Hybrid models. 1.7.2. Anchovy Stock Forecasting based on AR, ANNs and Hybrid models. 1.7.3. Sardine Stock Forecasting based on AR, ANNs and Hybrid models. 2. Decomposition methods based on Singular Value Decomposition of a Hankel matrix 2.1. Introduction 2.2. Eigenvalues and Eigenvectors 2.3. Theorem of Singular Values Decomposition 2.4. One-level Singular Value Decomposition of a Hankel matrix 2.4.1. Embedding 2.4.2. Decomposition 2.4.3. Unembedding 2.4.4. Window Length Selection 2.5. Multi-level Singular Value Decomposition of a Hankel matrix 2.5.1. Embedding 2.5.2. Decomposition 2.5.3. Unembedding 2.5.4. Singular Spectrum Rate 2.6. Empirical Applications 2.6.1. Extraction of Components from traffic accidents time series based on HSVD and MSVD 2.6.2. Extraction of Components from fishery time series based on HSVD and MSVD 3. Forecasting based on components 3.1. Introduction 3.2. One-step ahead forecasting 3.3. Multi-step ahead forecasting 3.3.1. Direct Strategy 3.3.2. MIMO Strategy 3.4. Empirical Applications 3.4.1. Forecasting of traffic accidents based on HSVD and MSVD 3.4.2. Forecasting of anchovy stock based on HSVD and MSVD 3.4.3. Forecasting of sardine stock based on HSVD and MSVD List of Figures List of Tables List of Acronyms List of Symbols References

Read more less

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.

Read more less

Book SynopsisAlgebra und Diskrete Mathematik gehören zu den wichtigsten mathematischen Grundlagen der Informatik. In diese mathematischen Teilgebiete führt Band 1 des zweibändigen Lehrbuchs umfassend ein. Dabei ermöglichen klar herausgearbeitete Lösungsalgorithmen, viele Beispiele und ausführliche Beweise einen raschen Zugang zum Thema. Die umfangreiche Sammlung von Übungsaufgaben hilft bei der Erarbeitung des Stoffs und zeigt darüber hinaus, welche unterschiedlichen Anwendungsmöglichkeiten es gibt. Die 3. Auflage wurde korrigiert und erweitert.Table of ContentsTeil I Grundbegriffe der Mathematik und Algebraische Strukturen.- Teil II Lineare Algebra und analytische Geometrie.- Teil III Numerische Algebra und Kombinatorik.- Teil IV Übungsaufgaben.

Read more less

Book SynopsisModern statistics deals with large and complex data sets, and consequently with models containing a large number of parameters. This book presents a detailed account of recently developed approaches, including the Lasso and versions of it for various models, boosting methods, undirected graphical modeling, and procedures controlling false positive selections.A special characteristic of the book is that it contains comprehensive mathematical theory on high-dimensional statistics combined with methodology, algorithms and illustrations with real data examples. This in-depth approach highlights the methods’ great potential and practical applicability in a variety of settings. As such, it is a valuable resource for researchers, graduate students and experts in statistics, applied mathematics and computer science.Trade ReviewFrom the reviews:“This book is a complete study of ℓ1-penalization based statistical methods for high-dimensional data … . Definitely, this book is useful. … its strong level in mathematics makes it more suitable to researchers and graduate students who already have a strong background in statistics. … it gives the state-of-the-art of the theory, and therefore can be used for an advanced course on the topic. … the last part of the book is an exciting introduction to new research perspectives provided by ℓ1-penalized methods.” (Pierre Alquier, Mathematical Reviews, Issue 2012 e)“All Classical Statisticians interested in the very popular but a bit old methodologies like the Lasso (Tibshirani, 1996), its modifications like adaptive Lasso (Zou, 2006), and their theory, computational algorithms, applications to bioinformatics and other high dimensional applications. All such researchers would find this book worth buying. It is written by two outstanding theoreticians with flair for clear writing and excellent applications. … theory depends a lot on new concentration inequalities coming from the French probabilists. The book has good collection of these, with proofs.” (Jayanta K. Ghosh, International Statistical Review, Vol. 80 (3), 2012)Table of ContentsIntroduction.- Lasso for linear models.- Generalized linear models and the Lasso.- The group Lasso.- Additive models and many smooth univariate functions.- Theory for the Lasso.- Variable selection with the Lasso.- Theory for l1/l2-penalty procedures.- Non-convex loss functions and l1-regularization.- Stable solutions.- P-values for linear models and beyond.- Boosting and greedy algorithms.- Graphical modeling.- Probability and moment inequalities.- Author Index.- Index.- References.- Problems at the end of each chapter.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 13th Algorithms and Data Structures Symposium, WADS 2013, held in London, ON, Canada, August 2013. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 44 revised full papers presented in this volume were carefully reviewed and selected from 139 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.Table of ContentsAlgorithms and data structures in bioinformatics.- Algorithms and data structures in combinatorics.- Algorithms and data structures in computational geometry.- Algorithms and data structures in databases.- Algorithms and data structures in graphics.- Parallel and distributed computing.

Read more less

Book SynopsisDieses Buch enthält den Mathematikstoff, der für das Informatikstudium in anwendungsorientierten Bachelorstudiengängen benötigt wird. Der Inhalt entspringt der langjährigen Lehrerfahrung des Autors.Das heißt: Sie finden immer wieder Anwendungen aus der Informatik. Sie lernen nicht nur mathematische Methoden, es werden auch die Denkweisen der Mathematik vermittelt, die eine Grundlage zum Verständnis der Informatik bilden. Beweise werden dann geführt, wenn Sie daraus etwas lernen können, nicht um des Beweisens willen. Mathematik ist für viele Studierende zunächst ein notwendiges Übel. Das Buch zeigt durch ausführliche Motivation, durch viele Beispiele, durch das ständige Aufzeigen von Querbezügen zwischen Mathematik und Informatik, dass Mathematik nicht nur nützlich ist, sondern interessant sein kann und manchmal auch Spaß macht.Table of ContentsDISKRETE MATHEMATIK UND LINEARE ALGEBRA.- Mengen und Abbildungen.- Logik.- Natürliche Zahlen, vollständige Induktion, Rekursion.- Etwas Zahlentheorie.- Algebraische Strukturen.- Vektorräume.- Matrizen.- Gauß'scher Algorithmus und lineare Gleichungssysteme.- Eigenwerte, Eigenvektoren und Basistransformationen.- Skalarprodukt und orthogonale Abbildungen.- Graphentheorie.- ANALYSIS.- Die reellen Zahlen.- Folgen und Reihen.- Stetige Funktionen.- Differenzialrechnung.- Integralrechnung.- Differenzialgleichungen.- Numerische Verfahren.- WAHRSCHEINLICHKEITSRECHNUNG UND STATISTIK.- Wahrscheinlichkeitsräume.- Zufallsvariable.- Wichtige Verteilungen und stochastische Prozesse.- Statistische Verfahren.- Anhang.

Read more less