This paper is intended to provide an alternative approach for the design of FIR filters by using a Hopfield Neural Network (HNN). The proposed approach establishes the error function between the amplitude response of the desired FIR filter and the designed one as a Lyapunov energy function to find the HNN parameters. Using the framework of HNN, the optimal filter coefficients can be obtained from the output state of the network. With the advantages of local connectivity, regularity and modularity, the architecture of the proposed approach can be applied to the design of differentiators and Hilbert transformer with significantly reduction of computational complexity and hardware cost. As the simulation results illustrate, the proposed neural-based method is capable of achieving an excellent performance for filter design.

Scheduling plays a key role in MapReduce systems. In this paper, we explore the efficiency of an MapReduce cluster running lots of independent and continuously arriving MapReduce jobs. Data locality and load balancing are two important factors to improve computation efficiency in MapReduce systems for data-intensive computations. Traditional cluster scheduling technologies are not well suitable for MapReduce environment, there are some in-used schedulers for the popular open-source Hadoop MapReduce implementation, however, they can not well optimize both factors. Our main objective is to minimize total flowtime of all jobs, given it's a strong NP-hard problem, we adopt some effective heuristics to seek satisfied solution. In this paper, we formalize the scheduling problem as job selection problem, a load balance aware job selection algorithm is proposed, in task level we design a strict data locality tasks scheduling algorithm for map tasks on map machines and a load balance aware scheduling algorithm for reduce tasks on reduce machines. Comprehensive experiments have been conducted to compare our scheduling strategy with well-known Hadoop scheduling strategies. The experimental results validate the efficiency of our proposed scheduling strategy.

In this paper, we first propose ten new discrimination features of SAR images in the moving and stationary target acquisition and recognition (MSTAR) database. The Ada_MCBoost algorithm is then proposed to classify multiclass SAR targets. In the new algorithm, we introduce a novel large-margin loss function to design a multiclass classifier directly instead of decomposing the multiclass problem into a set of binary ones through the error-correcting output codes (ECOC) method. Finally, experiments show that the new features are helpful for SAR targets discrimination; the new algorithm had better recognition performance than three other contrast methods.

To overcome the target-aspect sensitivity in radar high resolution range profile (HRRP) recognition, a novel method called Improved Kernel Distance Fuzzy C-means Clustering Method (IKDFCM) is proposed in this paper, which introduces kernel function into fuzzy c-means clustering and relaxes the constraint in the membership matrix. The new method finds the underlying geometric structure information hiding in HRRP target and uses it to overcome the HRRP target-aspect sensitivity. The relaxing of constraint in the membership matrix improves anti-noise performance and robustness of the algorithm. Finally, experiments on three kinds of ground HRRP target under different SNRs and four UCI datasets demonstrate the proposed method not only has better recognition accuracy but also more robust than the other three comparison methods.

Survivable virtual network embedding (SVNE) is one of major challenges of network virtualization. In order to improve the utilization rate of the substrate network (SN) resources with virtual network (VN) topology connectivity guarantee under link failure in SN, we first establishes an Integer Linear Programming (ILP) model for that under SN supports path splitting. Then we designs a novel survivable VN topology protection method based on particle swarm optimization (VNE-PSO), which redefines the parameters and related operations of particles with the embedding overhead as the fitness function. Simulation results show that the solution significantly improves the long-term average revenue of the SN, the acceptance rate of VN requests, and reduces the embedding time compared with the existing research results.

A modified successive interference cancellation (SIC) algorithm for orthogonal frequency division multiplexing (OFDM) system is presented. The presented modified SIC algorithm makes use of an index sequence to avoid the subcarriers re-ordering calculation. Furthermore, by combining the SIC with the conventional zero-forcing (ZF) detection, computation complexity of the presented algorithm can be significantly reduced and meanwhile excellent performance can be maintained.

For multimedia communications, the computational scalability of a multimedia codec is required to match with different working platforms and integrated services of media sources. In this paper, two condensed stochastic codebook search approaches are proposed to progressively reduce the computation required for the algebraic code excited linear predictive (ACELP) and multi-pulse maximum likelihood quantization (MP-MLQ) coders. By reducing the candidates of the codebook before search procedure, the proposed methods can effectively diminish the computation required for the ITU-T G.723.1 dual rate speech coder. Simulation results show that the proposed methods can save over 50 percent for the stochastic codebook search with perceptually intangible degradation in speech quality.

Differing from the long-term prediction used in the modern speech codec, the standard of the internet low bit rate codec (iLBC) independently encodes the residual of the linear predictive coding (LPC) frame by frame. In this paper, a complexity scalability design is proposed for the coding of the dynamic codebook search in the iLBC speech codec. In addition, a trade-off between the computational complexity and the speech quality can be achieved by dynamically setting the parameter of the proposed approach. Simulation results show that the computational complexity can be effectively reduced with imperceptible degradation of the speech quality.

How to restore virtual network against substrate network failure (e.g. link cut) is one of the key challenges of network virtualization. The traditional virtual network recovery (VNR) methods are mostly based on the idea of centralized control. However, if multiple virtual networks fail at the same time, their recovery processes are usually queued according to a specific priority, which may increase the average waiting time of users. In this letter, we study distributed virtual network recovery (DVNR) method to improve the virtual network recovery efficiency. We establish exclusive virtual machine (VM) for each virtual network and process recovery requests of multiple virtual networks in parallel. Simulation results show that the proposed DVNR method can obtain recovery success rate closely to centralized VNR method while yield ~70% less average recovery time.

Based on the theoretical analysis of literature, saturation in measured signal of active noise control (ANC) systems will degrade the convergence speed. However, the experiments show that the saturated input signal can speed up the convergence of the narrow-band ANC systems. This paper intends to remodel the saturation effects for feedforward and feedback ANC systems. Combining the action of analog-to-digital converters (ADC), the mathematical expression and block diagrams are proposed to model the saturation effects in the practical ANC systems. The derivation and simulation results show that since the saturation is able to amplify the principle component of signal, the convergence would be speeded up.

In this paper, the simplified search designs for the stochastic codebook of algebraic code excited linear prediction (ACELP) for ITU-T G.729D speech coder are proposed. By using two search rounds and limiting the search range, the computational complexity of the proposed approach is only 6.25% of the full search method recommended by G.729D. In addition, the computational complexity of proposed approach is only 59% of the global pulse replacement search method recommended by G.729.1. Simulation results show that the coded speech quality evaluated by using the standard subjective and objective quality measurements is with perceptually negligible degradation.

Tool condition monitoring is one of the core tasks of intelligent manufacturing in digital workshop. This paper presents an intelligent recognize method of tool condition based on deep learning. First, the industrial microphone is used to collect the acoustic signal during machining; then, a central fractal decomposition algorithm is proposed to extract sensitive information; finally, the multi-scale convolutional recurrent neural network is used for deep feature extraction and pattern recognition. The multi-process milling experiments proved that the proposed method is superior to the existing methods, and the recognition accuracy reached 88%.

An attention residual network with triple feature as input is proposed to predict the remaining useful life (RUL) of bearings. First, the channel attention and spatial attention are connected in series into the residual connection of the residual neural network to obtain a new attention residual module, so that the newly constructed deep learning network can better pay attention to the weak changes of the bearing state. Secondly, the “triple feature” is used as the input of the attention residual network, so that the deep learning network can better grasp the change trend of bearing running state, and better realize the prediction of the RUL of bearing. Finally, The method is verified by a set of experimental data. The results show the method is simple and effective, has high prediction accuracy, and reduces manual intervention in RUL prediction.