Search

In order to ensure the accuracy and reliability of the rapid determination of acetamiprid pesticide residues in rapeseed stalk, a method for the preparation of quality control samples was established and evaluated. The lyophilized quality control samples were prepared by matrix spiking and vacuum freeze-drying. And the determination of acetamiprid in the quality control samples was carried out by liquid chromatography-tandem mass spectrometry. The uniformity of the samples was assessed by random sampling and the stability of the samples was evaluated by observing the changes of acetamiprid over a period of one month. The quality control samples prepared by this method are homogeneous and stable, easy to store and transport, and suitable for rapid testing in the field of rapid test kit validation and blind sample assessment. This study established a simple process for the preparation of lyophilised powder quality control samples of rapeseed stalk, which provides a data reference for the study of common key technologies for the preparation of quality control samples of pesticide residues in vegetables. [ABSTRACT FROM AUTHOR]

With the development of information technology, more and more travel data have provided great convenience for scholars to study the travel behavior of users. Planning user travel has increasingly attracted researchers' attention due to its great theoretical significance and practical value. In this study, we not only consider the minimum fleet size required to meet the urban travel needs but also consider the travel time and distance of the fleet. Based on the above reasons, we propose a travel scheduling solution that comprehensively considers time and space costs, namely, the Spatial-Temporal Hopcroft–Karp (STHK) algorithm. The analysis results show that the STHK algorithm not only significantly reduces the off-load time and off-load distance of the fleet travel by as much as 81 % and 58 % and retains the heterogeneous characteristics of human travel behavior. Our study indicates that the new planning algorithm provides the size of the fleet to meet the needs of urban travel and reduces the extra travel time and distance, thereby reducing energy consumption and reducing carbon dioxide emissions. Concurrently, the travel planning results also conform to the basic characteristics of human travel and have important theoretical significance and practical application value. [ABSTRACT FROM AUTHOR]

Describing travel patterns and identifying significant locations is a crucial area of research in transportation geography and social dynamics. Our study aims to contribute to this field by analyzing taxi trip data from Chengdu and New York City. Specifically, we investigate the probability density distribution of trip distance in each city, which enables us to construct long- and short-distance trip networks. To identify critical nodes within these networks, we employ the PageRank algorithm and categorize them using centrality and participation indices. Furthermore, we explore the factors that contribute to their influence and observe a clear hierarchical multi-centre structure in Chengdu's trip networks, while no such phenomenon is evident in New York City's. Our study provides insight into the impact of trip distance on important nodes within trip networks in both cities and serves as a reference for distinguishing between long and short taxi trips. Our findings also reveal substantial differences in network structures between the two cities, highlighting the nuanced relationship between network structure and socio-economic factors. Ultimately, our research sheds light on the underlying mechanisms shaping transportation networks in urban areas and offers valuable insights into urban planning and policy making. [ABSTRACT FROM AUTHOR]

Background: Technological and research advances have produced large volumes of biomedical data. When represented as a network (graph), these data become useful for modeling entities and interactions in biological and similar complex systems. In the field of network biology and network medicine, there is a particular interest in predicting results from drug–drug, drug–disease, and protein–protein interactions to advance the speed of drug discovery. Existing data and modern computational methods allow to identify potentially beneficial and harmful interactions, and therefore, narrow drug trials ahead of actual clinical trials. Such automated data-driven investigation relies on machine learning techniques. However, traditional machine learning approaches require extensive preprocessing of the data that makes them impractical for large datasets. This study presents wide range of machine learning methods for predicting outcomes from biomedical interactions and evaluates the performance of the traditional methods with more recent network-based approaches. Results: We applied a wide range of 32 different network-based machine learning models to five commonly available biomedical datasets, and evaluated their performance based on three important evaluations metrics namely AUROC, AUPR, and F1-score. We achieved this by converting link prediction problem as binary classification problem. In order to achieve this we have considered the existing links as positive example and randomly sampled negative examples from non-existant set. After experimental evaluation we found that Prone, ACT and L R W 5 are the top 3 best performers on all five datasets. Conclusions: This work presents a comparative evaluation of network-based machine learning algorithms for predicting network links, with applications in the prediction of drug-target and drug–drug interactions, and applied well known network-based machine learning methods. Our work is helpful in guiding researchers in the appropriate selection of machine learning methods for pharmaceutical tasks. [ABSTRACT FROM AUTHOR]

