Codes with minimum distance at least d and covering radius at most d− 1 are considered. The minimal cardinality of such codes is investigated. Herewith, their connection to covering problems is applied and a new construction theorem is given. Additionally, a new lower bound for the covering problem is proved. A necessary condition on an existence problem is presented by using a multiple coverin...

We present a method, based on the idea of salient points, for locating corresponding features between two different faces independently of scale, orientation and position. Salient points are those which have a low probability of being mistaken with other points in the face, and therefore are more likely to be correctly located in a second face. The local image structure at each image point is d...

1 Workshop at which this work was first presented (Utrecht, June 22-24, 1994). For comments on this material, we are grateful to them and the other workshop participants, especially Austin have provided valuable feedback; and the comments, questions, and suggestions from the participants in the (eventually joint) UMass and Rutgers Correspondence Theory seminars were particularly important for t...

Citation: Akiha K, Brigham E, Couch BA, Lewin J, Stains M, Stetzer MR, Vinson EL and Smith MK (2018) What Types of Instructional Shifts Do Students Experience? Investigating Active Learning in Science, Technology, Engineering, and Math Classes across Key Transition Points from Middle School to the University Level. Front. Educ. 2:68. doi: 10.3389/feduc.2017.00068 What Types of instructional shi...

We would like to give robots the ability to position and orient Erratum: Figures 13 and 15 are transposed. parts in the plane by pushing, particularly when the parts are too large or heavy to be grasped and lifted. Unfortunately, the motion of a pushed object is generally unpredictable due to unknown support friction forces. With multiple pushing contact points, however, it is possible to find ...

We introduce variants of Barvinok’s algorithm for counting lattice points in polyhedra. The new algorithms are based on irrational signed decomposition in the primal space and the construction of rational generating functions for cones with low index. We give computational results that show that the new algorithms are faster than the existing algorithms by a large factor.

The main purpose of this paper is to obtain sufficient conditions for existence of points of coincidence and common fixed points for a pair of self mappings satisfying some expansive type conditions in $b$-metric spaces. Finally, we investigate that the equivalence of one of these results in the context of cone $b$-metric spaces cannot be obtained by the techniques using scalarization function....

Twelve female fibromyalgia syndrome (FMS) patients were given 500 mg per day of a blend containing 100 mg ascorbigen and 400 mg broccoli powder in a preliminary, one-month, open-label trial. This group of patients showed a mean 20.1 percent (p=0.044) decrease in their physical impairment score and a mean 17.8 percent (p=0.016) decrease in their total fibromyalgia impact scores as measured by th...