商务印书馆函授学校英文科学员来源地考察——基于《英语周刊》(1921-1922)记载的分析

商务印书馆函授学校英文科在中国近现代成人教育史、职业教育史上都占据着非常重要的位置.1921年至1922年期间的《英语周刊》对英文科学员来源地等信息均有着较为详细的记载,弥补了已发现的相关史料的不足,从而可以对其办学效果做出一个客观、精确的评价.通过《英语周刊》的相关记载,可以发现英文科学员来源地范围覆盖区域非常广泛,其学员来源地构成状况呈现出了多元化、多样化的特点.仅仅从学员来源地状况的角度去审视、考察,商务函授学校英文科取得了显著的办学效果,它在一定程度上弥补了普通学校教育资源的不足,有力促进了中国教育近代化事业的发展.     

基于 DoDAF 电子对抗训练导控系统体系结构设计

电子对抗训练导控系统是集电子对抗部队训练导调、指挥、控制、裁决、评估和管理等功能需求于一体的综合性军事信息系统。依据美国防部体系结构框架标准规范,结合电子对抗训练需求,按照结构化的设计方法,对电子对抗训练导控系统体系结构进行了初步设计,包括系统功能定位、指挥关系、指挥流程和接口关系等,希望为系统建设提供参考借鉴。     

相依网络研究综述

网络相依性和相依网络研究已经成为近年来复杂网络领域的热点,但是目前对相关研究进展进行综合归纳的文献却不多见。在对国内外相关文献进行系统分析的基础上,简要介绍相依网络研究涉及的渗流理论;描述该类型网络的级联失效过程;从相依网络的子网络特性、相依边的方向和类型、子网络组合方式等三个角度对相依网络鲁棒性的研究成果进行总结;并从理论和应用两方面对未来相依网络研究的发展方向进行展望。     

基于模糊层次分析法的高层建筑火灾风险评估

火灾风险评估是降低火灾损失的有效方法。利用模糊层次分析法,建立了高层建筑火灾风险评估体系,并应用于具体高层建筑的火灾风险评估中。评估结果与实际情况取得了较好的一致性,从而为高层建筑火灾风险评估提供了一种简便可行的方法。     

基于转业回报视角的我军高素质人力资本流失分析

从微观主体人力资源投资的角度来理解军队高素质人力资源的流失现象,以人力资本投资理论、经济学成本一效益理论和激励相容理论为基础,在Mincer工资方程的基础上建立转业回报方程,通过计算教育回报率和转业回报率来解释我军高素质人才缺失、高素质人才留不住的现况。为从实证角度分析转业回报率和教育回报率,提出相应的政策建议奠定了理论基础。     

数字阵列雷达宽带快速跳频源设计

介绍了一种基于直接数字合成技术(DDS)与直接频率合成(DS)相结合的数字阵列雷达T/R组件设计,其主要核心思想就是运用DDS技术中的相位控制功能代替传统高频移相器,并且运用其幅度控制功能代替传统的数控衰减器,从而实现阵列雷达发射信号的数字波束形成;并且设计出高稳定度的800 MHz高频源作为输入参考,利用DDS技术实现宽带下快速跳频;输出端采用DS方法,保证得到所需频带低相噪特性。     

Nonperiodic preventive maintenance for repairable systems

As a complex system with multiple components usually deteriorates with age, preventive maintenance (PM) is often performed to keep the system functioning in a good state to prolong its effective age. In this study, a nonhomogeneous Poisson process with a power law failure intensity is used to describe the deterioration of a repairable system, and the optimal nonperiodic PM schedule can be determined to minimize the expected total cost per unit time. However, since the determination of such optimal PM policies may involve numerous uncertainties, which typically make the analyses difficult to perform because of the scarcity of data, a Bayesian decision model, which utilizes all available information effectively, is also proposed for determining the optimal PM strategies. A numerical example with a real failure data set is used to illustrate the effectiveness of the proposed approach. The results show that the optimal schedules derived by Bayesian approach are relatively more conservative than that for non‐Bayesian approach because of the uncertainty of the intensity function, and if the intensity function are updated using the collected data set, which indicates more severe deterioration than the prior belief, replacing the entire system instead of frequent PM activities before serious deterioration is suggested. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

坦克炮控系统非线性特性及自适应补偿控制

影响坦克炮控系统低速性能主要有两个方面的因素,摩擦非线性和齿隙非线性。建立了坦克炮控系统数学模型,介绍了坦克炮控系统中摩擦、齿隙两类重要非线性模型,分析了摩擦、齿隙对炮控系统性能的影响,以及摩擦非线性环节导致系统低速时的爬行现象、速度过零时的平顶现象;齿隙非线性环节造成系统输出误差外,系统会因极限环振荡或冲击而降低性能,甚至不稳定,总结了炮控系统中针对摩擦、齿隙等非线性环节的自适应补偿控制的研究成果。