Public opinion quickly generated and propagated on online social networks brings huge influences on society and state security. Previous studies mostly analyze its snapshot in a short-term time interval to predict and control the explosive size, but neglect its long-term evolutionary process. In this paper, based on the online social network of Sina Weibo, we trace nine public opinion events in the nearly two-year duration to comprehensively observe the long-term evolutionary processes and characterize the temporal dynamics and propagating networks. The long-term evolutionary processes of public opinion are constructed by quantitatively measuring forwarding sizes at a daily scale. We show their non-Markov temporal dynamics by autocorrelation analysis, which is verified by the heavy-tail interval time distribution of individual forwarding behaviors. Also, the temporally propagating networks are abstracted from individual forwarding behaviors to represent the microcosmic organization of forming public opinion. The topological analysis of aggregating propagating networks shows that the microcosmic organization is generally constructed by a giant connected component and amounts of small connected components with strongly heterogeneous cascade sizes, and the corresponding degree distributions obeys a power law which is shaped by the giant connected component. Furthermore, we compare the follower–followee (i.e. friendship) network with the propagating network to unveil their potential correlation, and find that at large scale they behave a similar connection pattern. This work first projects public opinion into a process-based model to study its temporal dynamics and helps us to better understand the underlying mechanics of forming public opinion. [ABSTRACT FROM AUTHOR]

In the real world, individual resources are crucial for patients when epidemics outbreak. Thus, the coupled dynamics of resource diffusion and epidemic spreading have been widely investigated when the recovery of diseases significantly depends on the resources from neighbors in static social networks. However, the social relationships of individuals are time-varying, which affects such coupled dynamics. For that, we propose a coupled resource-epidemic (RNR-SIS) dynamic model (coupled model for short) on a time-varying multiplex network to synchronously simulate the resource diffusion and epidemic spreading in dynamic social networks. The equilibrium analysis of the coupled model is conducted in a general scenario where the resource generation varies between susceptible and infected states and the recovery rate changes between resourceful and noresource states. By using the microscopic Markov chain approach and Monte Carlo simulations, we determine a probabilistic framework of the intralayer and interlayer dynamic processes of the coupled model and obtain the outbreak threshold of epidemic spreading. Meanwhile, the experimental results show the trivially asymmetric interactions between resource diffusion and epidemic spreading. They also indicate that the stronger activity heterogeneity and the larger contact capacity of individuals in the resource layer can more greatly promote resource diffusion, effectively suppressing epidemic spreading. However, these two individual characters in the epidemic layer can cause more resource depletion, which greatly promotes epidemic spreading. Furthermore, we also find that the contact capacity finitely impacts the coupled dynamics of resource diffusion and epidemic spreading. [ABSTRACT FROM AUTHOR]

Cooperative spreading dynamics on complex networks is a hot topic in the field of network science. In this paper, we propose a strategy to immunize some nodes based on their degrees. The immunized nodes disable the synergistic effect of cooperative spreading dynamics. We also develop a generalized percolation theory to study the final state of the spreading dynamics. By using the Monte Carlo method, numerical simulations reveal that immunizing nodes with a large degree cannot always be beneficial for containing cooperative spreading. For small values of transmission probability, immunizing hubs can suppress the spreading, while the opposite situation happens for large values of transmission probability. Furthermore, numerical simulations show that immunizing hubs increase the cost of the system. Finally, all numerical simulations can be well predicted by the generalized percolation theory. [ABSTRACT FROM AUTHOR]

