Searcharxiv⌕ Search

arXiv subjects

Jian Chen

Publications and source records attributed to Jian Chen.

At least 199 records · Page 11Linked to original sources

Magnetic structure and Ising-like antiferromagnetism in the bilayer triangular lattice compound NdZnPO

The complex interplay of spin frustration and quantum fluctuations in low-dimensional quantum materials leads to a variety of intriguing phenomena. This research focuses on a detailed analysis of the magnetic behavior exhibited by NdZnPO, a bilayer spin-1/2 triangular lattice antiferromagnet. The investigation employs magnetization, specific heat, and powder neutron scattering measurements. At zero field, a long-range magnetic order is observed at $T_{\rm N}=1.64~\rm K$. Powder neutron diffraction experiments show the Ising-like magnetic moments along the $c$-axis, revealing a stripe-like magnetic structure with three equivalent magnetic propagation vectors. Application of a magnetic field along the $c$-axis suppresses the antiferromagnetic order, leading to a fully polarized ferromagnetic state above $B_{\rm c}=4.5~\rm T$. This transition is accompanied by notable enhancements in the nuclear Schottky contribution. Moreover, the absence of spin frustration and expected field-induced plateau-like phases are remarkable observations. Detailed calculations of magnetic dipolar interactions revealed complex couplings reminiscent of a honeycomb lattice, suggesting the potential emergence of Kitaev-like physics within this system. This comprehensive study of the magnetic properties of NdZnPO highlights unresolved intricacies, underscoring the imperative for further exploration to unveil the underlying governing mechanisms.

cond-mat.str-el↗

Dynamic MIMO Architecture Design for Near-Field Communications

A novel dynamic hybrid beamforming architecture is proposed to achieve the spatial multiplexing-power consumption tradeoff for near-field multiple-input multiple-output (MIMO) networks, where each radio frequency (RF) chain is connected to each antenna using a couple of independent phase shifters to reduce the number of required RF chains. Based on this architecture, an optimization problem is formulated that maximizes the sum of achievable rates while minimizing the hardware power consumption. Both continuous and discrete phase shifters are considered. 1) For continuous phase shifters, a weighted minimum mean-square error-based two-stage (WMMSE-TS) algorithm is proposed, where the same performance as the optimal fully-digital beamformer can be achieved by the proposed hybrid beamformer even if the number of RF chains equals the number of data streams. 2) For discrete phase shifters, a penalty-based layered iterative (PLI) algorithm is proposed. The closed-form analog and baseband digital beamformers are derived in each iteration. Simulation results demonstrate that: 1) the proposed dynamic beamforming architecture outperforms the conventional fixed hybrid beamforming architecture in terms of spatial multiplexing-power consumption tradeoff, and 2) the proposed algorithms achieve better performance than the other baseline schemes.

cs.IT↗

Label-Retrieval-Augmented Diffusion Models for Learning from Noisy Labels

Learning from noisy labels is an important and long-standing problem in machine learning for real applications. One of the main research lines focuses on learning a label corrector to purify potential noisy labels. However, these methods typically rely on strict assumptions and are limited to certain types of label noise. In this paper, we reformulate the label-noise problem from a generative-model perspective, $\textit{i.e.}$, labels are generated by gradually refining an initial random guess. This new perspective immediately enables existing powerful diffusion models to seamlessly learn the stochastic generative process. Once the generative uncertainty is modeled, we can perform classification inference using maximum likelihood estimation of labels. To mitigate the impact of noisy labels, we propose the $\textbf{L}$abel-$\textbf{R}$etrieval-$\textbf{A}$ugmented (LRA) diffusion model, which leverages neighbor consistency to effectively construct pseudo-clean labels for diffusion training. Our model is flexible and general, allowing easy incorporation of different types of conditional information, $\textit{e.g.}$, use of pre-trained models, to further boost model performance. Extensive experiments are conducted for evaluation. Our model achieves new state-of-the-art (SOTA) results on all the standard real-world benchmark datasets. Remarkably, by incorporating conditional information from the powerful CLIP model, our method can boost the current SOTA accuracy by 10-20 absolute points in many cases.

cs.LG↗

Dual Radar: A Multi-modal Dataset with Dual 4D Radar for Autonomous Driving

Radar has stronger adaptability in adverse scenarios for autonomous driving environmental perception compared to widely adopted cameras and LiDARs. Compared with commonly used 3D radars, the latest 4D radars have precise vertical resolution and higher point cloud density, making it a highly promising sensor for autonomous driving in complex environmental perception. However, due to the much higher noise than LiDAR, manufacturers choose different filtering strategies, resulting in an inverse ratio between noise level and point cloud density. There is still a lack of comparative analysis on which method is beneficial for deep learning-based perception algorithms in autonomous driving. One of the main reasons is that current datasets only adopt one type of 4D radar, making it difficult to compare different 4D radars in the same scene. Therefore, in this paper, we introduce a novel large-scale multi-modal dataset featuring, for the first time, two types of 4D radars captured simultaneously. This dataset enables further research into effective 4D radar perception algorithms.Our dataset consists of 151 consecutive series, most of which last 20 seconds and contain 10,007 meticulously synchronized and annotated frames. Moreover, our dataset captures a variety of challenging driving scenarios, including many road conditions, weather conditions, nighttime and daytime with different lighting intensities and periods. Our dataset annotates consecutive frames, which can be applied to 3D object detection and tracking, and also supports the study of multi-modal tasks. We experimentally validate our dataset, providing valuable results for studying different types of 4D radars. This dataset is released on https://github.com/adept-thu/Dual-Radar.

cs.CV↗

Reconciling results of 2019 and 2020 stellar occultations on Pluto's atmosphere. New constraints from both the 5 September 2019 event and consistency analysis

A stellar occultation by Pluto on 5 September 2019 yielded positive detections at two separate stations. Using an approach consistent with comparable studies, we derived a surface pressure of $11.478 \pm 0.55~\mathrm{μbar}$ for Pluto's atmosphere from the observations of this event. In addition, to avoid potential method inconsistancies highlighted by Sicardy et al. when comparing with historical pressure measurements, we reanalyzed the data by 15 August 2018 and 17 July 2019 events, respectively. All the new measurements provide a bridge between the two different perspectives on the pressure variation since 2015: a rapid pressure drop from previous studies of the 15 August 2018 and 17 July 2019 events and a plateau phase from that of the 6 June 2020 event. The pressure measurement from the 5 September 2019 event aligns with those from 2016, 2018, and 2020, supporting the latter perspective. While the measurements from the 4 June 2011 and 17 July 2019 events suggest probable V-shaped pressure variations unaccounted for by the volatile transport model (VTM) from Meza et al., the VTM remains applicable on average. And, the validity of the V-shaped variations is debatable due to the stellar faintness of the 4 June 2011 event and the grazing single-chord geometry of the 17 July 2019 event. To reveal and understand all significant pressure variations of Pluto's atmosphere, it is essential to provide constraints on both short-term and long-term evolutions of the interacting atmosphere and surface by continuous pressure monitoring through occultation observations, whenever possible, complemented by frequent spectroscopy and photometry of the surface.

astro-ph.EP↗

Quantum nonlinear ac transport theory at low frequency

Based on the nonequilibrium Green's function (NEGF), we develop a quantum nonlinear theory to study time-dependent ac transport properties in the low frequency and nonlinear bias voltage regimes. By expanding NEGF in terms of time to the linear order in Wigner representation, we can explicitly include the time-dependent self-consistent Coulomb interaction induced by external ac bias. Hence this theory automatically satisfies two basic requirements, i.e., current conservation and gauge invariance. Within this theory, the nonlinear ac current can be evaluated at arbitrarily large bias voltages under the low frequency limit. In addition, we obtain the expression of time-dependent current under the wide band limit and derive the relation between the nonlinear electrochemical capacitance and the bias voltage, which are very useful in predicting the dynamical properties of nanoelectronic devices. This quantum theory can be directly combined with density functional theory to investigate time-dependent ac transport from first-principles calculation.

cond-mat.mes-hall↗

Unified framework of the microscopic Landau-Lifshitz-Gilbert equation and its application to Skyrmion dynamics

