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.     

人工智能的原理及应用

介绍了人工智能的发展，并对改进的神经网络专家系统的优越性做了介绍，指出了神经网络专家系统广阔的应用前景及实现。     

浅谈在多节目码流复用与解复用中PID码的作用

文章简要阐述了PID码在多节目码流的复用与解复用中所起的作用。并运用PID码的原理来解释和解决在实际工作中碰到的PID码问题。     

基于遗传算法的服装工序编排规划

本文讨论了建立服装工序编排系统的必要性，在进行服装工序拆分、合并的基础上，应用遗传算法建立了以流水线平衡为目标的服装工序编排模型．     

基于MATLAB的风能自校正自调整PID模糊控制器仿真研究

为了提高风力发电系统综合系统性能,在传统风力发电技术的基础上,对变速风力发电机组的自校正自调整PID模糊控制进行了详细的分析和研究,从而利用模糊控制和PID控制相结合的技术,取得了很好的效果。从MATLAB仿真结果看出系统精度及效率很高而稳态误差较小,鲁棒性较好。     

饼干炉湿度控制的改进方法

在大空间的温度控制系统中 ,采用简单的PID控制规律 ,对空间的温度、湿度进行解藕计算 ,将空间的相对湿度控制转化为送风含湿量的控制。该控制方式稳定、可靠 ,并且节约能源。本方法适用于所有的烘烤炉中     

A survey of parallel execution strategies for transitive closure and logic programs

An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods. Recommended by: Patrick Valduriez     

小型工业炉窑燃烧过程的智能控制

本文论述了对小型工业炉窑燃烧过程进行智能控制的一种设计思想。该控制器用智能PID调节器控制炉温作为主控回路,用自寻最优控制空燃比作为副控回路。是一种既满足燃烧过程多目标要求,又造价低廉的智能控制器。     

一类专家模型参考自适应控制

本文将专家系统技术和模型参考自适应控制相结合，提出了一种新的基于专家系统模型参考自适应控制，该系统集智能控制思想与专家技术于一身，从而得到很强的控制律，为验证其有效性，以两关节机器人为对象进行仿真，在有负载扰动情况下，该系统能使机器人跟踪上希望轨迹，其系统响应和鲁棒性优于常规的控制算法。