سلمان گلی

The emergence of the Internet of Things (IoT) has intensified the focus on web service composition and the fulfillment of increasingly complex and diverse user requirements. IoT-based systems often encounter numerous service candidates with varying qualitative attributes, presenting a significant challenge in selecting an optimal combination. This problem, categorized as NP-hard, requires efficient approaches for resolution. This study proposes a near-optimal solution for web service composition in IoT environments by leveraging the NSGA-III multi-objective metaheuristic algorithm to identify the optimal Pareto front. To further enhance the quality and diversity of the solutions, an improved algorithm integrating NSGA-III with a novel fitness function is introduced. The proposed approach optimizes service composition using nine quality parameters, which are subsequently streamlined into three principal objectives for better computational efficiency. Experimental evaluations demonstrate that the proposed method outperforms the baseline NSGA-III algorithm in terms of the average performance of two out of three objectives. Additionally, the approach achieves an average of 11% higher coverage based on performance indices and exhibits superior solution distribution and dispersion compared to alternative algorithms.

Much studied have addressed Path planning as one of the main topics in unmanned aerial vehicles; which has yielded different results due to the existing conditions and limitations. To this end, the present study proposed an efficient algorithm underpinned by the propeller optimization algorithm, which had a utility function and could optimize multiple responses simultaneously. BOA is different from other meta-heuristic algorithms as each propeller produces its own unique fit in the path by combining information extracted from different sensory receptors. Accordingly, BOA can solve multi-objective problems. A 3D objective function was used in this study to estimate the length of the shortest path and the intensity of collisions with obstacles, avoid collisions and enhance UAVs’ operational capacity as a function of consumed energy. Furthermore, A smart launcher factor was also included in this algorithm to prevent trapping in local optimizations and promote network coverage in the routing process at the same time. The launcher prevents collision with obstacles in UAVs by adopting geometric techniques and the contour line. The performance of the proposed algorithm was compared with that of the most practical meta-heuristic algorithms (namely ACO and PSO methods). The findings revealed that the BOA algorithm compared to the other two algorithms had the lowest cost and the second lowest cost under the best and worst conditions, respectively. The findings also confirmed the better performance of BOA than the other two algorithms regarding execution time and the optimal value of the fit function.

Support Vector machine is one of the most popular and efficient algorithms in machine learning. There are several versions of this algorithm, the latest of which is the fuzzy least squares twin support vector machines. On the other hand, in many machine learning applications input data is continuously generated, which has made many traditional algorithms inefficient to deal with them. In this paper, for the first time, an incremental version of the fuzzy least squares twin support vector algorithm is presented. The proposed algorithmis represented in both online and quasi-online modes. To evaluate the accuracy and precision of the proposed algorithmfirst we run our algorithm on 6 datasets of the UCI repository. Results showthe proposed algorithm is more efficient than other algorithms (even non-incremental versions). In the second phase in the experiments, we consider an application of Internet of Things, and in particular in data related to daily activities which inherently are incremental. According to experimental results, the proposed algorithm has the best performance compared to other incremental algorithms.

Today, the rapid growth in cloud computing resources usage has increased energy consumption in data centers. Green cloud computing goal is to decrease the energy consumption of data centers. In the meantime, service aggregation is a good method to reduce energy consumption in these systems. Existing aggregation methods with unnecessary migration, the unbalanced workload of hosts, and ignoring the relationship between services may reduce the quality of service and increase energy consumption. Therefore, in this study, by migrating the necessary services based on priority (including the number of children, the level and communication cost of each service), from hosts with the unbalanced workload to hosts that contain partner services, the productivity of available resources is improved and the energy consumption is decreased. Live services migration based on prioritizing and minimizing the number of migrations can also lead to response time decrease and system efficiency increase. The proposed method can lead to an 11.79% decrease in energy consumption, a 12.15% reduction in the number of service migrations, and a 1.55% increase in the number of hosts that have been shut down.

simply approving an act in the Guardian Council can guarantee its legitimacy and correspondency with Canon Law. since the natural responsibility of this entity is to accord Islamic Parliment's enactments with Canon Law (religious law), besides unless legislature's enactments obtain its correspondency with the Canon Law, it can not be described as an act. The Guardian Council has enacted the computer's crime law, so it has legitimacy and for the punitive justice agents this amount of legitimacy is enough. But from the jurisprudence point of view it should be detailed more and the arguments and proofs upon which the legitimacy of this act stands be clarified. The subject of this article is to examine the Canon Law's catechism of producing, distributing and diffusing malwares in the cyber space that is the subject of clause 25 in the computer crimes law enacted under the influence of Budapest convention. There is no instance of this crime in the religious tradition and verses as it is a new crime. Therefore to prove its legitimacy we should refer to intellect and general juridicial(فقهی) rules, such as no harm rule, Tasbib rule(causation rule), Taslit rule, Al ta'azir be yadelhakem rule etc… .It is concluded that the mentioned crime not only doesn't conflict with the religious cases but also we can obtain many reasons for its legitimacy