Computer programming / software engineering Books

Book Synopsis'Artificial intelligence is going to have a massive impact on everyone’s lives... an accessible and sensible read that helps demystify AI' Deborah Meaden, entrepreneur and star of Dragon's Den'Nigel Toon is a visionary leader in the field of artificial intelligence... a must-read' Marc Tremblay, Distinguished Engineer, MicrosoftThose who understand how AI thinks are about to win big.We are used to thinking of computers as being a step up from calculators - very good at storing information, and maybe even at playing a logical game like chess. But up to now they haven't been able to think in ways that are intuitive, or respond to questions as a human might. All that has changed, dramatically, in the past few years.Our search engines are becoming answer engines. Artificial intelligence is already revolutionising sectors from education to healthcare to the creative arts. But how does an AI understand sentiment or context? How does it play and win games that have an almost infinite number of moves? And how can we work with AI to produce insights and innovations that are beyond human capacity, from writing code in an instant to unfolding the elaborate 3D puzzles of proteins?We stand at the brink of a historic change that will disrupt society and at the same time create enormous opportunities for those who understand how AI thinks. Nigel Toon shows how we train AI to train itself, so that it can paint images that have never existed before or converse in any language. In doing so he reveals the strange and fascinating ways that humans think, too, as we learn how to live in a world shared by machine intelligences of our own creation.Trade ReviewFew books are more timely than How AI Thinks, an accessible guide that walks the reader through the technology’s developmental history right back to the days before the computer... This is a fascinating read. -- Simon Hunt * Evening Standard *I believe that AI is going to have a massive impact on everyone’s lives; it’s such a hugely important topic that we can’t just leave it to technologists and governments to think about. Business people, teachers, students and parents - everyone needs to learn more about it. In How AI Thinks, Nigel Toon provides us with an accessible and sensible read that helps demystify AI and lets us all understand more about this incredibly powerful tool. -- Deborah Meaden, entrepreneur and star of Dragon's DenNigel Toon is not only a visionary leader in the field of artificial intelligence, but also a captivating storyteller who takes us on a journey through his own fascinating history and the evolution of our young industry. He has a gift for explaining complex concepts in simple terms, making this book accessible and engaging for anyone interested in AI. He also offers a prescriptive and optimistic view of the future of AI, showing how it can transform our lives and society for the better. This book is a must-read for anyone who wants to understand the past, present and future of artificial intelligence. -- Marc Tremblay PhD, Distinguished Engineer, MicrosoftAn insightful, informative, inspiring book which takes the reader on a journey of discovery, it ultimately paints a hopeful and reasoned vision of how humanity can move on from a position of fear and trepidation, and embrace AI, deriving profound benefit from all it makes possible. Nigel has a skill in taking highly technical content and making AI not just comprehensible, but also engaging. -- Professor Evelyn Welch, Vice-Chancellor and President, University of BristolAs a business leader, it was great to have all the strands that have created AI pulled together. Nigel Toon synthesizes everything so clearly, simply and in such an inspiring way. How AI Thinks delivers the perspective that leaders and politicians need so that they can regulate AI well. -- Sir Andrew MacKenzie, Chairman of Shell

Read more less

Book SynopsisWithout correct timing, there is no safe and reliable embedded software. This book shows how to consider timing early in the development process for embedded systems, how to solve acute timing problems, how to perform timing optimization, and how to address the aspect of timing verification.The book is organized in twelve chapters. The first three cover various basics of microprocessor technologies and the operating systems used therein. The next four chapters cover timing problems both in theory and practice, covering also various timing analysis techniques as well as special issues like multi- and many-core timing. Chapter 8 deals with aspects of timing optimization, followed by chapter 9 that highlights various methodological issues of the actual development process. Chapter 10 presents timing analysis in AUTOSAR in detail, while chapter 11 focuses on safety aspects and timing verification. Finally, chapter 12 provides an outlook on upcoming and future developments in software timing. The number of embedded systems that we encounter in everyday life is growing steadily. At the same time, the complexity of the software is constantly increasing. This book is mainly written for software developers and project leaders in industry. It is enriched by many practical examples mostly from the automotive domain, yet the vast majority of the book is relevant for any embedded software project. This way it is also well-suited as a textbook for academic courses with a strong practical emphasis, e.g. at applied sciences universities.Features and Benefits* Shows how to consider timing in the development process for embedded systems, how to solve timing problems, and how to address timing verification* Enriched by many practical examples mostly from the automotive domain* Mainly written for software developers and project leaders in industryTable of Contents1. General Basics.- 2. Microprocessor Technology Basics.- 3. Operating Systems.- 4. Timing Theory.- 5. Timing Analysis Techniques.- 6. Practical Examples of Timing Problems.- 7. Multi-Core, Many-Core, and Multi-ECU Timing.- 8. Timing Optimization.- 9. Methodology During the Development Process.- 10. AUTOSAR.- 11. Safety and ISO 26262.- 12. Outlook.

Read more less

Book SynopsisThis textbook assumes very little knowledge of programming so whether you have dabbled with a little JavaScript, played with a bit of Python, written Java or have virtually no programming experience at all you will find that it is for you.The first part of the book introduces Kotlin program structures as well as conditional flow of control features such as if and when expressions as well as iteration loops such as for, while and do-while. Subsequent chapters explain how functions are implemented in Kotlin and introduce concepts from functional programming such as higher order functions and curried functions.The second part focusses on object oriented programming techniques, these include classes, inheritance, abstraction and interfaces. The third part presents container data types such as Arrays, and collections including Lists, Sets and Maps and the fourth part considers concurrency and parallelism using Kotlin coroutines. The book concludes with an introduction to Android mobile application development using Kotlin.Clear steps are provided explaining how to set up your environment and get started writing your own Kotlin programs.An important aspect of the book is teaching by example and there are many examples presented throughout the chapters. These examples are supported by a public GitHub repository that provides complete working code as well as sample solutions to the chapter exercises. This helps illustrate how to write well structured, clear, idiomatic Kotlin to build real applications.Table of ContentsIntroduction.- Part 1: Kotlin Programming.- A First Kotlin Program.- Flow of Control.- Number Guessing Game.- Functions in Kotlin.- Higher Order Functions.- Curried Functions.- Part 2: Object Oriented Kotlin.- Kotlin Classes.- Objects and Companion Objects,- Further Kotlin Properties.- Scope and Conditional Functions.- Class Inheritance.- Abstract Classes.- Interfaces, Delegation and Enumerated Types.- Packages.- Nested and Inner Types.- Data Classes.- Sealed and Inline Classes and Typealias.- Operator Overloading.- Error and Exception Handling.- Extension Functions and Properties.- Part 3: Data Containers.- Arrays.- Collections.- Lists.- Sets.- Maps.- Pairs and Triples.- Generic Types.- Functional Programming and Containers.- Part 4: Concurrent Kotlin.- Coroutines.- Coroutine Channel Communications.- Part 5: Android Development.- Android Overview.- Applications and Activities.- Android Layouts and Events.- Android Tic Tac Toe.

Read more less

