检索结果-内蒙古大学图书馆

VANER: Leveraging Large Language Model for Versatile and Adaptive Biomedical Named Entity Recognition 27

学校读者我要写书评

暂无评论

VANER: Leveraging Large Language Model for Versatile and Ada...

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Bian, Junyi Zhai, Weiqi Huang, Xiaodi Zheng, Jiaxuan Zhu, Shanfeng School of Computer Science Fudan University Shanghai200433 China Institute of Science and Technology for Brain-Inspired Intelligence Fudan University China Ministry of Education Shanghai200433 China MOE Frontiers Center for Brain Science Fudan University Shanghai200433 China Zhangjiang Fudan International Innovation Center Shanghai200433 China Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai200433 China School of Computing and Mathematics Charles Sturt University AlburyNSW2640 Australia

ISBN: (纸本)9781643685489

The prevalent solution for BioNER involves using representation learning techniques combined with sequence ***, such methods are inherently task-specific, demonstrate poor generalizability, and often require a dedicated model for each *** leverage the versatile capabilities of recent large language models (LLMs), several approaches have explored generative techniques for entity ***, these approaches often fall short compared to previous sequence labeling *** this paper, we utilize the open-sourced LLM LLaMA2 as the backbone model, and design specific instructions to distinguish between different types of entities and *** combining the LLM's understanding of instructions with sequence labeling techniques, we train a model using a mix of datasets capable of extracting various types of *** that the backbone LLMs lacks specialized medical knowledge, we also integrate external entity knowledge bases and employ instruction tuning to enable the model to densely recognize curated *** parameter-efficient training model, VANER, significantly outperforms previous LLMs-based *** the first time, as an LLM-based model, VANER surpasses the majority of conventional state-of-the-art BioNER systems, achieving the highest F1 scores across three datasets. © 2024 The Authors.

关键词： Labeled data

Investigation on a quantum algorithm for linear differential equations

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Dong, Xiaojing Peng, Yizhe Tang, Qili Yang, Yin Yu, Yue Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education National Center for Applied Mathematics in Hunan School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

Ref. [BCOW17] introduced a pioneering quantum approach (coined BCOW algorithm) for solving linear differential equations with optimal error tolerance. Originally designed for a specific class of diagonalizable linear differential equations, the algorithm was extended by Krovi in [Kro23] to encompass broader classes, including non-diagonalizable and even singular matrices. Despite the common misconception, the original algorithm is indeed applicable to non-diagonalizable matrices, with diagonalisation primarily serving for theoretical analyses to establish bounds on condition number and solution error. By leveraging basic estimates from [Kro23], we derive bounds comparable to those outlined in the Krovi algorithm, thereby reinstating the advantages of the BCOW approach. Furthermore, we extend the BCOW algorithm to address time-dependent linear differential equations by transforming non-autonomous systems into higher-dimensional autonomous ones, a technique also applicable for the Krovi algorithm. © 2024, CC BY-NC-ND.

关键词： Consensus algorithm

A Unified Framework Integrating Knowledge and Data for Collaborative Root Cause Identification

学校读者我要写书评

暂无评论

A Unified Framework Integrating Knowledge and Data for Colla...

Sensing, Measurement & Data Analytics in the era of Artificial Intelligence (ICSMD), International Conference on

作者： Jiefei Yu Zicheng Cao Siyi He Zuyi Gu Yingcheng Xu Kai Zhong Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Anhui University Anhui China Data Science and Big Data Technology School of Big Data and Statistics Anhui University Anhui China

ISBN: (数字)9798331529192

ISBN: (纸本)9798331529208

Capturing the root cause and propagation path of the fault is critical to ensuring the safety and efficiency of industrial processes, especially those that inadequately utilize process knowledge and data. To address this issue, a unified framework integrating knowledge and data for collaborative root cause identification is proposed. First, the knowledge causal graph (KCG) is constructed using expert knowledge and industrial flow charts, providing a preliminary reference for subsequent causality analysis. Next, by replacing the traditional vector autoregression (VAR) model in Granger Causality (GC) with the gated recurrent unit (GRU), a more reliable causal relationship between variables is obtained. Additionally, a causality fusion propagation path identification method (CF-PPI) is designed to identify the root cause and propagation path of the fault, so that the obtained fault propagation path has less redundancy and higher accuracy. Finally, the method is validated using data from the ASHRAE RP-1043 centrifugal chiller.

关键词： Fault diagnosis Knowledge engineering Reactive power Analytical models Delay effects Redundancy Collaboration Cause effect analysis Vectors Safety

Investigation of double-gyroid grain boundaries beyond twinning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chen, Jing Sun, Zhangpeng Jiang, Kai Xu, Jie Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China Chinese Academy of Sciences Beijing China

We study four double-gyroid (DG) grain boundaries (GBs) with different orientations numerically using the Landau–Brazovskii free energy, including the (422) twin boundary studied recently, a network switching GB, and two tilt GBs. Topological variations and geometric deformations are investigated. It is found that deviations in strut lengths and dihedral angles from the bulk DG substantially exceed changes in strut angles and nodal coplanarity. We also examine the spectra along the contact plane of two grains and utilize them to evaluate the GB widths. Of the four GBs we study, the network switching GB changes to the least extent topologically and geometrically, meanwhile has the lowest energy and the smallest GB width. Copyright © 2024, The Authors. All rights reserved.

关键词： Grain boundaries

Label Distribution Feature Selection Based on Neighborhood Rough Set

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Wu, Yilin Guo, Wenzhong Lin, Yaojin College of Computer and Data Science Fuzhou University Fuzhou350116 China Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China School of Computer Science Minnan Normal University Zhangzhou363000 China

