Abortion is categorized as the termination of conception caused by the failure or removal of the embryo from the uterus before the conclusion of pregnancy. Microorganisms and genetic factors are two of the many factors associated with abortion. Cytomegalovirus is a widespread congenital virus infection pathogen that affects a wide variety of people. The prothrombin gene is one of the essential causes that trigger blood clotting and the function of abortion women, therefore the aim of the study is to detect and associate Cytomegalovirus and prothrombin gene mutation (Gene ID: 14061 in NCBI) with abortion through genetic and immunological methods. Five ml of whole blood was collected from an intravenous puncture and divided into two tubes,

PvcABCD are cluster of genes found in Pseudomonas aeruginosa. The research was designed to examine the relationship between the pvc genes expression and cupB gene, which plays a crucial role in the development of biofilm, and rhlR, which regulates the expression of biofilm-related genes, and to investigate whether the pvc genes form one or two operons. The aims were achieved by employing qRT-PCR technique to measure the gene expression of genes of interest. It was found that out of 25 clinical isolates, 21 isolates were qualified as P.aeruginosa. Amongst, 18(85.7%) were evaluated as biofilm producers, 10 (47.6%), 5 (23.8%), and 3 (14.2%) were evaluated as strong, moderate and weak producers respectively, while, 3 (14.2%) were considered

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding

Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).