In this paper, we characterize the percolation condition for a continuum secondary cognitive radio network under the SINR model. We show that the well-established condition for continuum percolation does not hold true in the SINR regime. Thus, we find the condition under which a cognitive radio network percolates. We argue that due to the SINR requirements of the secondaries along with the interference tolerance of the primaries, not all the deployed secondary nodes necessarily contribute towards the percolation process- even though they might participate in the communication process. We model the invisibility of such nodes using the concept of Poisson thinning, both in the presence and absence of primaries. Invisibility occurs due to nodes

The development of wireless sensor networks (WSNs) in the underwater environment leads to underwater WSN (UWSN). It has severe impact over the research field due to its extensive and real-time applications. However effective execution of underwater WSNs undergoes several problems. The main concern in the UWSN is sensor nodes’ energy depletion issue. Energy saving and maintaining quality of service (QoS) becomes highly essential for UWASN because of necessity of QoS application and confined sensor nodes (SNs). To overcome this problem, numerous prevailing methods like adaptive data forwarding techniques, QoS-based congestion control approaches, and various methods have been devised with maximum throughput and minimum network lifesp

This research presents a model for surveying networks configuration which is designed and called a Computerized Integrated System for Triangulation Network Modeling (CISTNM). It focuses on the strength of figure as a concept then on estimating the relative error (RE) for the computed side (base line) triangulation element. The CISTNM can compute the maximum elevations of the highest
obstacles of the line of sight, the observational signal tower height, the contribution of each triangulation station with their intervisibility test and analysis. The model is characterized by the flexibility to select either a single figure or a combined figures network option. Each option includes three other implicit options such as: triangles, quadri

In cognitive radio networks, there are two important probabilities; the first probability is important to primary users called probability of detection as it indicates their protection level from secondary users, and the second probability is important to the secondary users called probability of false alarm which is used for determining their using of unoccupied channel. Cooperation sensing can improve the probabilities of detection and false alarm. A new approach of determine optimal value for these probabilities, is supposed and considered to face multi secondary users through discovering an optimal threshold value for each unique detection curve then jointly find the optimal thresholds. To get the aggregated throughput over transmission

Potential pattern of foodborne bacteriophages against multidrug-resistant pathogens was a promising hygienic strategy module. Post-antibiotics era becomes evident due to emerging of dramatic episodes of infectious foci harboring biofilm and multidrug-resistant pathogens transferred mainly throughout food chain. Vancomycin-resistant enterococci (VRE) were struggling among these new infectious emergencies. Phenotypic epigenetic transit tolerant drift cascaded by genetic resistant shift behaviors of recalcitrant VRE forbidden clones recovered from mastitis cases in Cows from territories of Abu-Ghraib, Al- Fudhaliyah and Al-Sadrya in Baghdad ecosystem were combated by redirected lytic bacteriophages cocktails recovered from the same raw-milk ec

This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)

In this work, the calculation of matter density distributions, elastic charge form factors and size radii for halo 11Be, 19C and 11Li nuclei are calculated. Each nuclide under study are divided into two parts; one for core part and the second for halo part. The core part are studied using harmonic-oscillator radial wave functions, while the halo part are studied using the radial wave functions of Woods-Saxon potential. A very good agreement are obtained with experimental data for matter density distributions and available size radii. Besides, the quadrupole moment for 11Li are generated.

In this work, the calculation of matter density distributions, elastic charge form factors and size radii for halo 11Be, 19C and 11Li nuclei are calculated. Each nuclide under study are divided into two parts; one for core part and the second for halo part. The core part are studied using harmonic-oscillator radial wave functions, while the halo part are studied using the radial wave functions of Woods-Saxon potential. A very good agreement are obtained with experimental data for matter density distributions and available size radii. Besides, the quadrupole moment for 11Li are generated.

    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