This paper proposes a new sieving algorithm that employs a bucket sort as a part of a factoring algorithm such as the number field sieve. The sieving step requires an enormous number of memory updates; however, these updates usually cause cache hit misses. The proposed algorithm dramatically reduces the number of cache hit misses when the size of the sieving region is roughly less than the squa...

It was found previously that the sieving coefficients of Ficoll and Ficoll sulfate across isolated glomerular basement membrane (GBM) were greatly elevated when BSA was present at physiological levels, and it was suggested that most of this increase might have been the result of steric interactions between BSA and the tracers (5). To test this hypothesis, we extended the theory for the sieving ...

This study develops polydimethylsiloxane microfluidics to enable real-time collection and lysis of Phalaenopsis protoplasts and to analyze and compare the protoplast collecting efficiency of a concave sieving array with that of a convex–concave sieving array. Each set of microfluidics comprises a main flow channel and a protoplast sieving array with collecting channels. The protoplasts were iso...

We resolve affirmatively some conjectures of Reiner, Stanton, and White [12] regarding enumeration of various classes of matrices which are invariant under certain cyclic row and column rotations. Our results are phrased in terms of the bicyclic sieving phenomenon introduced by Barcelo, Reiner, and Stanton [1]. The proofs of our results use various tools from symmetric function theory such as t...

Lattice sieving is asymptotically the fastest approach for solving the shortest vector problem (SVP) on Euclidean lattices. All known sieving algorithms for solving the SVP require space which (heuristically) grows as 2, where n is the lattice dimension. In high dimensions, the memory requirement becomes a limiting factor for running these algorithms, making them uncompetitive with enumeration ...

The best known integer-factoring algorithms consist of two stages: the sieving stage and the linear-algebra stage. Efficient parallel implementations of both these stages have been reported in the literature. All these implementations are based on multi-core or distributed parallelization. In this paper, we experimentally demonstrate that SIMD instructions available in many modern processors ca...

Introduction: We have initiated a major new program to determine the grain size distribution of nearly all lunar soils collected in the Apollo program. Following the return of Apollo soil and core samples, a number of investigators including our own group performed grain size distribution studies and published the results [1-11]. Nearly all of these studies were done by sieving the samples, usu...