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

PFV2: Packet fragmentation with variable size and vigorous mapping in time-sensitive networking

Journal of Systems Architecture 2025年 166卷

作者： Wenyan Yan Bin Fu Dongsheng Wei Renfa Li Yixue Lei Yuhang Jia Guoqi Xie Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan University Changsha 410082 Hunan China Center for Convergence of Automobile and Cyberspace Research Institute of Hunan University in Chongqing Chongqing 401120 China Hunan Engineering Research Center of Advanced Embedded Computing and Intelligent Medical Systems School of Computer and Artificial Intelligence Xiangnan University Chenzhou 423000 Hunan China Future Network Laboratory Tencent Beijing 100080 China

With the rapid advancement of intelligent automobiles, the ever-growing communication data put forward high bandwidth and low latency requirements. To meet these requirements, automotive Original Equipment Manufacturers (OEMs) widely adopt domain-centralized Electrical/Electronic (E/E) architecture. In this architecture, Time-Sensitive networking (TSN) is expected to serve as the backbone network because of its high bandwidth and deterministic communication. TSN uses the Gate Control List (GCL) to divide its time length into multiple time slots, and the time intervals of these time slots are non-uniform (equal or unequal). Different flows have varying requirements for time slot sizes. To enhance the acceptance ratio of Time-Triggered (TT) flows through GCL time slot allocation, packet fragmentation (i.e., flow fragmentation) is introduced into TSN in the recent study. The state-of-the-art packet fragmentation solution divides one un-schedulable TT flow into multiple equal-sized packets (i.e., equal-sized time slots). In other words, these fixed-size packets are difficult to be mapped into the time slots with different sizes. This study develops a Packet Fragmentation with Variable-size and Vigorous-mapping (PFV2) technique based on the following three innovations: (1) we implement variable-size packet fragmentation, which iteratively divides the un-schedulable TT flow into smaller packets and then dynamically reschedules these packets; (2) we implement the vigorous mapping solution from packets to time slots by deeply searching for available time slots within the flow’s deadline; and (3) we verify PFV2 based on the LS1028A with Cortex-A72 (i.e., the NXP automotive-grade development board). PFV2 improves the acceptance ratio by up to 20.18% and bandwidth utilization by up to 7.024% compared with the state-of-the-art solution. The theoretical and practical co-verification experiments demonstrate that the PFV2 can effectively improve the flow acceptance ratio and outpe

关键词：

来源：评论

学校读者我要写书评

暂无评论

Partial Offloading Strategy Based on Deep Reinforcement Learning in the Internet of Vehicles

引用

IEEE Transactions on Mobile computing 2025年

作者： Tian, Shujuan Zhu, Xinjie Feng, Bochao Zheng, Zhirun Liu, Haolin Li, Zhetao Xiangtan University School of Computer Science School of Cyberspace Security Xiangtan411105 China Xiangtan University Hunan International Scientific and Technological Cooperation Base of Intelligent network Xiangtan411105 China Xiangtan University Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan411105 China Xiangtan University School of Mathematics and Compulational Science Xiangtan China Jinan University College of Information Science and Technology Guangzhou510632 China

Driven by the increasing demands of vehicular tasks, edge offloading has emerged as a promising paradigm to enhance quality of experience (QoE) in Internet of Vehicles (IoV) networks. This approach enables vehicles to offload computation-intensive tasks to edge servers, resulting in reduced computation delays and lower energy consumption. However, traditional binary offloading limits the efficiency of edge offloading. To address this gap, we propose a partial offloading strategy that jointly optimizes the offloading ratio, computation, and communication resources in IoV. Recognizing the varying priorities of vehicular tasks regarding task delay and energy consumption, we formulate two distinct scenarios: one focused on minimizing delay and the other on minimizing energy consumption. Furthermore, we employ a reinforcement learning approach to establish a multi-dimensional joint optimization function by setting different objectives for each scenario. Based on this framework, we introduce a multi-state iteration deep deterministic policy gradient algorithm (SIDDPG), which effectively determines task partitioning and resource allocation. Simulation results demonstrate that the proposed algorithm outperforms benchmark schemes in terms of task delay and energy consumption. © 2002-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

AR-CNN: an attention ranking network for learning urban perception

引用

