Compilers and interpreters Books

Book SynopsisThis book contains the thoroughly refereed technical papers presented in eight workshops collocated with the International Conference on Software Technologies: Applications and Foundations, STAF 2018, held in Toulouse, France, in June 2018. The 65 full papers presented were carefully reviewed and selected from 120 submissions. The events whose papers are included in this volume are: CoSim-CPS 2018: 2nd International Workshop on Formal Co-Simulation of Cyber-Physical Systems DataMod 2018: 7th International Symposium From Data to Models and Back FMIS 2018: 7th International Workshop on Formal Methods for Interactive Systems FOCLASA 2018: 16th International Workshop on Foundations of Coordination Languages and Self-adaptative Systems GCM 2018: 9th International Workshop on Graph Computation Models MDE@DeRun 2018: 1st International Workshop on Model-Driven Engineering for Design-Runtime Interaction in Complex Systems MSE 2018: 3rd International Workshop on Microservices: Science and Engineering SecureMDE 2018: 1st International Workshop on Security for and by Model-Driven Engineering Table of ContentsFormal Co-Simulation of Cyber-Physical Systems (CoSim-CPS).- From Data to Models and Back (DataMod).- Formal Methods for Interactive Systems (FMIS).- Foundations of Coordination Languages and Self-adaptative Systems (FOCLASA).- Graph Computation Models (GCM).- Model-Driven Engineering for Design-Runtime Interaction in Complex Systems (MDE@DeRun).- Microservices: Science and Engineering (MSE).- Security for and by Model-Driven Engineering (MDE).

Read more less

Book SynopsisThis practically-focused textbook presents a concise tutorial on data structures and algorithms using the object-functional language Scala. The material builds upon the foundation established in the title Programming with Scala: Language Exploration by the same author, which can be treated as a companion text for those less familiar with Scala.Topics and features: discusses data structures and algorithms in the form of design patterns; covers key topics on arrays, lists, stacks, queues, hash tables, binary trees, sorting, searching, and graphs; describes examples of complete and running applications for each topic; presents a functional approach to implementations for data structures and algorithms (excepting arrays); provides numerous challenge exercises (with solutions), encouraging the reader to take existing solutions and improve upon them; offers insights from the author’s extensive industrial experience; includes a glossary, and an appendix supplying an overview of discrete mathematics.Highlighting the techniques and skills necessary to quickly derive solutions to applied problems, this accessible text will prove invaluable to time-pressured students and professional software engineers.Table of ContentsFoundational Components Fundamental Algorithms Arrays Lists Stacks Queues Hash Tables Binary Trees Sorting Searching Graphs Appendix A: Solutions for Selected Exercises Appendix B: Review of Discrete Mathematical Topics

Read more less

Book SynopsisJava is now well-established as one of the world’s major programming languages, used in everything from desktop applications to web-hosted applications, enterprise systems and mobile devices. Java applications cover cloud-based services, the Internet of Things, self-driving cars, animation, game development, big data analysis and many more domains.The second edition of Foundational Java: Key Elements and Practical Programming presents a detailed guide to the core features of Java – and some more recent innovations – enabling the reader to build their skills and confidence though tried-and-trusted stages, supported by exercises that reinforce the key learning points. All the most useful and commonly applied Java syntax and libraries are introduced, along with many example programs that can provide the basis for more substantial applications. Use of the Eclipse Integrated Development Environment (IDE) and the JUnit testing framework is integral to the book, ensuring maximum productivity and code quality when learning Java, although to ensure that skills are not confined to one environment the fundamentals of the Java compiler and run time are also explained. Additionally, coverage of the Ant tool will equip the reader with the skills to automatically build, test and deploy applications independent of an IDE.Topics and features:• Presents the most up-to-date information on Java, including Java 14• Examines the key theme of unit testing, introducing the JUnit 5 testing framework to emphasize the importance of unit testing in modern software development• Describes the Eclipse IDE, the most popular open source Java IDE and explains how Java can be run from the command line• Includes coverage of the Ant build tool• Contains numerous code examples and exercises throughout• Provides downloadable source code, self-test questions, PowerPoint slides and other supplementary material at the website http://www.foundjava.comThis hands-on, classroom-tested textbook/reference is ideal for undergraduate students on introductory and intermediate courses on programming with Java. Professional software developers will also find this an excellent self-study guide/refresher on the topic.Dr. David Parsons is National Postgraduate Director at The Mind Lab, Auckland, New Zealand. He has been teaching programming in both academia and industry since the 1980s and writing about it since the 1990s.Table of ContentsThe Java StoryCompiling and Running Java ProgramsData Types, Arithmetic and ArraysControl StructuresCreating ObjectsCreating Domain ClassesObjects Working Together: Association, Aggregation and CompositionInheritance, Polymorphism and InterfacesException HandlingUnit Testing With JUnitExploring the Java LibrariesThe Collections Framework and GenericsInput and Output StreamsAutomatic Building and Testing with AntJava and the Database (JDBC)MultithreadingBuilding GUIs with the JFC Swing LibraryEvent Driven ProgrammingDialogs and Menus, Models and ViewsJava Web Start and Applets

Read more less

Book SynopsisThis undergraduate textbook first introduces basic electronic circuitry before explaining more advanced elements such as the Arithmetic Logic Unit, sequential circuits, and finally microprocessors. In keeping with this integrated and graduated approach, the authors then explain the relationship to first assembly programming, then higher-level languages, and finally computer organisation. Authors use the Raspberry Pi and ARM microprocessors for their explanationsThe material has been extensively class tested at TU Eindhoven by an experienced team of lecturers and researchers. This is a modern, holistic treatment of well-established topics, valuable for undergraduate students of computer science and electronics engineering and for self-study. The authors use the Raspberry Pi and ARM microprocessors for their explanations.Table of ContentsBasic Components and Combinatorial Circuits.- Numbers, Basic Circuits, and the ALU.- Sequential Circuits.- An Elementary Processor.- Assembly Programming.- Compiling Higher-Level Languages.- Computer Organisation.- The Raspberry Pi and the ARM Processor.- App. A, An Extended Instruction Set for the Simple Processor.- App. B, The ARM Instruction Set.- App. C, Syntax of the Register Transfer Language.- App. D, Exercise Answers.

Read more less

Book SynopsisThis book provides readers with a single-source reference to static-single assignment(SSA)-based compiler design. It is the first (and up to now only) book that coversin a deep and comprehensive way how an optimizing compiler can be designed usingthe SSA form. After introducing vanilla SSA and its main properties, the authorsdescribe several compiler analyses and optimizations under this form. They illustratehow compiler design can be made simpler and more efficient, thanks to the SSA form.This book also serves as a valuable text/reference for lecturers, making the teaching ofcompilers simpler and more effective. Coverage also includes advanced topics, such ascode generation, aliasing, predication and more, making this book a valuable referencefor advanced students and practicing engineers. Table of Contents1. Introduction 2. Properties and flavors3. Standard Construction and Destruction Algorithms4. Advanced Construction Algorithms for SSA5. SSA Reconstruction6. Functional Representations of SSA7. Introduction8. Propagating Information using SSA9. Liveness10. Loop Tree and Induction Variables11. Redundancy Elimination12. Introduction13. Static Single Information form 14. Graphs and Gating Functions 15. Psi-SSA Form 16. Hashed SSA form: HSSA 17. Array SSA Form 18. SSA Form and Code Generation 19. Instruction Code Selection 20. If-Conversion 21. SSA Destruction for Machine Code 22. Register Allocation 23. Hardware Compilation using SSA 24. Building SSA in a Compiler for PHP

Read more less

Book SynopsisThis textbook is about learning Android and developing native apps using the Java programming language. It follows Java and Object-Oriented (OO) programmers’ experiences and expectations and thus enables them to easily map Android concepts to familiar ones. Each chapter of the book is dedicated to one or more Android development topics and has one or more illustrating apps. The topics covered include activities and transitions between activities, Android user interfaces and widgets, activity layouts, Android debugging and testing, fragments, shared preferences, SQLite and firebase databases, XML and JSON processing, the content provider, services, message broadcasting, async task and threading, the media player, sensors, Android Google maps, etc. The book is intended for introductory or advanced Android courses to be taught in one or two semesters at universities and colleges. It uses code samples and exercises extensively to explain and clarify Android coding and concepts. It is written for students and programmers who have no prior Android programming knowledge as well as those who already have some Android programming skills and are excited to study more advanced concepts or acquire a deeper knowledge and understanding of Android programming. All the apps in the book are native Android apps and do not need to use or include third-party technologies to run.Table of Contents1. Java Review.- 2. Getting Started with Android.- 3. Your First Android Application.- 4. Debugging and Testing Using Junit, Espresso, and Mockito Frameworks.- 5. Activity Lifecycle and Passing Objects Between Screens Using Parcelable Interface.- 6. User Interface Essential Classes, Layouts, Styles, Themes, and Dimensions.- 7. ListView, ScrollList, Date and Time Pickers, and RecyclerView.- 8. Toolbar, Menu, Dialog Boxes, Shared Preferences, Implicit Intent, and Directory Structure.- 9. Fragments, Dynamic Binding, Inheritance, Pinching, and Screen Swiping.- 10. Parsing Remote XML and JSON Files, Using HTTPUrlConnection, XmlPullParser, and AsyncTask.- 11. Android SQLite, Firebase, and Room Databases.- 12. Content Provider, Service, Message Broadcasting, and Multimedia Player.- 13. Sensors, Location-Based Service, and Google Maps.

Read more less

