refer to as dither modulation. Using deterministic models to evaluate digital watermarking methods, we show that QIM is "provably good" against arbitrary bounded and fully informed attacks, which arise in several copyright applications, and in particular, it achieves provably better rate

A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows us to efficiently support OLAP applications, as answering queries is the main bottleneck for this kind of applications

chosen randomly, we compute probabilistic bounds for the extreme eigenvalues from data available during the execution of the Lanczos process. Four dierent types of bounds are obtained using Lanczos, Ritz, and Chebyshev polynomials. These bounds are compared theoretically and numerically. Furthermore we

. We present a methodology for determining the probability of satisfying bounds on the latency from message origination to ordered delivery in the presence of communication faults.

We analyze the Lanczos algorithm with a random start for approximating the extremal eigenvalues of a symmetric positive definite matrix. We present some bounds on the Lebesgue measure (probability) of the sets of these starting vectors for which the Lanczos algorithm gives at the k-th step

(c)2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Abstract The aim of this paper is to describe a new probabilistic approach to the role engineering process for RBAC. We address the issue of minimizing the number of roles, problem known in literature as the Basic Role Mining Problem (basicRMP). We leverage the equivalence of the above issue

Abstract not found

Abstract—Verification of cyber-physical systems is a difficult, yet extremely important, problem. Hybrid systems offer a theoret-ical framework in which to perform formal verification of cyber-physical systems. In this paper we study the problem of bounded δ-reachability in hybrid systems

. The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and verification of probabilistic systems: as they can express quantitative bounds on the probability of system evolutions, they can be used to specify system properties such as reliability and performance