粘土作为高放废物处置回填材料的可行性研究

本文以西北粘土为对象,对其压实行为、热传导、膨胀特性,以及吸附和渗透性能进行了初步研究,借以探讨西北粘土在高放废物处置中用作回填材料的可行性。试验表明,以西北粘土为基材,经过适当的热改性和吸附改性,在初始含水量约为9%,于70MPa 下成型,用作高放废物处置中的回填材料是可行的。     

反井钻及其在我国水电工程的应用

本文介绍了反井钻这一新型的竖井和斜井开挖施工设备，以及该设备在国内水电工程中的应用。实践证明，在适当的地质地形条件下，反井钻比人工正井法、吊罐、阿里马克爬罐法都具有明显的优越性，值得在国内其它水电工程中推广应用。     

Synthesis, characteristics and oxygen-sensitive properties of SrMgxTi 1 − xO3 nanocrystals

SrMg_xTi_{1 - x}O₃ nanocrystals (x = 0.1–0.6) were synthesized by the stearic acid gel method. Powder samples were characterized by X-ray diffraction and X-ray photoelectron (XP) spectroscopy. The results showed that the lattice parameter a and the O 1s XP spectrum changed not only with the Mg content x but also with the grain size d of the samples. The conductivity of a thick film specimen fabricated on an aluminium oxide wafer was investigated in a nitrogen—oxygen atmosphere.     

循环流液相等电聚焦方法及应用研究

利用循环流液相等电聚焦技术，对Ｈｂ、Ｃｙｔ．Ｃ和ＢＳＡ混合物进行分离，对ＲＮａｓｅＡ粗制品进行精制。该方法上样量大，活性回收好。对聚焦过程中扩散、对流和电渗的影响进行了讨论。     

三氯乙烯与糠醛水溶液的液液平衡及萃取模拟计算

本文采用液液平衡釜了糠醛水溶液与三氯乙烯的液液平衡数据，用ＵＮＩＱＵＡＣ方程关联糠醛－水－三氯乙烯体系的液液平衡数据，以ＵＮＩＱＵＡＣ方程的模型，采用液液萃取法模拟计算糖醛和水的分离结果。     

Calderón-Zygmund型算子的研究

本文对通常的Calderón-Zygmund型算子稍加改造,仍得到满意结果.     

用Boltzmann网络解任务安排问题

本文提出了一种解任务安排问题的Ｂｏｌｔｚｍａｎｎ网络算法，已在Ｔｒａｎｓｐｕｔｅｒ多处理机系统上并行模拟实现，该算法具有优化程度高，运算速度快等特点．     

ATM交换机的硬件体系结构探讨

本文首先对ＡＴＭ的背景作了一个简单的介绍，接着阐述了ＡＴＭ和ＡＴＭ交换机的主要原理和技术，然后从硬件系结构的角度具体地分析了一种实验ＡＴＭ交换机是怎样ＡＴＭ技术的详细方法。     

A greedy algorithm to determine the number of transporters in a cyclic electroplating process

This paper presents a local optimization algorithm for minimizing the number of transporters required for material handling in a cyclic processing line. Within a cycle, a given set of transportation operations must be performed. Each operation consists of picking up a work-in-process job at a stage and delivering it to the next stage. The length of time that a job can remain at a particular stage is restricted by a time window. The transporters that perform the operations move on a shared track, and traffic collisions must be avoided during their movements. To avoid traffic collisions, the operations are partitioned into groups, where each group is served by a single transporter. A local optimal solution is obtained when the group sizes are maximized. We show that the duals of the linear programming subproblems formulated in the process of maximizing the group sizes are specially structured shortest-path problems. This leads to an effective search method for the maximization problem. Conditions when die proposed algorithm achieves die global optimal solution are discussed. The algorithm's performance is evaluated on both randomly generated test problems and benchmark problems.