中国机器人产业持续发展的制约因素及措施

中国机器人企业由于研发力量薄弱,缺乏核心技术,高端人才匮乏,产品成本高昂,加之没有政策引领,没能形成规模化应用,所占市场份额不足10%。文章探讨如何破解中国机器人产业现存问题并寻求针对性解决措施。     

高炮群火力优化分配的指派模型

火力优化分配是高炮群指挥控制的关键环节。依据有严格理论证明和实用价值的指派问题及其解法(匈牙利法),构建了一对一射击和多对一射击情形下的高炮群火力优化分配的指派模型,探讨了该模型的求解,分析了该模型的实际应用,并通过具体实例对该模型进行了初步验证。该模型的解法被证明是多项式时间算法,满足作战实时性要求。实际应用表明该模型用于解决高炮群的火力分配问题是有效的。     

Discrete equal‐capacity p‐median problem

This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000.     

Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support

We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016     

Global planning of accelerated degradation tests based on exponential dispersion degradation models

The accelerated degradation test (ADT) is an efficient tool for assessing the lifetime information of highly reliable products. However, conducting an ADT is very expensive. Therefore, how to conduct a cost-constrained ADT plan is a great challenging issue for reliability analysts. By taking the experimental cost into consideration, this paper proposes a semi-analytical procedure to determine the total sample size, testing stress levels, the measurement frequencies, and the number of measurements (within a degradation path) globally under a class of exponential dispersion degradation models. The proposed method is also extended to determine the global planning of a three-level compromise plan. The advantage of the proposed method not only provides better design insights for conducting an ADT plan, but also provides an efficient algorithm to obtain a cost-constrained ADT plan, compared with conventional optimal plans by grid search algorithms.     

打击特殊群体贩毒活动现状及对策研究

近年来，随着我国堵截、打击毒品犯罪力度的持续加大，境内外贩毒集团组织实施大宗毒品贩运的能力明显减弱，毒品犯罪快速蔓延的势头得到初步遏制。但是，贩毒集团为逃避打击、降低风险，不断变换犯罪手法，钻法律漏洞，特别是组织、利用特殊人群进行贩毒活动的现象日益增多，并呈现出家族化、规模化的趋势，而公安机关在打击特殊群体贩毒活动中，由于立法和执法等多方面的原因，还面临法律、查缉、羁押、案件处理等一系列的问题。执法实践要求运用法律、经济、行政、教育、文化等措施，综合治理特殊群体贩毒问题，努力从源头上遏制特殊人群贩毒问题的滋生、蔓延。     

建筑消防水系统工程施工存在的问题及建议

针对近年来对一些建筑消防设施水系统工程的中期检查和工程消防验收．以及对投入使用后的建筑进行消防监督检查中发现的建筑消防设施水系统工程存在的一些施工质量问题，在依据有关消防技术性规范的基础上，查找根源，提出几点建议。     

面向多平台多目标协同跟踪的指派问题

针对多平台多目标协同跟踪中要求多个无人地面平台尽可能均匀地协同跟踪多个目标的特点,提出了改进的离散粒子群优化算法。首先采用连续型粒子群优化算法中的速度和位置迭代公式,然后对粒子位置进行离散编码,使粒子编码对应于可行的指派方案;其次,在优化算法中引入局部搜索,提高算法寻优性能。最后将所提算法应用于多平台多目标协同跟踪中的指派问题,并与未加入局部搜索的粒子群优化算法比较,仿真结果表明,加入局部搜索后的离散粒子群优化算法具有较好的寻优性能。     

武警学院研究生教育回顾与发展问题思考

武警学院研究生教育已开办六年,分析六年来研究生教育的基本情况、取得的成绩和存在的问题,对于今后一个时期的研究生教育具有现实指导作用。     

汶川地震灾后重建住房规划环境制约因素及对策

汶川特大地震发生，四川省共有153个县（市、区）不同程度受灾，全省灾区需完成城乡住房重建49131．22万m^2（445．4万套），重建城乡住房规划受到资源、环境的制约。通过对其制约因素分析，提出了对环境保护、资源保护有针对性的措施和对策，并对住房选址和建设生态人居环境提出了建议，有利于灾后重建城乡住房规划向建设生态人居环境方向发展。