As a result of the speed and availability of the Internet, mobile devices and apps are in widespread usage throughout the world. Thus, they can be seen in the hands of nearly every person, helping us in our daily activities to accomplish many tasks with less effort and without wasting time. However, many issues occur while using mobile apps, which can be considered as issues of functional or non-functional requirements (NFRs). Users can add their comments as a review on the mobile app stores that provide for technical feedback, which can be used to improve the software quality and features of the mobile apps. Minimum attention has been given to such comments by scholars in addressing, detecting, and classifying issues related to NFRs, which are still considered challenging. The purpose of this paper is to propose a hybrid deep learning model to detect and classify NFRs (according to usability, reliability, performance, and supportability) of mobile apps using natural language processing methods. The hybrid model combines three deep learning (DL) architectures: a recurrent neural network (RNN) and two long short-term memory (LSTM) models. It starts with a dataset construction extracted from the user textual reviews that contain significant information in the Arabic language. Several experiments were conducted using machine learning classifiers (MCLs) and DL, such as ANN, LSTM, and bidirectional LSTM architecture to measure the performance of the proposed hybrid deep learning model. The experimental results show that the performance of the proposed hybrid deep learning model outperforms all other models in terms of the F1 score measure, which reached 96%. This model helps mobile developers improve the quality of their apps to meet user satisfaction and expectations by detecting and classifying issues relating to NFRs.

Purpose: The purpose of the paper is to propose and demonstrate a novel approach for addressing the challenges of path planning and obstacle avoidance in the context of mobile robots (MR). The specific objectives and purposes outlined in the paper include: introducing a new methodology that combines Q-learning with dynamic reward to improve the efficiency of path planning and obstacle avoidance. Enhancing the navigation of MR through unfamiliar environments by reducing blind exploration and accelerating the convergence to optimal solutions and demonstrating through simulation results that the proposed method, dynamic reward-enhanced Q-learning (DRQL), outperforms existing approaches in terms of achieving convergence to an optimal action strategy more efficiently, requiring less time and improving path exploration with fewer steps and higher average rewards. Design/methodology/approach: The design adopted in this paper to achieve its purposes involves the following key components: (1) Combination of Q-learning and dynamic reward: the paper’s design integrates Q-learning, a popular reinforcement learning technique, with dynamic reward mechanisms. This combination forms the foundation of the approach. Q-learning is used to learn and update the robot’s action-value function, while dynamic rewards are introduced to guide the robot’s actions effectively. (2) Data accumulation during navigation: when a MR navigates through an unfamiliar environment, it accumulates experience data. This data collection is a crucial part of the design, as it enables the robot to learn from its interactions with the environment. (3) Dynamic reward integration: dynamic reward mechanisms are integrated into the Q-learning process. These mechanisms provide feedback to the robot based on its actions, guiding it to make decisions that lead to better outcomes. Dynamic rewards help reduce blind exploration, which can be time-consuming and inefficient and promote faster convergence to optimal solutions. (4) Simulation-based evaluation: to assess the effectiveness of the proposed approach, the design includes a simulation-based evaluation. This evaluation uses simulated environments and scenarios to test the performance of the DRQL method. (5) Performance metrics: the design incorporates performance metrics to measure the success of the approach. These metrics likely include measures of convergence speed, exploration efficiency, the number of steps taken and the average rewards obtained during the robot’s navigation. Findings: The findings of the paper can be summarized as follows: (1) Efficient path planning and obstacle avoidance: the paper’s proposed approach, DRQL, leads to more efficient path planning and obstacle avoidance for MR. This is achieved through the combination of Q-learning and dynamic reward mechanisms, which guide the robot’s actions effectively. (2) Faster convergence to optimal solutions: DRQL accelerates the convergence of the MR to optimal action strategies. Dynamic rewards help reduce the need for blind exploration, which typically consumes time and this results in a quicker attainment of optimal solutions. (3) Reduced exploration time: the integration of dynamic reward mechanisms significantly reduces the time required for exploration during navigation. This reduction in exploration time contributes to more efficient and quicker path planning. (4) Improved path exploration: the results from the simulations indicate that the DRQL method leads to improved path exploration in unknown environments. The robot takes fewer steps to reach its destination, which is a crucial indicator of efficiency. (5) Higher average rewards: the paper’s findings reveal that MR using DRQL receive higher average rewards during their navigation. This suggests that the proposed approach results in better decision-making and more successful navigation. Originality/value: The paper’s originality stems from its unique combination of Q-learning and dynamic rewards, its focus on efficiency and speed in MR navigation and its ability to enhance path exploration and average rewards. These original contributions have the potential to advance the field of mobile robotics by addressing critical challenges in path planning and obstacle avoidance.

