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

Enhanced Acceleration for Generalized Nonconvex Low-Rank Matrix Learning

Chinese Journal of Electronics 2025年第1期34卷 98-113页

作者： Hengmin Zhang Jian Yang Wenli Du Bob Zhang Zhiyuan Zha Bihan Wen School of Electrical and Electronic Engineering Nanyang Technological University School of Computer Science and Engineering Nanjing University of Science and Technology School of Information Science and Engineering East China University of Science and Technology Department of Electrical and Computer Engineering University of Macau

Matrix minimization techniques that employ the nuclear norm have gained recognition for their applicability in tasks like image inpainting, clustering, classification, and reconstruction. However, they come with inherent biases and computational burdens, especially when used to relax the rank function, making them less effective and efficient in real-world scenarios. To address these challenges, our research focuses on generalized nonconvex rank regularization problems in robust matrix completion, low-rank representation, and robust matrix regression. We introduce innovative approaches for effective and efficient low-rank matrix learning, grounded in generalized nonconvex rank relaxations inspired by various substitutes for the ?0-norm relaxed functions. These relaxations allow us to more accurately capture low-rank structures. Our optimization strategy employs a nonconvex and multi-variable alternating direction method of multipliers, backed by rigorous theoretical analysis for complexity and *** algorithm iteratively updates blocks of variables, ensuring efficient convergence. Additionally, we incorporate the randomized singular value decomposition technique and/or other acceleration strategies to enhance the computational efficiency of our approach, particularly for large-scale constrained minimization problems. In conclusion, our experimental results across a variety of image vision-related application tasks unequivocally demonstrate the superiority of our proposed methodologies in terms of both efficacy and efficiency when compared to most other related learning methods.

关键词： Learning systems Image recognition Minimization Computational efficiency Complexity theory Matrix decomposition Optimization Image reconstruction Singular value decomposition Convergence

来源：评论

学校读者我要写书评

暂无评论

Robust federated contrastive recommender system against targeted model poisoning attack

引用

science China(Information sciences) 2025年第4期68卷 50-65页

作者： Wei YUAN Chaoqun YANG Liang QU Guanhua YE Quoc Viet Hung NGUYEN Hongzhi YIN School of Electrical Engineering and Computer Science The University of Queensland School of Information and Communication Technology Griffith University Deep Neural Computing Company Limited

Federated recommender systems(FedRecs) have garnered increasing attention recently, thanks to their privacypreserving benefits. However, the decentralized and open characteristics of current FedRecs present at least two ***, the performance of FedRecs is compromised due to highly sparse on-device data for each client. Second, the system's robustness is undermined by the vulnerability to model poisoning attacks launched by malicious users. In this paper, we introduce a novel contrastive learning framework designed to fully leverage the client's sparse data through embedding augmentation, referred to as CL4FedRec. Unlike previous contrastive learning approaches in FedRecs that necessitate clients to share their private parameters, our CL4FedRec aligns with the basic FedRec learning protocol, ensuring compatibility with most existing FedRec implementations. We then evaluate the robustness of FedRecs equipped with CL4FedRec by subjecting it to several state-of-the-art model poisoning attacks. Surprisingly, our observations reveal that contrastive learning tends to exacerbate the vulnerability of FedRecs to these attacks. This is attributed to the enhanced embedding uniformity, making the polluted target item embedding easily proximate to popular items. Based on this insight, we propose an enhanced and robust version of CL4FedRec(rCL4FedRec) by introducing a regularizer to maintain the distance among item embeddings with different popularity levels. Extensive experiments conducted on four commonly used recommendation datasets demonstrate that rCL4FedRec significantly enhances both the model's performance and the robustness of FedRecs.

关键词： federated recommender system contrastive learning model poisoning attack and defense

来源：评论

学校读者我要写书评

暂无评论

Robust Transmission Design for Federated Learning Through Over-the-Air Computation

引用

China Communications 2025年第3期22卷 65-75页

作者： Hamideh Zamanpour Abyaneh Saba Asaad Amir Masoud Rabiei School of Electrical and Computer Engineering College of EngineeringUniversity of TehranTehranIran Department of Electrical Engineering and Computer Science York UniversityCanada

