arXiv subjects

Shuai Wang

Publications and source records attributed to Shuai Wang.

At least 631 records · Page 35Linked to original sources

arXiv2022

Language-aware Domain Generalization Network for Cross-Scene Hyperspectral Image Classification

Text information including extensive prior knowledge about land cover classes has been ignored in hyperspectral image classification (HSI) tasks. It is necessary to explore the effectiveness of linguistic mode in assisting HSI classification. In addition, the large-scale pre-training image-text foundation models have demonstrated great performance in a variety of downstream applications, including zero-shot transfer. However, most domain generalization methods have never addressed mining linguistic modal knowledge to improve the generalization performance of model. To compensate for the inadequacies listed above, a Language-aware Domain Generalization Network (LDGnet) is proposed to learn cross-domain invariant representation from cross-domain shared prior knowledge. The proposed method only trains on the source domain (SD) and then transfers the model to the target domain (TD). The dual-stream architecture including image encoder and text encoder is used to extract visual and linguistic features, in which coarse-grained and fine-grained text representations are designed to extract two levels of linguistic features. Furthermore, linguistic features are used as cross-domain shared semantic space, and visual-linguistic alignment is completed by supervised contrastive learning in semantic space. Extensive experiments on three datasets demonstrate the superiority of the proposed method when compared with state-of-the-art techniques.

cs.CV↗

arXiv2022

Revisiting the definition of rapid intensification of tropical cyclones by clustering the initial intensity and inner-core size

Rapid intensification (RI) of tropical cyclones (TCs) provides a great challenge in operational forecasting and contributes significantly to the development of major TCs. RI is commonly defined as an increase in the maximum sustained surface wind speed beyond a certain threshold within 24 h. The most widely used threshold is 30 kt (15.4 m/s), which was determined statistically. Here we propose a new definition for RI by objectively clustering TCs using the intensification rate, initial intensity, and radius of the maximum wind speed. A group of 770 samples is separated at a threshold of 45 kt (23.2 m/s). The threshold is 40 kt (20.6 m/s) for the western North Atlantic, where TC size measurements are more reliable. Monte Carlo experiments demonstrate that the proposed threshold is robust even considering the uncertainty in RMW of as high as 30 km. We show that, when a TC undergoes RI, its maximum wind speed is approximately 60+/-15 kt (30.9+/-7.7 m/s) and the radius of the maximum wind speed is 45+/-20 km. The new threshold outperforms the conventional threshold of 30 kt/24h in (1) describing the bimodal distribution of lifetime maximum intensity, and (2) explaining the annual count of Category 5 TCs. This new definition provides a more physically-based threshold and describes a more reliable representation to the extreme events. Although more comparisons are needed for operational application, it is likely to be desirable for process-based case studies, and could provide a more valuable metric for TC intensification classification and research.

physics.ao-ph↗

arXiv2022

Transition from multiphoton to tunneling ionization in the process of high harmonic generation in solids

High harmonic generation in solids is becoming an important method for strong field solid state physics research. The power scale relationship between high harmonics and the driving laser is investigated both experimentally and theoretically. Results of the power scale dependence clearly divided the interaction into two regimes. The modification of the bandgap by intense laser proved to be very important for theoretically reproducing the experimental result. Combining with the Keldysh theory analysis, the harmonic generation process is found to be transitioned from multiphoton excitations to the diabatic tunneling.

physics.optics↗

arXiv2022

Learning Ball-balancing Robot Through Deep Reinforcement Learning

The ball-balancing robot (ballbot) is a good platform to test the effectiveness of a balancing controller. Considering balancing control, conventional model-based feedback control methods have been widely used. However, contacts and collisions are difficult to model, and often lead to failure in balancing control, especially when the ballbot tilts a large angle. To explore the maximum initial tilting angle of the ballbot, the balancing control is interpreted as a recovery task using Reinforcement Learning (RL). RL is a powerful technique for systems that are difficult to model, because it allows an agent to learn policy by interacting with the environment. In this paper, by combining the conventional feedback controller with the RL method, a compound controller is proposed. We show the effectiveness of the compound controller by training an agent to successfully perform a recovery task involving contacts and collisions. Simulation results demonstrate that using the compound controller, the ballbot can keep balance under a larger set of initial tilting angles, compared to the conventional model-based controller.

