Introduction: Sieving was used extensively until 1999 to determine the particle size distribution of lunar samples. This method is time-consuming, and requires more than a gram of material in order to obtain a result in which one may have confidence. This is demonstrated by the difference in geometric mean and median for samples measured by [1], in which a 14-gram sample produced a geometric me...

Duodenal samples from three lactating cows were used to measure the particle size distribution by wet sieving and by laser diffraction (LD). The median particle size was calculated in the size range where the methods overlapped, and the median particle size was not different between the methods (P = 0.98). The particle size data were also fitted to a log normal distribution function. The logari...

Shahin, M.A. and Symons, S.J. 2005. Seed sizing from images of non-singulated grain samples. Canadian Biosystems Engineering/Le génie des biosystèmes au Canada 47: 3.49 3.55. Image analysis is a strong candidate for developing automated measurement systems for seed sizing. A unique image analysis (IA) based approach to measuring seed size from non-singulated samples is presented in this paper. ...

The transport equation describing the flow of solute across a membrane has been modified on the basis of theoretical studies calculating the drag of a sphere moving in a viscous liquid undergoing Poiseuille flow inside a cylinder. It is shown that different frictional resistance terms should be introduced to calculate the contributions of diffusion and convection. New sieving equations are deri...

In this work we study speed-ups and time–space trade-offs for solving the shortest vector problem (SVP) on Euclidean lattices based on tuple lattice sieving. Our results extend and improve upon previous work of Bai–Laarhoven– Stehlé [ANTS’16] and Herold–Kirshanova [PKC’17], with better complexities for arbitrary tuple sizes and offering tunable time–memory tradeoffs. The trade-offs we obtain st...

It is known that backward iterations of independent copies a contractive random Lipschitz function converge almost surely under mild assumptions. By sieving (or thinning) procedure based on adding to the functions time and space components, it possible construct scale invariant stochastic process. We study its distribution paths properties. In particular, we show càdlàg has finite total variati...

This paper presents a multi-sieving network (MSN) architecture and a multi-sieving learning (MSL) algorithm for it. The basic idea behind MSN architecture is the multi-sieve method, that is, patterns are classified by a rough sieve at the beginning and done by finer ones gradually. MSN is constructed by adding a sieving module (SM) adaptively with progress of training. SM consists of two differ...

The best algorithms for discrete logarithms in Jacobians of algebraic curves of small genus are based on index calculus methods coupled with large prime variations. For hyperelliptic curves, relations are obtained by looking for reduced divisors with smooth Mumford representation [4]; for non-hyperelliptic curves it is faster to obtain relations using special linear systems of divisors [2, 3]. ...

The Garsia–Haiman module is a bigraded Sn-module whose Frobenius image Macdonald polynomial. method of orbit harmonics promotes an Sn-set X to graded polynomial ring. can be applied prove cyclic sieving phenomena which notion that encapsulates the fixed-point structure finite group action on set. By applying this idea module, we provide results regarding enumeration matrices are invariant under...