Objective: The study the association of procalcitonin (PCT) and c-reactive protein (CRP) levels in COVID-19 patients and it's role as a guide in progress and management of those patients. Methodology: This cross-sectional study analyzed 200 CIOVID-19 patients in a single privet center in Baghdad, Iraq from January 1, 2021 to January 1, 2022. Demographic data like age, sex, and clinical symptoms were recorded. High sensitivity CRP and PCT in the serum were measured via dry fluorescence immunoassay (Lansionbio-China). Results: Out of 200 patients, 50 had moderate Covid and 150 had severe disease. Mean serum PCT levels was 0.039±0.05 ng/mL in the moderate group (range 0.011-0.067) and 0.43±0.21 ng/mL in the severe group (range 0.21

This study tries to clear the correlation and association between asthma, obesity and leptin levels. Also it will work to indicate the main risk factors which play role in the elevation of leptin level within asthmatic patients.  This is a case control study conducted on (38) asthmatic patients and (20) healthy control who were closely similar by age, gender and BMI. The main statistical tests used were student t test, linear regression test and correlation test. Significance was set at P < 0.05. Sampling method used for this study was convenience sampling method.  The main results of this study show a significant association and positive correlation between age (old age  â‰¥ 40 ye

This research aims to study the radiation concentration distribution of the old District of Najaf (Iraq), where 15 samples were taken from featured sites in the District, which represents archaeological, religious, and heritage sites. Track detector CR-39 was used to calculate the concentration of three different soil weights for each sample site after being exposed for a month. Geographical information systems (GIS) were used to distribute the radioactive concentration on the sites of the samples, where two interpolation methods, namely the inverse distance weight method (IDW) and the triangle irregular network method (NIT), to study the distribution of the radioactivity concentration. The study showed that the western part of the district

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

One of the most difficult issues in the history of communication technology is the transmission of secure images. On the internet, photos are used and shared by millions of individuals for both private and business reasons. Utilizing encryption methods to change the original image into an unintelligible or scrambled version is one way to achieve safe image transfer over the network. Cryptographic approaches based on chaotic logistic theory provide several new and promising options for developing secure Image encryption methods. The main aim of this paper is to build a secure system for encrypting gray and color images. The proposed system consists of two stages, the first stage is the encryption process, in which the keys are genera

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