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

A Deep Deterministic Policy Gradient-Based Method for Enforcing Service Fault-Tolerance in MEC

Chinese Journal of Electronics 2024年第4期33卷 899-909页

作者： Tingyan LONG Peng CHEN Yunni XIA Yong MA Xiaoning SUN Jiale ZHAO Yifei LYU College of Computer Science Chongqing University School of Computer and Software Engineering Xihua University School of Computer and Information Engineering Jiangxi Normal University School of Computer and Information Science Chongqing Normal University

Mobile edge computing(MEC) provides edge services to users in a distributed and on-demand *** to the heterogeneity of edge applications, deploying latency and resource-intensive applications on resourceconstrained devices is a key challenge for service providers. This is especially true when underlying edge infrastructures are fault and error-prone. In this paper, we propose a fault tolerance approach named DFGP, for enforcing mobile service fault-tolerance in MEC. It synthesizes a generative optimization network(GON) model for predicting resource failure and a deep deterministic policy gradient(DDPG) model for yielding preemptive migration *** show through extensive simulation experiments that DFGP is more effective in fault detection and guaranteeing quality of service, in terms of fault detection accuracy, migration efficiency, task migration time, task scheduling time,and energy consumption than other existing methods.

关键词： Fault tolerance Multi-access edge computing Processor scheduling Fault detection Image edge detection Fault tolerant systems Quality of service

来源：评论

学校读者我要写书评

暂无评论

Coarse-to-fine lightweight meta-embedding for ID-based recommendations

引用

science China(information sciences) 2025年第4期68卷 82-97页

作者： Yang WANG Haipeng LIU Zeqian YI Biao QIAN Meng WANG School of Computer Science and Information Engineering Hefei University of Technology College of Information and Intelligence Hunan Agricultural University

State-of-the-art recommender systems are increasingly focused on optimizing implementation efficiency, such as enabling on-device recommendations under memory constraints. Current methods commonly use lightweight embeddings for users and items or employ compact embeddings to enhance reusability and reduce memory usage. However, these approaches consider only the coarse-grained aspects of embeddings, overlooking subtle semantic nuances. This limitation results in an adversarial degradation of meta-embedding performance, impeding the system's ability to capture intricate relationships between users and items, leading to suboptimal recommendations. To address this, we propose a novel approach to efficiently learn meta-embeddings with varying grained and apply fine-grained meta-embeddings to strengthen the representation of their coarse-grained counterparts. Specifically, we introduce a recommender system based on a graph neural network, where each user and item is represented as a node. These nodes are directly connected to coarse-grained virtual nodes and indirectly linked to fine-grained virtual nodes, facilitating learning of multi-grained semantics. Fine-grained semantics are captured through sparse meta-embeddings, which dynamically balance embedding uniqueness and memory constraints. To ensure their sparseness, we rely on initialization methods such as sparse principal component analysis combined with a soft thresholding activation function. Moreover, we propose a weight-bridging update strategy that aligns coarse-grained meta-embedding with several fine-grained meta-embeddings based on the underlying semantic properties of users and items. Comprehensive experiments demonstrate that our method outperforms existing baselines. The code of our proposal is available at https://***/htyjers/C2F-MetaEmbed.

关键词： lightweight meta-embedding coarse-to-fine learning ID-based recommendations

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

CToMP: a cycle-task-oriented memory protection scheme for unmanned systems

引用

science China(information sciences) 2024年第6期67卷 399-417页

作者： Chengyan MA Ning XI Di LU Yebo FENG Jianfeng MA School of Cyber Engineering Xidian University School of Computer Science and Technology Xidian University Department of Computer and Information Science University of Oregon

Memory corruption attacks(MCAs) refer to malicious behaviors of system intruders that modify the contents of a memory location to disrupt the normal operation of computing systems, causing leakage of sensitive data or perturbations to ongoing processes. Unlike general-purpose systems, unmanned systems cannot deploy complete security protection schemes, due to their limitations in size, cost and *** in unmanned systems are particularly difficult to defend against. Furthermore, MCAs have diverse and unpredictable attack interfaces in unmanned systems, severely impacting digital and physical sectors. In this paper, we first generalize, model and taxonomize MCAs found in unmanned systems currently, laying the foundation for designing a portable and general defense approach. According to different attack mechanisms,we found that MCAs are mainly categorized into two types — return2libc and return2shellcode. To tackle return2libc attacks, we model the erratic operation of unmanned systems with cycles and then propose a cycle-task-oriented memory protection(CToMP) approach to protect control flows from tampering. To defend against return2shellcode attacks, we introduce a secure process stack with a randomized memory address by leveraging the memory pool to prevent Shellcode from being executed. Moreover, we discuss the mechanism by which CTo MP resists the return-oriented programming(ROP) attack, a novel variant of return2libc attacks. Finally, we implement CTo MP on CUAV V5+ with Ardupilot and Crazyflie. The evaluation and security analysis results demonstrate that the proposed approach CTo MP is resilient to various MCAs in unmanned systems with low footprints and system overhead.

