Analysis of relative dispersion of two particles by Lagrangian stochastic models and DNS methods

Comparisons of the Q1D against the known Lagrangian stochastic well-mixed quadratic form models and the moments approximation models are presented. In the case of modestly large Reynolds numbers turbulence (Re λ ⋍ 240) the comparison of the Q1D model with the DNS data is made. Being in a qualitatively agreemnet with the DNS data, the Q1D model predicts higher rate of separation. Realizability of Q1D model extracted from the transport equation with a quadratic form of the conditional acceleration is shown

Generalized differential privacy: regions of priors that admit robust optimal mechanisms

International audienceDifferential privacy is a notion of privacy that was initially designed for statistical databases, and has been recently extended to a more general class of domains. Both differential privacy and its generalized version can be achieved by adding random noise to the reported data. Thus, privacy is obtained at the cost of reducing the data's accuracy, and therefore their utility. In this paper we consider the problem of identifying optimal mechanisms for gen- eralized differential privacy, i.e. mechanisms that maximize the utility for a given level of privacy. The utility usually depends on a prior distribution of the data, and naturally it would be desirable to design mechanisms that are universally optimal, i.e., optimal for all priors. However it is already known that such mechanisms do not exist in general. We then characterize maximal classes of priors for which a mechanism which is optimal for all the priors of the class does exist. We show that such classes can be defined as convex polytopes in the priors space. As an application, we consider the problem of privacy that arises when using, for instance, location-based services, and we show how to define mechanisms that maximize the quality of service while preserving the desired level of geo- indistinguishability

Exponential bounds for the probability deviations of sums of random fields

Non-asymptotic exponential upper bounds for the deviation probability for a sum of independent random fields are obtained under Bernstein's condition and assumptions formulated in terms of Kolmogorov's metric entropy. These estimations are constructive in the sense that all the constants involved are given explicitly. In the case of moderately large deviations, the upper bounds have optimal log-asymptotices. The exponential estimations are extended to the local and global continuity modulus for sums of independent samples of a random field

Robustly Safe Compilation

Secure compilers generate compiled code that withstands many target-level attacks such as alteration of control flow, data leaks or memory corruption. Many existing secure compilers are proven to be fully abstract, meaning that they reflect and preserve observational equivalence. Fully abstract compilation is strong and useful but, in certain cases, comes at the cost of requiring expensive runtime constructs in compiled code. These constructs may have no relevance for security, but are needed to accommodate differences between the source and target languages that fully abstract compilation necessarily needs