Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over

     Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a

    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

Background: Chronic periodontitis defined as “an infectious inflammatory disease within supporting tissues of the teeth, progressive attachment loss and bone loss". Aggressive periodontitis is rare which in most cases manifest themselves clinically during youth. It characterized by rapid rate of disease progression .Pro-inflammatory chemokines organized inflammatory responses. Granulocyte chemotactic protein 2 is involved in neutrophil gathering and movement. The purpose of the study is to detect serum of Granulocyte Chemotactic Protein 2 and correlate to periodontal condition in patients with chronic periodontitis, Aggressive periodontitis and Healthy Control subjects and measurement the count of neutrophils for the studied groups. S

This study was conducted in the specialized center of endocrinology and diabetic (AlKindy hospital from June 2004 to April 2005). Sera of 80 women (include 40 diagnosed Hyperprolactinemia (HPro) and 40 healthy women as control) were used to estimate some biochemical parameters which include prolactin (PRL),total fucose (TF), total protein (TP) and protein bound fucose (PBF), and protein bound hexose (PBHex),  also TP TF , TP PBF and TP PBHex   ratios. A significant elevation in TP and  PBHex, in sera of HPro patients compared to control was found while PBHex/TP ratio showed a slight non significant increase in sera of patients compared to control. On the other hand a significant decrease in TF, TF/TP and PBF/TP in ser