Source author record

Ming Tang

Ming Tang appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

64works

24topics

4close collaborators

Actions

Connect this record

Open graph Browse works

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

Asynchronous Fractional Multi-Agent Deep Reinforcement Learning for Age-Minimal Mobile Edge Computing

In the realm of emerging real-time networked applications such as cyber-physical systems (CPS), the Age of Information (AoI) has emerged as a pivotal metric for evaluating timeliness. To meet the high computational demands, such as those in smart manufacturing within CPS, mobile edge computing (MEC) presents a promising solution for optimizing computing and reducing AoI. In this work, we study the timeliness of compute-intensive updates and explore jointly optimizing the task updating (when to generate a task) and offloading (where to process a task) policies to minimize AoI. Specifically, we consider edge load dynamics and formulate a task scheduling problem to minimize the expected time-average AoI. Solving this problem is challenging due to the fractional objective introduced by AoI and the asynchronous decision-making of the semi-Markov game (SMG). To this end, we propose a fractional reinforcement learning (RL) framework. We begin by introducing a fractional single-agent RL framework and establish its linear convergence rate. Building on this, we develop a fractional multi-agent RL framework, extend Dinkelbach's method, and demonstrate its equivalence to the inexact Newton's method. Furthermore, we provide the conditions under which the framework achieves linear convergence to the Nash equilibrium (NE). To tackle the challenge of asynchronous decision-making in the SMG, we further design an asynchronous model-free fractional multi-agent RL algorithm, where each mobile device can determine the task updating and offloading decisions without knowing the real-time system dynamics and decisions of other devices. Experimental results show that when compared with the best existing baseline algorithm, our proposed algorithm reduces the average AoI by up to 50.6%.

preprint2026arXiv

Decomposing the Generalization Gap in PROTAC Activity Prediction: Variance Attribution and the Inter-Laboratory Ceiling

Machine-learning predictors of biochemical activity often exhibit large random-split-to-leave-one-target-out generalisation gaps that have been documented but not decomposed. We frame this as an evaluation-science question and use targeted protein degradation as the empirical test bed. PROTACs (proteolysis-targeting chimeras) are heterobifunctional small molecules that induce targeted protein degradation, with more than forty candidates currently in clinical trials; published predictors report AUROC of 0.85 to 0.91 under random-split cross-validation, while the leave-one-target-out (LOTO) protocol of Ribes et al. reduces performance to approximately 0.67. Random splits reward within-target interpolation, whereas LOTO measures the novel-target prediction that de-novo design depends on. We decompose this gap and identify inter-laboratory measurement variance as the dominant component, anchored by a within-target cross-laboratory cascade bounding the inter-laboratory contribution at 0.124 AUROC, well above the 0.05 contribution from binarisation-threshold choice. Across eight published architectures and ESM-2 protein language models up to 3B parameters, LOTO AUROC plateaus near 0.67, with a comparable plateau under SMILES-level deduplication; a 21-dimensional 2000-trial hyperparameter optimisation cannot break this ceiling, and the rank-1 single-seed configuration regresses by 0.161 AUROC under multi-seed validation, matching a closed-form selection-bias prediction (Bailey and Lopez de Prado, 2014). Few-shot k=5 stratified per-target retraining combined with ADMET features lifts 65-target LOTO AUROC from 0.668 to 0.7050, and post-hoc Platt scaling recovers raw output to within the 0.05 well-calibrated threshold. We release PROTAC-Bench (10,748 measurements, 173 targets, 65 LOTO folds), the variance-decomposition framework, the per-target calibration protocol, and the evaluation code.

preprint2026arXiv

First Thin-Film Lithium Tantalate Polarization Controller Enabling Reset-Free Mrad/s Tracking for Optical Interconnects

The rapid escalation of computing power driven by large-scale artificial intelligence is placing unprecedented demands on the bandwidth, latency, and energy efficiency of data-center interconnects (DCIs). Self-homodyne coherent (SHC) transmission is a promising architecture because it preserves the spectral efficiency of coherent detection while greatly simplifying digital signal processing, but its practical deployment is critically limited by random and often ultrafast state-of-polarization (SOP) fluctuations that induce carrier fading and destabilize coherent reception. Here we report the first integrated polarization controller based on thin-film lithium tantalate (TFLT), enabling reset-free polarization tracking at Mrad/s speeds. The four-stage electro-optic device exhibits polarization-dependent loss (PDL) below 0.3 dB, a half-wave voltage below 2.5 V, high modulation bandwidth, and negligible DC drift. To accommodate the finite tuning range of integrated phase shifters, we develop a finite-boundary gradient-descent (FBGD) control algorithm that ensures reset-free SOP evolution with no phase jump. The implemented adaptive polarization controller (APC) is validated through both standalone polarization-tracking measurements and a dual-polarization 16-QAM SHC 400-Gbps transmission system. Transient polarization disturbances can be tracked at speeds up to 2 Mrad/s, while stable reset-free operation under continuous polarization disturbances is maintained up to 1 Mrad/s. This reset-free performance represents more than doubling the state of the art, while the pre-FEC bit-error rates remain below the HD-FEC threshold under realistic DCI conditions and lightning-scale polarization disturbances. These results establish TFLT as a new platform for ultrafast, low-power, reset-free, and drift-free polarization control in coherent optical interconnects and beyond.

preprint2026arXiv

FlowSpec: Continuous Pipelined Speculative Decoding for Efficient Distributed LLM Inference