Book SynopsisThis textbook is about systematic problem solving and systematic reasoning using type-driven design. There are two problem solving techniques that are emphasized throughout the book: divide and conquer and iterative refinement. Divide and conquer is the process by which a large problem is broken into two or more smaller problems that are easier to solve and then the solutions for the smaller pieces are combined to create an answer to the problem. Iterative refinement is the process by which a solution to a problem is gradually made better–like the drafts of an essay. Mastering these techniques are essential to becoming a good problem solver and programmer. The book is divided in five parts. Part I focuses on the basics. It starts with how to write expressions and subsequently leads to decision making and functions as the basis for problem solving. Part II then introduces compound data of finite size, while Part III covers compound data of arbitrary size like e.g. lists, intervals, natural numbers, and binary trees. It also introduces structural recursion, a powerful data-processing strategy that uses divide and conquer to process data whose size is not fixed. Next, Part IV delves into abstraction and shows how to eliminate repetitions in solutions to problems. It also introduces generic programming which is abstraction over the type of data processed. This leads to the realization that functions are data and, perhaps more surprising, that data are functions, which in turn naturally leads to object-oriented programming. Part V introduces distributed programming, i.e., using multiple computers to solve a problem. This book promises that by the end of it readers will have designed and implemented a multiplayer video game that they can play with their friends over the internet. To achieve this, however, there is a lot about problem solving and programming that must be learned first. The game is developed using iterative refinement. The reader learns step-by-step about programming and how to apply new knowledge to develop increasingly better versions of the video game. This way, readers practice modern trends that are likely to be common throughout a professional career and beyond. Table of ContentsPart I: The Basics of Problem Solving with a Computer.- 1. The Science of Problem Solving.- 2. Expressions and Data Types.- 3. The Nature of Functions.- 4. Aliens Attack Version 0.- 5. Making Decisions.- 6. Aliens Attack Version 1.- Part II: Compound Data of Finite Size.- 7. Structures.- 8. Defining Structures.- 9. Aliens Attack Version 2.-10. Structures and Variety.- 1.1 Aliens Attack Version 3.- Part III: Compound Data of Arbitrary Size.- 12. Lists.- 13. List Processing.- 14. Natural Numbers.- 15. Interval Processing.- 16. Aliens Attack Version 4.- 17. Binary Trees.- 18.- Mutually Recursive Data.- 19.- Processing Multiple Inputs of Arbitrary Size.- Part IV: Abstraction.- 20. Functional Abstraction.- 21. Encapsulation.- 22. Lambda Expressions.- 23. Aliens Attack Version 5.- 24. For-Loops and Pattern Matching.- 25. Interfaces and Objects.- Part V: Distributed Programming.- 26. Introduction to Distributed Programming.- 27. Aliens Attack Version 6.- 28. Aliens Attack Version 7.- 29. Aliens Attack Version 8.- Part VI: Epilogue.- 30. Advice for Future Steps.

Read more less

Book SynopsisThis book provides a comprehensive in-depth look into the practical application of AutomationML Edition 2 from an industrial perspective. It is a cookbook for advanced users and describes re-usable pattern solutions for a variety of industrial applications and how to implement it in software. Just to name some: AutomationML modelling of AAS, MTP, SCD, OPC UA, Automation Components, Automation Projects, drive configurations, requirement models, communication systems, electrical interfaces and cables, or semantic integration aspects as eClass integration or handling of semantic heterogeneity. This book guides through the universe of Auto­mationML from industrial perspective. It is written by AutomationML experts that have industrially implemented AutomationML in pattern solutions for a large variety of applications. This book is structured into three major parts. • Part I: software implementation for developers • Part II: re-usable industrial pattern solutions and domain models • Part III: outlook into future AutomationML applications Additional material to the book and more information about AutomationML on the website: https://www.automationml.org/about-automationml/publications/amlbook/

Read more less

Book SynopsisIntroduces students to appropriate use of computer programming within the scientific disciplines using Python. Discusses several common applications of programming and implementation using real world examples and hands on programming exercises. Students learn how to model situations such as image recognition, medical diagnosis, spread of disease, and others. The text could be used by students and lecturers for courses in Python, Numerical Methods, or as a first course in Data Science.

Read more less

Book SynopsisSoftware Project Management (SPM) differs from the Traditional Project Management (PM) approaches in that Software Engineering requires multiple rounds of Software Testing, and Updating in accordance with their Testing results and their customer’s feedback. Thus, SPM introduces unique life cycle processes.This book presents an introduction and a critical analysis of the main Software Project Management Frameworks, and offers the author’s original approach toSPM as developed by him over years of professional and teaching experience in the Academia and the IT/Software Industry. It also provides Executive Summaries of the Project Management and Software Project Management Perspectives offered by the Project Management Institute (PMI), the IEEE-Computer Society (IEEE-CS), and the SCRUM Project Management Bodies such as the SCRUMstudy.

Read more less

Book SynopsisStephen R. Davis fängt von vorn an: Wie arbeitet ein Programm? Wie installiert man die Programmierumgebung und den Compiler? Und was ist das überhaupt? Als nächstes lernen Sie grundlegende Programmiertechniken kennen: Variablendeklaration, Schleifen, Funktionen und anderes mehr. Fünf Kapitel widmen sich den unterschiedlichen Variablentypen, sodass Sie für die berühmten C++-Zeiger gut gerüstet sind. War gar nicht schwer? Es folgt eine Einführung in das objektorientierte Programmieren, und bevor Sie es sich versehen, liegen auch die Vererbung von Klassen, das Überladen von Operatoren und der Ausnahmemechanismus in Ihrer Reichweite. Mit den Programmbeispielen zum Herunterladen können Sie das Gelernte direkt ausprobieren.Table of ContentsÜber den Autor 9 Widmung 10 Einführung 23 Über dieses Buch 23 Törichte Annahmen über den Leser 24 Wie dieses Buch organisiert ist 25 Teil I: Programmieren in C++ – die ersten Schritte 25 Teil II: Ein Programm schreiben: Entscheidungen, Entscheidungen 25 Teil III: Prozedural programmieren 25 Teil IV: Datenstrukturen 25 Teil V: Objektorientierte Programmierung 26 Teil VI: Für Fortgeschrittene 26 Teil VII: Der Top-Ten-Teil 26 Symbole in diesem Buch 26 Wie es weitergeht 27 Teil I Programmieren in C++ – die ersten Schritte 29 Kapitel 1 Was ist ein Programm? 31 Worin unterscheidet sich mein Sohn von einem Computer? 31 Einen »menschlichen Computer« programmieren 33 Den Algorithmus erstellen 33 Die Entwicklung der Reifenwechsel-Sprache 34 Das Programm erstellen 34 Computerprozessoren 38 Computersprachen 38 Höhere Sprachen 40 Die Sprache C++ 40 Kapitel 2 Code::Blocks installieren 43 Der Kompilierungsvorgang 43 Code::Blocks installieren 45 Installation unter Windows 45 Installation unter Ubuntu Linux 48 Installation unter Mac OS 50 Code::Blocks einrichten 54 Die Code::Blocks-Installation testen 57 Das Projekt anlegen 57 Ihr Standardprojekt testen 62 Kapitel 3 Ihr erstes Programm 65 Ein neues Projekt anlegen 65 Dateinamenerweiterungen 67 Die Eingabe Ihres Programms 69 Das Programm erstellen 71 Was alles schiefgehen kann 71 Falsch geschriebene Befehle 71 Fehlendes Semikolon 73 Die Beispieldateien verwenden 74 Das Programm ausführen 75 Wie das Programm funktioniert 75 Die Vorlage 76 Das Conversion-Programm 77 Teil II Ein Programm schreiben: Entscheidungen, Entscheidungen 79 Kapitel 4 Integer-Ausdrücke – für ganze Zahlen 81 Variablen deklarieren 81 Variablennamen 82 Einer Variablen einen Wert zuweisen 83 Eine Variable bei der Deklaration initialisieren 83 Ganzzahlige Konstanten 84 Ausdrücke 85 Binäre Operatoren 86 Zusammengesetzte Ausdrücke auflösen 87 Unäre Operatoren 88 Die speziellen Zuweisungsoperatoren 90 Kapitel 5 Zeichenausdrücke 93 Character-Variablen definieren 93 Zeichen codieren 93 Beispiel für die Zeichencodierung 96 Zeichenketten codieren 98 Sonderzeichen-Konstanten 98 Kapitel 6 Entscheidungen, Entscheidungen! 101 Die if-Anweisung 101 Vergleichsoperatoren 102 Geschweifte Klammern sind kein Luxus 104 Und andernfalls? 106 Verschachtelte if-Anweisungen 108 Zusammengesetzte bedingte Ausdrücke 111 Kapitel 7 Ausführungspfade wechseln 113 Mit der switch-Anweisung den Programmablauf steuern 113 Durchgerasselt: Habe ich es kaputtgemacht? 116 Implementierung eines einfachen Taschenrechners mit der switch-Anweisung 117 Kapitel 8 Programme debuggen, Teil I 121 Fehlertypen identifizieren 121 Fehler vermeiden 122 Codieren mit Stil 122 Namenskonventionen für Variablen festlegen 123 Den ersten Fehler finden – mit ein bisschen Unterstützung 124 Den Laufzeitfehler finden 125 Testdaten formulieren 125 Tests durchführen 126 Sehen wir nach, was das Programm macht 126 Teil III Prozedural programmieren 129 Kapitel 9 while – ein ewiger Kreislauf 131 while-Schleifen 131 Aus einer Schleife ausbrechen 134 Verschachtelte Schleifen 137 Kapitel 10 Weiter mit for-Schleifen 143 Die vier Teile jeder Schleife 143 Wir betrachten ein Beispiel 145 Mit dem Komma-Operator mehr erledigen 146 Kapitel 11 Funktionen 151 Aufgaben in Funktionen zerlegen 151 Die Arbeitsweise von Funktionen verstehen 152 Eine Funktion schreiben und verwenden 153 Dinge zurückgeben 154 Ein Beispiel 155 An Funktionen Argumente übergeben 158 Funktion mit Argumenten 158 Funktionen mit mehreren Argumenten 160 main() 161 Funktionsprototyp-Deklarationen definieren 161 Kapitel 12 Programme in Module unterteilen 165 Programme aufsplitten 165 Teilen ist gar nicht so schwer 166 Factorial.cpp erstellen 166 Eine #include-Datei erstellen 169 #include-Dateien einbinden 171 main.cpp erstellen 172 Das Ergebnis erstellen 174 Verwendung der C++-Standardbibliothek 174 Gültigkeitsbereiche von Variablen 175 Kapitel 13 Programme debuggen, Teil 2 177 Debugging eines Programms mit Rechenschwäche 177 Einheitentests durchführen 179 Eine Funktion für Tests ausstatten 180 Zurück zum Einheitentest 184 Teil IV Datenstrukturen 187 Kapitel 14 Andere numerische Variablentypen 189 Die Grenzen von Integern in C++ 189 Integer-Abrundung 189 Begrenzter Wertebereich 190 Ein »doppelter« Typ für reelle Zahlen 191 Eine Lösung für das Abrundungsproblem 191 Wenn ein Integer kein Integer ist 192 Die Grenzen eines double erkennen 193 Variablengröße – die lange und die kurze Form 195 Wie weit reichen Zahlen? 197 Konstantentypen 198 Funktionen unterschiedliche Typen übergeben 199 Funktionsnamen überladen 199 Gemischtes Überladen 200 Kapitel 15 Arrays 203 Was ist ein Array? 203 Ein Array deklarieren 204 Array-Elemente über einen Index ansprechen 204 Ein Beispiel 206 Ein Array initialisieren 208 Kapitel 16 Arrays mit Charakter 211 Das ASCII-Zero-Character-Array 211 Ein ASCIIZ-Array deklarieren und initialisieren 212 Ein Beispiel 213 Ein detaillierteres Beispiel 215 Hackerabwehr 218 Muss ich das wirklich alles machen? 220 Kapitel 17 Zeiger in C++ 223 Was ist ein Zeiger? 223 Einen Zeiger deklarieren 224 Einer Funktion Argumente übergeben 226 Argumente als Wert übergeben 226 Argumente als Referenz übergeben 229 Das große Ganze 231 Typen von Referenzargumenten 233 Speicherstapel 233 Brauchen Sie wirklich ein neues Schlüsselwort? 234 Vergessen Sie nicht, zum Schluss wieder aufzuräumen! 235 Ein Beispiel 236 Kapitel 18 C++-Zeiger – auf den zweiten Blick 239 Zeiger und Arrays 239 Operationen für Zeiger 239 Zeiger-Addition im Vergleich zur Indizierung eines Arrays 242 Der Inkrementoperator für Zeiger 244 Warum plagen wir uns mit Array-Zeigern? 247 Operationen für verschiedene Zeigertypen 248 Die Sache mit den Konstanten 248 Unterschiede zwischen Zeigern und Arrays 249 Meine Argumente von main() 250 Zeigerarrays 250 Arrays mit Argumenten 251 Kapitel 19 Programmieren mit Klasse 259 Daten gruppieren 259 Die Klasse 260 Das Objekt 261 Arrays von Objekten 262 Ein Beispiel 263 Kapitel 20 Programme debuggen, Teil 3 271 Ein neuer Ansatz für das Debugging 271 Die Lösung 272 Debuggen Schritt für Schritt 272 Den Debugger starten 275 Navigation durch ein Programm mit dem Debugger 278 Den (ersten) Fehler korrigieren 282 Den zweiten Fehler finden und korrigieren 284 Teil V Objektorientierte Programmierung 287 Kapitel 21 Was ist objektorientierte Programmierung? 289 Abstraktion und Mikrowellenöfen 289 Prozedurale Nachos 290 Objektorientierte Nachos 291 Klassifizierung und Mikrowellenöfen 291 Warum sollten wir Objekte auf diese Weise aufbauen? 292 Abgeschlossene Klassen 293 Kapitel 22 Strukturiertes Spiel: Wie Klassen Dinge erledigen 295 Unsere Objekte aktivieren 295 Eine Elementfunktion erstellen 296 Eine Elementfunktion definieren 297 Namen für Klassenelemente 298 Aufruf einer Elementfunktion 299 Zugriff auf andere Elemente von einer Elementfunktion aus 300 Eine Elementfunktion hinter der Klasse halten 301 Elementfunktionen überladen 302 Kapitel 23 Zeiger auf Objekte 305 Zeiger auf Objekte 305 Pfeilsyntax 306 Aufruf aller Elementfunktionen 306 Funktionen Objekte übergeben 307 Aufruf einer Funktion mit einem Objektwert 307 Aufruf einer Funktion mit einem Objektzeiger 309 Ein Beispiel 310 Objekte auf dem Stapel reservieren 314 Kapitel 24 Bitte nicht stören: Geschützte Elemente 317 Elemente schützen 317 Warum Sie geschützte Elemente brauchen 317 Elemente schützen 318 Also? 321 Ein Freund, ein guter Freund . . . 322 Kapitel 25 Objekten einen guten Start verschaffen 325 Der Konstruktor 325 Einschränkungen von Konstruktoren 327 Kann ich ein Beispiel sehen? 327 Datenelemente konstruieren 330 Destruktoren 333 Ein Beispiel 334 Datenelemente zerstören 337 Kapitel 26 Konstruktive Argumente 341 Konstruktoren mit Argumenten 341 Ein Beispiel 342 Den Konstruktor überladen 346 Der Standard-Standardkonstruktor 350 Datenelemente konstruieren 352 Datenelemente mit dem Standardkonstruktor initialisieren 352 Datenelemente mit einem anderen Konstruktor initialisieren 354 Ein Beispiel 357 Neu in C++ 2011 360 Kapitel 27 Kopieren mit dem Copy-Konstruktor 361 Ein Objekt kopieren 361 Der Standard-Copy-Konstruktor 362 Ein Beispiel 363 Einen Copy-Konstruktor erstellen 366 Kopien vermeiden 369 Teil VI Für Fortgeschrittene 371 Kapitel 28 Eine Klasse vererben 373 Vorteile der Vererbung 373 Die Sprachbesonderheiten 374 Vererbung in C++ implementieren 375 Ein Beispiel 376 Eine HAT_EIN-Beziehung 380 Kapitel 29 Virtuelle Funktionen – Realität? 383 Elementfunktionen überschreiben 383 Frühes Binden 384 Mehrdeutiger Fall 386 Eine späte Bindung eingehen 388 Wann nicht virtuell? 391 Virtuelle Aspekte 393 Kapitel 30 Zuweisungsoperatoren überladen 397 Einen Operator überladen 397 Das Überladen des Zuweisungsoperators ist kritisch 398 Ein Beispiel 400 Ihren Eigenen schreiben (oder nicht) 403 Kapitel 31 Stream-I/O 405 Wie Stream-I/O funktioniert 405 Stream-Eingabe/Ausgabe 407 Ein Eingabe-Objekt erstellen 407 Ein Ausgabe-Objekt erstellen 408 Öffnen-Modi 409 Was ist der Binärmodus? 410 Und in welchem Status ist eine Datei? 410 Weitere Elementfunktionen der fstream-Klassen 415 Streams direkt lesen und schreiben 415 Formatsteuerung 419 Und was macht eigentlich endl? 422 Manipulatoren manipulieren 422 Die stringstream-Klassen 423 Kapitel 32 Machen wir eine Ausnahme! 429 Der Ausnahmemechanismus 429 Betrachten wir den Ausnahmemechanismus im Detail! 432 Spezielle Aspekte für das Aufwerfen von Ausnahmen 433 Eine benutzerdefinierte Ausnahmeklasse erstellen 433 Einschränkungen von Ausnahmeklassen 437 Teil VII Der Top-Ten-Teil 439 Kapitel 33 Zehn Methoden, Fehler zu vermeiden 441 Aktivieren Sie alle Warnungen und Fehlermeldungen! 441 Gewöhnen Sie sich einen klaren und konsistenten Programmierstil an! 442 Kommentieren Sie den Code, während Sie ihn schreiben! 442 Durchlaufen Sie jeden Pfad mindestens einmal im Einzelschrittmodus im Debugger! 443 Begrenzen Sie die Sichtbarkeit! 443 Verwalten Sie Ihren Stapel! 444 Überschreiben Sie Zeiger mit 0, nachdem Sie gelöscht haben, worauf sie zeigen! 444 Verarbeiten Sie Fehler mit Ausnahmen! 445 Deklarieren Sie Destruktoren als virtuell! 445 Stellen Sie einen Copy-Konstruktor und einen überladenen Zuweisungsoperator bereit! 445 Kapitel 34 Zehn Dinge, die in diesem Buch nicht abgedeckt sind 447 Der goto-Befehl 447 Der ternäre Operator 448 Binäre Logik 448 Aufzählungstypen 448 Namensräume 449 Rein virtuelle Funktionen 449 Die string-Klasse 450 Mehrfachvererbung 450 Templates und die Standard Template Library 450 Lambda-Funktionen 451 Stichwortverzeichnis 453

