Probabilistic inference with noisy-threshold models based on a CP tensor decomposition

The specification of conditional probability tables (CPTs) is a difficult task in the construction of probabilistic graphical models. Several types of canonical models have been proposed to ease that difficulty. Noisy-threshold models generalize the two most popular canonical models: the noisy-or and the noisy-and. When using the standard inference techniques the inference complexity is exponential with respect to the number of parents of a variable. More efficient inference techniques can be employed for CPTs that take a special form. CPTs can be viewed as tensors. Tensors can be decomposed into linear combinations of rank-one tensors, where a rank-one tensor is an outer product of vectors. Such decomposition is referred to as Canonical Polyadic (CP) or CANDECOMP-PARAFAC (CP) decomposition. The tensor decomposition offers a compact representation of CPTs which can be efficiently utilized in probabilistic inference. In this paper we propose a CP decomposition of tensors corresponding to CPTs of threshold functions, exactly ℓ-out-of-k functions, and their noisy counterparts. We prove results about the symmetric rank of these tensors in the real and complex domains. The proofs are constructive and provide methods for CP decomposition of these tensors. An analytical and experimental comparison with the parent-divorcing method (which also has a polynomial complexity) shows superiority of the CP decomposition-based method. The experiments were performed on subnetworks of the well-known QMRT-DT network generalized by replacing noisy-or by noisy-threshold models.     

A variational framework for nonlinear viscoelastic models in finite deformation regime

This work presents a general framework for constitutive viscoelastic models in the finite deformation regime. The approach is qualified as variational since the constitutive updates consist of a minimization problem within each load increment. The set of internal variables is strain-based and uses a multiplicative decomposition of strain in elastic and viscous components. Spectral decomposition is explored in order to accommodate, into analytically tractable expressions, a wide set of specific models. Moreover, it is shown that, through appropriate choices of the constitutive potentials, the proposed formulation is able to reproduce results obtained elsewhere in the literature. Finally, numerical examples are included to illustrate the characteristics of the present formulation.     

A framework for building spreadsheet based decision models

Spreadsheet based decision modelling is widely used in business today. The functionality provided within the current integrated packages allows users to develop very complex business models. Unfortunately, most spreadsheet users do not follow any particular methodology when building spreadsheet based models. This in turn leads to many wasted hours of debugging and re-programming and often produces models that look more complex than they need to be and are also tedious to extend or modify. This paper presents an example of the type of framework that can be used when developing spreadsheet based business models. The framework encourages the efficient development of more effective models that are easy to use and easy to modify.     

一个基于张量火车分解的张量填充方法及在图像恢复中的应用

低秩张量填充在数据恢复中有广泛应用, 基于张量火车(TT) 分解的张量填充模型在彩色图像和视频以及互联网数据恢复中应用效果良好。本文提出一个基于三阶张量TT分解的填充模型。在模型中, 引入稀疏正则项与时空正则项, 分别刻画核张量的稀疏性和数据固有的块相似性。根据问题的结构特点, 引入辅助变量将原模型等价转化成可分离形式, 并采用临近交替极小化(PAM) 与交替方向乘子法(ADMM) 相结合的方法求解模型。数值实验表明, 两正则项的引入有利于提高数据恢复的稳定性和实际效果, 所提出方法优于其他方法。在采样率较低或图像出现结构性缺失时, 其方法效果较为显著。     

一个基于张量火车分解的张量填充方法及在图像恢复中的应用

低秩张量填充在数据恢复中有广泛应用, 基于张量火车(TT) 分解的张量填充模型在彩色图像和视频以及互联网数据恢复中应用效果良好。本文提出一个基于三阶张量TT分解的填充模型。在模型中, 引入稀疏正则项与时空正则项, 分别刻画核张量的稀疏性和数据固有的块相似性。根据问题的结构特点, 引入辅助变量将原模型等价转化成可分离形式, 并采用临近交替极小化(PAM) 与交替方向乘子法(ADMM) 相结合的方法求解模型。数值实验表明, 两正则项的引入有利于提高数据恢复的稳定性和实际效果, 所提出方法优于其他方法。在采样率较低或图像出现结构性缺失时, 其方法效果较为显著。     

