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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

L_(1)-Smooth SVM with Distributed Adaptive Proximal Stochastic Gradient Descent with Momentum for Fast Brain Tumor Detection

引用

Computers, Materials & Continua 2024年第5期79卷 1975-1994页

作者： Chuandong Qin Yu Cao Liqun Meng School of Mathematics and Information Science North Minzu UniversityYinchuan750021China Ningxia Key Laboratory of Intelligent Information and Big Data Processing Yinchuan750021China

Brain tumors come in various types,each with distinct characteristics and treatment approaches,making manual detection a time-consuming and potentially ambiguous *** tumor detection is a valuable tool for gaining a deeper understanding of tumors and improving treatment *** learning models have become key players in automating brain tumor *** descent methods are the mainstream algorithms for solving machine learning *** this paper,we propose a novel distributed proximal stochastic gradient descent approach to solve the L_(1)-Smooth Support Vector Machine(SVM)classifier for brain tumor ***,the smooth hinge loss is introduced to be used as the loss function of *** avoids the issue of nondifferentiability at the zero point encountered by the traditional hinge loss function during gradient descent ***,the L_(1) regularization method is employed to sparsify features and enhance the robustness of the ***,adaptive proximal stochastic gradient descent(PGD)with momentum,and distributed adaptive PGDwithmomentum(DPGD)are proposed and applied to the L_(1)-Smooth *** computing is crucial in large-scale data analysis,with its value manifested in extending algorithms to distributed clusters,thus enabling more efficient processing ofmassive amounts of *** DPGD algorithm leverages Spark,enabling full utilization of the computer’s multi-core *** to its sparsity induced by L_(1) regularization on parameters,it exhibits significantly accelerated convergence *** the perspective of loss reduction,DPGD converges faster than *** experimental results show that adaptive PGD withmomentumand its variants have achieved cutting-edge accuracy and efficiency in brain tumor ***-trained models,both the PGD andDPGD outperform other models,boasting an accuracy of 95.21%.

关键词： Support vector machine proximal stochastic gradient descent brain tumor detection distributed computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

JDC-GCN: joint diversity and consistency graph convolutional network

引用

Neural Computing and Applications 2025年 1-17页

作者： Lin, Renjie Yao, Jie Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

In real-world scenarios, multi-view data comprises heterogeneous features, with each feature corresponding to a specific view. The objective of multi-view semi-supervised classification is to enhance classification performance by leveraging the inherent complementary and consistent information present within diverse views. Nevertheless, many existing frameworks primarily focus on assigning suitable weights to different views while neglecting the importance of consistent information. In this paper, a multi-view semi-supervised classification framework called joint diversity and consistency graph convolutional network (JDC-GCN) is proposed. Firstly, the structure of graph convolutional network is introduced to the multi-view semi-supervised classification, capable of propagating the label information over the topological structure of multi-view data. Secondly, the proposed JDC-GCN captures the complementary and consistent information from multiple views through two indispensable sub-modules, Diversity-GCN and Consistency-GCN, respectively. Finally, the attention mechanism is leveraged to dynamically adjust the weights of various views, allowing us to measure the significance of heterogeneous features and the consistent graph without introducing additional parameters. Comprehensive experiments on eight multi-view datasets are conducted to validate the effectiveness of the JDC-GCN algorithm. The results show that the proposed method exhibits superior classification performance compared to other state-of-the-art methods. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Research on Improved MobileViT Image Tamper Localization Model

引用

Computers, Materials & Continua 2024年第8期80卷 3173-3192页

作者： Jingtao Sun Fengling Zhang Huanqi Liu Wenyan Hou School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts and TelecommunicationsXi’an710121China

