Throughout this paper, a generic iteration algorithm for a finite family of total asymptotically quasi-nonexpansive maps in uniformly convex Banach space is suggested. As well as weak / strong convergence theorems of this algorithm to a common fixed point are established. Finally, illustrative numerical example by using Matlab is presented.
Geographic information system (GIS) is utilized in a variety of tasks such as, resource management, urban planning, emergency planning in case of accident, and rapid response etc. The aim of this study is to produce a digital map with the aid of GIS and a survey data. A survey data is conducted with Total Station technique on sanitary planning positions. The campus of Baghdad University is chosen to test the execution and accuracy of the results for sewer manholes locations. During the field survey, Total Station (Nikon Nivo) is used to identify the 3-D coordinates for each location. Finally, Geographical Information System (GIS) are utilized to present the digital map of the network sewer pipe line to the end users. Although Geographic Inf
... Show MoreThis article describes how to predict different types of multiple reflections in pre-track seismic data. The characteristics of multiple reflections can be expressed as a combination of the characteristics of primary reflections. Multiple velocities always come in lower magnitude than the primaries, this is the base for separating them during Normal Move Out correction. The muting procedure is applied in Time-Velocity analysis domain. Semblance plot is used to diagnose multiples availability and judgment for muting dimensions. This processing procedure is used to eliminate internal multiples from real 2D seismic data from southern Iraq in two stages. The first is conventional Normal Move Out correction and velocity auto picking and
... Show MoreConsider a simple graph on vertices and edges together with a total labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say defined by for all where Also, the value is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by and is the least for which G admits edge irregular h-labeling. In this article, for some common graph families are examined. In addition, an open problem is solved affirmatively.
In this article, we will present a quasi-contraction mapping approach for D iteration, and we will prove that this iteration with modified SP iteration has the same convergence rate. At the other hand, we prove that the D iteration approach for quasi-contraction maps is faster than certain current leading iteration methods such as, Mann and Ishikawa. We are giving a numerical example, too.
Diarrhea is one of the most commonly encountered minor ailments in the community pharmacies. It is associated with significant morbidity and mortality. However, the majority of pharmacists in Iraq did not manage diarrheal cases in a proper way. Therefore, the current study aimed to evaluate the benefit of a new mobile application (diarrhea management step by step) to improve the pharmacist's role in the management of diarrhea. The study was conducted from 21th September to 21th October 2021 using a pre-post design via a simulated patient (SP) technique. A validated diarrhea scenario was presented to each pharmacist by the SP twice, once before and the other after giving the mobile application to the pharmacist. Furthermore, pharmaci
... Show MoreThis paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η) defined on a semigraph G* in which σ : V → [0, 1], μ : VxV → [0, 1] and η : X → [0, 1] satisfy the conditions that for all the vertices u, v in the vertex set, μ(u, v) ≤ σ(u) ᴧ σ(v) and η(e) = μ(u1, u2) ᴧ μ(u2, u3) ᴧ … ᴧ μ(un-1, un) ≤ σ(u1) ᴧ σ(un), if e = (u1, u2, …, un), n ≥ 2 is an edge in the semigraph G
... Show MoreA new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte
... Show MoreThe objective of the current research is to find an optimum design of hybrid laminated moderate thick composite plates with static constraint. The stacking sequence and ply angle is required for optimization to achieve minimum deflection for hybrid laminated composite plates consist of glass and carbon long fibers reinforcements that impeded in epoxy matrix with known plates dimension and loading. The analysis of plate is by adopting the first-order shear deformation theory and using Navier's solution with Genetic Algorithm to approach the current objective. A program written with MATLAB to find best stacking sequence and ply angles that give minimum deflection, and the results comparing with ANSYS.