We have investigated, with and without the influence of X-inactivation, the relationship between autosomal gene-dosage and gene-product in a mammalian system, the mouse. The gene was mitochondrial malic enzyme (Mod-2), shown to lie on Chromosome 7 between the albino (c) and shaker-1 (sh-1) loci, and the enzyme was its product, mitochondrial malic enzyme (MOD-2). Gene duplication, with and witho...

The fetal modified myocardial performance index (Mod-MPI) is a noninvasive, pulsed-wave Doppler-derived measure of global myocardial function. This review assesses the progress in technical refinements of its measurement and the potential for automation to be the crucial next step. The Mod-MPI is a ratio of isovolumetric to ejection time cardiac time intervals, and the potential for the left ve...

The finite ring Zk = Z(+, .) mod p k of residue arithmetic with odd prime power modulus is analysed. The cyclic group of units Gk in Zk(.) has order (p − 1).p , implying product structure Gk ≡ Ak.Bk with |Ak| = p− 1 and |Bk| = p , the ”core” and ”extension subgroup” of Gk respectively. It is shown that each subgroup S ⊃ 1 of core Ak has zero sum, and p+1 generates subgroup Bk of all n ≡ 1 mod p...

The suppressor of Hairy wing (su(Hw)) protein inhibits the function of transcriptional enhancers located distally from the promoter with respect to the location of su(Hw)-binding sites. This polarity is due to the ability of the su(Hw)-binding region to form a chromatin insulator. Mutations in modifier of mdg4 (mod(mdg4)) enhance the effect of su(Hw) by inhibiting the function of enhancers loca...

The framework of dependency pairs allows automated termination and innermost termination proofs for many TRSs where such proofs were not possible before. In this paper we present a reenement of this framework in order to prove termination in a modular way. Our mod-ularity results signiicantly increase the class of term rewriting systems where termination resp. innermost termination can be prove...

Let p > 3 be a prime. We show that p−1 k=0 −1/(p + 1) k p+1 ≡ 0 (mod p 5) and p−1 k=0 1/(p − 1) k p−1 ≡ 0 (mod p 4). For any positive integer m ≡ 0 (mod p), we prove that p−1 k=0 (−1) km p/m − 1 k m ≡ 0 (mod p 4), and p−1 k=1 (−1) km k 2 p/m − 1 k m ≡ 1 p p−1 k=1 1 k (mod p 3) if p > 5. The paper also contains some open conjectures.

We introduce “mod n cryptanalysis,” a form of partitioning attack that is effective against ciphers which rely on modular addition and bit rotations for their security. We demonstrate this attack with a mod 3 attack against RC5P, an RC5 variant that uses addition instead of xor. We also show mod 5 and mod 257 attacks against some versions of a family of ciphers used in the FireWire standard. We...

Gabriel showed that for a unital ring R, there exists bijective correspondence between the set of filters R and Giraud subcategories Mod(R). In this paper we prove result analogous to one given by Gabriel: small preadditive category C, left C Mod(C).

The known solutions to the equation τ(p) ≡ 0 (mod p) were p = 2, 3, 5, 7, and 2411. Here we present our method to compute the next solution, which is p = 7758337633. There are no other solutions up to 10.

Therefore 0 + l)* s P + 1 mod p\ Now put t=<r + vp, (0 < c r < p 1). Then ^ = cr̂ , 0 + l)*' s (er + 1)*" mod p. Therefore (er + l)* = a + 1 mod p, (0 < a < p 1). This is relation (7) of my previous note; from this follows (1) as in the earlier treatment. Hence (1) is satisfied by all primes of the form Qn + 1. Therefore the test can be useful only when the exponent p is 3 or is of the form 6n — 1.