arXiv subjects

Jun Li

Publications and source records attributed to Jun Li.

At least 523 records · Page 29Linked to original sources

arXiv2022

A Novel Approach for Exploring the Light Traveling Path in the Medium with a Spherically Symmetric Refractive Index

A unique perspective approach based on an analogy method is presented to solve the ray equation in a model of a continuous inhomogeneous medium, which has a spherically symmetric distribution. Basically, in the standard undergraduate physics teaching, the curved ray path caused by refraction in a medium with a continuously varying refractive index has always been a relatively difficult problem to solve. The equation is usually expressed in terms of partial differential equations (PDEs), which cannot be solved by analytical methods. Based on the analogy method, this work proposes the correspondence between ray refraction in an established medium model and the inverse-square central force system, succinctly obtaining their relation equations mathematically. We also verify the correctness of the method by qualitative and quantitative analysis. In terms of theoretical validation, we analyse the relation between Fermat's principle and Hamilton's principle, which lays a theoretical foundation for the analogy method. In addition, ray paths in the medium model were also simulated by numerical calculations based on COMSOL Multiphysics, and the results are in perfect agreement with the conclusions.

physics.optics↗

arXiv2022

Symplectic Torelli groups of rational surfaces

We call a symplectic rational surface $(X,ω)$ \textit{positive} if $c_1(X)\cdot[ω]>0$. The positivity condition of a rational surface is equivalent to the existence of a divisor $D\subset X$, such that $(X, D)$ is a log Calabi-Yau surface. The cohomology class of a symplectic form can be endowed with a \textit{type} using the root system associated to its Lagrangian spherical classes. In this paper, we prove that the symplectic Torelli group of a positive rational surface is trivial if it is of type $\mathbb{A}$, and is a sphere braid group if it is of type $\mathbb{D}$. As an application, we answer affirmatively a long-term open question that Lagrangian spherical Dehn twists generate the symplectic Torelli group $Symp_h(X)$ when $X$ is a positive rational surface. We also prove that all symplectic toric surfaces have trivial symplectic Torelli groups. Lastly, we verify that Chiang-Kessler's symplectic involution is Hamiltonian, answering a question of Kedra positively. Our key new input is the recent study of almost complex subvarieties due to Li-Zhang and Zhang. Inspired by these works, we define a new \textit{coarse stratification} for the almost complex structures for positive rational surfaces. We also combined symplectic field theory and the parametrized Gromov-Witten theories for our applications.

math.SG↗

arXiv2022

Coupled Modeling and Fusion Control for a Multi-modal Deformable Land-air Robot

A deformable land-air robot is introduced with excellent driving and flying capabilities, offering a smooth switching mechanism between the two modes. An elaborate coupled dynamics model is established for the robot, including rotors, chassis, suspension, and the deformable structure. In addition, a model-based controller is designed for landing and mode switching in various unstructured conditions, such as slopes and curved surface. And considering locomotion and complex near-ground situations to achieve cooperation between the two fused modalities. This system was simulated in ADAMS/Simulink and a tested with hardware-in-the-loop system was constructed for testing in various slopes. With a designed controller, the results showed the robot is capable of fast and smooth land-air switching, with a 24.6 % faster landing on slopes. The controller can also reduce landing offset and impact force more effectively than the normal control method at 32.7 % and 34.3 %, respectively.

cs.RO↗

arXiv2022

Transforming medical imaging with Transformers? A comparative review of key properties, current progresses, and future perspectives

Transformer, the latest technological advance of deep learning, has gained prevalence in natural language processing or computer vision. Since medical imaging bear some resemblance to computer vision, it is natural to inquire about the status quo of Transformers in medical imaging and ask the question: can the Transformer models transform medical imaging? In this paper, we attempt to make a response to the inquiry. After a brief introduction of the fundamentals of Transformers, especially in comparison with convolutional neural networks (CNNs), and highlighting key defining properties that characterize the Transformers, we offer a comprehensive review of the state-of-the-art Transformer-based approaches for medical imaging and exhibit current research progresses made in the areas of medical image segmentation, recognition, detection, registration, reconstruction, enhancement, etc. In particular, what distinguishes our review lies in its organization based on the Transformer's key defining properties, which are mostly derived from comparing the Transformer and CNN, and its type of architecture, which specifies the manner in which the Transformer and CNN are combined, all helping the readers to best understand the rationale behind the reviewed approaches. We conclude with discussions of future perspectives.

cs.CV↗

arXiv2022

DesNet: Decomposed Scale-Consistent Network for Unsupervised Depth Completion

Unsupervised depth completion aims to recover dense depth from the sparse one without using the ground-truth annotation. Although depth measurement obtained from LiDAR is usually sparse, it contains valid and real distance information, i.e., scale-consistent absolute depth values. Meanwhile, scale-agnostic counterparts seek to estimate relative depth and have achieved impressive performance. To leverage both the inherent characteristics, we thus suggest to model scale-consistent depth upon unsupervised scale-agnostic frameworks. Specifically, we propose the decomposed scale-consistent learning (DSCL) strategy, which disintegrates the absolute depth into relative depth prediction and global scale estimation, contributing to individual learning benefits. But unfortunately, most existing unsupervised scale-agnostic frameworks heavily suffer from depth holes due to the extremely sparse depth input and weak supervised signal. To tackle this issue, we introduce the global depth guidance (GDG) module, which attentively propagates dense depth reference into the sparse target via novel dense-to-sparse attention. Extensive experiments show the superiority of our method on outdoor KITTI benchmark, ranking 1st and outperforming the best KBNet more than 12% in RMSE. In addition, our approach achieves state-of-the-art performance on indoor NYUv2 dataset.

cs.CV↗

arXiv2022

Information-guided pixel augmentation for pixel-wise contrastive learning

Contrastive learning (CL) is a form of self-supervised learning and has been widely used for various tasks. Different from widely studied instance-level contrastive learning, pixel-wise contrastive learning mainly helps with pixel-wise tasks such as medical landmark detection. The counterpart to an instance in instance-level CL is a pixel, along with its neighboring context, in pixel-wise CL. Aiming to build better feature representation, there is a vast literature about designing instance augmentation strategies for instance-level CL; but there is little similar work on pixel augmentation for pixel-wise CL with a pixel granularity. In this paper, we attempt to bridge this gap. We first classify a pixel into three categories, namely low-, medium-, and high-informative, based on the information quantity the pixel contains. Inspired by the ``InfoMin" principle, we then design separate augmentation strategies for each category in terms of augmentation intensity and sampling ratio. Extensive experiments validate that our information-guided pixel augmentation strategy succeeds in encoding more discriminative representations and surpassing other competitive approaches in unsupervised local feature matching. Furthermore, our pretrained model improves the performance of both one-shot and fully supervised models. To the best of our knowledge, we are the first to propose a pixel augmentation method with a pixel granularity for enhancing unsupervised pixel-wise contrastive learning.

cs.CV↗

arXiv2022

Staged cooling of a fusion-grade plasma in a tokamak thermal quench

In tokamak disruptions where the magnetic connection length becomes comparable to or even shorter than the plasma mean-free-path, parallel transport can dominate the energy loss and the thermal quench of the core plasma goes through four phases (stages) that have distinct temperature ranges and durations. The main temperature drop occurs while the core plasma remains nearly collisionless, with the parallel electron temperature $T_{e\parallel}$ dropping in time $t$ as $T_{e\parallel}\propto t^{-2}$ and a cooling time that scales with the ion sound wave transit time over the length of the open magnetic field line. These surprising physics scalings are the result of effective suppression of parallel electron thermal conduction in an otherwise bounded collisionless plasma, which is fundamentally different from what are known to date on electron thermal conduction along the magnetic field in a nearly collisionless plasma.

physics.plasm-ph↗

arXiv2022

PeSOTIF: a Challenging Visual Dataset for Perception SOTIF Problems in Long-tail Traffic Scenarios

Perception algorithms in autonomous driving systems confront great challenges in long-tail traffic scenarios, where the problems of Safety of the Intended Functionality (SOTIF) could be triggered by the algorithm performance insufficiencies and dynamic operational environment. However, such scenarios are not systematically included in current open-source datasets, and this paper fills the gap accordingly. Based on the analysis and enumeration of trigger conditions, a high-quality diverse dataset is released, including various long-tail traffic scenarios collected from multiple resources. Considering the development of probabilistic object detection (POD), this dataset marks trigger sources that may cause perception SOTIF problems in the scenarios as key objects. In addition, an evaluation protocol is suggested to verify the effectiveness of POD algorithms in identifying the key objects via uncertainty. The dataset never stops expanding, and the first batch of open-source data includes 1126 frames with an average of 2.27 key objects and 2.47 normal objects in each frame. To demonstrate how to use this dataset for SOTIF research, this paper further quantifies the perception SOTIF entropy to confirm whether a scenario is unknown and unsafe for a perception system. The experimental results show that the quantified entropy can effectively and efficiently reflect the failure of the perception algorithm.

