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

Polymers have the ability to extract water after they have been added to the mortar or concrete mixture. They provide the absorbed water during hydration functioning as internal water source. Absorption polymers can absorb up to hundred times of their own weight of pure water.This research deals with the use of water absorption polymer balls in concrete and study the volumetric change of these mixes and compared the results with reference mix (without polymers). Samples were cured both in air and in water for the mixes to compare results which show that samples in air behave for expansion while sample in water acted for shrinkage.

Cutaneous leishmaniasis is one of endemic diseases in Iraq. It is considered as widely health problem and is an uncontrolled disease. The aim of the study is to identify of Leishmania species that cause skin lesions among patients in Thi-Qar Province, South of Iraq, also to detect some virulence factors of L. tropica. This study includes three local locations, Al-Hussein Teaching, Suq Al-Shyokh General and Al-Shatrah General Hospitals in Province for the period from the beginning of December 2018 to the end of September 2019. The samples were collected from 80 patients suffering from cutaneous leishmaniasis, both genders, different ages, various residence places and single and multiple lesions. Nested-PCR technique was

Cyber-attacks keep growing. Because of that, we need stronger ways to protect pictures. This paper talks about DGEN, a Dynamic Generative Encryption Network. It mixes Generative Adversarial Networks with a key system that can change with context. The method may potentially mean it can adjust itself when new threats appear, instead of a fixed lock like AES. It tries to block brute‑force, statistical tricks, or quantum attacks. The design adds randomness, uses learning, and makes keys that depend on each image. That should give very good security, some flexibility, and keep compute cost low. Tests still ran on several public image sets. Results show DGEN beats AES, chaos tricks, and other GAN ideas. Entropy reached 7.99 bits per pix

In the present paper, an eco-epidemiological model consisting of diseased prey consumed by a predator with fear cost, and hunting cooperation property is formulated and studied. It is assumed that the predator doesn’t distinguish between the healthy prey and sick prey and hence it consumed both. The solution’s properties such as existence, uniqueness, positivity, and bounded are discussed. The existence and stability conditions of all possible equilibrium points are studied. The persistence requirements of the proposed system are established. The bifurcation analysis near the non-hyperbolic equilibrium points is investigated. Numerically, some simulations are carried out to validate the main findings and obtain the critical values of th

In this study, multi-objective optimization of nanofluid aluminum oxide in a mixture of water and ethylene glycol (40:60) is studied. In order to reduce viscosity and increase thermal conductivity of nanofluids, NSGA-II algorithm is used to alter the temperature and volume fraction of nanoparticles. Neural network modeling of experimental data is used to obtain the values of viscosity and thermal conductivity on temperature and volume fraction of nanoparticles. In order to evaluate the optimization objective functions, neural network optimization is connected to NSGA-II algorithm and at any time assessment of the fitness function, the neural network model is called. Finally, Pareto Front and the corresponding optimum points are provided and