A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optimization problem where a modularity-based ( ) and normalized mutual information ( ) metrics are formulated to describe the problem. An evolutionary algorithm is then expressed in the light of its characteristic components to tackle the problem. The presentation will highlight the possible alternative that can be adopted in this study for individual representation, fitness evaluations, and crossover and mutation operators. The results point out that adopting as a fitness function carries out more correct solutions than adopting the modularity function . Moreover, the strength of mutation has a background role. When coupled with non elite selection, increasing mutation probability could results in better solutions. However, when elitism is used, increasing mutation probability could bewilder the behavior of EA.
A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optimization problem where a modularity-based ( ) and normalized mutual information ( ) metrics are formulated to describe the problem. An evolutionary algorithm is then expressed in the light of its characteristic components to tackle the problem. The presentation will highlight the possible alternative that can be adopted in this study for individual representation, fitness evaluations, and crossover and mutation operators. The results point out that adopting as a fitness function carries out more correct solutions than adopting the modularity function . Moreover, the strength of mutation has a background role. When coupled with non elite selection, increasing mutation probability could results in better solutions. However, when elitism is used, increasing mutation probability could bewilder the behavior of EA.
The aim of this article is to study the dynamical behavior of an eco-epidemiological model. A prey-predator model comprising infectious disease in prey species and stage structure in predator species is suggested and studied. Presumed that the prey species growing logistically in the absence of predator and the ferocity process happened by Lotka-Volterra functional response. The existence, uniqueness, and boundedness of the solution of the model are investigated. The stability constraints of all equilibrium points are determined. The constraints of persistence of the model are established. The local bifurcation near every equilibrium point is analyzed. The global dynamics of the model are investigated numerically and confronted with the obt
... Show More
In this paper the behavior of the quality of the gradient that implemented on an image as a function of noise error is presented. The cross correlation coefficient (ccc) between the derivative of the original image before and after introducing noise error shows dramatic decline compared with the corresponding images before taking derivatives. Mathematical equations have been constructed to control the relation between (ccc) and the noise parameter.
In this study, a chaotic method is proposed that generates S-boxes similar to AES S-boxes with the help of a private key belonging to
In this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the produ
... Show More
The study aims to introduce the Islamic sites available on the Internet and determine the criteria that contribute to evaluating these sites to indicate their value, topics, and services, while evaluating a simple random sample of the general Islamic sites, which number (35) sites. The results were presented in (8) tables. The study concluded To a set of conclusions, including: (465) “Islamic” websites were seized during the research period, and they are constantly increasing. They were classified according to the name of the website (domain name) com, org, net, edu, and also according to topics such as general Islamic websites and websites of holy places. Mosques, sites of sheikhs, etc. Among the best general Islamic websites are: Isla
... Show MoreThe Diffie-Hellman is a key exchange protocol to provide a way to transfer shared secret keys between two parties, although those parties might never have communicated together. This paper suggested a new way to transfer keys through public or non-secure channels depending on the sent video files over the channel and then extract keys. The proposed method of key generation depends on the video file content by using the entropy value of the video frames. The proposed system solves the weaknesses in the Diffie-Hellman key exchange algorithm, which is MIMA (Man-in-the-Middle attack) and DLA( Discrete logarithm attack). When the method used high definition videos with a vast amount of data, the keys generated with a large number up to 5
... Show More
In this paper,a prey-predator model with infectious disease in predator population
is proposed and studied. Nonlinear incidence rate is used to describe the transition of
disease. The existence, uniqueness and boundedness of the solution are discussed.
The existences and the stability analysis of all possible equilibrium points are
studied. Numerical simulation is carried out to investigate the global dynamical
behavior of the system.
The research objective are analyze financial leverage advantage through analyze and discuss financial leverage cost, and achieve tax advantage. study include two firms ,oil firm and industrial companies firm with limited liability.The inductive method is used for the applied part in analyzing the financial data of the companies considered in 2011-2015.The result of the study shows that the financial leverage achieve present value of the costs is Negative . The study concluded that the most important conclusions of the tax advantage of leverage is higher costs as well as achieving a low tax shield ,This study found out the results that interest payments related to pre-tax all of the loan amount and the percentage of the interest rate on b
... Show More
(2)
(1)