一种改进的基于在线解耦的轻量级动态污点分析方法

在针对二进制程序的实际分析场景中,动态分析方法因具有更高的准确性而得到更为广泛的关注和运用.但是以动态污点分析为代表的细粒度分析方法通常会产生较高的性能和资源开销.为缓解这些问题,本文提出一种改进的轻量级在线解耦的动态污点分析方法,其主要思想是在线解耦程序执行和指令分析,同步构建分析代码并完成分析.该方法能够进一步降低对目标程序运行时的性能影响,并易将分析过程迁移至其它上下文环境中,从而可进一步减小对目标程序运行环境的干扰.本文通过采用多种实际程序进行实验,结果表明该方法能够比传统在线污点分析具有更高的分析性能,并具有较低的系统资源消耗,易于在实际环境中进行部署和应用.     

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

从查找时间与存储容量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.     

The Importance of Therapeutically Targeting the Binary Toxin from Clostridioides difficile

Novel therapeutics are needed to treat pathologies associated with the Clostridioides difficile binary toxin (CDT), particularly when C. difficile infection (CDI) occurs in the elderly or in hospitalized patients having illnesses, in addition to CDI, such as cancer. While therapies are available to block toxicities associated with the large clostridial toxins (TcdA and TcdB) in this nosocomial disease, nothing is available yet to treat toxicities arising from strains of CDI having the binary toxin. Like other binary toxins, the active CDTa catalytic subunit of CDT is delivered into host cells together with an oligomeric assembly of CDTb subunits via host cell receptor-mediated endocytosis. Once CDT arrives in the host cell’s cytoplasm, CDTa catalyzes the ADP-ribosylation of G-actin leading to degradation of the cytoskeleton and rapid cell death. Although a detailed molecular mechanism for CDT entry and host cell toxicity is not yet fully established, structural and functional resemblances to other binary toxins are described. Additionally, unique conformational assemblies of individual CDT components are highlighted herein to refine our mechanistic understanding of this deadly toxin as is needed to develop effective new therapeutic strategies for treating some of the most hypervirulent and lethal strains of CDT-containing strains of CDI.     

双光子加工数据准备软件的研究*

双光子加工技术需要通过数据准备软件将CAD模型转换为加工数据.为此提出了三种进行双光子加工的数据准备方法,即STL处理、图片处理和线条处理;基于MFC的单文档/视图结构框架开发了软件.应用实例表明,该软件界面友好、运行可靠.     

参激随机共振及纠错码技术的应用

为了有效地降低数字信号传输过程中的比特误码率,提出了纠错编码与参数调节随机共振技术的结合.在经过噪声污染后,依据参数调节随机共振技术的性质,给出通过系统参数调节的二进制脉冲幅值调制（PAM）输入信号的渐近误码率公式,应用纠错码技术采用中间值估计的方法得到修正的比特误码率.数字仿真试验证实,理论计算结果与试验结果相吻合,纠错码技术与参激随机共振技术的结合应用于二进制基带信号传输,可以降低误码率,从而可以得到更好的效果,提高通信的可靠性和有效性.     

上行气固两相流充分发展段的摩擦压降

为确定气固提升管充分发展段的摩擦压降及其对颗粒浓度测试的影响,提出了充分发展段内气固两相流与管壁间摩擦压力降的计算模型,由此获得充分发展段内真实颗粒浓度的计算公式;同时在两套提升管实验装置上对压力梯度分布和局部颗粒浓度进行了系统测试和对比分析。结果表明,用压差法测试颗粒浓度时摩擦的影响不可忽略,尤其是在气速较高(Ug＞8 m/s）时,表观浓度比实际浓度高出30%～50%;采用建立的模型对表观浓度进行修正,获得的预测值与实际颗粒浓度吻合良好。     

二元Al-Li合金的沉淀反应SCIEI

本文通过对两种成分的二元Al-Li合金的硬度测量,DSC分析和TEM观察,研究了其沉淀过程。实验结果表明,在恒定时间时效,合金硬度与温度的关系曲线上在低温范围内有一峰值出现;在DSC曲线低温处有明显的回溶吸热峰,因此该合金低温时效有预沉淀(富Li GP区)形成。在较高温度时效,GP区不复存在;随着δ′相颗粒长大,合金硬度很快增加;DSC曲线上有两个δ′相回溶峰,它意味着δ′析出需有两次结构调整。平衡δ相借助晶界直接从过饱和固溶体中形核长大,其热稳定性较好。     

High solids content emulsions. III. Synthesis of concentrated latices by classic emulsion polymerization

Two different methods of producing bi‐ and trimodal latices of a mixture of methyl methacrylate, butyl acrylate, and small amounts of acrylic acid were tested. It is shown that a combination of concentrating blends of seed particles by semibatch reaction, followed by a nucleation of small particles plus a second semibatch phase allowed us to obtain stable latices with solids contents over 65% and viscosities of below 2500 mPa s^?1 with little coagulum formation. The key parameter in determining latex stability, coagulum formation, and viscosity appears to be the the particle size distribution, and especially its modification attributed to secondary nucleation. Because it is not possible to eliminate water‐soluble monomers from the polymerization recipe, secondary (homogeneous) nucleation must be minimized by careful addition of the free‐radical initiator and choice of monomer feed flow rates. The nucleation of the third population in the trimodal latices is best accomplished with a mixed surfactant system because renucleation by anionic surfactant alone leads to detrimental changes in the particle size distribution (PSD) resulting from excessive flocculation of particles. In addition, it was found that the viscosity of the final products was not sensitive to small changes in the ionic strength of the latex, although neutralization to a pH of 6 effectively doubles the final latex viscosity. © 2002 Wiley Periodicals, Inc. J Appl Polym Sci 84: 1916–1934, 2002; DOI 10.1002/app.10513