Science China(Information Sciences) 2022年第1期65卷 164-174页

作者： Zhetao LI Ziwen CHEN Wei-Shi ZHENG Sangyoon OH Kien NGUYEN Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan University School of Data and Computer Science Sun Yat-sen University Department of Computer and Information Engineering Ajou University Graduate School of Engineering Chiba University

An increasing number of deep learning methods is being applied to quantify the perception of urban environments, study the relationship between urban appearance and resident safety, and improve urban appearance. Most advanced methods extract image feature representations from street-level images through conventional visual computation algorithms or deep convolutional neural networks and then directly predict the results using features. Unfortunately, these methods take color and texture information together during processing. Color and texture are prime image features, and they affect human perception and judgment differently. We argue that color and texture should be operated differently; therefore, we formulate an end-to-end learning methodology to process input images according to color and texture information before inputting it into the neural network. The processed images and the original image constitute three input streams for the triad attention ranking convolutional neural network(AR-CNN) model proposed in this *** accordance with the aspects of color and texture, an improved attention mechanism in the convolution layer is proposed. Our objective is to obtain the scores of humans on urban appearance in accordance with the prediction results computed from pairwise comparisons generated by the AR-CNN model.

关键词： ranking network urban perception attribute learning attention network colour and texture

来源：评论

学校读者我要写书评

暂无评论

Task Offloading and Resource Allocation Based on Reinforcement Learning and Load Balancing in Vehicular networking

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Tian, Shujuan Xiang, Shuhuan Zhou, Ziqi Dai, Haipeng Yu, Enze Deng, Qingyong Xiangtan University Key Laboratory of Hunan Province for Internet of Things and Information Security Hunan International Scientific and Technological Cooperation Base of Intelligent network School of Computer Science and School of Cyberspace Security Xiangtan411105 China Nanjing University School of Computer Science and Technology Nanjing211189 China Guangxi Normal University Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guilin541004 China Guangxi Normal University Guangxi Key Lab of Multi-source Information Mining and Security Guilin541004 China

Due to limited on-board resources and the mobility characteristics of vehicles in a multi-access edge computing (MEC)-based vehicular network, efficient task offloading and resource allocation schemes are essential for achieving low-latency and low-energy consumption applications in the Internet of Vehicles (IoV). The spatial distribution of vehicles, influenced by various factors, leads to significant workload variations across MEC servers. In this paper, we address task offloading and resource allocation as a joint optimization problem and propose a Load-Balancing Deep Deterministic Policy Gradient (LBDDPG) algorithm to achieve optimal results. The joint optimization problem is modeled as a Markov Decision Process (MDP), enabling the LBDDPG algorithm to systematically address the challenges of workload imbalance and resource inefficiency. The algorithm incorporates a load optimization strategy to balance workload distribution across MEC servers, mitigating disparities caused by uneven vehicle distributions. The reward function is designed to account for both energy consumption and delay, ensuring an optimal trade-off between these critical factors. To enhance training efficiency, a noise-based exploration strategy is employed, preventing ineffective exploration during the early stages. Additionally, constraints such as computational capacity and latency thresholds are embedded to ensure the algorithm's practical applicability. Experimental results demonstrate that the proposed LBDDPG algorithm achieves faster convergence and superior performance in terms of energy consumption and latency compared to other reinforcement learning algorithms. © 1975-2011 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Learning Based on Transfer Learning and Label Correlation

引用

Computers, Materials & Continua 2019年第7期61卷 155-169页

作者： Kehua Yang Chaowei She Wei Zhang Jiqing Yao Shaosong Long College of Computer Science and Electronic Engineering and Key Laboratory for Embedded and Network Computing of Hunan Province Hunan UniversityChangsha410082China Oath Verizon Company ManhattanNew York10007USA

In recent years,multi-label learning has received a lot of ***,most of the existing methods only consider global label correlation or local label *** fact,on the one hand,both global and local label correlations can appear in real-world situation at same *** the other hand,we should not be limited to pairwise labels while ignoring the high-order label *** this paper,we propose a novel and effective method called GLLCBN for multi-label ***,we obtain the global label correlation by exploiting label semantic ***,we analyze the pairwise labels in the label space of the data set to acquire the local ***,we build the original version of the label dependency model by global and local label *** that,we use graph theory,probability theory and Bayesian networks to eliminate redundant dependency structure in the initial version model,so as to get the optimal label dependent ***,we obtain the feature extraction model by adjusting the Inception V3 model of convolution neural network and combine it with the GLLCBN model to achieve the multi-label *** experimental results show that our proposed model has better performance than other multi-label learning methods in performance evaluating.