City taxi service systems have been empirically studied by a number of data-driven methods. However, their underlying mechanisms are hard to understand because the present mathematical models neglect to explain a (whole) taxi service process that includes a pair of on-load phase and off-load phase. In this paper, by analyzing a large amount of taxi servicing data from a large city in China, we observe that the taxi service process shows different temporal and spatial features according to the on-load phase and off-load phase. Moreover, our correlation analysis results demonstrate the lack of dependence between the on-load phase and the off-load phase. Hence, we introduce two independent random walk models based on the Langevin equation to describe the underlying mechanism and to understand the temporal and spatial features of the taxi service process. Our study attempts to formulate the mathematical framework for simulating the taxi service process and better understanding of its underlying mechanism. [ABSTRACT FROM AUTHOR]

Community division in complex networks has become one of the hot topics in the field of network science. Most of the methods developed based on network topology ignore the dynamic characteristics underlying the structure. By exploring the diffusion process in the network based on random walk, this paper sums up the general rule with temporal characteristics as a temporary local balancing strategy which can be used in the community division. The strategy divides the network into different communities according to the duration of a stable local balancing state in the diffusion process. The longer the duration, the more stable the structure of the community in that state. Applying the strategy to computer-generated and real-world networks, respectively, it is proved that these temporary local balancing states existing in the diffusion process can reveal the internal community structure of the network. In addition, the modular structure appears at different time scales of diffusion process, similar to the hierarchical organization, and also provides a new perspective for multiscale network community detection. [ABSTRACT FROM AUTHOR]

Synchronization in complex networks characterizes what happens when an ensemble of oscillators in a complex autonomous system become phase-locked. We study the Kuramoto model with a tunable phase-lag parameter α in the coupling term to determine how phase shifts influence the synchronization transition. The simulation results show that the phase frustration parameter leads to desynchronization. We find two global synchronization regions for α ∈ [ 0 , 2 π) when the coupling is sufficiently large and detect a relatively rare network synchronization pattern in the frustration parameter near α = π. We call this frequency-locking configuration as "repulsive synchronization," because it is induced by repulsive coupling. Since the repulsive synchronization cannot be described by the usual order parameter r , the parameter frequency dispersion is introduced to detect synchronization. [ABSTRACT FROM AUTHOR]

Resources are limited in epidemic containment; how to optimally allocate the limited resources in suppressing the epidemic spreading has been a challenging problem. To find an effective resource allocation strategy, we take the infectiousness of each infected node into consideration. By studying the interplay between the resource allocation and epidemic spreading, we find that the spreading dynamics of epidemic is affected by the preferential resource allocation. There are double phase transitions of the fraction of infected nodes, which are different from the classical epidemic model. More importantly, we find that the preferential resource allocation has double-edged sword effects on the disease spreading. When there is a small transmission rate, the infected fraction at the steady state decreases with the increment of degree of resource allocation preference, which indicates that resources of the healthy nodes should be allocated preferentially to the high infectious nodes to constrain the disease spreading. Moreover, when there is a large transmission rate, the fraction of infected nodes at the steady state increases with the increment of the degree of the preference, but the resource allocation is determined by the stage of epidemic spreading. Namely, in the early stage of the disease spreading, resources should be allocated preferentially to the high infectious nodes similar to the case of a small transmission rate. While after the early stage, resources should be allocated to the low infectious nodes. Based on the findings, we propose a simple resource allocation strategy that can adaptively change with the current fraction of infected nodes and the disease can be suppressed to the most extent under the proposed strategy. [ABSTRACT FROM AUTHOR]

