建筑给排水设计对住宅环境性能的影响及对策

阐述了建筑给排水工程师在实际工作中除必须满足国家有关强制性规范外 ,还应采取一系列针对性技术措施 ,以使住宅的环境性能得到良好的控制 ,以提高住宅的品质。     

Bücher

Ohne Zusammenfassung VDI     

中国铁通企业信息化战略规划和措施

首先简单回顾了中国铁通成立之初计费管理系统的一期建设和二期扩容后支撑能力的明显不足,以及信息化建设初期各部门独立IT系统运行中的问题,然后较详细介绍了企业信息化规划的整体思路.包括业务系统和流程、组织和业务流程重组、信息技术战略和架构等.并在实践的基础上,列举了信息化系统实施过程中应避免的做法和应注意的事项.     

驱蚊酯的合成及应用研究

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

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

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

电力线MAC/PHY集成收发器INT51X1及其应用

介绍了美国Intellon公司的电力线MAC/PHY集成收发器INT51X1的功能结构和主要特点 ,介绍了它的引脚功能 ,同时以中压配电网OFDM通信系统的研究开发为例 ,给出了INT51XI的应用实例。     

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

软交换是下一代网络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.