基于自适应卡尔曼滤波的盲多用户检测算法

对强多址干扰情况下码分多址系统的盲多用户检测算法进行研究,针对多径信道的码分多址系统,提出一种基于自适应卡尔曼滤波的盲多用户检测算法。该算法可在进行状态滤波的同时对未知噪声的统计特性进行在线估计,确保算法收敛于期望用户,提高检测器在动态环境下的跟踪性能。仿真结果表明,与最小均方算法及递推最小二乘算法相比,该算法具有更好的收敛性和动态性能。     

基于改进粒子群优化算法的多用户检测器

提出了一种基于改进粒子群优化算法的多用户检测器。介绍了最佳多用户检测模型以及粒子群优化算法的基本思想。进行了理论依据和仿真性能分析。仿真结果表明:该检测器在误码率性能和抗“远近”效应上优于传统检测器和基于粒子群优化得多用户检测器,计算复杂度较低。     

基于改进卡尔曼滤波算法的盲多用户检测器

基于盲检测器的新典范表示形式,提出了一种多径信道下CDMA系统的盲多用户检测器。该检测器使用了一种改进的自适应卡尔曼滤波算法,它在进行状态滤波的同时,在线估计时变的未知噪声统计特性,提高了算法的滤波精度,确保了算法收敛于期望用户。仿真表明,对比原有的随机梯度（LMS）算法,该算法的收敛、跟踪性能更好,且误码率减小了18.7%。     

改进的智能优化在多用户检测中的应用

针对概率克隆选择微粒群算法（PCSPSO）在解决离散优化问题时效果不佳的缺点进行改进,将改进后的算法（IPCSPSO）应用于多用户检测,提出基于改进的概率克隆选择微粒群算法的多用户检测器（IPCSPSO-MUD）。IPCSPSO在由二次更新后的记忆集和原种群构成的临时种群中寻找全局最优解,进一步扩大搜索范围;以抗体生存期望值为标准更新种群,保证抗体多样性。仿真结果表明,所提出的多用户检测器在误码率性能、收敛速度、抗远近效应能力和系统容量等方面均有显著提高。     

基于改进粒子群优化算法的多用户检测器

提出了一种基于改进粒子群优化算法的多用户检测器。介绍了最佳多用户检测模型以及粒子群优化算法的基本思想。进行了理论依据和仿真性能分析。仿真结果表明：该检测器在误码率性能和抗“远近”效应上优于传统检测器和基于粒子群优化得多用户检测器，计算复杂度较低。     

基于克隆粒子群优化算法的多用户检测器

针对经典离散粒子群优化算法收敛性差的缺点,设计了基于新的运动方程的离散粒子群优化算法。为了解决CDMA系统多用户检测这个NP完全问题,基于免疫克隆选择理论和新的粒子群优化算法,提出了克隆粒子群优化算法,其中,由神经元构成的粒子可以进行随机搜索和经验学习。仿真结果表明,在异步和同步CDMA系统上,该检测器的误码率性能都优于传统方法和其他一些多用户检测器,达到最优检测。     

MOE盲多用户检测算法中约束向量的研究

最小输出能量（Minimum Output Energy,MOE）盲多用户检测是一种简单的不用进行信道估计就可直接获得多用户检测器参数的算法,在该算法中,约束向量起着相当重要的作用,它直接影响多用户检测器的最优权矢量。通过对不同约束向量时MOE盲多用户检测算法基本原理的分析,将MOE盲多用户检测算法分为线性约束MOE盲多用户检测算法和鲁棒二次约束MOE盲多用户检测算法两大类。通过仿真实验比较了各种检测器的性能。     

基于卡尔曼滤波的线性共轭半盲多用户检测

考虑实际的多载波CDMA（MC-CDMA）上行链路系统,深入研究了基于卡尔曼滤波的盲自适应多用户检测和线性共轭多用户检测,提出MC-CDMA系统下一种基于自适应卡尔曼滤波的线性共轭半盲多用户检测算法。该算法利用小区内所有用户的扩频码和伪自相关矩阵的信息设计了一种基于平均输出能量（MOE）准则的线性共轭半盲检测器,结合修正的PASTd算法和卡尔曼滤波算法自适应得到MOE权向量。仿真实验验证了所提算法的有效性,与卡尔曼滤波盲自适应算法相比,提出的算法有更好的输出信干比和误码率性能,并保持较低的复杂度。     

一种基于改进自适应遗传算法的多用户检测器

针对自适应遗传算法在多用户检测应用中容易早熟收敛和速度慢的问题,将非线性Sigmoid函数应用于自适应遗传算法并结合解相关算法的抗多址干扰能力,提出了一种基于改进自适应遗传算法和解相关算法的多用户检测器。实验仿真结果表明：该多用户检测器的检测性能,不论在抗多址干扰和远近效应方面还是在系统用户容量方面,都明显优于自适应遗传算法多用户检测器和简单遗传算法多用户检测器。     

