一次盐水设备运行总结

介绍了内蒙古海吉氯碱化工股份有限公司6万t/a离子膜烧碱装置一次盐水设备的运行情况和运行过程中存在的问题及相应的技改措施.     

沈阳耀华500t/d浮法玻璃生产线技术改造简介

介绍沈阳耀华500t/d浮法玻璃生产线冷修技术改造情况,并对技改前后的主要技术经济指标进行了分析对比.     

驱蚊酯的合成及应用研究

本文合成了一种高效低毒驱蚊剂-驱蚊酯[(insectifuge ester)[1],3-(Acetyl-butyl-amino)-propionic acid ethyl ester],并对其结构进行了全面鉴定,同时对其合成过程中所产生的副产物进行了分析测定。用驱蚊酯配成含2.3%驱蚊酯的花露水,并测试了其驱蚊效果,有效驱蚊时间可达5小时以上。     

索风营水电站主要工程地质问题及勘测技术

索风营水电站因工程区喀斯特水文地质条件复杂,松散堆积体、危岩体、滑坡等不良地质体分布广泛,断裂、褶皱极为发育,故岩体连续性及完整性差,从而带来水库渗漏、枢纽区边坡稳定、库首渗漏、地下洞室喀斯特涌水涌泥、围岩稳定、软弱地基等一系列的工程地质问题,在乌江流域水电开发建设过程中具有代表性和典型性。本文从勘测、分析评价及工程处理等方面对该电站各种工程地质问题进行了总结。     

FeBP非晶态合金超细微粒的合成及其对PH3分解的催化作用

用化学还原法合成了FeBP非晶态合金超细微粒，用电感耦合等离子体光谱（ICP）、X射线粉末衍射（XRD）、透射电子显微镜（TEM）和差热分析（DSC）等手段对其进行了物性表征，并用微型催化反应装置考察了其对PH3分解的催化作用，结果表明，非晶态合金FeBP对PH3的分解具有良好的催化作用，能使PH3的分解温度从800℃以上降到500℃左右。490℃时分解率超过90％，540℃时达100％。     

软交换技术的发展及其应用

软交换是下一代网络NGN的核心技术，本文从软交换的概念入手，介绍了软交换的基本功能及其优点．软交换的网络系统结构、软交换的对外接口等内容，并探讨了软交换技术的应用。     

冲击噪声背景下的近场源二维参数估计方法

本文针对背景噪声为冲击噪声的情况,提出了一种新的近场源二维参数估计方法.本方法利用协变异(或协变异系数)构造矩阵,并通过求根的方法估计近场源的方向角和距离参数.该算法可以抑制冲击噪声对估计性能的影响,同时具有无需谱峰搜索的优点.仿真实验证明了该算法的有效性.     

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.