cs.RO↗

arXiv2022

Global unique solution for the 3-D full compressible MHD equations in space of lower regularity

In this paper, we establish new $L^p$ gradient estimates of the solutions in order to discuss Cauchy problem for the full compressible magnetohydrodynamic(MHD) systems in $\mathrm{R}^3$. We use the "$\rm{div}-\rm{curl}$" decomposition technique (see \cite{{HJR},{MR}}) and new modified effective viscous flux and vorticity to calculate "$\Vert\nabla \mathbf{u}\Vert_{L^3}$" and "$\Vert\nabla \mathbb{H}\Vert_{L^3}$".As a result, we obtain global well-posedness for the solution with the initial data being in a class of space with lower regularity, while the energy of which should be suitably small.

math.AP↗

arXiv2022

Longitudinal Prediction of Postnatal Brain Magnetic Resonance Images via a Metamorphic Generative Adversarial Network

Missing scans are inevitable in longitudinal studies due to either subject dropouts or failed scans. In this paper, we propose a deep learning framework to predict missing scans from acquired scans, catering to longitudinal infant studies. Prediction of infant brain MRI is challenging owing to the rapid contrast and structural changes particularly during the first year of life. We introduce a trustworthy metamorphic generative adversarial network (MGAN) for translating infant brain MRI from one time-point to another. MGAN has three key features: (i) Image translation leveraging spatial and frequency information for detail-preserving mapping; (ii) Quality-guided learning strategy that focuses attention on challenging regions. (iii) Multi-scale hybrid loss function that improves translation of tissue contrast and structural details. Experimental results indicate that MGAN outperforms existing GANs by accurately predicting both contrast and anatomical details.

eess.IV↗

arXiv2022

Tunable two-dimensional superconductivity and spin-orbit coupling at the EuO/KTaO3(110) interface

Unconventional quantum states, most notably the two-dimensional (2D) superconductivity, have been realized at the interfaces of oxide heterostructures where they can be effectively tuned by the gate voltage ($V_G$). Here we report that the interface between high-quality EuO (111) thin film and KTaO3 (KTO) (110) substrate shows superconductivity with onset transition temperature $T_c^{onset}$ = 1.35 K. The 2D nature of superconductivity is verified by the large anisotropy of the upper critical field and the characteristics of a Berezinskii-Kosterlitz-Thouless transition. By applying $V_G$, $T_c^{onset}$ can be tuned from ~ 1 to 1.7 K; such an enhancement can be possibly associated with a boosted spin-orbit energy $ε_{so}$ = $\hbar$ / $τ_{so}$, where $τ_{so}$ is the spin-orbit relaxation time. Further analysis of $τ_{so}$ based on the upper critical field ($H_{c2}$) and magnetoconductance reveals complex nature of spin-orbit coupling (SOC) at the EuO/KTO(110) interface with different mechanisms dominate the influence of SOC effects for the superconductivity and the magnetotransport in the normal state. Our results demonstrate that the SOC should be considered as an important factor determining the 2D superconductivity at oxide interfaces.

cond-mat.supr-con↗

arXiv2022

Cross Vision-RF Gait Re-identification with Low-cost RGB-D Cameras and mmWave Radars

Human identification is a key requirement for many applications in everyday life, such as personalized services, automatic surveillance, continuous authentication, and contact tracing during pandemics, etc. This work studies the problem of cross-modal human re-identification (ReID), in response to the regular human movements across camera-allowed regions (e.g., streets) and camera-restricted regions (e.g., offices) deployed with heterogeneous sensors. By leveraging the emerging low-cost RGB-D cameras and mmWave radars, we propose the first-of-its-kind vision-RF system for cross-modal multi-person ReID at the same time. Firstly, to address the fundamental inter-modality discrepancy, we propose a novel signature synthesis algorithm based on the observed specular reflection model of a human body. Secondly, an effective cross-modal deep metric learning model is introduced to deal with interference caused by unsynchronized data across radars and cameras. Through extensive experiments in both indoor and outdoor environments, we demonstrate that our proposed system is able to achieve ~92.5% top-1 accuracy and ~97.5% top-5 accuracy out of 56 volunteers. We also show that our proposed system is able to robustly reidentify subjects even when multiple subjects are present in the sensors' field of view.

