Parameter Estimation Algorithm of Frequency-Hopping Signal in Compressed Domain Based on Improved Atomic Dictionary.

This paper considers the problem of estimating the parameters of a frequency-hopping signal under non-cooperative conditions. To make the estimation of different parameters independently of each other, a compressed domain frequency-hopping signal parameter estimation algorithm based on the improved atomic dictionary is proposed. By segmenting and compressive sampling the received signal, the center frequency of each signal segment is estimated using the maximum dot product. The signal segments are processed with central frequency variation using the improved atomic dictionary to accurately estimate the hopping time. We highlight that one superiority of the proposed algorithm is that high-resolution center frequency estimation can be directly obtained without reconstructing the frequency-hopping signal. Additionally, another superiority of the proposed algorithm is that hopping time estimation has nothing to do with center frequency estimation. Numerical results show that the proposed algorithm can achieve superior performance compared with the competing method.

Emitter Identification of Digital Modulation Transmitter Based on Nonlinearity and Modulation Distortion of Power Amplifier.

Specific transmitter identification (SEI) is a technology that uses a received signal to identify to which individual radiation source the transmitted signal belongs. It can complete the identification of the signal transmitter in a non-cooperative scenario. Therefore, there are broad application prospects in the field of wireless-communication-network security, spectral resource management, and military battlefield-target communication countermeasures. This article demodulates and reconstructs a digital modulation signal to obtain a signal without modulator distortion and power-amplifier nonlinearity. Comparing the reconstructed signal with the actual received signal, the coefficient representation of the nonlinearity of the power amplifier and the distortion of the modulator can be obtained, and these coefficients can be used as the fingerprint characteristics of different transmitters through a convolutional neural network (CNN) to complete the identification of specific transmitters. The existing SEI strategy for changing the modulation parameters of a test signal is to mix part of the test signal with the training signal so that the classifier can learn the signal of which the modulation parameter was changed. This method is still data-oriented and cannot process signals for which the classifier has not been trained. It has certain limitations in practical applications. We compared the fingerprint features extracted by the method in this study with the fingerprint features extracted by the bispectral method. When SNR < 20 dB, the recognition accuracy of the bispectral method dropped rapidly. The method in this paper still achieved 86% recognition accuracy when SNR = 0 dB. When the carrier frequency of the test signal was changed, the bispectral feature failed, and the proposed method could still achieve a recognition accuracy of about 70%. When changing the test-signal baud rate, the proposed method could still achieve a classification accuracy rate of more than 70% for four different individual radiation sources when SNR = 0 dB.

Blind Recognition of Forward Error Correction Codes Based on Recurrent Neural Network.

Forward error correction coding is the most common way of channel coding and the key point of error correction coding. Therefore, the recognition of which coding type is an important issue in non-cooperative communication. At present, the recognition of FEC codes is mainly concentrated in the field of semi-blind identification with known types of codes. However, the receiver cannot know the types of channel coding previously in non-cooperative systems such as cognitive radio and remote sensing of communication. Therefore, it is important to recognize the error-correcting encoding type with no prior information. In the paper, we come up with a neoteric method to identify the types of FEC codes based on Recurrent Neural Network (RNN) under the condition of non-cooperative communication. The algorithm classifies the input data into Bose-Chaudhuri-Hocquenghem (BCH) codes, Low-density Parity-check (LDPC) codes, Turbo codes and convolutional codes. So as to train the RNN model with better performance, the weight initialization method is optimized and the network performance is improved. The experimental result indicates that the average recognition rate of this model is 99% when the signal-to-noise ratio (SNR) ranges from 0 dB to 10 dB, which is in line with the requirements of engineering practice under the condition of non-cooperative communication. Moreover, the comparison of different parameters and models show the effectiveness and practicability of the algorithm proposed.

Recognizing Non-Collaborative Radio Station Communication Behaviors Using an Ameliorated LeNet.

This work improves a LeNet model algorithm based on a signal's bispectral features to recognize the communication behaviors of a non-collaborative short-wave radio station. At first, the mapping relationships between the burst waveforms and the communication behaviors of a radio station are analyzed. Then, bispectral features of simulated behavior signals are obtained as the input of the network. With regard to the recognition neural network, the structure of LeNet and the size of the convolutional kernel in LeNet are optimized. Finally, the five types of communication behavior are recognized by using the improved bispectral estimation matrix of signals and the ameliorated LeNet. The experimental results show that when the signal-to-noise ratio (SNR) values are 8, 10, or 15 dB, the recognition accuracy values of the improved algorithm reach 81.5%, 94.5%, and 99.3%, respectively. Compared with other algorithms, the training time cost and recognition accuracy of the proposed algorithm are lower and higher, respectively; thus, the proposed algorithm is of great practical value.

