Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric
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
... Show MoreAbstract
Prescribing drugs to patients to treat ailments or reducing their morbidity may not be enough, even if the drugs were all indicated and in the right dose. Clinical pharmacists play a pivotal role in conducting information and instruction to patients and conveying feedback to treating physician when appropriate, and the final goal is in the interest of the patient. Identification and classification of drug related problems and discussing them with the health care providers. Prospective, interventional, clinical study for 180 hemodialysis patients, and was designed as two phases, an observational phase to identify drug related problems and classifying them according to the latest Pharmaceutical
... Show MoreIn this work, we prove that the triple linear partial differential equations (PDEs) of elliptic type (TLEPDEs) with a given classical continuous boundary control vector (CCBCVr) has a unique "state" solution vector (SSV) by utilizing the Galerkin's method (GME). Also, we prove the existence of a classical continuous boundary optimal control vector (CCBOCVr) ruled by the TLEPDEs. We study the existence solution for the triple adjoint equations (TAJEs) related with the triple state equations (TSEs). The Fréchet derivative (FDe) for the objective function is derived. At the end we prove the necessary "conditions" theorem (NCTh) for optimality for the problem.
In the present article, we implement the new iterative method proposed by Daftardar-Gejji and Jafari (NIM) [V. Daftardar-Gejji, H. Jafari, An iterative method for solving nonlinear functional equations, J. Math. Anal. Appl. 316 (2006) 753-763] to solve two problems; the first one is the problem of spread of a non-fatal disease in a population which is assumed to have constant size over the period of the epidemic, and the other one is the problem of the prey and predator. The results demonstrate that the method has many merits such as being derivative-free, overcome the difficulty arising in calculating Adomian polynomials to handle the nonlinear terms in Adomian Decomposition Method (ADM), does not require to calculate Lagrange multiplier a
... Show MoreThis research aims to test the causal relationship long-and short-run between the price of gold the global crude oil price and the exchange rate of the dollar and how you can take advantage of the nature of this relationship, particularly in the Arab oil states that achieve huge surpluses, including Iraq and how to keep on the purchasing power of these surpluses or reduce the levels of risk.
The problem is that the Arab oil countries, adversely affected, as a result of that relationship, due to the fact that its role confined to the sale of crude oil only. They do not have control in the dollar, then they are not able to take advantage of its impact on the price of gold the fact that gold is effective pr
... Show MoreThis paper presents the matrix completion problem for image denoising. Three problems based on matrix norm are performing: Spectral norm minimization problem (SNP), Nuclear norm minimization problem (NNP), and Weighted nuclear norm minimization problem (WNNP). In general, images representing by a matrix this matrix contains the information of the image, some information is irrelevant or unfavorable, so to overcome this unwanted information in the image matrix, information completion is used to comperes the matrix and remove this unwanted information. The unwanted information is handled by defining {0,1}-operator under some threshold. Applying this operator on a given ma
... Show MoreThe wavelets have many applications in engineering and the sciences, especially mathematics. Recently, in 2021, the wavelet Boubaker (WB) polynomials were used for the first time to study their properties and applications in detail. They were also utilized for solving the Lane-Emden equation. The aim of this paper is to show the truncated Wavelet Boubaker polynomials for solving variation problems. In this research, the direct method using wavelets Boubaker was presented for solving variational problems. The method reduces the problem into a set of linear algebraic equations. The fundamental idea of this method for solving variation problems is to convert the problem of a function into one that involves a finite number of variables. Diff
... Show MoreAmong a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.
This paper develop conventional Runge-Kutta methods of order four and order five to solve ordinary differential equations with oscillating solutions. The new modified Runge-Kutta methods (MRK) contain the invalidation of phase lag, phase lag’s derivatives, and ampliï¬cation error. Numerical tests from their outcomes show the robustness and competence of the new methods compared to the well-known Runge-Kutta methods in the scientiï¬c literature.
The purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m
... Show More