Microfabricated regular sieving structures hold great promise as an alternative to gels to improve the speed and resolution of biomolecule separation. In contrast to disordered porous gel networks, these regular structures also provide well defined environments ideal for the study of molecular dynamics in confining spaces. However, the use of regular sieving structures has, to date, been limite...

Quite similiar to the Sieve of Erastosthenes, the best-known general algorithms for fac-toring large numbers today are memory-bounded processes. We develop three variations of the sieving phase and discuss them in detail. The fastest modiication is tailored to RISC processors and therefore especially suited for modern workstations and massively parallel supercomputers. For a 116 decimal digit c...

The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient algorithm for factoring large integers currently, is a threat for such cryptosystems. Recently, Izu et al. developed a dedicated sieving device “CAIRN 2” with Xilinx’s FPGA which is designed to handle up to 768-bit int...

The transferability of a visible and near-infrared (VNIR) model for soil organic matter (SOM) estimation in riparian landscapes is explored. The results indicate that for the soil samples with air-drying, grinding and 2-mm sieving pretreatment, the model calibrated from the soil sample set with mixed land-use types can be applied in the SOM prediction of cropland soil samples (r 2 Pre = 0.66, R...

The area of lattice-based cryptography is growing ever-more prominent as a paradigm for quantum-resistant cryptography. One of the most important hard problem underpinning the security of latticebased cryptosystems is the shortest vector problem (SVP). At present, two approaches dominate methods for solving instances of this problem in practice: enumeration and sieving. In 2010, Micciancio and ...

The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient algorithm for factoring large integers currently, is a threat for such cryptosystems. Recently, dedicated factoring devices attract much attention since it might reduce the computing cost of the number field sieve meth...

Abstract. Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially qanalogues, have useful interpretations related to actions and representations of the cyclic group. We define sieving for an arbitrary group G and study it for the dihedral group I2pnq of order 2n. This requires understanding the generators of the representation ring of the dihedral group. For ...

Aggregate size and shape measurements are increasingly becoming important issues in the mining, comminution, materials handling, and construction industries. Screening or sieving methods, today’s standard method of sizing stone materials, are simply too inefficient for some applications, excessively time consuming and costly for others, and do not provide enough data for yet other applications....

Many scientific computing applications and engineering simulations exhibit noncontiguous I/O access patterns. Data sieving is an important technique to improve the performance of noncontiguous I/O accesses by combining small and noncontiguous requests into a large and contiguous request. It has been proven effective even though more data is potentially accessed than demanded. In this study, we ...

Microfabricated regular sieving structures hold great promise as an alternative to gels to improve biomolecule separation speed and resolution. In contrast to the disordered gel porous network, these regular structures also provide well-defined environments ideal for study of molecular dynamics in confining spaces. However, previous regular sieving structures have been limited for separation of...