关键词： Bayesian networks multi-label learning global and local label correlations transfer learning

来源：评论

学校读者我要写书评

暂无评论

keyphrase Generation Based on Self-Attention Mechanism

引用

Computers, Materials & Continua 2019年第8期61卷 569-581页

作者： Kehua Yang Yaodong Wang Wei Zhang Jiqing Yao Yuquan Le College of Computer Science and Electronic Engineering and Key Laboratory for Embedded and Network Computing of Hunan Province Hunan UniversityChangsha410082China Oath Verizon Company ManhattanNew York10007USA

keyphrase greatly provides summarized and valuable *** information can help us not only understand text semantics,but also organize and retrieve text content *** task of automatically generating it has received considerable attention in recent *** the previous studies,we can see many workable solutions for obtaining *** method is to divide the content to be summarized into multiple blocks of text,then we rank and select the most important *** disadvantage of this method is that it cannot identify keyphrase that does not include in the text,let alone get the real semantic meaning hidden in the *** approach uses recurrent neural networks to generate keyphrases from the semantic aspects of the text,but the inherently sequential nature precludes parallelization within training examples,and distances have limitations on context *** works have demonstrated the benefits of the self-attention mechanism,which can learn global text dependency features and can be *** by the above observation,we propose a keyphrase generation model,which is based entirely on the self-attention *** is an encoder-decoder model that can make up the above disadvantage *** addition,we also consider the semantic similarity between keyphrases,and add semantic similarity processing module into the *** proposed model,which is demonstrated by empirical analysis on five datasets,can achieve competitive performance compared to baseline methods.

关键词： keyphrase generation self-attention mechanism encoder-decoder framework

来源：评论

学校读者我要写书评

暂无评论

A Money Laundering Structure Detection Method Based on Incremental Transaction Analysis

A Money Laundering Structure Detection Method Based on Incre...

引用

Data Science and Information Technology (DSIT), International Conference on

作者： Yifei Meng Zhong Li Key Laboratory of Embedded System and Service Computing Ministry of Education National (Province-Ministry Joint) Collaborative Innovation Center for Financial Network Security Tongji University Shanghai China College of Information Science and Technology Donghua University Shanghai China

Money laundering is the process of legitimizing dirty money through complex transactions, posing a serious threat to a country’s financial stability and national security. Nowadays, with the prevalence of organized money laundering, launderers prefer to use intricate multi-hop laundering chains to transfer dirty money. Moreover, they engage in normal financial activities to disrupt detection by auditors. In response to these trends and challenges, we propose a novel unsupervised money laundering structure detection framework for the anti-money laundering field, called structure incremental expansion (SIE). Our framework consists of two main modules: 1) Initialization of suspicious structures, which adopts a control-limit based method to identify suspicious accounts exhibiting anomalous transaction behavior. These accounts will serve as the starting points for suspicious structure expansion. 2) Dynamic structure expansion, where we design three dynamic membership functions according to the Financial Action Task Force’s definitions of the three stages of money laundering evolution. Newly-added incremental transactions in the network will be assigned to appropriate expanding suspicious structures. We conduct extensive experiments on simulated and public financial networks. SIE exhibits desirable performance and scalability. We also provide a detailed case study, visualizing a complete money laundering structure detection process, demonstrating our method’s strong interpretability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Implicit privacy preservation:a framework based on data generation

引用

Security and Safety 2022年第1期1卷 166-183页

作者： Qing Yang Cheng Wang Teng Hu Xue Chen Changjun Jiang Key Laboratory of Embedded System and Service Computing(Tongji University) Ministry of EducationShanghai 201804China National(Province-Ministry Joint)Collaborative Innovation Center for Financial Network Security Tongji UniversityShanghai 201804China

This paper addresses a special and imperceptible class of privacy,called implicit *** contrast to traditional(explicit)privacy,implicit privacy has two essential properties:(1)It is not initially de ned as a privacy attribute;(2)it is strongly associated with privacy *** other words,attackers could utilize it to infer privacy attributes with a certain probability,indirectly resulting in the disclosure of private *** deal with the implicit privacy disclosure problem,we give a measurable de nition of implicit privacy,and propose an ex-ante implicit privacy-preserving framework based on data generation,called *** framework consists of an implicit privacy detection module and an implicit privacy protection *** former uses normalized mutual information to detect implicit privacy attributes that are strongly related to traditional privacy *** on the idea of data generation,the latter equips the Generative Adversarial network(GAN)framework with an additional discriminator,which is used to eliminate the association between traditional privacy attributes and implicit *** elaborate a theoretical analysis for the convergence of the *** demonstrate that with the learned generator,IMPOSTER can alleviate the disclosure of implicit privacy while maintaining good data utility.

关键词： Privacy preservation Implicit privacy Generative adversarial network Data utility Data generation

来源：评论

学校读者我要写书评

暂无评论

CenterPicker:An Automated Cryo-EM Single-Particle Picking Method Based on Center Point Detection

引用

Journal of Cyber Security 2022年第2期4卷 65-77页

作者： Jianquan Ouyang Jinling Wang Yaowu Wang Tianming Liu Key Laboratory of Intelligent Computing Information Processing Ministry of EducationComputer Science College of Xiangtan UniversityXiangtanHunan Province411100China Department of Computer Science the University of GeorgiaAthensGeorgiaUSA

Cryo-electron microscopy(cryo-EM)has become one of the mainstream techniques for determining the structures of proteins andmacromolecular complexes,with prospects for development and *** must select hundreds of thousands of particles from micrographs to acquire the database for single-particle cryo-EM ***,existing particle picking methods cannot ensure that the particles are in the center of the bounding box because the signal-to-noise ratio(SNR)of micrographs is extremely low,thereby directly affecting the efficiency and accuracy of 3D *** propose an automated particle-picking method(CenterPicker)based on particle center point detection to automatically select a large number of high-quality particles from low signal-to-noise,low-contrast refrigerated microscopy *** method uses a fully convolutional neural network to generate a keypoint *** heatmap value represents the probability that a micrograph pixel belongs to a particle center *** can process images of any size and can directly predict the center point and size of the *** network implements multiscale feature fusion and introduces an attention mechanism to improve the feature fusion part to obtain more accurate selection *** have conducted a detailed evaluation of CenterPicker on a range of datasets,and results indicate that it excels in single-particle picking tasks.

关键词： Cryo-electron microscope deep learning particle picking object detection

来源：评论

学校读者我要写书评

暂无评论

ASDIA: An Adversarial Sample to Preserve Privacy Program in Federated Learning

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Tian, Shujuan Tan, Yi Wang, Han Liu, Haolin Li, Zhetao Xiangtan University School of Computer Science School of Cyberspace Security Xiangtan China Xiangtan University Hunan International Scientific and Technological Cooperation Base of Intelligent network Xiangtan411105 China Xiangtan University Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan411105 China Department of Electrical Engineering and Computer Science University of Kansas 1520 W 15th St LawrenceKS United States Jinan University College of Information Science and Technology Guangzhou510632 China

Federated learning enables training across multiple entities while ensuring data security and the effectiveness of knowledge dissemination. Despite its benefits, it remains susceptible to privacy breaches by both external and internal adversaries, who may exploit data or model parameters to glean sensitive participant information or disrupt the training process, thus compromising participant privacy and security. This paper proposes a novel methodology, Adversarial Samples for Defense Inference Attack (ASDIA), aimed at dual protection of data privacy and model robustness within federated learning through adversarial samples and gradient reconstruction. ASDIA includes gradient processing approach before uploading: initially identifying privacy-sensitive gradient, followed by the injection of well-calibrated noise to these gradients. This method not only obfuscates the adversary's classification demarcations but also aids in model performance recovery, all the while maintaining computational efficiency. ASDIA reduces the efficacy of attacks to near-random guessing levels and shows better balance between the model utility and privacy protection compared to the most advanced defense strategies. Additionally, regarding model performance, ASDIA proves its merit across diverse datasets under overfitting and non-overfitting scenarios. © 2004-2012 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：