磷酸酯淀粉在纯棉细特高密织物浆纱中的应用

就磷酸酯淀粉在纯棉细号高密织物中的上浆情况进行了试验，提出了具体浆纱工艺和减少织造断头率，提高织物效率及布面质量对策，实验表明，磷酸酯淀粉完全适应于纯绵细特高密织物的上浆要求。     

化学结构式的拓扑描述

化学结构式的拓扑描述,是化学信息计算机化的手段之一。这里系统地建立了一整套的连接表(三类:紧缩连接表、冗余连接表、和连接方阵),用来进行结构式中原子之间连接关系的拓扑描述,对分子结构进行数值化。同时,阐述了连接表唯一化的方法,并介绍了不同类型连接表之间的转换关系和还原为平面结构式图形的绘图程序。     

Stereological estimation of the total volume of MR visible brain lesions in patients with multiple sclerosis

Point counting represents a convenient and efficient technique for estimating the area of transects through multiple sclerosis (MS) lesions on magnetic resonance (MR) images obtained for sections through the brain. When sectioning has been performed according to the Cavalieri method, unbiased estimates of the total volume of MR-visible MS plaques can be obtained with a precision of 3–5% in 5–10 min.     

真空热处理工艺参数的选取

通过多种材料、多种工件、多批次的加工，对常见真空热处理工艺参数的确定，摸索出一些经验公式，并在实际生产中取得很好效果。     

盘式永磁无刷电动机设计中的一些问题

介绍了盘式永磁无刷电动机的原理和结构，探讨了其设计特点，解决了磁路分析计算和电机主要尺寸确定以及磁极形状选择的问题。     

关于正整数的k次根的整部

对于给定的自然数m，令口α（m)为m的是的次根的整部。即：α(m)=[m^1/k]。研究了α(m)的渐近性质，并给出了一个有趣的渐近公式。     

桃林口水库大坝人工监测项目管理软件的开发与应用

介绍了桃林口水库大坝人工监测项目管理软件研制的意义。对软件结构、开发环境、基本计算原理、主要功能进行了详细阐述；并以大坝垂直位移分析为例,详细讲述了回归分析在资料分析中的具体应用。该软件的应用使工程管理水平上了一个新台阶。     

表冷器经验公式通用性的探讨

表冷器的经验公式都是通过实验测试并进行线性回归得到的。本文通过实验对表冷器经验公式中表冷器高度、长度以及通水管数的通用性进行研究，结果表明，同一厂家生产的结构特性相同的表冷器的经验公式具有通用性。     

凝胶过滤色谱测定高分子量聚乙烯醇分子量和分子量分布

用凝胶过滤色谱对高分子量聚乙烯醇分子量、分子量分布进行剖析。采用Plaquagel-OH色谱柱,0.25mol/LNaNO3,0.01mol/L Na2HPO4-NaH2PO,pH=7的缓冲溶液流动相,流速1ml/min,示差折光检测器,柱温30℃,聚环氧乙烷作标准物。该方法能显著缩短分析时间,提高准确性,可用于对高聚合度聚乙烯醇进行研究和指导生产。     

Efficient Legendre moment computation for grey level images

Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been devoted to the reduction of computational complexity. Nevertheless, the existing algorithms are mainly focused on binary images. We propose here a new fast method for computing the Legendre moments, which is not only suitable for binary images but also for grey level images. We first establish a recurrence formula of one-dimensional (1D) Legendre moments by using the recursive property of Legendre polynomials. As a result, the 1D Legendre moments of order p, L_p=L_p(0), can be expressed as a linear combination of L_p-1(1) and L_p-2(0). Based on this relationship, the 1D Legendre moments L_p(0) can thus be obtained from the arrays of L₁(a) and L₀(a), where a is an integer number less than p. To further decrease the computation complexity, an algorithm, in which no multiplication is required, is used to compute these quantities. The method is then extended to the calculation of the two-dimensional Legendre moments L_pq. We show that the proposed method is more efficient than the direct method.