Predictive medicine by cytomics represents a new concept which provides disease course predictions for individual patients. The predictive information is derived from the molecular cell phenotypes as they are determined by patient's genotype and exposure to external or internal influences. The predictions are dynamic because they are therapy dependent. They may provide a therapeutic lead time f...

Soil incubations are a common practice typically employed in assessing the effect of some treatment on the availability and solubility of phosphorus (P). However, standard sample preparation (drying and sieving) can alter soil chemical and physical properties, resulting in possible changes in P behavior upon soil incubation. Sixty surface soil samples were collected, air dried, and sieved befor...

We first present a previously unpublished result of Stanton [11] that the group of order four generated by rotation by 90◦ acting on alternating sign matrices exhibits the CSP with the obvious q-analogue of |ASM(n)|. In [12], Wieland introduced a much larger cyclic group that acts on the set of alternating sign matrices. Unfortunately, it has a very complex orbit structure that does not exhibit...

Significant progress in the design of special purpose hardware for supporting the Number Field Sieve (NFS) has been made. From a practical cryptanalytic point of view, however, none of the published proposals for coping with the sieving step is satisfying. Even for the best known designs, the technological obstacles faced for the parameters expected for a 1024-bit RSA modulus are significant. B...

Since 1999 specialized hardware architectures for factoring numbers of 1024 bit size with the Generalized Number Field Sieve (GNFS) have attracted a lot of attention ([Ber], [ST]). Concerns about the feasibility of giant monolytic ASIC architectures such as TWIRL have been raised. Therefore, we propose a parallelized lattice sieving device called SHARK, which completes the sieving step of the G...

The Integer Programming Problem (IP) for a polytope P ⊆ R is to find an integer point in P or decide that P is integer free. We give a randomized algorithm for an approximate version of this problem, which correctly decides whether P contains an integer point or whether a (1 + ) scaling of P around its barycenter is integer free in time O(1/ ) with overwhelming probability. We reduce this appro...