Corrosion morphology of AZ91D exposed in an atmospheric environment

The focused ion beam technique was employed to investigate the atmospheric corrosion morphology of AZ91D. It was found that the α matrix of the alloy was preferentially corroded in the areas adjacent to intermetallic phases. The most interesting finding was that the corrosion products in corrosion cavities were pelletlike, which has never been reported before.     

EGD级环保型润滑油及其生物降解性

 经生物降解性评定和粘度测量确定了EGD级生物降解二冲程润滑油复合基础油的组成；通过发动机清净性试验确定了添加剂组成配方和总添加量。在此基础上，研制了生物降解二冲程油(Oil B)，其达到了ISO EGD级二冲程油标准中规定的6个发动机性能指标和2个理化性能指标，生物降解性达到73.1%。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

Finding all hops shortest paths

In this letter, we introduce and investigate a new problem referred to as the All Hops Shortest Paths (AHSP) problem. The AHSP problem involves selecting, for all hop counts, the shortest paths from a given source to any other node in a network. We derive a tight lower bound on the worst-case computational complexities of the optimal comparison-based solutions to AHSP.     

基于单片机加压控制的PCD复合片真空扩散焊接

文章针对普通钎焊的聚晶金刚石钻头剪切强度不高，提出了采用单片机加压控制的PCD复合片真空扩散焊接的设计思想，在对原真空扩散焊机液压改造的基础上给出如何由单片机控制加压的电路和程序流程设计。实际应用表明，该技术经济实用，有较好的经济效益。     

聚合物熔体的非等温平板收缩流动的数值模拟

用有限元法模拟了Carreau流体在4：1平板收缩口模中的非等温挤出流动，采用3节点的三角形单元对速度、压力和温度进行等阶插值，运用特殊的罚函数处理流体的不可压缩条件，解决了压力场的数值振荡问题，并用改进的Newton迭代法对非线性方程进行求解，成功地计算了Carreau流体在平板收缩流动中的速度、压力、粘度以及应力的分布，同时得到温度场的分布，计算的应力分布与实验的结果及Renardy的分析结构相符。     

一种PDMS薄膜型微阀的制备与性能分析

通过厚胶光刻工艺在硅片上制备SU-8胶模板，利用该模板制备了高分子聚合物PDMS(Polvdimethvlsiloxane，聚二甲基硅氧烷)微流道和薄膜结构。通过对不同结构的两层PDMS的不可逆粘接得到一种简单的阀结构，在外加气源压力作用下薄膜产生变形实现对微流道的控制。实验测量了微阀的控制气源压力与被控制液体流量之间的关系，说明膜阀的开闭性能良好。根据弹性薄膜的变形理论，对影响微阀性能的参数进行了分析，并提出了几种可行的用于薄膜微阀控制的方法。     

一种基于空间到达角的卫星电子侦察信号分选方法

在建立简化的卫星电子侦察空间模型的基础上，提出了一种利用空间到达角分选卫星电子侦察信号的新方法。通过仿真实验验证了这种方法的可行性。该方法可用于密集信号的预处理。     

新结构MOSFET

和传统平面结构MOSFET相比，新结构MOSFET具有更好的性能(如改善的沟道效应(SCE)，理想的漏诱生势垒降低效应(DIBL)和亚阈值特性)和更大的驱动电流等。文章主要介绍了五种典型的新结构MOSFET，包括平面双栅MOSFET、FinFET、三栅MOSFET、环形栅MOSFET和竖直结构MOSFET。随着MOSFET向亚50nm等比例缩小，这些新结构器件将大有前途。     

高压气体流量测量中流量计的选择和应用

结合高压气体流量测量的实际使用情况,根据使用对象和范围,对几种适合工作要求的流量计的特点进行了分析比较,重点介绍了热式质量流量计和Coriolis力质量流量计的原理,以及它们在研制工作中的应用情况和需要注意的问题.