Handover and Uplink Power Control Performance in the 3.84 Mcps TDD mode of UTRA Network

In this article we consider the performance of the 3.84 Mcpstime-division duplex (TDD) mode of UTRA (Universal TerrestrialRadio Access) network. We emphasize two of the radio resourcemanagement algorithms, handover and uplink power control, whoserole in the overall system performance is studied extensively.First, a handover algorithm used in WCDMA (Wideband Code DivisionMultiple Access) standard is considered in a TDD-mode operation.This gives rise to a careful setting of different handoverparameters, and the evaluation of the effects to the systemperformance. Secondly, the specified uplink power controlalgorithm is considered. Since it is based on several user-mademeasurements which may involve both random and systematic errors acareful study about the suitability of the power control scheme iscarried out.     

横泉水库供水发电洞工程地质分析与评价

通过大量野外工程地质勘察与测试工作，在此基础上给出了横泉水库供水发电洞的工程地质分析与评价，从而使该水库的施工有了充分的理论依据。     

移动通信系统中功率控制研究

在阐述功率控制在移动通信系统中的发展过程的基础上，着重研究了WCDMA系统的功率控制，最后对功率控制未来的研究方向做了简要的分析。     

稳压并抑制谐波的新型电源

由于电网谐波污染严重，对谐波的抑制已成为供电部门的重要任务。文章介绍一种既能稳压又能抑制谐波的新型电源，它采用串联型有源电力滤波的方法，通过瞬态电压补偿后可得到纯净的三相正弦平衡电压。     

一种新型注入剖面组合测井仪及其应用

为了提高注入剖面测井的准确性，研制了一种新型注入剖面组合测井仪。该仪器由流量处理单元、伽马处理单元、井温处理单元、磁性定位处理单元、调制式传输、电源电路六部分组成。一次下井可同时测取流量、伽马、井温、磁性定位四组参数。具有测取资料精度高、单芯电缆传输、流量可单点测量也可连续测量以厦现场监测和维修方便等特点。     

FF现场总线的网段负载能力的设计及计算

从生产安全运行的管理要求；电压压降和电流的限制及信号的衰减；网络运行时间的要求；系统设计的影响；备用能力的考虑等各个方面，结合上海赛科聚苯乙烯项目的具体设计，分析隔爆条件下FF现场总线的H1网段负载能力的设计，以供大家探讨。     

应用API 581对输气站场进行定量风险评价

目前专门针对输气站场的风险评价方法还不多，现有的手段也只是根据国家法律法规得出定性的评价结果，然后按照评价结果对照得出整改方案。为此，对输气站场的定量风险评价工作提出了一套新方法，得到了定量的和更加客观的风险排序，为管道站场的完整性管理工作提供了有力的支持；并以陕京输气管道榆林压气站为例，应用美国石油学会标准API 581（基于风险检测的基本源文件）对站内设施进行了风险评价，计算了站内设备和管线的失效后果、失效概率，得到了定量风险值，进而分析了风险值产生差异的原因。最后，针对我国输气管道风险评估工作提出了看法和建议。     

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.     

设计阶段的工程造价控制管理

从设计招标和方案竞选、设计方案的优化、标准化设计、限额设计、技术培训等方面分析了设计阶段造价控制和管理的特点，指出只有把控制造价的关键阶段确立在设计阶段，才能实现工期短、节约成本、效益显著的目标。     

江阴长江公路大桥钢箱梁体受力分析

介绍了对大桥的风向、风力和交通流量的测试依据和内容，分析了风向、风力的测试结果以及梁体在风力及交通流量等作用下的受力情况，指出钢箱梁体主要受到的力是风力。