Das Buch enthält eine Einführung in graphentheoretische Grundbegriffe und Basissätze. Graphen werden als Modellierungswerkzeuge für verschiedene Anwendungen aus dem Bereich der Standortplanung, Logistik, Verkehrsplanung, des Scheduling und der Planung von Kommunikationsnetzen vorgestellt. Für die entstehenden graphentheoretischen Probleme werden effiziente Verfahren vorgestellt und rigoros analysiert. Für komplexitätstheoretisch ´´schwierige´´ Probleme enthält das Buch effiziente Näherungsverfahren, die schnell Lösungen mit beweisbarer Güte liefern. Diese Einführung in graphentheoretische Grundbegriffe und Basissätze enthält neben klassischen Resultaten auch neueste Ergebnisse und Themen wie z. B. dynamische Flüsse, die in Lehrbüchern bislang unberücksichtigt blieben. Die Präsentation mit zahlreichen Bildern erleichtert das Verständnis und erhöht für den Leser die Motivation. Zahlreiche Aufgaben mit Lösungen helfen bei der Vertiefung und Einübung des Erlernten. Der Online-Service bietet Ihnen begleitende Materialien wie z. B. JAVA- Applets zum Buch. Der Inhalt Einleitung - Graphentheoretische Grundbegriffe - Wege, Kreise, Zusammenhang - Färbungen und Überdeckungen - Transitive Hülle und irreduzible Kerne - Bäume, Wälder, Matroide - Suchstrategien - Kürzeste Wege - Flüsse und Strömungen - Matchings - Netzwerkdesign und Routing - Planare Graphen - Graphtransformationen - Baumweite Die Zielgruppe Studierende der Mathematik, Informatik und der Wirtschaftswissenschaften an Fachhochschulen und Universitäten Die Autoren Prof. Dr. Sven Oliver Krumke lehrt und forscht an der Technischen Universität Kaiserslautern. Prof. Dr. Hartmut Noltemeier ist Emeritus der Universität Würzburg.
This updated edition offers an indispensable exposition on real-time computing, with particular emphasis on predictable scheduling algorithms. It introduces the fundamental concepts of real-time computing, demonstrates the most significant results in the field, and provides the essential methodologies for designing predictable computing systems used to support time-critical control applications. Along with an in-depth guide to the available approaches for the implementation and analysis of real-time applications, this revised edition contains a close examination of recent developments in real-time systems, including limited preemptive scheduling, resource reservation techniques, overload handling algorithms, and adaptive scheduling techniques. This volume serves as a fundamental advanced-level textbook. Each chapter provides basic concepts, which are followed by algorithms, illustrated with concrete examples, figures and tables. Exercises and solutions are provided to enhance self-study, making this an excellent reference for those interested in real-time computing for designing and/or developing predictable control applications.
This book constitutes the proceedings of the 13th International Symposium on Advanced Parallel Processing Technologies, APPT 2019, held in Tianjin, China, in August 2019. The 11 full papers presented in this volume were carefully reviewed and selected from 35 submissions. The papers are organized in topical sections named: System Support for Neural Networks; Scheduling and File Systems; Optimization and Parallelization; Security and Algorithms.
This book constitutes the refereed proceedings of the 19th International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation, SAMOS 2019, held in Pythagorion, Samos, Greece, in July 2019. The 21 regular papers presented were carefully reviewed and selected from 55 submissions. The papers are organized in topical sections on system design space exploration; deep learning optimization; system security; multi/many-core scheduling; system energy and heat management; many-core communication; and electronic system-level design and verification. In addition there are 13 papers from three special sessions which were organized on topics of current interest: insights from negative results; machine learning implementations; and European projects.
Modern embedded systems require high performance, low cost and low power consumption. Such systems typically consist of a heterogeneous collection of processors, specialized memory subsystems, and partially programmable or fixed-function components. This heterogeneity, coupled with issues such as hardware/software partitioning, mapping, scheduling, etc., leads to a large number of design possibilities, making performance debugging and validation of such systems a difficult problem. Embedded systems are used to control safety critical applications such as flight control, automotive electronics and healthcare monitoring. Clearly, developing reliable software/systems for such applications is of utmost importance. This book describes a host of debugging and verification methods which can help to achieve this goal.
This book teaches test managers advanced skills in test estimation, test planning, test monitoring, and test control. Readers will learn how to define the overall testing goals and strategies for the systems being tested. This hands-on, exercise-rich book provides experience with planning, scheduling, and tracking these tasks. You´ll learn to describe and organize necessary activities, as well as to select, acquire, and assign adequate resources for testing tasks, and how to form, organize, and lead testing teams. You´ll master the organization of communication among team members and between the testing teams, and other stakeholders. Additionally, you´ll learn how to justify decisions and provide adequate reporting information where applicable. With over 30 years of software and systems engineering experience, author Rex Black is President of RBCS, a leader in software, hardware, and systems testing. Rex is the most prolific author practicing in the field of software testing today. He has published a dozen books on testing that have sold tens of thousands of copies worldwide. He is past president of the International Software Testing Qualifications Board (ISTQB) and a director of the American Software Testing Qualifications Board (ASTQB). This second edition has been thoroughly updated to reflect the new ISTQB Advanced Test Manager 2012 Syllabus, and the latest ISTQB Glossary. Rex Black is one of the main participants in the ISTQB Advanced Level Working Group, and his edition reflects his unique insights into these changes. This book will help you prepare for the ISTQB Advanced Test Manager exam. Included are sample exam questions, at the appropriate level of difficulty, for most of the learning objectives covered by the ISTQB Advanced Level Syllabus. The ISTQB certification program is the leading software tester certification program in the world. With about 350,000 certificate holders and a global presence in over 50 countries, you can be confident in the value and international stature that the Advanced Test Manager certificate can offer you.
Docker-Container bieten eine einfache, schnelle und robuste Möglichkeit, Software zu entwickeln, zu verteilen und laufen zu lassen - besonders in dynamischen und verteilten Umgebungen. Mit diesem praktischen Leitfaden lernen Sie, warum Container so wichtig sind, was durch den Einsatz von Docker möglich ist und wie Sie es in Ihren Entwicklungsprozess einbinden. Dieses Buch ist aktuell zu Docker 1.12 und ideal für Entwickler, Operations-Techniker und Administratoren - insbesondere, wenn Sie einen DevOps-Ansatz verfolgen. Es nimmt Sie mit auf eine Reise von den Grundlagen bis zum Ausführen Dutzender Container auf einem Multi-Host-System mit Networking und Scheduling. Im Verlauf des Buches erfahren Sie, welche Schritte zum Entwickeln, Testen und Bereitstellen einer Webanwendung mit Docker notwendig sind. - Beginnen Sie mit Docker, indem Sie eine einfache Webanwendung entwickeln und bereitstellen. - Nutzen Sie Techniken aus dem Continuous Deployment, um Ihre Anwendung mehrmals pro Tag in die Produktivumgebung zu bringen. - Lernen Sie Optionen und Techniken kennen, um mehrere Container gleichzeitig zu protokollieren und zu überwachen. - Befassen Sie sich mit dem Erkennen im Netzwerk und mit Services: Wie finden sich Container gegenseitig und wie verbinden Sie sie? - Orchestrieren und clustern Sie Container, um Load Balancing zu ermöglichen, Ihr System skalierbar zu machen sowie Failovers und Scheduling umzusetzen. - Sichern Sie Ihr System, indem Sie den Prinzipien der ´´Defense in Depth´´ und dem Konzept der geringsten Rechte folgen. - Setzen Sie Container ein, um eine Microservices-Architektur aufzubauen.
August 6, 2009 Author, Jon Kleinberg, was recently cited in the New York Times for his statistical analysis research in the Internet age. Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science. Features + Benefits Focus on problem analysis and design techniques. Discussion is grounded in concrete problems and examples rather than abstract presentation of principles, with representative problems woven throughout the text. Over 200 well crafted problems from companies such as Yahoo!® and Oracle®. Each problem has been class tested for usefulness and accuracy in the authors´ own undergraduate algorithms courses. Broad coverage of algorithms for dealing with NP-hard problems and the application of randomization, increasingly important topics in algorithms. Algorithm Design Jon Kleinberg and Eva Tardos Table of Contents 1 Introduction: Some Representative Problems 1.1 A First Problem: Stable Matching 1.2 Five Representative Problems Solved Exercises Excercises Notes and Further Reading 2 Basics of Algorithms Analysis 2.1 Computational Tractability 2.2 Asymptotic Order of Growth Notation 2.3 Implementing the Stable Matching Algorithm using Lists and Arrays 2.4 A Survey of Common Running Times 2.5 A More Complex Data Structure: Priority Queues Solved Exercises Exercises Notes and Further Reading 3 Graphs 3.1 Basic Definitions and Applications 3.2 Graph Connectivity and Graph Traversal 3.3 Implementing Graph Traversal using Queues and Stacks 3.4 Testing Bipartiteness: An Application of Breadth-First Search 3.5 Connectivity in Directed Graphs 3.6 Directed Acyclic Graphs and Topological Ordering Solved Exercises Exercises Notes and Further Reading 4 Divide and Conquer 4.1 A First Recurrence: The Mergesort Algorithm 4.2 Further Recurrence Relations 4.3 Counting Inversions 4.4 Finding the Closest Pair of Points 4.5 Integer Multiplication 4.6 Convolutions and The Fast Fourier Transform Solved Exercises Exercises Notes and Further Reading 5 Greedy Algorithms 5.1 Interval Scheduling: The Greedy Algorithm Stays Ahead 5.2 Scheduling to Minimize Lateness: An Exchange Argument 5.3 Optimal Caching: A More Complex Exchange Argument 5.4 Shortest Paths in a Graph 5.5 The Minimum Spanning Tree Problem 5.6 Implementing Kruskal´s Algorithm: The Union-Find Data Structure 5.7 Clustering 5.8 Huffman Codes and the Problem of Data Compression *5.9 Minimum-Cost Arborescences: A Multi-Phase Greedy Algorithm Solved Exercises Excercises Notes and Further Reading 6 Dynamic Programming 6.1 Weighted Interval Scheduling: A Recursive Procedure 6.2 Weighted Interval Scheduling: Iterating over Sub-Problems 6.3 Segmented Least Squares: Multi-way Choices 6.4 Subset Sums and Knapsacks: Adding a Variable 6.5 RNA Secondary Structure: Dynamic Programming Over Intervals 6.6 Sequence Alignment 6.7 Sequence Alignment in Linear Space 6.8 Shortest Paths in a Graph 6.9 Shortest Paths and Distance Vector Protocols *6.10 Negative Cycles in a Graph Solved Exercises Exercises Notes and Further Reading 7 Network Flow 7.1 The Maximum Flow Problem and the Ford-Fulkerson Algorithm 7.2 Maximum Flows and Minimum Cuts in a Network 7.3 Choosing Good Augmenting Paths *7.4 The Preflow-Push Maximum Flow Algorithm 7.5 A First Application: The Bipartite Matching Problem 7.6 Disjoint Paths in Directed and Undirected Graphs 7.7 Extensions to the Maximum Flow Problem 7.8 Survey Design 7.9 Airline Scheduling 7.10 Image Segmentation 7.11 Project Selection 7.12 Baseball Elimination *7.13 A Further Direction: Adding Costs to the Matching Problem Solved Exercises Exercises Notes and Further Reading 8 NP and Computational Intractability 8.1 Polynomial-Time Reductions 8.2 Reductions via ´´Gadgets´´: The Satisfiability Problem 8.3 Efficient Certification and the Definition of NP 8.4 NP-Complete Problems 8.5 Sequencing Problems 8.6 Partitioning Problems 8.7 Graph Coloring 8.8 Numerical Problems 8.9 Co-NP and the Asymmetry of NP 8.10 A Partial Taxonomy of Hard Problems Solved Exercises Exercises Notes and Further Reading 9 PSPACE: A Class of Problems Beyond NP 9.1 PSPACE 9.2 Some Hard Problems in PSPACE 9.3 Solving Quantified Problems and Games in Polynomial Space 9.4 Solving the Planning
The first step to project success is accurate estimating and realistic planning. Projects with unrealistic expectations affixed to them are likely to derail at an early stage. This book shows the software practitioner how to effectively estimate and properly plan a project within an agile context. The book´s content is suitable for projects using any agile or semi-agile process (such as Extreme Programming, Scrum, Feature Driven Development, Crystal, Adaptive Software Development, DSDM or even the IBM Rational Unified Process). The ideas in this book will work with any iterative development process, which greatly broadens the target audience beyond the traditional agile community. Each chapter is supported by a summary and a set of questions that allows readers to assess their ability to estimate and plan a project. The result is an engaging read with pearls of wisdom that can be applied to the reader´s next project. Product Description Praise for Agile Estimating and Planning Traditional, deterministic approaches to planning and estimating simply don´t cut it on the slippery slopes of today´s dynamic, change-driven projects. Mike Cohn´s breakthrough book gives us not only the philosophy, but also the guidelines and a proven set of tools that we need to succeed in planning, estimating, and scheduling projects with a high uncertainty factor. At the same time, the author never loses sight of the need to deliver business value to the customer each step of the way. -Doug DeCarlo, author of eXtreme Project Management: Using Leadership, Principles and Tools to Deliver Value in the Face of Volatility (Jossey-Bass, 2004) We know how to build predictive plans and manage them. But building plans that only estimate the future and then embrace change, challenge most of our training and skills. In Agile Estimating and Planning , Mike Cohn once again fills a hole in the Agile practices, this time by showing us a workable approach to Agile estimating and planning. Mike delves into the nooks and crannies of the subject and anticipates many of the questions and nuances of this topic. Students of Agile processes will recognize that this book is truly about agility, bridging many of the practices between Scrum and ExtremeProgramming. -Ken Schwaber, Scrum evangelist, Agile Alliance cofounder, and signatory to the Agile Manifesto In Agile Estimating and Planning , Mike Cohn has, for the first time, brought together most everything that the Agile community has learned about the subject. The book is clear, well organized, and a pleasant and valuable read. It goes into all the necessary detail, and at the same time keeps the reader´s burden low. We can dig in as deeply as we need to, without too much detail before we need it. The book really brings together everything we have learned about Agile estimation and planning over the past decade. It will serve its readers well. -Ron Jeffries, www.XProgramming.com, author of Extreme Programming Installed (Addison-Wesley, 2001) and Extreme Programming Adventures in C# (Microsoft Press, 2004) Agile Estimating and Planning provides a view of planning that´s balanced between theory and practice, and it is supported by enough concrete experiences to lend it credibility. I particularly like the quote ´planning is a quest for value.´ It points to a new, more positive attitude toward planning that goes beyond the ´necessary evil´ view that I sometimes hold. -Kent Beck, author of Extreme Programming Explained, Second Edition (Addison-Wesley, 2005) Up-front planning is still the most critical part of software development. Agile software development requires Agile planning techniques. This book shows you how to employ Agile planning in a succinct, practical, and easy-to-follow manner. -Adam Rogers, Ultimate Software Mike does a great follow-up to User Stories Applied by continuing to provide Agile teams with the practical approaches and techniques to increase agility. In this book, Mike provides time-proven and well-tested methods for being successful with the multiple levels of planning and estimating required by Agile. This book is the first to detail the disciplines of Agile estimating and planning, in ways that rival my 1980 civil engineering texts on CPM Planning and Estimating. -Ryan Martens, President and Founder, Rally Software Development Corporation With insight and clarity, Mike Cohn shows how to effectively produce software of high business value. With Agile estimation and planning, you focus