Security of a cryptographic protocol for a bounded number of sessions is usually expressed as a symbolic trace reachability problem. We show that symbolic trace reachability for well-defined protocols is decidable in presence of the exclusive or theory in combination with the homomorphism axiom. These theories allow us to model basic properties of important cryptographic operators. This trace r...

We show that multi-trace interactions can be consistently incorporated into an extended AdS/CFT prescription involving the inclusion of generalized boundary conditions and a modified Legendre transform prescription. We find new and consistent results by considering a self-contained formulation which relates the quantization of the bulk theory to the AdS/CFT correspondence and the perturbation a...

Trace-norm regularization plays a vital role in many learning tasks, such as low-rank matrix recovery (MR), and low-rank representation (LRR). Solving this problem directly can be computationally expensive due to the unknown rank of variables or large-rank singular value decompositions (SVDs). To address this, we propose a proximal Riemannian gradient (PRG) scheme which can efficiently solve tr...

In this work we use algebraic dual spaces with a domain decomposition method to solve the Darcy equations. We define broken Sobolev and their finite dimensional counterparts. A global trace space is defined that connects solution between spaces. Use of results in sparse, metric-free representation incompressibility constraint, pressure gradient term, on continuity constraint sub domains. To dem...

In this paper, we consider the problem of minimizing quantum free energies under constraint that density particles is fixed at each point Rd, for any d≥1. We are more particularly interested in characterization minimizer, which a self-adjoint nonnegative trace class operator, and will show it solution to nonlinear self-consistent problem. This question deriving statistical equilibria heart hydr...

As additive manufacturing expands into multi-material, there is a demand for efficient multi-material topology optimization, where one must simultaneously optimize the topology, and the distribution of various materials within the topology. The classic approach to multi-material optimization is to minimize compliance or stress while imposing two sets of constraints: (1) a total volume constrain...

Constraint satisfaction problems are typically solved using search, augmented by general purpose consistency inference methods. This paper proposes a paradigm shift in which inference is used as the primary problem solving method, and attention is focused on special purpose, domain specific inference methods. While we expect this approach to have computational advantages, we emphasize here the ...

The report proposes a theoretical approach of the debugging of constraint programs based on the notion of explanation tree (D1.1.1 and D1.1.2 part 2). The proposed approach is an attempt to adapt algorithmic debugging to constraint programming. In this theoretical framework for domain reduction, explanations are proof trees explaining value removals. These proof trees are defined by inductive d...

We propose a new subspace clustering model to segment data which is drawn from multiple linear or affine subspaces. Unlike the well-known sparse subspace clustering (SSC) and low-rank representation (LRR) which transfer the subspace clustering problem into two steps’ algorithm including building the affinity matrix and spectral clustering, our proposed model directly learns the different subspa...

Introduction This paper proposes a model for explanations in a set theoretical framework using the notions of closure or fixpoint. In this approach, sets of rules associated with monotonic operators allow to define proof trees (Aczel 1977). The proof trees may be considered as a declarative view of the trace of a computation. We claim they are explanations of the result of a computation. First,...