This paper investigates two behavioral properties of choices between gambles: branch independence and distribution independence. Branch independence is the assumption that probability-outcome branches that are identical in two gambles being compared should have no effect on preference order. In the test of distribution independence, two middle outcomes of fixed probability are sandwiched betwee...

We show hardness of learning AES key from pairs ciphertexts under the assumption computational closeness to pairwise independence. The latter is motivated by a recent result on statistical

In this paper, we consider the steady state Mean Square Error (MSE) analysis for 2-D LMS algorithm in which the filter's weights are updated in both vertical and horizontal directions using Fornasini and Marchesini (F-M) state space model. The MSE analysis is conducted using the wellknown independence assumption. First we show that computation of the Weight-Error Correlation Matrix (WECM) for F...

An instruction is control independent of a preceding conditional branch if the decision to execute the instruction does not depend on the outcome of the branch -this typically occurs if the two paths following the branch re-converge prior to the control independent instruction. A speculative instruction that is control independent of an earlier predicted branch does not necessarily have to be s...

We investigate efficient algorithms for learning the structure of a Markov network from data using the independence-based approach. Such algorithms conduct a series of conditional independence tests on data, successively restricting the set of possible structures until there is only a single structure consistent with the outcomes of the conditional independence tests executed (if possible). As ...

In this paper, we consider the steady state mean square error (MSE) analysis for 2-D LMS adaptive filtering algorithm in which the filter’s weights are updated along both vertical and horizontal directions as a doubly-indexed dynamical system. The MSE analysis is conducted using the well-known independence assumption. First we show that computation of the weight-error covariance matrix for doub...

Observers completed perceptual categorization tasks that included 25 base-rate/payoff conditions constructed from the factorial combination of five base-rate ratios (1:3, 1:2, 1:1, 2:1, and 3:1) with five payoff ratios (1:3, 1:2, 1:1, 2:1, and 3:1). This large database allowed an initial comparison of the competition between reward and accuracy maximization (COBRA) hypothesis with a competition...

Failures in component-based systems are generally due to unintended or incorrect interactions among the components. For safetycritical systems, we may attempt to eliminate unintended interactions, and to verify correctness of those that are intended. We describe the value of partitioning in eliminating unintended interactions, and of assumption synthesis in developing a robust foundation for ve...