Over-the-air computation(AirComp)enables federated learning(FL)to rapidly aggregate local models at the central server using waveform superposition property of wireless *** this paper,a robust transmission scheme for an AirCompbased FL system with imperfect channel state information(CSI)is *** model CSI uncertainty,an expectation-based error model is *** main objective is to maximize the number of selected devices that meet mean-squared error(MSE)requirements for model broadcast and model *** problem is formulated as a combinatorial optimization problem and is solved in two ***,the priority order of devices is determined by a sparsity-inducing ***,a feasibility detection scheme is used to select the maximum number of devices to guarantee that the MSE requirements are *** alternating optimization(AO)scheme is used to transform the resulting nonconvex problem into two convex *** results illustrate the effectiveness and robustness of the proposed scheme.

关键词： federated learning imperfect CSI optimization over-the-air computing robust design

来源：评论

学校读者我要写书评

暂无评论

An end-to-end network for co-saliency detection in one single image

引用

science China(Information sciences) 2023年第11期66卷 5-22页

作者： Yuanhao YUE Qin ZOU Hongkai YU Qian WANG Zhongyuan WANG Song WANG School of Cyber Science and Engineering Wuhan University School of Computer Science Wuhan University Department of Electrical Engineering and Computer Science Cleveland State University Department of Computer Science and Engineering University of South Carolina

Co-saliency detection within a single image is a common vision problem that has not yet been well addressed. Existing methods often used a bottom-up strategy to infer co-saliency in an image in which salient regions are firstly detected using visual primitives such as color and shape and then grouped and merged into a co-saliency map. However, co-saliency is intrinsically perceived complexly with bottom-up and top-down strategies combined in human vision. To address this problem, this study proposes a novel end-toend trainable network comprising a backbone net and two branch nets. The backbone net uses ground-truth masks as top-down guidance for saliency prediction, whereas the two branch nets construct triplet proposals for regional feature mapping and clustering, which drives the network to be bottom-up sensitive to co-salient regions. We construct a new dataset of 2019 natural images with co-saliency in each image to evaluate the proposed method. Experimental results show that the proposed method achieves state-of-the-art accuracy with a running speed of 28 fps.

关键词： saliency detection convolutional neural network regional feature mapping co-saliency detection deep learning

来源：评论

学校读者我要写书评

暂无评论

Dynamics analysis and cryptographic implementation of a fractional-order memristive cellular neural network model

引用

Chinese Physics B 2024年第4期33卷 418-433页

作者：周新卫蒋东华 Jean De Dieu Nkapkop Musheer Ahmad Jules Tagne Fossi Nestor Tsafack 吴建华 Department of Information Engineering Gongqing CollegeNanchang UniversityJiujiang 332020China School of Computer Science and Engineering Sun Yat-Sen UniversityGuangzhou 511400China Department of Electrical Engineering and Industrial Computing University Institute of TechnologyDoualaCameroon Department of Computer Engineering Jamia Millia IslamiaNew Delhi 110025India Department of Physics Faculty of ScienceUniversity of YaoundeCameroon Electrical Engineering Department and Industrial Computing of ISTAMA University of DoualaDoualaCameroon

Due to the fact that a memristor with memory properties is an ideal electronic component for implementation of the artificial neural synaptic function,a brand-new tristable locally active memristor model is first proposed in this ***,a novel four-dimensional fractional-order memristive cellular neural network(FO-MCNN)model with hidden attractors is constructed to enhance the engineering feasibility of the original CNN model and its ***,its hardware circuit implementation and complicated dynamic properties are investigated on multi-simulation ***,it is used toward secure communication application *** it as the pseudo-random number generator(PRNG),a new privacy image security scheme is designed based on the adaptive sampling rate compressive sensing(ASR-CS)***,the simulation analysis and comparative experiments manifest that the proposed data encryption scheme possesses strong immunity against various security attack models and satisfactory compression performance.

关键词： cellular neural network memristor hardware circuit compressive sensing privacy data protection

来源：评论

学校读者我要写书评

暂无评论

Exploring the Effectiveness of OKRs in Enhancing Company Objectives: A Comparative Study

引用

IEEE engineering Management Review 2025年第2期53卷 110-121页

作者： Criado, Juan M. Gutierrez, Gema Garzas, Javier Cano, Emilio L. De Lena, M. Teresa Gonzalez Moguerza, Javier M. School of Engineering and Computer Science Statistic and Computing Department Mostoles Madrid28933 Spain

The use of management by objectives (MBOs) methodologies, particularly the objectives and key results (OKRs) framework, has gained widespread attention in recent years as a means of improving organizational performance. This article aims to show that OKRs, a key MBO method, can enhance company performance and employee satisfaction. We conducted a comparative and retroactive analysis of MBO methods used in the 20th and 21st centuries, and surveyed 238 people in nine countries and various companies and positions. We analyzed the results of the survey and compared the variables associated with best practices in the OKR methodology. Our study examined a diverse range of companies, positions, qualifications, and ages, which provides an analysis of whether or not OKRs are being used in the organization and a comprehensive understanding of how OKRs can be implemented across in different contexts. By identifying the best variables associated with optimal performance and employee satisfaction, this article provides practical guidance for organizations seeking to adopt OKR methodology. Furthermore, this article can contribute to the development of best practices in the area of management by objectives, particularly in the context of OKRs, leading to more effective and efficient goal-setting practices in organizations. © 2024 IEEE.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Automatic lung cancer detection using hybrid particle snake swarm optimization with optimized mask RCNN

引用

Multimedia Tools and Applications 2024年第31期83卷 76807-76831页

作者： Sudha, R. Maheswari, K. M. Uma Department of Computer Science and Engineering School of computing College of engineering and technology SRM Institute of Science and Technology Kattankulathur India Department of Computing Technologies School of Computing College of engineering and technology SRM Institute of Science and Technology Kattankulathur India

As a result of its aggressive nature and late identification at advanced stages, lung cancer is one of the leading causes of cancer-related deaths. Lung cancer early diagnosis is a serious and difficult challenge that is crucial to a person's survival. The first diagnosis of the malignant nodules is typically made using chest radiography (X-rays) and computed tomography (CT) scans;however, the potential presence of benign nodules results in incorrect conclusions. The early phases of both benign and malignant nodules exhibit striking similarities. In this paper, a novel deep learning-based model is proposed for the precise diagnosis of malignant nodules. The proposed approach consists of two stages namely, pre-processing and lung nodule detection. Initially, the Lung CT scan images are collected from the dataset. Then, to remove the noise present in the input image, we apply an adaptive median filter. Then, to enhance the image, Contrast Limited Adaptive Histogram Equalization (CLAHE) is applied. After pre-processing, the image is given to the optimized mask RCNN classifier to detect the malignant and benign nodules. To enhance the performance of the Mask RCNN classifier, the hyper-parameters are optimally selected using hybrid particle snake swarm optimization (PS2OA). The proposed PS2OA is a hybridization of particle swarm optimization (PSO) and snake swarm optimization (SSO). The performance of the proposed approach is analyzed based on different metrics and effectiveness compared with state-of-the-art works. The proposed approach attained the maximum accuracy of 97.67%. This work aimed at assisting radiologists to detect and diagnose small-size pulmonary nodules more accurately. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Optimizing Image Retrieval in Cloud Servers with TN-AGW: A Secure and Efficient Approach

引用

Journal of The Institution of Engineers (India): Series B 2025年第2期106卷 459-473页

作者： Ponnuviji, N.P. Nirmala, G. Kokila, M. L. Sworna Priyadharshini, S. Indra Department of Computer Science and Engineering RMK College of Engineering and Technology Puduvoyal Thiruvallur India Department of Computer Science and Engineering RMD Engineering College Chennai India Department of Computing Technologies School of Computing Faculty of Engineering and Technology SRM Institute of Science and Technology Tamil Nādu Kattankulathur Chennai India School of Computer Science and Engineering Vellore Institute of Technology Chennai India

