Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

This presented study is to make comparison of cross sections to produce 71As, 72As, 73As and 74As via different reactions with particle incident energy up to 60 MeV of alpha 100 MeV of proton as a part of systematic studies on particle-induced activations on enriched Ge, Ga, Rb and Nb targets and neutron capture. Theoretical calculation of production yield, and suggestion of optimum reaction to produce 71As, 72As, 73As and 74As, based on the main published and approved experimental results of excitation functions were calculated.

Background: Laparoscopic cholecystectomy has many difficulties which include port Insertion, Dissectionof the Calot’s Triangle , Grasping of the Gallbladder , Wall thickness, Adhesion and extraction of theGallbladder. Aim of the Study: To predict how difficult cholecystectomy will be from assessing the patientpreoperatively which, in turn, help in decreasing the risks on the patients and preventing post-operativecomplications. Patients and Methods: A prospective study conducted in the department of General Surgeryat Al-Ramadi Teaching Hospital for the period of nine months from 15th of May 2018 till the 15th of February2019. It included 60 patients, all of them were undergone laparoscopic cholecystectomy for Gallstone. Patientswit

Background: Toxoplasmosis is a very common infection caused by the obligate intracellular protozoan parasite. This parasite is called Toxoplasma gondii widely distributed around the world . Toxoplasma gondii can be vertically transmitted to the fetus during pregnancy and may cause wide range of clinical manifestations in the offspring.

Objective: To determine seroprevalence Immunoglobulin G (IgG) and Immunoglobulin M  (IgM ) to toxoplasma gondii among pregnant women and to identify the risk factors.

Type of the study: A cross-sectional study.

Methods: A total of 110 blood samples of pregnant women were collected from

Background: Prematurity and its complications are the major causes of neonatal and infant morbidity and mortality. Although the cause of preterm labor is often unknown, numerous etiological risk factors may be implicated. To identify the risk factors that lead to prematurity and assess the neonatal outcomes that preterm neonates may develop. Methods: This case-control study was conducted at AL-Elwiya Pediatric Teaching Hospital, Baghdad, Iraq, from the 1st of June to the 31st of December 2019. A non-randomized sample of 700 neonates admitted to the neonatal care unit was included in this study and divided into two groups of preterm full-term neonates as the experimental and control groups, respectively (n=350 each). The same questionnaire w

The consensus algorithm is the core mechanism of blockchain and is used to ensure data consistency among blockchain nodes. The PBFT consensus algorithm is widely used in alliance chains because it is resistant to Byzantine errors. However, the present PBFT (Practical Byzantine Fault Tolerance) still has issues with master node selection that is random and complicated communication. The IBFT consensus technique, which is enhanced, is proposed in this study and is based on node trust value and BLS (Boneh-Lynn-Shacham) aggregate signature. In IBFT, multi-level indicators are used to calculate the trust value of each node, and some nodes are selected to take part in network consensus as a result of this calculation. The master node is chosen

Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.