For the ordered set [n] of n elements, we consider the class Bn of bases B of tropical Plücker functions on 2[n] such that B can be obtained by a series of mutations (flips) from the basis formed by the intervals in [n]. We show that these bases are representable by special wiring diagrams and by certain arrangements generalizing rhombus tilings on the n-zonogon. Based on the generalized tiling...

For the ordered set [n] of n elements, we consider the class Bn of bases B of tropical Plücker functions on 2[n] such that B can be obtained by a series of mutations (flips) from the basis formed by the intervals in [n]. We show that these bases are representable by special wiring diagrams and by certain arrangements generalizing rhombus tilings on the n-zonogon. Based on the generalized tiling...

In this work we investigate the hardness of a computational problem introduced in the recent work of Baumslag et al. in [3, 4]. In particular, we study the Bn-LHN problem, which is a generalized version of the learning with errors (LWE) problem, instantiated with a particular family of non-abelian groups (free Burnside groups of exponent 3). In our main result, we demonstrate a random self-redu...

Bayesian Knowledge Bases BKB are a rule based probabilistic model that extend Bayes Net works BN by allowing context sensitive independence and cycles in the directed graph BKBs have probabilistic semantics but lack independence semantics i e a graph based scheme determin ing what independence statements are sanctioned by the model Such a semantics is provided through generalized d separation b...

Bayesian Knowledge Bases (BKB) are a rule-based probabilistic model that extend Bayes Networks (BN), by allowing context-sensitive independence and cycles in the directed graph. BKBs have probabilistic semantics, but lack independence semantics, i.e., a graphbased scheme determining what independence statements are sanctioned by the model. Such a semantics is provided through generalized dsepar...

In this work we investigate the hardness of a computational problem introduced in the recent work of Baumslag et al. in [5, 6]. In particular, we study the Bn-LHN problem, which is a generalized version of the learning with errors (LWE) problem, instantiated with a particular family of non-abelian groups (free Burnside groups of exponent 3). In our main result, we demonstrate a random self-redu...

In this work we investigate the hardness of a computational problem introduced in the recent work of Baumslag et al. [BFNSS11]. In particular, we study the Bn-LHN problem, which is a generalized version of the learning with errors (LWE) problem, instantiated with a particular family of non-abelian groups (free Burnside groups of exponent 3). In our main result, we demonstrate a random self-redu...

Identification and characterization of multi-protein complexes is an important step toward an integrative view of protein-protein interaction networks that determine protein function and cell behavior. The limiting factor for identifying protein complexes is the method for their separation. Blue native PAGE (BN-PAGE) permits a high-resolution separation of multi-protein complexes under native c...

We introduce a new Bayesian network (BN) scoring metric called the Global Uniform (GU) metric. This metric is based on a particular type of default parameter prior. Such priors may be useful when a BN developer is not willing or able to specify domain-specific parameter priors. The GU parameter prior specifies that every prior joint probability distribution P consistent with a BN structure S is...