One of the most challenging problems in network science is to accurately detect communities at distinct hierarchical scales. Most existing methods are based on structural analysis and manipulation, which are NP-hard. We articulate an alternative, dynamical evolution-based approach to the problem. The basic principle is to computationally implement a nonlinear dynamical process on all nodes in the network with a general coupling scheme, creating a networked dynamical system. Under a proper system setting and with an adjustable control parameter, the community structure of the network would “come out” or emerge naturally from the dynamical evolution of the system. As the control parameter is systematically varied, the community hierarchies at different scales can be revealed. As a concrete example of this general principle, we exploit clustered synchronization as a dynamical mechanism through which the hierarchical community structure can be uncovered. In particular, for quite arbitrary choices of the nonlinear nodal dynamics and coupling scheme, decreasing the coupling parameter from the global synchronization regime, in which the dynamical states of all nodes are perfectly synchronized, can lead to a weaker type of synchronization organized as clusters. We demonstrate the existence of optimal choices of the coupling parameter for which the synchronization clusters encode accurate information about the hierarchical community structure of the network. We test and validate our method using a standard class of benchmark modular networks with two distinct hierarchies of communities and a number of empirical networks arising from the real world. Our method is computationally extremely efficient, eliminating completely the NP-hard difficulty associated with previous methods. The basic principle of exploiting dynamical evolution to uncover hidden community organizations at different scales represents a “game-change” type of approach to addressing the problem of community detection in complex networks. [ABSTRACT FROM AUTHOR]

Methods used in information filtering and recommendation often rely on quantifying the similarity between objects or users. The used similarity metrics often suffer from similarity redundancies arising from correlations between objects’ attributes. Based on an unweighted undirected object-user bipartite network, we propose a Corrected Redundancy-Eliminating similarity index (CRE) which is based on a spreading process on the network. Extensive experiments on three benchmark data sets—Movilens, Netflix and Amazon—show that when used in recommendation, the CRE yields significant improvements in terms of recommendation accuracy and diversity. A detailed analysis is presented to unveil the origins of the observed differences between the CRE and mainstream similarity indices. [ABSTRACT FROM AUTHOR]

We sought to analyze the dynamic properties of brain electrical activity from healthy volunteers and epilepsy patients using recurrence networks. Phase-space trajectories of synchronous electroencephalogram signals were obtained through embedding dimension in phase-space reconstruction based on the distance set of space points. The recurrence matrix calculated from phase-space trajectories was identified with the adjacency matrix of a complex network. Then, we applied measures to characterize the complex network to this recurrence network. A detailed analysis revealed the following: (1) The recurrence networks of normal brains exhibited a sparser connectivity and smaller clustering coefficient compared with that of epileptic brains; (2) the small-world property existed in both normal and epileptic brains consistent with the previous empirical studies of structural and functional brain networks; and (3) the assortative property of the recurrence network was found by computing the assortative coefficients; their values increased from normal to epileptic brain which accurately suggested the difference of the states. These universal and non-universal characteristics of recurrence networks might help clearly understand the underlying neurodynamics of the brain and provide an efficient tool for clinical diagnosis. [ABSTRACT FROM AUTHOR]

Correlation-based weighted financial networks are analyzed to present cumulative distribution of strength with a power-law tail, which suggests that a small number of hub-like stocks have greater influence on the whole fluctuation of financial market than others. The relationship between clustering and connectivity of vertices emphasizes hierarchical organization, which has been depicted by minimal span tree in previous work. These results urge us to further study the mixing patter of financial network to understand the tendency for vertices to be connected to vertices that are like (or unlike) them in some way. The measurement of average nearest-neighbor degree running over classes of vertices with degree k shows a descending trend when k increases. This interesting result is first uncovered in our work, and suggests the disassortative mixing of financial network which refers to a bias in favor of connections between dissimilar vertices. All the results in weighted complex network aspect may provide some insights to deeper understand the underlying mechanism of financial market and model the evolution of financial market. [ABSTRACT FROM AUTHOR]

An amendment to this paper has been published and can be accessed via a link at the top of the paper. [ABSTRACT FROM AUTHOR]