Read more less

Book SynopsisWenn Sie R von Grund auf kennenlernen und auch die fortgeschrittenen Techniken zur Lösung gängiger Aufgaben bei der Datenanalyse mit R beherrschen möchten, dann liegen Sie mit diesem Buch goldrichtig. Es bietet Ihnen nicht nur einen Überblick über die Programmierung in R und die Arbeit mit der Sprache, sondern geht auch auf die Arten von Projekten und Anwendungen ein, die R-Entwicklerinnen und -Entwickler häufig in Angriff nehmen müssen. Statistische Analysen, Datenvisualisierungen, maschinelles Lernen und Datenmanagement mit R: All das lernen Sie mit diesem Buch intensiv kennen.Table of ContentsEinführung 31 Teil I: Eine Einführung in R 35 Kapitel 1: R – Was es macht und wie es dies macht 37 Kapitel 2: Mit Packages arbeiten, Importieren und Exportieren 65 Teil II: Daten beschreiben 79 Kapitel 3: Grafik 81 Kapitel 4: Finden Sie Ihre Mitte! 119 Kapitel 5: Weg vom Durchschnitt 129 Kapitel 6: Standards und Ränge 137 Kapitel 7: Eine Zusammenfassung des Ganzen 147 Kapitel 8: Was ist normal? 165 Teil III: Daten analysieren 183 Kapitel 9: Ein Spiel mit dem Vertrauen: Schätzung 185 Kapitel 10: Hypothesentests mit einer Stichprobe 201 Kapitel 11: Hypothesentests mit zwei Stichproben 227 Kapitel 12: Tests von mehr als zwei Stichproben 253 Kapitel 13: Kompliziertere Tests 277 Kapitel 14: Regression: Lineare und multiple und das allgemeine lineare Modell 297 Kapitel 15: Korrelation: Aufstieg und Fall von Beziehungen 331 Kapitel 16: Kurvilineare Regression: Wenn Beziehungen kompliziert werden 351 Kapitel 17: Zu gegebener Zeit 375 Kapitel 18: Nichtparametrische Statistik 387 Kapitel 19: Einführung in die Wahrscheinlichkeitsrechnung 407 Kapitel 20: Wahrscheinlichkeit trifft auf Regression: Logistische Regression 427 Teil IV: Aus Daten lernen 435 Kapitel 21: Tools und Daten für Projekte zum maschinellen Lernen 437 Kapitel 22: Entscheidungen, Entscheidungen! 463 Kapitel 23: In den Wald – per Zufall 481 Kapitel 24: Unterstützen Sie Ihren lokalen Vektor 497 Kapitel 25: k-Means-Clustering 517 Kapitel 26: Neuronale Netze 533 Kapitel 27: Datenerforschung im Marketing 549 Kapitel 28: Aus der Stadt, die niemals schläft 567 Teil V: R in der Praxis: Einige Projekte, die Sie auf Trab halten 583 Kapitel 29: Mit einem Browser arbeiten 585 Kapitel 30: Dashboards verwenden 613 Abbildungsverzeichnis 647 Stichwortverzeichnis 657

Read more less

