Network coding-based reliable multicast in wireless networks

Reliable multicast, the lossless dissemination of data from one sender to a group of receivers, has a wide range of important applications. Recently, network coding has been applied to the reliable multicast in wireless networks, where multiple lost packets with distinct intended receivers are XOR-ed together as one packet and forwarded via single retransmission, resulting in a significant reduction of bandwidth consumption. However, the simple XOR operation cannot fully exploit the potential coding opportunities and finding the optimal set of lost packets for XOR-ing is a complex NP-complete optimization problem. In this work, we intend to move beyond the simple XOR to more general coding operations. Specifically, we propose two new schemes (a static scheme which repeatedly retransmits one coding packet until all intended receivers receive it and a dynamic scheme which updates the coding packet once one or more receivers receive it) to encode packets with more general coding operations, which not only can encode lost packets with common intended receivers together to fully exploit the potential coding opportunities but also have polynomial-time complexity. We demonstrate, through both analytical and simulation results, that the proposed schemes can more greatly reduce the bandwidth requirement than the available coding-based schemes, especially in the case of high packet loss probabilities and a larger number of receivers. This reduction can vary from a few percents to over 15% depending on the packet loss probabilities and the number of receivers.     

Research on the location of acoustic emission source of rock breaking point by using phase difference method and Geiger algorithm

Geiger iterative algorithm is very strict to the initial value. If the initial value is not selected suitably, it is difficult to enter the convergence range, thus increasing the number of iterations. The acoustic emission source location based on phase difference time delay estimation method reduces the error of acoustic emission location, but it has some shortcomings in accuracy. Based on the above problems, this paper presents a new algorithm for Geiger optimization based on source localization. Firstly, the initial value of Geiger is obtained by using the phase difference method. Then, the optimal solution is obtained by the iterative solution of Geiger algorithm and the least square method. The simulation results show that this method can effectively solve the problem of selecting the initial value of Geiger, so that it can quickly enter the convergence range, improving the convergence speed and positioning accuracy, comparing the positioning results of the United States PCI-2 type acoustic emission instrument, the average error reduced by about 5 mm.     

Efficient near-duplicate image detection with a local-based binary representation

Efficient near-duplicate image detection is important for several applications that feature extraction and matching need to be taken online. Most image representations targeting at conventional image retrieval problems are either computationally expensive to extract and match, or limited in robustness. Aiming at this problem, in this paper, we propose an effective and efficient local-based representation method to encode an image as a binary vector, which is called Local-based Binary Representation (LBR). Local regions are extracted densely from the image, and each region is converted to a simple and effective feature describing its texture. A statistical histogram can be calculated over all the local features, and then it is encoded to a binary vector as the holistic image representation. The proposed binary representation jointly utilizes the local region texture and global visual distribution of the image, based on which a similarity measure can be applied to detect near-duplicate image effectively. The binary encoding scheme can not only greatly speed up the online computation, but also reduce memory cost in real applications. In experiments the precision and recall, as well as computational time of the proposed method are compared with other state-of-the-art image representations and LBR shows clear advantages on online near-duplicate image detection and video keyframe detection tasks.     

基于双树复小波分解的Boosting集成学习土地覆被分类研究

近年来,集成学习（Ensemble Learning,EL）分类方法成为土地覆被分类的研究热点,尤其是Boosting集成分类方法具有分类精度高、泛化能力强,在土地覆被分类中得到了显著的应用。但是,Boosting集成分类方法对噪声很敏感,如果训练样本含有噪声时,Boosting算法可能会失效,这是该方法的局限性。为了解决Boosting集成方法在土地覆被分类中存在的问题,有效克服噪声的影响,减少分类结果中的“椒盐”现象和提高分类精度,提出了基于双树复小波分解的Boosting集成学习分类方法。该方法对影像的光谱波段进行一层双树复小波分解,降低图像的噪声,将分解后的各波段作为Boosting集成学习的输入,得到最终的分类结果。实验先后比较了GBDT、XGBoost、LightGBM 3种Boosting集成学习算法在SPOT 6和Sentinel-2A影像上的分类效果。结果表明：(1)在SPOT 6影像上,3种Boosting集成算法总体分类精度均高于90%;DTCWTLightGBM分类总体精度最高,达到94.73%,Kappa系数为0.93,比LightGBM总体精度提高了1.1%...     

图像超分辨率深度学习研究及应用进展