Distributed inference serves as a promising approach to enabling the inference of large language models (LLMs) at the network edge. It distributes the inference process to multiple devices to ensure that the LLMs can fit into the device memory. Recent pipeline-based approaches have the potential to parallelize communication and computation, which helps reduce inference latency. However, the benefit diminishes when the inference request at the network edge is sparse, where pipeline is typically at low utilization. To enable efficient distributed LLM inference at the edge, we propose \textbf{FlowSpec}, a pipeline-parallel tree-based speculative decoding framework. FlowSpec incorporates three key mechanisms to improve decoding efficiency: 1) score-based step-wise verification prioritizes more important draft tokens to bring earlier accepted tokens; 2) efficient draft management to prune invalid tokens while maintaining correct causal relationship during verification; 3) dynamic draft expansion strategies to supply high-quality speculative inputs. These techniques work in concert to enhance both pipeline utilization and speculative efficiency. We evaluate FlowSpec on a real-world testbed with other baselines. Experimental results demonstrate that our proposed framework significantly improves inference speed across diverse models and configurations, achieving speedup ratios 1.37$\times$-1.73$\times$ compared to baselines. Our code is publicly available at \href{https://github.com/Leosang-lx/FlowSpec#}{https://github.com/Leosang-lx/FlowSpec\#}.

preprint2026arXiv

GeM-VG: Towards Generalized Multi-image Visual Grounding with Multimodal Large Language Models

Multimodal Large Language Models (MLLMs) have demonstrated impressive progress in single-image grounding and general multi-image understanding. Recently, some methods begin to address multi-image grounding. However, they are constrained by single-target localization and limited types of practical tasks, due to the lack of unified modeling for generalized grounding tasks. Therefore, we propose GeM-VG, an MLLM capable of Generalized Multi-image Visual Grounding. To support this, we systematically categorize and organize existing multi-image grounding tasks according to their reliance of cross-image cues and reasoning, and introduce the MG-Data-240K dataset, addressing the limitations of existing datasets regarding target quantity and image relation. To tackle the challenges of robustly handling diverse multi-image grounding tasks, we further propose a hybrid reinforcement finetuning strategy that integrates chain-of-thought (CoT) reasoning and direct answering, considering their complementary strengths. This strategy adopts an R1-like algorithm guided by a carefully designed rule-based reward, effectively enhancing the model's overall perception and reasoning capabilities. Extensive experiments demonstrate the superior generalized grounding capabilities of our model. For multi-image grounding, it outperforms the previous leading MLLMs by 2.0% and 9.7% on MIG-Bench and MC-Bench, respectively. In single-image grounding, it achieves a 9.1% improvement over the base model on ODINW. Furthermore, our model retains strong capabilities in general multi-image understanding.

preprint2026arXiv

ReST-KV: Robust KV Cache Eviction with Layer-wise Output Reconstruction and Spatial-Temporal Smoothing

Large language models (LLMs) face growing challenges in efficient generative inference due to the increasing memory demands of Key-Value (KV) caches, especially for long sequences. Existing eviction methods typically retain KV pairs with high attention weights but overlook the impact of attention redistribution caused by token removal, as well as the spatial-temporal dynamics in KV selection. In this paper, we propose ReST-KV, a robust KV eviction method that combines layer-wise output Reconstruction and Spatial-Temporal smoothing to provide a more comprehensive perspective for the KV cache eviction task. Specifically, ReST-KV formulates KV cache eviction as an optimization problem that minimizes output discrepancies through efficient layer-wise reconstruction. By directly modeling how each token's removal affects the model output, our method naturally captures attention redistribution effects, going beyond simplistic reliance on raw attention weights. To further enhance robustness, we design exponential moving average smoothing to handle temporal variations and an adaptive window-based mechanism to capture spatial patterns. Our method, ReST-KV, significantly advances performance on long-context benchmarks. It surpasses state-of-the-art baselines by 2.58% on LongBench and 15.2% on RULER. Additionally, ReST-KV consistently outperforms existing methods on Needle-in-a-Haystack and InfiniteBench, all while achieving a remarkable 10.61$\times$ reduction in decoding latency at 128k context length. The code is publicly available at https://github.com/an-yongqi/rest-kv to facilitate reproducibility and further research.

preprint2023arXiv

A Posterior Error Estimator for Mixed Interior Penalty Discontinuous Galerkin Finite Element Method for the H(curl)-Elliptic Problems

In this paper, we design the first residual type a posteriori error estimator for mixed interior penalty discontinuous Galerkin method for the H(curl)-elliptic problems. Then we prove that our residual based a posteriori error indicator is both reliable and efficient. At last, we present some numerical experiments to validate the performance of the indicator within an adaptive mesh refinement procedure.

preprint2023arXiv

Iterative two-level algorithm for nonsymmetric or indefinite elliptic problems

In this paper, a new iterative two-level algorithm is presented for solving the finite element discretization for nonsymmetric or indefinite elliptic problems. The iterative two-level algorithm uses the same coarse space as the traditional two-grid algorithm, but its ``fine space'' uses the higher oder finite element space under the coarse grid. Therefore, the iterative two-level algorithm only needs one grid, and the computational cost is much lower than the traditional iterative two-grid algorithm. Finally, compared with the traditional two-grid algorithm, numerical experiments show that the computational cost is lower to achieve the same convergence order.

preprint2022arXiv

A modified weak Galerkin method for $\boldsymbol{H}(\mathrm{curl})$-elliptic problem

In this paper, we design and analysis a modified weak Galerkin (MWG) finite element method for $\boldsymbol{H}(\mathrm{curl})-$elliptic problem. We first introduce a new discrete weak curl operator and the MWG finite element space. The modified weak Galerkin method does not require the penalty parameter by comparing with traditional DG methods. We prove optimal error estimates in energy norm. At last, we provide the numerical results to confirm these theoretical results.

preprint2022arXiv

Beyond the Limitation of Pulse Width in Optical Time-domain Reflectometry

Optical time-domain reflectometry (OTDR) is the basis for distributed time-domain optical fiber sensing techniques. By injecting pulse light into an optical fiber, the distance information of an event can be obtained based on the time of light flight. The minimum distinguishable event separation along the fiber length is called the spatial resolution, which is determined by the optical pulse width. By reducing the pulse width, the spatial resolution can be improved. However, at the same time, the signal-to-noise ratio of the system is degraded, and higher speed equipment is required. To solve this problem, data processing methods such as iterative subdivision, deconvolution, and neural networks have been proposed. However, they all have some shortcomings and thus have not been widely applied. Here, we propose and experimentally demonstrate an OTDR deconvolution neural network based on deep convolutional neural networks. A simplified OTDR model is built to generate a large amount of training data. By optimizing the network structure and training data, an effective OTDR deconvolution is achieved. The simulation and experimental results show that the proposed neural network can achieve more accurate deconvolution than the conventional deconvolution algorithm with a higher signal-to-noise ratio.

preprint2022arXiv

Improving Information Freshness via Backbone-Assisted Cooperative Access Points

Information freshness, characterized by age of information (AoI), is important for sensor applications involving timely status updates. In many cases, the wireless signals from one sensor can be received by multiple access points (APs). This paper investigates the average AoI for cooperative APs, in which they can share information through a wired backbone network. We first study a basic backbone-assisted COoperative AP (Co-AP) system where APs share only decoded packets. Experimental results on software-defined radios (SDR) indicate that Co-AP significantly improves the average AoI performance over a single-AP system. Next, we investigate an improved Co-AP system, called Soft-Co-AP. In addition to sharing decoded packets, Soft-Co-AP shares and collects soft information of packets that the APs fail to decode for further joint decoding. A critical issue in Soft-Co-AP is determining the number of quantization bits that represent the soft information (each soft bit) shared over the backbone. While more quantization bits per soft bit improves the joint decoding performance, it leads to higher backbone delay. We experimentally study the average AoI of Soft-Co-AP by evaluating the tradeoff between the backbone delay and the number of quantization bits. SDR experiments show that when the number of sensors is large, Soft-Co-AP further reduces the average AoI by 12% compared with Co-AP. Interestingly, good average AoI performance is usually achieved when the number of quantization bits per soft bit is neither too large nor too small.

preprint2022arXiv

PASS: Part-Aware Self-Supervised Pre-Training for Person Re-Identification

In person re-identification (ReID), very recent researches have validated pre-training the models on unlabelled person images is much better than on ImageNet. However, these researches directly apply the existing self-supervised learning (SSL) methods designed for image classification to ReID without any adaption in the framework. These SSL methods match the outputs of local views (e.g., red T-shirt, blue shorts) to those of the global views at the same time, losing lots of details. In this paper, we propose a ReID-specific pre-training method, Part-Aware Self-Supervised pre-training (PASS), which can generate part-level features to offer fine-grained information and is more suitable for ReID. PASS divides the images into several local areas, and the local views randomly cropped from each area are assigned with a specific learnable [PART] token. On the other hand, the [PART]s of all local areas are also appended to the global views. PASS learns to match the output of the local views and global views on the same [PART]. That is, the learned [PART] of the local views from a local area is only matched with the corresponding [PART] learned from the global views. As a result, each [PART] can focus on a specific local area of the image and extracts fine-grained information of this area. Experiments show PASS sets the new state-of-the-art performances on Market1501 and MSMT17 on various ReID tasks, e.g., vanilla ViT-S/16 pre-trained by PASS achieves 92.2\%/90.2\%/88.5\% mAP accuracy on Market1501 for supervised/UDA/USL ReID. Our codes are available at https://github.com/CASIA-IVA-Lab/PASS-reID.

preprint2022arXiv

Thermal Modelling and Controller Design of an Alkaline Electrolysis System under Dynamic Operating Conditions

Thermal management is vital for the efficient and safe operation of alkaline electrolysis systems. Traditional alkaline electrolysis systems use simple proportional-integral-differentiation (PID) controllers to maintain the stack temperature near the rated value. However, in renewable-to-hydrogen scenarios, the stack temperature is disturbed by load fluctuations, and the temperature overshoot phenomenon occurs which can exceed the upper limit and harm the stack. This paper focuses on the thermal modelling and controller design of an alkaline electrolysis system under dynamic operating conditions. A control-oriented thermal model is established in the form of a third-order time-delay process, which is used for simulation and controller design. Based on this model, we propose two novel controllers to reduce temperature overshoot: one is a current feed-forward PID controller (PID-I), the other is a model predictive controller (MPC). Their performances are tested on a lab-scale system and the experimental results are satisfying: the temperature overshoot is reduced by 2.2 degree with the PID-I controller, and no obvious overshoot is observed with the MPC controller. Furthermore, the thermal dynamic performance of an MW-scale alkaline electrolysis system is analyzed by simulation, which shows that the temperature overshoot phenomenon is more general in large systems. The proposed method allows for higher temperature set points which can improve system efficiency by 1%.

preprint2022arXiv

Transfering Low-Frequency Features for Domain Adaptation

Previous unsupervised domain adaptation methods did not handle the cross-domain problem from the perspective of frequency for computer vision. The images or feature maps of different domains can be decomposed into the low-frequency component and high-frequency component. This paper proposes the assumption that low-frequency information is more domain-invariant while the high-frequency information contains domain-related information. Hence, we introduce an approach, named low-frequency module (LFM), to extract domain-invariant feature representations. The LFM is constructed with the digital Gaussian low-pass filter. Our method is easy to implement and introduces no extra hyperparameter. We design two effective ways to utilize the LFM for domain adaptation, and our method is complementary to other existing methods and formulated as a plug-and-play unit that can be combined with these methods. Experimental results demonstrate that our LFM outperforms state-of-the-art methods for various computer vision tasks, including image classification and object detection.

preprint2022arXiv

Unconventional Excitonic States with Phonon Sidebands in Layered Silicon Diphosphide

Many-body interactions between quasiparticles (electrons, excitons, and phonons) have led to the emergence of new complex correlated states and are at the core of condensed matter physics and material science. In low-dimensional materials, unique electronic properties for these correlated states could significantly affect their optical properties. Herein, combining photoluminescence, optical reflection measurements and theoretical calculations, we demonstrate an unconventional excitonic state and its bound phonon sideband in layered silicon diphosphide (SiP$_2$), in which the bound electron-hole pair is composed of electrons confined within one-dimensional phosphorus$-$phosphorus chains and holes extended in two-dimensional SiP$_2$ layers. The excitonic state and the emergent phonon sideband show linear dichroism and large energy redshifts with increasing temperature. Within the $GW$ plus Bethe$-$Salpeter equation calculations and solving the generalized Holstein model non-perturbatively, we confirm that the observed sideband feature results from the correlated interaction between excitons and optical phonons. Such a layered material provides a new platform to study excitonic physics and many-particle effects.

preprint2022arXiv

UniVIP: A Unified Framework for Self-Supervised Visual Pre-training

Self-supervised learning (SSL) holds promise in leveraging large amounts of unlabeled data. However, the success of popular SSL methods has limited on single-centric-object images like those in ImageNet and ignores the correlation among the scene and instances, as well as the semantic difference of instances in the scene. To address the above problems, we propose a Unified Self-supervised Visual Pre-training (UniVIP), a novel self-supervised framework to learn versatile visual representations on either single-centric-object or non-iconic dataset. The framework takes into account the representation learning at three levels: 1) the similarity of scene-scene, 2) the correlation of scene-instance, 3) the discrimination of instance-instance. During the learning, we adopt the optimal transport algorithm to automatically measure the discrimination of instances. Massive experiments show that UniVIP pre-trained on non-iconic COCO achieves state-of-the-art transfer performance on a variety of downstream tasks, such as image classification, semi-supervised learning, object detection and segmentation. Furthermore, our method can also exploit single-centric-object dataset such as ImageNet and outperforms BYOL by 2.5% with the same pre-training epochs in linear probing, and surpass current self-supervised object detection methods on COCO dataset, demonstrating its universality and potential.

preprint2021arXiv

Asymmetrically interacting dynamics with mutual confirmation from multi-source on multiplex networks

In the early stage of epidemics, individuals' determination on adopting protective measures, which can reduce their risk of infection and suppress disease spreading, is likely to depend on multiple information sources and their mutual confirmation due to inadequate exact information. Here we introduce the inter-layer mutual confirmation mechanism into the information-disease interacting dynamics on multiplex networks. In our model, an individual increases the information transmission rate and willingness to adopt protective measures once he confirms the authenticity of news and severity of disease from neighbors status in multiple layers. By using the microscopic Markov chain approach, we analytically calculate the epidemic threshold and the awareness and infected density in the stationary state, which agree well with simulation results. We find that the increment of epidemic threshold when confirming the aware neighbors on communication layer is larger than that of the contact layer. On the contrary, the confirmation of neighbors' awareness and infection from the contact layer leads to a lower final infection density and a higher awareness density than that of the communication layer. The results imply that individuals' explicit exposure of their infection and awareness status to neighbors, especially those with real contacts, is helpful in suppressing epidemic spreading.

preprint2021arXiv

Identify Influential Spreaders in Asymmetrically Interacting Multiplex Networks

Identifying the most influential spreaders is important to understand and control the spreading process in a network. As many real-world complex systems can be modeled as multilayer networks, the question of identifying important nodes in multilayer network has attracted much attention. Existing studies focus on the multilayer network structure, while neglecting how the structural and dynamical coupling of multiple layers influence the dynamical importance of nodes in the network. Here we investigate on this question in an information-disease coupled spreading dynamics on multiplex networks. Firstly, we explicitly reveal that three interlayer coupling factors, which are the two-layer relative spreading speed, the interlayer coupling strength and the two-layer degree correlation, significantly impact the spreading influence of a node on the contact layer. The suppression effect from the information layer makes the structural centrality on the contact layer fail to predict the spreading influence of nodes in the multiplex network. Then by mapping the coevolving spreading dynamics into percolation process and using the message-passing approach, we propose a method to calculate the size of the disease outbreaks from a single seed node, which can be used to estimate the nodes' spreading influence in the coevolving dynamics. Our work provides insights on the importance of nodes in the multiplex network and gives a feasible framework to investigate influential spreaders in the asymmetrically coevolving dynamics.

preprint2020arXiv

A Quantitative Analytical Model for Predicting and Optimizing the Rate Performance of Battery Cells

An important objective of designing lithium-ion rechargeable battery cells is to maximize their rate performance without compromising the energy density, which is mainly achieved through computationally expensive numerical simulations at present. Here we present a simple analytical model for predicting the rate performance of battery cells limited by electrolyte transport without any fitting parameters. It exhibits very good agreement with simulations over a wide range of discharge rate and electrode thickness and offers a speedup of >10$^5$ times. The optimal electrode properties predicted by the model are of less than 10% difference from simulation results, suggesting it as an attractive computational tool for the cell-level battery architecture design. The model also offers important insights on practical ways to improve the rate performance of thick electrodes, including avoiding electrode materials such as LiFePO$_4$ and Li$_4$Ti$_5$O$_{12}$ whose open-circuit potentials are insensitive to the state of charge and utilizing lithium metal anode to synergistically accelerate electrolyte transport within thick cathodes.

preprint2020arXiv

Deep Reinforcement Learning for Task Offloading in Mobile Edge Computing Systems

In mobile edge computing systems, an edge node may have a high load when a large number of mobile devices offload their tasks to it. Those offloaded tasks may experience large processing delay or even be dropped when their deadlines expire. Due to the uncertain load dynamics at the edge nodes, it is challenging for each device to determine its offloading decision (i.e., whether to offload or not, and which edge node it should offload its task to) in a decentralized manner. In this work, we consider non-divisible and delay-sensitive tasks as well as edge load dynamics, and formulate a task offloading problem to minimize the expected long-term cost. We propose a model-free deep reinforcement learning-based distributed algorithm, where each device can determine its offloading decision without knowing the task models and offloading decision of other devices. To improve the estimation of the long-term cost in the algorithm, we incorporate the long short-term memory (LSTM), dueling deep Q-network (DQN), and double-DQN techniques. Simulation results with 50 mobile devices and five edge nodes show that the proposed algorithm can reduce the ratio of dropped tasks and average task delay by 86.4%-95.4% and 18.0%-30.1%, respectively, when compared with several existing algorithms.

preprint2020arXiv

Distributed Brillouin frequency shift extraction via a convolutional neural network

Distributed optical fiber Brillouin sensors detect the temperature and strain along a fiber according to the local Brillouin frequency shift, which is usually calculated by the measured Brillouin spectrum using Lorentzian curve fitting. In addition, cross-correlation, principal component analysis, and machine learning methods have been proposed for the more efficient extraction of Brillouin frequency shifts. However, existing methods only process the Brillouin spectrum individually, ignoring the correlation in the time domain, indicating that there is still room for improvement. Here, we propose and experimentally demonstrate a full convolution neural network to extract the distributed Brillouin frequency shift directly from the measured two-dimensional data. Simulated ideal Brillouin spectrum with various parameters are used to train the network. Both the simulation and experimental results show that the extraction accuracy of the network is better than that of the traditional curve fitting algorithm with a much shorter processing time. This network has good universality and robustness and can effectively improve the performances of existing Brillouin sensors.

preprint2020arXiv

Identity-Guided Human Semantic Parsing for Person Re-Identification

Existing alignment-based methods have to employ the pretrained human parsing models to achieve the pixel-level alignment, and cannot identify the personal belongings (e.g., backpacks and reticule) which are crucial to person re-ID. In this paper, we propose the identity-guided human semantic parsing approach (ISP) to locate both the human body parts and personal belongings at pixel-level for aligned person re-ID only with person identity labels. We design the cascaded clustering on feature maps to generate the pseudo-labels of human parts. Specifically, for the pixels of all images of a person, we first group them to foreground or background and then group the foreground pixels to human parts. The cluster assignments are subsequently used as pseudo-labels of human parts to supervise the part estimation and ISP iteratively learns the feature maps and groups them. Finally, local features of both human body parts and personal belongings are obtained according to the selflearned part estimation, and only features of visible parts are utilized for the retrieval. Extensive experiments on three widely used datasets validate the superiority of ISP over lots of state-of-the-art methods. Our code is available at https://github.com/CASIA-IVA-Lab/ISP-reID.

preprint2020arXiv

Learning Feature Embeddings for Discriminant Model based Tracking

After observing that the features used in most online discriminatively trained trackers are not optimal, in this paper, we propose a novel and effective architecture to learn optimal feature embeddings for online discriminative tracking. Our method, called DCFST, integrates the solver of a discriminant model that is differentiable and has a closed-form solution into convolutional neural networks. Then, the resulting network can be trained in an end-to-end way, obtaining optimal feature embeddings for the discriminant model-based tracker. As an instance, we apply the popular ridge regression model in this work to demonstrate the power of DCFST. Extensive experiments on six public benchmarks, OTB2015, NFS, GOT10k, TrackingNet, VOT2018, and VOT2019, show that our approach is efficient and generalizes well to class-agnostic target objects in online tracking, thus achieves state-of-the-art accuracy, while running beyond the real-time speed. Code will be made available.

preprint2020arXiv

Non-Markovian recovery makes complex networks more resilient against large-scale failures

Non-Markovian spontaneous recovery processes with a time delay (memory) are ubiquitous in the real world. How does the non-Markovian characteristic affect failure propagation in complex networks? We consider failures due to internal causes at the nodal level and external failures due to an adverse environment, and develop a pair approximation analysis taking into account the two-node correlation. In general, a high failure stationary state can arise, corresponding to large-scale failures that can significantly compromise the functioning of the network. We uncover a striking phenomenon: memory associated with nodal recovery can counter-intuitively make the network more resilient against large-scale failures. In natural systems, the intrinsic non-Markovian characteristic of nodal recovery may thus be one reason for their resilience. In engineering design, incorporating certain non-Markovian features into the network may be beneficial to equipping it with a strong resilient capability to resist catastrophic failures.

preprint2020arXiv

Online Bitrate Selection for Viewport Adaptive 360-Degree Video Streaming

360-degree video streaming provides users with immersive experience by letting users determine their field-of-views (FoVs) in real time. To enhance the users' quality of experience (QoE) given their limited bandwidth, recent works have proposed a viewport adaptive 360-degree video streaming model by exploiting the bitrate adaptation in spatial and temporal domains. Under this video streaming model, in this paper, we consider a scenario with a newly generated 360-degree video without viewing history from other users. To maximize the user's QoE, we propose an online bitrate selection algorithm, called OBS360. The proposed online algorithm can adapt to the unknown and heterogeneous users' FoVs and downloading capacities. We prove that the proposed algorithm achieves sublinear dynamic regret under a convex decision set. This suggests that as the number of video segments increases, the performance of the online algorithm approaches the performance of the offline algorithm, where the users' FoVs and downloading capacities are known. We perform simulations with real-world dataset to evaluate the performance of the proposed algorithm. Results show that compared with several existing methods, our proposed algorithm can enhance the users' QoE significantly by improving the viewing bitrate and reducing the inter-segment and intra-segment degradation losses of the users.

preprint2020arXiv

Quantitative assessment of the role of undocumented infection in the 2019 novel coronavirus (COVID-19) pandemic

An urgent problem in controlling COVID-19 spreading is to understand the role of undocumented infection. We develop a five-state model for COVID-19, taking into account the unique features of the novel coronavirus, with key parameters determined by the government reports and mathematical optimization. Tests using data from China, South Korea, Italy, and Iran indicate that the model is capable of generating accurate prediction of the daily accumulated number of confirmed cases and is entirely suitable for real-time prediction. The drastically disparate testing and diagnostic standards/policies among different countries lead to large variations in the estimated parameter values such as the duration of the outbreak, but such uncertainties have little effect on the occurrence time of the inflection point as predicted by the model, indicating its reliability and robustness. Model prediction for Italy suggests that insufficient government action leading to a large fraction of undocumented infection plays an important role in the abnormally high mortality in that country. With the data currently available from United Kingdom, our model predicts catastrophic epidemic scenarios in the country if the government did not impose strict travel and social distancing restrictions. A key finding is that, if the percentage of undocumented infection exceeds a threshold, a non-negligible hidden population can exist even after the the epidemic has been deemed over, implying the likelihood of future outbreaks should the currently imposed strict government actions be relaxed. This could make COVID-19 evolving into a long-term epidemic or a community disease a real possibility, suggesting the necessity to conduct universal testing and monitoring to identify the hidden individuals.

preprint2020arXiv

Self-Supervised Learning and Prediction of Microstructure Evolution with Recurrent Neural Networks

Microstructural evolution is a key aspect of understanding and exploiting the structure-property-performance relation of materials. Modeling microstructure evolution usually relies on coarse-grained simulations with evolution principles described by partial differential equations (PDEs). Here we demonstrate that convolutional recurrent neural networks can learn the underlying physical rules and replace PDE-based simulations in the prediction of microstructure phenomena. Neural nets are trained by self-supervised learning with image sequences from simulations of several common processes, including plane wave propagation, grain growth, spinodal decomposition and dendritic crystal growth. The trained networks can accurately predict both short-term local dynamics and long-term statistical properties of microstructures and is capable of extrapolating beyond the training datasets in spatiotemporal domains and configurational and parametric spaces. Such a data-driven approach offers significant advantages over PDE-based simulations in time stepping efficiency and offers a useful alternative especially when the material parameters or governing PDEs are not well determined.

preprint2020arXiv

Stress-Induced Intercalation Instability

We present a linear stability analysis to demonstrate that a flat coherent phase boundary formed by the (de)intercalation of solutes into a compound is unstable against perturbations with wavelengths larger than a critical wavelength. This critical wavelength is controlled by the competition between the interface energy and the elastic strain energy caused by the misfit between the solute-rich and solute-poor phases. It increases with the distance between the phase boundary and free surface of the compound, and so the instability is most pronounced when the boundary is close to the surface at the early stage of the (de)intercalation process. Numerical calculations show that such instability leads to non-uniform intercalation behavior. We find that uniform intercalation cannot be achieved unless the phase boundary moves at a speed greater than a critical velocity. Estimate of the magnitude of this velocity suggests that the stress-induced intercalation instability is generally operative in intercalation compounds used for battery applications.

preprint2020arXiv

Thermodynamic Origin of Reaction Non-Uniformity in Battery Porous Electrodes and its Mitigation

The development of non-uniform reaction current distribution within porous electrodes is a ubiquitous phenomenon during battery charging / discharging and frequently controls the rate performance of battery cells. Reaction inhomogeneity in porous electrodes is usually attributed to the kinetic limitation of mass transport within the electrolyte and/or solid electrode phase. In this work, however, we reveal that it is also strongly influenced by the intrinsic thermodynamic behavior of electrode materials, specifically the dependence of the equilibrium potential on the state of charge: electrode reaction becomes increasingly non-uniform when the slope of the equilibrium potential curve is reduced. We employ numerical simulation and equivalent circuit model to elucidate such a correlation and show that the degree of reaction inhomogeneity and the resultant discharge capacity can be predicted by a dimensionless reaction uniformity number. For electrode materials that have equilibrium potentials insensitive to the state of charge and exhibit significant reaction non-uniformity, we demonstrate several approaches to spatially homogenizing the reaction current inside porous electrodes, including matching the electronic and ionic resistances, introducing graded electronic conductivity and reducing the surface reaction kinetics.

preprint2019arXiv

Learning epidemic threshold in complex networks by Convolutional Neural Network

Deep learning has taken part in the competition since not long ago to learn and identify phase transitions in physical systems such as many body quantum systems, whose underlying lattice structures are generally regular as they're in euclidean space. Real networks have complex structural features which play a significant role in dynamics in them, and thus the structural and dynamical information of complex networks can not be directly learned by existing neural network models. Here we propose a novel and effective framework to learn the epidemic threshold in complex networks by combining the structural and dynamical information into the learning procedure. Considering the strong performance of learning in Euclidean space, Convolutional Neural Network (CNN) is used and, with the help of confusion scheme, we can identify precisely the outbreak threshold of epidemic dynamics. To represent the high dimensional network data set in Euclidean space for CNN, we reduce the dimensionality of a network by using graph representation learning algorithms and discretize the embedded space to convert it into an image-like structure. We then creatively merge the nodal dynamical states with the structural embedding by multi-channel images. In this manner, the proposed model can draw the conclusion from both structural and dynamical information. A large number of simulations show a great performance in both synthetic and empirical network data set. Our end-to-end machine learning framework is robust and universally applicable to complex networks with arbitrary size and topology.

preprint2019arXiv

Machine learning dynamical phase transitions in complex networks

In recent years, machine learning has been adopted to complex networks, but most existing works concern about the structural properties. To use machine learning to detect phase transitions and accurately identify the critical transition point associated with dynamical processes on complex networks thus stands out as an open and significant problem. Here we develop a framework combining supervised and unsupervised learning, incorporating proper sampling of training data set. In particular, using epidemic spreading dynamics on complex networks as a paradigmatic setting, we start from supervised learning alone and identify situations that degrade the performance. To overcome the difficulties leads to the idea of exploiting confusion scheme, effectively a combination of supervised and unsupervised learning. We demonstrate that the scheme performs well for identifying phase transitions associated with spreading dynamics on homogeneous networks, but the performance deteriorates for heterogeneous networks. To strive to meet this challenge leads to the realization that sampling the training data set is necessary for heterogeneous networks, and we test two sampling methods: one based on the hub nodes together with their neighbors and another based on k-core of the network. The end result is a general machine learning framework for detecting phase transition and accurately identifying the critical transition point, which is robust, computationally efficient, and universally applicable to complex networks of arbitrary size and topology. Extensive tests using synthetic and empirical networks verify the virtues of the articulated framework, opening the door to exploiting machine learning for understanding, detection, prediction, and control of complex dynamical systems in general.

preprint2019arXiv

Period-doubling bifurcation of dissipative-soliton-resonance pulses in a passively mode-locked fiber laser

