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

arXiv 2025年

作者： Hao, Jiaxiong Huang, Yunqing Yi, Nianyu Yin, Peimeng Hunan Key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China National Center for Applied Mathematics in Hunan Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan University Hunan Xiangtan411105 China Department of Mathematical Sciences University of Texas at El Paso El PasoTX79968 United States

In this paper, we present a novel enhancement to the conventional hr-adaptive finite element methods for parabolic equations, integrating traditional h-adaptive and r-adaptive methods via neural networks. A major challenge in hr-adaptive finite element methods lies in projecting the previous step’s finite element solution onto the updated mesh. This projection depends on the new mesh and must be recomputed for each adaptive iteration. To address this, we introduce a neural network to construct a mesh-free surrogate of the previous step finite element solution. Since the neural network is mesh-free, it only requires training once per time step, with its parameters initialized using the optimizer from the previous time step. This approach effectively overcomes the interpolation challenges associated with non-nested meshes in computation, making node insertion and movement more convenient and efficient. The new algorithm also emphasizes SIZING and GENERATE, allowing each refinement to roughly double the number of mesh nodes of the previous iteration and then redistribute them to form a new mesh that effectively captures the singularities. It significantly reduces the time required for repeated refinement and achieves the desired accuracy in no more than seven space-adaptive iterations per time step. Numerical experiments confirm the efficiency of the proposed algorithm in capturing dynamic changes of *** Codes 92B20, 65M60, 35K57 © 2025, CC BY.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

Rate-Splitting Multiple Access Enabled Green Probabilistic Semantic Communication over Wireless networks

IEEE Transactions on Green Communications and Networking

引用

IEEE Transactions on Green Communications and networking 2025年

作者： Xu, Ruopeng Yang, Zhaohui Mao, Yijie Huang, Chongwen Yang, Qianqian Xu, Lexi Xu, Wei Zhang, Zhaoyang Zhejiang University College of Information Science and Electronic Engineering China Hangzhou310027 China ShanghaiTech University School of Information Science and Technology Shanghai201210 China Zhejiang Prov. Key Lab. of Multi-Modal Communication Networks and Intelligent Information Processing Hangzhou310027 China China United Network Communications Corporation Research Institute Beijing100048 China Southeast University National Mobile Communications Research Laboratory Nanjing211189 China

In this paper, we propose a multi-user green probabilistic semantic communication (PSC) system for semantic communication (SemCom) facilitated by probabilistic knowledge graphs (PKGs), which are knowledge graphs (KGs) integrated with probability to represent semantic information. In the considered model, semantic information of different users is represented by PKGs. On this basis, we design a semantic compression model for multi-user downlink task-oriented SemCom, utilizing the semantic compression ratio (SCR) as a parameter to connect the computation and communication processes of information transmission. Utilizing rate-splitting multiple access (RSMA) technology, the transmitted messages are splitted into shared and private ones. Considering the limited wireless resources and constraint in semantic communication, an optimization problem with the goal of minimizing system energy consumption comprehensively considering the computation and communication process is formulated. In order to address the optimization problem, we propose an alternating optimization algorithm that tackles sub-problems of power allocation and beamforming design with successive convex approximation (SCA) method, semantic compression ratio optimization with variable substitution method, and computation capacity allocation with obtaining closed-form optimal solution. Simulation results verify the effectiveness of the proposed algorithm. © 2017 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Access Control with Privacy-Preserving Data Retrieval for Cloud-Assisted IoV

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Li, Wenchao Xia, Chunhe Yang, Simiao Wang, Kangming Huang, Guotao Huang, Luqi Guo, Fuchun Susilo, Willy Wang, Tianbo Beihang University School of Cyber Science and Technology Beijing100191 China University of Wollongong School of Computing and Information Technology Institute of Cybersecurity and Cryptology WollongongNSW2522 Australia Beihang University Beijing Key Laboratory of Network Technology Beijing100191 China Guangxi Normal University Guangxi Collab. Innovation Center of Multi-source Information Integration and Intelligent Processing Guilin541004 China Beihang University Sino-French Engineer School Beijing100191 China Beihang University Computer Science and Engineering School Beijing100191 China

