Establishing coverage of the target sensing field and extending the network’s lifetime, together known as Coverage-lifetime is the key issue in wireless sensor networks (WSNs). Recent studies realize the important role of nature-inspired algorithms in handling coverage-lifetime problem with different optimization aspects. One of the main formulations is to define coverage-lifetime problem as a disjoint set covers problem. In this paper, we propose an evolutionary algorithm for solving coverage-lifetime problem as a disjoint set covers function. The main interest in this paper is to reflect both models of sensing: Boolean and probabilistic. Moreover, a heuristic operator is proposed as a local refinement operator to improve the quality

RA is a complex chronic disease, primarily affects the lining of the synovial joints and can cause progressive disability, premature death, and socioeconomic burdens. The clinical manifestations of symmetrical joint involvement include arthralgia, swelling, redness, and even limiting the range of motion. The pathogenesis is not known therefore the study included Rheumatoid arthritis (RA) is one of systemic inflammatory diseases that characterized by a progressive disabling course. The study included patients suffering from RA and as healthy controls. immunological and genetic factor were evaluated in each subject by using serum level of cytokine and genetic factor. The etiopathology of the disease is not well known for this reason the study

Background: periodontitis is a chronic inflammatory disease causing destruction of the tooth supporting structures, initiated by dental plaque and modified by environmental and genetic risk factors. Cyclooxygenase-2 (COX-2) enzyme is responsible for the production of prostaglandin E2, an important mediator in the chronic periodontitis (CP) pathogenesis. Polymorphisms in COX-2 gene have linked to CP in different populations. Aim: To study the association between Cyclooxygenase-2 single nucleotide polymorphism rs689466 (-1195A/G SNP) and chronic periodontitis in a sample of Iraqi population. Methods: One hundred Iraqi subjects divided into two groups: case group consisted of 70 CP patient (35 males and 35 females) with age range 30-55 year

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com

Directional Compact Geographic Forwarding (DCGF) routing protocol promises a minimal overhead generation by utilizing a smart antenna and Quality of Service (QoS) aware aggregation. However, DCGF was tested only in the attack-free scenario without involving the security elements. Therefore, an investigation was conducted to examine the routing protocol algorithm whether it is secure against attack-based networks in the presence of Denial-of-Service (DoS) attack. This analysis on DoS attack was carried out using a single optimal attacker, A1, to investigate the impact of DoS attack on DCGF in a communication link. The study showed that DCGF does not perform efficiently in terms of packet delivery ratio and energy consumption even on a sin