连轧机用人字轮齿轴断裂失效分析

用宏观断口分析、化学检验、力学性能测定、低倍检查、金相组织及夹杂物评定鉴别、受力分析及强度寿命定量估算的方法，对人字轮被动齿轴端断裂失效原因进行分析，并提出改进措施。     

Li2O在保护渣中的作用

采用在不同玻璃性的两种基渣中加入Ｌｉ２Ｏ为研究Ｌｉ２Ｏ对保护渣粘度，熔化温度及玻璃性能的影响，并对Ｌｉ２Ｏ改善保护渣玻璃性的机理进行了探讨，提出了寻找高速连铸保护渣中Ｌｉ２Ｏ的代用物的一种方法。     

MS—Windows3.1下应用程序间数据交换方法及其选用策略

本文分析讨论了在ＭＳ－Ｗｉｎｄｏｗｓ操作系统下的应用程序间的数据交换的概念及方法，并给出了这些方法的选用策略。这些方法包括裁剪板，动态数据交换（ＤＤＥ），对象的连接及嵌入（ＯＬＥ），动态连接库（ＤＬＬ）。     

Electrical properties and positron annihilation study of (Ba<Subscript>1−<Emphasis Type="Italic">x</Emphasis></Subscript>Ho<Subscript><Emphasis Type="Italic">x</Emphasis></Subscript>)TiO<Subscript>3</Subscript> ceramics

DC resistivity, dielectric constant, dielectric loss and positron annihilation spectra of (Ba_1−x Ho _x )TiO₃ ceramics have been measured as a function of holmium concentration x. It has been found that the DC resistivity of (Ba_1−x Ho _x )TiO₃ is strongly dependent on the Ho content: it decreases three orders of magnitude and reaches a minimum at x = 0.4%. Doping with 0.6% holmium increases the permittivity of BaTiO₃ by approximately three times (from ∼1,300 to ∼4,000), with only a slight increase in the corresponding dielectric loss. The local electron density and defect concentration estimated using positron annihilation technique conforms well to the features found in the dielectric and resistivity measurements. The results have been discussed in terms of a mixed compensation model.     

A Study of Integrated Document and Connection Caching in the WWW

Document caching and connection caching are extensively studied problems. In document caching, one has to maintain caches containing documents accessible in a network. In connection caching, one has to maintain a set of open network connections that handle data transfer. Previous work investigated these two problems separately while in practice the problems occur together: In order to load a document, one has to establish a connection between network nodes if the required connection is not already open. In this paper we present the first study that integrates document and connection caching. We first consider a very basic model in which all documents have the same size and the cost of loading a document or establishing a connection is equal to 1. We present deterministic and randomized online algorithms that achieve nearly optimal competitive ratios unless the size of the connection cache is extremely small. We then consider general settings where documents have varying sizes. We investigate a FAULT model in which the loading cost of a document is 1 as well as a BIT model in which the loading cost is equal to the size of the document.     

Non-redundant data clustering

Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice, this discovery process should avoid redundancies with existing knowledge about class structures or groupings, and reveal novel, previously unknown aspects of the data. In order to deal with this problem, we present an extension of the information bottleneck framework, called coordinated conditional information bottleneck, which takes negative relevance information into account by maximizing a conditional mutual information score subject to constraints. Algorithmically, one can apply an alternating optimization scheme that can be used in conjunction with different types of numeric and non-numeric attributes. We discuss extensions of the technique to the tasks of semi-supervised classification and enumeration of successive non-redundant clusterings. We present experimental results for applications in text mining and computer vision.