標(biāo)題: Titlebook: Decision and Game Theory for Security; 11th International C Quanyan Zhu,John S. Baras,Juntao Chen Conference proceedings 2020 Springer Natu [打印本頁] 作者: 能干 時間: 2025-3-21 17:28
書目名稱Decision and Game Theory for Security影響因子(影響力)
書目名稱Decision and Game Theory for Security影響因子(影響力)學(xué)科排名
書目名稱Decision and Game Theory for Security網(wǎng)絡(luò)公開度
書目名稱Decision and Game Theory for Security網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Decision and Game Theory for Security被引頻次
書目名稱Decision and Game Theory for Security被引頻次學(xué)科排名
書目名稱Decision and Game Theory for Security年度引用
書目名稱Decision and Game Theory for Security年度引用學(xué)科排名
書目名稱Decision and Game Theory for Security讀者反饋
書目名稱Decision and Game Theory for Security讀者反饋學(xué)科排名
作者: Interdict 時間: 2025-3-21 20:45
Learning and Planning in the Feature Deception Problemender’s loss by misleading the attacker to make suboptimal decisions. In order to formally reason about deception, we introduce the ., a domain-independent model and present a learning and planning framework for finding the optimal deception strategy, taking into account the adversary’s preferences 作者: Osmosis 時間: 2025-3-22 02:40 作者: Counteract 時間: 2025-3-22 07:35 作者: paroxysm 時間: 2025-3-22 12:19 作者: incision 時間: 2025-3-22 13:45
Exploiting Bounded Rationality in Risk-Based Cyber Camouflage Games optimize a deceptive defense based on camouflaging network and system attributes, have shown effective numerical results on simulated data. However, these models possess a fundamental drawback due to the assumption that an attempted attack is always successful—as a direct consequence of the decepti作者: incision 時間: 2025-3-22 17:50 作者: 珊瑚 時間: 2025-3-22 22:54 作者: insolence 時間: 2025-3-23 04:48 作者: Abjure 時間: 2025-3-23 09:34 作者: elastic 時間: 2025-3-23 13:26 作者: morale 時間: 2025-3-23 17:36
Detection of Dynamically Changing Leaders in Complex Swarms from Observed Dynamic Datacally changing, leaders. We rely on short-time observations of the trajectories of the UAVs and develop a leader detection scheme based on the notion of Granger causality. We proceed with the estimation of the swarm’s coordination laws, modeled by a generalized Cucker-Smale model with non-local repu作者: 預(yù)測 時間: 2025-3-23 19:14 作者: 轉(zhuǎn)換 時間: 2025-3-23 22:30
Normalizing Flow Policies for Multi-agent Systemshese methods typically use networks that output the parameters of a diagonal Gaussian distribution from which the resulting action is sampled. In multi-agent contexts, however, better policies may require complex multimodal action distributions. Based on recent progress in density modeling, we propo作者: 蜿蜒而流 時間: 2025-3-24 05:31
A Realistic Approach for Network Traffic Obfuscation Using Adversarial Machine Learningin use. A key problem of using obfuscation methods is to determine an appropriate algorithm that introduces minimal changes but preserves the functionality of the protocol. We apply Adversarial Machine Learning techniques to find realistic small perturbations that can improve the security and privac作者: Culpable 時間: 2025-3-24 07:36 作者: ENDOW 時間: 2025-3-24 11:18 作者: 初次登臺 時間: 2025-3-24 17:17 作者: 美色花錢 時間: 2025-3-24 22:38 作者: UNT 時間: 2025-3-25 00:00
Secure Discrete-Time Linear-Quadratic Mean-Field Gamesn is noisy, and hence the Mean-Field Equilibrium (MFE) of the SLQ-MFG does not exist in the class of linear controllers. We introduce the notion of an approximate MFE (.-MFE) and prove that the MFE of the standard (non-secure) LQ-MFG is an .-MFE of the SLQ-MFG. Also, we show that . as the estimation作者: Resistance 時間: 2025-3-25 05:54 作者: municipality 時間: 2025-3-25 11:18
Andrew Colin,Roger Willett,Peter Lambrineasin use. A key problem of using obfuscation methods is to determine an appropriate algorithm that introduces minimal changes but preserves the functionality of the protocol. We apply Adversarial Machine Learning techniques to find realistic small perturbations that can improve the security and privac作者: FLEET 時間: 2025-3-25 12:16
https://doi.org/10.1007/978-1-84996-178-3e then present the behavior of an adaptive attacker in a Markov Decision Process (MDP) simulation. Lastly, we relate our analytic and empirical findings to cognitive bias effects and speculate on how the manipulation of game parameters may be used in future work to both estimate and trigger bias eff作者: dura-mater 時間: 2025-3-25 16:35
Ana C. V. Vieira,António J. Marques Cardosoation is NP-hard even in the zero-sum case. We provide an MILP formulation for the general problem with constraints on cost and feasibility, along with a pseudo-polynomial time algorithm for the special . setting. Second, for risk-averse attackers, we present a solution based on Prospect theoretic m作者: 實現(xiàn) 時間: 2025-3-25 21:52 作者: 你正派 時間: 2025-3-26 00:39
Schriftenreihe des Strafvollzugsarchivste information about decoy locations. Then, we investigate how to place decoys to maximize the defender’s deceptive winning region. Considering the large search space for all possible decoy allocation strategies, we incorporate the idea of compositional synthesis from formal methods and show that th作者: 縱火 時間: 2025-3-26 05:41 作者: 增強(qiáng) 時間: 2025-3-26 09:36 作者: 反復(fù)無常 時間: 2025-3-26 15:30
Moving Target Defense for Robust Monitoring of Electric Grid Transformers in Adversarial Environment作者: TRAWL 時間: 2025-3-26 18:19 作者: Organonitrile 時間: 2025-3-26 23:43 作者: carotenoids 時間: 2025-3-27 05:12 作者: cogitate 時間: 2025-3-27 07:44
Conference proceedings 2020pers were carefully reviewed and selected from 29 submissions. The papers focus on machine learning and security; cyber deception; cyber-physical systems security; security of network systems; theoretic foundations of security games; emerging topics..作者: 掃興 時間: 2025-3-27 11:53
0302-9743 2 short papers were carefully reviewed and selected from 29 submissions. The papers focus on machine learning and security; cyber deception; cyber-physical systems security; security of network systems; theoretic foundations of security games; emerging topics..978-3-030-64792-6978-3-030-64793-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 羊齒 時間: 2025-3-27 16:00
Johannes Feest,Wolfgang Lestinginteger linear program for layered directed acyclic graphs (DAGs) and neural architecture search for general DAGs. We empirically demonstrate that using deception on attack graphs gives the defender a significant advantage, and the algorithms we develop scale gracefully to medium-sized problems.作者: 古代 時間: 2025-3-27 19:09
Conference proceedings 2020lege Park, MD, USA, in October 2020. Due to COVID-19 pandemic the conference was held virtually?.The 21 full papers presented together with 2 short papers were carefully reviewed and selected from 29 submissions. The papers focus on machine learning and security; cyber deception; cyber-physical syst作者: Prosaic 時間: 2025-3-28 01:00 作者: cardiovascular 時間: 2025-3-28 04:18 作者: 小木槌 時間: 2025-3-28 09:49 作者: atrophy 時間: 2025-3-28 12:51 作者: 樂章 時間: 2025-3-28 14:47
https://doi.org/10.1007/978-1-4471-0471-1e learned preferences and show that the problem is NP-hard. (3) We perform extensive experiments to validate our methods and results. In addition, we provide a case study of the credit bureau network to illustrate how FDP implements deception on a real-world problem.作者: 身心疲憊 時間: 2025-3-28 19:24
Engineering Asset Management Reviewa two-player general-sum game between the adversary and the defender. To solve this game, we propose a multi-agent reinforcement learning framework based on the double oracle algorithm. Finally, we provide experimental results to demonstrate the effectiveness of our framework in finding optimal policies.作者: 減弱不好 時間: 2025-3-29 01:34
Debugging, Protection When Errors Arisemany types of network swarms including detection of influential malevolent “sources” of attacks and “miss-information”. The proposed algorithms are robust to missing data and noise. We validate our methodology using simulation data of complex swarm movements.作者: N斯巴達(dá)人 時間: 2025-3-29 05:02 作者: Frequency 時間: 2025-3-29 09:34 作者: CANDY 時間: 2025-3-29 11:41 作者: 歡呼 時間: 2025-3-29 18:02
Detection of Dynamically Changing Leaders in Complex Swarms from Observed Dynamic Datamany types of network swarms including detection of influential malevolent “sources” of attacks and “miss-information”. The proposed algorithms are robust to missing data and noise. We validate our methodology using simulation data of complex swarm movements.作者: Fester 時間: 2025-3-29 23:44
Decision and Game Theory for Security978-3-030-64793-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 散步 時間: 2025-3-30 00:27
https://doi.org/10.1007/978-3-030-64793-3artificial intelligence; computer crime; computer networks; computer science; computer security; computer作者: conjunctiva 時間: 2025-3-30 07:39
978-3-030-64792-6Springer Nature Switzerland AG 2020作者: 甜食 時間: 2025-3-30 11:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/264332.jpg作者: TAP 時間: 2025-3-30 14:03
https://doi.org/10.1007/978-1-4471-0471-1um. This paper proposes a distributed anomaly detection scheme based on adversarially-trained data models. While many anomaly detection methods typically depend on a central decision-making server, our distributed approach makes better use of decentralized resources, and decreases reliance on a sing作者: Flatus 時間: 2025-3-30 19:31 作者: 步履蹣跚 時間: 2025-3-30 22:59
Andrew Colin,Roger Willett,Peter Lambrineasaling important information about a network. Advanced encryption techniques are intended to mitigate network information exposure, but they remain vulnerable to statistical analysis of traffic features. An adversary can classify different applications and protocols from the observable statistical pr作者: Infant 時間: 2025-3-31 03:16
