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

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

学校读者我要写书评

暂无评论

arXiv 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

Prevalent solution for BioNER involves using representation learning techniques coupled with sequence labeling. However, such methods are inherently task-specific, demonstrate poor generalizability, and often require dedicated model for each dataset. To leverage the versatile capabilities of recently remarkable large language models (LLMs), several endeavors have explored generative approaches to entity extraction. Yet, these approaches often fall short of the effectiveness of previouly sequence labeling approaches. In 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 datasets. By combining the LLM’s understanding of instructions with sequence labeling techniques, we use mix of datasets to train a model capable of extracting various types of entities. Given that the backbone LLMs lacks specialized medical knowledge, we also integrate external entity knowledge bases and employ instruction tuning to compel the model to densely recognize carefully curated entities. Our model VANER, trained with a small partition of parameters, significantly outperforms previous LLMs-based models and, for the first time, as a model based on LLM, surpasses the majority of conventional state-of-the-art BioNER systems, achieving the highest F1 scores across three datasets. Copyright © 2024, The Authors. All rights reserved.

关键词： Computational linguistics

Disentangled Generation Network for Enlarged License Plate Recognition and A Unified Dataset

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Chenglong Yang, Xiaobin Wang, Guohao Zheng, Aihua Tan, Chang Jia, Ruoran Tang, Jin Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Artificial Intelligence Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Key Lab of Intelligent Computing and Signal Processing Ministry of Education Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China iFLYTEK Co. Ltd. Hefei230088 China

License plate recognition plays a critical role in many practical applications, but license plates of large vehicles are difficult to be recognized due to the factors of low resolution, contamination, low illumination, and occlusion, to name a few. To overcome the above factors, the transportation management department generally introduces the enlarged license plate behind the rear of a vehicle. However, enlarged license plates have high diversity as they are non-standard in position, size, and style. Furthermore, the background regions contain a variety of noisy information which greatly disturbs the recognition of license plate characters. Existing works have not studied this challenging problem. In this work, we first address the enlarged license plate recognition problem and contribute a dataset containing 9342 images, which cover most of the challenges of real scenes. However, the created data are still insufficient to train deep methods of enlarged license plate recognition, and building large-scale training data is very time-consuming and high labor cost. To handle this problem, we propose a novel task-level disentanglement generation framework based on the Disentangled Generation Network (DGNet), which disentangles the generation into the text generation and background generation in an end-to-end manner to effectively ensure diversity and integrity, for robust enlarged license plate recognition. Extensive experiments on the created dataset are conducted, and we demonstrate the effectiveness of the proposed approach in three representative text recognition frameworks. © 2022, CC BY.

关键词： Optical character recognition

Challenge-aware U-net for breast lesion segmentation in ultrasound images

学校读者我要写书评

暂无评论

Pattern Recognition 2025年 168卷

作者： Dengdi Sun Changxu Dong Yuchen Yan Bo Jiang Yayang Duan Zhengzheng Tu Chaoxue Zhang Key Laboratory of Intelligent Computing & Signal Processing (ICSP) Ministry of Education School of Artificial Intelligence Anhui University China Institute of Artificial Intelligence Hefei Comprehensive National Science Center China Anhui Provincial Key Laboratory of Multimodal Cognitive Computing School of Computer Science and Technology Anhui University China Department of Ultrasound the First Affiliated Hospital of Anhui Medical University China

Deep learning methods can enhance the efficiency of tumor segmentation in breast ultrasound (BUS) images. However, noise interference, small tumors, and blurred boundaries can reduce segmentation accuracy. We design a three-branch challenge-aware U-net (CAU-net) to address these main challenges in BUS images. Our CAU-net extracts the features from three challenge-aware encoders in parallel first. Secondly, we propose an adaptive aggregation layer (AAL) to merge the multi-scale features of three challenging branches, enabling the network to adaptively handle different breast lesion samples with these main challenges. To further enhance the accuracy of segmentation, we introduce the graph reasoning module (GRM) to the network to model the correlation between the channels of the features and acquire the global information in the features. The result of our experiment on two datasets demonstrates the superiority of CAU-net over the advanced medical image segmentation methods. Our code can be downloaded from https://***/tzz-ahu .

关键词：

学校读者我要写书评

暂无评论

14th International Conference on Bio-inspired computing: Theories and Applications, BIC-TA 2019

