IoT applications have become a pillar for enhancing the quality of life. However, the increasing amount of data generated by IoT devices places pressure on the resources of traditional cloud data centers. This prevents cloud data centers from fulfilling the requirements of IoT applications, particularly delay-sensitive applications. Fog computing is a relatively recent computing paradigm that extends cloud resources to the edge of the network. However, task scheduling in this computing paradigm is still a challenge. In this study, a semidynamic real-time task scheduling algorithm is proposed for bag-of-tasks applications in the cloud–fog environment. The proposed scheduling algorithm formulates task scheduling as a permutation-based optimization problem. A modified version of the genetic algorithm is used to provide different permutations for arrived tasks at each scheduling round. Then, the tasks are assigned, in the order defined by the best permutation, to a virtual machine, which has sufficient resources and achieves the minimum expected execution time. A conducted optimality study reveals that the proposed algorithm has a comparative performance with respect to the optimal solution. Additionally, the proposed algorithm is compared with first fit, best fit, the genetic algorithm, and the bees life algorithm in terms of makespan, total execution time, failure rate, average delay time, and elapsed run time. The experimental results show the superiority of the proposed algorithm over the other algorithms. Moreover, the proposed algorithm achieves a good balance between the makespan and the total execution cost and minimizes the task failure rate compared to the other algorithms. Graphical Abstract
The kidney exchange programs bring new insights in the field of organ transplantation. They make the previously not allowed surgery of incompatible patient-donor pairs easier to be performed on a large scale. Mathematically, the kidney exchange is an optimization problem for the number of possible exchanges among the incompatible pairs in a given pool. Also, the optimization modeling should consider the expected quality-adjusted life of transplant candidates and the shortage of computational and operational hospital resources. In this article, we introduce a bio-inspired stochastic-based Ant Lion Optimization, ALO, algorithm to the kidney exchange space to maximize the number of feasible cycles and chains among the pool pairs. Ant Lion Optimizer-based program achieves comparable kidney exchange results to the deterministic-based approaches like integer programming. Also, ALO outperforms other stochastic-based methods such as Genetic Algorithm in terms of the efficient usage of computational resources and the quantity of resulting exchanges. Ant Lion Optimization algorithm can be adopted easily for on-line exchanges and the integration of weights for hard-to-match patients, which will improve the future decisions of kidney exchange programs. A reference implementation for ALO algorithm for kidney exchanges is written in MATLAB and is GPL licensed. It is available as free open-source software from: https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges.
Wireless sensor networks are an emerging technology deployed in many fields. Knowing the positions of sensor nodes is critical for many applications to perform their tasks. Hence, accurate node localisation in wireless sensor networks is an essential issue. The node localisation problem can be formulated as a multidimensional optimisation problem. In this study, the authors propose a node localisation scheme based on a sine–cosine algorithm. The proposed scheme addresses the flip ambiguity problem, which can badly affect the localisation accuracy of the entire network. The efficacy of the proposed scheme is evaluated through intensive experimentation under different scenarios. The obtained results show the superiority of the proposed scheme against other optimisation algorithms in terms of the localisation accuracy, the number of localised nodes, and the computation time.
11 January 2016 in Arabian Journal for Science and Engineering
Score fusion is a technique that combines the matching scores from multiple biometric modalities for an authentication system. Biometric modalities are unique physical or behavioral characteristics that can be used to identify individuals. Biometric authentication systems use these modalities to verify or identify individuals. Score fusion can improve the performance of biometric authentication systems by exploiting the complementary strengths of different modalities and reducing the impact of noise and outliers from individual modalities. This paper proposes a new score fusion method based on the Sine Cosine Algorithm (SCA). SCA is a meta-heuristic optimization algorithm used in various optimization problems. The proposed method extracts features from multiple biometric sources and then computes intra/inter scores for each modality. The proposed method then normalizes the scores for a given user using different biometric modalities. Then, the mean, maximum, minimum, median, summation, and Tanh are used to aggregate the scores from different biometric modalities. The role of the SCA is to find the optimal parameters to fuse the normalized scores. We evaluated our methods on the CASIA-V3-Internal iris dataset and the AT&T (ORL) face database. The proposed method outperforms existing optimization-based methods under identical experimental conditions and achieves an Equal Error Rate (EER) of 1.003% when fusing left iris, right iris, and face. This represents an improvement of up to 85.89% over unimodal baselines. These findings validate SCA’s effectiveness for adaptive score fusion in multimodal biometric systems.