Searcharxiv⌕ Search

arXiv subjects

Fei Li

Publications and source records attributed to Fei Li.

At least 127 records · Page 7Linked to original sources

A Scalable, High-Efficiency, Low-Energy-Spread, Laser Wakefield Accelerator using a Tri-plateau Plasma Channel

The emergence of multi-petawatt laser facilities is expected to push forward the maximum energy gain that can be achieved in a single stage of a LWFA to tens of GeV, which begs the question - is it likely to impact particle physics by providing a truly compact particle collider? Colliders have very stringent requirements on beam energy, acceleration efficiency and beam quality. In this article, we propose a LWFA scheme that can for the first time simultaneously achieve hitherto unrealized acceleration efficiency from the laser to the electron beam of >20% and a sub-one percent energy spread using a stepwise plasma structure and a nonlinearly chirped laser pulse. Three-dimensional high-fidelity simulations show that the nonlinear chirp can effectively mitigate the laser waveform distortion and lengthen the acceleration distance. This combined with an inter-stage rephasing process in the stepwise plasma can triple the beam energy gain compared to that in a uniform plasma for a fixed laser energy thereby dramatically increasing the efficiency. A dynamic beam loading effect can almost perfectly cancel the energy chirp that arises during the acceleration, leading to the sub-percent energy spread. This scheme is highly scalable and can be applied to peta-watt LWFA scenarios. Scaling laws are obtained that suggest electron beams with energy gain of >100 GeV, charge of 2 nC, and with an energy spread <1% can be realized with a high laser pulse to particle beam energy transfer efficiency in a LWFA driven by a peta-watt laser, which could be the basis for a proof of concept of one arm of a future electron-positron collider.

physics.acc-ph↗

Efficient generation of intense spatial and spatiotemporal vortex harmonics using plasma mirrors

Intense spatial or spatiotemporal vortex pulses from the extreme ultraviolet to soft X-ray spectral windows are expected to provide new degrees of freedom for a variety of key applications since they carry longitudinal or transverse orbital angular momentum (OAM), respectively. Plasma-based high harmonic generation driven by a near-infrared spatial or spatiotemporal optical vortex offers a promising route to such novel light sources. However, the energy conversion efficiency from the incident vortex beam to the vortex harmonics is rather low because of the limited driving intensities available in practice. Here, we propose and demonstrate through simulations that by adding a readily available relativistic Gaussian pump beam as a source of energy, the energy conversion efficiency can be increased by several orders of magnitude. In addition, the proposed scheme allows independent control over the frequency and OAM of the vortex harmonics.

physics.plasm-ph↗

A Survey of Fish Tracking Techniques Based on Computer Vision

Fish tracking is a key technology for obtaining movement trajectories and identifying abnormal behavior. However, it faces considerable challenges, including occlusion, multi-scale tracking, and fish deformation. Notably, extant reviews have focused more on behavioral analysis rather than providing a comprehensive overview of computer vision-based fish tracking approaches. This paper presents a comprehensive review of the advancements of fish tracking technologies over the past seven years (2017-2023). It explores diverse fish tracking techniques with an emphasis on fundamental localization and tracking methods. Auxiliary plugins commonly integrated into fish tracking systems, such as underwater image enhancement and re-identification, are also examined. Additionally, this paper summarizes open-source datasets, evaluation metrics, challenges, and applications in fish tracking research. Finally, a comprehensive discussion offers insights and future directions for vision-based fish tracking techniques. We hope that our work could provide a partial reference in the development of fish tracking algorithms.

cs.CV↗

Topological Magnetoresistance of Magnetic Skyrmionic Bubbles

