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 local improvement operator to effectively discover community structure in the modular complex networks when employing the modularity density metric as a single-objective function. The framework of the proposed algorithm consists of three main steps: an initialization strategy, a movement strategy based on perturbation genetic operators, and an improvement operator. The key idea behind the improvement operator is to determine and reassign the complex network nodes that are located in the wrong communities if the majority of their topological links do not belong to their current communities, making it appear that these nodes belong to another community. The performance of the proposed algorithm has been tested and evaluated when applied to publicly-available modular complex networks generated using a flexible and simple benchmark generator. The experimental results showed the effectiveness of the suggested method in discovering community structure over modular networks of different complexities and sizes.
This researchpaper includes the incorporation of Alliin at various energy levels and angles
With Metformin using Gaussian 09 and Gaussian view 06. Two computers were used in this work. Samples were generated to draw, integrate, simulate and measure the value of the potential energy surface by means of which the lowest energy value was (-1227.408au). The best correlation compound was achieved between Alliin and Metformin through the low energy values where the best place for metformin to b
... Show MoreThe chlorine concentration variation in Baghdad water networks was studied. The
chlorine data were collected from Mayoralty of Baghdad and Ministry of Environment
(MOE) for the networks for both sides of the city Karkh and Rasafa for (2008-2009). The
study of these data indicates that there are no systematic testing program .Classified GIS
maps showed that the areas far from the treatment plants have almost always low
chlorine concentration .This indicates that the problem of the low chlorine concentration
in the far areas is due to cracks of pipe along the conveyance path ,as expected. The area's
most frequently have low concentration are Al-sadir,Al-Kadhimya, and Al-Amiria . It
was found also that the chlorine c
Permeability determination in Carbonate reservoir is a complex problem, due to their capability to be tight and heterogeneous, also core samples are usually only available for few wells therefore predicting permeability with low cost and reliable accuracy is an important issue, for this reason permeability predictive models become very desirable.
This paper will try to develop the permeability predictive model for one of Iraqi carbonate reservoir from core and well log data using the principle of Hydraulic Flow Units (HFUs). HFU is a function of Flow Zone Indicator (FZI) which is a good parameter to determine (HFUs).
Histogram analysis, probability analysis and Log-Log plot of Reservoir Qua
... Show MoreIn this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c
... Show MoreThe aim of this research is to compare traditional and modern methods to obtain the optimal solution using dynamic programming and intelligent algorithms to solve the problems of project management.
It shows the possible ways in which these problems can be addressed, drawing on a schedule of interrelated and sequential activities And clarifies the relationships between the activities to determine the beginning and end of each activity and determine the duration and cost of the total project and estimate the times used by each activity and determine the objectives sought by the project through planning, implementation and monitoring to maintain the budget assessed
... Show MoreAs s widely use of exchanging private information in various communication applications, the issue to secure it became top urgent. In this research, a new approach to encrypt text message based on genetic algorithm operators has been proposed. The proposed approach follows a new algorithm of generating 8 bit chromosome to encrypt plain text after selecting randomly crossover point. The resulted child code is flipped by one bit using mutation operation. Two simulations are conducted to evaluate the performance of the proposed approach including execution time of encryption/decryption and throughput computations. Simulations results prove the robustness of the proposed approach to produce better performance for all evaluation metrics with res
... Show More