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.     

个性化公开密钥系统的设计

论文提出利用用户提供的个性化信息来随机产生关联大素数,保证了素数选取的随机化、个性化,提高了RSA算法的安全性。     

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

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

人工免疫原理在网络入侵检测系统中的研究

文章分析了人工免疫系统的原理,简单建立了一种基于否定选择算法的网络入侵检测系统,引入了一种用于异常事件识别的r-字符块匹配规则,并对规则存在的漏洞进行了分析。     

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

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

并行算法在软件无线电多DSP平台的应用

近年来，随着软件无线电的发展，用于软件无线电平台中的多DSP并行结构受到越来越多的关注，因为这种结构能提高数字信号处理的速度。提出了一种适合在该平台上并行运算的算法，以多阶FIR滤波器为例，验证了算法，并探讨算法的性能，给出了该算法在多处理器条件下，与单处理器处理结果的比较。对选取合适的软件无线电中频处理多处理器平台具有一定的参考价值，并对舰载软件无线电的实现提供了科学参考。     

IP网络上电路倍增设备的研究

简要介绍了通过IP网络上电路倍增设备(IP CME)的数据流的处理过程;IP CME中的复用技术;控制IP包发送的激活算法;网络发生拥塞丢包的处理方法;并在传输效率和信令处理2个方面与VOIP进行比较,可以看出IP CME具有很大的优越性和良好的发展前景。     

随机减量技术中周期激励的影响及消除方法

本文针对机械系统中通常存在确定性周期激励的事实 ,论证了周期干扰成分的存在对提取的随机减量特征信号的影响 ,基于数字滤波技术提出了一种从周期干扰环境中提取随机减量特征信号的简便方法。在回转机械稳定性监测中的应用实例表明本文提出的方法是有效的。     

渤海绥中油田J3井疏水缔合聚合物驱数值模拟研究

为了进一步提高渤海油田J3井区缔合聚合物驱的技术经济效果,在渤海油田室内配方和先导性矿场试验研究基础上,利用化学驱油藏数值模拟软件FAPMS,分析和研究了高浓度缔合聚合物前置段塞、主段塞的大小和浓度以及段塞组合方式对驱油效果的影响,优化设计了渤海绥中油田J3井区块矿场试验的最佳注入程序及段塞大小。结果表明,通过对不同浓度的疏水缔合聚合物注入的前置段塞及主段塞和梯度式后续段塞的优化后,原油采收率比未优化时提高了约10个百分点。研究表明,渤海油田应该高度重视聚合物驱的注入方式和段塞优化设计,进一步提高聚合物的技术经济效果。     

径向基函数神经网络的再学习算法及其应用

为了应用径向基函数神经网络逐步地识别待研究系统,文章针对径向基函数神经网络的再学习算法开展了深入的研究.应用严格的数学推理方法,将径向基函数神经网络的再学习问题转化为矩阵求逆的附加运算.详细给出了径向基函数神经网络再学习算法中增加新训练样本和增加新基函数的数学公式,同时对如何获取新的训练样本进行了研究.