基于有限状态的全周期序列混沌映射的研究

在有限长度的数字计算机中，混沌迭代序列是一个有限周期序列，其相关性能远远低于理想序列。基于skew tent映射，提出一种离散化的有限状态混沌映射，它允许精确的数值计算，没有舍入误差，通过选择合适的参数，映射能产生全周期长度的序列。仿真实验表明，归一化的序列平均周期对计算机精度不敏感，生成的二进制序列具有良好的相关性能。     

高温酸化助排剂HC2-1的研究

为了满足高温油藏和深井酸化作业残酸返排的需要，通过表面活性剂的筛选和复配研究，得到了高温酸化助排剂HC2—1。其性能评价结果表明，HC2—1具有使用浓度低、表面活性高的特点，在20％的HCI溶液中，当其浓度为50mg／L时，表面张力为20．7mN／m；具有良好的耐温性能，在180℃下恒温48h，HC2—1仍保持较高的表面活性；具有良好的耐盐能力，加有HC2—1的20％HCl溶液和CaCO3反应至HCl完全消耗，整个反应过程体系无新相生成且表面张力基本不变；可增大酸液体系的润湿角，进一步降低毛细管阻力，使酸液返排率由46％提高到97％，在促进酸液返排的同时与原油不发生乳化反应。     

电荷耦合器件积分时间对微型成像系统成像质量的影响

在光圈固定的情况下，确定合适的积分时间对于提高微型电荷耦合器件(CCD)成像系统的成像质量，增强微型飞行器的侦察能力具有十分重要的意义。本文讨论了决定CCD积分时间的各种因素，重点研究了适用于微型飞行器的CCD成像系统的积分时间与像移的关系，并进一步推导了计算像移量的相关数学模型。利用该模型对不同积分时间内采集的运动图像进行了像质评价，结果表明，在保证曝光量的前提下，当像移量被限制在1个像素内时，可以获得相对理想的运动图像像质。     

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.     

热作模具钢表面激光堆焊耐磨合金层的研究

本文主要通过在H13钢上用大功率CO_2激光束进行堆焊,阐述了激光堆焊工艺变化对堆焊组织和性能的影响,在本试验条件下,得到了高密度弥散金属化合物组织的激光堆焊层,平均硬度为HV800,与基体呈冶金结合,耐磨性比H13模具钢提高149%。     

Characterization and optimization of copper chemical mechanical planarization

The feature scale planarization of the copper chemical mechanical planarization (CMP) process has been characterized for two copper processes using Hitachi 430-TU/Hitachi T605 and Cabot 5001/Arch Cu10K consumables. The first process is an example of an abrasive-free polish with a high-selectivity barrier slurry, while the second is an example of a conventional abrasive slurry with a low-selectivity barrier slurry. Copper fill planarization has been characterized for structures with conformal deposition as well as with bumps resulting from bottom-up fill. Dishing and erosion were characterized for several structures after clearing. The abrasive-free polish resulted in low sensitivity to overpolish and low saturation levels for dishing and erosion. Consequently, this demonstrated superior performance when compared to the International Technology Roadmap for Semiconductors (ITRS) 2000 roadmap targets for planarization. While the conventional slurry could achieve the 0.13-μm technology node requirements, the abrasive-free polish met the planarization requirements beyond the 0.10-μm technology node.     

多孔板体结构足尺性能分析及材料基本要求

本文就利用诸如蛋白石这样的疏松多孔矿料同灰土构成的混合料，在路面结构中表现出的独特有效的抗冻作用机理作了深入分析，并结合足尺试验数据加以验证。阐述了所谓多孔板体结构的概念、机制和材料组成要求。     

基于信息的智能控制理论研究

本文介绍的基于信息的智能控制理论的发展过程，主要分为智能控制的信息指标和智能控制的信息结构分析两部分，文中在最后对这套理论可能的发展方向进行了探讨。     

高速网络协议：问题与答案

作者在本文中指出了吉比特网络的目标及其所带来的问题，采用了提出问题并回答问题（或说明可能答案）的方法来阐明。     

An algorithm for architecture partitioning in high-speed networks with bursty traffic

This paper analyzes the performance of a switching architecture. The performance measures include the elapsed time of packet transfer and the waiting time to begin transfer. The architecture is partitioned depending on the type of network used and the expected traffic in the network. Every partition has a switch with a buffer that can absorb surges of bursty traffic within the network partition. The buffer size depends on the type of the network and incoming traffic. The partition size depends on the network bandwidth, network traffic, packet size and buffer size. Examples of different networks are used to show the applications of the model. The results show that the elapsed time of packet switch transfer depends exponentially on the number of partitions in the network.