降低OFDM系统复杂度的改进SLM算法

为了降低正交频分复用(OFDM)系统中传统选择性映射(SLM)算法的计算复杂度,提高系统的频谱利用效率,提出了基于转换向量(conversion vectors)与随机筛选序列(random selection sequences)相结合的选择性映射(CR-SLM)算法.CR-SLM算法是将原始信号序列等分,然后对于数据序列的前半部分与转换向量相乘进行循环卷积,对于数据序列后半部分进行随机序列筛选,筛选出最优序列.最后将两部分输出序列合并生成候选序列,筛选出最优序列进行传输.仿真结果表明:CR-SLM算法在保持与传统SLM 算法PAPR性能相近的情况下,较大幅度降低了计算复杂度.     

具有关键字搜索性质的云存储加密方案

Dan Boneh等人提出了具有关键词搜索性质的公钥加密方案,并且构造出了在随机预言模型下可证明安全的基于BDH困难问题的双线性映射对下的具体构造.本文给出了一个具有关键字搜索性质的高效云存储加密方案,而且在随机预言模型下可证明CCA-安全.该方案能够安全高效的管理云服务器中的加密文件,能够对已经加密的文件进行相等配对.构造方案能够在无安全信道环境中传输陷门Tw.     

机载相控阵雷达灵巧干扰信号模型及抑制方法研究0

目前对灵巧干扰的研究主要集中在常规地面雷达,对于机载雷达下的干扰模型及其抑制方法的研究较少。针对此种情况,建立了机载雷达背景下噪声卷积干扰、随机移频干扰和延时转发干扰3种典型灵巧干扰的空时信号模型,并从杂波自由度、空时功率谱图和距离-多普勒谱图的角度分析了干扰分布特性以及影响空时自适应处理(space-time adaptive processing, STAP)性能的内在机理,在此基础上提出了一种基于单元平均选小检测的机载雷达杂波和干扰同时抑制方法。该方法从杂波空时功率谱角度准确估计干扰来向,并据此形成干扰辅助波束,最后通过STAP实现干扰和杂波的有效抑制。仿真结果表明,所提方法相对于传统级联抑制方法,对延时转发灵巧干扰的抑制性能改善5 dB以上,验证了所提方法的有效性。     

带有加性噪声的阻尼吊桥方程随机吸引子的存在性

用算子分解技巧, 通过对方程的解进行先验估计, 给出随机动力系统的一致渐近紧性, 从而证明了随机吊桥方程在加性噪声下随机吸引子的存在性.     

基于空地协同采样的植被覆盖度随机森林估算方法

基于无人机高光谱影像, 建立地形复杂地区植被覆盖度的非参数随机森林回归估算模型。为获得构建随机森林模型所需的足够数量的训练样本, 利用低空无人机搭载的光学相机, 在从地面难以到达的山地、水域和植被茂密区, 通过垂直拍摄获得厘米分辨率的航拍影像, 作为对地面样方采样的补充。首先计算地面数码相机照片和无人机可见光影像的红绿蓝植被指数(red-green-blue vegetation index, RGBVI), 然后使用大津分割法提取样方的植被覆盖信息, 得到构建模型所需的训练样本。在此基础上, 基于2018年8月16—18日在内蒙古自治区察右中旗油娄沟矿区获取的GaiaSky-mini2无人机高光谱影像数据, 利用递归特征消除算法优选参与随机森林回归的特征变量集, 利用空地协同获取的训练样本构建植被覆盖度的随机森林回归估算模型。该模型在测试集上的确定系数R2为0.923, 均方根误差为0.087, 优于常用的像元二分模型, 可用于矿区植被动态信息的精细化监测。     

φ混合随机变量阵列加权和的收敛性质

利用φ混合随机变量的Rosenthal型矩不等式,考虑一定权重条件下,不同分布φ混合随机变量阵列的强收敛性质,得到了一些新结果.     

Two Tales of Return Predictability: The Case of Asia–Pacific Equity Markets

If past prices can successfully predict future price movements, it would contradict the notion of weak‐form market efficiency. Return predictability can be assessed via a variety of random walk statistical tests or via the application of mechanical trading rules. Findings of return predictability and state of market efficiency are compared by applying a battery of popular random walk statistical tests and a large set of mechanical trading rules to a family of equity indexes in Asia–Pacific equity markets over a 20‐year period of time. Inferences drawn from different random walk based econometric tests of market efficiency often disagree among themselves and tend to exaggerate the extent of predictability in returns. Testing of return predictability via a set of mechanical trading rules allows one to account for a possible data snooping bias, error measurements due to nonsynchronous trading and market frictions such as trading costs. Persistent predictability of returns that cannot be explained by the combination of data snooping bias, nonsynchronicity bias and moderate level of transaction costs is found in just two emerging equity markets in the region. Copyright © 2016 John Wiley & Sons, Ltd.     

近临界紧邻随机游动局部时的重整化极限

Lamperti于1961年证明了在适当条件下, 半直线上一类近临界的紧邻随机游动经过重整化会弱收敛到布朗运动. 考虑过程局部时重整化的极限问题, 运用随机游动的内蕴分枝结构以及非时齐分枝过程重整化极限的结果, 证明了其局部时经过适当的重整化会收敛到布朗运动的局部时.      

Semantic image annotation based on GMM and random walk model

Automatic image annotation has been an active topic of research in computer vision and patternrecognition for decades.A two stage automatic image annotation method based on Gaussian mixturemodel (GMM) and random walk model (abbreviated as GMM-RW) is presented.To start with,GMM fitted by the rival penalized expectation maximization (RPEM) algorithm is employed to estimatethe posterior probabilities of each annotation keyword.Subsequently, a random walk processover the constructed label similarity graph is implemented to further mine the potential correlations ofthe candidate annotations so as to capture the refining results, which plays a crucial role in semanticbased image retrieval.The contributions exhibited in this work are multifold.First, GMM is exploitedto capture the initial semantic annotations, especially the RPEM algorithm is utilized to train themodel that can determine the number of components in GMM automatically.Second, a label similaritygraph is constructed by a weighted linear combination of label similarity and visual similarity ofimages associated with the corresponding labels, which is able to avoid the phenomena of polysemyand synonym efficiently during the image annotation process.Third, the random walk is implementedover the constructed label graph to further refine the candidate set of annotations generated byGMM.Conducted experiments on the standard Corel5k demonstrate that GMM-RW is significantlymore effective than several state-of-the-arts regarding their effectiveness and efficiency in the task of automatic image annotation.     

Ho∞-based fault detection for nonlinear networked systems with random packet dropout and probabilistic interval delay

The fault detection problem for the nonlinear networked control system (NCS) with packet dropout and delay is investigated.A nonlinear stochastic system model is proposed to account for the NCS with random packet dropout and networkinduced non-uniformly distributed time-varying delay in both from sensor to controller (S/C) and from controller to actuator (C/A).Based on the obtained NCS model,employing an observer-based fault detection filter as the residual generator,the addressed fault detection problem is converted into an auxiliary nonlinear H∞ control problem.Then,with the help of Lyapunov functional approach,a sufficient condition for the desired fault detection filter is constructed in terms of certain linear matrix inequalities,which depend on not only the delay interval but also the delay interval occurrence rate and successful packet communication rate.Especially,a trade-off phenomenon between the maximum allowable delay bound and successful data packet transmission rate is found,which is typically resulted from the limited bandwidth of communication networks.The effectiveness of the proposed method is demonstrated by a simulation example.