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

SLMP: A Scientific Literature Management Platform Based on Large Language Models

学校读者我要写书评

暂无评论

SLMP: A Scientific Literature Management Platform Based on L...

IEEE International Conference on Big knowledge (ICBK)

作者： Menghao Guo Jinling Jiang Fan Wu Shanxin Sun Chen Zhang Wenhui Li Zeyi Sun Guangyong Chen Xindong Wu Research Center for Life Sciences Computing Zhejiang Lab Hangzhou China Research Center for Data Hub and Security Zhejiang Lab Hangzhou China Research Center for High Efficiency Computing System Zhejiang Lab Hangzhou China Key Laboratory of Knowledge Engineering With Big Data Hefei University of Technology Hefei China

ISBN: (数字)9798331508821

ISBN: (纸本)9798331508838

This paper presents a Scientific Literature Management Platform (SLMP, demo link 1 ) based on large language models (LLMs). The platform consists of four modules: literature management, literature extraction, literature retrieval, and question answering. The core techniques used to support the four modules across the platform include a fine-tuned model PaperExtractGPT and a continual pre-training model ChatPaperGPT based on ChatGLM 2 using the data from scientific research literature, responsible for information extraction and communication, respectively. Due to their powerful capabilities in natural language understanding and generation, LLMs can understand complex scientific concepts based on the provided contexts, and thus generate high-quality texts and conduct in-depth information retrieval and question answering. Our platform can help researchers manage and utilize literature more effectively and efficiently for finding relevant literature, obtaining required information, and generating new knowledge.

关键词： Training Large language models knowledge graphs Information retrieval data models Question answering (information retrieval)

Assessing Extraneous and Intrinsic Cognitive Load in Space Teleoperated Tasks: A Physiological Metrics Study with Cognitive Load Theory

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Yan, Zhao Wang, Yahui Chen, Shanguang Yang, Xiaonan Hua, Yaoguang Fang, Haonan Wang, Chaoran School of Mechanical Engineering Beijing Institute of Technology Beijing100081 China Yangtze Delta Region Academy Beijing Institute of Technology Jiaxing314019 China Key Laboratory of Industry Knowledge & Data Fusion Technology and Application Ministry of Industry and Information Technology Beijing Institute of Technology Beijing100081 China Astronaut Center of China National Key Laboratory of Human Factors Engineering China

This study aimed to explore the relationship between physiological performance indicators and both intrinsic and extrinsic cognitive loads during a space robot grasping task, which involves teleoperation requiring high levels of spatial and motor coordination, attention, and decision-making. The hypothesis posited that operational mode would influence extrinsic cognitive load, while task difficulty would impact intrinsic cognitive load. Additionally, a correlation was expected between physiological performance indicators and cognitive load. To test this, a 2x2 factorial experiment was conducted with independent variables being task difficulty (high vs. low) and operational mode (joystick vs. keys), and dependent variables including cognitive load, performance, and learning outcomes. Subjective scales were used to assess intrinsic and extrinsic cognitive load, and physiological data were collected to examine their correlation with cognitive load. The results indicate that operational mode and task difficulty significantly affect cognitive load in space exploration contexts. Specifically, the 'Joystick' mode was associated with higher extrinsic cognitive load, likely due to the challenges it presents in precise control during complex tasks. Performance metrics showed that attention allocation varied by operational mode, with the 'Joystick' mode requiring greater focus on the side view and end-effector, in line with cognitive load theory. Physiological metrics, particularly pupil diameter and EEG data, were crucial in understanding these effects;a decrease in pupil diameter with increased task difficulty reflected heightened intrinsic cognitive load. EEG data further revealed significant variations in brain activity across frontal, prefrontal, and occipital regions, with distinct changes in alpha, theta, and beta frequency bands, highlighting the substantial impact of cognitive load on neural processes. These findings underscore the importance of integrating cognitive

关键词： Space research

LSBert: Lexical Simplification Based on BERT

学校读者我要写书评

暂无评论

IEEE/ACM Transactions on Audio Speech and Language Processing 2021年 29卷 3064-3076页

作者： Qiang, Jipeng Li, Yun Zhu, Yi Yuan, Yunhao Shi, Yang Wu, Xindong Department of Computer Science Jiangsu Yangzhou China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Anhui Hefei China Mininglamp Academy of Sciences Minininglamp Beijing 100864 China

