国际工程中的安全管理——浅谈安全管理在巴贡电站工程施工中的应用

旨在通过对马来西亚巴贡水电站工程安全管理的介绍与分析,结合国内施工企业在安全管理方面的特点,找出了适合我国施工企业可以借鉴的经验与管理要点,旨在提高国内施工企业的安全管理水平.     

潜孔锤冲击作用下土体变形的有限元分析

潜孔锤冲击挤密钻进过程中周围土体的变形机理是一个高度非线性问题。针对潜孔锤在土中的面-面接触问题,运用Drucker-Prager屈服准则为判据,将土体视为DP材料,通过钻具与土之间的接触及施加冲击载荷来模拟钻进过程,从而建立了潜孔锤在土中冲击挤密钻进的有限元模型。利用非线性瞬态动力学有限元分析手段,对钻进过程中冲击力对土的作用加以研究,分析了钻具周围土体的应力、应变以及钻具与土体的摩擦情况。结果表明,在冲击载荷作用下,锥形钻头前端土体应力集中,并形成应力泡,冲击功主要用于竖向压缩土体,而水平方向的挤压作用相对较小,摩擦应力在钻头锥面附近出现峰值,是影响钻进速度的主要原因之一。     

Minimum-Energy Translational Trajectory Generation for Differential-Driven Wheeled Mobile Robots

Mobile robots can be used in many applications, such as exploration, search and rescue, reconnaissance, security, and cleaning. Mobile robots usually carry batteries as their energy source and their operational time is restricted by the finite energy available from the batteries. Therefore, energy constraints are critical to the service time of mobile robots. This paper investigates the minimum-energy control problem for translational trajectory generation, which minimizes the energy drawn from the batteries. Optimal control theory is used to find the optimal velocity trajectory in analytic form. To demonstrate energy efficiency obtainable, we performed simulations of minimum-energy velocity control and compared the results with loss-minimization control and energy-optimal trapezoidal velocity profiles. Simulation results showed that significant energy savings can be achieved, of up to 9% compared with loss-minimization control and up to 10% compared with energy-optimal trapezoidal velocity profile. We also performed an actual robot experiment using Pioneer 3-AT platform to show the validity of the proposed minimum-energy velocity control. The experimental results revealed that the proposed minimum-energy velocity control can save the battery energy up to 10% compared with loss-minimization control. Categories (3): Robot control, (5): RobotMotion Planning     

An accurate and practical buffer allocation model for the buffer cache based on marginal gains

A new dynamic buffer allocation strategy based on the notion of marginal gains is presented for the buffer cache that is used by the operating system to store frequently accessed disk blocks in main memory, and the performance of the proposed strategy is compared with those of previous allocation strategies. In the proposed strategy, marginal gain values are predicted by exploiting functions that approximate the expected number of buffer hits per unit time. Experimental results from both trace-driven simulation and an actual implementation in the FreeBSD operating system show that the proposed strategy accurately predicts the marginal gain values for various workloads resulting in significantly improved buffer hit ratios.     

英语谚语的修辞和汉译特点

从语音、语义、结构3个方面分析了英语谚语的语言修辞特点,在此基础上,提出了等值、直译、意译、直意结合等4种汉译方法。另外,还提及了引申、对衬、格言、借用等4种具体翻译技巧。     

铅锌选矿厂废水回用研究

简述了铅锌选厂废水回用小型试验及工业试验情况，在基本上不改变工艺结构基础上改变药剂制度达到废水回用的目的，使选矿废水回用率达到80％，实现尾矿库废水零排放。     

多部件设备维修问题研究及遗传算法求解

合理组织设备维修，缩短设备维修时间是生产运营管理的一个重要环节。本文探讨了多部件设备维修的有效组织问题。考虑到维修工人对拆分后设备的不同部分具有不同的维修效率，提出了一种基于维修时间优化的决策方法，将其与经典指派方法进行了比较；进一步地，对这一NP-hard问题设计了遗传算法，通过数值例子讨论了其求解有效性。     

民族特色词语的英汉互译

语言在其发展演变过程中,逐步具有了鲜明的民族文化色彩。阐述了民族特色词语的可译性,并提出了具体的翻译方法。     

MATLAB在激光水下图像处理中的应用

介绍了MATLAB的功能，分析了MATLAB在数字图像处理中的应用，并结合对激光水下图像的处理说明了MATLAB在图像处理中的强大功能。     

An Area Optimization Method for Digital Filter Design

In this paper, we propose an efficient design method for area optimization in a digital filter. The conventional methods to reduce the number of adders in a filter have the problem of a long critical path delay caused by the deep logic depth of the filter due to adder sharing. Furthermore, there is such a disadvantage that they use the transposed direct form (TDF) filter which needs more registers than those of the direct form (DF) filter. In this paper, we present a hybrid structure of a TDF and DF based on the flattened coefficients method so that it can reduce the number of flip‐flops and full‐adders without additional critical path delay. We also propose a resource sharing method and sharing‐pattern searching algorithm to reduce the number of adders without deepening the logic depth. Simulation results show that the proposed structure can save the number of adders and registers by 22 and 26%, respectively, compared to the best one used in the past.