In this paper, first we   refom1Ulated   the finite   element  model

(FEM)   into   a   neural   network   structure   using   a   simple   two   - dimensional problem. The structure of this neural network is described

, followed  by its   application   to   solving  the forward    and  inverse problems. This model is then extended to the general case and the advantages and  di sadvantages  of  this  approach  are  descri bed  along with an analysis  of  the sensi tivity   of

Background: Patients with decompensated cirrhosis are often given therapeutic and prophylactic drugs. Polypharmacy raises both the likelihood of prescription errors and the complications associated with drugs. Clinical pharmacists are excellent at recognizing, addressing, and preventing clinically significant drug-related problems.

Objectives: Identification types of pharmacist interventions to address drug-related problems in patients with decompensated cirrhosis and assess the acceptance/implementation of these recommendations. And identify patient factors associated with accepting pharmacist recommend

Seeking pharmacist advice about minor ailments is a common practice among Iraqi patients because such advice is free and quick. Unfortunately, the assessment and management of minor ailments by Iraqi pharmacists were inappropriate. Therefore, this study aimed to develop a model for a mobile application that can assist community pharmacists in the diagnosis and management of minor ailments.

     In this article, we aim to define a universal set consisting of the subscripts of the fuzzy differential equation (5) except the two elements  and , subsets of that universal set are defined according to certain conditions. Then, we use the constructed universal set with its subsets for suggesting an analytical method which facilitates solving fuzzy initial value problems of any order by using the strongly generalized H-differentiability. Also, valid sets with graphs for solutions of fuzzy initial value problems of higher orders are found.

   The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits  of( FMOLP)   algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun