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.     

超宽带极窄脉冲设计与产生

超宽带(UWB)技术是以持续时间极短的脉冲作为传输载体进行数据通信的无线新技术。基于BJT雪崩特性,本文采用并行同时触发的工作方式,设计并产生了高重复速率的UWB脉冲电路发生器,极大地减少了时延,缩短了上升时间,提高了脉冲的幅度,并从等效电路法的观点分析计算了脉冲的特性参数,理论结果与实测结果具有较好的一致性。     

移动式宽频带高产额中子发生器

多用途中子发生器有着广阔的市场和应用领域 ,文章对移动式宽频带高产额中子发生器 ,在设计制造过程中所涉及到的技术难点 :绝缘尺寸小、频率适应范围宽、为中子管提供靶压的高压负载特性好等作了技术分析 ,使多用途中子发生器在更广阔的范围内应用 ,提供了广阔前景。     

一种支持QoS的拓扑自适应动态组播路由算法

YAM、QoSMIC、DSDMR等一类支持QoS的动态组播路由算法允许组播成员动态地加入和离开，同时为接收方提供多个可选择的组播接入路径，以满足不同应用的QoS需求。但这些算法普遍存在控制信令开销大和结点加入时延长，可扩展性不好等问题。本文在分析这些算法的基础上，提出改进的支持QoS的动态组播路由算法，即拓扑自适应动态组播路由（Topology Adaptive Dynamic Multicast Routing，TADMR）算法。该算法避免了以往算法中大部分盲目的路径搜索，并使结点加入时延不再受限于固定的等待时钟，而与网络拓扑相自适应。性能分析和仿真结果表明，该算法具有较低的控制信令开销和结点加入时延，适用于各种网络规模和群组规模，具有良好的可扩展性。     

Network topology and the theory of rubber elasticity

The earliest investigations on rubber elasticity, commencing in the 19th century, were necessarily limited to phenomenological interpretations. The realisation that polymers consist of very long molecular chains. commencing c. 1930, gave impetus to the molecular theory of rubber elasticity (1932-). according to which the high deformability of an elastomer, and the elastic force generated by deformation, stem from the configurations accessible to long molecular chains. Theories of rubber elasticity put forward from 1934-1946 relied on the assumption that the junctions of the rubber network undergo displacements that are affine in macroscopic strain. The theory of James and Guth (1947) dispensed with this premise, and demonstrated instead that the mean positions of the junctions of a ‘phantom’ network consisting of Gaussian chains devoid of material properties are affine in the strain. The vital significance of the distinction between the actual distribution of chain vectors in a network and their distribution if the junctions would be fixed at their mean positions went unnoticed for nearly 30 years. Experimental investigations, commencing with the incisive work of Gee in 1946. revealed large departures from the relationship of stress to strain predicted by the theories cited. This discrepancy prompted extensive studies, theoretical and experimental, during succeeding years. Inquiry into the fundamentals of polymer networks, formed for example by interlinking very long polymer molecules, exposed the need to take account of network imperfections, typically consisting of chains attached at only one end to a network junction. Various means were advocated to make corrections for these imperfections. The cycle rank ζ of the network has been shown (1976) to be the fundamental measure of its connectivity, regardless of the junction functionality and pattern of imperfections. Often overlooked is the copious interpenetration of the chains comprising typical elastomeric networks. Theories that attempt to represent such networks on a lattice are incompatible with this universal feature. Moreover, the dense interpenetration of chains may limit the ability of junctions in real networks to accommodate the fluctuations envisaged in the theory of phantom networks. It was suggested in 1975 that departures from the form predicted for the elastic equation of state are due to constraints on the fluctuations of junctions whose effect diminishes with deformation and with dilation. Formulation of a self-consistent theory based on this suggestion required recognition of the non-affine connection between the chain vector distribution function and the macroscopic strain in a real network, which may partake of characteristics of a phantom network in some degree. Implementation of the idea was achieved through postulation of domains of constraint affecting the equilibrium distribution of fluctuations of network junctions from their mean positions. This led in due course to a theory that accounts for the relationship of stress to strain virtually throughout the ranges of strain accessible to measurement. The theory establishes connections between structure and elastic properties. This is achieved with utmost frugality in arbitrary parameters.     

