Holmes’ front: constructing a new face of battle for America’s Civil War

ABSTRACT

In his seminal study of the changing nature of warfare between Agincourt and the Somme, military historian John Keegan proposed that future historians might consider combatants’ emotions in their assessments of the impact and nature of conflict. Recent years have witnessed the emergence of the history of emotions as an analytical approach, but rarely, if ever, is this directed toward the study of military history, far less the history of insurgencies and counter-insurgencies. This paper examines America’s civil war (1861–1865) as a case study of the ways in which an emotional history approach might illuminate not the physical experiences of but rather the immediate and longer-term reactions to counter-insurgency conflict through a focus on one specific individual, the future Supreme Court Justice Oliver Wendell Holmes, Jr. It proposes that Holmes, whilst not a man of the ranks, nevertheless can reveal the wider ramifications of civil war and its emotional impact, both individually and culturally. As a relatively limited internecine war, one not fought by professional armies but by volunteer forces, America’s civil war highlights the ways in which the soldier’s response points us toward the kind of emotional revolution that has, to date, mainly been located within the European nations.     

通用装备机械液压系统综合检测试验平台数据库设计

在分析通用装备机械液压系统综合检测试验平台数据管理特殊需求的基础上,针对检测试验前后产生的数据种类多、数据量大、不便于集中统一存储的问题,运用以数据为中心的数据库设计思想,以稳定的数据结构实现了装甲、军械、工兵、防化、车辆、船艇等6个专业结构化与非结构数据的统一存储,较好地解决了系统数据的集中管理问题。     

信息中心网络缓存节点位置选择算法

信息中心网络（Information-Centric Networking, ICN）“泛在缓存”的特性，引发数据副本率过高、缓存空间不能充分利用等问题。为了解决上述问题，分别从用户、服务提供商和网络运营商的角度出发，以最小化网络流量与网络费用开销为优化目标建立两个单目标优化模型，并将二者结合为帕累托模型；基于帕累托求解方法中数学规划法的思想，详细描述缓存节点位置选择算法。仿真结果表明：在流量性价比方面，所提缓存节点选择算法优于ICN的默认缓存机制；在网络费用开销方面，所提算法更适用于只有少数内容较为流行的网络中，而在所有内容都流行的情况下，ICN中默认的“遍地缓存”机制更为适宜。     

爆炸逻辑间隙零门实验研究

为了可靠实现爆炸逻辑间隙零门的原理功能,提出并验证了一种基于精细RDX和含能胶合剂的传爆药方案.通过实验探索了基于该传爆药的爆炸零门适用的间隙宽度范围,并设计了一种小尺寸爆炸逻辑间隙零门,为爆炸逻辑网络设计提供参考.     

基于统计加权的单传感器数据融合算法

单传感器数据融合是十分重要的实际问题。为了提高数据处理的敏感性和精度,在研究基于关系矩阵的数据融合方法的基础上,提出了基于统计加权的数据融合方法,并对两种方法进行了对比分析。实例仿真表明,基于统计加权的数据融合方法优于基于关系矩阵的数据融合方法,该方法能减小无效测量值的范围,并且对测量值的变化更敏感。     

战场损伤快速评估系统数据库研究

从装备战场损伤快速评估需求出发 ,探讨了通用战场损伤快速评估系统的功能及其构成 ,并重点对其中数据库系统的设计与开发进行了详细讨论 ,在此基础上开发了通用装备战场损伤快速评估数据库系统     

基于故障树的导航装备故障诊断专家系统研究

针对导航装备比较常见的故障诊断方法，提出了基于故障树的通用故障诊断的概念．为使故障诊断专家系统具有通用性，在分析故障树流程图特点的基础上，提出了逻辑关系的数字编码和故障诊断数据库的思想，设计了对导航装备故障诊断专家系统具有通用性的系统软件及数据库．     

Natural gas storage valuation and optimization: A real options application

In this article, we present an algorithm for the valuation and optimal operation of natural gas storage facilities. Real options theory is used to derive nonlinear partial‐integro‐differential equations (PIDEs), the solution of which give both valuation and optimal operating strategies for these facilities. The equations are designed to incorporate a wide class of spot price models that can exhibit the same time‐dependent, mean‐reverting dynamics, and price spikes as those observed in most energy markets. Particular attention is paid to the operational characteristics of real storage units. These characteristics include working gas capacities, variable deliverability and injection rates, and cycling limitations. We illustrate the model with a numerical example of a salt cavern storage facility that clearly shows how a gas storage facility is like a financial straddle with both put and call properties. Depending on the amount of gas in storage the relative influence of the put and call components vary. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Robust shortest path planning and semicontractive dynamic programming

In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit‐evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and uniqueness of solution of the optimality equation, existence of optimal paths, and the validity of various algorithms patterned after the classical methods of value and policy iteration, as well as a Dijkstra‐like algorithm for problems with nonnegative arc lengths.© 2016 Wiley Periodicals, Inc. Naval Research Logistics 66:15–37, 2019