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

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

来源：评论

学校读者我要写书评

暂无评论

A recover-then-discriminate framework for robust anomaly detection

引用

science China(Information sciences) 2025年第4期68卷 300-318页

作者： Peng XING Dong ZHANG Jinhui TANG Zechao LI School of Computer Science and Engineering Nanjing University of Science and Technology Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology

Anomaly detection(AD) has been extensively studied and applied across various scenarios in recent years. However, gaps remain between the current performance and the desired recognition accuracy required for practical *** paper analyzes two fundamental failure cases in the baseline AD model and identifies key reasons that limit the recognition accuracy of existing approaches. Specifically, by Case-1, we found that the main reason detrimental to current AD methods is that the inputs to the recovery model contain a large number of detailed features to be recovered, which leads to the normal/abnormal area has not/has been recovered into its original state. By Case-2, we surprisingly found that the abnormal area that cannot be recognized in image-level representations can be easily recognized in the feature-level representation. Based on the above observations, we propose a novel recover-then-discriminate(ReDi) framework for *** takes a self-generated feature map(e.g., histogram of oriented gradients) and a selected prompted image as explicit input information to address the identified in Case-1. Additionally, a feature-level discriminative network is introduced to amplify abnormal differences between the recovered and input representations. Extensive experiments on two widely used yet challenging AD datasets demonstrate that ReDi achieves state-of-the-art recognition accuracy.

关键词： recovery network HOG prompt discriminative network self-correlation loss anomaly detection

来源：评论

学校读者我要写书评

暂无评论

A Task Scheduling Algorithm Based on Clustering Pre-processing in Space-Based Information Network

引用

Chinese Journal of Electronics 2024年第1期33卷 217-230页

作者： Yufei WANG Jun LIU Shengnan ZHANG Sai XU Jingyi WANG School of Computer Science and Engineering Northeastern University

With the diversification of space-based information network task requirements and the dramatic increase in demand, the efficient scheduling of various tasks in space-based information network becomes a new challenge. To address the problems of a limited number of resources and resource heterogeneity in the space-based information network, we propose a bilateral pre-processing model for tasks and resources in the scheduling pre-processing stage. We use an improved fuzzy clustering method to cluster tasks and resources and design coding rules and matching methods to match similar categories to improve the clustering effect. We propose a space-based information network task scheduling strategy based on an ant colony simulated annealing algorithm for the problems of high latency of space-based information network communication and high resource dynamics. The strategy can efficiently complete the task and resource matching and improve the task scheduling performance. The experimental results show that our proposed task scheduling strategy has less task execution time and higher resource utilization than other algorithms under the same experimental conditions. It has significantly improved scheduling performance.

关键词： Scheduling algorithms Heuristic algorithms Clustering methods Clustering algorithms Simulated annealing Dynamic scheduling Search problems

来源：评论

学校读者我要写书评

暂无评论

Troy: Efficient Service Deployment for Windows Systems

引用

Chinese Journal of Electronics 2024年第1期33卷 313-322页

作者： Deyu ZHANG Yu XIE Mucong XU En CHENG Xiaoyan KUI Bangwen HE Yunhao LI School of Computer Science and Engineering Central South University

The modern university computer lab and kindergarden through 12th grade classrooms require a centralized solution to efficiently manage a large number of desktops. The existing solutions either bring virtualization overhead in runtime or requires loading a large image over 30 GB leading to an unacceptable network latency. In this work, we propose Troy which takes advantage of the differencing virtual hard disk techniques in Windows *** such, Troy only loads the modifications made on one machine to all other machines. Troy consists of two modules that are responsible to generate an initial image and merge a differencing image with its parent image, respectively. Specifically, we identify the key fields in the virtual hard disk image that links the differencing image and the parent image and find the modified blocks in the differencing images that should be used to replace the blocks in the parent image. We further design a lazy copy solution to reduce the I/O burden in image merging. We have implemented Troy on bare metal machines. The evaluation results show that the performance of Troy is comparable to the native implementation in Windows, without requiring the Windows environment.

关键词： Runtime Image synthesis Merging Loading Metals Hard disks Virtualization

来源：评论

学校读者我要写书评

暂无评论

Aligning enhanced feature representation for generalized zero-shot learning

引用

science China(Information sciences) 2025年第2期68卷 74-88页

作者： Zhiyu FANG Xiaobin ZHU Chun YANG Hongyang ZHOU Jingyan QIN Xu-Cheng YIN School of Computer & Communication Engineering University of Science and Technology Beijing

Constructing an effective common latent embedding by aligning the latent spaces of cross-modal variational autoencoders（VAEs） is a popular strategy for generalized zero-shot learning（GZSL）. However, due to the lack of fine-grained instance-wise annotations, existing VAE methods can easily suffer from the posterior collapse problem. In this paper, we propose an innovative asymmetric VAE network by aligning enhanced feature representation（AEFR） for GZSL. Distinguished from general VAE structures, we designed two asymmetric encoders for visual and semantic observations and one decoder for visual reconstruction. Specifically, we propose a simple yet effective gated attention mechanism（GAM） in the visual encoder for enhancing the information interaction between observations and latent variables, alleviating the possible posterior collapse problem effectively. In addition, we propose a novel distributional decoupling-based contrastive learning（D2-CL） to guide learning classification-relevant information while aligning the representations at the taxonomy level in the latent representation space. Extensive experiments on publicly available datasets demonstrate the state-of-the-art performance of our method. The source code is available at https://***/seeyourmind/AEFR.

