Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
50works
0followers
23topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

50 published item(s)

preprint2026arXiv

Structured Analytic Coherent Point Drift for Non-Rigid Point Set Registration

Coherent Point Drift (CPD) is a representative probabilistic framework for unsupervised non-rigid point set registration. Its standard non-rigid M-step, however, relies on a point-indexed Gaussian-kernel system whose size grows with the number of moving points, making deformation estimation computationally heavy for large point sets and difficult to control in complexity during registration. To address these limitations, we propose Analytic-CPD, a new unsupervised non-rigid registration framework that gives CPD a structured analytic reformulation. Analytic-CPD preserves the CPD posterior correspondence layer, but lifts the M-step from point-indexed kernel displacement estimation to structured analytic mapping estimation. By coupling the Gaussian-mixture posterior mechanism of CPD with Structured Analytic Mappings (SAM), the method obtains a deformation model whose coefficient dimension is governed by the ambient dimension and analytic order rather than by the number of moving points. More importantly, deformation estimation is organized over an interpretable hierarchy of analytic function spaces, so the analytic order can be increased progressively as posterior correspondences become more reliable. We implement this idea through an increasing-degree continuation strategy with decreasing stage lengths: low-order analytic maps first stabilize the posterior correspondence structure, while higher-order modes later refine nonlinear residual deformation. Experiments on controlled model-matched, smooth model-mismatch, and registered human-shape data demonstrate the effectiveness and favorable accuracy--efficiency performance of Analytic-CPD.

preprint2024arXiv

Elastic Multi-Gradient Descent for Parallel Continual Learning

The goal of Continual Learning (CL) is to continuously learn from new data streams and accomplish the corresponding tasks. Previously studied CL assumes that data are given in sequence nose-to-tail for different tasks, thus indeed belonging to Serial Continual Learning (SCL). This paper studies the novel paradigm of Parallel Continual Learning (PCL) in dynamic multi-task scenarios, where a diverse set of tasks is encountered at different time points. PCL presents challenges due to the training of an unspecified number of tasks with varying learning progress, leading to the difficulty of guaranteeing effective model updates for all encountered tasks. In our previous conference work, we focused on measuring and reducing the discrepancy among gradients in a multi-objective optimization problem, which, however, may still contain negative transfers in every model update. To address this issue, in the dynamic multi-objective optimization problem, we introduce task-specific elastic factors to adjust the descent direction towards the Pareto front. The proposed method, called Elastic Multi-Gradient Descent (EMGD), ensures that each update follows an appropriate Pareto descent direction, minimizing any negative impact on previously learned tasks. To balance the training between old and new tasks, we also propose a memory editing mechanism guided by the gradient computed using EMGD. This editing process updates the stored data points, reducing interference in the Pareto descent direction from previous tasks. Experiments on public datasets validate the effectiveness of our EMGD in the PCL setting.

preprint2023arXiv

COMMA: Co-Articulated Multi-Modal Learning

Pretrained large-scale vision-language models such as CLIP have demonstrated excellent generalizability over a series of downstream tasks. However, they are sensitive to the variation of input text prompts and need a selection of prompt templates to achieve satisfactory performance. Recently, various methods have been proposed to dynamically learn the prompts as the textual inputs to avoid the requirements of laboring hand-crafted prompt engineering in the fine-tuning process. We notice that these methods are suboptimal in two aspects. First, the prompts of the vision and language branches in these methods are usually separated or uni-directionally correlated. Thus, the prompts of both branches are not fully correlated and may not provide enough guidance to align the representations of both branches. Second, it's observed that most previous methods usually achieve better performance on seen classes but cause performance degeneration on unseen classes compared to CLIP. This is because the essential generic knowledge learned in the pretraining stage is partly forgotten in the fine-tuning process. In this paper, we propose Co-Articulated Multi-Modal Learning (COMMA) to handle the above limitations. Especially, our method considers prompts from both branches to generate the prompts to enhance the representation alignment of both branches. Besides, to alleviate forgetting about the essential knowledge, we minimize the feature discrepancy between the learned prompts and the embeddings of hand-crafted prompts in the pre-trained CLIP in the late transformer layers. We evaluate our method across three representative tasks of generalization to novel classes, new target datasets and unseen domain shifts. Experimental results demonstrate the superiority of our method by exhibiting a favorable performance boost upon all tasks with high efficiency.

preprint2023arXiv

Generation of long-lived $W$ states via reservoir engineering in dissipatively coupled systems

Very recently, dissipative coupling was discovered, which develops and broadens methods for controlling and utilizing light-matter interactions. Here, we propose a scheme to generate the tripartite $W$ state in a dissipatively coupled system, where one qubit and two resonators simultaneously interact with a common reservoir. With appropriate parameters, we find the $W$ state is a dark state of the system. By driving the qubit, the dissipatively coupled system will evolve from the ground state to the tripartite $W$ state. Because the initial state is the ground state of the system and no measurement is required, our scheme is easy to implement in experiments. Moreover, the $W$ state decouples from the common reservoir and thus has a very long lifetime. This scheme is applicable to a wide class of dissipatively coupled systems, and we specifically illustrate how to prepare the $W$ state in a hybrid qubit-photon-magnon system by using this scheme.

preprint2022arXiv

Adversarial Rain Attack and Defensive Deraining for DNN Perception

Rain often poses inevitable threats to deep neural network (DNN) based perception systems, and a comprehensive investigation of the potential risks of the rain to DNNs is of great importance. However, it is rather difficult to collect or synthesize rainy images that can represent all rain situations that would possibly occur in the real world. To this end, in this paper, we start from a new perspective and propose to combine two totally different studies, i.e., rainy image synthesis and adversarial attack. We first present an adversarial rain attack, with which we could simulate various rain situations with the guidance of deployed DNNs and reveal the potential threat factors that can be brought by rain. In particular, we design a factor-aware rain generation that synthesizes rain streaks according to the camera exposure process and models the learnable rain factors for adversarial attack. With this generator, we perform the adversarial rain attack against the image classification and object detection. To defend the DNNs from the negative rain effect, we also present a defensive deraining strategy, for which we design an adversarial rain augmentation that uses mixed adversarial rain layers to enhance deraining models for downstream DNN perception. Our large-scale evaluation on various datasets demonstrates that our synthesized rainy images with realistic appearances not only exhibit strong adversarial capability against DNNs, but also boost the deraining models for defensive purposes, building the foundation for further rain-robust perception studies.

preprint2022arXiv

Adversarial Relighting Against Face Recognition

