Spatial lag dependence in a regression model is similar to the inclusion of a serially autoregressive term for the dependent variable in time-series context. However, unlike in the time series model, the implied covariance structure matrix from the spatial autoregressive model can have a very counterintuitive and improbable structure. A single value of spatial auto correlation parameter can imp...

in this paper, we consider a class of column-weight two quasi-cyclic low-density paritycheck codes in which the girth can be large enough, as an arbitrary multiple of 8. then we devote a convolutional form to these codes, such that their generator matrix can be obtained by elementary row and column operations on the parity-check matrix. finally, we show that the free distance of the convolution...

In this note, we show how the determinant of the q-distance matrix Dq(T ) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al. [R.L. Graham, A.J. Hoffman and H. Hosoya, On the distance matrix of a directed graph, J. Graph Theory 1 (1977) 85–88]. Further, by means of the result, w...

In a weighted spatial network, as specified by an exchange matrix, the variances of the spatial values are inversely proportional to the size of the regions. Spatial values are no more exchangeable under independence, thus weakening the rationale for ordinary permutation and bootstrap tests of spatial autocorrelation. We propose an alternative permutation test for spatial autocorrelation, based...

In the present days, Images are widely used everywhere. The Image retrieval are classified into content based image retrieval that is using image contents such as color, texture, shape and spatial information and context based image retrieval that is using annotated text. Content Based Image Retrieval (CBIR) is a well-known technique for effective image retrieval. The fused features are used to...

Given four complex matrices $A$‎, ‎$B$‎, ‎$C$ and $D$ where $Ainmathbb{C}^{ntimes n}$‎ ‎and $Dinmathbb{C}^{mtimes m}$ and let the matrix $left(begin{array}{cc}‎ A & B ‎ C & D‎ end{array} right)$ be a normal matrix and‎ assume that $lambda$ is a given complex number‎ ‎that is not eigenvalue of matrix $A$‎. ‎We present a method to calculate the distance norm (with respect to 2-norm) from $D$‎ to ...

We consider distance matrices of certain graphs and of points chosen in a rectangular grid. Formulae for the inverse and the determinant of the distance matrix of a weighted tree are obtained. Results concerning the inertia and the determinant of the distance matrix of an unweighted unicyclic graph are proved. If D is the distance matrix of a tree, then we obtain certain results for a perturbat...

let = be a non-negative matrix. denote by the supremum of those , satisfying the following inequality: where , , and also is increasing, non-negative sequence of real numbers. if we used instead of the purpose of this paper is to establish a hardy type formula for , where is hausdorff matrix and a similar result is also established for where in particular, we apply our results to the cesaro...