Algorithms and data structures Books
Springer International Publishing AG Conceptual Modeling: 42nd International
Book SynopsisThis book constitutes the refereed proceedings of the 42nd International Conference on Conceptual Modeling, ER 2023, held in Lisbon, Portugal, during November 6-9, 2023. The 21 full papers were carefully reviewed and selected from 121 submissions. Additionally, the book contains 4 keynote speeches and 3 tutorials, and one invited paper corresponding to one of the keynote speeches. The papers cover a broad spectrum of classical and modern topics on conceptual modeling, including research and practice in the theories of concepts and ontologies, techniques for transforming conceptual models into effective implementations, and methods and tools for developing and communicating conceptual models.Table of ContentsInvited Paper.- Stochastic LLMs do not Understand Language: Towards Symbolic, Explainable and Ontologically Based LLMs.- The Conceptual Modeling Task.- A Survey of Ethical Reasoning Methods, their Metamodels, and a Theory on their Application to Conceptual Modelling.- Use of Competency Questions in Ontology Engineering: a Survey.- How Inclusive is Conceptual Modeling? A Systematic Review of Literature and Tools for Disability-aware Conceptual Modeling.- The Meta Level.- A Terminological and Semiotic Review of the Digital Object Concept.- The Ontology for Conceptual Characterization of Ontologies.- ProMoTe: A Data Product Model Template for Industry.- Model-Based Analysis and Implementation.- Using a Conceptual Model in Plug-and-play SQL.- Sanity-Checking Multiple Levels of Classification – A Formal Approach with a ConceptBase Implementation.- A Safari for Deviating GoF Pattern Definitions and Examples on the Web.- Process Mining and Abstraction.- Object-Centric Alignments.- Transforming Event Knowledge Graph to Object-Centric Event Logs: A Comparative Study for Multi-dimensional Process Analysis.- Ontology-Based Abstraction of Bot Models in Robotic Process Automation.- Modeling Events and Processes.- Shards of Knowledge – Modeling Attributions for Event-Centric Knowledge Graphs.- A Characterisation of Ambiguity in BPM.- Dealing with the evolution of event-based choreographies of BPMN fragments: definition and proof of concept.- Conceptual Modeling in Context.- Safety Analysis of Human Robot Collaborations with GRL Goal Models.- A Domain-Specific Visual Modeling Language for Augmented Reality Applications Using WebXR.- An Ontology for Context Modeling in Smart Spaces.- Applications of Conceptual Modeling.- A Reference Meta-Model to Understand DNA Variant Interpretation Guidelines.- A Conceptual Modeling Approach for Risk Assessment and Mitigation in Collision-free UAV Routing for Beyond-the-Visual-Line-of-Sight Flights.- QuantumShare: Towards An Ontology for Bridging the Quantum Divide.
£61.74
Springer International Publishing AG Algorithmic Aspects of Cloud Computing: 8th
Book SynopsisThis book constitutes revised selected papers from the 8th International Symposium on Algorithmic Aspects of Cloud Computing, ALGOCLOUD 2023, held in Amsterdam, The Netherlands, on September 5, 2023. The 13 full papers included in this book were carefully reviewed and selected from 24 submissions. They focus on algorithmic aspects of computing and data management in modern cloud-based systems interpreted broadly so as to include edge- and fog-based systems, cloudlets, cloud micro-services, virtualization environments, decentralized systems, as well as dynamic networks.Table of ContentsPlanning workflow executions over the Edge-to-Cloud Continuum.- On-Field Leaf Infection Detection using the Cloud-Edge Continuum.- Application of Federated Learning techniques for arrhythmia classification using 12- lead ECG signals.- An Adaptive, Energy-Efficient DRL-based and MCMC-based Caching Strategy for IoT Systems.- Real-Time Leakage Zone Detection in Water Distribution Networks: A Machine Learning-based Stream Processing Algorithm.- Multi-agent reinforcement learning-based energy orchestrator for cyber-physical systems.- Clustering-based Numerosity Reduction for Cloud Workload Forecasting.- Algorithmic Aspects of Distributed Hash Tables on Cloud, Fog, and Edge Computing Applications: A Survey.- i-Deliver P&D Engine: A Decentralized Middleware for a Delivery-as-a-Service System.- Intent-based Allocation of Cloud Computing Resources Using Q-Learning.- A Double-decision Reinforcement Learning based Algorithm for Online Scheduling in Edge and Fog Computing.- Decentralized Algorithms for Efficient Energy Management over Cloud-Edge Infrastructures.
£47.49
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 Formal Aspects of Component Software: 19th
Book SynopsisThis book constitutes the refereed proceedings of the 19th International Conference on Formal Aspects of Component Software, FACS 2023, which took place virtually during October 19-20, 2023.The 11 full papers included in this book were carefully reviewed and selected from 23 submissions. They were organized in topical sections as follows: cloud computing, cyber-physical and critical systems, and the Internet of Things.Table of ContentsResearch Papers.- Symbolic Path-guided Test Cases for Models with Data and Time.- Model-Based Testing of Asynchronously Communicating Distributed Controllers.- A Mechanized Semantics for Component-based Systems in the HAMR AADL Runtime.- A Formal Web Services Architecture Model for Changing PUSH/PULL Data Transfer.- Joint use of SysML and Reo to specify and verify the compatibility of CPS components.- From Reversible Computation to Checkpoint-Based Rollback Recovery for Message-Passing Concurrent Programs.- Anniversary Papers.- Formal Model Engineering of Distributed CPSs using AADL: From Behavioral AADL Models to Multirate Hybrid Synchronous AADL.- Challenges Engaging Formal CBSE in Industrial Applications.- Formal Aspects of Component Software - An Overview on Concepts and Relations of Different Theories.- Overview on Constrained Multiparty Synchronisation in Team Automata.- Embedding Formal Verification in Model-Driven Software Engineering with SLCO: An Overview.
£47.49
Springer Formal Concept Analysis
Book SynopsisPreface to the first edition.- Preface to the second edition.- Acknowledgements.- 0. Order-theoretic foundations.- 1. Concept lattices of formal contexts.- 2. Determination and representation.- 3. Parts, factors, and bonds.- 4. Decompositions of concept lattices.- 5. Constructions of concept lattices.- 6. Properties of concept lattices.- 7. Context comparison and conceptual measurability.- 8. Contextual concept logic.- References.- Formal contexts and concept lattices in this book.- Index.
£999.99
Springer Twenty Years of Theoretical and Practical
Book Synopsis.- Invited abstracts..- Special Session: Computing Knowledge: Computational Aspects of Epistemic Logics (HaPoC)..- The theory of enumeration degrees and its fragments..- Further extensions of the point to set principle..- Uniform distribution and algorithmic randomness..- Computable aspects of symbolic dynamics and tilings..- How much pattern complexity can help us solve the domino problem ?..- Sufficient conditions for non-emptiness of a subshift and computability of its entropy..- Reasoning about (Negative) Trust under Uncertainty..- Quantum computating from reversible classical computing..- Complexity of well-ordered sets in an ordered Abelian group..- Invited papers..- If CiE Did not Exist, It Would be Necessary to Invent It..- Some Open Questions and Recent Results on Computable Banach Spaces..- Kolmogorov complexity as a combinatorial tool..- Cellular Automata: Communicati
£999.99
Walter de Gruyter Maschinelles Lernen
Book Synopsis
£59.85
Springer International Publishing AG Secure Data Deletion
Book SynopsisThis book is the first to develop a systematized approach for the comparison and evaluation of secure deletion solutions. The book focuses on novel secure deletion solutions targeting specific real-world environments where secure deletion is problematic: mobile storage and remote storage. The author surveys related work, organizes existing solutions in terms of their interfaces, presents a taxonomy of adversaries differing in their capabilities, and then builds a system and adversarial model based on the survey of related work.The book is useful for both academics, researchers and graduate students, and for practitioners who may integrate its results into deployed systems.Trade Review“In this book, the author discusses all of this, as well as some of the ways to ensure secure deletion … . The material is generally well presented and interesting … . This book could well be used as supplemental material for an undergraduate course in computer security or in operating systems, as the author mentions implementations in Linux for several ideas presented.” (Computing Reviews, May, 2017)Table of ContentsIntroduction.- Related Work on Secure Deletion.- System Model and Security Goal.- Flash Memory: Background and Related Work.- User-Level Secure Deletion on Log-Structured File Systems.- Data Node Encrypted File System.- UBIFSec: Adding DNEFS to UBIFS.- Cloud Storage: Background and Related Work.- Secure Data Deletion from Persistent Media.- B-Tree-Based Secure Deletion.- Robust Key Management for Secure Data Deletion.- Conclusions.
£87.99
Springer International Publishing AG Guide to Data Structures: A Concise Introduction
Book SynopsisThis accessible and engaging textbook/guide provides a concise introduction to data structures and associated algorithms. Emphasis is placed on the fundamentals of data structures, enabling the reader to quickly learn the key concepts, and providing a strong foundation for later studies of more complex topics. The coverage includes discussions on stacks, queues, lists, (using both arrays and links), sorting, and elementary binary trees, heaps, and hashing. This content is also a natural continuation from the material provided in the separate Springer title Guide to Java by the same authors.Topics and features: reviews the preliminary concepts, and introduces stacks and queues using arrays, along with a discussion of array-based lists; examines linked lists, the implementation of stacks and queues using references, binary trees, a range of varied sorting techniques, heaps, and hashing; presents both primitive and generic data types in each chapter, and makes use of contour diagrams to illustrate object-oriented concepts; includes chapter summaries, and asks the reader questions to help them interact with the material; contains numerous examples and illustrations, and one or more complete program in every chapter; provides exercises at the end of each chapter, as well as solutions to selected exercises, and a glossary of important terms.This clearly-written work is an ideal classroom text for a second semester course in programming using the Java programming language, in preparation for a subsequent advanced course in data structures and algorithms. The book is also eminently suitable as a self-study guide in either academe or industry.Trade Review“This text is intended to provide undergraduates using Java with a concise, focused, and relatively simple coverage of some of the basic data structures in use. These include arrays, linked lists, trees, heaps (in arrays), and hash tables. … The book covers the algorithms and data structures well with clear language, abundant diagrams, and good exercises. It could be a good introduction for curricula using Java as a primary teaching language.” (Jeffrey Putnam, Computing Reviews, July, 2018)Table of ContentsPreliminary Concepts Stacks Using Arrays Queues Using Arrays Lists Using Arrays Lists Using Objects and References Ordered Linked Lists Stacks and Queues Using References Binary Trees Sorting Heaps Hashing
£999.99
Wiley-VCH Verlag GmbH Maschinelles Lernen mit Python und R für Dummies
Book SynopsisMaschinelles Lernen ist aufregend: Mit schnellen Prozessoren und großen Speichern können Computer aus Erfahrungen lernen, künstliche Intelligenz kommt wieder in Reichweite. Mit diesem Buch verstehen Sie, was maschinelles Lernen bedeutet, für welche Probleme es sich eignet, welche neuen Herangehensweisen damit möglich sind und wie Sie mit Python, R und speziellen Werkzeugen maschinelles Lernen implementieren. Sie brauchen dafür keine jahrelange Erfahrung als Programmierer und kein Mathematikstudium. Die praktische Anwendung maschinellen Lernens steht in diesem Buch im Vordergrund. Spielen Sie mit den Tools und haben Sie Spaß dabei! Lernen Sie Fakten und Mythen zum maschinellen Lernen zu unterscheiden.Table of ContentsÜber die Autoren 13 Einführung 25 Teil I: Einführung in das maschinelle Lernen 29 Kapitel 1: Künstliche Intelligenz in Fiktion und Realität 31 Kapitel 2: Lernen im Zeitalter von Big Data 43 Kapitel 3: Ein Ausblick auf die Zukunft 53 Teil II: Einrichtung Ihrer Programmierumgebung 63 Kapitel 4: Installation einer R-Distribution 65 Kapitel 5: Programmierung mit R und RStudio 83 Kapitel 6: Installation einer Python-Distribution 107 Kapitel 7: Programmierung mit Python und Anaconda 127 Kapitel 8: Weitere Softwareprogramme für maschinelles Lernen 151 Teil III: Mathematische Grundlagen 159 Kapitel 9: Mathematische Grundlagen des maschinellen Lernens 161 Kapitel 10: Fehlerfunktionen und ihre Minimierung 179 Kapitel 11: Validierung von maschinellem Lernen 191 Kapitel 12: Einfache Lerner 209 Teil IV: Aufbereitung und Verwendung von Daten zum Lernen 225 Kapitel 13: Vorverarbeitung von Daten 227 Kapitel 14: Ausnutzung von Ähnlichkeiten in Daten 245 Kapitel 15: Einfache Anwendung von linearen Modellen 265 Kapitel 16: Komplexere Lernverfahren und neuronale Netze 287 Kapitel 17: Support Vector Machines und Kernel-Funktionen 303 Kapitel 18: Kombination von Lernalgorithmen in Ensembles 321 Teil V: Praktische Anwendung von maschinellem Lernen 337 Kapitel 19: Klassifikation von Bildern 339 Kapitel 20: Bewertung von Meinungen und Stimmungslagen 353 Kapitel 21: Produkt- und Filmempfehlungen 373 Teil VI: Der Top-Ten-Teil 387 Kapitel 22: Zehn wichtige Pakete für maschinelles Lernen 389 Kapitel 23: Zehn Methoden zur Verbesserung Ihrer maschinellen Lernmodelle 395 Stichwortverzeichnis 403
£23.70
Wiley-VCH Verlag GmbH Algorithmen für Dummies
Book SynopsisWir leben in einer algorithmenbestimmten Welt. Deshalb lohnt es sich zu verstehen, wie Algorithmen arbeiten. Das Buch präsentiert die wichtigsten Anwendungsgebiete für Algorithmen: Optimierung, Sortiervorgänge, Graphentheorie, Textanalyse, Hashfunktionen. Zu jedem Algorithmus werden jeweils Hintergrundwissen und praktische Grundlagen vermittelt sowie Beispiele für aktuelle Anwendungen gegeben. Für interessierte Leser gibt es Umsetzungen in Python, sodass die Algorithmen auch verändert und die Auswirkungen der Veränderungen beobachtet werden können. Dieses Buch richtet sich an Menschen, die an Algorithmen interessiert sind, ohne eine Doktorarbeit zu dem Thema schreiben zu wollen. Wer es gelesen hat, versteht, wie wichtige Algorithmen arbeiten und wie man von dieser Arbeit beispielsweise bei der Entwicklung von Unternehmensstrategien profitieren kann.
£21.38
Wiley-VCH Verlag GmbH Algorithmen und Datenstrukturen für Dummies
Book SynopsisDieses Buch führt Sie sachte in die Denkweisen des Fachs "Algorithmen und Datenstrukturen" ein. Es erklärt Informatik-Anfängern Terminologie, Notation und zentrale Inhalte des Fachgebiets auf anschauliche und sehr unterhaltsame Weise. Ein Fokus sind die Techniken und Tricks, die Sie brauchen, um effiziente Algorithmen und Datenstrukturen zu bauen. Sie werden auch in die Lage versetzt, Pseudocode in der typischen akademischen Darstellung zu verstehen und in unterschiedlichen Programmiersprachen zu realisieren oder umgekehrt grundlegende algorithmische Ideen als Pseudocode zu dokumentieren.Table of ContentsEinleitung 17 Über dieses Buch 17 Törichte Annahmen über den Leser 19 Wie dieses Buch aufgebaut ist 19 Symbole, die in diesem Buch verwendet werden 20 Wie es weitergeht 21 Teil I Grundbegriffe 23 Kapitel 1 Algorithmen 25 Das sind Algorithmen 25 Algorithmen lösen Probleme 26 Algorithmen basieren auf einem einfachen Maschinenmodell 30 Algorithmen sind bewertbar 32 Algorithmen agieren in Modellwelten 32 Algorithmen sind keine Programme 33 Algorithmen klar beschreiben 35 Sprechen Sie Pseudocode? 35 Mathematische Ausdrücke sind erlaubt 37 Algorithmen sprechen sogar Deutsch 37 Algorithmen sind Lösungen, keine Probleme 38 Algorithmen haben zählbare Schritte 39 Algorithmen sollten korrekt sein 40 Algorithmen können sich aufhängen 41 Das Halteproblem ist unlösbar 42 Algorithmen richtig verstehen 43 Kapitel 2 Qualität von Algorithmen 47 So gut sind Algorithmen 47 Wer ist der Leichteste? 48 Laufzeiten vergleichen 50 Laufzeitanalysen 53 Lineare Laufzeiten 53 Oh du großes O! 55 Arten der Laufzeitanalyse 57 Laufzeiten konkret bestimmen 59 Faustregel 1: Bei Schleifen muss man multiplizieren 59 Faustregel 2: Der stärkste Summand dominiert 61 Vorsicht vor versteckten Kosten 61 Randomisierte Laufzeitanalyse 62 Das Auswahlproblem 63 QuickSelect: Ein randomisierter Algorithmus 63 Amortisierte Laufzeitanalyse 66 Ein Binärzähler an der Fassade 66 Ein sparsamer Stapel 69 Die Potenzialmethode 71 Kapitel 3 Daten und ihre Struktur 75 Aus Daten Strukturen bauen 75 Datenstrukturen: die Essenz 76 Datenstrukturen im Pseudocode 78 Algebraische Datentypen 92 Funktion folgt Struktur 97 Endrekursive und linear-rekursive Funktionen 98 Linear-rekursive Funktionen und die Akkumulatortechnik 101 Strukturelle Rekursion 103 Teilen und Herrschen 105 Strukturen durchlaufen: Iteratoren und Traversierungen 106 Teil II Algorithmen in Den Gärten Der Strukturen 111 Kapitel 4 Listen: Immer einer nach dem anderen 113 Listen: Datenmodell und Implementierung 116 Datenabstraktion: Was Listen so können sollen 118 Alles ist ewig und Rekursion ist gut 129 Listen in Funktionalistan 131 Persistente Datenstrukturen 143 Ordnung herstellen: imperativ und funktional 145 Nicht alles ist ewig und Form ist nicht Inhalt 152 Warteschlange als funktionale Datenabstraktion 152 Warteschlangen mit Amortisation 155 Rückblick: Imperative und funktionale Algorithmen 157 Kapitel 5 Bäume: Immer einer über dem anderen 161 Wo ist die Kokosnuss? 162 Baumtraversierungen 163 Mit Stapeln in die Tiefe tauchen 168 Mit Warteschlangen in die Breite gehen 173 Die Kleinen nach links, die Großen nach rechts 176 Binäre Suchbäume 177 Verzeichnisse als Suchbäume 179 Bäume verkleiden sich gerne mal 181 Tries 182 Prioritätswarteschlangen 184 Bäume als Datenmodell 189 Ausdrucksbäume 190 Mit Stapeln übersetzen und auswerten 191 Kapitel 6 Graphen: Jeder mit jedem 195 Im Irrgarten der sozialen Netzwerke 196 Ein kurzer Blick in die Welt der Graphen 198 Einflussnahme als Graphenproblem 202 Graphen traversieren 203 Datenstrukturen für Graphen 206 Nachbarschaften dokumentieren 207 Daten und Probleme machen Graphen 210 Was nicht passt, wird passend gemacht 212 Erst die Schuhe, dann das Hemd – oder wie? 214 Topologische Sortierung, ein guter Start in den Tag 214 Liste folgt Funktional 216 Array folgt Imperativ 217 Teil III Probleme Und Ihre Lösungen 221 Kapitel 7 Sortieren 223 Alles in Ordnung 223 Das Sortierproblem 224 SelectionSort: So lange wählen, bis es passt 227 Laufzeit von SelectionSort 228 MergeSort: Geteiltes Leid ist halb sortiert 229 Sortierte Teilarrays verschmelzen mit Merge 230 Teilen und Herrschen 232 Laufzeit von MergeSort 232 QuickSort: Quick and Easy 234 Partition teilt das Array auf 234 Sortieren mit QuickSort 235 Worst-Case-Laufzeit von QuickSort 236 Randomisierung 237 HeapSort: Ein Haufen Arbeit 237 Die Datenstruktur Heap 238 Der Heap als Priority Queue 239 Besser sortieren mit dem Heap 240 Die maximale Sortiergeschwindigkeit 241 Sortieren in Linearzeit 244 CountingSort: Sortieren durch Zählen 244 Sortieren nach Ziffern 245 Stabile Sortierverfahren 247 RadixSort: Mehrfach ziffernweise sortieren 248 Weitere Sortieralgorithmen 249 BubbleSort: Nachbarn vertauschen 249 Gnomesort: Immer hin und her 250 InsertionSort: Spielkarten dazwischen schieben 251 Kapitel 8 Rucksack packen 253 Wie man einen Koffer packt 253 Das Rucksackproblem 253 Das Wichtigste zuerst einpacken 255 Alles ausprobieren 257 Suchen im Entscheidungsbaum 258 Den Suchraum begrenzen 261 Probleme langsam wachsen lassen 264 Wachsende Probleme klug speichern 267 Sich dem Optimum annähern 270 Lineare Optimierung 274 Optimierung von Produktionsmengen 274 Ein System von Ungleichungen 275 Ziel: Gewinnmaximierung 275 Ganzzahlige lineare Optimierung 276 Das Rucksackproblem als ILP 277 Kapitel 9 Mengen und ihre Speicherung 279 Ich bin eine Menge 281 Imperative Datenabstraktion für Mengen 283 Funktionale Datenabstraktion für Mengen 285 Gut gehackt ist schnell gefunden 290 Hashfunktionen 292 Hashtabellen 293 Garantiert gut gehackt 298 Derselbe ist nicht immer der Gleiche 300 Viel ist oft eine Menge 304 Wer Ordnung hält, ist nur zu faul zum Suchen 306 Bäume balancieren 308 Rot-Schwarz-Bäume 311 Kapitel 10 Verbindungen finden 321 Kürzeste Pfade 322 Alle kürzesten Pfade von einem Start aus 322 Vom Vertrauten ins Unbekannte 325 Kürzester Pfad zu allen Knoten 328 Dijkstras Algorithmus 330 Datenstrukturen für Dijkstras Algorithmus 333 Verbundenes aufspüren 334 Verbundene Komponenten identifizieren 335 Datenstrukturen bei der Berechnung verbundener Komponenten 338 Disjunkte Mengen als Datenstruktur 340 Laufzeiten 344 Spann mir einen Graphen auf 345 Minimaler Spannbaum 346 Kruskals Algorithmus 347 Teil IV Algorithmische Techniken 351 Kapitel 11 Probleme totschlagen 353 Erschöpfende Suche 354 Die üblichen Verdächtigen: Kombinatorische Objekte 355 Konzentrierte oder weit ausschweifende Suche 358 Die erschöpfende Suche nach acht friedlichen Damen 362 Iterative und rekursive Erzeugung des Suchraums 364 Schleifen rekursiv erzeugen 364 Einen baumartigen Suchraum rekursiv erzeugen 366 Backtracking 369 Kandidaten nicht stückweise bewertbar: kein Backtracking 371 Backtracking als Suche im Zustandsraum 373 Verzweigen und Begrenzen 375 Erschöpfende und Backtracking-Suche im Irrgarten 375 Optimierungen und Bewertungsfunktionen 377 Komplexitätsklassen: Schwere Probleme führen zu anstrengender Arbeit 380 Schwer ist, was den Besten schwerfällt 380 Ein Labyrinth der Kameras 382 Das nichtdeterministische Orakel 383 Schwer, schwerer, NP-schwer 385 Wie man mit schweren Problemen umgeht 387 NP-schwer ≠ hoffnungslos 387 Gute Ideen sind kein Hexenwerk 390 Kapitel 12 Teilen und Herrschen 393 Aufgaben auf Mitarbeiter abwälzen 393 Das Einwohnermeldeamt von Bürokrazien 393 Das Prinzip Teilen und Herrschen 395 Laufzeiten bei Teilen und Herrschen 396 Das Mastertheorem 397 Fall 1: Der Chef arbeitet mehr 398 Fall 2: Der Chef arbeitet gleich viel 399 Fall 3: Der Chef arbeitet weniger 400 Gibt es noch weitere Fälle? 401 So bestimmt man, welcher Fall vorliegt 401 Binärsuche 403 Der Suchbaum in einfach 403 Grenzen des Suchbereichs 405 Weitere Beispiele für Teilen und Herrschen 407 Sortieren 407 Matrizen multiplizieren 408 Minimaler Punktabstand 409 Kapitel 13 Dynamisches Programmieren 411 Ein profitabler Bauauftrag 411 Das Maximale-Teilsumme-Problem 412 Gier hilft nicht 412 Rohe Gewalt hilft eher 413 Inkrementelle Gewalt ist weniger roh 413 Ein Stück abschneiden und Herrschen 414 Zwischenergebnisse merken 416 Den Algorithmus vom Kopf auf die Füße stellen 418 Der ultimative Maximale-Teilsumme-Algorithmus 418 Probleme wachsen lassen 419 Das Prinzip des dynamischen Programmierens 419 Beispiel 1: Minimum 420 Beispiel 2: Fibonacci-Zahlen 421 Beispiel 3: Rucksack packen 424 Vergleich von Texten 424 Die Editierdistanz 425 Strings alignieren 426 Arbeitsteilung auf der Alignmentbaustelle 427 Optimale Alignments mit dynamischem Programmieren 428 Der Weg zum Optimum 431 Entscheidungen merken 431 Den Pfad zurückfinden 433 Kapitel 14 Näherungslösungen 437 Heuristiken 437 Interpolationssuche 438 Heuristisches Verzweigen und Begrenzen 441 Der A*-Algorithmus 443 Approximation 446 TSP: Die kürzeste Rundreise 446 Gierige Heuristik 447 Lokale Suche 449 Approximation ohne Heuristik 450 Gier 453 Das Wechselgeldproblem 455 Das Problem der Mengenüberdeckung 458 Gier in Perfektion 461 Huffman-Codierung 461 Teil V Der Top-Ten-Teil 465 Kapitel 15 Zehn Datenabstraktionen und Datenstrukturen 467 Stapel 468 Warteschlange 469 Prioritätswarteschlange 469 Liste 470 Array 471 Menge 471 Verzeichnis 472 Relation 472 Graph 473 Baum 474 Kapitel 16 Zehn Ratschläge, wenn (bevor) der kleine Frust kommt 475 Rekursion ist deine Freundin 475 Mathematik ist einfach 476 Pseudocode ist verstehbar 477 Abstraktion ist gut 477 Sei auch mal funktional 478 Ein Bild sagt mehr als 1000 Worte 478 Vieles ist solides Handwerk 479 Es geht auch um Kreativität 479 Unterscheide Datenmodell und Datenstruktur 480 Was schwierig aussieht, ist oft auch schwierig 480 Stichwortverzeichnis 481
£21.38
Wiley-VCH Verlag GmbH Allgemeinbildung Digitalisierung für Dummies
Book Synopsis"Die Digitalisierung geht nicht mehr weg." - Ein grundlegendes Verständnis der Prinzipien der Digitalisierung und ihrer wichtigsten Anwendungen ist deshalb die Voraussetzung, um im Beruf und als Privatperson informierte Entscheidungen treffen zu können - ob es nun um Kryptowährungen, New Work oder den Schutz der eigenen Daten in sozialen Medien geht. In diesem Buch wird das Thema Digitalisierung anschaulich und unterhaltsam aufbereitet. Der Fokus liegt auf der fundierten und leicht verdaulichen Vermittlung der Grundlagen, die es Ihnen ermöglicht, nach der Lektüre eigenständig auf dem Laufenden zu bleiben und neue Entwicklungen mit ihren Konsequenzen zu verstehen und einzuordnen.Trade Review"... Wer sich in den verschiedenen Bereichen der Digitalisierung fit machen möchte, dem sei der Ratgeber ?Allgemeinbildung Digitalisierung für Dummies? empfohlen. (Hab mehr vom Leben; im Juli 2022)Table of ContentsÜber die Autorin 9 Einführung 19 Törichte Annahmen über die Leser 20 Wie dieses Buch aufgebaut ist 20 Teil I: Was heißt Digitalisierung? 20 Teil II: Daten und Algorithmen – die Welt als Einsen und Nullen 20 Teil III: Digitalisierung zum Anfassen – Schnittstellen zur physischen Realität 21 Teil IV: Digitalisierung in Aktion – Anwendungsbereiche 21 Teil V: Digitalisierung und wir – gesellschaftliche Auswirkungen 21 Teil VI: Der Top-Ten- Teil 22 Symbole, die in diesem Buch verwendet werden 22 Wie es weitergeht 22 Teil I: Was heißt Digitalisierung? 23 Kapitel 1: Digitale Welt – was bringt uns das? 25 Die reale Welt in Zahlen abbilden 27 Digitale Abbilder sind unvollständig 28 … dürfen es aber auch sein 29 Informationen (fast) umsonst übermitteln und vervielfältigen 30 Informationen intelligent verarbeiten 30 Teil II: Daten und Algorithmen – die Welt als Einsen und Nullen 33 Kapitel 2: Wo wohnt Information? 35 Information existiert nur auf einem Träger 36 Hebel, Walzen, Rechenschieber 36 Mechanische Träger sind groß und langsam 40 Vom Rauchzeichen zum Telegrafen 40 Eine gute Idee: Das Relais 41 Logisch: 1 ist NICHT 0 43 Ein Saal voller Flipflops 45 Hier können Sie Ihre Bits registrieren 47 Daten auf der Flucht 50 Ein Netzwerk für (fast) alles: Das Internet 52 Vom Internet zum World Wide Web 58 Kapitel 3:Algorithmen: Mit Daten Dinge tun 59 Kochrezepte für den Computer 60 Englisch: Weltsprache auch für Computer 62 In kleinen Schritten zum Erfolg 65 Das Problem kenne ich irgendwoher … 66 Große Datenmengen: Mehr ist manchmal einfach mehr 67 So lernen Maschinen 73 Supervised Learning: Die Maschine an die Hand nehmen 75 kNN-Algorithmus: In guter Nachbarschaft 76 Unsupervised Learning: Auf sich allein gestellt 79 k-Means Clustering: Ballungsräume finden 80 Das Hirn nachbauen: Künstliche neuronale Netze 82 Das neuronale Netz in Aktion 86 Schicht um Schicht: Deep Learning 87 Starke und schwache künstliche Intelligenz 87 Meine Geheimnisse gehören mir: Kryptografie 90 Die Blockchain: Revolution oder Betrugsmasche? 92 Unkopierbares Geld 94 Betrug ist teuer 96 Mining: So wird Geld gemacht 99 Nützlicher als Bitcoin 99 Automatisierung mit Smart Contracts 102 Blockchain ohne Geld 106 Kapitel 4: Computer mal anders: Quanten, DNA und andere 109 Ternäre Logik: Flip, Flap, Flop 109 Biologische Computer 110 Quantencomputer und die spukhafte Fernwirkung 113 Die Antwort ist 42: Deep Thought 116 Teil III: Digitalisierung zum Anfassen – Schnittstellen zur physischen Realität 119 Kapitel 5: Virtual und Augmented Reality 121 Virtuelle Realität: Eine Dimension mehr 123 Vom Pixel zum Voxel 123 3D-Modellierung und –Rendering 125 Räumlich sehen, ohne VR-krank zu werden 128 Augmented Reality: Die bessere Realität 130 Kapitel 6: Internet of Things und Industrie 4.0 137 Sensoren und Aktoren: Wir regeln das 138 Kybernetik: Alles ist ein System 139 Das hilfreiche Zuhause 140 Cyber-Physical Systems: Maschinen im Internet 143 Kapitel 7: Robotik 145 Wie sehe ich aus? Design eines Roboters 149 Die Gesetze der Robotik 151 Kapitel 8: Nanotechnologie 155 Viel Spielraum nach unten 155 Maschinen auf Kohlenstoffbasis 158 Teil IV: Digitalisierung in Aktion – Anwendungsbereiche 161 Kapitel 9: Soziale Medien und Netzwerke 163 Smileys, Emoticons, Emojis 164 Die Geburt des Blogs 167 Vom Onlinetagebuch zum (We)Blog 168 Der Aufstieg von Facebook 169 Feeds, Likes und Dopamin 171 Nichts verpassen: Soziale Netzwerke unterwegs 172 Alte und neue soziale Netzwerke 173 Triff mich im Livestream 173 Werbung in sozialen Netzwerken 176 Soziale Netzwerke und Datenschutz 177 Dezentrale Netzwerke 179 Kapitel 10: Digitales Arbeiten und New Work 183 Homeoffice und mobiles Arbeiten 183 Digitale Nomaden 186 New Work oder gar kein Work? 186 Decentralized Autonomous Organizations (DAOs) 188 Geld, kontrolliert von Algorithmen 189 Kapitel 11: E-Commerce, digitale Zahlungsmittel und Kryptowährungen 191 Der Siegeszug von Amazon und eBay 192 PayPal und die Kontensperrung 194 Kryptowährungen: Ohne Netz und doppelten Boden 194 Micropayments: Kleinvieh macht mehr Mist 197 Kapitel 12: Digitale Gesundheit 203 Wertvolles Gut: Gesundheitsdaten 203 Telematikinfrastruktur 206 Quantified Self: Wer bin ich – und wie kann ich das messen? 210 Wir sind Cyborgs 212 Schluss mit Wartezimmern? 214 Kapitel 13: Smarte Mobilität und autonomes Fahren 217 Wissen, wo es langgeht 217 Autonome Automobile 220 Teil V: Digitalisierung und wir – gesellschaftliche Auswirkungen 227 Kapitel 14: Informationelle Selbstbestimmung und Überwachung 229 Vom Volkszählungsgesetz zur Verfassungsbeschwerde 230 Bürger unter Beobachtung 231 Post Privacy: Nichts zu verbergen? 232 Bitte vergiss mich 233 Kapitel 15: Nudging und Bevormundung 235 Nicht schubsen! 235 Unter uns Denkfaulen 237 Lieber nichts verlieren als etwas gewinnen 238 Soziale Einflüsse und Normen 238 Falsche Einschätzung von Wahrscheinlichkeiten 239 So geht Nudging 240 Kapitel 16: Digitale Bohème und digitales Prekariat 243 Selbst und ständig 243 Der Mensch als Automat 245 Selbstkontrolle, Selbstökonomisierung, Selbstrationalisierung 246 Kapitel 17: Informationsflut und ständige Erreichbarkeit 249 Ein Online-Brain für die digitale Welt 250 Nie wieder Langeweile? 251 Langeweile macht kreativ 252 Transaktionsgedächtnis: Wissen, wo was steht 253 Ihr Smartphone: Risiken und Nebenwirkungen 254 Kapitel 18: Digitale Helfer und Verlust zwischenmenschlicher Kontakte 257 Teil VI: Der Top-Ten- Teil. 261 Kapitel 19: Zehn hörenswerte Vorträge zur Digitalisierung 263 Hirne hacken: Menschliche Faktoren in der IT-Sicherheit 264 Ich sehe, also bin ich … Du 264 Embracing Post Privacy 265 Bias in Algorithmen 265 Digitale Entmündigung 266 Hold Steering Wheel! Autopilots and Autonomous Driving 266 Quantum Computing: Are we there yet? 266 Virtual Reality für Arme 267 Computer, Kunst und Kuriositäten 267 What the cyberoptimists got wrong – and what to do about it 268 Abbildungsverzeichnis 269 Stichwortverzeichnis 273
£999.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG LATIN 2006: Theoretical Informatics: 7th Latin
Book SynopsisThis book constitutes the refereed proceedings of the 7th International Symposium, Latin American Theoretical Informatics, LATIN 2006, held in March 2006. The 66 revised full papers presented together with seven invited papers were carefully reviewed and selected from 224 submissions. The papers presented are devoted to a broad range of topics in theoretical computer science with a focus on algorithmics and computations related to discrete mathematics as well as on cryptography, data compression and Web applications.Table of ContentsKeynotes.- Algorithmic Challenges in Web Search Engines.- RNA Molecules: Glimpses Through an Algorithmic Lens.- Squares.- Matching Based Augmentations for Approximating Connectivity Problems.- Modelling Errors and Recovery for Communication.- Lossless Data Compression Via Error Correction.- The Power and Weakness of Randomness in Computation.- Regular Contributions.- A New GCD Algorithm for Quadratic Number Rings with Unique Factorization.- On Clusters in Markov Chains.- An Architecture for Provably Secure Computation.- Scoring Matrices That Induce Metrics on Sequences.- Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.- The Complexity of Diffuse Reflections in a Simple Polygon.- Counting Proportions of Sets: Expressive Power with Almost Order.- Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets.- Relations Among Notions of Security for Identity Based Encryption Schemes.- Optimally Adaptive Integration of Univariate Lipschitz Functions.- Classical Computability and Fuzzy Turing Machines.- An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees.- An Algorithm for a Generalized Maximum Subsequence Problem.- Random Bichromatic Matchings.- Eliminating Cycles in the Discrete Torus.- On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions.- Pattern Matching Statistics on Correlated Sources.- Robust Model-Checking of Linear-Time Properties in Timed Automata.- The Computational Complexity of the Parallel Knock-Out Problem.- Reconfigurations in Graphs and Grids.- -Varieties, Actions and Wreath Product.- Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.- An Efficient Approximation Algorithm for Point Pattern Matching Under Noise.- Oblivious Medians Via Online Bidding.- Efficient Computation of the Relative Entropy of Probabilistic Automata.- A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences.- De Dictionariis Dynamicis Pauco Spatio Utentibus.- Customized Newspaper Broadcast: Data Broadcast with Dependencies.- On Minimum k-Modal Partitions of Permutations.- Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm.- Maximizing Throughput in Queueing Networks with Limited Flexibility.- Network Flow Spanners.- Finding All Minimal Infrequent Multi-dimensional Intervals.- Cut Problems in Graphs with a Budget Constraint.- Lower Bounds for Clear Transmissions in Radio Networks.- Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.- Lower Bounds for Geometric Diameter Problems.- Connected Treewidth and Connected Graph Searching.- A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs.- The Committee Decision Problem.- Common Deadline Lazy Bureaucrat Scheduling Revisited.- Approximate Sorting.- Stochastic Covering and Adaptivity.- Algorithms for Modular Counting of Roots of Multivariate Polynomials.- Hardness Amplification Via Space-Efficient Direct Products.- The Online Freeze-Tag Problem.- I/O-Efficient Algorithms on Near-Planar Graphs.- Minimal Split Completions of Graphs.- Design and Analysis of Online Batching Systems.- Competitive Analysis of Scheduling Algorithms for Aggregated Links.- A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains.- On Sampling in Higher-Dimensional Peer-to-Peer Systems.- Mobile Agent Rendezvous in a Synchronous Torus.- Randomly Colouring Graphs with Girth Five and Large Maximum Degree.- Packing Dicycle Covers in Planar Graphs with No K 5–e Minor.- Sharp Estimates for the Main Parameters of the Euclid Algorithm.- Position-Restricted Substring Searching.- Rectilinear Approximation of a Set of Points in the Plane.- The Branch-Width of Circular-Arc Graphs.- Minimal Eulerian Circuit in a Labeled Digraph.- Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization.- RISOTTO: Fast Extraction of Motifs with Mismatches.- Minimum Cost Source Location Problems with Flow Requirements.- Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.- Constructions of Approximately Mutually Unbiased Bases.- Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In.
£999.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Algorithms and Data Structures: The Basic Toolbox
Book SynopsisAlgorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems. This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and high-level pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java. The authors have extensive experience teaching these subjects to undergraduates and graduates, and they offer a clear presentation, with examples, pictures, informal explanations, exercises, and some linkage to the real world. Most chapters have the same basic structure: a motivation for the problem, comments on the most important applications, and then simple solutions presented as informally as possible and as formally as necessary. For the more advanced issues, this approach leads to a more mathematical treatment, including some theorems and proofs. Finally, each chapter concludes with a section on further findings, providing views on the state of research, generalizations and advanced solutions.Trade Review"This is another mainstream textbook on algorithms and data structures, mainly intended for undergraduate students and professionals … . The two-layer index table is also detailed and helpful. I do enjoy reading the informative sections of historical notes and further findings at the end of each chapter. … This book is very well written, with the help of … clear figures and tables, as well as many interesting and inspiring examples." Zhizhang Shen, Zentralblatt MATH, Vol. 1146, 2008"... the book develops the basic fundamental principles underlying their design and analysis without sacrificing depth or rigor. The authors' insight, knowledge and active research on algorithms and data structures provide a very solid approach to the book. I particularly liked their "as informally as possible and as formally as necessary" writing style, and I enjoyed a lot their decision to not only discuss classical results, but to broaden the view to alternative implementations, memory hierarchies and libraries, which transmits novelty and increases interest...I think that this book will be a superb addition particularly useful for teachers of undergraduate courses, to graduate students in Computer Science, and to researchers that work, or intend to work, with algorithms." Jordi Petit, Computer Science Review 3, 2009 "Mehlhorn and Sanders write well, and the well-organized presentation reflects their experience and interest in the various topics... it is an excellent reference, and could possibly be used in a transition course, serving students coming to graduate CS courses from other technical fields. [...]This text is intended for undergraduate computer science (CS) majors, and focuses on algorithm analysis. … it is an excellent reference, and could possibly be used in a transition course, serving students coming to graduate CS courses from other technical fields. Finally, the book contains interesting tidbits that are not readily available elsewhere." M. G. Murphy, ACM Computing Reviews, October 2008"A 'Toolbox' should be portable, practical, and useful. This book is all these, covering a nice swath of the classic CS algorithms but addressing them in a way that is accessible to the student and practitioner. Furthermore, it manages to incorporate interesting examples as well as subtle examples of wit compressed into its 300 pages. Although it is not tied to any one language or library, it provides practical references to efficient open-source implementations of many of the algorithms and data structures; these should be the first refuge of the commercial developer. I can easily recommend this book as an intermediate undergraduate text, a refresher for those of us who only dimly remember our intermediate undergraduate courses, and as a reference for the professional development craftsman." Hal C. Elrod, SIGACT News Book Review Column 42(4) 2011Table of ContentsAppetizer: Integer Arithmetics.- Representing Sequences by Arrays and Linked Lists.- Hash Tables and Associative Arrays.- Sorting and Selection.- Priority Queues.- Sorted Sequences.- Graph Representation.- Graph Traversal.- Shortest Paths.- Minimum Spanning Trees.- Generic Approaches to Optimization.
£52.24
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Handbook of Information and Communication
Book SynopsisAt its core, information security deals with the secure and accurate transfer of information. While information security has long been important, it was, perhaps, brought more clearly into mainstream focus with the so-called “Y2K” issue. Te Y2K scare was the fear that c- puter networks and the systems that are controlled or operated by sofware would fail with the turn of the millennium, since their clocks could lose synchronization by not recognizing a number (instruction) with three zeros. A positive outcome of this scare was the creation of several Computer Emergency Response Teams (CERTs) around the world that now work - operatively to exchange expertise and information, and to coordinate in case major problems should arise in the modern IT environment. Te terrorist attacks of 11 September 2001 raised security concerns to a new level. Te - ternational community responded on at least two fronts; one front being the transfer of reliable information via secure networks and the other being the collection of information about - tential terrorists. As a sign of this new emphasis on security, since 2001, all major academic publishers have started technical journals focused on security, and every major communi- tions conference (for example, Globecom and ICC) has organized workshops and sessions on security issues. In addition, the IEEE has created a technical committee on Communication and Information Security. Te ?rst editor was intimately involved with security for the Athens Olympic Games of 2004.Trade ReviewAus den Rezensionen: “... Besonderes Augenmerk gilt dabei dem Wechselspiel zwischen Kommunikation und dem Bereich der Informationssicherheit. ... herausgegriffene Themen illustrieren die Relevanz des Buchs. … Verschiedene HIPs werden vorgestellt und verglichen Weitere Beitrage befassen sich mit Phishing Attacken bzw mit Authentifikationen mittels biometrischer Methoden. ... Die Beitrage sind theoretisch fundiert und oft praxisbezogen. … Das Buch eignet sich deshalb gut als Einstiegslektüre für Studierende oder für Informatiker, die sich nur am Rande für die Sicherheitsthematik interessieren. Für Experten ist das Buch eine wertvolle, vielseitige Inspirationsquelle.“ (in: Bulletin electrosuisse, 2/July/2010, Issue 7, S. 121)Table of ContentsPart A Fundamentals and Cryptography A Framework for System Security .- Public-Key Cryptography.- Elliptic Curve Cryptography.- Cryptographic Hash Functions.- Block Cipher Cryptanalysis.- Chaos-Based Information Security.- Bio-Cryptography.- Quantum Cryptography.- Part B Intrusion Detection and Access Control Intrusion Detection and Prevention Systems.- Intrusion Detection Systems.- Intranet Security via Firewalls.- Distributed Port Scan Detection.- Host-Based Anomaly Intrusion Detection.- Security in Relational Databases.- Anti-Bot Strategies Based on Human Interactive Proofs.- Access and Usage Control in GRID Systems.- Secure Human Identification.- Part C Networking Peer-to-Peer Botnets.- Security of Service Networks.- SCADA Security.- Mobile Ad-Hoc Network Routing.- Security Approach for Ad–Hoc Networks.- Phishing: Attacks and Countermeasures´.- Part D Optical Networking Chaos-Based Secure Optical Communications.- Chaos Applications in Optical Communications.- Part E Wireless Networking Security in Wireless Sensor Networks.- Secure routing in Wireless Sensor Networks.- Security Via Surveillance and Monitoring.- Security and QoS in Wireless Networks.- Part F Software Low-Level Software Security by Example.- Software Reverse Engineering.- Trusted Computing.- Security via Trusted Communications.- Viruses and Malware.- Designing a Secure Programming Language.- Part G Forensics and Legal Issues Fundamentals of Digital Forensic Evidence.- Multimedia Forensics for Detecting Forgeries.- Technological and Legal Aspects of CIS Subject Index
£449.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Understanding Cryptography: A Textbook for
Book SynopsisCryptography is now ubiquitous – moving beyond the traditional environments, such as government communications and banking systems, we see cryptographic techniques realized in Web browsers, e-mail programs, cell phones, manufacturing systems, embedded software, smart buildings, cars, and even medical implants. Today's designers need a comprehensive understanding of applied cryptography. After an introduction to cryptography and data security, the authors explain the main techniques in modern cryptography, with chapters addressing stream ciphers, the Data Encryption Standard (DES) and 3DES, the Advanced Encryption Standard (AES), block ciphers, the RSA cryptosystem, public-key cryptosystems based on the discrete logarithm problem, elliptic-curve cryptography (ECC), digital signatures, hash functions, Message Authentication Codes (MACs), and methods for key establishment, including certificates and public-key infrastructure (PKI). Throughout the book, the authors focus on communicating the essentials and keeping the mathematics to a minimum, and they move quickly from explaining the foundations to describing practical implementations, including recent topics such as lightweight ciphers for RFIDs and mobile devices, and current key-length recommendations. The authors have considerable experience teaching applied cryptography to engineering and computer science students and to professionals, and they make extensive use of examples, problems, and chapter reviews, while the book’s website offers slides, projects and links to further resources. This is a suitable textbook for graduate and advanced undergraduate courses and also for self-study by engineers.The authors' website (http://www.crypto-textbook.com/) provides extensive notes, slides, video lectures; the authors' YouTube channel (https://www.youtube.com/channel/UC1usFRN4LCMcflV7UjHNuQg) includes video lectures.Trade ReviewFrom the reviews: "The authors have succeeded in creating a highly valuable introduction to the subject of applied cryptography. I hope that it can serve as a guide for practitioners to build more secure systems based on cryptography, and as a stepping stone for future researchers to explore the exciting world of cryptography and its applications." (Bart Preneel, K.U.Leuven) "The material is very well presented so it is clear to understand. The necessary amount of mathematics is used and complete yet simple examples are used by the authors to help the reader understand the topics. ... [The authors] appear to fully understand the concepts and follow a very good pedagogical process that helps the reader not only understand the different topics but motivate you to perform some of the exercises at the end of each chapter and browse some of the reference materials. I fully recommend this book to any software developer/designer working or considering working on a project that requires security." (John Canessa) "The book presents a panoramic of modern Cryptography with a view to practical applications. ... The book is well written, many examples and figures through it illustrate the theory and the book's website offers links and supplementary information. The book also discusses the implementation in software and hardware of the main algorithms described." (Juan Tena Ayuso, Zentralblatt MATH, Vol. 1190, 2010)Table of ContentsIntroduction to Cryptography and Data Security.- Stream Ciphers.- The Data Encryption Standard (DES) and Alternatives.- The Advanced Encryption Standard (AES).- More About Block Ciphers.- to Public-Key Cryptography.- The RSA Cryptosystem.- Public-Key Cryptosystems Based on the Discrete Logarithm Problem.- Elliptic Curve Cryptosystems.- Digital Signatures.- Hash Functions.- Message Authentication Codes (MACs).- Key Establishment.
£999.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.
£42.74
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Arithmetik: Aus der Reihe The Art of Computer
Book SynopsisDas Buch Arithmetik ist eine Übersetzung des vierten Kapitels der legendären Werkreihe "The Art of Computer Programming" von Donald E. Knuth in der neuesten Fassung. Es handelt sich um eine umfangreiche Einführung in die Computeralgebra, die den neuesten Stand der Forschung berücksichtigt. Donald E. Knuth versteht es, die Algorithmen didaktisch sehr geschickt und ohne Kompromisse bei der Strenge aufzubereiten. Das Buch enthält außerdem Hunderte von Aufgaben verschiedener Schwierigkeitsgrade mit Lösungen. Der Übersetzer, Prof. Dr. R. Loos, lehrt an der Universität Tübingen.Table of Contents4 — Arithmetik.- 4.1. Stellenwertsysteme.- 4.2. Gleitkomma-Aritlunetik.- 4.2.1. Einfachgenaue Rechnungen.- 4.2.2. Genauigkeit der Gleitkonuna-Arithmetik.- *4.2.3. Doppeltgenaue Rechnungen.- 4.2.4. Verteilung von Gleitkomrnazahlen.- 4.3. Mehrfachgenaue Aritlunetik.- 4.3.1. Die klassischen Algorithmen.- *4.3.2. Modulare Aritlnnetik.- *4.3.3. Wie schnell könn en wir multiplizieren?.- 4.4. Basiswechsel.- 4.5. Rationale Arithmetik.- 4.5.1. Brüche.- 4.5.2. Der größte gemeinsame Teiler.- *4.5.3. Analyse des euklidschen Algorithmus.- 4.5.4. Zerlegung in Prirnfaktoren.- 4.6. Polynornarithmetik.- 4.6.1. Division von Polynomen.- *4.6.2. Faktorisierung von Polynomen.- 4.6.3. Auswertung von Potenzen.- 4.6.4. Auswertung von Polynomen.- *4.7. Operationen an Potenzreihen.- Lösungen zu den Übungsaufgaben.- Anhang A — Tafeln numerischer Größen.- 1. Fundamentale Konstanten (dezimal).- 2. Fundamentale Konstanten (oktal).- 3. Harrnonische Zahlen , Bernoulli-Zahlen, Fibonacci-Zahlen.- Anhang B — Index der Bezeichnungen.- Index und Glossar.
£999.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Transactions on Large-Scale Data- and
Book SynopsisThe LNCS journal Transactions on Large-Scale Data and Knowledge-Centered Systems focuses on data management, knowledge discovery, and knowledge processing, which are core and hot topics in computer science. Since the 1990s, the Internet has become the main driving force behind application development in all domains. An increase in the demand for resource sharing (e.g., computing resources, services, metadata, data sources) across different sites connected through networks has led to an evolution of data- and knowledge-management systems from centralized systems to decentralized systems enabling large-scale distributed applications providing high scalability.This, the 50th issue of Transactions on Large-Scale Data and Knowledge-Centered Systems, contains five fully revised selected regular papers. Topics covered include data anonymization, quasi-identifier discovery methods, symbolic time series representation, detection of anomalies in time series, data quality management in biobanks, and the use of multi-agent technology in the design of intelligent systems for maritime transport.Table of ContentsA Parallel Quasi-identifier Discovery Scheme for Dependable Data Anonymisation.- Towards Symbolic Time Series Representation Improved by Kernel Density Estimators.- Anomaly Detection in Time Series.- Designing Intelligent Marine Framework Based on Complex Adaptive System Principle.- Data Item Quality for Biobanks.
£999.99
Springer, India, Private Ltd Complex Binary Number System: Algorithms and
Book SynopsisThis book is a compilation of the entire research work on the topic of Complex Binary Number System (CBNS) carried out by the author as the principal investigator and members of his research groups at various universities during the years 2000-2012. Pursuant to these efforts spanning several years, the realization of CBNS as a viable alternative to represent complex numbers in an “all-in-one” binary number format has become possible and efforts are underway to build computer hardware based on this unique number system. It is hoped that this work will be of interest to anyone involved in computer arithmetic and digital logic design and kindle renewed enthusiasm among the engineers working in the areas of digital signal and image processing for developing newer and efficient algorithms and techniques incorporating CBNS.Trade ReviewFrom the reviews:“This is a monograph presenting the results of a dozen or so years research of the author devoted to purely binary representation of complex numbers and design of circuits for arithmetic operations on them. … The topic of this book may be recommended as a facultative lecture for academic courses on digital arithmetic.” (Antoni Michalski, Zentralblatt MATH, Vol. 1262, 2013)Table of ContentsIntroduction.- Conversion Algorithms.- Arithmetic Algorithms.- Arithmetic Circuits Designs.- Complex Binary Associative Processor Design.- Conclusion and Further Research.
£999.99
Taylor & Francis Ltd Conical Approach to Linear Programming
Book SynopsisThe conical approach provides a geometrical understanding of optimization and is a powerful research tool and useful problem-solving technique (for example, in decision support and real time control applications). Conical optimality conditions are first stated in a very general optimization framework, and then applied to linear programming. A complete theory along with primal and dual algorithms is given, and solutions and algorithms are also provided for vector and robust linear optimization. The advantages of parameter dependence of conical methods are fully discussed. In addition to numerical results, the book provides source codes and detailed documentation of a Modula-2 implementation for the main algorithms.Table of ContentsPart I: General Theory Part II: Further Advanced Results Part III: Implementations and Numerical Results
£250.00
Amsterdam University Press Engines of Order: A Mechanology of Algorithmic
Book SynopsisSoftware has become a key component of contemporary life and algorithms that rank, classify, or recommend are everywhere. Building on the philosophy of Gilbert Simondon and the cultural techniques tradition, this book examines the constructive and cumulative character of software and retraces the historical trajectories of a series of algorithmic techniques that have become the building blocks for contemporary practices of ordering. Developed in opposition to centuries of library tradition, these techniques instantiate dynamic, perspectivist, and interested forms of knowing. Embedded in technical infrastructures and economic logics, they have become engines of order that transform how we arrange information, ideas, and people.Trade Review"How were computers given the task of searching and classifying information? Engines of Order offers an exciting archaeology of the algorithmic techniques that made these feats possible. It is a unique book that mixes a high level of theorization with a detailed examination of modes of expression in the form of technique." - Dominique Cardon, Professor at Sciences Po Paris and Director, médialab "This book is essential reading for everybody who wants to better understand our algorithmic society. For the first time, a number of key data techniques such as data-driven classification methods are given proper theoretical and historical attention. I highly recommend this clear and smart guide to the world in which we are all living." - Lev Manovich, Professor at City University of New York and Director, Cultural Analytics LabTable of ContentsAcknowledgements Credits Introduction Part I 1. Engines of Order 2. Rethinking Software 3. Software-Making and Algorithmic Techniques Part II 4. From Universal Classification to a Postcoordinated Universe 5. From Frequencies to Vectors 6. Interested Learning 7. Calculating Networks: from Sociometry to PageRank Conclusion: Toward Technical Culture Index
£121.60
Amsterdam University Press The Anthology in Digital Culture: Forms and
Book SynopsisAs a cultural form, media practice and organizational model, the anthology has represented an important editorial framework in the development, preservation and retrieval of narratives, from paper-based media to machine-generated content, all throughout a series of discontinued analog and digital technologies. Over time, anthologies became part of the “metaphors we live by” (Lakoff and Johnson 2008), figurative lenses through which we read, navigate, interpret stories and organize human thoughts for better understanding. By providing an overview on the role of the anthology on streaming platform environments, this book examines how traditional editorial practices of anthologization intersect with data-driven content classification and sorting in the context of both pre- and post-digital culture. The author ultimately proposes to insert “anthology” in a vocabulary of digital culture that accounts for new curatorial and algorithmic processes of content filtering, in the attempt to expand the critical “keywords” (Williams 1983; Striphas 2015; Thylstrup et al. 2021) for the study of culture, society, data.Table of ContentsTable of Contents Preface/Acknowledgements Introduction Chapter 1. History Chapter 2. Design Chapter 3. Infrastructures Chapter 4. Platforms Conclusion Appendix. On Methods Bibliography Index
£101.65
Springer Verlag, Singapore Emerging Technologies in Data Mining and
Book SynopsisThis book features research papers presented at the International Conference on Emerging Technologies in Data Mining and Information Security (IEMIS 2020) held at the University of Engineering & Management, Kolkata, India, during July 2020. The book is organized in three volumes and includes high-quality research work by academicians and industrial experts in the field of computing and communication, including full-length papers, research-in-progress papers, and case studies related to all the areas of data mining, machine learning, Internet of things (IoT), and information security. Table of ContentsChapter 1. Layered Ensemble Learning for Effective Binary Classification.- Chapter 2. A Preliminary Study of Knowledge Graphs and their Construction.- Chapter 3. A Simple Ensemble Learning Algorithm for a Real time High Dimensional Data.- Chapter 4. Promising Highest Resilient Network using preventive Route selection algorithm- IPSDSDV in MANET.- Chapter 5. An ANN Approach of Twisted Fiestel Block Ciphering.- Chapter 6. Musical Instrument Classification Based On Machine Learning Algorithm.- Chapter 7. Analytical Survey and Comparative Analysis of Socialized Network via Data Mining and Machine Learning Techniques.- Chapter 8. Assessment of Severity Classification of Traffic Accidents on the basis of K-means Clustering and Adaptive Neuro-Fuzzy Inference System.- Chapter 9. Design and Implementation of Login Based Wi-Fi Hotspot Network for an University Campus.- Chapter 10. A Framework to Capture the Shift in Dynamics of a Multi-Phase Protest - A Case Study of Hong Kong Protests.- Chapter 11. A Comparative Study to Analyze the Performance of Advanced Pattern Recognition Algorithms for Multi-Class Classification.- Chapter 12. ECG Signal Denoising Using A Novel Solution To The Heat Equation Through Wavelet Transform.- Chapter 13. Design and Implementation of Chao-Cryptic Architecture on FPGA for Secure Audio Communication.- Chapter 14. Diffusion + Confusion: Chaos Assisted Two Fold Cryptosystem for Secure Video Transmission.- Chapter 15. Chaos Blend LFSR – Duo Approach on FPGA for Medical Image Security.
£134.99
Springer Verlag, Singapore Computer Networks, Big Data and IoT: Proceedings
Book SynopsisThis book presents best selected research papers presented at the International Conference on Computer Networks, Big Data and IoT (ICCBI 2020), organized by Vaigai College Engineering, Madurai, Tamil Nadu, India, during 15–16 December 2020. The book covers original papers on computer networks, network protocols and wireless networks, data communication technologies and network security. The book is a valuable resource and reference for researchers, instructors, students, scientists, engineers, managers and industry practitioners in those important areas.Table of ContentsMaximizing Network Lifetime in WSN using Ant Colony Algorithm.- Deep Ensemble Approach for Question Answer System.- Information Sharing Over Social Media Analysis Using Centrality Measure.- Indoor Mobile Robot Navigation using Deep Convolutional Neural Network.- Etaheuristic Enabled Shortest Path Selection for IoT based Wireless Sensor Network.- Generation of Random Binary Sequence using Adaptive Row-Column Approach and Synthetic Colour Image.- A Study of Mobile Adhoc Network and its Performance Optimizaiton Algorithm.- Sentimental Analysis on Twitter Data of Political Domain.- Big Social Media Analytics: Applications and Challenges.- Intelligent Computing Application for Cloud Enhancing Health Care Services.- Corona Virus Detection and Classification using X-Rays and CT Scans with Machine Learning Techniques.- Security Issues and Solutions in E-Health and Telemedicine.- Accident Alert System with False Alarm Switch.- A Deep Learning Approach to Detect Lumpy Skin Disease in Cows.- Algorithmic Trading using Machine Learning and Neural Network.- Analysis on Intrusion Detection System using Machine Learning Techniques.- Content Related Feature Analysis for Fake Online Consumer Review Detection.- Approaches in Assistive Technology: A Survey on Existing Assistive Wearable Technology for The Visually-Impaired.- Filter Bank Multicarrier Systems using Gaussian Pulse based Filter Design for 5G Technologies.- Data Streaming Architecture for Visualizing Cryptocurrency Temporal Data.- Integration of IoT and SDN to Mitigate DDoS with RYU Controller.- A Framework for monitoring Patient’s Vital Signs with Internet-of-Things and Blockchain Technology.- Network Intrusion Detection using Cross Bagging based Stacking Model.- Performance Study of Free Space Optical System under Varied Atmospheric Conditions.- Review on Energy Efficient Routing Protocols in WSN.Comparative Analysis of Traffic and Congestion in Software Defined Networks.- Automatic Vehicle Service Monitoring and Tracking System using IoT and Machine Learning.
£999.99
Springer Verlag, Singapore Soft Computing for Problem Solving: Proceedings
Book SynopsisThis two-volume book provides an insight into the 10th International Conference on Soft Computing for Problem Solving (SocProS 2020). This international conference is a joint technical collaboration of Soft Computing Research Society and Indian Institute of Technology Indore. The book presents the latest achievements and innovations in the interdisciplinary areas of soft computing. It brings together the researchers, engineers and practitioners to discuss thought-provoking developments and challenges, in order to select potential future directions. It covers original research papers in the areas including but not limited to algorithms (artificial immune system, artificial neural network, genetic algorithm, genetic programming and particle swarm optimization) and applications (control systems, data mining and clustering, finance, weather forecasting, game theory, business and forecasting applications). The book will be beneficial for young as well as experienced researchers dealing across complex and intricate real-world problems for which finding a solution by traditional methods is a difficult task.Table of ContentsA deep semi-supervised approach for multi-label land-cover classification under scarcity of labelled images.- Role of individual samples in Modified Possibilistic c-Means classifier for handling heterogeneity within mustard crop.- Specially Structured Flow Shop Scheduling Models with processing times as Trapezoidal Fuzzy Numbers to optimize Waiting time of Jobs.- Potential Fishing Zone Characterization in the Indian Ocean by Machine Learning Approach.- A novel method to optimize interval length for intuitionistic fuzzy time series.- Low Altitude Unmanned Aerial Vehicle For Real Time Green House Plant Disease Monitoring Using Convolutional Neural Network.
£999.99
Springer Verlag, Singapore Data Science in Agriculture and Natural Resource
Book SynopsisThis book aims to address emerging challenges in the field of agriculture and natural resource management using the principles and applications of data science (DS). The book is organized in three sections, and it has fourteen chapters dealing with specialized areas. The chapters are written by experts sharing their experiences very lucidly through case studies, suitable illustrations and tables. The contents have been designed to fulfil the needs of geospatial, data science, agricultural, natural resources and environmental sciences of traditional universities, agricultural universities, technological universities, research institutes and academic colleges worldwide. It will help the planners, policymakers and extension scientists in planning and sustainable management of agriculture and natural resources. The authors believe that with its uniqueness the book is one of the important efforts in the contemporary cyber-physical systems.Table of ContentsData Science: Principles and Concepts in Data Analysis and Modelling.- Data Science: Tools, Techniques and Potential Applications in Earth Observation Studies.- Data Science in Agriculture and Natural Resource Management: An Overview.- Applications of Reinforcement Learning and Recurrent Neural Network Based Deep Learning Frameworks in Agriculture.- Precision Farming Using Emerging Technologies.- An Architecture for Quality Centric Crop Production.- Integrating UAV and Field Sensor Data for Better Decision Making in Broadacre Cropping Systems.- Object Based Crop Classification for Precision Farming.- Disruptive Innovations in Precision Agriculture - Towards BD Analytics for Better GeoFarmatics.- A Paradigm-shift in Global Cropland Maps and Products for Food and Water Security in the Twenty-first Century: Petabyte Scale Satellite Big-data Analytics, Machine Learning, and Cloud Computing.- Big Data Analytics for Climate Resilient Supply Chains: Opportunities and Way Forward.- Mapping Croplands Using Machine Learning Algorithms and Spectral Matching Techniques.- Applications of Computer Vision in Precision Agriculture.- Innovative Geoportal Platforms for Sustainable Management of Natural Resources.
£999.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 Advances in Machine Learning for Big Data
Book SynopsisThis book focuses on research aspects of ensemble approaches of machine learning techniques that can be applied to address the big data problems. In this book, various advancements of machine learning algorithms to extract data-driven decisions from big data in diverse domains such as the banking sector, healthcare, social media, and video surveillance are presented in several chapters. Each of them has separate functionalities, which can be leveraged to solve a specific set of big data applications. This book is a potential resource for various advances in the field of machine learning and data science to solve big data problems with many objectives. It has been observed from the literature that several works have been focused on the advancement of machine learning in various fields like biomedical, stock prediction, sentiment analysis, etc. However, limited discussions have been carried out on application of advanced machine learning techniques in solving big data problems. Table of ContentsDeep Learning for Supervised Learning.- Deep Learning for Unsupervised Learning.- Support Vector Machine for Regression.- Support Vector Machine for Classification.- Decision Tree for Regression.- Higher Order Neural Networks.- Competitive Learning.- Semi-supervised Learning.- Multi-objective Optimization Techniques.- Techniques for Feature Selection/Extraction.- Techniques for Task Relevant Big Data Analysis.- Techniques for Post Processing Task in Big Data Analysis.- Customer Relationship Management.
£125.99
Springer Verlag, Singapore Knowledge Discovery from Multi-Sourced Data
Book SynopsisThis book addresses several knowledge discovery problems on multi-sourced data where the theories, techniques, and methods in data cleaning, data mining, and natural language processing are synthetically used. This book mainly focuses on three data models: the multi-sourced isomorphic data, the multi-sourced heterogeneous data, and the text data. On the basis of three data models, this book studies the knowledge discovery problems including truth discovery and fact discovery on multi-sourced data from four important properties: relevance, inconsistency, sparseness, and heterogeneity, which is useful for specialists as well as graduate students. Data, even describing the same object or event, can come from a variety of sources such as crowd workers and social media users. However, noisy pieces of data or information are unavoidable. Facing the daunting scale of data, it is unrealistic to expect humans to “label” or tell which data source is more reliable. Hence, it is crucial to identify trustworthy information from multiple noisy information sources, referring to the task of knowledge discovery. At present, the knowledge discovery research for multi-sourced data mainly faces two challenges. On the structural level, it is essential to consider the different characteristics of data composition and application scenarios and define the knowledge discovery problem on different occasions. On the algorithm level, the knowledge discovery task needs to consider different levels of information conflicts and design efficient algorithms to mine more valuable information using multiple clues. Existing knowledge discovery methods have defects on both the structural level and the algorithm level, making the knowledge discovery problem far from totally solved.Table of ContentsChapter 1 Introduction 1.1 Knowledge Discovery 1.2 Main Challenges 1.3 Book Overview Chapter 2 Functional-dependency-based truth discovery for isomorphic data 2.1 Handling independent constraints 2.2 Handling inter-related constraints 2.3 Inter-source data aggregation 2.4 Update source weights Chapter 3 Denial-constraint-based truth discovery for isomorphic data Describe the truth discovery strategies for isomorphic data based on denial constraints 4.1 Denial constraint transformation 4.2 Optimized solution 4.3 Scalable strategies Chapter 4 Pattern discovery for heterogeneous data 4.1 Problem definition for multi-source heterogeneous data 4.2 Optimization framework 4.3 PatternFinder algorithm 4.4 The optimized grouping strategy Chapter 5 Deep fact discovery for text data 5.1 Fact extraction via mining patterns 5.2 The CNN-LSTM architecture 5.3 The fact encoder and pattern embedding 5.4 Training and inference
£999.99
Springer Verlag, Singapore Smart Technologies in Data Science and
Book SynopsisThis book features high-quality, peer-reviewed research papers presented at the Fifth International Conference on Smart Technologies in Data Science and Communication (SMARTDSC 2022), held Koneru Lakshmaiah Education Foundation, Guntur, Andhra Pradesh, India, on 16 – 17 June 2022. It includes innovative and novel contributions in the areas of data analytics, communication and soft computing. Table of ContentsA Graph based model for Discovering Host-based hook Attacks.- E-Health Care Patient Information Retrieval and Monitoring System Using SVM.- Number Plate Recognition using Optical Character Recognition (OCA) and Connected Component Analysis (CCA).- Cartoonify an Image with Open cv using Python.- Web Design as an Important Factor in the Success of a Website.- Earlier Selection of Routes for Data Transfer in both Wired and Wireless Networks.
£999.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.
£999.99
Springer Verlag, Singapore Algorithms and Architectures for Parallel
Book SynopsisThe 7-volume set LNCS 14487-14493 constitutes the proceedings of the 23rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2023, which took place in Tianjin, China, during October, 2023. The 145 full papers included in this book were carefully reviewed and selected from 439 submissions.
£999.99
Springer Verlag, Singapore Algorithms and Architectures for Parallel
Book SynopsisThe 7-volume set LNCS 14487-14493 constitutes the proceedings of the 23rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2023, which took place in Tianjin, China, during October, 2023. The 145 full papers included in this book were carefully reviewed and selected from 439 submissions.
£98.99
Springer Verlag, Singapore Algorithms and Architectures for Parallel
Book SynopsisThe 7-volume set LNCS 14487-14493 constitutes the proceedings of the 23rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2023, which took place in Tianjin, China, during October, 2023. The 145 full papers included in this book were carefully reviewed and selected from 439 submissions.
£61.74
Springer Web and Big Data
Book Synopsis.- Anomaly Detection and Security..- TWLog: Task Workflow-based Log Anomaly Detection..- TS-AUBD: A Novel Two-Stage Method for Abnormal User Behavior Detection..- Multi-Label Out-of-Distribution Detection with Spectral Normalized Joint Energy..- Noisy Label Learning Based on Weighted Neighborhood Consistency..- Information Retrieval..- A New Learning-to-Rank Framework for Keyphrase Extraction using Multi-Scale Ratings and Feature Fusion..- MIIGraph: Multi-Granularity InformationIntegration Graph for Document-Level Event Extraction..- Multi-Granularity Neural Networks for Document-Level Relation Extraction..- Improving Zero-Shot Information Retrieval with Mutual Validation of Generative and Pseudo- Relevance Feedback..- Entity Semantic feature Fusion Network for Remote Sensing Image-Text Retrieval..- Semantic Preservation and Hash Fusion Network for Unsupervised Cross-modal Retrieval..- Machine Learning..- Using High-Quality Feature for Weakly-Supervised Camouflaged Object Detection..- ECHO: Adaptive Correction for Subgraph-wise Sampling with Lightweight Hyperparameter Search..- A Parallel and Distributed Data Management Approach for MEC Using the Improved Parameterized Deep Q-Network..- Clustering based Collaborative Learning Grouping for Knowledge Building..- Unsupervised Feature Selection via Fuzzy K-Means and Sparse Projection..- Open World Semi-Supervised Learning Based on Multi-Scale Enhanced Feature..- ACD: Attention Driven Cognitive Diagnosis for New Learners Joining ITS..- Data Augmentation for Knowledge Tracing based on Variational AutoEncoder and Efficient Network Reusing..- An Epidemic Trend Prediction Model with Multi-Source Auxiliary Data..- Lead-Aware Hierarchical Transformer and Convolution Fusion Network for ECG Classification..- Reinforcement Learning From Clip..- Self supervised contrastive learning combining equivariance and invariance..- Demonstration Paper..- FedPPQs: Optimizing Property Path Queries Evaluation over Federated RDF Systems..- MPCPM: Multi-level Prevalent Co-location Pattern Miner..- FGAQ: Accelerating Graph Analytical Queries Using FPGA..- A Progressive Question Answering Framework Adaptable to Multiple Knowledge Sources..- RocolSys: An Automatic Row-column Data Storage System For HTAP..- MIPC-SHOPs: An Online System for Mining the Influence of Industrial Pollution on Cancer based on the Spatial High-influence Ordered-pair Patterns..- A Perception System for DNS Root Service Status Based on Active and Passive Monitoring..- Dynamic Route Planning System Integrated with Traffic Flow Sensing..- NLITS: A Natural Language Interface for Time Series Databases..- FOICP-Miner: An Interactive Spatial Pattern Recommendation System Based on Fuzzy-Ontology..- SPCCP-Miner: Towards the Discovery of Congested Junctions..- Crowd-OBIGA:A Crowdsourced Approach for Oracle Bone Inscriptions Glyph Annotation..- NexusDB: A Large-Scale Distributed Time-Series Database for Industrial Scenarios..- Industry Paper..- LMStor: Storage acceleration design for large models..- Enhancing Emergency Communications via UAV-Assisted Home-Independent Broadband Mobile Networks..- FPTSF: A Failure Prediction of hard disks based on Time Series Features towards low quality dataset..- PMEMgreSQL: Embracing PostgreSQL with Persistent Memory..- The Development of a TLA+ Verified Correctness Raft Consensus Protocol..- Robust Multi-vehicle Routing with Communication Enhanced Multi-agent Reinforcement Learning for Last-mile Logistics..- A Dual-tower Model for Station-level Electric Vehicle Charging Demand Prediction..- BPGNN-SBR: Behavior Progressive Graph Neural Networks for Session-Based Recommendation..- Exploring Simple Architecture of Just-in-Time Compilation in Databases.
£999.99
Springer Verlag, Singapore Machine Learning Contests: A Guidebook
Book SynopsisThis book systematically introduces the competitions in the field of algorithm and machine learning. The first author of the book has won 5 championships and 5 runner-ups in domestic and international algorithm competitions.Firstly, it takes common competition scenarios as a guide by giving the main processes of using machine learning to solve real-world problems, namely problem modelling, data exploration, feature engineering, model training. And then lists the main points of difficulties, general ideas with solutions in the whole process. Moreover, this book comprehensively covers several common problems in the field of machine learning competitions such as recommendation, temporal prediction, advertising, text computing, etc. The authors, also knew as "competition professionals”, will explain the actual cases in detail and teach you various processes, routines, techniques and strategies, which is a rare treasure book for all competition enthusiasts. It is very suitable for readers who are interested in algorithm competitions and deep learning algorithms in practice, or computer-related majors.Table of ContentsChapter 1 First Sight.- Chapter 2 Problem Modeling.- Chapter 3 Data Exploration.- Chapter 4 Characteristic Engineering.- Chapter 5 Model Training .- Chapter 6 Model Fusion.- Chapter 7 User Portrait.- Chapter 8 Actual Combat Case: Elo Merchant.- Chapter 9 time sequence.- Chapter 10 Practical Cases: Global Urban.- Chapter 11 Practical Case: Corporaci .-Corporación Favorita Grocery Sales Forecasting.- Chapter 12 Computing Advertising.- Chapter 13 Practical Cases: Tencent 2018 Advertising Algorithm Contest-Similarity Crowd Expansion.- Chapter 14: TalkingData AdTracking Fraud Detection Challenge.- Chapter 15 Natural Language Processing.- Chapter 16 Practical Case: Quora Question Pairs.
£44.99
Springer Verlag, Singapore Information and Communications Security: 25th
Book SynopsisThis volume LNCS 14252 constitutes the refereed proceedings of 25th International Conference on Information and Communications Security, ICICS 2023, held in Tianjin, China, during November 18–20, 2023. The 38 full papers presented together with 6 short papers were carefully reviewed and selected from 181 submissions. The conference focuses on: Symmetric-Key Cryptography; Public-Key Cryptography; Applied Cryptography; Authentication and Authorization; Privacy and Anonymity; Security and Privacy of AI; Blockchain and Cryptocurrencies; and System and Network Security. Table of ContentsSymmetric-Key Cryptography.- SAT-aided Differential Cryptanalysis of Lightweight Block Ciphers Midori, MANTIS and QARMA.- Improved Related-Key Rectangle Attack against the Full AES-192.- Block Ciphers Classification Based on Randomness Test Statistic Value via LightGBM.- Cryptanalysis of Two White-Box Implementations of the CLEFIA Block Cipher.- PAE: Towards More Efficient and BBB-secure AE From a Single Public Permutation.- Public-Key Cryptography.- A Polynomial-time Attack on G2SIDH.- Improvements of Homomorphic Secure Evaluation of Inverse Square Root.- Oblivious Transfer from Rerandomizable PKE.- Forward Secure Lattice-based Ring Signature Scheme in the Standard Model.- Applied Cryptography.- Secure Multi-Party Computation with Legally-Enforceable Fairness.- On-demand Allocation of Cryptographic Computing Resource with Load Prediction.- Private Message Franking with After Opening Privacy.- Semi-Honest 2-Party Faithful Truncation from Two-Bit Extraction.- Outsourcing Verifiable Distributed Oblivious Polynomial Evaluation from Threshold Cryptography.- Authentication and Authorization.- PiXi: Password Inspiration by Exploring Information.- Security Analysis of Alignment-Robust Cancelable Biometric Scheme for Iris Verification.- A Certificateless Conditional Anonymous Authentication Scheme for Satellite Internet of Things.- BLAC: A Blockchain-based Lightweight Access Control Scheme in Vehicular Social Networks.- Privacy and Anonymity.- Link Prediction-Based Multi-Identity Recognition of Darknet Vendors.- CryptoMask: Privacy-preserving Face Recognition.- Efficient Private Multiset ID Protocols.- Zoomer: A Website Fingerprinting Attack against Tor Hidden Services.- An Enhanced Privacy-preserving Hierarchical Federated Learning Framework for IoV.- Security and Privacy of AI.- Revisiting the Deep Learning-based Eavesdropping Attacks via Facial Dynamics from VR Motion Sensors.- Multi-scale Features Destructive Universal Adversarial Perturbations.- Pixel-Wise Reconstruction of Private Data in Split Federated Learning.- Neural Network Backdoor Attacks Fully Controlled by Composite Natural Utterance Fragments.- Black-Box Fairness Testing with Shadow Models.- Graph Unlearning using Knowledge Distillation.- AFLOW: Developing Adversarial Examples under Extremely Noise-limited Settings.- Learning to Detect Deepfakes via Adaptive Attention and Constrained Difference.- A Novel Deep Ensemble Framework for Online Signature Verification Using Temporal and Spatial Representation.- Blockchain and Cryptocurrencies.- SCOPE: A Cross-Chain Supervision Scheme for Consortium Blockchains.- Subsidy Bridge: Rewarding Cross-blockchain Relayers with Subsidy.- Towards Efficient and Privacy-Preserving Anomaly Detection of Blockchain-based Cryptocurrency Transactions.- Blockchain based Publicly Auditable Multi-Party Computation with Cheater Detection.- BDTS: Blockchain-based Data Trading System.- Illegal Accounts Detection on Ethereum using Heterogeneous Graph Transformer Networks.- System and Network security.- DRoT: A Decentralised Root of Trust for Trusted Networks.- Finding Missing Security Operation Bugs via Program Slicing and Differential Check.- TimeClave: Oblivious In-enclave Time series Processing System.- Efficient and Appropriate Key Generation Scheme in Different IoT Scenarios.- A Fake News Detection Method Based on A Multimodal Cooperative Attention Network.
£80.74
Amazon Digital Services LLC - Kdp Frequently Asked Coding Interview Algorithms
Book Synopsis
£19.04
Amazon Digital Services LLC - Kdp Python
Book Synopsis
£14.32
Amazon Digital Services LLC - Kdp HTML Desde Cero
Book Synopsis
£14.49
Amazon Digital Services LLC - Kdp React en 48h
Book Synopsis
£10.18
Independently Published Knstliche Intelligenz in der Kreativbranche
Book Synopsis
£13.13
Independently Published Java
Book Synopsis
£14.98
Independently Published Bitwise Algorithms
Book Synopsis
£19.99
Independently Published Die Mutter aller KI Bücher
Book Synopsis
£14.18
Amazon Digital Services LLC - Kdp The Agnostic Trader
Book Synopsis
£21.16