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

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

来源：评论

学校读者我要写书评

暂无评论

A Dual-Port Millimeter-Wave Frequency Reconfigurable Array Antenna

引用

Progress in Electromagnetics Research C 2025年 154卷 221-228页

作者： Gao, Mingming Yuan, Hang Nan, Jingchang Niu, Hongliang Ge, Chang Liaoning Technical University China Liaoning Key Laboratory of Radio Frequency and Big Data for Intelligent Applications China

With the advancement of millimeter wave communication technology, reconfigurable antennas have garnered significant attention due to their adaptability. However, their radiation gain and sidelobe suppression performance are often constrained by factors such as diode package size and array scale. To address these challenges, this paper proposes a three-state frequency reconfigurable array antenna with high gain and low sidelobe characteristics, specifically designed to meet the demands of millimeter-wave communication. By optimizing the feed network and radiating element design, the proposed antenna achieves enhanced gain and improved sidelobe suppression. The design employs a dual-port feeding architecture that integrates a Taylor non-uniform amplitude distribution with a series-parallel hybrid feed network. This configuration ensures phase consistency while minimizing the number of diodes to just four, significantly reducing insertion loss and structural complexity. The antenna prototype is fabricated using standard printed circuit board (PCB) technology, with overall dimensions of 60.4 × 63 × 0.508 mm3. Measurement results indicate that the antenna exhibits an impedance bandwidth spanning from 27.5 GHz to 28.5 GHz and from 34.5 GHz to 35.5 GHz. The corresponding peak gains are 19.69 dBi and 19.51 dBi, with the sidelobe levels of 18.93 dB and 18.03 dB, respectively. The proposed antenna demonstrates excellent radiation characteristics and significantly enhances radiation efficiency. With its simple structure, dual-band radiation capability, high gain, and low sidelobe levels, this antenna is highly suitable for millimeter-wave wireless communication systems. It offers a high-performance solution for multi-band communication in 5G/6G networks. © 2025, Electromagnetics Academy. All rights reserved.

关键词： Printed circuit boards

来源：评论

学校读者我要写书评

暂无评论

Helicity-Controlled Spin Hall Angle in 2D Altermagnets with Rashba Spin-Orbit Coupling

引用

Chinese Physics Letters 2025年第1期42卷 134-140页

作者： Weiwei Chen Longhai Zeng W.Zhu Key Laboratory of Intelligent Manufacturing Quality Big Data Tracing and Analysis of Zhejiang Province College of SciencesChina Jiliang UniversityHangzhou 310018China Key Laboratory of Intelligent Manufacturing Quality Big Data Tracing and Analysis of Zhejiang Province College of ScienceChina Jiliang UniversityHangzhou 310018China School of Science Westlake UniversityHangzhou 310024China

We investigated the efficiency of charge-to-spin conversion in two-dimensional Rashba altermagnets,a class of materials that combines the characteristics of both ferromagnets and *** quantum linear response theory,we quantified the longitudinal and spin Hall conductivities in this system and demonstrated a substantial enhancement in the spin Hall angle below the band crossing point through the dual effects of relativistic spin–orbit interaction and nonrelativistic altermagnetic exchange ***,the results showed that the skew scattering and intrinsic mechanisms arising from Fermi sea states are almost negligible in this system,in contrast to conventional ferromagnetic Rashba *** findings not only elucidate the spin dynamics in Rashba altermagnets but also pave the way for developing novel strategies for manipulating charge-to-spin conversion via sophisticated control of noncollinear and collinear out-of-plane spin textures.

关键词： interaction magnets Rashba

来源：评论

学校读者我要写书评

暂无评论

Learning Counterfactual Explanation of Graph Neural Networks via Generative Flow Network

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第9期5卷 4607-4619页

作者： He, Kangjia Liu, Li Zhang, Youmin Wang, Ye Liu, Qun Wang, Guoyin Chongqing University of Posts and Telecommunications Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Chongqing400065 China

Counterfactual subgraphs explain graph neural networks (GNNs) by answering the question: 'How would the prediction change if a certain subgraph were absent in the input instance?' The differentiable proxy adjacency matrix is prevalent in current counterfactual subgraph discovery studies due to its ability to avoid exhaustive edge searching. However, a prediction gap exists when feeding the proxy matrix with continuous values and the thresholded discrete adjacency matrix to GNNs, compromising the optimization of the subgraph generator. Furthermore, the end-to-end learning schema adopted in the subgraph generator limits the diversity of counterfactual subgraphs. To this end, we propose CF-GFNExplainer, a flow-based approach for learning counterfactual subgraphs. CF-GFNExplainer employs a policy network with a discrete edge removal schema to construct counterfactual subgraph generation trajectories. Additionally, we introduce a loss function designed to guide CF-GFNExplainer's optimization. The discrete adjacency matrix generated in each trajectory eliminates the prediction gap, enhancing the validity of the learned subgraphs. Furthermore, the multitrajectories sampling strategy adopted in CF-GFNExplainer results in diverse counterfactual subgraphs. Extensive experiments conducted on synthetic and real-world datasets demonstrate the effectiveness of the proposed method in terms of validity and diversity. © 2020 IEEE.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

A Method for Fast Feature Selection Utilizing Cross-Similarity within the Context of Fuzzy Relations

引用

Computers, Materials & Continua 2025年第4期83卷 1195-1218页

作者： Wenchang Yu Xiaoqin Ma Zheqing Zhang Qinli Zhang School of Big Data and Artificial Intelligence Chizhou UniversityChizhou247000China Anhui Education Big Data Intelligent Perception and Application Engineering Research Center Anhui Provincial Joint Construction Key Laboratory of Intelligent Education Equipment and TechnologyChizhou247000China

Feature selection methods rooted in rough sets confront two notable limitations:their high computa-tional complexity and sensitivity to noise,rendering them impractical for managing large-scale and noisy *** primary issue stems from these methods’undue reliance on all *** overcome these challenges,we introduce the concept of cross-similarity grounded in a robust fuzzy relation and design a rapid and robust feature selection ***,we construct a robust fuzzy relation by introducing a truncation ***,based on this fuzzy relation,we propose the concept of cross-similarity,which emphasizes the sample-to-sample similarity relations that uniquely determine feature importance,rather than considering all such relations *** studying the manifestations and properties of cross-similarity across different fuzzy granularities,we propose a forward greedy feature selection algorithm that leverages cross-similarity as the foundation for information *** algorithm significantly reduces the time complexity from O(m2n2)to O(mn2).Experimental findings reveal that the average runtime of five state-of-the-art comparison algorithms is roughly 3.7 times longer than our algorithm,while our algorithm achieves an average accuracy that surpasses those of the five comparison algorithms by approximately 3.52%.This underscores the effectiveness of our *** paper paves the way for applying feature selection algorithms grounded in fuzzy rough sets to large-scale gene datasets.

关键词： Fuzzy rough sets feature selection cross-similarity fuzzy relations

来源：评论

学校读者我要写书评

暂无评论

Underwater target recognition based on adaptive multi-feature fusion network

引用

Multimedia Tools and Applications 2025年第10期84卷 7297-7317页

作者： Pan, Xiaoying Sun, Jia Feng, TianHao Lei, MingZhu Wang, Hao Zhang, WuXia Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121 China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’an710121 China School of Computer Science and Technology Xi’an University of Post & Telecommunications Xi’an710121 China

Due to the complexity of the underwater environment, underwater acoustic target recognition is more challenging than ordinary target recognition, and has become a hot topic in the field of underwater acoustics research. In recent years, deep learning has been widely used in underwater recognition due to its powerful feature learning capabilities. However, most deep learning-based underwater target recognition methods use only the time-frequency domain features of signals, ignoring the frequency domain image features of signals. Additionally, they only use simple summation or splicing strategies to fuse and discriminate the extracted features, which leads to limited improvement in the accuracy of underwater target recognition. To address these issues, this paper proposes an underwater target recognition method based on an adaptive multi-feature fusion network. The method consists of a data pre-processing module, a multi-dimensional feature extraction module, and an adaptive multi-feature fusion module. In the multi-dimensional feature extraction module, the long short time memory network (LSTM) and the one-dimensional convolutional neural network (1DCNN) are used to extract the time-frequency features of the underwater signal. Furthermore, the two-dimensional convolutional neural network (2DCNN) is used to extract the image features in the frequency domain. The adaptive multi-feature fusion module uses an attention mechanism for adaptive weighted fusion to make full use of the learned features. The effectiveness of the proposed method is validated on the ShipEar dataset, and the recognition accuracy reaches 94.92%, which is higher than other existing methods. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Bin Packing Optimization via Deep Reinforcement Learning

引用

IEEE robotICS AND AUTOMATION LETTERS 2025年第3期10卷 2542-2549页

