Friction compensation controller for load varying machine tool feed drive

The load applied to a machine tool feed drive changes during the machining process as material is removed. This load change alters the Coulomb friction of the feed drive. Because Coulomb friction accounts for a large part of the total friction the friction compensation control accuracy of the feed drives is limited if this nonlinear change in the applied load is not considered. This paper presents a new friction compensation method that estimates the machine tool load in real time and considers its effect on friction characteristics. A friction observer based on a Kalman filter with load estimation is proposed for friction compensation control considering the applied load change. A specially designed feed drive testbed that enables the applied load to be modified easily was constructed for experimental verification. Control performance and friction estimation accuracy are demonstrated experimentally using the testbed.     

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.     

灵芝菌丝体多糖的分离纯化及其单糖组成分析与分子量测定

前期杂交优化后赤芝菌种经液体深层发酵后,提取灵芝菌丝体多糖,并过DEAE-Sepharose Fast Flow柱分离纯化,利用高效体积排阻色谱(HPSEC)检测多糖级分的纯度,采用完全酸水解PMP柱前衍生化RP—HPLC测定多糖级分的单糖组成,多角度光散射仪联用装置(SEC—MALLS)测定其绝对重均分子量(Mw),并且根据分子旋转半径与分子摩尔数的关系曲线斜率初步推断其空间构象。结果显示:分离纯化得到3个多糖级分GLMP1、GLMP2和GLMP3,HPSEC检测其峰面积百分比分别为93.58%,97.64%,99.19%,单糖组成分析结果表明GLMP1、GLMP2和GLMP3均含有甘露糖、鼠李糖、半乳糖醛酸、葡萄糖、半乳糖、木糖、阿拉伯糖和岩藻糖,但单糖摩尔比各异。SEC—MALLS测试GLMP1、GLMP2和GLMP3的Mw分别为4.526×105,4.603×104,3.760×103 g/mol,3个多糖级分构象可能均为高度紧缩且具有分支结构的聚合物。     

（2m，2，m）非线性等重码不是最佳检错码

本文证明了当ｍ＞４时（２ｍ，２，ｍ）非线性等重码不是最佳检错码。     

超高分子量聚乙烯的辐照效应

通过密度测定和ＤＳＣ热分析，观测了超高分子量聚乙烯的辐射效应。实验结果表明：在吸收剂量０—１．１３ＭＧｙ范围内，密度随吸收剂量的增加而增大，熔化热和熔点也有所增加，特别是在低剂量范围内增加十分明显。以上结果都说明，超高分子量聚乙烯在辐照过程中，结晶在完善或有新的结晶形成     

Intramolecular crosslinking of poly(vinyl alcohol)

Poly(vinyl alcohol) is crosslinked in dilute solution (c=0.1 wt%) with glutaraldehyde. The reaction product is characterized by viscometry and gel permeation chromatography (g.p.c.). The intrinsic viscosity decreases with increasing degree of crosslinking and does not depend on temperature. G.p.c. reveals that the reaction product is not homogeneous, but consists of a mixture of particles with different sizes, possibly both intra- and intermolecularly crosslinked molecules. The intramolecularly crosslinked molecules are smaller in size than the initial polymer molecules and their size depends on the degree of crosslinking. They possess a narrow particle size distribution even if the initial polymer sample had a broad molecular weight distribution.     

影响道路沥青低温抗裂性能的因素

用弯曲梁流变仪、直接拉伸试验机对7种国内外油源沥青样品进行了低温抗裂性能的评价，从沥青的四组分、相对分子质量及其分布来分析其对沥青低温抗裂性能的影响，结果表明，沥青的相对分子质量分布宽，对沥青的低温抗裂性能有利。     

Application of piece‐wise linear weight functions for 2D 8‐node quadrilateral element in contact problems

The present study is a continuation of our previous work with the aim to reduce problems caused by standard higher order elements in contact problems. The difficulties can be attributed to the inherent property of the Galerkin method which gives uneven distributions of nodal forces resulting in oscillating contact pressures. The proposed remedy is use of piece‐wise linear weight functions. The methods to establish stiffness and/or mass matrix for 8‐node quadrilateral element in 2D are presented, i.e. the condensing and direct procedures. The energy and nodal displacement error norms are also checked to establish the convergence ratio. Interpretation of calculated contact pressures is discussed. Two new 2D 8‐node quadrilateral elements, QUAD8C and QUAD8D, are derived and tested in many examples, which show their good performance in contact problems. Copyright © 2004 John Wiley & Sons, Ltd.     

A simple approximation algorithm for the weighted matching problem

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [STACS'99, Lecture Notes in Comput. Sci., Vol. 1563, 1999, pp. 259-269]. Our algorithm uses a new approach which is much simpler than the one given by Preis and needs no amortized analysis for its running time.