الاستخبارات في العهد المكي: دراسة تحليلية

Security is most important need of every state and community. Surveillance and keeping eye on the enemy are the core responsibilities of every state. All the absolute qualities of a leader can be found in The Holy Prophet (P.B.U.H). Therefore, the first nucleus of security education was in Makkah and expanded with the expansion of the Da’wah till the declaration of Madina as a Islamic state. There are various studies on the subject of surveillance, but they did not cover all aspects of Sīrah in Makkī era regarding the various steps and methods of surveillance. This article investigates how the Holy Prophet (P.B.U.H) maintained the security measures during Makkī era to ensure the security of all his companions and followers. In the First section of this article definition and history of intelligence was discussed, followed by the various techniques of surveillance used in different occasions by the Prophet (P.B.U.H). The last section of the article focused on the techniques used in Makkī era. The article further elaborates the practical steps taken by Prophet (P.B.U.H) to secure his companions and their families from the opponents to the extent possible, like migration to Habash and finally to Madina which concluded in establishment of a free state for Muslims.

A Frequent Graph Pattern Mining Approach for Evaluation of Trends in Social Media

Graph mining is a well-established research field and lately it has drawn considerable attention of research communities. It allows to process, analyze, and discover significant knowledge from graph data. Graph mining has been highly motivated by the enormous number of applications. Such applications include Chemoinformatics, Bioinformatics, and societal networks. In graph mining, one of the most challenging tasks is Frequent Subgraph Mining (FSM). FSM has been applied to many domains, such as graphical data management and knowledge discovery, social network analysis, Bioinformatics, and security. In this context, a large number of techniques have been suggested to deal with the graph data. However, FSM approaches are facing some challenges, including enormous numbers of Frequent Subgraph Patterns (FSPs); no suitable mechanism for applying ranking at the appropriate level during the discovery process of the FSPs; extraction of repetitive and duplicate FSPs; user involvement in supplying the support threshold value; large number of subgraph candidate generation; and there exists no specialized scheme to decide the discovered FSPs are optimized patterns as well. Thus, the aim of this research is to make cope with the challenges of enormous FSPs, avoid duplicate discovery of FSPs, use the ranking for the discovered FSPs, and to suggest an optimization strategy to illustrate an association between the frequent and the optimized subgraph patterns. The exploration of this association will further help to decide on the FSPs as optimized FSPs. Therefore, to address the aforementioned challenges a new FSM framework A RAnked Frequent pattern-growth Framework (A-RAFF) is developed. The proposed FSM framework, A-RAFF, provides an efficient answer to these challenges through the initiation of a new ranking measure called FSP-Rank. The proposed ranking measure FSP-Rank, based on the characteristics of the FSPs, effectively reduced the duplicate and enormous FSPs. Moreover, in this study, we have investigated the association between FSPs and optimized subgraph using a Particle Swarm Optimization technique. The effectiveness of the techniques proposed in the dissertation is validated by extensive experimental analysis using different benchmarks, both real and synthetic graph datasets. Finally, our experiments have consistently demonstrated promising empirical results, thus confirming the superiority and practical feasibility of the proposed FSM framework.