Search

The main aim of the book is to give a review of all relevant information regarding a well-known and important problem of Feedback Arc Set (FAS). This review naturally also includes a history of the problem, as well as specific algorithms. To this point such a work does not exist: There are sources where one can find incomplete and perhaps untrustworthy information. With this book, information about FAS can be found easily in one place: formulation, description, theoretical background, applications, algorithms etc. Such a compendium will be of help to people involved in research, but also to people that want to quickly acquaint themselves with the problem and need reliable information. Thus research, professional work and learning can proceed in a more streamlined and faster way.

This volume constitutes the refereed post-conference proceedings of the Third International Conference on the History and Philosophy of Computing, held in Pisa, Italy in October 2015.The 18 full papers included in this volume were carefully reviewed and selected from the 30 papers presented at the conference. They cover topics ranging from the world history of computing to the role of computing in the humanities and the arts.

This stimulating textbook presents a broad and accessible guide to the fundamentals of discrete mathematics, highlighting how the techniques may be applied to various exciting areas in computing. The text is designed to motivate and inspire the reader, encouraging further study in this important skill. Features: provides an introduction to the building blocks of discrete mathematics, including sets, relations and functions; describes the basics of number theory, the techniques of induction and recursion, and the applications of mathematical sequences, series, permutations, and combinations; presents the essentials of algebra; explains the fundamentals of automata theory, matrices, graph theory, cryptography, coding theory, language theory, and the concepts of computability and decidability; reviews the history of logic, discussing propositional and predicate logic, as well as advanced topics; examines the field of software engineering, describing formal methods; investigates probability and statistics.

Die bisher aufgetretenen Grundbegriffe lassen sich folgendermaßen zusammenfassen: Nachrichten haben Träger und Form; durch Interpretation gewinnt man aus ihnen Informationen. Sie werden in der Informatik durch Algorithmen verarbeitet. Ein Al­ gorithmus ist ein spezieller Typ von Nachricht. Er ist syntaktisch exakt beschrieben in einer Befehlssprache, deren Semantik auf eine Struktur von Operationen auf Mengen von Werten von Objekten abbildet. Die Befehlssprache wird auf unterster Sprache­ bene durch Ausführung interpretiert, während sie auf höherer Sprachebene in eine primitivere Sprache übersetzt wird. Semantik und Syntax der Befehlssprache müssen wegen der maschinellen Übersetzung und Interpretation regelhaft formuliert sein. Deshalb werden im Kapitel 4 formale Sprachen exakter eingeführt und genauer untersucht. Dabei wird die Rolle von meta­ sprachlichen Algorithmen zur Festlegung von Syntax und Semantik einer formalen Sprache deutlich. Deshalb kann man formale Sprachen, auch wenn sie nicht Befehls­ sprachen sind, nur unter Benutzung von Algorithmen beschreiben. Der Algorithmus­ begriff führt also zurück zu den formalen Sprachen und diese wiederum lassen sich nur mit Algorithmen (in Metasprache) darstellen. Das Vorgehen im Kapitel 4 wird vermutlich dem Leser etwas übertrieben abstrakt vor­ kommen. Der Grund ist, daß absolute Exaktheit in formalen Konstruktionen geübt werden soll. Zu exakten Konstruktionen in der Informatik benötigt man natürlich auch Grundelemente der exakten Wissenschaft par excellence, nämlich der Mathe­ matik. Dies wird hier aber lediglich als eine Erweiterung der Metasprache um ei­ nige hilfreiche Begriffskonstruktionen aufgefaßt. Deshalb werden die mathematischen Grundbegriffe im Kapitel 3 kurz zusammengestellt; dieseskann von mathematisch ausreichend vorgebildeten Lesern übersprungen werden.

This book constitutes the thoroughly refereed post-conference proceedings of the 13th International Conference on Membrane Computing, CMC 2012, held in Budapest, Hungary, in August 2012. The 21 revised selected papers presented together with 6 invited lectures were carefully reviewed and selected from 25 papers presented at the conference. The book also deals with membrane systems, also called P systems, which are distributed and parallel algebraic models processing multisets of objects in a localized manner (evolution rules and evolving objects are encapsulated into compartments delimited by membranes), with an essential role played by the communication among compartments and with the environment.

-Ecclesiastes 12:12 Programs are invariably subjected to many rorms or transrormation. After an initial version of a program has been designed and developed, it undergoes debugging and certification. In addition, most long-lived pro­ grams have a liCe-cycle that includes modifications to meet amended specifications and extensions for expanded capabilities. Such evolution­ ary aspects of programming are the topic of this monograph. We present rormal methods for manipulating programs and illustrate their applica­ tion with numerous examples. Such methods could be incorporated in semi-automated programming environments, where they would serve to ease the burden on the programmer. We begin by describing a method whereby a given program that achieves one goal can be modified to achieve a different goal or a pro­ gram that computes wrong results can be debugged to achieve the 2 Preface intended results. The abstraction of a set of cognate programs to obtain a program schema, and the instantiation of abstract schemata to solve concrete problems, are approached from the same perspective. In addition, we describe synthesis rules for generating code from specifications and annotation rules for making assertions about code. The synthesis rules may be used when a program is first being developed, or when, in the course of modifying a program, the need arises to rewrite a program segment. Annotation rules may be used for the purpose of determining what an incorrect program really does before attempting to debug it or how a correct program works before attempting to modify it.