Lexical simplification (LS) aims at replacing complex words with simpler alternatives. LS commonly consists of three main steps: complex word identification, substitute generation, and substitute ranking. Existing LS methods focus on the contextual information of the complex word in the last step (substitute ranking). However, they miss out the following two facts: (1) The word complexity of a polysemous word is very closely related to its context;(2) The step of substitute generation regardless of the context will inevitably produce a large number of spurious candidates. Therefore, we propose a novel LS system LSBert based on pretrained language model BERT to address the aforementioned issues, which is capable of making use of the wider context when both identifying the words in need of simplification and generating substitute candidates for the complex words. Specifically, LSBert consists of a network for complex word identification by fine-tuning BERT and a network for substitute generation based on BERT. Experimental results show that LSBert performs well in both complex word identification and substitute generation, achieving state-of-the-art results in three benchmarks. © 2014 IEEE.

关键词： BERT Complex word identification Lexical simplification Sentence simplification

Asymmetric Cross-Scale Alignment for Text-Based Person Search

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Ji, Zhong Hu, Junhua Liu, Deyin Wu, Lin Yuanbo Zhao, Ye The School of Electrical and Information Engineering Tianjin University Tianjin300072 China Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Artificial Intelligence Anhui University Hefei230039 China Department of Computer Science Swansea University SA1 8EN United Kingdom The Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China

Text-based person search (TBPS) is of significant importance in intelligent surveillance, which aims to retrieve pedestrian images with high semantic relevance to a given text description. This retrieval task is characterized with both modal heterogeneity and fine-grained matching. To implement this task, one needs to extract multi-scale features from both image and text domains, and then perform the cross-modal alignment. However, most existing approaches only consider the alignment confined at their individual scales, e.g., an image-sentence or a region-phrase scale. Such a strategy adopts the presumable alignment in feature extraction, while overlooking the cross-scale alignment, e.g., image-phrase. In this paper, we present a transformer-based model to extract multi-scale representations, and perform Asymmetric Cross-Scale Alignment (ACSA) to precisely align the two modalities. Specifically, ACSA consists of a global-level alignment module and an asymmetric cross-attention module, where the former aligns an image and texts on a global scale, and the latter applies the cross-attention mechanism to dynamically align the cross-modal entities in region/image-phrase scales. Extensive experiments on two benchmark datasets CUHK-PEDES and RSTPReid demonstrate the effectiveness of our approach. Codes are available at https://***/mulhjh/ACSA. Copyright © 2022, The Authors. All rights reserved.

关键词： Alignment

Block-Structured Optimization for Anomalous Pattern Detection in Interdependent Networks

学校读者我要写书评

暂无评论

Block-Structured Optimization for Anomalous Pattern Detectio...

IEEE International Conference on data Mining (ICDM)

作者： Fei Jie Chunpai Wang Feng Chen Lei Li Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science University at Albany – SUNY Albany NY USA Erik Jonsson School of Engineering & Computer Science The University of Texas at Dallas Dallas TX USA Mininglamp Academy of Sciences Mininglamp Technology Beijing China Institute of Big Knowledge Science Hefei University of Technology Hefei China

We propose a generalized optimization framework for detecting anomalous patterns (subgraphs that are interesting or unexpected) in interdependent networks, such as multi-layer networks, temporal networks, networks of networks, and many others. We frame the problem as a non-convex optimization that has a general nonlinear score function and a set of block-structured and non-convex constraints. We develop an effective, efficient, and parallelizable projection-based algorithm, namely Graph Block-structured Gradient Projection (GBGP), to solve the problem. It is proved that our algorithm 1) runs in nearly-linear time on the network size, and 2) enjoys a theoretical approximation guarantee. Moreover, we demonstrate how our framework can be applied to two very practical applications, and we conduct comprehensive experiments to show the effectiveness and efficiency of our proposed algorithm.

关键词：

Block-Structured Optimization for Subgraph Detection in Interdependent Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Jie, Fei Wang, Chunpai Chen, Feng Li, Lei Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science University at Albany – SUNY AlbanyNY United States Erik Jonsson School of Engineering & Computer Science The University of Texas at Dallas DallasTX United States Mininglamp Academy of Sciences Mininglamp Technologies Beijing China Institute of Big Knowledge Science Hefei University of Technology Hefei China

We propose a generalized framework for block-structured nonconvex optimization, which can be applied to structured subgraph detection in interdependent networks, such as multi-layer networks, temporal networks, networks of networks, and many others. Specifically, we design an effective, efficient, and parallelizable projection algorithm, namely Graph Block-structured Gradient Projection (GBGP), to optimize a general non-linear function subject to graph-structured constraints. We prove that our algorithm: 1) runs in nearly-linear time on the network size;2) enjoys a theoretical approximation guarantee. Moreover, we demonstrate how our framework can be applied to two very practical applications and conduct comprehensive experiments to show the effectiveness and efficiency of our proposed algorithm. Copyright © 2022, The Authors. All rights reserved.

