Reactive probabilistic programming

International audienceSynchronous modeling is at the heart of programming languages like Lustre, Esterel, or SCADE used routinely for implementing safety critical control software, e.g., fly-bywire and engine control in planes. However, to date these languages have had limited modern support for modeling uncertainty-probabilistic aspects of the software's environment or behavior-even though modeling uncertainty is a primary activity when designing a control system. In this paper we present ProbZelus the first synchronous probabilistic programming language. ProbZelus conservatively provides the facilities of a synchronous language to write control software, with probabilistic constructs to model uncertainties and perform inference-in-the-loop. We present the design and implementation of the language. We propose a measure-theoretic semantics of probabilistic stream functions and a simple type discipline to separate deterministic and probabilistic expressions. We demonstrate a semantics-preserving compilation into a first-order functional language that lends itself to a simple presentation of inference algorithms for streaming models. We also redesign the delayed sampling inference algorithm to provide efficient streaming inference. Together with an evaluation on several reactive applications, our results demonstrate that ProbZelus enables the design of reactive probabilistic applications and efficient, bounded memory inference

Mathematical programming

Suplements: Mathematical programming study = ISSN 0303-3929

Interior-point methods: An old and new approach to nonlinear programming

In this paper we discuss the main concepts of structural optimization, a field of nonlinear programming, which was formed by the intensive development of modem interior-point schemes. (C) 1997 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V

A tactical operating theatre planning problem

The objective of this paper is to maximize the operating room utilization and minimize the overtime operating cost. To deal with this problem, we formulate it as an integer programming and then solve its linear relaxation by an explicit column generation procedure. On the basis of the optimal solution of its linear relaxation, we propose several heuristic procedures, differing from each other in the selection of basic columns (each represents a partial plan for one operating room in one day), to obtain approximate solutions. Finally, a set of examples, in which data are randomly generated, are tested in order to compare the results of the proposed heuristic procedures