Deep face recognition (FR) has achieved significantly high accuracy on several challenging datasets and fosters successful real-world applications, even showing high robustness to the illumination variation that is usually regarded as a main threat to the FR system. However, in the real world, illumination variation caused by diverse lighting conditions cannot be fully covered by the limited face dataset. In this paper, we study the threat of lighting against FR from a new angle, i.e., adversarial attack, and identify a new task, i.e., adversarial relighting. Given a face image, adversarial relighting aims to produce a naturally relighted counterpart while fooling the state-of-the-art deep FR methods. To this end, we first propose the physical modelbased adversarial relighting attack (ARA) denoted as albedoquotient-based adversarial relighting attack (AQ-ARA). It generates natural adversarial light under the physical lighting model and guidance of FR systems and synthesizes adversarially relighted face images. Moreover, we propose the auto-predictive adversarial relighting attack (AP-ARA) by training an adversarial relighting network (ARNet) to automatically predict the adversarial light in a one-step manner according to different input faces, allowing efficiency-sensitive applications. More importantly, we propose to transfer the above digital attacks to physical ARA (PhyARA) through a precise relighting device, making the estimated adversarial lighting condition reproducible in the real world. We validate our methods on three state-of-the-art deep FR methods, i.e., FaceNet, ArcFace, and CosFace, on two public datasets. The extensive and insightful results demonstrate our work can generate realistic adversarial relighted face images fooling face recognition tasks easily, revealing the threat of specific light directions and strengths.

preprint2022arXiv

AGCN: Augmented Graph Convolutional Network for Lifelong Multi-label Image Recognition

The Lifelong Multi-Label (LML) image recognition builds an online class-incremental classifier in a sequential multi-label image recognition data stream. The key challenges of LML image recognition are the construction of label relationships on Partial Labels of training data and the Catastrophic Forgetting on old classes, resulting in poor generalization. To solve the problems, the study proposes an Augmented Graph Convolutional Network (AGCN) model that can construct the label relationships across the sequential recognition tasks and sustain the catastrophic forgetting. First, we build an Augmented Correlation Matrix (ACM) across all seen classes, where the intra-task relationships derive from the hard label statistics while the inter-task relationships leverage both hard and soft labels from data and a constructed expert network. Then, based on the ACM, the proposed AGCN captures label dependencies with dynamic augmented structure and yields effective class representations. Last, to suppress the forgetting of label dependencies across old tasks, we propose a relationship-preserving loss as a constraint to the construction of label relationships. The proposed method is evaluated using two multi-label image benchmarks and the experimental results show that the proposed method is effective for LML image recognition and can build convincing correlation across tasks even if the labels of previous tasks are missing. Our code is available at https://github.com/Kaile-Du/AGCN.

preprint2022arXiv

Can You Spot the Chameleon? Adversarially Camouflaging Images from Co-Salient Object Detection

Co-salient object detection (CoSOD) has recently achieved significant progress and played a key role in retrieval-related tasks. However, it inevitably poses an entirely new safety and security issue, i.e., highly personal and sensitive content can potentially be extracting by powerful CoSOD methods. In this paper, we address this problem from the perspective of adversarial attacks and identify a novel task: adversarial co-saliency attack. Specially, given an image selected from a group of images containing some common and salient objects, we aim to generate an adversarial version that can mislead CoSOD methods to predict incorrect co-salient regions. Note that, compared with general white-box adversarial attacks for classification, this new task faces two additional challenges: (1) low success rate due to the diverse appearance of images in the group; (2) low transferability across CoSOD methods due to the considerable difference between CoSOD pipelines. To address these challenges, we propose the very first black-box joint adversarial exposure and noise attack (Jadena), where we jointly and locally tune the exposure and additive perturbations of the image according to a newly designed high-feature-level contrast-sensitive loss function. Our method, without any information on the state-of-the-art CoSOD methods, leads to significant performance degradation on various co-saliency detection datasets and makes the co-salient objects undetectable. This can have strong practical benefits in properly securing the large number of personal photos currently shared on the Internet. Moreover, our method is potential to be utilized as a metric for evaluating the robustness of CoSOD methods.

preprint2022arXiv

Control-Oriented Power Allocation for Integrated Satellite-UAV Networks

This letter presents a sensing-communication-computing-control (SC3) integrated satellite unmanned aerial vehicle (UAV) network, where the UAV is equipped with on-board sensors, mobile edge computing (MEC) servers, base stations and satellite communication module. Like the nervous system, this integrated network is capable of organizing multiple field robots in remote areas, so as to perform mission-critical tasks which are dangerous for human. Aiming at activating this nervous system with multiple SC3 loops, we present a control-oriented optimization problem. Different from traditional studies which mainly focused on communication metrics, we address the power allocation issue to minimize the sum linear quadratic regulator (LQR) control cost of all SC3 loops. Specifically, we show the convexity of the formulated problem and reveal the relationship between optimal transmit power and intrinsic entropy rate of different SC3 loops. For the assure-to-be-stable case, we derive a closed-form solution for ease of practical applications. After demonstrating the superiority of the control-oriented power allocation, we further highlight its difference with classic capacity-oriented water-filling method.

preprint2022arXiv

End-to-end Clinical Event Extraction from Chinese Electronic Health Record

Event extraction is an important work of medical text processing. According to the complex characteristics of medical text annotation, we use the end-to-end event extraction model to enhance the output formatting information of events. Through pre training and fine-tuning, we can extract the attributes of the four dimensions of medical text: anatomical position, subject word, description word and occurrence state. On the test set, the accuracy rate was 0.4511, the recall rate was 0.3928, and the F1 value was 0.42. The method of this model is simple, and it has won the second place in the task of mining clinical discovery events (task2) in the Chinese electronic medical record of the seventh China health information processing Conference (chip2021).

preprint2022arXiv

Illumination-Invariant Active Camera Relocalization for Fine-Grained Change Detection in the Wild

Active camera relocalization (ACR) is a new problem in computer vision that significantly reduces the false alarm caused by image distortions due to camera pose misalignment in fine-grained change detection (FGCD). Despite the fruitful achievements that ACR can support, it still remains a challenging problem caused by the unstable results of relative pose estimation, especially for outdoor scenes, where the lighting condition is out of control, i.e., the twice observations may have highly varied illuminations. This paper studies an illumination-invariant active camera relocalization method, it improves both in relative pose estimation and scale estimation. We use plane segments as an intermediate representation to facilitate feature matching, thus further boosting pose estimation robustness and reliability under lighting variances. Moreover, we construct a linear system to obtain the absolute scale in each ACR iteration by minimizing the image warping error, thus, significantly reduce the time consume of ACR process, it is nearly $1.6$ times faster than the state-of-the-art ACR strategy. Our work greatly expands the feasibility of real-world fine-grained change monitoring tasks for cultural heritages. Extensive experiments tests and real-world applications verify the effectiveness and robustness of the proposed pose estimation method using for ACR tasks.

preprint2022arXiv

Integrating Satellites and Mobile Edge Computing for 6G Wide-Area Edge Intelligence: Minimal Structures and Systematic Thinking

The sixth-generation (6G) network will shift its focus to supporting everything including various machine-type devices (MTDs) in an everyone-centric manner. To ubiquitously cover the MTDs working in rural and disastrous areas, satellite communications become indispensable, while mobile edge computing (MEC) also plays an increasingly crucial role. Their sophisticated integration enables wide-area edge intelligence which promises to facilitate globally-distributed customized services. In this article, we present typical use cases of integrated satellite-MEC networks and discuss the main challenges therein. Inspired by the protein structure and the systematic engineering methodology, we propose three minimal integrating structures, based on which a complex integrated satellite-MEC network can be treated as their extension and combination. We discuss the unique characteristics and key problems of each minimal structure. Accordingly, we establish an on-demand network orchestration framework to enrich the hierarchy of network management, which further leads to a process-oriented network optimization method. On that basis, a case study is utilized to showcase the benefits of on-demand network orchestration and process-oriented network optimization. Finally, we outline potential research issues to envision a more intelligent, more secure, and greener integrated network.