A randomized tensor singular value decomposition based on the t‐product

The tensor SVD (t‐SVD) for third‐order tensors, previously proposed in the literature, has been applied successfully in many fields, such as computed tomography, facial recognition, and video completion. In this paper, we propose a method that extends a well‐known randomized matrix method to the t‐SVD. This method can produce a factorization with similar properties to the t‐SVD, but it is more computationally efficient on very large data sets. We present details of the algorithms and theoretical results and provide numerical results that show the promise of our approach for compressing and analyzing image‐based data sets. We also present an improved analysis of the randomized and simultaneous iteration for matrices, which may be of independent interest to the scientific community. We also use these new results to address the convergence properties of the new and randomized tensor method as well.     

A semidefinite algorithm for completely positive tensor decomposition

A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. In this paper, we characterize the completely positive tensor as a truncated moment sequence, and transform the problem of checking whether a tensor is completely positive to checking whether its corresponding truncated moment sequence admits a representing measure, then present a semidefinite algorithm to solve it. If a tensor is not completely positive, a certificate for it can be obtained; if it is completely positive, a nonnegative decomposition can be obtained.     

News Algorithms for tensor decomposition based on a reduced functional

We study the least squares functional of the canonical polyadic tensor decomposition for third order tensors by eliminating one factor matrix, which leads to a reduced functional. An analysis of the reduced functional leads to several equivalent optimization problem, such as a Rayleigh quotient or a projection. These formulations are the basis of several new algorithms as follows: the Centroid Projection method for efficient computation of suboptimal solutions and fixed‐point iteration methods for approximating the best rank‐1 and the best rank‐R decompositions under certain nondegeneracy conditions. Copyright © 2013 John Wiley & Sons, Ltd.     

Anisotropic finite strain hyperelasticity based on the multiplicative decomposition of the deformation gradient

In this contribution a new constitutive model for transversely isotropic materials is presented. The proposed model is based on the multiplicative decomposition of the deformation gradient into one part containing the deformation only in the direction of anisotropy and another part describing the remaining deformation. This clear assignment leads to a decoupling of the stress-state. The model is investigated analytically in view of simple tension. Moreover, an inhomogenous deformation is solved using a finite elements simulation. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A new framework for the solution of DEA models

We provide an alternative framework for solving data envelopment analysis (DEA) models which, in comparison with the standard linear programming (LP) based approach that solves one LP for each decision making unit (DMU), delivers much more information. By projecting out all the variables which are common to all LP runs, we obtain a formula into which we can substitute the inputs and outputs of each DMU in turn in order to obtain its efficiency number and all possible primal and dual optimal solutions. The method of projection, which we use, is Fourier–Motzkin (F–M) elimination. This provides us with the finite number of extreme rays of the elimination cone. These rays give the dual multipliers which can be interpreted as weights which will apply to the inputs and outputs for particular DMUs. As the approach provides all the extreme rays of the cone, multiple sets of weights, when they exist, are explicitly provided. Several applications are presented. It is shown that the output from the F–M method improves on existing methods of (i) establishing the returns to scale status of each DMU, (ii) calculating cross-efficiencies and (iii) dealing with weight flexibility. The method also demonstrates that the same weightings will apply to all DMUs having the same comparators. In addition it is possible to construct the skeleton of the efficient frontier of efficient DMUs. Finally, our experiments clearly indicate that the extra computational burden is not excessive for most practical problems.     

A concise proof of Kruskal’s theorem on tensor decomposition

A theorem of J. Kruskal from 1977, motivated by a latent-class statistical model, established that under certain explicit conditions the expression of a third-order tensor as the sum of rank-1 tensors is essentially unique. We give a new proof of this fundamental result, which is substantially shorter than both the original one and recent versions along the original lines.     

A finite element framework for the numerical implementation of boundary potentials

