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

arXiv 2025年

作者： Chen, Tingwei Chen, Jiayi Zhao, Zijian Chen, Haolong Zhang, Liang Zhu, Guangxu Shenzhen Research Institute of Big Data Shenzhen China Shenzhen China School of Computer Science and Engineering Sun Yat-sen University Guangzhou China

Large Language Models (LLMs) have garnered significant attention for their impressive general-purpose capabilities. For applications requiring intricate domain knowledge, Retrieval-Augmented Generation (RAG) has shown a distinct advantage in incorporating domain-specific information into LLMs. However, existing RAG research has not fully addressed the challenges of Multiple Choice Question Answering (MCQA) in telecommunications, particularly in terms of retrieval quality and mitigating hallucinations. To tackle these challenges, we propose a novel first token probability guided RAG framework. This framework leverages confidence scores to optimize key hyperparameters, such as chunk number and chunk window size, while dynamically adjusting the context. Our method starts by retrieving the most relevant chunks and generates a single token as the potential answer. The probabilities of all options are then normalized to serve as confidence scores, which guide the dynamic adjustment of the context. By iteratively optimizing the hyperparameters based on these confidence scores, we can continuously improve RAG performance. We conducted experiments to validate the effectiveness of our framework, demonstrating its potential to enhance accuracy in domain-specific MCQA tasks. Copyright © 2025, The Authors. All rights reserved.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

Multi-scale Variable Window Attention Network for Continuous Sign Language Recognition

Multi-scale Variable Window Attention Network for Continuous...

引用

2024 International Conference on Cyber-Physical Social Intelligence, ICCSI 2024

作者： Zhang, Nan Wei, Chao Guo, Leming Cheng, Zeyu Zhao, Zhao Wu, Yangcan Xue, Wanli Tianjin University of Technology School of Computer Science and Engineering Tianjin China Tianjin Emergency Centre Tianjin China Tianjin University of Technology School of Mechanical Engineering Tianjin China Shaanxi Big Data Group Co. Ltd Shaanxi China Industry Research Institute Co Shaanxi Logistics Group Shaanxi China

ISBN: (纸本)9798350376739

Sign language is primarily conveyed through hands and face movements. Therefore, a pivotal challenge in continuous sign language recognition (CSLR) is the meticulous modeling and interpreting of visual cues emanating from hands and facial movements. However, contemporary CSLR methods have exhibited limitations in adequately capturing information from both the hands and facial regions, often overlooking the continuity, and correlations across multiple consecutive frames. To mitigate these shortcomings, we propose the Multi-scale Variable Window Attention Network (MVAN). This framework fuses the strengths of an improved Efficient Multi-scale Attention (iEMA) with Variable Window Adaptation (VWA) attention. Specifically, iEMA first scans information spatially at multiple scales to simultaneously capture information from areas such as hands and faces, and models spatial continuity interactions between them, enhancing spatial features. Secondly, VWA dynamically changes its window size at the temporal level to adaptively capture complex temporal changes in hands and face movements in successive frames. Thus, VWA can effectively model the continuity and correlation between hands and face movements to have the ability to capture sign language movements of different lengths. Comprehensive experimental results demonstrate that our proposed MVAN strengthens the visual feature extraction of hands and face, improving the recognition performance. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

An Iterative Thresholding Method for the Minimum Compliance Problem

引用

Communications in Computational Physics 2023年第4期33卷 1189-1216页

作者： Luyu Cen Wei Hu Dong Wang Xiaoping Wang Department of Mathematics Hong Kong University of Science and TechnologyClear Water BayKowloonHong KongChina The Program in Applied and Computational Mathematics Princeton UniversityPrincetonNew JerseyUSA School of Science and Engineering The Chinese University of Hong KongShenzhenGuangdong 518172China Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big DataGuangdong 518172China

