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

Personalized Privacy-Preserving Routing Mechanism Design in Payment Channel Network

Journal of Computer Science & Technology 2024年第6期39卷 1380-1400页

作者： Peng-Cheng Zhao Li-Jie Xu Jia Xu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing 210023China

Payment Channel Network(PCN)provides the off-chain settlement of *** is one of the most promising solutions to solve the scalability issue of the *** routing techniques in PCN have been ***,both incentive attack and privacy protection have not been considered in existing *** this paper,we present an auction-based system model for PCN routing using the Laplace differential privacy *** formulate the cost optimization problem to minimize the path cost under the constraints of the Hashed Time-Lock Contract(HTLC)tolerance and the channel *** propose an approximation algorithm to find the top K shortest paths constrained by the HTLC tolerance and the channel capacity,i.e.,top K-restricted shortest ***,we design the probability comparison function to find the path with the largest probability of having the lowest path cost among the top K-restricted shortest paths as the final ***,we apply the binary search to calculate the transaction fee of each *** both theoretical analysis and extensive simulations,we demonstrate that the proposed routing mechanism can guarantee the truthfulness and individual rationality with the probabilities of 1/2 and 1/4,*** can also ensure the differential privacy of the *** experiments on the real-world datasets demonstrate that the privacy leakage of the proposed mechanism is 73.21%lower than that of the unified privacy protection mechanism with only 13.2%more path cost compared with the algorithm without privacy protection on average.

关键词： blockchain payment channel network routing mechanism differential privacy personalized privacy-preserving

来源：评论

学校读者我要写书评

暂无评论

Enhancing Adversarial Example Transferability via Regularized Constrained Feature Layer

引用

Computers, Materials & Continua 2025年第4期83卷 157-175页

作者： Xiaoyin Yi Long Chen Jiacheng Huang Ning Yu Qian Huang School of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing400065China Chongqing Key Laboratory of Public Big Data Security Technology Chongqing401420China School of Cyber Security and Information Law Chongqing University of Posts and TelecommunicationsChongqing400065China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of EducationChongqing400065China Artificial Intelligence and Big Data College Chongqing Polytechnic University of Electronic TechnologyChongqing401331China

Transfer-based Adversarial Attacks(TAAs)can deceive a victim model even without prior *** is achieved by leveraging the property of adversarial *** is,when generated from a surrogate model,they retain their features if applied to other models due to their good ***,adversarial examples often exhibit overfitting,as they are tailored to exploit the particular architecture and feature representation of source ***,when attempting black-box transfer attacks on different target models,their effectiveness is *** solve this problem,this study proposes an approach based on a Regularized Constrained Feature Layer(RCFL).The proposed method first uses regularization constraints to attenuate the initial examples of low-frequency *** are then added to a pre-specified layer of the source model using the back-propagation technique,in order to modify the original adversarial ***,a regularized loss function is used to enhance the black-box transferability between different target *** proposed method is finally tested on the ImageNet,CIFAR-100,and Stanford Car datasets with various target models,The obtained results demonstrate that it achieves a significantly higher transfer-based adversarial attack success rate compared with baseline techniques.

关键词： Adversarial examples black-box transferability regularized constrained transfer-based adversarial attacks

来源：评论

学校读者我要写书评

暂无评论

Wireless Charging Scheduling for Long-term Utility Optimization

引用

ACM Transactions on Sensor Networks 2025年第1期21卷 1-31页

作者： Xu, Jia Chen, Wenbin Dai, Haipeng Xu, Lijie Xiao, Fu Liu, Linfeng Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China The State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

Wireless power transmission has been widely used to replenish energy for wireless sensor networks, where the energy consumption rate of sensor nodes is usually time varying and indefinite. However, few works have investigated the problem of long-term charging scheduling with random variable. This article designs an optimization model for the long-term scheduling of chargers to maximize the time-averaged charging utility while ensuring its time-averaged constraints of budget and response rate. The Lyapunov optimization technique is adopted to transform the stochastic optimization problem into a deterministic optimization problem, which remains NP-hard. Thus, an approximation algorithm following greedy approach is proposed to solve the deterministic optimization problem. We further provide the theoretical analysis of feasibility and performance guarantee of the proposed scheduling algorithm. The simulation results show that our algorithm outperforms three comparison algorithms by 6.53%, 20.04%, and 19.97% in terms of time-averaged charging utility, as well as by 11.25%, 4.42%, and 3.73% in terms of time-averaged response rate on average. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Inductive power transmission

来源：评论

学校读者我要写书评

暂无评论

Subsampling Decomposition based k-Space Refinement for Accelerated MRI Reconstruction

Subsampling Decomposition based k-Space Refinement for Accel...

引用

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

作者： Qiao, Xiaoyu Li, Weisheng Xiao, Bin Huang, Yuping Yang, Lijian Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Cyberspace Big Data Intelligent Security Chongqing University of Posts and Telecommunications Ministry of Education Chongqing China

ISBN: (纸本)9798350368741

In accelerated MRI reconstruction problem, directly recovering all the missing k-space data from undersampled measurements is highly ill-posed and often leads to suboptimal performance. To address the problem, we propose a novel deep unfolding network (DUN) with subsampling decomposition (SD) based k-space refinement to mitigate the ill-posedness. Our method employs a parallel network architecture with a primary branch unfolded by gradient descent-inspired optimization process (GD-PB) for reconstruction. Additionally, we introduce an SD-based auxiliary branch (SD-AB) that decompose the inverse problem into moderately corrupted subproblems. We design a novel subsampling mask predictor that captures both global and local spatial correlations in k-space, ensuring the SD-AB effectively preserves the most well-reconstructed subsets as reliable region (RR). The RR in SD-AB is used to periodically refine the intermediate outputs of the GD-PB, achieving improved accuracy. Experimental results reveal that our method significantly outperforms conventional and SD-based DUN techniques, achieving superior PSNR and SSIM results compared with cutting-edge methods. © 2025 IEEE.

关键词： compressed sensing deep unfolded network MRI reconstruction parallel imaging subsampling decomposition

来源：评论

学校读者我要写书评

暂无评论

IMPRESS: An Importance-Informed Multi-Tier Prefix KV Storage System for Large Language Model Inference 23

IMPRESS: An Importance-Informed Multi-Tier Prefix KV Storage...

引用

23rd USENIX Conference on File and Storage Technologies, FAST 2025

作者： Chen, Weijian He, Shuibing Qu, Haoyang Zhang, Ruidong Yang, Siling Chen, Ping Zheng, Yi Huai, Baoxing Chen, Gang The State Key Laboratory of Blockchain and Data Security Zhejiang University China Institute of Blockchain and Data Security China Zhejiang Key Laboratory of Big Data Intelligent Computing China Huawei Cloud China

ISBN: (纸本)9781939133458

Modern advanced large language model (LLM) applications often prepend long contexts before user queries to improve model output quality. These contexts frequently repeat, either partially or fully, across multiple queries. Existing systems typically store and reuse the keys and values of these contexts (referred to as prefix KVs) to reduce redundant computation and time to first token (TTFT). When prefix KVs need to be stored on disks due to insufficient CPU memory, reusing them does not always reduce TTFT, as disk I/O latency is high. In this paper, we propose IMPRESS, an importance-informed multi-tier prefix KV storage system to reduce I/O delay for LLM inference by only loading important prefix KVs. IMPRESS first leverages the insight that there is significant similarity in important token index sets across attention heads and introduces an I/O-efficient important KV identification algorithm. It then optimizes prefix KV storage and caching through importance-informed KV management, reducing TTFT during model inference. Our experimental results show that IMPRESS can reduce TTFT by up to 2.8× compared to state-of-the-art systems, while maintaining comparable inference accuracy. © 2025 FAST. All Rights Reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

OSE: On-Site State of Health Estimation for Li-ion Battery using Real-Time Field data

引用

IEEE Transactions on Transportation Electrification 2025年第3期11卷 7452-7462页

作者： Chen, Yanwen Zhao, Cong Yang, Shusen Zhao, Peng Ren, Xuebin Han, Qing Yang, Yuqian Wu, Shuaijun Xi'an Jiaotong University National Engineering Laboratory for Big Data Analytics Shaanxi Xi'an710049 China Xi'an Jiaotong University National Engineering Laboratory for Big Data Analytics The Ministry of Education Key Lab for Intelligent Networks and Network Security Shaanxi Xi'an710049 China

On-site lithium-ion battery state of health (SoH) estimation is of crucial importance for reliable operations of electric vehicles (EVs). Yet, due to the low-quality of unlabeled real-time field data, diverse operating environments of in-service EVs, and limited computational capability of onboard devices, existing techniques established on data from well-controlled experimental environments are not practical for real world EVs' SoH estimation. Accurate and rapid SoH estimation based on field data of in-service EVs still remains quite challenging. To tackle this challenge, we present an on-site SoH estimation (OSE) method using in-service EV field data through a new knowledge embedded deep transfer learning (DTL) model. Initially, an universal data preprocessing approach integrating mechanism knowledge is designed to process low-quality data under diverse operating environments. Then, we develop a domain adaptive hybrid deep neural network (DAHDNN) model suitable for unlabeled field data, which can be deployed via edge cloud collaborative framework to meet actual computational capability. We demonstrate the superiority of our method across four real datasets, where, OSE's estimation error is decreased by up to 78.5% compared with the state-of-the-art methods. The results indicate that the proposed method has good generalizability and reliability for SoH estimation on real-time field data. © 2015 IEEE.

关键词： State of charge

来源：评论

学校读者我要写书评

暂无评论

Learning Preconditioners in Gates-controlled Deep Unfolding Networks based on Quasi-Newton Methods For Accelerated MRI Reconstruction

Learning Preconditioners in Gates-controlled Deep Unfolding ...

引用

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

ISBN: (纸本)9798350368741