The Landau-Lifshitz-Gilbert (LLG) equation is widely used to describe magnetization dynamics. We develop a unified framework of the microscopic LLG equation based on the nonequilibrium Green's function formalism. We present a unified treatment for expressing the microscopic LLG equation in several limiting cases, including the adiabatic, inertial, and nonadiabatic limits with respect to the precession frequency for a magnetization with fixed magnitude, as well as the spatial adiabatic limit for the magnetization with slow variation in both its magnitude and direction. The coefficients of those terms in the microscopic LLG equation are explicitly expressed in terms of nonequilibrium Green's functions. As a concrete example, this microscopic theory is applied to simulate the dynamics of a magnetic Skyrmion driven by quantum parametric pumping. Our work provides a practical formalism of the microscopic LLG equation for exploring magnetization dynamics.

cond-mat.mes-hall↗

FGPrompt: Fine-grained Goal Prompting for Image-goal Navigation

Learning to navigate to an image-specified goal is an important but challenging task for autonomous systems. The agent is required to reason the goal location from where a picture is shot. Existing methods try to solve this problem by learning a navigation policy, which captures semantic features of the goal image and observation image independently and lastly fuses them for predicting a sequence of navigation actions. However, these methods suffer from two major limitations. 1) They may miss detailed information in the goal image, and thus fail to reason the goal location. 2) More critically, it is hard to focus on the goal-relevant regions in the observation image, because they attempt to understand observation without goal conditioning. In this paper, we aim to overcome these limitations by designing a Fine-grained Goal Prompting (FGPrompt) method for image-goal navigation. In particular, we leverage fine-grained and high-resolution feature maps in the goal image as prompts to perform conditioned embedding, which preserves detailed information in the goal image and guides the observation encoder to pay attention to goal-relevant regions. Compared with existing methods on the image-goal navigation benchmark, our method brings significant performance improvement on 3 benchmark datasets (i.e., Gibson, MP3D, and HM3D). Especially on Gibson, we surpass the state-of-the-art success rate by 8% with only 1/50 model size. Project page: https://xinyusun.github.io/fgprompt-pages

cs.CV↗

Can AI Mitigate Human Perceptual Biases? A Pilot Study

We present results from a pilot experiment to measure if machine recommendations can debias human perceptual biases in visualization tasks. We specifically studied the ``pull-down'' effect, i.e., people underestimate the average position of lines, for the task of estimating the ensemble average of data points in line charts. These line charts can show for example temperature or precipitation in 12 months. Six participants estimated ensemble averages with or without an AI assistant. The assistant, when available, responded at three different speeds to assemble the conditions of a human collaborator who may delay his or her responses. Our pilot study showed that participants were faster with AI assistance in ensemble tasks, compared to the baseline without AI assistance. Although ``pull-down'' biases were reduced, the effect of AI assistance was not statistically significant. Also, delaying AI responses had no significant impact on human decision accuracy. We discuss the implications of these preliminary results for subsequent studies.

cs.HC↗

STARS for Integrated Sensing and Communications: Challenges, Solutions, and Future Directions

This article discusses the employment of simultaneously transmitting and reflecting surface (STARS) for integrated sensing and communication (ISAC) networks. First, two fundamental configurations of STARS-enabled ISAC systems are introduced, namely integrated full-space configuration and separated half-space configuration, as well as their respective advantages and common challenges are identified. To address the aforementioned challenges, a novel sensing-at-STARS design is proposed, where the sensing functionality is achieved at the STARS instead of at the base station. Such a design significantly improves the echo signal energy by eliminating undesired echo energy attenuation/leakage, in addition to establishing favorable echo propagation paths to facilitate sensing information extraction. We also present three practical implementations for sensing-at-STARS, including separated elements, mode-selection elements, and power-splitting elements. Each implementation enables flexible sensing-communication tradeoffs. Numerical results are provided to demonstrate the superiority of the proposed STARS-enabled ISAC design. Finally, we discuss several future research directions.

cs.IT↗

Dual-Reference Source-Free Active Domain Adaptation for Nasopharyngeal Carcinoma Tumor Segmentation across Multiple Hospitals

