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.     

Tabular data: Deep learning is not all you need

A key element in solving real-life data science problems is selecting the types of models to use. Tree ensemble models (such as XGBoost) are usually recommended for classification and regression problems with tabular data. However, several deep learning models for tabular data have recently been proposed, claiming to outperform XGBoost for some use cases. This paper explores whether these deep models should be a recommended option for tabular data by rigorously comparing the new deep models to XGBoost on various datasets. In addition to systematically comparing their performance, we consider the tuning and computation they require. Our study shows that XGBoost outperforms these deep models across the datasets, including the datasets used in the papers that proposed the deep models. We also demonstrate that XGBoost requires much less tuning. On the positive side, we show that an ensemble of deep models and XGBoost performs better on these datasets than XGBoost alone.     

LinkingPark: An automatic semantic table interpretation system

In this paper, we present LinkingPark, an automatic semantic annotation system for tabular data to knowledge graph matching. LinkingPark is designed as a modular framework which can handle Cell-Entity Annotation (CEA), Column-Type Annotation (CTA), and Columns-Property Annotation (CPA) altogether. It is built upon our previous SemTab 2020 system, which won the 2nd prize among 28 different teams after four rounds of evaluations. Moreover, the system is unsupervised, stand-alone, and flexible for multilingual support. Its backend offers an efficient RESTful API for programmatic access, as well as an Excel Add-in for ease of use. Users can interact with LinkingPark in near real-time, further demonstrating its efficiency.     

Benchmark experiment of large-angle scattering reaction cross section of iron at 14 MeV using two shadow bars – Comparison of experimental results with ENDF/B-VIII –

ABSTRACT

It is important to perform neutron transport simulations with accurate nuclear data in the neutronics design of a fusion reactor. However, absolute values of large-angle scattering cross sections vary among nuclear data libraries even for well-examined nuclide of iron. Benchmark experiments focusing on large-angle scattering cross sections were thus performed to confirm the correctness of nuclear data libraries. The series benchmark experiments were performed at a DT neutron source facility, OKTAVIAN of Osaka University, Japan, by the unique experimental system established by the authors’ group, which can extract only the contribution of large-angle scattering reactions. This system consists of two shadow bars, target plate (iron), and neutron detector (niobium). Two types of shadow bars were used and four irradiations were conducted for one experiment, so that contribution of room-return neutrons was effectively removed and only large-angle scattering neutrons were extracted from the measured four Nb reaction rates. The obtained experimental results were compared with calculations for five nuclear data libraries including JENDL-4.0, JEFF.-3.3, FENDL-3.1, ENDF/B- VII, and recently released ENDF/B-VIII. It was found from the comparison that ENDF/B-VIII showed the best result, though ENDF/B-VII showed overestimation and others are in large underestimation at 14 MeV.     

Feature selection methods for root-cause analysis among top-level product attributes

Manufacturing companies not only strive to deliver flawless products but also monitor product failures in the field to identify potential quality issues. When product failures occur, quality engineers must identify the root cause to improve any affected product and process. This root-cause analysis can be supported by feature selection methods that identify relevant product attributes, such as manufacturing dates with an increased number of product failures. In this paper, we present different methods for feature selection and evaluate their ability to identify relevant product attributes in a root-cause analysis. First, we compile a list of feature selection methods. Then, we summarize the properties of product attributes in warranty case data and discuss these properties regarding the challenges they pose for machine learning algorithms. Next, we simulate datasets of warranty cases, which emulate these product properties. Finally, we compare the feature selection methods based on these simulated datasets. In the end, the univariate filter information gain is determined to be a suitable method for a wide range of applications. The comparison based on simulated data provides a more general result than other publications, which only focus on a single use case. Due to the generic nature of the simulated datasets, the results can be applied to various root-cause analysis processes in different quality management applications and provide a guideline for readers who wish to explore machine learning methods for their analysis of quality data.     

