Abstract The paper introduces a new path-planning robotic system methodology called Collision Avoidance and Routing based on Location Access (CARLA) for use in critical environments such as hospitals and crises where quick action and saving human lives are vital. The main focus of our framework is on accuracy and fast responses, such as delivering tools or items in a specific area while avoiding collisions with other robots and obstacles. CARLA is designed to provide quick responses during emergencies, unlike most existing algorithms that are integrated into site control units or distributed among mobile robots on-site. By being loaded onto a remote server node rather than individual robots, CARLA helps to conserve the robots' capabilities, hardware resources, and power consumption. Additionally, our system utilizes cloud computing and Fog servers technology to improve data transmission times between the cloud and smart devices, especially for applications with strict timing requirements like emergency response. The Fog platform is also leveraged to enhance on-site access to real-time interaction and location-based services by bringing processing power closer to the robots from far-off Cloud servers. CARLA has various applications, such as in factories and warehouses, where mobile robots need to be selected and directed by a central control system remotely. The proposed framework consists of three main modules: Robot Knowledge Module, Robot Selection Module, and Route Reservation Module, which will all be discussed in detail in this paper. The results of simulations using this framework show that the robots have improved flexibility and efficiency in terms of computing paths and successfully fulfiling requests without colliding, compared to traditional methods used in similar scenarios.

Abstract As engineering technology advances and the number of complex engineering problems increases, there is a growing need to expand the abundance of swarm intelligence algorithms and enhance their performance. It is crucial to develop, assess, and hybridize new powerful algorithms that can be used to deal with optimization issues in different fields. This paper proposes a novel nature-inspired algorithm, namely the Groupers and Moray Eels (GME) optimization algorithm, for solving various optimization problems. GME mimics the associative hunting between groupers and moray eels. Many species, including chimpanzees and lions, have shown cooperation during hunting. Cooperative hunting among animals of different species, which is called associative hunting, is extremely rare. Groupers and moray eels have complementary hunting approaches. Cooperation is thus mutually beneficial because it increases the likelihood of both species successfully capturing prey. The two predators have complementary hunting methods when they work together, and an associated hunt creates a multi-predator attack that is difficult to evade. This example of hunting differs from that of groups of animals of the same species due to the high level of coordination among the two species. GME consists of four phases: primary search, pair association, encircling or extended search, and attacking and catching. The behavior characteristics are mathematically represented to allow for an adequate balance between GME exploitation and exploration. Experimental results indicate that the GME outperforms competing algorithms in terms of accuracy, execution time, convergence rate, and the ability to locate all or the majority of local or global optima.

Abstract Covid-19 is a very dangerous disease as a result of the rapid and unprecedented spread of any previous disease. It is truly a crisis that threatens the world since its first appearance in December 2019 until our time. Due to the lack of a vaccine that has proved sufficiently effective so far, the rapid and more accurate diagnosis of this disease is extremely necessary to enable the medical staff to identify infected cases and isolate them from the rest to prevent further loss of life. In this paper, Covid-19 diagnostic strategy (CDS) as a new classification strategy that consists of two basic phases: Feature selection phase (FSP) and diagnosis phase (DP) has been introduced. During the first phase called FSP, the best set of features in laboratory test findings for Covid-19 patients will be selected using enhanced gray wolf optimization (EGWO). EGWO combines both types of selection techniques called wrapper and filter. Accordingly, EGWO includes two stages called filter stage (FS) and wrapper stage (WS). While FS uses many different filter methods, WS uses a wrapper method called binary gray wolf optimization (BGWO). The second phase called DP aims to give fast and more accurate diagnosis using a hybrid diagnosis methodology (HDM) based on the selected features from FSP. In fact, the HDM consists of two phases called weighting patient phase (WP2) and diagnostic patient phase (DP2). WP2 aims to calculate the belonging degree of each patient in the testing dataset to class category using naïve Bayes (NB) as a weight method. On the other hand, K-nearest neighbor (KNN) will be used in DP2 based on the weights of patients in the testing dataset as a new training dataset to give rapid and more accurate detection. The suggested CDS outperforms other strategies according to accuracy, precision, recall (or sensitivity) and F-measure calculations that are equal to 99%, 88%, 90% and 91%, respectively, as showed in experimental results.

