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

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

社交网络中基于网络结构支撑模型的谣言传播研究

结合结构支撑理论，探究节点网络结构支持力的一些性质，提出了社交网络结构中的全网支持力和被支持力的总量一致性，并进一步提出计算节点支持力的方法。谣言作为特殊信息，在支持力不同节点之间的传播特性有所不同，借鉴随机游走模型中的PageRank计算方法，对不同节点支持力的谣言传播以及传播后的辟谣状况进行了仿真模拟，结果表明支持力不同的节点对于谣言传播和辟谣影响明显。     

Exactly satisfying initial conditions neural network models for numerical treatment of first Painlevé equation

In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models.     

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.     

An integrated approach to analysing the cost efficiency of postal networks

An integrated approach to measure the cost efficiency of the postal network of Universal Service Provider is proposed. An integrated approach enables the measurement of cost efficiency for delivery and non-delivery postal network units. The proposed approach is verified and tested on the postal network of the selected provider and the results were derived by using Data Envelopment Analysis (DEA). The results show that the main sources of inefficiency are inadequate allocation of resources relative to the network units. In addition, the study indicates that economies of scale have a positive impact on the efficiency of postal network units.     

Simultaneous synthesis of a heat exchanger network with multiple utilities using utility substages

Heat exchanger network synthesis (HENS) has progressed by using mathematical programming-based simultaneous methodology. Although various considerations such as non-isothermal mixing and bypass streams are applied to consider real world alternatives in modeling phase, many challenges are faced because of its properties within non-convex mixed-integer nonlinear programming (MINLP). We propose a modified superstructure, which contains a utility substage for use in considering multiple utilities in a simultaneous MINLP model. To improve model size and convergence, fixed utility locations according to temperature and series connections between utilities are suggested. The numbers of constraints, discrete, and continuous variables show that overall model size decreases compared with previous research. Thus, it is possible to expand the feasible search area for reaching the nearest global solution. The model's effectiveness and applications are exemplified by several literature problems, where it is used to deduce a network superior to that of any other reported methodology.     

CAN-BUS系统应用一例

CAN-BUS系统自问世以来,已将近30年,当代各品牌车辆纷纷采用,但大部分技术人员对CAN总线系统既熟悉又陌生。经常能听到,但具体操作又显得有些力不从心。本文通过对奇瑞A3品牌轿车CAN总线的巧妙应用,引导大家进一步理解和应用CAN总线。     

Multiobjective PSO based adaption of neural network topology for pixel classification in satellite imagery

The proposed work involves the multiobjective PSO based adaption of optimal neural network topology for the classification of multispectral satellite images. It is per pixel supervised classification using spectral bands (original feature space). This paper also presents a thorough experimental analysis to investigate the behavior of neural network classifier for given problem. Based on 1050 number of experiments, we conclude that following two critical issues needs to be addressed: (1) selection of most discriminative spectral bands and (2) determination of optimal number of nodes in hidden layer. We propose new methodology based on multiobjective particle swarm optimization (MOPSO) technique to determine discriminative spectral bands and the number of hidden layer node simultaneously. The accuracy with neural network structure thus obtained is compared with that of traditional classifiers like MLC and Euclidean classifier. The performance of proposed classifier is evaluated quantitatively using Xie-Beni and β indexes. The result shows the superiority of the proposed method to the conventional one.     

Comparative evaluation of different statistical tools for the prediction of uniaxial compressive strength of rocks

In this study, uniaxial compressive strength (UCS), unit weight (UW), Brazilian tensile strength (BTS), Schmidt hardness (SHH), Shore hardness (SSH), point load index (Is₅₀) and P-wave velocity (V_p) properties were determined. To predict the UCS, simple regression (SRA), multiple regression (MRA), artificial neural network (ANN), adaptive neuro-fuzzy inference system (ANFIS) and genetic expression programming (GEP) have been utilized. The obtained UCS values were compared with the actual UCS values with the help of various graphs. Datasets were modeled using different methods and compared with each other. In the study where the performance indice PI_at was used to determine the best performing method, MRA method is the most successful method with a small difference. It is concluded that the mean PI_at equal to 2.46 for testing dataset suggests the superiority of the MRA, while these values are 2.44, 2.33, and 2.22 for GEP, ANFIS, and ANN techniques, respectively. The results pointed out that the MRA can be used for predicting UCS of rocks with higher capacity in comparison with others. According to the performance index assessment, the weakest model among the nine model is P7, while the most successful models are P2, P9, and P8, respectively.     

Liner services network design and fleet deployment with empty container repositioning

Transportation demand of shipping container fluctuates due to the seasonality of international trade, thus, every 3–6 months, the liner company has to alter its current liner shipping service network, redeploy ships and design cargo routes with the objective of minimizing the total cost. To solve the problem, the paper presents a mixed integer linear program model. The proposed model incorporates several relevant constraints, such as weekly frequency, the transshipment of cargo between two or more service routes, and transport time. Extensive numerical experiments based on realistic date of Asia–Europe–Oceania shipping operations show that the proposed model can solve real-case problems efficiently by CPLEX. The results demonstrate that the model can reduce ship’s capacity consumption and raise ships’ capacity utilization.