preprint2022arXiv

MISF: Multi-level Interactive Siamese Filtering for High-Fidelity Image Inpainting

Although achieving significant progress, existing deep generative inpainting methods are far from real-world applications due to the low generalization across different scenes. As a result, the generated images usually contain artifacts or the filled pixels differ greatly from the ground truth. Image-level predictive filtering is a widely used image restoration technique, predicting suitable kernels adaptively according to different input scenes. Inspired by this inherent advantage, we explore the possibility of addressing image inpainting as a filtering task. To this end, we first study the advantages and challenges of image-level predictive filtering for image inpainting: the method can preserve local structures and avoid artifacts but fails to fill large missing areas. Then, we propose semantic filtering by conducting filtering on the deep feature level, which fills the missing semantic information but fails to recover the details. To address the issues while adopting the respective advantages, we propose a novel filtering technique, i.e., Multilevel Interactive Siamese Filtering (MISF), which contains two branches: kernel prediction branch (KPB) and semantic & image filtering branch (SIFB). These two branches are interactively linked: SIFB provides multi-level features for KPB while KPB predicts dynamic kernels for SIFB. As a result, the final method takes the advantage of effective semantic & image-level filling for high-fidelity inpainting. We validate our method on three challenging datasets, i.e., Dunhuang, Places2, and CelebA. Our method outperforms state-of-the-art baselines on four metrics, i.e., L1, PSNR, SSIM, and LPIPS. Please try the released code and model at https://github.com/tsingqguo/misf.

preprint2022arXiv

Regularized Modal Regression on Markov-dependent Observations: A Theoretical Assessment

Modal regression, a widely used regression protocol, has been extensively investigated in statistical and machine learning communities due to its robustness to outliers and heavy-tailed noises. Understanding modal regression's theoretical behavior can be fundamental in learning theory. Despite significant progress in characterizing its statistical property, the majority of the results are based on the assumption that samples are independent and identical distributed (i.i.d.), which is too restrictive for real-world applications. This paper concerns the statistical property of regularized modal regression (RMR) within an important dependence structure - Markov dependent. Specifically, we establish the upper bound for RMR estimator under moderate conditions and give an explicit learning rate. Our results show that the Markov dependence impacts on the generalization error in the way that sample size would be discounted by a multiplicative factor depending on the spectral gap of underlying Markov chain. This result shed a new light on characterizing the theoretical underpinning for robust regression.

preprint2022arXiv

Reinforcement Learning-Empowered Mobile Edge Computing for 6G Edge Intelligence

Mobile edge computing (MEC) is considered a novel paradigm for computation-intensive and delay-sensitive tasks in fifth generation (5G) networks and beyond. However, its uncertainty, referred to as dynamic and randomness, from the mobile device, wireless channel, and edge network sides, results in high-dimensional, nonconvex, nonlinear, and NP-hard optimization problems. Thanks to the evolved reinforcement learning (RL), upon iteratively interacting with the dynamic and random environment, its trained agent can intelligently obtain the optimal policy in MEC. Furthermore, its evolved versions, such as deep RL (DRL), can achieve higher convergence speed efficiency and learning accuracy based on the parametric approximation for the large-scale state-action space. This paper provides a comprehensive research review on RL-enabled MEC and offers insight for development in this area. More importantly, associated with free mobility, dynamic channels, and distributed services, the MEC challenges that can be solved by different kinds of RL algorithms are identified, followed by how they can be solved by RL solutions in diverse mobile applications. Finally, the open challenges are discussed to provide helpful guidance for future research in RL training and learning MEC.

preprint2022arXiv

Single Object Tracking Research: A Survey

Visual object tracking is an important task in computer vision, which has many real-world applications, e.g., video surveillance, visual navigation. Visual object tracking also has many challenges, e.g., object occlusion and deformation. To solve above problems and track the target accurately and efficiently, many tracking algorithms have emerged in recent years. This paper presents the rationale and representative works of two most popular tracking frameworks in past ten years, i.e., the corelation filter and Siamese network for object tracking. Then we present some deep learning based tracking methods categorized by different network structures. We also introduce some classical strategies for handling the challenges in tracking problem. Further, this paper detailedly present and compare the benchmarks and challenges for tracking, from which we summarize the development history and development trend of visual tracking. Focusing on the future development of object tracking, which we think would be applied in real-world scenes before some problems to be addressed, such as the problems in long-term tracking, low-power high-speed tracking and attack-robust tracking. In the future, the integration of multimodal data, e.g., the depth image, thermal image with traditional color image, will provide more solutions for visual tracking. Moreover, tracking task will go together with some other tasks, e.g., video object detection and segmentation.

preprint2022arXiv

Spatial Temporal Graph Attention Network for Skeleton-Based Action Recognition

It's common for current methods in skeleton-based action recognition to mainly consider capturing long-term temporal dependencies as skeleton sequences are typically long (>128 frames), which forms a challenging problem for previous approaches. In such conditions, short-term dependencies are few formally considered, which are critical for classifying similar actions. Most current approaches are consisted of interleaving spatial-only modules and temporal-only modules, where direct information flow among joints in adjacent frames are hindered, thus inferior to capture short-term motion and distinguish similar action pairs. To handle this limitation, we propose a general framework, coined as STGAT, to model cross-spacetime information flow. It equips the spatial-only modules with spatial-temporal modeling for regional perception. While STGAT is theoretically effective for spatial-temporal modeling, we propose three simple modules to reduce local spatial-temporal feature redundancy and further release the potential of STGAT, which (1) narrow the scope of self-attention mechanism, (2) dynamically weight joints along temporal dimension, and (3) separate subtle motion from static features, respectively. As a robust feature extractor, STGAT generalizes better upon classifying similar actions than previous methods, witnessed by both qualitative and quantitative results. STGAT achieves state-of-the-art performance on three large-scale datasets: NTU RGB+D 60, NTU RGB+D 120, and Kinetics Skeleton 400. Code is released.

preprint2022arXiv

Temporal Lift Pooling for Continuous Sign Language Recognition

Pooling methods are necessities for modern neural networks for increasing receptive fields and lowering down computational costs. However, commonly used hand-crafted pooling approaches, e.g., max pooling and average pooling, may not well preserve discriminative features. While many researchers have elaborately designed various pooling variants in spatial domain to handle these limitations with much progress, the temporal aspect is rarely visited where directly applying hand-crafted methods or these specialized spatial variants may not be optimal. In this paper, we derive temporal lift pooling (TLP) from the Lifting Scheme in signal processing to intelligently downsample features of different temporal hierarchies. The Lifting Scheme factorizes input signals into various sub-bands with different frequency, which can be viewed as different temporal movement patterns. Our TLP is a three-stage procedure, which performs signal decomposition, component weighting and information fusion to generate a refined downsized feature map. We select a typical temporal task with long sequences, i.e. continuous sign language recognition (CSLR), as our testbed to verify the effectiveness of TLP. Experiments on two large-scale datasets show TLP outperforms hand-crafted methods and specialized spatial variants by a large margin (1.5%) with similar computational overhead. As a robust feature extractor, TLP exhibits great generalizability upon multiple backbones on various datasets and achieves new state-of-the-art results on two large-scale CSLR datasets. Visualizations further demonstrate the mechanism of TLP in correcting gloss borders. Code is released.

preprint2022arXiv

The effect of $f$-$c$ hybridization on the $γ\rightarrowα$ phase transition of cerium studied by lanthanum doping

The hybridization between the localized 4$f$ level ($f$) with conduction ($c$) states in $γ$-Ce upon cooling has been previously revealed in single crystalline thin films experimentally and theoretically, whereas its influence on the $γ\rightarrowα$ phase transition was not explicitly verified, due to the fact that the phase transition happened in the bulk-layer, leaving the surface in the $γ$ phase. Here in our work, we circumvent this issue by investigating the effect of alloying addition of La on Ce, by means of crystal structure, electronic transport and ARPES measurements, together with a phenomenological periodic Anderson model and a modified Anderson impurity model. Our current researches indicate that the weakening of $f$-$c$ hybridization is the major factor in the suppression of $γ\rightarrowα$ phase transition by La doping. The consistency of our results with the effects of other rare earth and actinide alloying additions on the $γ\rightarrowα$ phase transition of Ce is also discussed. Our work demonstrates the importance of the interaction of $f$ and $c$ electrons in understanding the unconventional phase transition in Ce, which is intuitive for further researches on other rare earth and actinide metals and alloys with similar phase transition behaviors.

preprint2022arXiv

Uncertainty-Aware Cascaded Dilation Filtering for High-Efficiency Deraining

Deraining is a significant and fundamental computer vision task, aiming to remove the rain streaks and accumulations in an image or video captured under a rainy day. Existing deraining methods usually make heuristic assumptions of the rain model, which compels them to employ complex optimization or iterative refinement for high recovery quality. This, however, leads to time-consuming methods and affects the effectiveness for addressing rain patterns deviated from from the assumptions. In this paper, we propose a simple yet efficient deraining method by formulating deraining as a predictive filtering problem without complex rain model assumptions. Specifically, we identify spatially-variant predictive filtering (SPFilt) that adaptively predicts proper kernels via a deep network to filter different individual pixels. Since the filtering can be implemented via well-accelerated convolution, our method can be significantly efficient. We further propose the EfDeRain+ that contains three main contributions to address residual rain traces, multi-scale, and diverse rain patterns without harming the efficiency. First, we propose the uncertainty-aware cascaded predictive filtering (UC-PFilt) that can identify the difficulties of reconstructing clean pixels via predicted kernels and remove the residual rain traces effectively. Second, we design the weight-sharing multi-scale dilated filtering (WS-MS-DFilt) to handle multi-scale rain streaks without harming the efficiency. Third, to eliminate the gap across diverse rain patterns, we propose a novel data augmentation method (i.e., RainMix) to train our deep models. By combining all contributions with sophisticated analysis on different variants, our final method outperforms baseline methods on four single-image deraining datasets and one video deraining dataset in terms of both recovery quality and speed.

preprint2022arXiv

Unsupervised Domain Adaptive Fundus Image Segmentation with Category-level Regularization

Existing unsupervised domain adaptation methods based on adversarial learning have achieved good performance in several medical imaging tasks. However, these methods focus only on global distribution adaptation and ignore distribution constraints at the category level, which would lead to sub-optimal adaptation performance. This paper presents an unsupervised domain adaptation framework based on category-level regularization that regularizes the category distribution from three perspectives. Specifically, for inter-domain category regularization, an adaptive prototype alignment module is proposed to align feature prototypes of the same category in the source and target domains. In addition, for intra-domain category regularization, we tailored a regularization technique for the source and target domains, respectively. In the source domain, a prototype-guided discriminative loss is proposed to learn more discriminative feature representations by enforcing intra-class compactness and inter-class separability, and as a complement to traditional supervised loss. In the target domain, an augmented consistency category regularization loss is proposed to force the model to produce consistent predictions for augmented/unaugmented target images, which encourages semantically similar regions to be given the same label. Extensive experiments on two publicly fundus datasets show that the proposed approach significantly outperforms other state-of-the-art comparison algorithms.

preprint2022arXiv

Zero Trust Architecture for 6G Security

The upcoming sixth generation (6G) network is envisioned to be more open and heterogeneous than earlier generations. This challenges conventional security architectures, which typically rely on the construction of a security perimeter at network boundaries. In this article, we propose a software-defined zero trust architecture (ZTA) for 6G networks, which is promising for establishing an elastic and scalable security regime. This architecture achieves secure access control through adaptive collaborations among the involved control domains, and can effectively prevent malicious access behaviors such as distributed denial of service (DDoS) attacks, malware spread, and zero-day exploits. We also introduce key design aspects of this architecture and show the simulation results of a case study, which shows the effectiveness and robustness of ZTA for 6G. Furthermore, we discuss open issues to further promote this new architecture.

preprint2021arXiv

Hybrid Satellite-Terrestrial Communication Networks for the Maritime Internet of Things: Key Technologies, Opportunities, and Challenges

With the rapid development of marine activities, there has been an increasing number of maritime mobile terminals, as well as a growing demand for high-speed and ultra-reliable maritime communications to keep them connected. Traditionally, the maritime Internet of Things (IoT) is enabled by maritime satellites. However, satellites are seriously restricted by their high latency and relatively low data rate. As an alternative, shore & island-based base stations (BSs) can be built to extend the coverage of terrestrial networks using fourth-generation (4G), fifth-generation (5G), and beyond 5G services. Unmanned aerial vehicles can also be exploited to serve as aerial maritime BSs. Despite of all these approaches, there are still open issues for an efficient maritime communication network (MCN). For example, due to the complicated electromagnetic propagation environment, the limited geometrically available BS sites, and rigorous service demands from mission-critical applications, conventional communication and networking theories and methods should be tailored for maritime scenarios. Towards this end, we provide a survey on the demand for maritime communications, the state-of-the-art MCNs, and key technologies for enhancing transmission efficiency, extending network coverage, and provisioning maritime-specific services. Future challenges in developing an environment-aware, service-driven, and integrated satellite-air-ground MCN to be smart enough to utilize external auxiliary information, e.g., sea state and atmosphere conditions, are also discussed.

preprint2021arXiv

NOMA-Based Hybrid Satellite-UAV-Terrestrial Networks for Beyond 5G Maritime Internet of Things

Current fifth-generation (5G) networks do not cover maritime areas, causing difficulties in developing maritime Internet of Things (IoT). To tackle this problem, we establish a nearshore network by collaboratively using on-shore terrestrial base stations (TBSs) and tethered unmanned aerial vehicles (UAVs). These TBSs and UAVs form virtual clusters in a user-centric manner. Within each virtual cluster, non-orthogonal multiple access (NOMA) is adopted for agilely including various maritime IoT devices, which are usually sparsely distributed on the vast ocean. The nearshore network also shares spectrum with marine satellites. In such a NOMA-based hybrid satellite-UAV-terrestrial network, interference among different network segments, different clusters, as well as different users occurs. We thereby formulate a joint power allocation problem to maximize the sum rate of the network. Different from existing studies, we use large-scale channel state information (CSI) only for optimization to reduce system overhead. The large-scale CSI is obtained by using the position information of maritime IoT devices. The problem is non-convex with intractable non-linear constraints. We tackle these difficulties by adopting the max-min optimization, auxiliary function method, and successive convex approximation technique. An iterative power allocation algorithm is accordingly proposed, which is shown effective for coverage enhancement by simulations. This shows the potential of NOMA-based hybrid satellite-UAV-terrestrial networks for maritime on-demand coverage.

preprint2021arXiv

Solutions to nonlocal nonisospectral (2+1)-dimensional breaking soliton equations

Nonlocal reductions of a nonisospectral (2+1)-dimensional breaking soliton Ablowitz-Kaup-Newell-Segur equation are discussed on the base of double Wronskian reduction technique. Various types of solutions, including soliton solutions and Jordan-block solutions, for the resulting nonlocal equations are derived. Dynamics of these obtained solutions are analyzed and illustrated.

preprint2020arXiv

A 6G White Paper on Connectivity for Remote Areas

In many places all over the world rural and remote areas lack proper connectivity that has led to increasing digital divide. These areas might have low population density, low incomes, etc., making them less attractive places to invest and operate connectivity networks. 6G could be the first mobile radio generation truly aiming to close the digital divide. However, in order to do so, special requirements and challenges have to be considered since the beginning of the design process. The aim of this white paper is to discuss requirements and challenges and point out related, identified research topics that have to be solved in 6G. This white paper first provides a generic discussion, shows some facts and discusses targets set in international bodies related to rural and remote connectivity and digital divide. Then the paper digs into technical details, i.e., into a solutions space. Each technical section ends with a discussion and then highlights identified 6G challenges and research ideas as a list.

preprint2020arXiv

A Unified Framework for Adjustable Robust Optimization with Endogenous Uncertainty

This work proposes a framework for multistage adjustable robust optimization that unifies the treatment of three different types of endogenous uncertainty, where decisions, respectively, (i) alter the uncertainty set, (ii) affect the materialization of uncertain parameters, and (iii) determine the time when the true values of uncertain parameters are observed. We provide a systematic analysis of the different types of endogenous uncertainty and highlight the connection between optimization under endogenous uncertainty and active learning. We consider decision-dependent polyhedral uncertainty sets and propose a decision rule approach that incorporates both continuous and binary recourse, including recourse decisions that affect the uncertainty set. The proposed method enables the modeling of decision-dependent nonanticipativity and results in a tractable reformulation of the problem. We demonstrate the effectiveness of the approach in computational experiments that cover a range of applications, including plant redesign, maintenance planning with inspections, optimizing revision points in capacity planning, and production scheduling with active parameter estimation. The results show significant benefits from the proper modeling of endogenous uncertainty and active learning.

preprint2020arXiv

Active Lighting Recurrence by Parallel Lighting Analogy for Fine-Grained Change Detection

This paper studies a new problem, namely active lighting recurrence (ALR) that physically relocalizes a light source to reproduce the lighting condition from single reference image for a same scene, which may suffer from fine-grained changes during twice observations. ALR is of great importance for fine-grained visual inspection and change detection, because some phenomena or minute changes can only be clearly observed under particular lighting conditions. Therefore, effective ALR should be able to online navigate a light source toward the target pose, which is challenging due to the complexity and diversity of real-world lighting and imaging processes. To this end, we propose to use the simple parallel lighting as an analogy model and based on Lambertian law to compose an instant navigation ball for this purpose. We theoretically prove the feasibility, i.e., equivalence and convergence, of this ALR approach for realistic near point light source and small near surface light source. Besides, we also theoretically prove the invariance of our ALR approach to the ambiguity of normal and lighting decomposition. The effectiveness and superiority of the proposed approach have been verified by both extensive quantitative experiments and challenging real-world tasks on fine-grained change detection of cultural heritages. We also validate the generality of our approach to non-Lambertian scenes.

preprint2020arXiv

Cell-Free Satellite-UAV Networks for 6G Wide-Area Internet of Things

In fifth generation (5G) and beyond Internet of Things (IoT), it becomes increasingly important to serve a massive number of IoT devices outside the coverage of terrestrial cellular networks. Due to their own limitations, unmanned aerial vehicles (UAVs) and satellites need to coordinate with each other in the coverage holes of 5G, leading to a cognitive satellite-UAV network (CSUN). In this paper, we investigate multi-domain resource allocation for CSUNs consisting of a satellite and a swarm of UAVs, so as to improve the efficiency of massive access in wide areas. Particularly, the cell-free on-demand coverage is established to overcome the cost-ineffectiveness of conventional cellular architecture. Opportunistic spectrum sharing is also implemented to cope with the spectrum scarcity problem. To this end, a process-oriented optimization framework is proposed for jointly allocating subchannels, transmit power and hovering times, which considers the whole flight process of UAVs and uses only the slowly-varying large-scale channel state information (CSI). Under the on-board energy constraints of UAVs and interference temperature constraints from UAV swarm to satellite users, we present iterative multi-domain resource allocation algorithms to improve network efficiency with guaranteed user fairness. Simulation results demonstrate the superiority of the proposed algorithms. Moreover, the adaptive cell-free coverage pattern is observed, which implies a promising way to efficiently serve wide-area IoT devices in the upcoming sixth generation (6G) era.

preprint2020arXiv

Creating Efficient Blockchains for the Internet of Things by Coordinated Satellite-Terrestrial Networks

Blockchain has emerged as a promising technology that can guarantee data consistency and integrity among distributed participants. It has been used in many applications of the Internet of Things (IoT). However, since IoT applications often introduce a massive number of devices into blockchain systems, the efficiency of the blockchain becomes a serious problem. In this article, we analyze the key factors affecting the efficiency of blockchain. Unlike most existing solutions that handle this from the computing perspective, we consider the problem from the communication perspective. Particularly, we propose a coordinated satellite-terrestrial network to create efficient blockchains. We also derive a network scheduling strategy for the proposed architecture. Simulation results demonstrate that the proposed system can support blockchains for higher efficiency. Moreover, several open research issues and design challenges will be discussed.

preprint2020arXiv

DeepRhythm: Exposing DeepFakes with Attentional Visual Heartbeat Rhythms

