In recent years, the evolution of the community structure in social networks has gained significant attention. Due to the rapid and continuous evolution of real-world networks over time. This makes the process of identifying communities and tracking their topology changes challenging. To tackle these challenges, it is necessary to find efficient methodologies for analyzing the behavior patterns of dynamic communities. Several previous reviews have introduced algorithms and models for community detection. However, these methods have not been very accurate in identifying communities. Moreover, none of the reviewed papers made an apparent effort to link algorithms that can accurately detect dynamic communities. This review aims to present a ta

Detection of early clinical keratoconus (KCN) is a challenging task, even for expert clinicians. In this study, we propose a deep learning (DL) model to address this challenge. We first used Xception and InceptionResNetV2 DL architectures to extract features from three different corneal maps collected from 1371 eyes examined in an eye clinic in Egypt. We then fused features using Xception and InceptionResNetV2 to detect subclinical forms of KCN more accurately and robustly. We obtained an area under the receiver operating characteristic curves (AUC) of 0.99 and an accuracy range of 97–100% to distinguish normal eyes from eyes with subclinical and established KCN. We further validated the model based on an independent dataset with

language is universal and that of Fairclough’s (1992), image can be a source of ambiguity and creativity, has pushed the researchers to conduct the present study. Besides, surveying the literature review of caricature images, the researchers have found that still much work needs to be done as far as images are concerned in different disciplines in general and in linguistics in particular to bridge the many gaps there. Accordingly, the objective of the current research is to examine students’ ability to identify the denotative key-signs that help access and share the intended denotative meaning and/or highlight other denotative meaning potentials from a detextualised image caricature. To achieve the objective of the study, the researcher

This paper proposes a new method Object Detection in Skin Cancer Image, the minimum
spanning tree Detection descriptor (MST). This ObjectDetection descriptor builds on the
structure of the minimum spanning tree constructed on the targettraining set of Skin Cancer
Images only. The Skin Cancer Image Detection of test objects relies on their distances to the
closest edge of thattree. Our experimentsshow that the Minimum Spanning Tree (MST) performs
especially well in case of Fogginessimage problems and in highNoisespaces for Skin Cancer
Image.
The proposed method of Object Detection Skin Cancer Image wasimplemented and tested on
different Skin Cancer Images. We obtained very good results . The experiment showed that

Intrusion detection systems detect attacks inside computers and networks, where the detection of the attacks must be in fast time and high rate. Various methods proposed achieved high detection rate, this was done either by improving the algorithm or hybridizing with another algorithm. However, they are suffering from the time, especially after the improvement of the algorithm and dealing with large traffic data. On the other hand, past researches have been successfully applied to the DNA sequences detection approaches for intrusion detection system; the achieved detection rate results were very low, on other hand, the processing time was fast. Also, feature selection used to reduce the computation and complexity lead to speed up the system

Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied o