气隙磁密3次谐波对电机振动噪声的影响

针对电机的电磁振动噪声问题,发现了提高电机气隙磁密的正弦性不一定能够降低电机的振动噪声。鉴于此,分析了引起电机振动和噪声的主要力波阶次和频率,并探究了气隙磁密3次谐波与电机振动噪声的具体函数关系。为了分析引起电机振动和噪声的主要力波阶次和频率,在利用解析法的基础上排出力波表,确定了主要噪声源。为了探究气隙磁密3次谐波对电机振动噪声的影响,建立了气隙磁密及径向力波的数学模型,并通过遗传算法求解了电机气隙磁密3次谐波的最佳幅值。分析结果显示,提高气隙磁密正弦性不一定能够降低电机振动噪声,气隙磁密3次谐波在一定范围内存在最优值使得电机振动噪声最小。分析结果为低噪声电机的设计提供了参考依据。     

一种新的并行多通道数据采集系统时序偏差校正技术

介绍了多通道并行采样技术在高速数据采集系统的应用和其局限性 ,然后给出了一种测量多通道系统各通道间时序偏差的方法 ;接着提出了一种在数字域校正通道间时序偏差的新方法 ,可以大大提高多通道并行采样技术的性能 ;最后对该方法进行了仿真以验证其可行性和性能。     

卡尔曼滤波的心动阵列实现研究

基于Faddeeva算法可以实现各种矩阵运算 ,并且可以方便地映射到心动阵列结构上这一事实 ,提出了一种基于Faddeeva算法的卡尔曼滤波心动阵列实现方法 ,并在此基础上设计了两种处理器拓扑结构。分析结果表明 ,这两种处理器结构具有效率高、规整性好和易于扩展等特点。     

多目标广义指派问题的模糊匈牙利算法求解

提出和讨论了两类多目标的广义指派决策问题,分别给出了它们的多目标整数线性规划数学模型,并结合模糊理论与解决传统指派问题的匈牙利方法提出了一种新的求解算法:模糊匈牙利法.最后给出了一个数值例子.     

应用交互多模(IMM)算法跟踪低空目标

雷达跟踪低空目标时,由于多路径传播的影响,目标俯仰角的测量会出现测量误差.并且由多路径传播引起的测量噪声方差较大,在时间上具有相关性.应用交互多模(IMM)算法来提高跟踪低空目标的性能,并且提出了一种去相关的滤波方法来克服多径误差相关性的影响,最后给出了计算机仿真的滤波结果.     

网络图式通用装备保障文书生成的研究

网络图式军用文书是战时通用装备保障文书中通常采用的文书形式之一,给出装备保障文书辅助生成系统的总体结构,将网络分析方法引入通用装备保障文书辅助生成系统的研究,在此基础上阐述了网络图式文书生成子系统的功能、数学模型及网络计算、网络优化的部分算法。     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于聚类算法的多无人机系统任务分配

针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...     

Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Probabilistic solution and bounds for serial inventory systems with discounted and average costs

We consider the infinite horizon serial inventory system with both average cost and discounted cost criteria. The optimal echelon base‐stock levels are obtained in terms of only probability distributions of leadtime demands. This analysis yields a novel approach for developing bounds and heuristics for optimal inventory control polices. In addition to deriving the known bounds in literature, we develop several new upper bounds for both average cost and discounted cost models. Numerical studies show that the bounds and heuristic are very close to optimal.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007