
The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.
Background: Rituximab is a chimeric IgG1 kappa immunoglobulin that has been genetically modified to incorporate human constant region sequences together with murine light- and heavy-chain variable region sequences. People use it to treat rheumatoid arthritis and certain malignancies. Objective: The study aimed to assess the potential association between the serum levels of Factor I, CD59, interleukins (IL)-6, and interferon-gamma (IFN)-γ and the response to Rituximab treatment in Iraqi rheumatoid arthritis patients. Methods: A cross-sectional study was conducted at the rheumatology center at Baghdad Teaching Hospital. Ninety adult patients who have been diagnosed with rheumatoid arthritis and are receiving Rituximab intravenous i
... Show MoreA total of 70 pregnant women with toxoplasmosis were studied to evaluate of some immunological aspects. The women were distributed into three groups: 37 women were IgG positive, 18 women were IgM positive and 15 women were IgG and IgM positive as well as 25 healthy women were considered as control group. Serum samples were collected and ELISA method was employed to assess levels of interleukins 4, 6, 10, Interferon gamma-induced protein 10 (IP-10), Granulocyte-macrophage colony-stimulating factor (GM-CSF) and Vascular endothelial growth factor (VEGF). As compared with control the levels of cytokines were significantly increased in serum of three pregnant women groups with toxoplasmosis and the highest increase was observed in the IgM positi
... Show MoreThis study was carried out to describe the gene expression of the micro RNA 122a gene with the development of diabetes in Iraq. The difference in gene expression between patients and healthy controls was properly considered. In this study, blood was isolated from 121 individuals divided into two groups as follows: 80 samples of diabetic patients and 41 samples from a healthy control. miRNA was isolated and transformed into cDNA, and the expression of mi122a was measured by qRT-PCR. The researchers looked at the relationship between age and gender and the occurrence of diabetes, as well as how they compared to controls. When comparing the mean gene expression level (Ct) of patient groups to the corresponding Ct means in the control group, th
... Show MoreBackground. Material tribology has widely expanded in scope and depth and is extended from the mechanical field to the biomedical field. The present study aimed to characterize the nanocoating of highly pure (99.9%) niobium (Nb), tantalum (Ta), and vanadium (V) deposited on 316L stainless steel (SS) substrates which considered the most widely used alloys in the manufacturing of SS orthodontic components. To date, the coating of SS orthodontic archwires with Nb, Ta, and V using a plasma sputtering method has never been reported. Nanodeposition was performed using a DC plasma sputtering system with three different sputtering times (1, 2, and 3 hours). Results. Structural and elemental analyses were conducted on the deposited coating
... Show MoreA skip list data structure is really just a simulation of a binary search tree. Skip lists algorithm are simpler, faster and use less space. this data structure conceptually uses parallel sorted linked lists. Searching in a skip list is more difficult than searching in a regular sorted linked list. Because a skip list is a two dimensional data structure, it is implemented using a two dimensional network of nodes with four pointers. the implementation of the search, insert and delete operation taking a time of upto . The skip list could be modified to implement the order statistic operations of RANKand SEARCH BY RANK while maintaining the same expected time. Keywords:skip list , parallel linked list , randomized algorithm , rank.