The formalisation of security properties for computer systems raises the problem of overcoming also in a formal setting the classical view according to which confidentiality is an absolute property stating the complete absence of any unauthorised disclosure of information. In this paper, we present two formal models in which the notion of noninterference, which is at the basis of a large variet...

In this work we introduce a relaxed version of the constant positive linear dependence constraint qualification (CPLD) that we call RCPLD. This development is inspired by a recent generalization of the constant rank constraint qualification from Minchenko and Stakhovski that was called RCR. We show that RCPLD is enough to ensure the convergence of an augmented Lagrangian algorithm and asserts t...

We propose an algorithm that computes the ε-correlated equilibria with global-optimal (i.e., maximum) expected social welfare for single stage polynomial games. We first derive an infinite-dimensional formulation of ε-correlated equilibria using Kantorovich polynomials and re-express it as a polynomial positivity constraint. In addition, we exploit polynomial sparsity to achieve a leaner proble...

Early work in augmented reality grew out of virtual reality research domains. These initial augmented reality systems applied the same methods and technology to solve what at first appeared to be a similar problem: correctly render a scene of virtual objects as the user changes viewpoint in the world. This is indeed similar for augmented and virtual reality systems. In virtual reality systems o...

We present in this paper an iterative algorithm to solve constraint forces for haptic interactive simulation. The haptic forces are induced by interaction with guidance virtual fixtures having forbidden regions. In general, a haptic rendering based on an explicit formulation of the constraint forces (with virtual springs) can lead to severe numerical stability problems in case of hard constrain...

Many combinatorial optimization problems have underlying goal functions that are submodular. The classical goal is to find a good solution for a given submodular function f under a given set of constraints. In this paper, we investigate the runtime of a multi-objective evolutionary algorithm called GSEMO until it has obtained a good approximation for submodular functions. For the case of monoto...

Continuing the work of Hiriart-Urruty and Phelps, we discuss (in both locally convex spaces and Banach spaces) the formulas for the conjugates and subdifferentials of the precomposition of a convex function by a continuous linear mapping and the marginal function of a convex function by a continuous linear mapping. We exhibit a certain (incomplete) duality between the operations of precompositi...