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

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Li, Baixuan Fan, Yunlong Gao, Zhiqiang School of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

ISBN: (纸本)9798891761681

Conditional Semantic Textual Similarity (C-STS) introduces specific limiting conditions to the traditional Semantic Textual Similarity (STS) task, posing challenges for STS models. Language models employing cross-encoding demonstrate satisfactory performance in STS, yet their effectiveness significantly diminishes in C-STS. In this work, we argue that the failure is due to the fact that the redundant information in the text distracts language models from the required condition-relevant information. To alleviate this, we propose SElf-Augmentation Via SElf-Reweighting (SEAVER), which, based solely on models' internal attention and without the need for external auxiliary information, adaptively reallocates the model's attention weights by emphasizing the importance of condition-relevant tokens. On the C-STS-2023 test set, SEAVER consistently improves performance of all million-scale fine-tuning baseline models (up to around 3 points), and even surpasses performance of billion-scale few-shot prompted large language models (such as GPT-4). Our code is available at https://***/BaixuanLi/SEAVER. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Open Set Recognition 38

Multi-Label Open Set Recognition

引用

38th Conference on Neural information Processing Systems, NeurIPS 2024

作者： Wang, Yi-Bo Hang, Jun-Yi Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

In multi-label learning, each training instance is associated with multiple labels simultaneously. Traditional multi-label learning studies primarily focus on closed set scenario, i.e. the class label set of test data is identical to those used in training phase. Nevertheless, in numerous real-world scenarios, the environment is open and dynamic where unknown labels may emerge gradually during testing. In this paper, the problem of multi-label open set recognition (MLOSR) is investigated, which poses significant challenges in classifying and recognizing instances with unknown labels in multi-label setting. To enable open set multi-label prediction, a novel approach named SLAN is proposed by leveraging sub-labeling information enriched by structural information in the feature space. Accordingly, unknown labels are recognized by differentiating the sub-labeling information from holistic supervision. Experimental results on various datasets validate the effectiveness of the proposed approach in dealing with the MLOSR problem. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Binary Decomposition: A Problem Transformation Perspective for Open-Set Semi-Supervised Learning 41

Binary Decomposition: A Problem Transformation Perspective f...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Hang, Jun-Yi Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

Semi-supervised learning (SSL) is a classical machine learning paradigm dealing with labeled and unlabeled data. However, it often suffers performance degradation in real-world open-set scenarios, where unlabeled data contains outliers from novel categories that do not appear in labeled data. Existing studies commonly tackle this challenging open-set SSL problem with detect-and-filter strategy, which attempts to purify unlabeled data by detecting and filtering outliers. In this paper, we propose a novel binary decomposition strategy, which refrains from error-prone procedure of outlier detection by directly transforming the original open-set SSL problem into a number of standard binary SSL problems. Accordingly, a concise yet effective approach named BDMatch is presented. BDMatch confronts two attendant issues brought by binary decomposition, i.e. class-imbalance and representation-compromise, with adaptive logit adjustment and label-specific feature learning respectively. Comprehensive experiments on diversified benchmarks clearly validate the superiority of BDMatch as well as the effectiveness of our binary decomposition strategy. Copyright 2024 by the author(s)

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A new quantum key distribution resource allocation and routing optimization scheme

引用

Chinese Physics B 2024年第3期33卷 244-259页

作者：毕琳袁晓同吴炜杰林升熙 School of Computer Science and Technology Changchun University of Science and TechnologyChangchun 130012China Key Laboratory of Network and Information Security in Jilin Province Changchun 130012China

Quantum key distribution(QKD)is a technology that can resist the threat of quantum computers to existing conventional cryptographic ***,due to the stringent requirements of the quantum key generation environment,the generated quantum keys are considered valuable,and the slow key generation rate conflicts with the high-speed data transmission in traditional optical *** this paper,for the QKD network with a trusted relay,which is mainly based on point-to-point quantum keys and has complex changes in network resources,we aim to allocate resources reasonably for data packet ***,we formulate a linear programming constraint model for the key resource allocation(KRA)problem based on the time-slot ***,we propose a new scheduling scheme based on the graded key security requirements(GKSR)and a new micro-log key storage algorithm for effective storage and management of key ***,we propose a key resource consumption(KRC)routing optimization algorithm to properly allocate time slots,routes,and key *** results show that the proposed scheme significantly improves the key distribution success rate and key resource utilization rate,among others.

关键词： quantum key distribution(QKD) resource allocation key storage routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Prompting Large Language Models with Knowledge-Injection for Knowledge-Based Visual Question Answering

引用

Big Data Mining and Analytics 2024年第3期7卷 843-857页