As the GAN-based face image and video generation techniques, widely known as DeepFakes, have become more and more matured and realistic, there comes a pressing and urgent demand for effective DeepFakes detectors. Motivated by the fact that remote visual photoplethysmography (PPG) is made possible by monitoring the minuscule periodic changes of skin color due to blood pumping through the face, we conjecture that normal heartbeat rhythms found in the real face videos will be disrupted or even entirely broken in a DeepFake video, making it a potentially powerful indicator for DeepFake detection. In this work, we propose DeepRhythm, a DeepFake detection technique that exposes DeepFakes by monitoring the heartbeat rhythms. DeepRhythm utilizes dual-spatial-temporal attention to adapt to dynamically changing face and fake types. Extensive experiments on FaceForensics++ and DFDC-preview datasets have confirmed our conjecture and demonstrated not only the effectiveness, but also the generalization capability of \emph{DeepRhythm} over different datasets by various DeepFakes generation techniques and multifarious challenging degradations.

preprint2020arXiv

Dynamically Pruned Message Passing Networks for Large-Scale Knowledge Graph Reasoning

We propose Dynamically Pruned Message Passing Networks (DPMPN) for large-scale knowledge graph reasoning. In contrast to existing models, embedding-based or path-based, we learn an input-dependent subgraph to explicitly model reasoning process. Subgraphs are dynamically constructed and expanded by applying graphical attention mechanism conditioned on input queries. In this way, we not only construct graph-structured explanations but also enable message passing designed in Graph Neural Networks (GNNs) to scale with graph sizes. We take the inspiration from the consciousness prior proposed by and develop a two-GNN framework to simultaneously encode input-agnostic full graph representation and learn input-dependent local one coordinated by an attention module. Experiments demonstrate the reasoning capability of our model that is to provide clear graphical explanations as well as deliver accurate predictions, outperforming most state-of-the-art methods in knowledge base completion tasks.

preprint2020arXiv

EfficientDeRain: Learning Pixel-wise Dilation Filtering for High-Efficiency Single-Image Deraining

Single-image deraining is rather challenging due to the unknown rain model. Existing methods often make specific assumptions of the rain model, which can hardly cover many diverse circumstances in the real world, making them have to employ complex optimization or progressive refinement. This, however, significantly affects these methods' efficiency and effectiveness for many efficiency-critical applications. To fill this gap, in this paper, we regard the single-image deraining as a general image-enhancing problem and originally propose a model-free deraining method, i.e., EfficientDeRain, which is able to process a rainy image within 10~ms (i.e., around 6~ms on average), over 80 times faster than the state-of-the-art method (i.e., RCDNet), while achieving similar de-rain effects. We first propose the novel pixel-wise dilation filtering. In particular, a rainy image is filtered with the pixel-wise kernels estimated from a kernel prediction network, by which suitable multi-scale kernels for each pixel can be efficiently predicted. Then, to eliminate the gap between synthetic and real data, we further propose an effective data augmentation method (i.e., RainMix) that helps to train network for real rainy image handling.We perform comprehensive evaluation on both synthetic and real-world rainy datasets to demonstrate the effectiveness and efficiency of our method. We release the model and code in https://github.com/tsingqguo/efficientderain.git.

preprint2020arXiv

Enabling 5G on the Ocean: A Hybrid Satellite-UAV-Terrestrial Network Solution

Current fifth generation (5G) cellular networks mainly focus on the terrestrial scenario. Due to the difficulty of deploying communications infrastructure on the ocean, the performance of existing maritime communication networks (MCNs) is far behind 5G. This problem can be solved by using unmanned aerial vehicles (UAVs) as agile aerial platforms to enable on-demand maritime coverage, as a supplement to marine satellites and shore-based terrestrial based stations (TBSs). In this paper, we study the integration of UAVs with existing MCNs, and investigate the potential gains of hybrid satellite-UAV-terrestrial networks for maritime coverage. Unlike the terrestrial scenario, vessels on the ocean keep to sea lanes and are sparsely distributed. This provides new opportunities to ease the scheduling of UAVs. Also, new challenges arise due to the more complicated maritime prorogation environment, as well as the mutual interference between UAVs and existing satellites/TBSs. We discuss these issues and show possible solutions considering practical constraints.

preprint2020arXiv

Energy-Aware Offloading in Time-Sensitive Networks with Mobile Edge Computing

Mobile Edge Computing (MEC) enables rich services in close proximity to the end users to provide high quality of experience (QoE) and contributes to energy conservation compared with local computing, but results in increased communication latency. In this paper, we investigate how to jointly optimize task offloading and resource allocation to minimize the energy consumption in an orthogonal frequency division multiple access-based MEC networks, where the time-sensitive tasks can be processed at both local users and MEC server via partial offloading. Since the optimization variables of the problem are strongly coupled, we first decompose the orignal problem into three subproblems named as offloading selection (PO ), transmission power optimization (PT ), and subcarriers and computing resource allocation (PS ), and then propose an iterative algorithm to deal with them in a sequence. To be specific, we derive the closed-form solution for PO , employ the equivalent parametric convex programming to cope with the objective function which is in the form of sum of ratios in PT , and deal with PS by an alternating way in the dual domain due to its NP-hardness. Simulation results demonstrate that the proposed algorithm outperforms the existing schemes.

preprint2020arXiv

Kondo scenario of the γ-α phase transition in single crystalline Cerium thin films

The physical mechanism driving the $γ$-$α$ phase transition of face-centre-cubic (fcc) cerium (Ce) remains controversial until now. In this work, high quality single crystalline fcc-Ce thin films were grown on Graphene/6$H$-SiC(0001) substrate, and explored by XRD and ARPES measurement. XRD spectra showed a clear $γ$-$α$ phase transition at $T_{γ-α}\approx$ 50 K, which is retarded by strain effect from substrate comparing with $T_{γ-α}$ (about 140 K) of the bulk Ce metal. However, APRES spectra did not show any signature of $α$-phase emerging in the surface-layer from 300 K to 17 K, which implied that $α$-phase might form at the bulk-layer of our Ce thin films. Besides, an evident Kondo dip near Fermi energy was observed in the APRES spectrum at 80 K, indicting the formation of Kondo singlet states in $γ$-Ce. Furthermore, the DFT+DMFT calculations were performed to simulate the electronic structures and the theoretical spectral functions agreed well with the experimental ARPES spectra. In $γ$-Ce, the behavior of the self-energy's imaginary part at low frequency not only confirmed that the Kondo singlet states emerged at $T_{\rm KS} \geq 80$ K, but also implied that they became coherent states at a lower characteristic temperature ($T_{\rm coh}\sim 40$ K) due to the indirect RKKY interaction among $f$-$f$ electrons. Besides, $T_{\rm coh}$ from the theoretical simulation was close to $T_{γ-α}$ from the XRD spectra. These issues suggested that the Kondo scenario might play an important role in the $γ$-$α$ phase transition of cerium thin films.

preprint2020arXiv

Modeling Cross-view Interaction Consistency for Paired Egocentric Interaction Recognition

With the development of Augmented Reality (AR), egocentric action recognition (EAR) plays important role in accurately understanding demands from the user. However, EAR is designed to help recognize human-machine interaction in single egocentric view, thus difficult to capture interactions between two face-to-face AR users. Paired egocentric interaction recognition (PEIR) is the task to collaboratively recognize the interactions between two persons with the videos in their corresponding views. Unfortunately, existing PEIR methods always directly use linear decision function to fuse the features extracted from two corresponding egocentric videos, which ignore consistency of interaction in paired egocentric videos. The consistency of interactions in paired videos, and features extracted from them are correlated to each other. On top of that, we propose to build the relevance between two views using biliear pooling, which capture the consistency of two views in feature-level. Specifically, each neuron in the feature maps from one view connects to the neurons from another view, which guarantee the compact consistency between two views. Then all possible paired neurons are used for PEIR for the inside consistent information of them. To be efficient, we use compact bilinear pooling with Count Sketch to avoid directly computing outer product in bilinear. Experimental results on dataset PEV shows the superiority of the proposed methods on the task PEIR.

