Computing the homography matrix using known matching points is a key step in computer vision for image registration. In practice, number, accuracy, and distribution of can affect uncertainty matrix. This study mainly focuses on effect point First, horizontal dilution precision (HDOP) derived to measure influence fixed position accuracy image. The quantization function, which average center poin...

In the spirit of well-known odd-number limitation, we study failure Pyragas control periodic orbits and equilibria. Addressing first, derive a fundamental observation on invariance geometric multiplicity trivial Floquet multiplier. This leads to clear unifying understanding both in autonomous non-autonomous setting. Since presence multiplier governs possibility successful stabilization, refer t...

the object of this paper is to establish a summability factor theorem for summabilitya, , k  1 k  where a is the lower triangular matrix with non-negative entries satisfying certain conditions.

we obtain sufficient conditions for the series σanλn to be absolutely summable of order k by atriangular matrix.

it is proved that by using bounds of eigenvalues of an interval matrix, someconditions for checking positive de niteness and stability of interval matricescan be presented. these conditions have been proved previously with variousmethods and now we provide some new proofs for them with a unity method.furthermore we introduce a new necessary and sucient condition for checkingstability of interv...

pomegranate is an importantly popular fruit crop with iran the main center of its diversity throghout the world. the richest pomegranate genetic resources believed to exist in iran. the present investigation was carried out to study the genetic diversity of 15 genotypes of pomegranate in tarume zanjan making use of rapd markers. genomic dna was extracted from the plant,s leaf, and tested for th...

We consider the Online Boolean Matrix-Vector Multiplication (OMV) problem studied by Henzinger et al. [STOC’15]: given an n× n Boolean matrix M, we receive n Boolean vectors v1, . . . ,vn one at a time, and are required to output Mvi (over the Boolean semiring) before seeing the vector vi+1, for all i. Previous known algorithms for this problem are combinatorial, running in O(n3/ log2 n) time. ...