نتایج جستجو برای: mass multiplication
تعداد نتایج: 501508 فیلتر نتایج به سال:
Atriplex taltalensis is an endangered shrub endemic to northern Chile. Sparse populations of this species can be found in areas with extreme edaphoclimatic conditions the Atacama desert, and its seeds have a poor germination rate. Consequently, mass-cultivating it challenging. In study, vegetative propagation mechanisms A. were evaluated using vitro culture aid their conservation. shoot explant...
چکیده ندارد.
Background and Aim: Helicobacter (H.) pylori is responsible for one of the most common bacterial infections in the world. Probiotics such as lactobacilli prevent the multiplication of a wide range of human and animal pathogens. One of the useful potentials of probiotics is their antagonist effect on harmful microorganisms so that they would be effective in prevention and treatment of H. pylori...
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 ...
The utility of surface-induced dissociation (SID) to probe the structure, energetics and fragmentation mechanisms of protonated peptides is discussed and demonstrated. High internal energy deposition provided by low-energy (eV range) ion-surface collisions yields extensive fragmentation of protonated peptides, allowing relatively uncomplicated and rapid sequence analysis of oligopeptides. SID o...
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 ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید