The symmetry method is used to derive solutions of Einstein’s equations for fluid spheres using an isotropic metric and a velocity four vector that is non-comoving. Initially the Lie, classical approach is used to review and provide a connecting framework for many comoving and so shear free solutions. This provides the basis for the derivation of the classical point symmetries for the more gene...

Lameness in dairy cows is a major cause of suffering and economic loss with up to 52% (average 20-25%) of cows becoming lame each year (Clarkson et al., 1996; Green et al., 2002). The vast majority of lameness cases are caused by a variety of non-infectious and infectious claw diseases causing severe pain, decreased milk yield, reduced reproductive performance, high culling rates and increased ...

All single-stage isobaric flash processes involving multicomponent homogeneous mixtures are shown to have unique two-phase solutions. No simplifications with regard to nonideal phase behavior are made. The main result for the isothermal, isobaric (TP) case is established with the aid of a different characterization of material stability, the Gibbs-Duhem equation, and the Cauchy interlace theore...

In this paper we present a successful application of genetic algorithms to the registration of uncalibrated optical images to a 3D surface model. The problem is to find the projection matrices corresponding to the images in order to project the texture on the surface as precisely as possible. Recently, we have proposed a novel method that generalises the photo-consistency approach by Clarkson e...

We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is an implementation of the simplex method which combines exact (multiple precision) arithmetic with inexact (floating point) arithmetic, where the number of exact arithmetic operations is small and usually bounded by a f...

Abstract Iris Presentation Attack Detection (PAD) algorithms address the vulnerability of iris recognition systems to presentation attacks. With great success deep learning methods in various computer vision fields, neural network-based PAD emerged. However, most networks suffer from overfitting due insufficient data variability. Therefore, we explore impact augmentation techniques on performan...

a Natural Resources Research Institute (NRRI), University of Minnesota Duluth, 5013 Miller Trunk Highway, Duluth, MN 55811, USA b Department of Biology, Clarkson University, Potsdam, NY 13699, USA c Dept. of Biology & Institute for Great Lakes Research, Central Michigan University, Mount Pleasant, MI 48859, USA d National Oceanic and Atmospheric Administration, Great Lakes Environmental Researc...

The model for α = 1, β = 1/(m + 1) and γ = 0 was studied by Bagolubasky and Clarkson et al. A second model for α = 0, β = −(1/2) and γ = 0 was studied by Parker and solitary wave solutions were obtained as well. However, a third model was investigated in Refs. 10 and 11 for m = 1 and m = 2 where explicit solitary wave solutions and kinks solutions were derived. For m ≥ 1, we get consecutive exp...

We show that the well-known random incremental construction of Clarkson and Shor can be adapted to provide efficient external-memory algorithms for some geometric problems. In particular, as the main result, we obtain an optimal randomized algorithm for the problem of computing the trapezoidal decomposition determined by a set of N line segments in the plane with K pairwise intersections, that ...