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

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

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.     

在UNIX工作站上实现SYBASE数据库的空间扩展

七号信令网管系统的数据库服务器采用惠普UNIX工作站及SYBASE数据库。由于采集的数据量增大，原先设计的数据库空间不能满足数据存储三个月的要求．因此采用一块外置硬盘对数据库空间进行扩展。详细地介绍了SYBASE数据库空间扩展的全过程。     

钻孔灌注桩施工中常见质量事故的控制和防治

介绍了钻孔灌注桩成孔质量的影响因素 ,详细叙述了钢筋笼的制作和吊放处理步骤 ,阐述了断桩发生的原因 ,提出了具体的防治措施 ,经实践效果良好     

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.     

Perfect Blind-Channel Shortening for Multicarrier Systems

In multicarrier systems, when the order of a channel impulse response is larger than the length of the cyclic prefix (CP), there is a significant performance degradation due to interblock interference (IBI). This paper proposes a blind-channel shortening method in which the equalizer parameter vector is formed by the noise subspace of the received signal correlation matrix so that the output power is maximized. The proposed method can not only shorten the effective channel impulse response to within the CP length but also maximize the output signal-to-interference-and-noise ratio while eliminating the IBI. We point out that the performance depends on the choice of a decision delay and propose a simple method for determining the appropriate delay. We propose both a batch algorithm and an adaptive algorithm and show by simulation that they are superior to the conventional algorithms.     

憎水性栀子蓝色素制备的研究

以浓盐酸为催化剂,采用乙酸酐酯化处理水溶性栀子蓝色素,制备了憎水性栀子蓝色素.探讨了栀子蓝色素与乙酸酐料液比、反应时间和反应温度等因素对憎水性栀子蓝色素色价的影响.结果表明:采用料液比1:20,在常温下反应4 h,为制备憎水性栀子蓝色素的最优条件.同时,通过红外光谱、可见吸收光谱及溶解性对栀子蓝色素的酯化改性进行了初步的探讨.     

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).