Magnetic skyrmions offer promising prospects for constructing future energy-efficient and high-density information technology, leading to extensive explorations of new skyrmionic materials recently. The topological Hall effect has been widely adopted as a distinctive marker of skyrmion emergence. Alternately, here we propose a novel signature of skyrmion state by quantitatively investigating the magnetoresistance (MR) induced by skyrmionic bubbles in CeMn2Ge2. An intriguing finding was revealed: the anomalous MR measured at different temperatures can be normalized into a single curve, regardless of sample thickness. This behavior can be accurately reproduced by the recent chiral spin textures MR model. Further analysis of the MR anomaly allowed us to quantitatively examine the effective magnetic fields of various scattering channels. Remarkably, the analyses, combined with the Lorentz transmission electronic microscopy results, indicate that the in-plane scattering channel with triplet exchange interactions predominantly governs the magnetotransport in the Bloch-type skyrmionic bubble state. Our results not only provide insights into the quantum correction on MR induced by skyrmionic bubble phase, but also present an electrical probing method for studying chiral spin texture formation, evolution and their topological properties, which opens up exciting possibilities for identifying new skyrmionic materials and advancing the methodology for studying chiral spin textures.

cond-mat.mtrl-sci↗

Active Asteroid 311P/PANSTARRS: Rotational Instability as the Origin of Multi-tails?

The active asteroid 311P is one of the two targets of a planned Chinese asteroid exploration mission Tianwen-2. During 2013, 311P experienced several mass-loss events and exhibited multiple comet-like tails. Here we analyze the morphology and surface brightness of the tails to investigate the dust environment around the nucleus and mechanism of activities. We enhance the features of the tails using image processing techniques to obtain information about the morphology of the tails, and fit processed images to the syndyne-synchrone diagrams. The fitting results give estimations of the upper limits of the durations ($2\sim8$ days) of eruptions and the dust size range ($0.006\sim38.9$ mm) in the tails. The results of surface photometry performed for each dust tail show that the brightness distribution index of each tail ranged from approximately -1.81 to 0 and the dust size distribution indices of 311P's tails ranged from -2.29 to -1.45. The quantity of particles in each tail ranged from 0.5 to 8 $\times10^6$\,kg, which leads to a total dust-loss quantity of $3.0\times10^7$\,kg and a mass loss rate of 1.59 kg s$^{-1}$. Sublimation, continuous impacts or tidal forces of planets are excluded as explanations for 311P's activities, and rotational instability remains a possible activation cause without strong evidence against it.

astro-ph.EP↗

Opacities of dense gas tracers in galactic massive star-forming regions

Optical depths of dense molecular gas are commonly used in Galactic and extragalactic studies to constrain the dense gas mass of the clouds or galaxies. The optical depths are often obtained based on spatially unresolved data, especially in galaxies, which may affect the reliability of such measurements. We examine such effects in spatially resolved Galactic massive star-forming regions. Using the 10-m SMT telescope, we mapped HCN and H13CN 3-2, HCO+, and H13CO+ 3-2 towards 51 Galactic massive star-forming regions, 30 of which resulted in robust determination of spatially resolved optical depths. Conspicuous spatial variations of optical depths have been detected within each source. We first obtained opacities for each position and calculated an optical-thick line intensity-weighted average, then averaged all the spectra and derived a single opacity for each region. The two were found to agree extremely well, with a linear least square correlation coefficient of 0.997 for the whole sample.

astro-ph.GA↗

A Bi-directional Multi-hop Inference Model for Joint Dialog Sentiment Classification and Act Recognition

The joint task of Dialog Sentiment Classification (DSC) and Act Recognition (DAR) aims to predict the sentiment label and act label for each utterance in a dialog simultaneously. However, current methods encode the dialog context in only one direction, which limits their ability to thoroughly comprehend the context. Moreover, these methods overlook the explicit correlations between sentiment and act labels, which leads to an insufficient ability to capture rich sentiment and act clues and hinders effective and accurate reasoning. To address these issues, we propose a Bi-directional Multi-hop Inference Model (BMIM) that leverages a feature selection network and a bi-directional multi-hop inference network to iteratively extract and integrate rich sentiment and act clues in a bi-directional manner. We also employ contrastive learning and dual learning to explicitly model the correlations of sentiment and act labels. Our experiments on two widely-used datasets show that BMIM outperforms state-of-the-art baselines by at least 2.6% on F1 score in DAR and 1.4% on F1 score in DSC. Additionally, Our proposed model not only improves the performance but also enhances the interpretability of the joint sentiment and act prediction task.