Book SynopsisThis textbook provides an in-depth introduction to software design, with a focus on object-oriented design, and using the Java programming language. Its goal is to help readers learn software design by discovering the experience of the design process. To this end, the text follows a continuous narrative that introduces each element of design know-how in context, and explores alternative solutions in that context. This narrative is complemented by hundreds of code fragments and design diagrams. The first chapter is a general introduction to software design and the subsequent chapters cover design concepts and techniques. The concepts and techniques covered include interfaces, encapsulation, inheritance, design patterns, composition, functional-style design, unit testing, and many more. A major emphasis is placed on coding and experimentation as a necessary complement to reading the text. To support this aspect of the learning process, a companion website with practice exercises is provided, as well as two complete sample applications. Guidance on these sample applications is provided in “Code Exploration” insets throughout the book. Although the Java language is used as a means of conveying design-related ideas, the book’s main goal is to address concepts and techniques that are applicable in a host of technologies. This second edition covers additional design techniques such as input validation and dependency injection. It also provides extended and revised treatment of many core subjects, including polymorphic copying, unit testing, the Observer pattern, and functional-style programming. This book is intended for readers who have a minimum of programming experience and want to move from writing small programs and scripts to tackling the development of larger systems. This audience naturally includes students in university-level computer science and software engineering programs. As the prerequisites to specific computing concepts are kept to a minimum, the content is also accessible to programmers with no previous background in computing. In a similar vein, understanding the code fragments requires only a minimal grasp of the Java language, such as would be taught in an introductory programming course.Table of Contents1. Introduction.- 2. Encapsulation.- 3. Types and Interfaces.- 4. Object State.- 5. Unit Testing.- 6. Composition.- 7. Inheritance.- 8. Inversion of Control.- 9. Functional Design.

Read more less

Book SynopsisThis book constitutes the proceedings of the 27th International Conference on Formal Methods for Industrial Critical Systems, FMICS 2022, which took place in Warsaw, Poland, in September 2022. The 13 full papers included in this book were carefully reviewed and selected from 22 submissions. They were organized in topical sections as follows: Certification; industrial use cases; testing and monitoring; and methodology.Table of ContentsInvited Keynote Talks.- Reinforcement Learning with Guarantees That Hold for Ever.- Supporting Railway Innovations with Formal Modelling and Verification.- Certification.- Formal Monotony Analysis of Neural Networks with Mixed Inputs: An asset for certification.- Generating Domain-specific Interactive Validation Documents.- Deductive Verification of Smart Contracts with Dafny.- Industrial use cases.- Towards Reusable Formal Models for Custom Real-time Operating Systems.- Formal verification of an industrial UML-like model using mCRL2.- Chemical Case Studies in KeYmaera X.- Analysing Capacity Bottlenecks in Rail Infrastructure by Episode Mining.- Testing and monitoring.- Test Suite Augmentation for Recon gurable PLC Software in the Internet of Production.- Monitoring of Spatio-Temporal Properties with nonlinear SAT solvers.- Model-Based Testing of Internet of Things Protocols.- Methodology.- Formally Verifying Decompositions of Stochastic Specifications.- Verification of Behavior Trees using Linear Constrained Horn Clauses.- A Multi-level Methodology for Behavioral Comparison of SoftwareIntensive Systems.

Read more less

Book SynopsisThis textbook is aimed at readers who have little or no knowledge of computer programming but want to learn to program in Python. It starts from the very basics including how to install your Python environment, how to write a very simple program and run it, what a variable is, what an if statement is, how iteration works using for and while loops as well as important key concepts such as functions, classes and modules. Each subject area is prefaced with an introductory chapter, before continuing with how these ideas work in Python. The second edition has been completely updated for the latest versions of Python including Python 3.11 and Python 3.12. New chapters have been added such as those that consider where and how Python is used, the use of Frozensets, how data can be sorted, enumerated types in Python, structural pattern matching and how (and why) Python Virtual Environments are configured. A new chapter ‘The Python Bites back’ is introduced to present the fourteen most common / biggest gotchas for someone new to Python. Other sections have been updated with new features such as Exception Groups, string operations and dictionary operations. A Beginners Guide to Python 3 Programming second Edition provides all you need to know about Python, with numerous examples provided throughout including several larger worked case studies illustrating the ideas presented in the previous chapters.Table of ContentsIntroduction.- Where is Python Used.- Setting up the Python Environment.- A First Python Program.- Python Strings.- Numbers, Booleans and None.- Flow of Control using if statements.- Number Guessing Game.- Recursion.- Introduction to Structured Analysis.- Functions in Python.- Implementing a Calculator using Functions.- Introduction to Functional Programming.- Curried Functions.- Introduction to Object Orientation.- Class Side and Static Behaviour.- Why Bother with Object Orientation?.- Operator Overloading.- Error and Exception Handling.- Python Modules and Packages.- Abstract Base Classes.- Error and Exception Handling.- Python Modules and Packages.- Protocols, Polymorphism and Descriptors.- Decorators.- Iterables and Iterators.- Generators and Coroutines.- Collections Tuples and Lists.- Sets.- Dictionaries.- Frozensets.- Collection Related Modules.- ADTs, Queues and Stacks.- Map, Filter and Reduce.- Sorting and Higher Order Functions.- Python Enumerated Values, Structural Pattern Making.- Python Virtual Environments.- Monkey Patching.- Attribute Lookup.- The Python Bites Back.- TicTacToe Game.

Read more less

Book SynopsisThis book constitutes the proceedings of the 19th International Workshop on OpenMP, IWOMP 2023, held in Bristol, UK, during September 13–15, 2023.The 15 full papers presented in this book were carefully reviewed and selected from 20 submissions. The papers are divided into the following topical sections: OpenMP and AI; Tasking Extensions; OpenMP Offload Experiences; Beyond Explicit GPU Support; and OpenMP Infrastructure and Evaluation.Table of Contents​OpenMP and AI: Advising OpenMP Parallelization via a Graph-Based Approach with Transformers.- Towards Effective Language Model Application in High-Performance Computing.- OpenMP Advisor: A Compiler Tool for Heterogeneous Architectures.- Tasking Extensions: Introducing Moldable Task in OpenMP.- Suspending OpenMP Tasks on Asynchronous Events: Extending the Taskwait Construct.- How to Efficiently Parallelize Irregular DOACROSS Loops Using Fine-Grained Granularity and OpenMP Tasks? The mcf Case.- OpenMP Offload Experiences: The Kokkos OpenMPTarget Backend: Implementation and Lessons Learned.- Fine-Grained Parallelism on GPUs Using OpenMP Target Offloading.- Improving a Multigrid Poisson Solver with Peer-to-Peer Communication and Task Dependencies.- Beyond Explicit GPU Support: Multipurpose Cacheing to accelerate OpenMP Target Regions on FPGAs.- Generalizing Hierarchical Parallelism.- Exploring the Limits of Generic Code Execution on GPUs via Direct (OpenMP) Offload.- OpenMP Infrastructure and Evaluation: Improving Simulations of Task-Based Applications on Complex NUMA Architectures.- Experimental Characterization of OpenMP Offloading Memory Operations and Unified Shared Memory Support.- OpenMP Reverse Offloading Using Shared Memory Remote Procedure Calls.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 5th International Conference on Logic and Argumentation, CLAR 2023, held in Hangzhou, China, during September 10-12, 2023. The 11 full papers, one short paper and one invited paper presented in this book were carefully reviewed and selected from 20 submissions. The papers focus on topics such as: ​logic and automated deduction; abstract and structured argumentation; dialogues, games and practical reasoning; and quantitative argumentation.Table of Contents​Logic and Automated Deduction.- Dynamic Modal Logic with Counting: when Reduction Axioms Work and Fail.- Solving Modal Logic Problems by Translation to Higher-order Logic.- Formalizing the Unexpected Hanging Paradox: a Classical Surprise.- Abstract and Structured Argumentation.- Weakest Link in Formal Argumentation: Lookahead and Principle-based Analysis.- A Logical Encoding for k-m-Realization of Extensions in Abstract Argumentation.- Topological Conditions and Solutions for Repairing Argumentation Frameworks.- Dialogues, Games and Practical Reasoning.- Providing personalized Explanations: a Conversational Approach.- Audience irrelevance in Strategic Argumentation Games.- A Structured Bipolar Argumentation Theory for Providing Explanations in Practical Reasoning.- Quantitative Argumentation.- A Filtering-based General Approach to Learning Rational Constraints of Epistemic Graphs.- Fuzzy Labeling Semantics for Quantitative Argumentation.- A Logic for Preference Lifting under Uncertainty and its Decidability.

Read more less

Book SynopsisThis book constitutes the revised selected papers of the 8th Summer School, CEFP 2019, held in Budapest, Hungary, during June 2019.The 7 full papers and the 4 short papers included in this volume were carefully reviewed and selected. The lectures cover various programming subjects with a focus on composability, comprehensibility, and correctness of working software.Table of ContentsMain Lectures.- PhD Workshop.

Read more less

Book SynopsisThis book constitutes the proceedings of the 16th International Conference on Informatics in Schools: Situation, Evolution and Perspectives, ISSEP 2023, held in Lausanne, Switzerland, during October 23–25, 2023. The 14 full papers presented in this book were carefully reviewed and selected from 47 submissions. They are organized in four topical sections named: artificial intelligence and its applications; competitions, problem solving, and computational; robotics and unplugged modalities; and curricula and computer science concepts. This is an open access book.Table of ContentsEducation and Awareness for Artificial Intelligence.- What is AI-PACK? Outline of AI competencies for teaching with DPACK.- Implementing a Portable Learning Lab on Artificial Intelligence: It's AI in a Box!.- Investigating the Role of ChatGPT in Supporting Text-Based Programming Education for Students and Teachers.- All Green: How Different Age Groups Solved the Same Bebras Task.- Effects of the COVID-19 pandemic on the Bebras Computational Thinking Challenge: Comparing numbers, examining reasons and investigating recommendations.- The Function of Note-Taking in Problem Solving in the Computer Science Escape Game Room.- An Exploratory Investigation on High-School Students’ Understanding of Threads.- Combining Models to Orchestrate an Instructional Scenario Fostering Computational Thinking in Educational Robotics.- Teachers' Knowledge in Informatics---Exploring Educational Robotics Resources Through the Lens of Textual Data Analysis.- Reshaping Unplugged Computer Science Workshops for Primary School Education.- Evaluating the New Secondary CS Curriculum in the Netherlands - The Teachers’ Perspective.- Navigating the Implementation of the Curriculum Digital Education in Austrian Secondary Schools: Challenges and Teacher Perspectives.- Bridging the Gap: Infusing Natural Science Classes with Computer Science Concepts and Skills.