作者： Wang, Baoying Lin, Zhaohui Kong, Weijie Dong, Huixu Zhejiang Univ Mech Engn Dept Grasp Lab Hangzhou 310027 Peoples R China Zhejiang Key Lab Ind Big Data & Robot Intelligent Hangzhou 310058 Peoples R China

The bin packing problem (BPP) has attracted enthusiastic research interest recently, owing to its widespread applications in logistics and warehousing environments. It is truly essential to optimize the bin packing to enable more objects to be packed into bins, in which the object packing order and placement position are the two crucial optimization goals. However, existing optimization methods for BPP, such as the genetic algorithm (GA), emerge as the primary issues in highly time cost and relatively low accuracy, making it difficult to implement in realistic scenarios. To well relieve related research gaps, we present a novel optimization method of 2D and 3D BPP for objects with regular shapes via deep reinforcement learning (DRL), maximizing the space utilization and minimizing the usage number of bins. First, an end-to-end DRL neural network constructed by a modified Pointer Network consisting of an encoder, a decoder and an attention module is proposed to achieve the optimal object packing order. Second, conforming to the top-down operation mode, the placement strategy based on a height map is used to determine the placement positions of the ordered objects in the bins, preventing the objects from colliding with bins and other objects in bins. Third, the reward and loss functions are defined as the indicators of the compactness, pyramid, and usage number of bins to conduct the DRL neural network training based on an on-policy actor-critic framework. Finally, we conduct extensive experiments to evaluate the performance of the proposed method, and demonstrate that our method achieves a 3% improvement and more than 50x time saving over the GA. Further, an experiment on robotic packing is implemented to validate its generalization capacity in the realistic environment.

关键词： Three-dimensional displays robots Genetic algorithms Costs Deep reinforcement learning Decoding Accuracy Search problems Logistics Convolution Reinforcement learning manipulation planning bin packing problem (BPP) robot packing

来源：评论

学校读者我要写书评

暂无评论

A Novel Competition-Based Coordination Model With Dynamic Feedback for Multi-robot Systems

引用

IEEE/CAA Journal of Automatica Sinica 2023年第10期10卷 2029-2031页

作者： Bo Peng Xuerui Zhang Mingsheng Shang Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714 Chongqing School University of Chinese Academy of SciencesChongqing 400714China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China

Dear Editor, Task allocation strategies are important in multi-robot systems and have been intensely investigated by researchers because they are critical in determining the performance of the system. In this letter, a novel competition-based coordination model is proposed to solve the multi-robot task allocation problem and applied to a multi-robot object tracking scenario.

关键词： robot robot Dynamic

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Improve Cross-Domain Mixed Sampling With Guidance Training for Adaptive Segmentation

引用

IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT 2025年 74卷

作者： Zhou, Wenlve Zhou, Zhiheng Wang, Tianlei Zeng, Delu South China Univ Technol Sch Elect & Informat Engn Key Lab Big Data & Intelligent Robot Minist Educ Guangzhou 510641 Guangdong Peoples R China Wuyi Univ Dept Intelligent Mfg Jiangmen 529020 Peoples R China

Unsupervised domain adaptation (UDA) endeavors to adjust models trained on a source domain to perform well on a target domain without requiring additional annotations. In the context of domain adaptive semantic segmentation, which tackles UDA for dense prediction, the goal is to circumvent the need for costly pixel-level annotations. Typically, various prevailing methods baseline rely on constructing intermediate domains via cross-domain mixed sampling techniques to mitigate the performance decline caused by domain gaps. However, such approaches generate synthetic data that diverge from real-world distributions, potentially leading the model astray from the true target distribution. To address this challenge, we propose a novel auxiliary task called Guidance Training. This task facilitates the effective utilization of cross-domain mixed sampling techniques while mitigating distribution shifts from the real world. Specifically, Guidance Training guides the model to extract and reconstruct the target-domain feature distribution from mixed data, followed by decoding the reconstructed target-domain features to make pseudo-label predictions. Importantly, integrating Guidance Training incurs minimal training overhead and imposes no additional inference burden. We demonstrate the efficacy of our approach by integrating it with existing methods, consistently improving performance. The implementation will be available at https://***/Wenlve-Zhou/Guidance-Training.

关键词： Training Semantic segmentation Computational modeling Adaptation models Predictive models Decoding Feature extraction Computer vision Annotations Semantics Distribution shift Guidance Training pseudo-label semantic segmentation unsupervised domain adaptation (UDA)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：