cs.CV↗

arXiv2022

Low-complexity Beam Selection algorithms based on SVD for MmWave Massive MIMO Systems

To realize mmWave massive MIMO systems in practice, Beamspace MIMO with beam selection provides an attractive solution at a considerably reduced number of radio frequency (RF) chains. We propose low-complexity beam selection algorithms based on singular value decomposition (SVD). We first diagonalize the channel matrix by SVD, and the appropriate beams are selected one-by-one in a decremental or incremental order based on the criterion of sum-rate maximization. To reduce the complexity of the proposed algorithms significantly, we make use of SVD in the last iteration to aviod SVD from scratch again. Meanwhile, our proposed algorithms naturally obtain the precoding matrix, which can eliminate the multiusers interference. Simulation results demonstrate that our proposed algorithms can outperform the competing algorithms, including the fully digital zero-precoding.

cs.IT↗

arXiv2022

A Framework Based on Generational and Environmental Response Strategies for Dynamic Multi-objective Optimization

Due to the dynamics and uncertainty of the dynamic multi-objective optimization problems (DMOPs), it is difficult for algorithms to find a satisfactory solution set before the next environmental change, especially for some complex environments. One reason may be that the information in the environmental static stage can not be used well in the traditional framework. In this paper, a novel framework based on generational and environmental response strategies (FGERS) is proposed, in which response strategies are run both in the environmental change stage and the environmental static stage to obtain population evolution information of those both stages. Unlike in the traditional framework, response strategies are only run in the environmental change stage. For simplicity, the feed-forward center point strategy was chosen to be the response strategy in the novel dynamic framework (FGERS-CPS). FGERS-CPS is not only to predict change trend of the optimum solution set in the environmental change stage, but to predict the evolution trend of the population after several generations in the environmental static stage. Together with the feed-forward center point strategy, a simple memory strategy and adaptive diversity maintenance strategy were used to form the complete FGERS-CPS. On 13 DMOPs with various characteristics, FGERS-CPS was compared with four classical response strategies in the traditional framework. Experimental results show that FGERS-CPS is effective for DMOPs.

cs.NE↗

arXiv2022

VIP-SLAM: An Efficient Tightly-Coupled RGB-D Visual Inertial Planar SLAM

In this paper, we propose a tightly-coupled SLAM system fused with RGB, Depth, IMU and structured plane information. Traditional sparse points based SLAM systems always maintain a mass of map points to model the environment. Huge number of map points bring us a high computational complexity, making it difficult to be deployed on mobile devices. On the other hand, planes are common structures in man-made environment especially in indoor environments. We usually can use a small number of planes to represent a large scene. So the main purpose of this article is to decrease the high complexity of sparse points based SLAM. We build a lightweight back-end map which consists of a few planes and map points to achieve efficient bundle adjustment (BA) with an equal or better accuracy. We use homography constraints to eliminate the parameters of numerous plane points in the optimization and reduce the complexity of BA. We separate the parameters and measurements in homography and point-to-plane constraints and compress the measurements part to further effectively improve the speed of BA. We also integrate the plane information into the whole system to realize robust planar feature extraction, data association, and global consistent planar reconstruction. Finally, we perform an ablation study and compare our method with similar methods in simulation and real environment data. Our system achieves obvious advantages in accuracy and efficiency. Even if the plane parameters are involved in the optimization, we effectively simplify the back-end map by using planar structures. The global bundle adjustment is nearly 2 times faster than the sparse points based SLAM algorithm.

cs.RO↗

arXiv2022

Toward Ambient Intelligence: Federated Edge Learning with Task-Oriented Sensing, Computation, and Communication Integration

