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

Priority-Based Blockchain Packing for Dependent Industrial IoT Transactions

IEEE Transactions on Network and Service Management 2025年第2期22卷 1618-1628页

作者： Lin, Chaofeng Tang, Jinchuan Dang, Shuping Chen, Gaojie Guizhou University State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang550025 China University of Bristol Department of Electrical and Electronic Engineering BristolBS8 1UB United Kingdom Guangdong Shenzhen518107 China 5GIC and 6GIC The University of Surrey United Kingdom

Blockchain plays a key role in establishing secure and decentralized Industrial Internet of Things (IIoT) systems. Currently, the dependent transactions generated by IIoT devices require a packing process to select a set of non-conflicted transactions, which results in significant delay and deviation of the transaction response time. In this paper, we propose a novel transaction packing algorithm named Priority-Pack to address the above issue. Firstly, we use directed acyclic graphs to model the dependent transactions in IIoT systems to establish the mathematical relationships between transaction priority and waiting time as well as dependencies. Secondly, we propose an algorithm to specify a higher priority to a transaction with longer waiting time without violating transaction dependencies. It eliminates the time required to traverse the subsets of transactions in other algorithms. Thirdly, to further reduce the response delay for transactions with the same priority level, we choose to first pack transactions with smaller sizes. We prove that this selection can achieve the lowest average response time. Finally, simulations are conducted to benchmark the Priority-Pack against the state-of-the-art algorithms including Fair-Pack and Random-Pack. The results demonstrate that Priority-Pack outperforms the others in terms of average response time and deviations. © 2004-2012 IEEE.

关键词： Industrial internet of things (IIoT)

来源：评论

学校读者我要写书评

暂无评论

KAN v.s. MLP for Offline Reinforcement Learning

KAN v.s. MLP for Offline Reinforcement Learning

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Guo, Haihong Li, Fengxin Li, Jiao Liu, Hongyan School of Information Renmin University of China China Institute of Medical Information Medical Library Chinese Academy of Medical Sciences Peking Union Medical College China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

ISBN: (纸本)9798350368741

Kolmogorov-Arnold Networks (KAN) is an emerging neural network architecture in machine learning. It has greatly interested the research community about whether KAN can be a promising alternative to the commonly used Multi-Layer Perceptions (MLP). Experiments in various fields demonstrated that KAN-based machine learning can achieve comparable if not better performance than MLP-based methods, but with much smaller parameter scales and are more explainable. In this paper, we explore the incorporation of KAN into the actor and critic networks for offline reinforcement learning (RL). We evaluated the performance, parameter scales, and training efficiency of various KAN and MLP-based conservative Q-learning (CQL) on the classical D4RL benchmark for offline RL. Our study demonstrates that KAN can achieve performance close to the commonly used MLP with significantly fewer parameters. This allows us to choose the base networks according to the offline RL task requirements. © 2025 IEEE.

关键词： KAN Kolmogorov-Arnold networks MLP multilayer perceptrons offline reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Federated Incremental Named Entity Recognition 31

Federated Incremental Named Entity Recognition

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Liu, Zesheng Zhu, Qiannan Li, Cuiping Chen, Hong School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE China Engineering Research Center of Database and Business Intelligence MOE China School of Artificial Intelligence Beijing Normal University Beijing China Engineering Research Center of Intelligent Technology and Educational Application MOE China

ISBN: (纸本)9798891761964

Federated learning-based Named Entity Recognition (FNER) has attracted widespread attention through decentralized training on local clients. However, most FNER models assume that entity types are pre-fixed, so in practical applications, local clients constantly receive new entity types without enough storage to access old entity types, resulting in severe forgetting on previously learned knowledge. In addition, new clients collecting only new entity types may join the global training of FNER irregularly, further exacerbating catastrophic forgetting. To overcome the above challenges, we propose a Forgetting-Subdued Learning (FSL) model which solves the forgetting problem on old entity types from both intra-client and inter-client two aspects. Specifically, for intra-client aspect, we propose a prototype-guided adaptive pseudo labeling and a prototypical relation distillation loss to surmount catastrophic forgetting of old entity types with semantic shift. Furthermore, for inter-client aspect, we propose a task transfer detector. It can identify the arrival of new entity types that are protected by privacy and store the latest old global model for relation distillation. Qualitative experiments have shown that our model has made significant improvements compared to several baseline methods. © 2025 Association for Computational Linguistics.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Eu3+ co-doped broadband yellow-emitting BaZnSiO4: Bi3+ phosphors for multifunctional applications

引用

Ceramics International 2025年

作者： Li, Bin Cao, Bin Yang, Chong Ma, Rongbo Deng, Chaoyong Huang, Weichao Key Laboratory of Functional Composite Materials of Guizhou Province College of Big Data and Information Engineering Guizhou University Guizhou Guiyang550025 China

Bi3+-activated phosphors have received increasing attention due to their abundant emission properties. In this paper, a series of BaZnSiO4: Bi3+ phosphors have been synthesized and structurally characterized, and the correlations between their structure and luminescence were also studied systematically. Under 306 nm excitation, the phosphors show broadband yellow emission centered at 559 nm with a full width at half-maximum (FWHM) of 123 nm, resulting from the 3P1/1P1 → 1S0 transition of Bi3+. Thermal stability spectroscopy of BaZnSiO4: Bi3+ phosphor was found to have the potential for application in optical temperature sensing with a Sr value of 2.2 % K−1. BaZnSiO4: Bi3+ phosphors were also used to explore flexible display and lighting. In addition, the color change function is realized by Eu3+ co-doping, which shows good potential application value in the field of anti-counterfeiting. © 2025 Elsevier Ltd and Techna Group S.r.l.

关键词： Phosphors

来源：评论

学校读者我要写书评

暂无评论

AAMB: a cross-domain identity authentication scheme based on multilayered blockchains in IoMT

引用

Journal of Supercomputing 2025年第7期81卷 1-39页

作者： Zhang, Zheqing Li, Hongzhi Li, Dun Li, Kuan-Ching College of Big Data and Artificial Intelligence Chizhou University Chizhou247000 China Anhui Provincial Joint Construction Key Laboratory of Intelligent Education Equipment and Technology Chizhou247000 China Department of Industrial Engineering Tsinghua University Beijing China Department of Computer Science and Information Engineering Providence University Taichung City Taiwan

The internet of medical things (IoMT) integrates various sensors, smart devices, and fully utilizes medical data to provide high-quality medical services through the Internet of Things (IoT). Smart medical devices can be cross-domain shared in IoMT to provide health monitoring, disease diagnosis, rehabilitation training, etc. In IoMT, conventional authentication schemes struggle to meet cross-domain medical service sharing requirements due to resource constraints (computational/communication), confidentiality challenges, and strict latency demands. To address these issues, we propose a cross-domain authentication scheme based on dynamic accumulators and two-layer blockchains. First, a blockchain-based collaborative authentication framework is designed to realize secure and reliable intradomain and cross-domain authentication. Second, certificateless cryptography and dynamic accumulators are combined to guarantee both the confidentiality and efficiency of cross-domain authentication. Furthermore, we analyze the potential security threats that threaten the system’s stability and formally demonstrate the security of the proposed scheme using Burrows–Abadi–Needham logic. The formal and informal security analyses indicate that the proposed scheme is secure and can resist against known security threats. Finally, we evaluate the performance of the proposed authentication protocols in terms of computational and communication overhead. The corresponding performance analysis shows that compared with related protocols, it can reduce the computational and communication costs by more than 42.3% and 21.4%, respectively. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

引用

8th International Congress on Edge Computing, EDGE 2024, Held as Part of the Services Conference Federation, SCF 2024

作者： Tian, Yun Wu, Bin Shi, Jiaoli Zhang, Caicai Xu, Du School of Computer and Big Data Science Jiujiang University Jiujiang332005 China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005 China School of Modern Information Technology Zhejiang Polytechnic University of Mechanical and Electrical Engineering Hangzhou310053 China

ISBN: (纸本)9783031770685

The development of cloud computing and the widespread application of cloud services have made outsourcing services more convenient. The need for individuals and businesses to store and manipulate the graph data they generate is growing rapidly. The unreliability and insecurity of cloud servers make outsourcing graph data a great risk of information leakage. To effectively protect data security, encrypting outsourced data is a useful method. The adjacent vertex query is a very commonly used and fundamental operation, and similarity search is a widely used and powerful tool to improve the scope and functionality of queries. After outsourcing encrypted sparse graph data to cloud servers, it becomes very inconvenient to use and manipulate the data. In this work, we present a scheme to realize the adjacent vertex query supporting similarity search on sparse graph data in cloud environment (SSAQ), which also protects the security of the information. This work uses edit distance and the searchable encryption principle to construct query index, and next implement the similar adjacent vertex query on cloud server. This work provides a formal security analysis, and also gives the experimental comparison and analysis. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

Constructing a Biomass-data Center Nexus for Circular Economy-Based Energy Systems Integration

IEEE Open Access Journal of Power and Energy

引用

IEEE Open Access Journal of Power and Energy 2025年 12卷 270-283页

作者： Wang, Pengya Pan, Li He, Guannan Li, Gengyin Song, Jie Zhou, Ming Wang, Jianxiao State Grid Dezhou Power Supply Company Shandong Dezhou253000 China The Chinese University of Hon g Kong School of Science and Engineering Guangdong Shenzhen518000 China Peking University College of Engineering Department of Industrial Engineering and Management Beijing100871 China North China Electric Power University State Key Laboratory of Alternate Electrical Power System With Renewable Energy Sources Beijing102206 China Peking University National Engineering Laboratory for Big Data Analysis and Applications Beijing100871 China

The dual challenges of energy crises and waste management have spurred interest in a circular economy, where biomass, valued for its carbon neutrality, is crucial. Remote areas, rich in biomass, are also becoming hubs for data center (DC) construction. Despite DCs’ low energy efficiency and production of low-grade waste heat, recovering this heat offers a promising path toward a circular economy. There are few systematic studies on the relationships among DC energy supply, waste heat generation, and renewable energy resources. In this study, we formulate day-ahead, real-time optimal scheduling strategies to provide electricity, heat, and gas using a complementary photovoltaic-biomass system. The biogas production process requires heat to promote the anaerobic reaction, and the adaptation temperature of anaerobic bacteria matches the low-quality waste heat generated from of the DC. We realize a circular economy by coupling a DC and a renewable energy system by directly using the waste heat from the DC and by using the queuing theory of the DC’s delay tolerance workload for partial load response. Moreover, the nonlinearity in the process is linearized by the least squares method. Actual data calculations show that the introduction of biogas can result in a fully renewable energy supply. Based on specific configurations—including a 350 kW PV system, 450 kWh BSS, 250 kW CHP unit, and an AD operating at 20°C to 45°C—the system is tested under 0% and 50% carbon emission scenarios. The DC workload combines delay-tolerant and delay-sensitive tasks, enabling flexible scheduling for energy and heat optimization, the power usage effectiveness (PUE) of the DC decreases from 1.73 to 1.24, operating expenses decrease by 36.06%, and system energy consumption decreases by 44.6%. © 2020 IEEE.

关键词： Waste heat utilization

来源：评论

学校读者我要写书评

暂无评论

Less is More: Token Context-aware Learning for Object Tracking

arXiv

引用

arXiv 2025年

作者： Xu, Chenlong Zhong, Bineng Liang, Qihua Zheng, Yaozong Li, Guorong Song, Shuxiang Key Laboratory of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin541004 China Key Laboratory of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences China

