钢丝绳隔振器冲击特性试验研究

采用气缸式冲击模拟台对钢丝绳隔振器进行了冲击特性试验研究,介绍了试验系统及测量方法。在比较符合舰船实际冲击环境的情况下,获得了钢丝绳隔振器压缩和拉伸方向完整的特性曲线。试验结果分析表明,钢丝绳隔振器表现出明显的冲击软化现象,其冲击刚度特性小于静刚度和动刚度,而且它具有大阻尼耗能特性,是比较理想的抗冲元件。     

基于数据库的自动测试系统软件平台的设计与实现

采用基于数据库的模式构建系统软件平台,综合各种技术通过数据库控制测试过程。测试程序集的开发借鉴IVI-MSS和面向信号ATS的软件结构,利用功能接口技术实现仪器可互换性,运用模块化技术解决测试程序集的可移植性问题。实验表明:该软件平台设计合理,适用于多种装备测试与诊断系统的快速开发。     

基于虚拟样机的坦克承载零部件疲劳寿命预测方法

坦克承载零部件的疲劳失效是其主要的失效形式,疲劳寿命的预测一直是装备设计、研制、验证和使用过程中的重要问题之一。利用虚拟样机技术,建立履带车辆刚柔体耦合模型,通过在一定任务剖面下车辆虚拟试验,测试其承载零件的载荷谱,结合疲劳寿命分析技术,进行疲劳寿命预测,并给出计算实例,预测的寿命与实际使用情况相符合,表明提出的坦克承载件疲劳寿命预测方法是一种高效、实用的新方法。     

防化研究院履约十年回顾

《禁止化学武器公约》生效10周年之际,简要回顾公约生效以来防化研究院参与的履约研究、核查接待、单一小规模设施建设、指定实验室建设、日本遗弃化武处理等各个方面的履约活动,以期总结经验,展望未来。     

Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems

Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017     

Alleviating time inconsistent behaviors via a competition scheme

Under quasi‐hyperbolic discounting, the valuation of a payoff falls relatively rapidly for earlier delay periods, but then falls more slowly for longer delay periods. When the salespersons with quasi‐hyperbolic discounting consider the product sale problem, they would exert less effort than their early plan, thus resulting in losses of future profit. We propose a winner‐takes‐all competition to alleviate the above time inconsistent behaviors of the salespersons, and allow the company to maximize its revenue by choosing an optimal bonus. To evaluate the effects of the competition scheme, we define the group time inconsistency degree of the salespersons, which measures the consequence of time inconsistent behaviors, and two welfare measures, the group welfare of the salespersons and the company revenue. We show that the competition always improves the group welfare and the company revenue as long as the company chooses to run the competition in the first place. However, the effect on group time inconsistency degree is mixed. When the optimal bonus is moderate (extreme high), the competition motivates (over‐motivates) the salesperson to work hard, thus alleviates (worsens) the time inconsistent behaviors. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 357–372, 2017     

Terrorism as Method in Nepali Maoist Insurgency, 1996–2016

During the period 1996–2006, the Communist Party of Nepal (Maoist) waged overt people’s war to seize state power and institute a new order that realized the party’s understanding of ‘New Democracy’ as posited by Mao Tse-tung. Contextual shifts led to a crucial strategic turning point in September 2005, when the Maoists agreed to a united front with estranged legal parties to oust the monarchy and establish a republic. Though touted as acceptance of political reintegration, the move was tactical rather than strategic. The party had no intention of supporting a parliamentary version of democracy and thus, 2006–2016, engaged in a covert effort to seize power. Central to this effort was the paramilitary Young Communist League (YCL), the members of which responded to inflammatory party verbiage and exhortations with attacks upon rival political actors. These attacks, academically and legally, were terrorism and offered a salient illustration of intra-state unrestricted warfare. Ultimately, organizational, national, and regional circumstances caused the main Maoist movement to move decisively away from its covert approach. By that time, however, radical splinters had embraced the use of terrorism against rival political actors, creating a situation whereby local politics is yet a dangerous endeavor in certain areas and at certain times.     

What-If at Waterloo. Carl von Clausewitz’s use of historical counterfactuals in his history of the Campaign of 1815

In this article, I analyze the use of historical counterfactuals in the Campaign of 1815 by Carl von Clausewitz (1780–1831). Such is the importance of counterfactuals in this work that its gist can be given in a series of 25 counterfactuals. I claim that a central role is played by evaluative counterfactuals. This specific form of counterfactuals is part of a didactic method that allows Clausewitz to teach young officers a critical method that prepares them for the challenge of decision-making in real warfare. I conclude with the enduring relevance of Clausewitz’s use of evaluative counterfactuals for contemporary military historiography.     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.