Deep unfolding networks (DUNs) have made significant progress in MRI reconstruction, successfully tackling the problem of prolonged imaging time. However, the ill-conditioned nature of MRI reconstruction often causes slow convergence in iterative optimization, potentially compromising the performance of DUNs. In this study we propose a preconditioned and gates-controlled DUN (PGDUN) to address these challenges. Our approach starts with optimizing the step size of proximal gradient descent (PGD) through a preconditioner. To improve flexibility and adaptability, we relax the constrains on quasi-newton-based optimization procedure. We design ConvLSTM-based modules, where the gate units automatically preserve necessary long- and short-term information, facilitating the learning of optimized variables and their combinations. Furthermore, we design gate units to modulate the features fed to regularizers across different iterations, boosting their robustness against potential accumulated errors. Evaluations using PSNR and SSIM metrics reveal that our approach outperforms existing state-of-the-art methods, achieving superior reconstruction results across various sequences. © 2025 IEEE.

关键词： Compressed Sensing LSTM MRI reconstruction Preconditioner Quasi-Newton

来源：评论

学校读者我要写书评

暂无评论

Stacking U-Nets in U-shape: Redesigning the Information Flow in Model-based Networks for MRI Reconstruction

Stacking U-Nets in U-shape: Redesigning the Information Flow...

引用

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

ISBN: (纸本)9798350368741

Model-based networks have shown convincing performance in MRI reconstruction. However, the unrolled cascades within the networks are constrained to solely obtain information from the preceding counterpart, resulting in potential error accumulation. Moreover, the linear structure fails to address the challenge of recovering fine-grained details. To tackle these problems, we propose to redesign the information flow in model-based networks. Our method features a large U-shaped network, where the nodes are built with unrolled cascades and U-Net-based regularizers. We design an input-level integration module to help the cascades acquire information from adjacent and skip-connected counterparts, building robust mappings to the target. We further design a coarse-to-fine feature-level integration module, aiming at guiding the network to progressively recover fine details. Intermediate reconstructions produced by subnetworks of different scales are integrated, enabling the extraction of complementary information to enhance the final performance. Compared with cutting-edge methods on different datasets, our method exhibits superior performances. © 2025 IEEE.

关键词： compressed sensing deep learning model-based MRI reconstruction U-Net

来源：评论

学校读者我要写书评

暂无评论

Enhancing graph representation learning via type-aware decoupling and node influence allocation

引用

Applied Intelligence 2025年第6期55卷 1-14页

作者： Zhu, Guochang Hu, Jun Liu, Li Zhang, Qinghua Wang, Guoyin School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongwen Road Chongqing Chongqing400065 China Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongwen Road Chongqing Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing400065 China

The traditional graph representation methods can fit the information of graph with low-dimensional vectors, but they cannot interpret their composition, resulting in insufficient security. Graph decoupling, as a method of graph representation, can analyze the latent factors composing the graph representation vectors. However, in current graph decoupling methods, the number of factors is a hyperparameter, and enforce uniform decoupling vector dimensions which leads to information loss or redundancy. To address these issues, we propose a type-aware graph decoupling based on influence called Variational Graph Decoupling Auto-Encoder (VGDAE). It uses node labels as interpretable and objectively existing natural semantics for decoupling and allocates embedding space based on node influence, addressing the issues of manually setting the number of factors in traditional graph decoupling and the mismatch between node information size and embedding space. On the Cora, Citeseer, and fb-CMU datasets, VGDAE shows the impact of different node classes as decoupling targets on classification tasks. Furthermore, we perform visualization of the representations, VGDAE exhibits performance improvements of 2% in classification tasks and 12% in clustering tasks when compared with baseline models. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

LeapGNN: Accelerating Distributed GNN Training Leveraging Feature-Centric Model Migration 23

LeapGNN: Accelerating Distributed GNN Training Leveraging Fe...

引用

23rd USENIX Conference on File and Storage Technologies, FAST 2025

作者： Chen, Weijian He, Shuibing Qu, Haoyang Zhang, Xuechen The State Key Laboratory of Blockchain and Data Security Zhejiang University China Zhejiang Lab China Institute of Blockchain and Data Security China Zhejiang Key Laboratory of Big Data Intelligent Computing China Washington State University Vancouver United States

ISBN: (纸本)9781939133458

Distributed training of graph neural networks (GNNs) has become a crucial technique for processing large graphs. Prevalent GNN frameworks are model-centric, necessitating the transfer of massive graph vertex features to GNN models, which leads to a significant communication bottleneck. Recognizing that the model size is often significantly smaller than the feature size, we propose LeapGNN, a feature-centric framework that reverses this paradigm by bringing GNN models to vertex features. To make it truly effective, we first propose a micrograph-based training strategy that leverages a refined structure to enhance locality, combined with the model migration technique, to minimize remote feature retrieval. Then, we devise a feature pre-gathering approach that merges multiple fetch operations into a single one to eliminate redundant feature transmissions. Finally, we employ a micrograph-based merging method that adjusts the number of micrographs for each worker to minimize kernel switches and synchronization overhead. Our experimental results demonstrate that LeapGNN achieves a performance speedup of up to 4.2× compared to the state-of-the-art method, namely P3 © 2025 FAST. All Rights Reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：