The 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.

The influence of an aortic aneurysm on blood flow waveforms is well established, but how to exploit this link for diagnostic purposes still remains challenging. This work uses a combination of experimental and computational modelling to study how aneurysms of various size affect the waveforms. Experimental studies are carried out on fusiform-type aneurysm models, and a comparison of results with those from a one-dimensional fluid–structure interaction model shows close agreement. Further mathematical analysis of these results allows the definition of several indicators that characterize the impact of an aneurysm on waveforms. These indicators are then further studied in a computational model of a systemic blood flow network. This demonstr

Around fifty isolates of Salmonella enterica serovar Typhi were isolated from blood specimens of patients referring to several hospitals in Kirkuk province, Iraq. The results revealed that all isolates developed resistance to trimethoprim-sulfamethoxazole and chloramphenicol. However, neither sul2 nor tem genes were detected. Moreover, only ten isolates were positive for catP. Our data suggested participation of other genes or mechanisms allow these multidrug isolates to resist the antibiotics in question.

The increasing availability of computing power in the past two decades has been use to develop new techniques for optimizing solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled development of new generation of intelligent computing techniques, such as our interest algorithm, this paper presents one of new class of stochastic search algorithm (known as Canonical Genetic' Algorithm ‘CGA’) for optimizing the maximum likelihood function strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of are compared with those of moment method. Based on MSE value obtained from bot

Let G be a finite group, the result is the involution graph of G, which is an undirected simple graph denoted by the group G as the vertex set and x, y ∈ G adjacent if xy and (xy)2 = 1. In this article, we investigate certain properties of G, the Leech lattice groups HS and McL. The study involves calculating the diameter, the radius, and the girth of ΓGRI.

Important points were concluded from this analysis related with the presence of the same variable CEs within multiple isolates with different time points being under the selection and the location of SNPs within the conserved functional pattern of CEs. In the 40 isolates, 9 out of 39 variable CEs conducted with multiple isolates

I have studied the relationship between blood groups in humans and disease Cutaneous injury for the first time in Iraq study showed the presence of a significant statistical relationship between them leather Bmsoy in hospitals in Baghdad and its suburbs

In the present paper, we have introduced some new definitions On D- compact topological group and D-L. compact topological group for the compactification in topological spaces and groups, we obtain some results related to D- compact topological group and D-L. compact topological group.