Sorption of solvents in plastics and solvent desorption and retention

The experiments reported here have studied the following systems within the temperature range 25–50°C: sorption and desorption of solvents on LDPE, OPP, PS, rigid PVC, OPA, PETP and regenerated cellulose with methanol, ethanol, n-propanol, and ethyl acetate. With reference to these, the theory presented indicates the most important aspects related to the tests, refers to identification data on similar problems and enumerates the possibilities of interaction. The application of equation 1 and the reported measuring method allows the determination of diffusion coefficients within a vapour-saturated atmosphere system. As the gravimetric method also allows the determination of solubilities (α_L, the solubility coefficient), the permeation behaviour in the Fick range is calculable from The equation used by the author can be related to other equations from the technical literature, such as for the range Q_(t)Q∞>0.4, or where for the range <0.4 The agreement can be considered as good. The D values provide a calculation base within the scope of the outlined problem definition. The taste limits for solvents in water reveal which solvents could, as residual solvents, become critical. These values—connected with sorption/desorption identification values, evaporation numbers etc. —indicate where there is a risk and those cases where sufficient drying, or even the use of more adequate solvents is essential.     

井下人员定位系统读卡器存储算法分析与测试

从查找时间与存储容量2个方面分析了适用于井下人员定位系统读卡器的3种存储算法,即链式存储算法、哈希表存储算法和哈希二叉树存储算法,给出了该3种不同存储算法的使用效率与应用场合。测试结果表明,链式存储算法查找时间呈线性增长,哈希表存储算法明显优越于链式存储算法,如果测试数据增多,其优越性会更明显;当数据量较大时,哈希搜索二叉树存储算法又明显优于哈希表存储算法,当人数达到行业所要求的8 000人以上时,选择哈希搜索二叉树存储算法更为合理。     

An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more expensive in terms of circuit complexity as well as power consumption. Therefore, efficient algorithmic solutions are essentially required to be implemented using network processors as low cost solutions.Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution. In order to construct a balanced search tree, the prefixes with the nesting relationship should be converted into completely disjointed prefixes. A leaf-pushing technique is very useful to eliminate the nesting relationship among prefixes [V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion, ACM Transactions on Computer Systems 17 (1) (1999) 1-40]. However, it creates duplicate prefixes, thus expanding the search tree.This paper proposes an efficient IP address lookup algorithm based on a small balanced tree using entry reduction. The leaf-pushing technique is used for creating the completely disjointed entries. In the leaf-pushed prefixes, there are numerous pairs of adjacent prefixes with similarities in prefix strings and output ports. The number of entries can be significantly reduced by the use of a new entry reduction method which merges pairs with these similar prefixes. After sorting the reduced disjointed entries, a small balanced tree is constructed with a very small node size. Based on this small balanced tree, a native binary search can be effectively used in address lookup issue. In addition, we propose a new multi-way search algorithm to improve a binary search for IPv4 address lookup. As a result, the proposed algorithms offer excellent lookup performance along with reduced memory requirements. Besides, these provide good scalability for large amounts of routing data and for the address migration toward IPv6. Using both various IPv4 and IPv6 routing data, the performance evaluation results demonstrate that the proposed algorithms have better performance in terms of lookup speed, memory requirement and scalability for the growth of entries and IPv6, as compared with other algorithms based on a binary search.     

高沸点溶剂法合成原乙酸三甲酯

对低沸点溶剂法制备原乙酸三甲酯工艺进行了改进，比较了煤油、2-乙基己醇、氯苯、异佛尔酮、邻苯二甲酸二丁酯、乙二醇二丁醚等高沸点溶剂对反应的影响，筛选出最优高沸点溶剂煤油：研究了新反应体系的醇解pH值、溶剂的循环使用次数对反应的影响及溶剂循环损耗率，结果表明，醇解的最佳pH值为5．6；随着溶剂循环次数增加，原乙酸三甲酯收率从83．6％(1次)逐渐下降到76．7％(16次)；溶剂次平均损耗率4．6％。实现了直接蒸馏产品，溶剂循环使用的新工艺。避免了旧工艺先蒸溶剂，后蒸产品，产品大量分解，收率低等缺点。     

A binary approximating method for graspable region determination of biped climbing robots

For a biped pole-climbing robot (BiPCR) with grippers, it is an essential demand to determine the target grasp configuration for climbing and transiting between poles, with the graspable region as a priori knowledge. The graspable region on the target pole is critically important for climbing path planning and motion control. To efficiently compute the graspable region for a BiPCR, we propose a novel binary approximating method in this paper. This method may also be applied to generate the three-dimensional (3-D) workspace of a manipulator with constant orientation. The grasping problem and the concept of graspable region for a BiPCR are first introduced. The binary approximating method and the corresponding algorithms are then presented to generate the graspable region. Additional constraints on a biped climbing robot with five degrees of freedom (DoFs) are presented as a supplement to the algorithm. A series of comprehensive simulations are conducted with the five-DoF and six-DoF climbing robots to verify the effectiveness of the proposed method. Finally, the dexterity of biped climbing robots with different DoFs is discussed.     

对边缘不突出的显微镜影像进行边缘特征提取与Hough直线检测

文章主要介绍如何对边缘不突出的显微镜进行边缘特征提取与Hough直线检测,其中涉及到数字图像处理中的边缘检测、图像二值化及Hough直线检测算法。     

纤维素科学与技术研究进展

本文综述纤维素科学与技术的研究进展。阐述了纤维素结构、纤维素的合成、纤维素液晶、功能纤维素、纤维素溶剂、纤维素裂解和纤维素的废物利用等的最新动态。     

Multi-Wavelength vs. Binary Code Pattern Unwrapping in Fringe Projection Method

Phase extraction, phase unwrapping and phase to height conversion are consecutive steps within the fringe projection method for reconstruction of 3D objects. The procedure of determining discontinuities on the wrapped phase, resolving them and achieving the unwrapped phase is called phase unwrapping. A software system was developed that provides the ability to create many kinds of patterns with a verity of desirable properties suitable for different demands in fringe projection systems. In our previous work, an experimental study was reported based on a multi-wavelength unwrapping approach. In the following work, we implemented a new method called binary code pattern unwrapping that is based on time analysis. A comparison of the two unwrapping approaches in terms of resolution, quality, noise, depth accuracy, and computational cost is provided.