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.     

Pathogenicity of three species of entomopathogenic nematodes to some major stored-product insect pests

Entomopathogenic nematodes (Nematoda: Heterorhabditidae and Steinernematidae) are commonly used biological control agents of insects in cryptic habitats, but their potential for suppressing stored-product insects in these habitats has not been explored previously. Here, we provide data from the first step in a program to evaluate entomopathogenic nematodes in the genus Steinernema as biological control agents of stored-product pests by determining their pathogenicity to some of the major stored-product pest species. When evaluated against larvae, pupae and adults of six pest species (Plodia interpunctella, Ephestia kuehniella, Oryzaephilus surinamensis, Tenebrio molitor, Tribolium castaneum, and Trogoderma variabile), and the adults of two additional pest species (Sitophilus oryzae and Rhyzopertha dominica), Steinernema riobrave was either the most pathogenic or of similar pathogenicity compared to S. carpocapsae and S. feltiae. A dose of 10 infective juveniles of S. riobrave caused 80% or higher mortality against larvae of P. interpunctella, E. kuehniella, T. castaneum, and O. surinamensis, pupae of T. castaneum and T. molitor, and adults of T. molitor and the two moth species. All stages of Trogoderma variabile exhibited 70% or higher mortality. Adults of S. oryzae and R. dominica exhibited low susceptibility with 15% and 35% mortality, respectively. On the basis of these results, S. riobrave was selected for further evaluation under more field-like conditions.     

动力环境集中监控系统可靠性的提高

为实现电源设备乃至通信机房的少人或无人值守和集中维护,必须建立一套完善的电信局动力环境集中监控系统。文中结合番禺区电信局的实际,讨论了提高系统运行可靠性的几点措施,包括硬件方面与软件方面的手段,关键在于加强系统的运行管理。     

浅谈DC/DC变换器控制新方法

文中针对DC/DC变换器的特点,在现有控制和建模方法的基础之上,对DC/DC变换器的现代控制方法进行了归纳和总结,简要讨论了其控制原理,并比较了各种现代控制方法的优缺点,最后对DC/DC变换器控制方法的发展作了一定的展望。     

教育要有针对性管理要有强制性

分析高职学生思想状态的多层次性,提出以正面的思想教育和启发引导为主,同时加强规章制度的制约性,以提高教育管理工作的效果.     

微制造平台微振动的最优控制

采用混合隔振技术建立了微制造平台隔振系统。该系统以空气弹簧和橡胶层作为被动隔振元件、超磁致伸缩致动器作为主动隔振元件，并采用最优控制理论设计其主动控制器。研究了在不同的性能指标加权阵的情况下，该主动振动控制系统对基础干扰和由微制造设备产生的直接干扰所引起的微制造平台振动的控制效果。研究表明性能指标加权阵对振动控制效果影响非常大。通过大量的仿真实验确定了一组性能指标加权阵，使所设计的主动控制系统能在较宽的频率范围对基础干扰和直接干扰所引起的微制造平台振动进行有效的控制。     

MIMO系统的约束广义预测控制

讨论了输出终端带不等式约束情形的多输入多输出系统，说明了这些约束可以通过修改输入柔化系数而使其得以满足，在柔化系数的选择范围确定过程中，为了避免矩阵求逆，采用利用已知数据辨识参数的方法来确定柔化系数，从而使得问题简化。降低了计算量且加快了收敛速度。     

动力环境网络监控精细管理

叙述动力环境运行质量分析管理，包括故障管理，性能管理和专题分析管理，以动力环境网络监控细致八微、言之有据的月度分析管理实例展现了其精细管理的效果。     

影响地下室防水工程质量的因素及对策

分析了影响地下室防水工程质量的主要因素，并对其质量控制提出了几点建议，可供实际工程参考。     

光缆接续损耗的工程控制

本从影响光纤损耗的主要因素分析着手，提出了光缆接续损耗工程控制的简洁有效的方法。