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 time. Here, we adopt a new perspective towards detecting the evolution of community structures. The proposed method realizes the decomposition of the problem into three essential components; searching in: intra-community connections, inter-community connections, and community evolution. A multi-objective optimization problem is defined to account for the different intra and inter community structures. Further, we formulate the community evolution problem as a Hidden Markov Model in an attempt to dexterously track the most likely sequence of communities. Then the new model, called Hidden Markov Model-based Multi-Objective evolutionary algorithm for Dynamic Community Detection (HMM-MODCD), uses a multi-objective evolutionary algorithm and Viterbi algorithm for formulating objective functions and providing temporal smoothness over time for clustering dynamic networks. The performance of the proposed algorithm is evaluated on synthetic and real-world dynamic networks and compared against several state-of-the-art algorithms. The results clearly demonstrate the effectiveness of the proposed algorithm to outperform other algorithms.
After the defeat of the military terrorist organization "ISIS" and the fall of the throne of its alleged state in the Iraqi city of Nineveh, in Syrian Baghouz, and the end of its control over the land, the Syrian camps, especially "Al-Hol" camp, emerge as an incubator for the ideology of the terrorist organization "ISIS" and a vital base for its consolidation and dissemination, which includes (68,000- 73,000) people. During the years following the military defeat of (ISIS), the camp witnesses the spread of extremist ideas widely at the hands of its residents, including the families of the organizations dead's, extremist detainees, and those who deal with it, taking advantage of the deterioration of the environmental, se
... Show MoreBecause of its importance in the world, Middle East area is one of the competition areas between the major and great powers. Among those powers are Russia and United states of America. The competition between these two powers to control Syria is greatly clear since 2011. It is also one of the most important subject in the international politics. This importance comes from the importance of Russia and the United States of America besides importance of the Middle East. At the end of the cold war, United States of America maintained its role in the international system and became the only pole that dominated the international affairs while Russia tried to overcome the challenges inherited from the former Soviet Union, and it succeeded in th
... Show MoreThis study investigates the influence of fear, refuge, and migration in a predator–prey model, where the interactions between the species follow an asymmetric function response. In contrast to some other findings, we propose that prey develop an anti-predator response in response to a concentration of predators, which in turn increases the fear factor of the predators. The conditions under which all ecologically meaningful equilibrium points exist are discussed in detail. The local and global dynamics of the model are determined at all equilibrium points. The model admits several interesting results by changing the rate of fear of predators and predator aggregate sensitivity. Numerical simulations have been performed to verify our theoret
... Show MoreThis paper considers and proposes new estimators that depend on the sample and on prior information in the case that they either are equally or are not equally important in the model. The prior information is described as linear stochastic restrictions. We study the properties and the performances of these estimators compared to other common estimators using the mean squared error as a criterion for the goodness of fit. A numerical example and a simulation study are proposed to explain the performance of the estimators.
The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process
... Show MoreKrawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the
... Show MoreAn Optimal Algorithm for HTML Page Building Process
In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.
This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t
... Show More