基于Lawson范数的通用lncosh稀疏自适应算法

该文提出一种通用稀疏系统识别Lawson-lncosh自适应滤波算法,该算法采用系数向量的Lawson范数和误差的lncosh函数构建代价函数。Lawson范数约束引入参数p,实现稀疏约束滤波动态调整,所提算法可以提高稀疏系统识别时的收敛速度,减小了稳态误差。误差的lncosh函数具有良好的抗脉冲噪声性能。然后,算法分析了步长参数的取值范围和参数p对算法性能的影响。计算机仿真结果表明,在高斯信号输入和色信号输入情况下,所提算法的性能要明显优于其他现存算法,且具备稀疏约束可控特性。     

云环境下面向跨域作业的调度方法

云环境下,因数据局部性或是任务对资源的特殊偏好,一个作业所包含的任务往往需要在不同的数据中心局点上运行,此类作业称为跨域作业.跨域作业的完成时间取决于最慢任务的执行效率,即存在木桶效应.针对各域资源能力异构条件下不合理的调度策略导致跨域作业执行时间跨度过长的问题,本文提出一种面向跨域作业的启发式调度方法MIN-Max-Min,优先选择期望完成时间最短的作业执行.通过实验表明,与先来先服务的策略相比,该方法能将跨域作业平均执行时间跨度减少40%以上.     

基于滤波重构和卷积神经网络的心电信号分类

计算机自动分类心电信号能够减轻医生工作压力并大幅提高诊断速度和准确率。文中针对传统算法中特征提取过程复杂及抗干扰能力弱的问题,提出了一种结合滤波重构和卷积神经网络的心电信号分类算法。该算法首先通过传统信号滤波和心拍序列重构去除原始心电信号中的噪声干扰,然后构建卷积神经网络来自动学习心电信号特征并完成分类。在PhysioNet/CinC Challenge 2017数据集上的分类实验结果表明,该方法的平均F₁(查准率、召回率的调和平均)达到了0.8471,优于人工特征提取和常规卷积网络方法,且具有很强的抗干扰能力。     

基于DDS的指挥控制系统信息共享技术研究

战场态势信息的共享是实现协同作战急需解决的问题,信息共享技术关系着指挥效率和协同作战能力的高低,关系着作战效果是否精确高效。 DDS是实时分布式系统实现信息共享的一种有效途径,文中首先介绍了RTI DDS的体系结构,包括基本组件和QoS配置,其次针对指挥控制系统信息共享的需求,提出了使用RTI DDS实现信息共享过程中的关键问题及解决方法,并通过搭建实验环境验证,实验结论证明DDS可以作为指挥控制系统的一种有效的信息共享技术。     

磁电垒结构中自旋极化输运性质的研究

研究了电子隧穿几类磁电垒结构的自旋极化输运性质，导出统一的传输概率公式，揭示了非 均匀磁场的分布与自旋过滤的关系，同时表明采用有效朗德因子较大的半导体材料可以显著 增强磁电垒结构的自旋过滤效果. 关键词： 磁电垒 自旋过滤 自旋电子学 自旋极化     

李世忠，王国宏，吴 巍，苏少涛

在强对抗条件下雷达/红外双模复合制导跟踪中,雷达采用间歇工作方式可以减少敌方导弹拦截概率和电子支援措施锁定概率。文中在导弹复合制导跟踪中提出了一种雷达间歇工作下的雷达与红外序贯滤波融合算法,该算法针对雷达、红外量测时间不一致的特点,采用顺序处理结构的多传感器集中式融合方法对目标进行跟踪,在跟踪中使用了基于交互多模型和扩展卡尔曼(IMM-EKF)的序贯滤波方法,利用滤波过程中的状态估计协方差与测量误差方差进行比较控制雷达间歇工作。该算法可以自动适应雷达间歇工作,不需要在单/双传感器跟踪模式之间切换,最后通过仿真的方法分析了传感器数据率和雷达间歇工作对跟踪精度的影响。     

Least Squares Convex-Concave Data Smoothing

We consider n noisy measurements of a smooth (unknown) function, which suggest that the graph of the function consists of one convex and one concave section. Due to the noise the sequence of the second divided differences of the data exhibits more sign changes than those expected in the second derivative of the underlying function. We address the problem of smoothing the data so as to minimize the sum of squares of residuals subject to the condition that the sequence of successive second divided differences of the smoothed values changes sign at most once. It is a nonlinear problem, since the position of the sign change is also an unknown of the optimization process. We state a characterization theorem, which shows that the smoothed values can be derived by at most 2n – 2 quadratic programming calculations to subranges of data. Then, we develop an algorithm that solves the problem in about O(n ²) computer operations by employing several techniques, including B-splines, the use of active sets, quadratic programming and updating methods. A Fortran program has been written and some of its numerical results are presented. Applications of the smoothing technique may be found in scientific, economic and engineering calculations, when a potential shape for the underlying function is an S-curve. Generally, the smoothing calculation may arise from processes that show initially increasing and then decreasing rates of change.     

黄河河道冰水情定点连续自动检测及数据分析

根据黄河中上游流域冰水情监测以及预防凌汛灾害的需求,设计了一种适合黄河河道的冰水情自动测报系统.该系统由基于空气、冰与水电阻特性差异的冰层厚度传感器、DS18B20的温度梯度传感器以及智能处理仪构成.采用该系统在内蒙托克托县黄河河道进行了黄河封冻期河道冰层厚度连续监测试验,获取了大量的现场实测数据,对采样数据进行分析,提出了判别冰层厚度的平均滤波算法,实现了对冰层生消变化全过程的自动监测.     

A C + + computational environment for biomolecular sequence management

The wide production of biomolecular data of the last 30 years, mainly due to the rapid evolving of technologies as well as to the accomplishment of the Genome Projects, led to the necessity of appropriate computational approaches for data storage, manipulation and analyses, giving place to a fast evolving area of Biology: Computational Biology or Bioinformatics.We propose here a new method for the storage of the sequences and their analyses using the C + + programming language, checking the effectiveness of an object oriented approach for new models, suitable to manage data representation and analyses, to improve the efficiency of computational methodologies to solve problems of general interest in bioinformatics. We developed a framework with the aim to decrease the computational costs for the storage and some basic manipulations of nucleic acid sequences. The remarkable reduction of memory requirements with no loss of efficiency makes this approach a first well promising step in order to get a more efficient environment for the manipulation and the management of nucleic acid data sets, in a field of research with hard challenges for Computer and Life Sciences.Mathematics Subject Classification: 68U99G. Toraldo, via Universita’ 100, 80055 Portici, Napoli, Italy