基于随机脉宽调制技术的感应电机矢量控制系统研究

随机脉宽调制技术可以使逆变器输出电压的谐波成分均匀地分布在一个较宽的频率范围内,达到抑制噪声和机械振动的目的.把随机脉宽调制技术引入感应电机矢量控制系统中,保证了调速系统的高性能,同时也降低了电机的有色噪声和机械振动.     

A robust policy for serial agile production systems

One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A note on combined job selection and sequencing problems

We investigate the solvability of two single‐machine scheduling problems when the objective is to identify among all job subsets with cardinality k,1≤k≤n, the one that has the minimum objective function value. For the single‐machine minimum maximum lateness problem, we conclude that the problem is solvable in O(n²) time using the proposed REMOVE algorithm. This algorithm can also be used as an alternative to Moore's algorithm to solve the minimum number of tardy jobs problem by actually solving the hierarchical problem in which the objective is to minimize the maximum lateness subject to the minimum number of tardy jobs. We then show that the REMOVE algorithm cannot be used to solve the general case of the single‐machine total‐weighted completion time problem; we derive sufficient conditions among the job parameters so that the total weighted completion time problem becomes solvable in O(n²) time. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 449–453, 2013     

通用装备保障训练集约化建设模式研究

着眼于提高通用装备保障训练的集约化水平,为信息化条件下体系作战通用装备保障能力生成提供支持,将平台的方法引入通用装备保障训练中,提出了通用装备保障专业综合训练平台的思想,建立了一个4层结构的通用装备保障基地化训练体系框架,并以某装备院校为例构设了一个通用装备（军械）保障专业综合训练平台框架．研究成果为实现通用装备保障训练资源的集约化整合探索了新的途径．     

基于业务过程的装备保障训练业务知识管理

提出装备保障训练业务知识管理研究的构想。从知识的角度,分析了装备保障训练的知识传授和保障能力生成的本质,阐述了装备保障训练业务知识管理的必要性和内涵;从训练业务过程、知识管理过程、支撑体系3个维度构建了装备保障训练业务知识管理框架,提出基于业务过程的装备保障训练业务知识体系构建方法,分析了装备保障训练业务知识管理的主要活动,为装备保障训练业务知识管理提供了基本的理论和方法指导。     

任务驱动的装备保障能力建模与仿真评价

对装备保障能力评价的研究有很多,但这些研究大都是从保障系统方面对保障能力进行了评价,属于静态评价,这类研究对装备使用过程中的动态随机因素考虑不足,影响了对装备保障能力的全面考察.以任务为驱动的保障能力评价,运用离散事件建模方法和计算机建模与仿真技术建立舰炮保障能力综合仿真模型,用仿真出的使用可用度、战备完好率和备件平均...     

核心维修能力的概念分析

从美军核心维修能力的定义着手,对我军核心维修能力进行定义与分析,深入阐述了核心竞争力、基地级核心维修能力等4个核心维修能力的相关概念,将核心维修能力的主要属性归纳为必需性、完整性、层次性、动态性,并对各个属性进行分析,对我军核心维修能力的确定以及建设具有重要意义。     

舰艇编队保障性指标的分解方法

针对目前保障性分配仅限于单船的问题,借鉴基本可靠度的分配思想,通过对舰艇编队使用可用度与单船使用可用度关系的分析,建立了舰艇编队保障性指标分解模型,并采用多因子评分系数分配法来确定舰艇编队保障性指标的权重。最后,通过实例给出了具体分解操作步骤,证明了该模型的正确性和有效性。分解结果可优化舰艇编队的编成,为编队里同型单船保障性指标的确定提供修正,同时为完善舰艇编队的综合保障工程提供参考。     

基于神经网络的绕组电流闭环控制方法

在解决闭环消磁绕组电流优化计算问题时,会面临将外部磁场推算误差带入电流反演计算或完备的基函数难以确定等问题。为了降低这些因素对舰船最终补偿效果的影响,从智能优化的角度出发,在讨论散布常数对模型预测误差的影响后,确定了适宜的散布常数,建立了内部磁场与补偿电流之间的径向基函数神经网络预报模型。该方法通过样本对网络进行训练,无须推算内外磁场,就能直接得到使绕组磁场与目标磁场拟合误差最小的补偿电流向量。对比其他数值建模方法,其换算精度有所提高,且选择不同的同维向量作为基函数对补偿结果影响较小。船模实验验证了该方法的有效性。     

A note on the optimality of index priority rules for search and sequencing problems

We show that the linear objective function of a search problem can be generalized to a power function and/or a logarithmic function and still be minimized by an index priority rule. We prove our result by solving the differential equation resulting from the required invariance condition, therefore, we also prove that any other generalization of this linear objective function will not lead to an index priority rule. We also demonstrate the full equivalence between two related search problems in the sense that a solution to either one can be used to solve the other one and vice versa. Finally, we show that the linear function is the only function leading to an index priority rule for the single‐machine makespan minimization problem with deteriorating jobs and an additive job deterioration function. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011