LTE系统多小区上行联合功控算法

针对传统的小区内开环功率控制算法通常以提升本小区的吞吐量性能为目标，忽略了当前小区用户对邻小区用户同频干扰的问题，为提升边缘用户性能的同时兼顾系统整体性能，提出了一种LTE系统小区间上行联合功率控制（UJPC）算法。该算法采用单基站三扇区为系统模型，以最优化系统吞吐量比例公平函数为目标，首先根据最小信干噪比（SINR）约束值和用户最大发射功率这两个约束条件得到相应的数学优化模型，然后采用连续凸近似的方法求解优化问题得出各个基站所管辖的小区内所有用户的最优发射功率。仿真结果表明，与基准的开环功控方案相比，联合功控方案在保证系统平均频谱利用率的情况下能够较大幅度地提高小区边缘频谱利用率，其最佳性能增益能达到50%。     

基于感知评价的Internet语音终端流量控制

分析了影响因特网语音通信质量的主要因素，根据实时传输控制协议计算延迟、丢包率等网络参数，并利用RBF神经网络将参数映射为语音质量评分，根据评分值的变化动态地调整语音终端的编码速率，在保证一定语音质量的同时，缓解网络拥塞。实验证明了该方法的有效性。     

现场总线在冶炼烟气制酸系统中的应用实践

分析了冶炼烟气制酸工艺的特点，介绍了由PROFIBUS-DP现场总线构建的冶炼厂烟气制酸监控系统，详细介绍了其硬件配置及相应的软件设计。     

乐滩灌区输水隧洞穿合山煤矿采空区处理设计

分析了乐滩灌区工程北干渠溯河隧洞段长约1.06 km穿合山煤矿采空区的地质情况.借鉴高速公路煤矿采空区的成功处理经验,通过科学分析,对采空区变形和区域内覆岩的稳定性做了评价,论述了输水线路穿采空区段采取全充填压力注浆法的工程处理方法.     

马钢二烧结配料计算机控制系统

阐明了马钢二烧结配科计算机控制系统的目的、控制形式、控制原理；根据烧结配料控制对象的特点对信号采样和控制算法进行了探讨；提供了系统的主要硬件结构，软件功能和程序框图。     

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系统的功率控制，最后对功率控制未来的研究方向做了简要的分析。     

川合137井大修井工艺技术浅析

在川合137井的修井作业中，运用了多种修井工具和工艺技术。通过内捞、外捞、强提、倒扣、磨铣、套铣、开钻新井眼和铣锥通井的方法，充分解放了油气层，达到了修井目的。其独特的想法、施工和自制工具的成功应用对今后大修井作业具有很高的参考价值。     

含硫化氢气井钻井过程中的腐蚀因素与防护研究

在含硫气井的钻井过程中对于HRC大于22的钻具钢材除了腐蚀疲劳之外，在pH值小于9的环境中会发生硫化物应力腐蚀破裂，这种破坏比腐蚀疲劳更突然、更快，使钻杆大量损坏。含硫气井在钻井过程中，由于湿硫化氢的出现，常常会出现油管、套管、钻井设备、钻井仪器以及对支持保护管柱的水泥环柱等腐蚀和损坏问题，为此，阐述了湿硫化氢的腐蚀特点、机理，归纳总结了影响腐蚀的因素，综述了如何在这些方面防止其腐蚀，使损失减小，为指导油管、套管防腐工程实践提供了依据。建议在钻井过程中采用碱性钻井液，其pH值可到9或更高(至pH值12)，以减缓或防止钻井过程中电化学从硫化物应力腐蚀破裂；含硫气井用的钻杆应该间歇使用。钻杆停用堆置时间可使其放氢，使钻杆恢复韧性，防止硫化物应力腐蚀断裂。     

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.