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.     

常压炉炉管及转油线的腐蚀

通过对常压炉炉管及转油线腐蚀情况的分析,认为该炉发生转油线腐蚀泄漏的主要原因是原油含硫量升高、冲刷加剧、材质不适合以及设备老化等。针对腐蚀的成因采取了对整个转油线进行包盒子处理、材质升级、摸清活性硫在装置中的分布情况和腐蚀规律、开展高温部位定点测厚、避免高含硫原油直接进入装置等措施。     

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

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

中国大陆PCB产业自动化的现况与未来

从中国大陆PCB发展的现况分析实行设备自动化连线为企业所创造的价值。设备自动化连线是中国大陆PCB必须面临的改革出路。     

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

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

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

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

集输系统热回水管线腐蚀分析

中国石油天然气股份有限公司华北分公司第三采油厂油气集输系统热回水管线普遍存在着腐蚀问题,影响原油生产和集输的正常运行。介绍了腐蚀较严重的13个站点的水质普查、水质结垢倾向和腐蚀性情况,并在水质分析的基础上进行了热水管线腐蚀因素的试验研究,确定腐蚀主要因素为水中的溶解氧含量高,从而造成腐蚀。     

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

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

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.     

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

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