In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...

In this paper we analyze a new location problem which is a generalization of the well-known single facility location model. This extension consists of introducing a general objective function and replacing fixed locations by trajectories. We prove that the problem is well-stated and solvable. A Weiszfeld type algorithm is proposed to solve this generalized dynamic single facility location probl...

We exploit a recently developed nonlocal vector calculus to provide a variational analysis for a general class of nonlocal diffusion problems given by a linear integral equation on bounded domains in R. The ubiquity of the nonlocal operator is illustrated by a number of applications ranging from continuum mechanics to graph theory. These applications elucidate different interpretations of the o...

We study the recovery of multivariate functions from reproducing kernel Hilbert spaces in uniform norm. Surprisingly, a certain weighted least squares operator which uses random samples tailored distribution leads to near-optimal results several relevant situations. The are stated terms decay related singular numbers compact embedding into $L_2(D)$ multiplied with supremum Christoffel function ...

We give a general overview of the state-of-the-art in subspace system identification methods. We have restricted ourselves to the most important ideas and developments since the methods appeared in the late eighties. First, the basis of linear subspace identification are summarized. Different algorithms one finds in literature (Such as N4SID, MOESP, CVA) are discussed and put into a unifyin...

in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.

A logarithmic Sobolev trace inequality is derived. Bounds on the best constant for this inequality from above and below are investigated using the sharp Sobolev inequality and the sharp logarithmic Sobolev inequality. Logarithmic Sobolev inequalities capture the spirit of classical Sobolev inequalities with the logarithm function replacing powers, and they can be considered as limiting cases of...

This paper considers the automatic design of fuzzy rule-basedclassification systems based on labeled data. The classification performance andinterpretability are of major importance in these systems. In this paper, weutilize the distribution of training patterns in decision subspace of each fuzzyrule to improve its initially assigned certainty grade (i.e. rule weight). Ourapproach uses a punish...

‎by considering a degenerate $p(x)-$laplacian equation‎, ‎a generalized compact embedding in weighted variable‎ ‎exponent sobolev space is presented‎. ‎multiplicity of positive solutions are discussed by applying fibering map approach for the‎ ‎corresponding nehari manifold‎.

this paper considers the automatic design of fuzzy rule-basedclassification systems based on labeled data. the classification performance andinterpretability are of major importance in these systems. in this paper, weutilize the distribution of training patterns in decision subspace of each fuzzyrule to improve its initially assigned certainty grade (i.e. rule weight). ourapproach uses a punish...