We say that a k-uniform hypergraph C is a Hamilton cycle of type `, for some 1 ≤ ` ≤ k, if there exists a cyclic ordering of the vertices of C such that every edge consists of k consecutive vertices and for every pair of consecutive edges Ei−1, Ei in C (in the natural ordering of the edges) we have |Ei−1 \ Ei| = `. We define a class of ( , p)-regular hypergraphs, that includes random hypergraph...

The time-lag method, using a gas permeation experiment, is currently the most popular method for determining the membrane properties: diffusivity coefcient and permeability coefcient, and from which the solubility coefcient can be calculated. In this investigation, the impact of systematic, random (noise), resolution and extrapolation errors associated with gas permeatio...

This paper presents simple large sample prediction intervals for a future response Yf given a vector xf of predictors when the regression model has the form Yi = m(xi) + ei where m is a function of xi and the errors ei are iid. Intervals with correct asymptotic coverage and shortest asymptotic length can be made by applying the shorth estimator to the residuals. Since residuals underestimate th...