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.     

The development of a single-item Food Choice Questionnaire

Based on the multi-item Food Choice Questionnaire (FCQ) originally developed by Steptoe and colleagues (1995), the current study developed a single-item FCQ that provides an acceptable balance between practical needs and psychometric concerns. Studies 1 (N = 1851) and 2 (2a (N = 3290), 2b (N = 4723), 2c (N = 270)) showed that the single-item FCQ scale has good convergent and discriminant validity. Generally, the results showed the highest correlations with the related multi-item dimensions (>0.40). Study 2 refined the scale. Only the items for convenience (Study 2a), sensory appeal (Study 2b) and mood (Study 2c) needed to be revised (as Study 1 showed a correlation between the multi-item and the single-item below the threshold of 0.60). The results also showed comparable predictive validity. Both methods revealed similar association patterns between food motives and consumption behaviours (Fisher’s z tests revealed agreements of 86.2% for Study 1, 92.9% for Study 2a and 100% for Studies 2b and 2c). Study 3 (N = 6062) showed an example of the added value of a context-specific application for the single-item FCQ. Different motives were shown to be relevant across contexts, and the context-specific motives had additional explained variance beyond the general multi-item FCQ. Studies 2b and 3 also showed the performance of the single-item FCQ in an international context. In sum, the results indicate that the single-item FCQ can be used as a flexible and short substitute for the multi-item FCQ. The study also discusses the conditions that should be considered when using the single-item scale.     

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

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

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

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

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

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

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

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

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.     

一种在Kalman滤波中引入径向速度测量的新方法

研究在距离和径向速度测量噪声统计相关的情形下把径向速度测量引入Kalman滤波的新方法。分析了径向速度测量噪声与位置测量更新后状态滤波误差的统计相关性,根据Gauss-Markov定理导出了对应于径向速度测量的滤波方程由此而得到一种序贯滤波算法。两个不同的蒙特卡罗仿真表明,通过采用这一新算法引人径向速度测量,不仅可以大大提高状态估计的精度,而且其估计性能和计算效率优于传统的EKF。     

Pruning Redundant Alarm Correlation Patterns

1　ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｓｔｉｃｋｉｎｇｐｏｉｎｔｏｆａｓｓｏｃｉａｔｉｏｎｒｕｌｅａｌｇｏｒｉｔｈｍｓｄｅｐｅｎｄｓｏｎｅｆｆｅｃｔｉｖｅｌｙｆｉｎｄｉｎｇａｌｌｃｏｒｒｅｌａｔｉｏｎｐａｔｔｅｒｎｓｔｈａｔｓａｔｉｓｆｙｖａｌｕｅｒｅｑｕｉｒｅｍｅｎｔｉｎｔｈｅｍａｇｎａｎｉｍｉｔｙｏｆｄａｔａ.Ｂｕｔｔｈｅａｌｇｏｒｉｔｈｍｓａｌｓｏｂｒｉｎｇａｎｅｇａｔｉｖｅｅｆ ｆｅｃｔ:ｔｈｅｎｕｍｂｅｒｏｆａｓｓｏｃｉａｔｉｏｎｒｕｌｅｓｉｓｖｅｒｙｌａｒｇｅ.Ａｌｓｏｉｎｆｏｒｍａｔｉｏｎ…     

最值求解技巧:巧变四数

在用基本不等式求最值时,大家都熟悉一个口诀:"一正二定三相等",但是有许多学生在怎样保证定值和相等时不知道该如何变形.为了解决学生的困难和困惑,我根据自己的经验,概括为两句口诀:"一正二定三相等,巧变四数定乾坤".