The aim of this paper is to construct the (k,r)-caps in the projective 3-space PG(3,p) over Galois field GF(4). We found that the maximum complete (k,2)-cap which is called an                       ovaloid  , exists in PG(3,4) when k = 13. Moreover the maximum (k,3)-caps, (k,4)-caps and   (k,5)-caps. 

MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix.   In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over  of length  and 28 have been found.

The electrocoagulation process became one of the most important technologies used for water treatment processes in the last few years. It’s the preferred method to remove suspended solids and heavy metals from water for treating drinking water and wastewater from textile, diary, and electroplating factories. This research aims to study the effect of using the electrocoagulation process with aluminum electrodes on the removal efficiency of suspended solids and turbidity presented in raw water and optimizing by the response surface methodology (RSM). The most important variables studied in this research included electrode spacing, the applied voltage, and the operating time of the electrocoagulation process. The samples

Total dissolved solids are at the top of the parameters list of water quality that requires investigations for planning and management, especially for irrigation and drinking purposes. If the quality of water is sufficiently predictable, then appropriate management is possible. In the current study, Multiple Linear Regression (MLR) and Artificial Neural Network (ANN) models were used as indicators of water quality and for the prediction of Total Dissolved Solids (TDS) along the Tigris River, in Baghdad city. To build these models five water parameters were selected from the intakes of four water treatment plants on the Tigris River, for the period between 2013 and 2017. The selected water parameters were Total Dissolved Solids (TDS

In this study the most stable isobar for some isobaric families (light and  intermediate ) nuclei with mass number (A) equals to (15-30) & (101- 115) have been determined. This determination of stable nuclide can help to determine the suitable nuclide, which can be used in different fields.

Most stable isobar can be determined by two means. First: plot mass parabolas (plotting the binding energy (B.E) as a function of the atomic number (Z)) for these isobaric families, in this method most stable isobars represent the lowest point in mass parabola (the nuclide with the highest value of binding energy).

Second: calculated the atomic number for most stable isobar (Z_A) value.

Our results show that

New series of metal ions complexes have been prepared from the new ligand [4-Amino-N-(5-methyl-isaxazol-3-yl)-benzenesulfonamide] derived from Sulfamethoxazole and 3-aminophenol. Accordingly, mono-nuclear Mn(II), Fe(III), Co (II), and Rh(III) complexes were prepared by the reaction of previous ligand with MnCl₂.4H₂O, CoCl₂.6H₂O, FeCl₃.6H₂O and RhCl₃H₂O, respectively. The compounds have been characterized by Fourier-transform infrared (FTIR), ultraviolet–visible (UV–vis), mass,  ¹H-, and ¹³C-nuclear magnetic resonance (NMR) spectra and thermo gravimetric analysis (TGA& DSC) curve, Bohr magnetic (B.M.), elemental microanal

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

      This work addressed the assignment problem (AP) based on fuzzy costs, where the objective, in this study, is to minimize the cost. A triangular, or trapezoidal, fuzzy numbers were assigned for each fuzzy cost. In addition, the assignment models were applied on linguistic variables which were initially converted to quantitative fuzzy data by using the Yager’sorankingi method. The paper results have showed that the quantitative date have a considerable effect when considered in fuzzy-mathematic models.