cs.CV↗

arXiv2022

Decentralized Federated Reinforcement Learning for User-Centric Dynamic TFDD Control

The explosive growth of dynamic and heterogeneous data traffic brings great challenges for 5G and beyond mobile networks. To enhance the network capacity and reliability, we propose a learning-based dynamic time-frequency division duplexing (D-TFDD) scheme that adaptively allocates the uplink and downlink time-frequency resources of base stations (BSs) to meet the asymmetric and heterogeneous traffic demands while alleviating the inter-cell interference. We formulate the problem as a decentralized partially observable Markov decision process (Dec-POMDP) that maximizes the long-term expected sum rate under the users' packet dropping ratio constraints. In order to jointly optimize the global resources in a decentralized manner, we propose a federated reinforcement learning (RL) algorithm named federated Wolpertinger deep deterministic policy gradient (FWDDPG) algorithm. The BSs decide their local time-frequency configurations through RL algorithms and achieve global training via exchanging local RL models with their neighbors under a decentralized federated learning framework. Specifically, to deal with the large-scale discrete action space of each BS, we adopt a DDPG-based algorithm to generate actions in a continuous space, and then utilize Wolpertinger policy to reduce the mapping errors from continuous action space back to discrete action space. Simulation results demonstrate the superiority of our proposed algorithm to benchmark algorithms with respect to system sum rate.

cs.LG↗

arXiv2022

Blockchain Assisted Federated Learning over Wireless Channels: Dynamic Resource Allocation and Client Scheduling

The blockchain technology has been extensively studied to enable distributed and tamper-proof data processing in federated learning (FL). Most existing blockchain assisted FL (BFL) frameworks have employed a third-party blockchain network to decentralize the model aggregation process. However, decentralized model aggregation is vulnerable to pooling and collusion attacks from the third-party blockchain network. Driven by this issue, we propose a novel BFL framework that features the integration of training and mining at the client side. To optimize the learning performance of FL, we propose to maximize the long-term time average (LTA) training data size under a constraint of LTA energy consumption. To this end, we formulate a joint optimization problem of training client selection and resource allocation (i.e., the transmit power and computation frequency at the client side), and solve the long-term mixed integer non-linear programming based on a Lyapunov technique. In particular, the proposed dynamic resource allocation and client scheduling (DRACS) algorithm can achieve a trade-off of [$\mathcal{O}(1/V)$, $\mathcal{O}(\sqrt{V})$] to balance the maximization of the LTA training data size and the minimization of the LTA energy consumption with a control parameter $V$. Our experimental results show that the proposed DRACS algorithm achieves better learning accuracy than benchmark client scheduling strategies with limited time or energy consumption.

cs.DC↗

arXiv2022

Joint Communication and Trajectory Design for Intelligent Reflecting Surface Empowered UAV SWIPT Networks

Aiming at the limited battery capacity of widely deployed low-power smart devices in the Internet-of-things (IoT), this paper proposes a novel intelligent reflecting surface (IRS) empowered unmanned aerial vehicle (UAV) simultaneous wireless information and power transfer (SWIPT) network framework, in which IRS is used to reconstruct the wireless channel to enhance the wireless energy transmission efficiency and coverage area of the UAV SWIPT networks. In this paper, we formulate an achievable sum-rate maximization problem by jointly optimizing UAV trajectory, successive interference cancellation (SIC) decoding order, UAV transmit power allocation, power splitting (PS) ratio and IRS reflection coefficient while taking account of user non-orthogonal multiple access (NOMA) and a non-linear energy harvesting model. Due to the coupling of optimization variables, this problem is a complex non-convex optimization problem, and it is challenging to solve it directly. We first transform the problem, and then apply the alternating optimization (AO) algorithm framework to divide the transformed problem into four sub-problems to solve it. Specifically, by applying successive convex approximation (SCA), penalty function method and difference-convex (DC) programming, UAV trajectory, SIC decoding order, UAV transmit power allocation, PS ratio and IRS reflection coefficient are alternately optimized until the convergence is achieved. Numerical simulation results verify the effectiveness of our proposed algorithm compared to other algorithms.

