地面作战仿真系统可信度研究

介绍了装甲数字化作战仿真系统基本构成和仿真可信度及相关术语的概念,在此基础上,根据地面作战仿真系统的特点,制定了系统开发方案,该方案的制定和实施侧重于提高系统仿真可信度。提出了提高系统仿真可信度的若干技术措施。使用表明,该系统仿真可信度符合使用要求。     

文本知识发现:基于信息抽取的文本挖掘蝌

In the general context of Knowledge Discovery, Knowledge Discovery in Text (KDT), which uses TextMining techniques to extract and induce hidden knowledge from unstructured text data, surges in the data and naturallanguage processing research. KDT is a multi-discipline of Artificial Intelligence, Machine learning, Natural Lan-ing with a stressing on its IE (Information Extraction)-based induction and specific sublanguage fields oriented prac-tices.     

电子电器产品的回收再利用及其关键技术研究

电子电器产品制造业是我国一个庞大的产业领域 ,但废旧电子电器产品的有效回收利用尚没有得到足够的重视。本文结合相关项目的研究 ,阐述了在我国这样一个人均资源占有量很低的国家 ,开展废旧电子电器产品回收利用的重要意义 ,并分析了国内外在废旧电子电器回收利用方面的现状 ;在此基础上 ,探讨了废旧电子电器产品有效回收的途径 ;指出系统地研究废旧电子电器产品的回收过程 ,不仅有利于其产业化、规模化 ,而且可以为电子电器产品的绿色设计提供丰富的数据和知识支持     

MC68HC11Kx系列单片机存贮器扩展

文中介绍MC68HC11Kx系列单片机存贮器扩展技术，并给出应用实例，对工程设计具有参考意义。     

供电企业电费管理信息系统的研究开发

本文简要介绍了“供电企业电费管理信息系统”的设计思想，并概括地说明了该系统的功能及特点，该系统功能完善，界面友好，操作简单，具有综合查询和辅助决策能力，能充分满足不同层次数据管理需求。     

提高200MW机组高压加热器投入率的研究

通过对武汉钢电股份有限公司2台200MW机组2年来高压加热器运行状况的统计分析，找出影响高加投入率的主要原因，提出相应的技术改造和技术措施，大大提高了高加投入率。     

一级除盐系统再生酸碱用量调整与探讨

论述了该厂300MW机组火电厂化学水处理一级除盐设备再生的酸碱用量调整试验的基本过程，并对一级除盐设备运行提出了相应的措施，调整试验达到节约酸碱用量、降低生产成本的目的。     

Optimal packing of transformer coil via dynamic programming

One of the transformer major design elements is its core design. The good performance of the transformer requires its coil core to be laminated and composed of different - widths stepped layers of specific steel packed together. For optimum design, the cross sectional shape of the core must be as circular as possible. So, an optimal packing can be attained by maximizing the steel core coverage. The number of different widths of steel plates n is selected to compose the packed core for a coil of diameter d. Then, an optimum sequence of decisions, for the n widths as well as the number of thin plates of each, is required. Dynamic programming (dp) is concerned with this optimum sequential decisions. An adequate forward recursive equation is formulated , because there isn't a standard dp model for all sequential decision making problems. To implement the recursive computations, a FORTRAN program is developed. Assuming that d is given the values 150, 200, 250, 300, 400 and 500 mm. while giving n the values from 2 to 15, the program is run at different combinations of n and d. It is found that maximum core coverage is sensitive to changing of n but it is slightly affected by changing of d.     

The Complete Solution of the Competitive Rank Selection Problem

Two decision-makers A and B observe sequentially a given permutation of n uniquely rankable options. A and B have one choice each (without recall) and both must make a choice. At each step only the relative ranks are known, and A has the priority of choice. At the end the (absolute) ranks are compared and the winner is the one who has chosen the better rank. Extending results by Enns and Ferenstein [6] and Berry et al. [1] this article gives, for both A and B , the optimal strategy and the corresponding winning probabilities. We show in particular that the limiting winning probabilities for A and B do exist, which closes a most important gap in the work of previous authors. This also provides an algorithm for numerically computing the limiting value of these probabilities. Although our proof is analytic in a strong sense, it is interesting to see that it would have been very hard to assemble it without the help of computer algebra. The reason is that the functions we have to investigate display subranges of indices which contrast considerably with respect to error terms when certain terms are replaced by approximations, and that computations were very helpful to locate those ranges where a particularly fine tuning of error estimates turned out to be indispensable. Received October 1997; revised March 15, 1998.