磨合预处理对有机钼添加剂摩擦学性能的影响

采用MMW-1万能摩擦磨损试验机,考察了磨合预处理工况(时间、载荷)对两种有机钼添加剂在CF-4 15W-40柴油机油中抗磨减摩性能的影响。采用扫描电子显微镜和能谱仪分析了磨斑表面形貌和表面元素组成。结果表明,适当的磨合预处理可有效增强有机钼添加剂在柴油机油中的抗磨减摩性能,且经过磨合预处理的磨斑表面形貌较没有处理时平整,添加剂主要功能元素在摩擦表面的质量分数增加。     

一种改进的跳频信号频率估计算法

信号的信噪比较低时,旋转不变信号参数估计技术（Estimated Signal Parametersvia Rotational Invariance Technique,ESPRIT）算法的频率估计性能明显下降,针对这一问题,提出了一种基于ESPRIT的改进算法。该改进算法在基于ESPRIT的噪声抑制（Noise Suppressed based on ESPRIT,NS—ESPRIT）算法的基础上,利用DFT谱中的,个局部最大值点,缩小基于互相关矩阵迹模值曲线的ESPRIT算法中口的选择区域,在降低计算复杂度的同时,也有效地减弱了噪声对信号频率估计的影响。理论分析和仿真结果证明了该改进算法的可行性和有效性。     

基于STAGE平台的模型扩展方法

STAGE(Scenario Toolkit And Generation Environment)是用于开发想定战场环境和武器系统验证的仿真软件。用户可根据需求利用自己开发的仿真模型取代STAGE的内置仿真模型,也可以将开发的仿真模型与STAGE中现有模型进行集成。针对STAGE 6.0仿真开发平台,研究了STAGE模型扩展中的关键技术,实现了用户开发模型与STAGE仿真引擎的集成,从而为快速构建用户自定义战场环境提供了一种新途径。     

Modeling the operation of multireservoir systems using decomposition and stochastic dynamic programming

Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

巡航导弹强弱点分析及防御方法

巡航导弹具有突防能力强、命中精度高、灵活性强、技术上易于实现和造价低等优点而备受各个国家重视,已经发展成为现代战争的重要武器,是上世纪90年代以后的主要空中作战目标之一.对巡航导弹的强点与弱点进行了分析,并研究了防御巡航导弹的可行方法.     

结构振动系统的模态解耦控制

基于特征结构配置的参数化结果,给出了实现结构振动系统模态解耦的充要条件,导出了期望的反馈增益阵及闭环特征向量矩阵的全体参数化表示。该方法在实现模态解耦的同时,还提供了全部自由度,可用来实现系统设计中某些性能要求。该方法直接基于原系统的参数矩阵,便于工程应用。三级质量弹簧系统的实例表明该方法有效。     

Inference for the maximum cell probability under multinomial sampling

This article investigates inference for p_max, the largest cell probability in multinomial trials for the case of a small to moderate number of trials. Emphasis focuses on point and interval estimation. Both frequentist and Bayesian approaches are developed. The results of extensive simulation investigation are included as well as the analysis of a set of crime data for the city of New Orleans taken from the National Crime Survey.     

Primal dual algorithms for the vehicle refueling problem

Mehrez, Stern, and Ronen have defined a vehicle refueling problem in which a fleet of vehicles travels on a round-trip, self-contained mission from a common origin, with the objective of maximizing the operational range of the fleet. They have defined a “pure refueling chain” strategy for transferring fuel between vehicles in the fleet, and have solved the problem in the special cases when all vehicles have the same fuel capacity or consumption rate. In this article we present algorithms for the general case, where vehicles have different capacities and consumption rates. Our approach is based on a new primal dual formulation of the problem. The exact algorithm was effective to find the optimal solution for a fleet size n ⩽13. For larger fleets, we present an approximation version of it, which very quickly found a solution within 1% of the maximum possible range for arbitrarily large (up to n = 200) fleets. We also show that a small number of the best vehicles can always reach almost the same range as a large fleet. © 1992 John Wiley & Sons, Inc.     

Optimal replacement rules based on different information levels

We consider the following replacement model in reliability theory. A technical system with random lifetime is replaced upon failure. Preventive replacements can be carried out before failure. The time for such a replacement depends on the observation of a random state parameter and is therefore in general a random time. Different costs for preventive and failure replacements are introduced which may depend on the age of the working system. The optimization criterion followed here to find an optimal replacement time is to minimize the total expected discounted costs. The optimal replacement policy depends on the observation of the state of the system. Results of the theory of stochastic processes are used to obtain the optimal strategy for different information levels. Several examples based on a two-component parallel system with possibly dependent component lifetimes show how the optimal replacement policy depends on the different information levels and on the degree of dependence of the components. © 1992 John Wiley & Sons, Inc.     

Parallel machine replacement

We consider the parallel replacement problem in which there are both fixed and variable costs associated with replacing machines. Increasing maintenance costs motivate replacements, and the fixed replacement cost provides incentive for replacing machines of different ages together in “clusters.” We prove two intuitive results for this problem. First, it is never optimal to split a cluster of like-aged machines, and second, it is never optimal to replace newer clusters before older clusters. By incorporating these two results into an algorithmic approach, we vastly reduce the amount of computation required to identify an optimal replacement policy.