Recently, several studies have shown that utilizing contextual information to perceive target states is crucial for object tracking. They typically capture context by incorporating multiple video frames. However, these naive frame-context methods fail to consider the importance of each patch within a reference frame, making them susceptible to noise and redundant tokens, which deteriorates tracking performance. To address this challenge, we propose a new token context-aware tracking pipeline named LMTrack, designed to automatically learn high-quality reference tokens for efficient visual tracking. Embracing the principle of Less is More, the core idea of LMTrack is to analyze the importance distribution of all reference tokens, where important tokens are collected, continually attended to, and updated. Specifically, a novel Token Context Memory module is designed to dynamically collect high-quality spatio-temporal information of a target in an autoregressive manner, eliminating redundant background tokens from the reference frames. Furthermore, an effective Unidirectional Token Attention mechanism is designed to establish dependencies between reference tokens and search frame, enabling robust cross-frame association and target localization. Extensive experiments demonstrate the superiority of our tracker, achieving state-of-the-art results on tracking benchmarks such as GOT-10K, TrackingNet, and LaSOT. Code and models are available at https://***/XuChenLong/LMTrack. Copyright © 2025, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

CoT-based Synthesizer: Enhancing LLM Performance through Answer Synthesis

arXiv

引用

arXiv 2025年

作者： Zhang, Bohan Zhang, Xiaokang Zhang, Jing Yu, Jifan Luo, Sijia Tang, Jie School of Information Renmin University of China China Tsinghua University China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China

Current inference scaling methods, such as Self-consistency and Best-of-N, have proven effective in improving the accuracy of LLMs on complex reasoning tasks. However, these methods rely heavily on the quality of candidate responses and are unable to produce correct answers when all candidates are incorrect. In this paper, we propose a novel inference scaling strategy, CoT-based Synthesizer, which leverages CoT reasoning to synthesize superior answers by analyzing complementary information from multiple candidate responses, even when all candidate responses are flawed. To enable a lightweight and cost-effective implementation, we introduce an automated data generation pipeline that creates diverse training data. This allows smaller LLMs trained on this data to improve the inference accuracy of larger models, including API-based LLMs. Experimental results across four benchmark datasets with seven policy models demonstrate that our method significantly enhances performance, with gains of 11.8% for Llama3-8B and 10.3% for GPT-4o on the MATH dataset. The corresponding training data and code are publicly available on the repository. Copyright © 2025, The Authors. All rights reserved.

关键词： data accuracy

来源：评论

学校读者我要写书评

暂无评论

Dynamic Scaling of Unit Tests for Code Reward Modeling

arXiv

引用

arXiv 2025年

作者： Ma, Zeyao Zhang, Xiaokang Zhang, Jing Yu, Jifan Luo, Sijia Tang, Jie School of Information Renmin University of China China Tsinghua University China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China

Current large language models (LLMs) often struggle to produce accurate solutions on the first attempt for code generation. Prior research tackles this challenge by generating multiple candidate solutions and validating them with LLM-generated unit tests. The execution results of unit tests serve as reward signals to identify correct solutions. As LLMs always confidently make mistakes, these unit tests are not reliable, thereby diminishing the quality of reward signals. Motivated by the observation that scaling the number of solutions improves LLM performance, we explore the impact of scaling unit tests to enhance reward signal quality. Our pioneer experiment reveals a positive correlation between the number of unit tests and reward signal quality, with greater benefits observed in more challenging problems. Based on these insights, we propose CodeRM-8B, a lightweight yet effective unit test generator that enables efficient and high-quality unit test scaling. Additionally, we implement a dynamic scaling mechanism that adapts the number of unit tests based on problem difficulty, further improving efficiency. Experimental results show that our approach significantly improves performance across various models on three benchmarks (e.g., with gains of 18.43% for Llama3-8B and 3.42% for GPT-4o-mini on HumanEval Plus). © 2025, CC BY-SA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：