图像超分辨率重建是用低分辨率图像重建出对应的高分辨率图像的过程。目前,图像超分辨率技术已经成功应用于计算机视觉和图像处理领域。近年来,由于深度学习具有能够从大量数据中自动学习特征的能力,因此被广泛应用于图像超分辨率领域中。介绍了图像超分辨重建的背景,详细总结了用于图像超分辨率的深度学习模型,阐述了图像超分辨率技术在卫星遥感图像、医学影像、视频监控、工业检测任务方面的应用。总结了图像超分辨算法的当前研究现状以及未来发展方向。     

基于自适应机制的多宇宙并行量子衍生进化算法

进化参量的选取对量子衍生进化算法(QEA)的优化性能有极大的影响,传统QEA在选择进化参量时并未考虑种群中个体间的差异,种群中所有个体采用相同的进化参量完成更新,导致算法在解决组合优化问题中存在收敛速度慢、容易陷入局部最优解等问题。针对这一问题,采用自适应机制调整QEA的旋转角步长和量子变异概率,算法中任意一代的任一个体的进化参量均由该个体自身适应度确定,从而保证尽可能多的进化个体能够朝着最优解方向不断靠近。此外,由于自适应量子进化算法需要评估个体的适应度,导致运算时间较长,针对这一问题则采用多宇宙机制将算法分布于多个宇宙中并行实现,从而提高算法的执行效率。通过搜索多峰函数最优解和求解背包问题测试算法性能,结果表明,与传统QEA相比,所提出算法在收敛速度、搜索全局最优解及执行速度方面具有较好的表现。     

μ-Bases and singularities of rational planar curves

We provide a technique to detect the singularities of rational planar curves and to compute the correct order of each singularity including the infinitely near singularities without resorting to blow ups. Our approach employs the given parametrization of the curve and uses a μ-basis for the parametrization to construct two planar algebraic curves whose intersection points correspond to the parameters of the singularities including infinitely near singularities with proper multiplicity. This approach extends Abhyankar's method of t-resultants from planar polynomial curves to rational planar curves. We also derive the classical result that for a rational planar curve of degree n the sum of all the singularities with proper multiplicity is (n−1)(n−2)/2. Examples are provided to flesh out our results.     

传动轴用高强度马氏体钢的疲劳性能

通过旋转弯曲疲劳试验的方法,研究新开发传动轴用高强度马氏体钢25CrNi2MoVNb的疲劳性能,并与常用的18Cr2Ni4WA钢进行对比。结果表明,由于高的洁净度和细的晶粒,25CrNi2MoVNb钢在强度提高到1 500 MPa级别后,冲击韧性与1 300 MPa级的18Cr2Ni4WA钢相当。25CrNi2MoVNb钢的疲劳极限为865 MPa,显著高于18Cr2Ni4WA钢的670 MPa,25CrNi2MoVNb钢的旋转弯曲疲劳极限与抗拉强度的比值(σ-1/Rm)保持在0.5,稍高于18Cr2Ni4WA钢。     

平衡抛武器制动机构设计与实现

单兵有限空间发射的武器,大都采用平衡抛发射结构.本设计为提高发射过程的安全性和可靠性,在对现有制动技术总结基础上,利用薄壁圆环的径向收缩变形和摩擦环的摩擦吸能原理,设计出一种新的平衡抛制动机构.文中通过数值模拟和样机动态试验,验证了该制动机构的可靠性和安全性均有明显提高.为此类武器的设计提供了技术参考.     

Synthesis of novel pseudo‐Fréchet‐type dendrons and their fluorescent enhancement to Eu3+ ion

Novel pseudo‐Fréchet‐type dendrons with 1,3,5‐triazine structure G1.0(NOT) and G2.0(NOT) were synthesized under mild conditions by cyanuric chloride, β‐naphthol, and 3,5‐dihydroxybenzyl alcohol with the yields of 96.3 and 85.6%. The structure of the dendrons was characterized by elementary analysis, IR spectrum, ¹H‐NMR, and FAB‐MS. The dendrons had good thermo stability and solubility. They could partially transfer their absorbed energy to Eu³⁺ ion in tetrahydrofuran/acetone solutions. When the concentration of G1.0(NOT), G2.0(NOT), and Eu³⁺ ion was 5 × 10^?4 mol/L, G1.0(NOT) could enhance the fluorescent intensity of Eu³⁺ ion at 613 nm by 4.2‐fold, whereas G2.0(NOT) could enhance the fluorescent intensity of Eu³⁺ ion at 465 and 613 nm by 18.6‐ and 11.7‐fold, respectively. © 2009 Wiley Periodicals, Inc. J Appl Polym Sci, 2009