Linear-space algorithms that build local alignments from fragments

This paper presents practical algorithms for building an alignment of two long sequences from a collection of alignment fragments, such as all occurrences of identical 5-tuples in each of two DNA sequences. We first combine a time-efficient algorithm developed by Galil and coworkers with a space-saving approach of Hirschberg to obtain a local alignment algorithm that uses0((M+N+F logN) logM) time and0(M+N) space to align sequences of lengthsM andN from a pool of F alignment fragments. Ideas of Huang and Miller are then employed to develop a time- and space-efficient algorithm that computesn best nonintersecting alignments for anyn>1. An example illustrates the utility of these methods.This work was supported in part by Grant RO1 LM05110 from the National Library of Medicine.     

Efficient realization of frequently used bijections on cube-connected cycles

CCC has lower hardware complexity than hypercube and is suited for current VLSI technology.LC-permutations are a large set of important permutations frequently used in various parallel computations.Existing routing algorithms for CCC cannot realize LC-permutations without network conflict.We present an algorithm to realize LC-permutations on CCC.The algorithm consists of two periods of inter-cycle transmissions and one period of inner-cycle transmissions.In the inter-cycle transmissions the dimensional links of CCC are used in a “pipeline” manner and in the inner-cycle transmissions the data packets are sorted by a part of its destination address.The algorithm is fast (O(log2N)) and no conflict will occur.     

含多电解槽的新能源制氢能量管理优化

新能源制氢系统是提升风能、太阳能等新能源发电消纳的有效途径。目前国内外关于电解槽能量管理的相关研究以单电解槽为主。单电解槽能量管理未考虑电解槽非线性的工作特性,难以兼顾多个电解槽制氢效率,影响系统经济性。论文针对含有多电解槽新能源制氢系统的能量管理问题进行了研究。以新能源消纳率、经济收益、制氢率为目标,考虑单个电解槽运行特性及生产约束等条件,建立包含风电、光伏、蓄电池、电解槽多个模块的能量管理优化模型,并采用SPEA2算法求解多目标优化问题。仿真研究表明,所提能量管理策略能够实现新能源发电的100%消纳,单位制氢效益可提升5.15%。因此,多电解槽制氢系统进行有效的能量管理有助于提高制氢效率,有效克服单电解槽运行及能量管理的不足。     

基于BAS-BP-Bagging模型的光纤陀螺温度补偿

为提高光纤陀螺的输出精度,以天牛须搜索算法(BAS)优化后的BP神经网络模型为基学习器,采用Bagging并行集成学习算法建立了BAS-BP-Bagging温度补偿模型,并对某型号光纤陀螺进行了温度补偿实验。实验结果表明,在-40～+60℃温度变化环境下,该方法补偿后的光纤陀螺温度漂移相较于补偿前减小了近80%,相较于多项式补偿算法减小了55%,相较于BP神经网络补偿算法减小了30%左右。同时该模型在对新鲜样本的补偿过程中表现出了较为优越的泛化性能。     

大坝变形预测的最优因子长短期记忆网络模型

面对海量的大坝安全监测数据,快速合理地确定大坝变形预测模型的变量因子能够有效提高模型预测的效率和精度。为此,本文提出一种基于最小绝对值收缩和选择算子（least absolute shrinkage and selection operation,LASSO）变量选择和长短期记忆（long short-term memory,LSTM）网络的大坝变形预测模型。首先,通过大坝变形机理分析确定影响大坝变形的相关影响因子集。然后,通过LASSO算法剔除不显著的因子,筛选出最优影响因子作为模型输入变量,并利用LSTM网络建立大坝变形预测模型。最后,以皂市水利枢纽工程的碾压混凝土重力坝为例,对本文方法进行了验证和讨论。结果表明,本文方法具有较高的预测精度,其平均绝对误差（MAE）、均方误差（MSE）与均方根误差（RMSE）均相对较小;与常规预测模型相比,基于LASSO算法的变量选择使模型建立过程更加简单高效,有利于海量监测数据的处理分析。     

基于超像素暗通道和自动色阶优化的图像去雾算法