cs.CL↗

DialogRE^C+: An Extension of DialogRE to Investigate How Much Coreference Helps Relation Extraction in Dialogs

Dialogue relation extraction (DRE) that identifies the relations between argument pairs in dialogue text, suffers much from the frequent occurrence of personal pronouns, or entity and speaker coreference. This work introduces a new benchmark dataset DialogRE^C+, introducing coreference resolution into the DRE scenario. With the aid of high-quality coreference knowledge, the reasoning of argument relations is expected to be enhanced. In DialogRE^C+ dataset, we manually annotate total 5,068 coreference chains over 36,369 argument mentions based on the existing DialogRE data, where four different coreference chain types namely speaker chain, person chain, location chain and organization chain are explicitly marked. We further develop 4 coreference-enhanced graph-based DRE models, which learn effective coreference representations for improving the DRE task. We also train a coreference resolution model based on our annotations and evaluate the effect of automatically extracted coreference chains demonstrating the practicality of our dataset and its potential to other domains and tasks.

cs.CL↗

Revisiting Disentanglement and Fusion on Modality and Context in Conversational Multimodal Emotion Recognition

It has been a hot research topic to enable machines to understand human emotions in multimodal contexts under dialogue scenarios, which is tasked with multimodal emotion analysis in conversation (MM-ERC). MM-ERC has received consistent attention in recent years, where a diverse range of methods has been proposed for securing better task performance. Most existing works treat MM-ERC as a standard multimodal classification problem and perform multimodal feature disentanglement and fusion for maximizing feature utility. Yet after revisiting the characteristic of MM-ERC, we argue that both the feature multimodality and conversational contextualization should be properly modeled simultaneously during the feature disentanglement and fusion steps. In this work, we target further pushing the task performance by taking full consideration of the above insights. On the one hand, during feature disentanglement, based on the contrastive learning technique, we devise a Dual-level Disentanglement Mechanism (DDM) to decouple the features into both the modality space and utterance space. On the other hand, during the feature fusion stage, we propose a Contribution-aware Fusion Mechanism (CFM) and a Context Refusion Mechanism (CRM) for multimodal and context integration, respectively. They together schedule the proper integrations of multimodal and context features. Specifically, CFM explicitly manages the multimodal feature contributions dynamically, while CRM flexibly coordinates the introduction of dialogue contexts. On two public MM-ERC datasets, our system achieves new state-of-the-art performance consistently. Further analyses demonstrate that all our proposed mechanisms greatly facilitate the MM-ERC task by making full use of the multimodal and context features adaptively. Note that our proposed methods have the great potential to facilitate a broader range of other conversational multimodal tasks.

cs.CL↗

Weight hierarchies of 3-weight linear codes from two $p$-ary quadratic functions

The weight hierarchy of a linear code has been an important research topic in coding theory since Wei's original work in 1991. Choosing $ D=\Big\{(x,y)\in \Big(\F_{p^{s_1}}\times\F_{p^{s_2}}\Big)\Big\backslash\{(0,0)\}: f(x)+g(y)=0\Big\}$ as a defining set , where $f(x),g(y)$ are quadratic forms over $\mathbb{F}_{p^{s_i}},i=1,2$, respectively, with values in $\F_p$, we construct a family of 3-weight $p$-ary linear codes and determine their weight distributions and weight hierarchies completely. Most of the codes can be used in secret sharing schemes.

cs.IT↗

ECQED: Emotion-Cause Quadruple Extraction in Dialogs

