Off-nucleus isotropic magnetic shielding (σiso(r)) and multi-points nucleus independent chemical shift (NICS(0-2 Å)) index were utilized to find the impacts of the isomerization of gas-phase furfuraldehyde (FD) on bonding and aromaticity of FD. Multidimensional (1D to 3D) grids of ghost atoms (bqs) were used as local magnetic probes to evaluate σiso(r) through gauge-including atomic orbitals (GIAO) at density functional theory (DFT) and B3LYP functional/6-311+G(d,p) basis set level of theory. 1D σiso(r) responses along each bond of FD were examined. Also, a σiso(r) 2D-scan was performed to obtain σiso(r) behavior at vertical heights of 0–1 Å above the FD plane in its cis, transition state (TS) and trans forms. New techniques fo
... Show MoreThe present study was conducted to estimate the antimicrobial activity and the potential biological control of the killer toxin produced by
Let
Two simple methods for the determination of eugenol were developed. The first depends on the oxidative coupling of eugenol with p-amino-N,N-dimethylaniline (PADA) in the presence of K3[Fe(CN)6]. A linear regression calibration plot for eugenol was constructed at 600 nm, within a concentration range of 0.25-2.50 μg.mL–1 and a correlation coefficient (r) value of 0.9988. The limits of detection (LOD) and quantitation (LOQ) were 0.086 and 0.284 μg.mL–1, respectively. The second method is based on the dispersive liquid-liquid microextraction of the derivatized oxidative coupling product of eugenol with PADA. Under the optimized extraction procedure, the extracted colored product was determined spectrophotometrically at 618 nm. A l
... Show MoreMultiplicative 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