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.     

Wavelength and Waveband Assignment for Ring Networks Based on Parallel Multi‐granularity Hierarchical OADMs

In this paper we study the optimization issues of ring networks employing novel parallel multi‐granularity hierarchical optical add‐drop multiplexers (OADMs). In particular, we attempt to minimize the number of control elements for the off‐line case. We present an integer linear programming formulation to obtain the lower bound in optimization, and propose an efficient heuristic algorithm called global bandwidth resource assignment that is suitable for the design of large‐scale OADM networks.     

用一种免疫遗传算法求解频率分配问题

频率分配是一NP完全问题,本文用一种基于免疫调节机制的免疫遗传算法来求解.该算法结构类似于遗传算法;核心思想是将个体集构造为抗体网络,利用免疫浓度调节机制在个体层次调节个体的多样性,同时利用免疫网络调节理论在种群层次调整个体多样性和群体收敛性之间的动态平衡,从而克服了一般遗传算法的不足.本文同时用该算法解决固定频率分配和最小跨度频率分配问题,取得了较好的效果.     

交通平衡分配下的公路桥收费策略

假定一个城市被一条河流分为两部分（如我国的武汉，重庆等市），河上至少架设了两座公路桥梁，本文研究在交通平衡状态下，怎样制定车辆过桥梁的收费水平，使获得的总收入最大，乘客的总行驶时间最少，对多车种问题，研究了等价的数学模型和算法。还对一个含两座桥梁与三种车型的简单算例，进行了计算与分析。     

大系统分散鲁棒容错控制的进展及主要成果

综述了近２０年来关联大系统分散鲁棒容错控制的研究动态及取得的主要成果。说明了统一地研究分散鲁棒容错控制的必要性。在分散控制、鲁棒控制和容错控制研究领域内，分析了各种设计方法的主导思想及实质；指出了这些研究成果的意义与存在的问题。文中着重论述了分散、鲁棒、容错控制研究方法的发展途径。     

应用于ROHC的窗基LSB编解码修正算法实现机制

在移动：IPv6中，常常因为数据分组的头标太大而消耗过多的带宽，因而需要使用灵活可靠的鲁棒性头标压缩机制(ROHC)来对分组头标进行压缩。在ROHC中，使用LSB编码方案对分组中那些变化比较小的头标域进行编码。本文将在简要介绍ROHC原理的基础上，深入探讨应用于ROHC的窗基LSB编解码修正算法的实现机制。     

Robust State Feedback Control Through Actuators With Generalized Sector Nonlinearities And Saturation

In control systems, actuators often have nonlinear characteristics that can not be neglected. For linear systems driven by actuators satisfying the generalized sector condition, a robust state feedback controller synthesis method is proposed to achieve the ultimate boundedness control. The method is based on the linear matrix inequality approach and is easy to apply. As an important special case of the generalized sector condition, the saturation characteristic of actuators is discussed separately, and non‐conservative results are obtained.     

一类关于鲁棒性和敏感性的泛函的优化

本文给出了一类泛函的优化方法.这类泛函包括反映系统鲁棒性和敏感性的目标函数. 其优化是通过-Rm×n→Rm×n的映射来实现的.该映射将所有配置系统极点的反馈矩阵参数 化为一自由矩阵变量的函数.     

Adaptive control of siso plants with unmodelled dynamics

In this paper we pursue a twofold aim. First we want to simplify the complexity of the classical Monopoli's scheme, the so-called ‘Augmented error signal control scheme’. Then we also wish to cope with the realistic situation in which the presence of unmodelled dynamics has to be taken into account. This latter problem has been faced in the literature by suitably modifying the adaptation mechanism in order to avoid undesired phenomena as well as to obtain an attractive stability region for the state trajectories starting from any point in a predefined initial condition set. In our case the necessity of introducing any sort of modification in the adaptation mechanism is completely avoided, but we still obtain asymptotic stability of the output error signal.