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

Accelerating local SGD for non-IID data using variance reduction

Frontiers of computer science 2023年第2期17卷 73-89页

作者： Xianfeng LIANG Shuheng SHEN Enhong CHEN Jinchang LIU Qi LIU Yifei CHENG Zhen PAN Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of ChinaHefei 230027China Ant Financial Services Group Hangzhou 310000China Department of Computer Science and Engineering Hong Kong University of Science and TechnologyHong Kong 999077China

Distributed stochastic gradient descent and its variants have been widely adopted in the training of machine learning models,which apply multiple workers in *** them,local-based algorithms,including Local SGD and FedAvg,have gained much attention due to their superior properties,such as low communication cost and ***,when the data distribution on workers is non-identical,local-based algorithms would encounter a significant degradation in the convergence *** this paper,we propose Variance Reduced Local SGD(VRL-SGD)to deal with the heterogeneous *** extra communication cost,VRL-SGD can reduce the gradient variance among workers caused by the heterogeneous data,and thus it prevents local-based algorithms from slow convergence ***,we present VRL-SGD-W with an effectivewarm-up mechanism for the scenarios,where the data among workers are quite *** from eliminating the impact of such heterogeneous data,we theoretically prove that VRL-SGD achieves a linear iteration speedup with lower communication complexity even if workers access non-identical *** conduct experiments on three machine learning *** experimental results demonstrate that VRL-SGD performs impressively better than Local SGD for the heterogeneous data and VRL-SGD-W is much robust under high data variance among workers.

关键词： distributed optimization variance reduction local SGD federated learning non-IID data

来源：评论

学校读者我要写书评

暂无评论

Wi-SFDAGR: WiFi-Based Cross-Domain Gesture Recognition via Source-Free Domain Adaptation

引用

IEEE Internet of Things Journal 2025年第13期12卷 24159-24173页

作者： Yan, Huan Zhang, Xiang Huang, Jinyang Feng, Yuanhao Li, Meng Wang, Anzhi Ou, Weihua Wang, Hongbing Liu, Zhi Guizhou Normal University School of Big Data and Computer Science Guiyang550025 China University of Science and Technology of China CAS Key Laboratory of Electromagnetic Space Information Hefei230026 China Hefei University of Technology School of Computer and Information Hefei230601 China The University of Electro-Communications Department of Computer and Network Engineering Tokyo1828585 Japan

WiFi Channel State Information (CSI)-based gesture recognition offers unique advantages, including cost-effectiveness and enhanced privacy protection, and has garnered significant attention in recent years. However, existing WiFi-based gesture recognition solutions exhibit poor generalization ability when deployed in new environment, orientation, or location. Although some methods combine labeled source domain and unlabeled target domain to learn domain-independent features, factors such as data privacy protection hinder access to source data during practical environment adaptation. Consequently, we consider realistic scenario where source data is unavailable during adaptation of unlabeled test data, and instead, a trained source domain model is used. In this paper, we propose Wi-SFDAGR, a WiFi-based Source-free Domain Adaptation Gesture Recognition framework. Specifically, we treat cross-domain as an unsupervised clustering problem, aiming to ensure that features within local neighborhoods exhibit similar prediction results while those farther apart display different prediction outcomes in the feature space. We theoretically analyze the effect of enhanced prediction consistency between neighbor points extracted from gestures on generalization error. Furthermore, we employ an attraction-dispersion network to strengthen prediction consistency among closely located features in the feature space while reducing it for distantly located features. To mitigate noise introduced during nearest neighbor sample selection in the feature space (where predictions may not align with the input sample’s prediction), we progressively improve nearby sample feature aggregation by estimating uncertainty to reweight local neighborhood predictions. Finally, extensive experiments are conducted on the Widar 3.0 and XRF55 datasets and the results show our proposed framework outperforms most cross-domain methods. © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Towards property-preserving JPEG encryption with structured permutation and adaptive group differentiation

引用

Visual computer 2024年第9期40卷 6421-6447页