Nasopharyngeal carcinoma (NPC) is a prevalent and clinically significant malignancy that predominantly impacts the head and neck area. Precise delineation of the Gross Tumor Volume (GTV) plays a pivotal role in ensuring effective radiotherapy for NPC. Despite recent methods that have achieved promising results on GTV segmentation, they are still limited by lacking carefully-annotated data and hard-to-access data from multiple hospitals in clinical practice. Although some unsupervised domain adaptation (UDA) has been proposed to alleviate this problem, unconditionally mapping the distribution distorts the underlying structural information, leading to inferior performance. To address this challenge, we devise a novel Sourece-Free Active Domain Adaptation (SFADA) framework to facilitate domain adaptation for the GTV segmentation task. Specifically, we design a dual reference strategy to select domain-invariant and domain-specific representative samples from a specific target domain for annotation and model fine-tuning without relying on source-domain data. Our approach not only ensures data privacy but also reduces the workload for oncologists as it just requires annotating a few representative samples from the target domain and does not need to access the source data. We collect a large-scale clinical dataset comprising 1057 NPC patients from five hospitals to validate our approach. Experimental results show that our method outperforms the UDA methods and achieves comparable results to the fully supervised upper bound, even with few annotations, highlighting the significant medical utility of our approach. In addition, there is no public dataset about multi-center NPC segmentation, we will release code and dataset for future research.

cs.CV↗

Barzilai-Borwein Descent Methods for Multiobjective Optimization Problems with Variable Trade-off Metrics

The imbalances and conditioning of the objective functions influence the performance of first-order methods for multiobjective optimization problems (MOPs). The latter is related to the metric selected in the direction-finding subproblems. Unlike single-objective optimization problems, capturing the curvature of all objective functions with a single Hessian matrix is impossible. On the other hand, second-order methods for MOPs use different metrics for objectives in direction-finding subproblems, leading to a high per-iteration cost. To balance per-iteration cost and better curvature exploration, we propose a Barzilai-Borwein descent method with variable metrics (BBDMO\_VM). In the direction-finding subproblems, we employ a variable metric to explore the curvature of all objectives. Subsequently, Barzilai-Borwein's method relative to the variable metric is applied to tune objectives, which mitigates the effect of imbalances. We investigate the convergence behaviour of the BBDMO\_VM, confirming fast linear convergence for well-conditioned problems relative to the variable metric. In particular, we establish linear convergence for problems that involve some linear objectives. These convergence results emphasize the importance of metric selection, motivating us to approximate the trade-off of Hessian matrices to better capture the geometry of the problem. Comparative numerical results confirm the efficiency of the proposed method, even when applied to large-scale and ill-conditioned problems.

math.OC↗

Over-Sampling Strategy in Feature Space for Graphs based Class-imbalanced Bot Detection

The presence of a large number of bots in Online Social Networks (OSN) leads to undesirable social effects. Graph neural networks (GNNs) are effective in detecting bots as they utilize user interactions. However, class-imbalanced issues can affect bot detection performance. To address this, we propose an over-sampling strategy for GNNs (OS-GNN) that generates samples for the minority class without edge synthesis. First, node features are mapped to a feature space through neighborhood aggregation. Then, we generate samples for the minority class in the feature space. Finally, the augmented features are used to train the classifiers. This framework is general and can be easily extended into different GNN architectures. The proposed framework is evaluated using three real-world bot detection benchmark datasets, and it consistently exhibits superiority over the baselines.

cs.CV↗

Direct Implicit and Explicit Energy-Conserving Particle-in-Cell Methods for Modeling of Capacitively-Coupled Plasma Devices

Achieving large-scale kinetic modelling is a crucial task for the development and optimization of modern plasma devices. With the trend of decreasing pressure in applications such as plasma etching, kinetic simulations are necessary to self-consistently capture the particle dynamics. The standard, explicit, electrostatic, momentum-conserving Particle-In-Cell method suffers from restrictive stability constraints on spatial cell size and temporal time step, requiring resolution of the electron Debye length and electron plasma period respectively. This results in a very high computational cost, making the technique prohibitive for large volume device modeling. We investigate the Direct Implicit algorithm and the explicit Energy Conserving algorithm as alternatives to the standard approach, both of which can reduce computational cost with a minimal (or controllable) impact on results. These algorithms are implemented into the well-tested EDIPIC-2D and LTP-PIC codes, and their performance is evaluated via 2D capacitively coupled plasma discharge simulations. The investigation revels that both approaches enable the utilization of cell sizes larger than the Debye length, resulting in reduced runtime, while incurring only minor inaccuracies in plasma parameters. The Direct Implicit method also allows for time steps larger than the electron plasma period, however care must be taken to avoid numerical heating or cooling. It is demonstrated that by appropriately adjusting the ratio of cell size to time step, it is possible to mitigate this effect to an acceptable level.