eess.SP↗

arXiv2022

Low-latency Federated Learning with DNN Partition in Distributed Industrial IoT Networks

Federated Learning (FL) empowers Industrial Internet of Things (IIoT) with distributed intelligence of industrial automation thanks to its capability of distributed machine learning without any raw data exchange. However, it is rather challenging for lightweight IIoT devices to perform computation-intensive local model training over large-scale deep neural networks (DNNs). Driven by this issue, we develop a communication-computation efficient FL framework for resource-limited IIoT networks that integrates DNN partition technique into the standard FL mechanism, wherein IIoT devices perform local model training over the bottom layers of the objective DNN, and offload the top layers to the edge gateway side. Considering imbalanced data distribution, we derive the device-specific participation rate to involve the devices with better data distribution in more communication rounds. Upon deriving the device-specific participation rate, we propose to minimize the training delay under the constraints of device-specific participation rate, energy consumption and memory usage. To this end, we formulate a joint optimization problem of device scheduling and resource allocation (i.e. DNN partition point, channel assignment, transmit power, and computation frequency), and solve the long-term min-max mixed integer non-linear programming based on the Lyapunov technique. In particular, the proposed dynamic device scheduling and resource allocation (DDSRA) algorithm can achieve a trade-off to balance the training delay minimization and FL performance. We also provide the FL convergence bound for the DDSRA algorithm with both convex and non-convex settings. Experimental results demonstrate the derived device-specific participation rate in terms of feasibility, and show that the DDSRA algorithm outperforms baselines in terms of test accuracy and convergence time.

cs.DC↗

arXiv2022

Improved Quantum Computing with the Higher-order Trotter Decomposition

In designing quantum control, it is generally required to simulate the controlled system evolution with a classical computer. However, computing the time evolution operator can be quite resource-consuming since the total Hamiltonian is often hard to diagonalize. In this paper, we mitigate this issue by substituting the time evolution segments with their Trotter decompositions, which reduces the propagator into a combination of single-qubit operations and fixed-time system evolutions. The resulting procedure can provide substantial speed gain with acceptable costs in the propagator error. As a demonstration, we apply the proposed strategy to improve the efficiency of the gradient ascent pulse engineering algorithm for searching optimal control fields. Furthermore, we show that the higher-order Trotter decompositions can provide efficient Ansätze for the variational quantum algorithm, leading to improved performance in solving the ground-state problem. The strategy presented here is also applicable for many other quantum optimization and simulation tasks.

quant-ph↗

arXiv2022

Experimental realization of a topologically protected Hadamard gate via braiding Fibonacci anyons

Topological quantum computation (TQC) is one of the most striking architectures that can realize fault-tolerant quantum computers. In TQC, the logical space and the quantum gates are topologically protected, i.e., robust against local disturbances. The topological protection, however, requires rather complicated lattice models and hard-to-manipulate dynamics; even the simplest system that can realize universal TQC--the Fibonacci anyon system--lacks a physical realization, let alone braiding the non-Abelian anyons. Here, we propose a disk model that can realize the Fibonacci anyon system, and construct the topologically protected logical spaces with the Fibonacci anyons. Via braiding the Fibonacci anyons, we can implement universal quantum gates on the logical space. Our proposal is platform-independent. As a demonstration, we implement a topological Hadamard gate on a logical qubit through a sequence of $15$ braiding operations of three Fibonacci anyons with merely $2$ nuclear spin qubits. The gate fidelity reaches 97.18% by randomized benchmarking. We further prove by experiment that the logical space and Hadamard gate are topologically protected: local disturbances due to thermal fluctuations result in a global phase only. Our work is a proof of principle of TQC and paves the way towards fault-tolerant quantum computation.

quant-ph↗

arXiv2022

A Relaxed Energy Function Based Analog Neural Network Approach to Target Localization in Distributed MIMO Radar

