Herein, we report a unique tin phosphate that is remarkably selective to (137)Cs(+) from extremly acidic solutions because of its special layered structure with an unusually large interlayer space. This acidic exchanger is superior to other existing materials in terms of its selectivity and capacity for (137)Cs(+) from acidic solutions.

We introduce a variant of the large sieve and give an example of its use in a sieving problem. Take the interval [N ] = {1, . . . , N} and, for each odd prime p 6 √ N , remove or “sieve out” by all n whose reduction n(mod p) lies in some interval Ip ⊆ Z/pZ of length (p−1)/2. Let A be the set that remains: then |A| ≪ N log N , a bound which improves slightly on the bound of |A| ≪ N logN which re...

The ability of aphids to detect and find sieve tubes suggests that aphids receive cues for sieve-tube recognition by taking samples. Specific natural conditions such as pH value, sugar species and concentration, viscosity, and oxygen pressure may enable sieve-tube detection. We tested the preference of Megoura viciae and Myzus persicae for potential plant-borne orientation parameters in artific...

Summary Analysis of HIV-1 virions from participants infected in a randomized controlled preventive HIV-1 vaccine efficacy trial can help elucidate mechanisms of partial protection. By comparing the genetic sequence of viruses from vaccine and placebo recipients to the sequence of the vaccine itself, a technique called 'sieve analysis', one can identify functional specificities of vaccine-induce...

Sieve-theoretical methods are one of the first historical examples of theoretical tools whose implementational character has largely contributed to the development of computational musicology. According to Xenakis’ original intuition, we distinguish between elementary transformations of sieves and compound ones. This makes sense if the sieve construction is considered as part of the musical mea...

A prime number sieve is an algorithm that nds the primes up to a bound n. We present four new prime number sieves. Each of these sieves gives new space complexity bounds for certain ranges of running times. In particular, we give a linear time sieve that uses only O(p n=(log log n) 2) bits of space, an O l (n= log log n) time sieve that uses O(n=((log n) l log log n)) bits of space, where l > 1...

A prime number sieve is an algorithm for finding all prime numbers in the range [2,n]. For large n, however, the actual run time of existing algorithms on a single processor computer is prohibitive. Fortunately, the classic Sieve of Eratosthenes and its extensions are suitable for massively parallel architectures or networks of workstations. Two mappings of the third extension sieve are present...

A sieve is a technique for bounding the size of a set after the elements with “undesirable properties” (usually of a number theoretic nature) have been removed. The undesirable properties could be divisibility by a prime from a given set, other multiplicative constraints (divisibility by a perfect square for example) or inclusion in a set of residue classes. The methods usually involve some kin...