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.     

Implementation of RNS-Based Distributed Arithmetic Discrete Wavelet Transform Architectures Using Field-Programmable Logic

Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength).     

分布式光纤拉曼放大器的增益平坦设计

介绍了在波分复用（WDM）系统中分布式光纤拉曼放大器（FRA）的理论分析模型。在此基础上，对增益平坦设计所需考虑的因素进行了分析；最后通过试验证明了它的有效性。     

双波长稳频CO_2激光模糊控制系统的建模与优化

报导一种模糊逻辑控制系统的建模与优化方法。以此方法设计的模糊逻辑控制器，用于双波长稳频ＣＯ２激光器的控制得到令人满意的结果。     

Effects of Spatial Characteristics on Smart Antenna System with Uniform Linear Antenna Array

1IntroductionCurrently,smart antenna technology can greatly en-hance system performance and i mprove the system ca-pacity so that it has been considered as a keytechnologyinthe third generation wireless communicationsystems .The researches on channel model , beamforming algo-rithms and receive algorithms have been widely carriedout and a great many of proposition have beensubmittedtothe 3th Generation Project Partner (3GPP) . Fromthe viewpoint of link-level and system-level research,many asp…     

单光子态的产生与测量

报道了通过自发参量下转换产生单光子态的实验研究,使用中心波长425 nm的飞秒脉冲泵浦Ⅰ类非共线相位匹配的BBO晶体,在实验上得到单光子计数率为2.978×10-4,并分析了实验中的相关问题.     

一种动态开关电容运算放大器共模负反馈电路

本文主要介绍了一种应用于Cascode结构运放中的开关电容共模负反馈电路，它具有稳定性好、对运放频率特性影响小、不消耗额外功率等优点。对电路运用Hspice进行了模拟，并给出了模拟结果。     

用于激光推进的高功率激光器的选择

 从激光推进的要求出发，阐述了用于激光推进的高功率激光器的选择原则，即激光器必须满足：（1）高的平均功率和峰值功率；（2）高的单脉冲能量；（3）高的重复频率；（4）优良的大气传输特性。主要分析了目前YAG固体激光器、自由电子激光器和TEA脉冲CO₂激光器的特点，通过上述4个方面性能的比较，认为在目前水平下，TEA脉冲CO₂激光器是进行激光推进的首选强激光源，其优点表现在：功率可达10kW量级，单脉冲能量可达0.5~1kJ，重复频率为20~40Hz；激光波长处于大气传输窗口，对大气变化不敏感；工作物质快速流动，不存在热透镜效应和破坏阈值；相关光学元件易于制造；光束质量较好；运行成本低。     

激光平网雕刻机设计

研制了用于制作平面网版的激光雕刻机，设计了雕刻机用CO2激光器、光路系统及单片机控制系统，探讨了将图像文件转化为控制命令文件的方法。