preprint2020arXiv

Multilayer InSe-Te van der Waals heterostructures with ultrahigh rectification ratio and ultrasensitive photoresponse

Multilayer van der Waals (vdWs) semiconductors have great promising application in high-performance optoelectronic devices. However, the photoconductive photodetectors based on layered semiconductors often suffer from large dark current and high external driven bias voltage. Here, we report a vertical van der Waals heterostructures (vdWHs) consisting of multilayer indium selenide (InSe) and tellurium (Te). The multilayer InSe-Te vdWHs device shows a record high forward rectification ratio greater than 107 at room temperature. Furthermore, an ultrasensitive and broadband photoresponse photodetector is achieved by the vdWHs device with an ultrahigh photo/dark current ratio over 104, a high detectivity of 1013, and a comparable responsivity of 0.45 A/W under visible light illumination with weak incident power. Moreover, the vdWHs device has a photovoltaic effect and can function as a self-powered photodetector (SPPD). The SPPD is also ultrasensitive to the broadband spectra ranging from 300 nm to 1000 nm and is capable of detecting weak light signals. This work offers an opportunity to develop next-generation electronic and optoelectronic devices based on multilayer vdWs structures.

preprint2020arXiv

Multistage Robust Mixed-Integer Optimization Under Endogenous Uncertainty

Endogenous, i.e. decision-dependent, uncertainty has received increased interest in the stochastic programming community. In the robust optimization context, however, it has rarely been considered. This work addresses multistage robust mixed-integer optimization with decision-dependent uncertainty sets. The proposed framework allows us to consider both continuous and integer recourse, including recourse decisions that affect the uncertainty set. We derive a tractable reformulation of the problem by leveraging recent advances in the construction of nonlinear decision rules, and introduce discontinuous piecewise linear decision rules for continuous recourse. Computational experiments are performed to gain insights on the impact of endogenous uncertainty, the benefit of discrete recourse, and computational performance. Our results indicate that the level of conservatism in the solution can be significantly reduced if endogenous uncertainty and mixed-integer recourse are properly modeled.

preprint2020arXiv

MUTATT: Visual-Textual Mutual Guidance for Referring Expression Comprehension

Referring expression comprehension (REC) aims to localize a text-related region in a given image by a referring expression in natural language. Existing methods focus on how to build convincing visual and language representations independently, which may significantly isolate visual and language information. In this paper, we argue that for REC the referring expression and the target region are semantically correlated and subject, location and relationship consistency exist between vision and language.On top of this, we propose a novel approach called MutAtt to construct mutual guidance between vision and language, which treat vision and language equally thus yield compact information matching. Specifically, for each module of subject, location and relationship, MutAtt builds two kinds of attention-based mutual guidance strategies. One strategy is to generate vision-guided language embedding for the sake of matching relevant visual feature. The other reversely generates language-guided visual feature to match relevant language embedding. This mutual guidance strategy can effectively guarantees the vision-language consistency in three modules. Experiments on three popular REC datasets demonstrate that the proposed approach outperforms the current state-of-the-art methods.

preprint2020arXiv

Optimal Beamforming for Hybrid Satellite Terrestrial Networks with Nonlinear PA and Imperfect CSIT

In hybrid satellite-terrestrial networks (HSTNs), spectrum sharing is crucial to alleviate the "spectrum scarcity" problem. Therein, the transmit beams should be carefully designed to mitigate the inter-satellite-terrestrial interference. Different from previous studies, this work considers the impact of both nonlinear power amplifier (PA) and large-scale channel state information at the transmitter (CSIT) on beamforming. These phenomena are usually inevitable in a practical HSTN. Based on the Saleh model of PA nonlinearity and the large-scale multi-beam satellite channel parameters, we formulate a beamforming optimization problem to maximize the achievable rate of the satellite system while ensuring that the inter-satellite-terrestrial interference is below a given threshold. The optimal amplitude and phase of desired beams are derived in a decoupled manner. Simulation results demonstrate the superiority of the proposed beamforming scheme.

preprint2020arXiv

Rethinking Blockchains in the Internet of Things Era from a Wireless Communication Perspective

Due to the rapid development of Internet of Things (IoT), a massive number of devices are connected to the Internet. For these distributed devices in IoT networks, how to ensure their security and privacy becomes a significant challenge. The blockchain technology provides a promising solution to protect the data integrity, provenance, privacy, and consistency for IoT networks. In blockchains, communication is a prerequisite for participants, which are distributed in the system, to reach consensus. However, in IoT networks, most of the devices communicate through wireless links, which are not always reliable. Hence, the communication reliability of IoT devices influences the system security. In this article, we rethink the roles of communication and computing in blockchains by accounting for communication reliability. We analyze the tradeoff between communication reliability and computing power in blockchain security, and present a lower bound to the computing power that is needed to conduct an attack with a given communication reliability. Simulation results show that adversarial nodes can succeed in tampering a block with less computing power by hindering the propagation of blocks from other nodes.

preprint2020arXiv

SPARK: Spatial-aware Online Incremental Attack Against Visual Tracking

Adversarial attacks of deep neural networks have been intensively studied on image, audio, natural language, patch, and pixel classification tasks. Nevertheless, as a typical, while important real-world application, the adversarial attacks of online video object tracking that traces an object's moving trajectory instead of its category are rarely explored. In this paper, we identify a new task for the adversarial attack to visual tracking: online generating imperceptible perturbations that mislead trackers along an incorrect (Untargeted Attack, UA) or specified trajectory (Targeted Attack, TA). To this end, we first propose a \textit{spatial-aware} basic attack by adapting existing attack methods, i.e., FGSM, BIM, and C&W, and comprehensively analyze the attacking performance. We identify that online object tracking poses two new challenges: 1) it is difficult to generate imperceptible perturbations that can transfer across frames, and 2) real-time trackers require the attack to satisfy a certain level of efficiency. To address these challenges, we further propose the spatial-aware online incremental attack (a.k.a. SPARK) that performs spatial-temporal sparse incremental perturbations online and makes the adversarial attack less perceptible. In addition, as an optimization-based method, SPARK quickly converges to very small losses within several iterations by considering historical incremental perturbations, making it much more efficient than basic attacks. The in-depth evaluation on state-of-the-art trackers (i.e., SiamRPN++ with AlexNet, MobileNetv2, and ResNet-50, and SiamDW) on OTB100, VOT2018, UAV123, and LaSOT demonstrates the effectiveness and transferability of SPARK in misleading the trackers under both UA and TA with minor perturbations.

preprint2020arXiv

Synthesizing three-body interaction of spin chirality with superconducting qubits

