Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers

The knowledge of turbo code's minimum Hamming distance (d_min) and its corresponding codeword multiplicity (A_min) is of a great importance because the error correction capability of a code is strongly tied to the values of d_min and A_min. Unfortunately, the computational complexity associated with the search for d_min and A_min can be very high, especially for a turbo code that has high d_min value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of d_min and A_min values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd.     

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

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

周宁水电站工程项目管理实践

福建周宁水电站工程由闽东水电开发有限公司负责项目管理。该项目严格按照《招投标法》进行工程和设备的招标,进行了多项设计优化,注重工程质量和安全文明生产,积极开展达标投产工作,实现了进度快、质量优、投资省、效益好的管理目标。     

电信企业信息化统一模型构建策略

电信企业信息化的实质就是赋予电信企业精细化的企业资源整合能力，本以此认识为出发点，通过定义基本的信息化业务元素，需求参数和基本信息处理机制，构建出带有行业共性的电信企业信息化统一模型，该模型针对目前电信企业信息化中常见的和潜在的问题提供了有效的解决措施。     

地震数据采集系统延迟时间研究与分析

文章分析了影响地震采集系统延迟时间的因素,并根据系统延迟的理论对产生的原因进行了论证.同时对实际生产中的测试方法进行了阐述研究和分析,提出了新的测试方法,并结合实际生产提出了合理性建议.     

自由曲面五坐标数控加工干涉检查

提出了一种新方法，用于环刀五坐标数控加工的干涉检查。该方法将干涉检查分为刀轴及侧刃干涉检查和端面干涉检查。首先将加工曲面分片，选取合适的初始点。然后利用自由曲面的微分特性，确定跟踪方向和步长，迅速计算出工件和刀具的最短距离，从而判断是否发生干涉。实验仿真表明，达到同样精度时，该算法计算效率远高于常规的三角面片法。     

Design Methodology and Area Sensitivity Analysis of Horizontal Subsurface Flow Constructed Wetlands

An approach is presented to satisfy the demand for simple criteria, guidelines and models for the preliminary sizing of horizontal subsurface flow (SF) constructed wetland systems. This approach eliminates time-consuming calculations and iterations by providing graphical solutions for wetland system sizing. Therefore, it can be used for the preliminary assessment of new or performance evaluation of existing subsurface flow constructed wetland systems. The validity of this methodology is checked with data from existing systems and is found to be quite satisfactory. This methodology is combined with simple equations predicting the maximum wetland capacity in summer, so as to assist designers in sizing installations in tourist areas with increased summer populations. Furthermore, based on this methodology, a sensitivity analysis is performed of the area requirements for wastewaters of various strengths and various design conditions and performance criteria. The results provide a useful overview to engineers and further simplify the design methodology of new subsurface flow constructed wetland systems.     

变形介质中宾汉稠油驱替特征

通过建立变形介质中考虑启动压力梯度的一维两相宾汉稠油驱替的数学模型,并进行了数值求解,分析了地层变形以及启动压力梯度对水驱稠油的影响,分析表明:介质变形对含水饱和度的分布没有影响,而对地层压力的影响是非常显著的,随着变形介质弹性的增加,地层压力越来越低,并且越靠近注入端,地层压力下降越快;原油的启动压力梯度同时影响含水饱和度和地层压力的分布,在其它条件一定时,启动压力梯度的存在,造成地层压力的增加和平均含水饱和度的降低。在油田开发实际中,应考虑地层变形和启动压力梯度的影响,以提高原油采收率。     

中国未来电力需求与核能

本文介绍了我国未来电力需求和能源结构，阐述了核能是我国满足经济发达地区电力需求的合理选择，并提出了我国“九五”核电计划和中期目标，以及发展核电中面临的问题和基本对策。     

Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time.