This contribution deals with the implications of boundary potential energies on deformational mechanics in the framework of the finite element method at finite strains. The common material models in continuum mechanics are taking the bulk into account, nevertheless, neglecting the boundary. However, boundary effects sometimes play a dominant role in the material behavior, e.g. surface tension in fluids. The boundary potentials, in general, are allowed to depend not only on the boundary deformation gradient but also on the spatial surface–normal / curve–tangent, as well. For the finite element implementation, a suitable curvilinear coordinate system attached to the boundary is defined and corresponding geometrical and kinematical derivations are carried out. Afterwards, the discretization of the generalized weak formulation, including boundary potentials, is carried out and finally numerical examples are presented to demonstrate the boundary effects due to the different proposed material behavior. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A mathematical framework for stochastic climate models

There has been a recent burst of activity in the atmosphere‐ocean sciences community in utilizing stable linear Langevin stochastic models for the unresolved degrees of freedom in stochastic climate prediction. Here a systematic mathematical strategy for stochastic climate modeling is developed, and some of the new phenomena in the resulting equations for the climate variables alone are explored. The new phenomena include the emergence of both unstable linear Langevin stochastic models for the climate mean variables and the need to incorporate both suitable nonlinear effects and multiplicative noise in stochastic models under appropriate circumstances. All of these phenomena are derived from a systematic self‐consistent mathematical framework for eliminating the unresolved stochastic modes that is mathematically rigorous in a suitable asymptotic limit. The theory is illustrated for general quadratically nonlinear equations where the explicit nature of the stochastic climate modeling procedure can be elucidated. The feasibility of the approach is demonstrated for the truncated equations for barotropic flow with topography. Explicit concrete examples with the new phenomena are presented for the stochastically forced three‐mode interaction equations. The conjecture of Smith and Waleffe [Phys. Fluids 11 (1999), 1608–1622] for stochastically forced three‐wave resonant equations in a suitable regime of damping and forcing is solved as a byproduct of the approach. Examples of idealized climate models arising from the highly inhomogeneous equilibrium statistical mechanics for geophysical flows are also utilized to demonstrate self‐consistency of the mathematical approach with the predictions of equilibrium statistical mechanics. In particular, for these examples, the reduced stochastic modeling procedure for the climate variables alone is designed to reproduce both the climate mean and the energy spectrum of the climate variables. © 2001 John Wiley & Sons, Inc.     

A new algorithm for decomposition of graphical models

In this paper, we combine Leimer’s algorithm with MCS-M algorithm to decompose graphical models into marginal models on prime blocks. It is shown by experiments that our method has an easier and faster implementation than Leimer’s algorithm.     

The conformal deformation detour complex for the obstruction tensor

On pseudo-Riemannian manifolds of even dimension , with everywhere vanishing (Fefferman-Graham) obstruction tensor, we construct a complex of conformally invariant differential operators. The complex controls the infinitesimal deformations of obstruction-flat structures, and, in the case of Riemannian signature the complex is elliptic.

     

A decomposition of partitions and numerical sets

Semigroup Forum - The aim of this work is to exhibit a decomposition of partitions of natural numbers and numerical sets. In particular, we obtain a decomposition of a sparse numerical set into the...     

Digital watermarking scheme for colour remote sensing image based on quaternion wavelet transform and tensor decomposition

Digital watermarking is important for protecting the intellectual property of remote sensing images. Unlike watermarking in ordinary colour images, in colour remote sensing images, watermarking has an important requirement: robustness. In this paper, a robust nonblind watermarking scheme for colour remote sensing images, which considers both frequency and statistical pattern features, is constructed based on the quaternion wavelet transform (QWT) and tensor decomposition. Using the QWT, not only the abundant phase information can be used to preserve detailed host image features to improve the imperceptibility of the watermark, but also the frequency coefficients of the host image can provide a stable position to embed the watermark. To further strengthen the robustness, the global statistical feature structure acquired through the tensor Tucker decomposition is employed to distribute the watermark's energy among different colour bands. Because both the QWT frequency coefficients and the tensor decomposition global statistical feature structure are highly stable against external distortion, their integration yields the proposed scheme, which is robust to many image manipulations. A simulation experiment shows that our method can balance the trade‐off between imperceptibility and robustness and that it is more robust than the traditional QWT and discrete wavelet transform (DWT) methods under many different types of image manipulations.