Pairwise classification has many applications including network prediction, entity resolution, and collaborative filtering. The pairwise kernel has been proposed for those purposes by several research groups independently, and has been used successfully in several fields. In this paper, we propose an efficient alternative which we call a Cartesian kernel. While the existing pairwise kernel (whi...

A production function f is called quasi-sum if there are continuous strict monotone functions F, h1, . . . , hn with F > 0 such that f(x) = F (h1(x1) + · · · + hn(xn)) (cf. [1]). A quasi-sum production function is called quasi-linear if at most one of F, h1, . . . , hn is a nonlinear function. For a production function f , the graph of f is called the production hypersurface of f . In this pape...

in this paper, the time-like hyperruled surfaces in the minkowski 4-space and their algebraicinvariants are worked. also some characteristic results are found about these algebraic invariants.

We present combinatorial operators for the expansion of the Kronecker product of irreducible representations of the symmetric group Sn. These combinatorial operators are defined in the ring of symmetric functions and act on the Schur functions basis. This leads to a combinatorial description of the Kronecker powers of the irreducible representations indexed with the partition (n − 1, 1) which s...

Multi-Input Multi-Output (MIMO) communication systems have become the center of public attention as alternative idea to overcome limitation of Single-Input Single-Output (SISO) [1]. There are three kind of analytic model on correlation-based : i.i.d. model, kronecker model and weichselberger model. In i.i.d. model, all elements of MIMO channel are uncorrelated, and we only need to know the vari...

A stochast Kronecker graph presents a generative model for the social and information networks. By means of EM algorithm with various version of MCMC samplings,we suggest a way to catch the potential Kronecker structure. This model allows us to infer how the latent part of graph is organized as well as to predict how the current graph evolves over time. General Terms Kronecker Graph

Kronecker-like forms of a system pencil are useful in solving many computational problems encountered in the analysis and synthesis of linear systems. The reduction of system pencils to various Kronecker-like forms can be performed by structure preserving 0(n 3) complexity numerically stable algorithms. The presented algorithms form the basis of a modular collection of LAPACK compatible FORTRAN...

In this paper we extend the well known results on the existence and regularity of solutions of the Dirichlet problem for Monge-Ampère equations in a strictly convex domain to an arbitrary smooth bounded domain in Rn as well as in a general Riemannian manifold. We prove for the nondegenerate case that a sufficient (and necessary) condition for the classical solvability is the existence of a subs...