In this paper,we propose a simple energy decaying iterative thresholding algorithm to solve the two-phase minimum compliance *** material domain is implicitly represented by its characteristic function,and the problem is formulated into a minimization problem by the principle of minimum complementary *** prove that the energy is decreasing in each *** effective continuation schemes are proposed to avoid trapping into the local *** results on 2D isotropic linear material demonstrate the effectiveness of the proposed methods.

关键词： Minimum compliance convolution thresholding linear elasticity

来源：评论

学校读者我要写书评

暂无评论

FeedSign: Robust Full-parameter Federated Fine-tuning of Large Models with Extremely Low Communication Overhead of One Bit

arXiv

引用

arXiv 2025年

作者： Cai, Zhijie Chen, Haolong Zhu, Guangxu Shenzhen Research Institute of Big Data Guangdong Shenzhen China School of Science and Engineering The Chinese University of Hong Kong Shenzhen Guangdong Shenzhen China

Federated fine-tuning (FFT) attempts to fine-tune a pre-trained model with private data from distributed clients by exchanging models rather than data under the orchestration of a parameter PS (PS). To overcome the bottleneck forged by the growing communication and memory overhead for clients in such systems due to the ever-increasing model sizes, we propose FeedSign, an FFT algorithm in which the upload and download payload is exactly 1 bit per aggregation step. Meanwhile, the memory overhead is squeezed to the amount needed for inference. The reduction is realized by utilizing zeroth-order (ZO) optimizers on large models and shared pseudo-random number generators (PRNG) across devices to represent the gradient estimates as seed-sign pairs. We conduct theoretical analysis on FeedSign and show that it converges at an exponential rate O(e−t), where t is the number of elapsed steps under widely used assumptions. Moreover, FeedSign is robust against data heterogeneity and Byzantine attacks. We extensively tested FeedSign on models across different structures and sizes (11M to 13B). We found that the proposed method performs better or closely, depending on the scenarios, than its ZO and FO counterparts, albeit with an orders-of-magnitude lower communication overhead. We also discuss some interesting advantages as byproducts guaranteed by the design of FeedSign. Copyright © 2025, The Authors. All rights reserved.

关键词： Random number generation

来源：评论

学校读者我要写书评

暂无评论

Joint Class-Balanced Client Selection and Bandwidth Allocation for Cost-Efficient Federated Learning in Mobile Edge Computing Networks

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 5681-5698页

作者： Tang, Jian Li, Xiuhua Li, Hui Li, Penghua Wang, Xiaofei Leung, Victor C. M. Chongqing University School of Big Data & Software Engineering Chongqing400000 China Chongqing University of Posts and Telecommunications School of Automation Chongqing400065 China Tianjin University College of Intelligence and Computing Tianjin300072 China Shenzhen MSU-BIT University Artificial Intelligence Research Institute Shenzhen518172 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T1Z4 Canada

Federated Learning (FL) has significant potential to protect data privacy and mitigate network burden in mobile edge computing (MEC) networks. However, due to the system and data heterogeneity of mobile clients (MCs), client selection and bandwidth allocation is key for achieving cost-efficient FL in MEC networks with limited bandwidth. To address these challenges, we investigate the issue of joint client selection and bandwidth allocation for reducing the cost (i.e., latency and energy consumption) of FL training. We formulate the problem and decompose it into a holistic subproblem to reduce the number of rounds and a partial subproblem to reduce the costs of FL each round. We propose a joint class-balanced client selection and bandwidth allocation (CBCSBA) framework to address the whole problem. Specifically, for the holistic subproblem, CBCSBA combines MCs into groups, each having data distribution as close as possible to class-balanced distribution;For the partial subproblem, CBCSBA reduces costs by exploratively selecting a group and sequentially optimizing the latency and energy consumption of MCs within the group. Experimental results show that CBCSBA outperforms the baseline frameworks in reducing latency by 28.2% and energy consumption by 25.3% on average in the considered four datasets. © 2002-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Design of Provably Secure Authentication Protocol for Edge-Centric Maritime Transportation System