RanGen: A Random Network Generator for Activity-on-the-Node Networks

In this paper, we describe RanGen, a random network generator for generating activity-on-the-node networks and accompanying data for different classes of project scheduling problems. The objective is to construct random networks which satisfy preset values of the parameters used to control the hardness of a problem instance. Both parameters which are related to the network topology and resource-related parameters are implemented. The network generator meets the shortcomings of former network generators since it employs a wide range of different parameters which have been shown to serve as possible predictors of the hardness of different project scheduling problems. Some of them have been implemented in former network generators while others have not.     

Ionothermal synthesis of a three-dimensional zinc phosphate with DFT topology using unstable deep-eutectic solvent as template-delivery agent

A three-dimensional zinc phosphate compound with DFT topology, designated as ZnPO₄-EU1, has been synthesized by an ionothermal approach from the system HF-ZnO–P₂O₅-choline chloride-imidazolidone. Ethylenediamine, derived from decomposition of the imidazolidone component of the deep-eutectic solvent (DES) itself, is delivered to the synthesis and serves as an appropriate template for ZnPO₄-EU1. Experiments in which the synthesis conditions were varied showed that ZnPO₄-EU1 may be prepared over a wide molar ratio of P/Zn = 0.55–13.0. Powder X-ray diffraction patterns have been obtained at intervals to track the crystallization process of this material. The experimental data show that Zn₃(PO₄)₂ · 4H₂O (a dense phase) was first isolated from the DES after reaction for 1 h. Subsequently, the pure phase of ZnPO₄-EU1 was obtained with increasing crystallization time from 12 h to 72 h. The experimental results show that the nucleation and crystallization take place with relatively low levels of solvent degradation, demonstrating that zinc phosphate with a three-dimensional framework can be synthesized by in situ generation of an appropriate template using an unstable DES at high temperatures (150–200 °C).     

Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays

In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results.     

Education-driven research in CAD

We argue for a new research category, named education-driven research (EDR), which fills the gap between traditional field-specific research that is not concerned with educational objectives and research in education that focuses on fundamental teaching and learning principles and possibly on their customization to broad areas (such as mathematics or physics), but not to specific disciplines (such as CAD). The objective of EDR is to simplify the formulation of the underlying theoretical foundations and of specific tools and solutions in a specialized domain, so as to make them easy to understand and internalize. As such, EDR is a difficult and genuine research activity, which requires a deep understanding of the specific field and can rarely be carried out by generalists with primary expertise in broad education principles. We illustrate the concept of EDR with three examples in CAD: (1) the Split and Tweak subdivisions of a polygon and its use for generating curves, surfaces, and animations; (2) the construction of a topological partition of a plane induced by an arbitrary arrangement of edges; and (3) a romantic definition of the minimal and Hausdorff distances. These examples demonstrate the value of using analogies, of introducing evocative terminology, and of synthesizing the simplest fundamental building blocks. The intuitive understanding provided by EDR enables the students (and even the instructor) to better appreciate the limitations of a particular solution and to explore alternatives. In particular, in these examples, EDR has allowed the author to: (1) reduce the cost of evaluating a cubic B-spline curve; (2) develop a new subdivision curve that is better approximated by its control polygon than either a cubic B-spline or an interpolating 4-point subdivision curve; (3) discover how a circuit inclusion tree may be used for identifying the faces in an arrangement; and (4) rectify a common misconception about the computation of the Hausdorff error between triangle meshes. We invite the scientific community to encourage the development of EDR by publishing its results as genuine research contributions in peer-reviewed professional journals.     

基于DSP+CPLD的高精度信号发生器

介绍了基于直接数字式频率合成(DDS)原理的全数字信号发生器(DSP),利用DSP芯片快速、高精度的运算优势以及CPLD芯片灵活的编程逻辑、大容量存储功能的特点,采用通用可编程芯片以及数字波形合成技术,形成高稳定、高精度、高动态的数字合成信号.该信号发生器可产生0～25 kHz的正弦波、三角波和方波,输出电压峰峰值为0～5 V,频率步进1 Hz,幅度步进0.001 V.