221 research outputs found
Cyber Insurance: recent advances, good practices & challenges
The aim of this ENISA report is to raise awareness for the most impact to market advances, by shortly identifying the most significant cyber insurance developments for the past four years – during 2012 to 2016 – and to capture the good practices and challenges during the early stages of the cyber insurance lifecycle, i.e. before an actual policy is signed, laying the ground for future work in the area
Recommended from our members
Optimizing emergency preparedness and resource utilization in mass-casualty incidents
This paper presents a response model for the aftermath of a Mass-Casualty Incident (MCI) that can be used to provide operational guidance for regional emergency planning as well as to evaluate strategic preparedness plans. A mixed integer programming (MIP) formulation is proposed for the combined ambulance dispatching, patient-to-hospital assignment, and treatment ordering problem. T he goal is to allocate effectively the limited resources during the response so as to improve patient outcomes, while the objectives are to minimize the overall response time and the total flow time required to treat all patients, in a hierarchical fashion. The model is solved via exact and MIP-based heuristic solution methods. The applicability of the model and the performance of the new methods are challenged on realistic MCI scenarios. We consider the hypothetical case of a terror attack at the New York Stock Exchange in Lower Manhattan with up to 150 trauma patients. We quantify the impact of capacity-based bottlenecks for both ambulances and available hospital beds. We also explore the trade-off between accessing remote hospitals for demand smoothing versus reduced ambulance transportation times
Mixed planar and network single-facility location problems
We consider the problem of optimally locating a single facility anywhere in a network to serve both on-network and off-network demands. Off-network demands occur in a Euclidean plane, while on-network demands are restricted to a network embedded in the plane. On-network demand points are serviced using shortest-path distances through links of the network (e.g., on-road travel), whereas demand points located in the plane are serviced using more expensive Euclidean distances. Our base objective minimizes the total weighted distance to all demand points. We develop several extensions to our base model, including: (i) a threshold distance model where if network distance exceeds a given threshold, then service is always provided using Euclidean distance, and (ii) a minimax model that minimizes worst-case distance. We solve our formulations using the “Big Segment Small Segment” global optimization method, in conjunction with bounds tailored for each problem class. Computational experiments demonstrate the effectiveness of our solution procedures. Solution times are very fast (often under one second), making our approach a good candidate for embedding within existing heuristics that solve multi-facility problems by solving a sequence of single-facility problems. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 68(4), 271–282 2016
- …