Read more less

Book SynopsisMit diesem Buch schlagen Sie drei Fliegen mit einer Klappe: Sie lernen HTML und JavaScript und zugleich die Kunst des Programmierens. Man benötigt nur einen Editor und einen Browser und schon kann man mit den ersten Beispielen starten. Das Buch regt mit vielen praxisnahen Aufgaben zum eigenen Programmieren an. Es enthält viele Aufgaben, die anhand der Beispielprogramme gelöst werden können. Schrittweise treten Sie damit in die faszinierende Welt des Webdesigns ein. Beispiele, Lösungen und Ergänzungen lassen sich aus dem Internet problemlos herunterladen.Table of ContentsTextgestaltung.- Protokolle, Verweise und Bilder.- Listen und Tabellen.- Formatvorlagen (CCS).- Formulare und Ereignisse.- Grundlagen von JavaScript.- Operatoren.- Ablaufkontrolle.- Objekte und Arrays.- Rahmen und Fenster.- Funktionen.

Read more less

Book SynopsisLernen Sie Programmieren mit Freude. Zahlreiche Beispiele machen den Einstieg in schwierige Themen einfach. Datenstrukturen und Algorithmen werden so in ihrem vollen Umfang anschaulich dargestellt. Anhand vieler Übungsaufgaben kann das Erlernte direkt ausprobiert werden. Ausführliche Lösungen erleichtern das Selbststudium und sichern den Lernerfolg. Table of ContentsEinführung in die objektorientierte Programmierung - Darstellung von Daten - Das NET-Framework - Vordefinierte Datentypen - Arrays - Operationen und Ausdrücke - Statische Methoden und Variablen - Programmsteuerung - Klassen und Objekte

Read more less

Book Synopsis0 Einleitung und Notationen.- 0.1 Historische Entwicklung.- 0.2 Einführende Beispiele.- 0.3 Schreibweisen.- 0.4 Testfragen.- 1 Einfache Datentypen und Ein/Ausgabe.- 1.1 AufZählungstypen und Unterbereichstypen.- 1.2 CHAR, siehe A.2.2.- 1.3 BOOLEAN, siehe A.2.2.- 1.4 Ordinale und Simple Typen.- 1.5 Zahlbezeichnungen.- 1.6 INTEGER, siehe A.2.2.- 1.7 REAL, siehe A.2.2.- 1.8 String, vgl. 5.3.- 1.9 Einfache Ein/Ausgabe mit READ, WRITE.- 1.10 Testfragen.- 2 Einfacher Programmaufbau.- 2.1 Verfügbarmachung externer Dateien, vgl. 8.- 2.2 Vereinbarungen.- 2.3 Testfragen.- 3 Ausdrücke.- 3.1 Primärausdrücke.- 3.2 Ausdrücke, allgemein.- 3.3 Testfragen.- 4 Anweisungen.- 4.1 Assignment Statement.- 4.2 Empty Statement.- 4.3 IF Statement.- 4.4 CASE Statement.- 4.5 Schleifen.- 4.6 Folgen von Anweisungen (compound statement).- 4.7 Label, GOTO Statement.- 4.8 Testfragen.- 5 Reihung (Array) und Mengenbildung (SET).- 5.1 Reihungstyp, Komponente.- 5.2 PACKED, vgl. A.2.5.2.- 5.3 String, vgl. 1.8.- 5.4 Potenzmengentyp, Mengen-Aggregat.- 5.5 Testfragen.- 6 Zeiger und Verbund.- 6.1 Zeiger (^ Symbol).- 6.2 Verbund (RECORD).- 6.3 Testfragen.- 7 Unterprogramme.- 7.1 Unterprogramm-Technik.- 7.2 Parameterübergabe.- 7.3 Konforme Reihungsschemata (level 1 implementation).- 7.4 Prozedur (PROCEDURE).- 7.5 Funktion (FUNCTION).- 7.6 Rundreise-Problem.- 7.7 Bereichsschachtelung.- 7.8 Testfragen.- 8 Datei (File).- 8.l Sequentieller Dateityp, Modus, Komponente.- 8.2 Text-Datei (TEXT), siehe A.2.2/5/6.- 8.3 Testfragen.- A Anhang.- A. l Syntax-Diagramme.- A.2 Standard-Bibliothek (Vordefinierte Vereinbarungen).- A.2.1 Standard-Konstanten.- A.2.2 Standard-Typen.- A.2.3 Standard-Operationen.- A.2.3.1 Arithmetic Operations.- A.2.3.2 Relational Operations.- A.2.3.3 Boolean Operations.- A.2.3.4 Set Operations.-A.2.3.5 Other Operations'.- A.2.4 Standard-Funktionen.- A.2.4.1 Arithmetic Functions.- A.2.4.2 Boolean Functions (Predicates).- A.2.4.3 Transfer Functions.- A.2.4.4 Further Standard Functions.- A.2.5 Standard-Prozeduren.- A.2.5.1 Dynamic Allocation Procedures.- A.2.5.2 Data Transfer Procedures.- A.2.5.3 File Handling Procedures.- A.2.5.4 Input- Procedures READ and READLN.- A.2.5.5 Output-Procedures WRITE and WRITELN.- A.2.6 Standard-Dateien INPUT, OUTPUT.- Übg Übungsaufgaben.- Geordnet nach dem ACM-Index.- Lit Literaturverzeichnis.- Lit. l Lehrbücher.- Lit.2 Anwendungen.- Ind Alphabetischer Index.- Fachausdrücke, deutsch/englisch.Table of Contents0 Einleitung und Notationen.- 0.1 Historische Entwicklung.- 0.2 Einführende Beispiele.- 0.2.1 Anzahl der Buchstaben E/e in einem Satz.- 0.2.2 Turm von Hanoi, rekursive Lösung.- 0.3 Schreibweisen.- 0.3.1 Quelltext-Zeichen und lexikalische Symbole.- 0.3.2 Verwendung des Syntax-Diagramms, siehe A.1.- 0.3.3 Kommentar.- 0.4 Testfragen.- 1 Einfache Datentypen und Ein/Ausgabe.- 1.1 AufZählungstypen und Unterbereichstypen.- 1.2 CHAR, siehe A.2.2.- 1.3 BOOLEAN, siehe A.2.2.- 1.4 Ordinale und Simple Typen.- 1.5 Zahlbezeichnungen.- 1.6 INTEGER, siehe A.2.2.- 1.7 REAL, siehe A.2.2.- 1.8 String, vgl. 5.3.- 1.9 Einfache Ein/Ausgabe mit READ, WRITE.- 1.10 Testfragen.- 2 Einfacher Programmaufbau.- 2.1 Verfügbarmachung externer Dateien, vgl. 8.- 2.2 Vereinbarungen.- 2.2.1 Zielvereinbarung (LABEL).- 2.2.2 Konstantenvereinbarung (CONST).- 2.2.3 Typvereinbarung (TYPE).- 2.2.4 Variablenvereinbarung (VAR).- 2.3 Testfragen.- 3 Ausdrücke.- 3.1 Primärausdrücke.- 3.1.1 Aufrufe von Standard-Funktionen, siehe A.2.4.- 3.1.2 Rundung ROUND, Abschneiden TRUNC.- 3.2 Ausdrücke, allgemein.- 3.2.1 Prioritäten von Operatoren.- 3.2.2 Ganzahlige Division DIV, Rest MOD.- 3.3 Testfragen.- 4 Anweisungen.- 4.1 Assignment Statement.- 4.2 Empty Statement.- 4.3 IF Statement.- 4.4 CASE Statement.- 4.5 Schleifen.- 4.5.1 FOR Statement.- 4.5.2 WHILE Statement.- 4.5.3 REPEAT Statement.- 4.6 Folgen von Anweisungen (compound statement).- 4.7 Label, GOTO Statement.- 4.8 Testfragen.- 5 Reihung (Array) und Mengenbildung (SET).- 5.1 Reihungstyp, Komponente.- 5.2 PACKED, vgl. A.2.5.2.- 5.3 String, vgl. 1.8.- 5.4 Potenzmengentyp, Mengen-Aggregat.- 5.5 Testfragen.- 6 Zeiger und Verbund.- 6.1 Zeiger (^ Symbol).- 6.1.1 Zeigertyp, Allokation, Selektor.- 6.2 Verbund (RECORD).- 6.2.1 Verbundtyp, Komponente, Selektor.- 6.2.2 Namensabkürzung für Komponenten (WITH).- 6.3 Testfragen.- 7 Unterprogramme.- 7.1 Unterprogramm-Technik.- 7.1.1 Unterprogramm-Vereinbarung, FORWARD- Spezifikation.- 7.1.2 Unterprogramm-Aufruf, Rekursion.- 7.2 Parameterübergabe.- 7.2.1 Wert-Parameter.- 7.2.2 VAR -Parameter.- 7.2.3 Unterprogramm-Parameter.- 7.3 Konforme Reihungsschemata (level 1 implementation).- 7.4 Prozedur (PROCEDURE).- 7.5 Funktion (FUNCTION).- 7.6 Rundreise-Problem.- 7.7 Bereichsschachtelung.- 7.7.1 Vereinbart / nicht vereinbart.- 7.7.2 Lokal / global.- 7.7.3 Erzeugt / nicht erzeugt, Ausnahmen.- 7.7.4 Aufrufbar / unterdrückt.- 7.7.5 Bereichsfreie Größen, Speicherbereinigung,u.a.m..- 7.8 Testfragen.- 8 Datei (File).- 8.l Sequentieller Dateityp, Modus, Komponente.- 8.2 Text-Datei (TEXT), siehe A.2.2/5/6.- 8.3 Testfragen.- A Anhang.- A. l Syntax-Diagramme.- A.2 Standard-Bibliothek (Vordefinierte Vereinbarungen).- A.2.1 Standard-Konstanten.- A.2.2 Standard-Typen.- A.2.3 Standard-Operationen.- A.2.3.1 Arithmetic Operations.- A.2.3.2 Relational Operations.- A.2.3.3 Boolean Operations.- A.2.3.4 Set Operations.- A.2.3.5 Other ‘Operations’.- A.2.4 Standard-Funktionen.- A.2.4.1 Arithmetic Functions.- A.2.4.2 Boolean Functions (Predicates).- A.2.4.3 Transfer Functions.- A.2.4.4 Further Standard Functions.- A.2.5 Standard-Prozeduren.- A.2.5.1 Dynamic Allocation Procedures.- A.2.5.2 Data Transfer Procedures.- A.2.5.3 File Handling Procedures.- A.2.5.4 Input- Procedures READ and READLN.- A.2.5.5 Output-Procedures WRITE and WRITELN.- A.2.6 Standard-Dateien INPUT, OUTPUT.- Übg Übungsaufgaben.- Geordnet nach dem ACM-Index.- Lit Literaturverzeichnis.- Lit. l Lehrbücher.- Lit.2 Anwendungen.- Ind Alphabetischer Index.- Fachausdrücke, deutsch/englisch.

