Mariners or Machines

Building in layers of safety and sharpening the warfighting edge does not necessarily mean using technology more, but rather using it more effectively. Deftly applied automation can buy back time and cognitive resources for operators, decreasing the chances of human error, but technology also has the potential to become less of a tool and more of a crutch if operational fundamentals and basic seafaring skills are forsaken to automation. Operators must be able to rely on their own “sea sense,” developed through experience and mentoring, and use technology to accomplish specific objectives rather than defer to automation as the default decision-maker. Maintaining the competitive warfighting edge requires cultivating skilled mariners who know how to fight a well-equipped ship; adding complexity to the system without accounting for the human element creates added risk and cutting-edge failure modes. Technology alone cannot make the ship safe, but when the operator lacks fundamental knowledge and experience, it can make the ship unsafe.

Fractional Matching Preclusion for Folded Petersen Cube Networks

Let F be an edge set and F′ a subset of edges and/or vertices of a graph G. Then F is a fractional matching preclusion(FMP) set (F′ is a fractional strong matching preclusion (FSMP) set) if G − F (G − F′) does not contain fractional perfect matching. The FMP(FSMP) number of G is the minimum size of FMP(FSMP) sets of G. The concept of matching preclusion was introduced by Brigham et al., as a measure of robustness in the event of edge failure in interconnection networks. An interconnection network of a larger MP number may be considered as more robust in the event of link failures. The problem of fractional matching preclusion is a generalization of matching preclusion. In this paper, we obtain the FMP and FSMP number for the folded Petersen cube networks. All the optimal fractional strong matching preclusion sets of these graphs are categorized.

A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The strong matching preclusion is a well-studied measure for the network invulnerability in the event of edge failure. In this paper, we obtain the strong matching preclusion number for a class of arrangement graphs and categorize their the strong matching preclusion set, which are a supplement of known results.