This book constitutes the proceedings of the 7th International and Interdisciplinary Conference on Modeling and Using Context, CONTEXT 2011, held in Karlsruhe, Germany in September 2011. The 17 full papers and 7 short papers presented were carefully reviewed and selected from 54 submissions. In addition the book contains two keynote speeches and 8 poster papers. They cover cutting-edge results from the wide range of disciplines concerned with context, including the cognitive sciences (linguistics, psychology, philosophy, computer science, neuroscience), the social sciences and organization sciences, and all application areas.

This book contains a collection of thoroughly refereed papers derived from the First IFIP WG 9.7 Conference on Soviet and Russian Computing, held in Petrozavodsk, Russia, in July 2006. The 32 revised papers were carefully selected from numerous submissions; many of them were translated from Russian. They reflect much of the shining history of computing activities within the former Soviet Union from its origins in the 1950s with the first computers used for military decision-making problems up to the modern period where Russian ICT grew substantially, especially in the field of custom-made programming.

The papers in this volume comprise the refereed proceedings of the conference ‘ Artificial Intelligence in Theory and Practice'(IFIP AI 2008), which formed part of the 20th World Computer Congress of IFIP, the International Federation for Information Processing (WCC-2008), in Milan, Italy in September 2008. The conference is organised by the IFIP Technical Committee on Artificial Intelligence (Technical Committee 12) and its Working Group 12.5 (Artificial Intelligence Applications). All papers were reviewed by at least two members of our Program Committee. Final decisions were made by the Executive Program Committee, which comprised John Debenham (University of Technology, Sydney, Australia), Ilias Maglogiannis (University of Aegean, Samos, Greece), Eunika Mercier-Laurent (KIM, France) and myself. The best papers were selected for the conference, either as long papers (maximum 10 pages) or as short papers (maximum 5 pages) and are included in this volume. The international nature of IFIP is amply reflected in the large number of countries represented here. The conference also featured invited talks by Prof. Nikola Kasabov (Auckland University of Technology, New Zealand) and Prof. Lorenza Saitta (University of Piemonte Orientale, Italy). I should like to thank the conference chair, John Debenham for all his efforts and the members of our program committee for reviewing papers to a very tight deadline.

Overview The objective of this book is to provide an introduction into some of the key topics in the history of computing. The computing eld is a vast area and a truly comp- hensive account of its history would require several volumes. The aims of this book are more modest, and its goals are to give the reader a avour of some of the key topics and events in the history of computing. It is hoped that this will stimulate the interested reader to study the more advanced books and articles available. The history of computing has its origins in the dawn of civilization. Early hunter gatherer societies needed to be able to perform elementary calculations such as counting and arithmetic. As societies evolved into towns and communities there was a need for more sophisticated calculations. This included primitive accounting to determine the appropriate taxation to be levied as well as the development of geometry to enable buildings, templates and bridges to be constructed. Our account commenceswith the contributions of the Egyptians, and Babylonians. It moves on to the foundationalwork done by Boole and Babbage in the nineteenth century, and to the importantwork on Boolean Logicand circuit design doneby Claude Shannon in the 1930s. The theoretical work done by Turing on computability is considered as well as work done by von Neumann and others on the fundamental architecture for computers.

These proceedings derive from an international conference on the history of computing and education. This conference is the third of hopefully a series of conferences that will take place within the International Federation for Information Processing (IFIP) and hence, we describe it as the “Third IFIP Conference on the History of Computing and Education” or simply “History of Computing and Education 3” (HCE3). This volume consists of a collection of articles presented at the HCE3 conference held in association with the IFIP 2008 World Computer Congress in Milano, Italy. Articles range from a wide variety of computing perspectives and they represent activities from six continents. The HCE3 conference is an event of the IFIP Working Group 9.7 on the History of Computing, a working group of IFIP's Technical Committee 9 (TC9) on the Relationship between Computers and Society. In addition, it is in cooperation with the IFIP Technical Committee 3 (TC3) on Education. The HCE3 conference brings to light a broad spectrum of issues. It illustrates topics in computing as they occurred in the “early days” of computing whose ramifications or overtones remain with us today. Indeed, many of the early challenges remain part of our educational tapestry; most likely, many will evolve into future challenges. Therefore, these proceedings provide additional value to the reader as it will reflect in part the future development of computing and education to stimulate new ideas and models in educational development.