Four samples of the Se55S20Sb15Sn10 alloy were prepared using the melting point method. Samples B, C and D were irradiated with (6.04×1010, 12.08×1010 and 18.12×1010 (n.cm-2s -1 ) of thermal neutron beam from a neutron source (241Am-9Be) respectively, while sample A was left not irradiated. The electrical properties were assessed both before and after the radiation. All irradiated and non-irradiated samples show three conduction mechanisms, at low temperatures, electrical conductivity is achieved by electron hopping between local states near the Fermi level. At intermediate temperatures, conduction occurs by the jumping of electrons between local states at band tails. At high temperatures, electrons transfer between extended states in bands. The results show that the local and extended state densities above the Fermi level are affected by exposure to thermal neutron radiation.
We aimed to obtain magnesium/iron (Mg/Fe)-layered double hydroxides (LDHs) nanoparticles-immobilized on waste foundry sand-a byproduct of the metal casting industry. XRD and FT-IR tests were applied to characterize the prepared sorbent. The results revealed that a new peak reflected LDHs nanoparticles. In addition, SEM-EDS mapping confirmed that the coating process was appropriate. Sorption tests for the interaction of this sorbent with an aqueous solution contaminated with Congo red dye revealed the efficacy of this material where the maximum adsorption capacity reached approximately 9127.08 mg/g. The pseudo-first-order and pseudo-second-order kinetic models helped to describe the sorption measure
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