Dirk Draheim Knihy

The book explores a frequentist approach to conditionalization on partially known events through the concept of probability testbeds, offering a generalization of classical conditional probability. It introduces frequentist partial (F.P.) conditionalization and examines it in relation to partitions, segmentation, independence, and chaining. Notably, F.P. conditionalization extends Jeffrey conditionalization to arbitrary event collections, providing a new perspective and potential applications. Additionally, it presents a counterpart to Jeffrey's rule concerning independent updates, enhancing the understanding of these concepts.

The book presents a modeling framework tailored for form-based applications, from simple web shops to complex enterprise systems. It introduces innovative modeling artifacts like page diagrams and form storyboards, emphasizing reusable dialogue patterns. The authors develop new constructs, including typed server pages, and provide tools for both forward and reverse engineering of presentation layers. An online bookshop serves as a practical example, allowing users to engage with the modeling concepts effectively.

This book takes a foundational approach to the semantics of probabilistic programming. It elaborates a rigorous Markov chain semantics for the probabilistic typed lambda calculus, which is the typed lambda calculus with recursion plus probabilistic choice. The book starts with a recapitulation of the basic mathematical tools needed throughout the book, in particular Markov chains, graph theory and domain theory, and also explores the topic of inductive definitions. It then defines the syntax and establishes the Markov chain semantics of the probabilistic lambda calculus and, furthermore, both a graph and a tree semantics. Based on that, it investigates the termination behavior of probabilistic programs. It introduces the notions of termination degree, bounded termination and path stoppability and investigates their mutual relationships. Lastly, it defines a denotational semantics of the probabilistic lambda calculus, based on continuous functions over probability distributionsas domains. The work mostly appeals to researchers in theoretical computer science focusing on probabilistic programming, randomized algorithms, or programming language theory.

This book takes a foundational approach to the semantics of probabilistic programming. It elaborates a rigorous Markov chain semantics for the probabilistic typed lambda calculus, which is the typed lambda calculus with recursion plus probabilistic choice. The book starts with a recapitulation of the basic mathematical tools needed throughout the book, in particular Markov chains, graph theory and domain theory, and also explores the topic of inductive definitions. It then defines the syntax and establishes the Markov chain semantics of the probabilistic lambda calculus and, furthermore, both a graph and a tree semantics. Based on that, it investigates the termination behavior of probabilistic programs. It introduces the notions of termination degree, bounded termination and path stoppability and investigates their mutual relationships. Lastly, it defines a denotational semantics of the probabilistic lambda calculus, based on continuous functions over probability distributionsas domains. The work mostly appeals to researchers in theoretical computer science focusing on probabilistic programming, randomized algorithms, or programming language theory.

Currently, we see a variety of tools and techniques for specifying and implementing business processes. The problem is that there are still gaps and tensions between the different disciplines needed to improve business process execution and improvement in enterprises. Business process modeling, workflow execution and application programming are examples of disciplines that are hosted by different communities and that emerged separately from each other. In particular, concepts have not yet been fully elaborated at the system analysis level. Therefore, practitioners are faced again and again with similar questions in concrete business process projects: Which decomposition mechanism to use? How to find the correct granularity for business process activities? Which implementing technology is the optimal one in a given situation? This work offers an approach to the systematization of the field. The methodology used is explicitly not a comparative analysis of existing tools and techniques – although a review of existing tools is an essential basis for the considerations in the book. Rather, the book tries to provide a landscape of rationales and concepts in business processes with a discussion of alternatives.

TEAA 2005 (Trends in Enterprise Application Architecture) took place as a workshop of the conference VLDB 2005 (31st International Conference on Very Large Databases) in August 2005 in Trondheim, Norway. Enterprise applicationsare mission criticalfor organizations. Currently there are several initiatives that see enterprise application integration as their natural playground, like Model Driven Architecture and Service Oriented Architecture. Now is the time to investigate how these approaches can provide added value. At TEAA 2005 the contributions identi? ed a problem or issue in enterprise application architecture and proposed and evaluated a solution. The workshop bene? ted from lively discussions among the participants. Applications, operating systems, database systems, hardware architecture and system administration concepts must be orchestrated to yield an optimized systemarchitecturethat tacklesperformance, stability, security, maintainability, andtotalcostofownership. Inpractice, itisalwaysaholisticviewthatisneeded – it is known that system design approaches that overemphasize one of the software or hardware architecture aspects are likely to fail. In the TEAA 2005 workshop we examined the conceptual underpinnings of enterprise application architecture. We are grateful to our keynote speaker Laura Haas for sharing her insights with us.