Search

Your search keyword '"Ali-Ahmed F"' showing total 117 results
Start Over Author "Ali-Ahmed F"
117 results on '"Ali-Ahmed F"'

5. Large Distance Modification of Newtonian Potential and Structure Formation in Universe

Author

Hameeda, Mir, Upadhyay, Sudhaker, Faizal, Mir, Ali, Ahmed F., and Pourhassan, Behnam

Subjects
General Relativity and Quantum Cosmology, High Energy Physics - Theory
Abstract

In this paper, we study the effects of super-light brane world perturbative modes on structure formation in our universe. As these modes modify the large distance behavior of Newtonian potential, they effect the clustering of a system of galaxies. So, we explicitly calculate the clustering of galaxies interacting through such a modified Newtonian potential. We use a suitable approximation for analyzing this system of galaxies, and discuss the validity of such approximations. We observe that such corrections also modify the virial theorem for such a system of galaxies., Comment: 13 pages, 3 captioned figures

Published
2017
Full Text
View/download PDF

8. A Modified Manta Ray Foraging Algorithm for Edge Server Placement in Mobile Edge Computing.

Author

El-Ashmawi, Walaa H., Ali, Ahmed F., and Ali, Ahmed

Subjects
MOBULIDAE, MOBILE computing, NP-hard problems, EDGE computing, COMPUTER systems
Abstract

Owing to the rapid growth of the Internet of Things (IoT) and mobile devices, big data has been generated, and a cloud computing system is required to manipulate it. The main issue in this system is the access delay (AD) when the IoT and mobile devices offload their workload on the servers and the workload balance among them. Mobile edge computing (MEC), which has a sufficient distribution of edge servers (ESs) and resources, has been developed to overcome this problem. The placement of ESs in MEC is an NP-hard problem and a multi-objective optimization (MOO) problem that aims to reduce the AD between mobile users and ES and balance the workload among these servers. In this paper, we propose a new hybrid natural-inspired algorithm by combining the manta ray foraging algorithm and the uniform crossover operator to find the optimal edge server placement (ESP) in MEC and minimize the AD between mobile users and the ES. Although the standard manta ray foraging optimization (MRFO) algorithm can balance diversification and intensification, it suffers from premature convergence. We invoke a uniform crossover operator in the standard MRFO algorithm to overcome this problem. In addition, the standard MRFO algorithm is designed to solve continuous optimization problems and is unsuitable for solving discrete problems. However, ESP is a discrete optimization problem. We modified the operators in the standard MRFO algorithm to solve the ESP problem, achieving an optimal solution in terms of minimizing the AD between BSs and ESs and balancing the workload among ESs. The proposed algorithm is then tested on the Shanghai Telecom dataset and compared with five other algorithms. The results show that the proposed algorithm achieves the least AD, and the workload balance reaches about 52% compared with the other algorithms. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

17. List of contributors

Author

Abohany, Amr, primary, Ali, Ahmed F., additional, AlRubaiei, Mazoon, additional, Darwish, Ashraf, additional, Dhamodharavadhani, S., additional, El-Shafeiy, Engy, additional, Jassim, Hothefa sh, additional, Juma, Mazen, additional, Kaur, Avinash, additional, Malallah, Fahad Layth, additional, Mathew, Elezabeth, additional, Nayyar, Anand, additional, Panigrahi, Chhabi Rani, additional, Pati, Bibudhendu, additional, Pattanayak, Binod Kumar, additional, Raslan, Aliaa F., additional, Rath, Mamata, additional, Rathipriya, R., additional, Safdar, Sohail, additional, Shaalan, Khaled, additional, Sharef, Baraa T., additional, Sharef, Zeyad T., additional, Singh, Parminder, additional, and Sivabalan, S., additional

Published
2020
Full Text
View/download PDF

31. Innovation Gene: the relationship between financial performance and communicating innovation in mission statement

Author

Ali, Ahmed F., Yalta Vargas, Carlos, and Fakhouri, Mohammed

Subjects
financial performance, communication, mission statement, profits, Fortune 500, revenues, assets, Innovation, market value, Business Administration, Företagsekonomi
Abstract

Mission statement is important to companies, especially as a strategic communication tool with stakeholders. Innovation is also important to companies and has its implications on performance. This study examines the relationship between financial performance and explicitly communicating innovation in mission statement. The study uses a quantitative approach with logistic regression to test empirical hypotheses related to revenues, profits, change in assets and market value, and their relationship with explicitly communicating innovation in mission statements. The conclusion is that among all the financial performance indicators considered, only market value represents a strong and significant result, indicating a positive relationship with explicitly communicating innovation.

Published
2019

46. An enhanced Jaya algorithm for solving nurse scheduling problem

Author

El-Ashmawi, Walaa H. and Ali, Ahmed F.

Abstract

Nurse Scheduling Problem (NSP) is one of the main optimisation problems that require an efficient assignment of a number of nurses to a number of shifts in order to cover the hospital's planning horizon demands. NSP is an NP-hard problem which subjects to a set of hard and soft constraints. Such problems can be solved by optimisation algorithms efficiently such as meta-heuristic algorithms. In this paper, we enhanced one of the most recent meta-heuristic algorithms which is called Jaya for solving the NSP. The enhanced algorithm is called EJNSP (Enhanced Jaya for Nurse Scheduling Problem). EJNSP focuses on maximising the nurses' preferences about shift requests and minimising the under- and over-staffing. EJNSP has two main strategies. First, it randomly generates an initial effective scheduling that satisfies a set of constraints. Second, it uses swap operators in order to satisfy the set of soft constraints to achieve an effective scheduling. A set of experiments have been applied to a set of the benchmark dataset with different numbers of nurses and shifts. The experimental results demonstrated that EJNSP algorithm achieved effective results for solving NSP in order to minimise the under- and over-staffing and satisfy the nurses' preferences.

Published
2019
Full Text
View/download PDF

48. Cell-Penetrating Bisubstrate-Based Protein Kinase C Inhibitors

Author

van Wandelen, Loek T. M., primary, van Ameijde, Jeroen, additional, Ismail-Ali, Ahmed F., additional, van Ufford, H. C. (Linda) Quarles, additional, Vijftigschild, Lodewijk A. W., additional, Beekman, Jeffrey M., additional, Martin, Nathaniel I., additional, Ruijtenbeek, Rob, additional, and Liskamp, Rob M. J., additional

Published
2013
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results