YOLSO: You Only Look Small Object

Small object detection is challenging and far from satisfactory. Most general object detectors suffer from two critical issues with small objects: (1) Feature extractor based on classification network cannot express the characteristics of small objects reasonably due to insufficient appearance information of targets and a large amount of background interference around them. (2) The detector requires a much higher location accuracy for small objects than for general objects. This paper proposes an effective and efficient small object detector YOLSO to address the above problems. For feature representation, we analyze the drawbacks in previous backbones and present a Half-Space Shortcut(HSSC) module to build a background-aware backbone. Furthermore, a coarse-to-fine Feature Pyramid Enhancement(FPE) module is introduced for layer-wise aggregation at a granular level to enhance the semantic discriminability. For loss function, we propose an exponential L1 loss to promote the convergence of regression, and a focal IOU loss to focus on prime samples with high classification confidence and high IOU. Both of them significantly improves the location accuracy of small objects. The proposed YOLSO sets state-of-the-art results on two typical small object datasets, MOCOD and VeDAI, at a speed of over 200 FPS. In the meantime, it also outperforms the baseline YOLOv3 by a wide margin on the common COCO dataset.     

基于卷积神经网络的5G蜂窝网络无线定位方法

5G蜂窝网络发展迅猛，其覆盖面积将逐渐增大，因此使用5G蜂窝网络进行定位是有研究潜力的研究方向。本文提出一种新的深度学习技术来实现高效、高精度和低占用的定位，以代替传统指纹定位过程中繁重的指纹库生成以及距离计算。该方法建立了一个特殊的卷积神经网络，并根据5G天线信号的接收信号强度指示、相位和到达角等特征量，选择合适的输入数据格式构造样本组建训练集，对该卷积神经网络进行训练。训练得到的卷积神经网络可以替代指纹定位中的庞大指纹库，非常有利于直接在5G移动设备端实现定位。虽然卷积神经网络在训练过程中需要大量时间，但在训练完毕后直接进行分类定位的速度非常快，可以保障定位实现的实时性。本文所实现的卷积神经网络权重与偏置所占内存不到0.5 MB，且能够在实际应用环境中以95%的定位准确率以及0.1 m的平均定位精度实现高精度定位。     

IRS辅助的SWIPT系统中基于能效优先的波束成形设计与优化

以智能反射面(intelligent reflecting surface,IRS)辅助的无线携能通信(simultaneous wireless information and power transfer,SWIPT)系统为背景,研究了该系统中基于能效优先的多天线发送端有源波束成形与IRS无源波束成形联合设计与优化方法。以最大化接收端的最小能效为优化目标,构造在发送端功率、接收端能量阈值、IRS相移等多约束下的非线性优化问题,用交替方向乘子法(alternating direction method of multipliers,ADMM)求解。采用Dinkelbach算法转化目标函数,通过奇异值分解(singular value decomposition,SVD)和半定松弛(semi-definite relaxation,SDR)得到发送端有源波束成形向量。采用SDR得到IRS相移矩阵与反射波束成形向量。结果表明,该系统显著降低了系统能量收集(energy harvesting,EH)接收端的能量阈值。当系统总电路功耗为?15 dBm时,所提方案的用户能效为300 KB/J。当IRS反射阵源数与发送天线数均为最大值时,系统可达最大能效。     

Influence of temperature on acoustic emission source location accuracy in underground structure

An acoustic emission (AE) experiment was carried out to explore the AE location accuracy influenced by temperature. A hollow hemispherical specimen was used to simulate common underground structures. In the process of heating with the flame, the pulse signal of constant frequency was stimulated as an AE source. Then AE signals received by each sensor were collected and used for comparing localization accuracy at different temperatures. Results show that location errors of AE keep the same phenomenon in the early and middle heating stages. In the later stage of heating, location errors of AE increase sharply due to the appearance of cracks. This provides some beneficial suggestions on decreasing location errors of structural cracks caused by temperature and improves the ability of underground structure disaster prevention and control.     

肇庆市固体废物产业发展方向探索

本文以肇庆市固体废物产业发展为实例,阐明全市固体废物产业发展现状以及发展方向,并提出了相应的策略。     

基于声源定位的高校在线巡课系统设计与研究

随着网络建设以及信息化教学方法在高校教学过程中的应用普及,越来越多的高校使用在线巡课系统对教师的教学过程进行跟踪和管理,以便发现课堂教学中的亮点、问题和不足。文章提出的在线巡课系统,基于声源定位的技术,对传统的在线巡课系统做出了改进,解决了已有巡课系统中“只闻其声,不见其人”的问题,能够更直观地跟踪到教师的教学过程,包括教学行为以及师生互动过程,有效提升教务人员巡课效果和体验感受。     

Reversible data hiding based on RSBEMD coding and adaptive multi-segment left and right histogram shifting

By leveraging the secret data coding using the remainder storage based exploiting modification direction (RSBEMD), and the pixel change operation recording based on multi-segment left and right histogram shifting, a novel reversible data hiding (RHD) scheme is proposed in this paper. The secret data are first encoded by some specific pixel change operations to the pixels in groups. After that, multi-segment left and right histogram shifting based on threshold manipulation is implemented for recording the pixel change operations. Furthermore, a multiple embedding policy based on chess board prediction (CBP) and threshold manipulation is put forward, and the threshold can be adjusted to achieve adaptive data hiding. Experimental results and analysis show that it is reversible and can achieve good performance in capacity and imperceptibility compared with the existing methods.     

Off‐grid DoA estimation method of wideband signals

In this paper, an off‐grid direction of arrival (DoA) estimation method is proposed for wideband signals. This method is based on the sparse representation (SR) of the array covariance matrix. Similar to the time domain DoA estimation methods, the correlation function of the sources was assumed to be the same and known. A new measurement vector is obtained using the lower‐left triangular elements of the covariance matrix. The DoAs are estimated by quantizing the entire range of continuous angle space into discrete grid points. However, the exact DoAs may be located between two grid points; therefore, this estimation has errors. The accuracy of DoA estimation is improved by the minimization of the difference between the new measurement vector and its estimated values. Simulation results revealed that the proposed method can enhance the DoA estimation accuracy of wideband signals.     

The generalized discrete ‐centroid problem

The ‐centroid problem or leader–follower problem is generalized considering different customer choice rules where a customer may use facilities belonging to different firms, if the difference in travel distance (or time) is small enough. Assuming essential goods, some particular customer choice rules are analyzed. Linear programming formulations for the generalized ‐medianoid and ‐centroid problems are presented and an exact solution approach is applied. Some computational examples are included.     

Restructuring bank networks after mergers and acquisitions: A capacitated delocation model for closing and resizing branches

During restructuring processes, due to mergers and acquisitions, banks frequently face the problem of having redundant branches competing in the same market. In this work, we introduce a new Capacitated Branch Restructuring Model which extends the available literature in delocation models. It considers both closing down and long term operations׳ costs, and addresses the problem of resizing open branches in order to maintain a constant service level. We consider, as well, the presence of competitors and allow for ceding market share whenever the restructuring costs are prohibitively expensive.We test our model in a real life scenario, obtaining a reduction of about 40% of the network size, and annual savings over 45% in operation costs from the second year on. We finally perform a sensitivity analysis on critical parameters. This analysis shows that the final design of the network depends on certain strategic decisions concerning the redundancy of the branches, as well as their proximity to the demand nodes and to the competitor׳s branches. At the same time, this design is quite robust to changes in the parameters associated with the adjustments on service capacity and with the market reaction.