You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book provides an overview of the various methods for creating and implementing efficient work processes. The author presents the most important tools for working on improvement projects such as process mapping, Ishikawa diagram, burn-down chart, or Pareto chart. Using successfully realized improvement projects from practice, the concrete implementation of process optimization is illustrated. In addition, it is shown how these methods, which originate from the production sector, can be successfully used in the office sector.
Extensional Constructs in Intensional Type Theory presents a novel approach to the treatment of equality in Martin-Loef type theory (a basis for important work in mechanised mathematics and program verification). Martin Hofmann attempts to reconcile the two different ways that type theories deal with identity types. The book will be of interest particularly to researchers with mainly theoretical interests and implementors of type theory based proof assistants, and also fourth year undergraduates who will find it useful as part of an advanced course on type theory.
The aim of this volume is to present modern developments in semantics and logics of computation in a way that is accessible to graduate students. The book is based on a summer school at the Isaac Newton Institute and consists of a sequence of linked lecture course by international authorities in the area. The whole set have been edited to form a coherent introduction to these topics, most of which have not been presented pedagogically before.
This book constitutes the refereed proceedings of the Second International Conference on Embedded Software and Systems, ICESS 2005, held in Xi'an, China, in December 2005. The 63 revised full papers presented together with the abstracts of 3 keynote speeches were thoroughly reviewed and selected from 361 submissions. The papers are organized in topical sections on embedded hardware, embedded software, real-time systems, power aware computing, hardware/software co-design and system-on-chip, testing and verification, reconfigurable computing, agent and distributed computing, wireless communications, mobile computing, pervasive/ubiquitous computing and intelligence, multimedia and human-computer interaction, network protocol, security and fault-tolerance, and abstracts of eight selected workshop papers.
Introduction -- Part I. The lexical picture. Names as implements; Picturing names -- Part II. The empirical impression. The style of antiquity; Agents of change; Nominal empiricism -- Part III. The schematic thing. Substance into schema; Nominal casting -- Conclusion.
None
This book constitutes the refereed proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics, TPHOLs '99, held in Nice, France, in September 1999. The 20 revised full papers presented together with three invited contributions were carefully reviewed and selected from 35 papers submitted. All current aspects of higher order theorem proving, formal verification, and specification are discussed. Among the theorem provers evaluated are COQ, HOL, Isabelle, Isabelle/ZF, and OpenMath.
None
Bidirectional transformations (BX) are means of maintaining consistency between multiple information sources: when one source is edited, the others may need updating to restore consistency. BX have applications in databases, user interface design, model-driven development, and many other domains. This volume represents the lecture notes from the Summer School on Bidirectional Transformations, held in Oxford, UK, in July 2016. The school was one of the final activities on the project "A Theory of Least Change for Bidirectional Transformations", running at the University of Oxford and the University of Edinburgh from 2013 to 2017 and funded by the UK Engineering and Physical Sciences Research Council. The five chapters included in this volume are a record of most of the material presented at the summer school. After a comprehensive introduction to bidirectional transformations, they deal with triple graph grammars, modular edit lenses, putback-based bidirectional programming, and engineering of bidirectional transformations.
None