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.     

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.     

Breeding schemes with optimum-contribution selection or truncation selection for beef cattle destined for use on dairy females

We tested the hypothesis that the size of a beef cattle population destined for use on dairy females is smaller under optimum-contribution selection (OCS) than under truncation selection (TRS) at the same genetic gain (ΔG) and the same rate of inbreeding (ΔF). We used stochastic simulation to estimate true ΔG realized at a 0.005 ΔF in breeding schemes with OCS or TRS. The schemes for the beef cattle population also differed in the number of purebred offspring per dam and the total number of purebred offspring per generation. Dams of the next generation were exclusively selected among the one-year-old heifers. All dams were donors for embryo transfer and produced a maximum of 5 or 10 offspring. The total number of purebred offspring per generation was: 400, 800, 1,600 or 4,000 calves, and it was used as a measure of population size. Rate of inbreeding was predicted and controlled using pedigree relationships. Each OCS (TRS) scheme was simulated for 10 discrete generations and replicated 100 (200) times. The OCS scheme and the TRS scheme with a maximum of 10 offspring per dam required approximately 783 and 1,257 purebred offspring per generation to realize a true ΔG of €14 and a ΔF of 0.005 per generation. Schemes with a maximum of 5 offspring per dam required more purebred offspring per generation to realize a similar true ΔG and a similar ΔF. Our results show that OCS and multiple ovulation and embryo transfer act on selection intensity through different mechanisms to achieve fewer selection candidates and fewer selected sires and dams than under TRS at the same ΔG and a fixed ΔF. Therefore, we advocate the use of a breeding scheme with OCS and multiple ovulation and embryo transfer for beef cattle destined for use on dairy females because it is favorable both from an economic perspective and a carbon footprint perspective.     

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

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

引水隧洞瓦斯封堵施工技术探讨

山西中部引黄工程24标西干29+089.4~29+278隧洞段地处煤层带,富含瓦斯、一氧化碳等有害气体,且围岩节理发育、变形严重。针对初期支护完成地段、掌子面及裸露洞段和IV类围岩地段提出瓦斯封堵专项施工方案。通过密切监测做好通风,并采用高分子材料马丽散对其注浆,可有效解决隧洞瓦斯封堵难题,为类似项目提供参考。     

A charge sharing–based switching scheme for SAR ADCs

This paper presents an energy-efficient switching scheme for successive approximation register (SAR) analogue-to-digital converter (ADC). The proposed scheme employs charge recycling method to keep the capacitor arrays free of transitional energy between bit generations except reset phase. In comparison with the conventional switching scheme, the proposed one achieves 100% transitional energy saving without considering reset phase. In addition, configuration of a 10-bit SAR ADC shows that the proposed switching scheme reduces the capacitor area by 25% compared with the conventional switching scheme.     

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.     

非径向管板焊接接头的超声检测

对AP1000压水堆核电站安全壳贯穿件的非径向管板焊接接头结构特点进行了介绍,并分析其超声检测工艺的重点和难点。通过建立统一的缺陷定位坐标系并结合被检构件的几何特点进行综合分析,推导得出了h值(缺陷回波最高点距套管外壁的距离)的计算方法。为超声检测对这类焊接接头缺陷的准确识别和定位提供了行之有效的方法,为解决这类焊接接头的超声检测技术受限区提供了行之有效的措施。     

Reducing numerical dissipation in smoke simulation

Numerical dissipation acts as artificial viscosity to make smoke viscous. Reducing numerical dissipation is able to recover visual details smeared out by the numerical dissipation. Great efforts have been devoted to suppress the numerical dissipation in smoke simulation in the past few years. In this paper we investigate methods of combating the numerical dissipation. We describe visual consequences of the numerical dissipation and explore sources that introduce the numerical dissipation into course of smoke simulation. Methods are investigated from various aspects including grid variation, high-order advection, sub-grid compensation, invariant conservation, and particle-based improvement, followed by discussion and comparison in terms of visual quality, computational overhead, ease of implementation, adaptivity, and scalability, which leads to their different applicability to various application scenarios.