The existing emotion-cause pair extraction (ECPE) task, unfortunately, ignores extracting the emotion type and cause type, while these fine-grained meta-information can be practically useful in real-world applications, i.e., chat robots and empathic dialog generation. Also the current ECPE is limited to the scenario of single text piece, while neglecting the studies at dialog level that should have more realistic values. In this paper, we extend the ECPE task with a broader definition and scenario, presenting a new task, Emotion-Cause Quadruple Extraction in Dialogs (ECQED), which requires detecting emotion-cause utterance pairs and emotion and cause types. We present an ECQED model based on a structural and semantic heterogeneous graph as well as a parallel grid tagging scheme, which advances in effectively incorporating the dialog context structure, meanwhile solving the challenging overlapped quadruple issue. Via experiments we show that introducing the fine-grained emotion and cause features evidently helps better dialog generation. Also our proposed ECQED system shows exceptional superiority over baselines on both the emotion-cause quadruple or pair extraction tasks, meanwhile being highly efficient.

cs.CL↗

TKDP: Threefold Knowledge-enriched Deep Prompt Tuning for Few-shot Named Entity Recognition

Few-shot named entity recognition (NER) exploits limited annotated instances to identify named mentions. Effectively transferring the internal or external resources thus becomes the key to few-shot NER. While the existing prompt tuning methods have shown remarkable few-shot performances, they still fail to make full use of knowledge. In this work, we investigate the integration of rich knowledge to prompt tuning for stronger few-shot NER. We propose incorporating the deep prompt tuning framework with threefold knowledge (namely TKDP), including the internal 1) context knowledge and the external 2) label knowledge & 3) sememe knowledge. TKDP encodes the three feature sources and incorporates them into the soft prompt embeddings, which are further injected into an existing pre-trained language model to facilitate predictions. On five benchmark datasets, our knowledge-enriched model boosts by at most 11.53% F1 over the raw deep prompt method, and significantly outperforms 8 strong-performing baseline systems in 5-/10-/20-shot settings, showing great potential in few-shot NER. Our TKDP can be broadly adapted to other few-shot tasks without effort.

cs.CL↗

Revisiting Conversation Discourse for Dialogue Disentanglement

Dialogue disentanglement aims to detach the chronologically ordered utterances into several independent sessions. Conversation utterances are essentially organized and described by the underlying discourse, and thus dialogue disentanglement requires the full understanding and harnessing of the intrinsic discourse attribute. In this paper, we propose enhancing dialogue disentanglement by taking full advantage of the dialogue discourse characteristics. First of all, in feature encoding stage, we construct the heterogeneous graph representations to model the various dialogue-specific discourse structural features, including the static speaker-role structures (i.e., speaker-utterance and speaker-mentioning structure) and the dynamic contextual structures (i.e., the utterance-distance and partial-replying structure). We then develop a structure-aware framework to integrate the rich structural features for better modeling the conversational semantic context. Second, in model learning stage, we perform optimization with a hierarchical ranking loss mechanism, which groups dialogue utterances into different discourse levels and carries training covering pair-wise and session-wise levels hierarchically. Third, in inference stage, we devise an easy-first decoding algorithm, which performs utterance pairing under the easy-to-hard manner with a global context, breaking the constraint of traditional sequential decoding order. On two benchmark datasets, our overall system achieves new state-of-the-art performances on all evaluations. In-depth analyses further demonstrate the efficacy of each proposed idea and also reveal how our methods help advance the task. Our work has great potential to facilitate broader multi-party multi-thread dialogue applications.

cs.CL↗

Reasoning Implicit Sentiment with Chain-of-Thought Prompting

While sentiment analysis systems try to determine the sentiment polarities of given targets based on the key opinion expressions in input texts, in implicit sentiment analysis (ISA) the opinion cues come in an implicit and obscure manner. Thus detecting implicit sentiment requires the common-sense and multi-hop reasoning ability to infer the latent intent of opinion. Inspired by the recent chain-of-thought (CoT) idea, in this work we introduce a Three-hop Reasoning (THOR) CoT framework to mimic the human-like reasoning process for ISA. We design a three-step prompting principle for THOR to step-by-step induce the implicit aspect, opinion, and finally the sentiment polarity. Our THOR+Flan-T5 (11B) pushes the state-of-the-art (SoTA) by over 6% F1 on supervised setup. More strikingly, THOR+GPT3 (175B) boosts the SoTA by over 50% F1 on zero-shot setting. Our code is open at https://github.com/scofield7419/THOR-ISA.