In label distribution learning, an instance is involved with many labels in different importance degrees, and the feature space of instances is accompanied with thousands of redundant and/or irrelevant features. Therefore, the main characteristic of feature selection in label distribution learning is to evaluate the discriminable ability of each feature. Motivated by neighborhood rough set, which can be used to measure the dependency degree of feature via constructing neighborhood relations on feature space and label space, respectively, this paper proposes a novel lable distribution feature selection method. In this paper, the neighborhood class of instance in label distribution space is defined, which is beneficial to recognize the logical class of target instance. Then, a new neighborhood rough set model for label distribution learning is proposed. Specially, the dependency degree of feature combining label weight is defined. Finally, a label distribution feature selection based on neighborhood rough set is presented. Extensive experiments on 12 data sets show the effectiveness of the proposed algorithm. © 2024, The Authors. All rights reserved.

关键词： Feature Selection

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-...

International Conference on Acoustics, Speech, and Signal processing (ICASSP)

作者： Kaijun Deng Dezhi Zheng Jindong Xie Jinbao Wang Weicheng Xie Linlin Shen Siyang Song Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Department of Computer Science University of Exeter

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code is available at https://***/CVI-SZU/DEGSTalk.

关键词： Hair Training Three-dimensional displays Dynamics Signal processing Rendering (computer graphics) Noise measurement Speech processing Faces Videos

Few-shot Class-Incremental Semantic Segmentation via Pseudo-Labeling and Knowledge Distillation

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Jiang, Chengjia Wang, Tao Li, Sien Wang, Jinyang Wang, Shirui Antoniou, Antonios Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou China The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions Wuyi University Wuyishan China College of Computer and Data Science Fuzhou University Fuzhou China Department of Computer Science and Engineering European University Cyprus Nicosia Cyprus

We address the problem of learning new classes for semantic segmentation models from few examples, which is challenging because of the following two reasons. Firstly, it is difficult to learn from limited novel data to capture the underlying class distribution. Secondly, it is challenging to retain knowledge for existing classes and to avoid catastrophic forgetting. For learning from limited data, we propose a pseudo-labeling strategy to augment the few-shot training annotations in order to learn novel classes more effectively. Given only one or a few images labeled with the novel classes and a much larger set of unlabeled images, we transfer the knowledge from labeled images to unlabeled images with a coarse-to-fine pseudo-labeling approach in two steps. Specifically, we first match each labeled image to its nearest neighbors in the unlabeled image set at the scene level, in order to obtain images with a similar scene layout. This is followed by obtaining pseudo-labels within this neighborhood by applying classifiers learned on the few-shot annotations. In addition, we use knowledge distillation on both labeled and unlabeled data to retain knowledge on existing classes. We integrate the above steps into a single convolutional neural network with a unified learning objective. Extensive experiments on the Cityscapes and KITTI datasets validate the efficacy of the proposed approach in the self-driving domain. Code is available from https://***/ChasonJiang/FSCILSS. Copyright © 2023, The Authors. All rights reserved.

关键词： Distillation

AN EFFICIENT NULLSPACE-PRESERVING SADDLE SEARCH METHOD FOR PHASE TRANSITIONS INVOLVING TRANSLATIONAL INVARIANCE

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Cui, Gang Jiang, Kai Zhou, Tiejun Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

In this work, we propose an efficient nullspace-preserving saddle search (NPSS) method for a class of phase transitions involving translational invariance, where the critical states are often degenerate. The NPSS method includes two stages, escaping from the basin and searching for the index-1 generalized saddle point. The NPSS method climbs upward from the generalized local minimum in segments to overcome the challenges of degeneracy. In each segment, an effective ascent direction is ensured by keeping this direction orthogonal to the nullspace of the initial state in this segment. This method can escape the basin quickly and converge to the transition states. We apply the NPSS method to the phase transitions between crystals, and between crystal and quasicrystal, based on the Landau-Brazovskii and Lifshitz-Petrich free energy functionals. Numerical results show a good performance of the NPSS *** Codes 37M05, 49K35, 37N30 © 2023, CC BY-NC-ND.

关键词： Free energy

Learning Open-vocabulary Semantic Segmentation Models From Natural Language Supervision

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Xu, Jilan Hou, Junlin Zhang, Yuejie Feng, Rui Wang, Yi Qiao, Yu Xie, Weidi School of Computer Science Shanghai Key Lab of Intelligent Information Processing Shanghai Collaborative Innovation Center of Intelligent Visual Computing Fudan University China Shanghai AI Laboratory China Shanghai Jiaotong University China

In this paper, we consider the problem of open-vocabulary semantic segmentation (OVS), which aims to segment objects of arbitrary classes instead of pre-defined, closed-set categories. The main contributions are as follows: First, we propose a transformer-based model for OVS, termed as OVSegmentor, which only exploits web-crawled image-text pairs for pre-training without using any mask annotations. OVSegmentor assembles the image pixels into a set of learnable group tokens via a slot-attention based binding module, and aligns the group tokens to the corresponding caption embedding. Second, we propose two proxy tasks for training, namely masked entity completion and cross-image mask consistency. The former aims to infer all masked entities in the caption given the group tokens, that enables the model to learn fine-grained alignment between visual groups and text entities. The latter enforces consistent mask predictions between images that contain shared entities, which encourages the model to learn visual invariance. Third, we construct CC4M dataset for pre-training by filtering CC12M with frequently appeared entities, which significantly improves training efficiency. Fourth, we perform zero-shot transfer on three benchmark datasets, PASCAL VOC 2012, PASCAL Context, and COCO Object. Our model achieves superior segmentation results over the state-of-the-art method by using only 3% data (4M vs 134M) for pre-training. Code and pre-trained models will be released for future research. © 2023, CC BY.

关键词： Semantics