The prediction of ion ligand–binding residues in protein sequences is a challenging work that contributes to understand the specific functions of proteins in life processes. In this article, we selected binding residues of 14 ion ligands as research objects, including four acid radical ion ligands and 10 metal ion ligands. Based on the amino acid sequence information, we selected the composition and position conservation information of amino acids, the predicted structural information, and physicochemical properties of amino acids as basic feature parameters. We then performed a statistical analysis and reclassification for dihedral angle and proposed new methods on the extraction of feature parameters. The methods mainly included applying information entropy on the extraction of polarization charge and hydrophilic–hydrophobic information of amino acids and using position weight matrices on the extraction of position conservation information. In the prediction model, we used the random forest algorithm and obtained better prediction results than previous works. With the independent test, the Matthew's correlation coefficient and accuracy of 10 metal ion ligand–binding residues were larger than 0.07 and 52%, respectively; the corresponding evaluation values of four acid radical ion ligand–binding residues were larger than 0.15 and 86%, respectively. Further, we classified and combined the phi and psi angles and optimized prediction model for each ion ligand–binding residue.
30 November 2018 in KSII Transactions on Internet and Information Systems
The tradeoff between decreasing the interference to primary user (PU) and increasing secondary users’ (SUs’) achievable throughput is an important problem in cognitive radio networks. Heterogeneous fading channels from PU to multiple SUs, PU’s traffic distribution, limited SU’s power and multiple SUs’ access contention impact both these two conflicting objectives. In this paper, we study the joint impact of these four factors on the tradeoff. More specifically, we consider that the channels from PU to SUs are exposed to non-identically independent free space path losses, PU’s traffic randomly arrives and departs from the channel, every SU’s average power consumption is limited, while multiple SUs contend to transmit. We first model the impact of these factors on SUs’ spectrum sensing and data transmission. Then, we formulate the tradeoff aiming at maximizing SUs’ aggregated throughput under two constraints: (i) interference probability to PU and (ii) SUs’ average power consumption. To solve the optimization problem, we design a novel cluster based particle swarm optimization (C-PSO) algorithm. By iteratively updating the particles in a cluster based on the comparison of their fitnesses, the cluster converges to the optimal solution rapidly. Simulation results validate the feasibility of the C-PSO algorithm and the outperformance of our proposal compared against related contributions which consider the homogeneous fading channel. They also show how the optimal solution varies with path losses and PU’s traffic distribution.
Heterogeneous architecture-based systems-on-chip enable the development of flexible and powerful multifunctional RF systems. In complex and dynamic environments where applications arrive continuously and stochastically, real-time scheduling of multiple applications to appropriate processor resources is crucial for fully utilizing the heterogeneous SoC’s resource potential. However, heterogeneous resource-scheduling algorithms still face many problems in practical situations, including generalized abstraction of applications and heterogeneous resources, resource allocation, efficient scheduling of multiple applications in complex mission scenarios, and how to ensure the effectiveness combining with real-world applications of scheduling algorithms. Therefore, in this paper, we design the Multi-Application Scheduling Algorithm, named MASA, which is a two-phase scheduler architecture based on Deep Reinforcement Learning. The algorithm is made up of neural network scheduler-based task prioritization for dynamic encoding of applications and heuristic scheduler-based task mapping for solving the processor resource allocation problem. In order to achieve stable and fast training of the network scheduler based on the actor–critic strategy, we propose optimization methods for the training of MASA: reward dynamic alignment (RDA), earlier termination of the initial episodes, and asynchronous multi-agent training. The performance of the MASA is tested with classic directed acyclic graph and six real-world application datasets, respectively. Experimental results show that MASA outperforms other neural scheduling algorithms and heuristics, and ablation experiments illustrate how these training optimizations improve the network’s capacity.