objective: monitoring of influenza virus shedding and optimization of multiplicities of infection (moi) is important in the investigation of a virus one step growth cycle and for obtaining a high yield of virus in vaccine development and conventional basic diagnostic methods. however, eluted infectious viruses may still be present immediately after virus inoculation and when cells are washed fo...

The system of fixed elements of a projectivity contains with any two points the line connecting them and with any two lines their intersection. It is, therefore, in its structure very much like a subplane of the plane under consideration ; and thus one may expect the structure of the projectivity to be dominated by the structure of the system of its fixed elements, provided this system is not "...

-This paper proposes a method for line matching based on invariance of feature points. Firstly, feature points are roughly matched by Normalized Cross Correlation (NNC) and Average of Square Difference (ASD). Additionally, feature points obtained from the two views are grouped into matched point pairs. Finally, curve segments between matched point pairs are matched by dynamic programming algori...

We interpret a recent formula for counting orbits of GL(d, Fq) in terms of counting fixed points as addition in the affine braided line. The theory of such braided groups (or Hopf algebras in braided categories) allows us to obtain the inverse relationship, which turns out to be the same formula but with q and q interchanged (a perfect duality between counting orbits and counting fixed points)....

An algorithm to group edge points into digital line segments with Hough transformation is described in this paper. The edge points are mapped onto the parameter domain discretized at specific intervals, on which peaks appear to represent different line segments. By modeling each peak as a Gaussian function in the parameter domain, a region, to which the edge points are supposed to be mapped, is...

We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the Random-Edge simplex algorithm on simple polytopes with n facets in dimension n − 2. We obtain a tight O(log n) bound for the expected number of pivot steps. This is the first nontrivial bound for Random-Edge which goes beyond bounds for specific polytopes. The process it...

Finding the closest or farthest line segment (line) from a point are fundamental proximity problems. Given a set S of n points in the plane and another point q, we present optimal O(n logn) time, O(n) space algorithms for finding the closest and farthest line segments (lines) from q among those spanned by the points in S. We further show how to apply our techniques to find the minimum (maximum)...

We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax+ b), given real numbers a, b, and x. We apply our main theorem to a problem in fractal geometry, giving an improved lower bound on the (classical) Hausdorff dimension of generalized sets of Furstenberg type.

Nous considérons l’anneau des invariants de n points ordonnés sur la droite projective. L’espace (P)//PGL2 est peut-être le premier exemple intéressant d’un quotient GIT. La construction dépend du choix des poids pour les n points. En 1894, Kempe [K] a introduit un ensemble de générateurs (au moins dans le cas où tous les poids sont constants egaux à 1). Ici, nous décrivons les rélations entre ...