arXiv subjects

Ning Wang

Publications and source records attributed to Ning Wang.

At least 289 records · Page 16Linked to original sources

arXiv2021

Optimal Lockdown Policy for Covid-19: A Modelling Study

As the COVID19 spreads across the world, prevention measures are becoming the essential weapons to combat the pandemic in the period of crisis. The lockdown measure is the most controversial one as it imposes an overwhelming impact on our economy and society. Especially when and how to enforce the lockdown measures are the most challenging questions considering both economic and epidemiological costs. In this paper, we extend the classic SIR model to find optimal decision making to balance between economy and people's health during the outbreak of COVID-19. In our model, we intend to solve a two phases optimization problem: policymakers control the lockdown rate to maximize the overall welfare of the society; people in different health statuses take different decisions on their working hours and consumption to maximize their utility. We develop a novel method to estimate parameters for the model through various additional sources of data. We use the Cournot equilibrium to model people's behavior and also consider the cost of death in order to leverage between economic and epidemic costs. The analysis of simulation results provides scientific suggestions for policymakers to make critical decisions on when to start the lockdown and how strong it should be during the whole period of the outbreak. Although the model is originally proposed for the COVID19 pandemic, it can be generalized to address similar problems to control the outbreak of other infectious diseases with lockdown measures.

physics.soc-ph↗

arXiv2021

Strain engineering of epitaxial oxide heterostructures beyond substrate limitations

The limitation of commercially available single-crystal substrates and the lack of continuous strain tunability preclude the ability to take full advantage of strain engineering for further exploring novel properties and exhaustively studying fundamental physics in complex oxides. Here we report an approach for imposing continuously tunable, large epitaxial strain in oxide heterostructures beyond substrate limitations by inserting an interface layer through tailoring its gradual strain relaxation. Taking BiFeO3 as a model system, we demonstrate that the introduction of an ultrathin interface layer allows the creation of a desired strain that can induce phase transition and stabilize a new metastable super-tetragonal phase as well as morphotropic phase boundaries overcoming substrate limitations. Furthermore, continuously tunable strain from tension to compression can be generated by precisely adjusting the thickness of the interface layer, leading to the first achievement of continuous O-R-T phase transition in BiFeO3 on a single substrate. This proposed route could be extended to other oxide heterostructures, providing a platform for creating exotic phases and emergent phenomena.

cond-mat.mtrl-sci↗

arXiv2021

Current-induced magnetization switching in a chemically disordered A1 CoPt single layer

We report the first demonstration of the current-induced magnetization switching in a perpendicularly magnetized A1 CoPt single layer. We show that good perpendicular magnetic anisotropy can be obtained in a wide composition range of the A1 Co1-xPtx single layers, which allows to fabricate perpendicularly magnetized CoPt single layer with composition gradient to break the inversion symmetry of the structure. By fabricating the gradient CoPt single layer, we have evaluated the SOT efficiency and successfully realized the SOT-induced magnetization switching. Our study provides an approach to realize the current-induced magnetization in the ferromagnetic single layers without attaching SOT source materials.

cond-mat.mtrl-sci↗

arXiv2021

Symmetry-Protected Topological relationship between $SU(3)$ and $SU(2)\times{U(1)}$ in Two Dimension

Symmetry-protected topological $\left(SPT\right)$ phases are gapped short-range entangled states with symmetry $G$, which can be systematically described by group cohomology theory. $SU(3)$ and $SU(2)\times{U(1)}$ are considered as the basic groups of Quantum Chromodynamics and Weak-Electromagnetic unification, respectively. In two dimension $(2D)$, nonlinear-sigma models with a quantized topological Theta term can be used to describe nontrivial SPT phases. By coupling the system to a probe field and integrating out the group variables, the Theta term becomes the effective action of Chern-Simons theory which can derive the response current density. As a result, the current shows a spin Hall effect, and the quantized number of the spin Hall conductance of SPT phases $SU(3)$ and $SU(2)\times{U(1)}$ are same. In addition, relationships between $SU(3)$ and $SU(2)\times{U(1)}$ which maps $SU(3)$ to $SU(2)$ with a rotation $U(1)$ will be given.

cond-mat.other↗

arXiv2021

Explainable CNN-attention Networks (C-Attention Network) for Automated Detection of Alzheimer's Disease

