Search arXiv⌕ Search

arXiv subjects

Xin Xu

Publications and source records attributed to Xin Xu.

At least 217 records · Page 12Linked to original sources

The Study of Mode Switching behavior of PSR J0614+2229 Using the Parkes Ultra-wideband Receiver Observations

In this paper, we presented a detailed single pulse and polarization study of PSR J0614+2229 based on the archived data observed on 2019 August 15 (MJD 58710) and September 12 (MJD 58738) using the Ultra-wideband Low-frequency Receiver on the Parkes radio telescope. The single-pulse sequences show that this pulsar switches between two emission states, in which the emission of state A occurs earlier than that of state B in pulse longitude. We found that the variation in relative brightness between the two states is related to time and both states follow a simple power law very well. Based on the phase-aligned multi-frequency profiles, we found that there is a significant difference in the distributions of spectral index across the emission regions of the two states. Furthermore, we obtained the emission height evolution for the two emission states and found that, at a fixed frequency, the emission height of state A is higher than that of state B. What is even more interesting is that the emission heights of both states A and B have not changed with frequency. Our results suggest that the mode switching of this pulsar is possibly caused by changes in the emission heights that alter the distributions of spectral index across the emission regions of states A and B resulting in the frequency-dependent behaviors, i.e., intensity and pulse width.

astro-ph.HE↗

Improving XYG3-type Doubly Hybrid Approximation using Self-Interaction Corrected SCAN Density and Orbitals via the PZ-SIC Framework: the xDH@SCAN(SIC) Approach

XYG3-type doubly hybrid approximations (xDH) have gained a widespread recognition for their accuracy in describing a diverse range of chemical and physical interactions. However, a recent study (J. Phys. Chem. 2021, 12, 800-807) has highlighted the limitation of xDH methods in calculating the dissociation of the NaCl molecule. This issue has been related to the density and orbitals used for evaluating the energy in xDH methods, which are obtained from lower-rung hybrid density functional approximations (DFAs) and display substantial density errors in the dissociation limit. In this work, we systematically investigate the influence of density on several challenging datasets and find that the xDH methods are less sensitive to the density errors compared to semi-local and hybrid DFAs. Furthermore, we demonstrate that the self-interaction corrected SCAN density offers superior accuracy compared to the self-consistent SCAN density and Hartree-Fock (HF) density, as evidenced by the charge analysis on the dissociation of heterodimers, such as NaCl and LiF. Building on these insights, we propose a 5-parameter xDH method using the SCAN density and orbitals corrected by the PZ-SIC scheme. This new xDH@SCAN(SIC) method provides a balanced and accurate description across a wide range of challenging systems.

physics.chem-ph↗

Degenerate bifurcations of two-fold doubly-connected uniformly rotating vortex patches

In this paper, we obtain families of two-fold doubly-connected uniformly rotating vortex patches of the 2-D incompressible Euler equations emanating from some specific annuli. The main difficulty comes from strong degeneracy of the problem, neither the kernel of linearization is one-dimensional nor the transeversallity condition holds. To this end, we make a detailed analysis on the nonlinear functional and the bifurcation curves are obtained by perturbing real algebraic varieties defined by truncated polynomials. In addition, our result partially answers an problem proposed by Hmidi and Mateu in \cite{Hmidi2016a} (\emph{Adv.Math.302 (2016), 799-850}).

math.AP↗

Enhancing Optimization Through Innovation: The Multi-Strategy Improved Black Widow Optimization Algorithm (MSBWOA)

This paper introduces a Multi-Strategy Improved Black Widow Optimization Algorithm (MSBWOA), designed to enhance the performance of the standard Black Widow Algorithm (BW) in solving complex optimization problems. The proposed algorithm integrates four key strategies: initializing the population using Tent chaotic mapping to enhance diversity and initial exploratory capability; implementing mutation optimization on the least fit individuals to maintain dynamic population and prevent premature convergence; incorporating a non-linear inertia weight to balance global exploration and local exploitation; and adding a random perturbation strategy to enhance the algorithm's ability to escape local optima. Evaluated through a series of standard test functions, the MSBWOA demonstrates significant performance improvements in various dimensions, particularly in convergence speed and solution quality. Experimental results show that compared to the traditional BW algorithm and other existing optimization methods, the MSBWOA exhibits better stability and efficiency in handling a variety of optimization problems. These findings validate the effectiveness of the proposed strategies and offer a new solution approach for complex optimization challenges.

cs.NE↗

EPNet: An Efficient Pyramid Network for Enhanced Single-Image Super-Resolution with Reduced Computational Requirements

