土木工程施工课程线上平台教学实践

土木工程施工课程作为土木工程及工程管理专业的学科基础课和核心专业课程,在疫情防控期间"停课不停教""停课不停学"的要求下,通过线上平台进行授课。由于土木工程施工课程内容庞杂、综合性强、实践性强,且章节之间关联性较弱,探究既能使学生快速适应,又能保证教学质量的在线教学方法至关重要。以华南某高校土木工程施工课程为例,基于中国大学MOOC、建筑云课、腾讯课堂、QQ群等线上平台讲授教学内容,并运用问卷调查对课程线上教学效果进行评价。结果表明,线上教学为学生提供了丰富灵活的学习方式,显著提高了学生的自主学习能力,扩大了学生的知识面,达到了较好的学习效果。     

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）的理论分析模型。在此基础上，对增益平坦设计所需考虑的因素进行了分析；最后通过试验证明了它的有效性。     

一种新的线性分布参数系统辨识方法

本文应用块脉冲函数（ＢＰＦ）将含有未知参数的线性分布参数系统偏微分方程转换为矩阵方程，通过最小二乘法辨识线性分布参数系统的参数，辨识结果表明，ＢＰＦ辨识法具有原理简捷，实现方便，辨识精度高等优点。     

局部设有钢筋砼电梯井墙的设计探讨

本文就局部设有钢筋砼电梯井的工程计算及理论分析，阐明分析了少墙的框剪结构的设计及注意问题。     

基于CDMA智能网平台的增值业务--"位置服务"

本主要介绍基于CDMA智能网平台的一种增值业务——“位置服务”，阐述这个业务的网络结构、涉及到的技术问题和解决方案，并将这个整体思路投入到开发业务中去。     

船闸直立墙基坑开挖与锚固施工程序

三峡船闸深槽开挖与锚固工程量大，工期紧，施工强度高，施工难度大。因此，合理的施工程序有利于边坡稳定和施工，是快速和高质量施工的关键。分析了永久船闸直立墙基坑开挖与锚固施工程序的复杂性和进行研究的必要性。介绍了设计阶段研究船闸开挖与锚固的施工程序。对施工过程中研究施工程序时考虑的因素，研究的主要内容以及实际采用的施工程序作了简要的分析，归纳和总结。     

永定新河治理工程几个关键问题的研究

永定新河是天津市防洪的北部防线。由于受海相来沙淤积 ,河道行洪能力大幅度下降。针对永定新河治理工程设计中涉及到的河道淤积治理方案、闸位比选、防潮闸结构型式及施工方法、闸下减淤清淤措施等诸多问题进行了分析和研究 ,提出了相应的措施和建议