Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex

Background: The displacement of artificial teeth during complete denture construction presents major processing errors in the occlusal vertical dimension which were verified at the previous trial denture stage. The aim of this study was to assess the effect of delay in processing after final flask closure and tension application on the vertical acrylic and porcelain teeth displacement of complete dentures constructed from heat cured acrylic and the results were compared with the conventional processing method. Materials and methods: forty samples of identical maxillary complete dentures were constructed from heat polymerized acrylic resin. These samples were subdivided into the following experimental subgroups in which each subgroup contai

The article emphasizes that 3D stochastic positive linear system with delays is asymptotically stable and depends on the sum of the system matrices and at the same time independent on the values and numbers of the delays. Moreover, the asymptotic stability test of this system with delays can be abridged to the check of its corresponding 2D stochastic positive linear systems without delays. Many theorems were applied to prove that asymptotic stability for 3D stochastic positive linear systems with delays are equivalent to 2D stochastic positive linear systems without delays. The efficiency of the given methods is illustrated on some numerical examples. HIGHLIGHTS Various theorems were applied to prove the asymptoti

In this paper the definition of fuzzy normed space is recalled and its basic properties. Then the definition of fuzzy compact operator from fuzzy normed space into another fuzzy normed space is introduced after that the proof of an operator is fuzzy compact if and only if the image of any fuzzy bounded sequence contains a convergent subsequence is given. At this point the basic properties of the vector space FC(V,U)of all fuzzy compact linear operators are investigated such as when U is complete and the sequence ( ) of fuzzy compact operators converges to an operator T then T must be fuzzy compact. Furthermore we see that when T is a fuzzy compact operator and S is a fuzzy bounded operator then the composition TS and ST are fuzzy compact

Signal denoising is directly related to sample estimation of received signals, either by estimating the equation parameters for the target reflections or the surrounding noise and clutter accompanying the data of interest. Radar signals recorded using analogue or digital devices are not immune to noise. Random or white noise with no coherency is mainly produced in the form of random electrons, and caused by heat, environment, and stray circuitry loses. These factors influence the output signal voltage, thus creating detectable noise. Differential Evolution (DE) is an effectual, competent, and robust optimisation method used to solve different problems in the engineering and scientific domains, such as in signal processing. This paper looks

This study delves into the properties of the associated act V over the monoid S of sinshT. It examines the relationship between faithful, finitely generated, and separated acts, as well as their connections to one-to-one and onto operators. Additionally, the correlation between acts over a monoid and modules over a ring is explored. Specifically, it is established that  functions as an act over S if and only if  functions as module, where T represents a nilpotent operator. Furthermore, it is proved that when T is onto operator and  is finitely generated, is guaranteed to be finite-dimensional. Prove that for any bounded operator the following,  is acting over S if and only if  is a module where T is a nilpotent operator, is a

Linear programming currently occupies a prominent position in various fields and has wide applications, as its importance lies in being a means of studying the behavior of a large number of systems as well. It is also the simplest and easiest type of models that can be created to address industrial, commercial, military and other dilemmas. Through which to obtain the optimal quantitative value. In this research, we dealt with the post optimality solution, or what is known as sensitivity analysis, using the principle of shadow prices. The scientific solution to any problem is not a complete solution once the optimal solution is reached. Any change in the values of the model constants or what is known as the inputs of the model that will chan

In this paper we used frequentist and Bayesian approaches for the linear regression model to predict future observations for unemployment rates in Iraq. Parameters are estimated using the ordinary least squares method and for the Bayesian approach using the Markov Chain Monte Carlo (MCMC) method. Calculations are done using the R program. The analysis showed that the linear regression model using the Bayesian approach is better and can be used as an alternative to the frequentist approach. Two criteria, the root mean square error (RMSE) and the median absolute deviation (MAD) were used to compare the performance of the estimates. The results obtained showed that the unemployment rates will continue to increase in the next two decade