Search

Nonpharmaceutical interventions (NPIs), particularly contact tracing isolation and household quarantine, play a vital role in effectively bringing the Coronavirus Disease 2019 (COVID-19) under control in China. The pairwise model, has an inherent advantage in characterizing those two NPIs than the classical well-mixed models. Therefore, in this paper, we devised a pairwise epidemic model with NPIs to analyze COVID-19 outbreak in China by using confirmed cases during February 3rd–22nd, 2020. By explicitly incorporating contact tracing isolation and family clusters caused by household quarantine, our model provided a good fit to the trajectory of COVID-19 infections. We calculated the reproduction number R = 1.345 (95% CI: 1.230 − 1.460) for Hubei province and R = 1.217 (95% CI: 1.207 − 1.227) for China (except Hubei). We also estimated the peak time of infections, the epidemic duration and the final size, which are basically consistent with real observation. We indicated by simulation that the traced high-risk contacts from incubated to susceptible decrease under NPIs, regardless of infected cases. The sensitivity analysis showed that reducing the exposure of the susceptible and increasing the clustering coefficient bolster COVID-19 control. With the enforcement of household quarantine, the reproduction number R and the epidemic prevalence declined effectively. Furthermore, we obtained the resumption time of work and production in China (except Hubei) on 10th March and in Hubei at the end of April 2020, respectively, which is broadly in line with the actual time. Our results may provide some potential lessons from China on the control of COVID-19 for other parts of the world.

Basic reproduction number $ \mathcal {R}_0 $ in network epidemic dynamics is studied in the case of stochastic regime-switching networks. For generality, the dependence between successive networks is considered to follow a continuous time semi-Markov chain. $ \mathcal {R}_0 $ is the weighted average of the basic reproduction numbers of deterministic subnetworks. Its position with respect to 1 can determine epidemic persistence or extinction in theories and simulations.

Organotypic heart slices from mice might provide a promising in vitro model for cardiac research because of the vast availability of genetically modified specimens, combined with the unrestricted feasibility of experimental interventions. However, murine heart slices undergo rapid degeneration in culture. Therefore, we developed optimal conditions to preserve their structure and function in culture. Mouse ventricular heart samples were transversely cut into 300 µm thick slices. Slices were then cultured under various conditions of diastolic preload, systolic compliance and medium agitation. Continuous stimulation was performed either by optical stimulation or by electrical field stimulation. Contractility was continuously measured, and cellular survival, structure and gene expression were analyzed. Significant improvements in viability and function were achieved by elastic fixation with the appropriate diastolic preload and the rapid shaking of a ß-mercaptoethanol-supplemented medium. At 1 Hz pacing, mouse heart slices maintained stable contractility for up to 48 h under optogenetic pacing and for one week under electrical pacing. In cultured slices, the native myofibril structure was well preserved, and the mRNAs of myosin light chain, titin and connexin 43 were constantly expressed. Conclusions: Adult murine heart slices can be preserved for one week and provide a new opportunity to study cardiac functions.

Myocardial tissue undergoes steady functional decline when cultured in vitro. Here, the authors report a protocol for culture of human cardiac slices that allows maintenance of contractility for up to four months, and show that the model is suitable for evaluation of drug safety, as exemplified for drugs interfering with cardiomyocyte repolarization.

Abstract Due to the importance of community structure in understanding network and a surge of interest aroused on community detectability, how to improve the community identification performance with pairwise prior information becomes a hot topic. However, most existing semi-supervised community detection algorithms only focus on improving the accuracy but ignore the impacts of priors on speeding detection. Besides, they always require to tune additional parameters and cannot guarantee pairwise constraints. To address these drawbacks, we propose a general, high-speed, effective and parameter-free semi-supervised community detection framework. By constructing the indivisible super-nodes according to the connected subgraph of the must-link constraints and by forming the weighted super-edge based on network topology and cannot-link constraints, our new framework transforms the original network into an equivalent but much smaller Super-Network. Super-Network perfectly ensures the must-link constraints and effectively encodes cannot-link constraints. Furthermore, the time complexity of super-network construction process is linear in the original network size, which makes it efficient. Meanwhile, since the constructed super-network is much smaller than the original one, any existing community detection algorithm is much faster when using our framework. Besides, the overall process will not introduce any additional parameters, making it more practical.

Due to the demand for performance improvement and the existence of prior information, semi-supervised community detection with pairwise constraints becomes a hot topic. Most existing methods have been successfully encoding the must-link constraints, but neglect the opposite ones, i.e., the cannot-link constraints, which can force the exclusion between nodes. In this paper, we are interested in understanding the role of cannot-link constraints and effectively encoding pairwise constraints. Towards these goals, we define an integral generative process jointly considering the network topology, must-link and cannot-link constraints. We propose to characterize this process as a Multi-variance Mixed Gaussian Generative (MMGG) Model to address diverse degrees of confidences that exist in network topology and pairwise constraints and formulate it as a weighted nonnegative matrix factorization problem. The experiments on artificial and real-world networks not only illustrate the superiority of our proposed MMGG, but also, most importantly, reveal the roles of pairwise constraints. That is, though the must-link is more important than cannot-link when either of them is available, both must-link and cannot-link are equally important when both of them are available. To the best of our knowledge, this is the first work on discovering and exploring the importance of cannot-link constraints in semi-supervised community detection.

The original version of this Article incorrectly acknowledged Elisabeth Reiser and Rene Schramm as a corresponding author. This has now been corrected in both the PDF and HTML versions of the Article.

In this paper, a novel imperceptible, fragile and blind watermark scheme is proposed for speech tampering detection and self-recovery. The embedded watermark data for content recovery is calculated from the original discrete cosine transform (DCT) coefficients of host speech. The watermark information is shared in a frames-group instead of stored in one frame. The scheme trades off between the data waste problem and the tampering coincidence problem. When a part of a watermarked speech signal is tampered with, one can accurately localize the tampered area, the watermark data in the area without any modification still can be extracted. Then, a compressive sensing technique is employed to retrieve the coefficients by exploiting the sparseness in the DCT domain. The smaller the tampered the area, the better quality of the recovered signal is. Experimental results show that the watermarked signal is imperceptible, and the recovered signal is intelligible for high tampering rates of up to 47.6%. A deep learning-based enhancement method is also proposed and implemented to increase the SNR of recovered speech signal.

Community detection is a fundamental problem in the analysis of complex networks. Recently, many researchers have concentrated on the detection of overlapping communities, where a vertex may belong to more than one community. However, most current methods require the number (or the size) of the communities as a priori information, which is usually unavailable in real-world networks. Thus, a practical algorithm should not only find the overlapping community structure, but also automatically determine the number of communities. Furthermore, it is preferable if this method is able to reveal the hierarchical structure of networks as well. In this work, we firstly propose a generative model that employs a nonnegative matrix factorization (NMF) formulization with a l(2,1) norm regularization term, balanced by a resolution parameter. The NMF has the nature that provides overlapping community structure by assigning soft membership variables to each vertex; the l(2,1) regularization term is a technique of group sparsity which can automatically determine the number of communities by penalizing too many nonempty communities; and hence the resolution parameter enables us to explore the hierarchical structure of networks. Thereafter, we derive the multiplicative update rule to learn the model parameters, and offer the proof of its correctness. Finally, we test our approach on a variety of synthetic and real-world networks, and compare it with some state-of-the-art algorithms. The results validate the superior performance of our new method.