引用

IEEE Transactions on intelligent Transportation Systems 2023年第12期24卷 14536-14545页

作者： Mahmood, Khalid Shamshad, Salman Ayub, Muhammad Faizan Ghaffar, Zahid Khan, Muhammad Khurram Das, Ashok Kumar National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliu64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu610054 China National Yunlin University of Science and Technology Department of Computer Science and Information Engineering Douliu64002 Taiwan King Saud University Center of Excellence in Information Assurance Riyadh11653 Saudi Arabia International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500032 India

The epidemic growth of the Internet of Things (IoT) objects have revolutionized Maritime Transportation Systems (MTS). Though, it becomes challenging for the centralized cloud-centric framework to fulfil the application requirements such as low latency and power utilization. The introduction of the distributed edge-centric framework has recently helped the IoT-enabled MTS to meet these requirements by manipulating the tasks at the edge of the networks. Despite the fact that MTS leverages mobile subscribers by overcoming inherent cloud computing limitations, data security and user privacy requirements in establishing the MTS setup are still non-trivial challenges. In this article, we develop a key agreement solution for mobile users to realize mutual authentication in a single round. Our protocol offers user anonymity to maintain user privacy, and it can prevent physical attacks by physically unclonable functions. Initially, the security analysis is conferred to substantiate our protocol's security persistence or strength. Later, its performance correlation is observed under the assumption of diverse metrics in a predefined empirical setup. The meticulous performance correlation endorses the precedence of our protocol over specified related protocols. © 2000-2011 IEEE.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Scenario, Role, and Persona: A Scoping Review of Design Strategies for Socially intelligent AI Agents

Scenario, Role, and Persona: A Scoping Review of Design Stra...

引用

2025 CHI Conference on Human Factors in Computing Systems, CHI EA 2025

作者： Niu, Ruowen Hu, Jiaxiong Peng, Siyu Cao, Caleb Chen Liu, Chengzhong Han, Sirui Guo, Yike Hong Kong Generative AI Research and Development Center Hong Kong Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong The Hong Kong University of Science and Technology Hong Kong Big Data Institute Hong Kong University of Science and Technology Hong Kong

ISBN: (纸本)9798400713958

As artificial intelligence (AI) agents have often been perceived as social actors, there is a growing expectation for them to demonstrate social intelligence. Social intelligence encompasses the ability of AI agents to align their actions with human intentions and behave in socially and culturally appropriate ways. This study conducts a scoping review to analyze the design strategies employed in current AI agent designs that support the exhibition of social intelligence. Our findings reveal three design strategy themes that interdependently and collectively shape the capabilities and behaviors of AI agents: scenario, role, and persona. These findings provide a structured perspective and actionable insights for designing AI agents that effectively integrate social intelligence into human-AI interactions. © 2025 Copyright held by the owner/author(s).

关键词： AI Agents Design Strategy Scoping Review Social Intelligence

来源：评论

学校读者我要写书评

暂无评论

Azimuth Ambiguity Suppression for Sparse SAR Imaging Based on Unfolded Deep Network 15

Azimuth Ambiguity Suppression for Sparse SAR Imaging Based o...

引用

15th European Conference on Synthetic Aperture Radar, EUSAR 2024

作者： Wu, Yuwei Zhang, Zhe Song, Ruizhen Qiu, Xiaolan Yu, Weidong Department of Space Microwave Remote Sensing System Beijing100090 China Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China Key Laboratory of Intelligent Aerospace Big Data Application Technology Suzhou215123 China Suzhou Aerospace Information Research Institute Suzhou215123 China School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing100049 China

ISBN: (纸本)9783800762873

