Fault diagnosis method of hydraulic system based on fusion of neural network and D-S evidence theory

According to fault type diversity and fault information uncertainty problem of the hydraulic driven rocket launcher servo system（HDRLSS） , the fault diagnosis method based on the evidence theory and neural network ensemble is proposed. In order to overcome the shortcomings of the single neural network, two improved neural network models are set up at the com-mon nodes to simplify the network structure. The initial fault diagnosis is based on the iron spectrum data and the pressure, flow and temperature（PFT） characteristic parameters as the input vectors of the two improved neural network models, and the diagnosis result is taken as the basic probability distribution of the evidence theory. Then the objectivity of assignment is real-ized. The initial diagnosis results of two improved neural networks are fused by D-S evidence theory. The experimental results show that this method can avoid the misdiagnosis of neural network recognition and improve the accuracy of the fault diagnosis of HDRLSS.

The partial side information problem with additional reconstructions

We consider a quadratic Gaussian distributed lossy source coding setup with an additional constraint of identical reconstructions between the encoder and the decoder.The setup consists of two correlated Gaussian sources,wherein one of them has to be reconstructed to be within some distortion constraint and match with a corresponding reconstruction at the encoder,while the other source acts as coded side information.We study the tradeoff between the rates of two encoders for a given distortion constraint on the reconstruction.An explicit characterization of this trade-off is the main result of the paper.We also give close inner and outer bounds for the discrete memoryless version of the problem.

Epidemic-Like Proximity-Based Traffic Offloading

Cellular networks are overloaded due to the mobile traffic surge,and mobile social networks(MSNets) can be leveraged for traffic offloading.In this paper,we study the issue of choosing seed users for maximizing the mobile traffic offloaded from cellular networks.We introduce a gossip-style social cascade(GSC) model to model the epidemic-like information diffusion process in MSNets.For static-case and mobile-case networks,we establish an equivalent view and a temporal mapping of the information diffusion process,respectively.We further prove the submodularity in the information diffusion and propose a greedy algorithm to choose the seed users for traffic offloading,yielding a sub-optimal solution to the NP-hard traffic offloading maximization(TOM) problem.Experiments are carried out to study the offloading performance,illustrating that the greedy algorithm significantly outperforms the heuristic and random algorithms,and user mobility can help further reduce cellular load.