In this paper, we address the problem of joint sensing, computation, and communication (SC$^{2}$) resource allocation for federated edge learning (FEEL) via a concrete case study of human motion recognition based on wireless sensing in ambient intelligence. First, by analyzing the wireless sensing process in human motion recognition, we find that there exists a thresholding value for the sensing transmit power, exceeding which yields sensing data samples with approximately the same satisfactory quality. Then, the joint SC$^{2}$ resource allocation problem is cast to maximize the convergence speed of FEEL, under the constraints on training time, energy supply, and sensing quality of each edge device. Solving this problem entails solving two subproblems in order: the first one reduces to determine the joint sensing and communication resource allocation that maximizes the total number of samples that can be sensed during the entire training process; the second one concerns the partition of the attained total number of sensed samples over all the communication rounds to determine the batch size at each round for convergence speed maximization. The first subproblem on joint sensing and communication resource allocation is converted to a single-variable optimization problem by exploiting the derived relation between different control variables (resources), which thus allows an efficient solution via one-dimensional grid search. For the second subproblem, it is found that the number of samples to be sensed (or batch size) at each round is a decreasing function of the loss function value attained at the round. Based on this relationship, the approximate optimal batch size at each communication round is derived in closed-form as a function of the round index. Finally, extensive simulation results are provided to validate the superiority of the proposed joint SC$^{2}$ resource allocation scheme.

cs.IT↗

arXiv2022

Optimal time decay estimation for large-solution about 3D compressible MHD equations

This paper mainly focus on optimal time decay estimation for large-solution about compressible magnetohydrodynamic equations in 3D whole space, provided that $(σ_{0}-1,u_{0},M_{0})\in L^1\cap H^2$. In [2](Chen et al.,2019), they proved time decay estimation of $\|(σ-1,u,M)\|_{H^1}$ being $(1+t)^{-\frac{3}{4}}$. Based on it, we obtained that of $\|\nabla(σ-1,u,M)\|_{H^1}$ being $(1+t)^{-\frac{5}{4}}$ in [24]. Therefore, we are committed to improving that of $\|\nabla^2 (σ-1,u,M)\|_{L^2}$ in this paper. Thanks to the method adopted in [25] (Wang and Wen, 2021), we get the optimal time decay estimation to the highest-order derivative for space of solution, which means that time decay estimation of $\|\nabla^2 (σ-1,u,M)\|_{L^2}$ is $(1+t)^{-\frac{7}{4}}$.

math.AP↗

arXiv2022

To Interpolate or not to Interpolate: PRF, Dense and Sparse Retrievers

Current pre-trained language model approaches to information retrieval can be broadly divided into two categories: sparse retrievers (to which belong also non-neural approaches such as bag-of-words methods, e.g., BM25) and dense retrievers. Each of these categories appears to capture different characteristics of relevance. Previous work has investigated how relevance signals from sparse retrievers could be combined with those from dense retrievers via interpolation. Such interpolation would generally lead to higher retrieval effectiveness. In this paper we consider the problem of combining the relevance signals from sparse and dense retrievers in the context of Pseudo Relevance Feedback (PRF). This context poses two key challenges: (1) When should interpolation occur: before, after, or both before and after the PRF process? (2) Which sparse representation should be considered: a zero-shot bag-of-words model (BM25), or a learnt sparse representation? To answer these questions we perform a thorough empirical evaluation considering an effective and scalable neural PRF approach (Vector-PRF), three effective dense retrievers (ANCE, TCTv2, DistillBERT), and one state-of-the-art learnt sparse retriever (uniCOIL). The empirical findings from our experiments suggest that, regardless of sparse representation and dense retriever, interpolation both before and after PRF achieves the highest effectiveness across most datasets and metrics.

cs.IR↗

arXiv2022

Phase Shift Design in RIS Empowered Wireless Networks: From Optimization to AI-Based Methods

