弹药装填机器人自适应PD控制算法

针对弹药装填机器人取弹后自身质量改变较大,运转时会受到质量变化和复杂车内环境共同作用,容易产生运动位移误差现象,采用一种基于重力改进的自适应PD控制算法,实现了弹药装填机器人实际运动轨迹与预定轨迹的快速跟踪要求,并通过Matlab-Simulink进行了仿真验证,得到了较好的控制效果。     

基于复杂网络理论的军事力量部署研究

运用复杂网络理论,将军事力量部署进行网络拓扑化,通过分析计算网络关键节点的组成来研究军事力量在空间部署的合理性。在定义了军事力量部署网络拓扑化后的关键节点概念的基础上,提出了基于网络节点度和介数综合数学模型来评价网络节点关键度量值数学模型及基本算法流程,并运用案例进行了计算分析。     

军事文化:一个范式的转换(节选)

本篇译稿节选了美国空军中校卡伦·O·杜尼文《军事文化——一个范式的转换?》一书的部分内容,作者考察了美国军事文化中的社会性变化,探究了美国军事文化中一种介于军事的传统与非传统之间的,介于男性战士为主的范式或信仰体系和以平等主义与兼容并蓄为特征的充满矛盾的进化军事文化模式之间的斗争。这是一场旧思想和新思想之间的竞赛。译者选编了作者战斗部队中的女性(战争中的女性)这一典型案例来阐述美国军事文化中范式与模式之间的差异。杜尼文中校在本书中还考察了美国军事文化中存在的长期冲突,她建议美国军方现在开始需再一次进行文化范式的转换———从传统的以男性士兵为主的排他性价值观向一种兼容并蓄的从军观念转变。作者强调美国军方必须在其发展过程中,削减其分离主义和排外性的倾向。她提出实施这一范式转换的三个对策(战略部署):改变军方的占主导地位的关于“战斗着的,充满阳刚之气”的具有排他性而非包容性的标准和想法;主动接受并控制正在持续的主要的社会性变化;同时接受与个人和组织对范式转换的职责。范式转换的先驱们必须特别地推崇一种兼容并蓄与平等主义的文化。杜尼文中校也强调了美国高级军事将领是产生美国军事范式转换的最佳催化剂———他们是真正的先驱,他们能够使兼容并蓄的文化范式制度化。杜尼文中校提出如下结论:如果美国希望其军方成为美国社会的一面镜子,无疑要接受一种兼容并蓄的文化范式。     

Capacity allocation with traditional and Internet channels

In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

The Banzhaf value and communication situations

Myerson 3 and 4 proposed and characterized a modification of the Shapley value in the context of communication situations. In this paper we propose several characterizations of the extension of the Banzhaf value proposed by Owen 7 to communication situations. In particular we characterize this value with the properties of fairness, isolation, and pairwise merging. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures

In this paper, we study the problem of scheduling quay cranes (QCs) at container terminals where incoming vessels have different ready times. The objective is to minimize the maximum relative tardiness of vessel departures. The problem can be formulated as a mixed integer linear programming (MILP) model of large size that is difficult to solve directly. We propose a heuristic decomposition approach to breakdown the problem into two smaller, linked models, the vessel‐level and the berth‐level models. With the same berth‐level model, two heuristic methods are developed using different vessel‐level models. Computational experiments show that the proposed approach is effective and efficient. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

图像辅助智能终端定位的国内外研究进展

图像含有丰富的目标信息,被获取并处理后用于一种新型的智能终端定位手段。对图像定位的相关概念进行介绍,对关键技术的研究情况进行评述,并分别从图像定位作为独立的定位系统和图像定位与全球导航卫星系统(Global Navigation Satellite System,GNSS)及惯性导航系统(Inertial Navigation System,INS)等其他定位方法融合的定位系统2个方面阐述其研究进展,在此基础上提出图像辅助智能终端定位研究中存在的问题及发展方向。     

Bullwhip and reverse bullwhip effects under the rationing game

When an unreliable supplier serves multiple retailers, the retailers may compete with each other by inflating their order quantities in order to obtain their desired allocation from the supplier, a behavior known as the rationing game. We introduce capacity information sharing and a capacity reservation mechanism in the rationing game and show that a Nash equilibrium always exists. Moreover, we provide conditions guaranteeing the existence of the reverse bullwhip effect upstream, a consequence of the disruption caused by the supplier. In contrast, we also provide conditions under which the bullwhip effect does not exist. In addition, we show that a smaller unit reservation payment leads to more bullwhip and reverse bullwhip effects, while a large unit underage cost results in a more severe bullwhip effect. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 203–216, 2017     

Performance analysis of the cultural and creative industry: a network‐based approach

The cultural and creative industries (CCIs) in Taiwan have gradually contributed to the national economy under the impetus of government policies. We employ a two‐stage data envelopment analysis model with an additive efficiency decomposition approach to measure the profitability and marketability of 22 Taiwanese cultural and creative companies. Furthermore, we employ the network‐based ranking approach to identify benchmark inputs/outputs, and the strengths and weakness of each company. Our empirical results show that the profitability of the cultural and creative companies is better than their marketability. Companies in the industries of publishing, creative life, popular music, and cultural content averagely perform better than those in the other three types of CCIs in terms of profitability. Companies in the creative life industry are on average more efficient than those in the other five types of CCIs in terms of marketability. The profitability/marketability matrix of cultural and creative companies is also presented.     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.