Read more less

Book SynopsisParts of this text were used for several years by students in a one~term under­ graduate course in computer science. The students had to prepare projects in small groups (2~4 students).1 This book emphasizes practical experience with image processing. It offers a comprehensive study of • image processing and image analysis, • basics of speech processing, • object~oriented programming, • software design, • and programming in C++. The book is divided into four parts. In the first part we introduce image processing, image analysis, programming tools, and the basics of C++. In the second part we describe object~oriented programming in general and the possible applications of object~oriented concepts in C++. Several appli­ cations of object~oriented programming for image processing are discussed as well. The new features of C++ are introduced entirely through the use of examples. We cover the proper representation of the data that is a result of pattern analysis as well. The third part describes a complete system for image segmentation. Some of the material covered refers to the exercises found in the first and second parts: this verifies our belief that an image segmentation system of programs can be developed while simultaneously acquainting others to C++. We combine the data representation described in the second part with the algorithms that use and manipulate them here in the third part.Table of ContentsI Introductions.- 1 Pattern Recognition.- 1.1 Images and Sound.- 1.2 Applications of Pattern Recognition.- 1.3 Environment, Problem Domain, and Patterns.- 1.4 Characterization of Pattern Recognition.- 1.5 Recording of Speech Signals.- 1.6 Video Cameras and Projections.- 1.7 From Continuous to Digital Signals.- 1.8 Sampling Theorem in Practice.- 1.9 Visualization and Sound Generation.- 2 From C to C++.- 2.1 Syntax Notation.- 2.2 Principle of C++ Compilation.- 2.3 Function Calls and Arguments.- 2.4 Declaration and Definition of Variables.- 2.5 Unix-File Access via Standard Functions.- 2.6 Formatted Input and Output.- 2.7 Main Program.- 2.8 Preprocessor Directives.- 2.9 Conditional Compilation.- 3 Software Development.- 3.1 Software for Pattern Recognition.- 3.2 Principles of Software Development.- 3.3 Modular and Structured Programming.- 3.4 Comments and Program Layout.- 3.5 Documentation.- 3.6 Teamwork.- 3.7 Efficiency.- 3.8 Tools for Software Development with Unix.- 3.9 PUMA.- 4 Expressions, Statements, Functions.- 4.1 Instructions and Expressions.- 4.2 Logical Values and Conditionals.- 4.3 Function Definition.- 4.4 Loops.- 4.5 Declarations and Scope.- 4.6 Switches.- 4.7 Linkage.- 4.8 Programming with Modules.- 4.9 Control Structures.- 5 Classification and Pattern Analysis.- 5.1 Classification.- 5.2 Preprocessing.- 5.3 Feature Extraction.- 5.4 Analysis.- 5.5 Image Segmentation.- 5.6 Speech Segmentation.- 5.7 Pattern Understanding.- 5.8 Active Vision and Real Time Processing.- 5.9 Top-Level Loop for Speech Analysis.- 6 Arrays and Pointers.- 6.1 Vectors and Matrices.- 6.2 Pointers.- 6.3 Vectors vs. Pointers.- 6.4 Vector Initialization.- 6.5 Strings.- 6.6 Pointers Operations and Allocation.- 6.7 Pointer and Array Arguments.- 6.8 Pointer to Pointer.- 6.9 Main Function Arguments.- 7 Statistics for Pattern Recognition.- 7.1 Axioms.- 7.2 Discrete Random Variables.- 7.3 Continuous Random Variables.- 7.4 Mean and Variance.- 7.5 Moments of a Distribution.- 7.6 Random Vectors.- 7.7 Statistical Features and Entropy.- 7.8 Signal-to-Noise Ratio.- 7.9 Histograms.- 8 C++ as a better C.- 8.1 Type Declaration.- 8.2 Type Conversion for Pointers.- 8.3 Bit- and Shift-Operations.- 8.4 Type Specifiers and Variable Declaration.- 8.5 Type-Safe Linkage.- 8.6 Overloaded Function Names.- 8.7 Return Value and Arguments.- 8.8 Macros and Inline Functions.- 8.9 Function Pointers.- II Object-Oriented Pattern Analysis.- 9 Object-Oriented Programming.- 9.1 Object-Oriented Software Techniques.- 9.2 Basic Concepts.- 9.3 Data Abstraction and Modules.- 9.4 Inheritance.- 9.5 Abstract Classes.- 9.6 Object-Oriented Classification.- 9.7 Polymorphism.- 9.8 Other Object-Oriented Concepts.- 9.9 Class Libraries.- 10 Classes in C++.- 10.1 Structures.- 10.2 Methods and ADT’s.- 10.3 Class Declarations.- 10.4 Object Construction.- 10.5 Destruction of Objects.- 10.6 Overloaded Operators.- 10.7 Advanced Methods and Constructors.- 10.8 Vector Class.- 10.9 Class Design.- 11 Intensity Images.- 11.1 Array Class.- 11.2 Templates in C++.- 11.3 Images.- 11.4 External Data Formats.- 11.5 Binary Images.- 11.6 Color Images.- 11.7 Sub Images.- 11.8 Image Transformation and Registration.- 11.9 Neighborhood.- 12 Inheritance in C++-Classes.- 12.1 Motivation and Syntax.- 12.2 Base Class Access.- 12.3 Construction and Destruction.- 12.4 Pointer to Objects.- 12.5 Virtual Functions.- 12.6 Abstract Classes.- 12.7 Image Class Hierarchy.- 12.8 Multiple Inheritance.- 12.9 Implementation Issues.- 13 Edge Detection and Edge Images.- 13.1 Motivation.- 13.2 Strategies.- 13.3 Discrete Derivative of the Intensity.- 13.4 Sobel and Prewitt Operator.- 13.5 Bit Fields in C++.- 13.6 Unions in C++.- 13.7 Edge Class.- 13.8 Edge Images.- 13.9 Color Edge Operators.- 14 Class Libraries.- 14.1 Stream Input and Output.- 14.2 NIH Class Library.- 14.3 Dynamic Class Descriptions.- 14.4 Static Class Members.- 14.5 Input and Output for Objects.- 14.6 Strings.- 14.7 Container Classes.- 14.8 Time and Date.- 14.9 More Classes.- 15 Hierarchy of Picture Processing Objects.- 15.1 General Structure.- 15.2 Hippos Object.- 15.3 Images and Matrices.- 15.4 Chain Code Class.- 15.5 Enumerations and Scope Resolution.- 15.6 Polygonal Representation.- 15.7 Atomic Objects.- 15.8 Segmentation Objects.- 15.9 External Representation.- 16 Spectral Features and Speech Processing.- 16.1 Fourier Series and Fourier Transform.- 16.2 Discrete Fourier Transform.- 16.3 Fast Fourier Transform.- 16.4 2D Fourier Transform.- 16.5 Short time Fourier analysis.- 16.6 Linear Predictive Coding.- 16.7 Dynamic Time Warping.- 16.8 Hidden Markov Models.- 16.9 Different Types of Hidden Markov Modells.- III Pattern Recognition Algorithms.- 17 An Image Analysis System.- 17.1 Data Flow.- 17.2 Design of ANIMALS.- 17.3 XDR.- 17.4 Display and Capture.- 17.5 Graphical User Interfaces.- 17.6 Geometric Distortions.- 17.7 Polymorphic image processing.- 17.8 Efficiency.- 17.9 Image Segmentation Program.- 18 Synthetic Signals and Images.- 18.1 Synthetic Sound.- 18.2 Geometric Patterns.- 18.3 Pixel Noise.- 18.4 Gaussian Noise.- 18.5 Salt-and-Pepper Noise.- 18.6 Different Views of a 3D Polyhedral Object.- 18.7 Digits and Letters.- 18.8 Single Stereo Images.- 18.9 Spectrogram.- 19 Filtering and Smoothing Signals.- 19.1 Mean-Filter and Gaussian-Filter.- 19.2 Median-Filter.- 19.3 Smoothed Median-Filter.- 19.4 Edge Preserving Smoothing.- 19.5 K-Nearest Neighbor Averaging.- 19.6 Conditional Average Filter.- 19.7 Linear Reconstruction.- 19.8 Elimination of Noisy Image Rows.- 19.9 Resolution Hierarchies.- 20 Histogram Algorithms.- 20.1 Discriminant and Least Squares Threshold.- 20.2 Histogram Entropy Thresholding.- 20.3 Multithresholding.- 20.4 Local Histogram Equalization.- 20.5 Lookup Table Transformation.- 20.6 A Class for Histograms.- 21 Edge Images.- 21.1 Robert’s Cross.- 21.2 Second Derivative.- 21.3 Edge Model Masks.- 21.4 Alternative Methods.- 21.5 Thinning of Edge Images.- 21.6 Edge Thresholding.- 21.7 Non Maxima Suppression.- 21.8 Non Maxima Absorption.- 21.9 Class Edge Revisited.- 22 Line Detection Algorithms.- 22.1 Line Detection.- 22.2 Local Connectivity.- 22.3 Hysteresis Thresholds.- 22.4 Closing of Gaps.- 22.5 Zero crossings in Laplace-Images.- 22.6 Hough Transform.- 22.7 Canny Line Detection.- 22.8 Shen and Castan.- 22.9 Representation as Segmentation Objects.- 23 Chain Codes.- 23.1 Length of a Chain.- 23.2 Smoothing.- 23.3 Digital Linear Lines.- 23.4 Similarity.- 23.5 Intersections.- 23.6 Rotation.- 23.7 Conversion.- IV Appendix.- A Basics of C++.- A.1 History.- A.2 Identifier and Constants.- A.3 Basis Data Types in C and C++.- B Software Development Tools.- B.1 Groups and ID’s with Unix.- B.2 Program Building with make.- B.3 The Use of Libraries.- B.4 Version and Access Control with rcs.- C Source Codes and Tools.- C.1 List of Tools.- C.2 How to get the sources.- C.3 X11.- C.4 Slides.- C.5 Addresses.- C.6 Headers and Source Files.- C.7 Dummy Definitions.- C.7.1 Listing of animals/dummy/Dictionary.h.- C.7.2 Listing of animals/dummy/OIOxdr.h.- C.7.3 Listing of animals/ dummy/Represent.h.- C.7.4 Listing of animals/dummy/SeqCltn.h.- C.7.5 Listing of animals/dummy/Set.h.- C.7.6 Listing of animals/dummy/dummies. C.- References.- Figures.- Tables.- Index for Exercises.

