Existing vision-based displacement sensors (VDSs) extract displacement data through changes in the movement of a target that is identified within the image using natural or artificial structure markers. A target-less vision-based displacement sensor (hereafter called "TVDS") is proposed. It can extract displacement data without targets, which then serve as feature points in the image of the str...

Red rice is a troublesome weed in rice-growing areas of the southern U.S. Red rice in Arkansas may be diverse enough to warrant some adjustments in weed control programs. A study was conducted at the Rice Research and Extension Center (RREC), Stuttgart, Ark., in 2003 to determine the phenotypic diversity of red rice in Arkansas. One hundred thirty-six red rice accessions were collected from 26 ...

For a self{similar or self{aane tile in R n we study the following questions: 1) What is the boundary? 2) What is the convex hull? We show that the boundary is a graph directed self{aane fractal, and in the self{similar case we give an algorithm to compute its dimension. We give necessary and suucient conditions for the convex hull to be a polytope, and we give a description of the Gauss map of...

We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and closest-pair—on the OTIS-Mesh optoelectronic computer. We also demonstrate the algorithms for computing convex hull and prefix sum with condition on a multi-dimensional mesh, which are used to compute convex hull and ECDF ...

A new name for the Oriental genus Nyssomyia Hull, 1962 (Diptera: Asilidae) is proposed. Homonymy exists between this Oriental robber fly genus and the more senior Neotropical phlebotomine sand fly genus Nyssomyia Barretto, 1962 (sensu Galati 2003) (Diptera: Psychodidae), and the following replacement name is proposed: Ekkentronomyia nom. nov. for Nyssomyia Hull (nec Barretto 1962). Accordingly,...

The anchor words algorithm performs provably efficient topic model inference by finding an approximate convex hull in a high-dimensional word co-occurrence space. However, the existing greedy algorithm often selects poor anchor words, reducing topic quality and interpretability. Rather than finding an approximate convex hull in a high-dimensional space, we propose to find an exact convex hull i...

For a self similar or self a ne tile in R we study the following questions What is the boundary What is the convex hull We show that the boundary is a graph directed self a ne fractal and in the self similar case we give an algorithm to compute its dimension We give necessary and su cient conditions for the convex hull to be a polytope and we give a description of the Gauss map of the convex hull