A method for constraining the end effect of EMD based on sequential similarity detection and adaptive filter

Aimed at the problem of the end effect when using empirical mode decomposition(EMD),a method for constraining the end effect of EMD is proposed based on sequential similarity detection and adaptive filter.The method divides the signal into many wavelets,and it changes the initial wavelet length to select the best initial wavelet that has the minimum error and maximum number of matching seed wavelets,and the wavelet slopes are used for pre-matching and secondary matching to speed up the matching speed.Then,folded self-adaptive threshold is used to select multiple seed wavelets,and finally the end waveform is predicted and expanded according to the adaptive filter method.The proposed method is used to analyze the non-stationary nonlinear simulation signal and experimental signal,and it is compared with the mirror extension and RBF extension methods.The orthogonality index and similarity index of the EMD results of the extended signal after the proposed method are better than those of the other methods.The results show that the proposed method can better constrain the end effect,and has certain validity,accuracy and stability in solving the end effect problem.

Sequential Similarity Detection Algorithm Based on Image Edge Feature

： This paper proposes a new sequential similarity detection algorithm （SSDA）, which can overcome matching error caused by grayscale distortion; meanwhile, time consumption is much less than that of regular algorithms based on image feature. The algorithm adopts Sobel operator to deal with subgraph and template image, and regards the region which has maximum relevance as final result. In order to solve time-consuming problem existing in original algorithm, a coarse-to-fine matching method is put forward. Besides, the location correlation keeps updating and remains the minimum value in the whole scanning process, which can significantly decrease time consumption. Experiments show that the algorithm proposed in this article can not only overcome gray distortion, but also ensure accuracy. Time consumption is at least one time orders of magnitude shorter than that of primal algorithm.

Deep Learning-Based Program-Wide Binary Code Similarity for Smart Contracts

Recently,security issues of smart contracts are arising great attention due to the enormous financial loss caused by vulnerability attacks.There is an increasing need to detect similar codes for hunting vulnerability with the increase of critical security issues in smart contracts.Binary similarity detection that quantitatively measures the given code diffing has been widely adopted to facilitate critical security analysis.However,due to the difference between common programs and smart contract,such as diversity of bytecode generation and highly code homogeneity,directly adopting existing graph matching and machine learning based techniques to smart contracts suffers from low accuracy,poor scalability and the limitation of binary similarity on function level.Therefore,this paper investigates graph neural network to detect smart contract binary code similarity at the program level,where we conduct instruction-level normalization to reduce the noise code for smart contract pre-processing and construct contract control flow graphs to represent smart contracts.In particular,two improved Graph Convolutional Network(GCN)and Message Passing Neural Network(MPNN)models are explored to encode the contract graphs into quantitatively vectors,which can capture the semantic information and the program-wide control flow information with temporal orders.Then we can efficiently accomplish the similarity detection by measuring the distance between two targeted contract embeddings.To evaluate the effectiveness and efficient of our proposed method,extensive experiments are performed on two real-world datasets,i.e.,smart contracts from Ethereum and Enterprise Operation System(EOS)blockchain-based platforms.The results show that our proposed approach outperforms three state-of-the-art methods by a large margin,achieving a great improvement up to 6.1%and 17.06%in accuracy.

Fast Digital Correlation Calculation Method in Extended Beacon Wavefront Detection

On the basis of Hartmann Shack sensor imaging analysis, a new method is presented with which the wavefront slope can be obtained when the object is incoherent and extended. This method, which is demonstrated by both theoretical interpreting and computer simulation, explains how to measure the wavefront slope difference between two sub apertures through the determination of image displacements on detector plane. It includes a fast and accurate digital algorithm for detecting wavefront disturbance, which is much suitable for realization in such electrical hardwares as digital signal processors.

Detection of semantically similar code

The traditional similar code detection approaches are limited in detecting semantically similar codes, impeding their applications in practice. In this paper, we have improved the traditional metrics-based approach as well as the graph- based approach and presented a metrics-based and graph- based combined approach. First, source codes are represented as augmented system dependence graphs. Then, metrics- based candidate similar code extraction is performed to filter out most of the dissimilar code pairs so as to lower the computational complexity. After that, code normalization is performed on the candidate similar codes to remove code variations so as to detect similar code at the semantic level. Finally, program matching is performed on the normalized control dependence trees to output semantically similar codes. Experiment results show that our approach can detect similar codes with code variations, and it can be applied to large software.