关键词： generalized zero-shot learning gated attention mechanism contrastive learning multi-modal alignment

来源：评论

学校读者我要写书评

暂无评论

EKBSA:A Chinese Sentiment Analysis Model by Enhancing K-BERT

引用

计算机科学技术学报（英文版） 2025年第1期40卷 60-72页

作者：白欢王大玲冯时张一飞 School of Computer Science and Engineering Northeastern University Shenyang China

Pre-trained language models(PLMs),such as BERT,have achieved good results on many natural language processing(NLP)***,some studies have attempted to integrate factual knowledge into PLMs to adapt to vari-ous downstream *** sentiment analysis tasks,sentiment knowledge,such as sentiment words,plays a significant role in determining the sentiment tendencies of *** Chinese sentiment analysis,historical stories and fables imbue words with richer connotations and more complex sentiments than those typically found in English,which makes senti-ment knowledge injection *** clearly,this knowledge has not been fully *** this paper,we propose EKBSA,a Chinese sentiment analysis model,which is based on the K-BERT model and utilizes a sentiment knowledge graph to achieve better results on sentiment analysis *** construct a high-quality sentiment knowledge graph,we collect a large number of sentiment words by combining several existing sentiment ***,in order to under-stand texts better,we enhance local attention through syntactic analysis and direct to EKBSA focus more on syntactical-ly relevant *** is compatible with BERT and existing structural *** results show that EKBSA achieves better performance on Chinese sentiment analysis *** upon EKBSA,we further change the gen-eral attention to the context attention and propose Context EKBSA,so that the model can adapt to sentiment analysis tasks in Chinese conversations and achieve good performance.

关键词： Chinese sentiment analysis local attention sentiment knowledge graph pre-trained language model con-text attention

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

What can we learn from quality assurance badges in open-source software?

引用

science China(Information sciences) 2024年第4期67卷 146-163页

作者： Feng LI Yiling LOU Xin TAN Zhenpeng CHEN Jinhao DONG Yang LI Xuanzhi WANG Dan HAO Lu ZHANG MoE Key Lab of HCST School of Computer SciencePeking University Department of Computer Science Purdue University School of Computer Science & Engineering Beihang University(BUAA) Department of Computer Science University College London(UCL)

In the development of open-source software(OSS), many developers use badges to give an overview of the software and share some key features/metrics conveniently. Among various badges, quality assurance(QA) badges make up a large proportion and are the most prevalent because QA is of vital importance in software development, and ineffective QA may lead to anomalies or defects. In this paper, we focus on QA badges in open-source projects, which present quality assurance information directly and instantly,and aim to produce some interesting findings and provide practical implications. We collect and analyze 100000 projects written in popular programming languages from GitHub and conduct a comprehensive empirical study both inside and outside QA badges. Inside QA badges, we build a category classification for all QA badges based on the properties they focus on, which shows the types of QA badges developers use. Then,we analyze the frequency of the properties that QA badges focus on, and property combinations, too, which present their use status. We find that QA badges focus on various properties while developers give different preferences to different properties. The use status also differs between different programming languages. For example, projects written in C focus on Security to a great extent. Our findings also provide implications for developers and badge providers. Outside QA badges, we conduct a correlation analysis between QA badges and some software metrics that have potential relationships with code quality, contribution quality, and popularity. We find that QA badges have statistically significant correlations with various software metrics.

关键词： quality assurance badge open-source software code quality empirical study

来源：评论

学校读者我要写书评

暂无评论

PriChain: Efficient Privacy-Preserving Fine-Grained Redactable Blockchains in Decentralized Settings

引用

Chinese Journal of Electronics 2025年第1期34卷 82-97页

作者： Hongchen Guo Weilin Gan Mingyang Zhao Chuan Zhang Tong Wu Liehuang Zhu Jingfeng Xue School of Computer Science and Technology Beijing Institute of Technology School of Cyberspace Science and Technology Beijing Institute of Technology School of Computer and Communication Engineering University of Science and Technology Beijing

Recently, redactable blockchain has been proposed and leveraged in a wide range of real systems for its unique properties of decentralization, traceability, and transparency while ensuring controllable on-chain data redaction. However, the development of redactable blockchain is now obstructed by three limitations, which are data privacy breaches, high communication overhead, and low searching efficiency, respectively. In this paper, we propose PriChain, the first efficient privacy-preserving fine-grained redactable blockchain in decentralized settings. PriChain provides data owners with rights to control who can read and redact on-chain data while maintaining downward compatibility, ensuring the one who can redact will be able to read. Specifically, inspired by the concept of multi-authority attribute-based encryption, we utilize the isomorphism of the access control tree, realizing fine-grained redaction mechanism, downward compatibility, and collusion resistance. With the newly designed structure, PriChain can realize O（n） communication and storage overhead compared to prior O（n2） schemes. Furthermore, we integrate multiple access trees into a tree-based dictionary, optimizing searching efficiency. Theoretical analysis proves that PriChain is secure against the chosen-plaintext attack and has competitive complexity. The experimental evaluations show that PriChain realizes 10× efficiency improvement of searching and 100× lower communication and storage overhead on average compared with existing schemes.

关键词： Resistance Access control Data privacy Dictionaries Blockchains Encryption Complexity theory Usability Protection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：