Conjectures for framing cyberwarfare

Cyberspace has emerged as a potentially new (and unconventional) domain for warfare. Much debate has focused on understanding cyber conflict. The ability to critically analyse this phenomenon is important; however, the nascent nature of cyberwarfare and the complexity of the systems involved create challenges not met by conventional approaches. As a first step, this requires an analytical construct to frame discussions in a way that highlights distinct characteristics of the cyber domain. An approach proposed is one of the postulating conjectures for debate as a way to achieve this and to demonstrate its use, both at the strategic and operational levels. It is suggested that such an approach provides one component of a mature analytical framework for the analysis of cyber across a range of warfare domains.     

Dielectric constant predictions for energetic materials using quantum calculations

The dielectric constant (DC) is one of the key properties for detection of threat materials such as Improvised Explosive Devices (IEDs). In the present paper, the density functional theory (DFT) as well as ab-initio approaches are used to explore effective methods to predict dielectric constants of a series of 12 energetic materials (EMs) for which experimental data needed to experimentally determine the dielectric constant (refractive indices) are available. These include military grades energetic materials, nitro and peroxide compounds, and the widely used nitroglycerin. Ab-initio and DFT calculations are conducted. In order to calculate dielectric constant values of materials, potential DFT functional combined with basis sets are considered for testing. Accuracy of the calculations are compared to experimental data listed in the scientific literature, and time required for calculations are both evaluated and discussed. The best functional/basis set combinations among those tested are CAM-B3LYP and AUG-cc-pVDZm, which provide great results, with accuracy deviations below 5% when calculated results are compared to experimental data.     

Technical note: Characterization of binomial semivalues through delegation games

Semivalues are allocation rules for cooperative games that assign to each player in a given game a weighted sum of his marginal contributions to all coalitions he belongs to, where the weighting coefficients depend only on the coalition size. Binomial semivalues are a special class of semivalues whose weighting coefficients are obtained by means of a unique parameter. In particular, the Banzhaf value is a binomial semivalue. In this article, we provide an axiomatic characterization for each binomial semivalue. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Flexibility and complexity in periodic distribution problems

In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

On some stochastic inequalities involving minimum of random variables

Let X_i be independent IFR random variables and let Y_i be independent exponential random variables such that E[X_i]=E[Y_i] for all i=1, 2, ? n. Then it is well known that E[min (X_i)] ≥E[min (X_i)]. Nevertheless, for 1≤i≤n exponentially distributed X_i's and for a decreasing convex function ?(.). it is shown that .     

The many-product cargo loading problem

An algorithm, based upon dynamic programming, is developed for a class of fixed-cost cargo loading problems. The problems can be formulated as integer programming problems, but cannot be efficiently solved as such because of computational difficulties. The algorithm developed has proved to be very efficient in an actual operations research study involving over 500 different cargo items, more than 40 possible stops and several types of transportation vehicles. A numerical illustration is provided.     

The US NATO and military burden sharing: post-Cold War accomplishments and future prospects

NATO burden sharing has become an especially timely issue in the past several years as a result of a number of factors, including Russian annexation of Crimea and destabilization of eastern Ukraine in 2014. This article argues that alliance unity among the great democracies of Europe and North America is indispensable to peace and stability on the Eurasian continent. A fractured NATO, and especially, a large divide in purposes or commitments as between the United States and its European security partners, invites aggression and the possibility of inadvertent escalation. Past successes and failures in US-involved multinational peace and stability operations, within and outside of Europe, show that mission accomplishment requires give and take, including the occasional acceptance of unequal costs and benefits among the members, in order to achieve peace and security objectives.     

Cost allocation and communication

This article considers a special class of cost allocation problems, where the communication possibilities among the agents are restricted. Integral formulas are derived for two allocation rules: The Myerson value and the position value. © 1993 John Wiley & Sons, Inc.