Epidemic spreading processes in the real world depend on human behaviors and, consequently, are typically non-Markovian in that the key events underlying the spreading dynamics cannot be described as a Poisson random process and the corresponding event time is not exponentially distributed. In contrast to Markovian type of spreading dynamics for which mathematical theories have been well developed, we lack a comprehensive framework to analyze and fully understand non-Markovian spreading processes. Here we develop a mean-field theory to address this challenge, and demonstrate that the theory enables accurate prediction of both the transient phase and the steady states of non-Markovian susceptible-infected-susceptible spreading dynamics on synthetic and empirical networks. We further find that the existence of equivalence between non-Markovian and Markovian spreading depends on a specific edge activation mechanism. In particular, when temporal correlations are absent on active edges, the equivalence can be expected; otherwise, an exact equivalence no longer holds. When modelling epidemic spreading on complex networks, one useful simplification is to assume that the dynamics are Markovian, i.e. memoryless. Here the authors present a more general non-Markovian approach which is able to accurately reproduce the transient and stationary regime on different substrates. [ABSTRACT FROM AUTHOR]

Although recent studies have found that the long-term correlations relating to the fat-tailed distribution of inter-event times exist in human activity and that these correlations indicate the presence of fractality, the property of fractality and its origin have not been analyzed. We use both detrended fluctuation analysis and multifractal detrended fluctuation analysis to analyze the time series in online viewing activity separating from Movielens and Netflix. We find long-term correlations at both the individual and communal levels and that the extent of correlation at the individual level is determined by the activity level. These long-term correlations also indicate that there is fractality in the pattern of online viewing. We first find a multifractality that results from the combined effect of the fat-tailed distribution of inter-event times (i.e., the times between successive viewing actions of individuals) and the long-term correlations in online viewing activity and verify this finding using three synthesized series. Therefore, it can be concluded that the multifractality in online viewing activity is caused by both the fat-tailed distribution of inter-event times and the long-term correlations and that this enlarges the generic property of human activity to include not just physical space but also cyberspace. [ABSTRACT FROM AUTHOR]

The rapid development of the Internet technology enables humans to explore the web and record the traces of online activities. From the analysis of these large-scale data sets (i.e., traces), we can get insights about the dynamic behavior of human activity. In this letter, the scaling behavior and complexity of human activity in the e-commerce, such as music, books, and movies rating, are comprehensively investigated by using the detrended fluctuation analysis technique and the multiscale entropy method. Firstly, the interevent time series of rating behaviors of these three types of media show similar scaling properties with exponents ranging from 0.53 to 0.58, which implies that the collective behaviors of rating media follow a process embodying self-similarity and long-range correlation. Meanwhile, by dividing the users into three groups based on their activities (i.e., rating per unit time), we find that the scaling exponents of the interevent time series in the three groups are different. Hence, these results suggest that a stronger long-range correlations exist in these collective behaviors. Furthermore, their information complexities vary in the three groups. To explain the differences of the collective behaviors restricted to the three groups, we study the dynamic behavior of human activity at the individual level, and find that the dynamic behaviors of a few users have extremely small scaling exponents associated with long-range anticorrelations. By comparing the interevent time distributions of four representative users, we can find that the bimodal distributions may bring forth the extraordinary scaling behaviors. These results of the analysis of the online human activity in the e-commerce may not only provide insight into its dynamic behaviors but may also be applied to acquire potential economic interest. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a synchronization-based, data-driven clustering approach for the analysis of functional magnetic resonance imaging (fMRI) data, and specifically for detecting functional activation from fMRI data. We first define a new measure of similarity between all pairs of data points (i.e., time series of voxels) integrating both complete phase synchronization and amplitude correlation. These pairwise similarities are taken as the coupling between a set of Kuramoto oscillators, which in turn evolve according to a nearest-neighbor rule. As the network evolves, similar data points naturally synchronize with each other, and distinct clusters will emerge. The clustering behavior of the interaction network of the coupled oscillators, therefore, mirrors the clustering property of the original multiple time series. The clustered regions whose cross-correlation coefficients are much greater than other regions are considered as the functionally activated brain regions. The analysis of fMRI data in auditory and visual areas shows that the recognized brain functional activations are in complete correspondence with those from the general linear model of statistical parametric mapping, but with a significantly lower time complexity. We further compare our results with those from traditional K-means approach, and find that our new clustering approach can distinguish between different response patterns more accurately and efficiently than the K-means approach, and therefore more suitable in detecting functional activation from event-related experimental fMRI data. [ABSTRACT FROM AUTHOR]