模拟退火遗传算法在多用户检测技术中的应用

将遗传算法GA(Genetic Algorithm)与模拟退火算法SA(Simulated Annealing)相结合,提出模拟退火遗传算法(SAGA),并将其应用于MC-CDMA无线通信系统的多用户检测技术中,以求降低多用户检测算法在实际应用中的复杂度并同时提高多用户检测器的性能。分析了遗传算法和模拟退火算法的性能,从理论上阐述了模拟退火遗传算法应用于多用户检测技术中的方法和可行性。理论分析表明,基于模拟退火遗传算法的多用户检测器的算法复杂度比传统多用户检测器低;数值仿真结果也表明前者在抗干扰能力上优于后者。     

Neural network-based adaptive multiuser detection schemes in SDMA–OFDM system for wireless application

Neural network applications in adaptive multiuser detection (MUD) schemes are suggested here in the context of space division multiple access–orthogonal frequency division multiplexing system. In this paper, various neural network (NN) models like feed forward network (FFN), recurrent neural network (RNN) and radial basis function network (RBFN) are adopted for MUD. MUD using NN models outperforms other existing schemes like genetic algorithm--assisted minimum bit error rate (MBER) and minimum mean square error MUDs in terms of BER performance and convergence speed. Among these NN models, the FNN MUD performs efficiently as RNN in full load scenario, where the number of users is equal to number of receiving antennas. In overload scenario, where the number of users is more than the number of receiving antennas, the FNN MUD performs better than RNN MUD. Further, the RBFN MUD provides a significant enhancement in performance over FNN and RNN MUDs under both overload and full load scenarios because of its better classification ability due to Gaussian nonlinearity. Extensive simulation analysis considering Stanford University Interim channel models applied for fixed wireless applications shows improvement in convergence speed and BER performance of the proposed NN-based MUD algorithms.     

Efficient groupwise multiuser detection with iterative soft interference cancellation for multi-rate MC-CDMA

This paper presents an effective multiuser detector (MUD) for the uplink of multi-rate multi-carrier code division multiple access (MC-CDMA) systems. The MUD considered is an iterative receiver which utilizes the soft information to refine the estimation of the interference to enhance the interference cancellation capability. More specifically, users are first classified into separate groups according to their transmission rates. In each iteration, these groups of users are detected sequentially based on a set of group detectors with the removal of multiple access interferences (MAI) group by group, where the estimated interferences in each group, incurred from the users either in the same rate group or in the other rate groups, are refined successively with the assistance of the soft information in the symbol detection process. Moreover, for practical low-complexity implementations, the users in each group are further partitioned into smaller subgroups based on their effective channel correlations and then detected in parallel by a bank of minimum mean-squared error (MMSE) soft detectors to further reduce the computational load. Conducted simulations show that the proposed MUD can effectively suppress the MAI to render superior performance but with reduced computations compared to previous works.     

CDMA系统中多用户检测技术的分析

多用户检测技术是第三代移动通信系统的关键技术,具备良好的抗多址干扰和远近效应性能。从移动通信系统抗干扰的角度出发,分析了CDMA系统中多址干扰(MAI)的产生原因,对多用户检测(MUD)技术的概念系统模型以及常用的MUD算法进行了阐述,并指出其局限性和研究方向。     

Optimization of fed-batch fermentation processes with bio-inspired algorithms

The optimization of the feeding trajectories in fed-batch fermentation processes is a complex problem that has gained attention given its significant economical impact. A number of bio-inspired algorithms have approached this task with considerable success, but systematic and statistically significant comparisons of the different alternatives are still lacking. In this paper, the performance of different metaheuristics, such as Evolutionary Algorithms (EAs), Differential Evolution (DE) and Particle Swarm Optimization (PSO) is compared, resorting to several case studies taken from literature and conducting a thorough statistical validation of the results. DE obtains the best overall performance, showing a consistent ability to find good solutions and presenting a good convergence speed, with the DE/rand variants being the ones with the best performance. A freely available computational application, OptFerm, is described that provides an interface allowing users to apply the proposed methods to their own models and data.     

基于Memetic框架和改进DFP局部搜索的改进差分进化算法

为提高差分进化(DE)算法对性连续优化问题的求解能力、增强算法的适应性,提出了一种基于局部快速收敛算法的Memetic进化算法。改进了Davidon-Fletcher-Powell方法,得到了具有强搜索能力的局部搜索算法——NDFP。当进化过程中出现具有优秀特质的个体时,NDFP可以使该个体沿着局部最优解的方向快速进化。为综合NDFP和DE的优势,提出局部搜索的执行策略来平衡全局搜索和局部搜索的关系,使得NDFP对DE的优化具有更为广泛的适应性。在CEC2005和CEC2013 Benchmark的53个测试函数上的实验结果表明,同DE/current-to-best/1、SaDE和EPSDE算法相比,NDFP-DE进化算法具有更高的求解精度和稳定性。     

