Background: Pleomorphic adenoma of the minor salivary gland is a rare benign tumor. It commonly occurs in the hard and soft palates. Treatment by surgical excision achieved success in improving the patient’s health. Objective: To evaluate the recurrence rate after surgical treatment of pleomorphic adenoma in minor salivary glands. Methods: This retrospective study included patients who attended the Maxillofacial Surgery Unit in Ghazi Al-Hariri Hospital, Baghdad, from 2019 to 2021, complaining of soft tissue lumps involving the soft and hard palate, buccal mucosa, and upper lip. After the provisional diagnosis of these lesions, a total surgical excision of the tumor with a safe margin of 1 mm was performed, and the biopsy was sent

The research aims to assess the claystone exposed in the Nfayil Formation (Middle Miocene) for Portland cement (P.C.) manufacturing based on mineralogy and geochemistry. The importance of the study is to avoid the miming of the agricultural soils that are mining now for the cement industry. Claystones of Nfayil Formation and the limestone of the Euphrates Formation were used to design the raw mixture as clay to limestone (1:3). The chemical composition (%) of the designed mixture was calculated using the Alligation Alternative Method (A.A.M.) as CaO (65.52), MgO (1.05), SiO2 (21.65), Al2O3 (7.43), Fe2O3 (2.62), Na2O3+K2O (1.52) and SO3 (0.26), which are suitable for P.C. The lime saturation factor (LSF = 92.8), silica saturation fac

This assay rapidly detects chlorpromazine hydrochloride using its ability to reduce gold ions to form nanoparticles. Its low cost, resilience to interferences and short analysis time could facilitate environmental monitoring and biomedical analysis.

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

Background: Non-small cell lung cancer (NSCLC) is caused of 85% of all lung cancers. Among the most important factors for lung tumor growth and proliferation are the tyrosine kinase receptors that coded by the epidermal growth factor recep-tor (EGFR) gene. Activation of EGFR ultimately leads to developing of lung cancer. The present study was undertaken with an objective to detect EGFR mutations in bronchial wash from Iraqi patients with NSCLC before treatment. Methods: DNA was extracted from bronchial wash samples collected from 50 patients with NSCLC by using a Qiamp DNA Mini Kit (Qiagen, Hilden, Germany). Then, EGFR mutations were determined by using real-time RCR combined with two technologies, Amplification Refractory Mutation System (