Unidimensional ACGAN Applied to Link Establishment Behaviors Recognition of a Short-Wave Radio Station.

It is difficult to obtain many labeled Link Establishment (LE) behavior signals sent by non-cooperative short-wave radio stations. We propose a novel unidimensional Auxiliary Classifier Generative Adversarial Network (ACGAN) to get more signals and then use unidimensional DenseNet to recognize LE behaviors. Firstly, a few real samples were randomly selected from many real signals as the training set of unidimensional ACGAN. Then, the new training set was formed by combining real samples with fake samples generated by the trained ACGAN. In addition, the unidimensional convolutional auto-coder was proposed to describe the reliability of these generated samples. Finally, different LE behaviors could be recognized without the communication protocol standard by using the new training set to train unidimensional DenseNet. Experimental results revealed that unidimensional ACGAN effectively augmented the training set, thus improving the performance of recognition algorithm. When the number of original training samples was 400, 700, 1000, or 1300, the recognition accuracy of unidimensional ACGAN+DenseNet was 1.92, 6.16, 4.63, and 3.06% higher, respectively, than that of unidimensional DenseNet.

A Novel Outdoor Positioning Technique Using LTE Network Fingerprints.

In recent years, wireless-based fingerprint positioning has attracted increasing research attention owing to its position-related features and applications in the Internet of Things (IoT). In this paper, by leveraging long-term evolution (LTE) signals, a novel deep-learning-based fingerprint positioning approach is proposed to solve the problem of outdoor positioning. Considering the outstanding performance of deep learning in image classification, LTE signal measurements are converted into location grayscale images to form a fingerprint database. In order to deal with the instability of LTE signals, prevent the gradient dispersion problem, and increase the robustness of the proposed deep neural network (DNN), the following methods are adopted: First, cross-entropy is used as the loss function of the DNN. Second, the learning rate of the proposed DNN is dynamically adjusted. Third, this paper adopted several data enhancement techniques. To find the best positioning fingerprint and method, three types of fingerprint and five positioning models are compared. Finally, by using a deep residual network (Resnet) and transfer learning, a hierarchical structure training method is proposed. The proposed Resnet is used to train with the united fingerprint image database to obtain a positioning model called a coarse localizer. By using the prior knowledge of the pretrained Resnet, feed-forward neural network (FFNN)-based transfer learning is used to train with the united fingerprint database to obtain a better positioning model, called a fine localizer. The experimental results convincingly show that the proposed DNN can automatically learn the location features of LTE signals and achieve satisfactory positioning accuracy in outdoor environments.

Deep Learning for Fingerprint-Based Outdoor Positioning via LTE Networks.

Fingerprint-based positioning techniques are a hot research topic because of their satisfactory accuracy in complex environments. In this study, we adopted the deep-learning-based long-time-evolution (LTE) signal fingerprint positioning method for outdoor environment positioning. Inspired by state-of-the-art image classification methods, a novel hybrid location gray-scale image utilizing LTE signal fingerprints is proposed in this paper. In order to deal with signal fluctuations, several data enhancement methods are adopted. A hierarchical architecture is put forward during the deep neural network (DNN) training. First, the proposed positioning technique is pre-trained by a modified Deep Residual Network (Resnet) coarse localizer which is capable of learning reliable features from a set of unstable LTE signals. Then, to alleviate the tremendous collection workload, as well as further improve the positioning accuracy, by using a multilayer perceptron (MLP), a transfer learning-based fine localizer is introduced for fine-tuning the coarse localizer. The experimental data was collected from realistic scenes to meet the requirement of actual environments. The experimental results show that the proposed system leads to a considerable positioning accuracy in a variety of outdoor environments.

Communication behavior recognition using CNN-based signal analysis.

This article explores the technology of recognizing non-cooperative communication behavior, with a specific emphasis on analyzing communication station signals. Conventional techniques for analyzing signal data frames to determine their identity, while precise, do not have the ability to operate in real-time. In order to tackle this issue, we developed a pragmatic architecture for recognizing communication behavior and a system based on polling. The method utilizes a one-dimensional convolutional neural network (CNN) to segment data, hence improving its ability to recognize various communication activities. The study assesses the reliability of CNN in several real-world scenarios, examining its accuracy in the presence of noise interference, varying lengths of interception signals, interferences at different frequency points, and dynamic changes in outpost locations. The experimental results confirm the efficacy and dependability of the convolutional neural network in recognizing communication behavior in various contexts.

