The need to create the optimal water quality management process has motivated researchers to pursue prediction modeling development. One of the widely important forecasting models is the sessional autoregressive integrated moving average (SARIMA) model. In the present study, a SARIMA model was developed in R software to fit a time series data of monthly fluoride content collected from six stations on Tigris River for the period from 2004 to 2014. The adequate SARIMA model that has the least Akaike's information criterion (AIC) and mean squared error (MSE) was found to be SARIMA (2,0,0) (0,1,1). The model parameters were identified and diagnosed to derive the forecasting equations at each selected location. The correlation coefficient between the actual and predicted values for fluoride concentration at the six locations, Al-Karakh, East Tigris, Al-Wathbah, AL-Karamah, Al-Rashid and Al-Wahda WTP intakes, was 0.93, 0.82, 0.86, 0.90, 0.83 and 0.89, respectively. Model verification results indicated that the model forecasting outputs rationally estimated the actual monthly fluoride content in the selected locations.
Anastrozole (ANZ) is considered constitute of the fourth –generation of Non–steroidal aromatase blockage, ANZ has use for hormone receptor positive breast cancer in postmenopausal women. The serious side effects of ANZ including, vaginal dryness, hot flashes, irritability, breast tenderness and un–stability in circulation.
Nanostructured lipid carriers (NLCs) have recently emerged as a multifunctional platform for drug delivery in cancer therapy.
Five formula were composed of (200 mg of glyceryl monostearate, 40 mg of oleic acid , 1% (w/w) Tween 80, 1% (w/w) Poloxamer 407, 1% (w/w) soy lecithin and Vitamin E Polyethylene Glycol Succinate.
The mean particle size, polydispersity index, zeta potential, entrapme
... Show More
(13)
(6)
المستودع الرقمي العراقي. مركز المعلومات الرقمية التابع لمكتبة العتبة العباسية المقدسة
In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise near topological spaces over B. Also, we introduce the concepts of fibrewise near closed and near open topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.
In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm). And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restr
... Show More
(1)
In this paper, we generalized the principle of Banach contractive to the relative formula and then used this formula to prove that the set valued mapping has a fixed point in a complete partial metric space. We also showed that the set-valued mapping can have a fixed point in a complete partial metric space without satisfying the contraction condition. Additionally, we justified an example for our proof.
(1)
Quinolones L1 (ciprofloxacin) are manufactured wide range anti-infection agents with great oral ingestion and magnificent bioavailability. Because of the concoction capacities found on their core (a carboxylic corrosive capacity at the 3-position) and much of the time an essential piperazinyl ring (or anothertN-heterocycle) at the 7-positionh and a carbonylvoxygenc atomi atothel 4-positioni) quinolones bind metal particlesiframing buildings which can go about as bidentate. Bidentateiligands L2=2-phenyl-2-(P-methoxy anilinee) acetonitrilel was set up by the response of Primiryiaminejwithjbenzaldehyde, in nearness of potassiumbcyanidej and acidicimedia . Theimetalledifices were portrayed by the miniaturized scale component examination (C.H
... Show More
In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr
... Show More
(10)
(7)
This paper aims to study the quaternary classical continuous optimal control problem consisting of the quaternary nonlinear parabolic boundary value problem, the cost function, and the equality and inequality constraints on the state and the control. Under appropriate hypotheses, it is demonstrated that the quaternary classical continuous optimal control ruling by the quaternary nonlinear parabolic boundary value problem has a quaternary classical continuous optimal control vector that satisfies the equality constraint and inequality state and control constraint. Moreover, mathematical formulation of the quaternary adjoint equations related to the quaternary state equations is discovered, and then the weak form of the quaternary adjoint
... Show More
In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).
The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.