Objectives: To assess the level of dependence severity, locus of control, and readiness to change in male alcohol clients and measure the correlation between dependence with a locus of control and readiness to change.

Methodology: A descriptive correlational design was conducted in the substance use rehabilitation centers at psychiatric teaching hospitals in Baghdad city from November /2021 to May 2022. The instrument of the study was designed by using sociodemographic, the clinical characteristics of the client, the Short-form Alcohol Dependence Data Questionnaire (SADD), Drinking Related Internal-External Locus of Control Scale: (DRIE), and the Stages of Change Readiness and Treatment Eagerness Scale (SOCRATES). The data was co

Background: Esthetic correction represents one of the clinical conditions that required the use of laminate veneers in premolars region. Aim of the study: The purpose of this study was to evaluate the fracture strength of the laminate veneers in maxillary first premolars, fabricated from either composite (direct and indirect techniques) or ceramic CAD/CAM blocks. Materials and Methods: Fifty sound human maxillary premolar teeth were used in this in vitro study. Teeth were divided randomly into one control group and four experimental groups of ten teeth each; Group A: Restored with direct composite veneer (Filtek Z250 XT), Group B: Restored with indirect composite veneers (Filtek Z250 XT), Group C: Restored with lithium disilicate ceramic CA

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