基于VMD和BSA-KELM的高陡边坡位移预测模型研究

边坡位移的时间序列曲线存在复杂的非线性特性,传统的预测模型精度不足以满足预测要求。为此提出了基于变分模态分解的鸟群优化-核极限学习机的预测模型,并用于河北省某水泥厂的边坡位移预测。该方法首先采用VMD把边坡位移序列分解为一系列的有限带宽的子序列,再对各子序列分别采用相空间重构并用核极限学习机预测,采用鸟群算法优化相空间重构的嵌入维度和KELM中惩罚系数和核参数三个数值,以取得最优预测模型。最后将各个子序列预测值叠加,得到边坡位移的最终预测值。结果表明：和KELM、BSA-KELM、EEMD-BSA-KELM模型相比,基于VMD的BSA-KELM预测精度更高,为边坡位移的预测提供一种有效的方法。     

基于改进SOA-VMD的磁声发射信号去噪算法

磁声发射（MAE）是铁磁性材料磁化过程中产生的声发射信号，在构件应力检测和微观损伤检测中有着广泛的应用。针对MAE信号非稳态、复杂性、衰减性等特点，提出海鸥算法结合变分模态分解（SOA-VMD）的去噪方法，为克服海鸥算法求解过程中易陷入局部最优解问题，利用柯西变异算子产生随机迭代过程，使改进算法即柯西变异海欧算法（CVSOA）跳出早熟收敛。采用以幅值谱熵为适应度函数，优化VMD算法中分解模态个数K和二次惩戒因子α两个参数，将含噪声的MAE信号进行VMD分解重构。经仿真信号和实际检测信号分析表明，改进后的CVSOA-VMD算法全局寻优能力和去噪性能优于传统的SOA-VMD算法，降噪后的MAE信号特征值对于不同应力下均方根、偏斜度特征值的重复性更好，可靠性更高。     

基于阶段注意力机制的电力线提取算法

电力系统维护是电力系统稳定运行的重要保障，应用智能算法的无人机电力巡检则为电力系统维护提供便捷。电力线提取是自主电力巡检以及保障飞行器低空飞行安全的关键技术，结合深度学习理论进行电力线提取是电力巡检的重要突破点。本文将深度学习方法用于电力线提取任务，结合电力线图像特点嵌入改进的图像输入策略和注意力模块，提出一种基于阶段注意力机制的电力线提取模型（SA-Unet）。本文提出的SA-Unet模型编码阶段采用阶段输入融合策略（Stage input fusion strategy， SIFS），充分利用图像的多尺度信息减少空间位置信息丢失。解码阶段通过嵌入阶段注意力模块（Stage attention module，SAM）聚焦电力线特征，从大量信息中快速筛选出高价值信息。实验结果表明，该方法在复杂背景的多场景中具有良好的性能。     

A globally convergent BFGS method for pseudo-monotone variational inequality problems

In this paper, we propose a globally convergent BFGS method to solve Variational Inequality Problems (VIPs). In fact, a globalization technique on the basis of the hyperplane projection method is applied to the BFGS method. The technique, which is independent of any merit function, is applicable for pseudo-monotone problems. The proposed method applies the BFGS direction and tries to reduce the distance of iterates to the solution set. This property, called Fejer monotonicity of iterates with respect to the solution set, is the basis of the convergence analysis. The method applied to pseudo-monotone VIP is globally convergent in the sense that subproblems always have unique solutions, and the sequence of iterates converges to a solution to the problem without any regularity assumption. Finally, some numerical simulations are included to evaluate the efficiency of the proposed algorithm.     

Ab initio calculations of the NO2 fission for CL-20 conformers

NO₂ fission is regarded to be the most important initial decomposition process of 2,4,6,8,10,12-hexanitro-2,4,6,8,10,12-hexaazaisowurtzitane (CL-20). In this study, four CL-20 conformers based on the ε-CL-20 were obtained after the optimization at m062x/cc-pvtz level, and the bond length, bond order and bond dissociation energy of the N-N bonds were examined to investigate the stability of these bonds. In addition, the rate constants and activation energy of the NO₂ fission were evaluated using the microcanonical variational transition state theory (μVT). The calculation results have shown that N-N bonds in the case of pseudo-equatorial and axial of nitro groups are the most stable and the least stable, respectively, by evaluating the bond length, bond order and minimum energy path (MEP). The NO₂ fission rate constants are affected by not only the stability of N-N bonds but also the repulsion forces from the other nitro groups, and the fission process for pseudo-equatorial positioning of nitro groups is easier to be accelerated due to the increase of the repulsion forces. The decomposition of CL-20 conformer may mainly originate from the fission of the pseudo-equatorial positioning of nitro groups, especially for CL-20 III conformer because of the significant low activation energy.     

基于门控联合池化自编码器的通用性文本表征

为了学习文本的语义表征,以往的研究者主要依赖于复杂的循环神经网络(recurrent neural networks, RNNs)和监督式学习方法。该文提出了一种门控联合池化自编码器(gated mean-max AAE)用于学习中英文的文本语义表征。该文的自编码器完全通过多头自注意力机制(multi-head self-attention mechanism)来构建编码器和解码器网络。在编码阶段,提出了均值—最大化(mean-max)联合表征策略,即同时运用平均池化(mean pooling)和最大池化(max pooling)操作来捕获输入文本中多样性的语义信息。为促使联合池化表征可以全面地指导重构过程,解码器采用门控操作进行动态关注。通过在大规模中英文未标注语料上训练模型,获得了高质量的句子编码器。在重构文本段落的实验中,该文模型在实验效果和计算效率上均超越了传统的RNNs模型。将公开训练好的文本编码器,使其可以方便地运用于后续的研究。     

基于深度学习的视频跟踪研究进展综述

近年来深度学习迅猛发展，颠覆了语音识别、图像分类、文本理解等领域的算法设计思路。深度学习因其具备强大的特征提取能力，在图像识别领域的成绩尤为突出。然而深度学习与视频监控领域的结合并不多，由于深度模型具有多层网络结构，算法复杂度大，训练和更新模型时比较耗时，很难满足实时性要求。回顾了深度学习的发展史，介绍了最近10年来国内外深度学习主要模型，论述了基于深度学习的目标跟踪算法，指出了各算法的优缺点，最后对当前该领域存在的问题和发展前景进行了总结和展望。     

视频侦查中人像智能分析应用及算法优化

人像智能分析指的是对视频或录像中的人像进行结构化和可视化分析,对目标人物进行性别、年龄、发型等特征的智能识别,这项技术在视频侦查中有极高的应用价值。人像识别早期的算法是通过人工提取特征,通过学习低级视觉特征来针对不同属性进行分类学习,这种基于传统方法的模型表现常常不尽如人意。在计算机视觉领域,通过海量图像数据学习的神经网络比传统方法有更丰富的信息量和特征可以被提取。文章尝试通过深度学习技术训练神经网络模型对行人进行检测和识别,对于衣着不同的行人进行智能识别,具有更好的鲁棒性,提升了视频人像识别的准确率,拓展了人工智能技术在身份识别领域的应用。     

A Lattice Approach to Image Segmentation

After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria. The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study. The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups. The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.