基于K-means和SOM的水下传感器数据采集方法

随着海洋资源勘探和海洋污染物监控工作的开展，水文数据的监测和采集等已经成为重要的研究方向。其中，水下无线传感器网络在水文数据采集过程中起着举足轻重的作用。本文研究的是水下无线传感器二维监测网络模型中，传感器节点数据采集的问题，其设计方法是通过自组织映射（Self-organizing mapping，SOM）对传感器节点进行路径最优化处理，结合优化的路径图形和K-means算法找到路径内部聚合点，利用聚合点和传感器的节点得到传感器通信半径内的数据采集点，最后通过SOM得到水下机器人（Autonomous underwater vehicle，AUV）到各个数据采集点采集数据的最优路径。经过实验验证，在水下1 200 m×1 750 m范围内布置52个传感器节点的情景下，数据采集点相比于传感器节点路径规划采用相同的采集顺序得到的路径优化了6.7%；对数据采集点重新进行自组织路径规划得到的路径比传感器结点路径的最优解提高了12.2%。增加传感器节点的数量，其结果也大致相同，因此采用该方法可以提高水下机器人采集数据的效率。     

A new signal processing-based islanding detection method using pyramidal algorithm with undecimated wavelet transform for distributed generators of hydrogen energy

Machine learning-based fault detection methods are frequently combined with wavelet transform (WT) to detect an unintentional islanding condition. In contrast to this condition, these methods have long detection and computation time. Thus, selecting a useful signal processing-based approach is required for reliable islanding detection, especially in real-time applications. This paper presents a new modified signal processing-based islanding detection method (IDM) for real-time applications of hydrogen energy-based distributed generators. In the study, a new IDM using a modified pyramidal algorithm approach with an undecimated wavelet transform (UWT) is presented. The proposed method is performed with different grid conditions with the presence of electric noise in real-time. Experimental results show that oscillations in the acquired signal can be reduced by the UWT, and noise sensitivity is lower than other WT-based methods. The non-detection zone is zero and the maximum detection and computational time is also 75 ms at a close power match.     

基于面元素重排的三维网格模型数据隐藏算法

目的 为了解决目前三维数据隐藏算法不能兼顾无失真和盲提取的问题，提出一种新的完全无失真的三维网格模型数据隐藏盲算法。方法 首先使用混沌逻辑映射选择嵌入与提取模式，保证数据的安全性。然后利用面元素重排，完全不会造成三维模型失真的性质，通过不同嵌入模式规则对三角面元素进行重排，以嵌入秘密数据。接收端则可根据相应的提取模式规则提取秘密数据。结果 仿真结果与分析表明，该算法不会对三维模型造成任何失真，嵌入容量为每顶点2比特，且能抵抗仿射变换攻击、噪声攻击和平滑攻击等。结论 这种三维数据隐藏盲算法无失真，容量大、安全性高、鲁棒性强，适用于三维载体不容修改的情形，如军事、医学、秘密通信和版权保护等。     

自适应融合层级特征的混合退化图像复原算法

多种退化类型混合的图像比单一类型的退化图像降质更严重,很难建立精确模型对其复原,研究端到端的神经网络算法是复原的关键.现有的基于操作选择注意力网络的算法(operation-wiseattentionnetwork,OWAN)虽然有一定的性能提升,但是其网络过于复杂,运行较慢,复原图像缺乏高频细节,整体效果也有提升的空间.针对这些问题,提出一种基于层级特征融合的自适应复原算法.该算法直接融合不同感受野分支的特征,增强复原图像的结构;用注意力机制对不同层级的特征进行动态融合,增加模型的自适应性,降低了模型冗余;另外,结合L1损失和感知损失,增强了复原图像的视觉感知效果.在DIV2K,BSD500等数据集上的实验结果表明,该算法无论是在峰值信噪比和结构相似性上的定量分析,还是在主观视觉质量方面,均优于OWAN算法,充分证明了该算法的有效性.