作者： Su, Guo-Dong Chang, Ching-Chun Lin, Chia-Chen Chang, Chin-Chen School of Big Data and Artificial Intelligence Fujian Polytechnic Normal University Fuzhou350300 China Department of Information Engineering and Computer Science Feng Chia University Taichung40724 Taiwan Fujian Province University Fuzhou China Department of Computer Science and Information Engineering National Chin-Yi University of Technology Taichung41170 Taiwan

The security and privacy of digital images are a major concern in cyberspace. JPEG is the most widely used image compression standard and yet there are problems with format compatibility and file size preservation in most of the modern encryption schemes for JPEG images. To address these problems, we propose a novel properties-preserving encryption scheme that obfuscates JPEG images by scrambling AC and DC coefficients. The key observation is that an innovative structured permutation has a remarkable effect on enciphering the coefficients and simultaneously prevents value overflow as well as size increment. On this basis, we first leverage the row-wise reordering and reversing technique to disorganize the DC coefficients. Afterward, a series of groups of consecutive DC differential values are produced using adaptive group differentiation and each of them is independently permuted inside. Finally, we perform block-wise ACCs permutation and intra-block ACCs shuffling to further confuse the outline of the original image. Moreover, invariant features regarding the coefficients are incorporated in the key generation process to resist various cryptanalytic attacks. Experimental results demonstrate a significant improvement in terms of format compatibility and file size preservation, and verify the security against various attacks. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

An effective compressed image authentication scheme based on N-variant AMBTC

引用

Multimedia Tools and Applications 2024年第2期83卷 3801-3829页

作者： Su, Guo-Dong Chang, Chin-Chen Lin, Chia-Chen School of Big Data and Artificial Intelligence Fujian Polytechnic Normal University Fuzhou350300 China Department of Information Engineering and Computer Science Feng Chia University 100 Wenhwa Road Seatwen Taichung40724 Taiwan Department of Computer Science and Information Engineering National Chin-Yi University of Technology Taichung41170 Taiwan

Image authentication is one technique that provides integrity protection for digital images, making them sensitive to any slight modification. Recently, the detectability of absolute moment block truncation coding (AMBTC) compressed images has been attracting more attention due to its integrity authentication concerns. Thus, this paper proposes an effective N-variant AMBTC based image authentication scheme for AMBTC compressed images. First, a novel AMBTC compression code is derived using a variant AMBTC technique that can provide a better quality of compressed images. Then, each AMBTC compression code is further eliminated into a version requiring fewer bits using the proposed N-variant AMBTC technique, and those vacated N-bits are used to conceal authentication codes, which is generated by hashing the AMBTC compression code and location information. Experimental results confirm that the proposed scheme has superior stability and accuracy in tampering detection while providing better visual quality of the watermarked image. © 2023, The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

A DL Intrusion Detection Method for Low-Rate Denial of Service Attacks

A DL Intrusion Detection Method for Low-Rate Denial of Servi...

引用

2023 Asia-Pacific Conference on Image Processing, Electronics and computers, IPEC 2023

作者： Wu, Yuhong Lv, Yunshan Hu, Xiangdong School of Big Data & Computer Science Engineering Chongqing College of Mobile Communication China School of Computer Science and Technology Chongqing University of Posts and Telecommunications Key Laboratory of Public Big Data Security Technology Chongqing Chongqing China School of Big Data & Computer Science Engineering Chongqing College of Mobile Communication Key Laboratory of Public Big Data Security Technology Chongqing China School of Automation Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (纸本)9781665457033

Denial of service (DoS) attacks is among the most harmful network threats. Low-rate DoS (LDoS) attacks feature good concealment and are likely to evade detection by conventional signal analysis-based methods. A LDoS attack detection method that combines the convolutional neural network and the gated recurrent unit is proposed in the present work. To evaluate the proposed method, we collect real user traffic from a university's website, label the traffic with LDoS attacks as normal traffic. In order to get the real attack traffic, this paper has collected some new LDoS attack programs, such as slowloris, slowhttptest, pwnlloris, torhammer and httplog, which can be obtained from public channels, and constructed a LAN environment that conformed to the working scenario of the program. By running the attack program, the attack traffic could be obtained. In a large sample scenario, the average detection rate of our proposed method can reach 98.68%. This article focuses on the research: the average detection rate of the detection method proposed in this article in the case that the security agency can only intercept a small number of attack samples. That is, in the small sample scenario, the detection of the collected traffic shows that the average detection rate of the proposed detection method can reach 89.54% in a small sample scenario. Its effective detection rate is obviously superior to the existing similar detection methods. © 2023 IEEE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

