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

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

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

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

宁夏宁东供水工程主机设备形式参数选择与国际招标

宁东供水工程供水水泵共有卧式和立式离心泵2种方案可供选择,也是工程论证时争论的焦点,经综合比较及主机设备的国际招标,最终确定了奥地利安德里兹公司的卧式双吸中开式离心泵为宁东供水工程的供水水泵。     

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

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

测井资料在优选压裂层位中的应用

压裂是低孔、低渗油层改造的主要增产措施。根据常规测井资料、岩石物理实验分析数据及试油成果。研究储层四性关系，确定区块的低孔、低渗储层评价标准。进一步对油层进行分类，有针对性地为油层压裂提供施工层位和准确的储层参数。通过商543区块实例，阐述了选择压裂层位的方法。     

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

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

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.     

DFIT测试在长庆气田开发中的应用

与常规的小型测试压裂不同，流体注入诊断测试（DFIT）是通过关井阶段出现的拟线性流或拟径向流阶段求取储层压力，采用改进的梅耶霍夫方法（M-method）解释储层渗透率。以长庆榆林气田一口开发井为例，依据DFIT的技术原理和测试步骤，对该井测试压降数据进行解释分析，结果可信度较高，证明了该项工艺在长庆低压低渗油气田的可行性。     

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

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

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.