Background: Preoperative radiographical assessment of the maxillofacial lesions is of a great importance in guiding the surgeon during surgical procedure in reducing post-operative complications. This study highlighted the application of CBCT scan in the assessment of maxillofacial cystic and cystic like lesions as a part of advanced radiology Materials and methods: A total of 20 patients (15 males and 5 females) participated in this prospective study. CBCT scan (Kodak 9500 CBCT) with (DICOM) software utilized to perform scanning to all patients in order to assess lesion extension, morphological features and it’s relation to the adjacent vital structures. Results: In this study, the total cystic and cystic like lesions involving the

The semiempirical (PM3) and DFT quantum mechanical methods were used to investigate the theoretical degradation of Indigo dye. The chemical reactivity of the Indigo dye was evaluated by comparing the potential energy stability of the mean bonds. Seven transition states were suggested and studied to estimate the actually starting step of the degradation reaction. The bond length and bond angle calculations indicate that the best active site in the Indigo dye molecule is at C10=C11.  The most possible transition states are examined for all suggested paths of Indigo dye degradation predicated on zero-point energy and imaginary frequency. The first starting step of the reaction mechanism is proposed. The change in enthalpy, Gibbs free energ

Because of vulnerable threats and attacks against database during transmission from sender to receiver, which is one of the most global security concerns of network users, a lightweight cryptosystem using Rivest Cipher 4 (RC4) algorithm is proposed. This cryptosystem maintains data privacy by performing encryption of data in cipher form and transfers it over the network and again performing decryption to original data. Hens, ciphers represent encapsulating system for database tables

There has been a great deal of research into the considerable challenge of managing of traffic at road junctions; its application to vehicular ad hoc network (VANET) has proved to be of great interest in the developed world. Dynamic topology is one of the vital challenges facing VANET; as a result, routing of packets to their destination successfully and efficiently is a non-simplistic undertaking. This paper presents a MDORA, an efficient and uncomplicated algorithm enabling intelligent wireless vehicular communications. MDORA is a robust routing algorithm that facilitates reliable routing through communication between vehicles. As a position-based routing technique, the MDORA algorithm, vehicles' precise locations are used to establish th

Implementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.

Zernike Moments has been popularly used in many shape-based image retrieval studies due to its powerful shape representation. However its strength and weaknesses have not been clearly highlighted in the previous studies. Thus, its powerful shape representation could not be fully utilized. In this paper, a method to fully capture the shape representation properties of Zernike Moments is implemented and tested on a single object for binary and grey level images. The proposed method works by determining the boundary of the shape object and then resizing the object shape to the boundary of the image. Three case studies were made. Case 1 is the Zernike Moments implementation on the original shape object image. In Case 2, the centroid of the s

A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc

KA Hadi, AH Asma’a, IJONS, 2018 - Cited by 1