نتایج جستجو برای: cost sensitive attack graph

تعداد نتایج: 915732  

2008
Scott O'Hare Steven Noel Kenneth Prole

This paper describes a software system that provides significant new capabilities for visualization and analysis of network attack graphs produced through Topological Vulnerability Analysis (TVA). The TVA approach draws on a database of known exploits and system vulnerabilities to provide a connected graph representing possible cyber-attack paths within a given network. Our visualization approa...

2009
Liang Lu Reihaneh Safavi-Naini Markus Hagenbuchner Willy Susilo Jeffrey Horton Sweah Liang Yong Ah Chung Tsoi

Network security analysis based on attack graphs has been applied extensively in recent years. The ranking of nodes in an attack graph is an important step towards analyzing network security. This paper proposes an alternative attack graph ranking scheme based on a recent approach to machine learning in a structured graph domain, namely, Graph Neural Networks (GNNs). Evidence is presented in th...

Journal: :iranian journal of fuzzy systems 2010
ali golnarkar ali asghar alesheikh mohamad reza malek

numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(fspp). the main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...

Journal: :IEEE Transactions on Pattern Analysis and Machine Intelligence 2011

In this paper, the authors investigated the various factors, which can affect the performance of a turbofan engine. For this, the various subunits of a turbofan engine like inlet duct, compressor, combustion chamber, liner, turbine, exhaust nozzle etc. are investigated to find its various reliability characteristics through Markov process and supplementary variable technique (SVT). The main adv...

باقری, علیرضا, سپهری, اکرم,

In this paper we consider to embed a tree T with N vertices on a set of N points inside a simple polygon on n vertices and the goal is to minimize the number of bends. The main idea of our algorithm is modeling the problem into graph matching problem and uses the graph matching algorithms. We apply the concept of error-correction transformation and find the appropriate cost function then we per...

Journal: :Mathematical Problems in Engineering 2013

Journal: :IEEE Transactions on Dependable and Secure Computing 2021

Ideal cyber threat intelligence (CTI) includes insights into attacker strategies that are specific to a network under observation. Such CTI currently requires extensive expert input for obtaining, assessing, and correlating system vulnerabilities graphical representation, often referred as an attack graph (AG). Instead of deriving AGs based on vulnerabilities, this work advocates the direct use...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید