极限工况下的管网“互联互通”改进方案

在全国天然气管道“主干互联、区域成网”(以下简称“互联互通”)基础格局逐渐形成的背景下,天然气管网规模日益扩大、管道分支和气源增加,并且分布不集中、输送方向可变,使得输气方案更加灵活,可以更好地解决某些地域的供气紧张问题;但受现有站场和设备的限制,暂不能满足某些多线组合极限工况,使得“互联互通”的初衷难以全部实现。为了使得现有的各输气干线在实现“互联互通”之后可以满足更多的多线组合工况,在分析“互联互通”背景下M管网工况变化的基础上,研发了可以进行水力仿真和压气站方案制订的计算软件,并对3种极限工况下的不同输气量情况进行了可行性试算,进而基于试算结果提出了相应的管网改进建议。研究结果表明:(1)经验证,软件计算误差满足要求;(2)在M管道某处增设压气站或在某些输气站场配置压缩机组;(3) M管网改进调整后,可以完成大部分的多线组合极限工况,真正实现“互联互通”的输气方案。结论认为,该研究成果有助于推进全国天然气管网早日实现“互联互通”。     

论携号转网行为的私法规制

以电信用户入网协议为切入点,电信用户的携号转网行为应受到《合同法》《消费者权益保护法》等私法规范的保护与限制。该行为引起的格式条款解释、合同终止、违约责任、损失赔偿等问题,不能仅靠《电信条例》等公法规范来调整。应当积极引导广大消费者用户以私法领域相关规定为依据,转变争议解决思维,拓宽纠纷处理途径,合理选择维权手段,以保护自身合法民事权益,与行业监管部门共同推动电信行业有序发展。     

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

铁路在交通运输行业有着举足轻重的地位，一旦列车发生故障将会导致严重的生命财产损失。由于列车发生故障的概率相对较低，因此难以捕获列车的故障样本。针对上述问题，提出了一种无监督学习的列车故障识别方法，通过检测列车音频信号来识别列车故障。该方法基于深度信念网络(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.