Introduction: Content Based Image Retrieval (CBIR) is a method of image searching and retrieval in a  database. In medical applications, CBIR is a tool used by physicians to compare the previous and current  medical images associated with patients pathological conditions. As the volume of pictorial information  stored in medical image databases is in progress, efficient image indexing and retri...

we have developed a three level implicit method for solution of the helmholtz equation. using the cubic spline in space and nite dierence in time directions. the approach has been modied to drive numerov type nite dierence method. the method yield the tri- diagonal linear system of algebraic equations which can be solved by using a tri-diagonal solver. stability and error estimation of the...

It is shown that the problem of covering an n x n chessboard with a minimum number of queens on a major diagonal is related to the number-theoretic function rj(n), the smallest number of integers in a subset of {l,..., n} which must contain three terms in arithmetic progression. Several problems concerning the covering of chessboards by queens have been studied in the literature [2]. In this no...

What determines the shape of the allowed regions in the Ramachandran plot? Although Ramachandran explained these regions in terms of 1-4 hard-sphere repulsions, there are discrepancies with the data where, in particular, the alphaR, alphaL, and beta-strand regions are diagonal. The alphaR-region also varies along the alpha-helix where it is constrained at the center and the amino terminus but d...

For a Hermitian matrix with its main block diagonal given, this paper shows how to choose the off-diagonal blocks such that the resulting matrix has the maximal and minimal possible ranks and inertias, respectively. Some direct consequences and applications are also given.

For a Hermitian matrix with its main block diagonal given, this paper shows how to choose the off-diagonal blocks such that the resulting matrix has the maximal and minimal possible ranks and inertias, respectively. Some direct consequences and applications are also given.

Smallest and greatest 1-Lipschitz aggregation operators with given diagonal section, opposite diagonal section, and with graphs passing through a single point of the unit cube, respectively, are determined. These results are used to find smallest and greatest copulas and quasi-copulas with these properties (provided they exist).