Read more less

Book SynopsisDieses Buch vermittelt beispielhaft das notwendige Know-how zum Entwurf und zur Entwicklung verteilter Anwendungen. Die Umsetzung erfolgt mittels der relevanten Middleware-Technologien in Java. Zunächst werden die grundlegenden Verfahren wie Datenaustausch über Sockets, Parallelisierung durch Threads und Synchronisation über Monitore und Semaphore behandelt. Darauf aufbauend erfährt der Leser alles, was er in der Praxis benötigt, zu Java Message Service (JMS) und Remote Method Invocation (RMI). Die Darstellung erfolgt nachvollziehbar anhand praxisnaher Beispiele, Aufgaben helfen das Gelernte aktiv einzuüben. Zur Kommunikation über verteilte Objekte wird eine Einführung in CORBA gegeben und der Einsatz dieser Architektur anhand der Programmiersprache Java vorgestellt.Table of ContentsArchitektur verteilter Anwendungen - Nebenläufigkeit in Java - Synchronisationsmechanismen - Design und Implementierung von Client/Server-Software über Sockets - Serialisierung - Verteilte Objekte über Remote Method Invocation - Einführung in CORBA - Java Message Service (JMS): Schnittstelle für nachrichtenorientierte Middleware - Online-Service mit Quellcode, Aufgaben und Powerslides

Read more less

Book SynopsisProfitieren Sie von diesem einfachen Ansatz, Java zu erlernen, damit das Lesen, Schreiben und Ausführen von Programmen gelingt! Eine präzise und verständliche Einführung in die Programmierung, mit sauberen Begriffen, klarer und nachvollziehbarer Darstellung und korrekter Methodik. Berücksichtigt wird J2SE in der Version 5.0, so dass auch Generische Einheiten, Aufzählungstypen und viele andere wichtige Spracheigenschaften zum Zuge kommen. Unterstützende Daten stehen dem Leser kostenlos im Web zur Verfügung. Trade Review"Ziel des Autors ist, in das Arbeiten mit Java möglichst einfach und verständlich einzuführen. Er verwendet oft anschauliche Begriffe aus der Allgemeinsprache [...]. Dennoch bleibt der Autor aber stets präzise. Die didaktisch geschickte Darstellung stützt sich auf viele Beispiele, Schritt-für-Schritt-Anweisungen und Aufgaben mit Lösungsvorschlägen." ekz-Informationsdienst, ID 32/05Table of ContentsProgrammieren als ein Rollenspiel - Drei Arten von Befehlen: Vereinbarungen, Ausdrücke und Anweisungen - Variablen als Bojen darstellen - Reihungen (arrays), einstufige, mehrstufige und mehrdimensionale Vom Modul zur Klasse - Abstrakte Klassen und total abstrakte Klassen (Schnittstellen)

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 SynopsisGegenstand dieses Werkes sind die Theorie und Praxis der modernen funktionalen Programmierung. Dabei betrachten die Autoren aber nicht nur das, was mittels der heute implementierten Sprachen wie HASKELL, OPAL, ML usw. machbar ist, sondern weisen auch auf aktuelle Entwicklungen hin. Zum einen werden fortgeschrittene Programmiertechniken vorgestellt, wie z.B. die Verwendung unendlicher Datenstrukturen, Parser als Funktionen höherer Ordnung, Approximations-Algorithmen, Lösung von Gleichungssystemen usw. Zum anderen werden aber auch Sprachkonzepte diskutiert, wie z.B. eine systematische Form der Modularisierung oder besonders ausdrucksstarke und flexible Formen der Typisierung. Ein besonderes Gewicht wird generell auf die Integration verschiedener Paradigmen gelegt, wie etwa die Verbindung mit Konzepten der objektorientierten, der nebenläufigen oder der Constraint-basierten Programmierung. In diesem Zusammenhang wird speziell auch die Bedeutung von Monaden analysiert und kritisch hinterfragt.Trade ReviewAus den Rezensionen: "Bei diesem Titel … werden … fortgeschrittene Leser angesprochen, die mit den Grundlagen der funktionalen Programmierung vertraut sind. … ‘Im Vordergrund stehen Ideen und Konzepte einer eleganten, sicheren und produktiven Form des Programmierens‘, wobei der Blick in die Zukunft gerichtet ist und Konzepte und Methoden vorgestellt werden, die erst in den Sprachen der nächsten Generation verfügbar sein werden. Geeignet für Bibliotheken … an Hochschulstandorten … Das Lehrbuch kann noch weiter genutzt werden." (Isigkeit, in: ekz-Informationsdienst, 2006)Table of ContentsElementare Funktionale Programmierung Eine Wiederholung.- Das Strittigste vorab: Notationen.- Grundlagen der Funktionalen Programmierung.- Faulheit währt unendlich.- Parser als Funktionen höherer Ordnung.- Strukturierung von Programmen.- Gruppen: Die Basis der Modularisierung.- Operatoren auf Gruppen (Morphismen).- Die Idee der Typisierung.- Typen.- Subtypen (Vererbung).- Polymorphe und abhängige Typen.- Spezifikationen und Typklassen: Wie Typen typisiert werden.- Beispiel: Berechnung von Fixpunkten.- Beispiel: Monaden.- Datenstrukturen.- Netter stack und böse Queue.- Compilertechniken für funktionale Datenstrukturen.- Funktionale Arrays und Numerische Mathematik.- Map: Wenn Funktionen zu Daten werden.- Beispiel: Synthese von Programmen.- Integration von Paradigmen.- Zeit und Zustand in der funktionalen Welt.- Objekte und Ein-/Ausgabe.- Agenten und Prozesse.- Graphische Schnittstellen (GUIs).- Massiv parallele Programme.- Integration von Konzepten anderer Programmierparadigmen.

Read more less

