基于Abaqus的双裂纹不同间距对裂纹扩展速率的研究

扩展有限元法是近年经过大量运用的,在传统有限元的范围中求解不连续问题一种有效计算方法,它是基于单位分解的思想,在计算不连续问题时加入跳跃函数。以ABAQUS为平台,基于扩展有限元方法 (XFEM),以含双穿透型裂纹的有限宽板受横向拉伸载荷为力学模型,建立相应的裂纹尖端应力的有限元模型,研究焊接接头区域不同间距双裂纹相互作用对裂纹扩展速率的影响。结果表明:双裂纹间距的的大小并没有对裂纹的扩展速率产生影响。     

钢管套筒灌浆连接轴向受拉性能模拟试验研究

为研究钢管套筒灌浆连接轴向受拉破坏过程及破坏机理，试验中设计了16组48个钢管套筒灌浆连接试件，试件采用钢板代替圆钢管，并进行静载试验。分析了灌浆料裂缝扩展过程、荷载-相对位移曲线，并对抗剪键高距比、灌浆料厚度、侧向力等因素对破坏过程及承载力的影响进行分析。结果表明：对于不设置抗剪键的套筒灌浆连接试件，斜裂缝随机产生，裂缝分布不均匀；对于设置抗剪键的套筒灌浆连接试件，裂缝首先出现在底部抗剪键位置处，与水平方向夹角约为30°，随后在中部和上部抗剪键位置处分别出现斜裂缝。由于每个抗剪键上荷载分担并不均匀，与抗剪键接触的灌浆料逐渐达到极限压应力，达到极限状态时，承载力全部由抗剪键间的机械咬合力承担，在连接承载力中，可忽略摩擦力和胶结力作用。随着抗剪键高距比h/s增大，各试件初始剪切刚度相差不大，承载力增大，但增幅逐渐减小，建议抗剪键高距比0.06g/s>0.3，同时需要满足灌浆料灌注的施工要求。     

Active disturbance rejection based trajectory linearization control for hypersonic reentry vehicle with bounded uncertainties

This paper investigates a novel compound control scheme combined with the advantages of trajectory linearization control (TLC) and alternative active disturbance rejection control (ADRC) for hypersonic reentry vehicle (HRV) attitude tracking system with bounded uncertainties. Firstly, in order to overcome actuator saturation problem, nonlinear tracking differentiator (TD) is applied in the attitude loop to achieve fewer control consumption. Then, linear extended state observers (LESO) are constructed to estimate the uncertainties acting on the LTV system in the attitude and angular rate loop. In addition, feedback linearization (FL) based controllers are designed using estimates of uncertainties generated by LESO in each loop, which enable the tracking error for closed-loop system in the presence of large uncertainties to converge to the residual set of the origin asymptotically. Finally, the compound controllers are derived by integrating with the nominal controller for open-loop nonlinear system and FL based controller. Also, comparisons and simulation results are presented to illustrate the effectiveness of the control strategy.     

数字储频及其性能分析

文章介绍了3种宽带数字储频的基本结构，分析了宽带数字储频的一个重要指标——量化噪声，根据输出信号频谱的杂散电平比较了三种结构的优劣。     

A Lattice Approach to Image Segmentation

After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria. The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study. The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups. The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.     

2.4GHz动态CMOS分频器的设计

对现阶段的主流高速CMOS分频器进行分析和比较,在此基础上设计一种采用TSPC(truesingle phase clock)和E-TSPC(extended TSPC)技术的前置双模分频器电路.该分频器大大提高了工作频率,采用0.6μm CMOS工艺参数进行仿真的结果表明,在5V电源电压下,最高频率达到3GHz,功耗仅为8mW.     

开关电源的平均电流自动均流技术

针对多个开关电源并联时易出现负载电流在各模块间分配不均的现象,介绍了常用的负载电流自动均流法——平均电流自动均流法及其工作特性。并针对其存在母线电压降低的缺陷,提出了一种改进的平均电流自动均流方法,经试验证明均流精度比较高。     

Evaluation of performance enhancing proxies in internet over satellite

Performance enhancing proxies (PEPs) are widely used to improve the performance of TCP over high delay‐bandwidth product links and links with high error probability. In this paper we analyse the performance of using TCP connection splitting in combination with web caching via traces obtained from a commercial satellite system. We examine the resulting performance gain under different scenarios, including the effect of caching, congestion, random loss and file sizes. We show, via analysing our measurements, that the performance gain from using splitting is highly sensitive to random losses and the number of simultaneous connections, and that such sensitivity is alleviated by caching. On the other hand, the use of a splitting proxy enhances the value of web caching in that cache hits result in much more significant performance improvement over cache misses when TCP splitting is used. We also compare the performance of using different versions of HTTP in such a system. Copyright © 2003 John Wiley & Sons, Ltd.     

CFH-Ⅱ型翻车机传动齿轮轴承座的座脚螺栓联接失效分析与改进

分析了CFH-Ⅱ型翻车机传动齿轮轴承座的座脚螺栓组联接失效(松动)的原因，得出控制和保证合适的螺栓组联接预紧力是防止螺栓联接失效(松动)的关键；依据现场条件，对座脚螺栓进行了设计改进；提出了一种适合现场使用的螺栓预热伸长的装配方法，经实践验证此法是简单可靠的装配方法。     

R-Calculus for ELP:An Operational Approach to Knowledge Base Maintenance

Sme concepts used in knowledge base maintenace,such as sequence,new law,user‘s rejection and reconstructions of a knowledge base,are first introduced,and then a framework for extended logic programming(ELP)is given,where an extended logic program is equivalent to a knowledge base.A transition system called R-calculus for ELP is provided.For a given knowledge base and a user‘s rejection,the R-calculus for ELP will deduce best revisions of the base.The soundness and the completeness of the R-calculus for ELP are proved,and the R-calculus for ELP is implemented in Prolog.In addition,the research is compared with other relevant work.