作者： Sun, Dengdi Sun, Haifeng Wu, Hang Liang, Huadong Ding, Zhuanlian Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei230601 China iFlytek Co. Ltd. Hefei230088 China School of Internet Anhui University Hefei230039 China

ISBN: (纸本)9789811534140

Determining the functional roles of proteins is a vital task to understand life at molecular level and has great biomedical and pharmaceutical implications. With the development of novel high-throughput techniques, enormous amounts of protein-protein interaction (PPI) data are collected and provide an important and feasible way for studying protein function predictions. According to this, many approaches assign biological functions to all proteins using PPI networks directly. However, due to the extreme complexity of the topology structure of real PPI networks, it is very difficult and time consuming to seek the global optimization or clustering on the networks. In addition, biological functions are often highly correlated, which makes functions assigned to proteins are not independent. To address these challenges, in this paper we propose a two-stage function annotation method with robust feature selection. First, we transform the network into the low-dimensional representations of nodes via manifold learning. Then, we integrate the functional correlation into the framework of multi-label linear regression, and introduce robust sparse penalty to achieve the function assignment and representative feature selection simultaneously. For the optimization, we design an efficient algorithm to iteratively solve several subproblems with closed-form solutions. Extensive experiments against other baseline methods on Saccharomyces cerevisiae data demonstrate the effectiveness of the proposed approach. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Proteins

On the structure of 1-generator quasi-polycyclic codes over finite chain rings

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wu, Rongsheng Shi, Minjia Solé, Patrick Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China Lab I2M CNRS Aix-Marseille University Centrale Marseille Marseille France

Quasi-polycyclic (QP for short) codes over a finite chain ring R are a generalization of quasi-cyclic codes, and these codes can be viewed as an R[x]-submodule of Rm, where Rm := R[x]/hfi, and f is a monic polynomial of degree m over R. If f factors uniquely into monic and coprime basic irreducibles, then their algebraic structure allow us to characterize the generator polynomials and the minimal generating sets of 1-generator QP codes as R-modules. In addition, we also determine the parity check polynomials for these codes by using the strong Gröbner bases. In particular, via Magma system, some quaternary codes with new parameters are derived from these 1-generator QP codes. © 2021, CC0.

关键词： Polynomials

Design of low-profile wide-band high-gain circularly polarized antenna based on metasurface

学校读者我要写书评

暂无评论

Design of low-profile wide-band high-gain circularly polariz...

International Conference on Numerical Electromagnetic Modeling and Optimization for RF, Microwave, and Terahertz Applications (NEMO)

作者： Wei Zhang Liang Zhang Xianliang Wu key lab of intelligent computing & signal processing ministry of education anhui university Anhui University Hefei China key lab of intelligent computing & signal processing ministry of education anhui university AnHui Province Key Laboratory of simulation and design for Electronic information system Hefei Normal university Hefei Normal University Hefei China

ISBN: (数字)9781728169668

ISBN: (纸本)9781728169675