Research on a Technology of Mail Anti-virus Gateway for Industrial Internet

Research on a Technology of Mail Anti-virus Gateway for Indu...

引用

2023 IEEE International Conference on Image Processing and computer Applications, ICIPCA 2023

作者： Wu, Yuhong Lv, Yunshan Zhang, Ling School of Big Data & Computer Science Engineering Chongqing College of Mobile Communication Key Laboratory of Public Big Data Security Technology Chongqing China School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (纸本)9798350314670

With the rapid rise of the Industrial Internet, emails that convey a large amount of information require a strong network security environment. Aiming at the increasingly complex mail virus prevention and control work under the background of the industrial Internet, this paper designs and implements a mail anti-virus gateway system. First, design the overall process and structure of the mail virus processing system;then, design an extended mail receiving and sending protocol on the basis of the public framework, thereby ensuring the convenience of the system for use in different roles and environments. In the detection and filtering part of mail virus, an anti-virus engine containing multiple sub-function modules is designed to detect and filter viruses in mail text and attachments. Through the function test of 1000 kinds of virus mails, it is found that the mail anti-virus gateway system designed in this article can detect and filter most types of mail viruses. Compared with the virus detection on the client and server, the anti-virus gateway system has better performance And efficiency. © 2023 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Incentive Mechanism Based on a Cooperative Mode: A Stackelberg Game Approach

引用

IEEE Internet of Things Journal 2025年第13期12卷 24722-24737页

作者： Wang, Long Wang, Yingjie Teng, Haojun Jiao, Xiuzhen Sun, Meimei Yang, Jishen Cai, Zhipeng Yantai University School of Computer and Control Engineering Yantai264005 China China Judicial Big Data Research Institute Co. Ltd China Naval Aviation University China Georgia State University Department of Computer Science AtlantaGA30303 United States

With the explosive growth of mobile data, Mobile Crowd Sensing (MCS) has become a popular paradigm for large-scale data collection. The difficulty of data collection and the gaps in workers’ sensing capabilities are key factors to consider in worker recruitment and task assignment. To address these issues, we designed a two-stage cooperative incentive mechanism. In the first stage, a shelving level is introduced to assess task difficulty. Tasks are divided into high-quality and low-quality groups based on quality scores, while workers are categorized into high-ability and low-ability groups based on their historical performance. The Improved Chaotic Particle Swarm Optimization (ICPSO) algorithm is then applied to generate optimal task combinations. In the second stage, we address benefit distribution among cooperating workers by introducing time-dependent rewards and employing Stackelberg game theory to analyze the optimal completion time for both high-ability and low-ability workers. This analysis determines the optimal reward distribution and ability value allocation, with proof of the existence and uniqueness of a Nash equilibrium. Comparative experiments conducted on real-world datasets demonstrate that our cooperative task mechanism outperforms existing task bundling methods, validating its rationality and effectiveness. © 2014 IEEE.

关键词： Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Improved Particle Swarm Algorithm Using Multiple Strategies 1

引用

14th International Symposium on Intelligence Computation and Applications, ISICA 2023

作者： Yi, Yunfei Wang, Zhiyong Shi, Yunying School of Big Data and Computer Hechi University Guangxi Yizhou546300 China College of Computer Science and Engineering Guangxi Normal University Guangxi Guilin541001 China

ISBN: (数字)9789819743933

ISBN: (纸本)9789819743926