Book SynopsisTesting is the primary hardware and software verification technique used by industry today. Usually, it is ad hoc, error prone, and very expensive. In recent years, however, many attempts have been made to develop more sophisticated formal testing methods. This coherent book provides an in-depth assessment of this emerging field, focusing on formal testing of reactive systems. This book is based on a seminar held in Dagstuhl Castle, Germany, in January 2004. It presents 19 carefully reviewed and revised lectures given at the seminar in a well-balanced way ensuring competent complementary coverage of all relevant aspects. An appendix provides a glossary for model-based testing and basics on finite state machines and on labelled transition systems. The lectures are presented in topical sections on testing of finite state machines, testing of labelled transition systems, model-based test case generation, tools and case studies, standardized test notation and execution architectures, and beyond testing.Table of ContentsTesting of Finite State Machines.- I. Testing of Finite State Machines.- 1 Homing and Synchronizing Sequences.- 2 State Identification.- 3 State Verification.- 4 Conformance Testing.- II. Testing of Labeled Transition Systems.- Testing of Labeled Transition Systems.- 5 Preorder Relations.- 6 Test Generation Algorithms Based on Preorder Relations.- 7 I/O-automata Based Testing.- 8 Test Derivation from Timed Automata.- 9 Testing Theory for Probabilistic Systems.- III. Model-Based Test Case Generation.- Model-Based Test Case Generation.- 10 Methodological Issues in Model-Based Testing.- 11 Evaluating Coverage Based Testing.- 12 Technology of Test-Case Generation.- 13 Real-Time and Hybrid Systems Testing.- IV. Tools and Case Studies.- Tools and Case Studies.- 14 Tools for Test Case Generation.- 15 Case Studies.- V. Standardized Test Notation and Execution Architecture.- Standardized Test Notation and Execution Architecture.- 16 TTCN-3.- 17 UML 2.0 Testing Profile.- VI. Beyond Testing.- Beyond Testing.- 18 Run-Time Verification.- 19 Model Checking.- VII. Appendices.- Appendices.- 20 Model-Based Testing – A Glossary.- 21 Finite State Machines.- 22 Labelled Transition Systems.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the First International Conference on Fundamental Approaches to Software Engineering, FASE'98, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, held in Lisbon, Portugal, in March/April 1998.Besides two invited presentations and three system demonstrations, this volume presents 18 revised full papers selected from a total of 59 submissions. Among the various fundamental software engineering issues addressed are formal methods, specification languages, refinement, object-oriented modeling, software architectures, statecharts, model checking, etc.Table of ContentsExtreme programming: A humanistic discipline of software development.- Some mistakes I have and what I have learned from them.- Specifying and analyzing dynamic software architectures.- Observational proofs with critical contexts.- Integrating AORTA with model-based data specification languages.- Specifying safety-critical embedded systems with statecharts and Z: A case study.- Specifying embedded systems with statecharts and Z: An agenda for cyclic software components.- Algebra transformation systems and their composition.- Navigation expressions in object-oriented modelling.- Compositional verification of reactive systems specified by graph transformation.- Reflections on the design of a specification language.- Constructs, concepts and criteria for reuse in concurrent object-oriented languages.- Backtracking-free design planning by automatic synthesis in metaframe.- Model-checking CSP-Z.- Rule-based refinement of high-level nets preserving safety properties.- Automated formal analysis of networks: FDR models of arbitrary topologies and flow-control mechanisms.- Behaviour analysis and safety conditions: A case study in CML.- Distributed safety controllers for web services.- A refinement calculus for statecharts.- Refining formal specifications of human computer interaction by graph rewrite rules.- RELVIEW — A system for calculating with relations and relational programming.- ALBERT: A formal language and its supporting tools for requirements engineering.- Moby/plc — A design tool for hierarchical real-time automata.

Read more less

Book SynopsisDie Entwicklungsumgebung.- Komponenten für die Benutzeroberfläche.- Elementare Datentypen und Anweisungen.- Einige Klassen der Standardbibliothek.- Funktionen.- Objektorientierte Programmierung.- Exception-Handling.- Die Bibliothek der visuellen Komponenten (VCL).- Templates und die STL.- Verschiedenes.

Read more less

Book SynopsisThis Brief provides a roadmap for the R language and programming environment with signposts to further resources and documentation.Table of ContentsIntroduction to R.- Data Structures.- Tables and Graphs.- Hypothesis Tests.- Linear Models.

Read more less

Book SynopsisThis tutorial book presents revised and extended lecture notes for a selection of the contributions presented at the International Summer School on Generative and Transformational Techniques in Software Engineering (GTTSE 2009), which was held in Braga, Portugal, in July 2009. The 16 articles comprise 7 long tutorials, 6 short tutorials and 3 participants contributions; they shed light on the generation and transformation of programs, data, models, metamodels, documentation, and entire software systems. The topics covered include software reverse and re-engineering, model driven engineering, automated software engineering, generic language technology, and software language engineering.Table of ContentsAn Introduction to Software Product Line Refactoring.- Excerpts from the TXL Cookbook.- Model Synchronization: Mappings, Tiles, and Categories.- An Introductory Tutorial on JastAdd Attribute Grammars.- Model Driven Language Engineering with Kermeta; EASY Meta-programming with Rascal.- The Theory and Practice of Modeling Language Design for Model-Based Software Engineering—A Personal Perspective.- Code Transformations for Embedded Reconfigurable Computing Architectures.- Model Transformation Chains and Model Management for End-to-End Performance Decision Support; Building Code Generators with Genesys: A Tutorial Introduction; The Need for Early Aspects.- Lightweight Language Processing in Kiama .- Some Issues in the ‘Archaeology’ of Software Evolution; Teaching Computer Language Handling – From Compiler Theory to Meta-modelling; C++ Metastring Library and Its Applications.- Language Convergence Infrastructure.

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 23rd International Conference on Computer Aided Verification, CAV 2011, held in Snowbird, UT, USA, in July 2011. The 35 revised full papers presented together with 20 tool papers were carefully reviewed and selected from 161 submissions. The papers are organized in topical sections on the following workshops: 4th International Workshop on Numerical Software Verification (NSV 2011), 10th International Workshop on Parallel and Distributed Methods in Verifications (PDMC 2011), 4th International Workshop on Exploiting Concurrency Efficiently and Correctly (EC2 2011), Frontiers in Analog Circuit Synthesis and Verification (FAC 2011), International Workshop on Satisfiability Modulo Theories, including SMTCOMP (SMT 2011), 18th International SPIN Workshop on Model Checking of Software (SPIN 2011), Formal Methods for Robotics and Automation (FM-R 2011), and Practical Synthesis for Concurrent Systems (PSY 2011).

Read more less

Book SynopsisThis book constitutes the refereed proceedings of the 16th International Conference on Model Driven Engineering Languages and Systems, MODELS 2013, held in Miami, FL, USA, in September/October 2013. The 47 full papers presented in this volume were carefully reviewed and selected from a total of 180 submissions. They are organized in topical sections named: tool support; dependability; comprehensibility; testing; evolution; verification; product lines; semantics; domain-specific modeling languages; models@RT; design and architecture; model transformation; model analysis; and system synthesis.Table of ContentsTool support.- Dependability.- Comprehensibility.- Testing.- Evolution.- Verification.- Product lines.- Semantics.- Domain-specific modeling languages.- Design and architecture.- Model transformation.- Model analysis.- System synthesis.

Read more less

