Aim of the study: Is to evaluate the effect of myrrh oil local application on the healing process of skin wounds histologically , histomorphometrically and , histochemically. Materials and methods:Twenty male white New Zealand rabbits were used in this study. An incisional wounds with full thickness depth and of 2 cm length were done on both sides of the cheek skin of each rabbit. The left sided incisions (the control group) were irrigated with distilled water (10µL). The right sided incisions (the experimental groups) were treated with myrrh oil (10µL). Each group was subdivided into 4 subgroups according to the healing interval into 1,3,7 and 14 days(5 rabbits for each group). Results: Histological findings of our current study showed a highly significant difference between the experimental and the control groups in count of the inflammatory cells which showed that mean values increased with time for the control and the experimental groups. The histomorphometrical findings had shown that the thickness of the epithelium was nearly completed at about 7 days for the experimental groups and at about 14 days for the control. The blood vessels count was recorded to have a highly significant difference between the groups at days 1 and 3 only. The histochemical findings had shown that the collagen fibers remodeling had recorded a highly significant difference between the control and the experimental groups at days 7 and 14. Conclusion: The current study had revealed that myrrh oil accelerates wounds healing in rabbits. Key word:Wound healing , Myrrh oil, Masson’s Trichrome staining.
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