针对暗通道先验(dark channel prior, DCP)复原图像中的光晕现象、明亮区域色彩失真、环境光估计不准确等问题,提出了基于超像素暗通道和自动色阶优化的单幅图像去雾算法。首先,由改进的White Patch Retinex算法增强图像并计算精确环境光。接着,在传统暗通道去雾算法中引入超像素图像分割和引导滤波算法,使透射率估计的稳健性与精确性得以提升。然后,采用自适应容差对明亮区域的透射率进行补偿,有效抑制明亮区域色彩失真问题。最后,以自动色阶优化算法提高图像对比度。将本文去雾算法与其他算法从主观和客观两个维度进行比较,实验结果表明：采用不同算法对不同浓度的自然雾图进行对比实验,信息熵提高0.2 bit,峰值信噪比(peak signal-to-noise ratio,PSNR)提高0.8 dB,运行效率提高。该算法对不同浓度含雾图像具有良好的适应性,复原图像色彩真实、纹理清晰、细节丰富,去雾效果良好。     

基于粒子群算法的阵列天线波束赋形研究

波束赋形可以得到雷达系统所希望的理想辐射波束,然而传统分析方法存在理论分析繁琐、计算量较大的缺点,不利于在实际的工程应用中得到推广和使用。文章提出了一种基于粒子群算法对波束赋形的研究方法,具有代码简单、计算快速准确等优势。根据直线阵列的基本理论建立基本模型及方向图波瓣评估函数,最后得出两个案例的分析结果。计算结果验证了该方法的可行性和高效性,利于在实际工程中得到应用。     

基于GPIO的永磁同步电机模型预测转矩控制

在永磁同步电机模型预测转矩控制(model predictive torque control,MPTC)中,由于目标函数控制变量的量纲不同,为了在代价函数中选取最优的权重系数,提出一种改进高斯变异鸽群算法(Gaussian mutation pigeon-inspired optimization algorithm, GPIO)实现权重系数自整定。首先,基于代价函数最小化原则设计PIO的目标函数,用电流id、iq脉动误差均方根评价权重系数。其次,在传统高斯变异算子的基础上引入自适应调整动态参数实现变异。仿真和实验结果表明,将改进后的算法应用于永磁同步电机模型预测转矩系统,能在较少的迭代次数内整定出最优的权重系数,极大地降低了转矩误差和电流谐波畸变率。     

基于一致性的综合能源系统低碳经济调度

综合能源系统(integrated energy system, IES)是解决能源损耗和环境污染问题的有效途径。为提高IES的经济性和环保性,提出了一种基于一致性的IES低碳经济调度策略。首先,在IES中引入阶梯式碳交易机制,在碳交易成本函数构造中,提出一种随着碳排区间而递增的成本系数,通过成本的非线性递增来限制碳排放量。其次,综合考虑能量传输过程中的损耗问题,构建一种结合用能需求和传输损耗的供需平衡约束条件。然后,将电、热、气供能单元的增量成本作为一致性变量,利用领导一致性算法对IES进行分布式调度,进而实现各单元的供能最优输出。最后,结合不同的实验案例验证了所提低碳经济调度策略的有效性。     

HELOP: Multi-target tracking based on heuristic empirical learning algorithm and occlusion processing

Multi-target tracking is one of the important fields in computer vision, which aims to solve the problem of matching and correlating targets between adjacent frames. In this paper, we propose a fine-grained track recoverable (FGTR) matching strategy and a heuristic empirical learning (HEL) algorithm. The FGTR matching strategy divides the detected targets into two different sets according to the distance between them, and adopts different matching strategies respectively, in order to reduce false matching, we evaluated the trust degree of the target’s appearance feature information and location feature information, adjusted the proportion of the two reasonably, and improved the accuracy of target matching. In order to solve the problem of trajectory drift caused by the cumulative increase of Kalman filter error during the occlusion process, the HEL algorithm predicts the position information of the target in the next few frames based on the effective information of other previous target trajectories and the motion characteristics of related targets. Make the predicted trajectory closer to the real trajectory. Our proposed method is tested on MOT16 and MOT17, and the experimental results verify the effectiveness of each module, which can effectively solve the occlusion problem and make the tracking more accurate and stable.