We report on the experimental observation of period-doubling bifurcation of dissipative-soliton-resonance (DSR) pulses in a fiber laser passively mode-locked by using the nonlinear optical loop mirror. Increasing the pump power of the fiber laser, we show that temporally a stable, uniform DSR pulse train could be transformed into a period-doubling state, exhibiting two sets of pulse parameters between the adjacent cavity roundtrip. It is found that DSR pulses in the period-doubling state could maintain the typical feature of DSR pulse: fixed pulse peak power and linear variation in pulse width with respect to the pump power change. The mechanism for achieving period-doubling of DSR pulses is discussed.

preprint2016arXiv

Effective information spreading based on local information in correlated networks

Using network-based information to facilitate information spreading is an essential task for spreading dynamics in complex networks, which will benefit the promotion of technical innovations, healthy behaviors, new products, etc. Focusing on degree correlated networks, we propose a preferential contact strategy based on the local network structure and local informed density to promote the information spreading. During the spreading process, an informed node will preferentially select a contact target among its neighbors, basing on their degrees or local informed densities. By extensively implementing numerical simulations in synthetic and empirical networks, we find that when only consider the local structure information, the convergence time of information spreading will be remarkably reduced if low-degree neighbors are favored as contact targets. Meanwhile, the minimum convergence time depends non-monotonically on degree-degree correlation, and moderate correlation coefficients result in most efficient information spreading. Incorporating the informed density information into contact strategy, the convergence time of information spreading can be further reduced. Finally, we show that by using local informed density is more effective as compared with the global case.

preprint2016arXiv

Impacts of complex behavioral responses on asymmetric interacting spreading dynamics in multiplex networks

Information diffusion and disease spreading in communication-contact layered network are typically asymmetrically coupled with each other, in which how an individual being aware of disease responds to the disease can significantly affect the disease spreading. Many recent studies have demonstrated that human behavioral adoption is a complex and non-Markovian process, where the probability of adopting one behavior is dependent on the cumulative times of the received information and the social reinforcement effect of these cumulative information. We study the impact of such a non-Markovian vaccination adoption behavior on the epidemic dynamics and the control effects. We find that this complex adoption behavior caused from the communication layer can significantly increase the epidemic threshold and reduce the final infection rate. By defining the social cost as the sum of the cost of vaccination and the cost of treatment, we show that there exists an optimal social reinforcement effect or optimal information transmission rate allowing the minimal social cost. We also develop a mean field based theory to verify the correctness of the simulation results.

preprint2016arXiv

Scalar - vector soliton fiber lasers

Rapid progress in passively mode-locked fiber lasers is currently driven by the recent discovery of vector feature of mode-locking pulses, namely, the group velocity-locked vector solitons, the phase locked vector solitons, and the high-order vector solitons. Those vector solitons are fundamentally different from the previously known scalar solitons. Here, we report a fiber laser where the mode-locked pulse evolves as a vector soliton in the strong birefringent segment and is transformed into a regular scalar soliton after the polarizer within the laser cavity. The existence of solutions in a polarization-dependent cavity comprising a periodic combination of two distinct nonlinear waves is novel and likely to be applicable to various other nonlinear systems. For very large local birefringence, our laser approaches the working regime of vector soliton lasers, while it approaches scalar soliton fiber lasers under the conditions of very small birefringence.

preprint2016arXiv

Suppressing disease spreading by using information diffusion on multiplex networks

Although there is always an interplay between the dynamics of information diffusion and disease spreading, the empirical research on the systemic coevolution mechanisms connecting these two spreading dynamics is still lacking. Here we investigate the coevolution mechanisms and dynamics between information and disease spreading by utilizing real data and a proposed spreading model on multiplex network. Our empirical analysis finds asymmetrical interactions between the information and disease spreading dynamics. Our results obtained from both the theoretical framework and extensive stochastic numerical simulations suggest that an information outbreak can be triggered in a communication network by its own spreading dynamics or by a disease outbreak on a contact network, but that the disease threshold is not affected by information spreading. Our key finding is that there is an optimal information transmission rate that markedly suppresses the disease spreading. We find that the time evolution of the dynamics in the proposed model qualitatively agrees with the real-world spreading processes at the optimal information transmission rate.

preprint2015arXiv

Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition

Identifying the most influential spreaders is an important issue in understanding and controlling spreading processes on complex networks. Recent studies showed that nodes located in the core of a network as identified by the k-shell decomposition are the most influential spreaders. However, through a great deal of numerical simulations, we observe that not in all real networks do nodes in high shells are very influential: in some networks the core nodes are the most influential which we call true core, while in others nodes in high shells, even the innermost core, are not good spreaders which we call core-like group. By analyzing the k-core structure of the networks, we find that the true core of a network links diversely to the shells of the network, while the core-like group links very locally within the group. For nodes in the core-like group, the k-shell index cannot reflect their location importance in the network. We further introduce a measure based on the link diversity of shells to effectively distinguish the true core and core-like group, and identify core-like groups throughout the networks. Our findings help to better understand the structural features of real networks and influential nodes.

preprint2015arXiv

Dynamics of social contagions with heterogeneous adoption thresholds: Crossover phenomena in phase transition

Heterogeneous adoption thresholds exist widely in social contagions, but were always neglected in previous studies. We first propose a non-Markovian spreading threshold model with general adoption threshold distribution. In order to understand the effects of heterogeneous adoption thresholds quantitatively, an edge-based compartmental theory is developed for the proposed model. We use a binary spreading threshold model as a specific example, in which some individuals have a low adoption threshold (i.e., activists) while the remaining ones hold a relatively high adoption threshold (i.e., bigots), to demonstrate that heterogeneous adoption thresholds markedly affect the final adoption size and phase transition. Interestingly, the first-order, second-order and hybrid phase transitions can be found in the system. More importantly, there are two different kinds of crossover phenomena in phase transition for distinct values of bigots' adoption threshold: a change from first-order or hybrid phase transition to the second-order phase transition. The theoretical predictions based on the suggested theory agree very well with the results of numerical simulations.

preprint2015arXiv

Dynamics of social contagions with memory of non-redundant information

A key ingredient in social contagion dynamics is reinforcement, as adopting a certain social behavior requires verification of its credibility and legitimacy. Memory of non-redundant information plays an important role in reinforcement, which so far has eluded theoretical analysis. We first propose a general social contagion model with reinforcement derived from non-redundant information memory. Then, we develop a unified edge-based compartmental theory to analyze this model, and a remarkable agreement with numerics is obtained on some specific models. Using a spreading threshold model as a specific example to understand the memory effect, in which each individual adopts a social behavior only when the cumulative pieces of information that the individual received from his/her neighbors exceeds an adoption threshold. Through analysis and numerical simulations, we find that the memory characteristic markedly affects the dynamics as quantified by the final adoption size. Strikingly, we uncover a transition phenomenon in which the dependence of the final adoption size on some key parameters, such as the transmission probability, can change from being discontinuous to being continuous. The transition can be triggered by proper parameters and structural perturbations to the system, such as decreasing individuals' adoption threshold, increasing initial seed size, or enhancing the network heterogeneity.

preprint2015arXiv

Identify influential spreaders in complex networks, the role of neighborhood

Identifying the most influential spreaders is an important issue in controlling the spreading processes in complex networks. Centrality measures are used to rank node influence in a spreading dynamics. Here we propose a node influence measure based on the centrality of a node and its neighbors' centrality, which we call the neighborhood centrality. By simulating the spreading processes in six real-world networks, we find that the neighborhood centrality greatly outperforms the basic centrality of a node such as the degree and coreness in ranking node influence and identifying the most influential spreaders. Interestingly, we discover a saturation effect in considering the neighborhood of a node, which is not the case of the larger the better. Specifically speaking, considering the 2-step neighborhood of nodes is a good choice that balances the cost and performance. If further step of neighborhood is taken into consideration, there is no obvious improvement and even decrease in the ranking performance. The saturation effect may be informative for studies that make use of the local structure of a node to determine its importance in the network.

preprint2015arXiv

Improving the accuracy of the k-shell method by removing redundant links-from a perspective of spreading dynamics

Recent study shows that the accuracy of the k-shell method in determining node coreness in a spreading process is largely impacted due to the existence of core-like group, which has a large k-shell index but a low spreading efficiency. Based on analysis of the structure of core-like groups in real-world networks, we discover that nodes in the core-like group are mutually densely connected with very few out-leaving links from the group. By defining a measure of diffusion importance for each edge based on the number of out-leaving links of its both ends, we are able to identify redundant links in the spreading process, which have a relatively low diffusion importance but lead to form the locally densely connected core-like group. After filtering out the redundant links and applying the k-shell method to the residual network, we obtain a renewed coreness for each node which is a more accurate index to indicate its location importance and spreading influence in the original network. Moreover, we find that the performance of the ranking algorithms based on the renewed coreness are also greatly enhanced. Our findings help to more accurately decompose the network core structure and identify influential nodes in spreading processes.

preprint2015arXiv

Interplay between the local information based behavioral responses and the epidemic spreading in complex networks