In addition to the autonomous driving technology of single vehicles, the inter-group control algorithm serving the data sharing of multi-vehicle cooperative driving has also attracted widespread attention. To ensure secure communication, many encryption schemes have been proposed to protect the interaction data between vehicles. Nevertheless, traditional public key encryption schemes hinder the sharing of encrypted data. Based on the premise of ensuring the confidentiality of encrypted information, in order to facilitate efficient data sharing, conduct data searches across extensive cloud-based datasets, and authorize access under specified conditions, we introduce Fine-Grained Access Control with Privacy-Preserving Data Retrieval (FGAC-PPDR) for the Internet of Vehicles. This scheme offers a secure, flexible, and privacy-centric approach to data sharing for groups of vehicles in the IoV. Our proposed scheme enables encrypted data to be retrieved at the group level by the cloud server, and prevents vehicles outside the group from performing equality tests on the ciphertext. Furthermore, the data owner can create an authorization token with defined conditions to specify how the data is shared. During the process of data search and sharing, intensive computing tasks are undertaken by cloud servers with abundant computational resources. We also demonstrate that our scheme is secure against chosen ciphertext attacks (CCA). Finally, we provide security and performance analyses that verify the feasibility and effectiveness of our proposal. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Lossless and Universal 3D Object Encryption with Differentiated Visual Effects upon Decryption: A Novel Paradigm

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Zhao, Ruoyu Zhang, Yushu Mou, Jun Puech, William Weng, Jian School of Computing and Artificial Intelligence Jiangxi University of Finance and Economics Nanchang330013 China Jiangxi Provincial Key Laboratory of Multimedia Intelligent Processing Nanchang330013 China School of Information Science and Engineering Dalian Polytechnic University Dalian116000 China Centre National de la Recherche Scientifique Université de Montpellier Montpellier34095 France College of Information Science and Technology Jinan University Guangzhou510632 China

A recently proposed 3D object encryption scheme enables hierarchical decryption, allowing a single encryption to display varied visual effects upon decryption. This has potential applications in complex scenarios where 3D objects require access at different security levels. However, it has two main issues: lossless decryption is not possible due to precision loss from the IEEE 754 standard, and it is customized for a specific AES algorithm, limiting support for others. Motivated by this, a novel paradigm for 3D object encryption with differentiated visual effects upon decryption is proposed. In this paradigm, the precision loss is preserved within the 3D encrypted object, allowing the 3D object after fully decrypting to be identical to the original, and thus it is lossless. Meanwhile, the data to be encrypted is reduced to three blocks, which are generalized bitstreams. Bitstream encryption algorithms that do not produce ciphertext expansion can be applied, and it operates independently of the other components in the paradigm, making it universal. Finally, a prototype of this paradigm is constructed, using the same encryption algorithm as in the previous scheme for comparative experiments. Two 3D object datasets are used to conduct the experiments and results demonstrate that it achieves lossless decryption and has a time advantage, while also undergoing security analysis and verification against smoothing attacks to confirm the security. © 2025 IEEE. All rights reserved,

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

MRLATO: An Adaptive Task Offloading Mechanism Based on Meta Reinforcement Learning in Edge computing Environment

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Zhang, Peiying Liu, Jiamin Guizani, Maher Wang, Jian Kumar, Neeraj Tan, Lizhuang Qingdao Institute of Software College of Computer Science and Technology Qingdao266580 China Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software Qingdao266580 China Ministry of Education Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Jinan250014 China University of Texas Arlington Computer Science and Engineering Department TX United States College of Science Qingdao266580 China Thapar University Department of Computer Science and Engineering Patiala147004 India Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan250014 China