cs.CL↗

Generative Actor-Critic: An Off-policy Algorithm Using the Push-forward Model

Model-free deep reinforcement learning has achieved great success in many domains, such as video games, recommendation systems and robotic control tasks. In continuous control tasks, widely used policies with Gaussian distributions results in ineffective exploration of environments and limited performance of algorithms in many cases. In this paper, we propose a density-free off-policy algorithm, Generative Actor-Critic(GAC), using the push-forward model to increase the expressiveness of policies, which also includes an entropy-like technique, MMD-entropy regularizer, to balance the exploration and exploitation. Additionnally, we devise an adaptive mechanism to automatically scale this regularizer, which further improves the stability and robustness of GAC. The experiment results show that push-forward policies possess desirable features, such as multi-modality, which can improve the efficiency of exploration and asymptotic performance of algorithms obviously.

cs.LG↗

FACTUAL: A Benchmark for Faithful and Consistent Textual Scene Graph Parsing

Textual scene graph parsing has become increasingly important in various vision-language applications, including image caption evaluation and image retrieval. However, existing scene graph parsers that convert image captions into scene graphs often suffer from two types of errors. First, the generated scene graphs fail to capture the true semantics of the captions or the corresponding images, resulting in a lack of faithfulness. Second, the generated scene graphs have high inconsistency, with the same semantics represented by different annotations. To address these challenges, we propose a novel dataset, which involves re-annotating the captions in Visual Genome (VG) using a new intermediate representation called FACTUAL-MR. FACTUAL-MR can be directly converted into faithful and consistent scene graph annotations. Our experimental results clearly demonstrate that the parser trained on our dataset outperforms existing approaches in terms of faithfulness and consistency. This improvement leads to a significant performance boost in both image caption evaluation and zero-shot image retrieval tasks. Furthermore, we introduce a novel metric for measuring scene graph similarity, which, when combined with the improved scene graph parser, achieves state-of-the-art (SOTA) results on multiple benchmark datasets for the aforementioned tasks. The code and dataset are available at https://github.com/zhuang-li/FACTUAL .

cs.CL↗

DiaASQ : A Benchmark of Conversational Aspect-based Sentiment Quadruple Analysis

The rapid development of aspect-based sentiment analysis (ABSA) within recent decades shows great potential for real-world society. The current ABSA works, however, are mostly limited to the scenario of a single text piece, leaving the study in dialogue contexts unexplored. To bridge the gap between fine-grained sentiment analysis and conversational opinion mining, in this work, we introduce a novel task of conversational aspect-based sentiment quadruple analysis, namely DiaASQ, aiming to detect the quadruple of target-aspect-opinion-sentiment in a dialogue. We manually construct a large-scale high-quality DiaASQ dataset in both Chinese and English languages. We deliberately develop a neural model to benchmark the task, which advances in effectively performing end-to-end quadruple prediction, and manages to incorporate rich dialogue-specific and discourse feature representations for better cross-utterance quadruple extraction. We hope the new benchmark will spur more advancements in the sentiment analysis community.

cs.CL↗

Weight hierarchies of three-weight $p$-ary linear codes from inhomogeneous quadratic forms

The weight distribution and weight hierarchy of a linear code are two important research topics in coding theory. In this paper, choosing $ D=\Big\{(x,y)\in \Big(\F_{p^{s_1}}\times\F_{p^{s_2}}\Big)\Big\backslash\{(0,0)\}: f(x)+\Tr_1^{s_2}(αy)=0\Big\}$ as a defining set , where $α\in\mathbb{F}_{p^{s_2}}^*$ and $f(x)$ is a quadratic form over $\mathbb{F}_{p^{s_1}}$ with values in $\F_p$, whether $f(x)$ is non-degenerate or not, we construct a family of three-weight $p$-ary linear codes and determine their weight distributions and weight hierarchies. Most of the codes can be used in secret sharing schemes.

cs.IT↗