关键词： unmanned system memory corruption attack memory protection system security randomized memory address

来源：评论

学校读者我要写书评

暂无评论

One model, two skills: active vision and action learning model for robotic manipulation

引用

science China(information sciences) 2025年第6期68卷 331-349页

作者： Guokang WANG Yanhong LIU Huaping LIU School of Electrical and Information Engineering Zhengzhou University Department of Computer Science and Technology Tsinghua University

The perception in most existing vision-based reinforcement learning(RL) models for robotic manipulation relies heavily on static third-person or hand-mounted first-person cameras. In scenarios with occlusions and limited maneuvering space, these carefully positioned cameras often struggle to provide effective visual observations during manipulation. Taking inspiration from human capabilities, we introduce a novel RL-based dual-arm active visual-guided manipulation model(DAVMM), which simultaneously infers “eye” actions and “hand” actions for two separate robotic arms(referred to as the vision-arm and the worker-arm) based on current observations, empowering the robot with the ability to actively perceive and interact with its environment. To handle the extensive redundant observation-action space, we propose a decouplable target-centric reward paradigm to offer stable guidance for the training process. For making fine-grained manipulation action decisions, alongside a global scene image encoder, we utilize an independent encoder to extract local target texture features,enabling the simultaneous acquisition of both global and detailed local information. Additionally, we employ residual-RL and curriculum learning techniques to further enhance our model's sample efficiency and training stability. We conducted comparative experiments and analyses of DAVMM against a set of strong baselines on three occluded and narrow-space manipulation tasks. DAVMM notably improves the success rates across all manipulation tasks and showcases rapid learning capabilities.

关键词： robotic manipulation visual learning reinforcement learning active sensing machine vision

来源：评论

学校读者我要写书评

暂无评论

Malicious iOS Apps Detection Through Multi-Criteria Decision-Making Approach

Informatica (Slovenia)

引用

Informatica (Slovenia) 2025年第1期49卷 207-220页

作者： Bhatt, Arpita Jadhav Sardana, Neetu Department of Computer Science & Engineering and Information Technology Jaypee Institute of Information Technology Indonesia

In today’s era, smartphones are used in daily lives because they are ubiquitous and can be customized by installing third-party apps. As a result, the menaces because of these apps, which are potentially risky for user’s privacy, have increased. information on smartphones is perhaps, more personal than compared to data stored on desktops or computers, making it an easy target for intruders. After Android, the most prevalently used mobile operating system is Apple’s iOS. Both Android and iOS follow permission-based access control to protect user’s privacy. However, the users are unaware whether the app is breaching the user’s privacy. To combat this problem, in the paper we propose a hybrid approach to detect malicious iOS apps based on its permissions. In the first phase, weights have been assigned to app permissions using multi-criteria decision-making (MCDM) approach namely Analytic Hierarchy Process (AHP), and in the second phase machine learning& ensemble learning techniques have been employed to train the classifiers for detecting malicious apps. To test the efficacy of the proposed method dataset comprising 1150 apps from 12 app categories has been used. The results demonstrate the proposed approach improves the efficacy of detecting malicious iOS apps for majority of categories. © 2025 Slovene Society Informatika. All rights reserved.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Partial multi-label learning via label-specific feature corrections

引用

science China(information sciences) 2025年第3期68卷 95-109页

作者： Jun-Yi HANG Min-Ling ZHANG School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of Education

Partial multi-label learning（PML） allows learning from rich-semantic objects with inaccurate annotations, where a set of candidate labels are assigned to each training example but only some of them are valid. Existing approaches rely on disambiguation to tackle the PML problem, which aims to correct noisy candidate labels by recovering the ground-truth labeling information ahead of prediction model induction. However, this dominant strategy might be suboptimal as it usually needs extra assumptions that cannot be fully satisfied in real-world scenarios. Instead of label correction, we investigate another strategy to tackle the PML problem, where the potential ambiguity in PML data is eliminated by correcting instance features in a label-specific manner. Accordingly, a simple yet effective approach named PASE, i.e., partial multi-label learning via label-specific feature corrections, is proposed. Under a meta-learning framework, PASElearns to exert label-specific feature corrections so that potential ambiguity specific to each class label can be eliminated and the desired prediction model can be induced on these corrected instance features with the provided candidate labels. Comprehensive experiments on a wide range of synthetic and real-world data sets validate the effectiveness of the proposed approach.