关键词： Functions

data-Driven Single Image Deraining: A Comprehensive Review and New Perspectives

学校读者我要写书评

暂无评论

TechRxiv

TechRxiv 2021年

作者： Zhang, Zhao Wei, Yanyan Zhang, Haijun Yang, Yi Yan, Shuicheng Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei230009 China Shenzhen China Centre for Artificial Intelligence University of Technology Sydney SydneyNSW Australia Department of Electrical and Computer Engineering National University of Singapore Singapore Hefei University of Technology China

Single Image Deraining task aims at recovering the rain-free background from an image degraded by rain streaks and rain accumulation. For the powerful fitting ability of deep neural networks and massive training data, data-driven deep SID methods obtained significant improvement over traditional ones. Current SID methods usually focus on improving the deraining performance by proposing different kinds of deraining networks, while neglecting the interpretation of the solving process. As a result, the generalization ability may still be limited in real-world scenarios, and the deraining results also cannot effectively improve the performance of subsequent high-level tasks (e.g., object detection). To explore these issues, we in this paper re-examine the three important factors (i.e., data, rain model and network architecture) for the SID problem, and specifically analyze them by proposing new and more reasonable criteria (i.e., general vs. specific, synthetical vs. mathematical, black-box vs. white-box). We also study the relationship of the three factors from a new perspective of data, and reveal two different solving paradigms (explicit vs. implicit) for the SID task. We further discuss the current mainstream data-driven SID methods from five aspects, i.e., training strategy, network pipeline, domain knowledge, data preprocessing, and objective function, and some useful conclusions are summarized by statistics. Besides, we profoundly studied one of the three factors, i.e., data, and measured the performance of current methods on different datasets through extensive experiments to reveal the effectiveness of SID data. Finally, with the comprehensive review and in-depth analysis, we draw some valuable conclusions and suggestions for future research. © 2021, CC BY.

关键词： Object detection

Document-level Relation Extraction with Relation Correlations

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Han, Ridong Peng, Tao Wang, Benyou Liu, Lu Wan, Xiang College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China College of Software Jilin University China Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China School of Data Science The Chinese University of Hong Kong Shenzhen China

Document-level relation extraction faces two overlooked challenges: long-tail problem and multi-label problem. Previous work focuses mainly on obtaining better contextual representations for entity pairs, hardly address the above challenges. In this paper, we analyze the co-occurrence correlation of relations, and introduce it into DocRE task for the first time. We argue that the correlations can not only transfer knowledge between data-rich relations and data-scarce ones to assist in the training of tailed relations, but also reflect semantic distance guiding the classifier to identify semantically close relations for multi-label entity pairs. Specifically, we use relation embedding as a medium, and propose two co-occurrence prediction sub-tasks from both coarse- and fine-grained perspectives to capture relation correlations. Finally, the learned correlation-aware embeddings are used to guide the extraction of relational facts. Substantial experiments on two popular DocRE datasets are conducted, and our method achieves superior results compared to baselines. Insightful analysis also demonstrates the potential of relation correlations to address the above challenges. Copyright © 2022, The Authors. All rights reserved.

关键词： Extraction

Few-shot deep adversarial learning for video-based person re-identification

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Wu, Lin Wang, Yang Yin, Hongzhi Wang, Meng Shao, Ling Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei230000 China School of Computer Science and Information Engineering Hefei University of Technology Hefei230000 China University of Queensland St Lucia4072 Australia School of Computer Science and Information Engineering Hefei University of Technology Hefei230000 China Abu Dhabi United Arab Emirates

Video-based person re-identification (re-ID) refers to matching people across camera views from arbitrary unaligned video footages. Existing methods rely on supervision signals to optimise a projected space under which the distances between inter/intra-videos are maximised/minimised. However, this demands exhaustively labelling people across camera views, rendering them unable to be scaled in large networked cameras. Also, it is noticed that learning effective video representations with view invariance is not explicitly addressed for which features exhibit different distributions otherwise. Thus, matching videos for person re-ID demands flexible models to capture the dynamics in time-series observations and learn view-invariant representations with access to limited labeled training samples. In this paper, we propose a novel few-shot deep learning approach to video-based person re-ID, to learn comparable representations that are discriminative and view-invariant. The proposed method is developed on the variational recurrent neural networks (VRNNs) and trained adversarially to produce latent variables with temporal dependencies that are highly discriminative yet view-invariant in matching persons. Through extensive experiments conducted on three benchmark datasets, we empirically show the capability of our method in creating view-invariant temporal features and state-of-the-art performance achieved by our method. Copyright © 2019, The Authors. All rights reserved.

关键词： Recurrent neural networks