Single-image super-resolution (SISR) has seen significant advancements through the integration of deep learning. However, the substantial computational and memory requirements of existing methods often limit their practical application. This paper introduces a new Efficient Pyramid Network (EPNet) that harmoniously merges an Edge Split Pyramid Module (ESPM) with a Panoramic Feature Extraction Module (PFEM) to overcome the limitations of existing methods, particularly in terms of computational efficiency. The ESPM applies a pyramid-based channel separation strategy, boosting feature extraction while maintaining computational efficiency. The PFEM, a novel fusion of CNN and Transformer structures, enables the concurrent extraction of local and global features, thereby providing a panoramic view of the image landscape. Our architecture integrates the PFEM in a manner that facilitates the streamlined exchange of feature information and allows for the further refinement of image texture details. Experimental results indicate that our model outperforms existing state-of-the-art methods in image resolution quality, while considerably decreasing computational and memory costs. This research contributes to the ongoing evolution of efficient and practical SISR methodologies, bearing broader implications for the field of computer vision.

cs.CV↗

Continual Learning through Networks Splitting and Merging with Dreaming-Meta-Weighted Model Fusion

It's challenging to balance the networks stability and plasticity in continual learning scenarios, considering stability suffers from the update of model and plasticity benefits from it. Existing works usually focus more on the stability and restrict the learning plasticity of later tasks to avoid catastrophic forgetting of learned knowledge. Differently, we propose a continual learning method named Split2MetaFusion which can achieve better trade-off by employing a two-stage strategy: splitting and meta-weighted fusion. In this strategy, a slow model with better stability, and a fast model with better plasticity are learned sequentially at the splitting stage. Then stability and plasticity are both kept by fusing the two models in an adaptive manner. Towards this end, we design an optimizer named Task-Preferred Null Space Projector(TPNSP) to the slow learning process for narrowing the fusion gap. To achieve better model fusion, we further design a Dreaming-Meta-Weighted fusion policy for better maintaining the old and new knowledge simultaneously, which doesn't require to use the previous datasets. Experimental results and analysis reported in this work demonstrate the superiority of the proposed method for maintaining networks stability and keeping its plasticity. Our code will be released.

cs.CV↗

Schema-adaptable Knowledge Graph Construction

Conventional Knowledge Graph Construction (KGC) approaches typically follow the static information extraction paradigm with a closed set of pre-defined schema. As a result, such approaches fall short when applied to dynamic scenarios or domains, whereas a new type of knowledge emerges. This necessitates a system that can handle evolving schema automatically to extract information for KGC. To address this need, we propose a new task called schema-adaptable KGC, which aims to continually extract entity, relation, and event based on a dynamically changing schema graph without re-training. We first split and convert existing datasets based on three principles to build a benchmark, i.e., horizontal schema expansion, vertical schema expansion, and hybrid schema expansion; then investigate the schema-adaptable performance of several well-known approaches such as Text2Event, TANL, UIE and GPT-3.5. We further propose a simple yet effective baseline dubbed \textsc{AdaKGC}, which contains schema-enriched prefix instructor and schema-conditioned dynamic decoding to better handle evolving schema. Comprehensive experimental results illustrate that AdaKGC can outperform baselines but still have room for improvement. We hope the proposed work can deliver benefits to the community. Code and datasets available at https://github.com/zjunlp/AdaKGC.

cs.CL↗

A Counterexample for the Principal Eigenvalue of An Elliptic Operator with Large Advection

There are numerous studies focusing on the convergence of the principal eigenvalue $λ(s)$ as $s\to+\infty$ corresponding to the elliptic eigenvalue problem \begin{align*} -Δφ(x)-2s\mathbf{v}\cdot\nablaφ(x)+c(x)φ(x)=λ(s)φ(x),\quad x\in Ω, \end{align*} where $Ω$ is a bounded domain and the advection term $\mathbf{v}$ under some certain restrictions. In this paper, we construct an infinitely oscillating gradient advection term $\mathbf{v}=\nabla m(x)\in C^1(Ω)$ such that the principal eigenvalue $λ(s)$ does not converge as $s\to+\infty$. As far as we know, this is the first result that guarantee the non-convergence of the principal eigenvalue.

math.AP↗

Investigating the multi-drifting behavior of subpulses in PSR J2007$+$0910 with the FAST

The multi-drifting subpulse behaviors in PSR J2007+0910 have been studied carefully with the high sensitivity observations of the Five-hundred-meter Aperture Spherical radio Telescope (FAST) at 1250 MHz. We found that there are at least six different single emission modes in PSR J2007+0910 are observed, four of which show significant subpulse drifting behaviors (modes A, B, C, and D), and the remaining two (modes $E_1$ and $E_2$) show stationary subpulse structures. The subpulse drifting periods of modes A, B, C, and D are $P_{3, A} = 8.7 \pm 1.6 P$, $P_{3, B} = 15.8 \pm 1.2 P$, $P_{3, C} = 21.6 \pm 1.3 P$ and $P_{3, D} = 32.3 \pm 0.9 P$, respectively, where $P$ represents the pulse period of this pulsar. The subpulse separation is almost the same for all modes $P_2 = 6.01 \pm 0.18 ^\circ$. Deep analysis suggests that the appearance and significant changes in the drifting period of multi-drifting subpulse emission modes for a pulsar may originate from the aliasing effect. The observed non-drifting modes may be caused by the spark point move with a period ~P_2. Our statistical analysis shows that the drift mode of this pulsar almost always switches from slower to faster drifts in the mode change. The interesting subpulse emission phenomenon of PSR J2007+0910 provides a unique opportunity to understand the switching mechanism of multi-drift mode.

astro-ph.HE↗

Six-degrees-of-freedom test mass readout via optical phase-locking heterodyne interferometry

Accurate position and posture measurements of the freely-falling test mass are crucial for the success of spaceborne gravitational wave detection missions. This paper presents a novel laboratory-developed test mass motion readout that utilizes quadrant photodetectors to measure the translation and tilt of a test mass. Departing from conventional methods like Zeeman effect or AOM frequency shift modulation, the readout system employs the phase locking of two lasers to generate the dual-frequency heterodyne source. Notably, the out-of-loop sensitivity of the phase locking reaches below 30 pm/Hz1/2 within the frequency band of 1 mHz and 10 Hz. The system comprises three measurement interferometers and one reference interferometer, featuring a symmetric design that enables measurements of up to six degrees of freedom based on polarization-multiplexing and differential wavefront sensing. Ground-simulated experimental results demonstrate that the proposed system has achieved a measurement sensitivity of 4 pm/Hz1/2 and 2 nrad/Hz1/2 at 1 Hz, a resolution of 5 nm and 0.1 urad, a range of 200 um and 600 urad, respectively. These findings showcase the system's potential as an alternative method for precisely monitoring the motion of test masses in spaceborne gravitational wave detection missions and other applications requiring accurate positioning and multi-degrees-of-freedom sensing.

astro-ph.IM↗

DeepKE: A Deep Learning Based Knowledge Extraction Toolkit for Knowledge Base Population

We present an open-source and extensible knowledge extraction toolkit DeepKE, supporting complicated low-resource, document-level and multimodal scenarios in the knowledge base population. DeepKE implements various information extraction tasks, including named entity recognition, relation extraction and attribute extraction. With a unified framework, DeepKE allows developers and researchers to customize datasets and models to extract information from unstructured data according to their requirements. Specifically, DeepKE not only provides various functional modules and model implementation for different tasks and scenarios but also organizes all components by consistent frameworks to maintain sufficient modularity and extensibility. We release the source code at GitHub in https://github.com/zjunlp/DeepKE with Google Colab tutorials and comprehensive documents for beginners. Besides, we present an online system in http://deepke.openkg.cn/EN/re_doc_show.html for real-time extraction of various tasks, and a demo video.

cs.CL↗

Towards Realistic Low-resource Relation Extraction: A Benchmark with Empirical Baseline Study

This paper presents an empirical study to build relation extraction systems in low-resource settings. Based upon recent pre-trained language models, we comprehensively investigate three schemes to evaluate the performance in low-resource settings: (i) different types of prompt-based methods with few-shot labeled data; (ii) diverse balancing methods to address the long-tailed distribution issue; (iii) data augmentation technologies and self-training to generate more labeled in-domain data. We create a benchmark with 8 relation extraction (RE) datasets covering different languages, domains and contexts and perform extensive comparisons over the proposed schemes with combinations. Our experiments illustrate: (i) Though prompt-based tuning is beneficial in low-resource RE, there is still much potential for improvement, especially in extracting relations from cross-sentence contexts with multiple relational triples; (ii) Balancing methods are not always helpful for RE with long-tailed distribution; (iii) Data augmentation complements existing baselines and can bring much performance gain, while self-training may not consistently achieve advancement to low-resource RE. Code and datasets are in https://github.com/zjunlp/LREBench.

cs.CL↗

Critical roles of edge turbulent transport in the formation of high-field-side high-density front and density limit disruption in J-TEXT tokamak

This article presents an in-depth study of the sequence of events leading to density limit disruption in J-TEXT tokamak plasmas, with an emphasis on boudary turbulent transport and the high-field-side high-density (HFSHD) front. These phenomena were extensively investigated by using Langmuir probe and Polarimeter-interferometer diagnostics.