Prediction of protein-protein interactions from amino acid sequences with ensemble extreme learning machines and principal component analysis.

BACKGROUND: Protein-protein interactions (PPIs) play crucial roles in the execution of various cellular processes and form the basis of biological mechanisms. Although large amount of PPIs data for different species has been generated by high-throughput experimental techniques, current PPI pairs obtained with experimental methods cover only a fraction of the complete PPI networks, and further, the experimental methods for identifying PPIs are both time-consuming and expensive. Hence, it is urgent and challenging to develop automated computational methods to efficiently and accurately predict PPIs. RESULTS: We present here a novel hierarchical PCA-EELM (principal component analysis-ensemble extreme learning machine) model to predict protein-protein interactions only using the information of protein sequences. In the proposed method, 11188 protein pairs retrieved from the DIP database were encoded into feature vectors by using four kinds of protein sequences information. Focusing on dimension reduction, an effective feature extraction method PCA was then employed to construct the most discriminative new feature set. Finally, multiple extreme learning machines were trained and then aggregated into a consensus classifier by majority voting. The ensembling of extreme learning machine removes the dependence of results on initial random weights and improves the prediction performance. CONCLUSIONS: When performed on the PPI data of Saccharomyces cerevisiae, the proposed method achieved 87.00% prediction accuracy with 86.15% sensitivity at the precision of 87.59%. Extensive experiments are performed to compare our method with state-of-the-art techniques Support Vector Machine (SVM). Experimental results demonstrate that proposed PCA-EELM outperforms the SVM method by 5-fold cross-validation. Besides, PCA-EELM performs faster than PCA-SVM based method. Consequently, the proposed approach can be considered as a new promising and powerful tools for predicting PPI with excellent performance and less time.

Assessing and predicting protein interactions by combining manifold embedding with multiple information integration.

BACKGROUND: Protein-protein interactions (PPIs) play crucial roles in virtually every aspect of cellular function within an organism. Over the last decade, the development of novel high-throughput techniques has resulted in enormous amounts of data and provided valuable resources for studying protein interactions. However, these high-throughput protein interaction data are often associated with high false positive and false negative rates. It is therefore highly desirable to develop scalable methods to identify these errors from the computational perspective. RESULTS: We have developed a robust computational technique for assessing the reliability of interactions and predicting new interactions by combining manifold embedding with multiple information integration. Validation of the proposed method was performed with extensive experiments on densely-connected and sparse PPI networks of yeast respectively. Results demonstrate that the interactions ranked top by our method have high functional homogeneity and localization coherence. CONCLUSIONS: Our proposed method achieves better performances than the existing methods no matter assessing or predicting protein interactions. Furthermore, our method is general enough to work over a variety of PPI networks irrespectively of densely-connected or sparse PPI network. Therefore, the proposed algorithm is a much more promising method to detect both false positive and false negative interactions in PPI networks.

Using manifold embedding for assessing and predicting protein interactions from high-throughput experimental data.

MOTIVATION: High-throughput protein interaction data, with ever-increasing volume, are becoming the foundation of many biological discoveries, and thus high-quality protein-protein interaction (PPI) maps are critical for a deeper understanding of cellular processes. However, the unreliability and paucity of current available PPI data are key obstacles to the subsequent quantitative studies. It is therefore highly desirable to develop an approach to deal with these issues from the computational perspective. Most previous works for assessing and predicting protein interactions either need supporting evidences from multiple information resources or are severely impacted by the sparseness of PPI networks. RESULTS: We developed a robust manifold embedding technique for assessing the reliability of interactions and predicting new interactions, which purely utilizes the topological information of PPI networks and can work on a sparse input protein interactome without requiring additional information types. After transforming a given PPI network into a low-dimensional metric space using manifold embedding based on isometric feature mapping (ISOMAP), the problem of assessing and predicting protein interactions is recasted into the form of measuring similarity between points of its metric space. Then a reliability index, a likelihood indicating the interaction of two proteins, is assigned to each protein pair in the PPI networks based on the similarity between the points in the embedded space. Validation of the proposed method is performed with extensive experiments on densely connected and sparse PPI network of yeast, respectively. Results demonstrate that the interactions ranked top by our method have high-functional homogeneity and localization coherence, especially our method is very efficient for large sparse PPI network with which the traditional algorithms fail. Therefore, the proposed algorithm is a much more promising method to detect both false positive and false negative interactions in PPI networks. AVAILABILITY: MATLAB code implementing the algorithm is available from the web site http://home.ustc.edu.cn/∼yzh33108/Manifold.htm.