A two-stage MMSE multiuser decision feedback detector using successive/parallel interference cancellation

In this paper, we present a novel two-stage minimum-mean-squared-error (MMSE) multiuser decision feedback detector (DFD) for code division multiple access systems working in the frequency-selective multipath fading environment. The first stage of the proposed cascaded structure is the noise-predictive successive DFD (NP-S-DFD), in which the active users are detected successively using the conventional bell labs layered space-time (BLAST) ordering criterion. The second stage includes an adaptive successive/parallel DFD (SP-DFD), which uses the tentative decisions obtained at the first stage for multiuser interference cancellation and data detection. Therefore, the proposed two-stage DFD may be called noise-predictive successive SP-DFD (NP-S-SP-DFD). Simulation results are presented to demonstrate the substantial improvement in the bit error rate performance of NP-S-SP-DFD over the conventional single-stage and cascaded DFDs. It may be inferred that the proposed DFD provides additional performance gain, when the order in which the users are detected is optimized according to the BLAST ordering based on MMSE criterion.     

Colonial competitive differential evolution: An experimental study for optimal economic load dispatch

Differential evolution (DE) algorithm is a population-based algorithm designed for global optimization of the optimization problems. This paper proposes a different DE algorithm based on mathematical modeling of socio-political evolution which is called Colonial Competitive Differential Evolution (CCDE). The two typical CCDE algorithms are benchmarked on three well-known test functions, and the results are verified by a comparative study with two original DE algorithms which include DE/best/1 and DE/rand/2. Also, the effectiveness of CCDE algorithms is tested on Economic Load Dispatch (ELD) problem including 10, 15, 40, and 140-unit test systems. In this study, the constraints and operational limitations, such as valve-point loading, transmission losses, ramp rate limits, and prohibited operating zones are considered. The comparative results show that the CCDE algorithms have good performance and are reliable tools in solving ELD problem.     

因子分解机算法在基于深度数据包检测的手机应用推荐中的应用

为了从网络数据包中抽取相关特征进行手机应用推荐,使用江苏电信运营商在互联网服务提供商(ISP)机房抽取的网络深度数据包数据,从中抽取运营商所关心的热点手机用户的App访问信息,然后使用基于矩阵分解(包括奇异值分解(SVD)和非负矩阵分解(NMF))的推荐算法、奇异值分解推荐算法以及因子分解机推荐算法进行手机App推荐。实验表明,因子分解机算法取得了较好的推荐效果。这说明因子分解机在手机应用推荐的场景中可以更好地描述用户和物品之间的隐含关联。     

Effects of the design of mobile security notifications and mobile app usability on users’ security perceptions and continued use intention

The explosive global adoption of mobile applications (i.e., apps) has been fraught with security and privacy issues. App users typically have a poor understanding of information security; worse, they routinely ignore security notifications designed to increase security on apps. By considering both mobile app interface usability and mobile security notification (MSN) design, we investigate how security perceptions of apps are formed and how these perceptions influence users’ intentions to continue using apps. Accordingly, we designed and conducted a set of controlled survey experiments with 317 participants in different MSN interface scenarios by manipulating the types of MSN interfaces (i.e., high vs. low disruption), the context (hedonic vs. utilitarian scenarios), and the degree of MSN intrusiveness (high vs. low intrusiveness). We found that both app interface usability and the design of MSNs significantly impacted users’ perceived security, which, in turn, has a positive influence on users’ intention to continue using the app. In addition, we identified an important conundrum: disruptive MSNs—a common approach to delivering MSNs—irritate users and negatively influence their perceptions of app security. Thus, our results directly challenge current practice. If these results hold, current practice should shift away from MSNs that interrupt task performance.     

Multiobjective design optimization of a nano-CMOS voltage-controlled oscillator using game theoretic-differential evolution

Engineering problems presenting themselves in a multiobjective setting have become commonplace in most industries. In such situations the decision maker (DM) requires several solution options prior to selecting the best or the most attractive solution with respect to the current industrial circumstances. The weighted sum scalarization approach was employed in this work in conjunction with three metaheuristic algorithms: particle swarm optimization (PSO), differential evolution (DE) and the improved DE algorithm (GTDE) (which was enhanced using ideas from evolutionary game theory). These methods are then used to generate the approximate Pareto frontier to the nano-CMOS voltage-controlled oscillator (VCO) design problem. Some comparative studies were then carried out to compare the proposed method as compared to the standard DE approach. Examination on the quality of the solutions across the Pareto frontier obtained using these algorithms was carried out using the hypervolume indicator (HVI).