Book SynopsisObject-Process Methodology (OPM) is an intuitive approach to systems engineering. This book presents the theory and practice of OPM with examples from various industry segments and engineering disciplines, as well as daily life. OPM is a generic, domain independent approach that is applicable almost anywhere in systems engineering.Table of ContentsI Foundations of Object-Process Methodology.- 1 A Taste of OPM.- 1.1 The Wedding Example: A Sneak Preview of OPM.- 1.2 OPM Building Blocks: Objects, Processes, and States.- 1.3 Specialization and Inheritance.- 1.4 Aggregation and the Result Link.- Summary.- Problems.- 2 Object-Process Diagrams.- 2.1 Objects and Aggregation.- 2.2 Structural Relations and Structural Links.- 2.3 Processes and Procedural Links.- 2.4 System Diagram: The Top-Level OPD.- 2.5 Zooming into the Transaction Executing Process.- 2.6 The OPD Set.- 2.7 How to Read an OPD.- 2.7.1 Flow of Control.- 2.7.2 The Timeline in OPDs.- 2.7.3 Object States and Conditions.- 2.8 Completing the In-Zoomed Transaction Executing OPD.- 2.8.1 Logical XOR, AND, and OR Operators.- 2.8.2 The System Map.- 2.8.3 The Ultimate OPD.- 2.8.4 Zooming Out of Transaction Executing.- Summary.- Problems.- 3 Object-Process Language.- 3.1 Motivation for a Language.- 3.1.1 Real-Time Textual Feedback.- 3.1.2 Closing the Requirements-Implementation Gap.- 3.2 Structural Links and Structure Sentences.- 3.2.1 The First OPL Sentence.- 3.2.2 The First OPL Aggregation Sentence.- 3.3 The OPL Paragraph and the Graphics-Text Principle.- 3.3.1 Extending the OPL Paragraph.- 3.3.2 Enabling Sentences.- 3.3.3 Transformation Sentences.- 3.3.4 The SD Paragraph.- 3.4 More OPL Sentence Types.- 3.4.1 State Enumeration and Condition Sentences.- 3.4.2 AND, XOR, and OR Logical Operators.- 3.4.3 The SD1 Paragraph.- 3.4.4 In-Zooming and Out-Zooming Sentences.- 3.5 Boolean Objects and Determination Sentence.- 3.5.1 Boolean Condition Sentences.- 3.5.2 Compound Condition Sentences.- 3.5.3 State-Specified Generation Sentence.- 3.5.4 Converting a Dual-State Object into a Boolean Object.- 3.6 OPD-OPL Item Pairs and Synergy.- Summary.- Problems.- 4 Objects and Processes.- 4.1 Existence, Things, and Transformations.- 4.1.1 Objects.- 4.1.2 Transformation and Processes.- 4.2 Processes and Time.- 4.2.1 Cause and Effect.- 4.2.2 Syntactic vs. Semantic Sentence Analysis.- 4.2.3 The Process Test.- 4.3 Things.- 4.3.1 Things and Entities.- 4.3.2 The Perseverance of Things.- 4.3.3 The Essence of Things.- 4.3.4 Symbolizing Physical Things.- 4.3.5 The Origin of Things.- 4.3.6 The Complexity of Things.- 4.3.7 Thing Types.- 4.3.8 The Relativity of Object and Process Importance.- 4.3.9 Object and Process Naming.- 4.4 Informatical Objects.- 4.4.1 Telling Informatical and Physical Objects Apart.- 4.4.2 Systems and Information Systems.- 4.4.3 Translation of Informatical Objects.- 4.4.4 Toward “Pure” Informatical Objects.- 4.5 Object Identity.- 4.5.1 Change of State or Change of Identity?.- 4.5.2 Classes and Instances of Objects and Processes.- Summary.- Problems.- II Concepts of OPM Systems Modeling.- 5Dynamics.- 5.1 States.- 5.1.1 Object States and Status.- 5.1.2 Change and Effect.- 5.1.3 Explicit and Implicit Status Representations.- 5.1.4 The Input, Output, and Effect Links.- 5.1.5 State Suppression and the Effect Link.- 5.1.6 State Expression.- 5.2 Existence and Transformation.- 5.2.1 Result and Consumption Links.- 5.2.2 Procedural Links, Enablers, and Transformées.- 5.2.3 Enablers.- 5.2.4 Agents.- 5.2.5 Instruments.- 5.2.6 Enabling Links.- 5.2.7 Transformées.- 5.2.8 Odd Man Out: The Invocation Linkt.- 5.3 Object Roles with Respect to a Process.- 5.3.1 Enablers and Affectees.- 5.3.2 The Involved, Preprocess, and Postprocess Object Sets.- 5.3.3 Condition and Agent Condition Links.- 5.3.4 Operator, Operand, and Transform?.- Summary.- Problems.- 6Structure.- 6.1 Structural Relations.- 6.1.1 Structural Links.- 6.1.2 Structural Relation Directions.- 6.1.3 Unidirectional Structural Link.- 6.1.4 OPD Sentences.- 6.1.5 The Reciprocity of a Structural Relation.- 6.1.6 Null Tags and Their Default OPL Reserved Phrases.- 6.1.7 Structural Relations as Static Verbs.- 6.2 Participation Constraints and Cardinality.- 6.2.1 Participation Constraints.- 6.2.2 Parameterized Participation Constraints.- 6.2.3 Range Participation Constraints.- 6.2.4 Shorthand Notations and Reserved Phrases.- 6.2.5 Cardinality.- 6.2.6 Participation Constraints in Procedural Relations.- 6.3 The Distributive Law and Forks.- 6.3.1 Forks.- 6.3.2 Fork Degree.- 6.3.3 Fork Comprehensiveness.- 6.4 The Transitivity of Structural Relations.- 6.5 The Four Fundamental Structural Relations.- Summary.- Problems.- 7Aggregation and Exhibition.- 7.1 Aggregation-Participation: Underlying Concepts.- 7.1.1 Aggregation-Participation as a Tagged Structural Relation.- 7.1.2 The Aggregation-Participation Symbol.- 7.1.3 Sets and Order.- 7.1.4 Aggregate Naming.- 7.1.5 Aggregating Processes.- 7.2 Aggregation Hierarchy and Comprehensiveness.- 7.2.1 Aggregation Hierarchy.- 7.2.2 Aggregation Comprehensiveness.- 7.2.3 Parameterized Participation Constraints.- 7.2.4 Participation Level and Aggregational Complexity.- 7.3 Exhibition-Characterization: Underlying Concepts.- 7.3.1 The Name Exhibition-Characterization.- 7.3.2 The Exhibition-Characterization Symbol.- 7.3.3 Attribute and Operation Are Features.- 7.3.4 Exhibition Complexity.- 7.4 Features in 00 vs. OPM.- 7.5 The Four Thing-Feature Combinations.- 7.5.1 The Object-Attribute Combination.- 7.5.2 The Object-Operation Combination.- 7.5.3 The Process-Attribute Combination.- 7.5.4 Process-Operation Combination.- 7.6 The Feature Hierarchy.- 7.7 Feature-Related Natural Language Issues.- 7.7.1 Attribute Naming Dilemmas.- 7.7.2 Reserved Objects and the Measurement Unit Reserved Object.- 7.7.3 Continuous Values and Multi-Valued Attributes.- 7.7.4 Mathematical Inequalities in OPM.- 7.8 Reflective Metamodeling of an Attribute.- 7.8.1 The Size of an Attribute.- 7.8.2 The Mode of an Attribute.- 7.8.3 The Touch of an Attribute.- 7.8.4 The Source of a Feature.- 7.8.5 The Operation a Feature Carries.- Summary.- Problems.- 8 Generalization and Instantiation.- 8.1 Generalization-Specialization: Introduction.- 8.1.1 Specialization Symbol and Sentence.- 8.1.2 Process Specialization.- 8.2 Inheritance.- 8.2.1 Feature Inheritance.- 8.2.2 Structural Relations Inheritance.- 8.2.3 Procedural Link Inheritance.- 8.2.4 State Inheritance.- 8.2.5 State Specialization.- 8.2.6 Process Specialization.- 8.2.7 Generalization Complexity.- 8.3 Qualification.- 8.3.1 Qualification Inheritance.- 8.3.2 Multiple Qualification Inheritance.- 8.4 Classification-Instantiation.- 8.4.1 Classes and Instances.- 8.4.2 The Relation Between Instantiation and Specialization.- 8.4.3 The Relativity of Instance.- 8.4.4 Instance Qualification.- 8.4.5 Process Instances.- 8.4.6 Classification Complexity.- 8.5 Modifiers and Instances.- 8.5.1 Natural Language Modifiers and Shortcuts.- 8.5.2 Adjectives and Attributes.- 8.5.3 Adverbs and Operations.- 8.6 Specializations of the Involved Object Set Members.- 8.7 Non-Comprehensiveness.- 8.7.1 Non-Comprehensiveness of Fundamental Structural Relations.- 8.7.2 Non-Comprehensiveness of States and Values.- Summary.- Problems.- 9 Managing Systems’ Complexity.- 9.1 The Need for Complexity Management.- 9.1.1 Middle-Out as the De-Facto Architecting Practice.- 9.1.2 Determining the Extent of Refinement.- 9.1.3 Towards Quantifying Complexity.- 9.2 Divide and Conquer: By Aspects or by Details?.- 9.2.1 Why is Detail Decomposition Good?.- 9.2.2 When Should a New OPD Be Created?.- 9.3 The Attributes of Scaling.- 9.3.1 The Purpose of Scaling.- 9.3.2 The Mode of Scaling.- 9.3.3 Controlling Visibility by In- and Out-Zooming.- 9.3.4 The Distributivity of Procedural Links.- 9.3.5 Unfolding and Folding.- 9.3.6 State Expressing and Suppressing.- 9.3.7 Primary and Secondary Operands.- 9.4 Abstracting.- 9.4.1 Consolidating.- 9.4.2 Zoom consolidating.- 9.4.3 Paths and Path Labels.- 9.4.4 Zoom Consolidating Pitfalls.- 9.4.5 Zoom Consolidating Conditions.- 9.4.6 Fold Consolidating.- 9.5 What Happens to Procedural Links During Abstracting?.- 9.5.1 Procedural Link Precedence.- 9.5.2 Semi-Folding and Semi-Unfolding.- 9.5.3 Selective Semi-Folding and Semi-Unfolding.- 9.6 Looking at the Big Picture: The System Map and the OPM Construct Pairs.- Summary.- Problems.- III Building Systems with OPM.- 10 Systems and Modeling.- 10.1 Defining Systems.- 10.1.1 Some Existing Definitions.- 10.1.2 Function.- 10.1.3 The Various Functions of Stone.- 10.2 System Defined.- 10.2.1 System as a Relative Term.- 10.2.2 System as a Subjective Term.- 10.2.3 The Function of Naturaland Artificial Systems.- 10.3 Goal, Concept, and Function.- 10.3.1 The Intent and Goal of Artificial Systems.- 10.3.2 Telling System Function and Dynamics Apart.- 10.3.3 Function, Structure, and Behavior.- 10.4 System Architecture.- 10.4.1 Function vs. Dynamics.- 10.4.2 The Concept Behind a System.- 10.4.3 The Origin and Essence of Systems.- 10.5 Objects, Systems, and Products.- 10.5.1 Product Defined.- 10.5.2 The Object-System-Product Hierarchy.- 10.5.3 Goods, Services, and Projects.- 10.6 Documenting Functions of the System Architecture.- 10.6.1 The Function Hierarchy.- 10.6.2 Function Boxes and Function Sentences.- 10.6.3 Functionality.- 10.7 From Systems to Models.- 10.7.1 Some Model Definitions.- 10.7.2 Model Defined.- 10.8 Modeling Paradigms.- 10.8.1 Natural Language as a Modeling Tool.- 10.8.2 Mathematical and Symbolic Modeling.- 10.8.3 Graphic Modeling and Knowledge Representation.- 10.9 Reflective Metamodeling.- Summary.- Problems.- 11 System Lifecycle and Evolution.- 11.1 System Lifecycle.- 11.1.1 Lifecycle of Artificial Systems.- 11.1.2 Software and Product Development Processes.- 11.2 Systems Analysis and the Scientific Method.- 11.3 Categorization vs. Interdisciplinarity.- 11.4 System Engineering and the Role of the System Architect.- 11.5 An OPM Model of System Lifecycle Phases.- 11.5.1 Top-Level Description of System Evolution.- 11.5.2 Initiating the System.- 11.5.3 Developing the System.- 11.5.4 Analyzing.- 11.5.5 The Refining-Abstracting Cycles.- 11.5.6 Designing.- 11.5.7 The Waterfall Model vs. Iterative and Incremental Development.- 11.5.8 Deploying the System.- 11.6 Zooming into Analyzing.- 11.7 Zooming into Designing and Implementing.- 11.8 From Design to Implementation.- Summary.- Problems.- 12 States and Values.- 12.1 State-specified Objects and Links.- 12.1.1 Initial, Ultimate and Default States.- 12.1.2 The Transformation Attribute of a Process.- 12.1.3 Object as a Role Player for State.- 12.1.4 State Maintaining Processes.- 12.1.5 Sentences and Phrases of States and Values.- 12.1.6 Single Value Sentence.- 12.2 Telling States Apart from Values.- 12.3 Metamodeling the Attributes of Value and Their States.- 12.3.1 Numeric and Symbolic Values.- 12.3.2 Mapping Object States onto Attribute Values.- 12.4 Compound States and State Space.- 12.4.1 The Attribute Feasibility Matrix.- 12.4.2 Logical Compound States.- Summary.- Problems.- 13 Advanced OPM Concepts.- 13.1 Real-Time Issues.- 13.1.1 Sequential vs. Parallel Process Execution.- 13.1.2 Process Synchronization.- 13.1.3 Events.- 13.1.4 Chronon and Event.- 13.1.5 Basic Triggering Event Types.- 13.2 Process and State Duration.- 13.3 Processing states.- 13.4 Probability in Procedural Relations.- 13.5 Scope and Name Disambiguation.- 13.5.1 The Fundamental DAG.- 13.5.2 Scope of an Object.- 13.6 The Reserved Words “of” and “which”.- 13.6.1 The Reserved Word “of” and the Dot Operator.- 13.6.2 Using “of” with Tagged Structural Relations.- 13.6.3 The Reserved Word “which”.- 13.6.4 Operation: A Process Without Side Effect.- 13.7 Structure-Related Issues.- 13.7.1 Transitivity Strength.- 13.7.2 Hamiltonian Distance.- 13.7.3 The Fractal Relation.- 13.7.4 Covariance and Contravariance.- 13.8 OPM Metamodeling Issues.- 13.8.1 AMetamodelofThing.- 13.8.2 The Specialization-Specification Hierarchy.- 13.8.3 A Refined Generic Processing Model.- 13.8.4 Time Exception Handling.- 13.9 The OPM Construct Hierarchy.- Summary.- Problems.- 14 Systems Theory.- 14.1 The Informatics Hierarchy.- 14.1.1 Computers Are Climbing the Informatics Hierarchy.- 14.1.2 Knowledge and Understanding.- 14.2 Ontology.- 14.3 General Systems Theory.- 14.3.1 A Brief History of General Systems Theory.- 14.3.2 The Hierarchy of System Levels.- 14.4 Autopoietic vs. Allopoietic Systems.- 14.5 Systems and Humans.- 14.6 Systems Theory Characteristics.- 14.6.1 Previously Defined Characteristics.- 14.6.2 System, Environment and Beneficiaries.- 14.6.3 Control and Feedback.- 14.7 Classical Physics vs. Quantum Theory.- 14.7.1 Visualization.- 14.7.2 Causality.- 14.7.3 Locality.- 14.7.4 Self-Identity.- 14.7.5 Objectivity.- 14.8 Objectifying: Converting a Process into an Object.- Summary.- Problems.- 15 Object-Oriented Modeling.- 15.1 The Evolution of System Analysis Methods.- 15.1.1 Data Flow Diagrams.- 15.1.2 Entity-Relationship Diagrams and Their Combination with DFD.- 15.1.3 The Object-Oriented Paradigm.- 15.2 Pre-UML Object-Oriented Methods.- 15.2.1 Object Modeling Technique.- 15.2.2 Object-Oriented Software Engineering.- 15.2.3 Object-Oriented Analysis and Object-Oriented Design.- 15.2.4 Object-Oriented Systems Analysis.- 15.2.5 Object-Oriented Analysis & Design.- 15.2.6 Object Life-Cycles.- 15.2.7 The Booch Method.- 15.2.8 MOSES.- 15.2.9 The Fusion Method.- 15.2.10 OPEN Modeling Language.- 15.3 Unified Modeling Language-UML.- 15.4 Metamodeling in OO Methods.- 15.5 OO Methods - A Summary.- 15.6 Software Development Approaches and Trends.- 15.6.1 Aspect-Oriented Programming.- 15.6.2 The Rational Unified Process.- 15.6.3 Extreme Programming.- 15.6.4 Agile Modeling.- 15.7 Challenges for OO Methods.- 15.7.1 A Historic Perspective.- 15.7.2 The Encapsulation Challenge.- 15.7.3 The Model Multiplicity Challenge.- 15.7.4 Empirical Evidence of the Model Multiplicity Problem.- 15.7.5 The Complexity Management Challenge.- 15.8 OPM and OO.- 15.8.1 The UML 2.0 Initiative.- 15.8.2 Systemantica: an OPM Supporting Tool.- 15.8.3 OPM Applications and Research: Present and Future.- Summary.- Problems.- Appendix A: The ATM System.- References.