Neighborhood rough set reduction-based gene selection and prioritization for gene expression profile analysis and molecular cancer classification.

Selection of reliable cancer biomarkers is crucial for gene expression profile-based precise diagnosis of cancer type and successful treatment. However, current studies are confronted with overfitting and dimensionality curse in tumor classification and false positives in the identification of cancer biomarkers. Here, we developed a novel gene-ranking method based on neighborhood rough set reduction for molecular cancer classification based on gene expression profile. Comparison with other methods such as PAM, ClaNC, Kruskal-Wallis rank sum test, and Relief-F, our method shows that only few top-ranked genes could achieve higher tumor classification accuracy. Moreover, although the selected genes are not typical of known oncogenes, they are found to play a crucial role in the occurrence of tumor through searching the scientific literature and analyzing protein interaction partners, which may be used as candidate cancer biomarkers.

Detecting protein-protein interactions with a novel matrix-based protein sequence representation and support vector machines.

Proteins and their interactions lie at the heart of most underlying biological processes. Consequently, correct detection of protein-protein interactions (PPIs) is of fundamental importance to understand the molecular mechanisms in biological systems. Although the convenience brought by high-throughput experiment in technological advances makes it possible to detect a large amount of PPIs, the data generated through these methods is unreliable and may not be completely inclusive of all possible PPIs. Targeting at this problem, this study develops a novel computational approach to effectively detect the protein interactions. This approach is proposed based on a novel matrix-based representation of protein sequence combined with the algorithm of support vector machine (SVM), which fully considers the sequence order and dipeptide information of the protein primary sequence. When performed on yeast PPIs datasets, the proposed method can reach 90.06% prediction accuracy with 94.37% specificity at the sensitivity of 85.74%, indicating that this predictor is a useful tool to predict PPIs. Achieved results also demonstrate that our approach can be a helpful supplement for the interactions that have been detected experimentally.

Multi-step dimensionality reduction and semi-supervised graph-based tumor classification using gene expression data.

OBJECTIVE: Both supervised methods and unsupervised methods have been widely used to solve the tumor classification problem based on gene expression profiles. This paper introduces a semi-supervised graph-based method for tumor classification. Feature extraction plays a key role in tumor classification based on gene expression profiles, and can greatly improve the performance of a classifier. In this paper we propose a novel multi-step dimensionality reduction method for extracting tumor-related features. METHODS AND MATERIALS: First the Wilcoxon rank-sum test is used for gene selection. Then gene ranking and discrete cosine transform are combined with principal component analysis for feature extraction. Finally, the performance is evaluated by semi-supervised learning algorithms. RESULTS: To show the validity of the proposed method, we apply it to classify four tumor datasets involving various human normal and tumor tissue samples. The experimental results show that the proposed method is efficient and feasible. Compared with other methods, our method can achieve relatively higher prediction accuracy. Particularly, it is found that semi-supervised method is superior to support vector machines in classification performance. CONCLUSIONS: The proposed approach can effectively improve the performance of tumor classification based on gene expression profiles. This work is a meaningful attempt to explore and apply multi-step dimensionality reduction and semi-supervised learning methods in the field of tumor classification. Considering the high classification accuracy, there should be much room for the application of multi-step dimensionality reduction and semi-supervised learning methods to perform tumor classification.

Computational methods for the prediction of protein-protein interactions.

Protein-protein interactions (PPIs) are key components of most cellular processes, so identification of PPIs is at the heart of functional genomics. A number of experimental techniques have been developed to discover the PPI networks of several organisms. However, the accuracy and coverage of these techniques have proven to be limited. Therefore, it is important to develop computational methods to assist in the design and validation of experimental studies and for the prediction of interaction partners. Here, we provide a critical overview of existing computational methods including genomic context method, structure-based method, domain-based method and sequence-based method. While an exhaustive list of methods is not presented, we analyze the relative strengths and weaknesses for each of the methods discussed, as well as a broader perspective on computational techniques for determining PPIs. In addition to algorithms for interaction prediction, description of many useful databases pertaining to PPIs is also provided.