It is often needed to have circuits that can display the decimal representation of a binary number and specifically in this paper on a 7-segment display. In this paper a circuit that can display the decimal equivalent of an n-bit binary number is designed and it’s behavior is described using Verilog Hardware Descriptive Language (HDL). This HDL program is then used to configure an FPGA to implement the designed circuit.
The project has been described the design and construction of a reliable optical testing platform used for evaluate the reflectivity of metal surfaces treated with special paintings required for laser beam attenuation. The platform comprises an Nd-YAG laser system which has been designed and fabricated with specifications to be compatible with their corresponding in laser range finder transmitters used for various applications. The reflectivity of various attenuating paintings, at different detection angles, has been observed. Moreover, the variation of the reflected energy with painting type and metal type to be painted has been studied experimentally. Results illustrated the existence of a definite angle, at which the reflectivity was max
... Show MoreThe aim of the research is to examine the multiple intelligence test item selection based on Howard Gardner's MI model using the Generalized Partial Estimation Form, generalized intelligence. The researcher adopted the scale of multiple intelligences by Kardner, it consists of (102) items with eight sub-scales. The sample consisted of (550) students from Baghdad universities, Technology University, al-Mustansiriyah university, and Iraqi University for the academic year (2019/2020). It was verified assumptions theory response to a single (one-dimensional, local autonomy, the curve of individual characteristics, speed factor and application), and analysis of the data according to specimen partial appreciation of the generalized, and limits
... Show MoreIn this paper, new concepts which are called: left derivations and generalized left derivations in nearrings have been defined. Furthermore, the commutativity of the 3-prime near-ring which involves some
algebraic identities on generalized left derivation has been studied.
R. Vasuki [1] proved fixed point theorems for expansive mappings in Menger spaces. R. Gujetiya and et al [2] presented an extension of the main result of Vasuki, for four expansive mappings in Menger space. In this article, an important lemma is given to prove that the iteration sequence is Cauchy under suitable condition in Menger probabilistic G-metric space (shortly, MPGM-space). And then, used to obtain three common fixed point theorems for expansive type mappings.
The paper shows how to estimate the three parameters of the generalized exponential Rayleigh distribution by utilizing the three estimation methods, namely, the moment employing estimation method (MEM), ordinary least squares estimation method (OLSEM), and maximum entropy estimation method (MEEM). The simulation technique is used for all these estimation methods to find the parameters for the generalized exponential Rayleigh distribution. In order to find the best method, we use the mean squares error criterion. Finally, in order to extract the experimental results, one of object oriented programming languages visual basic. net was used
In this paper, the first integrals of Darboux type of the generalized Sprott ET9 chaotic system will be studied. This study showed that the system has no polynomial, rational, analytic and Darboux first integrals for any value of . All the Darboux polynomials for this system were derived together with its exponential factors. Using the weight homogenous polynomials helped us prove the process.
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
... Show More