physics.plasm-ph↗

TaskLAMA: Probing the Complex Task Understanding of Language Models

Structured Complex Task Decomposition (SCTD) is the problem of breaking down a complex real-world task (such as planning a wedding) into a directed acyclic graph over individual steps that contribute to achieving the task, with edges specifying temporal dependencies between them. SCTD is an important component of assistive planning tools, and a challenge for commonsense reasoning systems. We probe how accurately SCTD can be done with the knowledge extracted from Large Language Models (LLMs). We introduce a high-quality human-annotated dataset for this problem and novel metrics to fairly assess performance of LLMs against several baselines. Our experiments reveal that LLMs are able to decompose complex tasks into individual steps effectively, with a relative improvement of 15% to 280% over the best baseline. We also propose a number of approaches to further improve their performance, with a relative improvement of 7% to 37% over the base model. However, we find that LLMs still struggle to predict pairwise temporal dependencies, which reveals a gap in their understanding of complex tasks.

cs.CL↗

RSFNet: A White-Box Image Retouching Approach using Region-Specific Color Filters

Retouching images is an essential aspect of enhancing the visual appeal of photos. Although users often share common aesthetic preferences, their retouching methods may vary based on their individual preferences. Therefore, there is a need for white-box approaches that produce satisfying results and enable users to conveniently edit their images simultaneously. Recent white-box retouching methods rely on cascaded global filters that provide image-level filter arguments but cannot perform fine-grained retouching. In contrast, colorists typically employ a divide-and-conquer approach, performing a series of region-specific fine-grained enhancements when using traditional tools like Davinci Resolve. We draw on this insight to develop a white-box framework for photo retouching using parallel region-specific filters, called RSFNet. Our model generates filter arguments (e.g., saturation, contrast, hue) and attention maps of regions for each filter simultaneously. Instead of cascading filters, RSFNet employs linear summations of filters, allowing for a more diverse range of filter classes that can be trained more easily. Our experiments demonstrate that RSFNet achieves state-of-the-art results, offering satisfying aesthetic appeal and increased user convenience for editable white-box retouching.

cs.CV↗

Model-Based Safe Reinforcement Learning with Time-Varying State and Control Constraints: An Application to Intelligent Vehicles

Recently, safe reinforcement learning (RL) with the actor-critic structure for continuous control tasks has received increasing attention. It is still challenging to learn a near-optimal control policy with safety and convergence guarantees. Also, few works have addressed the safe RL algorithm design under time-varying safety constraints. This paper proposes a safe RL algorithm for optimal control of nonlinear systems with time-varying state and control constraints. In the proposed approach, we construct a novel barrier force-based control policy structure to guarantee control safety. A multi-step policy evaluation mechanism is proposed to predict the policy's safety risk under time-varying safety constraints and guide the policy to update safely. Theoretical results on stability and robustness are proven. Also, the convergence of the actor-critic implementation is analyzed. The performance of the proposed algorithm outperforms several state-of-the-art RL algorithms in the simulated Safety Gym environment. Furthermore, the approach is applied to the integrated path following and collision avoidance problem for two real-world intelligent vehicles. A differential-drive vehicle and an Ackermann-drive one are used to verify offline deployment and online learning performance, respectively. Our approach shows an impressive sim-to-real transfer capability and a satisfactory online control performance in the experiment.

cs.LG↗

Learning-based Near-optimal Motion Planning for Intelligent Vehicles with Uncertain Dynamics

Motion planning has been an important research topic in achieving safe and flexible maneuvers for intelligent vehicles. However, it remains challenging to realize efficient and optimal planning in the presence of uncertain model dynamics. In this paper, a sparse kernel-based reinforcement learning (RL) algorithm with Gaussian Process (GP) Regression (called GP-SKRL) is proposed to achieve online adaption and near-optimal motion planning performance. In this algorithm, we design an efficient sparse GP regression method to learn the uncertain dynamics. Based on the updated model, a sparse kernel-based policy iteration algorithm with an exponential barrier function is designed to learn the near-optimal planning policies with the capability to avoid dynamic obstacles. Thereby, batch-mode GP-SKRL with online adaption capability can estimate the changing system dynamics. The converged RL policies are then deployed on vehicles efficiently under a safety-aware module. As a result, the produced driving actions are safe and less conservative, and the planning performance has been noticeably improved. Extensive simulation results show that GP-SKRL outperforms several advanced motion planning methods in terms of average cumulative cost, trajectory length, and task completion time. In particular, experiments on a Hongqi E-HS3 vehicle demonstrate that superior GP-SKRL provides a practical planning solution.

cs.RO↗