Superconducting qubits provide a competitive platform for quantum simulation of complex dynamics that lies at the heart of quantum many-body systems, because of the flexibility and scalability afforded by the nature of microfabrication. However, in a multiqubit device, the physical form of couplings between qubits is either an electric (capacitor) or magnetic field (inductor), and the associated quadratic field energy determines that only two-body interaction in the Hamiltonian can be directly realized. Here we propose and experimentally synthesize the three-body spin-chirality interaction in a superconducting circuit based on Floquet engineering. By periodically modulating the resonant frequencies of the qubits connected with each other via capacitors, we can dynamically turn on and off qubit-qubit couplings, and further create chiral flows of the excitations in the three-qubit circular loop. Our result is a step toward engineering dynamical and many-body interactions in multiqubit superconducting devices, which potentially expands the degree of freedom in quantum simulation tasks.

preprint2020arXiv

Trend and forecasting of the COVID-19 outbreak in China

By using the public data from Jan. 20 to Feb. 11, 2020, we perform data-driven analysis and forecasting on the COVID-19 epidemic in mainland China, especially Hubei province. Our results show that the turning points of the daily infections are predicted to be Feb. 6 and Feb. 1, 2020, for Hubei and China other than Hubei, respectively. The epidemic in China is predicted to end up after Mar. 10, 2020, and the number of the total infections are predicted to be 51600. The data trends reveal that quick and active strategies taken by China to reduce human exposure have already had a good impact on the control of the epidemic.

preprint2019arXiv

Experimental Evidence of the Topological Surface States in Mg3Bi2 Films Grown by Molecular Beam Epitaxy

Type-II nodal line semimetal (NLS) is a new quantum state hosting one-dimensional closed loops formed by the crossing of two bands which have the same sign in their slopes along the radial direction of the loop. According to the theoretical prediction, Mg3Bi2 is an ideal candidate for studying the type-II NLS by tuning its spin-orbit coupling (SOC). In this paper, high quality Mg3Bi2 films are grown by molecular beam epitaxy (MBE). By in-situ angle resolved photoemission spectroscopy (ARPES), a pair of surface resonance bands (SRBs) around Gamma point is clearly seen. It shows that Mg3Bi2 films grown by MBE is Mg(1)-terminated by comparing the ARPES data with the first principles calculations results. And, the temperature dependent weak anti-localization (WAL) effect in Mg3Bi2 films is observed under low magnetic field, which shows a clear two dimensional (2D) e-e scattering characteristics by fitting with the Hikami-Larkin-Nagaoka (HLN) model. Combining with ARPES, magneto-transport measurements and the first principles calculations, this work proves that Mg3Bi2 is a semimetal with topological surface states TSSs, which paves the way for Mg3Bi2 as an ideal materials platform for studying the exotic features of type-II nodal line semimetals (NLSs) and the topological phase transition by tuning its SOC.

preprint2019arXiv

Fast Color-guided Depth Denoising for RGB-D Images by Graph Filtering

Depth images captured by off-the-shelf RGB-D cameras suffer from much stronger noise than color images. In this paper, we propose a method to denoise the depth images in RGB-D images by color-guided graph filtering. Our iterative method contains two components: color-guided similarity graph construction, and graph filtering on the depth signal. Implemented in graph vertex domain, filtering is accelerated as computation only occurs among neighboring vertices. Experimental results show that our method outperforms state-of-art depth image denoising methods significantly both on quality and efficiency.

preprint2019arXiv

Generation and controllable switching of superradiant and subradiant states in a 10-qubit superconducting circuit

Superradiance and subradiance concerning enhanced and inhibited collective radiation of an ensemble of atoms have been a central topic in quantum optics. However, precise generation and control of these states remain challenging. Here we deterministically generate up to 10-qubit superradiant and 8-qubit subradiant states, each containing a single excitation, in a superconducting quantum circuit with multiple qubits interconnected by a cavity resonator. The $\sqrt{N}$-scaling enhancement of the coupling strength between the superradiant states and the cavity is validated. By applying appropriate phase gate on each qubit, we are able to switch the single collective excitation between superradiant and subradiant states. While the subradiant states containing a single excitation are forbidden from emitting photons, we demonstrate that they can still absorb photons from the resonator. However, for even number of qubits, a singlet state with half of the qubits being excited can neither emit nor absorb photons, which is verified with 4 qubits. This study is a step forward in coherent control of collective radiation and has promising applications in quantum information processing.

preprint2019arXiv

Maritime Coverage Enhancement Using UAVs Coordinated with Hybrid Satellite-Terrestrial Networks

Due to its agile maneuverability, unmanned aerial vehicles (UAVs) have shown great promise for ondemand communications. In practice, UAV-aided aerial base stations are not separate. Instead, they rely on existing satellites/terrestrial systems for spectrum sharing and efficient backhaul. In this case, how to coordinate satellites, UAVs and terrestrial systems is still an open issue. In this paper, we deploy UAVs for coverage enhancement of a hybrid satellite-terrestrial maritime communication network. Under the typical composite channel model including both large-scale and small-scale fading, the UAV trajectory and in-flight transmit power are jointly optimized, subject to constraints on UAV kinematics, tolerable interference, backhaul, and the total energy of UAV for communications. Different from existing studies, only the location-dependent large-scale channel state information (CSI) is assumed available, because it is difficult to obtain the small-scale CSI before takeoff in practice, and the ship positions can be obtained via the dedicated maritime Automatic Identification System. The optimization problem is non-convex. We solve it by problem decomposition, successive convex optimization and bisection searching tools. Simulation results demonstrate that the UAV fits well with existing satellite and terrestrial systems, using the proposed optimization framework.

preprint2017arXiv

When mmWave Communications Meet Network Densification: A Scalable Interference Coordination Perspective

The millimeter-wave (mmWave) communication is envisioned to provide orders of magnitude capacity improvement. However, it is challenging to realize a sufficient link margin due to high path loss and blockages. To address this difficulty, in this paper, we explore the potential gain of ultra-densification for enhancing mmWave communications from a network-level perspective. By deploying the mmWave base stations (BSs) in an extremely dense and amorphous fashion, the access distance is reduced and the choice of serving BSs is enriched for each user, which are intuitively effective for mitigating the propagation loss and blockages. Nevertheless, co-channel interference under this model will become a performance-limiting factor. To solve this problem, we propose a large-scale channel state information (CSI) based interference coordination approach. Note that the large-scale CSI is highly location-dependent, and can be obtained with a quite low cost. Thus, the scalability of the proposed coordination framework can be guaranteed. Particularly, using only the large-scale CSI of interference links, a coordinated frequency resource block allocation problem is formulated for maximizing the minimum achievable rate of the users, which is uncovered to be a NP-hard integer programming problem. To circumvent this difficulty, a greedy scheme with polynomial-time complexity is proposed by adopting the bisection method and linear integer programming tools. Simulation results demonstrate that the proposed coordination scheme based on large-scale CSI only can still offer substantial gains over the existing methods. Moreover, although the proposed scheme is only guaranteed to converge to a local optimum, it performs well in terms of both user fairness and system efficiency.