Neural Computing and Applications - At the end of 2019, a new coronavirus (COVID-19) epidemic has triggered global public health concern. Here, a model integrating the daily intercity migration... 相似文献
Neural Computing and Applications - Medical concept normalization aims to construct a semantic mapping between mentions and concepts and to uniformly represent mentions that belong to the same... 相似文献
Neural Processing Letters - In this paper, we present and investigate a new type of radial basis function (RBF) neural networks mechanism using raised-cosine (RC) function to identify nonlinear... 相似文献
Neural Computing and Applications - Derived from knowledge bases, knowledge graphs represent knowledge expressions in graphs, which utilize nodes and edges to denote entities and relations... 相似文献
Collective action propagation, which can be as large as billions of people adopting Facebook or as small as a few researchers citing a paper, exists in various real-life scenarios. Here, we perform a large-scale investigation of collective action propagation with “recurrence” phenomena. We consider actions that propagate in a social network with multiple communities and find the growth in the propagation breadth of collective action can be explained by a simple mathematical model with an analytical solution. We use datasets on the growth of total views of TED and YouTube videos, the prize pool of Dota 2 tournaments, and a total gross of movies to investigate collective action propagation with recurrence phenomena. Experimental results reveal that our model can capture universal features of collective action propagation, validating the idea that collective action propagation with recurrence results from an action being transmitted from communities to communities.
In the field of systems biology, biological reaction networks are usually modelled by ordinary differential equations. A sub‐class, the S‐systems representation, is a widely used form of modelling. Existing S‐systems identification techniques assume that the system itself is always structurally identifiable. However, due to practical limitations, biological reaction networks are often only partially measured. In addition, the captured data only covers a limited trajectory, therefore data can only be considered as a local snapshot of the system responses with respect to the complete set of state trajectories over the entire state space. Hence the estimated model can only reflect partial system dynamics and may not be unique. To improve the identification quality, the structural and practical identifiablility of S‐system are studied. The S‐system is shown to be identifiable under a set of assumptions. Then, an application on yeast fermentation pathway was conducted. Two case studies were chosen; where the first case is based on a larger state trajectories and the second case is based on a smaller one. By expanding the dataset which span a relatively larger state space, the uncertainty of the estimated system can be reduced. The results indicated that initial concentration is related to the practical identifiablity.Inspec keywords: biochemistry, differential equations, microorganisms, cellular biophysics, fermentationOther keywords: structural identifiability analysis, practical identifiability analysis, S‐system, system biology, biological reaction networks, ordinary differential equations, local snapshot, state trajectories, estimated model, partial system dynamics, identification quality, yeast fermentation pathway, relatively larger state space相似文献