Objective: The aim of this study is to find out the impact of life events upon onset of depression, to describe the
prevalence of life events among depressed patients.
Methodology: Retrospective a case-control study conducted in AL-Diwanyia Teaching Hospital, Psychiatric
Department on A non-probability (purposive sample) of (60) depressed patients and (60) of healthy person were matched
with them from general population. The data were collected through the use of semi-structured interview by
questionnaire, which consists of two parts (1) divide, section A. cover letter and B. Sociodemographic data which consists
of 9-items, (2) Life events questionnaire consists of 51-items distributed to six dimensions include, family

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 for hist

Browse Iraqi academic journals and research papers

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

The increasing complexity of how humans interact with and process information has demonstrated significant advancements in Natural Language Processing (NLP), transitioning from task-specific architectures to generalized frameworks applicable across multiple tasks. Despite their success, challenges persist in specialized domains such as translation, where instruction tuning may prioritize fluency over accuracy. Against this backdrop, the present study conducts a comparative evaluation of ChatGPT-Plus and DeepSeek (R1) on a high-fidelity bilingual retrieval-and-translation task. A single standardize prompt directs each model to access the Arabic-language news section of the College of Medicine, University of Baghdad, retrieve the three most r