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

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

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Coherent systems based on sequential order statistics

The sequential order statistics (SOS) are a good way to model the lifetimes of the components in a system when the failure of a component at time t affects the performance of the working components at this age t. In this article, we study properties of the lifetimes of the coherent systems obtained using SOS. Specifically, we obtain a mixture representation based on the signature of the system. This representation is used to obtain stochastic comparisons. To get these comparisons, we obtain some ordering properties for the SOS, which in this context represent the lifetimes of k‐out‐of‐n systems. In particular, we show that they are not necessarily hazard rate ordered. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

信息化条件下美军应对战场恐惧症研究

恐惧症是战争中最常见的一种心理疾病,美军采取了多种方法,如,筑牢恐惧症发生和蔓延的思想防线;建立消除恐惧症的科学训练和演习机制;重视战场卫勤支援;注重战场与战后的心理治疗等,有效应对了战场恐惧症的发生。     

Cost allocation rules for elastic single‐attribute situations

Many cooperative games, especially ones stemming from resource pooling in queueing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is described by an elastic function (which means that the per‐demand cost is non‐increasing in the total demand served). For this class of situations, we introduce and analyze several cost allocation rules: the proportional rule, the serial cost sharing rule, the benefit‐proportional rule, and various Shapley‐esque rules. We study their appeal with regard to fairness criteria such as coalitional rationality, benefit ordering, and relaxations thereof. After showing the impossibility of combining coalitional rationality and benefit ordering, we show for each of the cost allocation rules which fairness criteria it satisfies. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 271–286, 2017     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

一个新混沌系统的混沌控制与同步

针对一个新的三维自治混沌系统,研究了该系统的控制与同步现象。根据李雅普诺夫稳定性理论,运用自适应控制方法对该系统进行了混沌控制,设计了实现其同步的一个非线性控制器,运用Matlab数值仿真验证了设计的有效性。     

火炮随动系统射击试验射弹数的自动控制

针对火炮随动系统射击试验中射击时机和射弹数难于人工控制的特点 ,讨论了利用火炮随动测试系统进行自动控制的可行性 ,分析了射弹数自动控制的误差。