A markov chain version of the secretary problem

This paper deals with the Secretary Problem where n secretaries are interviewed sequentially and the best k must be hired. The values of the secretaries are observed as they are interviewed, but beforehand only the distributions of these values are known. Furthermore, the distributions of two successive secretaries' values are governed by a Markov chain. Optimal hiring policies for finite n and limiting optimal policies as k and n approach infinity are obtained.     

A note on explicit solution in linear fractional programming

In this note we analyze the fractional interval programming problem (FIP) and find, explicitly, all its optimal solutions. Though our results are essentially the same as those in Charnes and Cooper [4], the proofs and analysis we provide here are considerably simpler.     

A note on testing for exponentiality

In this note some extensions are made to previous work by a number of authors on the development of tests for exponentiality. The most recent example is due to Fercho and Ringer in which they compare the small sample powers of a few well-known test statistics for the hypothesis of a constant failure rate. It is the primary intent of this current work to extend Gnedenko's F test to situations with hypercensoring and to provide guidance for its use, particularly when a log-normal distribution is the alternative.     

Redundant spares allocation to reduce reliability costs

The problem considered here is the optimal selection of the inventory of spares for a system built from two kinds of modules, the larger of which can be connected so it performs the role of the smaller one. The optimal inventory is the least costly one which achieves a specified probability that the spares will not be exhausted over the design lifetime. For some costs and failure rates it is most economical to use the larger module for both roles, due to the resulting increase in flexibility in the deployment of a single type of spare module. Both analytical and simulation methods have been used to study this problem.     

Flowshop sequencing problem with ordered processing time matrices: A general case

The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems.     

An algorithm for solving general fractional interval programming problems

A Linear Fractional Interval Programming problem (FIP) is the problem of extremizing a linear fractional function subject to two-sided linear inequality constraints. In this paper we develop an algorithm for solving (FIP) problems. We first apply the Charnes and Cooper transformation on (FIP) and then, by exploiting the special structure of the pair of (LP) problems derived, the algorithm produces an optimal solution to (FIP) in a finite number of iterations.     

溶胶一凝胶法制备二氧化钛及其转化为氮化钛的研究

本文以钛酸丁酯为原料，通过溶胶一凝胶法制备了ＴｉＯ２凝胶，在高温下烧结此凝胶得到ＴｉＯ２。将ＴｉＯ２粉末在９００°Ｃ以上用氨进行氮化，制得金黄色的氮化钛。通过使用热分析、色谱分析、扫描电镜及Ｘ一射线衍射等手段，研究并揭示了凝胶在陶瓷化生成ＴｉＯ２的过程中的化学反应，结晶及晶型随温度的变化规律。发现了氮化钛陶瓷的生成率与ＴｉＯ２溶胶的制备条件之间的关系。     

MPP虚拟多机系统

ＭＰＰ虚拟多机系统是一个特殊的ＰＶＭ系统，本文阐述了ＭＰＰ虚拟多机系统的系统结构和实现技术，并对ＭＰＰ虚拟机的性能进行了初步测试和分析。     

战场数字化条件下的单兵数字化系统——“数字化战场与单兵数字化系统”系列论文之二

本文首先讨论了战场数字化条件下单兵数字化系统的概念和内涵，用Ｌａｎｃｈｅｓｔｅｒ模型分析了单兵系统的作战效能，然后以此为基础研究了单兵系统的基本功能单元和实现其整体功能的组成结构。     

弹道数据处理融合算法的并行计算

针对参考文献[1]中提出的融合多信源信息的融合算法,讨论了其中大计算量的测元遴选问题,并给出了它的并行算法。最后详细地分析了此并行算法的高效性和可扩展性,给出了加速比的仿真结果