Reconfigurable intelligent surfaces (RISs) have a revolutionary capability to customize the radio propagation environment for wireless networks. To fully exploit the advantages of RISs in wireless systems, the phases of the reflecting elements must be jointly designed with conventional communication resources, such as beamformers, transmit power, and computation time. However, due to the unique constraints on the phase shift, and massive numbers of reflecting units and users in large-scale networks, the resulting optimization problems are challenging to solve. This paper provides a review of current optimization methods and artificial intelligence-based methods for handling the constraints imposed by RIS and compares them in terms of solution quality and computational complexity. Future challenges in phase shift optimization involving RISs are also described and potential solutions are discussed.

cs.LG↗

arXiv2022

Federated Stochastic Primal-dual Learning with Differential Privacy

Federated learning (FL) is a new paradigm that enables many clients to jointly train a machine learning (ML) model under the orchestration of a parameter server while keeping the local data not being exposed to any third party. However, the training of FL is an interactive process between local clients and the parameter server. Such process would cause privacy leakage since adversaries may retrieve sensitive information by analyzing the overheard messages. In this paper, we propose a new federated stochastic primal-dual algorithm with differential privacy (FedSPD-DP). Compared to the existing methods, the proposed FedSPD-DP incorporates local stochastic gradient descent (local SGD) and partial client participation (PCP) for addressing the issues of communication efficiency and straggler effects due to randomly accessed clients. Our analysis shows that the data sampling strategy and PCP can enhance the data privacy whereas the larger number of local SGD steps could increase privacy leakage, revealing a non-trivial tradeoff between algorithm communication efficiency and privacy protection. Specifically, we show that, by guaranteeing $(ε, δ)$-DP for each client per communication round, the proposed algorithm guarantees $(\mathcal{O}(qε\sqrt{p T}), δ)$-DP after $T$ communication rounds while maintaining an $\mathcal{O}(1/\sqrt{pTQ})$ convergence rate for a convex and non-smooth learning problem, where $Q$ is the number of local SGD steps, $p$ is the client sampling probability, $q=\max_{i} q_i/\sqrt{1-q_i}$ and $q_i$ is the data sampling probability of each client under PCP. Experiment results are presented to evaluate the practical performance of the proposed algorithm and comparison with state-of-the-art methods.

cs.LG↗

arXiv2022

From Little Things Big Things Grow: A Collection with Seed Studies for Medical Systematic Review Literature Search

Medical systematic review query formulation is a highly complex task done by trained information specialists. Complexity comes from the reliance on lengthy Boolean queries, which express a detailed research question. To aid query formulation, information specialists use a set of exemplar documents, called `seed studies', prior to query formulation. Seed studies help verify the effectiveness of a query prior to the full assessment of retrieved studies. Beyond this use of seeds, specific IR methods can exploit seed studies for guiding both automatic query formulation and new retrieval models. One major limitation of work to date is that these methods exploit `pseudo seed studies' through retrospective use of included studies (i.e., relevance assessments). However, we show pseudo seed studies are not representative of real seed studies used by information specialists. Hence, we provide a test collection with real world seed studies used to assist with the formulation of queries. To support our collection, we provide an analysis, previously not possible, on how seed studies impact retrieval and perform several experiments using seed-study based methods to compare the effectiveness of using seed studies versus pseudo seed studies. We make our test collection and the results of all of our experiments and analysis available at http://github.com/ielab/sysrev-seed-collection

cs.IR↗

arXiv2022

Unleashing the Power of Compiler Intermediate Representation to Enhance Neural Program Embeddings

Neural program embeddings have demonstrated considerable promise in a range of program analysis tasks, including clone identification, program repair, code completion, and program synthesis. However, most existing methods generate neural program embeddings directly from the program source codes, by learning from features such as tokens, abstract syntax trees, and control flow graphs. This paper takes a fresh look at how to improve program embeddings by leveraging compiler intermediate representation (IR). We first demonstrate simple yet highly effective methods for enhancing embedding quality by training embedding models alongside source code and LLVM IR generated by default optimization levels (e.g., -O2). We then introduce IRGen, a framework based on genetic algorithms (GA), to identify (near-)optimal sequences of optimization flags that can significantly improve embedding quality.

cs.SE↗