Background: MRSA (methicillin-resistant Staphylococcus aureus) is a global health problem. Many people are looking for new ways to combat MRSA, for example by using bacteriophages (phages). It has been extremely challenging to isolate a sufficient quantity of lytic anti-MRSA phages. Therefore, new techniques for separating, refining, and reworking anti-MRSA phages were sought in this study.

Methods: Of 437 S. aureus isolates, nine clinical MRSA isolates were obtained from three hospitals in Baghdad, Iraq and two ATCC MRSA strains were used to separate wild anti-MRS

This paper describes a new finishing process using magnetic abrasives were newly made to finish effectively brass plate that is very difficult to be polished by the conventional machining processes. Taguchi experimental design method was adopted for evaluating the effect of the process parameters on the improvement of the surface roughness and hardness by the magnetic abrasive polishing. The process parameters are: the applied current to the inductor, the working gap between the workpiece and the inductor, the rotational speed and the volume of powder. The analysis of variance(ANOVA) was analyzed using statistical software to identify the optimal conditions for better surface roughness and hardness. Regressions models based on statistical m

This paper presents an improved technique on Ant Colony Optimization (ACO) algorithm. The procedure is applied on Single Machine with Infinite Bus (SMIB) system with power system stabilizer (PSS) at three different loading regimes. The simulations are made by using MATLAB software. The results show that by using Improved Ant Colony Optimization (IACO) the system will give better performance with less number of iterations as it compared with a previous modification on ACO. In addition, the probability of selecting the arc depends on the best ant performance and the evaporation rate.

The class of quasi semi -convex functions and pseudo semi -convex functions are presented in this paper by combining the class of -convex functions with the class of quasi semi -convex functions and pseudo semi -convex functions, respectively. Various non-trivial examples are introduced to illustrate the new functions and show their relationships with -convex functions recently introduced in the literature. Different general properties and characteristics of this class of functions are established. In addition, some optimality properties of generalized non-linear optimization problems are discussed. In this generalized optimization problems, we used, as the objective function, quasi semi -convex (respectively, strictly quasi semi -convex

        In this work, analytical study for simulating a Fabry-Perot bistable etalon (F-P cavity) filled with a dispersive optimized nonlinear optical material (Kerr type) such as semiconductors Indium Antimonide (InSb). Because of a trade off between the etalon finesse values and driving terms, an optimization procedures have been done on the InSb etalon/CO laser parameters, using critical switching irradiance (I_c) via simulation systems of optimization procedures of optical cavity. in order to achieve the  minimum switching power and faster switching time, the optimization parameters of the finesse values and driving terms on optical bistability and switching dynamics must be studied.

The linear segment with parabolic blend (LSPB) trajectory deviates from the specified waypoints. It is restricted to that the acceleration must be sufficiently high. In this work, it is proposed to engage modified LSPB trajectory with particle swarm optimization (PSO) so as to create through points on the trajectory. The assumption of normal LSPB method that parabolic part is centered in time around waypoints is replaced by proposed coefficients for calculating the time duration of the linear part. These coefficients are functions of velocities between through points. The velocities are obtained by PSO so as to force the LSPB trajectory passing exactly through the specified path points. Also, relations for velocity correction and exact v

This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori