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

We investigated at the optical properties, structural makeup, and morphology of thin films of cadmium telluride (CdTe) with a thickness of 150 nm produced by thermal evaporation over glass. The X-ray diffraction study showed that the films had a crystalline composition, a cubic structure, and a preference for grain formation along the (111) crystallographic direction. The outcomes of the inquiry were used to determine these traits. With the use of thin films of CdTe that were doped with Ag at a concentration of 0.5%, the crystallization orientations of pure CdTe (23.58, 39.02, and 46.22) and CdTe:Ag were both determined by X-ray diffraction. orientations (23.72, 39.21, 46.40) For samples that were pure and those that were doped with

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

A substantial portion of today’s multimedia data exists in the form of unstructured text. However, the unstructured nature of text poses a significant task in meeting users’ information requirements. Text classification (TC) has been extensively employed in text mining to facilitate multimedia data processing. However, accurately categorizing texts becomes challenging due to the increasing presence of non-informative features within the corpus. Several reviews on TC, encompassing various feature selection (FS) approaches to eliminate non-informative features, have been previously published. However, these reviews do not adequately cover the recently explored approaches to TC problem-solving utilizing FS, such as optimization techniques.

     Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a

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