The spreading of an infectious disease can trigger human behavior responses to the disease, which in turn plays a crucial role on the spreading of epidemic. In this study, to illustrate the impacts of the human behavioral responses, a new class of individuals, $S^F$, is introduced to the classical susceptible-infected-recovered ($SIR$) model. In the model, $S^F$ state represents that susceptible individuals who take self-initiate protective measures to lower the probability of being infected, and a susceptible individual may go to $S^F$ state with a response rate when contacting an infectious neighbor. Via the percolation method, the theoretical formulas for the epidemic threshold as well as the prevalence of epidemic are derived. Our finding indicates that, with the increasing of the response rate, the epidemic threshold is enhanced and the prevalence of epidemic is reduced. The analytical results are also verified by the numerical simulations. In addition, we demonstrate that, because the mean field method neglects the dynamic correlations, a wrong result based on the mean field method is obtained---the epidemic threshold is not related to the response rate, i.e., the additional $S^F$ state has no impact on the epidemic threshold.

preprint2015arXiv

Large epidemic thresholds emerge in heterogeneous networks of heterogeneous nodes

One of the famous results of network science states that networks with heterogeneous connectivity are more susceptible to epidemic spreading than their more homogeneous counterparts. In particular, in networks of identical nodes it has been shown that heterogeneity can lower the epidemic threshold at which epidemics can invade the system. Network heterogeneity can thus allow diseases with lower transmission probabilities to persist and spread. Here, we point out that for real world applications, this result should not be regarded independently of the intra-individual heterogeneity between people. Our results show that, if heterogeneity among people is taken into account, networks that are more heterogeneous in connectivity can be more resistant to epidemic spreading. We study a susceptible-infected-susceptible model with adaptive disease avoidance. Results from this model suggest that this reversal of the effect of network heterogeneity is likely to occur in populations in which the individuals are aware of their subjective disease risk. For epidemiology, this implies that network heterogeneity should not be studied in isolation.

preprint2015arXiv

Predicting the epidemic threshold of the susceptible-infected-recovered model

Researchers have developed several theoretical methods for predicting epidemic thresholds, including the mean-field like (MFL) method, the quenched mean-field (QMF) method, and the dynamical message passing (DMP) method. When these methods are applied to predict epidemic threshold they often produce differing results and their relative levels of accuracy are still unknown. We systematically analyze these two issues---relationships among differing results and levels of accuracy---by studying the susceptible-infected-recovered (SIR) model on uncorrelated configuration networks and a group of 56 real-world networks. In uncorrelated configuration networks the MFL and DMP methods yield identical predictions that are larger and more accurate than the prediction generated by the QMF method. When compared to the 56 real-world networks, the epidemic threshold obtained by the DMP method is closer to the actual epidemic threshold because it incorporates full network topology information and some dynamical correlations. We find that in some scenarios---such as networks with positive degree-degree correlations, with an eigenvector localized on the high $k$-core nodes, or with a high level of clustering---the epidemic threshold predicted by the MFL method, which uses the degree distribution as the only input parameter, performs better than the other two methods. We also find that the performances of the three predictions are irregular versus modularity.

preprint2015arXiv

Preferential imitation of vaccinating behavior can invalidate the targeted subsidy on complex network

We consider the effect of inducement to vaccinate during the spread of an infectious disease on complex networks. Suppose that public resources are finite and that only a small proportion of individuals can be vaccinated freely (complete subsidy), for the remainder of the population vaccination is a voluntary behavior --- and each vaccinated individual carries a perceived cost. We ask whether the classical targeted subsidy strategy is definitely better than the random strategy: does targeting subsidy at individuals perceived to be with the greatest risk actually help? With these questions, we propose a model to investigate the \emph{interaction effects} of the subsidy policies and individuals responses when facing subsidy policies on the epidemic dynamics on complex networks. In the model, a small proportion of individuals are freely vaccinated according to either the targeted or random subsidy policy, the remainder choose to vaccinate (or not) based on voluntary principle and update their vaccination decision via an imitation rule. Our findings show that the targeted strategy is only advantageous when individuals prefer to imitate the subsidized individuals' strategy. Otherwise, the effect of the targeted policy is worse than the random immunization, since individuals preferentially select non-subsidized individuals as the imitation objects. More importantly, we find that under the targeted subsidy policy, increasing the proportion of subsidized individuals may increase the final epidemic size. We further define social cost as the sum of the costs of vaccination and infection, and study how each of the two policies affect the social cost. Our result shows that there exist some optimal intermediate regions leading to the minimal social cost.

preprint2015arXiv

Traffic-driven epidemic spreading in correlated networks

In spite of the extensive previous efforts on traffic dynamics and epidemic spreading in complex networks, the problem of traffic-driven epidemic spreading on {\em correlated} networks has not been addressed. Interestingly, we find that the epidemic threshold, a fundamental quantity underlying the spreading dynamics, exhibits a non-monotonic behavior in that it can be minimized for some critical value of the assortativity coefficient, a parameter characterizing the network correlation. To understand this phenomenon, we use the degree-based mean-field theory to calculate the traffic-driven epidemic threshold for correlated networks. The theory predicts that the threshold is inversely proportional to the packet-generation rate and the largest eigenvalue of the betweenness matrix. We obtain consistency between theory and numerics. Our results may provide insights into the important problem of controlling/harnessing real-world epidemic spreading dynamics driven by traffic flows.

preprint2014arXiv

Asymmetrically interacting spreading dynamics on complex layered networks

The spread of disease through a physical-contact network and the spread of information about the disease on a communication network are two intimately related dynamical processes. We investigate the asymmetrical interplay between the two types of spreading dynamics, each occurring on its own layer, by focusing on the two fundamental quantities underlying any spreading process: epidemic threshold and the final infection ratio. We find that an epidemic outbreak on the contact layer can induce an outbreak on the communication layer, and information spreading can effectively raise the epidemic threshold. When structural correlation exists between the two layers, the information threshold remains unchanged but the epidemic threshold can be enhanced, making the contact layer more resilient to epidemic outbreak. We develop a physical theory to understand the intricate interplay between the two types of spreading dynamics.

preprint2014arXiv

Efficient allocation of heterogeneous response times in information spreading process

Recently, the impacts of spatiotemporal heterogeneities of human activities on spreading dynamics have attracted extensive attention. In this paper, to study heterogeneous response times on information spreading, we focus on the susceptible-infected spreading dynamics with adjustable power-law response time distribution based on uncorrelated scale-free networks. We find that the stronger the heterogeneity of response times is, the faster the information spreading is in the early and middle stages. Following a given heterogeneity, the procedure of reducing the correlation between the response times and degrees of individuals can also accelerate the spreading dynamics in the early and middle stages. However, the dynamics in the late stage is slightly more complicated, and there is an optimal value of the full prevalence time changing with the heterogeneity of response times and the response time-degree correlation, respectively. The optimal phenomena results from the efficient allocation of heterogeneous response times.

preprint2014arXiv

Epidemic spreading on complex networks with general degree and weight distributions

The spread of disease on complex networks has attracted widely attention in the physics community. Recent works have demonstrated that heterogeneous degree and weight distributions have a significant influence on the epidemic dynamics. In this study, a novel edge-weight based compartmental approach is developed to estimate the epidemic threshold and epidemic size (final infected density) on networks with general degree and weight distributions, and a remarkable agreement with numerics is obtained. Even in complex network with the strong heterogeneous degree and weight distributions, this approach is worked. We then propose an edge-weight based removal strategy with different biases, and find that such a strategy can effectively control the spread of epidemic when the highly weighted edges are preferentially removed, especially when the weight distribution of a network is extremely heterogenous. The theoretical results from the suggested method can accurately predict the above removal effectiveness.

preprint2014arXiv

Identifying effective multiple spreaders by coloring complex networks

How to identify influential nodes in social networks is of theoretical significance, which relates to how to prevent epidemic spreading or cascading failure, how to accelerate information diffusion, and so on. In this Letter, we make an attempt to find \emph{effective multiple spreaders} in complex networks by generalizing the idea of the coloring problem in graph theory to complex networks. In our method, each node in a network is colored by one kind of color and nodes with the same color are sorted into an independent set. Then, for a given centrality index, the nodes with the highest centrality in an independent set are chosen as multiple spreaders. Comparing this approach with the traditional method, in which nodes with the highest centrality from the \emph{entire} network perspective are chosen, we find that our method is more effective in accelerating the spreading process and maximizing the spreading coverage than the traditional method, no matter in network models or in real social networks. Meanwhile, the low computational complexity of the coloring algorithm guarantees the potential applications of our method.

preprint2014arXiv

Message spreading in networks with stickiness and persistence: Large clustering does not always facilitate large-scale diffusion

Recent empirical studies have confirmed the key roles of complex contagion mechanisms such as memory, social reinforcement, and decay effects in information diffusion and behaviour spreading. Inspired by this fact, we here propose a new agent--based model to capture the whole picture of the joint action of the three mechanisms in information spreading, by quantifying the complex contagion mechanisms as stickiness and persistence, and carry out extensive simulations of the model on various networks. By numerical simulations as well as theoretical analysis, we find that the stickiness of the message determines the critical dynamics of message diffusion on tree-like networks, whereas the persistence plays a decisive role on dense regular lattices. In either network, the greater persistence can effectively make the message more invasive. Of particular interest is that our research results renew our previous knowledge that messages can spread broader in networks with large clustering, which turns out to be only true when they can inform a non-zero fraction of the population in the limit of large system size.

preprint2014arXiv

Simulated identification of epidemic threshold on finite-size networks

Epidemic threshold is one of the most important features of the epidemic dynamics. Through a lot of numerical simulations in classic Susceptible-Infected-Recovered (SIR) and Susceptible-Infected-Susceptible (SIS) models on various types of networks, we study the simulated identification of epidemic thresholds on finite-size networks. We confirm that the susceptibility measure goes awry for the SIR model due to the bimodal distribution of outbreak sizes near the critical point, while the simulated thresholds of the SIS and SIR models can be accurately determined by analyzing the peak of the epidemic variability. We further verify the accuracy of theoretical predictions derived by the heterogeneous mean-field theory (HMF) and the quenched mean-field theory (QMF), by comparing them with the simulated threshold of the SIR model obtained from the variability measure. The results show that the HMF prediction agrees very well with the simulated threshold, except the case that the networks are disassortive, in which the QMF prediction is more close to the simulated threshold.

preprint2014arXiv

Suppressed epidemics in multi-relational networks

A two-state epidemic model in networks with links mimicking two kinds of relationships between connected nodes is introduced. Links of weights w1 and w0 occur with probabilities p and 1-p, respectively. The fraction of infected nodes rho(p) shows a non-monotonic behavior, with rho drops with p for small p and increases for large p. For small to moderate w1/w0 ratios, rho(p) exhibits a minimum that signifies an optimal suppression. For large w1/w0 ratios, the suppression leads to an absorbing phase consisting only of healthy nodes within a range p_L =< p =< p_R, and an active phase with mixed infected and healthy nodes for p < p_L and p>p_R. A mean field theory that ignores spatial correlation is shown to give qualitative agreement and capture all the key features. A physical picture that emphasizes the intricate interplay between infections via w0 links and within clusters formed by nodes carrying the w1 links is presented. The absorbing state at large w1/w0 ratios results when the clusters are big enough to disrupt the spread via w0 links and yet small enough to avoid an epidemic within the clusters. A theory that uses the possible local environments of a node as variables is formulated. The theory gives results in good agreement with simulation results, thereby showing the necessity of including longer spatial correlations.

preprint2013arXiv

Influence of Reciprocal links in Social Networks

In this Letter, we empirically study the influence of reciprocal links, in order to understand its role in affecting the structure and function of directed social networks. Experimental results on two representative datesets, Sina Weibo and Douban, demonstrate that the reciprocal links indeed play a more important role than non-reciprocal ones in both spreading information and maintaining the network robustness. In particular, the information spreading process can be significantly enhanced by considering the reciprocal effect. In addition, reciprocal links are largely responsible for the connectivity and efficiency of directed networks. This work may shed some light on the in-depth understanding and application of the reciprocal effect in directed online social networks.

preprint2013arXiv

Signal transmission in a Y-shaped one-way chain

It has been found that noise plays a key role to improve signal transmission in a one-way chain of bistable systems [Zhang et al., Phys. Rev. E 58, 2952 (1998)]. We here show that the signal transmission can be sharply improved without the aid of noise, if the one-way chain with a single source node is changed with two source nodes becoming a Y-shaped one-way chain. We further reveal that the enhanced signal transmission in the Y-shaped one-way chain is regulated by coupling strength, and that it is robust to noise perturbation and input signal irregularity. We finally analyze the mechanism of the enhanced signal transmission by the Y-shaped structure.

preprint2012arXiv

Effects of Weak Ties on Epidemic Predictability in Community Networks

Weak ties play a significant role in the structures and the dynamics of community networks. Based on the susceptible-infected model in contact process, we study numerically how weak ties influence the predictability of epidemic dynamics. We first investigate the effects of different kinds of weak ties on the variabilities of both the arrival time and the prevalence of disease, and find that the bridgeness with small degree can enhance the predictability of epidemic spreading. Once weak ties are settled, compared with the variability of arrival time, the variability of prevalence displays a diametrically opposed changing trend with both the distance of the initial seed to the bridgeness and the degree of the initial seed. More specifically, the further distance and the larger degree of the initial seed can induce the better predictability of arrival time and the worse predictability of prevalence. Moreover, we discuss the effects of weak tie number on the epidemic variability. As community strength becomes very strong, which is caused by the decrease of weak tie number, the epidemic variability will change dramatically. Compared with the case of hub seed and random seed, the bridgenss seed can result in the worst predictability of arrival time and the best predictability of prevalence. These results show that the variability of arrival time always marks a complete reversal trend of that of prevalence, which implies it is impossible to predict epidemic spreading in the early stage of outbreaks accurately.

preprint2012arXiv

Efficient community-based control strategies in adaptive networks

Most researches on adaptive networks mainly concentrate on the properties of steady state, but neglect transient dynamics. In this study, we pay attention to the emergence of community structures in transient process and the effects of community-based control strategies on epidemic spreading. First, by normalizing modularity $Q$, we investigate the evolution of community structures during the transient process, and find that very strong community structures are induced by rewiring mechanism in the early stage of epidemic spreading, which remarkably delays the outbreaks of epidemic. Then we study the effects of control strategies started from different stages on the prevalence. Both immunization and quarantine strategies indicate that it is not "the earlier, the better" for the implementing of control measures. And the optimal control effect is obtained if control measures can be efficiently implemented in the period of strong community structure. For immunization strategy, immunizing the S nodes on SI links and immunizing S nodes randomly have similar control effects. Yet for quarantine strategy, quarantining the I nodes on SI links can yield far better effects than quarantining I nodes randomly. More significantly, community-based quarantine strategy plays more efficient performance than community-based immunization strategy. This study may shed new lights on the forecast and the prevention of epidemic among human population.

preprint2012arXiv

Emergence of scale-free close-knit friendship structure in online social networks

Despite the structural properties of online social networks have attracted much attention, the properties of the close-knit friendship structures remain an important question. Here, we mainly focus on how these mesoscale structures are affected by the local and global structural properties. Analyzing the data of four large-scale online social networks reveals several common structural properties. It is found that not only the local structures given by the indegree, outdegree, and reciprocal degree distributions follow a similar scaling behavior, the mesoscale structures represented by the distributions of close-knit friendship structures also exhibit a similar scaling law. The degree correlation is very weak over a wide range of the degrees. We propose a simple directed network model that captures the observed properties. The model incorporates two mechanisms: reciprocation and preferential attachment. Through rate equation analysis of our model, the local-scale and mesoscale structural properties are derived. In the local-scale, the same scaling behavior of indegree and outdegree distributions stems from indegree and outdegree of nodes both growing as the same function of the introduction time, and the reciprocal degree distribution also shows the same power-law due to the linear relationship between the reciprocal degree and in/outdegree of nodes. In the mesoscale, the distributions of four closed triples representing close-knit friendship structures are found to exhibit identical power-laws, a behavior attributed to the negligible degree correlations. Intriguingly, all the power-law exponents of the distributions in the local-scale and mesoscale depend only on one global parameter -- the mean in/outdegree, while both the mean in/outdegree and the reciprocity together determine the ratio of the reciprocal degree of a node to its in/outdegree.

preprint2012arXiv

Epidemic Variability in Hierarchical Geographical Networks with Human Activity Patterns

Recently, some studies have revealed that non-Poissonian statistics of human behaviors stem from the hierarchical geographical network structure. On this view, we focus on epidemic spreading in the hierarchical geographical networks, and study how two distinct contact patterns (i. e., homogeneous time delay (HOTD) and heterogeneous time delay (HETD) associated with geographical distance) influence the spreading speed and the variability of outbreaks. We find that, compared with HOTD and null model, correlations between time delay and network hierarchy in HETD remarkably slow down epidemic spreading, and result in a upward cascading multi-modal phenomenon. Proportionately, the variability of outbreaks in HETD has the lower value, but several comparable peaks for a long time, which makes the long-term prediction of epidemic spreading hard. When a seed (i. e., the initial infected node) is from the high layers of networks, epidemic spreading is remarkably promoted. Interestingly, distinct trends of variabilities in two contact patterns emerge: high-layer seeds in HOTD result in the lower variabilities, the case of HETD is opposite. More importantly, the variabilities of high-layer seeds in HETD are much greater than that in HOTD, which implies the unpredictability of epidemic spreading in hierarchical geographical networks.

preprint2012arXiv

Optimal forwarding ratio on dynamical networks with heterogeneous mobility

As the discovery of non-Poissonian statistics of human mobility trajectories, more attention has been paid to understanding the role of these patterns in different dynamics. In this study, we first introduce the heterogeneous mobility of mobile agents into dynamical networks, and then investigate the forwarding strategy on the heterogeneous dynamical networks. We find that the faster speed and the higher proportion of high-speed agents can enhance the network throughput and reduce the mean traveling time in the case of random forwarding. A hierarchical structure in the dependence of high-speed is observed: the network throughput remains unchanged in small and large high-speed value. It is interesting to find that the slightly preferential forwarding to high-speed agents can maximize the network capacity. Through theoretical analysis and numerical simulations, we show that the optimal forwarding ratio stems from local structural heterogeneity of low-speed agents.

preprint2012arXiv

Slow dynamics of Zero Range Process in the Framework of Traps Model

The relaxation dynamics of zero range process (ZRP) has always been an interesting problem. In this study, we set up the relationship between ZRP and traps model, and investigate the slow dynamics of ZRP in the framework of traps model. Through statistical quantities such as the average rest time, the particle distribution, the two-time correlation function and the average escape time, we find that the particle interaction, especially the resulted condensation, can significantly influence the dynamics. In the stationary state, both the average rest time and the average escape time caused by the attraction among particles are obtained analytically. In the transient state, a hierarchical nature of the aging dynamics is revealed by both simulations and scaling analysis. Moreover, by comparing the particle diffusion in both the transient state and the stationary state, we find that the closer ZRP systems approach the stationary state, the more slowly particles diffuse.

preprint2012arXiv

Variability of Contact Process in Complex Networks

We study numerically how the structures of distinct networks influence the epidemic dynamics in contact process. We first find that the variability difference between homogeneous and heterogeneous networks is very narrow, although the heterogeneous structures can induce the lighter prevalence. Contrary to non-community networks, strong community structures can cause the secondary outbreak of prevalence and two peaks of variability appeared. Especially in the local community, the extraordinarily large variability in early stage of the outbreak makes the prediction of epidemic spreading hard. Importantly, the bridgeness plays a significant role in the predictability, meaning the further distance of the initial seed to the bridgeness, the less accurate the predictability is. Also, we investigate the effect of different disease reaction mechanisms on variability, and find that the different reaction mechanisms will result in the distinct variabilities at the end of epidemic spreading.

preprint2011arXiv

Efficient routing strategies in scale-free networks with limited bandwidth

We study the traffic dynamics in complex networks where each link is assigned a limited and identical bandwidth. Although the first-in-first-out (FIFO) queuing rule is widely applied in the routing protocol of information packets, here we argue that if we drop this rule, the overall throughput of the network can be remarkably enhanced. We proposed some efficient routing strategies that do not strictly obey the FIFO rule. Comparing with the routine shortest path strategy, the throughput for both Barabási-Albert (BA) networks and the real Internet, the throughput can be improved more than five times. We calculate the theoretical limitation of the throughput. In BA networks, our proposed strategy can achieve 88% of the theoretical optimum, yet for the real Internet, it is about 12%, implying that we have a huge space to further improve the routing strategy for the real Internet. Finally we discuss possibly promising ways to design more efficient routing strategies for the Internet.

preprint2010arXiv

Composite THz materials using aligned metallic and semiconductor microwires, experiments and interpretation

We report fabrication method and THz characterization of composite films containing either aligned metallic (tin alloy) microwires or chalcogenide As2Se3 microwires. The microwire arrays are made by stack-and-draw fiber fabrication technique using multi-step co-drawing of low-melting-temperature metals or semiconductor glasses together with polymers. Fibers are then stacked together and pressed into composite films. Transmission through metamaterial films is studied in the whole THz range (0.1-20 THz) using a combination of FTIR and TDS. Metal containing metamaterials are found to have strong polarizing properties, while semiconductor containing materials are polarization independent and could have a designable high refractive index. Using the transfer matrix theory, we show how to retrieve the complex polarization dependent refractive index of the composite films. We then detail the selfconsistent algorithm for retrieving the optical properties of the metal alloy used in the fabrication of the metamaterial layers by using an effective medium approximation. Finally, we study challenges in fabrication of metamaterials with sub-micrometer metallic wires by repeated stack-and-draw process by comparing samples made using 2, 3 and 4 consecutive drawings. When using metallic alloys we observe phase separation effects and nano-grids formation on small metallic wires.

Ming Tang

What is connected

Connect this record

See the researcher in context

Building this map preview

64 published item(s)

Asynchronous Fractional Multi-Agent Deep Reinforcement Learning for Age-Minimal Mobile Edge Computing

Decomposing the Generalization Gap in PROTAC Activity Prediction: Variance Attribution and the Inter-Laboratory Ceiling

First Thin-Film Lithium Tantalate Polarization Controller Enabling Reset-Free Mrad/s Tracking for Optical Interconnects

FlowSpec: Continuous Pipelined Speculative Decoding for Efficient Distributed LLM Inference

GeM-VG: Towards Generalized Multi-image Visual Grounding with Multimodal Large Language Models

ReST-KV: Robust KV Cache Eviction with Layer-wise Output Reconstruction and Spatial-Temporal Smoothing

A Posterior Error Estimator for Mixed Interior Penalty Discontinuous Galerkin Finite Element Method for the H(curl)-Elliptic Problems

Iterative two-level algorithm for nonsymmetric or indefinite elliptic problems

A modified weak Galerkin method for $\boldsymbol{H}(\mathrm{curl})$-elliptic problem

Beyond the Limitation of Pulse Width in Optical Time-domain Reflectometry

Improving Information Freshness via Backbone-Assisted Cooperative Access Points

PASS: Part-Aware Self-Supervised Pre-Training for Person Re-Identification

Thermal Modelling and Controller Design of an Alkaline Electrolysis System under Dynamic Operating Conditions

Transfering Low-Frequency Features for Domain Adaptation

Unconventional Excitonic States with Phonon Sidebands in Layered Silicon Diphosphide

UniVIP: A Unified Framework for Self-Supervised Visual Pre-training

Asymmetrically interacting dynamics with mutual confirmation from multi-source on multiplex networks

Identify Influential Spreaders in Asymmetrically Interacting Multiplex Networks

A Quantitative Analytical Model for Predicting and Optimizing the Rate Performance of Battery Cells

Deep Reinforcement Learning for Task Offloading in Mobile Edge Computing Systems

Distributed Brillouin frequency shift extraction via a convolutional neural network

Identity-Guided Human Semantic Parsing for Person Re-Identification

Learning Feature Embeddings for Discriminant Model based Tracking

Non-Markovian recovery makes complex networks more resilient against large-scale failures

Online Bitrate Selection for Viewport Adaptive 360-Degree Video Streaming

Quantitative assessment of the role of undocumented infection in the 2019 novel coronavirus (COVID-19) pandemic

Self-Supervised Learning and Prediction of Microstructure Evolution with Recurrent Neural Networks

Stress-Induced Intercalation Instability

Thermodynamic Origin of Reaction Non-Uniformity in Battery Porous Electrodes and its Mitigation

Learning epidemic threshold in complex networks by Convolutional Neural Network

Machine learning dynamical phase transitions in complex networks

Period-doubling bifurcation of dissipative-soliton-resonance pulses in a passively mode-locked fiber laser

Effective information spreading based on local information in correlated networks

Impacts of complex behavioral responses on asymmetric interacting spreading dynamics in multiplex networks

Scalar - vector soliton fiber lasers

Suppressing disease spreading by using information diffusion on multiplex networks

Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition

Dynamics of social contagions with heterogeneous adoption thresholds: Crossover phenomena in phase transition

Dynamics of social contagions with memory of non-redundant information

Identify influential spreaders in complex networks, the role of neighborhood

Improving the accuracy of the k-shell method by removing redundant links-from a perspective of spreading dynamics

Interplay between the local information based behavioral responses and the epidemic spreading in complex networks

Large epidemic thresholds emerge in heterogeneous networks of heterogeneous nodes

Predicting the epidemic threshold of the susceptible-infected-recovered model

Preferential imitation of vaccinating behavior can invalidate the targeted subsidy on complex network

Traffic-driven epidemic spreading in correlated networks

Asymmetrically interacting spreading dynamics on complex layered networks

Efficient allocation of heterogeneous response times in information spreading process

Epidemic spreading on complex networks with general degree and weight distributions

Identifying effective multiple spreaders by coloring complex networks

Message spreading in networks with stickiness and persistence: Large clustering does not always facilitate large-scale diffusion

Simulated identification of epidemic threshold on finite-size networks

Suppressed epidemics in multi-relational networks

Influence of Reciprocal links in Social Networks

Signal transmission in a Y-shaped one-way chain

Effects of Weak Ties on Epidemic Predictability in Community Networks

Efficient community-based control strategies in adaptive networks

Emergence of scale-free close-knit friendship structure in online social networks

Epidemic Variability in Hierarchical Geographical Networks with Human Activity Patterns

Optimal forwarding ratio on dynamical networks with heterogeneous mobility

Slow dynamics of Zero Range Process in the Framework of Traps Model

Variability of Contact Process in Complex Networks

Efficient routing strategies in scale-free networks with limited bandwidth

Composite THz materials using aligned metallic and semiconductor microwires, experiments and interpretation