The increasing use of antiseptic compounds creates selective pressure cause emergence of antiseptic resistance among Staphylococcus aureus .Resistance mechanism of antiseptic is driven mainly by multi drug resistant (MDR) efflux protein.Sixty five isolates of S.aureuswere collected from different clinical sources and subjected to 11 antibiotics most of them are recognized by efflux systems as extruded substrates. Range of efflux activity was estimated using cartwheel method. Simultaneous discrimination of antiseptic coding genes (qacA/B, smr and norA)as well as nuc and mecA genes among multidrug resistantS.aureus(MRSA) isolates was preformed using multiplex PCR assay , 61 isolatesamong 65 were positive tonucand mecA genes, 58 of them were positive to norA, 14 of them were positive to qacA/B and only two were positive to smr. All isolates detected with qacA/B characterized by fluoroquinolones resistant and most of them show strong efflux activity at cartwheel assay, all of the 14 isolates positive qacA/B were sequenced to differentiate between variants depending on position 323 (aspartic in QacA, alanine in QacB), 3 of them harbored asparagines amino acid at position 323 and considered to be a new variants that reported for the first time.
This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f
... Show MoreThe convergence speed is the most important feature of Back-Propagation (BP) algorithm. A lot of improvements were proposed to this algorithm since its presentation, in order to speed up the convergence phase. In this paper, a new modified BP algorithm called Speeding up Back-Propagation Learning (SUBPL) algorithm is proposed and compared to the standard BP. Different data sets were implemented and experimented to verify the improvement in SUBPL.