1,784 research outputs found
Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems
Packing and vehicle routing problems play an important role in the area of
supply chain management. In this paper, we introduce a non-linear knapsack
problem that occurs when packing items along a fixed route and taking into
account travel time. We investigate constrained and unconstrained versions of
the problem and show that both are NP-hard. In order to solve the problems, we
provide a pre-processing scheme as well as exact and approximate mixed integer
programming (MIP) solutions. Our experimental results show the effectiveness of
the MIP solutions and in particular point out that the approximate MIP approach
often leads to near optimal results within far less computation time than the
exact approach
Draining the Water Hole: Mitigating Social Engineering Attacks with CyberTWEAK
Cyber adversaries have increasingly leveraged social engineering attacks to
breach large organizations and threaten the well-being of today's online users.
One clever technique, the "watering hole" attack, compromises a legitimate
website to execute drive-by download attacks by redirecting users to another
malicious domain. We introduce a game-theoretic model that captures the salient
aspects for an organization protecting itself from a watering hole attack by
altering the environment information in web traffic so as to deceive the
attackers. Our main contributions are (1) a novel Social Engineering Deception
(SED) game model that features a continuous action set for the attacker, (2) an
in-depth analysis of the SED model to identify computationally feasible
real-world cases, and (3) the CyberTWEAK algorithm which solves for the optimal
protection policy. To illustrate the potential use of our framework, we built a
browser extension based on our algorithms which is now publicly available
online. The CyberTWEAK extension will be vital to the continued development and
deployment of countermeasures for social engineering.Comment: IAAI-20, AICS-2020 Worksho
Recommended from our members
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures
A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems. Describing as well as identifying these inequalities will help in the efficiency of the LP-based cutting plane methods. In this report, we review classes of inequalities that partially described zero-one poly topes such as the 0-1 knapsack polytope, the set packing polytope and the travelling salesman polytope. Facets or valid inequalities derived from the 0-1 knapsack and the set packing polytopes are algorithmically identifie
- …