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

    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 to d

Achieving energy-efficient Wireless Sensor Network (WSN) that monitors all targets at
all times is an essential challenge facing many large-scale surveillance applications.Singleobjective
set cover problem (SCP) is a well-known NP-hard optimization problem used to
set a minimum set of active sensors that efficiently cover all the targeted area. Realizing
that designing energy-efficient WSN and providing reliable coverage are in conflict with
each other, a multi-objective optimization tool is a strong choice for providing a set of
approximate Pareto optimal solutions (i.e., Pareto Front) that come up with tradeoff
between these two objectives. Thus, in the context of WSNs design problem, our main
contribution is to

     The coronavirus is a family of viruses that cause different dangerous diseases that lead to death. Two types of this virus have been previously found: SARS-CoV, which causes a severe respiratory syndrome, and MERS-CoV, which causes a respiratory syndrome in the Middle East. The latest coronavirus, originated in the Chinese city of Wuhan, is known as the COVID-19 pandemic. It is a new kind of coronavirus that can harm people and was first discovered in Dec. 2019. According to the statistics of the World Health Organization (WHO), the number of people infected with this serious disease has reached more than seven million people from all over the world. In Iraq, the number of people infected has reached more than tw

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In

يسعى المجتمع من خلال الوحدات الإقتصادية إلى الوصول إلى تحقيق أفضل الإنجازات التي لا تتمثل بالسلع والخدمات حسب وإنما بما يتحقق من مردود لكافة الاطراف المعنية بالوحدات الإقتصادية على ان لايتم ذلك على حساب قيم المجتمع وأخلاقياته وآدابه العامة. وعليه تصبح الوحدات الإقتصادية مسرحاً لصراعات قوى متعددة كل منها له قيمه الأخلاقية سواء كان فرداً أومجموعة افراد أو وحدة إقتصادية أو أي جهة أُخرى، وبحكم مسؤولياته

     Let n be a positive integer and  denotes the number of overpartition triples. In this note, we prove two identities modulo 16 and 32 for . We provide a new method to reprove a result of Lin Wang for completely determining and  modulo 16. Also, we find and prove an infinite family of congruences modulo 32 for . The new method relies on expanding the fourth power of the overpartition infinite product together with the help of Gauss' identity.