This paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.

The goal of current research to know the according of scientific values in the curriculum of chemistry sixth - grade science To achieve this goal wasa to build aalistaofa scientifica values toa be included in the curriculum of chemistry sixth - grade science after seeing a group of literature and previous studies, the list presented to a group of arbitrators and specialists in educational and psychological sciences and methods of teaching science, and curricula and teaching methods , Arbitrators and specialists have expressed their views and comments on the tool, and that the list was formed in final form (9) values Head of scientific includes ( 35) sub - value, then the researcher analyzed the chemistry curriculum for sixth grade Scient

The aim of this paper is to design fast neural networks to approximate periodic functions, that is, design a fully connected networks contains links between all nodes in adjacent layers which can speed up the approximation times, reduce approximation failures, and increase possibility of obtaining the globally optimal approximation. We training suggested network by Levenberg-Marquardt training algorithm then speeding suggested networks by choosing most activation function (transfer function) which having a very fast convergence rate for reasonable size networks.             In all algorithms, the gradient of the performance function (energy function) is used to determine how to

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over

Been Antkhav three isolates of soil classified as follows: Bacillus G3 consists of spores, G12, G27 led Pal NTG treatment to kill part of the cells of the three isolates varying degrees treatment also led to mutations urged resistance to streptomycin and rifampicin and double mutations

HM Al-Dabbas, RA Azeez, AE Ali, Iraqi Journal of Science, 2023

G-system composed of three isolates G3 ( Bacillus),G12 ( Arthrobacter )and G27 ( Brevibacterium) was used to detect the mutagenicity of the anticancer drug, cyclophosphamide (CP) under conditions similar to that used for standard mutagen, Nitrosoguanidine (NTG). The CP effected the survival fraction of isolates after treatment for 15 mins using gradual increasing concentrations, but at less extent comparing to NTG. The mutagenic effect of CP was at higher level than that of NTG when using streptomycin as a genetic marker, but the situation was reversed when using rifampicin resistant as a report marker. The latter effect appeared upon recording the mutagen efficiency (ie., number of induced mutants/microgram of mutagen). Measuring the R