The increasing use of cloud-based image storage and retrieval systems has made ensuring security and efficiency crucial. The security enhancement of image retrieval and image archival in cloud computing has received considerable attention in transmitting data and ensuring data confidentiality among cloud servers and users. Various traditional image retrieval techniques regarding security have developed in recent years but they do not apply to large-scale environments. This paper introduces a new approach called Triple network-based adaptive grey wolf (TN-AGW) to address these challenges. The TN-AGW framework combines the adaptability of the Grey Wolf Optimization (GWO) algorithm with the resilience of Triple Network (TN) to enhance image retrieval in cloud servers while maintaining robust security measures. By using adaptive mechanisms, TN-AGW dynamically adjusts its parameters to improve the efficiency of image retrieval processes, reducing latency and utilization of resources. However, the image retrieval process is efficiently performed by a triple network and the parameters employed in the network are optimized by Adaptive Grey Wolf (AGW) optimization. Imputation of missing values, Min–Max normalization, and Z-score standardization processes are used to preprocess the images. The image extraction process is undertaken by a modified convolutional neural network (MCNN) approach. Moreover, input images are taken from datasets such as the Landsat 8 dataset and the Moderate Resolution Imaging Spectroradiometer (MODIS) dataset is employed for image retrieval. Further, the performance such as accuracy, precision, recall, specificity, F1-score, and false alarm rate (FAR) is evaluated, the value of accuracy reaches 98.1%, the precision of 97.2%, recall of 96.1%, and specificity of 917.2% respectively. Also, the convergence speed is enhanced in this TN-AGW approach. Therefore, the proposed TN-AGW approach achieves greater efficiency in image retrieving than other existing

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Scalable Data Pipeline for Multiclass Attack Classification in Large-Scale IoT Networks

引用

Big Data Mining and Analytics 2024年第2期7卷 500-511页

作者： Selvam Saravanan Uma Maheswari Balasubramanian Department of Computer Science and Engineering Amrita School of ComputingAmrita Vishwa VidyapeethamBengaluru 560035India

The current large-scale Internet of Things(IoT)networks typically generate high-velocity network traffic *** use IoT devices to create botnets and launch attacks,such as DDoS,Spamming,Cryptocurrency mining,Phishing,*** service providers of large-scale IoT networks need to set up a data pipeline to collect the vast network traffic data from the IoT devices,store it,analyze it,and report the malicious IoT devices and types of ***,the attacks originating from IoT devices are dynamic,as attackers launch one kind of attack at one time and another kind of attack at another *** number of attacks and benign instances also vary from time to *** phenomenon of change in attack patterns is called concept ***,the attack detection system must learn continuously from the ever-changing real-time attack patterns in large-scale IoT network *** meet this requirement,in this work,we propose a data pipeline with Apache Kafka,Apache Spark structured streaming,and MongoDB that can adapt to the ever-changing attack patterns in real time and classify attacks in large-scale IoT *** concept drift is detected,the proposed system retrains the classifier with the instances that cause the drift and a representative subsample instances from the previous training of the *** proposed approach is evaluated with the latest dataset,IoT23,which consists of benign and several attack instances from various IoT *** classification accuracy is improved from 97.8%to 99.46%by the proposed *** training time of distributed random forest algorithm is also studied by varying the number of cores in Apache Spark environment.

关键词： Internet of Things(IoT) concept drift Apache Spark MongoDB Apache Kafka streaming

来源：评论

学校读者我要写书评

暂无评论

Inductive Lottery Ticket Learning for Graph Neural Networks

引用

Journal of computer science & Technology 2024年第6期39卷 1223-1237页

作者： Yong-Duo Sui Xiang Wang Tianlong Chen Meng Wang Xiang-Nan He Tat-Seng Chua School of Data Science University of Science and Technology of ChinaHefei 230027China Department of Electrical and Computer Engineering The University of Texas at AustinAustin 78712U.S.A School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230009China School of Computing National University of SingaporeSingapore

Graph neural networks (GNNs) have gained increasing popularity, while usually suffering from unaffordable computations for real-world large-scale applications. Hence, pruning GNNs is of great need but largely unexplored. The recent work Unified GNN Sparsification (UGS) studies lottery ticket learning for GNNs, aiming to find a subset of model parameters and graph structures that can best maintain the GNN performance. However, it is tailed for the transductive setting, failing to generalize to unseen graphs, which are common in inductive tasks like graph classification. In this work, we propose a simple and effective learning paradigm, Inductive Co-Pruning of GNNs (ICPG), to endow graph lottery tickets with inductive pruning capacity. To prune the input graphs, we design a predictive model to generate importance scores for each edge based on the input. To prune the model parameters, it views the weight’s magnitude as their importance scores. Then we design an iterative co-pruning strategy to trim the graph edges and GNN weights based on their importance scores. Although it might be strikingly simple, ICPG surpasses the existing pruning method and can be universally applicable in both inductive and transductive learning settings. On 10 graph-classification and two node-classification benchmarks, ICPG achieves the same performance level with 14.26%–43.12% sparsity for graphs and 48.80%–91.41% sparsity for the GNN model.

关键词： lottery ticket hypothesis graph neural networks neural network pruning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：