作者： Zhongjian Hu Peng Yang Fengyuan Liu Yuan Meng Xingyu Liu School of Computer Science and Engineering Southeast University the Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of Education of the People’s Republic of ChinaNanjing 211189China Southeast University-Monash University Joint Graduate School(Suzhou) Southeast UniversitySuzhou 215125China

Previous works employ the Large Language Model(LLM)like GPT-3 for knowledge-based Visual Question Answering(VQA).We argue that the inferential capacity of LLM can be enhanced through knowledge *** methods that utilize knowledge graphs to enhance LLM have been explored in various tasks,they may have some limitations,such as the possibility of not being able to retrieve the required *** this paper,we introduce a novel framework for knowledge-based VQA titled“Prompting Large Language Models with Knowledge-Injection”(PLLMKI).We use vanilla VQA model to inspire the LLM and further enhance the LLM with knowledge *** earlier approaches,we adopt the LLM for knowledge enhancement instead of relying on knowledge ***,we leverage open LLMs,incurring no additional *** comparison to existing baselines,our approach exhibits the accuracy improvement of over 1.3 and 1.7 on two knowledge-based VQA datasets,namely OK-VQA and A-OKVQA,respectively.

关键词： visual question answering knowledge-based visual question answering large language model knowledge injection

来源：评论

学校读者我要写书评

暂无评论

TRBFT: An Efficient Blockchain Consensus for Edge Computing-Enabled IoT Systems

引用

IEEE Internet of Things Journal 2025年第11期12卷 15853-15868页

作者： Zheng, Jiali Zhang, Yuxi Guangxi University Guangxi Key Laboratory of Multimedia Communications and Network Technology School of Computer Electronics and Information Guangxi Nanning530004 China

With the continuous expansion of the Internet of Things (IoT), and despite reductions in communication latency enabled by edge computing, the decentralized nature of node structures poses significant security challenges. Blockchain is considered a critical technology for enhancing IoT security. However, traditional consensus exhibits limitations in efficiency and security when facing the exponential growth of IoT nodes necessitating further optimization and innovation. This paper proposes the threshold signature and reputation-enhanced Byzantine fault tolerance (TRBFT) algorithm. First, we integrate IoT with edge computing architectures, conduct a comprehensive evaluation of node reputation based on behavioral quality and contribution to consensus, and periodically update and categorize nodes into different sets with varying permissions. Secondly, the algorithm ensures that the selection of primary nodes strikes a balance between reliability and randomness, while employing a segmented screening scheme that progressively restricts the participating nodes in consensus, aiming to enhance accuracy. Subsequently, the communication structure is improved by incorporating threshold signature with reputation weight, which reduces communication complexity. Ultimately, simulation results demonstrate that TRBFT reduces the average consensus delay by 71.1% and increases the average throughput by 3.95 times compared to the advanced consensus HotStuff. In scenarios with faulty nodes, TRBFT increases the chain growth rate by 65.12% and decreases the block interval by 54.26% relative to HotStuff. The findings show the superior scalability and fault tolerance of TRBFT, making it better suited for large-scale IoT scenarios integrated with edge computing. © 2025 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Weighted Attribute Based Conditional Proxy Re-Encryption in the Cloud

引用

computers, Materials & Continua 2025年第4期83卷 1399-1414页

作者： Xixi Yan Jing Zhang Pengyu Cheng Henan Key Laboratory of Network Cryptography Technology Network Information Security and Cryptography LaboratorySchool of SoftwareHenan Polytechnic UniversityJiaozuo454003China School of Computer Science and Technology Henan Polytechnic UniversityJiaozuo454000China

Conditional proxy re-encryption(CPRE)is an effective cryptographic primitive language that enhances the access control mechanism and makes the delegation of decryption permissions more granular,but most of the attribute-based conditional proxy re-encryption(AB-CPRE)schemes proposed so far do not take into account the importance of user attributes.A weighted attribute-based conditional proxy re-encryption(WAB-CPRE)scheme is thus designed to provide more precise decryption rights *** introducing the concept of weight attributes,the quantity of system attributes managed by the server is reduced *** the same time,a weighted tree structure is constructed to simplify the expression of access structure *** conditional proxy re-encryption,large amounts of data and complex computations are outsourced to cloud servers,so the data owner(DO)can revoke the user’s decryption rights directly with minimal *** scheme proposed achieves security against chosen plaintext attacks(CPA).Experimental simulation results demonstrated that the decryption time is within 6–9 ms,and it has a significant reduction in communication and computation cost on the user side with better functionality compared to other related schemes,which enables users to access cloud data on devices with limited resources.

关键词： Cloud service conditional proxy re-encryption user revocation weighted attribute

来源：评论

学校读者我要写书评

