双桨船左右主机工况不一致的危害分析

本文定量地分析了从多台主机为动力的舰船左右主机转速不一致时,对主机寿命与舰船性能造成的危害,并提出了改进措施和舰船实用中的注意事项。     

Order-preserving allocation of jobs to two machines

In this paper, we consider the problem of minimizing the mean flow time of jobs to be processed on two machines. The jobs have a predetermined order, perhaps reflecting the order of arrival, and each job has a known processing time. We wish to assign the jobs to machines so as to minimize the mean flow time, with the constraint that the original order must be preserved within the subset of jobs assigned to each machine. An efficient algorithm based on dynamic programming is developed.     

Toward optimal bidding strategies

In this paper we investigate a form of rational behavior in response to an oligopoly pricing problem where only one buyer is involved. We investigate the problem from the standpoint of the seller who wants to maximize his gain from the transaction. In particular, we deal with the problem of one seller's response to an invitation to submit a sealed (i. e., noncooperative) bid to a government or other dominant purchasing agency for supplying a specified bundle of goods and services for which either (1) no other demand exists, or (2) the terms or quantities involved cannot, at least in the short run, be obtained from another source. Although treated from a normative standpoint, i. e., what bid the supplier should make, the paper also has implications for the buyer's behavior and oligopoly-monopsony pricing in a more general sense.     

Determining the most vital link in a flow network

The most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered.     

基于蚁群算法的航空弹药需求测算

智能化是现代航空弹药需求与指挥控制系统的发展趋势,如何进行合理快速地调拨航空弹药是系统设计过程中的关键任务之一。为此,提出了依据目标对航空弹药进行选择的策略,利用蚁群算法对战斗目标进行聚类分析,对各类目标进行模糊综合评判,从而确定装备出动方案,依据弹药与装备的关系,对满足既定保障度的弹药需求量建立模型,并计算出满足既定保障度的弹药供应量,为战前对战场态势预估,实现弹药战时及时准确调拨,为作战弹药准备提供依据。     

基于排队论的维修资源需求分析方法

以装备维修过程为基础,应用排队论分析维修过程中各维修活动的基本关系,考虑多维修活动对维修资源需求的冲突问题,建立了维修过程的排队模型。以损伤装备平均修复时间不大于给定值为约束条件,以投入的维修资源总成本最少为目标,求解出维修资源需求。     

基于分块的伪Zernike矩归一化的人脸识别方法

以改进的伪Zemike矩相关知识为背景,提出了一种新颖的人脸识别方法。该方法通过将人脸分块,降低了光照条件、人脸表情等外在因素对人脸识别的影响。首先将人脸图像分块并重组矩阵的行和列,然后计算重组后人脸图像的伪Zemike矩,并对其进行归一化处理,最后采用最小邻近分类器进行判别。实验结果表明,该方法对于人脸光照、姿态和表情变化均具有良好的鲁棒性。在前人的研究基础上,进一步探讨了伪Zemike矩在人脸识别方面的应用。     

武警院校开设野外拓展课程探讨

对武警院校开展野外拓展课程的现状进行了深入细致地调查研究,归纳总结了野外拓展的概念和理论。对野外拓展在武警院校教学中的功能作用进行了探讨分析,并将野外拓展课程的开设和学员综合素质的培养有机结合起来,从理论和实证的基础上剖析了野外拓展对提高学员综合素质的作用。     

Restricted planar location problems and applications

Facility location problems in the plane are among the most widely used tools of Mathematical Programming in modeling real-world problems. In many of these problems restrictions have to be considered which correspond to regions in which a placement of new locations is forbidden. We consider center and median problems where the forbidden set is a union of pairwise disjoint convex sets. As applications we discuss the assembly of printed circuit boards, obnoxious facility location and the location of emergency facilities. © 1995 John Wiley & Sons, Inc.