Background: Tooth wear is one of the most common problems in the older dentate population which results from the interaction of three processes (attrition, abrasion and erosion) and it affects all societies, different age groups, and all cultures. This study was achieved to evaluate the prevalence and distribution of tooth wear among institutionalized residents in Baghdad city\ Iraq. Subjects and Methods: This survey was accomplished on four private and one governmental institution in Baghdad city. One-hundred twenty three (61 males, 62 females) aged 50-89 years were participated in this study. The diagnosis and recording of tooth wear were according to criteria of Smith and Knight. Results: The prevalence of tooth wear was 100% with a mean

A perturbed linear system with property of strong observability ensures that there is a sliding mode observer to estimate the unknown form inputs together with states estimation. In the case of the electro-hydraulic system with piston position measured output, the above property is not met. In this paper, the output and its derivatives estimation were used to build a dynamic structure that satisfy the condition of strongly observable. A high order sliding mode observer (HOSMO) was used to estimate both the resulting unknown perturbation term and the output derivatives. Thereafter with one signal from the whole system (piton position), the piston position make tracking to desire one with a simple linear output feedback controller after ca

This article studies the nonlocal inverse boundary value problem for a rectangular domain, a second-order, elliptic equation and a two-dimensional equation. The main objective of the article is to find the unidentified coefficient and provide a solution to the problem. The two-dimensional second-order, convection equation is solved directly using the finite difference method (FDM). However, the inverse problem was successfully solved the MATLAB subroutine lsqnonlin from the optimization toolbox after reformulating it as a nonlinear regularized least-square optimization problem with a simple bound on the unknown quantity. Considering that the problem under study is often ill-posed and that even a small error in the input data can hav

Objective: To assess the functional outcome, time to union, shoulder pain, blood loss, operative time, iatrogenic radial nerve injury, hospitalization, and infection. Methodology: It is a prospective randomized study on 30 patients with mid-shaft humerus fracture according to AO classification (1.2A1, 2, 3 and 1,2B) with functioning radial nerve. They were randomly dividing into two groups. Group A were treated by a closed antegrade interlocking nail, and group B treated by open reduction and locked compression plate fixation. The follow-up was up to 6 months, including time to union, shoulder pain, intraoperative blood loss, operative time and iatrogenic radial nerve injury. Functional outcome was assessed by quick DASH score. Resu

Background This study establishes a mathematically consistent and computational framework for the simultaneous identification of two time-dependent coefficients in a one-dimensional second-order parabolic partial differential equation. The considered problem is governed by nonlocal initial, boundary, and integral overdetermination conditions. Methods The direct problem is solved using the Crank-Nicolson finite difference method (FDM), which ensures unconditional stability and second-order accuracy in both spatial and temporal discretizations. The corresponding inverse problem is reformulated as a nonlinear regularized least-squares optimization problem and efficiently solved used the MATLAB subroutine

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of cove