暂无评论

Blockchain and signcryption enabled asynchronous federated learning framework in fog computing

引用

Digital Communications and networks 2025年第2期11卷 442-454页

作者： Zhou Zhou Youliang Tian Jinbo Xiong Changgen Peng Jing Li Nan Yang State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber SecurityFujian Normal UniversityFuzhou 350117China Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic TechnologyGuilin 541004China

Federated learning combines with fog computing to transform data sharing into model sharing,which solves the issues of data isolation and privacy disclosure in fog ***,existing studies focus on centralized single-layer aggregation federated learning architecture,which lack the consideration of cross-domain and asynchronous robustness of federated learning,and rarely integrate verification mechanisms from the perspective of *** address the above challenges,we propose a Blockchain and Signcryption enabled Asynchronous Federated Learning(BSAFL)framework based on dual aggregation for cross-domain *** particular,we first design two types of signcryption schemes to secure the interaction and access control of collaborative learning between ***,we construct a differential privacy approach that adaptively adjusts privacy budgets to ensure data privacy and local models'availability of intra-domain ***,we propose an asynchronous aggregation solution that incorporates consensus verification and elastic participation using ***,security analysis demonstrates the security and privacy effectiveness of BSAFL,and the evaluation on real datasets further validates the high model accuracy and performance of BSAFL.

关键词： Blockchain Signcryption Federated learning Asynchronous Fog computing

来源：评论

学校读者我要写书评

暂无评论

A Meta Meeting Mountain based opportunistic message forwarding strategy

A Meta Meeting Mountain based opportunistic message forwardi...

引用

作者： Tu, Jinbin Wang, Yun Liu, Yichuan Li, Qing School of Computer Science and Engineering Southeast University Nanjing China Key Lab of Computer Network and Information Integration MOE Nanjing China

The opportunistic network is a type of ad hoc network that relies on the chance encounters between nodes to transmit messages. It also uses store-and-carry-forward techniques for data transfer between nodes. Developing effective message forwarding strategies based on opportunistic network characteristics and node behavior poses a significant challenge. In this paper, we delve into the mobility and social characteristics of nodes using historical encounter information. Furthermore, we calculate the migration degree and community relations to build the Meta Meeting Mountain, which representing node encounter characteristics. Moreover, we introduce the concept of Forwarding Degree to measure the nodes’ ability to deliver messages, enhancing the predictability of message delivery. Furthermore, a new forwarding strategy is proposed, which is equipped with Meta Meeting Mountain and Forwarding degree to improve the delivery rate. Our experimental scenarios include Infocom06, Rome taxi, and Helsinki. Therefore, the impact of buffer size and TTL is discussed in detail regarding the different opportunistic routing algorithms. Finally, extensive experimental results show that the proposed algorithm outperforms UBPR, MaxProp, PRoPHET, Spray And Wait and RAPAR in terms of delivery rate in the above scenarios by 127.905%, 93.7525%, 138.6888%, 175.3663%, and 281.4625%, respectively, while keeping the hopcount value less than 5. © 2023 Elsevier B.V.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

A cost-efficient quantum access network with qubit-based synchronization

引用

Science China(Physics,Mechanics & Astronomy) 2024年第4期67卷 12-22页

作者： Chunfeng Huang Ye Chen Tingting Luo Wenjie He Xin Liu Zhenrong Zhang Kejin Wei Guangxi Key Laboratory for Relativistic Astrophysics School of Physical Science and TechnologyGuangxi UniversityNanning 530004China Guangxi Key Laboratory of Multimedia Communications and Network Technology School of Computer Electronics and InformationGuangxi UniversityNanning 530004China

Quantum key distribution(QKD)is a physical layer encryption technique that enables two distant parties to exchange secure keys with information-theoretic *** the last two decades,QKD has transitioned from laboratory research to real-world applications,including multi-user quantum access networks(QANs).This network structure allows users to share a single-photon detector at a network node through time-division multiplexing,thereby significantly reducing the network ***,current QAN implementations require additional hardware for auxiliary tasks such as time *** address this issue,we propose a cost-efficient QAN that uses qubit-based *** this approach,the transmitted qubits facilitate time synchronization,eliminating the need for additional synchronization *** tested our scheme by implementing a network for two users and successfully achieved average secure key rates of 53.84 kbps and 71.90 kbps for each user over a 50-km commercial fiber *** addition,we investigated the capacity of the access network under cross-talk and loss *** simulation results demonstrate that this scheme can support a QAN with 64 users with key rates up to 1070 *** work provides a feasible and cost-effective way to implement a multi-user QKD network,further promoting the widespread application of QKD.

关键词： quantum key distribution quantum access network qubit-based synchronization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：