Read more less

Book SynopsisA straightforward, step-by-step introduction to clear and elegant object-oriented programming. Using a language that's perfect for this kind of programming, the book has been tested in numerous courses and workshops over ten years.Programming Smalltalk is particularly suited for readers with no prior programming knowledge. Starting from the first principles of programming, it teaches you how to use and create algorithms (reusable rules for problem-solving) and the basic building blocks of software. It goes on to explain how to develop complete applications and has a whole chapter on web applications as well as case studies.Now translated into English, this edition was completely revised to be consistent with the latest version of Cincom® VisualWorks®, a professional Smalltalk environment. All examples were created using VisualWorks, which is available without cost for educational purposes, and can be downloaded and installed on any up-to-date computer.

Read more less

Book SynopsisThis book provides precise descriptions and instructions which enable users, students and consultants to understand Microsoft Dynamics AX rapidly. Microsoft offers Dynamics AX as its premium ERP solution, supporting large and mid-sized organizations with a complete business management solution which is easy to use. Going through a simple but comprehensive case study, this book provides the required knowledge to handle all basic business processes in Dynamics AX. Exercises are there to train the processes and functionality, also making this book a good choice for self-study.Table of ContentsBasics and Technology – Navigation and User Interface – Supply Chain Management – Trade and Logistics – Advanced Warehouse Management – Manufacturing – Financial Management.

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 SynopsisUsing everyday examples, you will first learn the basic concepts of programming, which are similar in all programming languages.

Read more less

Book Synopsis

Read more less

Book Synopsis

Read more less

Book SynopsisSolve your Selenium WebDriver problems with this quick guide to automated testing of web applications with Selenium WebDriver in C#. This third edition contains hundreds of solutions to real-world problems, with clear explanations and ready-to-run Selenium test scripts that you can use in your own projects. Updated to Selenium version 4, this revision includes Visual Studio Code set up, additional recipes, and new chapters on Selenium DevTools and continuous testing. You'll see how to use Selenium WebDriver for select lists, navigation, assertions, frames, file upload and pop-up dialogs. You'll also learn how to locate web elements and test functions for hyperlinks, buttons, TextFields and TextAreas, radio buttons, CheckBoxes, and more. What You'll Learn Debug test scripts and test data Work with Selenium Remote Control Server Manage and deal with browser profiles and capabilities Monitor tests for advanced user interactions and experiences (UX) Who This Book Is For Experienced .NET and C# Windows application programmers/developers.Table of Contents1. Introduction2. Locating Web Elements 3. Hyperlink 4. Button 5. TextField and TextArea 6. Radio Button 7. Check Box 8. Select List 9. Navigation and Browser 10. Assertion 11. Frames 12. Testing AJAX 13. File Upload and Pop-up Dialogs14. Debugging Test Scripts 15. Test Data16. Browser Profile and Capabilities17. Advanced User Interactions 18. HTML5 and JavaScript 19. WYSIWYG HTML Editors20. Leverage Programming 21. Optimization 22. Gotchas 23. Selenium 4 24. Selenium DevTools 25. Remote Control Server 26. Continuous Testing 27. Case Studies28. Afterword 29. Resources

Read more less

Book Synopsis1. Programming in C.- 2. First Steps in Programming.- 3. Making Decisions.- 4. Loops.- 5. Arrays.- 6. Applications with Strings and Text.- 7. Pointers.- 8. Structuring Your Programs.- 9. More on Functions.- 10.  Essential Input and Output Operations.- 11. Structuring Data.- 12. Working with Files.- 13. Supporting Facilities.- 14. Advanced and Specialized Topics.- A. Computer Arithmetic.- B. ASCII Character Code Definitions.- C. Reserved Words in C.- D. Input and Output Format Specifications.- E. Standard Library Headers.

Read more less

Book SynopsisBuild working implementations of hash tables, written in the C programming language. The new and revised Second Edition has been enhanced with simplified code and more comprehensive explanations, aimed at improving clarity and comprehension while exploiting the latest features in C programming. This book starts with simple first attempts devoid of collision resolution strategies. It then progresses through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices.You will learn how hash tables, when implemented and used appropriately, are exceptionally efficient data structures for representing sets and lookup tables, providing low overhead, constant time, insertion, deletion, and lookup operations.The Joys of Hashing walks you through the implementation of efficient hash tables and the pros and cons of different design choices when building tables. The source code used in the book is available on GitHub for your re-use and experiments. What You Will LearnMaster the basic ideas behind hash tablesCarry out collision resolution, including strategies for handling collisions and their consequences for performanceResize or grow and shrink tables as neededStore values by handling when values must be stored with keys to make general sets and mapsWho This Book Is ForThose with at least some prior programming experience, especially in C programming.

Read more less

Book SynopsisPart 1.  Language Core.- 1. Getting Started.- 2. Data Types and Structures.- 3. Control Flow and Functions.- 4. Custom Types.-  E1: Shelling Segregation Model - 5. Input Output.- 6. Metaprogramming and Macros.- 7. Interfacing Julia with Other Languages.- 8. Efficiently Write Efficient Code. - 9 Parallel Computing in Julia - Part 2. Packages Ecosystem.- 10. Working with Data.- 11. Scientific Libraries.- E2: Fitting a forest growth model - 12 AI with Julia E3. Predict house values - 13. Utilities. Appendix: Solutions to the exercises.

Read more less

Book SynopsisChapter 1: Jumping Right In Hello, TBB!.- Chapter 2: Algorithms.- Chapter 3: Data Structures for Concurrency.- Chapter 4: Flowgraphs: The Basics.- Chapter 5: Flowgraphs: Expressing Applications.- Chapter 6: Task and Task Group.- Chapter 7: Memory Allocation.- Chapter 8: Synchronization.- Chapter 9: Cancellation and Exception Handling.- Chapter 10: Performance: Pillars of Composability.- Chapter 11: Performance Tuning.- Chapter 12: Migrating TBB to oneTBB.- Appendix A: History and Inspiration.- Glossary.

Read more less