Traditional cloud computing models struggle to meet the requirements of latency-sensitive applications when processing large amounts of data. As a solution, Multi-access Edge computing (MEC) extends computing resources to the edge of the network to reduce processing delays and improve user experience. However, in dynamically changing edge computing environments, effective decision making on whether to offload tasks to edge servers remains a core challenge. For this purpose, we propose MRLATO, an adaptive task offloading mechanism based on Meta Reinforcement Learning (MRL), which exploits a large amount of a priori knowledge of different tasks to achieve fast adaptation. The task offloading process is modelled as multiple Markov Decision Processes (MDPs) and solved using a Sequence to Sequence (Seq2Seq) neural network integrating multi-head attention and recursive task sequencing. It is shown by the experimental results that the proposed method has the lowest latency in all experimental settings and the convergence efficiency is improved by 14.06% compared to the traditional Deep Reinforcement Learning (DRL) algorithm. This research fully demonstrates the significant benefits of the deep integration of MRL with the edge computing domain, providing new optimisation ideas for task offloading decisions. © 1967-2012 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

Design of observer-based discrete repetitive-control system based on 2D model

引用

Journal of Central South University 2014年第11期21卷 4236-4243页

作者：王昭鸿易灵芝兰永红陈才学 Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education (College of Information Engineering Xiangtan University)

A discrete observer-based repetitive control(RC) design method for a linear system with uncertainties was presented based on two-dimensional(2D) system theory. Firstly, a 2D discrete model was established to describe both the control behavior within a repetition period and the learning process taking place between periods. Next, by converting the designing problem of repetitive controller into one of the feedback gains of reconstructed variables, the stable condition was obtained through linear matrix inequality(LMI) and also the gain coefficient of repetitive system. Numerical simulation shows an exceptional feasibility of this proposal with remarkable robustness and tracking speed.

关键词： state observer two-dimensional discrete system repetitive control linear matrix inequality

来源：评论

学校读者我要写书评

暂无评论

Relative influence maximization in competitive social networks

引用

Science China(information Sciences) 2017年第10期60卷 252-254页

作者： Dingda YANG Xiangwen LIAO Huawei SHEN Xueqi CHENG Guolong CHEN College of Physics and Information Engineering Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Institute of Computing Technology Chinese Academy of Sciences

In many realistic scenarios,such as political election and viral marketing,two opposite opinions,i.e.,positive opinion and negative opinion,spread simultaneously in the same social networks[1,2].Consequently,to achiev... 详细信息

关键词： net RIM Relative influence maximization in competitive social networks Figure

来源：评论

学校读者我要写书评

暂无评论

Satisfaction-Aware Incentive Scheme for Federated Learning in Industrial Metaverse: DRL-Based Stackbelberg Game Approach

arXiv

引用

arXiv 2025年

作者： Li, Xiaohuan Qin, Shaowen Tang, Xin Kang, Jiawen Ye, Jin Zhao, Zhonghua Niyato, Dusit Guangxi University Key Laboratory of Intelligent Networking and Scenario System School of Information and Communication Guilin University of Electronic Technology Guilin541004 China Nanning530001 China School of Automation Guangdong University of Technology Guangzhou510006 China Guangxi Key Laboratory of Multimedia Communications and Network Technology Nanning530000 China School of Computer and Electronic Information Guangxi University Nanning530000 China College of Computing and Data Science Nanyang Technological University Singapore

Industrial Metaverse leverages the Industrial Internet of Things (IIoT) to integrate data from diverse devices, employing federated learning and meta-computing to train models in a distributed manner while ensuring data privacy. Achieving an immersive experience for industrial Metaverse necessitates maintaining a balance between model quality and training latency. Consequently, a primary challenge in federated learning tasks is optimizing overall system performance by balancing model quality and training latency. This paper designs a satisfaction function that accounts for data size, Age of information (AoI), and training latency. Additionally, the satisfaction function is incorporated into the utility functions to incentivize node participation in model training. We model the utility functions of servers and nodes as a two-stage Stackelberg game and employ a deep reinforcement learning approach to learn the Stackelberg equilibrium. This approach ensures balanced rewards and enhances the applicability of the incentive scheme for industrial Metaverse. Simulation results demonstrate that, under the same budget constraints, the proposed incentive scheme improves at least 23.7% utility compared to existing schemes without compromising model accuracy. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

BSDSGANet: Bidirectional Skip-stored Dual-Stream Gated Attention network for multivariate time series classification

引用

Knowledge-Based Systems 2025年 318卷

作者： Yi, Yugen Zhao, Panpan Sheng, Hui Liu, Min Li, Shicheng Dai, Jiangyan Kong, Jun Qiao, Shaojie School of Software Research Center for Management Science and Engineering Jiangxi Provincial Key Laboratory of Intelligent Information Processing and Affective Computing Jiangxi Normal University Nanchang330022 China School of Artificial Intelligence and Big Data Jiangxi University of Technology Nanchang330098 China School of Computer Engineering Weifang University Weifang261061 China College of Information Science and Technology Northeast Normal University Changchun130117 China School of Software Engineering Chengdu University of Information Technology Chengdu610225 China

Echo State networks (ESNs) are popular in Time Series Classification (TSC) due to their high-dimensional stochastic projections. However, due to the echo state at the current step is susceptible to the preceding step, the existing ESNs struggle to capture the long-term temporal dependencies. Furthermore, most of them only employ the unidirectional storage to capture the sequence information, which fails to fully consider the impact of the past and future moments simultaneously. To address these issues, we propose an advanced method called Bidirectional Skip-stored Dual-Stream Gated Attention network (BSDSGANet) for Multivariate Time Series Classification (MTSC). Specifically, to roundly exploit the sequence information, a Bidirectional Skip-Stored Encoder (BSSE) is designed to enrich the temporal context by integrating past and future information. Then, a Dual-Stream Gated Attention Learner (DSGAL) mechanism is incroporated, which employs a Gated Recurrent Self-Attention (GRSA) module to learn the long-term dependencies and variable relationships. Meanwhile, a Multi-Scale Gated Attention (MSGA) module is developed to extract more important features from multiple scales. Extensive experiments conducted on eighteen benchmark MTSC datasets show that BSDSGANet outperforms five traditional methods and twelve deep learning models. © 2025 Elsevier B.V.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Vector Field-Guided Circumnavigation for an Unmanned Surface Vehicle With Boundary and Obstacle Constraints

引用

IEEE Transactions on Emerging Topics in computing 2025年

作者： Wu, Nailong Wang, Jigang Wang, Yueying He, Shuping Donghua University College of Information Science and Technology Shanghai201620 China Donghua University Engineering Research Center of Digitized Textile & Apparel Technology Ministry of Education Shanghai201620 China Shanghai University School of Mechatronic Engineering and Automation Shanghai200444 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Electrical Engineering and Automation Hefei230601 China

This article aims to tackle the challenge of rapid target circumnavigation by unmanned surface vehicles (USVs) under boundary and obstacle constraints through leveraging an emerging computing architecture specifically tailored for unmanned systems. Owing to the underactuation of USV dynamic systems and the presence of various time-varying surface disturbances, attaining rapid and accurate position control along with maneuverability poses a significant challenge to USVs. Therefore, when an USV maneuvers around a target in a confined search area with obstacles, it is essential for the guidance law to consider collision risks and environmental disturbances. This paper proposes a modified Lyapunov vector field with heading deviation compensation to circle the target in complex search regions. The vector field is designed to increase the radial velocity of the USV and accelerate convergence towards the target circle during the pursuit phase. By combining the proposed Lyapunov vector field with a boundary vector field, the USV can swiftly avoid boundaries and dynamic obstacles and then continue circling the target. The proposed computing architecture extends the application scope of the target circumnavigation to practical water surface environments, which is validated by extensive simulations and rigorous experiments. © 2025 IEEE.

关键词： Unmanned surface vehicles

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：