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.     

一种基于无理数加密算法的数字签名方案

为了提高现代网络信息传输的安全性,利用无理数小数点后数字的无穷性、无规律性、分布均匀性,提出一种全新的加密算法,并用它所产生的密钥流进行数字签名,实现身份验证不可抵赖、信息传输无篡改,确保信息传输的完整性、真实性,达到提高加密效率、相互认证的效果。     

干涉型激光直写技术用于光盘防伪

利用作者研制的干涉型激光直写系统，阐述了干涉型激光直写设计OVD的方法，防伪特征，介绍了应用于光盘防伪的OVD技术和应用前景，给出了实验结果。     

钻井井喷失控井喷流出口速度预测方法研究

失控井喷流出口速度、喷口内压力、喷层产量都是井喷失控处理方案设计、作业施工中重要的基础数据。由于井喷失控井井口环境条件复杂，井喷失控后无法在井口安装测量仪表及在高速喷流中放入参照物，不能直接获取以上数据。文章利用地质、钻井过程获得的地层物性参数和气体动力学方程，探讨井喷失控井天然气喷流在不同井筒流动尺寸及组合的喷流速度预测模型，可应用薄剪切模型或RNG修正的k-ε模型定量描述速度场、温度场、浓度场颁。为井喷失控井处理方案设计、施工作业提供基础数据。     

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

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

利用AutoCAD编制电气CAD

介绍如何利用AutoCAD开发适合电气专业使用的CAD系统，通过编制电气CAD的功能菜单，构造电气元件库，增强CAD的专业性能。编制电气CAD可以有效地统一本单位电气制图标准，方便电气工程师使用CAD进行专业设计。     

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

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

光电平台无角位移减振机构运动分析

分析了光电平台的工作环境和角振动对成像质量的影响，应用空间机构学原理和减振理论，设计了一种既具减振功能又能抑制角位移的无角位移减振机构。对减振机构的减振机理及运动特性进行了分析，并利用三维建模软件和MSC．Visual Nastran 4D仿真分析软件对该减振机构进行了三雏实体仿真分析，通过输出的仿真数据及曲线检验无角位移减振原理的正确性。     

通用串行总线(USB)接口芯片USBN9602的应用

简要介绍了通用串行总线USB的特点,对USB接口芯片USBN9602的内部结构、引脚、寄存器组作了详细的论述,并介绍了其应用。     

Computational analysis of thin coating layer failure using a cohesive model and gradient plasticity

Thermal barrier coatings (TBC) are widely used to prevent transient high temperature attack and allow components high durability. Due to strong inhomogeneous material properties the TBC failure often initiates near the interface between the brittle oxide layer and the ductile substrate. A reliable prediction of the TBC failure requires detailed information about the crack tip field and the consequent fracture criteria. In the present paper both cohesive model and gradient plasticity are used to simulate the failure process and to study interdependence of the interface stress distribution with the specific fracture energies. Computations confirm that combination of the two models is able to simulate different failure mechanisms in the TBC system. The computational model has the potential to give a realistic prediction of the crack propagation process.