用于电弧检测的电力专用SoC设计

针对传统的电弧电路故障检测结果不准确的问题,设计用于电弧检测的SoC系统,并且在55nm工艺下进行流片验证。采用包含两种结构的模数转换器的片上电压源,设计了锁相环以及复位电路,精度最高可达8.67 bit。验证结果表明,本设计可提高电弧检测的准确性。     

Machine learning algorithm selection for windage alteration fault diagnosis of mine ventilation system

Machine learning algorithms have been widely used in mine fault diagnosis. The correct selection of the suitable algorithms is the key factor that affects the fault diagnosis. However, the impact of machine learning algorithms on the prediction performance of mine fault diagnosis models has not been fully evaluated. In this study, the windage alteration faults (WAFs) diagnosis models, which are based on K-nearest neighbor algorithm (KNN), multi-layer perceptron (MLP), support vector machine (SVM), and decision tree (DT), are constructed. Furthermore, the applicability of these four algorithms in the WAFs diagnosis is explored by a T-type ventilation network simulation experiment and the field empirical application research of Jinchuan No. 2 mine. The accuracy of the fault location diagnosis for the four models in both networks was 100%. In the simulation experiment, the mean absolute percentage error (MAPE) between the predicted values and the real values of the fault volume of the four models was 0.59%, 97.26%, 123.61%, and 8.78%, respectively. The MAPE for the field empirical application was 3.94%, 52.40%, 25.25%, and 7.15%, respectively. The results of the comprehensive evaluation of the fault location and fault volume diagnosis tests showed that the KNN model is the most suitable algorithm for the WAFs diagnosis, whereas the prediction performance of the DT model was the second-best. This study realizes the intelligent diagnosis of WAFs, and provides technical support for the realization of intelligent ventilation.     

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.     

Tactile colour pictogram to improve artwork appreciation of people with visual impairments

A recent development in tactile technology enables an improvement in the appreciation of the visual arts for people with visual impairment (PVI). The tactile sense, in conjunction with, or a possibly as an alternative to, the auditory sense, would allow PVIs to approach artwork in a more self‐driven and engaging way that would be difficult to achieve with just an auditory stimulus. Tactile colour pictograms (TCPs), which are raised geometric patterns, are ideographic characters that are designed to enable PVIs to identify colours and interpret information by touch. In this article, three TCPs are introduced to code colours in the Munsell colour system. Each colour pattern consists of a basic cell size of 10 mm × 10 mm to represent the patterns consistently in terms of regular shape. Each TCP consists of basic geometric patterns that are combined to create primary, secondary, and tertiary colour pictograms of shapes indicating colour hue, intensity and lightness. Each TCP represents 29 colours including six hues; they were then further expanded to represent 53 colours. Two of them did not increase the cell size, the other increased the cell size 1.5 times for some colours, such as yellow‐orange, yellow, blue, and blue‐purple. Our proposed TCPs use a slightly larger cell size compared to most tactile patterns currently used to indicate colour, but code for more colours. With user experience and identification tests, conducted with 23 visually impaired adults, the effectiveness of the TCPs suggests that they were helpful for the participants.     

基于PBFT区块链技术的电网企业仓储系统

提出了一种基于实用拜占庭容错(PBFT)算法的区块链技术,首先对传统的实用拜占庭容错算法原理进行了阐述,该传统算法包含前期、需求、预准备、准备、确认、答复6个阶段,但传统算法具有实时性差、缺乏惩罚机制、带宽高的缺点。针对出现的这些问题,又对传统算法进行了改进,具体涉及记账节点、共识过程以及视图切换过程。通过测试进一步证明了该改进算法的实用性,并将该算法应用于电网企业中,构建的虚拟仓库实现了联储联备,降低了库存资金的耗费,并且提高了电网企业库存管理的效率。     

基于残差决策的自动飞行控制系统远程实时故障诊断

针对自动飞行控制系统结构复杂、关联部件众多,发生故障时诊断时间长,从而影响飞机运行效率的问题,提出一种基于飞机通信寻址报告系统(ACARS)的远程实时故障诊断方案。首先,分析自动飞行控制系统的故障特点,设计搭建检测滤波器;然后,利用ACARS数据链实时发送的自动飞行控制系统的关键信息进行相关部件的残差计算,并根据残差决策算法进行故障诊断及定位;最后,针对不同故障部件残差间的差异大、决策门限无法统一的缺点,提出基于二次差值的残差决策改进算法,减缓了检测对象的整体变化趋势,降低了随机噪声和干扰的影响,避免了将瞬态故障诊断为系统故障的情况。实验仿真结果表明,基于二次差值的改进残差决策算法避免了多决策门限的复杂性,在采样时间为0.1 s的情况下,故障检测所需时间大约为2 s,故障检测时间大幅降低,有效故障检测率大于90%。     

基于深度信念网络的列车故障音频诊断方法

铁路在交通运输行业有着举足轻重的地位，一旦列车发生故障将会导致严重的生命财产损失。由于列车发生故障的概率相对较低，因此难以捕获列车的故障样本。针对上述问题，提出了一种无监督学习的列车故障识别方法，通过检测列车音频信号来识别列车故障。该方法基于深度信念网络(DBN)，利用小波包分解提取检测信号的特征向量并将其作为DBN的输入，待网络充分训练后，由训练好的DBN识别当前列车的运行状况。现场监测实验结果表明，该方法能够在无监督的条件下有效识别列车故障，保障了列车的运行安全。     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.