Data mining techniques have been concentrated for malware detection in the recent decade. The battle between security analyzers and malware scholars is everlasting as innovation grows. The proposed methodologies are not adequate while evolutionary and complex nature of malware is changing quickly and therefore turn out to be harder to recognize. This paper presents a systematic and detailed survey of the malware detection mechanisms using data mining techniques. In addition, it classifies the malware detection approaches in two main categories including signature-based methods and behavior-based detection. The main contributions of this paper are: (1) providing a summary of the current challenges related to the malware detection approaches in data mining, (2) presenting a systematic and categorized overview of the current approaches to machine learning mechanisms, (3) exploring the structure of the significant methods in the malware detection approach and (4) discussing the important factors of classification malware approaches in the data mining. The detection approaches have been compared with each other according to their importance factors. The advantages and disadvantages of them were discussed in terms of data mining models, their evaluation method and their proficiency. This survey helps researchers to have a general comprehension of the malware detection field and for specialists to do consequent examinations.

No abstract

No abstract

With the rapid development of in modern technologies has led to a novel generation of cyberspace equipment and secure analysis methods such as cyber‐physical system (CPS). The CPS system refers to an intelligent dependable system of embedded smart devices used to monitor and control the cyberspace conditions in a fog computing environment. The fog computing environment connects resources even human beings together to enhance the quality of life through performing of CPS applications using computation resources at the network edge. The optimization of task scheduling for the CSP applications as a challenging issue has been considered as the NP‐hard problem in fog computing environment which is not trivial. On the one hand, reasonable tasks scheduling can increase resource utilization, which can avoid less idle resource. This paper presents a task scheduling algorithm based on moth‐flame optimization algorithm to assign an optimal set of tasks to fog nodes to meet the satisfaction of quality of service requirements of CPS applications in such a way that the total execution time of tasks is minimized. The minimization of task execution and transfer time in the proposed algorithm are considered as objective functions. The experimental testing of the proposed solution is carried out in iFogSim toolkit. As a result of the simulation based on proposed algorithm found, the optimal solution for the scheduling of tasks and equal distribution of tasks to fog nodes has been provided, and less total execution time consumption has been achieved compared with other algorithms.

No abstract

In recent years, users are becoming increasingly accustomed to using the Internet to gain software resources in the form of web services provided by information technology organizations. Cloud computing is a service delivery paradigm that shares services and resources to access the web services to the end users over the Internet. In the cloud environment, based on the user's needs, various types of services with similar functionalities but different quality-of-service (QoS) criteria can be delivered, which often must be combined to meet the users' requests. The optimal selection and composition of these services are realized as an interesting issue. In this paper, we propose a moth-flame optimization (MFO) algorithm, which is a novel nature-inspired metaheuristic paradigm for the web service composition (WSC) problem called "MFO-WSC," to improve the QoS criteria in the distributed cloud environment. Also, formal modeling is presented for the QoS-aware MFO-WSC algorithm with the model checking approach that receives the particular benefits to collaborate the correctness of the proposed algorithm. The correctness of the proposed behavior model is examined using some logical problems such as deadlock-free, fairness, and reachability conditions in the new symbolic model verifier model checker. The experimental results indicate the effectiveness of the proposed algorithm in comparison with similar related works.

No abstract

No abstract