Book SynopsisOriginally published in 1981, this was the first textbook on programming in the Prolog language and is still the definitive introductory text on Prolog. Though many Prolog textbooks have been published since, this one has withstood the test of time because of its comprehensiveness, tutorial approach, and emphasis on general programming applications. Prolog has continued to attract a great deal of interest in the computer science community, and has turned out to be a basis for an important new generation of programming languages and systems for Artificial Intelligence. Since the previous edition of Programming in Prolog, the language has been standardised by the International Organization for Standardization (ISO) and this book has been updated accordingly. The authors have also introduced some new material, clarified some explanations, corrected a number of minor errors, and removed appendices about Prolog systems that are now obsolete.Trade ReviewFrom the reviews of the fifth edition: "This is the fifth and the most recent edition of a legendary book … . It was probably the first introductory Prolog book and it is still the most gentle introduction to Prolog for everyone, including non-computer scientists. … the book is as great as ever as an introductory text for Prolog. When a newbie asks for an introduction to Prolog, the best advice is still Clocksin & Mellish." (Bart Demoen, TLP-Theory and Practice of Logic Programming, Vol. 5 (3), 2005)Table of Contents1 Tutorial Introduction.- Gives the student a feel for what it is like to program in Prolog. Introduces objects, relationships, facts, rules, variables.- 1.1 Prolog.- 1.2 Objects and Relationships.- 1.3 Programming.- 1.4 Facts.- 1.5 Questions.- 1.6 Variables.- 1.7 Conjunctions.- 1.8 Rules.- 1.9 Summary and Exercises.- 2 A Closer Look.- More detailed presentation of Prolog syntax and data structures.- 2.1 Syntax.- 2.1.1 Constants.- 2.1.2 Variables.- 2.1.3 Structures.- 2.2 Characters.- 2.3 Operators.- 2.4 Equality and Unification.- 2.5 Arithmetic.- 2.6 Summary of Satisfying Goals.- 2.6.1 Successful satisfaction of a conjunction of goals.- 2.6.2 Consideration of goals in backtracking.- 2.6.3 Unification.- 3 Using Data Structures.- Representing objects and relationships by using trees and lists. Developing several standard Prolog programming techniques.- 3.1 Structures and Trees.- 3.2 Lists.- 3.3 Recursive Search.- 3.4 Mapping.- 3.5 Recursive Comparison.- 3.6 Joining Structures Together.- 3.7 Accumulators.- 3.8 Difference Structures.- 4 Backtracking and the “Cut”.- How a set of clauses generates a set of solutions. Using “cut” to modify the control sequence of running Prolog programs.- 4.1 Generating Multiple Solutions.- 4.2 The “Cut”.- 4.3 Common Uses of the Cut.- 4.3.1 Confirming the Choice of a Rule.- 4.3.2 The “cut-fail” Combination.- 4.3.3 Terminating a “generate and test”.- 4.4 Problems with the Cut.- 5 Input and Output.- Facilities available for the input and output of characters and structures. Developing a program to read sentences from the user and represent the structure as a list of words, which can be used with the Grammar Rules of Chapter.- 5.1 Reading and Writing Terms.- 5.1.1 Reading Terms.- 5.1.2 Writing Terms.- 5.2 Reading and Writing Characters.- 5.2.1 Reading Characters.- 5.2.2 Writing Characters.- 5.3 Reading English Sentences.- 5.4 Reading and Writing Files.- 5.4.1 Opening and closing streams.- 5.4.2 Changing the current input and output.- 5.4.3 Consulting.- 5.5 DeclaringOperators.- 6 Built-in Predicates.- Definition of the “core” built-in predicates, with sensible examples of how each one is used. By this point, the reader should be able to read reasonably complex programs, and should therefore be able to absorb the built-in predicates by seeing them in use.- 6.1 EnteringNew Clauses.- 6.2 Success and Failure.- 6.3 Classifying Terms.- 6.4 Treating Clauses as Terms.- 6.5 Constructing and Accessing Components of Structures.- 6.6 Affecting Backtracking.- 6.7 Constructing Compound Goals.- 6.8 Equality.- 6.9 Input and Output.- 6.10 Handling Files.- 6.11 Evaluating Arithmetic Expressions.- 6.12 Comparing Terms.- 6.13 Watching Prolog atWork.- 7 More Example Programs.- Many example programs are given, covering a wide range of interests. Examples include list processing, set operations, symbolic differentiation and simplification of formula.- 7.1 A Sorted Tree Dictionary.- 7.2 Searching a Maze.- 7.3 The Towers of Hanoi.- 7.4 Parts Inventory.- 7.5 List Processing.- 7.6 Representing andManipulating Sets.- 7.7 Sorting.- 7.8 Using the Database.- 7.8.1 Random.- 7.8.2 Gensym.- 7.8.3 Findall.- 7.9 SearchingGraphs.- 7.10 Sift the Two’s and Sift the Three’s.- 7.11 Symbolic Differentiation.- 7.12 Mapping Structures and Transforming Trees.- 7.13 Manipulating Programs.- 7.14 Bibliographic Notes.- 8 Debugging Prolog Programs.- By this point, the reader will be able to write reasonable programs, and so the problem of debugging will be relevant. Flow of control model, hints about common bugs, techniques of debugging..- 8.1 Laying out Programs.- 8.2 Common Errors.- 8.3 The Tracing Model.- 8.4 Tracing and Spy Points.- 8.4.1 Examining the Goal.- 8.4.2 Examining the Ancestors.- 8.4.3 Altering the Degree of Tracing.- 8.4.4 Altering the Satisfaction of the Goal.- 8.4.5 Other Options.- 8.4.6 Summary.- 8.5 Fixing Bugs.- 9 Using Prolog Grammar Rules.- Applications of existing techniques. Using Grammar Rules. Examining the design decisions for some aspects of analysing natural language with Grammar Rules.- 9.1 The Parsing Problem.- 9.2 Representing the Parsing Problemin Prolog.- 9.3 The Grammar Rule Notation.- 9.4 Adding ExtraArguments.- 9.5 Adding Extra Tests.- 9.6 Summary.- 9.7 Translating Language into Logic.- 9.8 More General Use of Grammar Rules.- 10 The Relation of Prolog to Logic.- Predicate Calculus, clausal form, resolution theorem proving, logic programming.- 10.1 Brief Introduction to Predicate Calculus.- 10.2 Clausal Form.- 10.3 A Notation for Clauses.- 10.4 Resolution and Proving Theorems.- 10.5 Horn Clauses.- 10.6 Prolog.- 10.7 Prolog and Logic Programming.- 11 Projects in Prolog.- A selection of suggested exercises, projects and problems.- 11.1 Easier Projects.- 11.2 Advanced Projects.- A Answers to Selected Exercises.- B Clausal Form Program Listings.- C Writing Portable Standard Prolog Programs.- The Prolog standard, writing portable programs and dealing with different Prolog implementations.- C.1 Standard Prolog for Portability.- C.2 Different Prolog Implementations.- C.3 Issues to LookOut For.- C.4 Definitions of some Standard Predicates.- C.4.1 Character Processing.- C.4.2 Directives.- C.4.3 Stream Input/Output.- C.4.4 Miscellaneous.- D CodetoSupport DCGs.- D.1 DCG Support Code.

Read more less

Book SynopsisNo pleasure lasts long unless there is variety in it. Publilius Syrus, Moral Sayings We've been very fortunate to receive fantastic feedback from our readers during the last four years, since the first edition of How to Solve It: Modern Heuristics was published in 1999. It's heartening to know that so many people appreciated the book and, even more importantly, were using the book to help them solve their problems. One professor, who published a review of the book, said that his students had given the best course reviews he'd seen in 15 years when using our text. There can be hardly any better praise, except to add that one of the book reviews published in a SIAM journal received the best review award as well. We greatly appreciate your kind words and personal comments that you sent, including the few cases where you found some typographical or other errors. Thank you all for this wonderful support.Table of ContentsI What Are the Ages of My Three Sons?.- 1 Why Are Some Problems Difficult to Solve?.- II How Important Is a Model?.- 2 Basic Concepts.- III What Are the Prices in 7–11?.- 3 Traditional Methods — Part 1.- IV What Are the Numbers?.- 4 Traditional Methods — Part 2.- V What’s the Color of the Bear?.- 5 Escaping Local Optima.- VI How Good Is Your Intuition?.- 6 An Evolutionary Approach.- VII One of These Things Is Not Like the Others.- 7 Designing Evolutionary Algorithms.- VIII What Is the Shortest Way?.- 8 The Traveling Salesman Problem.- IX Who Owns the Zebra?.- 9 Constraint-Handling Techniques.- X Can You Tune to the Problem?.- 10 Tuning the Algorithm to the Problem.- XI Can You Mate in Two Moves?.- 11 Time-Varying Environments and Noise.- XII Day of the Week of January 1st.- 12 Neural Networks.- XIII What Was the Length of the Rope?.- 13 Fuzzy Systems.- XIV Everything Depends on Something Else.- 14 Coevolutionary Systems.- XV Who’s Taller?.- 15 Multicriteria Decision-Making.- XVI Do You Like Simple Solutions?.- 16 Hybrid Systems.- 17 Summary.- Appendix A: Probability and Statistics.- A.1 Basic concepts of probability.- A.2 Random variables.- A.2.1 Discrete random variables.- A.2.2 Continuous random variables.- A.3 Descriptive statistics of random variables.- A.4 Limit theorems and inequalities.- A.5 Adding random variables.- A.6 Generating random numbers on a computer.- A.7 Estimation.- A.8 Statistical hypothesis testing.- A.9 Linear regression.- A.10 Summary.- Appendix B: Problems and Projects.- B.1 Trying some practical problems.- B.2 Reporting computational experiments with heuristic methods.- References.