As image manipulation technology advances rapidly,the malicious use of image tampering has alarmingly escalated,posing a significant threat to social *** the realm of image tampering localization,accurately localizing limited samples,multiple types,and various sizes of regions remains a multitude of *** issues impede the model’s universality and generalization capability and detrimentally affect its *** tackle these issues,we propose FL-MobileViT-an improved MobileViT model devised for image tampering *** proposed model utilizes a dual-stream architecture that independently processes the RGB and noise domain,and captures richer traces of tampering through dual-stream ***,the model incorporating the Focused Linear Attention mechanism within the lightweight network(MobileViT).This substitution significantly diminishes computational complexity and resolves homogeneity problems associated with traditional Transformer attention mechanisms,enhancing feature extraction diversity and improving the model’s localization *** comprehensively fuse the generated results from both feature extractors,we introduce the ASPP architecture for multi-scale feature *** facilitates a more precise localization of tampered regions of various ***,to bolster the model’s generalization ability,we adopt a contrastive learning method and devise a joint optimization training strategy that leverages fused features and captures the disparities in feature distribution in tampered *** strategy enables the learning of contrastive loss at various stages of the feature extractor and employs it as an additional constraint condition in conjunction with cross-entropy *** a result,overfitting issues are effectively alleviated,and the differentiation between tampered and untampered regions is *** evaluations on five benchmark datasets(IMD-20,CASIA,NIST-16,Columbia and Coverage)validat

关键词： Image tampering localization focused linear attention mechanism MobileViT contrastive loss

来源：评论

学校读者我要写书评

暂无评论

Edge Computing Task Scheduling with Joint Blockchain and Task Caching in Industrial Internet

引用

Computers, Materials & Continua 2023年第4期75卷 2101-2117页

作者： Yanping Chen Xuyang Bai Xiaomin Jin Zhongmin Wang Fengwei Wang Li Ling School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anShaanxi710121China ZTE Corporation Shenzhen51805China

Deploying task caching at edge servers has become an effectiveway to handle compute-intensive and latency-sensitive tasks on the industrialinternet. However, how to select the task scheduling location to reduce taskdelay and cost while ensuring the data security and reliable communicationof edge computing remains a challenge. To solve this problem, this paperestablishes a task scheduling model with joint blockchain and task cachingin the industrial internet and designs a novel blockchain-assisted cachingmechanism to enhance system security. In this paper, the task schedulingproblem, which couples the task scheduling decision, task caching decision,and blockchain reward, is formulated as the minimum weighted cost problemunder delay constraints. This is a mixed integer nonlinear problem, which isproved to be nonconvex and NP-hard. To solve the optimal solution, thispaper proposes a task scheduling strategy algorithm based on an improvedgenetic algorithm (IGA-TSPA) by improving the genetic algorithm initializationand mutation operations to reduce the size of the initial solutionspace and enhance the optimal solution convergence speed. In addition,an Improved Least Frequently Used algorithm is proposed to improve thecontent hit rate. Simulation results show that IGA-TSPA has a faster optimalsolution-solving ability and shorter running time compared with the existingedge computing scheduling algorithms. The established task scheduling modelnot only saves 62.19% of system overhead consumption in comparison withlocal computing but also has great significance in protecting data security,reducing task processing delay, and reducing system cost.

关键词： Edge computing task scheduling blockchain task caching industrial security

来源：评论

学校读者我要写书评

暂无评论

AMHF-TP:Multifunctional therapeutic peptides prediction based on multi-granularity hierarchical features

引用

Quantitative Biology 2025年第1期13卷 127-141页

作者： Shouheng Tuo YanLing Zhu Jiangkun Lin Jiewei Jiang School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’anChina Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’anChina Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anChina School of Electronic Engineering Xi’an University of Posts and TelecommunicationsXi’anChina

