Purpose: The research seeks to develop the implications of intellectual human capital, and social capital in business organizations, and will be accomplished on three levels, the first level (the level of description) to identify, diagnose and display content philosophical Strategic Human Resource Management at the thought of modern administrative represented by human capital and Ras social capital. The second level (level of analysis) and the analysis of the extent of the impact of alignment between human capital, and social capital in the organizational strength of the organizations. The third level (Level predict) the formulation of a plan to strengthen the organizational strength in business organizations and to develop speci

Most Internet of Vehicles (IoV) applications are delay-sensitive and require resources for data storage and tasks processing, which is very difficult to afford by vehicles. Such tasks are often offloaded to more powerful entities, like cloud and fog servers. Fog computing is decentralized infrastructure located between data source and cloud, supplies several benefits that make it a non-frivolous extension of the cloud. The high volume data which is generated by vehicles’ sensors and also the limited computation capabilities of vehicles have imposed several challenges on VANETs systems. Therefore, VANETs is integrated with fog computing to form a paradigm namely Vehicular Fog Computing (VFC) which provide low-latency services to mo

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord