Search

The detection of therapeutic peptides is a topic of immense interest in the biomedical field. Conventional biochemical experiment-based detection techniques are tedious and time-consuming. Computational biology has become a useful tool for improving the detection efficiency of therapeutic peptides. Most computational methods do not consider the deviation caused by noise. To improve the generalization performance of therapeutic peptide prediction methods, this work presents a sequence homology score-based deep fuzzy echo-state network with maximizing mixture correntropy (SHS-DFESN-MMC) model. Our method is compared with the existing methods on eight types of therapeutic peptide datasets. The model parameters are determined by 10 fold cross-validation on their training sets and verified by independent test sets. Across the 8 datasets, the average area under the receiver operating characteristic curve (AUC) values of SHS-DFESN-MMC are the highest on both the training (0.926) and independent sets (0.923). © 2024 The Authors

The Random Permutation Set (RPS) is a new type of set proposed recently, which can be regarded as the generalization of evidence theory. To measure the uncertainty of RPS, the entropy of RPS and its corresponding maximum entropy have been proposed. Exploring the maximum entropy provides a possible way of understanding the physical meaning of RPS. In this paper, a new concept, the envelope of entropy function, is defined. In addition, the limit of the envelope of RPS entropy is derived and proved. Compared with the existing method, the computational complexity of the proposed method to calculate the envelope of RPS entropy decreases greatly. The result shows that when $N \to \infty$, the limit form of the envelope of the entropy of RPS converges to $e \times (N!)^2$, which is highly connected to the constant $e$ and factorial. Finally, numerical examples validate the efficiency and conciseness of the proposed envelope, which provides a new insight into the maximum entropy function., Comment: 22 pages, 5 figures

Influence maximization in a social network refers to the selection of node sets that support the fastest and broadest propagation of information under a chosen transmission model. The efficient identification of such influence-maximizing groups is an active area of research with diverse practical relevance. Greedy-based methods can provide solutions of reliable accuracy, but the computational cost of the required Monte Carlo simulations renders them infeasible for large networks. Meanwhile, although network structure-based centrality methods can be efficient, they typically achieve poor recognition accuracy. Here we establish an effective influence assessment model based both on the total valuation and variance in valuation of neighbor nodes, motivated by the possibility of unreliable communication channels. We then develop a discrete moth-flame optimization method to search for influence-maximizing node sets, using local crossover and mutation evolution scheme atop the canonical moth position updates. To accelerate convergence, a search area selection scheme derived from a degree-based heuristic is used. Experimental results on five real-world social networks, comparing our proposed method against several alternatives in current literature, indicates our approach to be effective and robust in tackling the influence maximization problem.

Fractal plays an important role in nonlinear science. The most important parameter to model fractal is fractal dimension. Existing information dimension can calculate the dimension of probability distribution. However, given a mass function which is the generalization of probability distribution, how to determine its fractal dimension is still an open problem of immense interest. The main contribution of this work is to propose an information fractal dimension of mass function. Numerical examples are illustrated to show the effectiveness of our proposed dimension. We discover an important property in that the dimension of mass function with the maximum Deng entropy is $\frac{ln3}{ln2}\approx 1.585$, which is the well-known fractal dimension of Sierpi\'nski triangle.

Physarum solver, also called the physarum polycephalum inspired algorithm (PPA), is a newly developed bio-inspired algorithm that has an inherent ability to find the shortest path in a given graph. Recent research has proposed methods to develop this algorithm further by accelerating the original PPA (OPPA)'s path-finding process. However, when does the PPA ascertain that the shortest path has been found? Is there a point after which the PPA could distinguish the shortest path from other paths? By innovatively proposing the concept of the dominant path (D-Path), the exact moment, named the transition point (T-Point), when the PPA finds the shortest path can be identified. Based on the D-Path and T-Point, a newly accelerated PPA named OPPA-D using the proposed termination criterion is developed which is superior to all other baseline algorithms according to the experiments conducted in this paper. The validity and the superiority of the proposed termination criterion is also demonstrated. Furthermore, an evaluation method is proposed to provide new insights for the comparison of different accelerated OPPAs. The breakthrough of this paper lies in using D-path and T-point to terminate the OPPA. The novel termination criterion reveals the actual performance of this OPPA. This OPPA is the fastest algorithm, outperforming some so-called accelerated OPPAs. Furthermore, we explain why some existing works inappropriately claim to be accelerated algorithms is in fact a product of inappropriate termination criterion, thus giving rise to the illusion that the method is accelerated.

