Adaptive Process Execution in a Service Cloud: Service Selection and Scheduling Based on Machine Learning

Author(s):  
Dhanwant S. Kang ◽  
Hua Liu ◽  
Munindar P. Singh ◽  
Tong Sun
Entropy ◽  
2021 ◽  
Vol 23 (4) ◽  
pp. 395
Author(s):  
Héctor D. Menéndez ◽  
David Clark ◽  
Earl T. Barr

Malware detection is in a coevolutionary arms race where the attackers and defenders are constantly seeking advantage. This arms race is asymmetric: detection is harder and more expensive than evasion. White hats must be conservative to avoid false positives when searching for malicious behaviour. We seek to redress this imbalance. Most of the time, black hats need only make incremental changes to evade them. On occasion, white hats make a disruptive move and find a new technique that forces black hats to work harder. Examples include system calls, signatures and machine learning. We present a method, called Hothouse, that combines simulation and search to accelerate the white hat’s ability to counter the black hat’s incremental moves, thereby forcing black hats to perform disruptive moves more often. To realise Hothouse, we evolve EEE, an entropy-based polymorphic packer for Windows executables. Playing the role of a black hat, EEE uses evolutionary computation to disrupt the creation of malware signatures. We enter EEE into the detection arms race with VirusTotal, the most prominent cloud service for running anti-virus tools on software. During our 6 month study, we continually improved EEE in response to VirusTotal, eventually learning a packer that produces packed malware whose evasiveness goes from an initial 51.8% median to 19.6%. We report both how well VirusTotal learns to detect EEE-packed binaries and how well VirusTotal forgets in order to reduce false positives. VirusTotal’s tools learn and forget fast, actually in about 3 days. We also show where VirusTotal focuses its detection efforts, by analysing EEE’s variants.


2019 ◽  
Vol 11 (9) ◽  
pp. 2619 ◽  
Author(s):  
Wei He ◽  
Guozhu Jia ◽  
Hengshan Zong ◽  
Jili Kong

Service management in cloud manufacturing (CMfg), especially the service selection and scheduling (SSS) problem has aroused general attention due to its broad industrial application prospects. Due to the diversity of CMfg services, SSS usually need to take into account multiple objectives in terms of time, cost, quality, and environment. As one of the keys to solving multi-objective problems, the preference information of decision maker (DM) is less considered in current research. In this paper, linguistic preference is considered, and a novel two-phase model based on a desirable satisfying degree is proposed for solving the multi-objective SSS problem with linguistic preference. In the first phase, the maximum comprehensive satisfying degree is calculated. In the second phase, the satisfying solution is obtained by repeatedly solving the model and interaction with DM. Compared with the traditional model, the two-phase is more effective, which is verified in the calculation experiment. The proposed method could offer useful insights which help DM balance multiple objectives with linguistic preference and promote sustainable development of CMfg.


2018 ◽  
Vol 108 ◽  
pp. 339-354 ◽  
Author(s):  
Nivethitha Somu ◽  
Gauthama Raman M.R. ◽  
Kalpana V. ◽  
Kannan Kirthivasan ◽  
Shankar Sriram V.S.

Sign in / Sign up

Export Citation Format

Share Document