Chaos-based image encryption using hybrid model of linear-feedback shift register system and deoxyribonucleic acid

Multimedia Tools and Applications - The security of digital images has been under much more attack recently. A novel image security based on a hybrid model of deoxyribonucleic acid (DNA),...     

Elite artificial bees' colony algorithm to solve robot's fuzzy constrained routing problem

One of the fundamental challenges of the robotics field is robot's movement. That is, why route planning is an eminent issue of robotics research and it is used to enhance autonomy of moving robots in complex environments. The objective of route planning problem is to find the shortest route without collide from initiation point to destination point so that the amount of energy consumption by robot would not exceed a predefined amount. Because neither the amount of energy consumption nor the robot's passed distance index cannot be measured precisely due to environmental conditions, and fuzzy data is used for modeling the problem and the problem would be called “Robot Fuzzy Constrained shortest Route” problem. The main contributions of this study are fivefold: (i) The mathematical model of fuzzy constrained shortest route problem (FCSRP) is formulated; (ii) An elite artificial bees' colony (EABC) algorithm is used to solve the robot's FSCRP; (iii) The proposed EABC algorithm is simulated with two fuzzy networks; (iv) The performance of the proposed approach is compared with the performance of genetic algorithm and particle swarm optimization algorithm; and (v) The results show the convergence speed of the EABC algorithm is higher than the existing algorithms.     

An Efficient Computational Hybrid Filter to the SLAM Problem for an Autonomous Wheeled Mobile Robot

The using of an autonomous wheeled mobile robot (AWMR) that perform diverse processes in a numerous number of applications without human’s interposition in an unknown environment is thriving, nowadays. An AWMR can search the environment, create an adequate map, and localizing itself into this map, by interpreting the environment, autonomously. The FastSLAM is a structure for simultaneous localization and mapping (SLAM) for an AWMR. The correctness and efficiency of the estimation of the FastSLAM often depend on the accurate a previous knowledge of the control and measurement noise covariance matrices. Also, inaccurate previous knowledge may seriously degrade their efficiency. One of the major causes of losing particle manifold is sample impoverishment in the FastSLAM. These cases of the most main problems. This paper presents a robust new method to solve these problems as called Hybrid filter SLAM. In this method, for learning the measurement and control noise covariance matrices for increasing correctness and consistency are utilized Intuitionistic Fuzzy Logic System (IFLS). In order to optimize efficiency of sampling from Cuckoo Search (CS). The results of the simulation and experimental shown that the Hybrid filter SLAM is efficient than the FastSLAM that has less number of computations and good performance for the larger environment.

     

Parallel multi-objective artificial bee colony algorithm for software requirement optimization

Requirements Engineering - In incremental software development approaches, the product is developed in various releases. In each release, a set of requirements is proposed for the development....     

Solving the Task Starvation and Resources Problem Using Optimized SMPIA in Cloud

In this study, a new feature is added to the smart message passing interface (SMPI) approach (SMPIA) based on the prioritization method, which can completely eliminate the task starvation and lack of sufficient resources problems through prioritizing the tasks. The proposed approach is based on prioritizing the tasks and the urgency of implementation. Tasks are prioritized based on execution time, workload, the task with a more sensitive priority is executed earlier by the free source. The idea of demand-bound functions (DBFs) was extended to the SMPIA setting based on partitions and caps. For each task, two DBFs are constructed, DBFLOand DBFHI, for the LO and HI criticality modes, respectively. The simulation results returned by MATLAB showed that with the optimized SMPIA (O-SMPIA), the parameters of maximum service execution time, response time, delay time, and throughput improved in this work. In addition, the results confirmed that the reduction of execution time, completion time, and resource consumption time did not affect the response time and throughput of workflow tasks and did not cause inefficient use of resources in virtual machines (VMs) and data centers (DCs). The evaluation of performance metrics showed that the delay, response time of the Greedy algorithm was less than that of Max-Min and Min-Min. At the same time, the execution time of Max-Min was less than the others and the throughput of the Greedy was longer. The effect and throughput of O-SMPIA became more obvious as change to the job count and the number of cloud workloads increased. It is also worth mentioning that one of the main advantages of the O-SMPIA to other methods is the efficient use of time to execute all the defined tasks by CPU.     

Task scheduling using NSGA II with fuzzy adaptive operators for computational grids

Scheduling algorithms have an essential role in computational grids for managing jobs, and assigning them to appropriate resources. An efficient task scheduling algorithm can achieve minimum execution time and maximum resource utilization by providing the load balance between resources in the grid. The superiority of genetic algorithm in the scheduling of tasks has been proven in the literature. In this paper, we improve the famous multi-objective genetic algorithm known as NSGA-II using fuzzy operators to improve quality and performance of task scheduling in the market-based grid environment. Load balancing, Makespan and Price are three important objectives for multi-objective optimization in the task scheduling problem in the grid. Grid users do not attend load balancing in making decision, so it is desirable that all solutions have good load balancing. Thus to decrease computation and ease decision making through the users, we should consider and improve the load balancing problem in the task scheduling indirectly using the fuzzy system without implementing the third objective function. We have used fuzzy operators for this purpose and more quality and variety in Pareto-optimal solutions. Three functions are defined to generate inputs for fuzzy systems. Variance of costs, variance of frequency of involved resources in scheduling and variance of genes values are used to determine probabilities of crossover and mutation intelligently. Variance of frequency of involved resources with cooperation of Makespan objective satisfies load balancing objective indirectly. Variance of genes values and variance of costs are used in the mutation fuzzy system to improve diversity and quality of Pareto optimal front. Our method conducts the algorithm towards best and most appropriate solutions with load balancing in less iteration. The obtained results have proved that our innovative algorithm converges to Pareto-optimal solutions faster and with more quality.