In order to address the issues of premature convergence and low search efficiency in the basic particle swarm algorithm, this paper analyzes the improved particle swarm optimization algorithms proposed by previous researchers. Based on this analysis, a modified algorithm for particle swarm optimization is proposed. The enhanced algorithm adjusts the inertia weight parameter in a nonlinear manner and dynamically changes the self-learning factor using chaos, allowing it to continuously change during iterations and achieve better optimization results. Additionally, to prevent the algorithm from getting trapped in local optima, a mutation operation is introduced into the improved algorithm. Finally, several classical test functions are used to conduct experiments, and the results are compared with the improved particle swarm optimization algorithms described in related literature. The experimental results demonstrate that the newly proposed algorithm achieves a certain degree of improvement in optimization accuracy compared to the basic particle swarm algorithm. This indicates that the modified algorithm effectively avoids premature convergence and possesses high search efficiency. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

A Symbolic Rule Integration Framework with Logic Transformer for Inductive Relation Prediction 24

A Symbolic Rule Integration Framework with Logic Transformer...

引用

33rd ACM Web Conference, WWW 2024

作者： Pan, Yudai Liu, Jun Zhao, Tianzhe Zhang, Lingling Lin, Yun Dong, Jin Song School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University Shaanxi Xi'an China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi'an China Shanghai Jiao Tong University Shanghai China National University of Singapore Singapore Singapore

ISBN: (纸本)9798400701719

Relation prediction in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant paradigm by KG embeddings has a limitation to predict the relation between unseen entities. This situation is called an inductive setting, which is more common in the real-world scenario. To handle this issue, implicit symbolic rules have shown great potential in capturing the inductive capability. However, it is still challenging to obtain precise representations of logic rules from KGs. The argument variability and predicate non-commutativity in symbolic rule integration make the modeling of component symbols difficult. To this end, we propose a novel inductive relation prediction model named SymRITa with a logic transformer integrating rules. SymRITa firstly extracts the subgraph, whose embeddings are captured by a graph network. Meanwhile, symbolic rule graphs in the subgraph can be generated. Then, the symbolic rules are modeled by a proposed logic transformer. Specifically, the input format based on the subgraph-based embeddings is to focus on the argument variability in symbolic rules. In addition, a conjunction attention mechanism in the logic transformer can resolve predicate non-commutativity in the symbolic rule integration process. Finally, the subgraph-based and symbol-based embeddings obtained from the previous steps are combined for the training regime, and prediction results as well as rules explaining the reasoning process are explicitly output. Extensive experiments on twelve inductive datasets show that SymRITa achieves outstanding effectiveness compared to state-of-the-art inductive baselines. Moreover, the logic rules with corresponding confidences provide an interpretable paradigm. © 2024 ACM.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Reversible data hiding scheme using prediction neural network and adaptive modulation mapping

引用

Multimedia Tools and Applications 2025年第9期84卷 6665-6686页

作者： Chen, Si-Sheng Chang, Chin-Chen Horng, Ji-Hwei School of Big Data and Artificial Intelligence Fujian Polytechnic Normal University Fujian Fuzhou35030 China Department of Information Engineering and Computer Science Feng Chia University Taichung40724 Taiwan Department of Electrical Engineering National Quemoy University Kinmen89250 Taiwan

Prediction error expansion (PEE) is an attractive approach for reversible data hiding (RDH). The key issue for PEE-based RDH is to improve the prediction accuracy and design a better modulation mapping. This paper proposes a novel prediction error modulation (PEM) scheme, which comprises a prediction neural network and a modulation mapping rule generation algorithm. We use the multi-scale feature extraction (MSFE) module and the residual dense networks (RDN) to construct the prediction neural network. In the proposed RDH scheme, the cover image is divided into two parts, the reference pixel set and the cover pixel set, based on the chessboard pattern. The prediction network serves to predict the values of the cover pixel set using the reference pixel set. An optimization model is set up to adaptively determine the optimal modulation mapping for data hiding based on the specific prediction-error histogram and payload constraint. Experimental results show the superiority of the proposed prediction neural network and the optimized modulation mapping compared with related works. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：