一种评价机器磨损和润滑油质量的新方法

提出用表征大型机械系统健康状态的相对劣化度作为监控机械磨损状态和油品质量变化的综合判断指标，以便结合反映机器工作状态的其它因素，共同评定机器的健康状态。以柴油机为例，对监测得到的柴油机润滑油的铁谱参数、磨损金属元素含量和油品理化性能等数据进行综合分析和处理，所得相对劣化度的变化趋势，较准确地反映了柴油机的工作状况。该方法不仅简单实用，而且便于将油液监测技术与其他监测技术（如振动诊断技术）结合起来，用一统一指标描述机器的健康状况，达到监测和预报的目的，为开发基于多种监测技术的智能诊断系统打下基础。     

CC,CD柴油机油实用型复合剂配方YL—1043的研制

以燕化集团公司炼油事业部用大庆原油生产的ＨＶＩ３５０、ＨＶＩ６５０、ＨＶＩ１２０ＢＳ为基础油，研制出ＹＬ－１０４３柴油机油复合剂。以ＹＬ－１０４３４．０％的剂量可调配ＣＣ３０及ＣＣ４０油品，以ＹＬ－１０４３６．７３％的剂量另补加０．２７％的添加剂Ａ可调配ＣＤ４０油品，其性能达到了ＧＢ１１１２２－１９９７柴油机油标准。以该复合剂调配ＣＣ、ＣＤ级油品，与燕化公司原用配方相比，分别降低添加剂剂量１．４６％及１．５％，每吨油可节约添加剂费用１８３．３元及２０７．３元     

现代汽车活塞制造技术总论

本文针对现代汽车活塞的生产技术特点,综述了制造技术及其装备的主要课题,重点分析介绍非圆裙面加工、异型销孔精镗、工艺基准的关键作用,变形对加工精度的影响,检测技术配套及全面提高铸件质量等关键问题的国内外发展动向。     

Infinite-horizon Scheduling Algorithms for Optimal Search for Hidden Objects

This paper considers discrete search problems in which a decision-maker has to find objects lost or hidden in a given set of locations so as to minimize the expected losses incurred. Given a chance to look for a hidden object in the same location infinitely many times, this type of problem, in contrast to standard scheduling problems, has an infinite sequence as its solution. Thus we are concerned to find an algorithm that yields an optimal solution, rather than the optimal sequence itself. Using combinatorial techniques, fast optimal algorithms for solving the problems are obtained, and optimality conditions are presented for search criteria, under which the local-search algorithms yield the global optimum.     

发动机扭矩与转速关系经验公式试验研究

在对发动机外特性曲线扭矩与转速实验数据分析的基础上，对原有的经验公式进行了分析、改进，提出了新的经验公式．由这一经验公式所计算的数值，在最大扭矩与最大功率点之间，可与实验数据拟合得很好．与原经验曲线相比，新经验曲线与实验曲线的离差可下降50％以上．     

变结构变参数设计方法及其在机械CAD中的应用

提出了一种新颖的机械结构设计思想－变结构变参数设计方法，并结合实例，阐述了变结构变参数设计的概念、原则、实施措施和意义。由此对Ｉ－ｄｅａｓ软件包进行了二次开发，编制了发动机曲轴专用ＣＡＤ软件程序，并用某型号发动机曲轴进行了验证。     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

基于MATLAB的远程电机调速系统设计

详细介绍了利用MATLAB语言实现串行通信的原理和步骤,并给出了在MATLAB环境下实现远程电机调速的具体应用,实验结果表明该方案具有简单、实用、实时性能好,控制精度高等特点.     

Color Grouping in Space and Time: Evidence From Negative Color-Based Carryover Effects in Preview Search.

Five experiments addressed the role of color grouping in preview search (D. G. Watson & G. W. Humphreys, 1997). Experiment 1 used opposite color ratios of distractors in preview and second search displays, creating equal numbers of distractors in each color group in the final display. There was selective slowing for new targets carrying the majority color of the old items. This effect held when there was no bias in the preview and only the second search set had an uneven color ratio (Experiment 2). In Experiment 3, participants had foreknowledge of the target color, and effects were shown over and above those due to color biases. Experiment 4 demonstrated negative color carryover even when previews changed color. Experiment 5 showed reduced color carryover effects when previews were presented more briefly. Collectively, the results provide evidence for inhibitory carryover effects in preview search based on feature grouping. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Response Selection in Visual Search: The Influence of Response Compatibility of Nontargets.

The authors used visual search tasks in which components of the classic flanker task (B. A. Eriksen & C. W. Eriksen, 1974) were introduced. In several experiments the authors obtained evidence of parallel search for a target among distractor elements. Therefore, 2-stage models of visual search predict no effect of the identity of those distractors. However, clear compatibility effects of the distractors were obtained: Responses were faster when the distractors were compatible with the response than when they were incompatible. These results show that even in parallel search tasks identity information is extracted from the distractors. In addition, alternative interpretations of the results in terms of the occasional identification of a distractor before or after the target was identified could be ruled out. The results showed that flat search slopes obtained in visual search experiments provide no benchmark for preattentive processing. (PsycINFO Database Record (c) 2010 APA, all rights reserved)