Contrary to the results of an earlier study in which polyinosinic-polycytidylic acid [poly(I:C)] administered intraperitoneally to mice had no effect on multiplication of Mycobacterium leprae in the mouse footpad, the local administration of poly(I:C) every 12 h for 15 doses during logarithmic multiplication was found both to inhibit bacterial multiplication and to produce high tissue levels of...

Preexisting infection with PVM or mumps virus does not prevent multiplication of the virus of influenza A or B in the same tissue. Similarly, pre-existing infection with one or another of the influenza viruses does not prevent multiplication of either PVM or mumps virus in the same tissue. The failure of these two groups of viruses to interfere with the multiplication of each other is discussed...

Multiplication of two numbers represented in base is shown to be computable by an on-line algorithm when is a negative integer, a positive non-integer real number, or a complex number of the form , where is a positive integer.

selected genotypes of sugar beet are often maintained by conventional propagation, but much faster rates of multiplication can be now obtained through micropropagation. on the other hand, plant micropropagation using bioreactors can decrease the cost of production and makes it an economical method. in this research, the possibility of using bioreactor and optimization of the tissue culture proc...

In this paper we first introduce a new multiplication on triangular Banach algebras. Then we study their Arens regularity as well as their topological centers . In this paper we first introduce a new multiplication on triangular Banach algebras. Then we study their Arens regularity as well as their topological centers . In this paper we first introduce a new multiplication on triangular Banach ...

We present a design of an IEEE oating-point multiplier capable of performing either a double-precision multiplication or a single-precision multiplication. In single-precision the la-tency is two clock cycles and in double-precision the latency is three clock cycles, where each pipeline stage contains roughly fteen logic levels. A single-precision multiplication can be followed immediately by a...

Recently, the Residue Number System and the Cox-Rower architecture have been used to compute efficiently Elliptic Curve Cryptography over FPGA. In this paper, we are rewriting the conditions of Kawamura’s theorem for the base extension without error in order to define the maximal range of the set from which the moduli can be chosen to build a base. At the same time, we give a procedure to compu...

This paper was first conceived as a short note in which two operations— called ordered addition and ordered multiplication—were to be defined for ordered systems and shown to include all but the sixth of the assorted operations of ordinal and cardinal addition, multiplication, and exponentiation discussed by G. Birkhoff in [lK1). These facts are still in the paper but are completely overshadowe...