In the smart grid, electricity price is a key element for all participants in the electric power industry. To meet the smart grid’s various goals, Demand-Response (DR) control aims to change the electricity consumption behavior of consumers based on dynamic pricing or financial benefits. DR methods are divided into centralized and distributed control based on the communication model. In centralized control, consumers communicate directly with the power company, without communicating among themselves. In distributed control, consumer interactions offer data to the power utility about overall consumption. Online auctions are distributed systems with several software agents working on behalf of human buyers and sellers. The coordination model chosen can have a substantial impact on the performance of these software agents. Based on the fair energy scheduling method, we examined Vickrey and Dutch auctions and coordination models in an electronic marketplace both analytically and empirically. The number of software agents and the number of messages exchanged between these agents were all essential indicators. For the simulation, GridSim was used, as it is an open-source software platform that includes capabilities for application composition, resource discovery information services, and interfaces for assigning applications to resources. We concluded that Dutch auctions are better than Vickrey auctions in a supply-driven world where there is an abundance of power. In terms of equity, Dutch auctions are more equitable than Vickrey auctions. This is because Dutch auctions allow all bidders to compete on an equal footing, with each bidder having the same opportunity to win the item at the lowest possible price. In contrast, Vickrey auctions can lead to outcomes that favor certain bidders over others, as bidders may submit bids that are higher than necessary to increase their chances of winning.

This study presents a new comparative analysis of the cognitive control methods of HVAC systems that assess reinforcement learning (RL) and traditional proportional-integral-derivative (PID) control. Through extensive simulations in various building environments, we have shown that while the PID controller provides stability under predictable conditions, the RL-based control can improve energy efficiency and thermal comfort in dynamic environments by constantly adapting to environmental changes. Our framework integrates real-time sensor data with a scalable RL architecture, allowing autonomous optimization without the need for a precise system model. Key findings show that RL largely outperforms PID during disturbances such as occupancy increases and weather fluctuations, and that the preferably optimal solution balances energy savings and comfort. The study provides practical insight into the implementation of adaptive HVAC control and outlines the potential of RL to transform building energy management despite its higher computational requirements.

This research deals with reconfigurable uniprocessor embedded real-time systems to be implemented by different OS tasks that should be independent, synchronous, and periodic, and that should meet functional and temporal properties described in user requirements. The authors define two forms of automatic reconfigurations assumed to be applied at run-time: addition-removal of tasks or just modifications of their temporal parameters; WCET and/or periods. The authors define a new semantic of reconfigurations where a crucial criterion to consider is the automatic improvement of the system’s feasibility at run-time.

This paper undertakes an examination of elevator car dispatching methods in response to hall calls. Firstly, our study focuses on the establishment of a representation of an elevator group control system as a finite-state machine to understand the dynamics of elevator group control. Secondly, two primary heuristics are explored, with the first advocating directional continuity unless the highest or lowest floor has been reached, while the second permits direction change upon completing the final call, regardless of floor extremes. Identified inefficiencies in these heuristic solutions lead us to explore enhanced alternatives. Consequently, we delve into genetic algorithm (GA) and simulated annealing (SA) methodologies. Our focus initially centers on devising solution representations and determining fitness evaluations for both approaches. We employ a simulation-based optimization approach to identify the optimal parameter values for both simulated annealing and genetic algorithms. A subsequent comparative analysis is conducted to ascertain the most effective approach among these diverse solutions. A comparative analysis reveals that the GA-based approach significantly outperforms both existing heuristics and the SA-based method in minimizing average passenger waiting time at the cost of longer computational time.