to study the effects of two irrigation regimes and application of barley residue, zeolite and superabsorbent polymer on forage yield and some physiological traits of maize and sorghum, an experiment was conducted over two years in kerman, iran. a randomized complete block design arranged in a factorial split was used with three replications. two irrigation regimes of normal irrigation and water...

Mutant forms of kinin B(1) receptor (B(1)R) and analogs of the full agonist des-Arg(9)-bradykinin (DABK) were investigated aiming to verify the importance of selected receptor residues and of each agonist-peptide residue in the specific binding and activation. Linked by a specific disulfide bond (Cys(100)-Cys(650)), the N-terminal (N(t)) and the EC3 loop C-terminal (C(t)) segments of angiotensi...

The residue number system (RNS) is popular in high performance computation applications because of its carry-free nature. The challenges of RNS systems design lie in the moduli set selection and in the reverse conversion from residue representation to weighted representation. In this paper, we proposed a fully parallel reverse conversion algorithm for the moduli set {r – 2, r – 1, r}, based on ...

Let R be a real closed field. An integer part for R is a subring that sits inside R the way the integers sit inside the reals. Mourgues and Ressayre [10] showed that every real closed field has an integer part. We may associate with R a value group G that is a subgroup of (R+, ·), a residue field k that is a subfield of R, and an integer part I. The Mourgues and Ressayre construction involves m...

In this paper we derive a Gilbert-Varshamov type bound for linear codes over Galois rings. For linear codes over the Galois ring GR(pl; j) the result can be stated as follows. Given r; such that 0 < r < 1 and 0 < H 1 pj (1 r): Then for all n N; where N is a sufficiently large integer, there exist [n; k] GR linear codes over GR(pl; j) such that k=n r and d=n : Consequently, this bound does not g...

For integers a and n > 0, let a(n) denote the residue class {x ∈ Z : x ≡ a (mod n)}. Let A be a collection {as(ns)}s=1 of finitely many residue classes such that A covers all the integers at least m times but {as(ns)} s=1 does not. We show that if nk is a period of the covering function wA(x) = |{1 6 s 6 k : x ∈ as(ns)}| then for any r = 0, . . . , nk−1 there are at least m integers in the form...

All vertebrate alpha3- and alpha3/4-FUTs possess the characteristic acceptor-binding motif VxxHH(W/R)(D/E). FUT6 and FUTb enzymes, harboring R in the acceptor-binding motif, transfer fucose in alpha1,3 linkage, whereas FUT3 and FUT5 enzymes with W at the candidate position can also transfer fucose in alpha1,4 linkage-FUT3 being more efficient than FUT5. To determine the involvement of the W/R r...

There is a rich literature on conditions guaranteeing that certain sums of residue classes cover certain other residue classes modulo some integer N . Often it is of particular importance for applications to know that the class 0 mod N can be represented as a sum of the studied residue classes, and the zero class is often the most difficult case. A well-known result along these lines is the fam...

It is shown that an even partition A∪B of the set R = {1, 2, . . . , p− 1} of positive residues modulo an odd prime p is the partition into quadratic residues and quadratic non-residues if and only if the elements of A and B satisfy certain additive properties, thus providing a purely additive characterization of the set of quadratic residues. 1 Additive properties of quadratic residues An inte...