异步电机定子电阻的观测

介绍了一种基于神经网络技术的感应电机定子电阻观测方法;讨论了定子电阻样本规划,并设计训练形成了定子电阻神经网络观测器.试验表明,该技术方法能有效地实施定子绕组电阻在线观测.     

装甲车辆电传动系统永磁同步电机的设计与仿真

主要对电传动系统永磁同步电机进行了设计和仿真,首先对电传动和所采用永磁同步电动机进行了概述,给出了电机的基本参数要求,并在这些参数基础上对电机结构进行了初步设计,然后运用Simulink对永磁同步电机进行了建模仿真,获得了较为理想的结果。     

高射机枪有限元模型研究

建立高射机枪有限元模型的目的在于对其进行动力特性分析和求解动力响应,并作为自动武器动力学仿真的重要组成部分。针对某型高射机枪建立有限元改进模型,建模中,把枪身、托架等简化为空间梁系,下架采用三维等参元模拟,并采用主从自由度法处理了三维元与梁元的联结问题,通过与传统粱单元模型的对比分析,说明改进模型具有较好的精度。     

Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow

In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017     

关于机枪加速寿命试验的建模

通过建模的方法和试验数据对机枪加速寿命试验进行研究,探索并建立三种加速寿命试验映射模型。通过对机枪枪管参数变化与射击规范、射弹量变化关系的理论研究,为加速寿命模型的建立提供理论依据,并对所建立模型进行修正和改进。     

同步电机超瞬态电抗的线对线短路试验测量

研究了计及定子绕组电阻时三相同步电机超瞬态电抗的测定,导出了有关计算公式,并在实机上进行了试验.     

普通机床的数控化再制造技术

针对军队机床落后的状况,结合装备维修工程的新进展-再制造工程,叙述了机床数控化再制造的现状与发展趋势,回顾了数控机床的发展历史,介绍了机床数控化再制造的内容及部分再制造方法,以加快军队旧机床的升级改造。     

频率匹配准则的某型机枪自动机结构参数优化

首先分析了影响某型重机枪射击精度的影响因素,并以武器频率匹配准则为依据,以建立的机枪动力学虚拟样机模型为平台,通过灵敏度分析,找出导气孔横截面积、活塞的有效横截面积、枪机框质量、枪机质量和枪机框缓冲簧刚度等参数是影响武器射击频率的主要因素;利用序列二次规划优化方法对自动机结构参数进行优化,优化仿真结果表明,武器的射向一致性得到明显提高,这对于武器结构方案优化设计,提高武器射击精度是至关重要的。     

小子样多失效模式系统可靠性竞争模型

为解决小子样多失效模式系统可靠性模型参数的估计问题,首先应用支持向量积建立小子样条件下各故障模式的规律模型,其次利用模型将各故障模式的故障数据由小子样扩充成大样本,再次采用常规的参数估算方法估算各故障模式的分布参数,最后建立多失效模式系统的可靠性竞争模型。利用所提方法,建立了小子样条件下具有两种失效模式的柴油机汽缸套可靠性竞争模型,计算结果与大样本条件下的故障预测数据吻合度较高,说明了方法的有效性。     

Linear compound algorithms for the partitioning problem

For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S₁ and S₂ such that the sum of elements in S₁ is equal to the sum of elements in S₂. If additionally two elements (the kernels) r₁, r₂ ∈ S are given which must not be assigned to the same set S_i, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000