The identification of important nodes in complex networks is an area of exciting growth due to its applications across various disciplines like disease controlling, community finding, data mining, network system controlling, just to name a few. Many measures have thus been proposed to date, and these measures are either based on the locality of nodes or the global nature of the network. These measures typically use distance based on the concept of traditional Euclidean Distance, which only focus on the local static geographic distance between nodes but ignore the interaction between nodes in real-world networks. However, a variety of factors should be considered for the purpose of identifying influential nodes, such as degree, edge, direction and weight. Some methods based on evidence theory have also been proposed. In this paper, we have proposed an original and novel gravity model with effective distance for identifying influential nodes based on information fusion and multi-level processing. Our method is able to comprehensively consider the global and local information of the complex network, and also utilize the effective distance to replace the Euclidean Distance. This allows us to fully consider the complex topological structure of the real network, as well as the dynamic interaction information between nodes. In order to validate the effectiveness of our proposed method, we have utilized the susceptible infected (SI) model to carry out a variety of simulations on eight different real-world networks using six existing well-known methods. The experimental results indicate the reasonableness and effectiveness of our proposed method.

Physarum polycephalum inspired algorithm (PPA), also known as the Physarum Solver, has attracted great attention. By modelling real-world problems into a graph with network flow and adopting proper equations to calculate the distance between the nodes in the graph, PPA could be used to solve system optimization problems or user equilibrium problems. However, some problems such as the maximum flow (MF) problem, minimum-cost-maximum-flow (MCMF) problem, and link-capacitated traffic assignment problem (CTAP), require the flow flowing through links to follow capacity constraints. Motivated by the lack of related PPA-based research, a novel framework, the capacitated physarum polycephalum inspired algorithm (CPPA), is proposed to allow capacity constraints toward link flow in the PPA. To prove the validity of the CPPA, we developed three applications of the CPPA, i.e., the CPPA for the MF problem (CPPA-MF), the CPPA for the MCFC problem, and the CPPA for the link-capacitated traffic assignment problem (CPPA-CTAP). In the experiments, all the applications of the CPPA solve the problems successfully. Some of them demonstrate efficiency compared to the baseline algorithms. The experimental results prove the validation of using the CPPA framework to control link flow in the PPA is valid. The CPPA is also very robust and easy to implement since it could be successfully applied in three different scenarios. The proposed method shows that: having the ability to control the maximum among flow flowing through links in the PPA, the CPPA could tackle more complex real-world problems in the future.

The Parrondo's paradox is a counterintuitive phenomenon in which individually losing strategies, canonically termed game A and game B, are combined to produce winning outcomes. In this paper, a co-evolution of game dynamics and network structure is adopted to study adaptability and survivability in multi-agent dynamics. The model includes action A, representing a rewiring process on the network, and a two-branch game B, representing redistributive interactions between agents. Simulation results indicate that stochastically mixing action A and game B can produce enhanced, and even winning outcomes, despite gameB being individually losing. In other words, a Parrondo-type paradox can be achieved, but unlike canonical variants, the source of agitation is provided by passive network evolution instead of an active second game. The underlying paradoxical mechanism is analyzed, revealing that the rewiring process drives a topology shift from initial regular lattices towards scale-free characteristics, and enables exploitative behavior that grants enhanced access to the favourable branch of game B., Comment: 15 pages, 9 figures