This study develops and implements a computer-assisted learning (CAL) program with both multiplicative facts practices and the instruction of meaning behind these facts. The effectiveness of CAL on the development of multiplication abilities is also explored. Eight CAL activities are developed to teach multiplication to second grade elementary school students. The CAL program is comprised of th...

reactor core for nuclear power plant (1293 mwe) is of pressurized water reactor (pwr) type , with net electric output of 1200 mwe. the reactor is designed by a german company kwu (krafts werk :union:). in order to introduce the methods of calculation of the reactor core parameters to the students at the institute of nuclear science and technology, and in addition to provide them with the basic ...

nine organic substrates viz., rice grains, sorghum grains, wheat grains, millet grains, wheat straw, rice husk, cow dung, sawdust, and poultry manure were used for mass multiplication of trichoderma harzianum. of these,sorghum grains followed by millet grains were the best substrates. the poultry manure appeared to be the most unsuitable substrate, whereas rice grains, wheat grains, wheat straw...

This paper presents a review with numerical example and complexity analysis of the fast multiplication algorithms to help embedded system designers to improve the hardware performance for many applications such as cryptosystems design. The paper presented two practical multiplication algorithms: Karatsuba multiplication algorithm with time complexity O(n ) and Schönhage–Strassen multiplication ...

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...

We show that the multiplication operation c = a br ,1 in the eld GF2 k can be implemented signiicantly faster in software than the standard multiplication, where r is a special xed element of the eld. This operation is the nite eld analogue of the Montgomery multiplication for modular multiplication of integers. We give the bit-level and word-level algorithms for computing the product, perform ...