Identifying sufficient deception in military logistics

Ausseil, Rosemonde; Gedik, Ridvan; Bednar, Amy E.; Cowan, Mark A.

doi:10.1016/j.eswa.2019.112974

Cited by 9 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another work by the same team of authors [10] proposes the construction of a model of optimal solutions based on statistical material and simulation modeling. The result of the integrated system is a built model of optimal solutions for the elimination of combat damage to equipment.…”

Section: Literature Review and Problem Statementmentioning

confidence: 99%

Devising matrix technology for forecasting the dynamics in the operation of a closed military logistics system

Ugol'nikov

Diachenko

Kliat

et al. 2021

EEJET

View full text Add to dashboard Cite

There is a tendency of intensive development of a new scientific area aimed at optimizing the processes of comprehensive ensuring the life of society and industrial processes of countries, specifically logistics, and its more important aspect, military logistics. This paper considers typical contradictions between the need and opportunities for additional development of the theory of processes involving this system. On the one hand, the military has important, dynamic, multifaceted processes for the comprehensive provision of their combat operations to analyze, which requires significant intensification of the development of methods and models for quantitative analysis of the effectiveness of the functioning of military logistics systems. On the other hand, there is now limited availability of theoretical developments and the practical application of the necessary, convenient, effective mathematical tools aimed at computerization of solving the problems of providing military scientific and technical problems in real time. Matrix technology for forecasting the dynamics of functioning of closed systems of military logistics of various military purposes is proposed. Matrix calculus makes it possible to obtain intermediate and ultimate results in a compact form and carry out complex and cumbersome calculations using effective algorithms. A method to precisely solve the system of linear differential equations describing processes of arbitrary type has been proposed. The method is based on the use of the operational calculus by Laplace. The possibilities of the method and procedures of forecasting are illustrated by solving practical military tasks that arise during the functioning of military logistics systems of varying complexity. These tasks differ in configuration, different numbers of possible states, and state transitions

show abstract

Section: Literature Review and Problem Statementmentioning

confidence: 99%

Devising matrix technology for forecasting the dynamics in the operation of a closed military logistics system

Ugol'nikov

Diachenko

Kliat

et al. 2021

EEJET

View full text Add to dashboard Cite

show abstract

“…Away from telecommunication networks, a variety of other network problems are investigated. Ausseil et al [8] consider some military deception strategies that include falsifying targets and hiding routes on the network to deceive the attacker. Alderson, et al [9] assess the node interdiction impact on the global maritime transportation.…”

Section: Literature Reviewmentioning

confidence: 99%

Optimal k Cut-Sets in Attack/Defense Strategies on Networks

et al. 2020

View full text Add to dashboard Cite

The paper investigates the most critical k cut-sets to target in the context of attacks on networks. The targeted network fails if the attack successfully disables a full cut-set. The attack process is dynamic and targets one link at a time. We assume perfect information, so that the attacker picks the next link to target after identifying the outcome of the attack on the previous one. The attack may continue to reach up to k cut-sets. The problem is to identify which cut-sets to target (referred to as the k-critical cut-sets of the network) that maximize the probability of a successful attack. We distinguish both cases of disjoint and non-disjoint cut-sets. We develop an algorithm for each case with illustrations. We explore the large scale of networks and offer guidelines on the corresponding defensive strategies. INDEX TERMS cut-set, defense, interdiction networks, multiple-attacks, path-set.

show abstract