This paper proposes a wide-band low-profile high-gain microstrip slot antenna loaded with a mushroom-type metasurface structure. By directly loading the metamaterial structure on the upper surface of the slot antenna, low profile loading characteristics are realized and the antenna bandwidth is expanded. And by inserting the metal line array in the metamaterial dielectric board to improve the antenna gain. Change the gap width through the metasurface element with corner cut to produce a phase difference and realize circularly polarized. Simulation test and analysis of antenna through HFSS simulation software. The results show that the antenna with this metasurface has a profile height of only 0.09×λ(λ =27 mm), a relative impedance band-width of 20.4% (S 11

关键词： Slot antennas Microstrip antennas Metasurfaces Metamaterials Microstrip Loaded antennas Gain

Gradually Vanishing Gap in Prototypical Network for Unsupervised Domain Adaptation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Shanshan Zhou, Hao Yang, Xun He, Zhenwei Wang, Mengzhu Zhang, Xingyi Wang, Meng The Information Materials and Intelligent Sensing Laboratory of Anhui Province Institutes of Physical Science and Information Technology Anhui University Hefei230601 China The Department of Electronic Engineering and Information Science School of Information Science and Technology University of Science and Technology of China Hefei230026 China The College of Computer Science and Engineering Chongqing University of Technology Chongqing400054 China The School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China The School of Artificial Intelligence Hebei University of Technology Tianjin China The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education The School of Computer Science and Technology Anhui University Hefei230601 China

Unsupervised domain adaptation (UDA) is a critical problem for transfer learning, which aims to transfer the semantic information from labeled source domain to unlabeled target domain. Recent advancements in UDA models have demonstrated significant generalization capabilities on the target domain. However, the generalization boundary of UDA models remains unclear. When the domain discrepancy is too large, the model can not preserve the distribution structure, leading to distribution collapse during the alignment. To address this challenge, we propose an efficient UDA framework named Gradually Vanishing Gap in Prototypical Network (GVG-PN), which achieves transfer learning from both global and local perspectives. From the global alignment standpoint, our model generates a domain-biased intermediate domain that helps preserve the distribution structures. By entangling cross-domain features, our model progressively reduces the risk of distribution collapse. However, only relying on global alignment is insufficient to preserve the distribution structure. To further enhance the inner relationships of features, we introduce the local perspective. We utilize the graph convolutional network (GCN) as an intuitive method to explore the internal relationships between features, ensuring the preservation of manifold structures and generating domain-biased prototypes. Additionally, we consider the discriminability of the inner relationships between features. We propose a pro-contrastive loss to enhance the discriminability at the prototype level by separating hard negative pairs. By incorporating both GCN and the pro-contrastive loss, our model fully explores fine-grained semantic relationships. Experiments on several UDA benchmarks validated that the proposed GVG-PN can clearly outperform the SOTA models. Copyright © 2024, The Authors. All rights reserved.

关键词： Alignment

A Wideband Millimeter Wave E-shape Antenna in Package with Embedded Wafer Level Ball Grid Array Technology

学校读者我要写书评

暂无评论

A Wideband Millimeter Wave E-shape Antenna in Package with E...

International Conference on Numerical Electromagnetic Modeling and Optimization for RF, Microwave, and Terahertz Applications (NEMO)

作者： Bin Lu Haoran Zhu Zongming Duan Yuefei Dai Key Lab of Intelligent Computing & Signal Processing Ministry of Education Anhu University Hefei China Key Lab of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China Anhui Province Engineer Laboratory for Antennas and Microwave The 38th Research Institute of China Electronic Technology Group Corporationy Hefei China

ISBN: (数字)9781728169668

ISBN: (纸本)9781728169675

The feasibility of an antenna-in-package (AiP) concept is demonstrated for automotive radar sensors at the 77 GHz-band. Infineon's embedded wafer level ball grid array (eWLB) is employed as packaging technology. We developed a E-shape patch antenna in 6×6 mm 2 eWLB package that include 2×2 mm 2 dummy Si chips. From the simulated results of the proposed E-plane patch antenna, provides a wide bandwidth of 19.2% (|S 11 |

关键词： Patch antennas Radar antennas Sensors Broadband antennas Wideband Antenna arrays Electronics packaging

Refining BERT embeddings for document hashing via mutual information maximization

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ou, Zijing Su, Qinliang Yu, Jianxing Zhao, Ruihui Zheng, Yefeng Liu, Bang School of Computer Science and Engineering Sun Yat-sen University Guangzhou China School of Artificial Intelligence Sun Yat-sen University Guangdong China Tencent Jarvis Lab Rali & Mila Université de Montréal Guangdong Key Lab. of Big Data Analysis and Processing Guangzhou China Key Lab. of Machine Intelligence and Advanced Computing Ministry of Education China

Existing unsupervised document hashing methods are mostly established on generative models. Due to the difficulties of capturing long dependency structures, these methods rarely model the raw documents directly, but instead to model the features extracted from them (e.g. bag-of-words (BOW), TFIDF). In this paper, we propose to learn hash codes from BERT embeddings after observing their tremendous successes on downstream tasks. As a first try, we modify existing generative hashing models to accommodate the BERT embeddings. However, little improvement is observed over the codes learned from the old BOW or TFIDF features. We attribute this to the reconstruction requirement in the generative hashing, which will enforce irrelevant information that is abundant in the BERT embeddings also compressed into the codes. To remedy this issue, a new unsupervised hashing paradigm is further proposed based on the mutual information (MI) maximization principle. Specifically, the method first constructs appropriate global and local codes from the documents and then seeks to maximize their mutual information. Experimental results on three benchmark datasets demonstrate that the proposed method is able to generate hash codes that outperform existing ones learned from BOW features by a substantial margin. Copyright © 2021, The Authors. All rights reserved.

关键词： Embeddings