Abstract With the ever‐increasing use of Internet and social networks that generate a vast amount of information, there is a serious need for recommendation systems. In this article, we propose a recommender system utilizing deep neural networks that simultaneously considers both the users' ratings to the movies and the visual features of the movie poster and trailer. For this purpose, a hybrid movie recommender system, RSLCNet, has been developed using CNN and LSTM architectures. The proposed system considers the dynamics of users' interests in the collaborative filtering engine using the LSTM network that receives user‐rating sequences. In the content‐based filtering engine, utilizing CNN, the visual features of movie posters and trailers are extracted, and along with the actors and the directors, similar movies are recommended to the user. Moreover, each user's social influence is calculated employing the social information available on the user's Twitter account and used in the average movie rating to improve the effectiveness of the content‐based filtering part. The required datasets have been collected from MovieTweetings, Mise‐en‐scène, and OMDB. The evaluation results show that the accuracy and effectiveness of the proposed approach have been improved in terms of MAE and RMSE compared to the best available methods.

Abstract Increasing resource efficiency and reducing the energy consumption of cloud data centers is critical, especially during the global CORONA virus pandemic. Virtual machines' consolidation using live migration maximizes the hosts' and the reduction of energy consumption. An increase in the host's virtual machines in the consolidation process and the dynamic workload of the virtual machines may cause the overloading in the hosts. One approach to overcome this problem is reducing the hosts' virtual machines. One crucial issue to improve the quality of the consolidation process's quality is determining the best virtual machine for the migration process. Although the selection process has lower computational complexity than other challenges (like placement and overload prediction) in the consolidation process, this issue has received less attention. This article aims to present an efficient algorithm for the selection process. We first considered five main criteria for the selection process: migration time, migration risk, virtual machine connectivity, releasable resources, and penalty for SLA violation. Then, we propose an algorithm based on analytic hierarchy process multi‐criteria decision‐making technique. Next, to determine the weight of the proposed criteria, we simulate thousands of virtual machines of the PlanetLab workloads. These weights are tunable based on the data center preferences. The results of the suggested approach results show 23% reduction in the hosts' energy consumption, 49% reduction in the number of migrations, and 18% reduction in the SLA violation compared with other techniques. So, using the proposed method may significantly reduce the overall cost of the data centers.

Abstract Virtualization plays an essential role in decreasing energy consumption and optimizing resource utilization by enabling the creation of virtual machines (VM) and their consolidation through live migration. Excessive migrations and a lack of required VMs are two critical factors in QoS degradation. The current consolidation approaches impose an intensive time complexity and cannot be used in large data centers with hundreds of hosts. This article proposes a framework for dynamic consolidation divided into a QoS‐aware algorithm for overload avoidance and a power‐aware algorithm for VM placement. To compute a safe zone criterion for any VM, relations were suggested by applying an interval estimate with a confidence level. By employing this criterion, the offered algorithm could guarantee the quality of service (QoS), particularly for specific VMs, while avoiding overhead. The VM placement algorithm is developed based on the maximum utilization of active hosts. It provides the capability to control the number of active hosts for the data center manager. The simulation results with real workloads revealed that the proposed framework could decline the amount of service level agreement violations by 78% and the number of migrations by 74%, and energy consumption by up to 13% in comparison with the best results of the benchmark algorithms. Hence, the application of this framework upgrades the QoS of data centers and declines their energy costs.

Recently, mobile ad hoc networks (MANETs) have received a lot of attention and can be used effectively for fast resource sharing due to their flexibility, self-organization and simple implementation. However, resource discovery is an important and challenging issue in mobile ad hoc networks because of their dynamic nature, topology variations and limited resources. In this paper, we propose a middleware architecture based on the publish-subscribe system that can be used to discover and locate of resources in mobile ad hoc networks. This middleware provides capabilities to adjust Quality of Service, load balancing and prioritization and can work well under broker failures. The simulation results show that our approach significantly reduces message cost and discovery delay, while improving resource availability.