In this work, we propose three explainable deep learning architectures to automatically detect patients with Alzheimer`s disease based on their language abilities. The architectures use: (1) only the part-of-speech features; (2) only language embedding features and (3) both of these feature classes via a unified architecture. We use self-attention mechanisms and interpretable 1-dimensional ConvolutionalNeural Network (CNN) to generate two types of explanations of the model`s action: intra-class explanation and inter-class explanation. The inter-class explanation captures the relative importance of each of the different features in that class, while the inter-class explanation captures the relative importance between the classes. Note that although we have considered two classes of features in this paper, the architecture is easily expandable to more classes because of its modularity. Extensive experimentation and comparison with several recent models show that our method outperforms these methods with an accuracy of 92.2% and F1 score of 0.952on the DementiaBank dataset while being able to generate explanations. We show by examples, how to generate these explanations using attention values.

cs.CL↗

arXiv2020

Local Differential Privacy based Federated Learning for Internet of Things

Internet of Vehicles (IoV) is a promising branch of the Internet of Things. IoV simulates a large variety of crowdsourcing applications such as Waze, Uber, and Amazon Mechanical Turk, etc. Users of these applications report the real-time traffic information to the cloud server which trains a machine learning model based on traffic information reported by users for intelligent traffic management. However, crowdsourcing application owners can easily infer users' location information, which raises severe location privacy concerns of the users. In addition, as the number of vehicles increases, the frequent communication between vehicles and the cloud server incurs unexpected amount of communication cost. To avoid the privacy threat and reduce the communication cost, in this paper, we propose to integrate federated learning and local differential privacy (LDP) to facilitate the crowdsourcing applications to achieve the machine learning model. Specifically, we propose four LDP mechanisms to perturb gradients generated by vehicles. The Three-Outputs mechanism is proposed which introduces three different output possibilities to deliver a high accuracy when the privacy budget is small. The output possibilities of Three-Outputs can be encoded with two bits to reduce the communication cost. Besides, to maximize the performance when the privacy budget is large, an optimal piecewise mechanism (PM-OPT) is proposed. We further propose a suboptimal mechanism (PM-SUB) with a simple formula and comparable utility to PM-OPT. Then, we build a novel hybrid mechanism by combining Three-Outputs and PM-SUB.

cs.CR↗

arXiv2020

Contrastive Transformation for Self-supervised Correspondence Learning

In this paper, we focus on the self-supervised learning of visual correspondence using unlabeled videos in the wild. Our method simultaneously considers intra- and inter-video representation associations for reliable correspondence estimation. The intra-video learning transforms the image contents across frames within a single video via the frame pair-wise affinity. To obtain the discriminative representation for instance-level separation, we go beyond the intra-video analysis and construct the inter-video affinity to facilitate the contrastive transformation across different videos. By forcing the transformation consistency between intra- and inter-video levels, the fine-grained correspondence associations are well preserved and the instance-level feature discrimination is effectively reinforced. Our simple framework outperforms the recent self-supervised correspondence methods on a range of visual tasks including video object tracking (VOT), video object segmentation (VOS), pose keypoint tracking, etc. It is worth mentioning that our method also surpasses the fully-supervised affinity representation (e.g., ResNet) and performs competitively against the recent fully-supervised algorithms designed for the specific tasks (e.g., VOT and VOS).

cs.CV↗

arXiv2020

Secrecy Performance of Body-Centric Communications over Alternate Rician Shadowed Fading Channels

In this paper, we investigate the physical layer security over the Alternate Rician Shadowed fading channel, which is a novel channel model for body-centric wireless links and land mobile satellite. We derive exact closed-form expressions for the average secrecy capacity (ASC), secrecy outage probability (SOP), and probability of non-zero secrecy capacity (PNZ) for two cases: (i) m is a positive real number and (ii) m is a positive integer number, where m describes the level of fluctuation of the line-of-sight component. In the first case, SOP is derived in terms of the Meijer's G-function, while ASC and PNZ are derived in terms of the multivariate Fox's H-function. In the second case, ASC is derived in terms of the Meijer's G-function, while SOP and PNZ are derived in terms of elementary functions. In addition, we derive the asymptotic ASC, SOP and PNZ expressions which all match well the exact ones at high values of signal-to-noise ratio, respectively. The capacity slope of asymptotic ASC and the secrecy diversity order of asymptotic SOP have been derived for providing more physical insights. Finally, the accuracy of our derived expressions is validated by Monte-Carlo simulations.

cs.IT↗

arXiv2020

Recurrent Feature Reasoning for Image Inpainting

Existing inpainting methods have achieved promising performance for recovering regular or small image defects. However, filling in large continuous holes remains difficult due to the lack of constraints for the hole center. In this paper, we devise a Recurrent Feature Reasoning (RFR) network which is mainly constructed by a plug-and-play Recurrent Feature Reasoning module and a Knowledge Consistent Attention (KCA) module. Analogous to how humans solve puzzles (i.e., first solve the easier parts and then use the results as additional information to solve difficult parts), the RFR module recurrently infers the hole boundaries of the convolutional feature maps and then uses them as clues for further inference. The module progressively strengthens the constraints for the hole center and the results become explicit. To capture information from distant places in the feature map for RFR, we further develop KCA and incorporate it in RFR. Empirically, we first compare the proposed RFR-Net with existing backbones, demonstrating that RFR-Net is more efficient (e.g., a 4\% SSIM improvement for the same model size). We then place the network in the context of the current state-of-the-art, where it exhibits improved performance. The corresponding source code is available at: https://github.com/jingyuanli001/RFR-Inpainting

cs.CV↗

arXiv2020

AlphaBlock: An Evaluation Framework for Blockchain Consensus Protocols

Consensus protocols play a pivotal role to balance security and efficiency in blockchain systems. In this paper, we propose an evaluation framework for blockchain consensus protocols termed as AlphaBlock. In this framework, we compare the overall performance of Byzantine Fault Tolerant (BFT) consensus and Nakamoto Consensus (NC). BFT consensus is reached by multiple rounds of quorum votes from the supermajority, while NC is reached by accumulating credibility with the implicit voting from appending blocks. AlphaBlock incorporates the key concepts of Hotstu BFT (HBFT) and Proof-of-authority (PoA) as the case study of BFT and NC. Using this framework, we compare the throughput and latency of HBFT and PoA with practical network and blockchain configurations. Our results show that the performance of HBFT dominates PoA in most scenarios due to the absence of forks in HBFT. Moreover, we find out a set of optimal configurations in AlphaBlock, which sheds a light for improving the performance of blockchain consensus algorithms.

cs.DC↗

arXiv2020

Unsupervised Deep Representation Learning for Real-Time Tracking

The advancement of visual tracking has continuously been brought by deep learning models. Typically, supervised learning is employed to train these models with expensive labeled data. In order to reduce the workload of manual annotations and learn to track arbitrary objects, we propose an unsupervised learning method for visual tracking. The motivation of our unsupervised learning is that a robust tracker should be effective in bidirectional tracking. Specifically, the tracker is able to forward localize a target object in successive frames and backtrace to its initial position in the first frame. Based on such a motivation, in the training process, we measure the consistency between forward and backward trajectories to learn a robust tracker from scratch merely using unlabeled videos. We build our framework on a Siamese correlation filter network, and propose a multi-frame validation scheme and a cost-sensitive loss to facilitate unsupervised learning. Without bells and whistles, the proposed unsupervised tracker achieves the baseline accuracy as classic fully supervised trackers while achieving a real-time speed. Furthermore, our unsupervised framework exhibits a potential in leveraging more unlabeled or weakly labeled data to further improve the tracking accuracy.

cs.CV↗

arXiv2020

Explainable Rumor Detection using Inter and Intra-feature Attention Networks

With social media becoming ubiquitous, information consumption from this media has also increased. However, one of the serious problems that have emerged with this increase, is the propagation of rumors. Therefore, rumor identification is a very critical task with significant implications to economy, democracy as well as public health and safety. We tackle the problem of automated detection of rumors in social media in this paper by designing a modular explainable architecture that uses both latent and handcrafted features and can be expanded to as many new classes of features as desired. This approach will allow the end user to not only determine whether the piece of information on the social media is real of a rumor, but also give explanations on why the algorithm arrived at its conclusion. Using attention mechanisms, we are able to interpret the relative importance of each of these features as well as the relative importance of the feature classes themselves. The advantage of this approach is that the architecture is expandable to more handcrafted features as they become available and also to conduct extensive testing to determine the relative influences of these features in the final decision. Extensive experimentation on popular datasets and benchmarking against eleven contemporary algorithms, show that our approach performs significantly better in terms of F-score and accuracy while also being interpretable.

cs.SI↗

arXiv2020

Cascaded Regression Tracking: Towards Online Hard Distractor Discrimination

Visual tracking can be easily disturbed by similar surrounding objects. Such objects as hard distractors, even though being the minority among negative samples, increase the risk of target drift and model corruption, which deserve additional attention in online tracking and model update. To enhance the tracking robustness, in this paper, we propose a cascaded regression tracker with two sequential stages. In the first stage, we filter out abundant easily-identified negative candidates via an efficient convolutional regression. In the second stage, a discrete sampling based ridge regression is designed to double-check the remaining ambiguous hard samples, which serves as an alternative of fully-connected layers and benefits from the closed-form solver for efficient learning. Extensive experiments are conducted on 11 challenging tracking benchmarks including OTB-2013, OTB-2015, VOT2018, VOT2019, UAV123, Temple-Color, NfS, TrackingNet, LaSOT, UAV20L, and OxUvA. The proposed method achieves state-of-the-art performance on prevalent benchmarks, while running in a real-time speed.

cs.CV↗

arXiv2020

KCN: Knowledge Centric Networking

The advent of multi-domain and multi-requirement digital services requires an underlying network ecosystem able to understand service-specific contexts. In this work, we propose Knowledge Centric Networking (KCN), a paradigm in which knowledge is positioned at the center of the networking landscape. KCN enables approaches by which in-network knowledge generation and distribution can be used to support advanced network control intelligence that is essential to handle complexity and uncertainty in these emerging digital services. In this paper, we introduce the principles of KCN and present an architecture for its realization that enables in-network knowledge creation, distribution, storage and processing, both within a single domain/player and across potentially heterogeneous domains/players.

cs.NI↗

arXiv2020

Progress of Quantum Molecular Dynamics model and its applications in Heavy Ion Collisions

In this review article, we first briefly introduce the transport theory and quantum molecular dynamics model applied in the study of the heavy ion collisions from low to intermediate energies. The developments of improved quantum molecular dynamics model (ImQMD) and ultra-relativistic quantum molecular dynamics model (UrQMD), are reviewed. The reaction mechanism and phenomena related to the fusion, multinucleon transfer, fragmentation, collective flow and particle production are reviewed and discussed within the framework of the two models. The constraints on the isospin asymmetric nuclear equation of state and in-medium nucleon-nucleon cross sections by comparing the heavy ion collision data with transport models calculations in last decades are also discussed, and the uncertainties of these constraints are analyzed as well. Finally, we discuss the future direction of the development of the transport models for improving the understanding of the reaction mechanism, the descriptions of various observables, the constraint on the nuclear equation of state, as well as for the constraint on in-medium nucleon-nucleon cross sections.

nucl-th↗

arXiv2020

Personalized Early Stage Alzheimer's Disease Detection: A Case Study of President Reagan's Speeches

Alzheimer`s disease (AD)-related global healthcare cost is estimated to be $1 trillion by 2050. Currently, there is no cure for this disease; however, clinical studies show that early diagnosis and intervention helps to extend the quality of life and inform technologies for personalized mental healthcare. Clinical research indicates that the onset and progression of Alzheimer`s disease lead to dementia and other mental health issues. As a result, the language capabilities of patient start to decline. In this paper, we show that machine learning-based unsupervised clustering of and anomaly detection with linguistic biomarkers are promising approaches for intuitive visualization and personalized early stage detection of Alzheimer`s disease. We demonstrate this approach on 10 year`s (1980 to 1989) of President Ronald Reagan`s speech data set. Key linguistic biomarkers that indicate early-stage AD are identified. Experimental results show that Reagan had early onset of Alzheimer`s sometime between 1983 and 1987. This finding is corroborated by prior work that analyzed his interviews using a statistical technique. The proposed technique also identifies the exact speeches that reflect linguistic biomarkers for early stage AD.

cs.CY↗

arXiv2020

Exciton solid in bilayer two dimensional electron-hole systems

We propose a state of excitonic solid for double layer two dimensional electron hole systems in transition metal dicalcogenides stacked on opposite sides of thin layers of BN. Properties of the exciton lattice such as its Lindemann ratio and possible supersolid behaviour are studied. We found that the solid can be stabilized relative to the fluid by the potential due to the BN.

cond-mat.mes-hall↗

arXiv2020

NAS-FCOS: Fast Neural Architecture Search for Object Detection

The success of deep neural networks relies on significant architecture engineering. Recently neural architecture search (NAS) has emerged as a promise to greatly reduce manual effort in network design by automatically searching for optimal architectures, although typically such algorithms need an excessive amount of computational resources, e.g., a few thousand GPU-days. To date, on challenging vision tasks such as object detection, NAS, especially fast versions of NAS, is less studied. Here we propose to search for the decoder structure of object detectors with search efficiency being taken into consideration. To be more specific, we aim to efficiently search for the feature pyramid network (FPN) as well as the prediction head of a simple anchor-free object detector, namely FCOS, using a tailored reinforcement learning paradigm. With carefully designed search space, search algorithms and strategies for evaluating network quality, we are able to efficiently search a top-performing detection architecture within 4 days using 8 V100 GPUs. The discovered architecture surpasses state-of-the-art object detection models (such as Faster R-CNN, RetinaNet and FCOS) by 1.5 to 3.5 points in AP on the COCO dataset, with comparable computation complexity and memory footprint, demonstrating the efficacy of the proposed NAS for object detection.

cs.CV↗