In this paperwe consider the problemof reconstructing a binarymatrix fromabsorbedprojections, as introduced in [Kuba and Nivat, LinearAlgebraAppl. 339 (2001) 171–194]. In particular we prove that two left and right horizontal absorbed projections along a single direction uniquely determine a row of a binary matrix for a specific absorption coefficient. Moreover, we give a linear time algorithm ...

In this paper we consider the problem of controlling a multi–inventory system in the presence of uncertain demand. The demand is unknown but bounded in an assigned compact set. The control input is assumed to be also constrained in a compact set. We consider an integral cost function of the buffer level and we face the problem of minimizing the worst case cost. We show that the optimal cost of ...

xi Acknowledgments xiii

This document highlights an oversight in our recent paper on a method for node overlap removal [1, 2]. The error, based on an incompleted specified invariant, occurs in the algorithm satisfy VPSC and leads to a rarely occurring case where not all constraints are satisfied. We give the required additions to the algorithm to obtain correct behaviour, revise the worst case complexity theorem and r...

Static Worst-Case Execution Time (WCET) analysis derives upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component in static WCET analysis is to derive flow information, such as loop bounds and infeasible paths. We have previously introduced abstract execution (AE), a method capable of deriving very precise flow inf...

Financial decision making involves uncertainty and consequently risk. It is well known that asset return forecasts and risk estimates are inherently inaccurate. The inaccuracy in forecasting and estimation can be addressed through the specification of rival scenarios. In this paper, we extend the multi-period mean-variance portfolio optimization and asset liability management problems to the ro...

Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an input xi to the i th player who then r...

We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant time. Hence, we solve an open problem posed by Kaplan and Tarjan as to whether it is possible to envisage a data structure supporting simultaneously the join operation in O(1) time and the search and update operation...

The reconstruction of 8-connected but not 4-connectedhv-convex discrete sets from few projections is considered. An algorithm is given with worst case complexity of O(mnmin{m, n}) to reconstruct all sets with given horizontal and vertical projections. Experimental results are also presented. It is shown, that using also the diagonal projections the algorithm can be speeded up having complexity ...

We examine a class of problems which seeks to find tree-structured networks which minimize the maximum cost among a subset of nodes in a graph. The cost metric is characterized by a series of parameters which can represent distance, flow volume, and delivery deadlines. Derived through variations in problem parameters, we present 17 different problems and discuss their worst-case complexity. Fou...