关键词： machine learning multi-label learning partial multi-label learning label-specific features feature correction

来源：评论

学校读者我要写书评

暂无评论

Data Hiding Methods Using Voting Strategy and Mapping Table

引用

Journal of Internet Technology 2024年第3期25卷 365-377页

作者： Chi, Hengxiao Chang, Chin-Chen Lin, Chia-Chen Department of Information Engineering and Computer Science Feng Chia University Taiwan Department of Computer Science and Information Engineering National Chin-Yi University of Technology Taiwan

With advancements in technology, the study of data hiding (DH) in images has become more and more important. In this paper, we introduce a novel data hiding scheme that employs a voting strategy to predict pixels based on their neighbors, then embeds data into the predicted pixels according to a designed mapping table. To extract the information, it is only necessary to use the voting strategy to predict the pixels again, then to compare the predicted and hidden pixels to extract the secret data with the assistance of the mapping table. Our experimental results demonstrate that the proposed hiding scheme has a high embedding capacity, and preserves a satisfactory visual quality. Additionally, it attains a high peak signal-to-noise ratio (PSNR) even at high embedding capacity. © 2024 Taiwan Academic Network Management Committee. All rights reserved.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

A Weakly-Supervised Crowd Density Estimation Method Based on Two-Stage Linear Feature Calibration

引用

IEEE/CAA Journal of Automatica Sinica 2024年第4期11卷 965-981页

作者： Yong-Chao Li Rui-Sheng Jia Ying-Xiang Hu Hong-Mei Sun the College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao 266590 the Faculty of Information Science and Engineering Ocean University of ChinaQingdao 266000China the College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao 266590China the College of Computer Science and Engineering Nanjing University of Science and TechnologyNanjing 210000China

In a crowd density estimation dataset,the annotation of crowd locations is an extremely laborious task,and they are not taken into the evaluation *** this paper,we aim to reduce the annotation cost of crowd datasets,and propose a crowd density estimation method based on weakly-supervised learning,in the absence of crowd position supervision information,which directly reduces the number of crowds by using the number of pedestrians in the image as the supervised *** this purpose,we design a new training method,which exploits the correlation between global and local image features by incremental learning to train the ***,we design a parent-child network(PC-Net)focusing on the global and local image respectively,and propose a linear feature calibration structure to train the PC-Net simultaneously,and the child network learns feature transfer factors and feature bias weights,and uses the transfer factors and bias weights to linearly feature calibrate the features extracted from the Parent network,to improve the convergence of the network by using local features hidden in the crowd *** addition,we use the pyramid vision transformer as the backbone of the PC-Net to extract crowd features at different levels,and design a global-local feature loss function(L2).We combine it with a crowd counting loss(LC)to enhance the sensitivity of the network to crowd features during the training process,which effectively improves the accuracy of crowd density *** experimental results show that the PC-Net significantly reduces the gap between fullysupervised and weakly-supervised crowd density estimation,and outperforms the comparison methods on five datasets of Shanghai Tech Part A,ShanghaiTech Part B,UCF_CC_50,UCF_QNRF and JHU-CROWD++.

关键词： Crowd density estimation linear feature calibration vision transformer weakly-supervision learning

来源：评论

学校读者我要写书评

暂无评论

Local Search-Based Anytime Algorithms for Continuous Distributed Constraint Optimization Problems

引用

IEEE/CAA Journal of Automatica Sinica 2025年第1期12卷 288-290页

作者： Xin Liao Khoi Hoang Xin Luo the College of Computer and Information Science Southwest University the Department of Computer Science and Engineering Washington University in St.Louis IEEE

Dear Editor,The distributed constraint optimization problems(DCOPs) [1]-[3]provide an efficient model for solving the cooperative problems of multi-agent systems, which has been successfully applied to model the real-world problems like the distributed scheduling [4], sensor network management [5], [6], multi-robot coordination [7], and smart grid [8]. However, DCOPs were not well suited to solve the problems with continuous variables and constraint cost in functional form, such as the target tracking sensor orientation [9], the air and ground cooperative surveillance [10], and the sensor network coverage [11].

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：