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

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

Parameters evaluation of SOLA algorithm for time scale modification

Successful operation of the Synchronous Overlap and Add (SOLA) algorithm for Time Scale Modification (TSM) of speech is closely tied to the proper choice of parameters. This paper investigates the quality of time scale modified speech under different values of primary parameters. Based on Mean Opinion Score (MOS) tests and Bark Spectral Distortion (BSD) measure, the proper choices of synthesis shift (Ss) and the duration of the shift search interval (K _max?) are given experimentally. The conclusions can be helpful for operating the SOLA algorithm for time scale modification of speech.     

西藏南部地区人工爆炸地震探测的地壳结构

众所周如,西藏地区是研究地球深部结构和构造的窗口,是研究大陆板块学说的重要场所,也是寻找热源和其它矿产资源的有利地区.因此,世界各国地学科学家都希望在本地区进行科学研究工作,或与我国科学工作者协作共同探索这一重要地区.中国和法国的地质、地球物理科学家经商讨共同组成“中法喜马拉雅山地质研究队”,对西藏中部广大地区进行地质、地球物理的科学研究工作.深部地震探测是地球物理研究中的重要内容.中法双方共同决定,在中国西藏南部的日喀则地区至北边的那曲地区作地震探测工作.为了探测地壳上地幔的结构,1981年在西藏的南部佩枯错至普莫雍错500公里的喜马拉雅山北麓——雅鲁藏布江地区进行了人工爆炸地震探测工作.本文是中法地质研究队合作的深部地震探测资料的解释结果.     

吊车防摆最优调节器设计

本文对吊车在吊装货物时如何消除货物的摆动进行了研究,提出了利用最优状态调节器进行消摆的方案,并进行了计算机仿真和在吊车模型上的实时控制实验,结果表明,该方法具有很好的消摆效果和较强的鲁棒性。     

行星齿轮传动动态均载测试及误差源的频谱分析

行星齿轮传动不均载的原因主要是由于行星齿轮传动装置各零部件存在着加工和装配误差,而各种误差对均载的影响情况又是不同的。本文通过对行星齿轮传动的每一个行星轴的受力弯曲变形进行比较,求得动态载荷分配情况。通过对行星齿轮减速器的载荷变动曲线进行频谱分析,找出各误差对行星齿轮减速器的均载性能的影响程度。     

创建新机制再造新优势推进新时期农建持续健康发展

针对农村税费改革后农建面临的新形势、新任务,阐述了建立农建新机制的重大意义,就组织开展农建的方式方法和建立农建投入机制、运作机制、管理机制等方面进行了探讨和论述,提出了具体的对策措施。     

Further results on local stability of REM algorithm with time-varying delays

This letter presents some further results on the local stability in equilibrium for Internet congestion control algorithm proposed by Low et al., (IEEE/ACM Transactions on Networking, 1999). The propagation delay d(t) is assumed to be time-varying and have maximum and minimum delay bounds (i.e., d/sub m//spl les/d(t)/spl les/d/sub M/), which is more general than the assumption (0相似文献   

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.