We consider a problem where mutually untrusting curators possess portions of a vertically partitioned database containing information about a set of individuals. The goal is to enable an authorized party to obtain aggregate (statistical) information from the database while protecting the privacy of the individuals, which we formalize using Differential Privacy. This process can be facilitated b...

Let Bn be the poset generated by the subsets of [n] with the inclusion as relation and let P be a nite poset. We want to embed P into Bn as many times as possible such that the subsets in di erent copies are incomparable. The maximum number of such embeddings is asymptotically determined for all nite posets P as 1 t(P ) ( n bn/2c ) , where t(P ) denotes the minimal size of the convex hull of a ...

The non-interference (NI) property defines a program to be secure if changes to high-security inputs cannot alter the values of lowsecurity outputs. NI indirectly states the epistemic property that no low-security principal acquires knowledge of high-security data. We consider a directly epistemic account of information flow (IF) security focusing on the knowledge flows engendered by the progra...

Some of the most efficient heuristics for the Euclidean Steiner minimal trees in the d-dimensional space, d ≥ 2, use Delaunay tessellations and minimum spanning trees to determine small subsets of geometrically close terminals. Their low-cost Steiner trees are determined and concatenated in a greedy fashion to obtain low cost trees spanning all terminals. The weakness of this approach is that o...

When designing model-based fault-diagnosis systems, the use of consistency relations (also called e.g. parity relations) is a common choice. Different subsets are sensitive to different subsets of faults, and thereby isolation can be achieved. This paper presents an algorithm for finding a small set of submodels that can be used to derive consistency relations with highest possible diagnosis ca...

The paper is aimed at studying the topological dimension for sets definable in weakly o-minimal structures in order to prepare background for further investigation of groups, group actions and fields definable in the weakly o-minimal context. We prove that the topological dimension of a set definable in a weakly o-minimal structure is invariant under definable injective maps, strengthening an a...

Any computer based system has both real and theoretical weaknesses. Computing security aims to devise ways to prevent or to avoid various weaknesses from being exploited. Confidentiality, integrity and availability are the three prime aspects of a computing system. Confidentiality ensures that computing-related assets of hardware, software and data are accessed only by authorized parties. Integ...

Cross-diffusion phenomena are experimentally shown to be able to induce convective fingering around an initially stable stratification of two microemulsions with different compositions. Upon diffusion of a salt that entrains water and AOT micelles by cross-diffusion, the miscible interface deforms into fingers following the build-up of a non-monotonic density profile in the gravitational field....

The paper is aimed at studying the topological dimension for sets definable in weakly o-minimal structures in order to prepare background for further investigation of groups, group actions and fields definable in the weakly o-minimal context. We prove that the topological dimension of a set definable in a weakly o-minimal structure is invariant under definable injective maps, strengthening an a...