Recently, the financial mathematics has been emerged to interpret and predict the underlying mechanism that generates an incident of concern. A system of differential equations can reveal a dynamical development of financial mechanism across time. Multivariate wiener process represents the stochastic term in a system of stochastic differential equations (SDE). The standard wiener process follows a Markov chain, and hence it is a martingale (kind of Markov chain), which is a good integrator. Though, the fractional Wiener process does not follow a Markov chain, hence it is not a good integrator. This problem will produce an Arbitrage (non-equilibrium in the market) in the predicted series. It is undesired property that leads to erroneous conc

      In this paper we shall prepare an  sacrificial solution for fuzzy differential algebraic equations of fractional order (FFDAEs) based on the Adomian decomposition method (ADM) which is proposed to solve (FFDAEs) . The blurriness will appear in the boundary conditions, to be fuzzy numbers. The solution of the proposed pattern of  equations is studied in the form of a convergent series with readily computable components. Several examples are resolved as  clarifications, the numerical outcomes are obvious that the followed approach is simple to perform and precise when utilized to (FFDAEs).

The techniques of fractional calculus are applied successfully in many branches of science and engineering, one of the techniques is the Elzaki Adomian decomposition method (EADM), which researchers did not study with the fractional derivative of Caputo Fabrizio. This work aims to study the Elzaki Adomian decomposition method (EADM) to solve fractional differential equations with the Caputo-Fabrizio derivative. We presented the algorithm of this method with the CF operator and discussed its convergence by using the method of the Cauchy series then, the method has applied to solve Burger, heat-like, and, couped Burger equations with the Caputo -Fabrizio operator. To conclude the method was convergent and effective for solving this type of

  We study one example of hyperbolic problems it's Initial-boundary string problem with two ends. In fact we look for the solution in weak sense in some sobolev spaces. Also we use energy technic with Galerkin's method to study some properties for our problem as existence and uniqueness

      In this paper we shall prepare an  sacrificial solution for fuzzy differential algebraic equations of fractional order (FFDAEs) based on the Adomian decomposition method (ADM) which is proposed to solve (FFDAEs) . The blurriness will appear in the boundary conditions, to be fuzzy numbers. The solution of the proposed pattern of  equations is studied in the form of a convergent series with readily computable components. Several examples are resolved as  clarifications, the numerical outcomes are obvious that the followed approach is simple to perform and precise when utilized to (FFDAEs).

This study depicts the removal of Manganese ions (Mn2+) from simulated wastewater by combined electrocoagulation/ electroflotation technologies. The effects of initial Mn concentration, current density (C.D.), electrolysis time, and different mesh numbers of stainless steel screen electrodes were investigated in a batch cell by adopting Taguchi experimental design to explore the optimum conditions for maximum removal efficiency of Mn. The results of multiple regression and signal to noise ratio (S/N) showed that the optimum conditions were Mn initial concentration of 100 ppm, C.D. of 4 mA/cm2, time of 120 min, and mesh no. of 30 (wire/inch). Also, the relative significance of each factor was attained by the analysis of variance (ANO

In this work semi–empirical method (PM3) calculations are carried out by (MOPAC) computational packages have been employed to calculate the molecular orbital's energies for some organic pollutants. The long– chain quaternary ammonium cations called Iraqi Clays (Bentonite – modified) are used to remove these organic pollutants from water, by adding a small cationic surfactant so as to result in floes which are agglomerates of organobentonite to remove organic pollutants. This calculation which suggests the best surface active material, can be used to modify the adsorption efficiency of aniline , phenol, phenol deriviatives, Tri methyl glycine, ester and pecticides , on Iraqi Clay (bentonite) by comparing the theoretical results w

   In this research, an adaptive Canny algorithm using fast Otsu multithresholding method is presented, in which fast Otsu multithresholding method is used to calculate the optimum maximum and minimum hysteresis values and used as automatic thresholding for the fourth stage of the Canny algorithm.      The new adaptive Canny algorithm and the standard Canny algorithm (manual hysteresis value) was tested on standard image (Lena) and satellite image. The results approved the validity and accuracy of the new algorithm to find the images edges for personal and satellite images as pre-step for image segmentation.  
 

The goal of this study is to provide a new explicit iterative process method  approach for solving maximal monotone(M.M )operators in Hilbert spaces utilizing a finite family of different types of  mappings as( nonexpansive mappings,resolvent mappings and projection mappings. The findings given in this research strengthen and extend key previous findings in the literature. Then, utilizing various structural conditions in Hilbert space and variational inequality problems, we examine the strong convergence to nearest point projection for these explicit iterative process methods Under the presence of two important conditions for convergence, namely closure and convexity. The findings reported in this research strengthen and extend

      It is frequently asserted that an advantage of a binary search tree implementation of a set over linked list implementation is that for reasonably well balanced binary search trees the average search time (to discover whether or not a particular element is present in the set) is O(log N) to the base 2 where N is the number of element in the set (the size of the tree).  This paper presents an experiment for measuring and comparing the obtained binary search tree time with the expected time (theoretical), this experiment proved the correctness of the hypothesis, the experiment is carried out using a program in turbo Pascal with recursion technique implementation and a statistical method  to prove th