Graph theory based heuristic approach for minimum break point set determination in large scale power systems

M Dolatabadi, Y Damchi - IEEE Transactions on Power …, 2019 - ieeexplore.ieee.org
Coordination of directional relays in large-scale power systems that are multi-loop structured
is a complicated and time consuming problem. Therefore, determination of the directional …

Approximate cycles count in undirected graphs

M Safar, K Mahdi, H Farahat, S Albehairy… - International Journal of …, 2014 - Springer
In social networks, counting the number of different cycle sizes can be used to measure the
entropy of the network that represents its robustness. The exact algorithms to compute …

[PDF][PDF] Entropy optimization of social networks using an evolutionary algorithm.

M Safar, N El-Sayed, K Mahdi, D Taniar - J. Univers. Comput. Sci., 2010 - academia.edu
Recent work on social networks has tackled the measurement and optimization of these
networks' robustness and resilience to both failures and attacks. Different metrics have been …

Proactive caching to support mobility in named data networks

H Farahat - 2017 - search.proquest.com
Abstract Information-centric Networks (ICNs) offer a promising paradigm for the future
Internet to cope with an ever increasing growth in data and shifts in access models. Different …

Analysis of dynamic social network: e-mail messages exchange network

M Safar, H Farahat, K Mahdi - … of the 11th International Conference on …, 2009 - dl.acm.org
Counting entropy of social networks is used to study the dynamic of such networks. It
depends on counting the number of cycles in the network, which is an NP problem. In this …

Cyclic entropy of collaborative complex networks

M Safar, K Mahdi, L Jammal - IET communications, 2012 - IET
Recent models of complex networks rely on degree-based properties evaluation, a new
approach is proposed based on other microstructures existing in networks that are cycles …

Feedback capacity of random networks

M Safar, K Mahdi, G Al-Shiridah - 2012 15th International …, 2012 - ieeexplore.ieee.org
Internal feedback structure exists in non-hierarchical random network in form of cycles.
Diffusion of information from a node to reach out all the rest occurs throughout penetration …

Estimation algorithm for counting periodic orbits in complex social networks

I Sorkhoh, KA Mahdi, M Safar - Information Systems Frontiers, 2013 - Springer
Complex networks can store information in form of periodic orbits (cycles) existing in the
network. This cycle-based approach although computationally intensive, it provided us with …

[PDF][PDF] Robustness Analysis of Social Network based on a Dynamic Model.

H Wu, S Ying, X Jia, L Zhang, X Chen - Journal of Digital Information …, 2013 - dline.info
Due to the high vulnerability of today's social systems against disruptions, it has become
critical to measure and manage the robustness of social networks. In this study the …

Computation non-intensive estimation algorithm for counting cycles in random networks

I Sorkhoh, K Mahdi, M Safar - … of the 12th International Conference on …, 2010 - dl.acm.org
We modify the statistical mechanical based Belief Propagation (BP) algorithm to compute
cycles in random networks using a phenomenological Gaussian distribution of cycles. The …