A strategic model for state compliance verification

The theory of directed graphs and noncooperative games is applied to the problem of verification of State compliance to international treaties on arms control, disarmament and nonproliferation of weapons of mass destruction. Hypothetical treaty violations are formulated in terms of illegal acquisition paths for the accumulation of clandestine weapons, weapons‐grade materials or some other military capability. The paths constitute the illegal strategies of a sovereign State in a two‐person inspection game played against a multi‐ or international Inspectorate charged with compliance verification. The effectiveness of existing or postulated verification measures is quantified in terms of the Inspectorate's expected utility at Nash equilibrium. A prototype software implementation of the methodology and a case study are presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 260–271, 2016     

朝核问题对中国边境安全的影响

朝核问题一直是困扰东北亚地区安全的核心问题,自20世纪90年代第一次朝核危机至今．朝核问题不但没有得到妥善解决,反而更加复杂。2006年10月9日,朝鲜宣布成功进行了地下核试验,朝鲜半岛再一次成为全球关注的焦点。在前人研究的基础上,就朝核问题产生的背景,朝核问题对中国边境地区经济、地区稳定以及生态环境等方面产生的影响进行分析和探讨。     

建筑防排烟系统存在问题及对策

结合火灾烟气蔓延扩散的客观规律和防排烟工程的实际状况,分析了建筑防排烟工程存在的几个共性问题及其危害,剖析了出现这些问题的根本原因,提出了尽快制定一部统一的《防排烟系统设计规范》、加强防排烟系统的设计、施工队伍监督管理和部件质量管理的对策。     

论部队院校学报编辑的基本素质

部队院校学报同地方高等院校学报一样,是教学和科研的理论园地,是展示该校教学和科研水平的窗口。其质量高低,直接关系到该校的学术和科研工作水平。因此,部队院校的编辑工作者,在政治修养、理论知识、专业水平、语言文字等方面要具有较深的造诣,以强烈的责任感和高度的精品意识完成编辑工作。     

消防无线通信存在问题及对策研究

介绍了我国消防无线通信在灭火救援中的重要性,重点从消防通信装备的配备、技术和管理等方面分析了消防无线通信在使用中存在的问题,并提出了解决这些问题的对策。     

当代大学生责任意识现状及其培育路径研究——基于北方民族大学的调查分析

责任意识不仅是内化的思想,也是外化的行为。其丰富内涵包括个人责任意识、家庭责任意识、社会责任意识和国家责任意识四个方面。在中国特色社会主义新时代,青年大学生生逢其时,又肩担重任。其责任意识强弱对于促进大学生成人成才、构建和谐文明家庭、达成社会主义教育目标、实现中华民族伟大复兴意义重大。根据对北方民族大学学生责任意识现状的实证调查,我们发现当前大学生责任意识状况总体上符合时代要求,但由于教育主体在大学生责任意识培育过程中不同程度、不同方面上的缺失和弱化,从而使得部分大学生责任意识状况令人忧心。因而,从系统论的角度出发,把大学生责任意识培育看作是一个长期的系统工程,从个人、家庭、学校和社会四个维度思考大学生责任意识培育的优化路径,就显得尤为必要。     

虚拟PDM环境下基于特征增长的协同设计

协同设计目前已经成为解决复杂产品设计问题的关键技术之一.在分析了现有协同设计问题的基础上,提出通过构建虚拟PDM(VPDM,Virtual PDM),应用交换特征增长数据的方法,来解决企业间异构PDM、CAD应用系统的协同设计问题.给出了虚拟PDM的定义,并介绍了基于虚拟PDM进行协同设计的基本原理.建立了基于虚拟PD...     

商贸城消防安全管理存在问题及对策

针对贵州省商贸城商业用房的消防安全管理工作现状的分析,提出以＂防火墙＂工作建设为契机,加大对商贸城商业用房的消防安全管理力度,使此项重而难的工作逐步走向良好轨道,避免出现重大火灾事故,为构建和谐社会奠定良好基础。     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

The knapsack problem with a minimum filling constraint

We study a knapsack problem with an additional minimum filling constraint, such that the total weight of selected items cannot be less than a given threshold. The problem has several applications in shipping, e‐commerce, and transportation service procurement. When the threshold equals the knapsack capacity, even finding a feasible solution to the problem is NP‐hard. Therefore, we consider the case when the ratio α of threshold to capacity is less than 1. For this case, we develop an approximation scheme that returns a feasible solution with a total profit not less than (1 ‐ ε) times the total profit of an optimal solution for any ε > 0, and with a running time polynomial in the number of items, 1/ε, and 1/(1‐α). © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013