In times of the Internet of Everything (IoE), the power of the Internet is growing exponentially, followed by a surge in the number of network requests. The conflict between people’s high requirements for the Quality of Experience (QoE) and limited computing resources are becoming increasingly prominent. Therefore, an appropriate offloading method is required to better ease this conflict. In this article, a highly efficient scheduling architecture of information processing under the big data flow of the IoE is proposed to enhance the scheduling performance. First, we construct a dual-channel processing model to describe the entire data flow and node devices. Second, we carefully consider the choice of the weighting method to better find a balance between dual objectives. Third, a dual-objective deep $Q$ -network (DQN)-based offloading algorithm with principal component analysis weighting method (D2OP) is proposed to collaboratively minimize task response time and machine load in a more reasonable allocation. To verify the performance of the D2OP, a series of experiments are conducted from multiple angles. The experimental results demonstrate its better performance than the three comparison algorithms in reducing response time, load balance, and increasing task success ratio.

Constructing dynamic protein interaction networks (DPIN) is a common way to improve identification accuracy of essential proteins. The existing methods usually aggregate DPIN into a single-layer network where all nodes are sorted by their importance. This treatment makes the dynamic information about proteins in multiple layers lost in the single layer, and thus affects the identification accuracy of essential proteins. This paper proposes a node ranking method based on multiple layers for DPIN to address the problem. First, we calculate the centrality values of all nodes for each time-specific layer, then work out the centrality score of each node by dividing the total of its centrality values across all layers by its layer activity, and finally sort the importance of all nodes by their centrality scores. Different from the methods based on single layer, our method makes full use of centrality values of each protein in time-specific layers, and thus can more effectively utilize the dynamic information of proteins. To evaluate the effectiveness of the node ranking method based on multiple layers, we apply ten network-based centrality methods on multiple layers and compare the results with those on a single layer. Then the predictive performance of the ten centrality methods are validated in terms of sensitivity, specificity, positive predictive value, negative predictive value, F-measure and accuracy. The experimental results for the identification of essential proteins show that the node ranking method based on multiple layers is superior to those based on a single layer and can help to identify essential proteins more accurate.

Essential proteins are important participants in various life activities and play a vital role in the survival and reproduction of life. The network-based centrality methods are a common way to identify essential proteins for protein interaction networks. Due to the differences between the existing centrality methods, it is a feasible approach to improve the identification accuracy of essential proteins by combining centrality methods. In this paper, we propose a centrality combination method based on feature selection. First, the measure values of the 14 classical centrality methods are viewed as feature data. Then, a subset of the relevant features is selected according to the importance of features. Finally, the centrality methods corresponding to the selected features are combined by using the geometric mean method for the identification of essential proteins. To verify the effectiveness of the combination method, we apply the combination method on the original static protein interaction network (SPIN), the dynamic protein interaction network (DPIN) and the refined dynamic protein interaction network (RDPIN), and compare the result with those by each single centrality method (LAC, DC, DMNC, NC, TP, CLC, BC, LC, CC, KC, CR, EC, PR, LR). The experimental results on the identification of essential proteins shows that the combination method achieves better results in prediction performance than the 14 centrality mehtods in terms of the prediction precision, sensitivity, specificity, positive predictive value, negative predictive value, F-measure and accuracy rate. It has been illustrated that the proposed method can help to identify essential proteins more accurately.

Background: The identification of essential proteins can help in understanding the minimum requirements for cell survival and development to discover drug targets and prevent disease. Nowadays, node ranking methods are a common way to identify essential proteins, but the poor data quality of the underlying PIN has somewhat hindered the identification accuracy of essential proteins for these methods in the PIN. Therefore, researchers constructed refinement networks by considering certain biological properties of interacting protein pairs to improve the performance of node ranking methods in the PIN. Studies show that proteins in a complex are more likely to be essential than proteins not present in the complex. However, the modularity is usually ignored for the refinement methods of the PINs.Methods: Based on this, we proposed a network refinement method based on module discovery and biological information. The idea is, first, to extract the maximal connected subgraph in the PIN, and to divide it into different modules by using Fast-unfolding algorithm; then, to detect critical modules according to the orthologous information, subcellular localization information and topology information within each module; finally, to construct a more refined network (CM-PIN) by using the identified critical modules.Results: To evaluate the effectiveness of the proposed method, we used 12 typical node ranking methods (LAC, DC, DMNC, NC, TP, LID, CC, BC, PR, LR, PeC, WDC) to compare the overall performance of the CM-PIN with those on the S-PIN, D-PIN and RD-PIN. The experimental results showed that the CM-PIN was optimal in terms of the identification number of essential proteins, precision-recall curve, Jackknifing method and other criteria, and can help to identify essential proteins more accurately.

Essential proteins play an important role in various life activities and are considered to be a vital part of the organism. Gene expression data are an important dataset to construct dynamic protein-protein interaction networks (DPIN). The existing methods for the construction of DPINs generally utilize all features (or the features in a cycle) of the gene expression data. However, the features observed from successive time points tend to be highly correlated, and thus there are some redundant and irrelevant features in the gene expression data, which will influence the quality of the constructed network and the predictive performance of essential proteins. To address this problem, we propose a construction method of DPINs by using selected relevant features rather than continuous and periodic features. We adopt an improved unsupervised feature selection method based on Laplacian algorithm to remove irrelevant and redundant features from gene expression data, then integrate the chosen relevant features into the static protein-protein interaction network (SPIN) to construct a more concise and effective DPIN (FS-DPIN). To evaluate the effectiveness of the FS-DPIN, we apply 15 network-based centrality methods on the FS-DPIN and compare the results with those on the SPIN and the existing DPINs. Then the predictive performance of the 15 centrality methods is validated in terms of sensitivity, specificity, positive predictive value, negative predictive value, F-measure, accuracy, Jackknife and AUPRC. The experimental results show that the FS-DPIN is superior to the existing DPINs in the identification accuracy of essential proteins.