Journal of Advances in Computer Engineering and Technology
Volume:7 Issue: 1, Winter 2021

Recently, many optimization algorithms have been proposed to find the best solution for complex engineering problems. These algorithms can search unknown and multidimensional spaces and find the optimal solution the shortest possible time. In this paper we present a new modified differential evolution algorithm. Optimization algorithms typically have two stages of exploration and exploitation. Exploration refers to global search and exploitation refers to local search. We used the same differential evolution (DE) algorithm. This algorithm uses a random selection of several other search agents to update the new search agent position. This makes the search agents continually have random moves in the search space, which refers to the exploration phase but there is no mechanism specifically considered for the exploitation phase in the DE algorithm. In this paper, we have added a new formula for the exploitation phase to this algorithm and named it the Balanced Differential Evolution (BDE) algorithm. We tested the performance of the proposed algorithm on standard test functions, CEC2005 Complex and Combined Test Functions. We also apply the proposed algorithm to solve some real problems to demonstrate its ability to solve constraint problems. The results showed that the proposed algorithm has a better performance and competitive performance than the new and novel optimization algorithms.

Fog computing is being seen as a bridge between smart IoT devices and large scale cloud computing. It is possible to develop cloud computing services to network edge devices using Fog computing. As one of the most important services of the system, the resource allocation should always be available to achieve the goals of Fog computing. Resource allocation is the process of distributing limited available resources among applications based on predefined rules. Because the problems raised in the resource management system are NP-hard, and due to the complexity of resource allocation, heuristic algorithms are promising methods for solving the resource allocation problem. In this paper, an algorithm is proposed based on learning automata to solve this problem, which uses two learning automata: a learning automata is related to applications (LAAPP) and the other is related to Fog nodes (LAN). In this method, an application is selected from the action set of LAAPP and then, a Fog node is selected from the action set of LAN. If the requirements of deadline, response time and resources are met, then the resource will be allocated to the application. The efficiency of the proposed algorithm is evaluated through conducting several simulation experiments under different Fog configurations. The obtained results are compared with several existing methods in terms of the makespan, average response time, load balancing and throughput.

Metaheuristic algorithms are typically population-based random search techniques. The general framework of a metaheuristic algorithm consisting of its main parts. The sections of a metaheuristic algorithm include setting algorithm parameters, population initialization, global search section, local search section, and checking the stopping conditions in a metaheuristic algorithm. In the parameters setting section, the user can monitor the performance of the metaheuristic algorithm and improve its performance according to the problem under consideration. In this study, an overview of the concepts, classifications, and different methods of population initialization in metaheuristic algorithms discussed in recent literature will be provided. Population initialization is a basic and common step between all metaheuristic algorithms. Therefore, in this study, an attempt has been made that the performance, methods, mechanisms, and categories of population initialization in metaheuristic algorithms. Also, the relationship between population initialization and other important parameters in performance and efficiency of metaheuristic algorithms such as search space size, population size, the maximum number of iteration, etc., which are mentioned and considered in the literature, are collected and presented in a regular format.

The decision tree is one of the popular methods for learning and reasoning through recursive partitioning of data space. To choose the best attribute in the case on numerical features, partitioning criteria should be calculated for individual values or the value range of each attribute should be divided into two or more intervals using a set of cut points. In partitioning range of attribute, the fuzzy partitioning can be used to reduce the noise sensitivity of data and to increase the stability of decision trees. Since the tree-building algorithms need to keep in main memory the whole training dataset, they have memory restrictions. In this paper, we present an algorithm that builds the fuzzy decision tree on the large dataset. In order to avoid storing the entire training dataset in main memory and overcome the memory limitation, the algorithm builds DTs in an incremental way. In the discretization stage, a fuzzy partition was generated on each continuous attribute based on fuzzy entropy. Then, in order to select the best feature for branches, two criteria, including fuzzy information gain and occurrence matrix are used. Besides, real datasets are used to evaluate the behavior of the algorithm in terms of classification accuracy, decision tree complexity, and execution time as well. The results show that proposed algorithm without a need to store the entire dataset in memory and reduce the complexity of the tree is able to overcome the memory limitation and making balance between accuracy and complexity .

Fog computing is known as a new computing technology where it covers cloud computing shortcomings in term of delay. This is a potential for running IoT applications containing multiple services taking benefit of closeness to fog nodes near to devices where the data are sensed. This article formulates service placement issue into an optimization problem with total power consumption minimization inclination. It considers resource utilization and traffic transmission between different services as two prominent factors of power consumption, once they are placed on different fog nodes. On the other hand, placing all of the services on the single fog node owing to power reduction reduces system reliability because of one point of failure phenomenon. In the proposed optimization model, reliability limitations are considered as constraints of stated problem. To solve this combinatorial problem, an energy-aware reliable service placement algorithm based on whale optimization algorithm (ER-SPA-WOA) is proposed. The suggested algorithm was validated in different circumstances. The results reported from simulations prove the dominance of proposed algorithm in comparison with counterpart state-of-the-arts.

In recent years, social networks' growth has led to an increase in these networks' content. Therefore, text mining methods became important. As part of text mining, Sentiment analysis means finding the author's perspective on a particular topic. Social networks allow users to express their opinions and use others' opinions in other people's opinions to make decisions. Since the comments are in the form of text and reading them is time-consuming. Therefore, it is essential to provide methods that can provide us with this knowledge usefully. Black Widow Optimization (BWO) is inspired by black widow spiders' unique mating behavior. This method involves an exclusive stage, namely, cannibalism. For this reason, at this stage, species with an inappropriate evaluation function are removed from the circle, thus leading to premature convergence. In this paper, we first introduced the BWO algorithm into a binary algorithm to solving discrete problems. Then, to reach the optimal answer quickly, we base its inputs on the opposition. Finally, to use the algorithm in the property selection problem, which is a multi-objective problem, we convert the algorithm into a multi-objective algorithm. The 23 well-known functions were evaluated to evaluate the performance of the proposed method, and good results were obtained. Also, in evaluating the practical example, the proposed method was applied to several emotion datasets, and the results indicate that the proposed method works very well in the psychology of texts.