Parcourir Vol. 25, No. 2 par date de publication

Voici les éléments 1-4 de 4

  • How to Burn a Network or Spread Alarm 

    Simon, Marek; Huraj, Ladislav; Dirgova Luptakova, Iveta; Pospichal, Jiri (Institute of Automation and Computer Science, Brno University of Technology, 2019-12-20)
    This paper compares centrality indices usage within a heuristic method for a fast spread of alarm, or crucial information. Such indices can be used as a core part within more sophisticated optimisation methods, which should ...

  • A Survey on Artificial Intelligence in Malware as Next-Generation Threats 

    Thanh, Cong Truong; Zelinka, Ivan (Institute of Automation and Computer Science, Brno University of Technology, 2019-12-20)
    Recent developments in Artificial intelligence (AI) have a vast transformative potential for both cybersecurity defenders and cybercriminals. Anti-malware solutions adopt intelligent techniques to detect and prevent threats ...

  • An Ensemble-Based Malware Detection Model Using Minimum Feature Set 

    Zelinka, Ivan; Amer, Eslam (Institute of Automation and Computer Science, Brno University of Technology, 2019-12-20)
    Current commercial antivirus detection engines still rely on signature-based methods. However, with the huge increase in the number of new malware, current detection methods become not suitable. In this paper, we introduce ...

  • Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching 

    Kudela, Jakub (Institute of Automation and Computer Science, Brno University of Technology, 2019-12-20)
    The Minimum-Volume Covering Ellipsoid (MVCE) problem is an important optimization problem that comes up in various areas of engineering and statistics. In this paper, we improve the state-of-the-art Wolfe-Atwood algorithm ...