Sparse synthetic aperture radar (SAR) imaging allows for a reduction in the azimuth sampling rate based on compressive sensing theory. However, it relies on the sparsity of scenes, which can lead to significant azimuth ambiguity. To address this issue, we introduce a novel network designed to suppress azimuth ambiguity for sparse SAR imaging. Our proposed deep unfolded network is based on the Iterative Thresholding Algorithm Learned (LISTA). We replace the observation matrix with Matched Filter (MF) operators to reduce computational complexity. Experiments with real SAR scene data demonstrate the effectiveness and superiority of our approach in suppressing azimuth ambiguity. © VDE VERLAG GMBH ∙ Berlin ∙ Offenbach.

关键词： Matched filters

来源：评论

学校读者我要写书评

暂无评论

Unitig-centered pan-genome machine learning approach for predicting antibiotic resistance and discovering novel resistance genes in bacterial strains

引用

Computational and Structural Biotechnology Journal 2024年 23卷 1864-1876页

作者： Do, Duyen Thi Yang, Ming-Ren Vo, Tran Nam Son Le, Nguyen Quoc Khanh Wu, Yu-Wei Graduate Institute of Biomedical Informatics College of Medical Science and Technology Taipei Medical University Taipei Taiwan Department of Electrical Engineering National Taiwan University of Science and Technology Taipei Taiwan Department of Business Administration College of Management Lunghwa University of Science and Technology Taoyuan City Taiwan Professional Master Program in Artificial Intelligence in Medicine College of Medicine Taipei Medical University Taipei Taiwan Clinical Big Data Research Center Taipei Medical University Hospital Taipei Taiwan TMU Research Center for Digestive Medicine Taipei Medical University Taipei Taiwan

In current genomic research, the widely used methods for predicting antimicrobial resistance (AMR) often rely on prior knowledge of known AMR genes or reference genomes. However, these methods have limitations, potentially resulting in imprecise predictions owing to incomplete coverage of AMR mechanisms and genetic variations. To overcome these limitations, we propose a pan-genome-based machine learning approach to advance our understanding of AMR gene repertoires and uncover possible feature sets for precise AMR classification. By building compacted de Brujin graphs (cDBGs) from thousands of genomes and collecting the presence/absence patterns of unique sequences (unitigs) for Pseudomonas aeruginosa, we determined that using machine learning models on unitig-centered pan-genomes showed significant promise for accurately predicting the antibiotic resistance or susceptibility of microbial strains. Applying a feature-selection-based machine learning algorithm led to satisfactory predictive performance for the training dataset (with an area under the receiver operating characteristic curve (AUC) of > 0.929) and an independent validation dataset (AUC, approximately 0.77). Furthermore, the selected unitigs revealed previously unidentified resistance genes, allowing for the expansion of the resistance gene repertoire to those that have not previously been described in the literature on antibiotic resistance. These results demonstrate that our proposed unitig-based pan-genome feature set was effective in constructing machine learning predictors that could accurately identify AMR pathogens. Gene sets extracted using this approach may offer valuable insights into expanding known AMR genes and forming new hypotheses to uncover the underlying mechanisms of bacterial AMR. © 2024 The Authors

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

Tensor Graph Convolutional Network for Dynamic Graph Representation Learning

arXiv

引用

arXiv 2024年

作者： Wang, Ling Yuan, Ye The School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China The Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China The College of Computer and Information Science Southwest University Chongqing400715 China

Dynamic graphs (DG) describe dynamic interactions between entities in many practical scenarios. Most existing DG representation learning models combine graph convolutional network and sequence neural network, which model spatial-temporal dependencies through two different types of neural networks. However, this hybrid design cannot well capture the spatial-temporal continuity of a DG. In this paper, we propose a tensor graph convolutional network to learn DG representations in one convolution framework based on the tensor product with the following two-fold ideas: a) representing the information of DG by tensor form;b) adopting tensor product to design a tensor graph convolutional network modeling spatial-temporal feature simultaneously. Experiments on real-world DG datasets demonstrate that our model obtains state-of-the-art performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：