Analog neural networks are highly effective to solve some optimization problems, and they have been used for target localization in distributed multiple-input multiple-output (MIMO) radar. In this work, we design a new relaxed energy function based neural network (RNFNN) for target localization in distributed MIMO radar. We start with the maximum likelihood (ML) target localization with a complicated objective function, which can be transformed to a tractable one with equality constraints by introducing some auxiliary variables. Different from the existing Lagrangian programming neural network (LPNN) methods, we further relax the optimization problem formulated for target localization, so that the Lagrangian multiplier terms are no longer needed, leading to a relaxed energy function with better convexity. Based on the relaxed energy function, a RNFNN is implemented with much simpler structure and faster convergence speed. Furthermore, the RNFNN method is extended to localization in the presence of transmitter and receiver location errors. It is shown that the performance of the proposed localization approach achieves the Cramér-Rao lower bound (CRLB) within a wider range of signal-to-noise ratios (SNRs). Extensive comparisons with the state-of-the-art approaches are provided, which demonstrate the advantages of the proposed approach in terms of performance improvement and computational complexity (or convergence speed).

cs.IT↗

arXiv2022

Nonreciprocal Charge Transport in Topological Kagome Superconductor CsV$_{3}$Sb$_{5}$

Nonreciprocal charge transport phenomena are widely studied in two-dimensional superconductors, which demonstrate unidirectional-anisotropy magnetoresistances as a result of symmetry breaking. Here, we report a strong nonreciprocal transport phenomenon in superconducting CsV$_{3}$Sb$_{5}$ thin flakes. The second harmonic voltages, mainly originating from the rectification effect of vortex motion, are unambiguously developed with in-plane and out-of-plane magnetic fields, and their magnitudes are comparable to those in noncentrosymmetric superconductors. The second harmonic magnetoresistances split into several peaks and some of them reverse their signs by ramping the magnetic field or the current within the superconducting transition. The nonreciprocity suggests a strong asymmetry in CsV$_{3}$Sb$_{5}$. The centrosymmetric structure and symmetric electronic phases in CsV$_{3}$Sb$_{5}$ can hardly induce the distinct nonreciprocal transport phenomenon, which could be correlated to a symmetry breaking from an unconventional superconducting order parameter symmetry.

cond-mat.supr-con↗

arXiv2022

Fast Ion Gates Outside the Lamb-Dicke Regime by Robust Quantum Optimal Control

We present a robust quantum optimal control framework for implementing fast entangling gates on ion-trap quantum processors. The framework leverages tailored laser pulses to drive the multiple vibrational sidebands of the ions to create phonon-mediated entangling gates and, unlike the state of the art, requires neither weak-coupling Lamb-Dicke approximation nor perturbation treatment. With the application of gradient-based optimal control, it enables finding amplitude- and phase-modulated laser control protocols that work beyond the Lamb-Dicke regime, promising gate speed at the order of microseconds comparable to the characteristic trap frequencies. Also, robustness requirements on the temperature of the ions and initial optical phase can be conveniently included to pursue high-quality fast gates against experimental imperfections. Our approach represents a step in speeding up quantum gates to achieve larger quantum circuits for quantum computation and simulation, and thus can find applications in near-future experiments.

quant-ph↗

arXiv2022

Measuring Quantum Entanglement from Local Information by Machine Learning

Entanglement is a key property in the development of quantum technologies and in the study of quantum many-body simulations. However, entanglement measurement typically requires quantum full-state tomography (FST). Here we present a neural network-assisted protocol for measuring entanglement in equilibrium and non-equilibrium states of local Hamiltonians. Instead of FST, it can learn comprehensive entanglement quantities from single-qubit or two-qubit Pauli measurements, such as Rényi entropy, partially-transposed (PT) moments, and coherence. It is also exciting that our neural network is able to learn the future entanglement dynamics using only single-qubit traces from the previous time. In addition, we perform experiments using a nuclear spin quantum processor and train an adoptive neural network to study entanglement in the ground and dynamical states of a one-dimensional spin chain. Quantum phase transitions (QPT) are revealed by measuring static entanglement in ground states, and the entanglement dynamics beyond measurement time is accurately estimated in dynamical states. These precise results validate our neural network. Our work will have a wide range of applications in quantum many-body systems, from quantum phase transitions to intriguing non-equilibrium phenomena such as quantum thermalization.

quant-ph↗