اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدUsability Aware Secret Protection with Minimum Cost
87
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we study a cybersecurity problem of protecting systems secrets with multiple protections and a required security level, while minimizing the associated cost due to implementation/maintenance of these protections as well as the affected system usability. The target system is modeled as a discrete-event system (DES) in which there are a subset of marker states denoting the services/functions provided to regular users, a subset of secret states, and multiple subsets of protectable events with different security levels. We first introduce usability-aware cost levels for the protectable events, and then formulate the security problem as to ensure that every system trajectory that reaches a secret state contains a specified number of protectable events with at least a certain security level, and the highest usability-aware cost level of these events is minimum. We first provide a necessary and sufficient condition under which this security problem is solvable, and when this condition holds we propose an algorithm to solve the problem based on the supervisory control theory of DES. Moreover, we extend the problem to the case of heterogeneous secrets with different levels of importance, and develop an algorithm to solve this extended problem. Finally, we demonstrate the effectiveness of our solutions with a network security example.
قيم البحث
اقرأ أيضاً
In this paper we study a security problem of protecting secrets with multiple protections and minimum costs. The target system is modeled as a discrete-event system (DES) in which a few states are secrets, and there are multiple subsets of protectabl
e events with different cost levels. We formulate the problem as to ensure that every string that reaches a secret state (from the initial state) contains a specified number of protectable events and the highest cost level of these events is minimum. We first provide a necessary and sufficient condition under which this security problem is solvable, and then propose an algorithm to solve the problem based on the supervisory control theory of DES. The resulting solution is a protection policy which specifies at each state which events to protect and the highest cost level of protecting these events is minimum. Finally, we demonstrate the effectiveness of our solution with a network security example.
Accurate load prediction is an effective way to reduce power system operation costs. Traditionally, the mean square error (MSE) is a common-used loss function to guide the training of an accurate load forecasting model. However, the MSE loss function
is unable to precisely reflect the real costs associated with forecasting errors because the cost caused by forecasting errors in the real power system is probably neither symmetric nor quadratic. To tackle this issue, this paper proposes a generalized cost-oriented load forecasting framework. Specifically, how to obtain a differentiable loss function that reflects real cost and how to integrate the loss function with regression models are studied. The economy and effectiveness of the proposed load forecasting method are verified by the case studies of an optimal dispatch problem that is built on the IEEE 30-bus system and the open load dataset from the Global Energy Forecasting Competition 2012 (GEFCom2012).
Off-grid systems have emerged as a sustainable and cost-effective solution for rural electrification. In sub-Sarahan Africa (SSA), a great number of solar-hybrid microgrids have been installed or planned, operating stand-alone or grid-tied to a weak
grid. Presence of intermittent energy sources necessitates the provision of energy storage for system balancing. Reliability and economic performance of those rural microgrids strongly depend on specific control strategies. This work develops a predictive control framework dedicated to rural microgrids incorporating a temperature-dependent battery degradation model. Based on a scalable DC PV-battery microgrid, the realistic simulation shows its superior performance in the reliability improvement and cost reduction. Compared with the day-ahead control without the temperature-dependent battery degradation model, this control strategy can improve the reliability by 5.5% and extend the lead-acid battery life time by 26%, equivalent to lowering the levelised cost of electricity (LCOE) by 13%.
Due to the wide application of average consensus algorithm, its security and privacy problems have attracted great attention. In this paper, we consider the system threatened by a set of unknown agents that are both malicious and curious, who add add
itional input signals to the system in order to perturb the final consensus value or prevent consensus, and try to infer the initial state of other agents. At the same time, we design a privacy-preserving average consensus algorithm equipped with an attack detector with a time-varying exponentially decreasing threshold for every benign agent, which can guarantee the initial state privacy of every benign agent, under mild conditions. The attack detector will trigger an alarm if it detects the presence of malicious attackers. An upper bound of false alarm rate in the absence of malicious attackers and the necessary and sufficient condition for there is no undetectable input by the attack detector in the system are given. Specifically, we show that under this condition, the system can achieve asymptotic consensus almost surely when no alarm is triggered from beginning to end, and an upper bound of convergence rate and some quantitative estimates about the error of final consensus value are given. Finally, numerical case is used to illustrate the effectiveness of some theoretical results.
In this paper we present a Learning Model Predictive Control (LMPC) strategy for linear and nonlinear time optimal control problems. Our work builds on existing LMPC methodologies and it guarantees finite time convergence properties for the closed-lo
op system. We show how to construct a time varying safe set and terminal cost function using closed-loop data. The resulting LMPC policy is time varying and it guarantees recursive constraint satisfaction and non-decreasing performance. Computational efficiency is obtained by convexifing the safe set and terminal cost function. We demonstrate that, for a class of nonlinear system and convex constraints, the convex LMPC formulation guarantees recursive constraint satisfaction and non-decreasing performance. Finally, we illustrate the effectiveness of the proposed strategies on minimum time obstacle avoidance and racing examples.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
