We show that a conditional probability table (CPT) is obtained after every multiplication and every marginalization step when eliminating variables from a discrete Bayesian network. The main advantage of our work is an improvement in presentation. The probability distributions constructed during variable elimination in Bayesian networks have always been denoted as potentials. Since CPTs are a s...

In this article, we give a general form of the quaternions algebra depending on 3-parameters. We define 3-parameter generalized (3PGQs) and study various properties applications. Firstly present definiton, multiplication table algebraic 3PGQs. matrix representation Hamilton operators for derive polar represenation, De Moivre’s Euler’s formulas with representations Additionally, relations betwee...

In this paper, the design of decimation in time Radix-2 FFT processor is presented, which is integrated in FPGA chip, regarding FPGA as design carrier. New butterfly-shaped operation method is proposed based on the traditional FFT algorithm and the analysis of hardware unit, which can reduce multiplication. And it adopted the Look-up table method .The results of hardware test of FFT processor s...

Let Δ be an abelian group. By considering the notion multiplication of Δ-graded modules (see [7]) over a commutative Δ-graded ring with unity, we introduce the notion of product of two Δ-graded submodules which we use to characterize the Δ-graded prime submodules of a multiplication Δ-graded module. Finally we proved a graded version of Nakayama lemma for multiplication Δ-graded modules.

Software-based Galois field implementations are used in the reliability and security components of many storage systems. Unfortunately, multiplication and division operations over Galois fields are expensive, compared to the addition. To accelerate multiplication and division, most software Galois field implementations use pre-computed look-up tables, accepting the memory overhead associated wi...

of vegetative propagation methods and insufficient attempts for replenishment of wild stock of different important plant species have contributed to its threatened status. So realizing the threat of extinction and to meet the growing needs, the alternate method for propagation is micropropagation. This technique is used not only for those plants which are difficult to be propagated through conv...

This paper proposes fast elliptic curve multiplication algorithms resistant against side channel attacks, based on the Montgomerytype scalar multiplication. The proposed scalar multiplications can be applied to all curves over prime fields, e.g., any standardized curves over finite fields with characteristic larger than 3. The method utilizes the addition formulas xECDBL and xECADD assembled by...

New type of elliptic curve point multiplication is proposed, where complex multiplication by 2 − or by 2 ) 7 1 ( − ± is used instead of point duplication. This allows speeding up multiplication about 1.34 times. Using higher radix makes it possible to use one point duplication instead of two and to speed-up computation about 1.6 times. The method takes prime group order factorization: ρ ρ = r a...

Number facts are commonly assumed to be verbally stored in an associative multiplication fact retrieval network. Prominent evidence for this assumption comes from so-called operand-related errors (e.g., 4 × 6 = 28). However, little is known about the development of this network in children and its relation to verbal and non-verbal memories. In a longitudinal design, we explored elementary schoo...

We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group algebra C[G], and (2) controlling the dimensions of the irreducible representations of such groups. We present machinery and examples to support (1), includ...