Read more less

Book SynopsisThe workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA’95 in Hagen, Germany, CCA’96 in Trier, Germany, and CCA’98 in Brno, Czech Republic. About 40 participants from the countries United Kingdom, Germany, Japan, Italy, Russia, France, Denmark, Greece, and Ireland contributed to the success of this meeting. Altogether, 28 talkswere p- sented in Swansea. These proceedings include 23 papers which represent a cro- section through recent research on computability and complexity in analysis. The workshop succeeded in bringing together people interested in computability and complexity aspects of analysis and in exploring connections with nume- cal methods, physics and, of course, computer science. It was rounded o by a number of talks and papers on exact computer arithmetic and by a competition of v e implemented systems. A report on this competition has been included in these proceedings. We would like to thank the authors for their contributions and the referees for their careful work, and we hope for further inspiring and constructive meetings of the same kind. April 2001 Jens Blanck Vasco Brattka Peter Hertling Organization CCA2000was hosted by the Department of Computer Science of the University of Wales Swansea and took place on September 17{19, 2000.Table of ContentsComputability and Complexity in Analysis.- Effectivity of Regular Spaces.- The Degree of Unsolvability of a Real Number.- A Survey of Exact Arithmetic Implementations.- Standard Representations of Effective Metric Spaces.- Banach-Mazur Computable Functions on Metric Spaces.- A Generic Root Operation for Exact Real Arithmetic.- Effective Contraction Theorem and Its Application.- Polynomially Time Computable Functions over p-Adic Fields.- On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems.- Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory.- Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations.- ?-Approximable Functions.- Computabilities of Fine-Continuous Functions.- The iRRAM: Exact Arithmetic in C++.- The Uniformity Conjecture.- Admissible Representations of Limit Spaces.- Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions.- Effective Fixed Point Theorem over a Non-Computably Separable Metric Space.- Computational Dimension of Topological Spaces.- Some Properties of the Effective Uniform Topological Space.- On Computable Metric Spaces Tietze-Urysohn Extension Is Computable.- Is the Linear Schrödinger Propagator Turing Computable?.- A Computable Spectral Theorem.- Report on Competition.- Exact Real Arithmetic Systems: Results of Competition.

Read more less

Book SynopsisAlgorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech­ nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design of algorithms for hard computing tasks, and that systematically explains, combines, and compares the main possibilities for attacking hard algorithmic problems. As this topic is fundamental for computer science, this book tries to close this gap. Another motivation, and probably the main reason for writing this book, is connected to education. The considered area has developed very dynami­ cally in recent years and the research on this topic discovered several profound results, new concepts, and new methods. Some of the achieved contributions are so fundamental that one can speak about paradigms which should be in­ cluded in the education of every computer science student. Unfortunately, this is very far from reality. This is because these paradigms are not sufficiently known in the computer science community, and so they are insufficiently com­ municated to students and practitioners.Table of Contents1 Introduction.- 2 Elementary Fundamentals.- 3 Deterministic Approaches.- 4 Approximation Algorithms.- 5 Randomized Algorithms.- 6 Heuristics.- 7 A Guide to Solving Hard Problems.- References.

Read more less

Book SynopsisWithout a doubt the idea of object-oriented programming has brought some motion into the field of programming methodology and enlarged the set of programming languages. Object-oriented programming is nothing new-it first arose in the sixties. The motivation came from the simulation of discrete event systems. The concept first manifested itself in the language Simula 67. It took nearly two decades for the method to gain impetus, and today object-oriented programming is an important concept and a powerful technique. Meanwhile, we can even speak of an over­ reaction, for the concept has become a buzzword. But buzzwords always appear where there is the hope of exploiting ill-informed clients because they see the new approach as the solution to all their problems. Thus object-oriented programming is often hailed as a panacea. And so the question is justified: What is really behind it? To let the cat out of the bag: There is more to object-oriented programming than merely putting data as objects in the fore­ ground, instead of algorithms to which the data are subject. It is more than purely an alternative view of programmed systems. To identify the essence of object-oriented programming, is the subject of this book. This is a textbook that shows in a didactically skillful way which concepts and constructs are new, where they can be employed reasonably, and what advantages they offer. For, not all programs are automatically improved by merely recasting them in an object-oriented style.Table of Contents1 Overview.- 1.1 Procedure-Oriented Thinking.- 1.2 Object-Oriented Thinking.- 1.3 Object-Oriented Languages.- 1.4 How OOP Differs from Conventional Programming.- 1.5 Classes as Abstraction Mechanisms.- 1.6 History of Object-Oriented Languages.- 1.7 Summary.- 2 Oberon-2.- 2.1 Features of Oberon-2.- 2.2 Declarations.- 2.3 Expressions.- 2.4 Statements.- 2.5 Procedures.- 2.6 Modules.- 2.7 Commands.- 3 Data Abstraction.- 3.1 Concrete Data Structures.- 3.2 Abstract Data Structures.- 3.3 Abstract Data Types.- 4 Classes.- 4.1 Methods.- 4.2 Classes and Modules.- 4.3 Examples.- 4.4 Common Questions.- 5 Inheritance.- 5.1 Type Extension.- 5.2 Compatibility of a Base Type and its Extension.- 5.3 Static and Dynamic Type.- 5.4 Run-Time Type Checking.- 5.5 Extensibility in an Object-Oriented Sense.- 5.6 Common Questions.- 6 Dynamic Binding.- 6.1 Messages.- 6.2 Abstract Classes.- 6.3 Examples.- 6.4 Message Records.- 6.5 Common Questions.- 7 Typical Applications.- 7.1 Abstract Data Types.- 7.2 Generic Components.- 7.3 Heterogeneous Data Structures.- 7.4 Replaceable Behavior.- 7.5 Adaptable Components.- 7.6 Semifinished Products.- 7.7 Summary.- 8 Useful Techniques.- 8.1 Initialization of Objects.- 8.2 Extending a System at Run Time.- 8.3 Persistent Objects.- 8.4 Wrapping Classes in Other Classes.- 8.5 Extensibility in Multiple Dimensions.- 8.6 Multiple Inheritance.- 8.7 Models and Views.- 8.8 Iterators.- 8.9 Modifying Inherited Methods.- 9 Object-Oriented Design.- 9.1 Functional Design.- 9.2 Object-Oriented Design.- 9.3 Identifying the Classes.- 9.4 Designing the Interface of a Class.- 9.5 Abstract Classes.- 9.6 Relationships between Classes.- 9.7 When to Use Classes.- 9.8 Common Design Errors.- 10 Frameworks.- 10.1 Subsystems and Frameworks.- 10.2 The MVC Framework.- 10.3 A Framework for Objects in Texts.- 10.4 Application Frameworks.- 11 Oberon0 — A Case Study.- 11.1 The Viewer System.- 11.2 Handling User Input.- 11.3 A Text Editor.- 11.4 A Graphics Editor.- 11.5 Embedding Graphics in Texts.- 12 Costs and Benefits of OOP.- 12.1 Benefits.- 12.2 Costs.- 12.3 The Future.- A Oberon-2 — Language Definition.- A.1 Introduction.- A.2 Syntax.- A.3 Vocabulary and Representation.- A.4 Declarations and Scope Rules.- A.5 Constant Declarations.- A.6 Type Declarations.- A.7 Variable Declarations.- A.8 Expressions.- A.9 Statements.- A.10 Procedure Declarations.- A.11 Modules.- A.12 Appendices to the Language Definition.- B The Module OS.- C The Module IO.- D How to Get Oberon.

Read more less

Book SynopsisThis volume contains the papers selected after a very careful refereeing process for presentation during the Workshop on Job Scheduling Stategies for Parallel Processing, held in Santa Barbara, California, as a prelude to the IPPS '95 conference in April 1995.The 19 full papers presented demonstrate that parallel job scheduling takes on a crucial role as multi-user parallel supercomputers become more widespread. All aspects of job scheduling for parallel systems are covered, from the perspectives of academic research, industrial design of parallel systems, as well as user needs. Of particular interest, also for nonexpert readers, is the introductory paper "Parallel Job Scheduling: Issues and Approaches" by the volume editors.Table of ContentsParallel job scheduling: Issues and approaches.- Scheduling on the Tera MTA.- A scalable multi-discipline, multiple-processor scheduling framework for IRIX.- Scheduling to reduce memory coherence overhead on coarse-grain multiprocessors.- Time Space Sharing Scheduling and architectural support.- Demand-based coscheduling of parallel jobs on multiprogrammed multiprocessors.- Multiprocessor scheduling for high-variability service time distributions.- The interaction between memory allocation and adaptive partitioning in message-passing multicomputers.- Analysis of non-work-conserving processor partitioning policies.- Loop-Level Process Control: An effective processor allocation policy for multiprogrammed shared-memory multiprocessors.- A microeconomic scheduler for parallel computers.- On the benefits and limitations of dynamic partitioning in parallel computer systems.- Intelligent fuzzy control to augment scheduling capabilities of network queuing systems.- Parallel processing on dynamic resources with CARMI.- Job scheduling under the Portable Batch System.- The ANL/IBM SP scheduling system.- Requirements of the Cornell Theory Center for resource management and process scheduling.- Job management requirements for nas parallel systems and clusters.- Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860.

Read more less

Book SynopsisNo pleasure lasts long unless there is variety in it. Publilius Syrus, Moral Sayings We've been very fortunate to receive fantastic feedback from our readers during the last four years, since the first edition of How to Solve It: Modern Heuristics was published in 1999. It's heartening to know that so many people appreciated the book and, even more importantly, were using the book to help them solve their problems. One professor, who published a review of the book, said that his students had given the best course reviews he'd seen in 15 years when using our text. There can be hardly any better praise, except to add that one of the book reviews published in a SIAM journal received the best review award as well. We greatly appreciate your kind words and personal comments that you sent, including the few cases where you found some typographical or other errors. Thank you all for this wonderful support.Table of ContentsI What Are the Ages of My Three Sons?.- 1 Why Are Some Problems Difficult to Solve?.- II How Important Is a Model?.- 2 Basic Concepts.- III What Are the Prices in 7–11?.- 3 Traditional Methods — Part 1.- IV What Are the Numbers?.- 4 Traditional Methods — Part 2.- V What’s the Color of the Bear?.- 5 Escaping Local Optima.- VI How Good Is Your Intuition?.- 6 An Evolutionary Approach.- VII One of These Things Is Not Like the Others.- 7 Designing Evolutionary Algorithms.- VIII What Is the Shortest Way?.- 8 The Traveling Salesman Problem.- IX Who Owns the Zebra?.- 9 Constraint-Handling Techniques.- X Can You Tune to the Problem?.- 10 Tuning the Algorithm to the Problem.- XI Can You Mate in Two Moves?.- 11 Time-Varying Environments and Noise.- XII Day of the Week of January 1st.- 12 Neural Networks.- XIII What Was the Length of the Rope?.- 13 Fuzzy Systems.- XIV Everything Depends on Something Else.- 14 Coevolutionary Systems.- XV Who’s Taller?.- 15 Multicriteria Decision-Making.- XVI Do You Like Simple Solutions?.- 16 Hybrid Systems.- 17 Summary.- Appendix A: Probability and Statistics.- A.1 Basic concepts of probability.- A.2 Random variables.- A.2.1 Discrete random variables.- A.2.2 Continuous random variables.- A.3 Descriptive statistics of random variables.- A.4 Limit theorems and inequalities.- A.5 Adding random variables.- A.6 Generating random numbers on a computer.- A.7 Estimation.- A.8 Statistical hypothesis testing.- A.9 Linear regression.- A.10 Summary.- Appendix B: Problems and Projects.- B.1 Trying some practical problems.- B.2 Reporting computational experiments with heuristic methods.- References.

Read more less

Book SynopsisDas erfolgreiche Fachbuch widmet sich der psychosozialen Dimension der Projektarbeit. Vor diesem Hintergrund werden alle Projektphasen beleuchtet. Schwerpunkte sind: Planung und Gestaltung des Projektbeginns, methodische Hinweise zur Teamarbeit, Regeln der Gesprächsführung, Umgang mit Macht, Hierarchie und Widerstand im Rahmen der Projektarbeit, Partizipation, Gestaltung des Projektendes, Rolle und Anforderungsprofil des Projektleiters.Fachlich kompetent und übersichtlich gestaltet, gibt das Arbeitsbuch eine ebenso praxisgerechte wie breitgefächerte Hilfestellung für Projektleiter und Führungskräfte in den verschiedensten Bereichen. In der Neuauflage wurden die Entwicklungen in der Praxis berücksichtigt. Das Buch ist zu einem Klassiker der Projektarbeit geworden und wird in vielen Firmen und Seminaren als Lehrbuch eingesetzt.Table of Contents1 Orientierungshilfe für den Leser.- 1.1 Ziele des ersten Kapitels.- 1.2 Was hat sich in der Projektarbeit seit der 1. Auflage verändert?.- 1.3 Typische Probleme in der Projektarbeit und der Beitrag des Buches.- 1.4 Übersicht über die einzelnen Kapitel.- 2 Unser Grundverständnis von Projektmanagement.- 2.1 Ziele des zweiten Kapitels.- 2.2 Ein gemeinsames Verständnis über Projektmanagement ist nötig.- 2.3 Acht Merkmale für erfolgreiches Projektmanagement.- 2.4 Die fünf Dimensionen der Projektarbeit.- 2.5 Projektarbeit verlangt, die Dinge im Systernzusammenhang zu sehen.Das OSTO-Modell: das Unternehmen als offenes sozio-techno-ökonornisches System.- 2.6 Empfehlungen.- 3 Der Projektvereinbarungsprozess von der Projektidee bis zum klaren Projektauftrag.- 3.1 Ziele des dritten Kapitels.- 3.2 Was ist unter einem Projektvereinbarungsprozess zu verstehen?.- 3.3 Sage rnir, wie ein Projekt beginnt, und ich sage Dir, wie es endet!.- 3.4 Praxisprobleme.- 3.5 Die zwei Ebenen des Projektvereinbarungsprozesses.- 3.5.1 Analysieren Sie die Ausgangssituation des Projektes.- 3.5.2 Die Inhaltsebene der Projektvereinbarung.- 3.5.3 Kernpunkte des Projektauftrags.- 3.6 Der Projektvereinbarungsprozess verlangt Rollenbewusstsein.- 3.7 Der Weg der Projektvereinbarung—das Wie.- 3.7.1 Worauf sollte der ProjektIeiter bei der Gestaltung der Projektvereinbarung achten?.- 3.7.2 Prüfen Sie Ihre persönliche Ausgangssituation für die ProjektIeitung!.- 3.8 Glosse.- 3.9 Empfehlungen und Checklisten.- 4 Erfolgreich arbeiten im Projektteam.- 4.1 Ziele des vierten Kapitels.- 4.2 Praxisprobleme.- 4.3 Nach welchen Kriterien sind die Mitarbeiter des Projektteams auszuwahlen.- 4.3.1 Wer soli über die Mitarbeit im Projektteam entscheiden?.- 4.3.2 Glosse.- 4.3.3 Wie groß sollte ein Projektteam sein?— Kernteam und erweitertes Team.- 4.4 Durch welche Faktoren wird die Arbeit des Projektteams beeinflusst?.- 4.4.1 Ziele und Aufgaben der Gruppe — das Thema.- 4.4.2 Individuum — Einstellung, Verhalten, Qualifikation des Einzelnen.- 4.4.3 Gruppe.- 4.4.4 Das Umfeld des Projektteams.- 4.5 Die Kick-Off-Sitzung.- 4.6 Die Gruppenprozessanalyse.- 4.7 Glosse.- 4.8 Empfehlungen und Checklisten.- 5 Partnerschaftliche Gesprachsfiihrung - ein Schliissel zur erfolgreichen Projektarbeit.- 5.1 Ziele des fiinften Kapitels.- 5.2 Die Praxisprobleme.- 5.3 Grundlagen der Gesprachsfiihrung.- 5.3.1 Wertschatzung und Achtung des Menschen.- 5.3.2 Offenes Verhalten.- 5.3.3 Einfiihlungsvermogen - die Botschaft wahrnehmen.- 5.4 Techniken der Gesprachsfiihrung - Hinweise und Regeln.- 5.4.1 Hinweise zum aktiven Zuhoren.- 5.4.2 Stellen Sie echte Fragen.- 5.4.3 Werfragt, fiihrt!.- 5.4.4 Mach mal Pause.- 5.4.5 Killerphrasen konnen ein Gesprach tOten.- 5.4.6 Feedback rnacht satt.- 5.5 Verstandlichkeit - ein Schltissel zurn gegenseitigen Verstehen.- 5.6 Checklisten zur Gesprachsftihrung.- 6 Macht, Hierarchie und Autoritat in der Projektarbeit.- 6.1 Ziele des sechsten Kapitels.- 6.2 Was bedeutet Macht?.- 6.3 Wie kann der Projektleiter Macht in der Praxis erkennen?-Die Praxisproblerne.- 6.4 Hierarchie und Projektarbeit - ein schizophrenes Muster?.- 6.5 Unsere „auBeren“ und „inneren“ Hierarchien-Personelle Machtfaktoren.- 6.5.1 Der Einfluss von Ftihrungskraften auf die Projektarbeit.- 6.5.2 Unsere inneren Hierarchien.- 6.6 Glosse.- 6.7 Zusammenfassung und Hinweise.- 7 Akzeptanz oder Widerstand: Erfolgskriterium fiir Innovationen.- 7.1 Ziele des siebten Kapitels.- 7.2 Wie begegnen uns Widerstande?.- 7.3 Was ist Widerstand?.- 7.4 Die Ursachen ftir Widerstand.- 7.4.1 Generelle WiderstandsauslOser, die in der Natur der Projektarbeit liegen.- 7.4.2 Projektbezogene Widerstandsausloser.- 7.5 Der Urngang mit Widerstand.- 7.5.1 Zurn Urngang mit Widerstand auf der Ebene des Gesarntunternehrnens.- 7.5.2 Zurn Urngang mit Widerstand auf der Ebene des Projektes.- 7.5.3 Wie gehe ich als Projektleiter personlich mit Widerstand urn?.- 7.6 Checklisten ftir den Projektleiter.- 8 Der Projektabschluss: Bruchstellen sind Fundstellen.- 8.1 Ziele des achten Kapitels.- 8.2 Die Praxisproblerne.- 8.3 Das Projektende: Zwischen ktinstIicher Verlangerung und heimlichem Abseilen.- 8.4 Werten Sie Projekte systematisch aus.- 8.5 Empfehlungen und Checklisten.- 9 Gedanken zur Rolle und zurn Anforderungsprofil des Projektleiters.- 9.1 Ziele des neunten Kapitels.- 9.2.1 Wie sehen wir die ProjektIeiterrolle?.- 9.3 Aufgaben des ProjektIeiters.- 9.4 Welche Kompetenzen sollte ein ProjektIeiter haben?.- 9.5 Zur Qualifikation eines Projektleiters.- 9.6 Qualifikationsmoglichkeiten ftir ProjektIeiter.- 9.7 Checklisten.- 9.7.1 Fragen zum eigenen Rollenverstandnis.- 9.7.2 Fragen zur Sichtweise von auBen.- Stichwortverzeichnis.

Read more less

Book Synopsis Get started with Vue.js quickly and easily with this book This book provides a compact and practical introduction to the popular Vue.js. Use the MVVC concept for applications on the web on the basis of MVC design patterns and create single-page web applications easily. You will use one of the powerful frameworks based only on elementary WWW standard technologies. With Vue.js you will understand and apply data binding, components, directives and modularity. With this book, you will not only learn the most important basics of Vue.js. You will also learn how to create and maintain web applications with this JavaScript web framework. The focus of this comprehensive work is on the following aspects: - HTML/CSS/JavaScript and the Web: The Vue.js environment - Basis of JavaScript (above all JSON) - Working with the Vue instance - templates - Double Curly Syntax and Data Binding With its strong application focus, this book on Vue.js is an ideal companion for self-study or relevant courses. In terms of content, it is aimed at: (a) creators of websites (b) programmers c) Web designer Dive even deeper into the matter Ralph Steyer shows which prerequisites you should have to work with this book. Then you will learn more about the framework and the special features of Vue.js. In the further course, the author covers these partial aspects, among others: - First examples - just test Vue.js once - How and why does Vue.js work? - Conditional Rendering: The v-if directive - making decisions - Dynamic layouts with data binding - making stylesheets dynamic - Forms and form data binding - interaction with the user - Transitions and animations - Moving things If you want to learn even more about the application, this book gives you an outlook on further possible uses and functions of Vue.js in the final chapter. To make it easier for you to get started, you will find program codes and illustrations in each chapter that illustrate complex processes.Table of ContentsIntroduction - Before we really get started - First examples - Just testing Vue js - Behind the scenes - How and why does Vue js work? - Vue js in depth - The Vue instance, Vue templates and data binding - Working with arrays - Iterations with the v-for directive - Conditional rendering - The v-if directive - Making decisions - Events, methods, Observers and Calculated Properties - Calculated Results and Responses - Dynamic Layouts with Data Binding - Making Stylesheets Dynamic - Forms and Form Data Binding - Interacting with the User - Filtering Techniques - Selected Data Only - Transitions and Animations - Moving Things - Looking Ahead - What Else is in Vue js?

Read more less

Book SynopsisTable of Contents1 Funkpeilwesen.- 2 Hyperbelnavigation.- 3 Radar.- 4 Integrierte Navigation und NAVSTAR GPS.- 5 Physik.- 6 Datenverarbeitung.- 7 Formelsammlung für die Funknavigation.

Read more less

Book SynopsisThis textbook and exercise book provides a solid basic knowledge and comprehensive practical skills in dealing with PLC programming. Numerous exercises help to deepen the material. With the accompanying simulation software and sample solutions, the acquired knowledge can be applied immediately. The software can be downloaded via the Internet. The knowledge of number systems and digital technology conveyed in the book is an important prerequisite for skilful and clever PLC programming. The programming language used, "Instruction list according to IEC 61131-3", provides the best insights into the functioning of a PLC. The didactically prepared programming examples for switching networks, signal memories, time functions, counters, function blocks and functions, program structures, sequence controls, data types and much more enable systematic learning of programming. The 5th, corrected edition experiences an expansion of the exercises with a didactically prepared project for the control of a mountain railway. The associated simulation software "PLC-lite" enables the realisation of controls for the mountain railway and the "realistic" representation of the cableway movements on the screen.Table of ContentsNumber systems, dual numbers and codes.- Boolean algebra.- Flip-flops and static memories.- Dynamic memory elements and counters.- Switching networks with PLC.- Circuits with signal memories.- Time functions.- Counters.- Function blocks.- Jumps, loops and repetitions.- Functions.- Sequential controls.

Read more less

Book Synopsis

Read more less

Book Synopsis

Read more less

Book Synopsis

Read more less