Multifunctional therapeutic peptides(MFTP)hold immense potential in diverse therapeutic contexts,yet their prediction and identification remain challenging due to the limitations of traditional methodologies,such as extensive training durations,limited sample sizes,and inadequate generalization *** address these issues,we present AMHF-TP,an advanced method for MFTP recognition that utilizes attention mechanisms and multi-granularity hierarchical features to enhance *** AMHF-TP is composed of four key components:a migration learning module that leverages pretrained models to extract atomic compositional features of MFTP sequences;a convolutional neural network and selfattention module that refine feature extraction from amino acid sequences and their secondary structures;a hypergraph module that constructs a hypergraph for complex similarity representation between MFTP sequences;and a hierarchical feature extraction module that integrates multimodal peptide sequence *** with leading methods,the proposed AMHF-TP demonstrates superior precision,accuracy,and coverage,underscoring its effectiveness and robustness in MFTP *** comparative analysis of separate hierarchical models and the combined model,as well as with five contemporary models,reveals AMHFTP’s exceptional performance and stability in recognition tasks.

关键词： deep learning hypergraph multifunctional therapeutic peptides multi-granularity hierarchical features

来源：评论

学校读者我要写书评

暂无评论

Face Forgery Detection Based on Fine-Grained Clues and Noise Inconsistency

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第1期6卷 144-158页

作者： Zhang, Dengyong He, Ruiyi Liao, Xin Li, Feng Chen, Jiaxin Yang, Gaobo Changsha University of Science and Technology Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation the School of Computer and Communication Engineering Changsha410114 China Hunan University Changsha410082 China

Deepfake detection has gained increasing research attention in media forensics, and a variety of works have been produced. However, subtle artifacts might be eliminated by compression, and the convolutional neural networks (CNNs)-based detectors are invalidated for fake face images with compression. In this work, we propose a two-stream network for deepfake detection. We observed that high-frequency noise features and spatial features are inherently complementary to each other. Thus, both spatial features and high-frequency noise features are exploited for face forgery detection. Specifically, we design a double-frequency transformer module (DFTM) to guide the learning of spatial features from local artifact regions. To effectively fuse spatial features and high-frequency noise features, a dual-domain attention fusion module (DDAFM) is designed. We also introduce a local relationship constraint loss, which requires only image-level labels, for model training. We evaluate the proposed approach on five large-scale benchmark datasets, and extensive experimental results demonstrate the proposed approach outperforms most SOTA works. © 2024 IEEE.

关键词： Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

Joint Estimation of SOH and RUL for Lithium-Ion Batteries Based on Improved Twin Support Vector Machineh

引用

Energy Engineering 2025年第1期122卷 243-264页

作者： Liyao Yang Hongyan Ma Yingda Zhang Wei He School of Electrical and Information Engineering Beijing University of Civil Engineering and ArchitectureBeijing100044China Institute of Distributed Energy Storage Safety Big Data Beijing100044China Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing100044China

Accurately estimating the State of Health(SOH)and Remaining Useful Life(RUL)of lithium-ion batteries(LIBs)is crucial for the continuous and stable operation of battery management ***,due to the complex internal chemical systems of LIBs and the nonlinear degradation of their performance,direct measurement of SOH and RUL is *** address these issues,the Twin Support Vector Machine(TWSVM)method is proposed to predict SOH and ***,the constant current charging time of the lithium battery is extracted as a health indicator(HI),decomposed using Variational Modal Decomposition(VMD),and feature correlations are computed using Importance of Random Forest Features(RF)to maximize the extraction of critical factors influencing battery performance ***,to enhance the global search capability of the Convolution Optimization Algorithm(COA),improvements are made using Good Point Set theory and the Differential Evolution *** Improved Convolution Optimization Algorithm(ICOA)is employed to optimize TWSVM parameters for constructing SOH and RUL prediction ***,the proposed models are validated using NASA and CALCE lithium-ion battery *** results demonstrate that the proposed models achieve an RMSE not exceeding 0.007 and an MAPE not exceeding 0.0082 for SOH and RUL prediction,with a relative error in RUL prediction within the range of[-1.8%,2%].Compared to other models,the proposed model not only exhibits superior fitting capability but also demonstrates robust performance.

关键词： State of health remaining useful life variational modal decomposition random forest twin support vector machine convolutional optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：