Sports video analysis has received much attention as it turned to be a hot research area in the field of image processing. This motivation offers opportunities that develop fascinating applications supported by analysis of different sports, especially soccer. Ball identification, in soccer images, is an essential task not only for goal-scoring but also for performance evaluation. However, ball detection suffers from several hurdles such as occlusions, fast-moving objects, shadows, poor lighting, color contrast, and other static background objects. Although several ball detection techniques have been introduced such as Frame Difference, Mixture of Gaussian (MoG), Optical Flow, and so forth; ball detection in soccer games is still an open research area. In this paper, a new Fuzzy Based Ball Detection (FB2D) strategy is proposed for identifying the ball through a set of image sequences extracted from a soccer match video. FB2D can accurately identify the ball even if it is attached to the white lines drawn on the playground or partially occluded behind players. FB2D is compared to recent ball detection techniques. Experimental results show that FB2D outperforms recent detection techniques as it introduces both the highest level of detection accuracy in the testing stage and the lowest possible error.

Abstract This paper is about enhancing the smart grid by proposing a new hybrid feature-selection method called feature selection-based ranking (FSBR). In general, feature selection is to exclude non-promising features out from the collected data at Fog. This could be achieved using filter methods, wrapper methods, or a hybrid. Our proposed method consists of two phases: filter and wrapper phases. In the filter phase, the whole data go through different ranking techniques (i.e., relative weight ranking, effectiveness ranking, and information gain ranking) The results of these ranks are sent to a fuzzy inference engine to generate the final ranks. In the wrapper phase, data is being selected based on the final ranks and passed on three different classifiers (i.e., Naive Bayes, Support Vector Machine, and neural network) to select the best set of the features based on the performance of the classifiers. This process can enhance the smart grid by reducing the amount of data being sent to the cloud, decreasing computation time, and decreasing data complexity. Thus, the FSBR methodology enables the user load forecasting (ULF) to take a fast decision, the fast reaction in short-term load forecasting, and to provide a high prediction accuracy. The authors explain the suggested approach via numerical examples. Two datasets are used in the applied experiments. The first dataset reported that the proposed method was compared with six other methods, and the proposed method was represented the best accuracy of 91%. The second data set, the generalization data set, reported 90% accuracy of the proposed method compared to fourteen different methods.

Software as a Service (SaaS) providers can serve thousands of customers, which have hundreds of thousands of overlapping requirements, using a single application instance to offer service at a lower price. Even with a potentially large number of customers with varying requirements, a multitenant application should make co-tenancy transparent to the tenants, which means that every tenant must appear to be the sole owner of the application, to achieve this, a highly configurable multitenant solution is needed. In this paper, we analyze variation in multiple tenants' requirements, to propose a classification for multitenant application requirements, and implement variability realization techniques depending on requirement levels. Furthermore, we prioritize the tenants' requirements to satisfy as many customer requirements as possible, and provide key guidelines to software architects and developers to implement a configuration layer in a multi-tenancy architecture.

Semantic Web Services (SWSs) represent the most recent and revolutionary technology developed for machine-to-machine interaction on the web 3.0. As for the conventional web services, the problem of discovering and selecting the most suitable web service represents a challenge for SWSs to be widely used. In this paper, we propose a mapping algorithm that facilitates the redefinition of the conventional web services annotations (i.e., WSDL) using semantic annotations (i.e., OWL-S). This algorithm will be a part of a new discovery mechanism that relies on the semantic annotations of the web services to perform its task. The “local ontology repository” and “ontology search and standardization engine” are the backbone of this algorithm. Both of them target to define any data type in the system using a standard ontology-based concept. The originality of the proposed mapping algorithm is its applicability and consideration of the standardization problem. The proposed algorithm is implemented and its components are validated using some test collections and real examples. An experimental test of the proposed techniques is reported, showing the impact of the proposed algorithm in decreasing the time and the effort of the mapping process. Moreover, the experimental results promises that the proposed algorithm will have a positive impact on the discovery process as a whole.