physics.plasm-ph↗

SimSched: A tool for Simulating Autosar Implementaion in Simulink

AUTOSAR (AUTomotive Open System ARchitecture) is an open industry standard for the automotive sector. It defines the three-layered automotive software architecture. One of these layers is the application layer, where functional behaviors are encapsulated in Software Components (SW-Cs). Inside SW-Cs, a set of runnable entities represents the internal behavior and is realized as a set of tasks. To address AUTOSAR's lack of support for modeling behaviors of runnables, languages such as Simulink are employed. Simulink simulations assume Simulink block behaviors are completed in zero execution time, while real execution requires a finite execution time. This timing mismatch can result in failures to detect unexpected runtime behaviors during the simulation phase. This paper extends the Simulink environment to model the timing properties of tasks. We present a Simulink block that can schedule tasks with non-zero simulation times. It enables a more realistic analysis during model development.

cs.SE↗

On the Convergence of Newton-type Proximal Gradient Method for Multiobjective Optimization Problems

In a recent study, Ansary (Optim Methods Softw 38(3):570-590,2023) proposed a Newton-type proximal gradient method for nonlinear multiobjective optimization problems (NPGMO). However, the favorable convergence properties typically associated with Newton-type methods were not established for NPGMO in Ansary's work. In response to this gap, we develop a straightforward framework for analyzing the convergence behavior of the NPGMO. Specifically, under the assumption of strong convexity, we demonstrate that the NPGMO enjoys quadratic termination, superlinear convergence, and quadratic convergence for problems that are quadratic, twice continuously differentiable and twice Lipschitz continuously differentiable, respectively.

math.OC↗

Extremely thin perfect absorber by generalized multipole bianisotropic effect

Symmetry breaking plays a crucial role in understanding the fundamental physics underlying numerous physical phenomena, including the electromagnetic response in resonators, giving rise to intriguing effects such as directional light scattering, supercavity lasing, and topologically protected states. In this work, we demonstrate that adding a small fraction of lossy metal (as low as $1\times10^{-6}$ in volume), to a lossless dielectric resonator breaks inversion symmetry thereby lifting its degeneracy, leading to a strong bianisotropic response. In the case of the metasurface composed of such resonators, this effect leads to unidirectional perfect absorption while maintaining nearly perfect reflection from the opposite direction. We have developed more general Onsager-Casimir relations for the polarizabilities of particle arrays, taking into account the contributions of quadrupoles, which shows that bianisotropy is not solely due to dipoles, but also involves high-order multipoles. Our experimental validation demonstrates an extremely thin terahertz-perfect absorber with a wavelength-to-thickness ratio of up to 25,000, where the material thickness is only 2% of the theoretical minimum thickness dictated by the fundamental limit. Our findings have significant implications for a variety of applications, including energy harvesting, thermal management, single-photon detection, and low-power directional emission.

physics.optics↗

Barzilai-Borwein Proximal Gradient Methods for Multiobjective Composite Optimization Problems with Improved Linear Convergence

When minimizing a multiobjective optimization problem (MOP) using multiobjective gradient descent methods, the imbalances among objective functions often decelerate the convergence. In response to this challenge, we propose two types of the Barzilai-Borwein proximal gradient method for multi-objective composite optimization problems (BBPGMO). We establish convergence rates for BBPGMO, demonstrating that it achieves rates of $O(\frac{1}{\sqrt{k}})$, $O(\frac{1}{k})$, and $O(r^{k})(0<r<1)$ for non-convex, convex, and strongly convex problems, respectively. Furthermore, we show that BBPGMO exhibits linear convergence for MOPs with several linear objective functions. Interestingly, the linear convergence rate of BBPGMO surpasses the existing convergence rates of first-order methods for MOPs, which indicates its enhanced performance and its ability to effectively address imbalances from theoretical perspective. Finally, we provide numerical examples to illustrate the efficiency of the proposed method and verify the theoretical results.

math.OC↗