XXXX

In this paper, an algorithm is suggested to train a single layer feedforward neural network to function as a heteroassociative memory. This algorithm enhances the ability of the memory to recall the stored patterns when partially described noisy inputs patterns are presented. The algorithm relies on adapting the standard delta rule by introducing new terms, first order term and second order term to it. Results show that the heteroassociative neural network trained with this algorithm perfectly recalls the desired stored pattern when 1.6% and 3.2% special partially described noisy inputs patterns are presented.

Background: Opportunistic viral infections make an important threat to renal transplantation recipients (RTRs), and with the use of more intense newly-developed immunosuppressive drugs; the risk of renal allograft loss due to reactivation of these viruses has increased considerably. At the top priority of these viruses lie BK polyomavirus (BKV) and human cytomegalovirus (CMV). Reactivation of these viruses in these chronically immunosuppressed RTRs can lead to renal impairment and subsequently allograft loss, unless early detected and properly treated. Objectives: The study aimed to detect and quantify plasma viral load of BKV and CMV in RTRs using quantitative real time PCR (qRT-PCR), in order to study the prevalence of these two viruses i

This study was conducted to assess the hydrocarbon degradation abilities of Sphingomonas paucimobilis, Pentoae species, Staphylococcus aureus, and Enterobacter cloacae, which isolated from diesel contaminated soil samples. Single strains and mixed bacterial consortia have been investigated their ability to degrade 1.0 % (v/v) of diesel oil in Bushnell- Haas medium as sole.carbon.and.energy.source. At temperature 30^∘C, the individual.bacterial.isolates exhibited low growth and low degradation.than did the.mixed. bacterial.culture. After 28 days.of incubation the.combination.of four isolates degraded.an upper limit.of diesel  88.4%. This was. continued.by 85.1% by S. paucimobilis, 84 % by Pentoae sp., 79% by S.aureus, and

Leap Motion Controller (LMC) is a gesture sensor consists of three infrared light emitters and two infrared stereo cameras as tracking sensors. LMC translates hand movements into graphical data that are used in a variety of applications such as virtual/augmented reality and object movements control. In this work, we intend to control the movements of a prosthetic hand via (LMC) in which fingers are flexed or extended in response to hand movements. This will be carried out by passing in the data from the Leap Motion to a processing unit that processes the raw data by an open-source package (Processing i3) in order to control five servo motors using a micro-controller board. In addition, haptic setup is proposed using force sensors (F

Most of the medical datasets suffer from missing data, due to the expense of some tests or human faults while recording these tests. This issue affects the performance of the machine learning models because the values of some features will be missing. Therefore, there is a need for a specific type of methods for imputing these missing data. In this research, the salp swarm algorithm (SSA) is used for generating and imputing the missing values in the pain in my ass (also known Pima) Indian diabetes disease (PIDD) dataset, the proposed algorithm is called (ISSA). The obtained results showed that the classification performance of three different classifiers which are support vector machine (SVM), K-nearest neighbour (KNN), and Naïve B

Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security.   We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly.   We make an effort to prove